81   void MoveToFullList(Chunk* chunk, int bucket_);
82   void MoveToFreeList(Chunk* chunk, int bucket_);
90   void MoveToList(Chunk* chunk, LinkedList<Chunk*>* head);
343       Chunk* chunk = free_chunks_[i].next()->data();  in ~HeapImpl()  local
344       chunk->node_.remove();  in ~HeapImpl()
345       delete chunk;  in ~HeapImpl()
348       Chunk* chunk = full_chunks_[i].next()->data();  in ~HeapImpl()  local
349       chunk->node_.remove();  in ~HeapImpl()
350       delete chunk;  in ~HeapImpl()
366     Chunk* chunk = new Chunk(this, bucket);  in AllocLocked()  local
367     free_chunks_[bucket].insert(chunk->node_);  in AllocLocked()
381     Chunk* chunk = Chunk::ptr_to_chunk(ptr);  in FreeLocked()  local
382     assert(chunk->heap() == this);  in FreeLocked()
383     chunk->Free(ptr);  in FreeLocked()
416 void HeapImpl::MoveToFreeList(Chunk* chunk, int bucket) {  in MoveToFreeList()  argument
417   MoveToList(chunk, &free_chunks_[bucket]);  in MoveToFreeList()
420 void HeapImpl::MoveToFullList(Chunk* chunk, int bucket) {  in MoveToFullList()  argument
421   MoveToList(chunk, &full_chunks_[bucket]);  in MoveToFullList()
424 void HeapImpl::MoveToList(Chunk* chunk, LinkedList<Chunk*>* head) {  in MoveToList()  argument
426   chunk->node_.remove();  in MoveToList()
431          node->data()->free_count() < chunk->free_count())  in MoveToList()
434   node->insert(chunk->node_);  in MoveToList()