Struct DomTree 

pub struct DomTree {
    pub idom: HashMap<BlockId, BlockId>,
    pub children: HashMap<BlockId, Vec<BlockId>>,
    pub frontiers: HashMap<BlockId, HashSet<BlockId>>,
}

Dominator tree for a CFG.

Fields

idom: HashMap<BlockId, BlockId>

Immediate dominator of each block (entry has no idom).

children: HashMap<BlockId, Vec<BlockId>>

Children in the dominator tree.

frontiers: HashMap<BlockId, HashSet<BlockId>>

Dominance frontier for each block.

Implementations

impl DomTree

pub fn compute(cfg: &Cfg) -> Self

Compute the dominator tree using the Cooper-Harvey-Kennedy algorithm.

pub fn dominates(&self, a: BlockId, b: BlockId) -> bool

Returns true if a dominates b.

pub fn frontier(&self, block: BlockId) -> HashSet<BlockId>

Returns the dominance frontier of a block.