Lines Matching refs:Replace
339 if (m.right().Is(0)) return Replace(m.left().node()); // x ror 0 => x
380 if (m.right().Is(0)) return Replace(m.right().node()); // x * 0 => 0
381 if (m.right().Is(1)) return Replace(m.left().node()); // x * 1 => x
503 return Replace(m.left().node()); // x - 0 => x
522 return Replace(graph()->NewNode(machine()->Float32RoundUp().op(),
552 return Replace(m.left().node()); // x - 0 => x
571 return Replace(graph()->NewNode(machine()->Float64RoundUp().op(),
586 return Replace(m.left().node()); // x * 1.0 => x
610 return Replace(m.left().node()); // x / 1.0 => x
771 return Replace(Float64PowHalf(m.left().node()));
813 if (m.IsChangeInt32ToFloat64()) return Replace(m.node()->InputAt(0));
820 if (m.IsChangeInt64ToFloat64()) return Replace(m.node()->InputAt(0));
827 if (m.IsChangeUint32ToFloat64()) return Replace(m.node()->InputAt(0));
850 if (m.IsChangeFloat64ToInt64()) return Replace(m.node()->InputAt(0));
869 if (m.IsChangeInt32ToFloat64()) return Replace(m.node()->InputAt(0));
883 return Replace(m.node()->InputAt(0));
891 if (m.IsChangeInt32ToFloat64()) return Replace(m.node()->InputAt(0));
912 return Replace(m.InputAt(0));
961 return Replace(node->InputAt(2));
963 return Replace(node->InputAt(1));
978 if (m.IsChangeInt32ToInt64()) return Replace(m.node()->InputAt(0));
985 if (m.right().Is(0)) return Replace(m.left().node()); // x + 0 => x
1025 if (m.right().Is(0)) return Replace(m.left().node()); // x + 0 => 0
1047 if (m.right().Is(0)) return Replace(m.left().node()); // x - 0 => x
1066 if (m.right().Is(0)) return Replace(m.left().node()); // x - 0 => x
1071 if (m.LeftEqualsRight()) return Replace(Int64Constant(0)); // x - x => 0
1085 if (m.right().Is(0)) return Replace(m.right().node()); // x * 0 => 0
1086 if (m.right().Is(1)) return Replace(m.left().node()); // x * 1 => x
1120 if (m.left().Is(0)) return Replace(m.left().node()); // 0 / x => 0
1121 if (m.right().Is(0)) return Replace(m.right().node()); // x / 0 => 0
1122 if (m.right().Is(1)) return Replace(m.left().node()); // x / 1 => x
1129 return Replace(Word32Equal(Word32Equal(m.left().node(), zero), zero));
1160 return Replace(quotient);
1167 if (m.left().Is(0)) return Replace(m.left().node()); // 0 / x => 0
1168 if (m.right().Is(0)) return Replace(m.right().node()); // x / 0 => 0
1169 if (m.right().Is(1)) return Replace(m.left().node()); // x / 1 => x
1176 return Replace(Word32Equal(Word32Equal(m.left().node(), zero), zero));
1188 return Replace(Uint32Div(dividend, divisor));
1196 if (m.left().Is(0)) return Replace(m.left().node()); // 0 % x => 0
1197 if (m.right().Is(0)) return Replace(m.right().node()); // x % 0 => 0
1214 return Replace(
1232 if (m.left().Is(0)) return Replace(m.left().node()); // 0 % x => 0
1233 if (m.right().Is(0)) return Replace(m.right().node()); // x % 0 => 0
1314 return Replace(index == 0 ? m.left().node() : m.right().node());
1328 return Replace(index == 0 ? m.left().node() : m.right().node());
1342 return Replace(m.right().node());
1345 return index == 0 ? Replace(m.left().node()) : ReplaceInt32(0);
1503 if (m.right().Is(0)) return Replace(m.left().node()); // x << 0 => x
1524 return Replace(x);
1556 if (m.right().Is(0)) return Replace(m.left().node()); // x << 0 => x
1577 return Replace(x);
1606 if (m.right().Is(0)) return Replace(m.left().node()); // x >>> 0 => x
1628 if (m.right().Is(0)) return Replace(m.left().node()); // x >>> 0 => x
1638 if (m.right().Is(0)) return Replace(m.left().node()); // x >> 0 => x
1659 return Replace(mleft.left().node());
1664 return Replace(mleft.left().node());
1673 if (m.right().Is(0)) return Replace(m.left().node()); // x >> 0 => x
1687 if (m.right().Is(0)) return Replace(m.right().node()); // x & 0 => 0
1688 if (m.right().Is(-1)) return Replace(m.left().node()); // x & -1 => x
1690 return Replace(m.left().node());
1695 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x & x => x
1714 return Replace(mleft.node());
1776 return Replace(mleft.node());
1985 if (m.right().Is(0)) return Replace(m.left().node()); // x | 0 => x
1986 if (m.right().Is(-1)) return Replace(m.right().node()); // x | -1 => -1
1990 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x | x => x
2025 if (m.right().Is(0)) return Replace(m.left().node()); // x ^ 0 => x
2033 return Replace(mleft.left().node());
2044 return Replace(Word32Equal(m.right().node(), Int32Constant(0)));