41   std::unique_ptr<CardTable> card_table_;
45       card_table_.reset(CardTable::Create(heap_begin_, heap_size_));  in CommonSetup()
65     size_t offset = RoundDown(addr - heap_begin_, CardTable::kCardSize);  in PseudoRandomCard()
69     for (const uint8_t* addr = HeapBegin(); addr != HeapLimit(); addr += CardTable::kCardSize) {  in FillRandom()
85     EXPECT_EQ(card_table_->GetCard(obj), CardTable::kCardClean);  in TEST_F()
89     EXPECT_EQ(card_table_->GetCard(obj), CardTable::kCardDirty);  in TEST_F()
91     EXPECT_EQ(*card_addr, CardTable::kCardDirty);  in TEST_F()
92     *card_addr = CardTable::kCardClean;  in TEST_F()
93     EXPECT_EQ(*card_addr, CardTable::kCardClean);  in TEST_F()
110                                 8U * CardTable::kCardSize);  in TEST_F()
113 …for (uint8_t* cstart = HeapBegin(); cstart < HeapBegin() + delta; cstart += CardTable::kCardSize) {  in TEST_F()
114     start_offset = (start_offset + kObjectAlignment) % CardTable::kCardSize;  in TEST_F()
116     for (uint8_t* cend = HeapLimit() - delta; cend < HeapLimit(); cend += CardTable::kCardSize) {  in TEST_F()
120       end_offset = (end_offset + kObjectAlignment) % CardTable::kCardSize;  in TEST_F()
124       for (uint8_t* cur = start - CardTable::kCardSize; cur >= HeapBegin();  in TEST_F()
125           cur -= CardTable::kCardSize) {  in TEST_F()
129       for (uint8_t* cur = end + CardTable::kCardSize; cur < HeapLimit();  in TEST_F()
130           cur += CardTable::kCardSize) {  in TEST_F()
135       for (uint8_t* cur = start; cur < AlignUp(end, CardTable::kCardSize);  in TEST_F()
136           cur += CardTable::kCardSize) {  in TEST_F()