Lines Matching full:chunk

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.
30 When a chunk is 
32 the chunk is found in the list, its status
39 a chunk, trying to avoid copying the contents if possible.
42 The typical pattern of use is to malloc(3) a chunk of the maximum size 
43 needed, read in the data and adjust the size of the chunk to match the
48 plus the state of the chunk right before the chunk itself.
55 If in freeing a chunk, we end up with the last chunk on the list being
57 address of that chunk and then make the previous chunk the last on the