[turbofan] Split pure nodes in the scheduler if beneficial.

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 14 matching lines @@
  public:
   SchedulerTest()
       : graph_(zone()), common_(zone()), simplified_(zone()), js_(zone()) {}
 
   static Schedule* ComputeAndVerifySchedule(int expected, Graph* graph) {
     if (FLAG_trace_turbo) {
       OFStream os(stdout);
       os << AsDOT(*graph);
     }
 
-    Schedule* schedule = Scheduler::ComputeSchedule(graph->zone(), graph);
+    Schedule* schedule = Scheduler::ComputeSchedule(graph->zone(), graph,
+                                                    Scheduler::kSplitNodes);
 
     if (FLAG_trace_turbo_scheduler) {
       OFStream os(stdout);
       os << *schedule << std::endl;
     }
     ScheduleVerifier::Run(schedule);
     CHECK_EQ(expected, GetScheduledNodeCount(schedule));
     return schedule;
   }
 
@@ skipping 98 matching lines @@
 
 const Operator kIntAdd(IrOpcode::kInt32Add, Operator::kPure, "Int32Add", 2, 0,
                        0, 1, 0, 0);
 
 }  // namespace
 
 
 TEST_F(SchedulerTest, BuildScheduleEmpty) {
   graph()->SetStart(graph()->NewNode(common()->Start(0)));
   graph()->SetEnd(graph()->NewNode(common()->End(), graph()->start()));
-  USE(Scheduler::ComputeSchedule(zone(), graph()));
+  USE(Scheduler::ComputeSchedule(zone(), graph(), Scheduler::kNoFlags));
 }
 
 
 TEST_F(SchedulerTest, BuildScheduleOneParameter) {
   graph()->SetStart(graph()->NewNode(common()->Start(0)));
 
   Node* p1 = graph()->NewNode(common()->Parameter(0), graph()->start());
   Node* ret = graph()->NewNode(common()->Return(), p1, graph()->start(),
                                graph()->start());
 
   graph()->SetEnd(graph()->NewNode(common()->End(), ret));
 
-  USE(Scheduler::ComputeSchedule(zone(), graph()));
+  USE(Scheduler::ComputeSchedule(zone(), graph(), Scheduler::kNoFlags));
 }
 
 
 TEST_F(SchedulerTest, BuildScheduleIfSplit) {
   graph()->SetStart(graph()->NewNode(common()->Start(3)));
 
   Node* p1 = graph()->NewNode(common()->Parameter(0), graph()->start());
   Node* p2 = graph()->NewNode(common()->Parameter(1), graph()->start());
   Node* p3 = graph()->NewNode(common()->Parameter(2), graph()->start());
   Node* p4 = graph()->NewNode(common()->Parameter(3), graph()->start());
@@ skipping 1549 matching lines @@
   Node* mB2 = graph()->NewNode(common()->Merge(2), tB2, fB2);
   Node* phiB2 =
       graph()->NewNode(common()->Phi(kMachAnyTagged, 2), phiA1, c, mB2);
 
   Node* add = graph()->NewNode(&kIntAdd, phiA2, phiB2);
   Node* ret = graph()->NewNode(common()->Return(), add, start, start);
   Node* end = graph()->NewNode(common()->End(), ret, start);
 
   graph()->SetEnd(end);
 
-  ComputeAndVerifySchedule(35, graph());
+  ComputeAndVerifySchedule(36, graph());
 }
 
 
 TARGET_TEST_F(SchedulerTest, NestedFloatingDiamondWithLoop) {
   Node* start = graph()->NewNode(common()->Start(2));
   graph()->SetStart(start);
 
   Node* p0 = graph()->NewNode(common()->Parameter(0), start);
 
   Node* fv = graph()->NewNode(common()->Int32Constant(7));
@@ skipping 214 matching lines @@
 
   Schedule* schedule = ComputeAndVerifySchedule(13, graph());
   // Make sure the true block is marked as deferred.
   CHECK(schedule->block(t)->deferred());
   CHECK(!schedule->block(f)->deferred());
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8