Lines Matching full:free
11 Malloc and free
21 Each item on the list has a status as either free or used, a pointer
26 front and if a free chunk big enough to hold the request is found,
27 it is returned, if the free chunk is bigger than the size requested,
28 a new free chunk is made from the excess and put back on the list.
31 .B free(3) 'ed,
33 is changed to free and if one or both of the surrounding chunks
34 are free, they are collapsed to one.
56 free, we can return that to the kernel by calling brk(2) with the first
64 Splitting the list in two, one for used and one for free chunks, to
67 Putting free chunks on one of several free lists, depending on their size,