6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-07-19 03:29:22 +00:00
Code Issues Projects Releases Wiki Activity

This file uses cerr without including <iostream>. Since it's just for debugging, comment it out

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8245 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-08-31 01:45:00 +00:00
parent 5636eec5fb
commit ca82e6c3d1
2 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
include/Support/SCCIterator.h
View File

@ -94,8 +94,8 @@ class TarjanSCC_iterator : public forward_iterator<SCC<GraphT, GT>, ptrdiff_t>
SCCNodeStack.push(N);
MinVisitNumStack.push(visitNum);
VisitStack.push(make_pair(N, GT::child_begin(N)));
DEBUG(std::cerr << "TarjanSCC: Node " << N <<
" : visitNum = " << visitNum << "\n");
//DEBUG(std::cerr << "TarjanSCC: Node " << N <<
// " : visitNum = " << visitNum << "\n");
}
// The stack-based DFS traversal; defined below.
@ -133,9 +133,9 @@ class TarjanSCC_iterator : public forward_iterator<SCC<GraphT, GT>, ptrdiff_t>
if (! MinVisitNumStack.empty() && MinVisitNumStack.top() > minVisitNum)
MinVisitNumStack.top() = minVisitNum;
DEBUG(std::cerr << "TarjanSCC: Popped node " << visitingN <<
" : minVisitNum = " << minVisitNum << "; Node visit num = " <<
nodeVisitNumbers[visitingN] << "\n");
//DEBUG(std::cerr << "TarjanSCC: Popped node " << visitingN <<
// " : minVisitNum = " << minVisitNum << "; Node visit num = " <<
// nodeVisitNumbers[visitingN] << "\n");
if (minVisitNum == nodeVisitNumbers[visitingN])
{ // A full SCC is on the SCCNodeStack! It includes all nodes below

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

@ -94,8 +94,8 @@ class TarjanSCC_iterator : public forward_iterator<SCC<GraphT, GT>, ptrdiff_t>
SCCNodeStack.push(N);
MinVisitNumStack.push(visitNum);
VisitStack.push(make_pair(N, GT::child_begin(N)));
DEBUG(std::cerr << "TarjanSCC: Node " << N <<
" : visitNum = " << visitNum << "\n");
//DEBUG(std::cerr << "TarjanSCC: Node " << N <<
// " : visitNum = " << visitNum << "\n");
}
// The stack-based DFS traversal; defined below.
@ -133,9 +133,9 @@ class TarjanSCC_iterator : public forward_iterator<SCC<GraphT, GT>, ptrdiff_t>
if (! MinVisitNumStack.empty() && MinVisitNumStack.top() > minVisitNum)
MinVisitNumStack.top() = minVisitNum;
DEBUG(std::cerr << "TarjanSCC: Popped node " << visitingN <<
" : minVisitNum = " << minVisitNum << "; Node visit num = " <<
nodeVisitNumbers[visitingN] << "\n");
//DEBUG(std::cerr << "TarjanSCC: Popped node " << visitingN <<
// " : minVisitNum = " << minVisitNum << "; Node visit num = " <<
// nodeVisitNumbers[visitingN] << "\n");
if (minVisitNum == nodeVisitNumbers[visitingN])
{ // A full SCC is on the SCCNodeStack! It includes all nodes below