Refactor a bunch of includes so that TargetMachine.h doesn't have to include

[oota-llvm.git] / lib / CodeGen / SelectionDAG / ScheduleDAG.cpp

diff --git a/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp b/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp
index e05d9d71031e27ec4ab6ed310aa5671956c76c34..5100f3a3dcf25dd77ab461b8196191d5981c01be 100644 (file)
--- a/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp
+++ b/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp
@@ -18,6 +18,7 @@
 #include "llvm/CodeGen/MachineConstantPool.h"
 #include "llvm/CodeGen/MachineFunction.h"
 #include "llvm/CodeGen/SSARegMap.h"
+#include "llvm/Target/TargetData.h"
 #include "llvm/Target/TargetMachine.h"
 #include "llvm/Target/TargetInstrInfo.h"
 #include "llvm/Target/TargetLowering.h"
@@ -170,27 +171,31 @@ void ScheduleDAG::BuildSchedUnits() {
   return;
 }
 
-static void CalculateDepths(SUnit *SU, unsigned Depth) {
-  if (Depth > SU->Depth) SU->Depth = Depth;
-  for (std::set<std::pair<SUnit*, bool> >::iterator I = SU->Succs.begin(),
-         E = SU->Succs.end(); I != E; ++I)
-    CalculateDepths(I->first, Depth+1);
+static void CalculateDepths(SUnit *SU, unsigned Depth, unsigned Max) {
+  if (Depth > SU->Depth) {
+    SU->Depth = Depth;
+    for (std::set<std::pair<SUnit*, bool> >::iterator I = SU->Succs.begin(),
+           E = SU->Succs.end(); I != E; ++I)
+      CalculateDepths(I->first, Depth+1, Max);
+  }
 }
 
 void ScheduleDAG::CalculateDepths() {
   SUnit *Entry = SUnitMap[DAG.getEntryNode().Val];
-  ::CalculateDepths(Entry, 0U);
+  ::CalculateDepths(Entry, 0U, SUnits.size());
   for (unsigned i = 0, e = SUnits.size(); i != e; ++i)
     if (SUnits[i].Preds.size() == 0 && &SUnits[i] != Entry) {
-      ::CalculateDepths(&SUnits[i], 0U);
+      ::CalculateDepths(&SUnits[i], 0U, SUnits.size());
     }
 }
 
 static void CalculateHeights(SUnit *SU, unsigned Height) {
-  if (Height > SU->Height) SU->Height = Height;
-  for (std::set<std::pair<SUnit*, bool> >::iterator I = SU->Preds.begin(),
-         E = SU->Preds.end(); I != E; ++I)
-    CalculateHeights(I->first, Height+1);
+  if (Height > SU->Height) {
+    SU->Height = Height;
+    for (std::set<std::pair<SUnit*, bool> >::iterator I = SU->Preds.begin(),
+           E = SU->Preds.end(); I != E; ++I)
+      CalculateHeights(I->first, Height+1);
+  }
 }
 void ScheduleDAG::CalculateHeights() {
   SUnit *Root = SUnitMap[DAG.getRoot().Val];