Struct DataflowGraph 

pub struct DataflowGraph { /* private fields */ }

A dataflow graph built from an IR function’s statements.

Nodes correspond to statements and edges represent data/control dependencies between them.

Implementations

impl DataflowGraph

pub fn build(func: &Function) -> Self

Build a dataflow graph from an IR function.

Walks statements in order, computes read/write sets, and creates dependency edges:

• RAW (DataFlow): a write followed by a read of the same expression
• WAR (AntiDependency): a read followed by a write of the same expression
• WAW (OutputDependency): two writes to the same expression
• Control: barriers create control edges to all subsequent memory operations

pub fn nodes(&self) -> &[DfgNode]

Returns the nodes in this graph.

pub fn edges(&self) -> &[DfgEdge]

Returns the edges in this graph.

pub fn node_count(&self) -> usize

Returns the number of nodes.

pub fn edge_count(&self) -> usize

Returns the number of edges.

pub fn successors(&self, node_id: usize) -> Vec<&DfgEdge>

Returns all edges originating from the given node.

pub fn predecessors(&self, node_id: usize) -> Vec<&DfgEdge>

Returns all edges pointing to the given node.

pub fn topological_sort(&self) -> Result<Vec<usize>, DataflowError>

Perform topological sort using Kahn’s algorithm.

Returns nodes in a valid execution order respecting all dependencies.

Errors

Returns DataflowError::CycleDetected if the graph contains a cycle.

pub fn critical_path(&self) -> CriticalPathResult

Compute the critical path through the DFG.

Assigns a unit cost of 1 to each node and computes the longest path from any source node (no predecessors) to any sink node (no successors).

Returns the cost for each node (longest path from any source to that node) and the critical path length.

pub fn critical_path_with_costs(&self, costs: &[usize]) -> CriticalPathResult

Compute the critical path with custom per-node costs.

costs[i] is the execution cost of node i.

Returns the cost for each node and the critical path length.

pub fn parallel_groups(&self) -> Vec<Vec<usize>>

Identify groups of independent nodes that can execute concurrently.

Returns a list of groups, where each group contains node IDs that have no dependencies between them and can execute in parallel.

Trait Implementations

impl Clone for DataflowGraph

fn clone(&self) -> DataflowGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DataflowGraph

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

Formats the value using the given formatter.

impl Display for DataflowGraph

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

Formats the value using the given formatter.