Searched refs:find_next_best_node (Results 1 – 3 of 3) sorted by relevance
1203 extern int find_next_best_node(int node, nodemask_t *used_node_mask);1212 static inline int find_next_best_node(int node, nodemask_t *used_node_mask) in find_next_best_node() function
442 * find_next_best_node, use 'used' nodemask as a skip list. in establish_demotion_targets() 455 target = find_next_best_node(node, &tier_nodes); in establish_demotion_targets()
5486 * find_next_best_node - find the next node that should appear in a given node's fallback list5500 int find_next_best_node(int node, nodemask_t *used_node_mask) in __build_all_zonelists() 5600 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) { in build_all_zonelists() 5311 int find_next_best_node(int node, nodemask_t *used_node_mask) find_next_best_node() function