diff options
author | Wojciech Matyjewicz <wmatyjewicz@fastmail.fm> | 2008-06-14 16:48:22 +0000 |
---|---|---|
committer | Wojciech Matyjewicz <wmatyjewicz@fastmail.fm> | 2008-06-14 16:48:22 +0000 |
commit | 5d2bc857ec1ae11ec2ea85e596f3712d02fd2c2b (patch) | |
tree | fab871ea62d0d3682df7f6e7b707af0d2b437a95 /lib/Analysis/ScalarEvolutionExpander.cpp | |
parent | 507a58ac9b20ddcea2e56a014be26b8f8cc0ecb8 (diff) |
Change 'while' loop to 'do' loop.
Add a safety measure. It isn't safe to assume in ScalarEvolutionExpander that
all loops are in canonical form (but it should be safe for loops that have
AddRecs).
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@52275 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/ScalarEvolutionExpander.cpp')
-rw-r--r-- | lib/Analysis/ScalarEvolutionExpander.cpp | 15 |
1 files changed, 11 insertions, 4 deletions
diff --git a/lib/Analysis/ScalarEvolutionExpander.cpp b/lib/Analysis/ScalarEvolutionExpander.cpp index e249421a1f..a241960b37 100644 --- a/lib/Analysis/ScalarEvolutionExpander.cpp +++ b/lib/Analysis/ScalarEvolutionExpander.cpp @@ -185,14 +185,21 @@ Value *SCEVExpander::visitAddRecExpr(SCEVAddRecExpr *S) { Loop *InsertPtLoop = LI.getLoopFor(MulInsertPt->getParent()); if (InsertPtLoop != L && InsertPtLoop && L->contains(InsertPtLoop->getHeader())) { - while (InsertPtLoop != L) { + do { // If we cannot hoist the multiply out of this loop, don't. if (!InsertPtLoop->isLoopInvariant(F)) break; - // Otherwise, move the insert point to the preheader of the loop. - MulInsertPt = InsertPtLoop->getLoopPreheader()->getTerminator(); + BasicBlock *InsertPtLoopPH = InsertPtLoop->getLoopPreheader(); + + // If this loop hasn't got a preheader, we aren't able to hoist the + // multiply. + if (!InsertPtLoopPH) + break; + + // Otherwise, move the insert point to the preheader. + MulInsertPt = InsertPtLoopPH->getTerminator(); InsertPtLoop = InsertPtLoop->getParentLoop(); - } + } while (InsertPtLoop != L); } return InsertBinop(Instruction::Mul, I, F, MulInsertPt); |