Skip to main content

Prelude

Struct Prelude 

Source
pub struct Prelude {
    pub dense: BTreeSet<String>,
    pub ranges: BTreeMap<String, Interval>,
    pub views: BTreeMap<usize, String>,
}
Expand description

The decisions the spatial chips make about a whole program before any op of it is linked.

Fields§

§dense: BTreeSet<String>

The tables laid out dense — as a rows × cols matrix, a tile row holding tile rows — rather than as one flat row (dense_tables).

§ranges: BTreeMap<String, Interval>

The interval each integer tensor is proven to hold, by name: a product’s operand precision is the narrowest that holds its operands’.

§views: BTreeMap<usize, String>

The view each product over a stored Q8_0 weight reads its activation through, by op.

Implementations§

Source§

impl Prelude

Source

pub fn of( g: &TensorGraph, linked: &[usize], target: &SpatialTarget, agreed: &BTreeSet<String>, ranges: BTreeMap<String, Interval>, q8: &BTreeSet<String>, chip: &dyn Fn(&str) -> Option<u16>, ) -> Prelude

The decisions for the ops linked of g, in the order they are linked: agreed the tables a deployment’s other programs lay out dense, q8 the weights it stores Q8_0, and chip the chip of a tensor-parallel deployment each result is computed on.

Source

pub fn agree_layouts( &self, g: &TensorGraph, ps: Vec<SpatialProgram>, twins: &mut BTreeSet<String>, passes: &dyn Fn(SpatialProgram) -> Result<SpatialProgram, SpatialReject>, target: &SpatialTarget, ) -> Result<Vec<SpatialProgram>, SpatialReject>

★ LAYOUT IS AGREED AT THE EDGES, ONCE, FOR EVERY OP. Each op lowers in its own layout — an attention or a rope over flat rows, a matmul over a matrix. Where a section declares one of the program’s matrices in the layout the prelude did not choose (Prelude::dense), that section’s tensor is renamed to its twin (X__rows flat, X__dense dense) and ONE relayout section bridges the two: before the section for a matrix it reads, after it for one it writes. A twin is made once and shared by every later reader. Carried state is updated in place and is never bridged.

Trait Implementations§

Source§

impl Clone for Prelude

Source§

fn clone(&self) -> Prelude

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for Prelude

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for Prelude

Source§

fn default() -> Prelude

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
§

impl<T> Downcast for T
where T: Any,

§

fn into_any(self: Box<T>) -> Box<dyn Any>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.
§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
§

fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,