RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-11-25 04:39:44 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

The SCC::HasLoop method is now in the main iterator

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8269 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-08-31 19:51:38 +00:00
parent 94d1092c6a
commit 9f2a06e76d
6 changed files with 30 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
lib/Analysis/DataStructure/MemoryDepAnalysis.cpp
View File

@ -441,7 +441,7 @@ bool MemoryDepAnalysis::runOnFunction(Function &F) {
SCC<Function*>* nextSCC;
for (TarjanSCC_iterator<Function*> I = tarj_begin(&F), E = tarj_end(&F);
I != E; ++I)
ProcessSCC(*I, ModRefAfter, (*I).HasLoop());
ProcessSCC(*I, ModRefAfter, I.hasLoop());
return true;
}

2
lib/Analysis/IPA/MemoryDepAnalysis.cpp
View File

@ -441,7 +441,7 @@ bool MemoryDepAnalysis::runOnFunction(Function &F) {
SCC<Function*>* nextSCC;
for (TarjanSCC_iterator<Function*> I = tarj_begin(&F), E = tarj_end(&F);
I != E; ++I)
ProcessSCC(*I, ModRefAfter, (*I).HasLoop());
ProcessSCC(*I, ModRefAfter, I.hasLoop());
return true;
}

14
lib/Analysis/IPA/PrintSCC.cpp
View File

@ -57,14 +57,14 @@ namespace {
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 @@ bool CallGraphSCC::run(Module &M) {
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";

14
lib/Analysis/PrintSCC.cpp
View File

@ -57,14 +57,14 @@ namespace {
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 @@ bool CallGraphSCC::run(Module &M) {
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";

14
tools/analyze/PrintSCC.cpp
View File

@ -57,14 +57,14 @@ namespace {
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 @@ bool CallGraphSCC::run(Module &M) {
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";

14
tools/opt/PrintSCC.cpp
View File

@ -57,14 +57,14 @@ namespace {
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 @@ bool CallGraphSCC::run(Module &M) {
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";