Struct PostDominatorResult 

pub struct PostDominatorResult {
    pub post_dom: AHashMap<i64, AHashSet<i64>>,
    pub ipdom: AHashMap<i64, Option<i64>>,
}

Result of post-dominator computation.

Contains both full post-dominance sets and the immediate post-dominator tree. The post-dominance sets are complete: for each node n, post_dom[n] contains all nodes that post-dominate n (including n itself). The immediate post-dominator tree is a compact representation: ipdom[n] is the parent of n in the post-dominator tree (None for exit nodes).

Fields

post_dom: AHashMap<i64, AHashSet<i64>>

Full post-dominance sets: node -> set of its post-dominators.

For each node n, post_dom[n] contains all nodes d such that every path from n to exit passes through d. Every node post-dominates itself, and exit nodes post-dominate all nodes that can reach them.

ipdom: AHashMap<i64, Option<i64>>

Immediate post-dominator tree: node -> immediate post-dominator.

For each node n (except exit), ipdom[n] is the unique strict post-dominator of n that is closest to n. Exit nodes have ipdom[exit] = None. This forms a tree rooted at the exit node (or virtual exit for multiple exits).

Implementations

impl PostDominatorResult

pub fn post_dominates(&self, post_dominator: i64, node: i64) -> bool

Checks if one node post-dominates another.

Returns true if post_dominator post-dominates node (every path from node to exit passes through post_dominator). Every node post-dominates itself.

Arguments

• post_dominator - Potential post-dominator node ID
• node - Node ID to check post-dominance for

Returns

true if post_dominator post-dominates node, false otherwise.

Example

let result = post_dominators(&graph, exit)?;
assert!(result.post_dominates(exit, 0)); // Exit post-dominates all
assert!(result.post_dominates(5, 5));    // Every node post-dominates itself

pub fn immediate_post_dominator(&self, node: i64) -> Option<i64>

Gets the immediate post-dominator of a node.

Returns None if the node has no immediate post-dominator (exit nodes have None). Returns Some(ipdom) if the node has an immediate post-dominator.

Arguments

• node - Node ID to get immediate post-dominator for

Returns

Some(ipdom) if node has an immediate post-dominator, None for exit nodes.

Example

let result = post_dominators(&graph, exit)?;
assert_eq!(result.immediate_post_dominator(exit), None); // Exit has no ipdom
assert!(result.immediate_post_dominator(child).is_some()); // Others have ipdom

pub fn is_exit(&self, node: i64) -> bool

Checks if a node is an exit node (has no immediate post-dominator).

Arguments

• node - Node ID to check

Returns

true if node is an exit node, false otherwise.

Trait Implementations

impl Clone for PostDominatorResult

fn clone(&self) -> PostDominatorResult

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PostDominatorResult

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

Formats the value using the given formatter.