JIT: Optimize bit-wise and operation and compare with same constant value (#111933)

* JIT: Optimize bit-wise and operation and compare with same constant value

This change optimizes bit-wise and with compare patterns like '(x & <constant>) == <constant>'

Fix #101000

* JIT: Apply 'jit-format' to 'lower.cpp'

* JIT: Add comment to explain bitwise AND transformation

---------

Co-authored-by: Egor Bogatov <egorbo@gmail.com>

Author: varelen

src/coreclr/jit/lower.cpp

@@ -4122,6 +4122,20 @@ GenTree* Lowering::OptimizeConstCompare(GenTree* cmp)
             }
 #endif
         }
+        else if (andOp2->IsIntegralConst() && GenTree::Compare(andOp2, op2))
+        {
+            //
+            // Transform EQ|NE(AND(x, y), y) into EQ|NE(AND(NOT(x), y), 0) when y is a constant.
+            //
+
+            GenTree* notNode               = comp->gtNewOperNode(GT_NOT, andOp1->TypeGet(), andOp1);
+            cmp->gtGetOp1()->AsOp()->gtOp1 = notNode;
+            BlockRange().InsertAfter(andOp1, notNode);
+            op2->BashToZeroConst(op2->TypeGet());
+
+            andOp1   = notNode;
+            op2Value = 0;
+        }
     }
 
 #ifdef TARGET_XARCH