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

  /art/runtime/gc/accounting/
card_table_test.cc 65 size_t offset = RoundDown(addr - heap_begin_, CardTable::kCardSize);
69 for (const uint8_t* addr = HeapBegin(); addr != HeapLimit(); addr += CardTable::kCardSize) {
111 8U * CardTable::kCardSize);
114 for (uint8_t* cstart = HeapBegin(); cstart < HeapBegin() + delta; cstart += CardTable::kCardSize) {
115 start_offset = (start_offset + kObjectAlignment) % CardTable::kCardSize;
117 for (uint8_t* cend = HeapLimit() - delta; cend < HeapLimit(); cend += CardTable::kCardSize) {
121 end_offset = (end_offset + kObjectAlignment) % CardTable::kCardSize;
125 for (uint8_t* cur = start - CardTable::kCardSize; cur >= HeapBegin();
126 cur -= CardTable::kCardSize) {
130 for (uint8_t* cur = end + CardTable::kCardSize; cur < HeapLimit()
    [all...]
card_table.cc 35 constexpr size_t CardTable::kCardSize;
44 * The heap is divided into "cards" of `kCardSize` bytes, as
64 size_t capacity = heap_capacity / kCardSize;
109 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(start), kCardSize);
110 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(end), kCardSize);
mod_union_table.cc 362 live_bitmap->VisitMarkedRange(start, start + CardTable::kCardSize, visitor);
372 uintptr_t end = start + CardTable::kCardSize;
379 uintptr_t end = start + CardTable::kCardSize;
393 uintptr_t end = start + CardTable::kCardSize;
404 uintptr_t end = start + CardTable::kCardSize;
428 uintptr_t end = start + CardTable::kCardSize;
488 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(space->Limit()), CardTable::kCardSize);
492 RoundUp(reinterpret_cast<uintptr_t>(space->Limit()), CardTable::kCardSize)));
516 bitmap_->VisitMarkedRange(start, start + CardTable::kCardSize, scan_visitor);
552 0, RoundUp(space_->Size(), CardTable::kCardSize) / CardTable::kCardSize, bit_visitor)
    [all...]
mod_union_table_test.cc 199 auto* obj1 = AllocObjectArray(self, space, CardTable::kCardSize);
201 auto* obj2 = AllocObjectArray(self, space, CardTable::kCardSize);
203 auto* obj3 = AllocObjectArray(self, space, CardTable::kCardSize);
205 auto* obj4 = AllocObjectArray(self, space, CardTable::kCardSize);
213 auto* other_space_ref1 = AllocObjectArray(self, other_space.get(), CardTable::kCardSize);
215 auto* other_space_ref2 = AllocObjectArray(self, other_space.get(), CardTable::kCardSize);
247 for (auto* ptr = space->Begin(); ptr < AlignUp(space->End(), CardTable::kCardSize);
248 ptr += CardTable::kCardSize) {
card_table-inl.h 64 uint8_t* const card_end = CardFromAddr(AlignUp(scan_end, kCardSize));
74 bitmap->VisitMarkedRange(start, start + kCardSize, visitor);
103 bitmap->VisitMarkedRange(start, start + kCardSize, visitor);
107 start += kCardSize;
117 bitmap->VisitMarkedRange(start, start + kCardSize, visitor);
136 uint8_t* card_end = CardFromAddr(AlignUp(scan_end, kCardSize));
remembered_set.cc 146 bitmap->VisitMarkedRange(start, start + CardTable::kCardSize, obj_visitor);
169 auto end = start + CardTable::kCardSize;
179 auto end = start + CardTable::kCardSize;
bitmap.cc 99 template class MemoryRangeBitmap<CardTable::kCardSize>;
card_table.h 50 static constexpr size_t kCardSize = 1 << kCardShift;
134 // Clear a range of cards that covers start to end, start and end must be aligned to kCardSize.
mod_union_table.h 57 typedef MemoryRangeBitmap<CardTable::kCardSize> CardBitmap;
  /art/runtime/gc/space/
malloc_space.cc 63 static const uintptr_t kGcCardSize = static_cast<uintptr_t>(accounting::CardTable::kCardSize);
188 DCHECK_ALIGNED(begin_, accounting::CardTable::kCardSize);
189 DCHECK_ALIGNED(End(), accounting::CardTable::kCardSize);
image_space.cc     [all...]
  /art/runtime/gc/collector/
mark_sweep.cc     [all...]
concurrent_copying.cc     [all...]
  /art/runtime/gc/
heap.cc     [all...]

Completed in 525 milliseconds