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

Indent classes correctly in the namespace

Browse Source 
move bodies out-of-line
Add getAnalysisUsage method for SFGSCC


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8259 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-08-31 19:27:11 +00:00
parent 23ebd75aff
commit 8d0a23ab42
4 changed files with 228 additions and 188 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -24,58 +24,28 @@
#include "Support/TarjanSCCIterator.h"
namespace {
struct CFGSCC: public FunctionPass {
bool runOnFunction(Function& func) {
unsigned long sccNum = 0;
std::cout << "SCCs for Function " << func.getName() << " in PostOrder:";
for (TarjanSCC_iterator<Function*> I = tarj_begin(&func),
E = tarj_end(&func); I != E; ++I) {
SCC<Function*> &nextSCC = **I;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<Function*>::const_iterator I = nextSCC.begin(),E = nextSCC.end();
I != E; ++I)
std::cout << (*I)->getName() << ", ";
if (nextSCC.size() == 1 && nextSCC.HasLoop())
std::cout << " (Has self-loop).";
struct CFGSCC : public FunctionPass {
bool runOnFunction(Function& func);
void print(std::ostream &O) const { }
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
}
std::cout << "\n";
};
return true;
}
void print(std::ostream &O) const { }
};
struct CallGraphSCC : public Pass {
// run - Print out SCCs in the call graph for the specified module.
bool run(Module &M);
void print(std::ostream &O) const { }
struct CallGraphSCC : public Pass {
// run - Print out SCCs in the call graph for the specified module.
bool run(Module &M) {
CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot();
unsigned long sccNum = 0;
std::cout << "SCCs for the program in PostOrder:";
for (TarjanSCC_iterator<CallGraphNode*> SCCI = tarj_begin(rootNode),
E = tarj_end(rootNode); SCCI != E; ++SCCI) {
const SCC<CallGraphNode*> &nextSCC = **SCCI;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<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())
std::cout << " (Has self-loop).";
// getAnalysisUsage - This pass requires the CallGraph.
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequired<CallGraph>();
}
std::cout << "\n";
return true;
}
void print(std::ostream &O) const { }
// getAnalysisUsage - This pass requires the CallGraph.
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequired<CallGraph>();
}
};
};
RegisterAnalysis<CFGSCC>
Y("cfgscc", "Print SCCs of each function CFG");
@ -83,3 +53,43 @@ struct CallGraphSCC : public Pass {
RegisterAnalysis<CallGraphSCC>
Z("callscc", "Print SCCs of the Call Graph");
}
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;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<Function*>::const_iterator I = nextSCC.begin(),
E = nextSCC.end(); I != E; ++I)
std::cout << (*I)->getName() << ", ";
if (nextSCC.size() == 1 && nextSCC.HasLoop())
std::cout << " (Has self-loop).";
}
std::cout << "\n";
return true;
}
// run - Print out SCCs in the call graph for the specified module.
bool CallGraphSCC::run(Module &M) {
CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot();
unsigned sccNum = 0;
std::cout << "SCCs for the program in PostOrder:";
for (TarjanSCC_iterator<CallGraphNode*> SCCI = tarj_begin(rootNode),
E = tarj_end(rootNode); SCCI != E; ++SCCI) {
const SCC<CallGraphNode*> &nextSCC = **SCCI;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<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())
std::cout << " (Has self-loop).";
}
std::cout << "\n";
return true;
}

104
lib/Analysis/PrintSCC.cpp
View File

