Prototype these functions more accurately

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@16432 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2004-09-20 04:43:15 +00:00
parent 8e47e7292c
commit 4b50156049
12 changed files with 15 additions and 13 deletions

View File

@ -106,7 +106,7 @@ private:
RegisterOpt<ADCE> X("adce", "Aggressive Dead Code Elimination");
} // End of anonymous namespace
Pass *llvm::createAggressiveDCEPass() { return new ADCE(); }
FunctionPass *llvm::createAggressiveDCEPass() { return new ADCE(); }
void ADCE::markBlockAlive(BasicBlock *BB) {
// Mark the basic block as being newly ALIVE... and mark all branches that

View File

@ -42,7 +42,7 @@ namespace {
RegisterOpt<ConstantPropagation> X("constprop","Simple constant propagation");
}
Pass *llvm::createConstantPropagationPass() {
FunctionPass *llvm::createConstantPropagationPass() {
return new ConstantPropagation();
}

View File

@ -285,7 +285,9 @@ namespace {
RegisterOpt<CEE> X("cee", "Correlated Expression Elimination");
}
Pass *llvm::createCorrelatedExpressionEliminationPass() { return new CEE(); }
FunctionPass *llvm::createCorrelatedExpressionEliminationPass() {
return new CEE();
}
bool CEE::runOnFunction(Function &F) {

View File

@ -53,7 +53,7 @@ namespace {
RegisterOpt<DeadInstElimination> X("die", "Dead Instruction Elimination");
}
Pass *llvm::createDeadInstEliminationPass() {
FunctionPass *llvm::createDeadInstEliminationPass() {
return new DeadInstElimination();
}

View File

@ -56,7 +56,7 @@ namespace {
RegisterOpt<DSE> X("dse", "Dead Store Elimination");
}
Pass *llvm::createDeadStoreEliminationPass() { return new DSE(); }
FunctionPass *llvm::createDeadStoreEliminationPass() { return new DSE(); }
bool DSE::runOnBasicBlock(BasicBlock &BB) {
TargetData &TD = getAnalysis<TargetData>();

View File

@ -328,7 +328,7 @@ namespace {
RegisterOpt<IndVarSimplify> X("indvars", "Canonicalize Induction Variables");
}
Pass *llvm::createIndVarSimplifyPass() {
FunctionPass *llvm::createIndVarSimplifyPass() {
return new IndVarSimplify();
}

View File

@ -274,7 +274,7 @@ private:
// createSCCPPass - This is the public interface to this file...
Pass *llvm::createSCCPPass() {
FunctionPass *llvm::createSCCPPass() {
return new SCCP();
}

View File

@ -64,7 +64,7 @@ namespace {
}
// Public interface to the ScalarReplAggregates pass
Pass *llvm::createScalarReplAggregatesPass() { return new SROA(); }
FunctionPass *llvm::createScalarReplAggregatesPass() { return new SROA(); }
bool SROA::runOnFunction(Function &F) {

View File

@ -47,10 +47,10 @@ namespace {
"Strip symbols from module and functions");
}
Pass *llvm::createSymbolStrippingPass() {
FunctionPass *llvm::createSymbolStrippingPass() {
return new SymbolStripping();
}
Pass *llvm::createFullSymbolStrippingPass() {
FunctionPass *llvm::createFullSymbolStrippingPass() {
return new FullSymbolStripping();
}

View File

@ -49,7 +49,7 @@ namespace {
}
// Public interface to the Tail Duplication pass
Pass *llvm::createTailDuplicationPass() { return new TailDup(); }
FunctionPass *llvm::createTailDuplicationPass() { return new TailDup(); }
/// runOnFunction - Top level algorithm - Loop over each unconditional branch in
/// the function, eliminating it if it looks attractive enough.

View File

@ -88,7 +88,7 @@ namespace {
// Publically exposed interface to pass...
const PassInfo *llvm::LoopSimplifyID = X.getPassInfo();
Pass *llvm::createLoopSimplifyPass() { return new LoopSimplify(); }
FunctionPass *llvm::createLoopSimplifyPass() { return new LoopSimplify(); }
/// runOnFunction - Run down all loops in the CFG (recursively, but we could do
/// it in any convenient order) inserting preheaders...

View File

@ -76,7 +76,7 @@ bool PromotePass::runOnFunction(Function &F) {
// createPromoteMemoryToRegister - Provide an entry point to create this pass.
//
Pass *llvm::createPromoteMemoryToRegister() {
FunctionPass *llvm::createPromoteMemoryToRegister() {
return new PromotePass();
}