From 2af517281d6c36313f7ff74337a84c4fac716dbb Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Thu, 20 Nov 2003 18:25:24 +0000 Subject: Start using the nicer terminator auto-insertion API llvm-svn: 10111 --- llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp') diff --git a/llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp b/llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp index dbe91a79407..87cd27d22be 100644 --- a/llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp +++ b/llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp @@ -33,7 +33,7 @@ #include "llvm/Pass.h" #include "Support/Statistic.h" -namespace llvm { +using namespace llvm; namespace { Statistic<> NumEliminated("tailcallelim", "Number of tail calls removed"); @@ -45,7 +45,9 @@ namespace { } // Public interface to the TailCallElimination pass -FunctionPass *createTailCallEliminationPass() { return new TailCallElim(); } +FunctionPass *llvm::createTailCallEliminationPass() { + return new TailCallElim(); +} bool TailCallElim::runOnFunction(Function &F) { @@ -74,7 +76,7 @@ bool TailCallElim::runOnFunction(Function &F) { // us to branch back to the old entry block. OldEntry = &F.getEntryBlock(); BasicBlock *NewEntry = new BasicBlock("tailrecurse", OldEntry); - NewEntry->getInstList().push_back(new BranchInst(OldEntry)); + new BranchInst(OldEntry, 0, 0, NewEntry); // Now that we have created a new block, which jumps to the entry // block, insert a PHI node for each argument of the function. @@ -107,5 +109,3 @@ bool TailCallElim::runOnFunction(Function &F) { return MadeChange; } - -} // End llvm namespace -- cgit v1.2.3