Struct CfgInfo 

struct CfgInfo<'a> {
    pub cfg: DiGraphMap<BlockId, ()>,
    pub fwd_cfg: DiGraphMap<BlockId, ()>,
    pub loop_entries: HashSet<BlockId>,
    pub switch_blocks: HashSet<BlockId>,
    pub dominator_tree: Dominators<BlockId>,
    pub block_data: IndexVec<BlockId, BlockData<'a>>,
}

Information precomputed about a function’s CFG.

Fields

cfg: DiGraphMap<BlockId, ()>

The CFG

fwd_cfg: DiGraphMap<BlockId, ()>

The CFG where all the backward edges have been removed. Aka “forward CFG”.

loop_entries: HashSet<BlockId>

We consider the destination of the backward edges to be loop entries and store them here.

switch_blocks: HashSet<BlockId>

The blocks whose terminators are a switch are stored here.

dominator_tree: Dominators<BlockId>

Tree of which nodes dominates which other nodes.

block_data: IndexVec<BlockId, BlockData<'a>>

Computed data about each block.

Implementations

impl<'a> CfgInfo<'a>

fn build( ctx: &TransformCtx, body: &'a BodyContents, ) -> Result<Self, Irreducible>

Build the CFGs (the “regular” CFG and the CFG without backward edges) and precompute a bunch of graph information about the CFG.

fn block_data(&self, block_id: BlockId) -> &BlockData<'a>

fn topo_rank(&self, block_id: BlockId) -> u32

fn is_backward_edge(&self, src: BlockId, tgt: BlockId) -> bool

fn is_within_loop(&self, loop_header: BlockId, block_id: BlockId) -> bool

Check if the node is within the given loop.

fn all_paths_go_through( &self, src: BlockId, through_node: BlockId, target_set: &HashSet<BlockId>, ) -> bool

Check if all paths from src to nodes in target_set go through through_node. If src is already in target_set, we ignore that empty path.

Trait Implementations

impl<'a> Debug for CfgInfo<'a>

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

Formats the value using the given formatter.