pub enum ChoreoOp {
Show 20 variants
Reserve {
buf: BufferId,
pages: usize,
},
Push {
buf: BufferId,
pages: usize,
},
Wait {
buf: BufferId,
pages: usize,
},
Pop {
buf: BufferId,
pages: usize,
},
ReadTiles {
tensor: TensorId,
at: TileAddr,
block_h: usize,
block_w: usize,
stride_w: usize,
stride_h: usize,
into: BufferId,
},
ReadBarrier,
WriteTiles {
from: BufferId,
tensor: TensorId,
at: TileAddr,
block_h: usize,
block_w: usize,
stride_w: usize,
stride_h: usize,
},
WriteBarrier,
McastSend {
buf: BufferId,
pages: usize,
group: GroupId,
hold_path: bool,
},
McastSetValid {
sem: SemId,
group: GroupId,
},
Flush {
cond: ArchCond,
},
SemSet {
sem: SemId,
value: SemValue,
},
SemInc {
sem: SemId,
at: Site,
by: usize,
},
SemWait {
sem: SemId,
until: SemCond,
},
AcquireAcc {
tiles: usize,
},
ReleaseAcc,
Compute {
op: ComputeOp,
ins: Vec<BufferId>,
acc_reload: Option<BufferId>,
},
PackAcc {
to: BufferId,
tiles: usize,
convert: Precision,
accumulate: bool,
},
Barrier {
group: GroupId,
},
Loop {
var: LoopVar,
count: LoopCount,
body: Vec<TaggedOp>,
},
}Expand description
One step of a site engine’s choreography.
Variants§
Reserve
Push
Wait
Pop
ReadTiles
Fields
ReadBarrier
WriteTiles
Fields
WriteBarrier
McastSend
Broadcast a buffer’s pages to a group. hold_path keeps the reserved broadcast path open for the
transfer that immediately follows to the same rectangle — the flag that tells the receivers the data
has landed. Without it that four-byte flag re-arbitrates and re-reserves the whole rectangle, once
per K block per operand on every sender.
McastSetValid
Flush
SemSet
SemInc
SemWait
AcquireAcc
ReleaseAcc
Compute
PackAcc
Write the accumulator’s tiles into a page. accumulate makes the packer ADD into the page already
there instead of overwriting it — the partial sum then never leaves local memory between K blocks, so
a blocked plan reloads the register file once instead of once per block.
Barrier
Loop
A counted loop whose body ops stay TAGGED with their stages (attribution survives nesting).
Trait Implementations§
Source§impl<'de> Deserialize<'de> for ChoreoOp
impl<'de> Deserialize<'de> for ChoreoOp
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for ChoreoOp
impl StructuralPartialEq for ChoreoOp
Auto Trait Implementations§
impl Freeze for ChoreoOp
impl RefUnwindSafe for ChoreoOp
impl Send for ChoreoOp
impl Sync for ChoreoOp
impl Unpin for ChoreoOp
impl UnsafeUnpin for ChoreoOp
impl UnwindSafe for ChoreoOp
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn 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>
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)
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)
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
impl<T> DowncastSync for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.