Lines Matching refs:reserved
22 ASSERT_NE(memblock.reserved.regions, NULL);
23 ASSERT_EQ(memblock.reserved.cnt, 1);
25 ASSERT_EQ(strcmp(memblock.reserved.name, "reserved"), 0);
485 ASSERT_EQ(memblock.reserved.cnt, 1);
486 ASSERT_EQ(memblock.reserved.total_size, new_memory_regions_size);
542 * and size as reserved and to the collection of reserved memory regions
543 * (memblock.reserved). Expect to create a new entry. The region counter
550 rgn = &memblock.reserved.regions[0];
571 * A test that tries to mark two memory blocks that don't overlap as reserved:
577 * Expect to add two entries to the collection of reserved memory regions
578 * (memblock.reserved). The total size and region counter for
579 * memblock.reserved are updated.
585 rgn1 = &memblock.reserved.regions[0];
586 rgn2 = &memblock.reserved.regions[1];
609 ASSERT_EQ(memblock.reserved.cnt, 2);
610 ASSERT_EQ(memblock.reserved.total_size, r1.size + r2.size);
618 * A test that tries to mark two memory blocks r1 and r2 as reserved,
633 * reserved memory is updated, and the region counter is not updated.
640 rgn = &memblock.reserved.regions[0];
662 ASSERT_EQ(memblock.reserved.cnt, 1);
663 ASSERT_EQ(memblock.reserved.total_size, total_size);
671 * A test that tries to mark two memory blocks r1 and r2 as reserved,
686 * reserved memory is updated, and the region counter is not updated.
693 rgn = &memblock.reserved.regions[0];
715 ASSERT_EQ(memblock.reserved.cnt, 1);
716 ASSERT_EQ(memblock.reserved.total_size, total_size);
724 * A test that tries to mark two memory blocks r1 and r2 as reserved,
744 rgn = &memblock.reserved.regions[0];
764 ASSERT_EQ(memblock.reserved.cnt, 1);
765 ASSERT_EQ(memblock.reserved.total_size, r1.size);
774 * Expect the region counter and total size of reserved memory to not
791 ASSERT_EQ(memblock.reserved.cnt, 1);
792 ASSERT_EQ(memblock.reserved.total_size, r.size);
800 * A test that tries to mark two memory blocks that don't overlap as reserved
807 * Expect to merge the three entries into one reserved region that starts at
809 * total for memblock.reserved are updated.
816 rgn = &memblock.reserved.regions[0];
843 ASSERT_EQ(memblock.reserved.cnt, 1);
844 ASSERT_EQ(memblock.reserved.total_size, total_size);
863 * total size of reserved memory and the counter to be updated.
870 rgn = &memblock.reserved.regions[0];
887 ASSERT_EQ(memblock.reserved.cnt, 1);
888 ASSERT_EQ(memblock.reserved.total_size, total_size);
899 * reserved.regions.
925 ASSERT_EQ(memblock.reserved.cnt, i + 1);
926 ASSERT_EQ(memblock.reserved.total_size, (i + 1) * MEM_SIZE);
932 orig_region = memblock.reserved.regions;
938 * This is the memory region size used by the doubled reserved.regions,
939 * and it has been reserved due to it has been used. The size is used to
940 * calculate the total_size that the memblock.reserved have now.
946 * reserved.regions, and the used memory region will be reserved, so
947 * there will be one more region exist in the reserved memblock. And the
948 * one more reserved region's size is new_reserved_regions_size.
950 ASSERT_EQ(memblock.reserved.cnt, INIT_MEMBLOCK_REGIONS + 2);
951 ASSERT_EQ(memblock.reserved.total_size, (INIT_MEMBLOCK_REGIONS + 1) * MEM_SIZE +
953 ASSERT_EQ(memblock.reserved.max, INIT_MEMBLOCK_REGIONS * 2);
960 ASSERT_EQ(memblock.reserved.regions[0].base, r.base);
961 ASSERT_EQ(memblock.reserved.regions[0].size, r.size);
963 ASSERT_EQ(memblock.reserved.cnt, INIT_MEMBLOCK_REGIONS + 3);
964 ASSERT_EQ(memblock.reserved.total_size, (INIT_MEMBLOCK_REGIONS + 1) * MEM_SIZE +
967 ASSERT_EQ(memblock.reserved.max, INIT_MEMBLOCK_REGIONS * 2);
972 * The current reserved.regions is occupying a range of memory that
977 memblock.reserved.regions = orig_region;
978 memblock.reserved.cnt = INIT_MEMBLOCK_RESERVED_REGIONS;
1442 * earlier as reserved. By "freeing" a region we mean overwriting it with
1443 * the next entry r2 in memblock.reserved:
1459 rgn = &memblock.reserved.regions[0];
1480 ASSERT_EQ(memblock.reserved.cnt, 1);
1481 ASSERT_EQ(memblock.reserved.total_size, r2.size);
1489 * A test that tries to free a region r2 that was not marked as reserved
1490 * (i.e. has no corresponding entry in memblock.reserved):
1508 rgn = &memblock.reserved.regions[0];
1528 ASSERT_EQ(memblock.reserved.cnt, 1);
1529 ASSERT_EQ(memblock.reserved.total_size, r1.size);
1560 rgn = &memblock.reserved.regions[0];
1582 ASSERT_EQ(memblock.reserved.cnt, 1);
1583 ASSERT_EQ(memblock.reserved.total_size, total_size);
1609 rgn = &memblock.reserved.regions[0];
1631 ASSERT_EQ(memblock.reserved.cnt, 1);
1632 ASSERT_EQ(memblock.reserved.total_size, total_size);
1663 rgn1 = &memblock.reserved.regions[0];
1664 rgn2 = &memblock.reserved.regions[1];
1691 ASSERT_EQ(memblock.reserved.cnt, 2);
1692 ASSERT_EQ(memblock.reserved.total_size, total_size);
1701 * earlier as reserved when r1 is the only available region.
1710 rgn = &memblock.reserved.regions[0];
1726 ASSERT_EQ(memblock.reserved.cnt, 1);
1727 ASSERT_EQ(memblock.reserved.total_size, 0);
1745 * Expect the total size of reserved memory to be updated and the counter to
1753 rgn = &memblock.reserved.regions[0];
1776 ASSERT_EQ(memblock.reserved.cnt, 1);
1777 ASSERT_EQ(memblock.reserved.total_size, total_size);
1785 * A test that tries to free a reserved region r3 that overlaps with two
1786 * existing reserved regions r1 and r2:
1796 * from the collection of reserved memory. Expect the total size of reserved
1804 rgn1 = &memblock.reserved.regions[0];
1805 rgn2 = &memblock.reserved.regions[1];
1839 ASSERT_EQ(memblock.reserved.cnt, 2);
1840 ASSERT_EQ(memblock.reserved.total_size, total_size);