Struct rustc_data_structures::graph::dominators::Dominators

pub struct Dominators<N: Idx> {
    start_node: N,
    post_order_rank: IndexVec<N, usize>,
    immediate_dominators: IndexVec<N, Option<N>>,
    time: IndexVec<N, Time>,
}

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

impl<Node: Idx> Dominators<Node>

pub fn is_reachable(&self, node: Node) -> bool

Returns true if node is reachable from the start node.

pub fn immediate_dominator(&self, node: Node) -> Option<Node>

Returns the immediate dominator of node, if any.

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 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.

pub fn dominates(&self, a: Node, b: Node) -> bool

Returns true if a dominates b.

Panics

Panics if b is unreachable.

Trait Implementations

impl<N: Clone + Idx> Clone for Dominators<N>

fn clone(&self) -> Dominators<N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Debug + Idx> Debug for Dominators<N>

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

Formats the value using the given formatter.

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.