Reland "[turbofan] Checking of input counts on node creation"

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 737 matching lines @@
 
   Node* p0 = graph()->NewNode(common()->Parameter(0), start);
 
   Node* fv = graph()->NewNode(common()->Int32Constant(7));
   Node* br = graph()->NewNode(common()->Branch(), p0, graph()->start());
   Node* t = graph()->NewNode(common()->IfTrue(), br);
   Node* f = graph()->NewNode(common()->IfFalse(), br);
 
   Node* map = graph()->NewNode(
       simplified()->LoadElement(AccessBuilder::ForFixedArrayElement()), p0, p0,
-      p0, start, f);
+      start, f);
   Node* br1 = graph()->NewNode(common()->Branch(), map, graph()->start());
   Node* t1 = graph()->NewNode(common()->IfTrue(), br1);
   Node* f1 = graph()->NewNode(common()->IfFalse(), br1);
   Node* m1 = graph()->NewNode(common()->Merge(2), t1, f1);
   Node* ttrue = graph()->NewNode(common()->Int32Constant(1));
   Node* ffalse = graph()->NewNode(common()->Int32Constant(0));
   Node* phi1 =
       graph()->NewNode(common()->Phi(kMachAnyTagged, 2), ttrue, ffalse, m1);
 
 
@@ skipping 391 matching lines @@
 
   Schedule* schedule = ComputeAndVerifySchedule(6);
   BasicBlock* block = schedule->block(loop);
   EXPECT_EQ(block, schedule->block(effect));
   EXPECT_GE(block->rpo_number(), 0);
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8