Struct kernel::memory::buddy_allocator::BuddyAllocator

pub struct BuddyAllocator {
    bins: [BTreeSet<PAddr>; 13],
}

Fields

bins: [BTreeSet<PAddr>; 13]

The bins of free blocks, where bin i contains blocks of size BASE_SIZE * (2^i). Uses BTreeSet to store the blocks in each bin, for efficient buddy location. Each block is stored as the physical address of the start of the block. The actual frames can be constructed for each block using the start address and the order of the block.

Implementations

impl BuddyAllocator

pub fn new() -> BuddyAllocator

pub fn add_range(&mut self, range: Range<Frame>)

Add a range of Frames to this allocator, marking them free to allocate.

pub fn available_bytes(&self) -> Bytes

pub fn allocate_n(&mut self, block_size: Bytes) -> Option<PAddr>

Allocate a block of block_size bytes from this allocator. Returns None if the allocator can’t satisfy the allocation.

pub fn free_n(&mut self, start: PAddr, block_size: Bytes)

Free a block starting at start of block_size bytes. block_size must be a valid size of a whole block.

fn allocate_block(&mut self, order: usize) -> Option<PAddr>

Tries to allocate a block of the given order. If no blocks of the correct size are available, tries to recursively split a larger block to form a block of the requested size.

fn free_block(&mut self, start: PAddr, order: usize)

Free a block starting at start of order order.

fn buddy_of(block_start: PAddr, order: usize) -> PAddr

Finds the starting frame of the block that is the buddy of the block of order order, starting at block_start.