[turbofan] Make sure an inlined call is not resurrected and inlined again.

src/compiler/js-inlining-heuristic.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/js-inlining-heuristic.h"
 
 #include "src/compilation-info.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/simplified-operator.h"
@@ skipping 252 matching lines @@
       graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, num_calls),
                        num_calls + 1, calls);
   ReplaceWithValue(node, value, effect, control);
 
   // Inline the individual, cloned call sites.
   for (int i = 0; i < num_calls; ++i) {
     Handle<JSFunction> function = candidate.functions[i];
     Node* node = calls[i];
     Reduction const reduction = inliner_.ReduceJSCall(node);
     if (reduction.Changed()) {
+      // Killing the call node is not strictly necessary, but it is safer to
+      // make sure we do not resurrect the node.
+      node->Kill();
       cumulative_count_ += function->shared()->ast_node_count();
     }
   }
 
   return Replace(value);
 }
 
 bool JSInliningHeuristic::CandidateCompare::operator()(
     const Candidate& left, const Candidate& right) const {
   if (left.frequency > right.frequency) {
@@ skipping 27 matching lines @@
   return jsgraph()->common();
 }
 
 SimplifiedOperatorBuilder* JSInliningHeuristic::simplified() const {
   return jsgraph()->simplified();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8