Lines Matching refs:p0
444 Node* const p0 = Parameter(0); in TEST_F() local
450 graph()->NewNode(common()->Phi(MachineRepresentation::kFloat64, 2), p0, in TEST_F()
455 IsPhi(MachineRepresentation::kWord32, IsTruncateFloat64ToInt32(p0), in TEST_F()
492 Node* const p0 = Parameter(0); in TEST_F() local
499 graph()->NewNode(machine()->Word32Shl(), p0, Int32Constant(l)), in TEST_F()
502 EXPECT_THAT(r1.replacement(), IsWord32Shl(p0, IsInt32Constant(l))); in TEST_F()
507 graph()->NewNode(machine()->Word32Shl(), p0, Int32Constant(l)))); in TEST_F()
509 EXPECT_THAT(r2.replacement(), IsWord32Shl(p0, IsInt32Constant(l))); in TEST_F()
516 Node* const p0 = Parameter(0); in TEST_F() local
525 graph()->NewNode(machine()->Word32And(), p0, Int32Constant(k)), in TEST_F()
529 (k & l) ? IsWord32And(p0, IsInt32Constant(k & l)) in TEST_F()
535 graph()->NewNode(machine()->Word32And(), Int32Constant(k), p0), in TEST_F()
539 (k & l) ? IsWord32And(p0, IsInt32Constant(k & l)) in TEST_F()
547 Node* const p0 = Parameter(0); in TEST_F() local
556 graph()->NewNode(machine()->Int32Add(), p0, Int32Constant(k << l)), in TEST_F()
560 IsInt32Add(IsWord32And(p0, IsInt32Constant(-1 << l)), in TEST_F()
568 machine()->Word32And(), graph()->NewNode(machine()->Int32Add(), s1, p0), in TEST_F()
572 IsInt32Add(IsWord32And(p0, IsInt32Constant(-1 << l)), s1)); in TEST_F()
576 machine()->Word32And(), graph()->NewNode(machine()->Int32Add(), p0, s1), in TEST_F()
580 IsInt32Add(IsWord32And(p0, IsInt32Constant(-1 << l)), s1)); in TEST_F()
586 Node* const p0 = Parameter(0); in TEST_F() local
595 graph()->NewNode(machine()->Int32Mul(), p0, Int32Constant(k << l)), in TEST_F()
598 EXPECT_THAT(r1.replacement(), IsInt32Mul(p0, IsInt32Constant(k << l))); in TEST_F()
603 graph()->NewNode(machine()->Int32Mul(), Int32Constant(k << l), p0), in TEST_F()
606 EXPECT_THAT(r2.replacement(), IsInt32Mul(p0, IsInt32Constant(k << l))); in TEST_F()
614 Node* const p0 = Parameter(0); in TEST_F() local
626 p0), in TEST_F()
630 IsInt32Add(IsWord32And(p0, IsInt32Constant(-1 << l)), in TEST_F()
636 graph()->NewNode(machine()->Int32Add(), p0, in TEST_F()
642 IsInt32Add(IsWord32And(p0, IsInt32Constant(-1 << l)), in TEST_F()
650 Node* const p0 = Parameter(0); in TEST_F() local
653 Node* cmp = graph()->NewNode((machine()->*cbop.constructor)(), p0, p1); in TEST_F()
675 Node* const p0 = Parameter(0); in TEST_F() local
680 graph()->NewNode(machine()->Word32Xor(), p0, Int32Constant(-1)), in TEST_F()
683 EXPECT_EQ(r1.replacement(), p0); in TEST_F()
688 graph()->NewNode(machine()->Word32Xor(), p0, Int32Constant(-1)))); in TEST_F()
690 EXPECT_EQ(r2.replacement(), p0); in TEST_F()
695 graph()->NewNode(machine()->Word32Xor(), Int32Constant(-1), p0), in TEST_F()
698 EXPECT_EQ(r3.replacement(), p0); in TEST_F()
703 graph()->NewNode(machine()->Word32Xor(), Int32Constant(-1), p0))); in TEST_F()
705 EXPECT_EQ(r4.replacement(), p0); in TEST_F()
812 Node* const p0 = Parameter(0); in TEST_F() local
816 Node* cmp = graph()->NewNode((machine()->*cbop.constructor)(), p0, p1); in TEST_F()
830 Node* const p0 = Parameter(0); in TEST_F() local
833 Node* const l = graph()->NewNode(machine()->Load(MachineType::Int8()), p0, in TEST_F()
843 Node* const l = graph()->NewNode(machine()->Load(MachineType::Int16()), p0, in TEST_F()
860 Node* p0 = Parameter(0); in TEST_F() local
861 Node* node = graph()->NewNode(machine()->Word32Shl(), p0, Int32Constant(0)); in TEST_F()
864 EXPECT_EQ(p0, r.replacement()); in TEST_F()
869 Node* p0 = Parameter(0); in TEST_F() local
873 graph()->NewNode(machine()->Word32Sar(), p0, Int32Constant(x)), in TEST_F()
878 EXPECT_THAT(r.replacement(), IsWord32And(p0, IsInt32Constant(m))); in TEST_F()
885 Node* const p0 = Parameter(0); in TEST_F() local
893 graph()->NewNode(machine()->Int32Add(), p0, in TEST_F()
899 IsInt32Add(IsWord32And(p0, IsInt32Constant(-1 << l)), in TEST_F()
907 Node* p0 = Parameter(0); in TEST_F() local
911 graph()->NewNode(machine()->Word32Shr(), p0, Int32Constant(x)), in TEST_F()
916 EXPECT_THAT(r.replacement(), IsWord32And(p0, IsInt32Constant(m))); in TEST_F()
926 Node* const p0 = Parameter(0); in TEST_F() local
929 Reduce(graph()->NewNode(machine()->Int32Sub(), p0, Int32Constant(k))); in TEST_F()
932 EXPECT_EQ(p0, r.replacement()); in TEST_F()
934 EXPECT_THAT(r.replacement(), IsInt32Add(p0, IsInt32Constant(-k))); in TEST_F()
945 Node* const p0 = Parameter(0); in TEST_F() local
948 machine()->Int32Div(), p0, Int32Constant(0), graph()->start())); in TEST_F()
954 machine()->Int32Div(), p0, Int32Constant(1), graph()->start())); in TEST_F()
956 EXPECT_EQ(r.replacement(), p0); in TEST_F()
960 machine()->Int32Div(), p0, Int32Constant(-1), graph()->start())); in TEST_F()
962 EXPECT_THAT(r.replacement(), IsInt32Sub(IsInt32Constant(0), p0)); in TEST_F()
966 machine()->Int32Div(), p0, Int32Constant(2), graph()->start())); in TEST_F()
970 IsWord32Sar(IsInt32Add(IsWord32Shr(p0, IsInt32Constant(31)), p0), in TEST_F()
975 machine()->Int32Div(), p0, Int32Constant(-2), graph()->start())); in TEST_F()
981 IsWord32Sar(IsInt32Add(IsWord32Shr(p0, IsInt32Constant(31)), p0), in TEST_F()
986 Reduce(graph()->NewNode(machine()->Int32Div(), p0, in TEST_F()
991 IsWord32Sar(IsInt32Add(IsWord32Shr(IsWord32Sar(p0, IsInt32Constant(31)), in TEST_F()
993 p0), in TEST_F()
998 machine()->Int32Div(), p0, in TEST_F()
1007 IsInt32Add(IsWord32Shr(IsWord32Sar(p0, IsInt32Constant(31)), in TEST_F()
1009 p0), in TEST_F()
1016 machine()->Int32Div(), p0, Int32Constant(divisor), graph()->start())); in TEST_F()
1019 IsTruncatingDiv(p0, -divisor))); in TEST_F()
1023 machine()->Int32Div(), p0, Int32Constant(divisor), graph()->start())); in TEST_F()
1025 EXPECT_THAT(r.replacement(), IsTruncatingDiv(p0, divisor)); in TEST_F()
1032 Node* const p0 = Parameter(0); in TEST_F() local
1034 Reduce(graph()->NewNode(machine()->Int32Div(), p0, p0, graph()->start())); in TEST_F()
1038 IsWord32Equal(IsWord32Equal(p0, IsInt32Constant(0)), IsInt32Constant(0))); in TEST_F()
1047 Node* const p0 = Parameter(0); in TEST_F() local
1050 machine()->Uint32Div(), Int32Constant(0), p0, graph()->start())); in TEST_F()
1056 machine()->Uint32Div(), p0, Int32Constant(0), graph()->start())); in TEST_F()
1062 machine()->Uint32Div(), p0, Int32Constant(1), graph()->start())); in TEST_F()
1064 EXPECT_EQ(r.replacement(), p0); in TEST_F()
1079 Reduce(graph()->NewNode(machine()->Uint32Div(), p0, in TEST_F()
1083 IsWord32Shr(p0, IsInt32Constant(bit_cast<int32_t>(shift)))); in TEST_F()
1089 Node* const p0 = Parameter(0); in TEST_F() local
1091 graph()->NewNode(machine()->Uint32Div(), p0, p0, graph()->start())); in TEST_F()
1095 IsWord32Equal(IsWord32Equal(p0, IsInt32Constant(0)), IsInt32Constant(0))); in TEST_F()
1104 Node* const p0 = Parameter(0); in TEST_F() local
1107 machine()->Int32Mod(), Int32Constant(0), p0, graph()->start())); in TEST_F()
1113 machine()->Int32Mod(), p0, Int32Constant(0), graph()->start())); in TEST_F()
1119 machine()->Int32Mod(), p0, Int32Constant(1), graph()->start())); in TEST_F()
1125 machine()->Int32Mod(), p0, Int32Constant(-1), graph()->start())); in TEST_F()
1141 Reduce(graph()->NewNode(machine()->Int32Mod(), p0, in TEST_F()
1148 IsInt32LessThan(p0, IsInt32Constant(0)), in TEST_F()
1150 IsWord32And(IsInt32Sub(IsInt32Constant(0), p0), in TEST_F()
1152 IsWord32And(p0, IsInt32Constant(mask)))); in TEST_F()
1156 machine()->Int32Mod(), p0, in TEST_F()
1164 IsInt32LessThan(p0, IsInt32Constant(0)), in TEST_F()
1166 IsWord32And(IsInt32Sub(IsInt32Constant(0), p0), in TEST_F()
1168 IsWord32And(p0, IsInt32Constant(mask)))); in TEST_F()
1173 machine()->Int32Mod(), p0, Int32Constant(divisor), graph()->start())); in TEST_F()
1176 IsInt32Sub(p0, IsInt32Mul(IsTruncatingDiv(p0, Abs(divisor)), in TEST_F()
1183 Node* const p0 = Parameter(0); in TEST_F() local
1185 Reduce(graph()->NewNode(machine()->Int32Mod(), p0, p0, graph()->start())); in TEST_F()
1196 Node* const p0 = Parameter(0); in TEST_F() local
1199 machine()->Uint32Mod(), p0, Int32Constant(0), graph()->start())); in TEST_F()
1205 machine()->Uint32Mod(), Int32Constant(0), p0, graph()->start())); in TEST_F()
1211 machine()->Uint32Mod(), p0, Int32Constant(1), graph()->start())); in TEST_F()
1228 Reduce(graph()->NewNode(machine()->Uint32Mod(), p0, in TEST_F()
1232 IsWord32And(p0, IsInt32Constant( in TEST_F()
1239 Node* const p0 = Parameter(0); in TEST_F() local
1241 graph()->NewNode(machine()->Uint32Mod(), p0, p0, graph()->start())); in TEST_F()
1252 Node* const p0 = Parameter(0); in TEST_F() local
1257 graph()->NewNode(machine()->Int32Sub(), Int32Constant(0), p0), p1)); in TEST_F()
1259 EXPECT_THAT(r1.replacement(), IsInt32Sub(p1, p0)); in TEST_F()
1262 machine()->Int32Add(), p0, in TEST_F()
1265 EXPECT_THAT(r2.replacement(), IsInt32Sub(p0, p1)); in TEST_F()
1274 Node* p0 = Parameter(0); in TEST_F() local
1277 Int32Constant(0), p0); in TEST_F()
1285 EXPECT_EQ(p0, r.replacement()); in TEST_F()
1288 Node* add = graph()->NewNode(machine()->Int32AddWithOverflow(), p0, in TEST_F()
1297 EXPECT_EQ(p0, r.replacement()); in TEST_F()
1327 Node* p0 = Parameter(0); in TEST_F() local
1329 graph()->NewNode(machine()->Int32SubWithOverflow(), p0, Int32Constant(0)); in TEST_F()
1337 EXPECT_EQ(p0, r.replacement()); in TEST_F()
1366 Node* const p0 = Parameter(0); in TEST_F() local
1371 graph()->NewNode(machine()->Word32Sar(), p0, Uint32Constant(shift)), in TEST_F()
1378 p0, IsInt32Constant(bit_cast<int32_t>(limit << shift)))); in TEST_F()
1388 Node* const p0 = Parameter(0); in TEST_F() local
1391 graph()->NewNode(machine()->Float64Mul(), p0, Float64Constant(-1.0))); in TEST_F()
1394 IsFloat64Sub(IsFloat64Constant(BitEq(-0.0)), p0)); in TEST_F()
1398 graph()->NewNode(machine()->Float64Mul(), Float64Constant(-1.0), p0)); in TEST_F()
1401 IsFloat64Sub(IsFloat64Constant(BitEq(-0.0)), p0)); in TEST_F()
1451 Node* const p0 = Parameter(0); in TEST_F() local
1455 graph()->NewNode(machine()->ChangeFloat32ToFloat64(), p0), in TEST_F()
1458 EXPECT_THAT(r.replacement(), IsFloat32Equal(p0, p1)); in TEST_F()
1463 Node* const p0 = Parameter(0); in TEST_F() local
1467 graph()->NewNode(machine()->ChangeFloat32ToFloat64(), p0), in TEST_F()
1470 EXPECT_THAT(r.replacement(), IsFloat32Equal(p0, IsFloat32Constant(x))); in TEST_F()
1480 Node* const p0 = Parameter(0); in TEST_F() local
1484 graph()->NewNode(machine()->ChangeFloat32ToFloat64(), p0), in TEST_F()
1487 EXPECT_THAT(r.replacement(), IsFloat32LessThan(p0, p1)); in TEST_F()
1492 Node* const p0 = Parameter(0); in TEST_F() local
1497 graph()->NewNode(machine()->ChangeFloat32ToFloat64(), p0), in TEST_F()
1500 EXPECT_THAT(r.replacement(), IsFloat32LessThan(p0, IsFloat32Constant(x))); in TEST_F()
1507 graph()->NewNode(machine()->ChangeFloat32ToFloat64(), p0))); in TEST_F()
1509 EXPECT_THAT(r.replacement(), IsFloat32LessThan(IsFloat32Constant(x), p0)); in TEST_F()
1521 Node* const p0 = Parameter(0); in TEST_F() local
1525 graph()->NewNode(machine()->ChangeFloat32ToFloat64(), p0), in TEST_F()
1528 EXPECT_THAT(r.replacement(), IsFloat32LessThanOrEqual(p0, p1)); in TEST_F()
1533 Node* const p0 = Parameter(0); in TEST_F() local
1538 graph()->NewNode(machine()->ChangeFloat32ToFloat64(), p0), in TEST_F()
1542 IsFloat32LessThanOrEqual(p0, IsFloat32Constant(x))); in TEST_F()
1549 graph()->NewNode(machine()->ChangeFloat32ToFloat64(), p0))); in TEST_F()
1552 IsFloat32LessThanOrEqual(IsFloat32Constant(x), p0)); in TEST_F()