Lines Matching defs:free
24 /*! This is a very simple malloc()/free() implementation - it only
25 manages a free list.
26 After heap_init() is called, all free memory is contained in one
27 big chunk, the only entry in the free link list (which is a single
29 When memory is allocated, the smallest free chunk that contains
32 free list.
33 The free list is ordered by size, starting with the smallest
34 free chunk available. When a chunk is freed, it will be joint
36 To ease list handling, the list anchor itself is a free chunk with
275 // declare the whole area as one chunk, and add it to the free tree
347 // could not find a free chunk as large as needed
381 free(oldBuffer);
407 free(oldBuffer);
416 free(void* allocated)
423 TRACE(("free(%p)\n", allocated));
428 // try to join the new free chunk with an existing one