The SCC::HasLoop method is now in the main iterator
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8269 91177308-0d34-0410-b5e6-96231b3b80d8
diff --git a/lib/Analysis/PrintSCC.cpp b/lib/Analysis/PrintSCC.cpp
index 7affce6..80f6995 100644
--- a/lib/Analysis/PrintSCC.cpp
+++ b/lib/Analysis/PrintSCC.cpp
@@ -57,14 +57,14 @@
bool CFGSCC::runOnFunction(Function &F) {
unsigned sccNum = 0;
std::cout << "SCCs for Function " << F.getName() << " in PostOrder:";
- for (TarjanSCC_iterator<Function*> I = tarj_begin(&F),
- E = tarj_end(&F); I != E; ++I) {
- SCC<Function*> &nextSCC = *I;
+ for (TarjanSCC_iterator<Function*> SCCI = tarj_begin(&F),
+ E = tarj_end(&F); SCCI != E; ++SCCI) {
+ SCC<Function*> &nextSCC = *SCCI;
std::cout << "\nSCC #" << ++sccNum << " : ";
- for (SCC<Function*>::const_iterator I = nextSCC.begin(),
+ for (std::vector<BasicBlock*>::const_iterator I = nextSCC.begin(),
E = nextSCC.end(); I != E; ++I)
std::cout << (*I)->getName() << ", ";
- if (nextSCC.size() == 1 && nextSCC.HasLoop())
+ if (nextSCC.size() == 1 && SCCI.hasLoop())
std::cout << " (Has self-loop).";
}
std::cout << "\n";
@@ -82,11 +82,11 @@
E = tarj_end(rootNode); SCCI != E; ++SCCI) {
const SCC<CallGraphNode*> &nextSCC = *SCCI;
std::cout << "\nSCC #" << ++sccNum << " : ";
- for (SCC<CallGraphNode*>::const_iterator I = nextSCC.begin(),
+ for (std::vector<CallGraphNode*>::const_iterator I = nextSCC.begin(),
E = nextSCC.end(); I != E; ++I)
std::cout << ((*I)->getFunction() ? (*I)->getFunction()->getName()
: std::string("Indirect CallGraph node")) << ", ";
- if (nextSCC.size() == 1 && nextSCC.HasLoop())
+ if (nextSCC.size() == 1 && SCCI.hasLoop())
std::cout << " (Has self-loop).";
}
std::cout << "\n";