OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:HeapLimit
(Results
1 - 9
of
9
) 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
78
DCHECK_LE(visit_end,
HeapLimit
());
163
uintptr_t end = OffsetToIndex(
HeapLimit
() - heap_begin_ - 1);
211
<< ",end=" << reinterpret_cast<const void*>(bitmap.
HeapLimit
())
space_bitmap.h
175
// The maximum address which the bitmap can span. (HeapBegin() <= object <
HeapLimit
()).
176
uint64_t
HeapLimit
() const {
card_table-inl.h
60
DCHECK_LE(scan_end, reinterpret_cast<uint8_t*>(bitmap->
HeapLimit
()));
space_bitmap.cc
105
reinterpret_cast<void*>(
HeapLimit
()));
/art/runtime/gc/space/
large_object_space_test.cc
49
static_cast<uintptr_t>(los->GetLiveBitmap()->
HeapLimit
()));
51
static_cast<uintptr_t>(los->GetLiveBitmap()->
HeapLimit
()));
malloc_space.cc
210
CHECK_EQ(live_bitmap_->
HeapLimit
(), reinterpret_cast<uintptr_t>(End()));
212
CHECK_EQ(mark_bitmap_->
HeapLimit
(), reinterpret_cast<uintptr_t>(End()));
Completed in 71 milliseconds