Struct DominatorTree 

pub struct DominatorTree {
    pub idom: Vec<Option<usize>>,
    pub children: Vec<Vec<usize>>,
    /* private fields */
}

Immediate dominators, constant-time dominance, and logarithmic LCA queries.

Fields

idom: Vec<Option<usize>>

children: Vec<Vec<usize>>

Implementations

impl DominatorTree

pub fn compute(successors: &[Vec<usize>], root: usize) -> Result<Self, CfgError>

Compute dominance without constructing loop, SCC, or frontier tables. Vertices unreachable from root have no dominance interval.

pub fn from_idom( idom: Vec<Option<usize>>, root: usize, ) -> Result<Self, CfgError>

Construct dominance intervals from an independently supplied idom tree.

pub fn dominates(&self, dominator: usize, block: usize) -> bool

pub fn depth(&self, block: usize) -> Option<usize>

Distance from the root, or None for an unreachable or unknown block.

pub fn lca(&self, left: usize, right: usize) -> Option<usize>

Trait Implementations

impl Clone for DominatorTree

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DominatorTree

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

Formats the value using the given formatter.

impl Eq for DominatorTree

impl PartialEq for DominatorTree

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for DominatorTree