140       if (m.right().Is(0)) return Replace(m.left().node());  // x ^ 0 => x  in Reduce()
145       if (m.left().IsWord32Xor() && m.right().Is(-1)) {  in Reduce()
147         if (mleft.right().Is(-1)) {  // (x ^ -1) ^ -1 => x  in Reduce()
157       if (m.right().Is(0)) return Replace(m.left().node());  // x >>> 0 => x  in Reduce()
167       if (m.right().Is(0)) return Replace(m.left().node());  // x ror 0 => x  in Reduce()
179       if (m.left().IsInt32Sub() && m.right().Is(0)) {  // x - y == 0 => x == y  in Reduce()
194       if (m.left().IsInt64Sub() && m.right().Is(0)) {  // x - y == 0 => x == y  in Reduce()
210       if (m.right().Is(0)) return Replace(m.right().node());  // x * 0 => 0  in Reduce()
211       if (m.right().Is(1)) return Replace(m.left().node());   // x * 1 => x  in Reduce()
215       if (m.right().Is(-1)) {  // x * -1 => 0 - x  in Reduce()
242       if (m.left().IsInt32Sub() && m.right().Is(0)) {  // x - y < 0 => x < y  in Reduce()
248       if (m.left().Is(0) && m.right().IsInt32Sub()) {  // 0 < x - y => y < x  in Reduce()
262       if (m.left().IsInt32Sub() && m.right().Is(0)) {  // x - y <= 0 => x <= y  in Reduce()
268       if (m.left().Is(0) && m.right().IsInt32Sub()) {  // 0 <= x - y => y <= x  in Reduce()
279       if (m.left().Is(kMaxUInt32)) return ReplaceBool(false);  // M < x => false  in Reduce()
280       if (m.right().Is(0)) return ReplaceBool(false);          // x < 0 => false  in Reduce()
304       if (m.left().Is(0)) return ReplaceBool(true);            // 0 <= x => true  in Reduce()
305       if (m.right().Is(kMaxUInt32)) return ReplaceBool(true);  // x <= M => true  in Reduce()
324       if (m.right().Is(0) && (Double(m.right().Value()).Sign() > 0)) {  in Reduce()
340       if (m.right().Is(-1)) {  // x * -1.0 => -0.0 - x  in Reduce()
346       if (m.right().Is(1)) return Replace(m.left().node());  // x * 1.0 => x  in Reduce()
357       if (m.right().Is(1)) return Replace(m.left().node());  // x / 1.0 => x  in Reduce()
371       if (m.right().Is(0)) {  // x % 0 => NaN  in Reduce()
456   if (m.right().Is(0)) return Replace(m.left().node());  // x + 0 => x  in ReduceInt32Add()
463     if (mleft.left().Is(0)) {  // (0 - x) + y => y - x  in ReduceInt32Add()
473     if (mright.left().Is(0)) {  // y + (0 - x) => y - x  in ReduceInt32Add()
487   if (m.right().Is(0)) return Replace(m.left().node());  // x - 0 => x  in ReduceInt32Sub()
505   if (m.left().Is(0)) return Replace(m.left().node());    // 0 / x => 0  in ReduceInt32Div()
506   if (m.right().Is(0)) return Replace(m.right().node());  // x / 0 => 0  in ReduceInt32Div()
507   if (m.right().Is(1)) return Replace(m.left().node());   // x / 1 => x  in ReduceInt32Div()
516   if (m.right().Is(-1)) {  // x / -1 => 0 - x  in ReduceInt32Div()
553   if (m.left().Is(0)) return Replace(m.left().node());    // 0 / x => 0  in ReduceUint32Div()
554   if (m.right().Is(0)) return Replace(m.right().node());  // x / 0 => 0  in ReduceUint32Div()
555   if (m.right().Is(1)) return Replace(m.left().node());   // x / 1 => x  in ReduceUint32Div()
582   if (m.left().Is(0)) return Replace(m.left().node());    // 0 % x  => 0  in ReduceInt32Mod()
583   if (m.right().Is(0)) return Replace(m.right().node());  // x % 0  => 0  in ReduceInt32Mod()
584   if (m.right().Is(1)) return ReplaceInt32(0);            // x % 1  => 0  in ReduceInt32Mod()
585   if (m.right().Is(-1)) return ReplaceInt32(0);           // x % -1 => 0  in ReduceInt32Mod()
620   if (m.left().Is(0)) return Replace(m.left().node());    // 0 % x => 0  in ReduceUint32Mod()
621   if (m.right().Is(0)) return Replace(m.right().node());  // x % 0 => 0  in ReduceUint32Mod()
622   if (m.right().Is(1)) return ReplaceUint32(0);           // x % 1 => 0  in ReduceUint32Mod()
702         if (mleft.right().Is(m.right().Value())) {  in ReduceStore()
727       if (m.right().Is(0)) {  in ReduceProjection()
741       if (m.right().Is(0)) {  in ReduceProjection()
763       if (mright.right().Is(0x1f)) {  in ReduceWord32Shifts()
776   if (m.right().Is(0)) return Replace(m.left().node());  // x << 0 => x  in ReduceWord32Shl()
785       if (mleft.right().Is(m.right().Value())) {  in ReduceWord32Shl()
801   if (m.right().Is(0)) return Replace(m.left().node());  // x >> 0 => x  in ReduceWord32Sar()
808       if (m.right().Is(31) && mleft.right().Is(31)) {  in ReduceWord32Sar()
819       if (m.right().Is(24) && mleft.right().Is(24) &&  in ReduceWord32Sar()
824       if (m.right().Is(16) && mleft.right().Is(16) &&  in ReduceWord32Sar()
838   if (m.right().Is(0)) return Replace(m.right().node());  // x & 0  => 0  in ReduceWord32And()
839   if (m.right().Is(-1)) return Replace(m.left().node());  // x & -1 => x  in ReduceWord32And()
840   if (m.left().IsComparison() && m.right().Is(1)) {       // CMP & 1 => CMP  in ReduceWord32And()
903         if (mleftleft.right().Is(base::bits::CountTrailingZeros32(mask))) {  in ReduceWord32And()
915         if (mleftright.right().Is(base::bits::CountTrailingZeros32(mask))) {  in ReduceWord32And()
940   if (m.right().Is(0)) return Replace(m.left().node());    // x | 0  => x  in ReduceWord32Or()
941   if (m.right().Is(-1)) return Replace(m.right().node());  // x | -1 => -1  in ReduceWord32Or()
984     if (!msub.left().Is(32) || msub.right().node() != y) return NoChange();  in ReduceWord32Or()