Lines Matching defs:free
55 * use level memory allocater (malloc, free, realloc)
57 * -malloc, free, realloc and mallopt form a memory allocator
58 * similar to malloc, free, and realloc. The routines
66 * 1. A free block. This is a block not in use by the
68 * of the free queue.)
80 * free list.
84 * head of the free queue, which prevents bunching of small
87 * -Compaction is performed at free time of any blocks immediately
90 * Since a freed block is added at the front of the free queue,
93 * a block with a contiguious preceding block that is free is
104 * A list of free blocks is kept within the holding block.
108 * description of arena, free queue, holding blocks etc.
128 /* first and last entry in free list */
234 * can't free it. So double the allocation request.
237 free(alloc_buf);
285 free(alloc_buf);
319 /* initialize free queue */
384 * Now make lfreeq point to a free block.
422 /* add to head of free queue */
510 * block is free
569 * is free
591 /* take block found of free queue */
594 * make head of free queue immediately follow blk,
628 * free(ptr) - free block that user thinks starts at ptr
639 free(void *ptr)
647 * free_unlocked(ptr) - Do the real work for free()
666 /* allow twits (e.g. awk) to free a block twice */
671 /* put lblk on its hold block's free list */
758 * reallocating a free block, malloc doesn't alter the contents
778 * deal with twits who reallocate free blocks
963 ssize_t fsp; /* free space in 1 hold block */
1026 * freespace - calc. how much space is used in the free
1031 * returns space used in free small blocks of hblk
1045 /* follow free chain */
1172 free(p);