From 9631a60020c783257bbab521d2180efc03a23cf2 Mon Sep 17 00:00:00 2001
From: Evan Cheng <evan.cheng@apple.com>
Date: Tue, 1 Aug 2006 08:20:41 +0000
Subject: Added AssignTopologicalOrder() to assign each node an unique id based
 on their topological order.

llvm-svn: 29431
---
 llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp | 40 ++++++++++++++++++++++++--
 1 file changed, 38 insertions(+), 2 deletions(-)

(limited to 'llvm/lib/CodeGen')

diff --git a/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp b/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp
index 8c40a72bec1..943a9501852 100644
--- a/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp
+++ b/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp
@@ -28,6 +28,7 @@
 #include <set>
 #include <cmath>
 #include <algorithm>
+#include <deque>
 using namespace llvm;
 
 static bool isCommutativeBinOp(unsigned Opcode) {
@@ -2698,8 +2699,8 @@ void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
 }
 
 
-/// AssignNodeIds - Assign a unique node id for each node in the DAG. It returns
-/// the maximum id.
+/// AssignNodeIds - Assign a unique node id for each node in the DAG based on
+/// their allnodes order. It returns the maximum id.
 unsigned SelectionDAG::AssignNodeIds() {
   unsigned Id = 0;
   for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
@@ -2709,6 +2710,41 @@ unsigned SelectionDAG::AssignNodeIds() {
   return Id;
 }
 
+/// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
+/// based on their topological order. It returns a vector of the SDNodes* in
+/// assigned order.
+std::vector<SDNode*> SelectionDAG::AssignTopologicalOrder() {
+  unsigned DAGSize = AllNodes.size();
+  std::vector<SDNode*> TopOrder;
+  std::map<SDNode*, unsigned> InDegree;
+  std::deque<SDNode*> Sources;
+  for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
+    SDNode *N = I;
+    unsigned Degree = N->use_size();
+    InDegree[N] = Degree;
+    if (Degree == 0)
+      Sources.push_back(I);
+  }
+
+  int Id = 0;
+  while (!Sources.empty()) {
+    SDNode *N = Sources.front();
+    Sources.pop_front();
+    TopOrder.push_back(N);
+    N->setNodeId(Id++);
+    for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
+      SDNode *P = I->Val;
+      unsigned Degree = InDegree[P] - 1;
+      if (Degree == 0)
+        Sources.push_back(P);
+      InDegree[P] = Degree;
+    }
+  }
+
+  return TopOrder;
+}
+
+
 
 //===----------------------------------------------------------------------===//
 //                              SDNode Class
-- 
cgit v1.2.3