93   Candidate candidate;  in Reduce()  local
94   candidate.node = node;  in Reduce()
95   candidate.num_functions = CollectFunctions(  in Reduce()
96       callee, candidate.functions, kMaxCallPolymorphism, candidate.shared_info);  in Reduce()
97   if (candidate.num_functions == 0) {  in Reduce()
99   } else if (candidate.num_functions > 1 && !FLAG_polymorphic_inlining) {  in Reduce()
108   candidate.total_size = 0;  in Reduce()
112   for (int i = 0; i < candidate.num_functions; ++i) {  in Reduce()
114         candidate.functions[i].is_null()  in Reduce()
115             ? candidate.shared_info  in Reduce()
116             : handle(candidate.functions[i]->shared(), isolate());  in Reduce()
117     candidate.can_inline_function[i] = CanInlineFunction(shared);  in Reduce()
131       candidate.can_inline_function[i] = false;  in Reduce()
133     if (candidate.can_inline_function[i]) {  in Reduce()
135       candidate.total_size += shared->GetBytecodeArray()->length();  in Reduce()
146     candidate.frequency = p.frequency();  in Reduce()
149     candidate.frequency = p.frequency();  in Reduce()
159       return InlineCandidate(candidate, false);  in Reduce()
167   if (candidate.frequency.IsKnown() &&  in Reduce()
168       candidate.frequency.value() < FLAG_min_inlining_frequency) {  in Reduce()
178     return InlineCandidate(candidate, true);  in Reduce()
182   candidates_.insert(candidate);  in Reduce()
196     Candidate candidate = *i;  in Finalize()  local
202         candidate.total_size * FLAG_reserve_inline_budget_scale_factor;  in Finalize()
210     if (!candidate.node->IsDead()) {  in Finalize()
211       Reduction const reduction = InlineCandidate(candidate, false);  in Finalize()
321                                            Candidate const& candidate,  in TryReuseDispatch()  argument
329   int const num_calls = candidate.num_functions;  in TryReuseDispatch()
556                                                 Candidate const& candidate,  in CreateOrReuseDispatch()  argument
562   if (TryReuseDispatch(node, callee, candidate, if_successes, calls, inputs,  in CreateOrReuseDispatch()
568   int const num_calls = candidate.num_functions;  in CreateOrReuseDispatch()
574     Node* target = jsgraph()->HeapConstant(candidate.functions[i]);  in CreateOrReuseDispatch()
602 Reduction JSInliningHeuristic::InlineCandidate(Candidate const& candidate,  in InlineCandidate()  argument
604   int const num_calls = candidate.num_functions;  in InlineCandidate()
605   Node* const node = candidate.node;  in InlineCandidate()
608         candidate.functions[0].is_null()  in InlineCandidate()
609             ? candidate.shared_info  in InlineCandidate()
610             : handle(candidate.functions[0]->shared(), isolate());  in InlineCandidate()
633   CreateOrReuseDispatch(node, callee, candidate, if_successes, calls, inputs,  in InlineCandidate()
672     Handle<JSFunction> function = candidate.functions[i];  in InlineCandidate()
675         (candidate.can_inline_function[i] &&  in InlineCandidate()
714   for (const Candidate& candidate : candidates_) {  in PrintCandidates()  local
715     os << "  #" << candidate.node->id() << ":"  in PrintCandidates()
716        << candidate.node->op()->mnemonic()  in PrintCandidates()
717        << ", frequency: " << candidate.frequency << std::endl;  in PrintCandidates()
718     for (int i = 0; i < candidate.num_functions; ++i) {  in PrintCandidates()
720           candidate.functions[i].is_null()  in PrintCandidates()
721               ? candidate.shared_info  in PrintCandidates()
722               : handle(candidate.functions[i]->shared(), isolate());  in PrintCandidates()