Lines Matching refs:chunk
80 void MoveToFullList(Chunk* chunk, int bucket_);
81 void MoveToFreeList(Chunk* chunk, int bucket_);
89 void MoveToList(Chunk* chunk, LinkedList<Chunk*>* head);
198 unsigned int allocation_size_; // size of allocations in chunk, min 8 bytes
199 unsigned int max_allocations_; // maximum number of allocations in the chunk
223 // Override new operator on chunk to use mmap to allocate kChunkSize
234 // Override new operator on chunk to use mmap to allocate kChunkSize
353 Chunk *chunk = free_chunks_[i].next()->data();
354 chunk->node_.remove();
355 delete chunk;
358 Chunk *chunk = full_chunks_[i].next()->data();
359 chunk->node_.remove();
360 delete chunk;
376 Chunk *chunk = new Chunk(this, bucket);
377 free_chunks_[bucket].insert(chunk->node_);
391 Chunk* chunk = Chunk::ptr_to_chunk(ptr);
392 assert(chunk->heap() == this);
393 chunk->Free(ptr);
428 void HeapImpl::MoveToFreeList(Chunk *chunk, int bucket) {
429 MoveToList(chunk, &free_chunks_[bucket]);
432 void HeapImpl::MoveToFullList(Chunk *chunk, int bucket) {
433 MoveToList(chunk, &full_chunks_[bucket]);
436 void HeapImpl::MoveToList(Chunk *chunk, LinkedList<Chunk*>* head) {
438 chunk->node_.remove();
443 && node->data()->free_count() < chunk->free_count())
446 node->insert(chunk->node_);