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

  /art/runtime/gc/accounting/
card_table_test.cc 60 uint8_t* HeapLimit() const {
69 for (const uint8_t* addr = HeapBegin(); addr != HeapLimit(); addr += CardTable::kCardSize) {
83 for (const uint8_t* addr = HeapBegin(); addr < HeapLimit(); addr += kObjectAlignment) {
109 const size_t delta = std::min(static_cast<size_t>(HeapLimit() - HeapBegin()),
116 for (uint8_t* cend = HeapLimit() - delta; cend < HeapLimit(); cend += CardTable::kCardSize) {
129 for (uint8_t* cur = end + CardTable::kCardSize; cur < HeapLimit();
heap_bitmap.cc 47 CHECK(bitmap->HeapBegin() >= cur_bitmap->HeapLimit() ||
48 bitmap->HeapLimit() <= cur_bitmap->HeapBegin())
heap_bitmap-inl.h 31 bitmap->VisitMarkedRange(bitmap->HeapBegin(), bitmap->HeapLimit(), visitor);
34 bitmap->VisitMarkedRange(bitmap->HeapBegin(), bitmap->HeapLimit(), visitor);
space_bitmap-inl.h 77 DCHECK_LE(visit_end, HeapLimit());
183 << ",end=" << reinterpret_cast<const void*>(bitmap.HeapLimit())
space_bitmap.cc 94 reinterpret_cast<void*>(HeapLimit()));
115 uintptr_t end = OffsetToIndex(HeapLimit() - heap_begin_ - 1);
card_table-inl.h 57 DCHECK_LE(scan_end, reinterpret_cast<uint8_t*>(bitmap->HeapLimit()));
space_bitmap.h 173 // The maximum address which the bitmap can span. (HeapBegin() <= object < HeapLimit()).
174 uint64_t HeapLimit() const {
  /art/runtime/gc/space/
malloc_space.cc 206 CHECK_EQ(live_bitmap_->HeapLimit(), reinterpret_cast<uintptr_t>(End()));
208 CHECK_EQ(mark_bitmap_->HeapLimit(), reinterpret_cast<uintptr_t>(End()));

Completed in 187 milliseconds