Searched defs:kRegionSize (Results 1 - 3 of 3) sorted by relevance
/art/runtime/gc/accounting/ |
H A D | read_barrier_table.h | 36 size_t capacity = static_cast<size_t>(kHeapCapacity / kRegionSize); 37 DCHECK_EQ(kHeapCapacity / kRegionSize, 38 static_cast<uint64_t>(static_cast<size_t>(kHeapCapacity / kRegionSize))); 54 DCHECK_ALIGNED(start_addr, kRegionSize); 55 DCHECK_ALIGNED(end_addr, kRegionSize); 82 // This should match RegionSpace::kRegionSize. static_assert'ed in concurrent_copying.h. 83 static constexpr size_t kRegionSize = 1 * MB; member in class:art::gc::accounting::ReadBarrierTable 91 uint8_t* entry_addr = mem_map_->Begin() + reinterpret_cast<uintptr_t>(heap_addr) / kRegionSize;
|
/art/runtime/gc/space/ |
H A D | region_space.cc | 33 capacity = RoundUp(capacity, kRegionSize); 52 CHECK_ALIGNED(mem_map_size, kRegionSize); 53 CHECK_ALIGNED(mem_map->Begin(), kRegionSize); 54 num_regions_ = mem_map_size / kRegionSize; 59 for (size_t i = 0; i < num_regions_; ++i, region_addr += kRegionSize) { 60 regions_[i] = Region(i, region_addr, region_addr + kRegionSize); 66 CHECK_EQ(static_cast<size_t>(regions_[i].End() - regions_[i].Begin()), kRegionSize); local 91 return num_regions * kRegionSize; 103 return num_regions * kRegionSize; 115 return num_regions * kRegionSize; [all...] |
H A D | region_space.h | 171 static constexpr size_t kRegionSize = 1 * MB; member in class:art::gc::space::FINAL 248 DCHECK_EQ(static_cast<size_t>(end - begin), kRegionSize); 394 size_t bytes_allocated = RoundUp(BytesAllocated(), kRegionSize); 403 DCHECK_LT(begin_ + kRegionSize, top_); 412 DCHECK_LE(bytes, kRegionSize); 500 size_t reg_idx = offset / kRegionSize;
|
Completed in 296 milliseconds