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()
708 Int32BinopMatcher mleft(m.left().node()); in ReduceInt32Add() local
709 if (mleft.left().Is(0)) { // (0 - x) + y => y - x in ReduceInt32Add()
711 node->ReplaceInput(1, mleft.right().node()); in ReduceInt32Add()
953 Int32BinopMatcher mleft(m.left().node()); in ReduceStore() local
954 if (mleft.right().Is(m.right().Value())) { in ReduceStore()
955 node->ReplaceInput(value_input, mleft.left().node()); in ReduceStore()
1053 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32Shl() local
1054 if (mleft.right().Is(m.right().Value())) { in ReduceWord32Shl()
1055 node->ReplaceInput(0, mleft.left().node()); in ReduceWord32Shl()
1084 Uint32BinopMatcher mleft(m.left().node()); in ReduceWord32Shr() local
1085 if (mleft.right().HasValue()) { in ReduceWord32Shr()
1087 uint32_t mask = mleft.right().Value(); in ReduceWord32Shr()
1114 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32Sar() local
1115 if (mleft.left().IsComparison()) { in ReduceWord32Sar()
1116 if (m.right().Is(31) && mleft.right().Is(31)) { in ReduceWord32Sar()
1119 node->ReplaceInput(1, mleft.left().node()); in ReduceWord32Sar()
1124 } else if (mleft.left().IsLoad()) { in ReduceWord32Sar()
1126 LoadRepresentationOf(mleft.left().node()->op()); in ReduceWord32Sar()
1127 if (m.right().Is(24) && mleft.right().Is(24) && in ReduceWord32Sar()
1130 return Replace(mleft.left().node()); in ReduceWord32Sar()
1132 if (m.right().Is(16) && mleft.right().Is(16) && in ReduceWord32Sar()
1135 return Replace(mleft.left().node()); in ReduceWord32Sar()
1164 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32And() local
1165 if (mleft.right().HasValue()) { // (x & K) & K => x & K in ReduceWord32And()
1166 node->ReplaceInput(0, mleft.left().node()); in ReduceWord32And()
1168 1, Int32Constant(m.right().Value() & mleft.right().Value())); in ReduceWord32And()
1176 Uint32BinopMatcher mleft(m.left().node()); in ReduceWord32And() local
1177 if (mleft.right().HasValue() && in ReduceWord32And()
1178 (mleft.right().Value() & 0x1F) >= in ReduceWord32And()
1181 return Replace(mleft.node()); in ReduceWord32And()
1184 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32And() local
1185 if (mleft.right().HasValue() && in ReduceWord32And()
1186 (mleft.right().Value() & mask) == mleft.right().Value()) { in ReduceWord32And()
1188 node->ReplaceInput(0, Word32And(mleft.left().node(), m.right().node())); in ReduceWord32And()
1189 node->ReplaceInput(1, mleft.right().node()); in ReduceWord32And()
1194 if (mleft.left().IsInt32Mul()) { in ReduceWord32And()
1195 Int32BinopMatcher mleftleft(mleft.left().node()); in ReduceWord32And()
1199 Word32And(mleft.right().node(), m.right().node())); in ReduceWord32And()
1206 if (mleft.right().IsInt32Mul()) { in ReduceWord32And()
1207 Int32BinopMatcher mleftright(mleft.right().node()); in ReduceWord32And()
1211 Word32And(mleft.left().node(), m.right().node())); in ReduceWord32And()
1218 if (mleft.left().IsWord32Shl()) { in ReduceWord32And()
1219 Int32BinopMatcher mleftleft(mleft.left().node()); in ReduceWord32And()
1223 Word32And(mleft.right().node(), m.right().node())); in ReduceWord32And()
1230 if (mleft.right().IsWord32Shl()) { in ReduceWord32And()
1231 Int32BinopMatcher mleftright(mleft.right().node()); in ReduceWord32And()
1235 Word32And(mleft.left().node(), m.right().node())); in ReduceWord32And()
1243 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32And() local
1244 if (mleft.right().IsMultipleOf(-mask)) { in ReduceWord32And()
1246 return Replace(mleft.node()); in ReduceWord32And()
1327 Int32BinopMatcher mleft(m.left().node()); in ReduceWord32Xor() local
1328 if (mleft.right().Is(-1)) { // (x ^ -1) ^ -1 => x in ReduceWord32Xor()
1329 return Replace(mleft.left().node()); in ReduceWord32Xor()