Skip to main content

CondNode

Enum CondNode 

Source
pub enum CondNode {
    Signal(TerminalRef),
    Specparam(SymbolId),
    Const(Vec<Bit4>),
    Unary(CondUnaryOp, Box<CondNode>),
    Binary(CondBinaryOp, Box<CondNode>, Box<CondNode>),
    Ternary(Box<CondNode>, Box<CondNode>, Box<CondNode>),
    Concat(Vec<CondNode>),
    Replication(u32, Box<CondNode>),
}
Expand description

A state-dependent path’s own if (cond) conditional expression (LRM 30.4.4.1, Task 8), resolved to data that needs no further sv_lang/live Design access to evaluate – the same “discover the SHAPE now, evaluate the VALUE later, against live simulation state” split PathEntry::delays’s own doc comment already establishes, except a condition’s VALUE is never baked even once at plan time (unlike a delay): LRM 30.4.4.1’s own operand list (“module input/inout ports… locally defined variables or nets… compile-time constants”) means a condition’s truth genuinely depends on LIVE simulation state, re-read on every check (vj::specify’s own CondEval, this type’s plan-time-Loc/register-time-Place-resolved sibling, is the runtime evaluator – this crate carries only the symbolic shape).

Variants§

§

Signal(TerminalRef)

A signal terminal (whole signal, or a constant bit-select/ part-select of one) – LRM 30.4.4.1’s own “ports… variables or nets… or their bit-/part-selects”.

§

Specparam(SymbolId)

A Specparam symbol – LRM 30.4.4.1’s own “compile-time constants (constant numbers and specify parameters)”. Resolved against TimingModel::specparam at vj::specify::plan time (not evaluated here, and not carried as a live value past that point – see that crate’s own compile_cond_plan doc comment for why a condition’s specparam operand is, as of this task, baked once at plan time rather than re-read on every check the way a Signal leaf is).

§

Const(Vec<Bit4>)

A plain compile-time-constant value (LRM 30.4.4.1’s own “constant numbers”), already evaluated at discovery time – LSB-first, in sv_lang::SVInt::bits’s own bit order.

§

Unary(CondUnaryOp, Box<CondNode>)

§

Binary(CondBinaryOp, Box<CondNode>, Box<CondNode>)

§

Ternary(Box<CondNode>, Box<CondNode>, Box<CondNode>)

c ? t : f – the plain (non-pattern-matching) ternary form only; a &&&-chained pattern-matching conditional is rejected at [compile_cond_expr] (Table 30-1 does not list it).

§

Concat(Vec<CondNode>)

{a, b, ...}, in SOURCE order (first element MSB-most, matching Expression::operands()’s own documented order) – never reordered here; vj::specify’s own runtime evaluator is where MSB-first source order meets this crate’s own LSB-first per-bit storage convention.

§

Replication(u32, Box<CondNode>)

{n{x}} – n, the replication count, already evaluated to a compile-time constant at discovery time (LRM 11.4.12.1’s own requirement, verified live: slang already enforces this upstream).

Trait Implementations§

Source§

impl Clone for CondNode

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for CondNode

Source§

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

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

impl Eq for CondNode

Source§

impl PartialEq for CondNode

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for CondNode

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<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

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
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
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> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

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 = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

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.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V