Struct CfgInfo 

struct CfgInfo {
    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: Vector<BlockId, BlockData>,
}

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: Vector<BlockId, BlockData>

Computed data about each block.

Implementations

impl CfgInfo

fn build(body: &BodyContents) -> Result<Self, Irreducible>

Build the CFGs (the “regular” CFG and the CFG without backward edges) and compute some information like the loop entries and the switch blocks.

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

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

fn make_ord_block_id(&self, block_id: BlockId) -> BlockWithRank<u32>

Create an OrdBlockId from a block id and a rank given by a map giving a sort (topological in our use cases) over the graph.

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

Trait Implementations

impl Debug for CfgInfo

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

Formats the value using the given formatter.