Home
last modified time | relevance | path

Searched refs:min_node (Results 1 – 3 of 3) sorted by relevance

/linux/tools/testing/memblock/tests/
H A Dalloc_exact_nid_api.c260 struct memblock_region *min_node = &memblock.memory.regions[2]; in alloc_exact_nid_top_down_numa_no_overlap_low_check() local
270 min_addr = min_node->base; in alloc_exact_nid_top_down_numa_no_overlap_low_check()
531 struct memblock_region *min_node = &memblock.memory.regions[2]; in alloc_exact_nid_bottom_up_numa_no_overlap_low_check() local
541 min_addr = min_node->base; in alloc_exact_nid_bottom_up_numa_no_overlap_low_check()
754 struct memblock_region *min_node = &memblock.memory.regions[2]; in alloc_exact_nid_numa_no_overlap_high_generic_check() local
764 min_addr = min_node->base; in alloc_exact_nid_numa_no_overlap_high_generic_check()
H A Dalloc_nid_api.c1695 struct memblock_region *min_node = &memblock.memory.regions[2]; in alloc_nid_top_down_numa_no_overlap_low_check() local
1705 min_addr = min_node->base; in alloc_nid_top_down_numa_no_overlap_low_check()
1751 struct memblock_region *min_node = &memblock.memory.regions[2]; in alloc_nid_top_down_numa_no_overlap_high_check() local
1761 min_addr = min_node->base; in alloc_nid_top_down_numa_no_overlap_high_check()
2243 struct memblock_region *min_node = &memblock.memory.regions[2]; in alloc_nid_bottom_up_numa_no_overlap_low_check() local
2253 min_addr = min_node->base; in alloc_nid_bottom_up_numa_no_overlap_low_check()
2264 ASSERT_LE(region_end(new_rgn), region_end(min_node)); in alloc_nid_bottom_up_numa_no_overlap_low_check()
2299 struct memblock_region *min_node = &memblock.memory.regions[2]; in alloc_nid_bottom_up_numa_no_overlap_high_check() local
2309 min_addr = min_node->base; in alloc_nid_bottom_up_numa_no_overlap_high_check()
2320 ASSERT_LE(region_end(new_rgn), region_end(min_node)); in alloc_nid_bottom_up_numa_no_overlap_high_check()
/linux/mm/
H A Dmempolicy.c178 int min_dist = INT_MAX, dist, n, min_node; in numa_nearest_node() local
186 min_node = node; in numa_nearest_node()
191 min_node = n; in numa_nearest_node()
195 return min_node; in numa_nearest_node()