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

test/unittests/compiler/control-equivalence-unittest.cc

 // Copyright 2014 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/bit-vector.h"
 #include "src/compiler/control-equivalence.h"
 #include "src/compiler/graph-visualizer.h"
 #include "src/compiler/node-properties.h"
 #include "src/zone-containers.h"
 #include "test/unittests/compiler/graph-unittest.h"
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
 #define ASSERT_EQUIVALENCE(...)                           \
   do {                                                    \
     Node* __n[] = {__VA_ARGS__};                          \
     ASSERT_TRUE(IsEquivalenceClass(arraysize(__n), __n)); \
   } while (false)
 
 class ControlEquivalenceTest : public GraphTest {
  public:
   ControlEquivalenceTest() : all_nodes_(zone()), classes_(zone()) {
     Store(graph()->start());
   }
 
  protected:
   void ComputeEquivalence(Node* node) {
-    graph()->SetEnd(graph()->NewNode(common()->End(), node));
+    graph()->SetEnd(graph()->NewNode(common()->End(1), node));
     if (FLAG_trace_turbo) {
       OFStream os(stdout);
       os << AsDOT(*graph());
     }
     ControlEquivalence equivalence(zone(), graph());
     equivalence.Run(node);
     classes_.resize(graph()->NodeCount());
     for (Node* node : all_nodes_) {
       classes_[node->id()] = equivalence.ClassOf(node);
     }
@@ skipping 31 matching lines @@
 
   Node* Merge2(Node* control1, Node* control2) {
     return Store(graph()->NewNode(common()->Merge(2), control1, control2));
   }
 
   Node* Loop2(Node* control) {
     return Store(graph()->NewNode(common()->Loop(2), control, control));
   }
 
   Node* End(Node* control) {
-    return Store(graph()->NewNode(common()->End(), control));
+    return Store(graph()->NewNode(common()->End(1), control));
   }
 
  private:
   Node* Store(Node* node) {
     all_nodes_.push_back(node);
     return node;
   }
 
   ZoneVector<Node*> all_nodes_;
   ZoneVector<size_t> classes_;
@@ skipping 153 matching lines @@
   ASSERT_EQUIVALENCE(t2);
   ASSERT_EQUIVALENCE(f2);
   ASSERT_EQUIVALENCE(f3);
   ASSERT_EQUIVALENCE(lp);
 }
 
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8