Home
last modified time | relevance | path

Searched refs:used_node_mask (Results 1 - 3 of 3) sorted by relevance

/kernel/linux/linux-6.6/mm/
H A Dinternal.h918 extern int find_next_best_node(int node, nodemask_t *used_node_mask);
925 static inline int find_next_best_node(int node, nodemask_t *used_node_mask) in find_next_best_node() argument
H A Dpage_alloc.c4902 * @used_node_mask: nodemask_t of already used nodes
4914 int find_next_best_node(int node, nodemask_t *used_node_mask) in find_next_best_node() argument
4921 if (!node_isset(node, *used_node_mask)) { in find_next_best_node()
4922 node_set(node, *used_node_mask); in find_next_best_node()
4929 if (node_isset(n, *used_node_mask)) in find_next_best_node()
4953 node_set(best_node, *used_node_mask); in find_next_best_node()
/kernel/linux/linux-5.10/mm/
H A Dpage_alloc.c5840 * @used_node_mask: nodemask_t of already used nodes
5852 static int find_next_best_node(int node, nodemask_t *used_node_mask) in find_next_best_node() argument
5859 if (!node_isset(node, *used_node_mask)) { in find_next_best_node()
5860 node_set(node, *used_node_mask); in find_next_best_node()
5867 if (node_isset(n, *used_node_mask)) in find_next_best_node()
5891 node_set(best_node, *used_node_mask); in find_next_best_node()

Completed in 22 milliseconds