HomeSort by relevance Sort by last modified time
    Searched refs:num_regions_ (Results 1 - 3 of 3) sorted by null

  /art/runtime/gc/space/
region_space.cc 112 num_regions_(mem_map_.Size() / kRegionSize),
122 DCHECK_GT(num_regions_, 0U);
123 regions_.reset(new Region[num_regions_]);
125 for (size_t i = 0; i < num_regions_; ++i, region_addr += kRegionSize) {
132 for (size_t i = 0; i < num_regions_; ++i) {
135 if (i + 1 < num_regions_) {
139 CHECK_EQ(regions_[num_regions_ - 1].End(), Limit());
152 for (size_t i = 0; i < num_regions_; ++i) {
164 for (size_t i = 0; i < num_regions_; ++i) {
176 for (size_t i = 0; i < num_regions_; ++i)
    [all...]
region_space-inl.h 130 for (size_t i = 0; i < num_regions_; ++i) {
165 for (size_t i = 0; i < num_regions_; ++i) {
200 ? num_regions_ : std::min(num_regions_, non_free_region_index_limit_);
236 for (size_t i = 0; i < num_regions_; ++i) {
326 if ((num_non_free_regions_ + num_regs_in_large_region) * 2 > num_regions_) {
333 // Try to find a range of free regions within [cyclic_alloc_region_index_, num_regions_).
336 num_regions_,
344 DCHECK_LE(next_region1, num_regions_);
347 cyclic_alloc_region_index_ = next_region1 % num_regions_;
    [all...]
region_space.h 190 return num_regions_;
241 DCHECK_LT(idx, num_regions_);
321 for (size_t i = 0; i < num_regions_; ++i) {
332 ? num_regions_
333 : std::min(num_regions_, non_free_region_index_limit_);
348 DCHECK_LT(reg_idx, num_regions_);
653 DCHECK_LT(reg_idx, num_regions_);
671 DCHECK_LT(new_non_free_region_index, num_regions_);
678 DCHECK_LE(new_non_free_region_index_limit, num_regions_);
686 if (kIsDebugBuild && non_free_region_index_limit_ < num_regions_) {
727 size_t num_regions_; \/\/ The number of regions in this space. member in class:art::gc::space::final
    [all...]

Completed in 61 milliseconds