summaryrefslogtreecommitdiff
path: root/src/gallium/drivers/nouveau/codegen/nv50_ir_graph.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/gallium/drivers/nouveau/codegen/nv50_ir_graph.cpp')
-rw-r--r--src/gallium/drivers/nouveau/codegen/nv50_ir_graph.cpp10
1 files changed, 10 insertions, 0 deletions
diff --git a/src/gallium/drivers/nouveau/codegen/nv50_ir_graph.cpp b/src/gallium/drivers/nouveau/codegen/nv50_ir_graph.cpp
index 3f8d00a1c99..23414d54ab1 100644
--- a/src/gallium/drivers/nouveau/codegen/nv50_ir_graph.cpp
+++ b/src/gallium/drivers/nouveau/codegen/nv50_ir_graph.cpp
@@ -336,6 +336,16 @@ IteratorRef Graph::safeIteratorCFG()
return this->iteratorCFG();
}
+/**
+ * Edge classification:
+ *
+ * We have a graph and want to classify the edges into one of four types:
+ * - TREE: edges that belong to a spanning tree of the graph
+ * - FORWARD: edges from a node to a descendent in the spanning tree
+ * - BACK: edges from a node to a parent (or itself) in the spanning tree
+ * - CROSS: all other edges (because they cross between branches in the
+ * spanning tree)
+ */
void Graph::classifyEdges()
{
int seq;