Lines Matching defs:free
33 * Memory management: malloc(), realloc(), free().
47 * free elts maintained in a self-adjusting binary tree. Each list
55 * are free and used as follows:
57 * BIT0: 1 for busy (block is in use), 0 for free.
59 * preceding block in contiguous memory is free.
81 static TREE *Root, /* root of the free tree */
82 *Bottom, /* the last free chunk in the arena */
94 #define FREESIZE (1<<5) /* size for preserving free blocks until next malloc */
98 static int freeidx; /* index of free blocks in flist % FREESIZE */
197 /* see if the last free block can be used */
224 /* perform free's of space since last malloc */
279 /* if the leftover is enough for a new free piece */
330 /* perform free's of space since last malloc */
355 /* free is size is zero */
406 /* the previous block may be free */
438 * If the previous block is free and the combination of
479 * Coalescing of adjacent free blocks is done first.
480 * Then, the new free block is leaf-inserted into the free tree
483 * on the tree. In practice, however, free is much more infrequent
535 /* set bottom block, or insert in the free tree */
591 /* tell next block that this one is free */
690 /* non-contiguous memory, free old bottom block */
845 * free().
846 * Performs a delayed free of the block pointed to
850 * realfree(). This allows the contents of free blocks to
854 free(void *old)
881 * 3. In the free list.