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

  /art/runtime/gc/accounting/
space_bitmap-inl.h 35 DCHECK_GE(addr, heap_begin_);
36 const uintptr_t offset = addr - heap_begin_;
59 DCHECK_GE(addr, heap_begin_);
60 const uintptr_t offset = addr - heap_begin_;
76 DCHECK_LE(heap_begin_, visit_begin);
79 const uintptr_t offset_start = visit_begin - heap_begin_;
80 const uintptr_t offset_end = visit_end - heap_begin_;
108 const uintptr_t ptr_base = IndexToOffset(index_start) + heap_begin_;
121 const uintptr_t ptr_base = IndexToOffset(i) + heap_begin_;
147 const uintptr_t ptr_base = IndexToOffset(index_end) + heap_begin_;
    [all...]
card_table_test.cc 43 card_table_.reset(gc::accounting::CardTable::Create(heap_begin_, heap_size_));
50 CardTableTest() : heap_begin_(reinterpret_cast<byte*>(0x2000000)), heap_size_(2 * MB) {
56 return heap_begin_;
62 size_t offset = RoundDown(addr - heap_begin_, kCardSize);
74 byte* const heap_begin_; member in class:art::CardTableTest
space_bitmap.cc 49 heap_begin_(reinterpret_cast<uintptr_t>(heap_begin)),
76 size_t new_size = OffsetToIndex(new_end - heap_begin_) * kWordSize;
108 uintptr_t end = OffsetToIndex(HeapLimit() - heap_begin_ - 1);
113 uintptr_t ptr_base = IndexToOffset(i) + heap_begin_;
131 CHECK_EQ(live_bitmap.heap_begin_, mark_bitmap.heap_begin_);
135 CHECK_GE(sweep_begin, live_bitmap.heap_begin_);
153 size_t start = OffsetToIndex(sweep_begin - live_bitmap.heap_begin_);
154 size_t end = OffsetToIndex(sweep_end - live_bitmap.heap_begin_ - 1);
161 uintptr_t ptr_base = IndexToOffset(i) + live_bitmap.heap_begin_;
    [all...]
space_bitmap.h 94 // If obj < heap_begin_ then offset underflows to some very large value past the end of the
96 const uintptr_t offset = reinterpret_cast<uintptr_t>(obj) - heap_begin_;
164 return heap_begin_;
187 const uintptr_t offset = addr - heap_begin_;
224 const uintptr_t heap_begin_; member in class:art::gc::accounting::SpaceBitmap

Completed in 87 milliseconds