diff options
| author | Jan Hubicka <jh@suse.cz> | 2012-08-21 08:54:01 +0200 |
|---|---|---|
| committer | Jan Hubicka <hubicka@gcc.gnu.org> | 2012-08-21 06:54:01 +0000 |
| commit | 2daffc47991e582d910b576e41891a7e91524575 (patch) | |
| tree | ea6cdcf31028e9bf0f6d2317cb87f6e7a3668c5b /gcc/ipa-inline.c | |
| parent | e162e288ecf5a5eb16bd6c0cb432afa233e1e10b (diff) | |
| download | gcc-2daffc47991e582d910b576e41891a7e91524575.zip gcc-2daffc47991e582d910b576e41891a7e91524575.tar.gz gcc-2daffc47991e582d910b576e41891a7e91524575.tar.bz2 | |
re PR fortran/48636 (Enable more inlining with -O2 and higher)
PR fortran/48636
* ipa-inline.c (want_inline_small_function_p): Take loop_iterations hint.
(edge_badness): Likewise.
* ipa-inline.h (inline_hints_vals): Add INLINE_HINT_loop_iterations.
(inline_summary): Add loop_iterations.
* ipa-inline-analysis.c: Include tree-scalar-evolution.h.
(dump_inline_hints): Dump loop_iterations.
(reset_inline_summary): Free loop_iterations.
(inline_node_duplication_hook): Update loop_iterations.
(dump_inline_summary): Dump loop_iterations.
(will_be_nonconstant_expr_predicate): New function.
(estimate_function_body_sizes): Analyze loops.
(estimate_node_size_and_time): Set hint loop_iterations.
(inline_merge_summary): Merge loop iterations.
(inline_read_section): Stream in loop_iterations.
(inline_write_summary): Stream out loop_iterations.
From-SVN: r190556
Diffstat (limited to 'gcc/ipa-inline.c')
| -rw-r--r-- | gcc/ipa-inline.c | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c index 55d9a52..a1d703a 100644 --- a/gcc/ipa-inline.c +++ b/gcc/ipa-inline.c @@ -480,7 +480,8 @@ want_inline_small_function_p (struct cgraph_edge *e, bool report) hints suggests that inlining given function is very profitable. */ else if (DECL_DECLARED_INLINE_P (callee->symbol.decl) && growth >= MAX_INLINE_INSNS_SINGLE - && !(hints & INLINE_HINT_indirect_call)) + && !(hints & (INLINE_HINT_indirect_call + | INLINE_HINT_loop_iterations))) { e->inline_failed = CIF_MAX_INLINE_INSNS_SINGLE_LIMIT; want_inline = false; @@ -863,7 +864,8 @@ edge_badness (struct cgraph_edge *edge, bool dump) if (dump) fprintf (dump_file, "Badness overflow\n"); } - if (hints & INLINE_HINT_indirect_call) + if (hints & (INLINE_HINT_indirect_call + | INLINE_HINT_loop_iterations)) badness /= 8; if (dump) { |