Expand description
Dataflow graph construction and analysis.
Builds a dataflow graph (DFG) from an IR function by analyzing read/write sets of each statement and computing data dependencies (RAW, WAR, WAW) and control dependencies (barriers).
Provides topological sorting and critical path analysis.
Structs§
- Critical
Path Result - Result of critical path analysis.
- Dataflow
Graph - A dataflow graph built from an IR function’s statements.
- DfgEdge
- An edge in the dataflow graph representing a dependency.
- DfgNode
- A node in the dataflow graph representing a statement.
Enums§
- Dataflow
Error - Errors during dataflow analysis.
- Dependency
Kind - The kind of dependency between two DFG nodes.
- DfgNode
Kind - The kind of a DFG node, indicating what type of statement it represents.