]>
Commit | Line | Data |
---|---|---|
65c1a668 | 1 | /* Inlining decision heuristics. |
fbd26352 | 2 | Copyright (C) 2003-2019 Free Software Foundation, Inc. |
65c1a668 | 3 | Contributed by Jan Hubicka |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
8c4c00c1 | 9 | Software Foundation; either version 3, or (at your option) any later |
65c1a668 | 10 | version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
65c1a668 | 20 | |
21 | /* Inlining decision heuristics | |
22 | ||
4869c23f | 23 | The implementation of inliner is organized as follows: |
65c1a668 | 24 | |
65c1a668 | 25 | inlining heuristics limits |
26 | ||
4869c23f | 27 | can_inline_edge_p allow to check that particular inlining is allowed |
28 | by the limits specified by user (allowed function growth, growth and so | |
29 | on). | |
30 | ||
31 | Functions are inlined when it is obvious the result is profitable (such | |
32 | as functions called once or when inlining reduce code size). | |
33 | In addition to that we perform inlining of small functions and recursive | |
34 | inlining. | |
65c1a668 | 35 | |
36 | inlining heuristics | |
37 | ||
4869c23f | 38 | The inliner itself is split into two passes: |
39 | ||
40 | pass_early_inlining | |
65c1a668 | 41 | |
4869c23f | 42 | Simple local inlining pass inlining callees into current function. |
43 | This pass makes no use of whole unit analysis and thus it can do only | |
44 | very simple decisions based on local properties. | |
65c1a668 | 45 | |
4869c23f | 46 | The strength of the pass is that it is run in topological order |
47 | (reverse postorder) on the callgraph. Functions are converted into SSA | |
48 | form just before this pass and optimized subsequently. As a result, the | |
49 | callees of the function seen by the early inliner was already optimized | |
4055a556 | 50 | and results of early inlining adds a lot of optimization opportunities |
4869c23f | 51 | for the local optimization. |
65c1a668 | 52 | |
4055a556 | 53 | The pass handle the obvious inlining decisions within the compilation |
4869c23f | 54 | unit - inlining auto inline functions, inlining for size and |
55 | flattening. | |
65c1a668 | 56 | |
4869c23f | 57 | main strength of the pass is the ability to eliminate abstraction |
58 | penalty in C++ code (via combination of inlining and early | |
59 | optimization) and thus improve quality of analysis done by real IPA | |
60 | optimizers. | |
09a2e412 | 61 | |
f4d3c071 | 62 | Because of lack of whole unit knowledge, the pass cannot really make |
4869c23f | 63 | good code size/performance tradeoffs. It however does very simple |
64 | speculative inlining allowing code size to grow by | |
4055a556 | 65 | EARLY_INLINING_INSNS when callee is leaf function. In this case the |
66 | optimizations performed later are very likely to eliminate the cost. | |
09a2e412 | 67 | |
4869c23f | 68 | pass_ipa_inline |
09a2e412 | 69 | |
4869c23f | 70 | This is the real inliner able to handle inlining with whole program |
71 | knowledge. It performs following steps: | |
09a2e412 | 72 | |
4869c23f | 73 | 1) inlining of small functions. This is implemented by greedy |
74 | algorithm ordering all inlinable cgraph edges by their badness and | |
75 | inlining them in this order as long as inline limits allows doing so. | |
09a2e412 | 76 | |
4869c23f | 77 | This heuristics is not very good on inlining recursive calls. Recursive |
78 | calls can be inlined with results similar to loop unrolling. To do so, | |
79 | special purpose recursive inliner is executed on function when | |
80 | recursive edge is met as viable candidate. | |
09a2e412 | 81 | |
4869c23f | 82 | 2) Unreachable functions are removed from callgraph. Inlining leads |
83 | to devirtualization and other modification of callgraph so functions | |
84 | may become unreachable during the process. Also functions declared as | |
85 | extern inline or virtual functions are removed, since after inlining | |
86 | we no longer need the offline bodies. | |
87 | ||
88 | 3) Functions called once and not exported from the unit are inlined. | |
89 | This should almost always lead to reduction of code size by eliminating | |
90 | the need for offline copy of the function. */ | |
65c1a668 | 91 | |
92 | #include "config.h" | |
93 | #include "system.h" | |
94 | #include "coretypes.h" | |
9ef16211 | 95 | #include "backend.h" |
7c29e30e | 96 | #include "target.h" |
97 | #include "rtl.h" | |
65c1a668 | 98 | #include "tree.h" |
9ef16211 | 99 | #include "gimple.h" |
7c29e30e | 100 | #include "alloc-pool.h" |
101 | #include "tree-pass.h" | |
102 | #include "gimple-ssa.h" | |
103 | #include "cgraph.h" | |
7c29e30e | 104 | #include "lto-streamer.h" |
9ed99284 | 105 | #include "trans-mem.h" |
106 | #include "calls.h" | |
65c1a668 | 107 | #include "tree-inline.h" |
65c1a668 | 108 | #include "params.h" |
886c1262 | 109 | #include "profile.h" |
2cc80ac3 | 110 | #include "symbol-summary.h" |
25a8e007 | 111 | #include "tree-vrp.h" |
f8daee9b | 112 | #include "ipa-prop.h" |
b9a58fc5 | 113 | #include "ipa-fnsummary.h" |
99c67f24 | 114 | #include "ipa-inline.h" |
7771d558 | 115 | #include "ipa-utils.h" |
f4905b9a | 116 | #include "sreal.h" |
94bed7c3 | 117 | #include "auto-profile.h" |
f7715905 | 118 | #include "builtins.h" |
0aadd187 | 119 | #include "fibonacci_heap.h" |
30a86690 | 120 | #include "stringpool.h" |
121 | #include "attribs.h" | |
9917317a | 122 | #include "asan.h" |
0aadd187 | 123 | |
c1ffea07 | 124 | typedef fibonacci_heap <sreal, cgraph_edge> edge_heap_t; |
125 | typedef fibonacci_node <sreal, cgraph_edge> edge_heap_node_t; | |
97343302 | 126 | |
65c1a668 | 127 | /* Statistics we collect about inlining algorithm. */ |
97343302 | 128 | static int overall_size; |
db9cef39 | 129 | static profile_count max_count; |
130 | static profile_count spec_rem; | |
65c1a668 | 131 | |
4869c23f | 132 | /* Return false when inlining edge E would lead to violating |
133 | limits on function unit growth or stack usage growth. | |
134 | ||
135 | The relative function body growth limit is present generally | |
4055a556 | 136 | to avoid problems with non-linear behavior of the compiler. |
4869c23f | 137 | To allow inlining huge functions into tiny wrapper, the limit |
138 | is always based on the bigger of the two functions considered. | |
139 | ||
140 | For stack growth limits we always base the growth in stack usage | |
141 | of the callers. We want to prevent applications from segfaulting | |
142 | on stack overflow when functions with huge stack frames gets | |
143 | inlined. */ | |
65c1a668 | 144 | |
145 | static bool | |
4869c23f | 146 | caller_growth_limits (struct cgraph_edge *e) |
65c1a668 | 147 | { |
17c205c9 | 148 | struct cgraph_node *to = e->caller; |
415d1b9a | 149 | struct cgraph_node *what = e->callee->ultimate_alias_target (); |
65c1a668 | 150 | int newsize; |
4869c23f | 151 | int limit = 0; |
152 | HOST_WIDE_INT stack_size_limit = 0, inlined_stack; | |
b53d4f56 | 153 | ipa_fn_summary *info, *what_info; |
d2c2513e | 154 | ipa_fn_summary *outer_info = ipa_fn_summaries->get (to); |
4869c23f | 155 | |
156 | /* Look for function e->caller is inlined to. While doing | |
157 | so work out the largest function body on the way. As | |
158 | described above, we want to base our function growth | |
159 | limits based on that. Not on the self size of the | |
160 | outer function, not on the self size of inline code | |
161 | we immediately inline to. This is the most relaxed | |
162 | interpretation of the rule "do not grow large functions | |
163 | too much in order to prevent compiler from exploding". */ | |
0a0ca4d6 | 164 | while (true) |
4869c23f | 165 | { |
d2c2513e | 166 | info = ipa_fn_summaries->get (to); |
4869c23f | 167 | if (limit < info->self_size) |
168 | limit = info->self_size; | |
169 | if (stack_size_limit < info->estimated_self_stack_size) | |
170 | stack_size_limit = info->estimated_self_stack_size; | |
171 | if (to->global.inlined_to) | |
172 | to = to->callers->caller; | |
0a0ca4d6 | 173 | else |
174 | break; | |
4869c23f | 175 | } |
4b4d4c92 | 176 | |
d2c2513e | 177 | what_info = ipa_fn_summaries->get (what); |
cbd7f5a0 | 178 | |
4869c23f | 179 | if (limit < what_info->self_size) |
cbd7f5a0 | 180 | limit = what_info->self_size; |
65c1a668 | 181 | |
182 | limit += limit * PARAM_VALUE (PARAM_LARGE_FUNCTION_GROWTH) / 100; | |
183 | ||
4b4d4c92 | 184 | /* Check the size after inlining against the function limits. But allow |
185 | the function to shrink if it went over the limits by forced inlining. */ | |
99c67f24 | 186 | newsize = estimate_size_after_inlining (to, e); |
cbd7f5a0 | 187 | if (newsize >= info->size |
4b4d4c92 | 188 | && newsize > PARAM_VALUE (PARAM_LARGE_FUNCTION_INSNS) |
65c1a668 | 189 | && newsize > limit) |
190 | { | |
4869c23f | 191 | e->inline_failed = CIF_LARGE_FUNCTION_GROWTH_LIMIT; |
65c1a668 | 192 | return false; |
193 | } | |
5a02d67b | 194 | |
0a0ca4d6 | 195 | if (!what_info->estimated_stack_size) |
196 | return true; | |
197 | ||
4055a556 | 198 | /* FIXME: Stack size limit often prevents inlining in Fortran programs |
199 | due to large i/o datastructures used by the Fortran front-end. | |
4869c23f | 200 | We ought to ignore this limit when we know that the edge is executed |
201 | on every invocation of the caller (i.e. its call statement dominates | |
202 | exit block). We do not track this information, yet. */ | |
0a0ca4d6 | 203 | stack_size_limit += ((gcov_type)stack_size_limit |
4869c23f | 204 | * PARAM_VALUE (PARAM_STACK_FRAME_GROWTH) / 100); |
5a02d67b | 205 | |
4869c23f | 206 | inlined_stack = (outer_info->stack_frame_offset |
207 | + outer_info->estimated_self_stack_size | |
cbd7f5a0 | 208 | + what_info->estimated_stack_size); |
4869c23f | 209 | /* Check new stack consumption with stack consumption at the place |
210 | stack is used. */ | |
211 | if (inlined_stack > stack_size_limit | |
4055a556 | 212 | /* If function already has large stack usage from sibling |
4869c23f | 213 | inline call, we can inline, too. |
214 | This bit overoptimistically assume that we are good at stack | |
215 | packing. */ | |
216 | && inlined_stack > info->estimated_stack_size | |
5a02d67b | 217 | && inlined_stack > PARAM_VALUE (PARAM_LARGE_STACK_FRAME)) |
218 | { | |
4869c23f | 219 | e->inline_failed = CIF_LARGE_STACK_FRAME_GROWTH_LIMIT; |
5a02d67b | 220 | return false; |
221 | } | |
65c1a668 | 222 | return true; |
223 | } | |
224 | ||
4869c23f | 225 | /* Dump info about why inlining has failed. */ |
226 | ||
227 | static void | |
228 | report_inline_failed_reason (struct cgraph_edge *e) | |
229 | { | |
7261dbb3 | 230 | if (dump_enabled_p ()) |
4869c23f | 231 | { |
7261dbb3 | 232 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, e->call_stmt, |
233 | " not inlinable: %C -> %C, %s\n", | |
234 | e->caller, e->callee, | |
235 | cgraph_inline_failed_string (e->inline_failed)); | |
a6d60179 | 236 | if ((e->inline_failed == CIF_TARGET_OPTION_MISMATCH |
237 | || e->inline_failed == CIF_OPTIMIZATION_MISMATCH) | |
238 | && e->caller->lto_file_data | |
87235431 | 239 | && e->callee->ultimate_alias_target ()->lto_file_data) |
a6d60179 | 240 | { |
7261dbb3 | 241 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, e->call_stmt, |
242 | " LTO objects: %s, %s\n", | |
243 | e->caller->lto_file_data->file_name, | |
244 | e->callee->ultimate_alias_target ()->lto_file_data->file_name); | |
a6d60179 | 245 | } |
246 | if (e->inline_failed == CIF_TARGET_OPTION_MISMATCH) | |
d9e39f6c | 247 | if (dump_file) |
248 | cl_target_option_print_diff | |
249 | (dump_file, 2, target_opts_for_fn (e->caller->decl), | |
250 | target_opts_for_fn (e->callee->ultimate_alias_target ()->decl)); | |
a6d60179 | 251 | if (e->inline_failed == CIF_OPTIMIZATION_MISMATCH) |
d9e39f6c | 252 | if (dump_file) |
253 | cl_optimization_print_diff | |
254 | (dump_file, 2, opts_for_fn (e->caller->decl), | |
255 | opts_for_fn (e->callee->ultimate_alias_target ()->decl)); | |
4869c23f | 256 | } |
257 | } | |
258 | ||
3f52b85a | 259 | /* Decide whether sanitizer-related attributes allow inlining. */ |
260 | ||
261 | static bool | |
262 | sanitize_attrs_match_for_inline_p (const_tree caller, const_tree callee) | |
263 | { | |
3f52b85a | 264 | if (!caller || !callee) |
265 | return true; | |
266 | ||
06438ec9 | 267 | /* Allow inlining always_inline functions into no_sanitize_address |
268 | functions. */ | |
269 | if (!sanitize_flags_p (SANITIZE_ADDRESS, caller) | |
270 | && lookup_attribute ("always_inline", DECL_ATTRIBUTES (callee))) | |
271 | return true; | |
272 | ||
eabe2d94 | 273 | return ((sanitize_flags_p (SANITIZE_ADDRESS, caller) |
274 | == sanitize_flags_p (SANITIZE_ADDRESS, callee)) | |
275 | && (sanitize_flags_p (SANITIZE_POINTER_COMPARE, caller) | |
276 | == sanitize_flags_p (SANITIZE_POINTER_COMPARE, callee)) | |
277 | && (sanitize_flags_p (SANITIZE_POINTER_SUBTRACT, caller) | |
278 | == sanitize_flags_p (SANITIZE_POINTER_SUBTRACT, callee))); | |
3f52b85a | 279 | } |
280 | ||
c0abb913 | 281 | /* Used for flags where it is safe to inline when caller's value is |
282 | grater than callee's. */ | |
283 | #define check_maybe_up(flag) \ | |
284 | (opts_for_fn (caller->decl)->x_##flag \ | |
285 | != opts_for_fn (callee->decl)->x_##flag \ | |
286 | && (!always_inline \ | |
287 | || opts_for_fn (caller->decl)->x_##flag \ | |
288 | < opts_for_fn (callee->decl)->x_##flag)) | |
289 | /* Used for flags where it is safe to inline when caller's value is | |
290 | smaller than callee's. */ | |
291 | #define check_maybe_down(flag) \ | |
292 | (opts_for_fn (caller->decl)->x_##flag \ | |
293 | != opts_for_fn (callee->decl)->x_##flag \ | |
294 | && (!always_inline \ | |
295 | || opts_for_fn (caller->decl)->x_##flag \ | |
296 | > opts_for_fn (callee->decl)->x_##flag)) | |
297 | /* Used for flags where exact match is needed for correctness. */ | |
298 | #define check_match(flag) \ | |
299 | (opts_for_fn (caller->decl)->x_##flag \ | |
300 | != opts_for_fn (callee->decl)->x_##flag) | |
301 | ||
1fa377f3 | 302 | /* Decide if we can inline the edge and possibly update |
4869c23f | 303 | inline_failed reason. |
304 | We check whether inlining is possible at all and whether | |
305 | caller growth limits allow doing so. | |
306 | ||
1fa377f3 | 307 | if REPORT is true, output reason to the dump file. */ |
65c1a668 | 308 | |
326a9581 | 309 | static bool |
12d5ae9f | 310 | can_inline_edge_p (struct cgraph_edge *e, bool report, |
1fa377f3 | 311 | bool early = false) |
65c1a668 | 312 | { |
0f3771a4 | 313 | gcc_checking_assert (e->inline_failed); |
314 | ||
315 | if (cgraph_inline_failed_type (e->inline_failed) == CIF_FINAL_ERROR) | |
316 | { | |
317 | if (report) | |
318 | report_inline_failed_reason (e); | |
319 | return false; | |
320 | } | |
321 | ||
4869c23f | 322 | bool inlinable = true; |
82626cb0 | 323 | enum availability avail; |
a6d60179 | 324 | cgraph_node *caller = e->caller->global.inlined_to |
325 | ? e->caller->global.inlined_to : e->caller; | |
fbcea800 | 326 | cgraph_node *callee = e->callee->ultimate_alias_target (&avail, caller); |
469679ab | 327 | |
0f3771a4 | 328 | if (!callee->definition) |
4869c23f | 329 | { |
330 | e->inline_failed = CIF_BODY_NOT_AVAILABLE; | |
331 | inlinable = false; | |
332 | } | |
9abc6a05 | 333 | if (!early && (!opt_for_fn (callee->decl, optimize) |
e0fbd2cc | 334 | || !opt_for_fn (caller->decl, optimize))) |
5f4e4f36 | 335 | { |
336 | e->inline_failed = CIF_FUNCTION_NOT_OPTIMIZED; | |
337 | inlinable = false; | |
338 | } | |
468088ac | 339 | else if (callee->calls_comdat_local) |
340 | { | |
341 | e->inline_failed = CIF_USES_COMDAT_LOCAL; | |
342 | inlinable = false; | |
343 | } | |
415d1b9a | 344 | else if (avail <= AVAIL_INTERPOSABLE) |
b30512dd | 345 | { |
4869c23f | 346 | e->inline_failed = CIF_OVERWRITABLE; |
479b4ace | 347 | inlinable = false; |
b30512dd | 348 | } |
0754a747 | 349 | /* All edges with call_stmt_cannot_inline_p should have inline_failed |
350 | initialized to one of FINAL_ERROR reasons. */ | |
f883da84 | 351 | else if (e->call_stmt_cannot_inline_p) |
0754a747 | 352 | gcc_unreachable (); |
4869c23f | 353 | /* Don't inline if the functions have different EH personalities. */ |
a6d60179 | 354 | else if (DECL_FUNCTION_PERSONALITY (caller->decl) |
02774f2d | 355 | && DECL_FUNCTION_PERSONALITY (callee->decl) |
a6d60179 | 356 | && (DECL_FUNCTION_PERSONALITY (caller->decl) |
02774f2d | 357 | != DECL_FUNCTION_PERSONALITY (callee->decl))) |
4869c23f | 358 | { |
359 | e->inline_failed = CIF_EH_PERSONALITY; | |
360 | inlinable = false; | |
361 | } | |
3bd76a99 | 362 | /* TM pure functions should not be inlined into non-TM_pure |
363 | functions. */ | |
0f3771a4 | 364 | else if (is_tm_pure (callee->decl) && !is_tm_pure (caller->decl)) |
4c0315d0 | 365 | { |
366 | e->inline_failed = CIF_UNSPECIFIED; | |
367 | inlinable = false; | |
368 | } | |
4055a556 | 369 | /* Check compatibility of target optimization options. */ |
a6d60179 | 370 | else if (!targetm.target_option.can_inline_p (caller->decl, |
02774f2d | 371 | callee->decl)) |
4869c23f | 372 | { |
373 | e->inline_failed = CIF_TARGET_OPTION_MISMATCH; | |
374 | inlinable = false; | |
375 | } | |
d2c2513e | 376 | else if (ipa_fn_summaries->get (callee) == NULL |
377 | || !ipa_fn_summaries->get (callee)->inlinable) | |
e806c56f | 378 | { |
379 | e->inline_failed = CIF_FUNCTION_NOT_INLINABLE; | |
380 | inlinable = false; | |
381 | } | |
3f52b85a | 382 | /* Don't inline a function with mismatched sanitization attributes. */ |
a6d60179 | 383 | else if (!sanitize_attrs_match_for_inline_p (caller->decl, callee->decl)) |
3f52b85a | 384 | { |
385 | e->inline_failed = CIF_ATTRIBUTE_MISMATCH; | |
386 | inlinable = false; | |
387 | } | |
1fa377f3 | 388 | if (!inlinable && report) |
389 | report_inline_failed_reason (e); | |
390 | return inlinable; | |
391 | } | |
392 | ||
393 | /* Decide if we can inline the edge and possibly update | |
394 | inline_failed reason. | |
395 | We check whether inlining is possible at all and whether | |
396 | caller growth limits allow doing so. | |
397 | ||
398 | if REPORT is true, output reason to the dump file. | |
399 | ||
400 | if DISREGARD_LIMITS is true, ignore size limits. */ | |
401 | ||
402 | static bool | |
403 | can_inline_edge_by_limits_p (struct cgraph_edge *e, bool report, | |
404 | bool disregard_limits = false, bool early = false) | |
405 | { | |
406 | gcc_checking_assert (e->inline_failed); | |
407 | ||
408 | if (cgraph_inline_failed_type (e->inline_failed) == CIF_FINAL_ERROR) | |
409 | { | |
410 | if (report) | |
411 | report_inline_failed_reason (e); | |
412 | return false; | |
413 | } | |
414 | ||
415 | bool inlinable = true; | |
416 | enum availability avail; | |
417 | cgraph_node *caller = e->caller->global.inlined_to | |
418 | ? e->caller->global.inlined_to : e->caller; | |
419 | cgraph_node *callee = e->callee->ultimate_alias_target (&avail, caller); | |
420 | tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller->decl); | |
421 | tree callee_tree | |
422 | = callee ? DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee->decl) : NULL; | |
4869c23f | 423 | /* Check if caller growth allows the inlining. */ |
1fa377f3 | 424 | if (!DECL_DISREGARD_INLINE_LIMITS (callee->decl) |
425 | && !disregard_limits | |
426 | && !lookup_attribute ("flatten", | |
427 | DECL_ATTRIBUTES (caller->decl)) | |
428 | && !caller_growth_limits (e)) | |
4869c23f | 429 | inlinable = false; |
9939b2f7 | 430 | else if (callee->externally_visible |
431 | && !DECL_DISREGARD_INLINE_LIMITS (callee->decl) | |
432 | && flag_live_patching == LIVE_PATCHING_INLINE_ONLY_STATIC) | |
433 | { | |
434 | e->inline_failed = CIF_EXTERN_LIVE_ONLY_STATIC; | |
435 | inlinable = false; | |
436 | } | |
4869c23f | 437 | /* Don't inline a function with a higher optimization level than the |
438 | caller. FIXME: this is really just tip of iceberg of handling | |
439 | optimization attribute. */ | |
440 | else if (caller_tree != callee_tree) | |
b30512dd | 441 | { |
c0abb913 | 442 | bool always_inline = |
443 | (DECL_DISREGARD_INLINE_LIMITS (callee->decl) | |
444 | && lookup_attribute ("always_inline", | |
445 | DECL_ATTRIBUTES (callee->decl))); | |
d2c2513e | 446 | ipa_fn_summary *caller_info = ipa_fn_summaries->get (caller); |
447 | ipa_fn_summary *callee_info = ipa_fn_summaries->get (callee); | |
c0abb913 | 448 | |
91b7fbe4 | 449 | /* Until GCC 4.9 we did not check the semantics-altering flags |
450 | below and inlined across optimization boundaries. | |
451 | Enabling checks below breaks several packages by refusing | |
be8cbfec | 452 | to inline library always_inline functions. See PR65873. |
453 | Disable the check for early inlining for now until better solution | |
454 | is found. */ | |
455 | if (always_inline && early) | |
456 | ; | |
30bd9534 | 457 | /* There are some options that change IL semantics which means |
458 | we cannot inline in these cases for correctness reason. | |
459 | Not even for always_inline declared functions. */ | |
56580d6b | 460 | else if (check_match (flag_wrapv) |
be8cbfec | 461 | || check_match (flag_trapv) |
5f4e4f36 | 462 | || check_match (flag_pcc_struct_return) |
46e5dccc | 463 | /* When caller or callee does FP math, be sure FP codegen flags |
464 | compatible. */ | |
465 | || ((caller_info->fp_expressions && callee_info->fp_expressions) | |
466 | && (check_maybe_up (flag_rounding_math) | |
467 | || check_maybe_up (flag_trapping_math) | |
468 | || check_maybe_down (flag_unsafe_math_optimizations) | |
469 | || check_maybe_down (flag_finite_math_only) | |
470 | || check_maybe_up (flag_signaling_nans) | |
471 | || check_maybe_down (flag_cx_limited_range) | |
472 | || check_maybe_up (flag_signed_zeros) | |
473 | || check_maybe_down (flag_associative_math) | |
474 | || check_maybe_down (flag_reciprocal_math) | |
20702ea3 | 475 | || check_maybe_down (flag_fp_int_builtin_inexact) |
46e5dccc | 476 | /* Strictly speaking only when the callee contains function |
477 | calls that may end up setting errno. */ | |
478 | || check_maybe_up (flag_errno_math))) | |
be8cbfec | 479 | /* We do not want to make code compiled with exceptions to be |
480 | brought into a non-EH function unless we know that the callee | |
481 | does not throw. | |
482 | This is tracked by DECL_FUNCTION_PERSONALITY. */ | |
e545c400 | 483 | || (check_maybe_up (flag_non_call_exceptions) |
484 | && DECL_FUNCTION_PERSONALITY (callee->decl)) | |
be8cbfec | 485 | || (check_maybe_up (flag_exceptions) |
486 | && DECL_FUNCTION_PERSONALITY (callee->decl)) | |
be8cbfec | 487 | /* When devirtualization is diabled for callee, it is not safe |
488 | to inline it as we possibly mangled the type info. | |
489 | Allow early inlining of always inlines. */ | |
490 | || (!early && check_maybe_down (flag_devirtualize))) | |
30bd9534 | 491 | { |
492 | e->inline_failed = CIF_OPTIMIZATION_MISMATCH; | |
493 | inlinable = false; | |
494 | } | |
495 | /* gcc.dg/pr43564.c. Apply user-forced inline even at -O0. */ | |
c0abb913 | 496 | else if (always_inline) |
a6d60179 | 497 | ; |
30bd9534 | 498 | /* When user added an attribute to the callee honor it. */ |
499 | else if (lookup_attribute ("optimize", DECL_ATTRIBUTES (callee->decl)) | |
500 | && opts_for_fn (caller->decl) != opts_for_fn (callee->decl)) | |
4869c23f | 501 | { |
b588156f | 502 | e->inline_failed = CIF_OPTIMIZATION_MISMATCH; |
4869c23f | 503 | inlinable = false; |
504 | } | |
be8cbfec | 505 | /* If explicit optimize attribute are not used, the mismatch is caused |
506 | by different command line options used to build different units. | |
507 | Do not care about COMDAT functions - those are intended to be | |
508 | optimized with the optimization flags of module they are used in. | |
509 | Also do not care about mixing up size/speed optimization when | |
510 | DECL_DISREGARD_INLINE_LIMITS is set. */ | |
7d38b7bc | 511 | else if ((callee->merged_comdat |
be8cbfec | 512 | && !lookup_attribute ("optimize", |
513 | DECL_ATTRIBUTES (caller->decl))) | |
514 | || DECL_DISREGARD_INLINE_LIMITS (callee->decl)) | |
515 | ; | |
a6d60179 | 516 | /* If mismatch is caused by merging two LTO units with different |
517 | optimizationflags we want to be bit nicer. However never inline | |
518 | if one of functions is not optimized at all. */ | |
519 | else if (!opt_for_fn (callee->decl, optimize) | |
520 | || !opt_for_fn (caller->decl, optimize)) | |
521 | { | |
522 | e->inline_failed = CIF_OPTIMIZATION_MISMATCH; | |
523 | inlinable = false; | |
524 | } | |
525 | /* If callee is optimized for size and caller is not, allow inlining if | |
526 | code shrinks or we are in MAX_INLINE_INSNS_SINGLE limit and callee | |
527 | is inline (and thus likely an unified comdat). This will allow caller | |
528 | to run faster. */ | |
529 | else if (opt_for_fn (callee->decl, optimize_size) | |
530 | > opt_for_fn (caller->decl, optimize_size)) | |
531 | { | |
532 | int growth = estimate_edge_growth (e); | |
07309989 | 533 | if (growth > PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SIZE) |
a6d60179 | 534 | && (!DECL_DECLARED_INLINE_P (callee->decl) |
535 | && growth >= MAX (MAX_INLINE_INSNS_SINGLE, | |
536 | MAX_INLINE_INSNS_AUTO))) | |
537 | { | |
538 | e->inline_failed = CIF_OPTIMIZATION_MISMATCH; | |
539 | inlinable = false; | |
540 | } | |
541 | } | |
542 | /* If callee is more aggressively optimized for performance than caller, | |
543 | we generally want to inline only cheap (runtime wise) functions. */ | |
544 | else if (opt_for_fn (callee->decl, optimize_size) | |
545 | < opt_for_fn (caller->decl, optimize_size) | |
546 | || (opt_for_fn (callee->decl, optimize) | |
b1369c42 | 547 | > opt_for_fn (caller->decl, optimize))) |
a6d60179 | 548 | { |
549 | if (estimate_edge_time (e) | |
d2c2513e | 550 | >= 20 + ipa_call_summaries->get (e)->call_stmt_time) |
a6d60179 | 551 | { |
552 | e->inline_failed = CIF_OPTIMIZATION_MISMATCH; | |
553 | inlinable = false; | |
554 | } | |
555 | } | |
556 | ||
4869c23f | 557 | } |
558 | ||
4869c23f | 559 | if (!inlinable && report) |
560 | report_inline_failed_reason (e); | |
561 | return inlinable; | |
562 | } | |
563 | ||
564 | ||
565 | /* Return true if the edge E is inlinable during early inlining. */ | |
566 | ||
567 | static bool | |
568 | can_early_inline_edge_p (struct cgraph_edge *e) | |
569 | { | |
415d1b9a | 570 | struct cgraph_node *callee = e->callee->ultimate_alias_target (); |
4869c23f | 571 | /* Early inliner might get called at WPA stage when IPA pass adds new |
f4d3c071 | 572 | function. In this case we cannot really do any of early inlining |
4869c23f | 573 | because function bodies are missing. */ |
0754a747 | 574 | if (cgraph_inline_failed_type (e->inline_failed) == CIF_FINAL_ERROR) |
575 | return false; | |
02774f2d | 576 | if (!gimple_has_body_p (callee->decl)) |
4869c23f | 577 | { |
578 | e->inline_failed = CIF_BODY_NOT_AVAILABLE; | |
b30512dd | 579 | return false; |
580 | } | |
4869c23f | 581 | /* In early inliner some of callees may not be in SSA form yet |
582 | (i.e. the callgraph is cyclic and we did not process | |
583 | the callee by early inliner, yet). We don't have CIF code for this | |
584 | case; later we will re-do the decision in the real inliner. */ | |
02774f2d | 585 | if (!gimple_in_ssa_p (DECL_STRUCT_FUNCTION (e->caller->decl)) |
586 | || !gimple_in_ssa_p (DECL_STRUCT_FUNCTION (callee->decl))) | |
af9e0580 | 587 | { |
7261dbb3 | 588 | if (dump_enabled_p ()) |
589 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, e->call_stmt, | |
590 | " edge not inlinable: not in SSA form\n"); | |
af9e0580 | 591 | return false; |
592 | } | |
1fa377f3 | 593 | if (!can_inline_edge_p (e, true, true) |
594 | || !can_inline_edge_by_limits_p (e, true, false, true)) | |
4869c23f | 595 | return false; |
596 | return true; | |
597 | } | |
598 | ||
599 | ||
bc062454 | 600 | /* Return number of calls in N. Ignore cheap builtins. */ |
4869c23f | 601 | |
bc062454 | 602 | static int |
603 | num_calls (struct cgraph_node *n) | |
4869c23f | 604 | { |
605 | struct cgraph_edge *e; | |
bc062454 | 606 | int num = 0; |
607 | ||
4869c23f | 608 | for (e = n->callees; e; e = e->next_callee) |
02774f2d | 609 | if (!is_inexpensive_builtin (e->callee->decl)) |
bc062454 | 610 | num++; |
611 | return num; | |
4869c23f | 612 | } |
613 | ||
af9e0580 | 614 | |
4869c23f | 615 | /* Return true if we are interested in inlining small function. */ |
b30512dd | 616 | |
4869c23f | 617 | static bool |
618 | want_early_inline_function_p (struct cgraph_edge *e) | |
619 | { | |
620 | bool want_inline = true; | |
415d1b9a | 621 | struct cgraph_node *callee = e->callee->ultimate_alias_target (); |
4869c23f | 622 | |
02774f2d | 623 | if (DECL_DISREGARD_INLINE_LIMITS (callee->decl)) |
4869c23f | 624 | ; |
b4bae7a0 | 625 | /* For AutoFDO, we need to make sure that before profile summary, all |
94bed7c3 | 626 | hot paths' IR look exactly the same as profiled binary. As a result, |
627 | in einliner, we will disregard size limit and inline those callsites | |
628 | that are: | |
629 | * inlined in the profiled binary, and | |
630 | * the cloned callee has enough samples to be considered "hot". */ | |
631 | else if (flag_auto_profile && afdo_callsite_hot_enough_for_early_inline (e)) | |
632 | ; | |
02774f2d | 633 | else if (!DECL_DECLARED_INLINE_P (callee->decl) |
d1f68cd8 | 634 | && !opt_for_fn (e->caller->decl, flag_inline_small_functions)) |
4869c23f | 635 | { |
636 | e->inline_failed = CIF_FUNCTION_NOT_INLINE_CANDIDATE; | |
637 | report_inline_failed_reason (e); | |
638 | want_inline = false; | |
639 | } | |
640 | else | |
b30512dd | 641 | { |
4869c23f | 642 | int growth = estimate_edge_growth (e); |
bc062454 | 643 | int n; |
644 | ||
07309989 | 645 | if (growth <= PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SIZE)) |
4869c23f | 646 | ; |
2b7caeda | 647 | else if (!e->maybe_hot_p ()) |
4869c23f | 648 | { |
7261dbb3 | 649 | if (dump_enabled_p ()) |
650 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, e->call_stmt, | |
651 | " will not early inline: %C->%C, " | |
652 | "call is cold and code would grow by %i\n", | |
653 | e->caller, callee, | |
654 | growth); | |
4869c23f | 655 | want_inline = false; |
656 | } | |
bc062454 | 657 | else if (growth > PARAM_VALUE (PARAM_EARLY_INLINING_INSNS)) |
b30512dd | 658 | { |
7261dbb3 | 659 | if (dump_enabled_p ()) |
660 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, e->call_stmt, | |
661 | " will not early inline: %C->%C, " | |
662 | "growth %i exceeds --param early-inlining-insns\n", | |
663 | e->caller, callee, | |
664 | growth); | |
4869c23f | 665 | want_inline = false; |
b30512dd | 666 | } |
bc062454 | 667 | else if ((n = num_calls (callee)) != 0 |
668 | && growth * (n + 1) > PARAM_VALUE (PARAM_EARLY_INLINING_INSNS)) | |
4869c23f | 669 | { |
7261dbb3 | 670 | if (dump_enabled_p ()) |
671 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, e->call_stmt, | |
672 | " will not early inline: %C->%C, " | |
673 | "growth %i exceeds --param early-inlining-insns " | |
674 | "divided by number of calls\n", | |
675 | e->caller, callee, | |
676 | growth); | |
4869c23f | 677 | want_inline = false; |
678 | } | |
679 | } | |
680 | return want_inline; | |
681 | } | |
682 | ||
3172b7bf | 683 | /* Compute time of the edge->caller + edge->callee execution when inlining |
684 | does not happen. */ | |
685 | ||
d326c10c | 686 | inline sreal |
e062e35c | 687 | compute_uninlined_call_time (struct cgraph_edge *edge, |
688 | sreal uninlined_call_time) | |
3172b7bf | 689 | { |
1d77f63b | 690 | cgraph_node *caller = (edge->caller->global.inlined_to |
691 | ? edge->caller->global.inlined_to | |
692 | : edge->caller); | |
693 | ||
7c343235 | 694 | sreal freq = edge->sreal_frequency (); |
bb173647 | 695 | if (freq > 0) |
7c343235 | 696 | uninlined_call_time *= freq; |
1d77f63b | 697 | else |
698 | uninlined_call_time = uninlined_call_time >> 11; | |
699 | ||
d2c2513e | 700 | sreal caller_time = ipa_fn_summaries->get (caller)->time; |
3172b7bf | 701 | return uninlined_call_time + caller_time; |
702 | } | |
703 | ||
704 | /* Same as compute_uinlined_call_time but compute time when inlining | |
705 | does happen. */ | |
706 | ||
d326c10c | 707 | inline sreal |
3172b7bf | 708 | compute_inlined_call_time (struct cgraph_edge *edge, |
2e211986 | 709 | sreal time) |
3172b7bf | 710 | { |
1d77f63b | 711 | cgraph_node *caller = (edge->caller->global.inlined_to |
712 | ? edge->caller->global.inlined_to | |
713 | : edge->caller); | |
d2c2513e | 714 | sreal caller_time = ipa_fn_summaries->get (caller)->time; |
1d77f63b | 715 | |
7c343235 | 716 | sreal freq = edge->sreal_frequency (); |
bb173647 | 717 | if (freq > 0) |
7c343235 | 718 | time *= freq; |
1d77f63b | 719 | else |
720 | time = time >> 11; | |
721 | ||
e062e35c | 722 | /* This calculation should match one in ipa-inline-analysis.c |
723 | (estimate_edge_size_and_time). */ | |
d2c2513e | 724 | time -= (sreal)ipa_call_summaries->get (edge)->call_stmt_time * freq; |
1d77f63b | 725 | time += caller_time; |
726 | if (time <= 0) | |
727 | time = ((sreal) 1) >> 8; | |
d326c10c | 728 | gcc_checking_assert (time >= 0); |
3172b7bf | 729 | return time; |
730 | } | |
731 | ||
50ba0cad | 732 | /* Return true if the speedup for inlining E is bigger than |
733 | PARAM_MAX_INLINE_MIN_SPEEDUP. */ | |
734 | ||
735 | static bool | |
736 | big_speedup_p (struct cgraph_edge *e) | |
737 | { | |
e062e35c | 738 | sreal unspec_time; |
739 | sreal spec_time = estimate_edge_time (e, &unspec_time); | |
740 | sreal time = compute_uninlined_call_time (e, unspec_time); | |
741 | sreal inlined_time = compute_inlined_call_time (e, spec_time); | |
1d77f63b | 742 | |
0c13b5e4 | 743 | if ((time - inlined_time) * 100 |
bb173647 | 744 | > (sreal) (time * PARAM_VALUE (PARAM_INLINE_MIN_SPEEDUP))) |
50ba0cad | 745 | return true; |
746 | return false; | |
747 | } | |
748 | ||
4869c23f | 749 | /* Return true if we are interested in inlining small function. |
750 | When REPORT is true, report reason to dump file. */ | |
751 | ||
752 | static bool | |
753 | want_inline_small_function_p (struct cgraph_edge *e, bool report) | |
754 | { | |
755 | bool want_inline = true; | |
415d1b9a | 756 | struct cgraph_node *callee = e->callee->ultimate_alias_target (); |
4869c23f | 757 | |
d3ebb261 | 758 | /* Allow this function to be called before can_inline_edge_p, |
759 | since it's usually cheaper. */ | |
760 | if (cgraph_inline_failed_type (e->inline_failed) == CIF_FINAL_ERROR) | |
761 | want_inline = false; | |
762 | else if (DECL_DISREGARD_INLINE_LIMITS (callee->decl)) | |
4869c23f | 763 | ; |
02774f2d | 764 | else if (!DECL_DECLARED_INLINE_P (callee->decl) |
d1f68cd8 | 765 | && !opt_for_fn (e->caller->decl, flag_inline_small_functions)) |
4869c23f | 766 | { |
767 | e->inline_failed = CIF_FUNCTION_NOT_INLINE_CANDIDATE; | |
768 | want_inline = false; | |
b30512dd | 769 | } |
db197f90 | 770 | /* Do fast and conservative check if the function can be good |
be5c7f19 | 771 | inline candidate. At the moment we allow inline hints to |
772 | promote non-inline functions to inline and we increase | |
773 | MAX_INLINE_INSNS_SINGLE 16-fold for inline functions. */ | |
3072aa32 | 774 | else if ((!DECL_DECLARED_INLINE_P (callee->decl) |
151b9ff5 | 775 | && (!e->count.ipa ().initialized_p () || !e->maybe_hot_p ())) |
d2c2513e | 776 | && ipa_fn_summaries->get (callee)->min_size |
777 | - ipa_call_summaries->get (e)->call_stmt_size | |
8c323261 | 778 | > MAX (MAX_INLINE_INSNS_SINGLE, MAX_INLINE_INSNS_AUTO)) |
db197f90 | 779 | { |
780 | e->inline_failed = CIF_MAX_INLINE_INSNS_AUTO_LIMIT; | |
781 | want_inline = false; | |
782 | } | |
db9cef39 | 783 | else if ((DECL_DECLARED_INLINE_P (callee->decl) |
151b9ff5 | 784 | || e->count.ipa ().nonzero_p ()) |
d2c2513e | 785 | && ipa_fn_summaries->get (callee)->min_size |
786 | - ipa_call_summaries->get (e)->call_stmt_size | |
8c323261 | 787 | > 16 * MAX_INLINE_INSNS_SINGLE) |
db197f90 | 788 | { |
3072aa32 | 789 | e->inline_failed = (DECL_DECLARED_INLINE_P (callee->decl) |
790 | ? CIF_MAX_INLINE_INSNS_SINGLE_LIMIT | |
791 | : CIF_MAX_INLINE_INSNS_AUTO_LIMIT); | |
db197f90 | 792 | want_inline = false; |
793 | } | |
65c1a668 | 794 | else |
b30512dd | 795 | { |
4869c23f | 796 | int growth = estimate_edge_growth (e); |
1297cbcd | 797 | ipa_hints hints = estimate_edge_hints (e); |
7ed0697e | 798 | int big_speedup = -1; /* compute this lazily */ |
4869c23f | 799 | |
2b7caeda | 800 | if (growth <= PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SIZE)) |
4869c23f | 801 | ; |
eb7c606e | 802 | /* Apply MAX_INLINE_INSNS_SINGLE limit. Do not do so when |
803 | hints suggests that inlining given function is very profitable. */ | |
02774f2d | 804 | else if (DECL_DECLARED_INLINE_P (callee->decl) |
eb7c606e | 805 | && growth >= MAX_INLINE_INSNS_SINGLE |
7ed0697e | 806 | && (growth >= MAX_INLINE_INSNS_SINGLE * 16 |
807 | || (!(hints & (INLINE_HINT_indirect_call | |
3072aa32 | 808 | | INLINE_HINT_known_hot |
db197f90 | 809 | | INLINE_HINT_loop_iterations |
7ed0697e | 810 | | INLINE_HINT_loop_stride)) |
811 | && !(big_speedup = big_speedup_p (e))))) | |
4869c23f | 812 | { |
dabda7ad | 813 | e->inline_failed = CIF_MAX_INLINE_INSNS_SINGLE_LIMIT; |
4869c23f | 814 | want_inline = false; |
815 | } | |
02774f2d | 816 | else if (!DECL_DECLARED_INLINE_P (callee->decl) |
2b7caeda | 817 | && !opt_for_fn (e->caller->decl, flag_inline_functions) |
818 | && growth >= PARAM_VALUE (PARAM_MAX_INLINE_INSNS_SMALL)) | |
4869c23f | 819 | { |
db197f90 | 820 | /* growth_likely_positive is expensive, always test it last. */ |
dabda7ad | 821 | if (growth >= MAX_INLINE_INSNS_SINGLE |
db197f90 | 822 | || growth_likely_positive (callee, growth)) |
823 | { | |
dabda7ad | 824 | e->inline_failed = CIF_NOT_DECLARED_INLINED; |
db197f90 | 825 | want_inline = false; |
dabda7ad | 826 | } |
4869c23f | 827 | } |
eb7c606e | 828 | /* Apply MAX_INLINE_INSNS_AUTO limit for functions not declared inline |
829 | Upgrade it to MAX_INLINE_INSNS_SINGLE when hints suggests that | |
830 | inlining given function is very profitable. */ | |
02774f2d | 831 | else if (!DECL_DECLARED_INLINE_P (callee->decl) |
3072aa32 | 832 | && !(hints & INLINE_HINT_known_hot) |
4425a9fb | 833 | && growth >= ((hints & (INLINE_HINT_indirect_call |
3716ee8f | 834 | | INLINE_HINT_loop_iterations |
835 | | INLINE_HINT_loop_stride)) | |
eb7c606e | 836 | ? MAX (MAX_INLINE_INSNS_AUTO, |
837 | MAX_INLINE_INSNS_SINGLE) | |
7ed0697e | 838 | : MAX_INLINE_INSNS_AUTO) |
839 | && !(big_speedup == -1 ? big_speedup_p (e) : big_speedup)) | |
4869c23f | 840 | { |
db197f90 | 841 | /* growth_likely_positive is expensive, always test it last. */ |
dabda7ad | 842 | if (growth >= MAX_INLINE_INSNS_SINGLE |
db197f90 | 843 | || growth_likely_positive (callee, growth)) |
844 | { | |
845 | e->inline_failed = CIF_MAX_INLINE_INSNS_AUTO_LIMIT; | |
846 | want_inline = false; | |
dabda7ad | 847 | } |
4869c23f | 848 | } |
a844747e | 849 | /* If call is cold, do not inline when function body would grow. */ |
35ee1c66 | 850 | else if (!e->maybe_hot_p () |
db197f90 | 851 | && (growth >= MAX_INLINE_INSNS_SINGLE |
852 | || growth_likely_positive (callee, growth))) | |
b30512dd | 853 | { |
dabda7ad | 854 | if (e->count.ipa () == profile_count::zero ()) |
855 | e->inline_failed = CIF_NEVER_CALL; | |
856 | else | |
857 | e->inline_failed = CIF_UNLIKELY_CALL; | |
4869c23f | 858 | want_inline = false; |
b30512dd | 859 | } |
860 | } | |
4869c23f | 861 | if (!want_inline && report) |
862 | report_inline_failed_reason (e); | |
863 | return want_inline; | |
864 | } | |
b30512dd | 865 | |
4869c23f | 866 | /* EDGE is self recursive edge. |
867 | We hand two cases - when function A is inlining into itself | |
868 | or when function A is being inlined into another inliner copy of function | |
869 | A within function B. | |
870 | ||
871 | In first case OUTER_NODE points to the toplevel copy of A, while | |
872 | in the second case OUTER_NODE points to the outermost copy of A in B. | |
873 | ||
874 | In both cases we want to be extra selective since | |
875 | inlining the call will just introduce new recursive calls to appear. */ | |
4055a556 | 876 | |
4869c23f | 877 | static bool |
878 | want_inline_self_recursive_call_p (struct cgraph_edge *edge, | |
879 | struct cgraph_node *outer_node, | |
880 | bool peeling, | |
881 | int depth) | |
882 | { | |
883 | char const *reason = NULL; | |
884 | bool want_inline = true; | |
bb173647 | 885 | sreal caller_freq = 1; |
4869c23f | 886 | int max_depth = PARAM_VALUE (PARAM_MAX_INLINE_RECURSIVE_DEPTH_AUTO); |
887 | ||
02774f2d | 888 | if (DECL_DECLARED_INLINE_P (edge->caller->decl)) |
4869c23f | 889 | max_depth = PARAM_VALUE (PARAM_MAX_INLINE_RECURSIVE_DEPTH); |
890 | ||
35ee1c66 | 891 | if (!edge->maybe_hot_p ()) |
4869c23f | 892 | { |
893 | reason = "recursive call is cold"; | |
894 | want_inline = false; | |
895 | } | |
4869c23f | 896 | else if (depth > max_depth) |
897 | { | |
898 | reason = "--param max-inline-recursive-depth exceeded."; | |
899 | want_inline = false; | |
900 | } | |
bb173647 | 901 | else if (outer_node->global.inlined_to |
902 | && (caller_freq = outer_node->callers->sreal_frequency ()) == 0) | |
b8731470 | 903 | { |
bb173647 | 904 | reason = "caller frequency is 0"; |
b8731470 | 905 | want_inline = false; |
906 | } | |
907 | ||
4869c23f | 908 | if (!want_inline) |
909 | ; | |
bb173647 | 910 | /* Inlining of self recursive function into copy of itself within other |
911 | function is transformation similar to loop peeling. | |
4869c23f | 912 | |
4055a556 | 913 | Peeling is profitable if we can inline enough copies to make probability |
4869c23f | 914 | of actual call to the self recursive function very small. Be sure that |
915 | the probability of recursion is small. | |
916 | ||
4055a556 | 917 | We ensure that the frequency of recursing is at most 1 - (1/max_depth). |
bb173647 | 918 | This way the expected number of recursion is at most max_depth. */ |
4869c23f | 919 | else if (peeling) |
920 | { | |
bb173647 | 921 | sreal max_prob = (sreal)1 - ((sreal)1 / (sreal)max_depth); |
4869c23f | 922 | int i; |
923 | for (i = 1; i < depth; i++) | |
bb173647 | 924 | max_prob = max_prob * max_prob; |
925 | if (edge->sreal_frequency () >= max_prob * caller_freq) | |
4869c23f | 926 | { |
927 | reason = "frequency of recursive call is too large"; | |
928 | want_inline = false; | |
929 | } | |
930 | } | |
bb173647 | 931 | /* Recursive inlining, i.e. equivalent of unrolling, is profitable if |
932 | recursion depth is large. We reduce function call overhead and increase | |
933 | chances that things fit in hardware return predictor. | |
4869c23f | 934 | |
935 | Recursive inlining might however increase cost of stack frame setup | |
936 | actually slowing down functions whose recursion tree is wide rather than | |
937 | deep. | |
938 | ||
4055a556 | 939 | Deciding reliably on when to do recursive inlining without profile feedback |
4869c23f | 940 | is tricky. For now we disable recursive inlining when probability of self |
941 | recursion is low. | |
942 | ||
bb173647 | 943 | Recursive inlining of self recursive call within loop also results in |
944 | large loop depths that generally optimize badly. We may want to throttle | |
945 | down inlining in those cases. In particular this seems to happen in one | |
946 | of libstdc++ rb tree methods. */ | |
4869c23f | 947 | else |
948 | { | |
bb173647 | 949 | if (edge->sreal_frequency () * 100 |
950 | <= caller_freq | |
951 | * PARAM_VALUE (PARAM_MIN_INLINE_RECURSIVE_PROBABILITY)) | |
4869c23f | 952 | { |
953 | reason = "frequency of recursive call is too small"; | |
954 | want_inline = false; | |
955 | } | |
956 | } | |
7261dbb3 | 957 | if (!want_inline && dump_enabled_p ()) |
958 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, edge->call_stmt, | |
959 | " not inlining recursively: %s\n", reason); | |
4869c23f | 960 | return want_inline; |
65c1a668 | 961 | } |
962 | ||
31925450 | 963 | /* Return true when NODE has uninlinable caller; |
964 | set HAS_HOT_CALL if it has hot call. | |
794fd282 | 965 | Worker for cgraph_for_node_and_aliases. */ |
966 | ||
967 | static bool | |
31925450 | 968 | check_callers (struct cgraph_node *node, void *has_hot_call) |
794fd282 | 969 | { |
31925450 | 970 | struct cgraph_edge *e; |
971 | for (e = node->callers; e; e = e->next_caller) | |
972 | { | |
5f4e4f36 | 973 | if (!opt_for_fn (e->caller->decl, flag_inline_functions_called_once) |
974 | || !opt_for_fn (e->caller->decl, optimize)) | |
d1f68cd8 | 975 | return true; |
31925450 | 976 | if (!can_inline_edge_p (e, true)) |
977 | return true; | |
9dcc8702 | 978 | if (e->recursive_p ()) |
979 | return true; | |
1fa377f3 | 980 | if (!can_inline_edge_by_limits_p (e, true)) |
981 | return true; | |
35ee1c66 | 982 | if (!(*(bool *)has_hot_call) && e->maybe_hot_p ()) |
31925450 | 983 | *(bool *)has_hot_call = true; |
984 | } | |
985 | return false; | |
794fd282 | 986 | } |
987 | ||
ba3a929e | 988 | /* If NODE has a caller, return true. */ |
989 | ||
990 | static bool | |
991 | has_caller_p (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) | |
992 | { | |
993 | if (node->callers) | |
994 | return true; | |
995 | return false; | |
996 | } | |
4055a556 | 997 | |
17b13a59 | 998 | /* Decide if inlining NODE would reduce unit size by eliminating |
999 | the offline copy of function. | |
1000 | When COLD is true the cold calls are considered, too. */ | |
4055a556 | 1001 | |
1002 | static bool | |
17b13a59 | 1003 | want_inline_function_to_all_callers_p (struct cgraph_node *node, bool cold) |
4055a556 | 1004 | { |
be5c7f19 | 1005 | bool has_hot_call = false; |
1006 | ||
ae1b96a8 | 1007 | /* Aliases gets inlined along with the function they alias. */ |
1008 | if (node->alias) | |
be5c7f19 | 1009 | return false; |
1010 | /* Already inlined? */ | |
1011 | if (node->global.inlined_to) | |
1012 | return false; | |
1013 | /* Does it have callers? */ | |
7feaa33e | 1014 | if (!node->call_for_symbol_and_aliases (has_caller_p, NULL, true)) |
be5c7f19 | 1015 | return false; |
1016 | /* Inlining into all callers would increase size? */ | |
1017 | if (estimate_growth (node) > 0) | |
1018 | return false; | |
1019 | /* All inlines must be possible. */ | |
7feaa33e | 1020 | if (node->call_for_symbol_and_aliases (check_callers, &has_hot_call, |
1021 | true)) | |
be5c7f19 | 1022 | return false; |
1023 | if (!cold && !has_hot_call) | |
1024 | return false; | |
1025 | return true; | |
4055a556 | 1026 | } |
1027 | ||
a49506c7 | 1028 | /* A cost model driving the inlining heuristics in a way so the edges with |
1029 | smallest badness are inlined first. After each inlining is performed | |
442e3cb9 | 1030 | the costs of all caller edges of nodes affected are recomputed so the |
a49506c7 | 1031 | metrics may accurately depend on values such as number of inlinable callers |
4ae20857 | 1032 | of the function or function body size. */ |
a49506c7 | 1033 | |
c1ffea07 | 1034 | static sreal |
4869c23f | 1035 | edge_badness (struct cgraph_edge *edge, bool dump) |
a49506c7 | 1036 | { |
c1ffea07 | 1037 | sreal badness; |
2e211986 | 1038 | int growth; |
e062e35c | 1039 | sreal edge_time, unspec_edge_time; |
415d1b9a | 1040 | struct cgraph_node *callee = edge->callee->ultimate_alias_target (); |
2e966e2a | 1041 | class ipa_fn_summary *callee_info = ipa_fn_summaries->get (callee); |
1297cbcd | 1042 | ipa_hints hints; |
1d77f63b | 1043 | cgraph_node *caller = (edge->caller->global.inlined_to |
1044 | ? edge->caller->global.inlined_to | |
1045 | : edge->caller); | |
960dff4c | 1046 | |
99c67f24 | 1047 | growth = estimate_edge_growth (edge); |
e062e35c | 1048 | edge_time = estimate_edge_time (edge, &unspec_edge_time); |
eb7c606e | 1049 | hints = estimate_edge_hints (edge); |
3172b7bf | 1050 | gcc_checking_assert (edge_time >= 0); |
151b9ff5 | 1051 | /* Check that inlined time is better, but tolerate some roundoff issues. |
1052 | FIXME: When callee profile drops to 0 we account calls more. This | |
1053 | should be fixed by never doing that. */ | |
9732f43e | 1054 | gcc_checking_assert ((edge_time * 100 |
1055 | - callee_info->time * 101).to_int () <= 0 | |
151b9ff5 | 1056 | || callee->count.ipa ().initialized_p ()); |
3172b7bf | 1057 | gcc_checking_assert (growth <= callee_info->size); |
5cd33168 | 1058 | |
022b3380 | 1059 | if (dump) |
1060 | { | |
0e388735 | 1061 | fprintf (dump_file, " Badness calculation for %s -> %s\n", |
1062 | edge->caller->dump_name (), | |
1063 | edge->callee->dump_name ()); | |
e062e35c | 1064 | fprintf (dump_file, " size growth %i, time %f unspec %f ", |
022b3380 | 1065 | growth, |
e062e35c | 1066 | edge_time.to_double (), |
1067 | unspec_edge_time.to_double ()); | |
1297cbcd | 1068 | ipa_dump_hints (dump_file, hints); |
50ba0cad | 1069 | if (big_speedup_p (edge)) |
1070 | fprintf (dump_file, " big_speedup"); | |
eb7c606e | 1071 | fprintf (dump_file, "\n"); |
022b3380 | 1072 | } |
4ae20857 | 1073 | |
1074 | /* Always prefer inlining saving code size. */ | |
1075 | if (growth <= 0) | |
022b3380 | 1076 | { |
d326c10c | 1077 | badness = (sreal) (-SREAL_MIN_SIG + growth) << (SREAL_MAX_EXP / 256); |
022b3380 | 1078 | if (dump) |
d326c10c | 1079 | fprintf (dump_file, " %f: Growth %d <= 0\n", badness.to_double (), |
022b3380 | 1080 | growth); |
1081 | } | |
1d77f63b | 1082 | /* Inlining into EXTERNAL functions is not going to change anything unless |
1083 | they are themselves inlined. */ | |
1084 | else if (DECL_EXTERNAL (caller->decl)) | |
022b3380 | 1085 | { |
022b3380 | 1086 | if (dump) |
1d77f63b | 1087 | fprintf (dump_file, " max: function is external\n"); |
1088 | return sreal::max (); | |
022b3380 | 1089 | } |
1d77f63b | 1090 | /* When profile is available. Compute badness as: |
0656d247 | 1091 | |
1d77f63b | 1092 | time_saved * caller_count |
05c71fb5 | 1093 | goodness = ------------------------------------------------- |
1094 | growth_of_caller * overall_growth * combined_size | |
3172b7bf | 1095 | |
1096 | badness = - goodness | |
0656d247 | 1097 | |
1d77f63b | 1098 | Again use negative value to make calls with profile appear hotter |
1099 | then calls without. | |
0656d247 | 1100 | */ |
db9cef39 | 1101 | else if (opt_for_fn (caller->decl, flag_guess_branch_prob) |
151b9ff5 | 1102 | || caller->count.ipa ().nonzero_p ()) |
a49506c7 | 1103 | { |
d326c10c | 1104 | sreal numerator, denominator; |
71e37927 | 1105 | int overall_growth; |
60fd37d2 | 1106 | sreal inlined_time = compute_inlined_call_time (edge, edge_time); |
1d77f63b | 1107 | |
e062e35c | 1108 | numerator = (compute_uninlined_call_time (edge, unspec_edge_time) |
60fd37d2 | 1109 | - inlined_time); |
bb173647 | 1110 | if (numerator <= 0) |
1d77f63b | 1111 | numerator = ((sreal) 1 >> 8); |
151b9ff5 | 1112 | if (caller->count.ipa ().nonzero_p ()) |
1113 | numerator *= caller->count.ipa ().to_gcov_type (); | |
1114 | else if (caller->count.ipa ().initialized_p ()) | |
1d77f63b | 1115 | numerator = numerator >> 11; |
1116 | denominator = growth; | |
71e37927 | 1117 | |
1118 | overall_growth = callee_info->growth; | |
1119 | ||
1120 | /* Look for inliner wrappers of the form: | |
1121 | ||
1122 | inline_caller () | |
1123 | { | |
1124 | do_fast_job... | |
1125 | if (need_more_work) | |
1126 | noninline_callee (); | |
1127 | } | |
1128 | Withhout panilizing this case, we usually inline noninline_callee | |
1129 | into the inline_caller because overall_growth is small preventing | |
1130 | further inlining of inline_caller. | |
1131 | ||
1132 | Penalize only callgraph edges to functions with small overall | |
1133 | growth ... | |
1134 | */ | |
1135 | if (growth > overall_growth | |
1136 | /* ... and having only one caller which is not inlined ... */ | |
1137 | && callee_info->single_caller | |
1138 | && !edge->caller->global.inlined_to | |
1139 | /* ... and edges executed only conditionally ... */ | |
bb173647 | 1140 | && edge->sreal_frequency () < 1 |
71e37927 | 1141 | /* ... consider case where callee is not inline but caller is ... */ |
1142 | && ((!DECL_DECLARED_INLINE_P (edge->callee->decl) | |
1143 | && DECL_DECLARED_INLINE_P (caller->decl)) | |
1144 | /* ... or when early optimizers decided to split and edge | |
1145 | frequency still indicates splitting is a win ... */ | |
1146 | || (callee->split_part && !caller->split_part | |
bb173647 | 1147 | && edge->sreal_frequency () * 100 |
1148 | < PARAM_VALUE | |
1149 | (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY) | |
71e37927 | 1150 | /* ... and do not overwrite user specified hints. */ |
1151 | && (!DECL_DECLARED_INLINE_P (edge->callee->decl) | |
1152 | || DECL_DECLARED_INLINE_P (caller->decl))))) | |
1153 | { | |
d2c2513e | 1154 | ipa_fn_summary *caller_info = ipa_fn_summaries->get (caller); |
71e37927 | 1155 | int caller_growth = caller_info->growth; |
1156 | ||
1157 | /* Only apply the penalty when caller looks like inline candidate, | |
1158 | and it is not called once and. */ | |
1159 | if (!caller_info->single_caller && overall_growth < caller_growth | |
1160 | && caller_info->inlinable | |
1161 | && caller_info->size | |
1162 | < (DECL_DECLARED_INLINE_P (caller->decl) | |
1163 | ? MAX_INLINE_INSNS_SINGLE : MAX_INLINE_INSNS_AUTO)) | |
1164 | { | |
1165 | if (dump) | |
1166 | fprintf (dump_file, | |
1167 | " Wrapper penalty. Increasing growth %i to %i\n", | |
1168 | overall_growth, caller_growth); | |
1169 | overall_growth = caller_growth; | |
1170 | } | |
1171 | } | |
1172 | if (overall_growth > 0) | |
1173 | { | |
1174 | /* Strongly preffer functions with few callers that can be inlined | |
1175 | fully. The square root here leads to smaller binaries at average. | |
1176 | Watch however for extreme cases and return to linear function | |
1177 | when growth is large. */ | |
1178 | if (overall_growth < 256) | |
1179 | overall_growth *= overall_growth; | |
1180 | else | |
1181 | overall_growth += 256 * 256 - 256; | |
1182 | denominator *= overall_growth; | |
1183 | } | |
3bf0a1f4 | 1184 | denominator *= ipa_fn_summaries->get (caller)->self_size + growth; |
d326c10c | 1185 | |
1186 | badness = - numerator / denominator; | |
1187 | ||
022b3380 | 1188 | if (dump) |
1189 | { | |
1190 | fprintf (dump_file, | |
f03df321 | 1191 | " %f: guessed profile. frequency %f, count %" PRId64 |
1192 | " caller count %" PRId64 | |
e062e35c | 1193 | " time w/o inlining %f, time with inlining %f" |
71e37927 | 1194 | " overall growth %i (current) %i (original)" |
1195 | " %i (compensated)\n", | |
1196 | badness.to_double (), | |
453addb7 | 1197 | edge->sreal_frequency ().to_double (), |
151b9ff5 | 1198 | edge->count.ipa ().initialized_p () ? edge->count.ipa ().to_gcov_type () : -1, |
1199 | caller->count.ipa ().initialized_p () ? caller->count.ipa ().to_gcov_type () : -1, | |
e062e35c | 1200 | compute_uninlined_call_time (edge, |
1201 | unspec_edge_time).to_double (), | |
bb173647 | 1202 | inlined_time.to_double (), |
3172b7bf | 1203 | estimate_growth (callee), |
71e37927 | 1204 | callee_info->growth, overall_growth); |
022b3380 | 1205 | } |
4ae20857 | 1206 | } |
1207 | /* When function local profile is not available or it does not give | |
1208 | useful information (ie frequency is zero), base the cost on | |
1209 | loop nest and overall size growth, so we optimize for overall number | |
1210 | of functions fully inlined in program. */ | |
1211 | else | |
1212 | { | |
d2c2513e | 1213 | int nest = MIN (ipa_call_summaries->get (edge)->loop_depth, 8); |
d326c10c | 1214 | badness = growth; |
a49506c7 | 1215 | |
4ae20857 | 1216 | /* Decrease badness if call is nested. */ |
48e1416a | 1217 | if (badness > 0) |
c1ffea07 | 1218 | badness = badness >> nest; |
4ae20857 | 1219 | else |
d326c10c | 1220 | badness = badness << nest; |
022b3380 | 1221 | if (dump) |
71e37927 | 1222 | fprintf (dump_file, " %f: no profile. nest %i\n", |
1223 | badness.to_double (), nest); | |
a49506c7 | 1224 | } |
d326c10c | 1225 | gcc_checking_assert (badness != 0); |
022b3380 | 1226 | |
35ee1c66 | 1227 | if (edge->recursive_p ()) |
d326c10c | 1228 | badness = badness.shift (badness > 0 ? 4 : -4); |
1229 | if ((hints & (INLINE_HINT_indirect_call | |
1230 | | INLINE_HINT_loop_iterations | |
d326c10c | 1231 | | INLINE_HINT_loop_stride)) |
1232 | || callee_info->growth <= 0) | |
1233 | badness = badness.shift (badness > 0 ? -2 : 2); | |
1234 | if (hints & (INLINE_HINT_same_scc)) | |
1235 | badness = badness.shift (badness > 0 ? 3 : -3); | |
1236 | else if (hints & (INLINE_HINT_in_scc)) | |
1237 | badness = badness.shift (badness > 0 ? 2 : -2); | |
1238 | else if (hints & (INLINE_HINT_cross_module)) | |
1239 | badness = badness.shift (badness > 0 ? 1 : -1); | |
1d77f63b | 1240 | if (DECL_DISREGARD_INLINE_LIMITS (callee->decl)) |
1241 | badness = badness.shift (badness > 0 ? -4 : 4); | |
1242 | else if ((hints & INLINE_HINT_declared_inline)) | |
d326c10c | 1243 | badness = badness.shift (badness > 0 ? -3 : 3); |
1244 | if (dump) | |
1245 | fprintf (dump_file, " Adjusted by hints %f\n", badness.to_double ()); | |
1246 | return badness; | |
a49506c7 | 1247 | } |
1248 | ||
9f3c2a90 | 1249 | /* Recompute badness of EDGE and update its key in HEAP if needed. */ |
4869c23f | 1250 | static inline void |
0aadd187 | 1251 | update_edge_key (edge_heap_t *heap, struct cgraph_edge *edge) |
9f3c2a90 | 1252 | { |
c1ffea07 | 1253 | sreal badness = edge_badness (edge, false); |
9f3c2a90 | 1254 | if (edge->aux) |
1255 | { | |
0aadd187 | 1256 | edge_heap_node_t *n = (edge_heap_node_t *) edge->aux; |
1257 | gcc_checking_assert (n->get_data () == edge); | |
9f3c2a90 | 1258 | |
d326c10c | 1259 | /* fibonacci_heap::replace_key does busy updating of the |
1260 | heap that is unnecesarily expensive. | |
1261 | We do lazy increases: after extracting minimum if the key | |
1262 | turns out to be out of date, it is re-inserted into heap | |
1263 | with correct value. */ | |
0aadd187 | 1264 | if (badness < n->get_key ()) |
9f3c2a90 | 1265 | { |
4869c23f | 1266 | if (dump_file && (dump_flags & TDF_DETAILS)) |
1267 | { | |
1268 | fprintf (dump_file, | |
0e388735 | 1269 | " decreasing badness %s -> %s, %f to %f\n", |
1270 | edge->caller->dump_name (), | |
1271 | edge->callee->dump_name (), | |
d326c10c | 1272 | n->get_key ().to_double (), |
1273 | badness.to_double ()); | |
4869c23f | 1274 | } |
0aadd187 | 1275 | heap->decrease_key (n, badness); |
9f3c2a90 | 1276 | } |
1277 | } | |
1278 | else | |
4869c23f | 1279 | { |
1280 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1281 | { | |
1282 | fprintf (dump_file, | |
0e388735 | 1283 | " enqueuing call %s -> %s, badness %f\n", |
1284 | edge->caller->dump_name (), | |
1285 | edge->callee->dump_name (), | |
d326c10c | 1286 | badness.to_double ()); |
4869c23f | 1287 | } |
0aadd187 | 1288 | edge->aux = heap->insert (badness, edge); |
4869c23f | 1289 | } |
9f3c2a90 | 1290 | } |
1291 | ||
ba5b0608 | 1292 | |
1293 | /* NODE was inlined. | |
1294 | All caller edges needs to be resetted because | |
1295 | size estimates change. Similarly callees needs reset | |
1296 | because better context may be known. */ | |
1297 | ||
1298 | static void | |
1299 | reset_edge_caches (struct cgraph_node *node) | |
1300 | { | |
1301 | struct cgraph_edge *edge; | |
1302 | struct cgraph_edge *e = node->callees; | |
1303 | struct cgraph_node *where = node; | |
e4a2b488 | 1304 | struct ipa_ref *ref; |
ba5b0608 | 1305 | |
1306 | if (where->global.inlined_to) | |
1307 | where = where->global.inlined_to; | |
1308 | ||
bc4e1286 | 1309 | if (edge_growth_cache != NULL) |
1310 | for (edge = where->callers; edge; edge = edge->next_caller) | |
1311 | if (edge->inline_failed) | |
1312 | edge_growth_cache->remove (edge); | |
e4a2b488 | 1313 | |
1314 | FOR_EACH_ALIAS (where, ref) | |
1315 | reset_edge_caches (dyn_cast <cgraph_node *> (ref->referring)); | |
ba5b0608 | 1316 | |
1317 | if (!e) | |
1318 | return; | |
1319 | ||
1320 | while (true) | |
1321 | if (!e->inline_failed && e->callee->callees) | |
1322 | e = e->callee->callees; | |
1323 | else | |
1324 | { | |
bc4e1286 | 1325 | if (edge_growth_cache != NULL && e->inline_failed) |
1326 | edge_growth_cache->remove (e); | |
ba5b0608 | 1327 | if (e->next_callee) |
1328 | e = e->next_callee; | |
1329 | else | |
1330 | { | |
1331 | do | |
1332 | { | |
1333 | if (e->caller == node) | |
1334 | return; | |
1335 | e = e->caller->callers; | |
1336 | } | |
1337 | while (!e->next_callee); | |
1338 | e = e->next_callee; | |
1339 | } | |
1340 | } | |
1341 | } | |
1342 | ||
1343 | /* Recompute HEAP nodes for each of caller of NODE. | |
1344 | UPDATED_NODES track nodes we already visited, to avoid redundant work. | |
1345 | When CHECK_INLINABLITY_FOR is set, re-check for specified edge that | |
1346 | it is inlinable. Otherwise check all edges. */ | |
a49506c7 | 1347 | |
1348 | static void | |
0aadd187 | 1349 | update_caller_keys (edge_heap_t *heap, struct cgraph_node *node, |
ba5b0608 | 1350 | bitmap updated_nodes, |
1351 | struct cgraph_edge *check_inlinablity_for) | |
a49506c7 | 1352 | { |
1353 | struct cgraph_edge *edge; | |
e4a2b488 | 1354 | struct ipa_ref *ref; |
a49506c7 | 1355 | |
d2c2513e | 1356 | if ((!node->alias && !ipa_fn_summaries->get (node)->inlinable) |
a49506c7 | 1357 | || node->global.inlined_to) |
1358 | return; | |
2c8bbd94 | 1359 | if (!bitmap_set_bit (updated_nodes, node->get_uid ())) |
a49506c7 | 1360 | return; |
a49506c7 | 1361 | |
e4a2b488 | 1362 | FOR_EACH_ALIAS (node, ref) |
1363 | { | |
1364 | struct cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); | |
1365 | update_caller_keys (heap, alias, updated_nodes, check_inlinablity_for); | |
1366 | } | |
c70f46b0 | 1367 | |
854efde4 | 1368 | for (edge = node->callers; edge; edge = edge->next_caller) |
4869c23f | 1369 | if (edge->inline_failed) |
1370 | { | |
ba5b0608 | 1371 | if (!check_inlinablity_for |
1372 | || check_inlinablity_for == edge) | |
109bf1e3 | 1373 | { |
1fa377f3 | 1374 | if (can_inline_edge_p (edge, false) |
1375 | && want_inline_small_function_p (edge, false) | |
1376 | && can_inline_edge_by_limits_p (edge, false)) | |
ba5b0608 | 1377 | update_edge_key (heap, edge); |
1378 | else if (edge->aux) | |
1379 | { | |
1380 | report_inline_failed_reason (edge); | |
0aadd187 | 1381 | heap->delete_node ((edge_heap_node_t *) edge->aux); |
ba5b0608 | 1382 | edge->aux = NULL; |
1383 | } | |
109bf1e3 | 1384 | } |
ba5b0608 | 1385 | else if (edge->aux) |
1386 | update_edge_key (heap, edge); | |
4869c23f | 1387 | } |
9f3c2a90 | 1388 | } |
1389 | ||
ba5b0608 | 1390 | /* Recompute HEAP nodes for each uninlined call in NODE. |
9f3c2a90 | 1391 | This is used when we know that edge badnesses are going only to increase |
1392 | (we introduced new call site) and thus all we need is to insert newly | |
1393 | created edges into heap. */ | |
1394 | ||
1395 | static void | |
0aadd187 | 1396 | update_callee_keys (edge_heap_t *heap, struct cgraph_node *node, |
9f3c2a90 | 1397 | bitmap updated_nodes) |
1398 | { | |
1399 | struct cgraph_edge *e = node->callees; | |
4055a556 | 1400 | |
9f3c2a90 | 1401 | if (!e) |
1402 | return; | |
1403 | while (true) | |
1404 | if (!e->inline_failed && e->callee->callees) | |
1405 | e = e->callee->callees; | |
1406 | else | |
a49506c7 | 1407 | { |
82626cb0 | 1408 | enum availability avail; |
1409 | struct cgraph_node *callee; | |
e825447c | 1410 | /* We do not reset callee growth cache here. Since we added a new call, |
1411 | growth chould have just increased and consequentely badness metric | |
1412 | don't need updating. */ | |
9f3c2a90 | 1413 | if (e->inline_failed |
fbcea800 | 1414 | && (callee = e->callee->ultimate_alias_target (&avail, e->caller)) |
d2c2513e | 1415 | && ipa_fn_summaries->get (callee) != NULL |
1416 | && ipa_fn_summaries->get (callee)->inlinable | |
9817f2cd | 1417 | && avail >= AVAIL_AVAILABLE |
2c8bbd94 | 1418 | && !bitmap_bit_p (updated_nodes, callee->get_uid ())) |
a49506c7 | 1419 | { |
1fa377f3 | 1420 | if (can_inline_edge_p (e, false) |
1421 | && want_inline_small_function_p (e, false) | |
1422 | && can_inline_edge_by_limits_p (e, false)) | |
ba5b0608 | 1423 | update_edge_key (heap, e); |
1424 | else if (e->aux) | |
1425 | { | |
1426 | report_inline_failed_reason (e); | |
0aadd187 | 1427 | heap->delete_node ((edge_heap_node_t *) e->aux); |
ba5b0608 | 1428 | e->aux = NULL; |
1429 | } | |
9f3c2a90 | 1430 | } |
1431 | if (e->next_callee) | |
1432 | e = e->next_callee; | |
1433 | else | |
1434 | { | |
1435 | do | |
022b3380 | 1436 | { |
9f3c2a90 | 1437 | if (e->caller == node) |
1438 | return; | |
1439 | e = e->caller->callers; | |
022b3380 | 1440 | } |
9f3c2a90 | 1441 | while (!e->next_callee); |
1442 | e = e->next_callee; | |
a49506c7 | 1443 | } |
a49506c7 | 1444 | } |
1445 | } | |
1446 | ||
a49506c7 | 1447 | /* Enqueue all recursive calls from NODE into priority queue depending on |
442e3cb9 | 1448 | how likely we want to recursively inline the call. */ |
a49506c7 | 1449 | |
65c1a668 | 1450 | static void |
1451 | lookup_recursive_calls (struct cgraph_node *node, struct cgraph_node *where, | |
0aadd187 | 1452 | edge_heap_t *heap) |
65c1a668 | 1453 | { |
1454 | struct cgraph_edge *e; | |
82626cb0 | 1455 | enum availability avail; |
1456 | ||
65c1a668 | 1457 | for (e = where->callees; e; e = e->next_callee) |
82626cb0 | 1458 | if (e->callee == node |
fbcea800 | 1459 | || (e->callee->ultimate_alias_target (&avail, e->caller) == node |
415d1b9a | 1460 | && avail > AVAIL_INTERPOSABLE)) |
bb173647 | 1461 | heap->insert (-e->sreal_frequency (), e); |
65c1a668 | 1462 | for (e = where->callees; e; e = e->next_callee) |
1463 | if (!e->inline_failed) | |
a49506c7 | 1464 | lookup_recursive_calls (node, e->callee, heap); |
65c1a668 | 1465 | } |
1466 | ||
1467 | /* Decide on recursive inlining: in the case function has recursive calls, | |
f8daee9b | 1468 | inline until body size reaches given argument. If any new indirect edges |
6db08adc | 1469 | are discovered in the process, add them to *NEW_EDGES, unless NEW_EDGES |
1470 | is NULL. */ | |
a49506c7 | 1471 | |
1472 | static bool | |
4869c23f | 1473 | recursive_inlining (struct cgraph_edge *edge, |
415d1b9a | 1474 | vec<cgraph_edge *> *new_edges) |
65c1a668 | 1475 | { |
1476 | int limit = PARAM_VALUE (PARAM_MAX_INLINE_INSNS_RECURSIVE_AUTO); | |
b0410238 | 1477 | edge_heap_t heap (sreal::min ()); |
17c205c9 | 1478 | struct cgraph_node *node; |
65c1a668 | 1479 | struct cgraph_edge *e; |
4869c23f | 1480 | struct cgraph_node *master_clone = NULL, *next; |
65c1a668 | 1481 | int depth = 0; |
1482 | int n = 0; | |
1483 | ||
17c205c9 | 1484 | node = edge->caller; |
1485 | if (node->global.inlined_to) | |
1486 | node = node->global.inlined_to; | |
1487 | ||
02774f2d | 1488 | if (DECL_DECLARED_INLINE_P (node->decl)) |
4869c23f | 1489 | limit = PARAM_VALUE (PARAM_MAX_INLINE_INSNS_RECURSIVE); |
65c1a668 | 1490 | |
1491 | /* Make sure that function is small enough to be considered for inlining. */ | |
4869c23f | 1492 | if (estimate_size_after_inlining (node, edge) >= limit) |
a49506c7 | 1493 | return false; |
0aadd187 | 1494 | lookup_recursive_calls (node, node, &heap); |
1495 | if (heap.empty ()) | |
1496 | return false; | |
65c1a668 | 1497 | |
1498 | if (dump_file) | |
48e1416a | 1499 | fprintf (dump_file, |
a49506c7 | 1500 | " Performing recursive inlining on %s\n", |
f1c8b4d7 | 1501 | node->name ()); |
65c1a668 | 1502 | |
65c1a668 | 1503 | /* Do the inlining and update list of recursive call during process. */ |
0aadd187 | 1504 | while (!heap.empty ()) |
65c1a668 | 1505 | { |
0aadd187 | 1506 | struct cgraph_edge *curr = heap.extract_min (); |
3998d451 | 1507 | struct cgraph_node *cnode, *dest = curr->callee; |
17c205c9 | 1508 | |
1fa377f3 | 1509 | if (!can_inline_edge_p (curr, true) |
1e106181 | 1510 | || !can_inline_edge_by_limits_p (curr, true)) |
4869c23f | 1511 | continue; |
1512 | ||
3998d451 | 1513 | /* MASTER_CLONE is produced in the case we already started modified |
1514 | the function. Be sure to redirect edge to the original body before | |
1515 | estimating growths otherwise we will be seeing growths after inlining | |
1516 | the already modified body. */ | |
1517 | if (master_clone) | |
1518 | { | |
35ee1c66 | 1519 | curr->redirect_callee (master_clone); |
bc4e1286 | 1520 | if (edge_growth_cache != NULL) |
1521 | edge_growth_cache->remove (curr); | |
3998d451 | 1522 | } |
1523 | ||
1524 | if (estimate_size_after_inlining (node, curr) > limit) | |
1525 | { | |
35ee1c66 | 1526 | curr->redirect_callee (dest); |
bc4e1286 | 1527 | if (edge_growth_cache != NULL) |
1528 | edge_growth_cache->remove (curr); | |
3998d451 | 1529 | break; |
1530 | } | |
1531 | ||
0aca0eb6 | 1532 | depth = 1; |
1533 | for (cnode = curr->caller; | |
1534 | cnode->global.inlined_to; cnode = cnode->callers->caller) | |
02774f2d | 1535 | if (node->decl |
415d1b9a | 1536 | == curr->callee->ultimate_alias_target ()->decl) |
67baa302 | 1537 | depth++; |
0aca0eb6 | 1538 | |
4869c23f | 1539 | if (!want_inline_self_recursive_call_p (curr, node, false, depth)) |
3998d451 | 1540 | { |
35ee1c66 | 1541 | curr->redirect_callee (dest); |
bc4e1286 | 1542 | if (edge_growth_cache != NULL) |
1543 | edge_growth_cache->remove (curr); | |
3998d451 | 1544 | continue; |
1545 | } | |
65c1a668 | 1546 | |
a49506c7 | 1547 | if (dump_file) |
0aca0eb6 | 1548 | { |
48e1416a | 1549 | fprintf (dump_file, |
0aca0eb6 | 1550 | " Inlining call of depth %i", depth); |
205ce1aa | 1551 | if (node->count.nonzero_p ()) |
0aca0eb6 | 1552 | { |
1553 | fprintf (dump_file, " called approx. %.2f times per call", | |
db9cef39 | 1554 | (double)curr->count.to_gcov_type () |
1555 | / node->count.to_gcov_type ()); | |
0aca0eb6 | 1556 | } |
1557 | fprintf (dump_file, "\n"); | |
1558 | } | |
4869c23f | 1559 | if (!master_clone) |
1560 | { | |
1561 | /* We need original clone to copy around. */ | |
415d1b9a | 1562 | master_clone = node->create_clone (node->decl, node->count, |
151b9ff5 | 1563 | false, vNULL, true, NULL, NULL); |
4869c23f | 1564 | for (e = master_clone->callees; e; e = e->next_callee) |
1565 | if (!e->inline_failed) | |
151b9ff5 | 1566 | clone_inlined_nodes (e, true, false, NULL); |
35ee1c66 | 1567 | curr->redirect_callee (master_clone); |
bc4e1286 | 1568 | if (edge_growth_cache != NULL) |
1569 | edge_growth_cache->remove (curr); | |
4869c23f | 1570 | } |
1571 | ||
6331b6fa | 1572 | inline_call (curr, false, new_edges, &overall_size, true); |
0aadd187 | 1573 | lookup_recursive_calls (node, curr->callee, &heap); |
65c1a668 | 1574 | n++; |
1575 | } | |
4869c23f | 1576 | |
0aadd187 | 1577 | if (!heap.empty () && dump_file) |
0aca0eb6 | 1578 | fprintf (dump_file, " Recursive inlining growth limit met.\n"); |
4869c23f | 1579 | |
1580 | if (!master_clone) | |
1581 | return false; | |
1582 | ||
7261dbb3 | 1583 | if (dump_enabled_p ()) |
1584 | dump_printf_loc (MSG_NOTE, edge->call_stmt, | |
1585 | "\n Inlined %i times, " | |
1586 | "body grown from size %i to %i, time %f to %f\n", n, | |
1587 | ipa_fn_summaries->get (master_clone)->size, | |
1588 | ipa_fn_summaries->get (node)->size, | |
1589 | ipa_fn_summaries->get (master_clone)->time.to_double (), | |
1590 | ipa_fn_summaries->get (node)->time.to_double ()); | |
65c1a668 | 1591 | |
1592 | /* Remove master clone we used for inlining. We rely that clones inlined | |
1593 | into master clone gets queued just before master clone so we don't | |
1594 | need recursion. */ | |
35ee1c66 | 1595 | for (node = symtab->first_function (); node != master_clone; |
f4ec5ce1 | 1596 | node = next) |
1597 | { | |
35ee1c66 | 1598 | next = symtab->next_function (node); |
f4ec5ce1 | 1599 | if (node->global.inlined_to == master_clone) |
415d1b9a | 1600 | node->remove (); |
f4ec5ce1 | 1601 | } |
415d1b9a | 1602 | master_clone->remove (); |
4869c23f | 1603 | return true; |
65c1a668 | 1604 | } |
1605 | ||
4055a556 | 1606 | |
0d424440 | 1607 | /* Given whole compilation unit estimate of INSNS, compute how large we can |
5c121ffe | 1608 | allow the unit to grow. */ |
4055a556 | 1609 | |
5c121ffe | 1610 | static int |
1611 | compute_max_insns (int insns) | |
1612 | { | |
1613 | int max_insns = insns; | |
1614 | if (max_insns < PARAM_VALUE (PARAM_LARGE_UNIT_INSNS)) | |
1615 | max_insns = PARAM_VALUE (PARAM_LARGE_UNIT_INSNS); | |
1616 | ||
3a4303e7 | 1617 | return ((int64_t) max_insns |
773aeca3 | 1618 | * (100 + PARAM_VALUE (PARAM_INLINE_UNIT_GROWTH)) / 100); |
5c121ffe | 1619 | } |
1620 | ||
4055a556 | 1621 | |
f8daee9b | 1622 | /* Compute badness of all edges in NEW_EDGES and add them to the HEAP. */ |
4055a556 | 1623 | |
f8daee9b | 1624 | static void |
0aadd187 | 1625 | add_new_edges_to_heap (edge_heap_t *heap, vec<cgraph_edge *> new_edges) |
f8daee9b | 1626 | { |
f1f41a6c | 1627 | while (new_edges.length () > 0) |
f8daee9b | 1628 | { |
f1f41a6c | 1629 | struct cgraph_edge *edge = new_edges.pop (); |
f8daee9b | 1630 | |
1631 | gcc_assert (!edge->aux); | |
6d91ac76 | 1632 | gcc_assert (edge->callee); |
82626cb0 | 1633 | if (edge->inline_failed |
4869c23f | 1634 | && can_inline_edge_p (edge, true) |
1fa377f3 | 1635 | && want_inline_small_function_p (edge, true) |
1636 | && can_inline_edge_by_limits_p (edge, true)) | |
0aadd187 | 1637 | edge->aux = heap->insert (edge_badness (edge, false), edge); |
f8daee9b | 1638 | } |
1639 | } | |
1640 | ||
4d044066 | 1641 | /* Remove EDGE from the fibheap. */ |
1642 | ||
1643 | static void | |
1644 | heap_edge_removal_hook (struct cgraph_edge *e, void *data) | |
1645 | { | |
1646 | if (e->aux) | |
1647 | { | |
0aadd187 | 1648 | ((edge_heap_t *)data)->delete_node ((edge_heap_node_t *)e->aux); |
4d044066 | 1649 | e->aux = NULL; |
1650 | } | |
1651 | } | |
f8daee9b | 1652 | |
12d5ae9f | 1653 | /* Return true if speculation of edge E seems useful. |
1654 | If ANTICIPATE_INLINING is true, be conservative and hope that E | |
1655 | may get inlined. */ | |
1656 | ||
1657 | bool | |
1658 | speculation_useful_p (struct cgraph_edge *e, bool anticipate_inlining) | |
1659 | { | |
6d91ac76 | 1660 | /* If we have already decided to inline the edge, it seems useful. */ |
1661 | if (!e->inline_failed) | |
1662 | return true; | |
1663 | ||
12d5ae9f | 1664 | enum availability avail; |
fbcea800 | 1665 | struct cgraph_node *target = e->callee->ultimate_alias_target (&avail, |
1666 | e->caller); | |
12d5ae9f | 1667 | struct cgraph_edge *direct, *indirect; |
1668 | struct ipa_ref *ref; | |
1669 | ||
1670 | gcc_assert (e->speculative && !e->indirect_unknown_callee); | |
1671 | ||
35ee1c66 | 1672 | if (!e->maybe_hot_p ()) |
12d5ae9f | 1673 | return false; |
1674 | ||
1675 | /* See if IP optimizations found something potentially useful about the | |
1676 | function. For now we look only for CONST/PURE flags. Almost everything | |
1677 | else we propagate is useless. */ | |
1678 | if (avail >= AVAIL_AVAILABLE) | |
1679 | { | |
02774f2d | 1680 | int ecf_flags = flags_from_decl_or_type (target->decl); |
12d5ae9f | 1681 | if (ecf_flags & ECF_CONST) |
1682 | { | |
35ee1c66 | 1683 | e->speculative_call_info (direct, indirect, ref); |
12d5ae9f | 1684 | if (!(indirect->indirect_info->ecf_flags & ECF_CONST)) |
1685 | return true; | |
1686 | } | |
1687 | else if (ecf_flags & ECF_PURE) | |
1688 | { | |
35ee1c66 | 1689 | e->speculative_call_info (direct, indirect, ref); |
12d5ae9f | 1690 | if (!(indirect->indirect_info->ecf_flags & ECF_PURE)) |
1691 | return true; | |
1692 | } | |
1693 | } | |
1694 | /* If we did not managed to inline the function nor redirect | |
1695 | to an ipa-cp clone (that are seen by having local flag set), | |
1696 | it is probably pointless to inline it unless hardware is missing | |
1697 | indirect call predictor. */ | |
6d91ac76 | 1698 | if (!anticipate_inlining && !target->local.local) |
12d5ae9f | 1699 | return false; |
1700 | /* For overwritable targets there is not much to do. */ | |
6d91ac76 | 1701 | if (!can_inline_edge_p (e, false) |
1702 | || !can_inline_edge_by_limits_p (e, false, true)) | |
12d5ae9f | 1703 | return false; |
1704 | /* OK, speculation seems interesting. */ | |
1705 | return true; | |
1706 | } | |
1707 | ||
1708 | /* We know that EDGE is not going to be inlined. | |
1709 | See if we can remove speculation. */ | |
1710 | ||
1711 | static void | |
0aadd187 | 1712 | resolve_noninline_speculation (edge_heap_t *edge_heap, struct cgraph_edge *edge) |
12d5ae9f | 1713 | { |
1714 | if (edge->speculative && !speculation_useful_p (edge, false)) | |
1715 | { | |
1716 | struct cgraph_node *node = edge->caller; | |
1717 | struct cgraph_node *where = node->global.inlined_to | |
1718 | ? node->global.inlined_to : node; | |
035def86 | 1719 | auto_bitmap updated_nodes; |
12d5ae9f | 1720 | |
151b9ff5 | 1721 | if (edge->count.ipa ().initialized_p ()) |
1722 | spec_rem += edge->count.ipa (); | |
35ee1c66 | 1723 | edge->resolve_speculation (); |
12d5ae9f | 1724 | reset_edge_caches (where); |
1297cbcd | 1725 | ipa_update_overall_fn_summary (where); |
12d5ae9f | 1726 | update_caller_keys (edge_heap, where, |
1727 | updated_nodes, NULL); | |
4582129e | 1728 | update_callee_keys (edge_heap, where, |
1729 | updated_nodes); | |
12d5ae9f | 1730 | } |
1731 | } | |
1732 | ||
a6d60179 | 1733 | /* Return true if NODE should be accounted for overall size estimate. |
1734 | Skip all nodes optimized for size so we can measure the growth of hot | |
1735 | part of program no matter of the padding. */ | |
1736 | ||
1737 | bool | |
1738 | inline_account_function_p (struct cgraph_node *node) | |
1739 | { | |
1740 | return (!DECL_EXTERNAL (node->decl) | |
1741 | && !opt_for_fn (node->decl, optimize_size) | |
1742 | && node->frequency != NODE_FREQUENCY_UNLIKELY_EXECUTED); | |
1743 | } | |
1744 | ||
71e37927 | 1745 | /* Count number of callers of NODE and store it into DATA (that |
1746 | points to int. Worker for cgraph_for_node_and_aliases. */ | |
1747 | ||
1748 | static bool | |
1749 | sum_callers (struct cgraph_node *node, void *data) | |
1750 | { | |
1751 | struct cgraph_edge *e; | |
1752 | int *num_calls = (int *)data; | |
1753 | ||
1754 | for (e = node->callers; e; e = e->next_caller) | |
1755 | (*num_calls)++; | |
1756 | return false; | |
1757 | } | |
1758 | ||
d02f3bb1 | 1759 | /* We only propagate across edges with non-interposable callee. */ |
1760 | ||
1761 | inline bool | |
1762 | ignore_edge_p (struct cgraph_edge *e) | |
1763 | { | |
1764 | enum availability avail; | |
1765 | e->callee->function_or_virtual_thunk_symbol (&avail, e->caller); | |
1766 | return (avail <= AVAIL_INTERPOSABLE); | |
1767 | } | |
1768 | ||
65c1a668 | 1769 | /* We use greedy algorithm for inlining of small functions: |
4055a556 | 1770 | All inline candidates are put into prioritized heap ordered in |
1771 | increasing badness. | |
65c1a668 | 1772 | |
4055a556 | 1773 | The inlining of small functions is bounded by unit growth parameters. */ |
65c1a668 | 1774 | |
1775 | static void | |
4869c23f | 1776 | inline_small_functions (void) |
65c1a668 | 1777 | { |
1778 | struct cgraph_node *node; | |
a49506c7 | 1779 | struct cgraph_edge *edge; |
c1ffea07 | 1780 | edge_heap_t edge_heap (sreal::min ()); |
035def86 | 1781 | auto_bitmap updated_nodes; |
97343302 | 1782 | int min_size, max_size; |
415d1b9a | 1783 | auto_vec<cgraph_edge *> new_indirect_edges; |
4055a556 | 1784 | int initial_size = 0; |
35ee1c66 | 1785 | struct cgraph_node **order = XCNEWVEC (cgraph_node *, symtab->cgraph_count); |
4d044066 | 1786 | struct cgraph_edge_hook_list *edge_removal_hook_holder; |
d1f68cd8 | 1787 | new_indirect_edges.create (8); |
a49506c7 | 1788 | |
4d044066 | 1789 | edge_removal_hook_holder |
0aadd187 | 1790 | = symtab->add_edge_removal_hook (&heap_edge_removal_hook, &edge_heap); |
4d044066 | 1791 | |
d826e131 | 1792 | /* Compute overall unit size and other global parameters used by badness |
1793 | metrics. */ | |
65c1a668 | 1794 | |
db9cef39 | 1795 | max_count = profile_count::uninitialized (); |
d02f3bb1 | 1796 | ipa_reduced_postorder (order, true, ignore_edge_p); |
884d4e9c | 1797 | free (order); |
d826e131 | 1798 | |
91bf9d9a | 1799 | FOR_EACH_DEFINED_FUNCTION (node) |
1800 | if (!node->global.inlined_to) | |
cbd7f5a0 | 1801 | { |
a6d60179 | 1802 | if (!node->alias && node->analyzed |
5f4e4f36 | 1803 | && (node->has_gimple_body_p () || node->thunk.thunk_p) |
1804 | && opt_for_fn (node->decl, optimize)) | |
82626cb0 | 1805 | { |
2e966e2a | 1806 | class ipa_fn_summary *info = ipa_fn_summaries->get (node); |
02774f2d | 1807 | struct ipa_dfs_info *dfs = (struct ipa_dfs_info *) node->aux; |
65c1a668 | 1808 | |
57cc3349 | 1809 | /* Do not account external functions, they will be optimized out |
1810 | if not inlined. Also only count the non-cold portion of program. */ | |
a6d60179 | 1811 | if (inline_account_function_p (node)) |
82626cb0 | 1812 | initial_size += info->size; |
3172b7bf | 1813 | info->growth = estimate_growth (node); |
71e37927 | 1814 | |
1815 | int num_calls = 0; | |
1816 | node->call_for_symbol_and_aliases (sum_callers, &num_calls, | |
1817 | true); | |
1818 | if (num_calls == 1) | |
1819 | info->single_caller = true; | |
db2db13c | 1820 | if (dfs && dfs->next_cycle) |
1821 | { | |
1822 | struct cgraph_node *n2; | |
1823 | int id = dfs->scc_no + 1; | |
1824 | for (n2 = node; n2; | |
e0fc29fc | 1825 | n2 = ((struct ipa_dfs_info *) n2->aux)->next_cycle) |
5f4e4f36 | 1826 | if (opt_for_fn (n2->decl, optimize)) |
1827 | { | |
d2c2513e | 1828 | ipa_fn_summary *info2 = ipa_fn_summaries->get (n2); |
5f4e4f36 | 1829 | if (info2->scc_no) |
1830 | break; | |
1831 | info2->scc_no = id; | |
1832 | } | |
db2db13c | 1833 | } |
82626cb0 | 1834 | } |
4055a556 | 1835 | |
cbd7f5a0 | 1836 | for (edge = node->callers; edge; edge = edge->next_caller) |
151b9ff5 | 1837 | max_count = max_count.max (edge->count.ipa ()); |
cbd7f5a0 | 1838 | } |
41d39f38 | 1839 | ipa_free_postorder_info (); |
bc4e1286 | 1840 | edge_growth_cache |
1841 | = new call_summary<edge_growth_cache_entry *> (symtab, false); | |
41d39f38 | 1842 | |
1843 | if (dump_file) | |
1844 | fprintf (dump_file, | |
1845 | "\nDeciding on inlining of small functions. Starting with size %i.\n", | |
1846 | initial_size); | |
5c121ffe | 1847 | |
33b2724f | 1848 | overall_size = initial_size; |
97343302 | 1849 | max_size = compute_max_insns (overall_size); |
1850 | min_size = overall_size; | |
d826e131 | 1851 | |
8a8639b6 | 1852 | /* Populate the heap with all edges we might inline. */ |
d826e131 | 1853 | |
91bf9d9a | 1854 | FOR_EACH_DEFINED_FUNCTION (node) |
12d5ae9f | 1855 | { |
1856 | bool update = false; | |
fece9def | 1857 | struct cgraph_edge *next = NULL; |
e346cd98 | 1858 | bool has_speculative = false; |
d826e131 | 1859 | |
5f4e4f36 | 1860 | if (!opt_for_fn (node->decl, optimize)) |
1861 | continue; | |
1862 | ||
12d5ae9f | 1863 | if (dump_file) |
0e388735 | 1864 | fprintf (dump_file, "Enqueueing calls in %s.\n", node->dump_name ()); |
12d5ae9f | 1865 | |
1866 | for (edge = node->callees; edge; edge = next) | |
1867 | { | |
1868 | next = edge->next_callee; | |
d826e131 | 1869 | if (edge->inline_failed |
12d5ae9f | 1870 | && !edge->aux |
d826e131 | 1871 | && can_inline_edge_p (edge, true) |
1872 | && want_inline_small_function_p (edge, true) | |
1fa377f3 | 1873 | && can_inline_edge_by_limits_p (edge, true) |
d826e131 | 1874 | && edge->inline_failed) |
1875 | { | |
1876 | gcc_assert (!edge->aux); | |
0aadd187 | 1877 | update_edge_key (&edge_heap, edge); |
d826e131 | 1878 | } |
e346cd98 | 1879 | if (edge->speculative) |
1880 | has_speculative = true; | |
1881 | } | |
1882 | if (has_speculative) | |
1883 | for (edge = node->callees; edge; edge = next) | |
1884 | if (edge->speculative && !speculation_useful_p (edge, | |
1885 | edge->aux != NULL)) | |
12d5ae9f | 1886 | { |
35ee1c66 | 1887 | edge->resolve_speculation (); |
12d5ae9f | 1888 | update = true; |
1889 | } | |
12d5ae9f | 1890 | if (update) |
1891 | { | |
1892 | struct cgraph_node *where = node->global.inlined_to | |
1893 | ? node->global.inlined_to : node; | |
1297cbcd | 1894 | ipa_update_overall_fn_summary (where); |
12d5ae9f | 1895 | reset_edge_caches (where); |
0aadd187 | 1896 | update_caller_keys (&edge_heap, where, |
12d5ae9f | 1897 | updated_nodes, NULL); |
251346b0 | 1898 | update_callee_keys (&edge_heap, where, |
1899 | updated_nodes); | |
12d5ae9f | 1900 | bitmap_clear (updated_nodes); |
1901 | } | |
1902 | } | |
d826e131 | 1903 | |
4055a556 | 1904 | gcc_assert (in_lto_p |
db9cef39 | 1905 | || !(max_count > 0) |
4055a556 | 1906 | || (profile_info && flag_branch_probabilities)); |
5c121ffe | 1907 | |
0aadd187 | 1908 | while (!edge_heap.empty ()) |
65c1a668 | 1909 | { |
97343302 | 1910 | int old_size = overall_size; |
022b3380 | 1911 | struct cgraph_node *where, *callee; |
c1ffea07 | 1912 | sreal badness = edge_heap.min_key (); |
1913 | sreal current_badness; | |
022b3380 | 1914 | int growth; |
a49506c7 | 1915 | |
0aadd187 | 1916 | edge = edge_heap.extract_min (); |
022b3380 | 1917 | gcc_assert (edge->aux); |
1918 | edge->aux = NULL; | |
5a7ad253 | 1919 | if (!edge->inline_failed || !edge->callee->analyzed) |
022b3380 | 1920 | continue; |
854efde4 | 1921 | |
382ecba7 | 1922 | #if CHECKING_P |
151b9ff5 | 1923 | /* Be sure that caches are maintained consistent. |
1924 | This check is affected by scaling roundoff errors when compiling for | |
1925 | IPA this we skip it in that case. */ | |
ed0831a9 | 1926 | if (!edge->callee->count.ipa_p () |
1927 | && (!max_count.initialized_p () || !max_count.nonzero_p ())) | |
151b9ff5 | 1928 | { |
1929 | sreal cached_badness = edge_badness (edge, false); | |
1930 | ||
1931 | int old_size_est = estimate_edge_size (edge); | |
1932 | sreal old_time_est = estimate_edge_time (edge); | |
1933 | int old_hints_est = estimate_edge_hints (edge); | |
1934 | ||
bc4e1286 | 1935 | if (edge_growth_cache != NULL) |
1936 | edge_growth_cache->remove (edge); | |
151b9ff5 | 1937 | gcc_assert (old_size_est == estimate_edge_size (edge)); |
1938 | gcc_assert (old_time_est == estimate_edge_time (edge)); | |
1939 | /* FIXME: | |
1940 | ||
1941 | gcc_assert (old_hints_est == estimate_edge_hints (edge)); | |
1942 | ||
1943 | fails with profile feedback because some hints depends on | |
1944 | maybe_hot_edge_p predicate and because callee gets inlined to other | |
1945 | calls, the edge may become cold. | |
1946 | This ought to be fixed by computing relative probabilities | |
1947 | for given invocation but that will be better done once whole | |
1948 | code is converted to sreals. Disable for now and revert to "wrong" | |
1949 | value so enable/disable checking paths agree. */ | |
bc4e1286 | 1950 | edge_growth_cache->get (edge)->hints = old_hints_est + 1; |
151b9ff5 | 1951 | |
1952 | /* When updating the edge costs, we only decrease badness in the keys. | |
1953 | Increases of badness are handled lazilly; when we see key with out | |
1954 | of date value on it, we re-insert it now. */ | |
1955 | current_badness = edge_badness (edge, false); | |
1956 | gcc_assert (cached_badness == current_badness); | |
1957 | gcc_assert (current_badness >= badness); | |
1958 | } | |
5fc42733 | 1959 | else |
1960 | current_badness = edge_badness (edge, false); | |
d326c10c | 1961 | #else |
1962 | current_badness = edge_badness (edge, false); | |
1963 | #endif | |
854efde4 | 1964 | if (current_badness != badness) |
1965 | { | |
805e955d | 1966 | if (edge_heap.min () && current_badness > edge_heap.min_key ()) |
d326c10c | 1967 | { |
1968 | edge->aux = edge_heap.insert (current_badness, edge); | |
1969 | continue; | |
1970 | } | |
1971 | else | |
1972 | badness = current_badness; | |
854efde4 | 1973 | } |
4869c23f | 1974 | |
1fa377f3 | 1975 | if (!can_inline_edge_p (edge, true) |
1976 | || !can_inline_edge_by_limits_p (edge, true)) | |
12d5ae9f | 1977 | { |
0aadd187 | 1978 | resolve_noninline_speculation (&edge_heap, edge); |
12d5ae9f | 1979 | continue; |
1980 | } | |
854efde4 | 1981 | |
415d1b9a | 1982 | callee = edge->callee->ultimate_alias_target (); |
99c67f24 | 1983 | growth = estimate_edge_growth (edge); |
65c1a668 | 1984 | if (dump_file) |
65c1a668 | 1985 | { |
48e1416a | 1986 | fprintf (dump_file, |
0e388735 | 1987 | "\nConsidering %s with %i size\n", |
1988 | callee->dump_name (), | |
d2c2513e | 1989 | ipa_fn_summaries->get (callee)->size); |
48e1416a | 1990 | fprintf (dump_file, |
0e388735 | 1991 | " to be inlined into %s in %s:%i\n" |
d326c10c | 1992 | " Estimated badness is %f, frequency %.2f.\n", |
0e388735 | 1993 | edge->caller->dump_name (), |
a353d6b1 | 1994 | edge->call_stmt |
42acab1c | 1995 | && (LOCATION_LOCUS (gimple_location ((const gimple *) |
4abdcfcb | 1996 | edge->call_stmt)) |
1997 | > BUILTINS_LOCATION) | |
42acab1c | 1998 | ? gimple_filename ((const gimple *) edge->call_stmt) |
a353d6b1 | 1999 | : "unknown", |
2000 | edge->call_stmt | |
42acab1c | 2001 | ? gimple_lineno ((const gimple *) edge->call_stmt) |
a353d6b1 | 2002 | : -1, |
d326c10c | 2003 | badness.to_double (), |
003dce4b | 2004 | edge->sreal_frequency ().to_double ()); |
151b9ff5 | 2005 | if (edge->count.ipa ().initialized_p ()) |
db9cef39 | 2006 | { |
2007 | fprintf (dump_file, " Called "); | |
151b9ff5 | 2008 | edge->count.ipa ().dump (dump_file); |
ed0831a9 | 2009 | fprintf (dump_file, " times\n"); |
db9cef39 | 2010 | } |
022b3380 | 2011 | if (dump_flags & TDF_DETAILS) |
4869c23f | 2012 | edge_badness (edge, true); |
65c1a668 | 2013 | } |
2014 | ||
4869c23f | 2015 | if (overall_size + growth > max_size |
02774f2d | 2016 | && !DECL_DISREGARD_INLINE_LIMITS (callee->decl)) |
a49506c7 | 2017 | { |
4869c23f | 2018 | edge->inline_failed = CIF_INLINE_UNIT_GROWTH_LIMIT; |
2019 | report_inline_failed_reason (edge); | |
0aadd187 | 2020 | resolve_noninline_speculation (&edge_heap, edge); |
a49506c7 | 2021 | continue; |
2022 | } | |
4869c23f | 2023 | |
2024 | if (!want_inline_small_function_p (edge, true)) | |
12d5ae9f | 2025 | { |
0aadd187 | 2026 | resolve_noninline_speculation (&edge_heap, edge); |
12d5ae9f | 2027 | continue; |
2028 | } | |
4055a556 | 2029 | |
76184b40 | 2030 | /* Heuristics for inlining small functions work poorly for |
2031 | recursive calls where we do effects similar to loop unrolling. | |
2032 | When inlining such edge seems profitable, leave decision on | |
4055a556 | 2033 | specific inliner. */ |
35ee1c66 | 2034 | if (edge->recursive_p ()) |
a49506c7 | 2035 | { |
2036 | where = edge->caller; | |
2037 | if (where->global.inlined_to) | |
2038 | where = where->global.inlined_to; | |
4869c23f | 2039 | if (!recursive_inlining (edge, |
d1f68cd8 | 2040 | opt_for_fn (edge->caller->decl, |
2041 | flag_indirect_inlining) | |
4869c23f | 2042 | ? &new_indirect_edges : NULL)) |
17c205c9 | 2043 | { |
2044 | edge->inline_failed = CIF_RECURSIVE_INLINING; | |
0aadd187 | 2045 | resolve_noninline_speculation (&edge_heap, edge); |
17c205c9 | 2046 | continue; |
2047 | } | |
ba5b0608 | 2048 | reset_edge_caches (where); |
4055a556 | 2049 | /* Recursive inliner inlines all recursive calls of the function |
2050 | at once. Consequently we need to update all callee keys. */ | |
d1f68cd8 | 2051 | if (opt_for_fn (edge->caller->decl, flag_indirect_inlining)) |
0aadd187 | 2052 | add_new_edges_to_heap (&edge_heap, new_indirect_edges); |
2053 | update_callee_keys (&edge_heap, where, updated_nodes); | |
12d5ae9f | 2054 | bitmap_clear (updated_nodes); |
a49506c7 | 2055 | } |
2056 | else | |
2057 | { | |
4869c23f | 2058 | struct cgraph_node *outer_node = NULL; |
2059 | int depth = 0; | |
2060 | ||
76184b40 | 2061 | /* Consider the case where self recursive function A is inlined |
2062 | into B. This is desired optimization in some cases, since it | |
2063 | leads to effect similar of loop peeling and we might completely | |
2064 | optimize out the recursive call. However we must be extra | |
2065 | selective. */ | |
4869c23f | 2066 | |
2067 | where = edge->caller; | |
2068 | while (where->global.inlined_to) | |
a49506c7 | 2069 | { |
02774f2d | 2070 | if (where->decl == callee->decl) |
4869c23f | 2071 | outer_node = where, depth++; |
2072 | where = where->callers->caller; | |
2073 | } | |
2074 | if (outer_node | |
2075 | && !want_inline_self_recursive_call_p (edge, outer_node, | |
2076 | true, depth)) | |
2077 | { | |
2078 | edge->inline_failed | |
02774f2d | 2079 | = (DECL_DISREGARD_INLINE_LIMITS (edge->callee->decl) |
4869c23f | 2080 | ? CIF_RECURSIVE_INLINING : CIF_UNSPECIFIED); |
0aadd187 | 2081 | resolve_noninline_speculation (&edge_heap, edge); |
a49506c7 | 2082 | continue; |
2083 | } | |
4869c23f | 2084 | else if (depth && dump_file) |
2085 | fprintf (dump_file, " Peeling recursion with depth %i\n", depth); | |
2086 | ||
9f3c2a90 | 2087 | gcc_checking_assert (!callee->global.inlined_to); |
6331b6fa | 2088 | inline_call (edge, true, &new_indirect_edges, &overall_size, true); |
d1f68cd8 | 2089 | add_new_edges_to_heap (&edge_heap, new_indirect_edges); |
3f2ff969 | 2090 | |
87235431 | 2091 | reset_edge_caches (edge->callee); |
ba5b0608 | 2092 | |
0aadd187 | 2093 | update_callee_keys (&edge_heap, where, updated_nodes); |
a49506c7 | 2094 | } |
2095 | where = edge->caller; | |
2096 | if (where->global.inlined_to) | |
2097 | where = where->global.inlined_to; | |
2098 | ||
2099 | /* Our profitability metric can depend on local properties | |
2100 | such as number of inlinable calls and size of the function body. | |
2101 | After inlining these properties might change for the function we | |
2102 | inlined into (since it's body size changed) and for the functions | |
2103 | called by function we inlined (since number of it inlinable callers | |
2104 | might change). */ | |
0aadd187 | 2105 | update_caller_keys (&edge_heap, where, updated_nodes, NULL); |
1d77f63b | 2106 | /* Offline copy count has possibly changed, recompute if profile is |
2107 | available. */ | |
bb173647 | 2108 | struct cgraph_node *n = cgraph_node::get (edge->callee->decl); |
2109 | if (n != edge->callee && n->analyzed && n->count.ipa ().initialized_p ()) | |
2110 | update_callee_keys (&edge_heap, n, updated_nodes); | |
a49506c7 | 2111 | bitmap_clear (updated_nodes); |
65c1a668 | 2112 | |
7261dbb3 | 2113 | if (dump_enabled_p ()) |
71cadde7 | 2114 | { |
d2c2513e | 2115 | ipa_fn_summary *s = ipa_fn_summaries->get (edge->caller); |
7261dbb3 | 2116 | |
2117 | /* dump_printf can't handle %+i. */ | |
2118 | char buf_net_change[100]; | |
2119 | snprintf (buf_net_change, sizeof buf_net_change, "%+i", | |
2120 | overall_size - old_size); | |
2121 | ||
2122 | dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, edge->call_stmt, | |
2123 | " Inlined %C into %C which now has time %f and " | |
2124 | "size %i, net change of %s.\n", | |
2125 | edge->callee, edge->caller, | |
2126 | s->time.to_double (), s->size, buf_net_change); | |
71cadde7 | 2127 | } |
97343302 | 2128 | if (min_size > overall_size) |
5c121ffe | 2129 | { |
97343302 | 2130 | min_size = overall_size; |
2131 | max_size = compute_max_insns (min_size); | |
5c121ffe | 2132 | |
2133 | if (dump_file) | |
97343302 | 2134 | fprintf (dump_file, "New minimal size reached: %i\n", min_size); |
5c121ffe | 2135 | } |
65c1a668 | 2136 | } |
f8daee9b | 2137 | |
a41f2a28 | 2138 | free_growth_caches (); |
7261dbb3 | 2139 | if (dump_enabled_p ()) |
2140 | dump_printf (MSG_NOTE, | |
2141 | "Unit growth for small function inlining: %i->%i (%i%%)\n", | |
2142 | initial_size, overall_size, | |
2143 | initial_size ? overall_size * 100 / (initial_size) - 100: 0); | |
35ee1c66 | 2144 | symtab->remove_edge_removal_hook (edge_removal_hook_holder); |
65c1a668 | 2145 | } |
2146 | ||
4055a556 | 2147 | /* Flatten NODE. Performed both during early inlining and |
2148 | at IPA inlining time. */ | |
d160af41 | 2149 | |
2150 | static void | |
c3bffd9b | 2151 | flatten_function (struct cgraph_node *node, bool early, bool update) |
d160af41 | 2152 | { |
2153 | struct cgraph_edge *e; | |
2154 | ||
2155 | /* We shouldn't be called recursively when we are being processed. */ | |
02774f2d | 2156 | gcc_assert (node->aux == NULL); |
d160af41 | 2157 | |
02774f2d | 2158 | node->aux = (void *) node; |
d160af41 | 2159 | |
2160 | for (e = node->callees; e; e = e->next_callee) | |
2161 | { | |
2162 | struct cgraph_node *orig_callee; | |
415d1b9a | 2163 | struct cgraph_node *callee = e->callee->ultimate_alias_target (); |
d160af41 | 2164 | |
d160af41 | 2165 | /* We've hit cycle? It is time to give up. */ |
02774f2d | 2166 | if (callee->aux) |
d160af41 | 2167 | { |
7261dbb3 | 2168 | if (dump_enabled_p ()) |
2169 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, e->call_stmt, | |
2170 | "Not inlining %C into %C to avoid cycle.\n", | |
2171 | callee, e->caller); | |
f0b6455e | 2172 | if (cgraph_inline_failed_type (e->inline_failed) != CIF_FINAL_ERROR) |
2173 | e->inline_failed = CIF_RECURSIVE_INLINING; | |
d160af41 | 2174 | continue; |
2175 | } | |
2176 | ||
2177 | /* When the edge is already inlined, we just need to recurse into | |
2178 | it in order to fully flatten the leaves. */ | |
2179 | if (!e->inline_failed) | |
2180 | { | |
c3bffd9b | 2181 | flatten_function (callee, early, false); |
d160af41 | 2182 | continue; |
2183 | } | |
2184 | ||
4869c23f | 2185 | /* Flatten attribute needs to be processed during late inlining. For |
2186 | extra code quality we however do flattening during early optimization, | |
2187 | too. */ | |
a41f2a28 | 2188 | if (!early |
4869c23f | 2189 | ? !can_inline_edge_p (e, true) |
1fa377f3 | 2190 | && !can_inline_edge_by_limits_p (e, true) |
4869c23f | 2191 | : !can_early_inline_edge_p (e)) |
2192 | continue; | |
2193 | ||
35ee1c66 | 2194 | if (e->recursive_p ()) |
d160af41 | 2195 | { |
7261dbb3 | 2196 | if (dump_enabled_p ()) |
2197 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, e->call_stmt, | |
2198 | "Not inlining: recursive call.\n"); | |
d160af41 | 2199 | continue; |
2200 | } | |
2201 | ||
02774f2d | 2202 | if (gimple_in_ssa_p (DECL_STRUCT_FUNCTION (node->decl)) |
2203 | != gimple_in_ssa_p (DECL_STRUCT_FUNCTION (callee->decl))) | |
ae576fce | 2204 | { |
7261dbb3 | 2205 | if (dump_enabled_p ()) |
2206 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, e->call_stmt, | |
2207 | "Not inlining: SSA form does not match.\n"); | |
ae576fce | 2208 | continue; |
2209 | } | |
2210 | ||
d160af41 | 2211 | /* Inline the edge and flatten the inline clone. Avoid |
2212 | recursing through the original node if the node was cloned. */ | |
7261dbb3 | 2213 | if (dump_enabled_p ()) |
2214 | dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, e->call_stmt, | |
2215 | " Inlining %C into %C.\n", | |
2216 | callee, e->caller); | |
82626cb0 | 2217 | orig_callee = callee; |
6331b6fa | 2218 | inline_call (e, true, NULL, NULL, false); |
d160af41 | 2219 | if (e->callee != orig_callee) |
02774f2d | 2220 | orig_callee->aux = (void *) node; |
c3bffd9b | 2221 | flatten_function (e->callee, early, false); |
d160af41 | 2222 | if (e->callee != orig_callee) |
02774f2d | 2223 | orig_callee->aux = NULL; |
d160af41 | 2224 | } |
2225 | ||
02774f2d | 2226 | node->aux = NULL; |
c3bffd9b | 2227 | if (update) |
2228 | ipa_update_overall_fn_summary (node->global.inlined_to | |
2229 | ? node->global.inlined_to : node); | |
d160af41 | 2230 | } |
2231 | ||
ba3a929e | 2232 | /* Inline NODE to all callers. Worker for cgraph_for_node_and_aliases. |
2233 | DATA points to number of calls originally found so we avoid infinite | |
2234 | recursion. */ | |
2235 | ||
2236 | static bool | |
6ec9c8c5 | 2237 | inline_to_all_callers_1 (struct cgraph_node *node, void *data, |
2238 | hash_set<cgraph_node *> *callers) | |
ba3a929e | 2239 | { |
2240 | int *num_calls = (int *)data; | |
7c5c01f1 | 2241 | bool callee_removed = false; |
2242 | ||
ba3a929e | 2243 | while (node->callers && !node->global.inlined_to) |
2244 | { | |
2245 | struct cgraph_node *caller = node->callers->caller; | |
2246 | ||
9dcc8702 | 2247 | if (!can_inline_edge_p (node->callers, true) |
1fa377f3 | 2248 | || !can_inline_edge_by_limits_p (node->callers, true) |
9dcc8702 | 2249 | || node->callers->recursive_p ()) |
2250 | { | |
2251 | if (dump_file) | |
2252 | fprintf (dump_file, "Uninlinable call found; giving up.\n"); | |
2253 | *num_calls = 0; | |
2254 | return false; | |
2255 | } | |
2256 | ||
ba3a929e | 2257 | if (dump_file) |
2258 | { | |
6e849d0e | 2259 | cgraph_node *ultimate = node->ultimate_alias_target (); |
ba3a929e | 2260 | fprintf (dump_file, |
2261 | "\nInlining %s size %i.\n", | |
6e849d0e | 2262 | ultimate->name (), |
2263 | ipa_fn_summaries->get (ultimate)->size); | |
ba3a929e | 2264 | fprintf (dump_file, |
2265 | " Called once from %s %i insns.\n", | |
f1c8b4d7 | 2266 | node->callers->caller->name (), |
d2c2513e | 2267 | ipa_fn_summaries->get (node->callers->caller)->size); |
ba3a929e | 2268 | } |
2269 | ||
6ec9c8c5 | 2270 | /* Remember which callers we inlined to, delaying updating the |
2271 | overall summary. */ | |
2272 | callers->add (node->callers->caller); | |
2273 | inline_call (node->callers, true, NULL, NULL, false, &callee_removed); | |
ba3a929e | 2274 | if (dump_file) |
2275 | fprintf (dump_file, | |
2276 | " Inlined into %s which now has %i size\n", | |
f1c8b4d7 | 2277 | caller->name (), |
d2c2513e | 2278 | ipa_fn_summaries->get (caller)->size); |
ba3a929e | 2279 | if (!(*num_calls)--) |
2280 | { | |
2281 | if (dump_file) | |
2282 | fprintf (dump_file, "New calls found; giving up.\n"); | |
7c5c01f1 | 2283 | return callee_removed; |
ba3a929e | 2284 | } |
7c5c01f1 | 2285 | if (callee_removed) |
2286 | return true; | |
ba3a929e | 2287 | } |
2288 | return false; | |
2289 | } | |
2290 | ||
6ec9c8c5 | 2291 | /* Wrapper around inline_to_all_callers_1 doing delayed overall summary |
2292 | update. */ | |
2293 | ||
2294 | static bool | |
2295 | inline_to_all_callers (struct cgraph_node *node, void *data) | |
2296 | { | |
2297 | hash_set<cgraph_node *> callers; | |
2298 | bool res = inline_to_all_callers_1 (node, data, &callers); | |
2299 | /* Perform the delayed update of the overall summary of all callers | |
2300 | processed. This avoids quadratic behavior in the cases where | |
2301 | we have a lot of calls to the same function. */ | |
2302 | for (hash_set<cgraph_node *>::iterator i = callers.begin (); | |
2303 | i != callers.end (); ++i) | |
1297cbcd | 2304 | ipa_update_overall_fn_summary (*i); |
6ec9c8c5 | 2305 | return res; |
2306 | } | |
2307 | ||
b10aade1 | 2308 | /* Output overall time estimate. */ |
2309 | static void | |
2310 | dump_overall_stats (void) | |
2311 | { | |
2e211986 | 2312 | sreal sum_weighted = 0, sum = 0; |
b10aade1 | 2313 | struct cgraph_node *node; |
2314 | ||
2315 | FOR_EACH_DEFINED_FUNCTION (node) | |
2316 | if (!node->global.inlined_to | |
2317 | && !node->alias) | |
2318 | { | |
d2c2513e | 2319 | ipa_fn_summary *s = ipa_fn_summaries->get (node); |
2320 | if (s != NULL) | |
2321 | { | |
2322 | sum += s->time; | |
2323 | if (node->count.ipa ().initialized_p ()) | |
2324 | sum_weighted += s->time * node->count.ipa ().to_gcov_type (); | |
2325 | } | |
b10aade1 | 2326 | } |
2327 | fprintf (dump_file, "Overall time estimate: " | |
2e211986 | 2328 | "%f weighted by profile: " |
2329 | "%f\n", sum.to_double (), sum_weighted.to_double ()); | |
b10aade1 | 2330 | } |
2331 | ||
2332 | /* Output some useful stats about inlining. */ | |
2333 | ||
2334 | static void | |
2335 | dump_inline_stats (void) | |
2336 | { | |
3a4303e7 | 2337 | int64_t inlined_cnt = 0, inlined_indir_cnt = 0; |
2338 | int64_t inlined_virt_cnt = 0, inlined_virt_indir_cnt = 0; | |
2339 | int64_t noninlined_cnt = 0, noninlined_indir_cnt = 0; | |
2340 | int64_t noninlined_virt_cnt = 0, noninlined_virt_indir_cnt = 0; | |
2341 | int64_t inlined_speculative = 0, inlined_speculative_ply = 0; | |
2342 | int64_t indirect_poly_cnt = 0, indirect_cnt = 0; | |
bb173647 | 2343 | int64_t reason[CIF_N_REASONS][2]; |
2344 | sreal reason_freq[CIF_N_REASONS]; | |
b10aade1 | 2345 | int i; |
2346 | struct cgraph_node *node; | |
2347 | ||
2348 | memset (reason, 0, sizeof (reason)); | |
bb173647 | 2349 | for (i=0; i < CIF_N_REASONS; i++) |
2350 | reason_freq[i] = 0; | |
b10aade1 | 2351 | FOR_EACH_DEFINED_FUNCTION (node) |
2352 | { | |
2353 | struct cgraph_edge *e; | |
2354 | for (e = node->callees; e; e = e->next_callee) | |
2355 | { | |
2356 | if (e->inline_failed) | |
2357 | { | |
151b9ff5 | 2358 | if (e->count.ipa ().initialized_p ()) |
2359 | reason[(int) e->inline_failed][0] += e->count.ipa ().to_gcov_type (); | |
bb173647 | 2360 | reason_freq[(int) e->inline_failed] += e->sreal_frequency (); |
2361 | reason[(int) e->inline_failed][1] ++; | |
db9cef39 | 2362 | if (DECL_VIRTUAL_P (e->callee->decl) |
151b9ff5 | 2363 | && e->count.ipa ().initialized_p ()) |
b10aade1 | 2364 | { |
2365 | if (e->indirect_inlining_edge) | |
151b9ff5 | 2366 | noninlined_virt_indir_cnt += e->count.ipa ().to_gcov_type (); |
b10aade1 | 2367 | else |
151b9ff5 | 2368 | noninlined_virt_cnt += e->count.ipa ().to_gcov_type (); |
b10aade1 | 2369 | } |
151b9ff5 | 2370 | else if (e->count.ipa ().initialized_p ()) |
b10aade1 | 2371 | { |
2372 | if (e->indirect_inlining_edge) | |
151b9ff5 | 2373 | noninlined_indir_cnt += e->count.ipa ().to_gcov_type (); |
b10aade1 | 2374 | else |
151b9ff5 | 2375 | noninlined_cnt += e->count.ipa ().to_gcov_type (); |
b10aade1 | 2376 | } |
2377 | } | |
151b9ff5 | 2378 | else if (e->count.ipa ().initialized_p ()) |
b10aade1 | 2379 | { |
2380 | if (e->speculative) | |
2381 | { | |
2382 | if (DECL_VIRTUAL_P (e->callee->decl)) | |
151b9ff5 | 2383 | inlined_speculative_ply += e->count.ipa ().to_gcov_type (); |
b10aade1 | 2384 | else |
151b9ff5 | 2385 | inlined_speculative += e->count.ipa ().to_gcov_type (); |
b10aade1 | 2386 | } |
2387 | else if (DECL_VIRTUAL_P (e->callee->decl)) | |
2388 | { | |
2389 | if (e->indirect_inlining_edge) | |
151b9ff5 | 2390 | inlined_virt_indir_cnt += e->count.ipa ().to_gcov_type (); |
b10aade1 | 2391 | else |
151b9ff5 | 2392 | inlined_virt_cnt += e->count.ipa ().to_gcov_type (); |
b10aade1 | 2393 | } |
2394 | else | |
2395 | { | |
2396 | if (e->indirect_inlining_edge) | |
151b9ff5 | 2397 | inlined_indir_cnt += e->count.ipa ().to_gcov_type (); |
b10aade1 | 2398 | else |
151b9ff5 | 2399 | inlined_cnt += e->count.ipa ().to_gcov_type (); |
b10aade1 | 2400 | } |
2401 | } | |
2402 | } | |
2403 | for (e = node->indirect_calls; e; e = e->next_callee) | |
db9cef39 | 2404 | if (e->indirect_info->polymorphic |
151b9ff5 | 2405 | & e->count.ipa ().initialized_p ()) |
2406 | indirect_poly_cnt += e->count.ipa ().to_gcov_type (); | |
2407 | else if (e->count.ipa ().initialized_p ()) | |
2408 | indirect_cnt += e->count.ipa ().to_gcov_type (); | |
b10aade1 | 2409 | } |
db9cef39 | 2410 | if (max_count.initialized_p ()) |
b10aade1 | 2411 | { |
2412 | fprintf (dump_file, | |
f03df321 | 2413 | "Inlined %" PRId64 " + speculative " |
2414 | "%" PRId64 " + speculative polymorphic " | |
2415 | "%" PRId64 " + previously indirect " | |
2416 | "%" PRId64 " + virtual " | |
2417 | "%" PRId64 " + virtual and previously indirect " | |
2418 | "%" PRId64 "\n" "Not inlined " | |
2419 | "%" PRId64 " + previously indirect " | |
2420 | "%" PRId64 " + virtual " | |
2421 | "%" PRId64 " + virtual and previously indirect " | |
2422 | "%" PRId64 " + stil indirect " | |
2423 | "%" PRId64 " + still indirect polymorphic " | |
2424 | "%" PRId64 "\n", inlined_cnt, | |
b10aade1 | 2425 | inlined_speculative, inlined_speculative_ply, |
2426 | inlined_indir_cnt, inlined_virt_cnt, inlined_virt_indir_cnt, | |
2427 | noninlined_cnt, noninlined_indir_cnt, noninlined_virt_cnt, | |
2428 | noninlined_virt_indir_cnt, indirect_cnt, indirect_poly_cnt); | |
db9cef39 | 2429 | fprintf (dump_file, "Removed speculations "); |
2430 | spec_rem.dump (dump_file); | |
2431 | fprintf (dump_file, "\n"); | |
b10aade1 | 2432 | } |
2433 | dump_overall_stats (); | |
2434 | fprintf (dump_file, "\nWhy inlining failed?\n"); | |
2435 | for (i = 0; i < CIF_N_REASONS; i++) | |
bb173647 | 2436 | if (reason[i][1]) |
2437 | fprintf (dump_file, "%-50s: %8i calls, %8f freq, %" PRId64" count\n", | |
b10aade1 | 2438 | cgraph_inline_failed_string ((cgraph_inline_failed_t) i), |
bb173647 | 2439 | (int) reason[i][1], reason_freq[i].to_double (), reason[i][0]); |
b10aade1 | 2440 | } |
2441 | ||
0255544d | 2442 | /* Called when node is removed. */ |
2443 | ||
2444 | static void | |
2445 | flatten_remove_node_hook (struct cgraph_node *node, void *data) | |
2446 | { | |
2447 | if (lookup_attribute ("flatten", DECL_ATTRIBUTES (node->decl)) == NULL) | |
2448 | return; | |
2449 | ||
2450 | hash_set<struct cgraph_node *> *removed | |
2451 | = (hash_set<struct cgraph_node *> *) data; | |
2452 | removed->add (node); | |
2453 | } | |
2454 | ||
65c1a668 | 2455 | /* Decide on the inlining. We do so in the topological order to avoid |
2456 | expenses on updating data structures. */ | |
2457 | ||
2a1990e9 | 2458 | static unsigned int |
4869c23f | 2459 | ipa_inline (void) |
65c1a668 | 2460 | { |
2461 | struct cgraph_node *node; | |
2462 | int nnodes; | |
a59d2969 | 2463 | struct cgraph_node **order; |
0255544d | 2464 | int i, j; |
12d5ae9f | 2465 | int cold; |
2fe870c5 | 2466 | bool remove_functions = false; |
2467 | ||
35ee1c66 | 2468 | order = XCNEWVEC (struct cgraph_node *, symtab->cgraph_count); |
a59d2969 | 2469 | |
c7b2cc59 | 2470 | if (dump_file) |
1297cbcd | 2471 | ipa_dump_fn_summaries (dump_file); |
a49506c7 | 2472 | |
7771d558 | 2473 | nnodes = ipa_reverse_postorder (order); |
205ce1aa | 2474 | spec_rem = profile_count::zero (); |
65c1a668 | 2475 | |
7c455d87 | 2476 | FOR_EACH_FUNCTION (node) |
0f3771a4 | 2477 | { |
2478 | node->aux = 0; | |
2479 | ||
2480 | /* Recompute the default reasons for inlining because they may have | |
2481 | changed during merging. */ | |
2482 | if (in_lto_p) | |
2483 | { | |
2484 | for (cgraph_edge *e = node->callees; e; e = e->next_callee) | |
2485 | { | |
2486 | gcc_assert (e->inline_failed); | |
2487 | initialize_inline_failed (e); | |
2488 | } | |
2489 | for (cgraph_edge *e = node->indirect_calls; e; e = e->next_callee) | |
2490 | initialize_inline_failed (e); | |
2491 | } | |
2492 | } | |
65c1a668 | 2493 | |
2494 | if (dump_file) | |
d160af41 | 2495 | fprintf (dump_file, "\nFlattening functions:\n"); |
65c1a668 | 2496 | |
0255544d | 2497 | /* First shrink order array, so that it only contains nodes with |
2498 | flatten attribute. */ | |
2499 | for (i = nnodes - 1, j = i; i >= 0; i--) | |
2500 | { | |
2501 | node = order[i]; | |
2502 | if (lookup_attribute ("flatten", | |
2503 | DECL_ATTRIBUTES (node->decl)) != NULL) | |
2504 | order[j--] = order[i]; | |
2505 | } | |
2506 | ||
2507 | /* After the above loop, order[j + 1] ... order[nnodes - 1] contain | |
2508 | nodes with flatten attribute. If there is more than one such | |
2509 | node, we need to register a node removal hook, as flatten_function | |
2510 | could remove other nodes with flatten attribute. See PR82801. */ | |
2511 | struct cgraph_node_hook_list *node_removal_hook_holder = NULL; | |
2512 | hash_set<struct cgraph_node *> *flatten_removed_nodes = NULL; | |
2513 | if (j < nnodes - 2) | |
2514 | { | |
2515 | flatten_removed_nodes = new hash_set<struct cgraph_node *>; | |
2516 | node_removal_hook_holder | |
2517 | = symtab->add_cgraph_removal_hook (&flatten_remove_node_hook, | |
2518 | flatten_removed_nodes); | |
2519 | } | |
2520 | ||
d160af41 | 2521 | /* In the first pass handle functions to be flattened. Do this with |
2522 | a priority so none of our later choices will make this impossible. */ | |
0255544d | 2523 | for (i = nnodes - 1; i > j; i--) |
65c1a668 | 2524 | { |
d160af41 | 2525 | node = order[i]; |
0255544d | 2526 | if (flatten_removed_nodes |
2527 | && flatten_removed_nodes->contains (node)) | |
2528 | continue; | |
d160af41 | 2529 | |
4055a556 | 2530 | /* Handle nodes to be flattened. |
d160af41 | 2531 | Ideally when processing callees we stop inlining at the |
2532 | entry of cycles, possibly cloning that entry point and | |
2533 | try to flatten itself turning it into a self-recursive | |
2534 | function. */ | |
0255544d | 2535 | if (dump_file) |
2536 | fprintf (dump_file, "Flattening %s\n", node->name ()); | |
c3bffd9b | 2537 | flatten_function (node, false, true); |
0255544d | 2538 | } |
2539 | ||
2540 | if (j < nnodes - 2) | |
2541 | { | |
2542 | symtab->remove_cgraph_removal_hook (node_removal_hook_holder); | |
2543 | delete flatten_removed_nodes; | |
65c1a668 | 2544 | } |
0255544d | 2545 | free (order); |
2546 | ||
b10aade1 | 2547 | if (dump_file) |
2548 | dump_overall_stats (); | |
65c1a668 | 2549 | |
4869c23f | 2550 | inline_small_functions (); |
15ca8f90 | 2551 | |
366970c6 | 2552 | gcc_assert (symtab->state == IPA_SSA); |
2553 | symtab->state = IPA_SSA_AFTER_INLINING; | |
2554 | /* Do first after-inlining removal. We want to remove all "stale" extern | |
2555 | inline functions and virtual functions so we really know what is called | |
2556 | once. */ | |
2557 | symtab->remove_unreachable_nodes (dump_file); | |
65c1a668 | 2558 | |
17b13a59 | 2559 | /* Inline functions with a property that after inlining into all callers the |
2560 | code size will shrink because the out-of-line copy is eliminated. | |
2561 | We do this regardless on the callee size as long as function growth limits | |
2562 | are met. */ | |
12d5ae9f | 2563 | if (dump_file) |
2564 | fprintf (dump_file, | |
366970c6 | 2565 | "\nDeciding on functions to be inlined into all callers and " |
2566 | "removing useless speculations:\n"); | |
12d5ae9f | 2567 | |
2568 | /* Inlining one function called once has good chance of preventing | |
2569 | inlining other function into the same callee. Ideally we should | |
2570 | work in priority order, but probably inlining hot functions first | |
2571 | is good cut without the extra pain of maintaining the queue. | |
2572 | ||
2573 | ??? this is not really fitting the bill perfectly: inlining function | |
2574 | into callee often leads to better optimization of callee due to | |
2575 | increased context for optimization. | |
2576 | For example if main() function calls a function that outputs help | |
2577 | and then function that does the main optmization, we should inline | |
2578 | the second with priority even if both calls are cold by themselves. | |
2579 | ||
2580 | We probably want to implement new predicate replacing our use of | |
2581 | maybe_hot_edge interpreted as maybe_hot_edge || callee is known | |
2582 | to be hot. */ | |
2583 | for (cold = 0; cold <= 1; cold ++) | |
f1aa280c | 2584 | { |
12d5ae9f | 2585 | FOR_EACH_DEFINED_FUNCTION (node) |
65c1a668 | 2586 | { |
12d5ae9f | 2587 | struct cgraph_edge *edge, *next; |
2588 | bool update=false; | |
2589 | ||
5f4e4f36 | 2590 | if (!opt_for_fn (node->decl, optimize) |
2591 | || !opt_for_fn (node->decl, flag_inline_functions_called_once)) | |
2592 | continue; | |
2593 | ||
12d5ae9f | 2594 | for (edge = node->callees; edge; edge = next) |
65c1a668 | 2595 | { |
12d5ae9f | 2596 | next = edge->next_callee; |
2597 | if (edge->speculative && !speculation_useful_p (edge, false)) | |
bf92ac4d | 2598 | { |
151b9ff5 | 2599 | if (edge->count.ipa ().initialized_p ()) |
2600 | spec_rem += edge->count.ipa (); | |
35ee1c66 | 2601 | edge->resolve_speculation (); |
12d5ae9f | 2602 | update = true; |
2fe870c5 | 2603 | remove_functions = true; |
12d5ae9f | 2604 | } |
2605 | } | |
2606 | if (update) | |
2607 | { | |
2608 | struct cgraph_node *where = node->global.inlined_to | |
2609 | ? node->global.inlined_to : node; | |
12d5ae9f | 2610 | reset_edge_caches (where); |
1297cbcd | 2611 | ipa_update_overall_fn_summary (where); |
12d5ae9f | 2612 | } |
d1f68cd8 | 2613 | if (want_inline_function_to_all_callers_p (node, cold)) |
12d5ae9f | 2614 | { |
2615 | int num_calls = 0; | |
7feaa33e | 2616 | node->call_for_symbol_and_aliases (sum_callers, &num_calls, |
2617 | true); | |
2618 | while (node->call_for_symbol_and_aliases | |
366970c6 | 2619 | (inline_to_all_callers, &num_calls, true)) |
7c5c01f1 | 2620 | ; |
e8f06ac1 | 2621 | remove_functions = true; |
65c1a668 | 2622 | } |
2623 | } | |
2624 | } | |
2625 | ||
3f2ff969 | 2626 | /* Free ipa-prop structures if they are no longer needed. */ |
5f4e4f36 | 2627 | ipa_free_all_structures_after_iinln (); |
3f2ff969 | 2628 | |
7261dbb3 | 2629 | if (dump_enabled_p ()) |
2630 | dump_printf (MSG_NOTE, | |
2631 | "\nInlined %i calls, eliminated %i functions\n\n", | |
2632 | ncalls_inlined, nfunctions_inlined); | |
65c1a668 | 2633 | if (dump_file) |
7261dbb3 | 2634 | dump_inline_stats (); |
4055a556 | 2635 | |
0835ad03 | 2636 | if (dump_file) |
1297cbcd | 2637 | ipa_dump_fn_summaries (dump_file); |
2fe870c5 | 2638 | return remove_functions ? TODO_remove_functions : 0; |
65c1a668 | 2639 | } |
2640 | ||
cd800728 | 2641 | /* Inline always-inline function calls in NODE. */ |
2642 | ||
2643 | static bool | |
4869c23f | 2644 | inline_always_inline_functions (struct cgraph_node *node) |
cd800728 | 2645 | { |
2646 | struct cgraph_edge *e; | |
2647 | bool inlined = false; | |
2648 | ||
2649 | for (e = node->callees; e; e = e->next_callee) | |
2650 | { | |
415d1b9a | 2651 | struct cgraph_node *callee = e->callee->ultimate_alias_target (); |
02774f2d | 2652 | if (!DECL_DISREGARD_INLINE_LIMITS (callee->decl)) |
cd800728 | 2653 | continue; |
2654 | ||
35ee1c66 | 2655 | if (e->recursive_p ()) |
cd800728 | 2656 | { |
7261dbb3 | 2657 | if (dump_enabled_p ()) |
2658 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, e->call_stmt, | |
2659 | " Not inlining recursive call to %C.\n", | |
2660 | e->callee); | |
cd800728 | 2661 | e->inline_failed = CIF_RECURSIVE_INLINING; |
2662 | continue; | |
2663 | } | |
2664 | ||
4869c23f | 2665 | if (!can_early_inline_edge_p (e)) |
3bc4161a | 2666 | { |
2667 | /* Set inlined to true if the callee is marked "always_inline" but | |
2668 | is not inlinable. This will allow flagging an error later in | |
2669 | expand_call_inline in tree-inline.c. */ | |
2670 | if (lookup_attribute ("always_inline", | |
02774f2d | 2671 | DECL_ATTRIBUTES (callee->decl)) != NULL) |
3bc4161a | 2672 | inlined = true; |
2673 | continue; | |
2674 | } | |
cd800728 | 2675 | |
7261dbb3 | 2676 | if (dump_enabled_p ()) |
2677 | dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, e->call_stmt, | |
2678 | " Inlining %C into %C (always_inline).\n", | |
2679 | e->callee, e->caller); | |
6331b6fa | 2680 | inline_call (e, true, NULL, NULL, false); |
cd800728 | 2681 | inlined = true; |
2682 | } | |
6331b6fa | 2683 | if (inlined) |
1297cbcd | 2684 | ipa_update_overall_fn_summary (node); |
cd800728 | 2685 | |
2686 | return inlined; | |
2687 | } | |
2688 | ||
65c1a668 | 2689 | /* Decide on the inlining. We do so in the topological order to avoid |
d160af41 | 2690 | expenses on updating data structures. */ |
65c1a668 | 2691 | |
436a2379 | 2692 | static bool |
4869c23f | 2693 | early_inline_small_functions (struct cgraph_node *node) |
65c1a668 | 2694 | { |
2695 | struct cgraph_edge *e; | |
9e0baf4d | 2696 | bool inlined = false; |
436a2379 | 2697 | |
cd800728 | 2698 | for (e = node->callees; e; e = e->next_callee) |
a223d5ed | 2699 | { |
415d1b9a | 2700 | struct cgraph_node *callee = e->callee->ultimate_alias_target (); |
d2c2513e | 2701 | |
2702 | /* We can enounter not-yet-analyzed function during | |
2703 | early inlining on callgraphs with strongly | |
2704 | connected components. */ | |
2705 | ipa_fn_summary *s = ipa_fn_summaries->get (callee); | |
2706 | if (s == NULL || !s->inlinable || !e->inline_failed) | |
cd800728 | 2707 | continue; |
2708 | ||
2709 | /* Do not consider functions not declared inline. */ | |
02774f2d | 2710 | if (!DECL_DECLARED_INLINE_P (callee->decl) |
d1f68cd8 | 2711 | && !opt_for_fn (node->decl, flag_inline_small_functions) |
2712 | && !opt_for_fn (node->decl, flag_inline_functions)) | |
cd800728 | 2713 | continue; |
2714 | ||
7261dbb3 | 2715 | if (dump_enabled_p ()) |
2716 | dump_printf_loc (MSG_NOTE, e->call_stmt, | |
2717 | "Considering inline candidate %C.\n", | |
2718 | callee); | |
65c1a668 | 2719 | |
4869c23f | 2720 | if (!can_early_inline_edge_p (e)) |
2721 | continue; | |
2722 | ||
35ee1c66 | 2723 | if (e->recursive_p ()) |
cd800728 | 2724 | { |
7261dbb3 | 2725 | if (dump_enabled_p ()) |
2726 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, e->call_stmt, | |
2727 | " Not inlining: recursive call.\n"); | |
f41629b6 | 2728 | continue; |
cd800728 | 2729 | } |
d160af41 | 2730 | |
4869c23f | 2731 | if (!want_early_inline_function_p (e)) |
cd800728 | 2732 | continue; |
65c1a668 | 2733 | |
7261dbb3 | 2734 | if (dump_enabled_p ()) |
2735 | dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, e->call_stmt, | |
2736 | " Inlining %C into %C.\n", | |
2737 | callee, e->caller); | |
6ec9c8c5 | 2738 | inline_call (e, true, NULL, NULL, false); |
4869c23f | 2739 | inlined = true; |
00efe249 | 2740 | } |
cd800728 | 2741 | |
6ec9c8c5 | 2742 | if (inlined) |
1297cbcd | 2743 | ipa_update_overall_fn_summary (node); |
6ec9c8c5 | 2744 | |
436a2379 | 2745 | return inlined; |
65c1a668 | 2746 | } |
2747 | ||
65b0537f | 2748 | unsigned int |
94bed7c3 | 2749 | early_inliner (function *fun) |
9e0baf4d | 2750 | { |
415d1b9a | 2751 | struct cgraph_node *node = cgraph_node::get (current_function_decl); |
c7b2cc59 | 2752 | struct cgraph_edge *edge; |
436a2379 | 2753 | unsigned int todo = 0; |
a7b61d8c | 2754 | int iterations = 0; |
cd800728 | 2755 | bool inlined = false; |
9e0baf4d | 2756 | |
852f689e | 2757 | if (seen_error ()) |
2a1990e9 | 2758 | return 0; |
d160af41 | 2759 | |
9da15f94 | 2760 | /* Do nothing if datastructures for ipa-inliner are already computed. This |
2761 | happens when some pass decides to construct new function and | |
2762 | cgraph_add_new_function calls lowering passes and early optimization on | |
2763 | it. This may confuse ourself when early inliner decide to inline call to | |
2764 | function clone, because function clones don't have parameter list in | |
2765 | ipa-prop matching their signature. */ | |
2cc80ac3 | 2766 | if (ipa_node_params_sum) |
9da15f94 | 2767 | return 0; |
2768 | ||
382ecba7 | 2769 | if (flag_checking) |
2770 | node->verify (); | |
51ce5652 | 2771 | node->remove_all_references (); |
cd800728 | 2772 | |
2773 | /* Even when not optimizing or not inlining inline always-inline | |
2774 | functions. */ | |
4869c23f | 2775 | inlined = inline_always_inline_functions (node); |
cd800728 | 2776 | |
d160af41 | 2777 | if (!optimize |
2778 | || flag_no_inline | |
4869c23f | 2779 | || !flag_early_inlining |
2780 | /* Never inline regular functions into always-inline functions | |
2781 | during incremental inlining. This sucks as functions calling | |
2782 | always inline functions will get less optimized, but at the | |
2783 | same time inlining of functions calling always inline | |
4055a556 | 2784 | function into an always inline function might introduce |
4869c23f | 2785 | cycles of edges to be always inlined in the callgraph. |
2786 | ||
2787 | We might want to be smarter and just avoid this type of inlining. */ | |
b06b9ff6 | 2788 | || (DECL_DISREGARD_INLINE_LIMITS (node->decl) |
2789 | && lookup_attribute ("always_inline", | |
2790 | DECL_ATTRIBUTES (node->decl)))) | |
cd800728 | 2791 | ; |
2792 | else if (lookup_attribute ("flatten", | |
02774f2d | 2793 | DECL_ATTRIBUTES (node->decl)) != NULL) |
436a2379 | 2794 | { |
cd800728 | 2795 | /* When the function is marked to be flattened, recursively inline |
2796 | all calls in it. */ | |
7261dbb3 | 2797 | if (dump_enabled_p ()) |
2798 | dump_printf (MSG_OPTIMIZED_LOCATIONS, | |
2799 | "Flattening %C\n", node); | |
c3bffd9b | 2800 | flatten_function (node, true, true); |
cd800728 | 2801 | inlined = true; |
436a2379 | 2802 | } |
d160af41 | 2803 | else |
2804 | { | |
b06b9ff6 | 2805 | /* If some always_inline functions was inlined, apply the changes. |
2806 | This way we will not account always inline into growth limits and | |
2807 | moreover we will inline calls from always inlines that we skipped | |
fe4bc123 | 2808 | previously because of conditional above. */ |
b06b9ff6 | 2809 | if (inlined) |
2810 | { | |
2811 | timevar_push (TV_INTEGRATION); | |
2812 | todo |= optimize_inline_calls (current_function_decl); | |
897c92c3 | 2813 | /* optimize_inline_calls call above might have introduced new |
2814 | statements that don't have inline parameters computed. */ | |
2815 | for (edge = node->callees; edge; edge = edge->next_callee) | |
2816 | { | |
d2c2513e | 2817 | /* We can enounter not-yet-analyzed function during |
2818 | early inlining on callgraphs with strongly | |
2819 | connected components. */ | |
b53d4f56 | 2820 | ipa_call_summary *es = ipa_call_summaries->get_create (edge); |
347f1a0f | 2821 | es->call_stmt_size |
2822 | = estimate_num_insns (edge->call_stmt, &eni_size_weights); | |
2823 | es->call_stmt_time | |
2824 | = estimate_num_insns (edge->call_stmt, &eni_time_weights); | |
897c92c3 | 2825 | } |
1297cbcd | 2826 | ipa_update_overall_fn_summary (node); |
b06b9ff6 | 2827 | inlined = false; |
2828 | timevar_pop (TV_INTEGRATION); | |
2829 | } | |
d160af41 | 2830 | /* We iterate incremental inlining to get trivial cases of indirect |
2831 | inlining. */ | |
2832 | while (iterations < PARAM_VALUE (PARAM_EARLY_INLINER_MAX_ITERATIONS) | |
4869c23f | 2833 | && early_inline_small_functions (node)) |
d160af41 | 2834 | { |
2835 | timevar_push (TV_INTEGRATION); | |
2836 | todo |= optimize_inline_calls (current_function_decl); | |
4869c23f | 2837 | |
2838 | /* Technically we ought to recompute inline parameters so the new | |
2839 | iteration of early inliner works as expected. We however have | |
2840 | values approximately right and thus we only need to update edge | |
2841 | info that might be cleared out for newly discovered edges. */ | |
2842 | for (edge = node->callees; edge; edge = edge->next_callee) | |
2843 | { | |
058a1b7a | 2844 | /* We have no summary for new bound store calls yet. */ |
5ef0eaf5 | 2845 | ipa_call_summary *es = ipa_call_summaries->get_create (edge); |
2846 | es->call_stmt_size | |
2847 | = estimate_num_insns (edge->call_stmt, &eni_size_weights); | |
2848 | es->call_stmt_time | |
2849 | = estimate_num_insns (edge->call_stmt, &eni_time_weights); | |
347f1a0f | 2850 | |
02774f2d | 2851 | if (edge->callee->decl |
341de017 | 2852 | && !gimple_check_call_matching_types ( |
02774f2d | 2853 | edge->call_stmt, edge->callee->decl, false)) |
0754a747 | 2854 | { |
2855 | edge->inline_failed = CIF_MISMATCHED_ARGUMENTS; | |
2856 | edge->call_stmt_cannot_inline_p = true; | |
2857 | } | |
4869c23f | 2858 | } |
0bc23e2b | 2859 | if (iterations < PARAM_VALUE (PARAM_EARLY_INLINER_MAX_ITERATIONS) - 1) |
1297cbcd | 2860 | ipa_update_overall_fn_summary (node); |
d160af41 | 2861 | timevar_pop (TV_INTEGRATION); |
cd800728 | 2862 | iterations++; |
2863 | inlined = false; | |
d160af41 | 2864 | } |
2865 | if (dump_file) | |
2866 | fprintf (dump_file, "Iterations: %i\n", iterations); | |
2867 | } | |
2868 | ||
cd800728 | 2869 | if (inlined) |
2870 | { | |
2871 | timevar_push (TV_INTEGRATION); | |
2872 | todo |= optimize_inline_calls (current_function_decl); | |
2873 | timevar_pop (TV_INTEGRATION); | |
2874 | } | |
2875 | ||
65b0537f | 2876 | fun->always_inline_functions_inlined = true; |
9e0baf4d | 2877 | |
d160af41 | 2878 | return todo; |
9e0baf4d | 2879 | } |
2880 | ||
94bed7c3 | 2881 | /* Do inlining of small functions. Doing so early helps profiling and other |
2882 | passes to be somewhat more effective and avoids some code duplication in | |
2883 | later real inlining pass for testcases with very many function calls. */ | |
2884 | ||
2885 | namespace { | |
2886 | ||
2887 | const pass_data pass_data_early_inline = | |
2888 | { | |
2889 | GIMPLE_PASS, /* type */ | |
2890 | "einline", /* name */ | |
2891 | OPTGROUP_INLINE, /* optinfo_flags */ | |
2892 | TV_EARLY_INLINING, /* tv_id */ | |
2893 | PROP_ssa, /* properties_required */ | |
2894 | 0, /* properties_provided */ | |
2895 | 0, /* properties_destroyed */ | |
2896 | 0, /* todo_flags_start */ | |
2897 | 0, /* todo_flags_finish */ | |
2898 | }; | |
2899 | ||
2900 | class pass_early_inline : public gimple_opt_pass | |
2901 | { | |
2902 | public: | |
2903 | pass_early_inline (gcc::context *ctxt) | |
2904 | : gimple_opt_pass (pass_data_early_inline, ctxt) | |
2905 | {} | |
2906 | ||
2907 | /* opt_pass methods: */ | |
2908 | virtual unsigned int execute (function *); | |
2909 | ||
2910 | }; // class pass_early_inline | |
2911 | ||
2912 | unsigned int | |
2913 | pass_early_inline::execute (function *fun) | |
2914 | { | |
2915 | return early_inliner (fun); | |
2916 | } | |
2917 | ||
cbe8bda8 | 2918 | } // anon namespace |
2919 | ||
2920 | gimple_opt_pass * | |
2921 | make_pass_early_inline (gcc::context *ctxt) | |
2922 | { | |
2923 | return new pass_early_inline (ctxt); | |
2924 | } | |
2925 | ||
cbe8bda8 | 2926 | namespace { |
2927 | ||
2928 | const pass_data pass_data_ipa_inline = | |
09a2e412 | 2929 | { |
cbe8bda8 | 2930 | IPA_PASS, /* type */ |
2931 | "inline", /* name */ | |
2932 | OPTGROUP_INLINE, /* optinfo_flags */ | |
cbe8bda8 | 2933 | TV_IPA_INLINING, /* tv_id */ |
2934 | 0, /* properties_required */ | |
2935 | 0, /* properties_provided */ | |
2936 | 0, /* properties_destroyed */ | |
289c4db4 | 2937 | 0, /* todo_flags_start */ |
2fe870c5 | 2938 | ( TODO_dump_symtab ), /* todo_flags_finish */ |
65c1a668 | 2939 | }; |
cbe8bda8 | 2940 | |
2941 | class pass_ipa_inline : public ipa_opt_pass_d | |
2942 | { | |
2943 | public: | |
9af5ce0c | 2944 | pass_ipa_inline (gcc::context *ctxt) |
2945 | : ipa_opt_pass_d (pass_data_ipa_inline, ctxt, | |
a2da7d8a | 2946 | NULL, /* generate_summary */ |
2947 | NULL, /* write_summary */ | |
2948 | NULL, /* read_summary */ | |
9af5ce0c | 2949 | NULL, /* write_optimization_summary */ |
2950 | NULL, /* read_optimization_summary */ | |
2951 | NULL, /* stmt_fixup */ | |
2952 | 0, /* function_transform_todo_flags_start */ | |
2953 | inline_transform, /* function_transform */ | |
2954 | NULL) /* variable_transform */ | |
cbe8bda8 | 2955 | {} |
2956 | ||
2957 | /* opt_pass methods: */ | |
65b0537f | 2958 | virtual unsigned int execute (function *) { return ipa_inline (); } |
cbe8bda8 | 2959 | |
2960 | }; // class pass_ipa_inline | |
2961 | ||
2962 | } // anon namespace | |
2963 | ||
2964 | ipa_opt_pass_d * | |
2965 | make_pass_ipa_inline (gcc::context *ctxt) | |
2966 | { | |
2967 | return new pass_ipa_inline (ctxt); | |
2968 | } |