Lines Matching refs:node
152 static u8 get_il_weight(int node) in get_il_weight() argument
160 weight = table ? table[node] : 1; in get_il_weight()
176 int numa_nearest_node(int node, unsigned int state) in numa_nearest_node() argument
183 if (node == NUMA_NO_NODE || node_state(node, state)) in numa_nearest_node()
184 return node; in numa_nearest_node()
186 min_node = node; in numa_nearest_node()
188 dist = node_distance(node, n); in numa_nearest_node()
214 int nearest_node_nodemask(int node, nodemask_t *mask) in nearest_node_nodemask() argument
219 dist = node_distance(node, n); in nearest_node_nodemask()
233 int node; in get_task_policy() local
238 node = numa_node_id(); in get_task_policy()
239 if (node != NUMA_NO_NODE) { in get_task_policy()
240 pol = &preferred_node_policy[node]; in get_task_policy()
1914 unsigned int node; in weighted_interleave_nodes() local
1920 node = current->il_prev; in weighted_interleave_nodes()
1921 if (!current->il_weight || !node_isset(node, policy->nodes)) { in weighted_interleave_nodes()
1922 node = next_node_in(node, policy->nodes); in weighted_interleave_nodes()
1925 if (node == MAX_NUMNODES) in weighted_interleave_nodes()
1926 return node; in weighted_interleave_nodes()
1927 current->il_prev = node; in weighted_interleave_nodes()
1928 current->il_weight = get_il_weight(node); in weighted_interleave_nodes()
1931 return node; in weighted_interleave_nodes()
1958 int node = numa_mem_id(); in mempolicy_slab_node() local
1961 return node; in mempolicy_slab_node()
1965 return node; in mempolicy_slab_node()
1988 zonelist = &NODE_DATA(node)->node_zonelists[ZONELIST_FALLBACK]; in mempolicy_slab_node()
1991 return zonelist_zone(z) ? zonelist_node_idx(z) : node; in mempolicy_slab_node()
1994 return node; in mempolicy_slab_node()
2455 int nnodes, node; in alloc_pages_bulk_weighted_interleave() local
2475 node = me->il_prev; in alloc_pages_bulk_weighted_interleave()
2477 if (weight && node_isset(node, nodes)) { in alloc_pages_bulk_weighted_interleave()
2479 nr_allocated = __alloc_pages_bulk(gfp, node, NULL, node_pages, in alloc_pages_bulk_weighted_interleave()
2493 prev_node = node; in alloc_pages_bulk_weighted_interleave()
2507 for_each_node_mask(node, nodes) { in alloc_pages_bulk_weighted_interleave()
2508 if (!weights[node]) in alloc_pages_bulk_weighted_interleave()
2509 weights[node] = 1; in alloc_pages_bulk_weighted_interleave()
2510 weight_total += weights[node]; in alloc_pages_bulk_weighted_interleave()
2525 node = next_node_in(prev_node, nodes); in alloc_pages_bulk_weighted_interleave()
2526 weight = weights[node]; in alloc_pages_bulk_weighted_interleave()
2535 resume_node = node; in alloc_pages_bulk_weighted_interleave()
2542 nr_allocated = __alloc_pages_bulk(gfp, node, NULL, node_pages, in alloc_pages_bulk_weighted_interleave()
2548 prev_node = node; in alloc_pages_bulk_weighted_interleave()
2911 static void sp_node_init(struct sp_node *node, unsigned long start, in sp_node_init() argument
2914 node->start = start; in sp_node_init()
2915 node->end = end; in sp_node_init()
2916 node->policy = pol; in sp_node_init()