Struct IteratedDominanceFrontierResult 

pub struct IteratedDominanceFrontierResult {
    pub phi_nodes: AHashSet<i64>,
    pub iterations: usize,
}

Iterated dominance frontier result (for SSA φ-placement).

The iterated dominance frontier finds all nodes that need φ-functions for a given set of definition nodes. This is computed by fixed-point iteration: IDF(S) = DF(S) ∪ DF(DF(S)) ∪ DF(DF(DF(S))) ∪ ...

Example

use ahash::AHashSet;

let mut definitions = AHashSet::new();
definitions.insert(1);
definitions.insert(3);

let idf_result = iterated_dominance_frontiers(&graph, &dom_result, &definitions)?;

println!("Place φ-nodes at: {:?}", idf_result.phi_nodes);
println!("Converged in {} iterations", idf_result.iterations);

Fields

phi_nodes: AHashSet<i64>

Set of nodes that need φ-functions.

This is the fixed-point result of iterated dominance frontier computation. All nodes in this set should have φ-nodes placed during SSA construction.

iterations: usize

Number of iterations to reach fixed point.

Useful for understanding CFG complexity. Small values (2-4) are typical for well-structured programs.

Trait Implementations

impl Clone for IteratedDominanceFrontierResult

fn clone(&self) -> IteratedDominanceFrontierResult

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IteratedDominanceFrontierResult

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

Formats the value using the given formatter.