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()
430  * memory.regions.
463 	orig_region = memblock.memory.regions;  in memblock_add_many_check()
493 	ASSERT_EQ(memblock.memory.regions[0].base, r.base);  in memblock_add_many_check()
494 	ASSERT_EQ(memblock.memory.regions[0].size, r.size);  in memblock_add_many_check()
505 	 * The current memory.regions is occupying a range of memory that  in memblock_add_many_check()
510 	memblock.memory.regions = orig_region;  in memblock_add_many_check()
542  * and size as reserved and to the collection of reserved memory regions
550 	rgn =  &memblock.reserved.regions[0];  in memblock_reserve_simple_check()
577  * Expect to add two entries to the collection of reserved memory regions
585 	rgn1 = &memblock.reserved.regions[0];  in memblock_reserve_disjoint_check()
586 	rgn2 = &memblock.reserved.regions[1];  in memblock_reserve_disjoint_check()
632  * has size of two regions minus their intersection. The total size of the
640 	rgn = &memblock.reserved.regions[0];  in memblock_reserve_overlap_top_check()
685  * has size of two regions minus their intersection. The total size of the
693 	rgn = &memblock.reserved.regions[0];  in memblock_reserve_overlap_bottom_check()
744 	rgn = &memblock.reserved.regions[0];  in memblock_reserve_within_check()
816 	rgn = &memblock.reserved.regions[0];  in memblock_reserve_between_check()
870 	rgn = &memblock.reserved.regions[0];  in memblock_reserve_near_max_check()
899  * reserved.regions.
932 	orig_region = memblock.reserved.regions;  in memblock_reserve_many_check()
938 	 * This is the memory region size used by the doubled reserved.regions,  in memblock_reserve_many_check()
946 	 * reserved.regions, and the used memory region will be reserved, so  in memblock_reserve_many_check()
960 	ASSERT_EQ(memblock.reserved.regions[0].base, r.base);  in memblock_reserve_many_check()
961 	ASSERT_EQ(memblock.reserved.regions[0].size, r.size);  in memblock_reserve_many_check()
972 	 * The current reserved.regions is occupying a range of memory that  in memblock_reserve_many_check()
977 	memblock.reserved.regions = orig_region;  in memblock_reserve_many_check()
1008  * available memory regions. By "removing" a region we mean overwriting it
1026 	rgn = &memblock.memory.regions[0];  in memblock_remove_simple_check()
1069  * Expect the array, regions counter and total size to not be modified.
1075 	rgn = &memblock.memory.regions[0];  in memblock_remove_absent_check()
1119  * Expect that only the intersection of both regions is removed from the
1120  * available memory pool. The regions counter and total size are updated.
1127 	rgn = &memblock.memory.regions[0];  in memblock_remove_overlap_top_check()
1173  * Expect that only the intersection of both regions is removed from the
1174  * available memory pool. The regions counter and total size are updated.
1181 	rgn = &memblock.memory.regions[0];  in memblock_remove_overlap_bottom_check()
1235 	rgn1 = &memblock.memory.regions[0];  in memblock_remove_within_check()
1236 	rgn2 = &memblock.memory.regions[1];  in memblock_remove_within_check()
1273  * available memory regions when r1 is the only available region.
1282 	rgn = &memblock.memory.regions[0];  in memblock_remove_only_region_check()
1308  * memory regions when r2 extends past PHYS_ADDR_MAX:
1326 	rgn = &memblock.memory.regions[0];  in memblock_remove_near_max_check()
1359  * regions r1 and r2:
1377 	rgn1 = &memblock.memory.regions[0];  in memblock_remove_overlap_two_check()
1378 	rgn2 = &memblock.memory.regions[1];  in memblock_remove_overlap_two_check()
1452  * Expect to reserve two memory regions and then erase r1 region with the
1459 	rgn = &memblock.reserved.regions[0];  in memblock_free_simple_check()
1502  * The array, regions counter and total size are not modified.
1508 	rgn = &memblock.reserved.regions[0];  in memblock_free_absent_check()
1552  * Expect that only the intersection of both regions is freed. The
1553  * regions counter and total size are updated.
1560 	rgn = &memblock.reserved.regions[0];  in memblock_free_overlap_top_check()
1601  * Expect that only the intersection of both regions is freed. The
1602  * regions counter and total size are updated.
1609 	rgn = &memblock.reserved.regions[0];  in memblock_free_overlap_bottom_check()
1663 	rgn1 = &memblock.reserved.regions[0];  in memblock_free_within_check()
1664 	rgn2 = &memblock.reserved.regions[1];  in memblock_free_within_check()
1710 	rgn = &memblock.reserved.regions[0];  in memblock_free_only_region_check()
1753 	rgn = &memblock.reserved.regions[0];  in memblock_free_near_max_check()
1786  * existing reserved regions r1 and r2:
1804 	rgn1 = &memblock.reserved.regions[0];  in memblock_free_overlap_two_check()
1805 	rgn2 = &memblock.reserved.regions[1];  in memblock_free_overlap_two_check()
1921 	rgn = &memblock.memory.regions[0];  in memblock_trim_memory_aligned_check()
1945  * A test that tries to trim memory when there are two available regions, r1 and
1967 	rgn = &memblock.memory.regions[0];  in memblock_trim_memory_too_small_check()
1996  * A test that tries to trim memory when there are two available regions, r1 and
2021 	rgn1 = &memblock.memory.regions[0];  in memblock_trim_memory_unaligned_base_check()
2022 	rgn2 = &memblock.memory.regions[1];  in memblock_trim_memory_unaligned_base_check()
2057  * A test that tries to trim memory when there are two available regions, r1 and
2082 	rgn1 = &memblock.memory.regions[0];  in memblock_trim_memory_unaligned_end_check()
2083 	rgn2 = &memblock.memory.regions[1];  in memblock_trim_memory_unaligned_end_check()