Struct ControlFlowGraph

pub struct ControlFlowGraph {
    pub blocks: IndexVec<BasicBlockId, BasicBlock>,
    /* private fields */
}

Fields

blocks: IndexVec<BasicBlockId, BasicBlock>

Implementations

impl ControlFlowGraph

pub fn new(blocks: IndexVec<BasicBlockId, BasicBlock>, mir: &Mir) -> Self

pub fn start(&self) -> BasicBlockId

pub const fn end(&self) -> BasicBlockId

pub fn postorder(&self) -> Postorder

pub fn postorder_iter(&self) -> PostorderIter<'_>

pub fn postorder_itermut(&mut self) -> PostorderIterMut<'_>

pub fn reverse_postorder(&self) -> ReversePostorder

pub fn reverse_postorder_iter(&self) -> ReversePostorderIter<'_>

pub fn reverse_postorder_itermut(&mut self) -> ReversePostorderIterMut<'_>

pub fn predecessors(&self, bb: BasicBlockId) -> &[BasicBlockId]

pub fn containing_block(&self, stmt: StatementId) -> Option<BasicBlockId>

pub fn successors(&self, bb: BasicBlockId) -> Successors

pub fn simplify(&mut self)

pub fn remove_dead_code(&mut self, dead_blocks: &BitSet<BasicBlockId>)

impl ControlFlowGraph

pub fn constant_fold( &mut self, fold: &mut impl ConstantFolder, udg: &mut UseDefGraph, known_values: &mut ConstantFoldState, write_intermediate: bool, )

impl ControlFlowGraph

pub fn backward_variable_slice( &mut self, var: VariableId, pdg: &ProgramDependenceGraph, )

pub fn backward_variable_slice_assuming_input( &mut self, input: BitSet<StatementId>, var: VariableId, pdg: &ProgramDependenceGraph, )

pub fn backward_variable_slice_with_variables_as_input( &mut self, input: impl Iterator<Item = VariableId>, var: VariableId, pdg: &ProgramDependenceGraph, )

pub fn backward_slice( &mut self, relevant_stmts: BitSet<StatementId>, assumed_stmts: BitSet<StatementId>, pdg: &ProgramDependenceGraph, )

impl ControlFlowGraph

pub fn control_dependence_graph(&self) -> ControlDependenceGraph

Calculates the Control Dependence Graph of a CFG. A basic block is control dependent on a statement if this statements decides whether the block is executed (for example an if statement). Statements that cause control flow are not represented as statements but as basic block terminators in the cfg. As such the control dependence Graph simply maps basic blocks to all basics block whos terminator affats whether a statements is executed

pub fn control_dependence_graph_from_ipdom( &self, ipdom: &IPDOM, ) -> ControlDependenceGraph

The backend for [control_dependence_graph] which can be used when ipdom(bb has already been calcualted to avoid recalculation

impl ControlFlowGraph

pub fn post_dominators(&self) -> IPDOM

An implementation of the simple fast algorithm by [Keith 2006]. It is adobted for post dominance (simply the dominance of the reverse cfg). returns - immediate Post_dominator for every cfg node (ipdom(n))

Trait Implementations

impl Clone for ControlFlowGraph

fn clone(&self) -> ControlFlowGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ControlFlowGraph

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

Formats the value using the given formatter.

impl Index<BasicBlockId> for ControlFlowGraph

type Output = BasicBlock

The returned type after indexing.

fn index(&self, index: BasicBlockId) -> &Self::Output

Performs the indexing (container[index]) operation.

impl Index<IdRange<BasicBlockId>> for ControlFlowGraph

type Output = IndexSlice<BasicBlockId, [BasicBlock]>

The returned type after indexing.

fn index(&self, range: IdRange<BasicBlockId>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl Index<Range<BasicBlockId>> for ControlFlowGraph

type Output = IndexSlice<BasicBlockId, [BasicBlock]>

The returned type after indexing.

fn index(&self, range: Range<BasicBlockId>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl IndexMut<BasicBlockId> for ControlFlowGraph

fn index_mut(&mut self, index: BasicBlockId) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl IndexMut<IdRange<BasicBlockId>> for ControlFlowGraph

fn index_mut(&mut self, range: IdRange<BasicBlockId>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl IndexMut<Range<BasicBlockId>> for ControlFlowGraph

fn index_mut(&mut self, range: Range<BasicBlockId>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.