Home
last modified time | relevance | path

Searched refs:max_node (Results 1 – 4 of 4) sorted by relevance

/linux/tools/testing/memblock/tests/
H A Dalloc_exact_nid_api.c261 struct memblock_region *max_node = &memblock.memory.regions[5]; in alloc_exact_nid_top_down_numa_no_overlap_low_check() local
271 max_addr = region_end(max_node); in alloc_exact_nid_top_down_numa_no_overlap_low_check()
532 struct memblock_region *max_node = &memblock.memory.regions[5]; in alloc_exact_nid_bottom_up_numa_no_overlap_low_check() local
542 max_addr = region_end(max_node); in alloc_exact_nid_bottom_up_numa_no_overlap_low_check()
755 struct memblock_region *max_node = &memblock.memory.regions[5]; in alloc_exact_nid_numa_no_overlap_high_generic_check() local
765 max_addr = region_end(max_node); in alloc_exact_nid_numa_no_overlap_high_generic_check()
H A Dalloc_nid_api.c1696 struct memblock_region *max_node = &memblock.memory.regions[5]; in alloc_nid_top_down_numa_no_overlap_low_check() local
1706 max_addr = region_end(max_node); in alloc_nid_top_down_numa_no_overlap_low_check()
1716 ASSERT_LE(max_node->base, new_rgn->base); in alloc_nid_top_down_numa_no_overlap_low_check()
1752 struct memblock_region *max_node = &memblock.memory.regions[5]; in alloc_nid_top_down_numa_no_overlap_high_check() local
1762 max_addr = region_end(max_node); in alloc_nid_top_down_numa_no_overlap_high_check()
1772 ASSERT_LE(max_node->base, new_rgn->base); in alloc_nid_top_down_numa_no_overlap_high_check()
2244 struct memblock_region *max_node = &memblock.memory.regions[5]; in alloc_nid_bottom_up_numa_no_overlap_low_check() local
2254 max_addr = region_end(max_node); in alloc_nid_bottom_up_numa_no_overlap_low_check()
2300 struct memblock_region *max_node = &memblock.memory.regions[5]; in alloc_nid_bottom_up_numa_no_overlap_high_check() local
2310 max_addr = region_end(max_node); in alloc_nid_bottom_up_numa_no_overlap_high_check()
/linux/tools/testing/selftests/mm/
H A Dksm_tests.c470 int i, max_node = numa_max_node(); in get_next_mem_node() local
472 for (i = node + 1; i <= max_node + node; i++) { in get_next_mem_node()
473 mem_node = i % (max_node + 1); in get_next_mem_node()
/linux/kernel/sched/
H A Dfair.c2812 int node, max_node = nid; in preferred_group_nid() local
2820 max_node = node; in preferred_group_nid()
2823 return max_node; in preferred_group_nid()