| /art/runtime/gc/accounting/ |
| card_table.cc | 34 constexpr size_t CardTable::kCardShift;
35 constexpr size_t CardTable::kCardSize;
36 constexpr uint8_t CardTable::kCardClean;
37 constexpr uint8_t CardTable::kCardDirty;
58 * byte is equal to GC_DIRTY_CARD. See CardTable::Create for details.
61 CardTable* CardTable::Create(const uint8_t* heap_begin, size_t heap_capacity) {
90 return new CardTable(mem_map.release(), biased_begin, offset);
93 CardTable::CardTable(MemMap* mem_map, uint8_t* biased_begin, size_t offset
[all...] |
| card_table_test.cc | 41 std::unique_ptr<CardTable> card_table_;
45 card_table_.reset(CardTable::Create(heap_begin_, heap_size_));
65 size_t offset = RoundDown(addr - heap_begin_, CardTable::kCardSize);
69 for (const uint8_t* addr = HeapBegin(); addr != HeapLimit(); addr += CardTable::kCardSize) {
85 EXPECT_EQ(card_table_->GetCard(obj), CardTable::kCardClean);
89 EXPECT_EQ(card_table_->GetCard(obj), CardTable::kCardDirty);
91 EXPECT_EQ(*card_addr, CardTable::kCardDirty);
92 *card_addr = CardTable::kCardClean;
93 EXPECT_EQ(*card_addr, CardTable::kCardClean);
110 8U * CardTable::kCardSize)
[all...] |
| card_table.h | 48 class CardTable {
56 static CardTable* Create(const uint8_t* heap_begin, size_t heap_capacity);
57 ~CardTable();
136 CardTable(MemMap* begin, uint8_t* biased_begin, size_t offset);
154 DISALLOW_IMPLICIT_CONSTRUCTORS(CardTable);
162 return (card == accounting::CardTable::kCardDirty) ? card - 1 : 0;
|
| mod_union_table.cc | 47 if (expected_value == CardTable::kCardDirty) {
58 ModUnionAddToCardBitmapVisitor(ModUnionTable::CardBitmap* bitmap, CardTable* card_table)
64 if (expected_value == CardTable::kCardDirty) {
72 CardTable* const card_table_;
82 if (expected_card == CardTable::kCardDirty) {
175 CardTable* card_table = GetHeap()->GetCardTable();
351 CardTable* card_table = heap_->GetCardTable();
355 if (*card == CardTable::kCardClean) {
362 live_bitmap->VisitMarkedRange(start, start + CardTable::kCardSize, visitor);
368 CardTable* card_table = heap_->GetCardTable()
[all...] |
| remembered_set.cc | 46 if (expected_value == CardTable::kCardDirty) {
56 CardTable* card_table = GetHeap()->GetCardTable();
136 CardTable* card_table = heap_->GetCardTable();
146 bitmap->VisitMarkedRange(start, start + CardTable::kCardSize, obj_visitor);
165 CardTable* card_table = heap_->GetCardTable();
169 auto end = start + CardTable::kCardSize;
176 CardTable* card_table = heap_->GetCardTable();
179 auto end = start + CardTable::kCardSize;
|
| mod_union_table_test.cc | 198 auto* obj1 = AllocObjectArray(self, space, CardTable::kCardSize);
200 auto* obj2 = AllocObjectArray(self, space, CardTable::kCardSize);
202 auto* obj3 = AllocObjectArray(self, space, CardTable::kCardSize);
204 auto* obj4 = AllocObjectArray(self, space, CardTable::kCardSize);
212 auto* other_space_ref1 = AllocObjectArray(self, other_space.get(), CardTable::kCardSize);
214 auto* other_space_ref2 = AllocObjectArray(self, other_space.get(), CardTable::kCardSize);
246 for (auto* ptr = space->Begin(); ptr < AlignUp(space->End(), CardTable::kCardSize);
247 ptr += CardTable::kCardSize) {
|
| card_table-inl.h | 55 inline size_t CardTable::Scan(ContinuousSpaceBitmap* bitmap,
139 inline void CardTable::ModifyCardsAtomic(uint8_t* scan_begin,
213 inline void* CardTable::AddrFromCard(const uint8_t *card_addr) const {
222 inline uint8_t* CardTable::CardFromAddr(const void *addr) const {
230 inline bool CardTable::IsValidCard(const uint8_t* card_addr) const {
236 inline void CardTable::CheckCardValid(uint8_t* card) const {
|
| bitmap.cc | 96 template class MemoryRangeBitmap<CardTable::kCardSize>;
|
| mod_union_table.h | 57 typedef MemoryRangeBitmap<CardTable::kCardSize> CardBitmap;
|
| /art/tools/cpp-define-generator/ |
| constant_card_table.def | 24 DEFINE_EXPR(CARD_TABLE_CARD_SHIFT, size_t, art::gc::accounting::CardTable::kCardShift)
|
| offset_thread.def | 33 DEFINE_THREAD_OFFSET(CARD_TABLE, CardTable)
|
| /art/runtime/gc/collector/ |
| sticky_mark_sweep.cc | 60 RecursiveMarkDirtyObjects(false, accounting::CardTable::kCardDirty - 1);
|
| mark_sweep.cc | 195 RecursiveMarkDirtyObjects(true, accounting::CardTable::kCardDirty);
242 RecursiveMarkDirtyObjects(false, accounting::CardTable::kCardDirty - 1);
858 accounting::CardTable* card_table = mark_sweep_->GetHeap()->GetCardTable();
[all...] |
| concurrent_copying.cc | 593 if (heap_->GetCardTable()->GetCard(obj) == gc::accounting::CardTable::kCardClean) {
665 accounting::CardTable* const card_table = heap_->GetCardTable();
689 return (card != gc::accounting::CardTable::kCardClean)
690 ? gc::accounting::CardTable::kCardAged
698 gc::accounting::CardTable::kCardAged);
705 accounting::CardTable* const card_table = heap_->GetCardTable();
720 gc::accounting::CardTable::kCardDirty);
726 AlignDown(space->End(), accounting::CardTable::kCardSize));
[all...] |
| /art/runtime/gc/space/ |
| malloc_space.cc | 53 static const uintptr_t kGcCardSize = static_cast<uintptr_t>(accounting::CardTable::kCardSize);
172 DCHECK_ALIGNED(begin_, accounting::CardTable::kCardSize);
173 DCHECK_ALIGNED(End(), accounting::CardTable::kCardSize);
|
| zygote_space.cc | 111 accounting::CardTable* card_table = Runtime::Current()->GetHeap()->GetCardTable();
|
| image_space.cc | 692 RoundUp(image_objects.End(), gc::accounting::CardTable::kCardSize)));
[all...] |
| /art/runtime/gc/ |
| verification.cc | 71 accounting::CardTable* card_table = heap_->GetCardTable();
|
| heap.h | 77 class CardTable;
487 accounting::CardTable* GetCardTable() const {
[all...] |
| heap.cc | 524 card_table_.reset(accounting::CardTable::Create(reinterpret_cast<uint8_t*>(kMinHeapAddress),
[all...] |
| /art/runtime/generated/ |
| asm_support_gen.h | 88 DEFINE_CHECK_EQ(static_cast<size_t>(CARD_TABLE_CARD_SHIFT), (static_cast<size_t>(art::gc::accounting::CardTable::kCardShift)))
|
| /art/compiler/optimizing/ |
| code_generator_arm64.cc | [all...] |
| code_generator_arm_vixl.cc | [all...] |
| code_generator_mips64.cc | [all...] |
| code_generator_x86.cc | [all...] |
