52   CardTableTest() : heap_begin_(reinterpret_cast<uint8_t*>(0x2000000)), heap_size_(2 * MB) {  in CardTableTest()
57   uint8_t* HeapBegin() const {  in HeapBegin()
60   uint8_t* HeapLimit() const {  in HeapLimit()
64   uint8_t PseudoRandomCard(const uint8_t* addr) const {  in PseudoRandomCard()
69     for (const uint8_t* addr = HeapBegin(); addr != HeapLimit(); addr += CardTable::kCardSize) {  in FillRandom()
71       uint8_t* card = card_table_->CardFromAddr(addr);  in FillRandom()
77   uint8_t* const heap_begin_;
83   for (const uint8_t* addr = HeapBegin(); addr < HeapLimit(); addr += kObjectAlignment) {  in TEST_F()
90     uint8_t* card_addr = card_table_->CardFromAddr(addr);  in TEST_F()
99   uint8_t operator()(uint8_t c) const {  in operator ()()
103   void operator()(uint8_t* /*card*/, uint8_t /*expected_value*/, uint8_t /*new_value*/) const {  in operator ()()  argument
114 …for (uint8_t* cstart = HeapBegin(); cstart < HeapBegin() + delta; cstart += CardTable::kCardSize) {  in TEST_F()
117     for (uint8_t* cend = HeapLimit() - delta; cend < HeapLimit(); cend += CardTable::kCardSize) {  in TEST_F()
119       uint8_t* start = cstart + start_offset;  in TEST_F()
120       uint8_t* end = cend - end_offset;  in TEST_F()
125       for (uint8_t* cur = start - CardTable::kCardSize; cur >= HeapBegin();  in TEST_F()
130       for (uint8_t* cur = end + CardTable::kCardSize; cur < HeapLimit();  in TEST_F()
136       for (uint8_t* cur = start; cur < AlignUp(end, CardTable::kCardSize);  in TEST_F()
138         uint8_t* card = card_table_->CardFromAddr(cur);  in TEST_F()
139         uint8_t value = PseudoRandomCard(cur);  in TEST_F()