6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-25 13:24:46 +00:00
Code Issues Projects Releases Wiki Activity

Support for llvm_ostreams.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@31988 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Bill Wendling
2006-11-28 23:31:42 +00:00
parent f45148e113
commit d96662360f
6 changed files with 22 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
include/llvm/ADT/BitSetVector.h
View File

@@ -29,7 +29,7 @@
#include <bitset>
#include <vector>
#include <functional>
#include <iostream>
#include <ostream>
namespace llvm {
@@ -178,7 +178,7 @@ public:
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:
//

4
include/llvm/ADT/EquivalenceClasses.h
View File

@@ -43,8 +43,8 @@ namespace llvm {
/// 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:

8
include/llvm/ADT/SCCIterator.h
View File

@@ -71,8 +71,8 @@ class scc_iterator
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 @@ class scc_iterator
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