[turbofan] Move SimplifiedOperatorBuilder into JSGraph.

test/cctest/compiler/test-osr.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/codegen.h"
 #include "src/compiler/all-nodes.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/diamond.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/js-graph.h"
@@ skipping 30 matching lines @@
 
 
 static const int kMaxOsrValues = 10;
 
 class OsrDeconstructorTester : public HandleAndZoneScope {
  public:
   explicit OsrDeconstructorTester(int num_values)
       : isolate(main_isolate()),
         common(main_zone()),
         graph(main_zone()),
-        jsgraph(main_isolate(), &graph, &common, NULL, NULL),
+        jsgraph(main_isolate(), &graph, &common, nullptr, nullptr, nullptr),
         start(graph.NewNode(common.Start(1))),
         p0(graph.NewNode(common.Parameter(0), start)),
         end(graph.NewNode(common.End(1), start)),
         osr_normal_entry(graph.NewNode(common.OsrNormalEntry(), start, start)),
         osr_loop_entry(graph.NewNode(common.OsrLoopEntry(), start, start)),
         self(graph.NewNode(common.Int32Constant(0xaabbccdd))) {
     CHECK(num_values <= kMaxOsrValues);
     graph.SetStart(start);
     for (int i = 0; i < num_values; i++) {
       osr_values[i] = graph.NewNode(common.OsrValue(i), osr_loop_entry);
@@ skipping 494 matching lines @@
 
   Node* new_loop0_phi = new_ret->InputAt(0);
   CHECK_EQ(IrOpcode::kPhi, new_loop0_phi->opcode());
   CHECK_EQ(new_loop0_loop, NodeProperties::GetControlInput(new_loop0_phi));
   CHECK_EQ(new_loop0_phi, FindSuccessor(new_loop0_loop, IrOpcode::kPhi));
 
   // Check that the return returns the phi from the OSR loop and control
   // depends on the copy of the outer loop0.
   CheckInputs(new_ret, new_loop0_phi, T.graph.start(), new_loop0_exit);
 }