Struct DomTree 

pub struct DomTree { /* private fields */ }

Dominator tree for a single function.

idom[i] is the immediate dominator of block i. The entry block’s entry is None (it has no dominator).

Implementations

impl DomTree

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

Compute the dominator tree using the Cooper/Harvey/Kennedy iterative algorithm on the RPO-numbered CFG.

pub fn idom(&self, bid: BlockId) -> Option<BlockId>

Immediate dominator of bid. Returns None for the entry block and for blocks unreachable from entry.

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

Returns true if block a dominates block b. Every block dominates itself.

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

Returns true if block a strictly dominates block b (dominates but is not equal to b).

pub fn dominance_frontier(&self, cfg: &Cfg) -> HashMap<BlockId, Vec<BlockId>>

Compute the dominance frontier for every block.

DF[b] = set of blocks y such that b dominates a predecessor of y but does not strictly dominate y. Used for φ-node placement in SSA.