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 58 byte* HeapLimit() const {
66 for (const byte* addr = HeapBegin(); addr != HeapLimit(); addr += kCardSize) {
80 for (const byte* addr = HeapBegin(); addr < HeapLimit(); addr += kObjectAlignment) {
106 const size_t delta = std::min(static_cast<size_t>(HeapLimit() - HeapBegin()), 8U * kCardSize);
112 for (byte* cend = HeapLimit() - delta; cend < HeapLimit(); cend += kCardSize) {
123 for (byte* cur = end + kCardSize; cur < HeapLimit(); cur += kCardSize) {
heap_bitmap-inl.h 31 bitmap->VisitMarkedRange(bitmap->HeapBegin(), bitmap->HeapLimit(), visitor);
34 bitmap->VisitMarkedRange(bitmap->HeapBegin(), bitmap->HeapLimit(), visitor);
heap_bitmap.cc 47 CHECK(bitmap->HeapBegin() >= cur_bitmap->HeapLimit() ||
48 bitmap->HeapLimit() <= cur_bitmap->HeapBegin())
space_bitmap-inl.h 77 DCHECK_LE(visit_end, HeapLimit());
182 << ",end=" << reinterpret_cast<const void*>(bitmap.HeapLimit())
space_bitmap.cc 87 reinterpret_cast<void*>(HeapLimit()));
108 uintptr_t end = OffsetToIndex(HeapLimit() - heap_begin_ - 1);
card_table-inl.h 56 DCHECK_LE(scan_end, reinterpret_cast<byte*>(bitmap->HeapLimit()));
space_bitmap.h 167 // The maximum address which the bitmap can span. (HeapBegin() <= object < HeapLimit()).
168 uint64_t HeapLimit() const {
  /art/runtime/gc/space/
malloc_space.cc 205 CHECK_EQ(live_bitmap_->HeapLimit(), reinterpret_cast<uintptr_t>(End()));
207 CHECK_EQ(mark_bitmap_->HeapLimit(), reinterpret_cast<uintptr_t>(End()));

Completed in 555 milliseconds