Make it compile with GCC 3.0.4
authorChris Lattner <sabre@nondot.org>
Sun, 24 Feb 2002 23:01:21 +0000 (23:01 +0000)
committerChris Lattner <sabre@nondot.org>
Sun, 24 Feb 2002 23:01:21 +0000 (23:01 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@1786 91177308-0d34-0410-b5e6-96231b3b80d8

include/llvm/Analysis/LiveVar/ValueSet.h
include/llvm/CodeGen/ValueSet.h
lib/Analysis/LiveVar/BBLiveVar.cpp
lib/Analysis/LiveVar/ValueSet.cpp
lib/Target/SparcV9/LiveVar/BBLiveVar.cpp
lib/Target/SparcV9/LiveVar/ValueSet.cpp
lib/VMCore/Verifier.cpp

index 048d8df4c55a2f324a5f0f723720bfb141a3e4e4..0c0aefad2062e668253b216f8b73fed06f9891fb 100644 (file)
@@ -10,7 +10,7 @@ struct RAV {  // Register Allocator Value
   const Value *V;
   RAV(const Value *v) : V(v) {}
 };
-ostream &operator<<(ostream &out, RAV Val);
+std::ostream &operator<<(std::ostream &out, RAV Val);
 
 
 typedef std::set<const Value*> ValueSet;
index 048d8df4c55a2f324a5f0f723720bfb141a3e4e4..0c0aefad2062e668253b216f8b73fed06f9891fb 100644 (file)
@@ -10,7 +10,7 @@ struct RAV {  // Register Allocator Value
   const Value *V;
   RAV(const Value *v) : V(v) {}
 };
-ostream &operator<<(ostream &out, RAV Val);
+std::ostream &operator<<(std::ostream &out, RAV Val);
 
 
 typedef std::set<const Value*> ValueSet;
index 1468301dfcef3720188fd3d35e4c7e4387abd4a2..c6b8a3b8f2cfb2221bb907c193a702e53edc03e7 100644 (file)
@@ -10,6 +10,7 @@
 #include "llvm/BasicBlock.h"
 #include "llvm/Support/CFG.h"
 #include "Support/SetOperations.h"
+#include <iostream>
 
 /// BROKEN: Should not include sparc stuff directly into here
 #include "../../Target/Sparc/SparcInternals.h"  //  Only for PHI defn
index 88dd25a0331cfdd8c97ee9b2b17eb59befbb47f1..ec1d7808efdd8dd8f9d33ab225b3d0bdfb4e7ea7 100644 (file)
@@ -5,7 +5,7 @@
 #include "llvm/ConstantVals.h"
 #include <iostream>
 
-ostream &operator<<(ostream &O, RAV V) { // func to print a Value 
+std::ostream &operator<<(std::ostream &O, RAV V) { // func to print a Value 
   const Value *v = V.V;
   if (v->hasName())
     return O << v << "(" << v->getName() << ") ";
index 1468301dfcef3720188fd3d35e4c7e4387abd4a2..c6b8a3b8f2cfb2221bb907c193a702e53edc03e7 100644 (file)
@@ -10,6 +10,7 @@
 #include "llvm/BasicBlock.h"
 #include "llvm/Support/CFG.h"
 #include "Support/SetOperations.h"
+#include <iostream>
 
 /// BROKEN: Should not include sparc stuff directly into here
 #include "../../Target/Sparc/SparcInternals.h"  //  Only for PHI defn
index 88dd25a0331cfdd8c97ee9b2b17eb59befbb47f1..ec1d7808efdd8dd8f9d33ab225b3d0bdfb4e7ea7 100644 (file)
@@ -5,7 +5,7 @@
 #include "llvm/ConstantVals.h"
 #include <iostream>
 
-ostream &operator<<(ostream &O, RAV V) { // func to print a Value 
+std::ostream &operator<<(std::ostream &O, RAV V) { // func to print a Value 
   const Value *v = V.V;
   if (v->hasName())
     return O << v << "(" << v->getName() << ") ";
index 18c3c33b08e6f7a9a8bfb7483aef4ad2672e1e94..a7f5369a6086895ce54b25dfd2bc71475bb3bc1e 100644 (file)
@@ -64,7 +64,7 @@ static long ValidTypes[Type::FirstDerivedTyID] = {
 // failed.  This provides a nice place to put a breakpoint if you want to see
 // why something is not correct.
 //
-static inline void CheckFailed(const char *Cond, const string &Message,
+static inline void CheckFailed(const char *Cond, const std::string &Message,
                                const Value *V1 = 0, const Value *V2 = 0) {
   std::cerr << Message << "\n";
   if (V1) std::cerr << V1 << "\n";
@@ -100,14 +100,14 @@ static bool verifyInstruction(const Instruction *I) {
 
   // Check that PHI nodes look ok
   if (const PHINode *PN = dyn_cast<PHINode>(I)) {
-    vector<const BasicBlock*> Preds(pred_begin(I->getParent()),
-                                    pred_end(I->getParent()));
+    std::vector<const BasicBlock*> Preds(pred_begin(I->getParent()),
+                                         pred_end(I->getParent()));
     // Loop over all of the incoming values, make sure that there are
     // predecessors for each one...
     //
     for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
       const BasicBlock *BB = PN->getIncomingBlock(i);
-      vector<const BasicBlock*>::iterator PI =
+      std::vector<const BasicBlock*>::iterator PI =
         find(Preds.begin(), Preds.end(), BB);
       Assert2(PI != Preds.end(), "PHI node has entry for basic block that"
               " is not a predecessor!", PN, BB);
@@ -115,8 +115,8 @@ static bool verifyInstruction(const Instruction *I) {
     }
 
     // There should be no entries left in the predecessor list...
-    for (vector<const BasicBlock*>::iterator I = Preds.begin(), E = Preds.end();
-         I != E; ++I)
+    for (std::vector<const BasicBlock*>::iterator I = Preds.begin(),
+           E = Preds.end(); I != E; ++I)
       Assert2(0, "PHI node does not have entry for a predecessor basic block!",
               PN, *I);
   }