Changes in directory llvm/include/llvm/ADT:
BitSetVector.h updated: 1.16 -> 1.17
EquivalenceClasses.h updated: 1.17 -> 1.18
SCCIterator.h updated: 1.22 -> 1.23
---
Log message:
Support for llvm_ostreams.
---
Diffs of the changes: (+8 -8)
BitSetVector.h | 4 ++--
EquivalenceClasses.h | 4 ++--
SCCIterator.h | 8 ++++----
3 files changed, 8 insertions(+), 8 deletions(-)
Index: llvm/include/llvm/ADT/BitSetVector.h
diff -u llvm/include/llvm/ADT/BitSetVector.h:1.16
llvm/include/llvm/ADT/BitSetVector.h:1.17
--- llvm/include/llvm/ADT/BitSetVector.h:1.16 Tue Nov 28 16:21:29 2006
+++ llvm/include/llvm/ADT/BitSetVector.h Tue Nov 28 17:31:42 2006
@@ -29,7 +29,7 @@
#include <bitset>
#include <vector>
#include <functional>
-#include <iostream>
+#include <ostream>
namespace llvm {
@@ -178,7 +178,7 @@
if (O.stream()) print(*O.stream());
}
void print(std::ostream &O) const;
- void dump() const { print(std::cerr); }
+ void dump() const { print(llvm_cerr); }
public:
//
Index: llvm/include/llvm/ADT/EquivalenceClasses.h
diff -u llvm/include/llvm/ADT/EquivalenceClasses.h:1.17
llvm/include/llvm/ADT/EquivalenceClasses.h:1.18
--- llvm/include/llvm/ADT/EquivalenceClasses.h:1.17 Tue Aug 23 16:45:31 2005
+++ llvm/include/llvm/ADT/EquivalenceClasses.h Tue Nov 28 17:31:42 2006
@@ -43,8 +43,8 @@
/// if (!I->isLeader()) continue; // Ignore non-leader sets.
/// for (EquivalenceClasses<int>::member_iterator MI = EC.member_begin(I);
/// MI != EC.member_end(); ++MI) // Loop over members in this set.
-/// std::cerr << *MI << " "; // Print member.
-/// std::cerr << "\n"; // Finish set.
+/// llvm_cerr << *MI << " "; // Print member.
+/// llvm_cerr << "\n"; // Finish set.
/// }
///
/// This example prints:
Index: llvm/include/llvm/ADT/SCCIterator.h
diff -u llvm/include/llvm/ADT/SCCIterator.h:1.22
llvm/include/llvm/ADT/SCCIterator.h:1.23
--- llvm/include/llvm/ADT/SCCIterator.h:1.22 Sun Aug 6 13:12:50 2006
+++ llvm/include/llvm/ADT/SCCIterator.h Tue Nov 28 17:31:42 2006
@@ -71,8 +71,8 @@
SCCNodeStack.push_back(N);
MinVisitNumStack.push_back(visitNum);
VisitStack.push_back(std::make_pair(N, GT::child_begin(N)));
- //DEBUG(std::cerr << "TarjanSCC: Node " << N <<
- // " : visitNum = " << visitNum << "\n");
+ //DOUT << "TarjanSCC: Node " << N <<
+ // " : visitNum = " << visitNum << "\n";
}
// The stack-based DFS traversal; defined below.
@@ -106,9 +106,9 @@
if (!MinVisitNumStack.empty() && MinVisitNumStack.back() > minVisitNum)
MinVisitNumStack.back() = minVisitNum;
- //DEBUG(std::cerr << "TarjanSCC: Popped node " << visitingN <<
+ //DOUT << "TarjanSCC: Popped node " << visitingN <<
// " : minVisitNum = " << minVisitNum << "; Node visit num = " <<
- // nodeVisitNumbers[visitingN] << "\n");
+ // nodeVisitNumbers[visitingN] << "\n";
if (minVisitNum == nodeVisitNumbers[visitingN]) {
// A full SCC is on the SCCNodeStack! It includes all nodes below
_______________________________________________
llvm-commits mailing list
llvm-commits@cs.uiuc.edu
http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits
