Lines Matching refs:Is
170 if (m.right().Is(0)) return Replace(m.left().node()); // x ror 0 => x in Reduce()
182 if (m.left().IsInt32Sub() && m.right().Is(0)) { // x - y == 0 => x == y in Reduce()
197 if (m.left().IsInt64Sub() && m.right().Is(0)) { // x - y == 0 => x == y in Reduce()
217 if (m.right().Is(0)) return Replace(m.right().node()); // x * 0 => 0 in Reduce()
218 if (m.right().Is(1)) return Replace(m.left().node()); // x * 1 => x in Reduce()
222 if (m.right().Is(-1)) { // x * -1 => 0 - x in Reduce()
238 if (m.right().Is(2)) { in Reduce()
243 if (m.right().Is(-1)) { in Reduce()
265 if (m.left().IsWord32Or() && m.right().Is(0)) { in Reduce()
285 if (m.left().Is(kMaxUInt32)) return ReplaceBool(false); // M < x => false in Reduce()
286 if (m.right().Is(0)) return ReplaceBool(false); // x < 0 => false in Reduce()
310 if (m.left().Is(0)) return ReplaceBool(true); // 0 <= x => true in Reduce()
311 if (m.right().Is(kMaxUInt32)) return ReplaceBool(true); // x <= M => true in Reduce()
320 if (allow_signalling_nan_ && m.right().Is(0) && in Reduce()
367 if (allow_signalling_nan_ && m.right().Is(0) && in Reduce()
403 if (allow_signalling_nan_ && m.right().Is(1)) in Reduce()
405 if (m.right().Is(-1)) { // x * -1.0 => -0.0 - x in Reduce()
418 if (m.right().Is(2)) { // x * 2.0 => x + x in Reduce()
427 if (allow_signalling_nan_ && m.right().Is(1)) in Reduce()
441 if (allow_signalling_nan_ && m.right().Is(-1)) { // x / -1.0 => -x in Reduce()
458 if (m.right().Is(0)) { // x % 0 => NaN in Reduce()
565 } else if (m.right().Is(0.0)) { // x ** +-0.0 => 1.0 in Reduce()
567 } else if (m.right().Is(-2.0)) { // x ** -2.0 => 1 / (x * x) in Reduce()
572 } else if (m.right().Is(2.0)) { // x ** 2.0 => x * x in Reduce()
576 } else if (m.right().Is(-0.5)) { in Reduce()
582 } else if (m.right().Is(0.5)) { in Reduce()
705 if (m.right().Is(0)) return Replace(m.left().node()); // x + 0 => x in ReduceInt32Add()
712 if (mleft.left().Is(0)) { // (0 - x) + y => y - x in ReduceInt32Add()
722 if (mright.left().Is(0)) { // y + (0 - x) => y - x in ReduceInt32Add()
735 if (m.right().Is(0)) return Replace(m.left().node()); // x + 0 => 0 in ReduceInt64Add()
746 if (m.right().Is(0)) return Replace(m.left().node()); // x - 0 => x in ReduceInt32Sub()
764 if (m.right().Is(0)) return Replace(m.left().node()); // x - 0 => x in ReduceInt64Sub()
781 if (m.left().Is(0)) return Replace(m.left().node()); // 0 / x => 0 in ReduceInt32Div()
782 if (m.right().Is(0)) return Replace(m.right().node()); // x / 0 => 0 in ReduceInt32Div()
783 if (m.right().Is(1)) return Replace(m.left().node()); // x / 1 => x in ReduceInt32Div()
792 if (m.right().Is(-1)) { // x / -1 => 0 - x in ReduceInt32Div()
829 if (m.left().Is(0)) return Replace(m.left().node()); // 0 / x => 0 in ReduceUint32Div()
830 if (m.right().Is(0)) return Replace(m.right().node()); // x / 0 => 0 in ReduceUint32Div()
831 if (m.right().Is(1)) return Replace(m.left().node()); // x / 1 => x in ReduceUint32Div()
858 if (m.left().Is(0)) return Replace(m.left().node()); // 0 % x => 0 in ReduceInt32Mod()
859 if (m.right().Is(0)) return Replace(m.right().node()); // x % 0 => 0 in ReduceInt32Mod()
860 if (m.right().Is(1)) return ReplaceInt32(0); // x % 1 => 0 in ReduceInt32Mod()
861 if (m.right().Is(-1)) return ReplaceInt32(0); // x % -1 => 0 in ReduceInt32Mod()
895 if (m.left().Is(0)) return Replace(m.left().node()); // 0 % x => 0 in ReduceUint32Mod()
896 if (m.right().Is(0)) return Replace(m.right().node()); // x % 0 => 0 in ReduceUint32Mod()
897 if (m.right().Is(1)) return ReplaceUint32(0); // x % 1 => 0 in ReduceUint32Mod()
960 if (mleft.right().Is(m.right().Value())) { in ReduceStore()
985 if (m.right().Is(0)) { in ReduceProjection()
999 if (m.right().Is(0)) { in ReduceProjection()
1013 if (m.right().Is(0)) { in ReduceProjection()
1016 if (m.right().Is(1)) { in ReduceProjection()
1038 if (mright.right().Is(0x1f)) { in ReduceWord32Shifts()
1051 if (m.right().Is(0)) return Replace(m.left().node()); // x << 0 => x in ReduceWord32Shl()
1060 if (mleft.right().Is(m.right().Value())) { in ReduceWord32Shl()
1076 if (m.right().Is(0)) return Replace(m.left().node()); // x << 0 => x in ReduceWord64Shl()
1085 if (m.right().Is(0)) return Replace(m.left().node()); // x >>> 0 => x in ReduceWord32Shr()
1106 if (m.right().Is(0)) return Replace(m.left().node()); // x >>> 0 => x in ReduceWord64Shr()
1115 if (m.right().Is(0)) return Replace(m.left().node()); // x >> 0 => x in ReduceWord32Sar()
1122 if (m.right().Is(31) && mleft.right().Is(31)) { in ReduceWord32Sar()
1133 if (m.right().Is(24) && mleft.right().Is(24) && in ReduceWord32Sar()
1138 if (m.right().Is(16) && mleft.right().Is(16) && in ReduceWord32Sar()
1150 if (m.right().Is(0)) return Replace(m.left().node()); // x >> 0 => x in ReduceWord64Sar()
1160 if (m.right().Is(0)) return Replace(m.right().node()); // x & 0 => 0 in ReduceWord32And()
1161 if (m.right().Is(-1)) return Replace(m.left().node()); // x & -1 => x in ReduceWord32And()
1162 if (m.left().IsComparison() && m.right().Is(1)) { // CMP & 1 => CMP in ReduceWord32And()
1226 if (mleftleft.right().Is(base::bits::CountTrailingZeros32(mask))) { in ReduceWord32And()
1238 if (mleftright.right().Is(base::bits::CountTrailingZeros32(mask))) { in ReduceWord32And()
1302 if (!msub.left().Is(32) || msub.right().node() != y) return NoChange(); in TryMatchWord32Ror()
1314 if (m.right().Is(0)) return Replace(m.left().node()); // x | 0 => x in ReduceWord32Or()
1315 if (m.right().Is(-1)) return Replace(m.right().node()); // x | -1 => -1 in ReduceWord32Or()
1327 if (m.right().Is(0)) return Replace(m.left().node()); // x ^ 0 => x in ReduceWord32Xor()
1332 if (m.left().IsWord32Xor() && m.right().Is(-1)) { in ReduceWord32Xor()
1334 if (mleft.right().Is(-1)) { // (x ^ -1) ^ -1 => x in ReduceWord32Xor()