Lines Matching full:free

33 This is a free page.
47 describe the free space as runs of free pages.
49 Notice that these structures are not part of the free pages themselves,
50 but rather allocated with malloc so that the free pages themselves
51 are never referenced while they are free.
55 The free list will be searched and the first run of free pages that
62 If there were no pages on the free list, brk(2) will be called, and
68 page directory to MALLOC_FREE, and then traversing the free-pages list to
85 how many are free and so on.
90 pages that have free chunks in them form a list.
95 corresponding size is examined, and a free chunk found.  The number
96 of free chunks on that page is decreased by one and, if zero, the
99 To free a chunk, the page is derived from the pointer, the page table
101 free bit is set for the chunk, the number of free chunks increased by
105 pginfo structure is unlinked from the list and free(3)'ed and the 
106 actual page itself is free(3)'ed too.
150 One particularly nice feature is that all pointers passed to free(3)
185 Always do a free and malloc when realloc(3) is called.
221 Malloc/Free can be a significant point of contention in multi-threaded