@ -24,58 +24,28 @@
#include "Support/TarjanSCCIterator.h"
namespace {
struct CFGSCC: public FunctionPass {
bool runOnFunction(Function& func) {
unsigned long sccNum = 0;
std::cout << "SCCs for Function " << func.getName() << " in PostOrder:";
for (TarjanSCC_iterator<Function*> I = tarj_begin(&func),
E = tarj_end(&func); I != E; ++I) {
SCC<Function*> &nextSCC = **I;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<Function*>::const_iterator I = nextSCC.begin(),E = nextSCC.end();
I != E; ++I)
std::cout << (*I)->getName() << ", ";
if (nextSCC.size() == 1 && nextSCC.HasLoop())
std::cout << " (Has self-loop).";
struct CFGSCC : public FunctionPass {
bool runOnFunction(Function& func);
void print(std::ostream &O) const { }
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
}
std::cout << "\n";
};
return true;
}
void print(std::ostream &O) const { }
};
struct CallGraphSCC : public Pass {
// run - Print out SCCs in the call graph for the specified module.
bool run(Module &M);
void print(std::ostream &O) const { }
struct CallGraphSCC : public Pass {
// run - Print out SCCs in the call graph for the specified module.
bool run(Module &M) {
CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot();
unsigned long sccNum = 0;
std::cout << "SCCs for the program in PostOrder:";
for (TarjanSCC_iterator<CallGraphNode*> SCCI = tarj_begin(rootNode),
E = tarj_end(rootNode); SCCI != E; ++SCCI) {
const SCC<CallGraphNode*> &nextSCC = **SCCI;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<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())
std::cout << " (Has self-loop).";
// getAnalysisUsage - This pass requires the CallGraph.
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequired<CallGraph>();
}
std::cout << "\n";
return true;
}
void print(std::ostream &O) const { }
// getAnalysisUsage - This pass requires the CallGraph.
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequired<CallGraph>();
}
};
};
RegisterAnalysis<CFGSCC>
Y("cfgscc", "Print SCCs of each function CFG");
@ -83,3 +53,43 @@ struct CallGraphSCC : public Pass {
RegisterAnalysis<CallGraphSCC>
Z("callscc", "Print SCCs of the Call Graph");
}
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;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<Function*>::const_iterator I = nextSCC.begin(),
E = nextSCC.end(); I != E; ++I)
std::cout << (*I)->getName() << ", ";
if (nextSCC.size() == 1 && nextSCC.HasLoop())
std::cout << " (Has self-loop).";
}
std::cout << "\n";
return true;
}
// run - Print out SCCs in the call graph for the specified module.
bool CallGraphSCC::run(Module &M) {
CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot();
unsigned sccNum = 0;
std::cout << "SCCs for the program in PostOrder:";
for (TarjanSCC_iterator<CallGraphNode*> SCCI = tarj_begin(rootNode),
E = tarj_end(rootNode); SCCI != E; ++SCCI) {
const SCC<CallGraphNode*> &nextSCC = **SCCI;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<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())
std::cout << " (Has self-loop).";
}
std::cout << "\n";
return true;
}

104
tools/analyze/PrintSCC.cpp
View File

@ -24,58 +24,28 @@
#include "Support/TarjanSCCIterator.h"
namespace {
struct CFGSCC: public FunctionPass {
bool runOnFunction(Function& func) {
unsigned long sccNum = 0;
std::cout << "SCCs for Function " << func.getName() << " in PostOrder:";
for (TarjanSCC_iterator<Function*> I = tarj_begin(&func),
E = tarj_end(&func); I != E; ++I) {
SCC<Function*> &nextSCC = **I;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<Function*>::const_iterator I = nextSCC.begin(),E = nextSCC.end();
I != E; ++I)
std::cout << (*I)->getName() << ", ";
if (nextSCC.size() == 1 && nextSCC.HasLoop())
std::cout << " (Has self-loop).";
struct CFGSCC : public FunctionPass {
bool runOnFunction(Function& func);
void print(std::ostream &O) const { }
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
}
std::cout << "\n";
};
return true;
}
void print(std::ostream &O) const { }
};
struct CallGraphSCC : public Pass {
// run - Print out SCCs in the call graph for the specified module.
bool run(Module &M);
void print(std::ostream &O) const { }
struct CallGraphSCC : public Pass {
// run - Print out SCCs in the call graph for the specified module.
bool run(Module &M) {
CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot();
unsigned long sccNum = 0;
std::cout << "SCCs for the program in PostOrder:";
for (TarjanSCC_iterator<CallGraphNode*> SCCI = tarj_begin(rootNode),
E = tarj_end(rootNode); SCCI != E; ++SCCI) {
const SCC<CallGraphNode*> &nextSCC = **SCCI;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<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())
std::cout << " (Has self-loop).";
// getAnalysisUsage - This pass requires the CallGraph.
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequired<CallGraph>();
}
std::cout << "\n";
return true;
}
void print(std::ostream &O) const { }
// getAnalysisUsage - This pass requires the CallGraph.
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequired<CallGraph>();
}
};
};
RegisterAnalysis<CFGSCC>
Y("cfgscc", "Print SCCs of each function CFG");
@ -83,3 +53,43 @@ struct CallGraphSCC : public Pass {
RegisterAnalysis<CallGraphSCC>
Z("callscc", "Print SCCs of the Call Graph");
}
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;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<Function*>::const_iterator I = nextSCC.begin(),
E = nextSCC.end(); I != E; ++I)
std::cout << (*I)->getName() << ", ";
if (nextSCC.size() == 1 && nextSCC.HasLoop())
std::cout << " (Has self-loop).";
}
std::cout << "\n";
return true;
}
// run - Print out SCCs in the call graph for the specified module.
bool CallGraphSCC::run(Module &M) {
CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot();
unsigned sccNum = 0;
std::cout << "SCCs for the program in PostOrder:";
for (TarjanSCC_iterator<CallGraphNode*> SCCI = tarj_begin(rootNode),
E = tarj_end(rootNode); SCCI != E; ++SCCI) {
const SCC<CallGraphNode*> &nextSCC = **SCCI;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<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())
std::cout << " (Has self-loop).";
}
std::cout << "\n";
return true;
}

