Lines Matching defs:free
30 /*! This is a very simple malloc()/free() implementation - it only
31 manages a free list.
32 After heap_init() is called, all free memory is contained in one
33 big chunk, the only entry in the free link list (which is a single
35 When memory is allocated, the smallest free chunk that contains
38 free list.
39 The free list is ordered by size, starting with the smallest
40 free chunk available. When a chunk is freed, it will be joint
42 To ease list handling, the list anchor itself is a free chunk with
414 // to the free list
476 // could not find a free chunk as large as needed
478 "no free chunks!\n", size);
509 free(oldBuffer);
543 free(oldBuffer);
563 free(void* allocated)
568 TRACE("free(%p)\n", allocated);
586 panic("invalid chunk in free list (%p (%zu)), or double free\n",
593 // try to join the new free chunk with an existing one