38     : cur_addr_(kNullAddress),  in HeapObjectIterator()
39       cur_end_(kNullAddress),  in HeapObjectIterator()
45     : cur_addr_(kNullAddress),  in HeapObjectIterator()
46       cur_end_(kNullAddress),  in HeapObjectIterator()
235     return kNullAddress;  in AllocateRawMemory()
243     return kNullAddress;  in AllocateRawMemory()
312       highest_ever_allocated_(kNullAddress),  in MemoryAllocator()
530     return kNullAddress;  in ReserveAlignedMemory()
546   if (base == kNullAddress) return kNullAddress;  in AllocateAlignedMemory()
551       base = kNullAddress;  in AllocateAlignedMemory()
558       base = kNullAddress;  in AllocateAlignedMemory()
562   if (base == kNullAddress) {  in AllocateAlignedMemory()
567     return kNullAddress;  in AllocateAlignedMemory()
821   Address base = kNullAddress;  in AllocateChunk()
823   Address area_start = kNullAddress;  in AllocateChunk()
824   Address area_end = kNullAddress;  in AllocateChunk()
877       if (base == kNullAddress) return nullptr;  in AllocateChunk()
885       if (base == kNullAddress) return nullptr;  in AllocateChunk()
907     if (base == kNullAddress) return nullptr;  in AllocateChunk()
1596   DCHECK_EQ(kNullAddress, other->top());  in AllocateChunk()
1597   DCHECK_EQ(kNullAddress, other->limit());  in AllocateChunk()
1763   if (top != kNullAddress && top != limit &&  in AllocateChunk()
1819   if (current_top != kNullAddress && current_top != current_limit) {  in AllocateChunk()
1828   if (current_top != kNullAddress && current_top != current_limit) {  in AllocateChunk()
1839   if (current_top == kNullAddress) {  in AllocateChunk()
1840     DCHECK_EQ(kNullAddress, current_limit);  in AllocateChunk()
1859   InlineAllocationStep(current_top, kNullAddress, kNullAddress, 0);  in AllocateChunk()
1860   SetTopAndLimit(kNullAddress, kNullAddress);  in AllocateChunk()
1884     allocation_info_.Reset(kNullAddress, kNullAddress);  in AllocateChunk()
2142   allocation_info_.Reset(kNullAddress, kNullAddress);  in AllocateChunk()
2254     allocation_info_ = LinearAllocationArea(kNullAddress, kNullAddress);  in AllocateChunk()
2257   return LinearAllocationArea(kNullAddress, kNullAddress);  in AllocateChunk()
2288       kNullAddress, kNullAddress);  in AllocateChunk()
2307   InlineAllocationStep(top(), top(), kNullAddress, 0);  in AllocateChunk()
2337   InlineAllocationStep(top, top, kNullAddress, 0);  in AllocateChunk()
2407     DCHECK_EQ(kNullAddress, top_on_previous_step_);  in AllocateChunk()
2412   InlineAllocationStep(top(), top(), kNullAddress, 0);  in AllocateChunk()
2420       allocation_observers_.size() == 1 ? kNullAddress : top();  in AllocateChunk()
2421   InlineAllocationStep(top(), top_for_next_step, kNullAddress, 0);  in AllocateChunk()
2428   InlineAllocationStep(top(), kNullAddress, kNullAddress, 0);  in AllocateChunk()
2430   DCHECK_EQ(kNullAddress, top_on_previous_step_);  in AllocateChunk()
2435   DCHECK_EQ(kNullAddress, top_on_previous_step_);  in AllocateChunk()
2452       DCHECK_NE(top, kNullAddress);  in AllocateChunk()
2580   if (age_mark_ == kNullAddress) {  in AllocateChunk()