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;
}
%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
+}