diff options
author | David Majnemer <david.majnemer@gmail.com> | 2015-04-22 20:59:28 +0000 |
---|---|---|
committer | David Majnemer <david.majnemer@gmail.com> | 2015-04-22 20:59:28 +0000 |
commit | fe58d13a17a2824fe891274e1396e5fc1ca5ab38 (patch) | |
tree | b70e49630309f2cbf60608f0ff7c0517b5efcda0 | |
parent | a32764453444da90e92ba0041f40b4d94fadf2d4 (diff) | |
download | bcm5719-llvm-fe58d13a17a2824fe891274e1396e5fc1ca5ab38.tar.gz bcm5719-llvm-fe58d13a17a2824fe891274e1396e5fc1ca5ab38.zip |
[InstCombine] Clear out nsw/nuw if we modify computation in the chain
An nsw/nuw operation relies on the values feeding into it to not
overflow if 'poison' is not to be produced. This means that
optimizations which make modifications to the bottom of a chain (like
SimplifyDemandedBits) must strip out nsw/nuw if they cannot ensure that
they will be preserved.
This fixes PR23309.
llvm-svn: 235544
-rw-r--r-- | llvm/lib/Transforms/InstCombine/InstCombineSimplifyDemanded.cpp | 13 | ||||
-rw-r--r-- | llvm/test/Transforms/InstCombine/cast.ll | 12 |
2 files changed, 22 insertions, 3 deletions
diff --git a/llvm/lib/Transforms/InstCombine/InstCombineSimplifyDemanded.cpp b/llvm/lib/Transforms/InstCombine/InstCombineSimplifyDemanded.cpp index cd391d0385e..0695ec17e36 100644 --- a/llvm/lib/Transforms/InstCombine/InstCombineSimplifyDemanded.cpp +++ b/llvm/lib/Transforms/InstCombine/InstCombineSimplifyDemanded.cpp @@ -83,11 +83,18 @@ bool InstCombiner::SimplifyDemandedInstructionBits(Instruction &Inst) { bool InstCombiner::SimplifyDemandedBits(Use &U, APInt DemandedMask, APInt &KnownZero, APInt &KnownOne, unsigned Depth) { - Value *NewVal = - SimplifyDemandedUseBits(U.get(), DemandedMask, KnownZero, KnownOne, Depth, - dyn_cast<Instruction>(U.getUser())); + auto *UserI = dyn_cast<Instruction>(U.getUser()); + Value *NewVal = SimplifyDemandedUseBits(U.get(), DemandedMask, KnownZero, + KnownOne, Depth, UserI); if (!NewVal) return false; U = NewVal; + + // Shrinking a constant might cause a nsw/nuw violation to occur in + // instructions which are themselves demanded. + if (auto *UserOBO = dyn_cast<OverflowingBinaryOperator>(UserI)) { + cast<BinaryOperator>(UserOBO)->setHasNoSignedWrap(false); + cast<BinaryOperator>(UserOBO)->setHasNoUnsignedWrap(false); + } return true; } diff --git a/llvm/test/Transforms/InstCombine/cast.ll b/llvm/test/Transforms/InstCombine/cast.ll index d4356d9364b..7bf4a6047f2 100644 --- a/llvm/test/Transforms/InstCombine/cast.ll +++ b/llvm/test/Transforms/InstCombine/cast.ll @@ -1113,3 +1113,15 @@ define float @sitofp_zext(i16 %a) { %sitofp = sitofp i32 %zext to float ret float %sitofp } + +define i1 @PR23309(i32 %A, i32 %B) { +; CHECK-LABEL: @PR23309( +; CHECK-NEXT: %[[sub:.*]] = sub i32 %A, %B +; CHECK-NEXT: %[[and:.*]] = and i32 %[[sub]], 1 +; CHECK-NEXT: %[[cmp:.*]] = icmp ne i32 %[[and]], 0 +; CHECK-NEXT: ret i1 %[[cmp]] + %add = add i32 %A, -4 + %sub = sub nsw i32 %add, %B + %trunc = trunc i32 %sub to i1 + ret i1 %trunc +} |