Lines Matching defs:free
33 * Memory management: malloc(), realloc(), free(), memalign().
45 * free elts maintained in a self-adjusting binary tree. Each list
53 * are free and used as follows:
55 * BIT0: 1 for busy (block is in use), 0 for free.
57 * preceding block in contiguous memory is free.
65 static TREE *Root; /* root of the free tree */
66 static TREE *Bottom; /* the last free chunk in the arena */
263 /* if the leftover is enough for a new free piece */
394 /* the previous block may be free */
426 * If the previous block is free and the combination of
471 * Coalescing of adjacent free blocks is done first.
472 * Then, the new free block is leaf-inserted into the free tree
475 * on the tree. In practice, however, free is much more infrequent
545 /* set bottom block, or insert in the free tree */
617 * Tell next block that this one is free.
733 /* non-contiguous memory, free old bottom block */
1076 free(void *old)
1232 * split and free a fragment on the right
1280 free(p);