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

test/unittests/compiler/loop-peeling-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/graph.h"
 #include "src/compiler/graph-visualizer.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/loop-peeling.h"
 #include "src/compiler/machine-operator.h"
@@ skipping 461 matching lines @@
 
 
 TEST_F(LoopPeelingTest, TwoExitLoopWithCall_nope) {
   Node* p0 = Parameter(0);
   Node* loop = graph()->NewNode(common()->Loop(2), start(), start());
   Branch b1 = NewBranch(p0, loop);
 
   Node* call = graph()->NewNode(&kMockCall, b1.if_true);
   Node* if_success = graph()->NewNode(common()->IfSuccess(), call);
   Node* if_exception = graph()->NewNode(
-      common()->IfException(IfExceptionHint::kLocallyUncaught), call);
+      common()->IfException(IfExceptionHint::kLocallyUncaught), call, call);
 
   loop->ReplaceInput(1, if_success);
   Node* merge = graph()->NewNode(common()->Merge(2), b1.if_false, if_exception);
   InsertReturn(p0, start(), merge);
 
   {
     LoopTree* loop_tree = GetLoopTree();
     LoopTree::Loop* loop = loop_tree->outer_loops()[0];
     EXPECT_FALSE(LoopPeeler::CanPeel(loop_tree, loop));
   }
 }
 
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8