[turbofan] Don't introduce additional computation when hoisting out of loops.

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 1561 matching lines @@
   op = common()->IfFalse();
   Node* n18 = graph()->NewNode(op, nil);
   USE(n18);
   n18->ReplaceInput(0, n16);
   n21->ReplaceInput(2, n18);
   n22->ReplaceInput(0, n21);
 
   graph()->SetStart(n0);
   graph()->SetEnd(n22);
 
-  Schedule* schedule = ComputeAndVerifySchedule(19);
-  // Make sure the integer-only add gets hoisted to a different block that the
-  // JSAdd.
-  EXPECT_NE(schedule->block(n19), schedule->block(n20));
+  ComputeAndVerifySchedule(19);
 }
 
 
 namespace {
 
 Node* CreateDiamond(Graph* graph, CommonOperatorBuilder* common, Node* cond) {
   Node* tv = graph->NewNode(common->Int32Constant(6));
   Node* fv = graph->NewNode(common->Int32Constant(7));
   Node* br = graph->NewNode(common->Branch(), cond, graph->start());
   Node* t = graph->NewNode(common->IfTrue(), br);
@@ skipping 437 matching lines @@
   Node* end = graph()->NewNode(common()->End(), ret);
 
   graph()->SetEnd(end);
 
   ComputeAndVerifySchedule(16);
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8