diff options
Diffstat (limited to 'llvm/lib/Analysis/ScalarEvolution.cpp')
| -rw-r--r-- | llvm/lib/Analysis/ScalarEvolution.cpp | 9 |
1 files changed, 4 insertions, 5 deletions
diff --git a/llvm/lib/Analysis/ScalarEvolution.cpp b/llvm/lib/Analysis/ScalarEvolution.cpp index f55fcfe2dc5..1cb39f65e8b 100644 --- a/llvm/lib/Analysis/ScalarEvolution.cpp +++ b/llvm/lib/Analysis/ScalarEvolution.cpp @@ -4603,9 +4603,8 @@ SCEV::NoWrapFlags ScalarEvolution::getNoWrapFlagsFromUB(const Value *V) { Flags = ScalarEvolution::setFlags(Flags, SCEV::FlagNUW); if (BinOp->hasNoSignedWrap()) Flags = ScalarEvolution::setFlags(Flags, SCEV::FlagNSW); - if (Flags == SCEV::FlagAnyWrap) { + if (Flags == SCEV::FlagAnyWrap) return SCEV::FlagAnyWrap; - } // Here we check that BinOp is in the header of the innermost loop // containing BinOp, since we only deal with instructions in the loop @@ -4613,9 +4612,9 @@ SCEV::NoWrapFlags ScalarEvolution::getNoWrapFlagsFromUB(const Value *V) { // recurrence, but getting that requires computing the SCEV of the operands, // which can be expensive. This check we can do cheaply to rule out some // cases early. - Loop *innermostContainingLoop = LI.getLoopFor(BinOp->getParent()); - if (innermostContainingLoop == nullptr || - innermostContainingLoop->getHeader() != BinOp->getParent()) + Loop *InnermostContainingLoop = LI.getLoopFor(BinOp->getParent()); + if (InnermostContainingLoop == nullptr || + InnermostContainingLoop->getHeader() != BinOp->getParent()) return SCEV::FlagAnyWrap; // Only proceed if we can prove that BinOp does not yield poison. |
