Lines Matching defs:chunk
95 // For constructing a TreeList from a Tree chunk or
103 // Returns the first available chunk in the free list as a pointer
113 // If "tc" is the first chunk in the list, it is also the
130 // chunk in the free list is also the tree node. Note that the
132 // the first chunk in the list is distinguished in this fashion
133 // (also is the node in the tree), it is the last chunk to be found
135 // it is the last chunk on the free list.
141 TreeList<Chunk> _embedded_list; // if non-null, this chunk is on _list
190 // Remove a chunk of size "size" or larger from the tree and
191 // return it. If the chunk
192 // is the last chunk of that size, remove the node for that size
198 // Remove this chunk from the tree. If the removal results
205 // Add this free chunk to the tree.
212 // verify that the given chunk is in the tree.
244 // a single free chunk.
250 // Return a chunk of size "size" or greater from
257 "Should be returning a free chunk");
261 void return_chunk(Chunk* chunk) {
263 insert_chunk_in_tree(chunk);
266 void remove_chunk(Chunk* chunk) {
268 remove_chunk_from_tree((TreeChunk<Chunk>*)chunk);
269 assert(chunk->is_free(), "Should still be a free chunk");
294 // the statistics in the list according to "split" (chunk was
295 // split or coalesce) and "birth" (chunk was added or removed).
309 // Return the largest free chunk in the tree.