Struct SlicedPool 

pub struct SlicedPool {
    pub page_size: u64,
    pub pages: Option<u64>,
    pub max_slice: Option<u64>,
}

One pool of a MemoryPoolLayout::Sliced layout: allocations are slices of fixed-size pages, capped at pages pages. An allocation that no longer fits goes to the next pool that accepts it, and fails when none does.

Sizes are rounded up to the device’s alignment, so a pool holds at least what it was asked for. A layout that cannot be honoured at all — a zero size, max_slice past page_size, pages outside 1..=65535 — is refused with InvalidLayout.

Fields

page_size: u64

Size of each page in bytes; also the largest single allocation this pool can serve. Rounded up to the device’s alignment.

pages: Option<u64>

How many pages the pool may hold. None grows without a cap, which is what a workload is measured on before its caps are known.

max_slice: Option<u64>

Largest allocation routed to this pool; None accepts anything up to page_size. Later pools see only what this one declines.

Trait Implementations

impl Clone for SlicedPool

fn clone(&self) -> SlicedPool

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for SlicedPool

impl Debug for SlicedPool

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Eq for SlicedPool

impl PartialEq for SlicedPool

fn eq(&self, other: &SlicedPool) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for SlicedPool