Revert of [turbofan] Checking of input counts on node creation

test/unittests/compiler/value-numbering-reducer-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 <limits>
 
 #include "src/compiler/graph.h"
 #include "src/compiler/node.h"
 #include "src/compiler/operator.h"
 #include "src/compiler/value-numbering-reducer.h"
@@ skipping 26 matching lines @@
 
  private:
   Graph graph_;
   ValueNumberingReducer reducer_;
 };
 
 
 TEST_F(ValueNumberingReducerTest, AllInputsAreChecked) {
   Node* na = graph()->NewNode(&kOp0);
   Node* nb = graph()->NewNode(&kOp0);
-  Node* n1 = graph()->NewNode(&kOp1, na);
-  Node* n2 = graph()->NewNode(&kOp1, nb);
+  Node* n1 = graph()->NewNode(&kOp0, na);
+  Node* n2 = graph()->NewNode(&kOp0, nb);
   EXPECT_FALSE(Reduce(n1).Changed());
   EXPECT_FALSE(Reduce(n2).Changed());
 }
 
 
 TEST_F(ValueNumberingReducerTest, DeadNodesAreNeverReturned) {
   Node* n0 = graph()->NewNode(&kOp0);
   Node* n1 = graph()->NewNode(&kOp1, n0);
   EXPECT_FALSE(Reduce(n1).Changed());
   n1->Kill();
@@ skipping 64 matching lines @@
 
 TEST_F(ValueNumberingReducerTest, WontReplaceNodeWithItself) {
   Node* n = graph()->NewNode(&kOp0);
   EXPECT_FALSE(Reduce(n).Changed());
   EXPECT_FALSE(Reduce(n).Changed());
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8