[llvm] [llvm] [InstCombine] fold "icmp eq (X + (V - 1)) & -V, X" to "icmp eq 0, (and X, V - 1)" (PR #152851)

[Yingwei Zheng via llvm-commits]

================
@@ -1320,6 +1320,67 @@ Instruction *InstCombinerImpl::foldICmpWithZero(ICmpInst &Cmp) {
   return nullptr;
 }
 
+// Fold icmp eq (num + (val - 1)) & -val, num
+//      to
+//      icmp eq 0, (and num, val - 1)
+// For value being power of two
+Instruction *InstCombinerImpl::foldNextMultiply(ICmpInst &Cmp) {
+  Value *Op0 = Cmp.getOperand(0);
+  Value *Neg, *Add, *Num, *Mask, *Value;
+  CmpPredicate Pred;
+  const APInt *NegConst, *MaskConst;
+
+  // Match num + neg
+  if (!match(Op0, m_OneUse(m_c_And(m_Value(Add), m_Value(Neg)))))
+    return nullptr;
+
+  // Match num & mask and handle commutative care
+  if (!match(Op0, m_c_And(m_c_Add(m_Value(Num), m_Value(Mask)), m_Value(Neg))))
+    return nullptr;
+
+  // Check the constant case
+  if (match(Neg, m_APInt(NegConst)) && match(Mask, m_APInt(MaskConst))) {
+    // Mask + 1 should be a power-of-two
+    if (!(*MaskConst + 1).isPowerOf2())
+      return nullptr;
----------------
dtcxzyw wrote:

Use `m_LowBitMask` instead.

https://github.com/llvm/llvm-project/pull/152851