Lines Matching defs:free
32 * number of different sizes, and keeps free lists of each size. Blocks that
46 * The overhead on a block is at least 4 bytes. When free, this space
47 * contains a pointer to the next free block, and the bottom two bits must
55 union overhead *ov_next; /* when free */
77 * nextf[i] is the pointer to the next free block of size 2^(i+EXP).
222 * free list for this hash bucket.
234 free(void *cp)
254 * back. We have to search all the free lists for the block in order
281 * Already free, doing "compaction".
284 * free list. First, check the most common
285 * case (last element free'd), then (this failing)
286 * the last ``realloc_srchlen'' items free'd.
315 free(cp);
325 * Search ``srchlen'' elements of each free list for a block whose