Home
last modified time | relevance | path

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

/art/runtime/gc/space/
Dregion_space.cc54 num_regions_ = mem_map_size / kRegionSize; in RegionSpace()
56 DCHECK_GT(num_regions_, 0U); in RegionSpace()
57 regions_.reset(new Region[num_regions_]); in RegionSpace()
59 for (size_t i = 0; i < num_regions_; ++i, region_addr += kRegionSize) { in RegionSpace()
64 for (size_t i = 0; i < num_regions_; ++i) { in RegionSpace()
67 if (i + 1 < num_regions_) { in RegionSpace()
71 CHECK_EQ(regions_[num_regions_ - 1].End(), Limit()); in RegionSpace()
85 for (size_t i = 0; i < num_regions_; ++i) { in FromSpaceSize()
97 for (size_t i = 0; i < num_regions_; ++i) { in UnevacFromSpaceSize()
109 for (size_t i = 0; i < num_regions_; ++i) { in ToSpaceSize()
[all …]
Dregion_space-inl.h75 if ((num_non_free_regions_ + 1) * 2 > num_regions_) { in AllocNonvirtual()
78 for (size_t i = 0; i < num_regions_; ++i) { in AllocNonvirtual()
91 for (size_t i = 0; i < num_regions_; ++i) { in AllocNonvirtual()
159 for (size_t i = 0; i < num_regions_; ++i) { in GetBytesAllocatedInternal()
194 for (size_t i = 0; i < num_regions_; ++i) { in GetObjectsAllocatedInternal()
231 for (size_t i = 0; i < num_regions_; ++i) { in WalkInternal()
277 if ((num_non_free_regions_ + num_regs) * 2 > num_regions_) { in AllocLarge()
283 while (left + num_regs - 1 < num_regions_) { in AllocLarge()
305 DCHECK_LT(p, num_regions_); in AllocLarge()
Dregion_space.h501 DCHECK_LT(reg_idx, num_regions_); in RefToRegionLocked()
514 size_t num_regions_; // The number of regions in this space. variable