diff options
| author | Chris Lattner <sabre@nondot.org> | 2005-08-08 19:11:57 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2005-08-08 19:11:57 +0000 |
| commit | 4bc5f8071a28b6fc4f4c2207dd03a5f747d0d84b (patch) | |
| tree | 79609c739e34f77a2e9edaa1c515b8796781ff20 /lib/Transforms/Scalar/TailRecursionElimination.cpp | |
| parent | de0132453e2939488c2d69290bfdfb2cde94a0af (diff) | |
| download | external_llvm-4bc5f8071a28b6fc4f4c2207dd03a5f747d0d84b.tar.gz external_llvm-4bc5f8071a28b6fc4f4c2207dd03a5f747d0d84b.tar.bz2 external_llvm-4bc5f8071a28b6fc4f4c2207dd03a5f747d0d84b.zip | |
Use the new 'moveBefore' method to simplify some code. Really, which is
easier to understand? :)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22706 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Transforms/Scalar/TailRecursionElimination.cpp')
| -rw-r--r-- | lib/Transforms/Scalar/TailRecursionElimination.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/Transforms/Scalar/TailRecursionElimination.cpp b/lib/Transforms/Scalar/TailRecursionElimination.cpp index 2b67b439cb..a8c2a3a8b7 100644 --- a/lib/Transforms/Scalar/TailRecursionElimination.cpp +++ b/lib/Transforms/Scalar/TailRecursionElimination.cpp @@ -363,7 +363,7 @@ bool TailCallElim::ProcessReturningBlock(ReturnInst *Ret, BasicBlock *&OldEntry, NEBI = NewEntry->begin(); OEBI != E; ) if (AllocaInst *AI = dyn_cast<AllocaInst>(OEBI++)) if (isa<ConstantInt>(AI->getArraySize())) - NewEntry->getInstList().splice(NEBI, OldEntry->getInstList(), AI); + AI->moveBefore(NEBI); // Now that we have created a new block, which jumps to the entry // block, insert a PHI node for each argument of the function. |