Lines Matching full:replace
169 if (m.right().Is(0)) return Replace(m.left().node()); // x ror 0 => x in Reduce()
216 if (m.right().Is(0)) return Replace(m.right().node()); // x * 0 => 0 in Reduce()
217 if (m.right().Is(1)) return Replace(m.left().node()); // x * 1 => x in Reduce()
320 return Replace(m.left().node()); // x - 0 => x in Reduce()
323 return Replace(m.right().node()); in Reduce()
326 return Replace(m.left().node()); in Reduce()
338 return Replace(graph()->NewNode(machine()->Float32RoundUp().op(), in Reduce()
353 return Replace(m.right().node()); in Reduce()
363 return Replace(m.left().node()); // x - 0 => x in Reduce()
366 return Replace(m.right().node()); in Reduce()
369 return Replace(m.left().node()); in Reduce()
381 return Replace(graph()->NewNode(machine()->Float64RoundUp().op(), in Reduce()
401 if (m.right().Is(1)) return Replace(m.left().node()); // x * 1.0 => x in Reduce()
403 return Replace(m.right().node()); in Reduce()
417 if (m.right().Is(1)) return Replace(m.left().node()); // x / 1.0 => x in Reduce()
419 return Replace(m.right().node()); in Reduce()
422 return Replace(m.left().node()); in Reduce()
448 return Replace(m.right().node()); in Reduce()
451 return Replace(m.left().node()); in Reduce()
491 return Replace(m.right().node()); in Reduce()
494 return Replace(m.left().node()); in Reduce()
570 return Replace(Float64PowHalf(m.left().node())); in Reduce()
602 if (m.IsChangeInt32ToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
608 if (m.IsChangeUint32ToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
634 if (m.IsChangeInt32ToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
640 if (m.IsChangeInt32ToInt64()) return Replace(m.node()->InputAt(0)); in Reduce()
646 if (m.IsChangeFloat32ToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
652 if (m.IsChangeInt32ToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
676 if (m.right().Is(0)) return Replace(m.left().node()); // x + 0 => x in ReduceInt32Add()
706 if (m.right().Is(0)) return Replace(m.left().node()); // x + 0 => 0 in ReduceInt64Add()
708 return Replace(Uint64Constant(bit_cast<uint64_t>(m.left().Value()) + in ReduceInt64Add()
717 if (m.right().Is(0)) return Replace(m.left().node()); // x - 0 => x in ReduceInt32Sub()
735 if (m.right().Is(0)) return Replace(m.left().node()); // x - 0 => x in ReduceInt64Sub()
737 return Replace(Uint64Constant(bit_cast<uint64_t>(m.left().Value()) - in ReduceInt64Sub()
740 if (m.LeftEqualsRight()) return Replace(Int64Constant(0)); // x - x => 0 in ReduceInt64Sub()
752 if (m.left().Is(0)) return Replace(m.left().node()); // 0 / x => 0 in ReduceInt32Div()
753 if (m.right().Is(0)) return Replace(m.right().node()); // x / 0 => 0 in ReduceInt32Div()
754 if (m.right().Is(1)) return Replace(m.left().node()); // x / 1 => x in ReduceInt32Div()
761 return Replace(Word32Equal(Word32Equal(m.left().node(), zero), zero)); in ReduceInt32Div()
792 return Replace(quotient); in ReduceInt32Div()
800 if (m.left().Is(0)) return Replace(m.left().node()); // 0 / x => 0 in ReduceUint32Div()
801 if (m.right().Is(0)) return Replace(m.right().node()); // x / 0 => 0 in ReduceUint32Div()
802 if (m.right().Is(1)) return Replace(m.left().node()); // x / 1 => x in ReduceUint32Div()
809 return Replace(Word32Equal(Word32Equal(m.left().node(), zero), zero)); in ReduceUint32Div()
820 return Replace(Uint32Div(dividend, divisor)); in ReduceUint32Div()
829 if (m.left().Is(0)) return Replace(m.left().node()); // 0 % x => 0 in ReduceInt32Mod()
830 if (m.right().Is(0)) return Replace(m.right().node()); // x % 0 => 0 in ReduceInt32Mod()
867 if (m.left().Is(0)) return Replace(m.left().node()); // 0 % x => 0 in ReduceUint32Mod()
868 if (m.right().Is(0)) return Replace(m.right().node()); // x % 0 => 0 in ReduceUint32Mod()
958 return Replace(index == 0 ? m.left().node() : m.right().node()); in ReduceProjection()
972 return Replace(index == 0 ? m.left().node() : m.right().node()); in ReduceProjection()
986 return Replace(m.right().node()); in ReduceProjection()
989 return index == 0 ? Replace(m.left().node()) : ReplaceInt32(0); in ReduceProjection()
1023 if (m.right().Is(0)) return Replace(m.left().node()); // x << 0 => x in ReduceWord32Shl()
1048 if (m.right().Is(0)) return Replace(m.left().node()); // x << 0 => x in ReduceWord64Shl()
1057 if (m.right().Is(0)) return Replace(m.left().node()); // x >>> 0 => x in ReduceWord32Shr()
1078 if (m.right().Is(0)) return Replace(m.left().node()); // x >>> 0 => x in ReduceWord64Shr()
1087 if (m.right().Is(0)) return Replace(m.left().node()); // x >> 0 => x in ReduceWord32Sar()
1108 return Replace(mleft.left().node()); in ReduceWord32Sar()
1113 return Replace(mleft.left().node()); in ReduceWord32Sar()
1122 if (m.right().Is(0)) return Replace(m.left().node()); // x >> 0 => x in ReduceWord64Sar()
1132 if (m.right().Is(0)) return Replace(m.right().node()); // x & 0 => 0 in ReduceWord32And()
1133 if (m.right().Is(-1)) return Replace(m.left().node()); // x & -1 => x in ReduceWord32And()
1135 return Replace(m.left().node()); in ReduceWord32And()
1140 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x & x => x in ReduceWord32And()
1158 return Replace(mleft.node()); in ReduceWord32And()
1223 return Replace(mleft.node()); in ReduceWord32And()
1285 if (m.right().Is(0)) return Replace(m.left().node()); // x | 0 => x in ReduceWord32Or()
1286 if (m.right().Is(-1)) return Replace(m.right().node()); // x | -1 => -1 in ReduceWord32Or()
1290 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x | x => x in ReduceWord32Or()
1298 if (m.right().Is(0)) return Replace(m.left().node()); // x ^ 0 => x in ReduceWord32Xor()
1306 return Replace(mleft.left().node()); in ReduceWord32Xor()