Man page 9 : find_next_best_node

find_next_best_node - find the next node that should appear in a given nodeAqs fallback list

int find_next_best_node(int  node , nodemask_t *  used_node_mask );

node
    node whose fallback list weAqre appending

used_node_mask
    nodemask_t of already used nodes

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