17 	ASSERT_NE(memblock.memory.regions, NULL);  in memblock_initialization_check()
22 	ASSERT_NE(memblock.reserved.regions, NULL);  in memblock_initialization_check()
37  * and size to the collection of available memory regions (memblock.memory).
45 	rgn = &memblock.memory.regions[0];  in memblock_add_simple_check()
70  * NUMA node and memory flags to the collection of available memory regions.
78 	rgn = &memblock.memory.regions[0];  in memblock_add_node_simple_check()
114  * available memory regions (memblock.memory). The total size and
121 	rgn1 = &memblock.memory.regions[0];  in memblock_add_disjoint_check()
122 	rgn2 = &memblock.memory.regions[1];  in memblock_add_disjoint_check()
167  * and has size of two regions minus their intersection. The total size of
175 	rgn = &memblock.memory.regions[0];  in memblock_add_overlap_top_check()
219  * and has size of two regions minus their intersection. The total size of
227 	rgn = &memblock.memory.regions[0];  in memblock_add_overlap_bottom_check()
276 	rgn = &memblock.memory.regions[0];  in memblock_add_within_check()
347 	rgn = &memblock.memory.regions[0];  in memblock_add_between_check()
401 	rgn = &memblock.memory.regions[0];  in memblock_add_near_max_check()
449  * and size as reserved and to the collection of reserved memory regions
457 	rgn =  &memblock.reserved.regions[0];  in memblock_reserve_simple_check()
484  * Expect to add two entries to the collection of reserved memory regions
492 	rgn1 = &memblock.reserved.regions[0];  in memblock_reserve_disjoint_check()
493 	rgn2 = &memblock.reserved.regions[1];  in memblock_reserve_disjoint_check()
539  * has size of two regions minus their intersection. The total size of the
547 	rgn = &memblock.reserved.regions[0];  in memblock_reserve_overlap_top_check()
592  * has size of two regions minus their intersection. The total size of the
600 	rgn = &memblock.reserved.regions[0];  in memblock_reserve_overlap_bottom_check()
651 	rgn = &memblock.reserved.regions[0];  in memblock_reserve_within_check()
723 	rgn = &memblock.reserved.regions[0];  in memblock_reserve_between_check()
777 	rgn = &memblock.reserved.regions[0];  in memblock_reserve_near_max_check()
824  * available memory regions. By "removing" a region we mean overwriting it
842 	rgn = &memblock.memory.regions[0];  in memblock_remove_simple_check()
885  * Expect the array, regions counter and total size to not be modified.
891 	rgn = &memblock.memory.regions[0];  in memblock_remove_absent_check()
935  * Expect that only the intersection of both regions is removed from the
936  * available memory pool. The regions counter and total size are updated.
943 	rgn = &memblock.memory.regions[0];  in memblock_remove_overlap_top_check()
989  * Expect that only the intersection of both regions is removed from the
990  * available memory pool. The regions counter and total size are updated.
997 	rgn = &memblock.memory.regions[0];  in memblock_remove_overlap_bottom_check()
1051 	rgn1 = &memblock.memory.regions[0];  in memblock_remove_within_check()
1052 	rgn2 = &memblock.memory.regions[1];  in memblock_remove_within_check()
1089  * available memory regions when r1 is the only available region.
1098 	rgn = &memblock.memory.regions[0];  in memblock_remove_only_region_check()
1124  * memory regions when r2 extends past PHYS_ADDR_MAX:
1142 	rgn = &memblock.memory.regions[0];  in memblock_remove_near_max_check()
1175  * regions r1 and r2:
1193 	rgn1 = &memblock.memory.regions[0];  in memblock_remove_overlap_two_check()
1194 	rgn2 = &memblock.memory.regions[1];  in memblock_remove_overlap_two_check()
1268  * Expect to reserve two memory regions and then erase r1 region with the
1275 	rgn = &memblock.reserved.regions[0];  in memblock_free_simple_check()
1318  * The array, regions counter and total size are not modified.
1324 	rgn = &memblock.reserved.regions[0];  in memblock_free_absent_check()
1368  * Expect that only the intersection of both regions is freed. The
1369  * regions counter and total size are updated.
1376 	rgn = &memblock.reserved.regions[0];  in memblock_free_overlap_top_check()
1417  * Expect that only the intersection of both regions is freed. The
1418  * regions counter and total size are updated.
1425 	rgn = &memblock.reserved.regions[0];  in memblock_free_overlap_bottom_check()
1479 	rgn1 = &memblock.reserved.regions[0];  in memblock_free_within_check()
1480 	rgn2 = &memblock.reserved.regions[1];  in memblock_free_within_check()
1526 	rgn = &memblock.reserved.regions[0];  in memblock_free_only_region_check()
1569 	rgn = &memblock.reserved.regions[0];  in memblock_free_near_max_check()
1602  * existing reserved regions r1 and r2:
1620 	rgn1 = &memblock.reserved.regions[0];  in memblock_free_overlap_two_check()
1621 	rgn2 = &memblock.reserved.regions[1];  in memblock_free_overlap_two_check()
1737 	rgn = &memblock.memory.regions[0];  in memblock_trim_memory_aligned_check()
1761  * A test that tries to trim memory when there are two available regions, r1 and
1783 	rgn = &memblock.memory.regions[0];  in memblock_trim_memory_too_small_check()
1812  * A test that tries to trim memory when there are two available regions, r1 and
1837 	rgn1 = &memblock.memory.regions[0];  in memblock_trim_memory_unaligned_base_check()
1838 	rgn2 = &memblock.memory.regions[1];  in memblock_trim_memory_unaligned_base_check()
1873  * A test that tries to trim memory when there are two available regions, r1 and
1898 	rgn1 = &memblock.memory.regions[0];  in memblock_trim_memory_unaligned_end_check()
1899 	rgn2 = &memblock.memory.regions[1];  in memblock_trim_memory_unaligned_end_check()