Struct IRQLockedHeap 

pub struct IRQLockedHeap(SpinMutexIRQ<Heap>);

The synchronized kernel heap allocator: wrapper around linked_list_allocator::Heap A irqsave variant of linked_list_allocator::LockedHeap, which originally only uses a spin mutex. This is not safe when used it’s used in both kernel and interrupt context (dead lock)

Tuple Fields

0: SpinMutexIRQ<Heap>

Implementations

impl IRQLockedHeap

pub const fn empty() -> IRQLockedHeap

pub unsafe fn new(heap_bottom: *mut u8, heap_size: usize) -> IRQLockedHeap

Methods from Deref<Target = SpinMutexIRQ<Heap>>

pub fn lock(&self) -> SpinMutexIRQGuard<'_, T>

Trait Implementations

impl Deref for IRQLockedHeap

type Target = SpinMutexIRQ<Heap>

The resulting type after dereferencing.

fn deref(&self) -> &SpinMutexIRQ<Heap>

Dereferences the value.

impl GlobalAlloc for IRQLockedHeap

unsafe fn alloc(&self, layout: Layout) -> *mut u8

Allocates memory as described by the given layout.

unsafe fn dealloc(&self, ptr: *mut u8, layout: Layout)

Deallocates the block of memory at the given ptr pointer with the given layout.

unsafe fn alloc_zeroed(&self, layout: Layout) -> *mut u8

Behaves like alloc, but also ensures that the contents are set to zero before being returned.

unsafe fn realloc( &self, ptr: *mut u8, layout: Layout, new_size: usize, ) -> *mut u8

Shrinks or grows a block of memory to the given new_size in bytes. The block is described by the given ptr pointer and layout.