Lines Matching full:region
38 * Expect to create a new entry. The region counter and total memory get
47 struct region r = { in memblock_add_simple_check()
71 * Expect to create a new entry. The region counter and total memory get
80 struct region r = { in memblock_add_node_simple_check()
115 * region counter fields get updated.
124 struct region r1 = { in memblock_add_disjoint_check()
128 struct region r2 = { in memblock_add_disjoint_check()
166 * Expect to merge the two entries into one region that starts at r2.base
168 * the available memory is updated, and the region counter stays the same.
177 struct region r1 = { in memblock_add_overlap_top_check()
181 struct region r2 = { in memblock_add_overlap_top_check()
218 * Expect to merge the two entries into one region that starts at r1.base
220 * the available memory is updated, and the region counter stays the same.
229 struct region r1 = { in memblock_add_overlap_bottom_check()
233 struct region r2 = { in memblock_add_overlap_bottom_check()
269 * Expect to merge two entries into one region that stays the same.
278 struct region r1 = { in memblock_add_within_check()
282 struct region r2 = { in memblock_add_within_check()
310 struct region r = { in memblock_add_twice_check()
338 * Expect to merge the three entries into one region that starts at r1.base
339 * and has size of r1.size + r2.size + r3.size. The region counter and total
349 struct region r1 = { in memblock_add_between_check()
353 struct region r2 = { in memblock_add_between_check()
357 struct region r3 = { in memblock_add_between_check()
403 struct region r = { in memblock_add_near_max_check()
450 * (memblock.reserved). Expect to create a new entry. The region counter
459 struct region r = { in memblock_reserve_simple_check()
485 * (memblock.reserved). The total size and region counter for
495 struct region r1 = { in memblock_reserve_disjoint_check()
499 struct region r2 = { in memblock_reserve_disjoint_check()
538 * Expect to merge two entries into one region that starts at r2.base and
540 * reserved memory is updated, and the region counter is not updated.
549 struct region r1 = { in memblock_reserve_overlap_top_check()
553 struct region r2 = { in memblock_reserve_overlap_top_check()
591 * Expect to merge two entries into one region that starts at r1.base and
593 * reserved memory is updated, and the region counter is not updated.
602 struct region r1 = { in memblock_reserve_overlap_bottom_check()
606 struct region r2 = { in memblock_reserve_overlap_bottom_check()
644 * Expect to merge two entries into one region that stays the same. The
653 struct region r1 = { in memblock_reserve_within_check()
657 struct region r2 = { in memblock_reserve_within_check()
681 * Expect the region counter and total size of reserved memory to not
686 struct region r = { in memblock_reserve_twice_check()
714 * Expect to merge the three entries into one reserved region that starts at
715 * r1.base and has size of r1.size + r2.size + r3.size. The region counter and
725 struct region r1 = { in memblock_reserve_between_check()
729 struct region r2 = { in memblock_reserve_between_check()
733 struct region r3 = { in memblock_reserve_between_check()
779 struct region r = { in memblock_reserve_near_max_check()
823 * A simple test that tries to remove a region r1 from the array of
824 * available memory regions. By "removing" a region we mean overwriting it
825 * with the next region r2 in memblock.memory:
835 * r2 is the first available region. The region counter and total size
844 struct region r1 = { in memblock_remove_simple_check()
848 struct region r2 = { in memblock_remove_simple_check()
872 * A test that tries to remove a region r2 that was not registered as
893 struct region r1 = { in memblock_remove_absent_check()
897 struct region r2 = { in memblock_remove_absent_check()
920 * A test that tries to remove a region r2 that overlaps with the
945 struct region r1 = { in memblock_remove_overlap_top_check()
949 struct region r2 = { in memblock_remove_overlap_top_check()
976 * A test that tries to remove a region r2 that overlaps with the end of
977 * the already existing region r1 (that is r2.base < r1.base + r1.size):
999 struct region r1 = { in memblock_remove_overlap_bottom_check()
1003 struct region r2 = { in memblock_remove_overlap_bottom_check()
1028 * A test that tries to remove a region r2 that is within the range of
1042 * Expect that the region is split into two - one that ends at r2.base and
1044 * region counter and total size are updated.
1054 struct region r1 = { in memblock_remove_within_check()
1058 struct region r2 = { in memblock_remove_within_check()
1088 * A simple test that tries to remove a region r1 from the array of
1089 * available memory regions when r1 is the only available region.
1091 * region is added. The region counter stays the same, and the total size
1100 struct region r1 = { in memblock_remove_only_region_check()
1123 * A simple test that tries remove a region r2 from the array of available
1144 struct region r1 = { in memblock_remove_near_max_check()
1149 struct region r2 = { in memblock_remove_near_max_check()
1174 * A test that tries to remove a region r3 that overlaps with two existing
1196 struct region r1 = { in memblock_remove_overlap_two_check()
1200 struct region r2 = { in memblock_remove_overlap_two_check()
1204 struct region r3 = { in memblock_remove_overlap_two_check()
1258 * earlier as reserved. By "freeing" a region we mean overwriting it with
1268 * Expect to reserve two memory regions and then erase r1 region with the
1269 * value of r2. The region counter and total size are updated.
1277 struct region r1 = { in memblock_free_simple_check()
1281 struct region r2 = { in memblock_free_simple_check()
1305 * A test that tries to free a region r2 that was not marked as reserved
1326 struct region r1 = { in memblock_free_absent_check()
1330 struct region r2 = { in memblock_free_absent_check()
1353 * A test that tries to free a region r2 that overlaps with the beginning
1378 struct region r1 = { in memblock_free_overlap_top_check()
1382 struct region r2 = { in memblock_free_overlap_top_check()
1407 * A test that tries to free a region r2 that overlaps with the end of
1427 struct region r1 = { in memblock_free_overlap_bottom_check()
1431 struct region r2 = { in memblock_free_overlap_bottom_check()
1456 * A test that tries to free a region r2 that is within the range of the
1470 * Expect that the region is split into two - one that ends at r2.base and
1472 * region counter and total size fields are updated.
1482 struct region r1 = { in memblock_free_within_check()
1486 struct region r2 = { in memblock_free_within_check()
1517 * earlier as reserved when r1 is the only available region.
1519 * overwritten with a dummy region. The region counter stays the same,
1528 struct region r1 = { in memblock_free_only_region_check()
1551 * A simple test that tries free a region r2 when r2 extends past PHYS_ADDR_MAX:
1571 struct region r1 = { in memblock_free_near_max_check()
1576 struct region r2 = { in memblock_free_near_max_check()
1601 * A test that tries to free a reserved region r3 that overlaps with two
1623 struct region r1 = { in memblock_free_overlap_two_check()
1627 struct region r2 = { in memblock_free_overlap_two_check()
1631 struct region r3 = { in memblock_free_overlap_two_check()
1728 * A test that tries to trim memory when both ends of the memory region are
1739 struct region r = { in memblock_trim_memory_aligned_check()
1762 * r2. Region r1 is aligned on both ends and region r2 is unaligned on one end
1785 struct region r1 = { in memblock_trim_memory_too_small_check()
1789 struct region r2 = { in memblock_trim_memory_too_small_check()
1813 * r2. Region r1 is aligned on both ends and region r2 is unaligned at the base
1840 struct region r1 = { in memblock_trim_memory_unaligned_base_check()
1844 struct region r2 = { in memblock_trim_memory_unaligned_base_check()
1874 * r2. Region r1 is aligned on both ends and region r2 is aligned at the base
1901 struct region r1 = { in memblock_trim_memory_unaligned_end_check()
1905 struct region r2 = { in memblock_trim_memory_unaligned_end_check()