Lines Matching defs:free
56 * use level memory allocater (malloc, free, realloc)
58 * -malloc, free, realloc and mallopt form a memory allocator
59 * similar to malloc, free, and realloc. The routines
67 * 1. A free block. This is a block not in use by the
69 * of the free queue.)
81 * free list.
85 * head of the free queue, which prevents bunching of small
88 * -Compaction is performed at free time of any blocks immediately
91 * Since a freed block is added at the front of the free queue,
94 * a block with a contiguious preceding block that is free is
105 * A list of free blocks is kept within the holding block.
109 * description of arena, free queue, holding blocks etc.
129 /* first and last entry in free list */
235 * can't free it. So double the allocation request.
238 free(alloc_buf);
286 free(alloc_buf);
320 /* initialize free queue */
385 * Now make lfreeq point to a free block.
423 /* add to head of free queue */
511 * block is free
570 * is free
592 /* take block found of free queue */
595 * make head of free queue immediately follow blk,
629 * free(ptr) - free block that user thinks starts at ptr
640 free(void *ptr)
648 * free_unlocked(ptr) - Do the real work for free()
667 /* allow twits (e.g. awk) to free a block twice */
672 /* put lblk on its hold block's free list */
759 * reallocating a free block, malloc doesn't alter the contents
779 * deal with twits who reallocate free blocks
973 ssize_t fsp; /* free space in 1 hold block */
1036 * freespace - calc. how much space is used in the free
1041 * returns space used in free small blocks of hblk
1055 /* follow free chain */
1182 free(p);