Struct DominatorTree 

pub struct DominatorTree<N: CfgNode> { /* private fields */ }

Immediate-dominator tree for a PcodeCfg.

idom[n] = Some(d) means d is the unique immediate dominator of n. idom[n] = None means n is an entry node. Unreachable nodes are absent from the map.

Implementations

impl<N: CfgNode> DominatorTree<N>

pub fn compute<D>(cfg: &PcodeCfg<N, D>) -> Self

Compute the dominator tree for cfg.

pub fn immediate_dominator(&self, node: &N) -> Option<&N>

Return the immediate dominator of node, or None for entry nodes. Returns None for unreachable nodes (not present in the tree).

pub fn dominators<'a>(&'a self, node: &'a N) -> impl Iterator<Item = &'a N>

Iterate over all dominators of node (inclusive), walking up the idom chain.

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

Returns true if a dominates b (reflexive: a node dominates itself).

pub fn strict_dominates(&self, a: &N, b: &N) -> bool

Returns true if a strictly dominates b (a dominates b and a != b).

pub fn dominance_frontier<D>( &self, node: &N, cfg: &PcodeCfg<N, D>, ) -> HashSet<N>

Compute the dominance frontier of node.

DF(n) = { y | ∃ predecessor p of y such that n dominates p, and n does not strictly dominate y }.