Struct Dominators 

pub struct Dominators { /* private fields */ }

Which block every path from the entry has to pass through to reach another.

Implementations

impl Dominators

pub fn new(cfg: &Cfg) -> Self

Builds the tree from the graph.

A function with no blocks gives a tree that reaches nothing, and every query against it answers no, which is what a caller handed a declaration should see.

pub fn dominates(&self, of: Block, block: Block) -> bool

Whether every path from the entry to block goes through of.

A block dominates itself. Both ends have to be blocks control reaches, and an unreachable one dominates nothing and is dominated by nothing.

pub fn strictly_dominates(&self, of: Block, block: Block) -> bool

The same, without a block dominating itself.

pub fn immediate_dominator(&self, block: Block) -> Option<Block>

The nearest block that dominates this one and is not it.

None for the entry, which has no dominator above it, and for a block control does not reach.

pub fn children(&self, block: Block) -> impl Iterator<Item = Block> + use<'_>

The blocks whose immediate dominator is this one.

Walking these from the entry is how a pass visits a function in dominator tree order, which is the order that has every definition in hand before any use of it.

pub fn nearest_common_dominator(&self, a: Block, b: Block) -> Option<Block>

The nearest block that dominates both, which is the entry at worst.

None when either block is one control does not reach.

Trait Implementations

impl Clone for Dominators

fn clone(&self) -> Dominators

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Dominators

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

Formats the value using the given formatter.

impl Eq for Dominators

impl PartialEq for Dominators

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Dominators