Struct PrefillPlan 

pub struct PrefillPlan {
    pub layer: u32,
    pub buffer_id: u32,
    pub already_loaded: bool,
    pub gather: GatherPlan,
    pub miss_runs: Vec<MissRun>,
    pub entries: Vec<BankEntry>,
    pub gather_banks: Vec<usize>,
}

What staging one layer into a prefill double buffer costs.

The two row sets are disjoint by construction – an expert is either gathered device-side or shipped from the host, never both – which is what lets the gather and the host transfer run without ordering against each other.

Fields

layer: u32

buffer_id: u32

layer % 2.

already_loaded: bool

The buffer already held this layer, so nothing moves. Every other field is empty.

gather: GatherPlan

Resident rows, cache -> buffer, device-side.

miss_runs: Vec<MissRun>

Non-resident rows, coalesced.

entries: Vec<BankEntry>

The host transfer batch, grouped by bank in the caller’s order.

gather_banks: Vec<usize>

Banks the gather serves – those at or above SMALL_BANK_FEAT_BYTES. A small bank’s rows are covered by its whole-layer entry instead, so gathering them too would move the same bytes twice.

Trait Implementations

impl Clone for PrefillPlan

fn clone(&self) -> PrefillPlan

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PrefillPlan

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

Formats the value using the given formatter.

impl PartialEq for PrefillPlan

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for PrefillPlan