Struct rustc_mir_dataflow::Engine

pub struct Engine<'a, 'tcx, A>where
    A: Analysis<'tcx>,{
    tcx: TyCtxt<'tcx>,
    body: &'a Body<'tcx>,
    entry_sets: IndexVec<BasicBlock, A::Domain>,
    pass_name: Option<&'static str>,
    analysis: A,
    apply_statement_trans_for_block: Option<Box<dyn Fn(BasicBlock, &mut A::Domain)>>,
}

A solver for dataflow problems.

Fields

tcx: TyCtxt<'tcx>

body: &'a Body<'tcx>

entry_sets: IndexVec<BasicBlock, A::Domain>

pass_name: Option<&'static str>

analysis: A

apply_statement_trans_for_block: Option<Box<dyn Fn(BasicBlock, &mut A::Domain)>>

Cached, cumulative transfer functions for each block.

Implementations

impl<'a, 'tcx, A, D, T> Engine<'a, 'tcx, A>where A: GenKillAnalysis<'tcx, Idx = T, Domain = D>, D: Clone + JoinSemiLattice + GenKill<T> + BitSetExt<T>, T: Idx,

pub fn new_gen_kill( tcx: TyCtxt<'tcx>, body: &'a Body<'tcx>, analysis: A ) -> Self

Creates a new Engine to solve a gen-kill dataflow problem.

impl<'a, 'tcx, A, D> Engine<'a, 'tcx, A>where A: Analysis<'tcx, Domain = D>, D: Clone + JoinSemiLattice,

pub fn new_generic(tcx: TyCtxt<'tcx>, body: &'a Body<'tcx>, analysis: A) -> Self

Creates a new Engine to solve a dataflow problem with an arbitrary transfer function.

Gen-kill problems should use new_gen_kill, which will coalesce transfer functions for better performance.

fn new( tcx: TyCtxt<'tcx>, body: &'a Body<'tcx>, analysis: A, apply_statement_trans_for_block: Option<Box<dyn Fn(BasicBlock, &mut A::Domain)>> ) -> Self

pub fn pass_name(self, name: &'static str) -> Self

Adds an identifier to the graphviz output for this particular run of a dataflow analysis.

Some analyses are run multiple times in the compilation pipeline. Give them a pass_name to differentiate them. Otherwise, only the results for the latest run will be saved.

pub fn iterate_to_fixpoint(self) -> Results<'tcx, A>where A::Domain: DebugWithContext<A>,

Computes the fixpoint for this dataflow problem and returns it.

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.