llvm.org GIT mirror llvm / ca82e6c
This file uses cerr without including <iostream>. Since it's just for debugging, comment it out git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8245 91177308-0d34-0410-b5e6-96231b3b80d8 Chris Lattner 16 years ago
2 changed file(s) with 10 addition(s) and 10 deletion(s). Raw diff Collapse all Expand all
9393 SCCNodeStack.push(N);
9494 MinVisitNumStack.push(visitNum);
9595 VisitStack.push(make_pair(N, GT::child_begin(N)));
96 DEBUG(std::cerr << "TarjanSCC: Node " << N <<
97 " : visitNum = " << visitNum << "\n");
96 //DEBUG(std::cerr << "TarjanSCC: Node " << N <<
97 // " : visitNum = " << visitNum << "\n");
9898 }
9999
100100 // The stack-based DFS traversal; defined below.
132132 if (! MinVisitNumStack.empty() && MinVisitNumStack.top() > minVisitNum)
133133 MinVisitNumStack.top() = minVisitNum;
134134
135 DEBUG(std::cerr << "TarjanSCC: Popped node " << visitingN <<
136 " : minVisitNum = " << minVisitNum << "; Node visit num = " <<
137 nodeVisitNumbers[visitingN] << "\n");
135 //DEBUG(std::cerr << "TarjanSCC: Popped node " << visitingN <<
136 // " : minVisitNum = " << minVisitNum << "; Node visit num = " <<
137 // nodeVisitNumbers[visitingN] << "\n");
138138
139139 if (minVisitNum == nodeVisitNumbers[visitingN])
140140 { // A full SCC is on the SCCNodeStack! It includes all nodes below
9393 SCCNodeStack.push(N);
9494 MinVisitNumStack.push(visitNum);
9595 VisitStack.push(make_pair(N, GT::child_begin(N)));
96 DEBUG(std::cerr << "TarjanSCC: Node " << N <<
97 " : visitNum = " << visitNum << "\n");
96 //DEBUG(std::cerr << "TarjanSCC: Node " << N <<
97 // " : visitNum = " << visitNum << "\n");
9898 }
9999
100100 // The stack-based DFS traversal; defined below.
132132 if (! MinVisitNumStack.empty() && MinVisitNumStack.top() > minVisitNum)
133133 MinVisitNumStack.top() = minVisitNum;
134134
135 DEBUG(std::cerr << "TarjanSCC: Popped node " << visitingN <<
136 " : minVisitNum = " << minVisitNum << "; Node visit num = " <<
137 nodeVisitNumbers[visitingN] << "\n");
135 //DEBUG(std::cerr << "TarjanSCC: Popped node " << visitingN <<
136 // " : minVisitNum = " << minVisitNum << "; Node visit num = " <<
137 // nodeVisitNumbers[visitingN] << "\n");
138138
139139 if (minVisitNum == nodeVisitNumbers[visitingN])
140140 { // A full SCC is on the SCCNodeStack! It includes all nodes below