Lines Matching refs:Replace
170 if (m.right().Is(0)) return Replace(m.left().node()); // x ror 0 => x 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()
322 return Replace(m.left().node()); // x - 0 => x in Reduce()
342 return Replace(graph()->NewNode(machine()->Float32RoundUp().op(), in Reduce()
365 return Replace(m.left().node()); // x - 0 => x in Reduce()
385 return Replace(graph()->NewNode(machine()->Float64RoundUp().op(), in Reduce()
400 return Replace(m.left().node()); // x * 1.0 => x in Reduce()
424 return Replace(m.left().node()); // x / 1.0 => x in Reduce()
458 return Replace(m.right().node()); in Reduce()
461 return Replace(m.left().node()); in Reduce()
501 return Replace(m.right().node()); in Reduce()
504 return Replace(m.left().node()); in Reduce()
580 return Replace(Float64PowHalf(m.left().node())); in Reduce()
618 if (m.IsChangeInt32ToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
624 if (m.IsChangeUint32ToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
650 if (m.IsChangeInt32ToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
656 if (m.IsChangeInt32ToInt64()) return Replace(m.node()->InputAt(0)); in Reduce()
669 return Replace(m.node()->InputAt(0)); in Reduce()
677 if (m.IsChangeInt32ToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
702 if (m.right().Is(0)) return Replace(m.left().node()); // x + 0 => x in ReduceInt32Add()
732 if (m.right().Is(0)) return Replace(m.left().node()); // x + 0 => 0 in ReduceInt64Add()
734 return Replace(Uint64Constant(bit_cast<uint64_t>(m.left().Value()) + in ReduceInt64Add()
743 if (m.right().Is(0)) return Replace(m.left().node()); // x - 0 => x in ReduceInt32Sub()
761 if (m.right().Is(0)) return Replace(m.left().node()); // x - 0 => x in ReduceInt64Sub()
763 return Replace(Uint64Constant(bit_cast<uint64_t>(m.left().Value()) - in ReduceInt64Sub()
766 if (m.LeftEqualsRight()) return Replace(Int64Constant(0)); // x - x => 0 in ReduceInt64Sub()
778 if (m.left().Is(0)) return Replace(m.left().node()); // 0 / x => 0 in ReduceInt32Div()
779 if (m.right().Is(0)) return Replace(m.right().node()); // x / 0 => 0 in ReduceInt32Div()
780 if (m.right().Is(1)) return Replace(m.left().node()); // x / 1 => x in ReduceInt32Div()
787 return Replace(Word32Equal(Word32Equal(m.left().node(), zero), zero)); in ReduceInt32Div()
818 return Replace(quotient); in ReduceInt32Div()
826 if (m.left().Is(0)) return Replace(m.left().node()); // 0 / x => 0 in ReduceUint32Div()
827 if (m.right().Is(0)) return Replace(m.right().node()); // x / 0 => 0 in ReduceUint32Div()
828 if (m.right().Is(1)) return Replace(m.left().node()); // x / 1 => x in ReduceUint32Div()
835 return Replace(Word32Equal(Word32Equal(m.left().node(), zero), zero)); in ReduceUint32Div()
846 return Replace(Uint32Div(dividend, divisor)); in ReduceUint32Div()
855 if (m.left().Is(0)) return Replace(m.left().node()); // 0 % x => 0 in ReduceInt32Mod()
856 if (m.right().Is(0)) return Replace(m.right().node()); // x % 0 => 0 in ReduceInt32Mod()
873 return Replace( in ReduceInt32Mod()
892 if (m.left().Is(0)) return Replace(m.left().node()); // 0 % x => 0 in ReduceUint32Mod()
893 if (m.right().Is(0)) return Replace(m.right().node()); // x % 0 => 0 in ReduceUint32Mod()
980 return Replace(index == 0 ? m.left().node() : m.right().node()); in ReduceProjection()
994 return Replace(index == 0 ? m.left().node() : m.right().node()); in ReduceProjection()
1008 return Replace(m.right().node()); in ReduceProjection()
1011 return index == 0 ? Replace(m.left().node()) : ReplaceInt32(0); in ReduceProjection()
1045 if (m.right().Is(0)) return Replace(m.left().node()); // x << 0 => x in ReduceWord32Shl()
1070 if (m.right().Is(0)) return Replace(m.left().node()); // x << 0 => x in ReduceWord64Shl()
1079 if (m.right().Is(0)) return Replace(m.left().node()); // x >>> 0 => x in ReduceWord32Shr()
1100 if (m.right().Is(0)) return Replace(m.left().node()); // x >>> 0 => x in ReduceWord64Shr()
1109 if (m.right().Is(0)) return Replace(m.left().node()); // x >> 0 => x in ReduceWord32Sar()
1130 return Replace(mleft.left().node()); in ReduceWord32Sar()
1135 return Replace(mleft.left().node()); in ReduceWord32Sar()
1144 if (m.right().Is(0)) return Replace(m.left().node()); // x >> 0 => x in ReduceWord64Sar()
1154 if (m.right().Is(0)) return Replace(m.right().node()); // x & 0 => 0 in ReduceWord32And()
1155 if (m.right().Is(-1)) return Replace(m.left().node()); // x & -1 => x in ReduceWord32And()
1157 return Replace(m.left().node()); in ReduceWord32And()
1162 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x & x => x in ReduceWord32And()
1181 return Replace(mleft.node()); in ReduceWord32And()
1246 return Replace(mleft.node()); in ReduceWord32And()
1308 if (m.right().Is(0)) return Replace(m.left().node()); // x | 0 => x in ReduceWord32Or()
1309 if (m.right().Is(-1)) return Replace(m.right().node()); // x | -1 => -1 in ReduceWord32Or()
1313 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x | x => x in ReduceWord32Or()
1321 if (m.right().Is(0)) return Replace(m.left().node()); // x ^ 0 => x in ReduceWord32Xor()
1329 return Replace(mleft.left().node()); in ReduceWord32Xor()