heap/cmpctmalloc/cmpctmalloc.c

229         free_t* free_area = theheap.free_lists[i];
230         for (; free_area != NULL; free_area = free_area->next) {
231             ASSERT(free_area != free_area->next);
236             dump_free(&free_area->header);
355     free_t* free_area = (free_t*)address;
356     free_area->header.size = size;
357     free_area->header.left = tag_as_free(left);
365         old_head->prev = free_area;
367     free_area->next = old_head;
368     free_area->prev = NULL;
369     *bucket = free_area;
372     memset(free_area + 1, FREE_FILL, size - sizeof(free_t));
426 static void unlink_free(free_t* free_area, int bucket) {
427     theheap.remaining -= free_area->header.size;
429     free_t* next = free_area->next;
430     free_t* prev = free_area->prev;
431     if (theheap.free_lists[bucket] == free_area) {
445 static void unlink_free_unknown_bucket(free_t* free_area) {
447         free_area,
448         size_to_index_freeing(free_area->header.size - sizeof(header_t)));
816         for (free_t* free_area = theheap.free_lists[bucket];
817              free_area != NULL;
818              free_area = next) {
820                 free_area->header.size >= PAGE_SIZE + sizeof(header_t));
821             next = free_area->next;
822             header_t* right = right_header(&free_area->header);
830                         (uintptr_t)free_area +
842                 unlink_free(free_area, bucket);
843                 size_t new_free_size = free_area->header.size - freed_up;
847                     free_area, new_free_size, 0, free_area);
849                 create_free_area(free_area, untag(free_area->header.left),
855                            untag(free_area->header.left))) {
857                     (char*)ROUNDDOWN((uintptr_t)free_area, PAGE_SIZE);
871                 unlink_free(free_area, bucket);
873                 size_t new_free_size = free_area->header.size - freed_up;