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

src/compiler/simplified-lowering.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/compiler/simplified-lowering.h"
 
 #include <limits>
 
 #include "src/base/bits.h"
 #include "src/code-factory.h"
@@ skipping 248 matching lines @@
     for (int i = tagged_count; i < node->InputCount(); i++) {
       Enqueue(node->InputAt(i));
     }
     // Assume the output is tagged.
     SetOutput(node, kMachAnyTagged);
   }
 
   // Helper for binops of the R x L -> O variety.
   void VisitBinop(Node* node, MachineTypeUnion left_use,
                   MachineTypeUnion right_use, MachineTypeUnion output) {
-    DCHECK_EQ(2, node->op()->ValueInputCount());
+    DCHECK_EQ(2, node->InputCount());
     ProcessInput(node, 0, left_use);
     ProcessInput(node, 1, right_use);
-    for (int i = 2; i < node->InputCount(); i++) {
-      Enqueue(node->InputAt(i));
-    }
     SetOutput(node, output);
   }
 
   // Helper for binops of the I x I -> O variety.
   void VisitBinop(Node* node, MachineTypeUnion input_use,
                   MachineTypeUnion output) {
     VisitBinop(node, input_use, input_use, output);
   }
 
   // Helper for unops of the I -> O variety.
@@ skipping 1351 matching lines @@
 
 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) {
   node->set_op(machine()->IntLessThanOrEqual());
   node->ReplaceInput(0, StringComparison(node));
   node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL));
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8