| /* Callgraph transformations to handle inlining | |
| Copyright (C) 2003-2026 Free Software Foundation, Inc. | |
| Contributed by Jan Hubicka | |
| This file is part of GCC. | |
| GCC is free software; you can redistribute it and/or modify it under | |
| the terms of the GNU General Public License as published by the Free | |
| Software Foundation; either version 3, or (at your option) any later | |
| version. | |
| GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
| WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| for more details. | |
| You should have received a copy of the GNU General Public License | |
| along with GCC; see the file COPYING3. If not see | |
| <http://www.gnu.org/licenses/>. */ | |
| /* The inline decisions are stored in callgraph in "inline plan" and | |
| applied later. | |
| To mark given call inline, use inline_call function. | |
| The function marks the edge inlinable and, if necessary, produces | |
| virtual clone in the callgraph representing the new copy of callee's | |
| function body. | |
| The inline plan is applied on given function body by inline_transform. */ | |
| #define INCLUDE_ALGORITHM | |
| #include "config.h" | |
| #include "system.h" | |
| #include "coretypes.h" | |
| #include "tm.h" | |
| #include "function.h" | |
| #include "tree.h" | |
| #include "alloc-pool.h" | |
| #include "tree-pass.h" | |
| #include "cgraph.h" | |
| #include "tree-cfg.h" | |
| #include "symbol-summary.h" | |
| #include "tree-vrp.h" | |
| #include "sreal.h" | |
| #include "ipa-cp.h" | |
| #include "ipa-prop.h" | |
| #include "ipa-fnsummary.h" | |
| #include "ipa-inline.h" | |
| #include "tree-inline.h" | |
| #include "cfg.h" | |
| #include "basic-block.h" | |
| #include "ipa-utils.h" | |
| #include "ipa-modref-tree.h" | |
| #include "ipa-modref.h" | |
| #include "symtab-thunks.h" | |
| #include "symtab-clones.h" | |
| int ncalls_inlined; | |
| int nfunctions_inlined; | |
| /* We removed or are going to remove the last call to NODE. | |
| Return true if we can and want proactively remove the NODE now. | |
| This is important to do, since we want inliner to know when offline | |
| copy of function was removed. */ | |
| static bool | |
| can_remove_node_now_p_1 (struct cgraph_node *node, struct cgraph_edge *e) | |
| { | |
| ipa_ref *ref; | |
| FOR_EACH_ALIAS (node, ref) | |
| { | |
| cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); | |
| if ((alias->callers && alias->callers != e) | |
| || !can_remove_node_now_p_1 (alias, e)) | |
| return false; | |
| } | |
| /* FIXME: When address is taken of DECL_EXTERNAL function we still | |
| can remove its offline copy, but we would need to keep unanalyzed node in | |
| the callgraph so references can point to it. | |
| Also for comdat group we can ignore references inside a group as we | |
| want to prove the group as a whole to be dead. */ | |
| return (!node->address_taken | |
| && node->can_remove_if_no_direct_calls_and_refs_p () | |
| /* Inlining might enable more devirtualizing, so we want to remove | |
| those only after all devirtualizable virtual calls are processed. | |
| Lacking may edges in callgraph we just preserve them post | |
| inlining. */ | |
| && (!DECL_VIRTUAL_P (node->decl) | |
| || !opt_for_fn (node->decl, flag_devirtualize)) | |
| /* During early inlining some unanalyzed cgraph nodes might be in the | |
| callgraph and they might refer the function in question. */ | |
| && !cgraph_new_nodes.exists ()); | |
| } | |
| /* We are going to eliminate last direct call to NODE (or alias of it) via edge E. | |
| Verify that the NODE can be removed from unit and if it is contained in comdat | |
| group that the whole comdat group is removable. */ | |
| static bool | |
| can_remove_node_now_p (struct cgraph_node *node, struct cgraph_edge *e) | |
| { | |
| struct cgraph_node *next; | |
| if (!can_remove_node_now_p_1 (node, e)) | |
| return false; | |
| /* When we see same comdat group, we need to be sure that all | |
| items can be removed. */ | |
| if (!node->same_comdat_group || !node->externally_visible) | |
| return true; | |
| for (next = dyn_cast<cgraph_node *> (node->same_comdat_group); | |
| next != node; next = dyn_cast<cgraph_node *> (next->same_comdat_group)) | |
| { | |
| if (next->alias) | |
| continue; | |
| if ((next->callers && next->callers != e) | |
| || !can_remove_node_now_p_1 (next, e)) | |
| return false; | |
| } | |
| return true; | |
| } | |
| /* Return true if NODE is a master clone with non-inline clones. */ | |
| static bool | |
| master_clone_with_noninline_clones_p (struct cgraph_node *node) | |
| { | |
| if (node->clone_of) | |
| return false; | |
| for (struct cgraph_node *n = node->clones; n; n = n->next_sibling_clone) | |
| if (n->decl != node->decl) | |
| return true; | |
| return false; | |
| } | |
| /* E is expected to be an edge being inlined. Clone destination node of | |
| the edge and redirect it to the new clone. | |
| DUPLICATE is used for bookkeeping on whether we are actually creating new | |
| clones or re-using node originally representing out-of-line function call. | |
| By default the offline copy is removed, when it appears dead after inlining. | |
| KEEP_OFFLINE_COPY prevents this transformation. | |
| If UPDATE_ORIGINAL is set, clones profile is subtracted from the offline version. | |
| If OVERALL_SIZE is non-NULL, the size is updated to reflect the | |
| transformation. */ | |
| void | |
| clone_inlined_nodes (struct cgraph_edge *e, bool duplicate, | |
| bool keep_offline_copy, | |
| bool update_original, int *overall_size) | |
| { | |
| struct cgraph_node *inlining_into; | |
| struct cgraph_edge *next; | |
| if (e->caller->inlined_to) | |
| inlining_into = e->caller->inlined_to; | |
| else | |
| inlining_into = e->caller; | |
| if (duplicate) | |
| { | |
| /* We may eliminate the need for out-of-line copy to be output. | |
| In that case just go ahead and re-use it. This is not just an | |
| memory optimization. Making offline copy of function disappear | |
| from the program will improve future decisions on inlining. */ | |
| if (!e->callee->callers->next_caller | |
| /* Recursive inlining never wants the master clone to | |
| be overwritten. */ | |
| && !keep_offline_copy | |
| && can_remove_node_now_p (e->callee, e) | |
| /* We cannot overwrite a master clone with non-inline clones | |
| until after these clones are materialized. */ | |
| && !master_clone_with_noninline_clones_p (e->callee)) | |
| { | |
| /* TODO: When callee is in a comdat group, we could remove all of it, | |
| including all inline clones inlined into it. That would however | |
| need small function inlining to register edge removal hook to | |
| maintain the priority queue. | |
| For now we keep the other functions in the group in program until | |
| cgraph_remove_unreachable_functions gets rid of them. */ | |
| gcc_assert (!e->callee->inlined_to); | |
| e->callee->remove_from_same_comdat_group (); | |
| if (e->callee->definition | |
| && inline_account_function_p (e->callee)) | |
| { | |
| gcc_assert (!e->callee->alias); | |
| if (overall_size) | |
| *overall_size -= ipa_size_summaries->get (e->callee)->size; | |
| nfunctions_inlined++; | |
| } | |
| duplicate = false; | |
| e->callee->externally_visible = false; | |
| profile_count num = e->count; | |
| profile_count den = e->callee->count; | |
| profile_count::adjust_for_ipa_scaling (&num, &den); | |
| e->callee->apply_scale (num, den); | |
| dump_callgraph_transformation (e->callee, inlining_into, | |
| "inlining to"); | |
| } | |
| else | |
| { | |
| struct cgraph_node *n; | |
| n = e->callee->create_clone (e->callee->decl, | |
| e->count, | |
| update_original, vNULL, true, | |
| inlining_into, | |
| NULL, NULL); | |
| n->used_as_abstract_origin = e->callee->used_as_abstract_origin; | |
| e->redirect_callee (n); | |
| } | |
| } | |
| else | |
| e->callee->remove_from_same_comdat_group (); | |
| e->callee->inlined_to = inlining_into; | |
| if (e->callee->ipa_transforms_to_apply.length ()) | |
| { | |
| e->callee->ipa_transforms_to_apply.release (); | |
| e->callee->ipa_transforms_to_apply = vNULL; | |
| } | |
| /* Recursively clone all bodies. */ | |
| for (e = e->callee->callees; e; e = next) | |
| { | |
| next = e->next_callee; | |
| if (!e->inline_failed) | |
| clone_inlined_nodes (e, duplicate, keep_offline_copy, | |
| update_original, overall_size); | |
| } | |
| } | |
| /* Check all speculations in N and if any seem useless, resolve them. When a | |
| first edge is resolved, pop all edges from NEW_EDGES and insert them to | |
| EDGE_SET. Then remove each resolved edge from EDGE_SET, if it is there. */ | |
| static bool | |
| check_speculations_1 (cgraph_node *n, vec<cgraph_edge *> *new_edges, | |
| hash_set <cgraph_edge *> *edge_set) | |
| { | |
| bool speculation_removed = false; | |
| cgraph_edge *next; | |
| for (cgraph_edge *e = n->callees; e; e = next) | |
| { | |
| next = e->next_callee; | |
| if (e->speculative && !speculation_useful_p (e, true)) | |
| { | |
| while (new_edges && !new_edges->is_empty ()) | |
| edge_set->add (new_edges->pop ()); | |
| edge_set->remove (e); | |
| cgraph_edge::resolve_speculation (e, NULL); | |
| speculation_removed = true; | |
| } | |
| else if (!e->inline_failed) | |
| speculation_removed |= check_speculations_1 (e->callee, new_edges, | |
| edge_set); | |
| } | |
| return speculation_removed; | |
| } | |
| /* Push E to NEW_EDGES. Called from hash_set traverse method, which | |
| unfortunately means this function has to have external linkage, otherwise | |
| the code will not compile with gcc 4.8. */ | |
| bool | |
| push_all_edges_in_set_to_vec (cgraph_edge * const &e, | |
| vec<cgraph_edge *> *new_edges) | |
| { | |
| new_edges->safe_push (e); | |
| return true; | |
| } | |
| /* Check all speculations in N and if any seem useless, resolve them and remove | |
| them from NEW_EDGES. */ | |
| static bool | |
| check_speculations (cgraph_node *n, vec<cgraph_edge *> *new_edges) | |
| { | |
| hash_set <cgraph_edge *> edge_set; | |
| bool res = check_speculations_1 (n, new_edges, &edge_set); | |
| if (!edge_set.is_empty ()) | |
| edge_set.traverse <vec<cgraph_edge *> *, | |
| push_all_edges_in_set_to_vec> (new_edges); | |
| return res; | |
| } | |
| /* Mark all call graph edges coming out of NODE and all nodes that have been | |
| inlined to it as in_polymorphic_cdtor. */ | |
| static void | |
| mark_all_inlined_calls_cdtor (cgraph_node *node) | |
| { | |
| for (cgraph_edge *cs = node->callees; cs; cs = cs->next_callee) | |
| { | |
| cs->in_polymorphic_cdtor = true; | |
| if (!cs->inline_failed) | |
| mark_all_inlined_calls_cdtor (cs->callee); | |
| } | |
| for (cgraph_edge *cs = node->indirect_calls; cs; cs = cs->next_callee) | |
| cs->in_polymorphic_cdtor = true; | |
| } | |
| /* Mark edge E as inlined and update callgraph accordingly. UPDATE_ORIGINAL | |
| specify whether profile of original function should be updated and whether | |
| offline copy should be removed if unnecessary. If any new | |
| indirect edges are discovered in the process, add them to NEW_EDGES, unless | |
| it is NULL. If UPDATE_OVERALL_SUMMARY is false, do not bother to recompute overall | |
| size of caller after inlining. Caller is required to eventually do it via | |
| ipa_update_overall_fn_summary. | |
| If callee_removed is non-NULL, set it to true if we removed callee node. | |
| Return true iff any new callgraph edges were discovered as a | |
| result of inlining. */ | |
| bool | |
| inline_call (struct cgraph_edge *e, bool update_original, | |
| vec<cgraph_edge *> *new_edges, | |
| int *overall_size, bool update_overall_summary, | |
| bool *callee_removed) | |
| { | |
| int old_size = 0, new_size = 0; | |
| struct cgraph_node *to = NULL; | |
| struct cgraph_edge *curr = e; | |
| bool comdat_local = e->callee->comdat_local_p (); | |
| struct cgraph_node *callee = e->callee->ultimate_alias_target (); | |
| bool new_edges_found = false; | |
| bool keep_offline_copy = !update_original; | |
| int estimated_growth = 0; | |
| if (! update_overall_summary) | |
| estimated_growth = estimate_edge_growth (e); | |
| /* This is used only for assert below. */ | |
| #if 0 | |
| bool predicated = inline_edge_summary (e)->predicate != NULL; | |
| #endif | |
| /* Don't inline inlined edges. */ | |
| gcc_assert (e->inline_failed); | |
| /* Don't even think of inlining inline clone. */ | |
| gcc_assert (!callee->inlined_to); | |
| to = e->caller; | |
| if (to->inlined_to) | |
| to = to->inlined_to; | |
| /* In case callee has AFDO profile but caller has GLOBAL0 we need | |
| to re-scale it so it can have non-zero AFDO profile. */ | |
| if (callee->count.quality () == AFDO | |
| && e->count.nonzero_p () | |
| && (to->count.quality () == GUESSED_GLOBAL0_AFDO | |
| || to->count.quality () == GUESSED_GLOBAL0_ADJUSTED)) | |
| { | |
| profile_count num = callee->count; | |
| profile_count den = e->count; | |
| profile_count::adjust_for_ipa_scaling (&num, &den); | |
| if (dump_file) | |
| { | |
| fprintf (dump_file, "Rescalling profile of caller %s " | |
| "to allow non-zero AFDO counts:", | |
| to->dump_name ()); | |
| den.dump (dump_file); | |
| fprintf (dump_file, " -> "); | |
| num.dump (dump_file); | |
| fprintf (dump_file, "\n"); | |
| } | |
| to->apply_scale (num, den); | |
| to->frequency = std::max (to->frequency, callee->frequency); | |
| /* Do not update original, so possible additional calls of callee | |
| are handled reasonably well. */ | |
| update_original = false; | |
| gcc_checking_assert (to->count.quality () == AFDO); | |
| if (dump_file) | |
| { | |
| fprintf (dump_file, "Scaled profile of %s: ", to->dump_name ()); | |
| to->count.dump (dump_file); | |
| fprintf (dump_file, "\n"); | |
| } | |
| } | |
| /* Do sanity checking of the profile and in case of inconsistencies do not | |
| update profile of original. This reduces the chances that inlining | |
| turns callee cold while in reality it is still hot. */ | |
| if (!(callee->count.ipa ().force_nonzero () == callee->count.ipa ())) | |
| { | |
| if (dump_file) | |
| fprintf (dump_file, "Callee count is 0; not updating callee profile\n"); | |
| update_original = false; | |
| } | |
| else if (e->count.ipa ().quality () == AFDO | |
| && !(e->count.ipa ().force_nonzero () == e->count.ipa ())) | |
| { | |
| if (dump_file) | |
| fprintf (dump_file, "Edge count is AFDO 0; not updating callee profile\n"); | |
| update_original = false; | |
| } | |
| if (e->count.ipa () > callee->count.ipa ().apply_scale (9, 8)) | |
| { | |
| if (dump_file) | |
| fprintf (dump_file, "Calee count is too small (profile is inconsistent);" | |
| " not updating callee profile\n"); | |
| update_original = false; | |
| } | |
| if (to->thunk) | |
| { | |
| struct cgraph_node *target = to->callees->callee; | |
| thunk_expansion = true; | |
| /* Remove all annotations, but keep thunk info. */ | |
| thunk_info info = *thunk_info::get (to); | |
| symtab->call_cgraph_removal_hooks (to); | |
| *thunk_info::get_create (to) = info; | |
| if (in_lto_p) | |
| to->get_untransformed_body (); | |
| expand_thunk (to, false, true); | |
| /* When thunk is instrumented we may have multiple callees. */ | |
| for (e = to->callees; e && e->callee != target; e = e->next_callee) | |
| ; | |
| symtab->call_cgraph_insertion_hooks (to); | |
| thunk_expansion = false; | |
| gcc_assert (e); | |
| } | |
| e->inline_failed = CIF_OK; | |
| DECL_POSSIBLY_INLINED (callee->decl) = true; | |
| if (DECL_FUNCTION_PERSONALITY (callee->decl)) | |
| DECL_FUNCTION_PERSONALITY (to->decl) | |
| = DECL_FUNCTION_PERSONALITY (callee->decl); | |
| bool reload_optimization_node = false; | |
| bool remove_strict_aliasing | |
| = (!opt_for_fn (callee->decl, flag_strict_aliasing) | |
| && opt_for_fn (to->decl, flag_strict_aliasing)); | |
| bool remove_assume_sane_operators_new_delete | |
| = (!opt_for_fn (callee->decl, flag_assume_sane_operators_new_delete) | |
| && opt_for_fn (to->decl, flag_assume_sane_operators_new_delete)); | |
| if (remove_strict_aliasing || remove_assume_sane_operators_new_delete) | |
| { | |
| struct gcc_options opts = global_options; | |
| struct gcc_options opts_set = global_options_set; | |
| cl_optimization_restore (&opts, &opts_set, opts_for_fn (to->decl)); | |
| if (remove_strict_aliasing) | |
| { | |
| opts.x_flag_strict_aliasing = false; | |
| if (dump_file) | |
| fprintf (dump_file, "Dropping flag_strict_aliasing on %s\n", | |
| to->dump_name ()); | |
| } | |
| if (remove_assume_sane_operators_new_delete) | |
| { | |
| opts.x_flag_assume_sane_operators_new_delete = false; | |
| if (dump_file) | |
| fprintf (dump_file, | |
| "Dropping flag_assume_sane_operators_new_delete on %s\n", | |
| to->dump_name ()); | |
| } | |
| DECL_FUNCTION_SPECIFIC_OPTIMIZATION (to->decl) | |
| = build_optimization_node (&opts, &opts_set); | |
| reload_optimization_node = true; | |
| } | |
| ipa_fn_summary *caller_info = ipa_fn_summaries->get (to); | |
| ipa_fn_summary *callee_info = ipa_fn_summaries->get (callee); | |
| if (!caller_info->fp_expressions && callee_info->fp_expressions) | |
| { | |
| caller_info->fp_expressions = true; | |
| if (opt_for_fn (callee->decl, flag_rounding_math) | |
| != opt_for_fn (to->decl, flag_rounding_math) | |
| || opt_for_fn (callee->decl, flag_trapping_math) | |
| != opt_for_fn (to->decl, flag_trapping_math) | |
| || opt_for_fn (callee->decl, flag_unsafe_math_optimizations) | |
| != opt_for_fn (to->decl, flag_unsafe_math_optimizations) | |
| || opt_for_fn (callee->decl, flag_finite_math_only) | |
| != opt_for_fn (to->decl, flag_finite_math_only) | |
| || opt_for_fn (callee->decl, flag_signaling_nans) | |
| != opt_for_fn (to->decl, flag_signaling_nans) | |
| || opt_for_fn (callee->decl, flag_complex_method) | |
| != opt_for_fn (to->decl, flag_complex_method) | |
| || opt_for_fn (callee->decl, flag_signed_zeros) | |
| != opt_for_fn (to->decl, flag_signed_zeros) | |
| || opt_for_fn (callee->decl, flag_associative_math) | |
| != opt_for_fn (to->decl, flag_associative_math) | |
| || opt_for_fn (callee->decl, flag_reciprocal_math) | |
| != opt_for_fn (to->decl, flag_reciprocal_math) | |
| || opt_for_fn (callee->decl, flag_fp_int_builtin_inexact) | |
| != opt_for_fn (to->decl, flag_fp_int_builtin_inexact) | |
| || opt_for_fn (callee->decl, flag_errno_math) | |
| != opt_for_fn (to->decl, flag_errno_math)) | |
| { | |
| struct gcc_options opts = global_options; | |
| struct gcc_options opts_set = global_options_set; | |
| cl_optimization_restore (&opts, &opts_set, opts_for_fn (to->decl)); | |
| opts.x_flag_rounding_math | |
| = opt_for_fn (callee->decl, flag_rounding_math); | |
| opts.x_flag_trapping_math | |
| = opt_for_fn (callee->decl, flag_trapping_math); | |
| opts.x_flag_unsafe_math_optimizations | |
| = opt_for_fn (callee->decl, flag_unsafe_math_optimizations); | |
| opts.x_flag_finite_math_only | |
| = opt_for_fn (callee->decl, flag_finite_math_only); | |
| opts.x_flag_signaling_nans | |
| = opt_for_fn (callee->decl, flag_signaling_nans); | |
| opts.x_flag_complex_method | |
| = opt_for_fn (callee->decl, flag_complex_method); | |
| opts.x_flag_signed_zeros | |
| = opt_for_fn (callee->decl, flag_signed_zeros); | |
| opts.x_flag_associative_math | |
| = opt_for_fn (callee->decl, flag_associative_math); | |
| opts.x_flag_reciprocal_math | |
| = opt_for_fn (callee->decl, flag_reciprocal_math); | |
| opts.x_flag_fp_int_builtin_inexact | |
| = opt_for_fn (callee->decl, flag_fp_int_builtin_inexact); | |
| opts.x_flag_errno_math | |
| = opt_for_fn (callee->decl, flag_errno_math); | |
| if (dump_file) | |
| fprintf (dump_file, "Copying FP flags from %s to %s\n", | |
| callee->dump_name (), to->dump_name ()); | |
| DECL_FUNCTION_SPECIFIC_OPTIMIZATION (to->decl) | |
| = build_optimization_node (&opts, &opts_set); | |
| reload_optimization_node = true; | |
| } | |
| } | |
| /* Reload global optimization flags. */ | |
| if (reload_optimization_node && DECL_STRUCT_FUNCTION (to->decl) == cfun) | |
| set_cfun (cfun, true); | |
| /* If aliases are involved, redirect edge to the actual destination and | |
| possibly remove the aliases. */ | |
| if (e->callee != callee) | |
| { | |
| struct cgraph_node *alias = e->callee, *next_alias; | |
| e->redirect_callee (callee); | |
| while (alias && alias != callee) | |
| { | |
| if (!alias->callers | |
| && can_remove_node_now_p (alias, | |
| !e->next_caller && !e->prev_caller ? e : NULL)) | |
| { | |
| next_alias = alias->get_alias_target (); | |
| alias->remove (); | |
| if (callee_removed) | |
| *callee_removed = true; | |
| alias = next_alias; | |
| } | |
| else | |
| break; | |
| } | |
| } | |
| if (callee->must_remain_in_tu_body) | |
| { | |
| gcc_assert (callee->lto_file_data == to->lto_file_data); | |
| to->must_remain_in_tu_body = true; | |
| } | |
| clone_inlined_nodes (e, true, keep_offline_copy, | |
| update_original, overall_size); | |
| gcc_assert (curr->callee->inlined_to == to); | |
| old_size = ipa_size_summaries->get (to)->size; | |
| ipa_merge_modref_summary_after_inlining (e); | |
| ipa_merge_fn_summary_after_inlining (e); | |
| if (e->in_polymorphic_cdtor) | |
| mark_all_inlined_calls_cdtor (e->callee); | |
| if (opt_for_fn (e->caller->decl, optimize)) | |
| new_edges_found = ipa_propagate_indirect_call_infos (curr, new_edges); | |
| bool removed_p = check_speculations (e->callee, new_edges); | |
| if (update_overall_summary) | |
| ipa_update_overall_fn_summary (to, new_edges_found || removed_p); | |
| else | |
| /* Update self size by the estimate so overall function growth limits | |
| work for further inlining into this function. Before inlining | |
| the function we inlined to again we expect the caller to update | |
| the overall summary. */ | |
| ipa_size_summaries->get (to)->size += estimated_growth; | |
| new_size = ipa_size_summaries->get (to)->size; | |
| if (callee->calls_comdat_local) | |
| to->calls_comdat_local = true; | |
| else if (to->calls_comdat_local && comdat_local) | |
| to->calls_comdat_local = to->check_calls_comdat_local_p (); | |
| /* FIXME: This assert suffers from roundoff errors, disable it for GCC 5 | |
| and revisit it after conversion to sreals in GCC 6. | |
| See PR 65654. */ | |
| #if 0 | |
| /* Verify that estimated growth match real growth. Allow off-by-one | |
| error due to ipa_fn_summary::size_scale roudoff errors. */ | |
| gcc_assert (!update_overall_summary || !overall_size || new_edges_found | |
| || abs (estimated_growth - (new_size - old_size)) <= 1 | |
| || speculation_removed | |
| /* FIXME: a hack. Edges with false predicate are accounted | |
| wrong, we should remove them from callgraph. */ | |
| || predicated); | |
| #endif | |
| /* Account the change of overall unit size; external functions will be | |
| removed and are thus not accounted. */ | |
| if (overall_size && inline_account_function_p (to)) | |
| *overall_size += new_size - old_size; | |
| ncalls_inlined++; | |
| /* This must happen after ipa_merge_fn_summary_after_inlining that rely on jump | |
| functions of callee to not be updated. */ | |
| return new_edges_found; | |
| } | |
| /* For each node that was made the holder of function body by | |
| save_inline_function_body, this summary contains pointer to the previous | |
| holder of the body. */ | |
| function_summary <tree *> *ipa_saved_clone_sources; | |
| /* Copy function body of NODE and redirect all inline clones to it. | |
| This is done before inline plan is applied to NODE when there are | |
| still some inline clones if it. | |
| This is necessary because inline decisions are not really transitive | |
| and the other inline clones may have different bodies. */ | |
| static struct cgraph_node * | |
| save_inline_function_body (struct cgraph_node *node) | |
| { | |
| struct cgraph_node *first_clone, *n; | |
| if (dump_file) | |
| fprintf (dump_file, "\nSaving body of %s for later reuse\n", | |
| node->dump_name ()); | |
| gcc_assert (node == cgraph_node::get (node->decl)); | |
| /* first_clone will be turned into real function. */ | |
| first_clone = node->clones; | |
| /* Arrange first clone to not be thunk as those do not have bodies. */ | |
| if (first_clone->thunk) | |
| { | |
| while (first_clone->thunk) | |
| first_clone = first_clone->next_sibling_clone; | |
| first_clone->prev_sibling_clone->next_sibling_clone | |
| = first_clone->next_sibling_clone; | |
| if (first_clone->next_sibling_clone) | |
| first_clone->next_sibling_clone->prev_sibling_clone | |
| = first_clone->prev_sibling_clone; | |
| first_clone->next_sibling_clone = node->clones; | |
| first_clone->prev_sibling_clone = NULL; | |
| node->clones->prev_sibling_clone = first_clone; | |
| node->clones = first_clone; | |
| } | |
| first_clone->decl = copy_node (node->decl); | |
| first_clone->decl->decl_with_vis.symtab_node = first_clone; | |
| gcc_assert (first_clone == cgraph_node::get (first_clone->decl)); | |
| /* Now reshape the clone tree, so all other clones descends from | |
| first_clone. */ | |
| if (first_clone->next_sibling_clone) | |
| { | |
| for (n = first_clone->next_sibling_clone; n->next_sibling_clone; | |
| n = n->next_sibling_clone) | |
| n->clone_of = first_clone; | |
| n->clone_of = first_clone; | |
| n->next_sibling_clone = first_clone->clones; | |
| if (first_clone->clones) | |
| first_clone->clones->prev_sibling_clone = n; | |
| first_clone->clones = first_clone->next_sibling_clone; | |
| first_clone->next_sibling_clone->prev_sibling_clone = NULL; | |
| first_clone->next_sibling_clone = NULL; | |
| gcc_assert (!first_clone->prev_sibling_clone); | |
| } | |
| tree prev_body_holder = node->decl; | |
| if (!ipa_saved_clone_sources) | |
| { | |
| ipa_saved_clone_sources = new function_summary <tree *> (symtab); | |
| ipa_saved_clone_sources->disable_insertion_hook (); | |
| } | |
| else | |
| { | |
| tree *p = ipa_saved_clone_sources->get (node); | |
| if (p) | |
| { | |
| prev_body_holder = *p; | |
| gcc_assert (prev_body_holder); | |
| } | |
| } | |
| *ipa_saved_clone_sources->get_create (first_clone) = prev_body_holder; | |
| first_clone->former_clone_of | |
| = node->former_clone_of ? node->former_clone_of : node->decl; | |
| first_clone->clone_of = NULL; | |
| /* Now node in question has no clones. */ | |
| node->clones = NULL; | |
| /* Inline clones share decl with the function they are cloned | |
| from. Walk the whole clone tree and redirect them all to the | |
| new decl. */ | |
| if (first_clone->clones) | |
| for (n = first_clone->clones; n != first_clone;) | |
| { | |
| gcc_assert (n->decl == node->decl); | |
| n->decl = first_clone->decl; | |
| if (n->clones) | |
| n = n->clones; | |
| else if (n->next_sibling_clone) | |
| n = n->next_sibling_clone; | |
| else | |
| { | |
| while (n != first_clone && !n->next_sibling_clone) | |
| n = n->clone_of; | |
| if (n != first_clone) | |
| n = n->next_sibling_clone; | |
| } | |
| } | |
| /* Copy the OLD_VERSION_NODE function tree to the new version. */ | |
| tree_function_versioning (node->decl, first_clone->decl, | |
| NULL, NULL, true, NULL, NULL); | |
| /* The function will be short lived and removed after we inline all the | |
| clones, but make it internal so we won't confuse ourself. */ | |
| DECL_EXTERNAL (first_clone->decl) = 0; | |
| TREE_PUBLIC (first_clone->decl) = 0; | |
| DECL_COMDAT (first_clone->decl) = 0; | |
| first_clone->ipa_transforms_to_apply.release (); | |
| /* When doing recursive inlining, the clone may become unnecessary. | |
| This is possible i.e. in the case when the recursive function is proved to | |
| be non-throwing and the recursion happens only in the EH landing pad. | |
| We cannot remove the clone until we are done with saving the body. | |
| Remove it now. */ | |
| if (!first_clone->callers) | |
| { | |
| first_clone->remove_symbol_and_inline_clones (); | |
| first_clone = NULL; | |
| } | |
| else if (flag_checking) | |
| first_clone->verify (); | |
| return first_clone; | |
| } | |
| /* Return true when function body of DECL still needs to be kept around | |
| for later re-use. */ | |
| static bool | |
| preserve_function_body_p (struct cgraph_node *node) | |
| { | |
| gcc_assert (symtab->global_info_ready); | |
| gcc_assert (!node->alias && !node->thunk); | |
| /* Look if there is any non-thunk clone around. */ | |
| for (node = node->clones; node; node = node->next_sibling_clone) | |
| if (!node->thunk) | |
| return true; | |
| return false; | |
| } | |
| /* tree-inline can not recurse; materialize all function bodie we will need | |
| during inlining. This includes inlined functions, but also called functions | |
| with param manipulation because IPA param manipulation attaches debug | |
| statements to PARM_DECLs of called clone. Materialize them if needed. | |
| FIXME: This is somewhat broken by design because it does not play well | |
| with partitioning. */ | |
| static void | |
| maybe_materialize_called_clones (cgraph_node *node) | |
| { | |
| for (cgraph_edge *e = node->callees; e; e = e->next_callee) | |
| { | |
| clone_info *info; | |
| if (!e->inline_failed) | |
| maybe_materialize_called_clones (e->callee); | |
| cgraph_node *callee = cgraph_node::get (e->callee->decl); | |
| if (callee->clone_of | |
| && (info = clone_info::get (callee)) && info->param_adjustments) | |
| callee->get_untransformed_body (); | |
| } | |
| } | |
| /* Apply inline plan to function. */ | |
| unsigned int | |
| inline_transform (struct cgraph_node *node) | |
| { | |
| unsigned int todo = 0; | |
| struct cgraph_edge *e, *next; | |
| bool has_inline = false; | |
| /* FIXME: Currently the pass manager is adding inline transform more than | |
| once to some clones. This needs revisiting after WPA cleanups. */ | |
| if (cfun->after_inlining) | |
| return 0; | |
| cgraph_node *next_clone; | |
| for (cgraph_node *n = node->clones; n; n = next_clone) | |
| { | |
| next_clone = n->next_sibling_clone; | |
| if (n->decl != node->decl) | |
| n->materialize_clone (); | |
| } | |
| node->clear_stmts_in_references (); | |
| /* We might need the body of this function so that we can expand | |
| it inline somewhere else. */ | |
| if (preserve_function_body_p (node)) | |
| save_inline_function_body (node); | |
| profile_count num = node->count; | |
| profile_count den = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count; | |
| bool scale = num.initialized_p () && !(num == den); | |
| if (scale) | |
| { | |
| profile_count::adjust_for_ipa_scaling (&num, &den); | |
| if (dump_file) | |
| { | |
| fprintf (dump_file, "Applying count scale "); | |
| num.dump (dump_file); | |
| fprintf (dump_file, "/"); | |
| den.dump (dump_file); | |
| fprintf (dump_file, "\n"); | |
| } | |
| basic_block bb; | |
| cfun->cfg->count_max = profile_count::uninitialized (); | |
| FOR_ALL_BB_FN (bb, cfun) | |
| { | |
| bb->count = bb->count.apply_scale (num, den); | |
| cfun->cfg->count_max = profile_count::max_prefer_initialized | |
| (cfun->cfg->count_max, bb->count); | |
| } | |
| ENTRY_BLOCK_PTR_FOR_FN (cfun)->count = node->count; | |
| } | |
| maybe_materialize_called_clones (node); | |
| for (e = node->callees; e; e = next) | |
| { | |
| if (!e->inline_failed) | |
| has_inline = true; | |
| next = e->next_callee; | |
| if (e->has_callback) | |
| { | |
| /* Redirect callback edges when redirecting their carrying edge. */ | |
| cgraph_edge *cbe; | |
| cgraph_edge::redirect_call_stmt_to_callee (e); | |
| for (cbe = e->first_callback_edge (); cbe; | |
| cbe = cbe->next_callback_edge ()) | |
| cgraph_edge::redirect_call_stmt_to_callee (cbe); | |
| } | |
| else | |
| cgraph_edge::redirect_call_stmt_to_callee (e); | |
| } | |
| node->remove_all_references (); | |
| timevar_push (TV_INTEGRATION); | |
| if (node->callees && (opt_for_fn (node->decl, optimize) || has_inline)) | |
| { | |
| todo = optimize_inline_calls (current_function_decl); | |
| } | |
| timevar_pop (TV_INTEGRATION); | |
| cfun->always_inline_functions_inlined = true; | |
| cfun->after_inlining = true; | |
| todo |= execute_fixup_cfg (); | |
| if (!(todo & TODO_update_ssa_any)) | |
| /* Redirecting edges might lead to a need for vops to be recomputed. */ | |
| todo |= TODO_update_ssa_only_virtuals; | |
| return todo; | |
| } |