Struct linked_list_allocator::Heap [−][src]
pub struct Heap { /* fields omitted */ }
Expand description
A fixed size heap backed by a linked list of free memory blocks.
Implementations
Initializes an empty heap
Unsafety
This function must be called at most once and must only be used on an empty heap.
Creates a new heap with the given bottom
and size
. The bottom address must be valid
and the memory in the [heap_bottom, heap_bottom + heap_size)
range must not be used for
anything else. This function is unsafe because it can cause undefined behavior if the
given address is invalid.
Allocates a chunk of the given size with the given alignment. Returns a pointer to the
beginning of that chunk if it was successful. Else it returns None
.
This function scans the list of free memory blocks and uses the first block that is big
enough. The runtime is in O(n) where n is the number of free blocks, but it should be
reasonably fast for small allocations.
Frees the given allocation. ptr
must be a pointer returned
by a call to the allocate_first_fit
function with identical size and alignment. Undefined
behavior may occur for invalid arguments, thus this function is unsafe.
This function walks the list of free memory blocks and inserts the freed block at the
correct place. If the freed block is adjacent to another free block, the blocks are merged
again. This operation is in O(n)
since the list needs to be sorted by address.