1886   FreeListNode* cur_node = FreeListNode::FromAddress(free_[cur].head_node_);  in Allocate()  local
1887   ASSERT(cur_node->Size() == (cur << kPointerSizeLog2));  in Allocate()
1897     if ((free_[cur].head_node_ = cur_node->next(heap_)) == NULL) {  in Allocate()
1908     if ((free_[cur].head_node_ = cur_node->next(heap_)) == NULL) {  in Allocate()
1917       return cur_node;  in Allocate()
1927   return cur_node;  in Allocate()
1935       FreeListNode* cur_node = FreeListNode::FromAddress(cur_addr);  in MarkNodes()  local
1936       cur_addr = cur_node->next(heap_);  in MarkNodes()
1937       cur_node->SetMark();  in MarkNodes()
1948       FreeListNode* cur_node = FreeListNode::FromAddress(cur_addr);  in Contains()  local
1949       if (cur_node == node) return true;  in Contains()
1950       cur_addr = cur_node->next(heap_);  in Contains()
2007     FreeListNode* cur_node = FreeListNode::FromAddress(cur_addr);  in MarkNodes()  local
2008     cur_addr = cur_node->next(heap_);  in MarkNodes()
2009     cur_node->SetMark();  in MarkNodes()