Struct BuddyAlloc 

pub struct BuddyAlloc {
    base_addr: usize,
    end_addr: usize,
    unavailable: usize,
    entries: *mut Entry,
    entries_size: usize,
    leaf2base: usize,
}

Fields

base_addr: usize

memory start addr

end_addr: usize

memory end addr

unavailable: usize

unavailable memories at end_addr

entries: *mut Entry

entries_size: usize

leaf2base: usize

min size of a block, represent in 1 << leaf2base

Implementations

impl BuddyAlloc

pub unsafe fn new(param: BuddyAllocParam) -> Self

Safety

The base_addr..(base_addr + len) must be allocated before using, and must guarantee no others write to the memory range, to avoid undefined behaviors. The new function panic if memory space not enough for initialize BuddyAlloc.

fn init_free_list(&mut self)

pub fn malloc(&mut self, nbytes: usize) -> *mut u8

pub fn free(&mut self, p: *mut u8)

fn entry(&self, i: usize) -> &Entry

fn find_k_for_p(&self, p: *const u8) -> usize

find k for p

fn block_index(&self, k: usize, p: *const u8) -> usize

block index of p under k

fn block_addr(&self, k: usize, i: usize) -> usize

block addr of index under k