Struct Builder 

pub struct Builder { /* private fields */ }

The routine under construction.

Implementations

impl Builder

pub fn new(shape: LaneShape) -> Builder

pub fn shape(&self) -> LaneShape

pub fn w(&self) -> u32

The bits of one word.

pub fn fresh(&mut self) -> LReg

A register no instruction has written yet.

pub fn k(&mut self, v: u32) -> LReg

The constant v, materialized once in the routine’s prelude.

pub fn assign(&mut self, dst: LReg, src: LReg)

dst = src, for a register carried across the trips of a repeat.

pub fn repeat(&mut self, times: u32, f: impl FnOnce(&mut Builder))

Run f as a body repeated times times.

pub fn finish( self, name: impl Into<String>, inputs: Vec<LReg>, outputs: Vec<LReg>, ) -> Routine

The finished routine.

pub fn add(&mut self, a: LReg, b: LReg, cin: LReg) -> (LReg, LReg)

pub fn sub(&mut self, a: LReg, b: LReg, bin: LReg) -> (LReg, LReg)

pub fn mul(&mut self, a: LReg, b: LReg) -> LReg

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

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

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

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

pub fn shl(&mut self, a: LReg, k: u32) -> LReg

pub fn shr(&mut self, a: LReg, k: u32) -> LReg

pub fn ltu(&mut self, a: LReg, b: LReg) -> LReg

pub fn eq(&mut self, a: LReg, b: LReg) -> LReg

pub fn sel(&mut self, c: LReg, t: LReg, f: LReg) -> LReg

pub fn bit_not(&mut self, b: LReg) -> LReg

1 − b for a bit b.

pub fn word_bit(&mut self, a: LReg, i: u32) -> LReg

Bit i of a word, as 0 or 1.

pub fn nonzero(&mut self, a: LReg) -> LReg

1 when the word is nonzero.

pub fn mw_input(&mut self, n: usize) -> Mw

n fresh registers, for a routine’s inputs.

pub fn mw_const(&mut self, v: u128, n: usize) -> Mw

The constant v in n words.

pub fn mw_zero(&mut self, n: usize) -> Mw

pub fn mw_state(&mut self, a: &Mw) -> Mw

Fresh registers holding a copy of a: the state a repeat carries.

pub fn state(&mut self, a: LReg) -> LReg

A fresh register holding a copy of a.

pub fn mw_assign(&mut self, dst: &Mw, src: &Mw)

dst = src as one parallel assignment: every word of src is read before any word of dst is written. A source word that is itself a destination (a whole-word shift or rotation of the state reuses the state’s own registers) is staged in a fresh register first.

pub fn mw_resize(&mut self, a: &Mw, n: usize) -> Mw

a zero-extended or truncated to n words.

pub fn mw_sext(&mut self, a: &Mw, n: usize) -> Mw

a sign-extended (from its top bit) or truncated to n words.

pub fn mw_from_word(&mut self, a: LReg, n: usize) -> Mw

A word value (fits one word) as an n-word value.

pub fn mw_add(&mut self, a: &Mw, b: &Mw, cin: LReg) -> (Mw, LReg)

pub fn mw_plus(&mut self, a: &Mw, b: &Mw) -> Mw

a + b dropping the carry.

pub fn mw_sub(&mut self, a: &Mw, b: &Mw, bin: LReg) -> (Mw, LReg)

pub fn mw_minus(&mut self, a: &Mw, b: &Mw) -> Mw

a − b dropping the borrow.

pub fn mw_neg(&mut self, a: &Mw) -> Mw

0 − a.

pub fn mw_inc(&mut self, a: &Mw, bit: LReg) -> (Mw, LReg)

a + 1 when bit is 1, else a, and the carry out.

pub fn mw_and(&mut self, a: &Mw, b: &Mw) -> Mw

pub fn mw_or(&mut self, a: &Mw, b: &Mw) -> Mw

pub fn mw_xor(&mut self, a: &Mw, b: &Mw) -> Mw

pub fn mw_not(&mut self, a: &Mw) -> Mw

pub fn mw_sel(&mut self, c: LReg, t: &Mw, f: &Mw) -> Mw

pub fn mw_or_reduce(&mut self, a: &Mw) -> LReg

A word that is zero exactly when a is.

pub fn mw_is_zero(&mut self, a: &Mw) -> LReg

1 when a is zero.

pub fn mw_eq(&mut self, a: &Mw, b: &Mw) -> LReg

1 when a == b.

pub fn mw_ltu(&mut self, a: &Mw, b: &Mw) -> LReg

1 when a < b, both unsigned.

pub fn mw_lts(&mut self, a: &Mw, b: &Mw) -> LReg

1 when a < b, both two’s complement.

pub fn mw_top_bit(&mut self, a: &Mw) -> LReg

The top bit of a, as 0 or 1.

pub fn mw_bit(&mut self, a: &Mw, i: u32) -> LReg

Bit i of a (0 past its top).

pub fn mw_shl(&mut self, a: &Mw, s: u32) -> Mw

a << s within a’s width.

pub fn mw_shr(&mut self, a: &Mw, s: u32) -> Mw

a >> s (logical) within a’s width.

pub fn mw_shr_sticky(&mut self, a: &Mw, s: u32) -> (Mw, LReg)

a >> s (logical), and 1 when any bit shifted out was set.

pub fn mw_sar(&mut self, a: &Mw, s: u32) -> Mw

a >> s (arithmetic) within a’s width.

pub fn mw_shl_var(&mut self, a: &Mw, amt: &Mw, bits: u32) -> Mw

a << amt for the unsigned amount in amt’s low bits bits; a shift past the width is zero.

pub fn mw_shr_var_sticky(&mut self, a: &Mw, amt: &Mw, bits: u32) -> (Mw, LReg)

a >> amt (logical) for the amount in amt’s low bits bits, and the sticky bit of what fell off.

pub fn mw_sar_var(&mut self, a: &Mw, amt: &Mw, bits: u32) -> Mw

a >> amt (arithmetic) for the amount in amt’s low bits bits.

pub fn mw_clz(&mut self, a: &Mw, n: usize) -> Mw

The leading zeros of a, as an n-word count (a’s width when a is zero). a’s width must be a power of two.

pub fn mw_mul(&mut self, a: &Mw, b: &Mw) -> Mw

The full product a × b (unsigned), a.len() + b.len() words: schoolbook over multiplier-width digits, each partial product one word, accumulated by result word and then carried.

pub fn mw_divrem(&mut self, a: &Mw, b: &Mw) -> (Mw, Mw)

Unsigned a ÷ b and a mod b by restoring division over a’s bits; b must be nonzero (the caller guards a zero divisor, where the VM fails).

pub fn mw_popcount(&mut self, a: &Mw, n: usize) -> Mw

The number of set bits of a, as an n-word count.