Struct rustc_data_structures::graph::dominators::Dominators
source · pub struct Dominators<N: Idx> {
post_order_rank: IndexVec<N, usize>,
immediate_dominators: IndexVec<N, Option<N>>,
}
Expand description
Tracks the list of dominators for each node.
Fields§
§post_order_rank: IndexVec<N, usize>
§immediate_dominators: IndexVec<N, Option<N>>
Implementations§
source§impl<Node: Idx> Dominators<Node>
impl<Node: Idx> Dominators<Node>
sourcepub fn is_reachable(&self, node: Node) -> bool
pub fn is_reachable(&self, node: Node) -> bool
Whether the given Node has an immediate dominator.
pub fn immediate_dominator(&self, node: Node) -> Node
sourcepub fn dominators(&self, node: Node) -> Iter<'_, Node> ⓘ
pub fn dominators(&self, node: Node) -> Iter<'_, Node> ⓘ
Provides an iterator over each dominator up the CFG, for the given Node.
See the impl Iterator for Iter
definition to understand how this works.
pub fn dominates(&self, dom: Node, node: Node) -> bool
sourcepub fn rank_partial_cmp(&self, lhs: Node, rhs: Node) -> Option<Ordering>
pub fn rank_partial_cmp(&self, lhs: Node, rhs: Node) -> Option<Ordering>
Provide deterministic ordering of nodes such that, if any two nodes have a dominator relationship, the dominator will always precede the dominated. (The relative ordering of two unrelated nodes will also be consistent, but otherwise the order has no meaning.) This method cannot be used to determine if either Node dominates the other.
Trait Implementations§
Auto Trait Implementations§
impl<N> RefUnwindSafe for Dominators<N>where N: RefUnwindSafe,
impl<N> Send for Dominators<N>where N: Send,
impl<N> Sync for Dominators<N>where N: Sync,
impl<N> Unpin for Dominators<N>where N: Unpin,
impl<N> UnwindSafe for Dominators<N>where N: UnwindSafe,
Blanket Implementations§
impl<'a, T> Captures<'a> for Twhere T: ?Sized,
impl<T> Erased for T
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference’s “Type Layout” chapter for details on type layout guarantees.
Size: 48 bytes