Skip to main content

PipelineSchedule

Struct PipelineSchedule 

Source
pub struct PipelineSchedule {
    pub stage: Vec<usize>,
    pub result: usize,
    pub budget: f64,
    pub inputs: Inputs,
}
Expand description

Where every op of a residual computes, and which op leaves the pipeline.

Fields§

§stage: Vec<usize>

The stage of each op; wiring carries its operands’ stage.

§result: usize§budget: f64

The per-stage depth budget the schedule was cut to, in the units of op_delay.

§inputs: Inputs

Where stage 0 reads the inputs.

Implementations§

Source§

impl PipelineSchedule

Source

pub fn stages(&self) -> usize

The register boundaries between the inputs and the output register, plus one.

Source

pub fn latency(&self) -> usize

Clocks from presenting an input to its result on the output register: the input register when there is one, the boundaries between stages, and the output register.

Source

pub fn reading(self, inputs: Inputs) -> PipelineSchedule

The same stages, reading the inputs from inputs.

Source

pub fn stage_depth(&self, ops: &[FabricOp]) -> f64

The deepest path inside any one stage of the emitted pipeline, in the units of op_delay: a value read in its own stage arrives when it is computed, and a value read in a later stage arrives from a register at depth zero. Ops the result does not need are never emitted and never counted.

Source

pub fn check(&self, ops: &[FabricOp]) -> Result<(), String>

The schedule respects dataflow: no op computes before an operand, and wiring sits in its operands’ stage.

Source§

impl PipelineSchedule

Source

pub fn register_bits(&self, ops: &[FabricOp]) -> u64

The live bits the emitted pipeline’s registers hold: each input register, each value’s live bits once per stage it is delayed across, and the result register’s live bits.

Source

pub fn register_words(&self, ops: &[FabricOp]) -> usize

The 64-bit registers the emitted pipeline holds: one per input when it registers them, one per stage each value is delayed across, and the result register.

Trait Implementations§

Source§

impl Clone for PipelineSchedule

Source§

fn clone(&self) -> PipelineSchedule

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 PipelineSchedule

Source§

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

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

impl PartialEq for PipelineSchedule

Source§

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

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl StructuralPartialEq for PipelineSchedule

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,