Struct ControlFlowAnalysis 

pub struct ControlFlowAnalysis {
    pub dominators: HashMap<NodeId, Option<NodeId>>,
    pub dominated: HashMap<NodeId, HashSet<NodeId>>,
    pub loops: Vec<LoopInfo>,
    pub conditionals: Vec<ConditionalInfo>,
    pub stats: ControlFlowStats,
}

Control flow analysis for identifying loops, conditions, and dominance relationships

Fields

dominators: HashMap<NodeId, Option<NodeId>>

Dominator tree: each node maps to its immediate dominator

dominated: HashMap<NodeId, HashSet<NodeId>>

Dominated nodes: each node maps to the set of nodes it dominates

loops: Vec<LoopInfo>

Loop information

conditionals: Vec<ConditionalInfo>

Conditional blocks

stats: ControlFlowStats

Statistics about the control flow

Implementations

impl ControlFlowAnalysis

pub fn new() -> Self

Create a new control flow analysis

pub fn analyze(graph: &ComputationGraph) -> JitResult<Self>

Analyze a computation graph for control flow patterns

pub fn is_in_loop(&self, node: NodeId) -> bool

Check if a node is inside a loop

pub fn is_in_conditional(&self, node: NodeId) -> bool

Check if a node is inside a conditional branch

pub fn containing_loop(&self, node: NodeId) -> Option<&LoopInfo>

Get the loop that contains a given node

pub fn containing_conditional(&self, node: NodeId) -> Option<&ConditionalInfo>

Get the conditional that contains a given node

Trait Implementations

impl Clone for ControlFlowAnalysis

fn clone(&self) -> ControlFlowAnalysis

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ControlFlowAnalysis

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

Formats the value using the given formatter.

impl Default for ControlFlowAnalysis

fn default() -> Self

Returns the “default value” for a type.