Lines Matching defs:call
179 TRACE("Not considering call site #"
219 TRACE("Not considering call site #" << node->id() << ":"
240 // Gather feedback on how often this call site has been hit before.
250 // threshold, i.e. a call site that is only hit once every N
268 TRACE("Inlining small function(s) at call site #"
417 // the {callee} target of the call. We only reuse the branch if there
418 // is no side-effect between the call and the branch, and if the callee is
458 // The {callee} here is a phi that merges the possible call targets, {node}
459 // is the actual call that we will try to duplicate and connect to the
461 // the call and the calle phi.
464 // the call (with all the frame states and such), and connect the duplicated
503 // Bailout if the call is not polymorphic anymore (other reducers might
509 // and the call, bail out.
514 // and the call, bail out. We will drop any checkpoint between the call and
516 // checkpoint that the call can fall back to.
528 // The effect phi, the callee, the call and the checkpoint must be the only
537 // The effect phi must be only used by the checkpoint or the call.
543 // the entire subgraph reachable by inputs from the call (terminating
547 // 1. In the call (as a target).
548 // 2. The checkpoint between the call and the callee computation merge.
560 // duplicate all the nodes between the merge and the call, replacing all
589 // Case 1 (use by the call as a target).
603 // Clone the call and the framestate, including the uniquely reachable
624 // Duplicate the call.
682 // The first input to the call is the actual target (which we specialize
723 // Setup the inputs for the cloned call nodes.
734 // Check if we have an exception projection for the call {node}.
757 // Morph the original call site into a join of the dispatched call sites.
768 // Inline the individual, cloned call sites.
775 Node* call = calls[i];
776 Reduction const reduction = inliner_.ReduceJSCall(call);
779 // Killing the call node is not strictly necessary, but it is safer to
781 call->Kill();