Struct rustc_data_structures::graph::dominators::Dominators
source · pub struct Dominators<N: Idx> {
start_node: N,
post_order_rank: IndexVec<N, usize>,
immediate_dominators: IndexVec<N, Option<N>>,
time: IndexVec<N, Time>,
}
Expand description
Tracks the list of dominators for each node.
Fields§
§start_node: N
§post_order_rank: IndexVec<N, usize>
§immediate_dominators: IndexVec<N, Option<N>>
§time: IndexVec<N, Time>
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
Returns true if node is reachable from the start node.
sourcepub fn immediate_dominator(&self, node: Node) -> Option<Node>
pub fn immediate_dominator(&self, node: Node) -> Option<Node>
Returns the immediate dominator of node, if any.
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.
sourcepub fn cmp_in_dominator_order(&self, lhs: Node, rhs: Node) -> Ordering
pub fn cmp_in_dominator_order(&self, lhs: Node, rhs: Node) -> 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§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
impl<'a, T> Captures<'a> for Twhere T: ?Sized,
Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.