Skip to main content

DramDataflow

Struct DramDataflow 

Source
pub struct DramDataflow { /* private fields */ }
Expand description

A straight-line in-DRAM dataflow graph: a growable row heap (operands then scratch) and the prim sequence computed over it. not/and/or/copy append a node writing a FRESH scratch row and return its index; higher-level gates compose those. This is the compiler-side spatial graph the DRAM plane executes.

Implementations§

Source§

impl DramDataflow

Source

pub fn new(inputs: usize) -> Self

A dataflow over inputs operand rows (indices 0..inputs); scratch rows are appended above.

Source

pub fn rows(&self) -> usize

Total rows (operands + scratch) the graph touches.

Source

pub fn node_count(&self) -> usize

The number of in-DRAM primitive steps (dataflow nodes) — the cost of the kernel.

Source

pub fn program(&self) -> &[Prim]

The emitted prim sequence (the spatial dataflow, in execution order).

Source

pub fn copy(&mut self, a: usize) -> usize

Source

pub fn not(&mut self, a: usize) -> usize

Source

pub fn and(&mut self, a: usize, b: usize) -> usize

Source

pub fn or(&mut self, a: usize, b: usize) -> usize

Source

pub fn xor(&mut self, a: usize, b: usize) -> usize

XOR = (a OR b) AND NOT(a AND b).

Source

pub fn nand(&mut self, a: usize, b: usize) -> usize

Source

pub fn nor(&mut self, a: usize, b: usize) -> usize

Source

pub fn xnor(&mut self, a: usize, b: usize) -> usize

Source

pub fn difference(&mut self, a: usize, b: usize) -> usize

Set difference a \ b = a AND NOT b.

Source

pub fn majority(&mut self, a: usize, b: usize, c: usize) -> usize

Bitwise majority MAJ(a,b,c) = (a AND b) OR (a AND c) OR (b AND c) — the full-adder carry.

Source

pub fn boolean_fn(&mut self, a: usize, b: usize, truth: u8) -> usize

Realize an ARBITRARY 2-input boolean function from its 4-bit truth table (bit 2·a+b = f(a,b)) as an OR of minterms over {AND, OR, NOT} — a constructive functional-completeness witness. An empty table yields constant 0 (a AND NOT a).

Source

pub fn run(&self, inputs: &[Row], width: usize) -> Vec<Row> ⓘ

Execute the dataflow in-DRAM (Ambit tier): inputs fill rows 0..inputs.len(), scratch rows are zero-initialized, and each node runs through exec_dram_ambit. Returns the final heap.

Trait Implementations§

Source§

impl Clone for DramDataflow

Source§

fn clone(&self) -> DramDataflow

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 DramDataflow

Source§

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

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

impl Default for DramDataflow

Source§

fn default() -> DramDataflow

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,