mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-20 02:58:18 +00:00
* Remove getPassName implementation
* Register all Passes git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3015 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
1198266778
commit
af41a12370
@ -23,8 +23,6 @@ static Statistic<> NumMerged("constmerge\t\t- Number of global constants merged"
|
||||
|
||||
namespace {
|
||||
struct ConstantMerge : public Pass {
|
||||
const char *getPassName() const {return "Merge Duplicate Global Constants";}
|
||||
|
||||
// run - For this pass, process all of the globals in the module,
|
||||
// eliminating duplicate constants.
|
||||
//
|
||||
@ -34,6 +32,8 @@ namespace {
|
||||
AU.preservesCFG();
|
||||
}
|
||||
};
|
||||
|
||||
RegisterPass<ConstantMerge> X("constmerge", "Merge Duplicate Global Constants");
|
||||
}
|
||||
|
||||
Pass *createConstantMergePass() { return new ConstantMerge(); }
|
||||
|
@ -30,10 +30,9 @@ namespace {
|
||||
Statistic<>NumResolved("funcresolve\t- Number of varargs functions resolved");
|
||||
|
||||
struct FunctionResolvingPass : public Pass {
|
||||
const char *getPassName() const { return "Resolve Functions"; }
|
||||
|
||||
bool run(Module &M);
|
||||
};
|
||||
RegisterPass<FunctionResolvingPass> X("funcresolve", "Resolve Functions");
|
||||
}
|
||||
|
||||
Pass *createFunctionResolvingPass() {
|
||||
|
@ -257,11 +257,11 @@ static bool doFunctionInlining(Function &F) {
|
||||
|
||||
namespace {
|
||||
struct FunctionInlining : public FunctionPass {
|
||||
const char *getPassName() const { return "Function Inlining"; }
|
||||
virtual bool runOnFunction(Function &F) {
|
||||
return doFunctionInlining(F);
|
||||
}
|
||||
};
|
||||
RegisterPass<FunctionInlining> X("inline", "Function Integration/Inlining");
|
||||
}
|
||||
|
||||
Pass *createFunctionInliningPass() { return new FunctionInlining(); }
|
||||
|
@ -26,9 +26,7 @@ class RaiseAllocations : public BasicBlockPass {
|
||||
Function *MallocFunc; // Functions in the module we are processing
|
||||
Function *FreeFunc; // Initialized by doPassInitializationVirt
|
||||
public:
|
||||
inline RaiseAllocations() : MallocFunc(0), FreeFunc(0) {}
|
||||
|
||||
const char *getPassName() const { return "Raise Allocations"; }
|
||||
RaiseAllocations() : MallocFunc(0), FreeFunc(0) {}
|
||||
|
||||
// doPassInitialization - For the raise allocations pass, this finds a
|
||||
// declaration for malloc and free if they exist.
|
||||
@ -41,6 +39,8 @@ public:
|
||||
bool runOnBasicBlock(BasicBlock &BB);
|
||||
};
|
||||
|
||||
RegisterPass<RaiseAllocations>
|
||||
X("raiseallocs", "Raise allocations from calls to instructions");
|
||||
} // end anonymous namespace
|
||||
|
||||
|
||||
|
@ -31,12 +31,10 @@ class LowerAllocations : public BasicBlockPass {
|
||||
|
||||
const TargetData &DataLayout;
|
||||
public:
|
||||
inline LowerAllocations(const TargetData &TD) : DataLayout(TD) {
|
||||
LowerAllocations(const TargetData &TD) : DataLayout(TD) {
|
||||
MallocFunc = FreeFunc = 0;
|
||||
}
|
||||
|
||||
const char *getPassName() const { return "Lower Allocations"; }
|
||||
|
||||
// doPassInitialization - For the lower allocations pass, this ensures that a
|
||||
// module contains a declaration for a malloc and a free function.
|
||||
//
|
||||
@ -47,7 +45,6 @@ public:
|
||||
//
|
||||
bool runOnBasicBlock(BasicBlock &BB);
|
||||
};
|
||||
|
||||
}
|
||||
|
||||
// createLowerAllocationsPass - Interface to this file...
|
||||
@ -55,6 +52,10 @@ Pass *createLowerAllocationsPass(const TargetData &TD) {
|
||||
return new LowerAllocations(TD);
|
||||
}
|
||||
|
||||
static RegisterPass<LowerAllocations>
|
||||
X("lowerallocs", "Lower allocations from instructions to calls (TD)",
|
||||
createLowerAllocationsPass);
|
||||
|
||||
|
||||
// doInitialization - For the lower allocations pass, this ensures that a
|
||||
// module contains a declaration for a malloc and a free function.
|
||||
|
Loading…
Reference in New Issue
Block a user