Lines Matching defs:chunk
63 // This first free chunk in the list will be the tree list.
87 // is not remangled when a free chunk is returned to the free list
88 // (since it is used to maintain the chunk on the free list).
117 assert(list != NULL, "should have at least the target chunk");
122 // first chunk in the list unless it is the last chunk in the list
123 // because the first chunk is also acting as the tree node.
124 // When coalescing happens, however, the first chunk in the a tree
128 // to allow mutator activity. If this chunk is the first in the
130 // TreeList<Chunk> from the first chunk to the next chunk and update all
133 assert(prevFC == NULL, "Not last chunk in the list");
140 // Fix the pointer to the list in each chunk in the list.
142 // an option that does not allow the first chunk on the
168 assert(nextTC->is_free(), "Should be a free chunk");
172 // Removing chunk at tail of list
182 // chunk should still be a free chunk (bit set in _prev)
184 "Wrong sized chunk in list");
210 assert(tc->is_free(), "Should still be a free chunk");
219 void TreeList<Chunk>::return_chunk_at_tail(TreeChunk<Chunk>* chunk) {
220 assert(chunk != NULL, "returning NULL chunk");
221 assert(chunk->list() == this, "list should be set for chunk");
222 assert(tail() != NULL, "The tree list is embedded in the first chunk");
224 assert(!verify_chunk_in_free_list(chunk), "Double entry");
229 fc->link_after(chunk);
230 link_tail(chunk);
232 assert(!tail() || size() == tail()->size(), "Wrong sized chunk in list");
234 debug_only(increment_returned_bytes_by(chunk->size()*sizeof(HeapWord));)
239 // Add this chunk at the head of the list. "At the head of the list"
240 // is defined to be after the chunk pointer to by head(). This is
244 void TreeList<Chunk>::return_chunk_at_head(TreeChunk<Chunk>* chunk) {
245 assert(chunk->list() == this, "list should be set for chunk");
246 assert(head() != NULL, "The tree list is embedded in the first chunk");
247 assert(chunk != NULL, "returning NULL chunk");
248 assert(!verify_chunk_in_free_list(chunk), "Double entry");
254 chunk->link_after(fc);
257 link_tail(chunk);
259 head()->link_after(chunk);
260 assert(!head() || size() == head()->size(), "Wrong sized chunk in list");
262 debug_only(increment_returned_bytes_by(chunk->size()*sizeof(HeapWord));)
270 "Wrong type of chunk?");
284 assert(retTC->list() == this, "Wrong type of chunk.");
310 assert(retTC->list() == this, "Wrong type of chunk.");
325 assert(mr.word_size() >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "minimum chunk size");
348 assert(mr.word_size() >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "minimum chunk size");
372 // (zig, zig-zig or zig-zag). A chunk of the appropriate size is then returned
373 // if available, and if it's the last chunk, the node is deleted. A deteleted
381 assert(size >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "minimum chunk size");
415 // A candidate chunk has been found. If it is already under
416 // populated, get a chunk associated with the hint for this
417 // chunk.
449 // don't waste time splaying if chunk's singleton
457 "A chunk of the wrong size was found");
509 // Remove the current chunk from the tree. If it is not the last
510 // chunk in a list on a tree node, just unlink it.
511 // If it is the last chunk in the list (the next link is NULL),
516 assert(tc != NULL, "Should not call with a NULL chunk");
527 assert(_root->head() == tc, "Should only be this one chunk");
540 // Removing this chunk can have the side effect of changing the node
640 assert(retTC != NULL, "null chunk?");
733 // This chunk is being returned to the binary tree. Its embedded
882 // This is a birth associated with a LinAB. The chunk
898 // to each free chunk in the list
1004 // Searches the tree for a chunk that ends at the