RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-01-14 05:42:45 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

* Move classes around

Browse Source 
* rename constructor function
* Move stuff into anonymous namespaces


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2007 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Cameron Buschardt 2002-03-27 23:28:40 +00:00
parent 5758eec1e0
commit b1be061a76
1 changed files with 36 additions and 29 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

65
lib/Transforms/Utils/PromoteMemoryToRegister.cpp
View File

@ -32,6 +32,7 @@ using namespace std;
using cfg::DominanceFrontier;
namespace {
//instance of the promoter -- to keep all the local method data.
// gets re-created for each method processed
@ -67,28 +68,7 @@ class PromoteInstance
operator bool () { return didchange; }
};
class PromotePass : public MethodPass {
public:
// runOnMethod - To run this pass, first we calculate the alloca instructions
// that are safe for promotion, then we promote each one.
//
virtual bool runOnMethod(Method *M)
{
PromoteInstance inst(M, getAnalysis<DominanceFrontier>());
return (bool)inst;
}
// getAnalysisUsageInfo - We need dominance frontiers
//
virtual void getAnalysisUsageInfo(Pass::AnalysisSet &Requires,
Pass::AnalysisSet &Destroyed,
Pass::AnalysisSet &Provided) {
Requires.push_back(DominanceFrontier::ID);
}
};
} // end of anonymous namespace
// findSafeAllocas - Find allocas that are safe to promote
//
@ -127,13 +107,6 @@ void PromoteInstance::findSafeAllocas(Method *M)
// newPromoteMemoryToRegister - Provide an entry point to create this pass.
//
Pass *newPromoteMemoryToRegister() {
return new PromotePass();
}
bool PromoteInstance::PromoteMethod(Method *M, DominanceFrontier & DF) {
// Calculate the set of safe allocas
findSafeAllocas(M);
@ -333,3 +306,37 @@ bool PromoteInstance::queuePhiNode(BasicBlock *bb, int i /*the alloca*/)
}
return false;
}
namespace {
class PromotePass : public MethodPass {
public:
// runOnMethod - To run this pass, first we calculate the alloca
// instructions that are safe for promotion, then we promote each one.
//
virtual bool runOnMethod(Method *M)
{
PromoteInstance inst(M, getAnalysis<DominanceFrontier>());
return (bool)inst;
}
// getAnalysisUsageInfo - We need dominance frontiers
//
virtual void getAnalysisUsageInfo(Pass::AnalysisSet &Requires,
Pass::AnalysisSet &Destroyed,
Pass::AnalysisSet &Provided) {
Requires.push_back(DominanceFrontier::ID);
}
};
}
// createPromoteMemoryToRegister - Provide an entry point to create this pass.
//
Pass *createPromoteMemoryToRegister() {
return new PromotePass();
}