Struct DominatorTree 

pub struct DominatorTree { /* private fields */ }

Dominator tree for a control flow graph.

Uses the iterative data-flow algorithm (Cooper, Harvey, Kennedy): simple, correct, and fast enough for the small CFGs produced by Lua functions.

Implementations

impl DominatorTree

pub fn build(cfg: &ControlFlowGraph) -> Self

Build the dominator tree from a CFG. Entry block is assumed to be block 0.

pub fn idom(&self, b: usize) -> usize

Immediate dominator of block b.

pub fn children(&self, b: usize) -> &[usize]

Children of block b in the dominator tree.

pub fn frontier(&self, b: usize) -> &[usize]

Dominance frontier of block b.

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

Check if block a dominates block b.

pub fn num_blocks(&self) -> usize

Number of blocks.

Trait Implementations

impl Debug for DominatorTree

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

Formats the value using the given formatter.

impl Display for DominatorTree

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

Formats the value using the given formatter.