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 | 9f269e40c9b5d9a08890d0545fce60de99989138 (patch) | |
| tree | 0b77e3cc473dffd8b02cf761262b595aa05e70dd /llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp | |
| parent | d380d8412defb98d2ac1cc4c1843c72ef8aa794c (diff) | |
| download | bcm5719-llvm-9f269e40c9b5d9a08890d0545fce60de99989138.tar.gz bcm5719-llvm-9f269e40c9b5d9a08890d0545fce60de99989138.zip | |
Use the new 'moveBefore' method to simplify some code. Really, which is
easier to understand? :)
llvm-svn: 22706
Diffstat (limited to 'llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp')
| -rw-r--r-- | llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp b/llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp index 2b67b439cb3..a8c2a3a8b77 100644 --- a/llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp +++ b/llvm/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. |
