Struct llhd::analysis::DominatorTree [−][src]
pub struct DominatorTree { /* fields omitted */ }
Expand description
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.
Implementations
👎 Deprecated since 0.13.0: use unit.domtree() instead
use unit.domtree() instead
Compute the dominator tree of a function or process.
This implementation is based on 1.
Get the blocks in the original CFG in post-order.
Get the post-order index of a block.
Check if a block dominates another.
Get the dominators of a block.
Get the followers of a block, i.e. the blocks it dominates.
Check if a block dominates another block.
Check if an instruction dominates a block.
Check if a value definition dominates a block.
Check if a block dominates an instruction.
A block does not dominate instructions within itself.
Check if an instruction dominates another instruction.
Check if a value definition dominates an instruction.
Check if a block dominates a value definition.
A block does not dominate values within itself.
Check if an instruction dominates a value definition.
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for DominatorTree
impl Send for DominatorTree
impl Sync for DominatorTree
impl Unpin for DominatorTree
impl UnwindSafe for DominatorTree
Blanket Implementations
Mutably borrows from an owned value. Read more