[turbofan] Change End to take a variable number of inputs.

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 33 matching lines @@
 
 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),
         start(graph.NewNode(common.Start(1))),
         p0(graph.NewNode(common.Parameter(0), start)),
-        end(graph.NewNode(common.End(), 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 305 matching lines @@
   Node* outer_phi = outer.Phi(T.p0, T.p0, nullptr);
   outer.branch->ReplaceInput(0, outer_phi);
 
   Node* osr_phi = inner.Phi(T.jsgraph.OneConstant(), T.osr_values[0],
                             T.jsgraph.ZeroConstant());
   inner.branch->ReplaceInput(0, osr_phi);
   outer_phi->ReplaceInput(1, osr_phi);
 
   Node* ret =
       T.graph.NewNode(T.common.Return(), outer_phi, T.start, outer.exit);
-  Node* end = T.graph.NewNode(T.common.End(), ret);
+  Node* end = T.graph.NewNode(T.common.End(1), ret);
   T.graph.SetEnd(end);
 
   T.DeconstructOsr();
 
   // Check structure of deconstructed graph.
   // Check inner OSR loop is directly connected to start.
   CheckInputs(inner.loop, T.start, inner.if_true);
   CheckInputs(osr_phi, T.osr_values[0], T.jsgraph.ZeroConstant(), inner.loop);
 
   // Check control transfer to copy of outer loop.
@@ skipping 46 matching lines @@
 
   Node* x_branch = T.graph.NewNode(T.common.Branch(), osr_phi, inner.exit);
   Node* x_true = T.graph.NewNode(T.common.IfTrue(), x_branch);
   Node* x_false = T.graph.NewNode(T.common.IfFalse(), x_branch);
 
   outer.loop->ReplaceInput(1, x_true);
   outer.loop->ReplaceInput(2, x_false);
 
   Node* ret =
       T.graph.NewNode(T.common.Return(), outer_phi, T.start, outer.exit);
-  Node* end = T.graph.NewNode(T.common.End(), ret);
+  Node* end = T.graph.NewNode(T.common.End(1), ret);
   T.graph.SetEnd(end);
 
   T.DeconstructOsr();
 
   // Check structure of deconstructed graph.
   // Check inner OSR loop is directly connected to start.
   CheckInputs(inner.loop, T.start, inner.if_true);
   CheckInputs(osr_phi, T.osr_values[0], T.jsgraph.ZeroConstant(), inner.loop);
 
   // Check control transfer to copy of outer loop.
@@ skipping 84 matching lines @@
   // Branch to either the outer or middle loop.
   Node* branch = T.graph.NewNode(T.common.Branch(), loop2_cntr, loop2.exit);
   Node* if_true = T.graph.NewNode(T.common.IfTrue(), branch);
   Node* if_false = T.graph.NewNode(T.common.IfFalse(), branch);
 
   loop0.loop->ReplaceInput(1, if_true);
   loop1->ReplaceInput(1, if_false);
 
   Node* ret =
       T.graph.NewNode(T.common.Return(), loop0_cntr, T.start, loop0.exit);
-  Node* end = T.graph.NewNode(T.common.End(), ret);
+  Node* end = T.graph.NewNode(T.common.End(1), ret);
   T.graph.SetEnd(end);
 
   T.DeconstructOsr();
 
   // Check structure of deconstructed graph.
   // Check loop2 (OSR loop) is directly connected to start.
   CheckInputs(loop2.loop, T.start, loop2.if_true);
   CheckInputs(osr_phi, T.osr_values[0], loop2_inc, loop2.loop);
   CheckInputs(loop2.branch, osr_phi, loop2.loop);
   CheckInputs(loop2.if_true, loop2.branch);
@@ skipping 23 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);
 }