Struct DominatorTree 

pub struct DominatorTree {
    pub dom: Vec<Option<VertexId>>,
    pub tree: Graph,
    pub leftout: Vec<VertexId>,
}

A dominator tree of a flowgraph, see Graph::dominator_tree.

Fields

dom: Vec<Option<VertexId>>

Immediate dominator of each vertex, indexed by vertex id. It is None for the root itself and for the vertices unreachable from the root (the latter are also listed in leftout).

tree: Graph

The dominator tree as a directed graph on the same vertex set, with an edge from idom(w) to w (reversed when mode is NeighborMode::In); unreachable vertices are isolated.

leftout: Vec<VertexId>

Ids of the vertices that are not reachable from the root.

Implementations

impl DominatorTree

pub fn dominators(&self, v: VertexId) -> Vec<VertexId>

Returns the chain of dominators of v, from its immediate dominator up to the root (empty for the root and for unreachable vertices).

Panics if v is not a valid vertex id of the analysed graph.

Trait Implementations

impl Clone for DominatorTree

fn clone(&self) -> DominatorTree

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 PartialEq for DominatorTree

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for DominatorTree