Lines Matching defs:free
46 * number of different sizes, and keeps free lists of each size. Blocks that
72 * The overhead on a block is at least 4 bytes. When free, this space
73 * contains a pointer to the next free block, and the bottom two bits must
82 union overhead *ov_next; /* when free */
109 * nextf[i] is the pointer to the next free block of size 2^(i+3). The
302 * free list for this hash bucket.
313 free(void *cp)
346 * back. We have to search all the free lists for the block in order
367 free (cp);
377 * Already free, doing "compaction".
380 * free list. First, check the most common
381 * case (last element free'd), then (this failing)
382 * the last ``__realloc_srchlen'' items free'd.
419 free(cp);
425 free(cp);
434 free(cp);
440 * Search ``srchlen'' elements of each free list for a block whose
465 * Prints two lines of numbers, one showing the length of the free list
489 fprintf(stderr, "\n\tTotal in use: %d, total free: %d\n",
501 * and free (or -lbsdmalloc must be surrounded by -Wl,--whole-archive