[llvm-commits] CVS: llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp

[Misha Brukman]

Changes in directory llvm/lib/CodeGen/ModuloScheduling:

MSchedGraph.cpp updated: 1.5 -> 1.6

---
Log message:

Add #include <cstdlib> and abort() to silence a warning


---
Diffs of the changes:  (+6 -5)

Index: llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp
diff -u llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp:1.5 llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp:1.6
--- llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp:1.5	Fri Jul 30 18:36:10 2004
+++ llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp	Mon Aug  2 09:02:21 2004
@@ -1,4 +1,4 @@
-//===-- MSchedGraph.cpp - Scheduling Graph ------------------------*- C++ -*-===//
+//===-- MSchedGraph.cpp - Scheduling Graph ----------------------*- C++ -*-===//
 //
 //                     The LLVM Compiler Infrastructure
 //
@@ -17,6 +17,7 @@
 #include "llvm/CodeGen/MachineBasicBlock.h"
 #include "llvm/Target/TargetInstrInfo.h"
 #include "Support/Debug.h"
+#include <cstdlib>
 using namespace llvm;
 
 MSchedGraphNode::MSchedGraphNode(const MachineInstr* inst, 
@@ -35,13 +36,13 @@
 MSchedGraphEdge MSchedGraphNode::getInEdge(MSchedGraphNode *pred) {
   //Loop over all the successors of our predecessor
   //return the edge the corresponds to this in edge
-  for(MSchedGraphNode::succ_iterator I = pred->succ_begin(), E = pred->succ_end();
-      I != E; ++I) {
-    if(*I == this)
+  for (MSchedGraphNode::succ_iterator I = pred->succ_begin(), 
+         E = pred->succ_end(); I != E; ++I) {
+    if (*I == this)
       return I.getEdge();
   }
   assert(0 && "Should have found edge between this node and its predecessor!");
- 
+  abort();
 }
 
 unsigned MSchedGraphNode::getInEdgeNum(MSchedGraphNode *pred) {