Struct linked_list_allocator::Heap [−][src]
pub struct Heap { /* fields omitted */ }
A fixed size heap backed by a linked list of free memory blocks.
Methods
impl Heap
[src]
impl Heap
pub const fn empty() -> Heap
[src]
pub const fn empty() -> Heap
Creates an empty heap. All allocate calls will return None
.
pub unsafe fn init(&mut self, heap_bottom: usize, heap_size: usize)
[src]
pub unsafe fn init(&mut self, heap_bottom: usize, heap_size: usize)
Initializes an empty heap
Unsafety
This function must be called at most once and must only be used on an empty heap.
pub unsafe fn new(heap_bottom: usize, heap_size: usize) -> Heap
[src]
pub unsafe fn new(heap_bottom: usize, heap_size: usize) -> 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.
pub fn allocate_first_fit(
&mut self,
layout: Layout
) -> Result<NonNull<Opaque>, AllocErr>
[src]
pub fn allocate_first_fit(
&mut self,
layout: Layout
) -> Result<NonNull<Opaque>, AllocErr>
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.
pub unsafe fn deallocate(&mut self, ptr: NonNull<Opaque>, layout: Layout)
[src]
pub unsafe fn deallocate(&mut self, ptr: NonNull<Opaque>, layout: Layout)
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.
pub fn bottom(&self) -> usize
[src]
pub fn bottom(&self) -> usize
Returns the bottom address of the heap.
pub fn size(&self) -> usize
[src]
pub fn size(&self) -> usize
Returns the size of the heap.
pub fn top(&self) -> usize
[src]
pub fn top(&self) -> usize
Return the top address of the heap
pub unsafe fn extend(&mut self, by: usize)
[src]
pub unsafe fn extend(&mut self, by: usize)
Extends the size of the heap by creating a new hole at the end
Unsafety
The new extended area must be valid
Trait Implementations
impl Alloc for Heap
[src]
impl Alloc for Heap
unsafe fn alloc(&mut self, layout: Layout) -> Result<NonNull<Opaque>, AllocErr>
[src]
unsafe fn alloc(&mut self, layout: Layout) -> Result<NonNull<Opaque>, AllocErr>
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Returns a pointer meeting the size and alignment guarantees of layout
. Read more
unsafe fn dealloc(&mut self, ptr: NonNull<Opaque>, layout: Layout)
[src]
unsafe fn dealloc(&mut self, ptr: NonNull<Opaque>, layout: Layout)
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Deallocate the memory referenced by ptr
. Read more
fn usable_size(&self, layout: &Layout) -> (usize, usize)
[src]
fn usable_size(&self, layout: &Layout) -> (usize, usize)
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Returns bounds on the guaranteed usable size of a successful allocation created with the specified layout
. Read more
unsafe fn realloc(
&mut self,
ptr: NonNull<Opaque>,
layout: Layout,
new_size: usize
) -> Result<NonNull<Opaque>, AllocErr>
[src]
unsafe fn realloc(
&mut self,
ptr: NonNull<Opaque>,
layout: Layout,
new_size: usize
) -> Result<NonNull<Opaque>, AllocErr>
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Returns a pointer suitable for holding data described by a new layout with layout
’s alginment and a size given by new_size
. To accomplish this, this may extend or shrink the allocation referenced by ptr
to fit the new layout. Read more
unsafe fn alloc_zeroed(
&mut self,
layout: Layout
) -> Result<NonNull<Opaque>, AllocErr>
[src]
unsafe fn alloc_zeroed(
&mut self,
layout: Layout
) -> Result<NonNull<Opaque>, AllocErr>
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Behaves like alloc
, but also ensures that the contents are set to zero before being returned. Read more
unsafe fn alloc_excess(&mut self, layout: Layout) -> Result<Excess, AllocErr>
[src]
unsafe fn alloc_excess(&mut self, layout: Layout) -> Result<Excess, AllocErr>
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Behaves like alloc
, but also returns the whole size of the returned block. For some layout
inputs, like arrays, this may include extra storage usable for additional data. Read more
unsafe fn realloc_excess(
&mut self,
ptr: NonNull<Opaque>,
layout: Layout,
new_size: usize
) -> Result<Excess, AllocErr>
[src]
unsafe fn realloc_excess(
&mut self,
ptr: NonNull<Opaque>,
layout: Layout,
new_size: usize
) -> Result<Excess, AllocErr>
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Behaves like realloc
, but also returns the whole size of the returned block. For some layout
inputs, like arrays, this may include extra storage usable for additional data. Read more
unsafe fn grow_in_place(
&mut self,
ptr: NonNull<Opaque>,
layout: Layout,
new_size: usize
) -> Result<(), CannotReallocInPlace>
[src]
unsafe fn grow_in_place(
&mut self,
ptr: NonNull<Opaque>,
layout: Layout,
new_size: usize
) -> Result<(), CannotReallocInPlace>
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Attempts to extend the allocation referenced by ptr
to fit new_size
. Read more
unsafe fn shrink_in_place(
&mut self,
ptr: NonNull<Opaque>,
layout: Layout,
new_size: usize
) -> Result<(), CannotReallocInPlace>
[src]
unsafe fn shrink_in_place(
&mut self,
ptr: NonNull<Opaque>,
layout: Layout,
new_size: usize
) -> Result<(), CannotReallocInPlace>
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Attempts to shrink the allocation referenced by ptr
to fit new_size
. Read more
fn alloc_one<T>(&mut self) -> Result<NonNull<T>, AllocErr>
[src]
fn alloc_one<T>(&mut self) -> Result<NonNull<T>, AllocErr>
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Allocates a block suitable for holding an instance of T
. Read more
unsafe fn dealloc_one<T>(&mut self, ptr: NonNull<T>)
[src]
unsafe fn dealloc_one<T>(&mut self, ptr: NonNull<T>)
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Deallocates a block suitable for holding an instance of T
. Read more
fn alloc_array<T>(&mut self, n: usize) -> Result<NonNull<T>, AllocErr>
[src]
fn alloc_array<T>(&mut self, n: usize) -> Result<NonNull<T>, AllocErr>
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Allocates a block suitable for holding n
instances of T
. Read more
unsafe fn realloc_array<T>(
&mut self,
ptr: NonNull<T>,
n_old: usize,
n_new: usize
) -> Result<NonNull<T>, AllocErr>
[src]
unsafe fn realloc_array<T>(
&mut self,
ptr: NonNull<T>,
n_old: usize,
n_new: usize
) -> Result<NonNull<T>, AllocErr>
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Reallocates a block previously suitable for holding n_old
instances of T
, returning a block suitable for holding n_new
instances of T
. Read more
unsafe fn dealloc_array<T>(
&mut self,
ptr: NonNull<T>,
n: usize
) -> Result<(), AllocErr>
[src]
unsafe fn dealloc_array<T>(
&mut self,
ptr: NonNull<T>,
n: usize
) -> Result<(), AllocErr>
🔬 This is a nightly-only experimental API. (allocator_api
)
the precise API and guarantees it provides may be tweaked slightly, especially to possibly take into account the types being stored to make room for a future tracing garbage collector
Deallocates a block suitable for holding n
instances of T
. Read more