112       num_regions_(mem_map_.Size() / kRegionSize),  in RegionSpace()
123   DCHECK_GT(num_regions_, 0U);  in RegionSpace()
124   regions_.reset(new Region[num_regions_]);  in RegionSpace()
126   for (size_t i = 0; i < num_regions_; ++i, region_addr += kRegionSize) {  in RegionSpace()
133     for (size_t i = 0; i < num_regions_; ++i) {  in RegionSpace()
136       if (i + 1 < num_regions_) {  in RegionSpace()
140     CHECK_EQ(regions_[num_regions_ - 1].End(), Limit());  in RegionSpace()
153   for (size_t i = 0; i < num_regions_; ++i) {  in FromSpaceSize()
165   for (size_t i = 0; i < num_regions_; ++i) {  in UnevacFromSpaceSize()
177   for (size_t i = 0; i < num_regions_; ++i) {  in ToSpaceSize()
333       ? num_regions_  in SetFromSpace()
334       : std::min(num_regions_, non_free_region_index_limit_);  in SetFromSpace()
405   for (size_t i = 0u; i < num_regions_; ++i) {  in ReleaseFreeRegions()
459     for (size_t i = 0; i < std::min(num_regions_, non_free_region_index_limit_); ++i) {  in ClearFromSpace()
480           while (i + 1 < num_regions_ && regions_[i + 1].IsLargeTail()) {  in ClearFromSpace()
522   for (size_t i = 0; i < std::min(num_regions_, non_free_region_index_limit_); ++i) {  in ClearFromSpace()
538         while (i + free_regions < num_regions_ && regions_[i + free_regions].IsLargeTail()) {  in ClearFromSpace()
557         while (i + regions_to_clear_bitmap < num_regions_) {  in ClearFromSpace()
732   for (size_t i = 0; i < num_regions_; ++i) {  in LogFragmentationAllocFailure()
753   size_t regions_free_for_alloc = num_regions_ / 2 - num_non_free_regions_;  in LogFragmentationAllocFailure()
779   for (size_t i = 0; i < num_regions_; ++i) {  in Clear()
812   num_regions_ = new_num_regions;  in ClampGrowthLimit()
813   if (kCyclicRegionAllocation && cyclic_alloc_region_index_ >= num_regions_) {  in ClampGrowthLimit()
837   for (size_t i = 0; i < num_regions_; ++i) {  in DumpRegions()
844   for (size_t i = 0; i < num_regions_; ++i) {  in DumpNonFreeRegions()
1042   if (!for_evac && (num_non_free_regions_ + 1) * 2 > num_regions_) {  in AllocateRegion()
1045   for (size_t i = 0; i < num_regions_; ++i) {  in AllocateRegion()
1051         ? ((cyclic_alloc_region_index_ + i) % num_regions_)  in AllocateRegion()
1071         cyclic_alloc_region_index_ = (region_index + 1) % num_regions_;  in AllocateRegion()