80   void MoveToFullList(Chunk* chunk, int bucket_);
81   void MoveToFreeList(Chunk* chunk, int bucket_);
89   void MoveToList(Chunk* chunk, LinkedList<Chunk*>* head);
353       Chunk *chunk = free_chunks_[i].next()->data();  in ~HeapImpl()  local
354       chunk->node_.remove();  in ~HeapImpl()
355       delete chunk;  in ~HeapImpl()
358       Chunk *chunk = full_chunks_[i].next()->data();  in ~HeapImpl()  local
359       chunk->node_.remove();  in ~HeapImpl()
360       delete chunk;  in ~HeapImpl()
376     Chunk *chunk = new Chunk(this, bucket);  in AllocLocked()  local
377     free_chunks_[bucket].insert(chunk->node_);  in AllocLocked()
391     Chunk* chunk = Chunk::ptr_to_chunk(ptr);  in FreeLocked()  local
392     assert(chunk->heap() == this);  in FreeLocked()
393     chunk->Free(ptr);  in FreeLocked()
428 void HeapImpl::MoveToFreeList(Chunk *chunk, int bucket) {  in MoveToFreeList()  argument
429   MoveToList(chunk, &free_chunks_[bucket]);  in MoveToFreeList()
432 void HeapImpl::MoveToFullList(Chunk *chunk, int bucket) {  in MoveToFullList()  argument
433   MoveToList(chunk, &full_chunks_[bucket]);  in MoveToFullList()
436 void HeapImpl::MoveToList(Chunk *chunk, LinkedList<Chunk*>* head) {  in MoveToList()  argument
438   chunk->node_.remove();  in MoveToList()
443       && node->data()->free_count() < chunk->free_count())  in MoveToList()
446   node->insert(chunk->node_);  in MoveToList()