Struct ConstantPropagation

pub struct ConstantPropagation<'a> { /* private fields */ }

This pass performs constant propagation on a Program, replacing all uses of a constant with the constant itself, converting accesses into constant aggregates with the accessed value, replacing local variables bound to constants with the constant value, and folding constant expressions into constant values.

It is expected that the provided Program has already been run through semantic analysis, so it will panic if it encounters invalid constructions to help catch bugs in the semantic analysis pass, should they exist.

Implementations

impl<'a> ConstantPropagation<'a>

pub fn new(diagnostics: &'a DiagnosticsHandler) -> ConstantPropagation<'a>

Trait Implementations

impl<'p> Pass for ConstantPropagation<'p>

type Input<'a> = Program

type Output<'a> = Program

type Error = SemanticAnalysisError

fn run<'a>( &mut self, program: <ConstantPropagation<'p> as Pass>::Input<'a>, ) -> Result<<ConstantPropagation<'p> as Pass>::Output<'a>, <ConstantPropagation<'p> as Pass>::Error>

Runs the pass on the given input

fn chain<P, E>(self, pass: P) -> Chain<Self, P>

where Self: Sized, E: From<Self::Error>, P: for<'a> Pass<Input<'a> = Self::Output<'a>, Error = E>,

Chains two passes together to form a new, fused pass

impl<'a> VisitMut<SemanticAnalysisError> for ConstantPropagation<'a>

fn visit_mut_scalar_expr( &mut self, expr: &mut ScalarExpr, ) -> ControlFlow<SemanticAnalysisError>

Fold constant expressions

fn visit_mut_statement( &mut self, _: &mut Statement, ) -> ControlFlow<SemanticAnalysisError>

It should not be possible to reach this, as we handle statements at the block level

fn visit_mut_expr( &mut self, expr: &mut Expr, ) -> ControlFlow<SemanticAnalysisError>

fn visit_mut_statement_block( &mut self, statements: &mut Vec<Statement>, ) -> ControlFlow<SemanticAnalysisError>

fn visit_mut_module(&mut self, module: &mut Module) -> ControlFlow<T>

fn visit_mut_import(&mut self, expr: &mut Import) -> ControlFlow<T>

fn visit_mut_constant(&mut self, expr: &mut Constant) -> ControlFlow<T>

fn visit_mut_evaluator_function( &mut self, expr: &mut EvaluatorFunction, ) -> ControlFlow<T>

fn visit_mut_periodic_column( &mut self, expr: &mut PeriodicColumn, ) -> ControlFlow<T>

fn visit_mut_public_input(&mut self, expr: &mut PublicInput) -> ControlFlow<T>

fn visit_mut_random_values(&mut self, expr: &mut RandomValues) -> ControlFlow<T>

fn visit_mut_random_binding(&mut self, expr: &mut RandBinding) -> ControlFlow<T>

fn visit_mut_trace_segment(&mut self, expr: &mut TraceSegment) -> ControlFlow<T>

fn visit_mut_trace_binding(&mut self, expr: &mut TraceBinding) -> ControlFlow<T>

fn visit_mut_evaluator_trace_segment( &mut self, expr: &mut TraceSegment, ) -> ControlFlow<T>

fn visit_mut_evaluator_trace_binding( &mut self, expr: &mut TraceBinding, ) -> ControlFlow<T>

fn visit_mut_let(&mut self, expr: &mut Let) -> ControlFlow<T>

fn visit_mut_boundary_constraints( &mut self, exprs: &mut Vec<Statement>, ) -> ControlFlow<T>

fn visit_mut_enforce(&mut self, expr: &mut ScalarExpr) -> ControlFlow<T>

fn visit_mut_enforce_if( &mut self, expr: &mut ScalarExpr, selector: &mut ScalarExpr, ) -> ControlFlow<T>

fn visit_mut_enforce_all( &mut self, expr: &mut ListComprehension, ) -> ControlFlow<T>

fn visit_mut_integrity_constraints( &mut self, exprs: &mut Vec<Statement>, ) -> ControlFlow<T>

fn visit_mut_binary_expr(&mut self, expr: &mut BinaryExpr) -> ControlFlow<T>

fn visit_mut_list_comprehension( &mut self, expr: &mut ListComprehension, ) -> ControlFlow<T>

fn visit_mut_call(&mut self, expr: &mut Call) -> ControlFlow<T>

fn visit_mut_bounded_symbol_access( &mut self, expr: &mut BoundedSymbolAccess, ) -> ControlFlow<T>

fn visit_mut_symbol_access(&mut self, expr: &mut SymbolAccess) -> ControlFlow<T>

fn visit_mut_resolvable_identifier( &mut self, expr: &mut ResolvableIdentifier, ) -> ControlFlow<T>

fn visit_mut_identifier(&mut self, expr: &mut Identifier) -> ControlFlow<T>