Enum quaigh::network::Gate

pub enum Gate {
    Binary([Signal; 2], BinaryType),
    Ternary([Signal; 3], TernaryType),
    Nary(Box<[Signal]>, NaryType),
    Buf(Signal),
    Dff([Signal; 3]),
    Lut(Box<LutGate>),
}

Logic gate representation

Logic gates have a canonical form. The canonical form is unique, making it easier to simplify and deduplicate the logic. Inputs and output may be negated, and constant inputs are simplified.

Canonical form includes:

• And gates (with optional negated inputs)
• Xor gates (no negated input)
• Mux/Maj/Dff Or/Nor/Nand gates are replaced by And gates. Xnor gates are replaced by Xor gates. Buf/Not and trivial gates are omitted.

Variants

Binary([Signal; 2], BinaryType)

Arbitrary 2-input gate (And/Xor)

Ternary([Signal; 3], TernaryType)

Arbitrary 3-input gate (And/Xor/Mux/Maj)

Nary(Box<[Signal]>, NaryType)

Arbitrary N-input gate (And/Or/Xor/Nand/Nor/Xnor)

Buf(Signal)

Buf or Not

Dff([Signal; 3])

D flip-flop with enable and reset

Lut(Box<LutGate>)

LUT

Implementations

impl Gate

pub fn and(a: Signal, b: Signal) -> Gate

Create a 2-input And

pub fn xor(a: Signal, b: Signal) -> Gate

Create a 2-input Xor

pub fn and3(a: Signal, b: Signal, c: Signal) -> Gate

Create a 3-input And

pub fn xor3(a: Signal, b: Signal, c: Signal) -> Gate

Create a 3-input Xor

pub fn andn(v: &[Signal]) -> Gate

Create a n-input And

pub fn xorn(v: &[Signal]) -> Gate

Create a n-input Xor

pub fn lut(v: &[Signal], lut: Lut) -> Gate

Create a n-input Lut

pub fn mux(s: Signal, a: Signal, b: Signal) -> Gate

Create a Mux

pub fn maj(a: Signal, b: Signal, c: Signal) -> Gate

Create a Maj

pub fn dff(d: Signal, en: Signal, res: Signal) -> Gate

Create a Dff

pub fn is_canonical(&self) -> bool

Returns whether the gate is in canonical form

pub fn make_canonical(&self) -> Normalization

Obtain the canonical form of the gate

pub fn dependencies(&self) -> &[Signal]

Obtain all signals feeding this gate

pub fn vars(&self) -> impl Iterator<Item = u32> + '_

Obtain all internal variables feeding this gate (not inputs or constants)

pub fn is_comb(&self) -> bool

Returns whether the gate is combinatorial

pub fn is_and(&self) -> bool

Returns whether the gate is an And of any arity

pub fn is_xor(&self) -> bool

Returns whether the gate is a Xor of any arity

pub fn is_and_like(&self) -> bool

Returns whether the gate is an And, Or, Nand or Nor of any arity

pub fn is_xor_like(&self) -> bool

Returns whether the gate is a Xor, Xnor of any arity

pub fn is_buf_like(&self) -> bool

Returns whether the gate is a Buf

Trait Implementations

impl Clone for Gate

fn clone(&self) -> Gate

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Gate

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

Formats the value using the given formatter.

impl Display for Gate

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

Formats the value using the given formatter.

impl Hash for Gate

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Gate

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Gate

impl StructuralEq for Gate

impl StructuralPartialEq for Gate