Lines Matching refs:block
192 HeapBlock* block = search_freelist(length);
194 if (block != NULL) {
195 assert(block->length() >= length && block->length() < length + CodeCacheMinBlockLength, "sanity check");
196 assert(!block->free(), "must be marked free");
198 memset((void *)block->allocated_space(), badCodeHeapNewVal, size);
200 return block->allocated_space();
262 // The lowest address in any allocated block will be
269 // Since free blocks are merged, there is max. on free block
289 // Returns the next Heap block an offset into one
328 // Now check largest free block.
343 // Inserts block b after a
356 // Try to merge this block with the following block
358 assert(a->free(), "must be a free block");
361 // Update block a to include the following block
415 // Search for smallest block which is bigger than length
421 // Remember best block, its previous element, and its length
452 // Truncate block and return a pointer to the following block
455 // Set used bit and length on new block