1FIND_NEXT_BEST_NODE(9)    Memory Management in Linux    FIND_NEXT_BEST_NODE(9)
2
3
4

NAME

6       find_next_best_node - find the next node that should appear in a given
7       node's fallback list
8

SYNOPSIS

10       int find_next_best_node(int node, nodemask_t * used_node_mask);
11

ARGUMENTS

13       node
14           node whose fallback list we're appending
15
16       used_node_mask
17           nodemask_t of already used nodes
18

DESCRIPTION

20       We use a number of factors to determine which is the next node that
21       should appear on a given node's fallback list. The node should not have
22       appeared already in node's fallback list, and it should be the next
23       closest node according to the distance array (which contains arbitrary
24       distance values from each node to each node in the system), and should
25       also prefer nodes with no CPUs, since presumably they'll have very
26       little allocation pressure on them otherwise. It returns -1 if no node
27       is found.
28

30Kernel Hackers Manual 3.10         June 2019            FIND_NEXT_BEST_NODE(9)
Impressum