aboutsummaryrefslogtreecommitdiff
path: root/include/llvm/ADT/SCCIterator.h
diff options
context:
space:
mode:
authorBill Wendling <isanbard@gmail.com>2006-11-28 23:31:42 +0000
committerBill Wendling <isanbard@gmail.com>2006-11-28 23:31:42 +0000
commitd96662360f49f9b94d0faa7ea8dba8582bc1b364 (patch)
treeb372456f8d5b78c0b763666f3dd19cefb5c94c55 /include/llvm/ADT/SCCIterator.h
parentf45148e113a213b8c91ce34a0b16aa35eb30c77a (diff)
Support for llvm_ostreams.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@31988 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/ADT/SCCIterator.h')
-rw-r--r--include/llvm/ADT/SCCIterator.h8
1 files changed, 4 insertions, 4 deletions
diff --git a/include/llvm/ADT/SCCIterator.h b/include/llvm/ADT/SCCIterator.h
index cbc4cd64fb..6b1260dd71 100644
--- a/include/llvm/ADT/SCCIterator.h
+++ b/include/llvm/ADT/SCCIterator.h
@@ -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