Searched refs:capacity_ (Results 1 – 6 of 6) sorted by relevance
/art/runtime/gc/accounting/ |
D | atomic_stack.h | 87 return AtomicPushBackInternal(value, capacity_); in AtomicPushBackIgnoreGrowthLimit() 127 for (size_t i = 0; i < capacity_; ++i) { in AssertAllZero() 188 return capacity_; in Capacity() 193 capacity_ = new_capacity; in Resize() 230 capacity_(capacity), in AtomicStack() 256 capacity_ * sizeof(begin_[0]), in Init() 281 size_t capacity_; variable
|
/art/runtime/ |
D | indirect_reference_table.h | 188 : table_(table), i_(i), capacity_(capacity) { in IrtIterator() 190 UNUSED(capacity_); in IrtIterator() 210 const size_t capacity_; variable
|
/art/runtime/gc/allocator/ |
D | rosalloc.cc | 60 capacity_(capacity), max_capacity_(max_capacity), in RosAlloc() 81 << std::hex << (intptr_t)(base_ + capacity_) in RosAlloc() 82 << ", capacity=" << std::dec << capacity_ in RosAlloc() 90 DCHECK_EQ(footprint_, capacity_); in RosAlloc() 108 free_pages->SetByteSize(this, capacity_); in RosAlloc() 109 DCHECK_EQ(capacity_ % kPageSize, static_cast<size_t>(0)); in RosAlloc() 126 MEMORY_TOOL_MAKE_DEFINED(base_, capacity_); in ~RosAlloc() 176 if (UNLIKELY(res == nullptr && capacity_ > footprint_)) { in AllocPages() 190 if (capacity_ - footprint_ + last_free_page_run_size >= req_byte_size) { in AllocPages() 193 capacity_ - footprint_); in AllocPages() [all …]
|
D | rosalloc.h | 611 DCHECK_LT(addr, base_ + capacity_); in ToPageMapIndex() 618 DCHECK(base_ <= addr && addr < reinterpret_cast<uint8_t*>(base_) + capacity_); in RoundDownToPageMapIndex() 705 size_t capacity_; variable 777 uint8_t* End() { return base_ + capacity_; } in End() 914 DCHECK_LT(idx, capacity_ / kPageSize); in IsFreePage()
|
/art/runtime/gc/ |
D | heap.cc | 280 capacity_(capacity), in Heap() 412 heap_reservation_size = capacity_; in Heap() 505 kMemMapSpaceName[0], request_begin, capacity_, &error_str); in Heap() 514 capacity_, in Heap() 529 kMemMapSpaceName[1], main_mem_map_1.End(), capacity_, &error_str); in Heap() 557 space::RegionSpace::CreateMemMap(kRegionSpaceName, capacity_ * 2, request_begin); in Heap() 576 CreateMainMallocSpace(std::move(main_mem_map_1), initial_size, growth_limit_, capacity_); in Heap() 588 capacity_, in Heap() 600 large_object_space_ = space::FreeListSpace::Create("free list large object space", capacity_); in Heap() 3621 capacity_ = growth_limit_; in ClampGrowthLimit() [all …]
|
D | heap.h | 1356 size_t capacity_; variable
|