* Remove lots of unnecesary #includes

* Remove extra flyers
* Remove dependence on stringExtras by eliminating printIndent calls


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@486 91177308-0d34-0410-b5e6-96231b3b80d8

1 files changed, 6 insertions, 29 deletions

diff --git a/include/llvm/CodeGen/SchedPriorities.h b/include/llvm/CodeGen/SchedPriorities.h
index bfabdb8464..dba9835599 100644
--- a/include/llvm/CodeGen/SchedPriorities.h
+++ b/include/llvm/CodeGen/SchedPriorities.h
@@ -21,32 +21,14 @@
 #ifndef LLVM_CODEGEN_SCHEDPRIORITIES_H
 #define LLVM_CODEGEN_SCHEDPRIORITIES_H
 
-//************************** System Include Files **************************/
-
-#include <hash_map>
-#include <list>
-#include <vector>
-#include <algorithm>
-
-//*************************** User Include Files ***************************/
-
-#include "llvm/CFG.h"			// just for graph iterators
-#include "llvm/Support/NonCopyable.h"
-#include "llvm/Support/HashExtras.h"
+#include "llvm/CodeGen/InstrScheduling.h"
 #include "llvm/Analysis/LiveVar/MethodLiveVarInfo.h"
 #include "llvm/CodeGen/SchedGraph.h"
-#include "llvm/CodeGen/InstrScheduling.h"
-
-//************************* Opaque Declarations ****************************/
 
 class Method;
 class MachineInstr;
 class SchedulingManager;
 
-/******************** Exported Data Types and Constants ********************/
-
-
-//*********************** Public Class Declarations ************************/
 
 struct NodeDelayPair {
   const SchedGraphNode* node;
@@ -196,28 +178,23 @@ SchedPriorities::insertReady(const SchedGraphNode* node)
   
   if (SchedDebugLevel >= Sched_PrintSchedTrace)
     {
-      printIndent(2);
-      cout << "Cycle " << this->getTime() << ": "
+      cout << "    Cycle " << this->getTime() << ": "
 	   << " Node " << node->getNodeId() << " is ready; "
 	   << " Delay = " << this->getNodeDelayRef(node) << "; Instruction: "
 	   << endl;
-      printIndent(4);
-      cout << * node->getMachineInstr() << endl;
+      cout << "        " << *node->getMachineInstr() << endl;
     }
 }
 
-inline void
-SchedPriorities::updateTime(cycles_t c)
-{
+inline void SchedPriorities::updateTime(cycles_t c) {
   curTime = c;
   nextToTry = candsAsHeap.begin();
   mcands.clear();
 }
 
 inline ostream& operator<< (ostream& os, const NodeDelayPair* nd) {
-  os << "Delay for node " << nd->node->getNodeId()
-     << " = " << nd->delay << endl;
-  return os;
+  return os << "Delay for node " << nd->node->getNodeId()
+	    << " = " << nd->delay << endl;
 }
 
 /***************************************************************************/