Index: test/unittests/compiler/select-lowering-unittest.cc |
diff --git a/test/unittests/compiler/select-lowering-unittest.cc b/test/unittests/compiler/select-lowering-unittest.cc |
index 51efc83f87c2eb15d4d8f6edfe3ac3a7ef77a34b..43cfd8484a712e0ad84c721e746c71cd46a99989 100644 |
--- a/test/unittests/compiler/select-lowering-unittest.cc |
+++ b/test/unittests/compiler/select-lowering-unittest.cc |
@@ -34,7 +34,8 @@ TEST_F(SelectLoweringTest, SelectWithSameConditions) { |
Node* const p2 = Parameter(2); |
Node* const p3 = Parameter(3); |
Node* const p4 = Parameter(4); |
- Node* const s0 = graph()->NewNode(common()->Select(kMachInt32), p0, p1, p2); |
+ Node* const s0 = graph()->NewNode( |
+ common()->Select(MachineRepresentation::kWord32), p0, p1, p2); |
Capture<Node*> branch; |
Capture<Node*> merge; |
@@ -44,26 +45,27 @@ TEST_F(SelectLoweringTest, SelectWithSameConditions) { |
EXPECT_THAT( |
r.replacement(), |
IsPhi( |
- kMachInt32, p1, p2, |
+ MachineRepresentation::kWord32, p1, p2, |
AllOf(CaptureEq(&merge), |
IsMerge(IsIfTrue(CaptureEq(&branch)), |
IsIfFalse(AllOf(CaptureEq(&branch), |
IsBranch(p0, graph()->start()))))))); |
} |
{ |
- Reduction const r = |
- Reduce(graph()->NewNode(common()->Select(kMachInt32), p0, p3, p4)); |
+ Reduction const r = Reduce(graph()->NewNode( |
+ common()->Select(MachineRepresentation::kWord32), p0, p3, p4)); |
ASSERT_TRUE(r.Changed()); |
- EXPECT_THAT(r.replacement(), IsPhi(kMachInt32, p3, p4, CaptureEq(&merge))); |
+ EXPECT_THAT(r.replacement(), IsPhi(MachineRepresentation::kWord32, p3, p4, |
+ CaptureEq(&merge))); |
} |
{ |
// We must not reuse the diamond if it is reachable from either else/then |
// values of the Select, because the resulting graph can not be scheduled. |
- Reduction const r = |
- Reduce(graph()->NewNode(common()->Select(kMachInt32), p0, s0, p0)); |
+ Reduction const r = Reduce(graph()->NewNode( |
+ common()->Select(MachineRepresentation::kWord32), p0, s0, p0)); |
ASSERT_TRUE(r.Changed()); |
- EXPECT_THAT(r.replacement(), |
- IsPhi(kMachInt32, s0, p0, Not(CaptureEq(&merge)))); |
+ EXPECT_THAT(r.replacement(), IsPhi(MachineRepresentation::kWord32, s0, p0, |
+ Not(CaptureEq(&merge)))); |
} |
} |