104
tools/opt/PrintSCC.cpp
View File

@ -24,58 +24,28 @@
#include "Support/TarjanSCCIterator.h"
namespace {
struct CFGSCC: public FunctionPass {
bool runOnFunction(Function& func) {
unsigned long sccNum = 0;
std::cout << "SCCs for Function " << func.getName() << " in PostOrder:";
for (TarjanSCC_iterator<Function*> I = tarj_begin(&func),
E = tarj_end(&func); I != E; ++I) {
SCC<Function*> &nextSCC = **I;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<Function*>::const_iterator I = nextSCC.begin(),E = nextSCC.end();
I != E; ++I)
std::cout << (*I)->getName() << ", ";
if (nextSCC.size() == 1 && nextSCC.HasLoop())
std::cout << " (Has self-loop).";
struct CFGSCC : public FunctionPass {
bool runOnFunction(Function& func);
void print(std::ostream &O) const { }
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
}
std::cout << "\n";
};
return true;
}
void print(std::ostream &O) const { }
};
struct CallGraphSCC : public Pass {
// run - Print out SCCs in the call graph for the specified module.
bool run(Module &M);
void print(std::ostream &O) const { }
struct CallGraphSCC : public Pass {
// run - Print out SCCs in the call graph for the specified module.
bool run(Module &M) {
CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot();
unsigned long sccNum = 0;
std::cout << "SCCs for the program in PostOrder:";
for (TarjanSCC_iterator<CallGraphNode*> SCCI = tarj_begin(rootNode),
E = tarj_end(rootNode); SCCI != E; ++SCCI) {
const SCC<CallGraphNode*> &nextSCC = **SCCI;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<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())
std::cout << " (Has self-loop).";
// getAnalysisUsage - This pass requires the CallGraph.
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequired<CallGraph>();
}
std::cout << "\n";
return true;
}
void print(std::ostream &O) const { }
// getAnalysisUsage - This pass requires the CallGraph.
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequired<CallGraph>();
}
};
};
RegisterAnalysis<CFGSCC>
Y("cfgscc", "Print SCCs of each function CFG");
@ -83,3 +53,43 @@ struct CallGraphSCC : public Pass {
RegisterAnalysis<CallGraphSCC>
Z("callscc", "Print SCCs of the Call Graph");
}
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;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<Function*>::const_iterator I = nextSCC.begin(),
E = nextSCC.end(); I != E; ++I)
std::cout << (*I)->getName() << ", ";
if (nextSCC.size() == 1 && nextSCC.HasLoop())
std::cout << " (Has self-loop).";
}
std::cout << "\n";
return true;
}
// run - Print out SCCs in the call graph for the specified module.
bool CallGraphSCC::run(Module &M) {
CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot();
unsigned sccNum = 0;
std::cout << "SCCs for the program in PostOrder:";
for (TarjanSCC_iterator<CallGraphNode*> SCCI = tarj_begin(rootNode),
E = tarj_end(rootNode); SCCI != E; ++SCCI) {
const SCC<CallGraphNode*> &nextSCC = **SCCI;
std::cout << "\nSCC #" << ++sccNum << " : ";
for (SCC<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())
std::cout << " (Has self-loop).";
}
std::cout << "\n";
return true;
}