var searchIndex = {};
searchIndex["linked_list_allocator"] = {"doc":"","items":[[3,"Heap","linked_list_allocator","A fixed size heap backed by a linked list of free memory blocks.",null,null],[5,"align_down","","Align downwards. Returns the greatest x with alignment `align`\nso that x <= addr. The alignment must be a power of 2.",null,{"inputs":[{"name":"usize"},{"name":"usize"}],"output":{"name":"usize"}}],[5,"align_up","","Align upwards. Returns the smallest x with alignment `align`\nso that x >= addr. The alignment must be a power of 2.",null,{"inputs":[{"name":"usize"},{"name":"usize"}],"output":{"name":"usize"}}],[11,"empty","","Creates an empty heap. All allocate calls will return `None`.",0,{"inputs":[],"output":{"name":"heap"}}],[11,"new","","Creates a new heap with the given `bottom` and `size`. The bottom address must be valid\nand the memory in the `[heap_bottom, heap_bottom + heap_size)` range must not be used for\nanything else. This function is unsafe because it can cause undefined behavior if the\ngiven address is invalid.",0,{"inputs":[{"name":"usize"},{"name":"usize"}],"output":{"name":"heap"}}],[11,"allocate_first_fit","","Allocates a chunk of the given size with the given alignment. Returns a pointer to the\nbeginning of that chunk if it was successful. Else it returns `None`.\nThis function scans the list of free memory blocks and uses the first block that is big\nenough. The runtime is in O(n) where n is the number of free blocks, but it should be\nreasonably fast for small allocations.",0,null],[11,"deallocate","","Frees the given allocation. `ptr` must be a pointer returned\nby a call to the `allocate_first_fit` function with identical size and alignment. Undefined\nbehavior may occur for invalid arguments, thus this function is unsafe.",0,null],[11,"bottom","","Returns the bottom address of the heap.",0,null],[11,"size","","Returns the size of the heap.",0,null]],"paths":[[3,"Heap"]]};
initSearch(searchIndex);