[turbofan] Add an extra frame state for deoptimization before binary op.

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 655 matching lines @@
   Node* ret2 =
       graph()->NewNode(common()->Return(), p5, graph()->start(), false_branch);
   Node* merge = graph()->NewNode(common()->Merge(2), ret1, ret2);
   graph()->SetEnd(graph()->NewNode(common()->End(), merge));
 
   ComputeAndVerifySchedule(13);
 }
 
 
 TEST_F(SchedulerTest, BuildScheduleIfSplitWithEffects) {
+  FLAG_turbo_deoptimization = false;
+
   const Operator* op;
 
   // Manually transcripted code for:
   // function turbo_fan_test(a, b, c, y) {
   //   if (a < b) {
   //     return a + b - c * c - a + y;
   //   } else {
   //     return c * c - a;
   //   }
   // }
@@ skipping 116 matching lines @@
   n23->ReplaceInput(0, n22);
 
   graph()->SetStart(n0);
   graph()->SetEnd(n23);
 
   ComputeAndVerifySchedule(20);
 }
 
 
 TEST_F(SchedulerTest, BuildScheduleSimpleLoop) {
+  FLAG_turbo_deoptimization = false;
+
   const Operator* op;
 
   // Manually transcripted code for:
   // function turbo_fan_test(a, b) {
   //   while (a < b) {
   //     a++;
   //   }
   //   return a;
   // }
   op = common()->Start(0);
@@ skipping 83 matching lines @@
   n20->ReplaceInput(0, n19);
 
   graph()->SetStart(n0);
   graph()->SetEnd(n20);
 
   ComputeAndVerifySchedule(19);
 }
 
 
 TEST_F(SchedulerTest, BuildScheduleComplexLoops) {
+  FLAG_turbo_deoptimization = false;
+
   const Operator* op;
 
   // Manually transcripted code for:
   // function turbo_fan_test(a, b, c) {
   //   while (a < b) {
   //     a++;
   //     while (c < b) {
   //       c++;
   //     }
   //   }
@@ skipping 218 matching lines @@
   n46->ReplaceInput(0, n45);
 
   graph()->SetStart(n0);
   graph()->SetEnd(n46);
 
   ComputeAndVerifySchedule(46);
 }
 
 
 TEST_F(SchedulerTest, BuildScheduleBreakAndContinue) {
+  FLAG_turbo_deoptimization = false;
+
   const Operator* op;
 
   // Manually transcripted code for:
   // function turbo_fan_test(a, b, c) {
   //   var d = 0;
   //   while (a < b) {
   //     a++;
   //     while (c < b) {
   //       c++;
   //       if (d == 0) break;
@@ skipping 300 matching lines @@
   n58->ReplaceInput(0, n57);
 
   graph()->SetStart(n0);
   graph()->SetEnd(n58);
 
   ComputeAndVerifySchedule(62);
 }
 
 
 TEST_F(SchedulerTest, BuildScheduleSimpleLoopWithCodeMotion) {
+  FLAG_turbo_deoptimization = false;
+
   const Operator* op;
 
   // Manually transcripted code for:
   // function turbo_fan_test(a, b, c) {
   //   while (a < b) {
   //     a += b + c;
   //   }
   //   return a;
   // }
   op = common()->Start(0);
@@ skipping 547 matching lines @@
   Node* end = graph()->NewNode(common()->End(), ret);
 
   graph()->SetEnd(end);
 
   ComputeAndVerifySchedule(16);
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8