Struct KStackAllocator

pub struct KStackAllocator {
    pool: Vec<u64>,
}

wrapper around the global allocator with caching

Fields

pool: Vec<u64>

Implementations

impl KStackAllocator

TODO: the heap allocator is primitive atm and it may fail to allocate new kernel stack (64K here) due to fragmentation. It may be a good idea to reserve some memory during system init to guarantee that we can at least

const KSTACK_ALLOC_POOL_CAP: usize = 16usize

const KSTACK_LAYOUT: Layout

pub fn new() -> Self

pub unsafe fn allocate(&mut self) -> u64

unsafe because this may fail (same as populate)

pub unsafe fn free(&mut self, addr: u64)

unsafe because you must make sure you give back something the allocator gave you. Otherwise you break the kernel heap allocator.

pub unsafe fn populate(&mut self)

unsafe because this could OOM if you stress the allocator too much (although unlikely)