50   CardTableTest() : heap_begin_(reinterpret_cast<byte*>(0x2000000)), heap_size_(2 * MB) {  in CardTableTest()
55   byte* HeapBegin() const {  in HeapBegin()
58   byte* HeapLimit() const {  in HeapLimit()
61   byte PRandCard(const byte* addr) const {  in PRandCard()
66     for (const byte* addr = HeapBegin(); addr != HeapLimit(); addr += kCardSize) {  in FillRandom()
68       byte* card = card_table_->CardFromAddr(addr);  in FillRandom()
74   byte* const heap_begin_;
80   for (const byte* addr = HeapBegin(); addr < HeapLimit(); addr += kObjectAlignment) {  in TEST_F()
87     byte* card_addr = card_table_->CardFromAddr(addr);  in TEST_F()
96   byte operator()(byte c) const {  in operator ()()
99   void operator()(byte* /*card*/, byte /*expected_value*/, byte /*new_value*/) const {  in operator ()()  argument
109   for (byte* cstart = HeapBegin(); cstart < HeapBegin() + delta; cstart += kCardSize) {  in TEST_F()
112     for (byte* cend = HeapLimit() - delta; cend < HeapLimit(); cend += kCardSize) {  in TEST_F()
114       byte* start = cstart + start_offset;  in TEST_F()
115       byte* end = cend - end_offset;  in TEST_F()
120       for (byte* cur = start - kCardSize; cur >= HeapBegin(); cur -= kCardSize) {  in TEST_F()
123       for (byte* cur = end + kCardSize; cur < HeapLimit(); cur += kCardSize) {  in TEST_F()
127       for (byte* cur = start; cur < AlignUp(end, kCardSize); cur += kCardSize) {  in TEST_F()
128         byte* card = card_table_->CardFromAddr(cur);  in TEST_F()
129         byte value = PRandCard(cur);  in TEST_F()