+2010-04-12 Richard Guenther <rguenther@suse.de>
+
+ * ipa.c (cgraph_postorder): Adjust postorder to guarantee
+ single-iteration always-inline inlining.
+ * ipa-inline.c (cgraph_mark_inline): Do not return anything.
+ (cgraph_decide_inlining): Do not handle always-inline
+ specially.
+ (try_inline): Remove always-inline cycle detection special case.
+ Do not recurse on always-inlines.
+ (cgraph_early_inlining): Do not iterate if not optimizing.
+ (cgraph_gate_early_inlining): remove.
+ (pass_early_inline): Run unconditionally.
+ (gate_cgraph_decide_inlining): New function.
+ (pass_ipa_inline): Use it. Do not run the IPA inliner if
+ not inlining or optimizing.
+ (cgraph_decide_inlining_of_small_functions): Also consider
+ always-inline functions.
+ (cgraph_default_inline_p): Return true for nodes which should
+ disregard inline limits.
+ (estimate_function_body_sizes): Assume zero size and time for
+ nodes which are marked as disregarding inline limits.
+ (cgraph_decide_recursive_inlining): Do not perform recursive
+ inlining on always-inline nodes.
+
2010-04-12 Jakub Jelinek <jakub@redhat.com>
PR bootstrap/43699
}
else
{
- if (lookup_attribute ("flatten",
- DECL_ATTRIBUTES (node->decl)) != NULL)
- {
- if (dump_file)
- fprintf (dump_file,
- "Flattening %s\n", cgraph_node_name (node));
- cgraph_flatten (node);
- timevar_push (TV_INTEGRATION);
- todo |= optimize_inline_calls (current_function_decl);
- timevar_pop (TV_INTEGRATION);
- }
/* We iterate incremental inlining to get trivial cases of indirect
inlining. */
while (iterations < PARAM_VALUE (PARAM_EARLY_INLINER_MAX_ITERATIONS)
int freq;
tree funtype = TREE_TYPE (node->decl);
+ if (node->local.disregard_inline_limits)
+ {
+ inline_summary (node)->self_time = 0;
+ inline_summary (node)->self_size = 0;
+ inline_summary (node)->time_inlining_benefit = 0;
+ inline_summary (node)->size_inlining_benefit = 0;
+ }
+
if (dump_file)
fprintf (dump_file, "Analyzing function body size: %s\n",
cgraph_node_name (node));