[turbofan] Ensure that NTLs are always properly connected to the end.

test/unittests/compiler/scheduler-unittest.cc

 // Copyright 2015 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/compiler/access-builder.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/graph-visualizer.h"
 #include "src/compiler/js-operator.h"
 #include "src/compiler/node.h"
@@ skipping 1948 matching lines @@
   Node* end = graph()->NewNode(common()->End(), ret, start);
 
   graph()->SetEnd(end);
 
   Schedule* schedule = ComputeAndVerifySchedule(13, graph());
   // Make sure the true block is marked as deferred.
   CHECK(schedule->block(t)->deferred());
   CHECK(!schedule->block(f)->deferred());
 }
 
-
-TARGET_TEST_F(SchedulerTest, ScheduleTerminate) {
-  Node* start = graph()->NewNode(common()->Start(1));
-  graph()->SetStart(start);
-
-  Node* loop = graph()->NewNode(common()->Loop(2), start, start);
-  loop->ReplaceInput(1, loop);  // self loop, NTL.
-
-  Node* effect = graph()->NewNode(common()->EffectPhi(1), start, loop);
-  effect->ReplaceInput(0, effect);
-
-  Node* terminate = graph()->NewNode(common()->Terminate(1), effect, loop);
-  Node* end = graph()->NewNode(common()->End(), terminate);
-
-  graph()->SetEnd(end);
-
-  Schedule* schedule = ComputeAndVerifySchedule(6, graph());
-  BasicBlock* block = schedule->block(loop);
-  CHECK_NE(NULL, loop);
-  CHECK_EQ(block, schedule->block(effect));
-  CHECK_GE(block->rpo_number(), 0);
-}
-
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8