Lines Matching refs:mleft
292 Int32BinopMatcher mleft(m.left().node()); in Reduce() local
293 if (mleft.right().HasValue()) { in Reduce()
297 const uint32_t k = mleft.right().Value() & 0x1f; in Reduce()
299 node->ReplaceInput(0, mleft.left().node()); in Reduce()
711 Int32BinopMatcher mleft(m.left().node()); in ReduceInt32Add() local
712 if (mleft.left().Is(0)) { // (0 - x) + y => y - x in ReduceInt32Add()
714 node->ReplaceInput(1, mleft.right().node()); in ReduceInt32Add()
959 Int32BinopMatcher mleft(m.left().node()); in ReduceStore() local
960 if (mleft.right().Is(m.right().Value())) { in ReduceStore()
961 node->ReplaceInput(value_input, mleft.left().node()); in ReduceStore()
1059 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32Shl() local
1060 if (mleft.right().Is(m.right().Value())) { in ReduceWord32Shl()
1061 node->ReplaceInput(0, mleft.left().node()); in ReduceWord32Shl()
1090 Uint32BinopMatcher mleft(m.left().node()); in ReduceWord32Shr() local
1091 if (mleft.right().HasValue()) { in ReduceWord32Shr()
1093 uint32_t mask = mleft.right().Value(); in ReduceWord32Shr()
1120 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32Sar() local
1121 if (mleft.left().IsComparison()) { in ReduceWord32Sar()
1122 if (m.right().Is(31) && mleft.right().Is(31)) { in ReduceWord32Sar()
1125 node->ReplaceInput(1, mleft.left().node()); in ReduceWord32Sar()
1130 } else if (mleft.left().IsLoad()) { in ReduceWord32Sar()
1132 LoadRepresentationOf(mleft.left().node()->op()); in ReduceWord32Sar()
1133 if (m.right().Is(24) && mleft.right().Is(24) && in ReduceWord32Sar()
1136 return Replace(mleft.left().node()); in ReduceWord32Sar()
1138 if (m.right().Is(16) && mleft.right().Is(16) && in ReduceWord32Sar()
1141 return Replace(mleft.left().node()); in ReduceWord32Sar()
1170 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32And() local
1171 if (mleft.right().HasValue()) { // (x & K) & K => x & K in ReduceWord32And()
1172 node->ReplaceInput(0, mleft.left().node()); in ReduceWord32And()
1174 1, Int32Constant(m.right().Value() & mleft.right().Value())); in ReduceWord32And()
1182 Uint32BinopMatcher mleft(m.left().node()); in ReduceWord32And() local
1183 if (mleft.right().HasValue() && in ReduceWord32And()
1184 (mleft.right().Value() & 0x1f) >= in ReduceWord32And()
1187 return Replace(mleft.node()); in ReduceWord32And()
1190 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32And() local
1191 if (mleft.right().HasValue() && in ReduceWord32And()
1192 (mleft.right().Value() & mask) == mleft.right().Value()) { in ReduceWord32And()
1194 node->ReplaceInput(0, Word32And(mleft.left().node(), m.right().node())); in ReduceWord32And()
1195 node->ReplaceInput(1, mleft.right().node()); in ReduceWord32And()
1200 if (mleft.left().IsInt32Mul()) { in ReduceWord32And()
1201 Int32BinopMatcher mleftleft(mleft.left().node()); in ReduceWord32And()
1205 Word32And(mleft.right().node(), m.right().node())); in ReduceWord32And()
1212 if (mleft.right().IsInt32Mul()) { in ReduceWord32And()
1213 Int32BinopMatcher mleftright(mleft.right().node()); in ReduceWord32And()
1217 Word32And(mleft.left().node(), m.right().node())); in ReduceWord32And()
1224 if (mleft.left().IsWord32Shl()) { in ReduceWord32And()
1225 Int32BinopMatcher mleftleft(mleft.left().node()); in ReduceWord32And()
1229 Word32And(mleft.right().node(), m.right().node())); in ReduceWord32And()
1236 if (mleft.right().IsWord32Shl()) { in ReduceWord32And()
1237 Int32BinopMatcher mleftright(mleft.right().node()); in ReduceWord32And()
1241 Word32And(mleft.left().node(), m.right().node())); in ReduceWord32And()
1249 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32And() local
1250 if (mleft.right().IsMultipleOf(-mask)) { in ReduceWord32And()
1252 return Replace(mleft.node()); in ReduceWord32And()
1333 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32Xor() local
1334 if (mleft.right().Is(-1)) { // (x ^ -1) ^ -1 => x in ReduceWord32Xor()
1335 return Replace(mleft.left().node()); in ReduceWord32Xor()