pub enum Statement {
Let(Let),
Expr(Expr),
Enforce(ScalarExpr),
EnforceIf(ScalarExpr, ScalarExpr),
EnforceAll(ListComprehension),
BusEnforce(ListComprehension),
}Expand description
Statements are top-level expressions in the body of evaluators,
or in the boundary_constraints or integrity_constraints sections.
These expressions are called statements because they do not evaluate
to a value, instead they are evaluated sequentially.
Variants§
Let(Let)
Binds an identifier to an expression in the following statements, e.g. let x = y * 2
A let statement contains all following statements in its containing block as the “body” of the let. In other words, it imposes a new lexical scope within the block in which the variable it binds is visible. Because of this, a let statement will always be the last statement in a block when one is present.
Furthermore, the parser guarantees that a let statement always has a body, which by induction guarantees that a let statement will always have a constraint in its body at some point, otherwise parsing would fail. This guarantee holds during all analyses and transformations.
Expr(Expr)
Represents a value expression in the tail position of a block
This is only used in pure function contexts, and during certain transformations. It is not valid in any position but the last statement of a block, and that block must be in an expression context (i.e. pure function body, let-bound expression that expands during inlining to a block of statements that are used to build up a value).
Enforce(ScalarExpr)
Declares a constraint to be enforced on a single value.
This variant accepts a ScalarExpr for simplicity in the parser, but is expected to always
be either a call to an evaluator function, or a binary expression of the form lhs = rhs,
i.e. an equality. This is validated by the semantic analyzer.
EnforceIf(ScalarExpr, ScalarExpr)
Declares a constraint to be conditionally enforced.
This has all the same semantics as Enforce, except it has a condition expression which
determines if the constraint will be enforced.
This variant is only present in the AST after inlining is performed, even though the parser
could produce it directly from the parse tree. This is because this variant is equivalent to
a comprehension constraint with a single element, so we transform all syntax corresponding to
EnforceIf into EnforceAll form so we can reuse all of the analyses/optimizations/transformations
for both. However, when lowering to the IR, we perform inlining/unrolling of comprehensions, and
at that time we need EnforceIf in order to represent unrolled constraints which have a selector
that is only resolvable at runtime.
EnforceAll(ListComprehension)
Declares a constraint to be enforced over a vector of values produced by a comprehension.
Just like Enforce, except the constraint is contained in the body of a list comprehension,
and must be enforced on every value produced by that comprehension.
BusEnforce(ListComprehension)
Declares a bus related constraint
Implementations§
Source§impl Statement
impl Statement
Sourcepub fn has_constraints(&self) -> bool
pub fn has_constraints(&self) -> bool
Checks this statement to see if it contains any constraints
This is primarily necessary because let statements have a body, which is
also composed of statements, and so may be nested arbitrarily deep, containing
one or more constraints in its body.
pub fn display(&self, indent: usize) -> DisplayStatement<'_>
Trait Implementations§
Source§impl TryFrom<ScalarExpr> for Statement
impl TryFrom<ScalarExpr> for Statement
Source§impl TryFrom<Statement> for ScalarExpr
impl TryFrom<Statement> for ScalarExpr
impl Eq for Statement
impl StructuralPartialEq for Statement
Auto Trait Implementations§
impl Freeze for Statement
impl RefUnwindSafe for Statement
impl Send for Statement
impl Sync for Statement
impl Unpin for Statement
impl UnwindSafe for Statement
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more