[][src]Struct llhd::pass::gcse::DominatorTree

pub struct DominatorTree { /* fields omitted */ }

A block dominator tree.

Records for every block which other blocks in the CFG have to be traversed to reach it. And vice versa, which blocks a block precedeces in all cases.

Methods

impl DominatorTree[src]

pub fn new(layout: &FunctionLayout, pred: &PredecessorTable) -> Self[src]

Compute the dominator tree of a function or process.

pub fn dominates(&self, dominator: Block, follower: Block) -> bool[src]

Check if a block dominates another.

pub fn dominators(&self, follower: Block) -> &HashSet<Block>[src]

Get the dominators of a block.

pub fn dominated_by(&self, dominator: Block) -> &HashSet<Block>[src]

Get the followers of a block, i.e. the blocks it dominates.

Trait Implementations

impl Clone for DominatorTree[src]

impl Debug for DominatorTree[src]

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.