| Index: test/unittests/compiler/dead-code-elimination-unittest.cc
|
| diff --git a/test/unittests/compiler/dead-code-elimination-unittest.cc b/test/unittests/compiler/dead-code-elimination-unittest.cc
|
| index df93f25302f17900328ae6142f78b0badbe50e8f..d0351bf5f511d53f7f8f229857d3a073b33961e8 100644
|
| --- a/test/unittests/compiler/dead-code-elimination-unittest.cc
|
| +++ b/test/unittests/compiler/dead-code-elimination-unittest.cc
|
| @@ -124,15 +124,11 @@ TEST_F(DeadCodeEliminationTest, IfSuccessWithDeadInput) {
|
|
|
|
|
| TEST_F(DeadCodeEliminationTest, IfExceptionWithDeadControlInput) {
|
| - IfExceptionHint const kHints[] = {IfExceptionHint::kLocallyCaught,
|
| - IfExceptionHint::kLocallyUncaught};
|
| - TRACED_FOREACH(IfExceptionHint, hint, kHints) {
|
| - Reduction const r =
|
| - Reduce(graph()->NewNode(common()->IfException(hint), graph()->start(),
|
| - graph()->NewNode(common()->Dead())));
|
| - ASSERT_TRUE(r.Changed());
|
| - EXPECT_THAT(r.replacement(), IsDead());
|
| - }
|
| + Reduction const r =
|
| + Reduce(graph()->NewNode(common()->IfException(), graph()->start(),
|
| + graph()->NewNode(common()->Dead())));
|
| + ASSERT_TRUE(r.Changed());
|
| + EXPECT_THAT(r.replacement(), IsDead());
|
| }
|
|
|
|
|
|
|