| Index: test/unittests/compiler/simplified-operator-reducer-unittest.cc
|
| diff --git a/test/unittests/compiler/simplified-operator-reducer-unittest.cc b/test/unittests/compiler/simplified-operator-reducer-unittest.cc
|
| index 2b4097b3084bbd45169ac027ad17fb89c45b4195..465ee84b4f037691669fb17d25260e305f96275b 100644
|
| --- a/test/unittests/compiler/simplified-operator-reducer-unittest.cc
|
| +++ b/test/unittests/compiler/simplified-operator-reducer-unittest.cc
|
| @@ -490,46 +490,45 @@ TEST_F(SimplifiedOperatorReducerTest, LoadElementWithConstantKeyAndLength) {
|
| access_nocheck.bounds_check = kNoBoundsCheck;
|
| Node* const base = Parameter(0);
|
| Node* const effect = graph()->start();
|
| - Node* const control = graph()->start();
|
| {
|
| Node* const key = NumberConstant(-42.0);
|
| Node* const length = NumberConstant(100.0);
|
| Reduction r = Reduce(graph()->NewNode(simplified()->LoadElement(access),
|
| - base, key, length, effect, control));
|
| + base, key, length, effect));
|
| ASSERT_FALSE(r.Changed());
|
| }
|
| {
|
| Node* const key = NumberConstant(-0.0);
|
| Node* const length = NumberConstant(1.0);
|
| Reduction r = Reduce(graph()->NewNode(simplified()->LoadElement(access),
|
| - base, key, length, effect, control));
|
| + base, key, length, effect));
|
| ASSERT_TRUE(r.Changed());
|
| - EXPECT_THAT(r.replacement(), IsLoadElement(access_nocheck, base, key,
|
| - length, effect, control));
|
| + EXPECT_THAT(r.replacement(),
|
| + IsLoadElement(access_nocheck, base, key, length, effect));
|
| }
|
| {
|
| Node* const key = NumberConstant(0);
|
| Node* const length = NumberConstant(1);
|
| Reduction r = Reduce(graph()->NewNode(simplified()->LoadElement(access),
|
| - base, key, length, effect, control));
|
| + base, key, length, effect));
|
| ASSERT_TRUE(r.Changed());
|
| - EXPECT_THAT(r.replacement(), IsLoadElement(access_nocheck, base, key,
|
| - length, effect, control));
|
| + EXPECT_THAT(r.replacement(),
|
| + IsLoadElement(access_nocheck, base, key, length, effect));
|
| }
|
| {
|
| Node* const key = NumberConstant(42.2);
|
| Node* const length = NumberConstant(128);
|
| Reduction r = Reduce(graph()->NewNode(simplified()->LoadElement(access),
|
| - base, key, length, effect, control));
|
| + base, key, length, effect));
|
| ASSERT_TRUE(r.Changed());
|
| - EXPECT_THAT(r.replacement(), IsLoadElement(access_nocheck, base, key,
|
| - length, effect, control));
|
| + EXPECT_THAT(r.replacement(),
|
| + IsLoadElement(access_nocheck, base, key, length, effect));
|
| }
|
| {
|
| Node* const key = NumberConstant(39.2);
|
| Node* const length = NumberConstant(32.0);
|
| Reduction r = Reduce(graph()->NewNode(simplified()->LoadElement(access),
|
| - base, key, length, effect, control));
|
| + base, key, length, effect));
|
| ASSERT_FALSE(r.Changed());
|
| }
|
| }
|
|
|