Struct BlockPool 

pub struct BlockPool { /* private fields */ }

Pre-allocated pool of KvPages shared across all sequences.

Pages are handed out via BlockPool::allocate and returned via BlockPool::free. The pool never grows beyond its initial capacity.

Implementations

impl BlockPool

pub fn new( capacity: usize, block_size: usize, num_layers: usize, num_kv_heads: usize, head_dim: usize, ) -> Self

Create a pool with capacity pages.

Every page is pre-allocated and zeroed at construction time so that subsequent allocations are O(1) pointer-hand-offs from the free list.

Arguments

• capacity – total number of physical pages.
• block_size – token slots per page.
• num_layers – number of transformer layers (informational; each logical layer has its own independent block list in BlockTable).
• num_kv_heads – number of KV attention heads.
• head_dim – per-head dimension.

pub fn allocate(&mut self) -> Option<usize>

Allocate one page and return its physical index.

Returns None when the pool is exhausted (out-of-memory).

pub fn free(&mut self, idx: usize)

Return page idx to the pool.

The page contents are not zeroed on release; callers must overwrite every slot they intend to read.

pub fn free_count(&self) -> usize

Number of pages currently available for allocation.

pub fn total_count(&self) -> usize

Total number of pages in the pool (constant after construction).

pub fn utilization(&self) -> f32

Fraction of pages currently in use, in [0.0, 1.0].

Returns 0.0 when the pool is empty (capacity == 0).