Skip to content

Commit

Permalink
[ValueTracking] deduce X * Y != 0 if `LowestKnownBit(X) * LowestKno…
Browse files Browse the repository at this point in the history
…wnBit(Y) != 0`

For `X * Y`, if there exists a subset of `X` and subset of `Y` s.t `sX * sY != 0`,
then `X * Y != 0`.
    - See first proof: https://alive2.llvm.org/ce/z/28C9CG
    - NB: This is why the previous Odd case works.

In knownbits we could exhaustively hunt for such a subset, but
`LSB(X)` and `LSB(Y)` actually works. If `LSB(X) * LSB(Y) != 0`, then
`X * Y != 0`
    - See proof: https://alive2.llvm.org/ce/z/p5wWid

In `isKnownNonZero` we can use this as if the `LowestKnownOne(X) *
LowestKnownOne(Y) != 0`, then `X * Y != 0`, and we don't need to try
and other subsets.

Reviewed By: nikic

Differential Revision: https://reviews.llvm.org/D150425
  • Loading branch information
goldsteinn committed May 16, 2023
1 parent 7f82f10 commit 774ecc2
Show file tree
Hide file tree
Showing 2 changed files with 8 additions and 6 deletions.
8 changes: 7 additions & 1 deletion llvm/lib/Analysis/ValueTracking.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2884,7 +2884,13 @@ bool isKnownNonZero(const Value *V, const APInt &DemandedElts, unsigned Depth,
return XKnown.isNonZero() ||
isKnownNonZero(I->getOperand(0), DemandedElts, Depth, Q);

return KnownBits::mul(XKnown, YKnown).isNonZero();
// If there exists any subset of X (sX) and subset of Y (sY) s.t sX * sY is
// non-zero, then X * Y is non-zero. We can find sX and sY by just taking
// the the lowest known One of X and Y. If they are non-zero, the result
// must be non-zero. We can check if LSB(X) * LSB(Y) != 0 by doing
// X.CountLeadingZeros + Y.CountLeadingZeros < BitWidth.
return (XKnown.countMaxTrailingZeros() + YKnown.countMaxTrailingZeros()) <
BitWidth;
}
case Instruction::Select:
// (C ? X : Y) != 0 if X != 0 and Y != 0.
Expand Down
6 changes: 1 addition & 5 deletions llvm/test/Analysis/ValueTracking/known-non-zero.ll
Original file line number Diff line number Diff line change
Expand Up @@ -1099,11 +1099,7 @@ define i1 @smax_nonzero_pos_arg_fail_nonstrict_pos(i8 %xx, i8 %yy, i8 %ind) {

define i1 @mul_nonzero_contains_nonzero_mul(i8 %x, i8 %y) {
; CHECK-LABEL: @mul_nonzero_contains_nonzero_mul(
; CHECK-NEXT: [[XX:%.*]] = or i8 [[X:%.*]], 16
; CHECK-NEXT: [[YY:%.*]] = or i8 [[Y:%.*]], 8
; CHECK-NEXT: [[XY:%.*]] = mul i8 [[XX]], [[YY]]
; CHECK-NEXT: [[NZ:%.*]] = icmp ne i8 [[XY]], 0
; CHECK-NEXT: ret i1 [[NZ]]
; CHECK-NEXT: ret i1 true
;
%xx = or i8 %x, 16
%yy = or i8 %y, 8
Expand Down

0 comments on commit 774ecc2

Please sign in to comment.