| /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 `kCardDirty`. See CardTable::Create for details.
61 CardTable* CardTable::Create(const uint8_t* heap_begin, size_t heap_capacity) {
92 return new CardTable(std::move(mem_map), biased_begin, offset);
95 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);
111 8U * CardTable::kCardSize)
[all...] |
| card_table.h | 47 class CardTable {
55 static CardTable* Create(const uint8_t* heap_begin, size_t heap_capacity);
56 ~CardTable();
146 CardTable(MemMap&& mem_map, uint8_t* biased_begin, size_t offset);
164 DISALLOW_IMPLICIT_CONSTRUCTORS(CardTable);
172 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 | 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 | 55 inline size_t CardTable::Scan(ContinuousSpaceBitmap* bitmap,
131 inline void CardTable::ModifyCardsAtomic(uint8_t* scan_begin,
207 inline void* CardTable::AddrFromCard(const uint8_t *card_addr) const {
216 inline uint8_t* CardTable::CardFromAddr(const void *addr) const {
224 inline bool CardTable::IsValidCard(const uint8_t* card_addr) const {
230 inline void CardTable::CheckCardValid(uint8_t* card) const {
|
| bitmap.cc | 99 template class MemoryRangeBitmap<CardTable::kCardSize>;
|
| mod_union_table.h | 57 typedef MemoryRangeBitmap<CardTable::kCardSize> CardBitmap;
|
| /art/runtime/ |
| write_barrier.h | 26 class CardTable;
57 ALWAYS_INLINE static gc::accounting::CardTable* GetCardTable();
|
| write_barrier-inl.h | 50 inline gc::accounting::CardTable* WriteBarrier::GetCardTable() {
|
| /art/runtime/gc/collector/ |
| sticky_mark_sweep.cc | 60 RecursiveMarkDirtyObjects(false, accounting::CardTable::kCardDirty - 1);
|
| mark_sweep.cc | 197 RecursiveMarkDirtyObjects(true, accounting::CardTable::kCardDirty);
244 RecursiveMarkDirtyObjects(false, accounting::CardTable::kCardDirty - 1);
[all...] |
| concurrent_copying.cc | 717 if (heap_->GetCardTable()->GetCard(obj) == gc::accounting::CardTable::kCardClean) {
[all...] |
| /art/tools/cpp-define-generator/ |
| globals.def | 44 art::gc::accounting::CardTable::kCardShift)
|
| /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);
|
| zygote_space.cc | 116 accounting::CardTable* card_table = Runtime::Current()->GetHeap()->GetCardTable();
|
| image_space.cc | [all...] |
| /art/runtime/gc/ |
| verification.cc | 72 accounting::CardTable* card_table = heap_->GetCardTable();
|
| heap.h | 78 class CardTable;
522 accounting::CardTable* GetCardTable() const {
[all...] |
| heap.cc | 593 card_table_.reset(accounting::CardTable::Create(reinterpret_cast<uint8_t*>(kMinHeapAddress),
[all...] |
| /art/compiler/optimizing/ |
| code_generator_arm64.cc | [all...] |
| code_generator_mips64.cc | [all...] |
| code_generator_x86.cc | [all...] |
| code_generator_x86_64.cc | [all...] |
