]>
Commit | Line | Data |
---|---|---|
cd6bca02 | 1 | /* Callgraph based interprocedural optimizations. |
aed6e608 | 2 | Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, |
5c8ad8f5 | 3 | 2011, 2012 Free Software Foundation, Inc. |
ae01b312 | 4 | Contributed by Jan Hubicka |
5 | ||
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify it under | |
9 | the terms of the GNU General Public License as published by the Free | |
8c4c00c1 | 10 | Software Foundation; either version 3, or (at your option) any later |
ae01b312 | 11 | version. |
12 | ||
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
ae01b312 | 21 | |
b0cdf642 | 22 | /* This module implements main driver of compilation process as well as |
cd6bca02 | 23 | few basic interprocedural optimizers. |
b0cdf642 | 24 | |
25 | The main scope of this file is to act as an interface in between | |
26 | tree based frontends and the backend (and middle end) | |
27 | ||
28 | The front-end is supposed to use following functionality: | |
29 | ||
30 | - cgraph_finalize_function | |
31 | ||
32 | This function is called once front-end has parsed whole body of function | |
33 | and it is certain that the function body nor the declaration will change. | |
34 | ||
b326746d | 35 | (There is one exception needed for implementing GCC extern inline |
36 | function.) | |
b0cdf642 | 37 | |
1d416bd7 | 38 | - varpool_finalize_variable |
b0cdf642 | 39 | |
7bd28bba | 40 | This function has same behavior as the above but is used for static |
b0cdf642 | 41 | variables. |
42 | ||
43 | - cgraph_finalize_compilation_unit | |
44 | ||
b326746d | 45 | This function is called once (source level) compilation unit is finalized |
46 | and it will no longer change. | |
b0cdf642 | 47 | |
851d9296 | 48 | In the call-graph construction and local function analysis takes |
49 | place here. Bodies of unreachable functions are released to | |
50 | conserve memory usage. | |
b0cdf642 | 51 | |
b326746d | 52 | The function can be called multiple times when multiple source level |
53 | compilation units are combined (such as in C frontend) | |
b0cdf642 | 54 | |
55 | - cgraph_optimize | |
56 | ||
57 | In this unit-at-a-time compilation the intra procedural analysis takes | |
58 | place here. In particular the static functions whose address is never | |
59 | taken are marked as local. Backend can then use this information to | |
60 | modify calling conventions, do better inlining or similar optimizations. | |
61 | ||
b0cdf642 | 62 | - cgraph_mark_needed_node |
1d416bd7 | 63 | - varpool_mark_needed_node |
b0cdf642 | 64 | |
b326746d | 65 | When function or variable is referenced by some hidden way the call-graph |
66 | data structure must be updated accordingly by this function. | |
67 | There should be little need to call this function and all the references | |
68 | should be made explicit to cgraph code. At present these functions are | |
ccd2f3d1 | 69 | used by C++ frontend to explicitly mark the keyed methods. |
b0cdf642 | 70 | |
71 | - analyze_expr callback | |
72 | ||
73 | This function is responsible for lowering tree nodes not understood by | |
74 | generic code into understandable ones or alternatively marking | |
75 | callgraph and varpool nodes referenced by the as needed. | |
76 | ||
77 | ??? On the tree-ssa genericizing should take place here and we will avoid | |
78 | need for these hooks (replacing them by genericizing hook) | |
79 | ||
6329636b | 80 | Analyzing of all functions is deferred |
b0cdf642 | 81 | to cgraph_finalize_compilation_unit and expansion into cgraph_optimize. |
82 | ||
83 | In cgraph_finalize_compilation_unit the reachable functions are | |
84 | analyzed. During analysis the call-graph edges from reachable | |
85 | functions are constructed and their destinations are marked as | |
86 | reachable. References to functions and variables are discovered too | |
87 | and variables found to be needed output to the assembly file. Via | |
88 | mark_referenced call in assemble_variable functions referenced by | |
89 | static variables are noticed too. | |
90 | ||
ca67a72b | 91 | The intra-procedural information is produced and its existence |
b0cdf642 | 92 | indicated by global_info_ready. Once this flag is set it is impossible |
93 | to change function from !reachable to reachable and thus | |
94 | assemble_variable no longer call mark_referenced. | |
95 | ||
96 | Finally the call-graph is topologically sorted and all reachable functions | |
97 | that has not been completely inlined or are not external are output. | |
98 | ||
99 | ??? It is possible that reference to function or variable is optimized | |
100 | out. We can not deal with this nicely because topological order is not | |
101 | suitable for it. For tree-ssa we may consider another pass doing | |
102 | optimization and re-discovering reachable functions. | |
103 | ||
104 | ??? Reorganize code so variables are output very last and only if they | |
105 | really has been referenced by produced code, so we catch more cases | |
6329636b | 106 | where reference has been optimized out. */ |
121f3051 | 107 | |
acc70efa | 108 | |
ae01b312 | 109 | #include "config.h" |
110 | #include "system.h" | |
111 | #include "coretypes.h" | |
112 | #include "tm.h" | |
113 | #include "tree.h" | |
b5530559 | 114 | #include "rtl.h" |
acc70efa | 115 | #include "tree-flow.h" |
ae01b312 | 116 | #include "tree-inline.h" |
117 | #include "langhooks.h" | |
c6224531 | 118 | #include "pointer-set.h" |
ae01b312 | 119 | #include "toplev.h" |
120 | #include "flags.h" | |
121 | #include "ggc.h" | |
122 | #include "debug.h" | |
123 | #include "target.h" | |
124 | #include "cgraph.h" | |
80a85d8a | 125 | #include "diagnostic.h" |
ce084dfc | 126 | #include "tree-pretty-print.h" |
127 | #include "gimple-pretty-print.h" | |
f79b6507 | 128 | #include "timevar.h" |
d7c6d889 | 129 | #include "params.h" |
130 | #include "fibheap.h" | |
611e5405 | 131 | #include "intl.h" |
b69eb0ff | 132 | #include "function.h" |
b5d36404 | 133 | #include "ipa-prop.h" |
75a70cf9 | 134 | #include "gimple.h" |
135 | #include "tree-iterator.h" | |
f1e2a033 | 136 | #include "tree-pass.h" |
bfec3452 | 137 | #include "tree-dump.h" |
c1dcd13c | 138 | #include "output.h" |
9ed5b1f5 | 139 | #include "coverage.h" |
c9036234 | 140 | #include "plugin.h" |
a41f2a28 | 141 | #include "ipa-inline.h" |
7771d558 | 142 | #include "ipa-utils.h" |
a0605d65 | 143 | #include "lto-streamer.h" |
d7c6d889 | 144 | |
a6868229 | 145 | static void cgraph_expand_all_functions (void); |
d9d9733a | 146 | static void cgraph_mark_functions_to_output (void); |
147 | static void cgraph_expand_function (struct cgraph_node *); | |
f788fff2 | 148 | static void cgraph_output_pending_asms (void); |
25bb88de | 149 | |
ecb08119 | 150 | FILE *cgraph_dump_file; |
121f3051 | 151 | |
28454517 | 152 | /* Used for vtable lookup in thunk adjusting. */ |
153 | static GTY (()) tree vtable_entry_type; | |
154 | ||
2c0b522d | 155 | /* Determine if function DECL is needed. That is, visible to something |
156 | either outside this translation unit, something magic in the system | |
6329636b | 157 | configury. */ |
2c0b522d | 158 | |
7bfefa9d | 159 | bool |
160 | cgraph_decide_is_function_needed (struct cgraph_node *node, tree decl) | |
2c0b522d | 161 | { |
3f82b628 | 162 | /* If the user told us it is used, then it must be so. */ |
05806473 | 163 | if (node->local.externally_visible) |
164 | return true; | |
165 | ||
3f82b628 | 166 | /* ??? If the assembler name is set by hand, it is possible to assemble |
167 | the name later after finalizing the function and the fact is noticed | |
168 | in assemble_name then. This is arguably a bug. */ | |
169 | if (DECL_ASSEMBLER_NAME_SET_P (decl) | |
c70f46b0 | 170 | && (!node->thunk.thunk_p && !node->same_body_alias) |
3f82b628 | 171 | && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))) |
172 | return true; | |
173 | ||
55680bef | 174 | /* With -fkeep-inline-functions we are keeping all inline functions except |
175 | for extern inline ones. */ | |
176 | if (flag_keep_inline_functions | |
177 | && DECL_DECLARED_INLINE_P (decl) | |
316ef6d8 | 178 | && !DECL_EXTERNAL (decl) |
cbd7f5a0 | 179 | && !DECL_DISREGARD_INLINE_LIMITS (decl)) |
55680bef | 180 | return true; |
181 | ||
2c0b522d | 182 | /* If we decided it was needed before, but at the time we didn't have |
183 | the body of the function available, then it's still needed. We have | |
184 | to go back and re-check its dependencies now. */ | |
185 | if (node->needed) | |
186 | return true; | |
187 | ||
188 | /* Externally visible functions must be output. The exception is | |
a0c938f0 | 189 | COMDAT functions that must be output only when they are needed. |
8baa9d15 | 190 | |
191 | When not optimizing, also output the static functions. (see | |
95da6220 | 192 | PR24561), but don't do so for always_inline functions, functions |
0f9238c0 | 193 | declared inline and nested functions. These were optimized out |
d3d410e1 | 194 | in the original implementation and it is unclear whether we want |
554f2707 | 195 | to change the behavior here. */ |
bba7ddf8 | 196 | if (((TREE_PUBLIC (decl) |
0f9238c0 | 197 | || (!optimize |
cbd7f5a0 | 198 | && !DECL_DISREGARD_INLINE_LIMITS (decl) |
d3d410e1 | 199 | && !DECL_DECLARED_INLINE_P (decl) |
0f9238c0 | 200 | && !(DECL_CONTEXT (decl) |
201 | && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL))) | |
59dd4830 | 202 | && !flag_whole_program |
cbcf2791 | 203 | && !flag_lto) |
62eec3b4 | 204 | && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl)) |
2c0b522d | 205 | return true; |
206 | ||
2c0b522d | 207 | return false; |
208 | } | |
209 | ||
bdc40eb8 | 210 | /* Process CGRAPH_NEW_FUNCTIONS and perform actions necessary to add these |
523c1122 | 211 | functions into callgraph in a way so they look like ordinary reachable |
212 | functions inserted into callgraph already at construction time. */ | |
213 | ||
214 | bool | |
215 | cgraph_process_new_functions (void) | |
216 | { | |
217 | bool output = false; | |
218 | tree fndecl; | |
219 | struct cgraph_node *node; | |
220 | ||
0cddb138 | 221 | varpool_analyze_pending_decls (); |
523c1122 | 222 | /* Note that this queue may grow as its being processed, as the new |
223 | functions may generate new ones. */ | |
224 | while (cgraph_new_nodes) | |
225 | { | |
226 | node = cgraph_new_nodes; | |
227 | fndecl = node->decl; | |
228 | cgraph_new_nodes = cgraph_new_nodes->next_needed; | |
229 | switch (cgraph_state) | |
230 | { | |
231 | case CGRAPH_STATE_CONSTRUCTION: | |
232 | /* At construction time we just need to finalize function and move | |
233 | it into reachable functions list. */ | |
234 | ||
235 | node->next_needed = NULL; | |
236 | cgraph_finalize_function (fndecl, false); | |
237 | cgraph_mark_reachable_node (node); | |
238 | output = true; | |
4f7a1122 | 239 | cgraph_call_function_insertion_hooks (node); |
523c1122 | 240 | break; |
241 | ||
242 | case CGRAPH_STATE_IPA: | |
f517b36e | 243 | case CGRAPH_STATE_IPA_SSA: |
523c1122 | 244 | /* When IPA optimization already started, do all essential |
245 | transformations that has been already performed on the whole | |
246 | cgraph but not on this function. */ | |
247 | ||
75a70cf9 | 248 | gimple_register_cfg_hooks (); |
523c1122 | 249 | if (!node->analyzed) |
250 | cgraph_analyze_function (node); | |
251 | push_cfun (DECL_STRUCT_FUNCTION (fndecl)); | |
252 | current_function_decl = fndecl; | |
f517b36e | 253 | if ((cgraph_state == CGRAPH_STATE_IPA_SSA |
254 | && !gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl))) | |
255 | /* When not optimizing, be sure we run early local passes anyway | |
256 | to expand OMP. */ | |
257 | || !optimize) | |
20099e35 | 258 | execute_pass_list (pass_early_local_passes.pass.sub); |
649597af | 259 | else |
a41f2a28 | 260 | compute_inline_parameters (node, true); |
523c1122 | 261 | free_dominance_info (CDI_POST_DOMINATORS); |
262 | free_dominance_info (CDI_DOMINATORS); | |
263 | pop_cfun (); | |
264 | current_function_decl = NULL; | |
4f7a1122 | 265 | cgraph_call_function_insertion_hooks (node); |
523c1122 | 266 | break; |
267 | ||
268 | case CGRAPH_STATE_EXPANSION: | |
269 | /* Functions created during expansion shall be compiled | |
270 | directly. */ | |
09fc9532 | 271 | node->process = 0; |
4f7a1122 | 272 | cgraph_call_function_insertion_hooks (node); |
523c1122 | 273 | cgraph_expand_function (node); |
274 | break; | |
275 | ||
276 | default: | |
277 | gcc_unreachable (); | |
278 | break; | |
279 | } | |
0cddb138 | 280 | varpool_analyze_pending_decls (); |
523c1122 | 281 | } |
282 | return output; | |
283 | } | |
284 | ||
9b8fb23a | 285 | /* As an GCC extension we allow redefinition of the function. The |
286 | semantics when both copies of bodies differ is not well defined. | |
287 | We replace the old body with new body so in unit at a time mode | |
288 | we always use new body, while in normal mode we may end up with | |
289 | old body inlined into some functions and new body expanded and | |
290 | inlined in others. | |
291 | ||
292 | ??? It may make more sense to use one body for inlining and other | |
293 | body for expanding the function but this is difficult to do. */ | |
294 | ||
295 | static void | |
296 | cgraph_reset_node (struct cgraph_node *node) | |
297 | { | |
09fc9532 | 298 | /* If node->process is set, then we have already begun whole-unit analysis. |
6329636b | 299 | This is *not* testing for whether we've already emitted the function. |
300 | That case can be sort-of legitimately seen with real function redefinition | |
301 | errors. I would argue that the front end should never present us with | |
302 | such a case, but don't enforce that for now. */ | |
09fc9532 | 303 | gcc_assert (!node->process); |
9b8fb23a | 304 | |
305 | /* Reset our data structures so we can analyze the function again. */ | |
306 | memset (&node->local, 0, sizeof (node->local)); | |
307 | memset (&node->global, 0, sizeof (node->global)); | |
308 | memset (&node->rtl, 0, sizeof (node->rtl)); | |
309 | node->analyzed = false; | |
9b8fb23a | 310 | node->local.finalized = false; |
311 | ||
9b8fb23a | 312 | cgraph_node_remove_callees (node); |
9b8fb23a | 313 | } |
c08871a9 | 314 | |
1e8e9920 | 315 | static void |
316 | cgraph_lower_function (struct cgraph_node *node) | |
317 | { | |
318 | if (node->lowered) | |
319 | return; | |
bfec3452 | 320 | |
321 | if (node->nested) | |
322 | lower_nested_functions (node->decl); | |
323 | gcc_assert (!node->nested); | |
324 | ||
1e8e9920 | 325 | tree_lowering_passes (node->decl); |
326 | node->lowered = true; | |
327 | } | |
328 | ||
28df663b | 329 | /* DECL has been parsed. Take it, queue it, compile it at the whim of the |
330 | logic in effect. If NESTED is true, then our caller cannot stand to have | |
331 | the garbage collector run at the moment. We would need to either create | |
332 | a new GC context, or just not compile right now. */ | |
ae01b312 | 333 | |
334 | void | |
28df663b | 335 | cgraph_finalize_function (tree decl, bool nested) |
ae01b312 | 336 | { |
5a90471f | 337 | struct cgraph_node *node = cgraph_get_create_node (decl); |
ae01b312 | 338 | |
c08871a9 | 339 | if (node->local.finalized) |
443089c1 | 340 | { |
341 | cgraph_reset_node (node); | |
342 | node->local.redefined_extern_inline = true; | |
343 | } | |
28df663b | 344 | |
c08871a9 | 345 | notice_global_symbol (decl); |
79bb87b4 | 346 | node->local.finalized = true; |
e27482aa | 347 | node->lowered = DECL_STRUCT_FUNCTION (decl)->cfg != NULL; |
ae01b312 | 348 | |
7bfefa9d | 349 | if (cgraph_decide_is_function_needed (node, decl)) |
2c0b522d | 350 | cgraph_mark_needed_node (node); |
351 | ||
ecda6e51 | 352 | /* Since we reclaim unreachable nodes at the end of every language |
3f82b628 | 353 | level unit, we need to be conservative about possible entry points |
354 | there. */ | |
1e3aebec | 355 | if ((TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl)) |
356 | || DECL_STATIC_CONSTRUCTOR (decl) | |
d050bafd | 357 | || DECL_STATIC_DESTRUCTOR (decl) |
358 | /* COMDAT virtual functions may be referenced by vtable from | |
0a10fd82 | 359 | other compilation unit. Still we want to devirtualize calls |
d050bafd | 360 | to those so we need to analyze them. |
361 | FIXME: We should introduce may edges for this purpose and update | |
362 | their handling in unreachable function removal and inliner too. */ | |
91bf9d9a | 363 | || (DECL_VIRTUAL_P (decl) |
364 | && optimize && (DECL_COMDAT (decl) || DECL_EXTERNAL (decl)))) | |
3f82b628 | 365 | cgraph_mark_reachable_node (node); |
366 | ||
2c0b522d | 367 | /* If we've not yet emitted decl, tell the debug info about it. */ |
28df663b | 368 | if (!TREE_ASM_WRITTEN (decl)) |
2c0b522d | 369 | (*debug_hooks->deferred_inline_function) (decl); |
4e8871a0 | 370 | |
b69eb0ff | 371 | /* Possibly warn about unused parameters. */ |
372 | if (warn_unused_parameter) | |
373 | do_warn_unused_parameter (decl); | |
6329636b | 374 | |
375 | if (!nested) | |
376 | ggc_collect (); | |
ae01b312 | 377 | } |
378 | ||
0da03d11 | 379 | /* C99 extern inline keywords allow changing of declaration after function |
380 | has been finalized. We need to re-decide if we want to mark the function as | |
381 | needed then. */ | |
382 | ||
383 | void | |
384 | cgraph_mark_if_needed (tree decl) | |
385 | { | |
fd6a3c41 | 386 | struct cgraph_node *node = cgraph_get_node (decl); |
7bfefa9d | 387 | if (node->local.finalized && cgraph_decide_is_function_needed (node, decl)) |
0da03d11 | 388 | cgraph_mark_needed_node (node); |
389 | } | |
390 | ||
ccf4ab6b | 391 | /* Return TRUE if NODE2 is equivalent to NODE or its clone. */ |
392 | static bool | |
393 | clone_of_p (struct cgraph_node *node, struct cgraph_node *node2) | |
394 | { | |
c70f46b0 | 395 | node = cgraph_function_or_thunk_node (node, NULL); |
396 | node2 = cgraph_function_or_thunk_node (node2, NULL); | |
ccf4ab6b | 397 | while (node != node2 && node2) |
398 | node2 = node2->clone_of; | |
399 | return node2 != NULL; | |
400 | } | |
401 | ||
1a036a3b | 402 | /* Verify edge E count and frequency. */ |
403 | ||
404 | static bool | |
405 | verify_edge_count_and_frequency (struct cgraph_edge *e) | |
406 | { | |
407 | bool error_found = false; | |
408 | if (e->count < 0) | |
409 | { | |
410 | error ("caller edge count is negative"); | |
411 | error_found = true; | |
412 | } | |
413 | if (e->frequency < 0) | |
414 | { | |
415 | error ("caller edge frequency is negative"); | |
416 | error_found = true; | |
417 | } | |
418 | if (e->frequency > CGRAPH_FREQ_MAX) | |
419 | { | |
420 | error ("caller edge frequency is too large"); | |
421 | error_found = true; | |
422 | } | |
423 | if (gimple_has_body_p (e->caller->decl) | |
424 | && !e->caller->global.inlined_to | |
8bae3ea4 | 425 | /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out. |
426 | Remove this once edges are actualy removed from the function at that time. */ | |
427 | && (e->frequency | |
428 | || (inline_edge_summary_vec | |
9ed50dd9 | 429 | && ((VEC_length(inline_edge_summary_t, inline_edge_summary_vec) |
430 | <= (unsigned) e->uid) | |
431 | || !inline_edge_summary (e)->predicate))) | |
1a036a3b | 432 | && (e->frequency |
433 | != compute_call_stmt_bb_frequency (e->caller->decl, | |
434 | gimple_bb (e->call_stmt)))) | |
435 | { | |
0a10fd82 | 436 | error ("caller edge frequency %i does not match BB frequency %i", |
1a036a3b | 437 | e->frequency, |
438 | compute_call_stmt_bb_frequency (e->caller->decl, | |
439 | gimple_bb (e->call_stmt))); | |
440 | error_found = true; | |
441 | } | |
442 | return error_found; | |
443 | } | |
444 | ||
7b29dd2f | 445 | /* Switch to THIS_CFUN if needed and print STMT to stderr. */ |
446 | static void | |
447 | cgraph_debug_gimple_stmt (struct function *this_cfun, gimple stmt) | |
448 | { | |
449 | /* debug_gimple_stmt needs correct cfun */ | |
450 | if (cfun != this_cfun) | |
451 | set_cfun (this_cfun); | |
452 | debug_gimple_stmt (stmt); | |
453 | } | |
454 | ||
2f9d66d3 | 455 | /* Verify that call graph edge E corresponds to DECL from the associated |
456 | statement. Return true if the verification should fail. */ | |
457 | ||
458 | static bool | |
459 | verify_edge_corresponds_to_fndecl (struct cgraph_edge *e, tree decl) | |
460 | { | |
54e8af13 | 461 | struct cgraph_node *node; |
462 | ||
463 | if (!decl || e->callee->global.inlined_to) | |
464 | return false; | |
465 | node = cgraph_get_node (decl); | |
466 | ||
467 | /* We do not know if a node from a different partition is an alias or what it | |
468 | aliases and therefore cannot do the former_clone_of check reliably. */ | |
469 | if (!node || node->in_other_partition) | |
470 | return false; | |
471 | node = cgraph_function_or_thunk_node (node, NULL); | |
472 | ||
473 | if ((e->callee->former_clone_of != node->decl) | |
2f9d66d3 | 474 | /* IPA-CP sometimes redirect edge to clone and then back to the former |
475 | function. This ping-pong has to go, eventaully. */ | |
54e8af13 | 476 | && (node != cgraph_function_or_thunk_node (e->callee, NULL)) |
477 | && !clone_of_p (node, e->callee)) | |
2f9d66d3 | 478 | return true; |
479 | else | |
480 | return false; | |
481 | } | |
482 | ||
b0cdf642 | 483 | /* Verify cgraph nodes of given cgraph node. */ |
4b987fac | 484 | DEBUG_FUNCTION void |
b0cdf642 | 485 | verify_cgraph_node (struct cgraph_node *node) |
486 | { | |
487 | struct cgraph_edge *e; | |
e27482aa | 488 | struct function *this_cfun = DECL_STRUCT_FUNCTION (node->decl); |
489 | basic_block this_block; | |
75a70cf9 | 490 | gimple_stmt_iterator gsi; |
9bfec7c2 | 491 | bool error_found = false; |
b0cdf642 | 492 | |
852f689e | 493 | if (seen_error ()) |
bd09cd3e | 494 | return; |
495 | ||
b0cdf642 | 496 | timevar_push (TV_CGRAPH_VERIFY); |
b0cdf642 | 497 | for (e = node->callees; e; e = e->next_callee) |
498 | if (e->aux) | |
499 | { | |
0a81f5a0 | 500 | error ("aux field set for edge %s->%s", |
abd3e6b5 | 501 | identifier_to_locale (cgraph_node_name (e->caller)), |
502 | identifier_to_locale (cgraph_node_name (e->callee))); | |
b0cdf642 | 503 | error_found = true; |
504 | } | |
a2cb9b3b | 505 | if (node->count < 0) |
506 | { | |
bf776685 | 507 | error ("execution count is negative"); |
a2cb9b3b | 508 | error_found = true; |
509 | } | |
59dd4830 | 510 | if (node->global.inlined_to && node->local.externally_visible) |
511 | { | |
bf776685 | 512 | error ("externally visible inline clone"); |
59dd4830 | 513 | error_found = true; |
514 | } | |
515 | if (node->global.inlined_to && node->address_taken) | |
516 | { | |
bf776685 | 517 | error ("inline clone with address taken"); |
59dd4830 | 518 | error_found = true; |
519 | } | |
520 | if (node->global.inlined_to && node->needed) | |
521 | { | |
bf776685 | 522 | error ("inline clone is needed"); |
59dd4830 | 523 | error_found = true; |
524 | } | |
799c8711 | 525 | for (e = node->indirect_calls; e; e = e->next_callee) |
526 | { | |
527 | if (e->aux) | |
528 | { | |
529 | error ("aux field set for indirect edge from %s", | |
530 | identifier_to_locale (cgraph_node_name (e->caller))); | |
531 | error_found = true; | |
532 | } | |
533 | if (!e->indirect_unknown_callee | |
534 | || !e->indirect_info) | |
535 | { | |
536 | error ("An indirect edge from %s is not marked as indirect or has " | |
537 | "associated indirect_info, the corresponding statement is: ", | |
538 | identifier_to_locale (cgraph_node_name (e->caller))); | |
7b29dd2f | 539 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
799c8711 | 540 | error_found = true; |
541 | } | |
542 | } | |
b0cdf642 | 543 | for (e = node->callers; e; e = e->next_caller) |
544 | { | |
1a036a3b | 545 | if (verify_edge_count_and_frequency (e)) |
546 | error_found = true; | |
b0cdf642 | 547 | if (!e->inline_failed) |
548 | { | |
549 | if (node->global.inlined_to | |
550 | != (e->caller->global.inlined_to | |
551 | ? e->caller->global.inlined_to : e->caller)) | |
552 | { | |
0a81f5a0 | 553 | error ("inlined_to pointer is wrong"); |
b0cdf642 | 554 | error_found = true; |
555 | } | |
556 | if (node->callers->next_caller) | |
557 | { | |
0a81f5a0 | 558 | error ("multiple inline callers"); |
b0cdf642 | 559 | error_found = true; |
560 | } | |
561 | } | |
562 | else | |
563 | if (node->global.inlined_to) | |
564 | { | |
0a81f5a0 | 565 | error ("inlined_to pointer set for noninline callers"); |
b0cdf642 | 566 | error_found = true; |
567 | } | |
568 | } | |
1a036a3b | 569 | for (e = node->indirect_calls; e; e = e->next_callee) |
570 | if (verify_edge_count_and_frequency (e)) | |
571 | error_found = true; | |
b0cdf642 | 572 | if (!node->callers && node->global.inlined_to) |
573 | { | |
5cd75817 | 574 | error ("inlined_to pointer is set but no predecessors found"); |
b0cdf642 | 575 | error_found = true; |
576 | } | |
577 | if (node->global.inlined_to == node) | |
578 | { | |
0a81f5a0 | 579 | error ("inlined_to pointer refers to itself"); |
b0cdf642 | 580 | error_found = true; |
581 | } | |
582 | ||
7019fd3f | 583 | if (!cgraph_get_node (node->decl)) |
b0cdf642 | 584 | { |
0f6439b9 | 585 | error ("node not found in cgraph_hash"); |
b0cdf642 | 586 | error_found = true; |
587 | } | |
a0c938f0 | 588 | |
ccf4ab6b | 589 | if (node->clone_of) |
590 | { | |
591 | struct cgraph_node *n; | |
592 | for (n = node->clone_of->clones; n; n = n->next_sibling_clone) | |
593 | if (n == node) | |
594 | break; | |
595 | if (!n) | |
596 | { | |
597 | error ("node has wrong clone_of"); | |
598 | error_found = true; | |
599 | } | |
600 | } | |
601 | if (node->clones) | |
602 | { | |
603 | struct cgraph_node *n; | |
604 | for (n = node->clones; n; n = n->next_sibling_clone) | |
605 | if (n->clone_of != node) | |
606 | break; | |
607 | if (n) | |
608 | { | |
609 | error ("node has wrong clone list"); | |
610 | error_found = true; | |
611 | } | |
612 | } | |
613 | if ((node->prev_sibling_clone || node->next_sibling_clone) && !node->clone_of) | |
614 | { | |
615 | error ("node is in clone list but it is not clone"); | |
616 | error_found = true; | |
617 | } | |
618 | if (!node->prev_sibling_clone && node->clone_of && node->clone_of->clones != node) | |
619 | { | |
620 | error ("node has wrong prev_clone pointer"); | |
621 | error_found = true; | |
622 | } | |
623 | if (node->prev_sibling_clone && node->prev_sibling_clone->next_sibling_clone != node) | |
624 | { | |
625 | error ("double linked list of clones corrupted"); | |
626 | error_found = true; | |
627 | } | |
c524ac5d | 628 | if (node->same_comdat_group) |
629 | { | |
630 | struct cgraph_node *n = node->same_comdat_group; | |
631 | ||
632 | if (!DECL_ONE_ONLY (node->decl)) | |
633 | { | |
634 | error ("non-DECL_ONE_ONLY node in a same_comdat_group list"); | |
635 | error_found = true; | |
636 | } | |
637 | if (n == node) | |
638 | { | |
639 | error ("node is alone in a comdat group"); | |
640 | error_found = true; | |
641 | } | |
642 | do | |
643 | { | |
644 | if (!n->same_comdat_group) | |
645 | { | |
646 | error ("same_comdat_group is not a circular list"); | |
647 | error_found = true; | |
648 | break; | |
649 | } | |
650 | n = n->same_comdat_group; | |
651 | } | |
652 | while (n != node); | |
653 | } | |
ccf4ab6b | 654 | |
c70f46b0 | 655 | if (node->analyzed && node->alias) |
656 | { | |
657 | bool ref_found = false; | |
658 | int i; | |
659 | struct ipa_ref *ref; | |
660 | ||
661 | if (node->callees) | |
662 | { | |
663 | error ("Alias has call edges"); | |
664 | error_found = true; | |
665 | } | |
666 | for (i = 0; ipa_ref_list_reference_iterate (&node->ref_list, i, ref); i++) | |
667 | if (ref->use != IPA_REF_ALIAS) | |
668 | { | |
669 | error ("Alias has non-alias refernece"); | |
670 | error_found = true; | |
671 | } | |
672 | else if (ref_found) | |
673 | { | |
674 | error ("Alias has more than one alias reference"); | |
675 | error_found = true; | |
676 | } | |
677 | else | |
678 | ref_found = true; | |
679 | if (!ref_found) | |
680 | { | |
681 | error ("Analyzed alias has no reference"); | |
682 | error_found = true; | |
683 | } | |
684 | } | |
91bf9d9a | 685 | if (node->analyzed && node->thunk.thunk_p) |
686 | { | |
687 | if (!node->callees) | |
688 | { | |
689 | error ("No edge out of thunk node"); | |
690 | error_found = true; | |
691 | } | |
692 | else if (node->callees->next_callee) | |
693 | { | |
694 | error ("More than one edge out of thunk node"); | |
695 | error_found = true; | |
696 | } | |
697 | if (gimple_has_body_p (node->decl)) | |
698 | { | |
699 | error ("Thunk is not supposed to have body"); | |
700 | error_found = true; | |
701 | } | |
702 | } | |
703 | else if (node->analyzed && gimple_has_body_p (node->decl) | |
704 | && !TREE_ASM_WRITTEN (node->decl) | |
705 | && (!DECL_EXTERNAL (node->decl) || node->global.inlined_to) | |
706 | && !flag_wpa) | |
b0cdf642 | 707 | { |
e27482aa | 708 | if (this_cfun->cfg) |
709 | { | |
710 | /* The nodes we're interested in are never shared, so walk | |
711 | the tree ignoring duplicates. */ | |
e7c352d1 | 712 | struct pointer_set_t *visited_nodes = pointer_set_create (); |
e27482aa | 713 | /* Reach the trees by walking over the CFG, and note the |
714 | enclosing basic-blocks in the call edges. */ | |
715 | FOR_EACH_BB_FN (this_block, this_cfun) | |
75a70cf9 | 716 | for (gsi = gsi_start_bb (this_block); |
717 | !gsi_end_p (gsi); | |
718 | gsi_next (&gsi)) | |
9bfec7c2 | 719 | { |
75a70cf9 | 720 | gimple stmt = gsi_stmt (gsi); |
799c8711 | 721 | if (is_gimple_call (stmt)) |
9bfec7c2 | 722 | { |
723 | struct cgraph_edge *e = cgraph_edge (node, stmt); | |
799c8711 | 724 | tree decl = gimple_call_fndecl (stmt); |
9bfec7c2 | 725 | if (e) |
726 | { | |
727 | if (e->aux) | |
728 | { | |
0a81f5a0 | 729 | error ("shared call_stmt:"); |
7b29dd2f | 730 | cgraph_debug_gimple_stmt (this_cfun, stmt); |
9bfec7c2 | 731 | error_found = true; |
732 | } | |
799c8711 | 733 | if (!e->indirect_unknown_callee) |
28454517 | 734 | { |
2f9d66d3 | 735 | if (verify_edge_corresponds_to_fndecl (e, decl)) |
799c8711 | 736 | { |
737 | error ("edge points to wrong declaration:"); | |
738 | debug_tree (e->callee->decl); | |
739 | fprintf (stderr," Instead of:"); | |
740 | debug_tree (decl); | |
741 | error_found = true; | |
742 | } | |
28454517 | 743 | } |
799c8711 | 744 | else if (decl) |
9bfec7c2 | 745 | { |
799c8711 | 746 | error ("an indirect edge with unknown callee " |
747 | "corresponding to a call_stmt with " | |
748 | "a known declaration:"); | |
ee3f5fc0 | 749 | error_found = true; |
7b29dd2f | 750 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
9bfec7c2 | 751 | } |
752 | e->aux = (void *)1; | |
753 | } | |
799c8711 | 754 | else if (decl) |
9bfec7c2 | 755 | { |
0a81f5a0 | 756 | error ("missing callgraph edge for call stmt:"); |
7b29dd2f | 757 | cgraph_debug_gimple_stmt (this_cfun, stmt); |
9bfec7c2 | 758 | error_found = true; |
759 | } | |
760 | } | |
761 | } | |
e27482aa | 762 | pointer_set_destroy (visited_nodes); |
e27482aa | 763 | } |
764 | else | |
765 | /* No CFG available?! */ | |
766 | gcc_unreachable (); | |
767 | ||
b0cdf642 | 768 | for (e = node->callees; e; e = e->next_callee) |
769 | { | |
799c8711 | 770 | if (!e->aux) |
b0cdf642 | 771 | { |
0a81f5a0 | 772 | error ("edge %s->%s has no corresponding call_stmt", |
abd3e6b5 | 773 | identifier_to_locale (cgraph_node_name (e->caller)), |
774 | identifier_to_locale (cgraph_node_name (e->callee))); | |
7b29dd2f | 775 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
b0cdf642 | 776 | error_found = true; |
777 | } | |
778 | e->aux = 0; | |
779 | } | |
799c8711 | 780 | for (e = node->indirect_calls; e; e = e->next_callee) |
781 | { | |
782 | if (!e->aux) | |
783 | { | |
784 | error ("an indirect edge from %s has no corresponding call_stmt", | |
785 | identifier_to_locale (cgraph_node_name (e->caller))); | |
7b29dd2f | 786 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
799c8711 | 787 | error_found = true; |
788 | } | |
789 | e->aux = 0; | |
790 | } | |
b0cdf642 | 791 | } |
792 | if (error_found) | |
793 | { | |
794 | dump_cgraph_node (stderr, node); | |
0a81f5a0 | 795 | internal_error ("verify_cgraph_node failed"); |
b0cdf642 | 796 | } |
797 | timevar_pop (TV_CGRAPH_VERIFY); | |
798 | } | |
799 | ||
800 | /* Verify whole cgraph structure. */ | |
4b987fac | 801 | DEBUG_FUNCTION void |
b0cdf642 | 802 | verify_cgraph (void) |
803 | { | |
804 | struct cgraph_node *node; | |
805 | ||
852f689e | 806 | if (seen_error ()) |
8ec2a798 | 807 | return; |
808 | ||
b0cdf642 | 809 | for (node = cgraph_nodes; node; node = node->next) |
810 | verify_cgraph_node (node); | |
811 | } | |
812 | ||
56af936e | 813 | /* Output all asm statements we have stored up to be output. */ |
814 | ||
815 | static void | |
816 | cgraph_output_pending_asms (void) | |
817 | { | |
818 | struct cgraph_asm_node *can; | |
819 | ||
852f689e | 820 | if (seen_error ()) |
56af936e | 821 | return; |
822 | ||
823 | for (can = cgraph_asm_nodes; can; can = can->next) | |
824 | assemble_asm (can->asm_str); | |
825 | cgraph_asm_nodes = NULL; | |
826 | } | |
827 | ||
0785e435 | 828 | /* Analyze the function scheduled to be output. */ |
222bc9b9 | 829 | void |
0785e435 | 830 | cgraph_analyze_function (struct cgraph_node *node) |
831 | { | |
bfec3452 | 832 | tree save = current_function_decl; |
0785e435 | 833 | tree decl = node->decl; |
834 | ||
c70f46b0 | 835 | if (node->alias && node->thunk.alias) |
836 | { | |
837 | struct cgraph_node *tgt = cgraph_get_node (node->thunk.alias); | |
838 | if (!VEC_length (ipa_ref_t, node->ref_list.references)) | |
839 | ipa_record_reference (node, NULL, tgt, NULL, IPA_REF_ALIAS, NULL); | |
840 | if (node->same_body_alias) | |
841 | { | |
842 | DECL_VIRTUAL_P (node->decl) = DECL_VIRTUAL_P (node->thunk.alias); | |
843 | DECL_DECLARED_INLINE_P (node->decl) | |
844 | = DECL_DECLARED_INLINE_P (node->thunk.alias); | |
845 | DECL_DISREGARD_INLINE_LIMITS (node->decl) | |
846 | = DECL_DISREGARD_INLINE_LIMITS (node->thunk.alias); | |
847 | } | |
848 | ||
849 | /* Fixup visibility nonsences C++ frontend produce on same body aliases. */ | |
850 | if (TREE_PUBLIC (node->decl) && node->same_body_alias) | |
851 | { | |
852 | DECL_EXTERNAL (node->decl) = DECL_EXTERNAL (node->thunk.alias); | |
89bf5ca9 | 853 | if (DECL_ONE_ONLY (node->thunk.alias)) |
c70f46b0 | 854 | { |
89bf5ca9 | 855 | DECL_COMDAT (node->decl) = DECL_COMDAT (node->thunk.alias); |
c70f46b0 | 856 | DECL_COMDAT_GROUP (node->decl) = DECL_COMDAT_GROUP (node->thunk.alias); |
857 | if (DECL_ONE_ONLY (node->thunk.alias) && !node->same_comdat_group) | |
858 | { | |
859 | struct cgraph_node *tgt = cgraph_get_node (node->thunk.alias); | |
860 | node->same_comdat_group = tgt; | |
861 | if (!tgt->same_comdat_group) | |
862 | tgt->same_comdat_group = node; | |
863 | else | |
864 | { | |
865 | struct cgraph_node *n; | |
866 | for (n = tgt->same_comdat_group; | |
867 | n->same_comdat_group != tgt; | |
868 | n = n->same_comdat_group) | |
869 | ; | |
870 | n->same_comdat_group = node; | |
871 | } | |
872 | } | |
873 | } | |
874 | } | |
875 | cgraph_mark_reachable_node (cgraph_alias_aliased_node (node)); | |
876 | if (node->address_taken) | |
877 | cgraph_mark_address_taken_node (cgraph_alias_aliased_node (node)); | |
878 | if (cgraph_decide_is_function_needed (node, node->decl)) | |
879 | cgraph_mark_needed_node (node); | |
880 | } | |
881 | else if (node->thunk.thunk_p) | |
91bf9d9a | 882 | { |
883 | cgraph_create_edge (node, cgraph_get_node (node->thunk.alias), | |
884 | NULL, 0, CGRAPH_FREQ_BASE); | |
885 | } | |
886 | else | |
887 | { | |
888 | current_function_decl = decl; | |
889 | push_cfun (DECL_STRUCT_FUNCTION (decl)); | |
bfec3452 | 890 | |
91bf9d9a | 891 | assign_assembler_name_if_neeeded (node->decl); |
6816d0c4 | 892 | |
91bf9d9a | 893 | /* Make sure to gimplify bodies only once. During analyzing a |
894 | function we lower it, which will require gimplified nested | |
895 | functions, so we can end up here with an already gimplified | |
896 | body. */ | |
897 | if (!gimple_body (decl)) | |
898 | gimplify_function_tree (decl); | |
899 | dump_function (TDI_generic, decl); | |
bfec3452 | 900 | |
91bf9d9a | 901 | cgraph_lower_function (node); |
902 | pop_cfun (); | |
903 | } | |
6e8d6e86 | 904 | node->analyzed = true; |
0785e435 | 905 | |
bfec3452 | 906 | current_function_decl = save; |
0785e435 | 907 | } |
908 | ||
c70f46b0 | 909 | /* C++ frontend produce same body aliases all over the place, even before PCH |
910 | gets streamed out. It relies on us linking the aliases with their function | |
911 | in order to do the fixups, but ipa-ref is not PCH safe. Consequentely we | |
912 | first produce aliases without links, but once C++ FE is sure he won't sream | |
913 | PCH we build the links via this function. */ | |
914 | ||
915 | void | |
916 | cgraph_process_same_body_aliases (void) | |
917 | { | |
918 | struct cgraph_node *node; | |
919 | for (node = cgraph_nodes; node; node = node->next) | |
920 | if (node->same_body_alias | |
921 | && !VEC_length (ipa_ref_t, node->ref_list.references)) | |
922 | { | |
923 | struct cgraph_node *tgt = cgraph_get_node (node->thunk.alias); | |
924 | ipa_record_reference (node, NULL, tgt, NULL, IPA_REF_ALIAS, NULL); | |
925 | } | |
926 | same_body_aliases_done = true; | |
927 | } | |
928 | ||
d05db70d | 929 | /* Process attributes common for vars and functions. */ |
930 | ||
931 | static void | |
932 | process_common_attributes (tree decl) | |
933 | { | |
934 | tree weakref = lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)); | |
935 | ||
936 | if (weakref && !lookup_attribute ("alias", DECL_ATTRIBUTES (decl))) | |
937 | { | |
938 | warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wattributes, | |
939 | "%<weakref%> attribute should be accompanied with" | |
940 | " an %<alias%> attribute"); | |
941 | DECL_WEAK (decl) = 0; | |
40b32d93 | 942 | DECL_ATTRIBUTES (decl) = remove_attribute ("weakref", |
943 | DECL_ATTRIBUTES (decl)); | |
d05db70d | 944 | } |
945 | } | |
946 | ||
05806473 | 947 | /* Look for externally_visible and used attributes and mark cgraph nodes |
948 | accordingly. | |
949 | ||
950 | We cannot mark the nodes at the point the attributes are processed (in | |
951 | handle_*_attribute) because the copy of the declarations available at that | |
952 | point may not be canonical. For example, in: | |
953 | ||
954 | void f(); | |
955 | void f() __attribute__((used)); | |
956 | ||
957 | the declaration we see in handle_used_attribute will be the second | |
958 | declaration -- but the front end will subsequently merge that declaration | |
959 | with the original declaration and discard the second declaration. | |
960 | ||
961 | Furthermore, we can't mark these nodes in cgraph_finalize_function because: | |
962 | ||
963 | void f() {} | |
964 | void f() __attribute__((externally_visible)); | |
965 | ||
966 | is valid. | |
967 | ||
968 | So, we walk the nodes at the end of the translation unit, applying the | |
969 | attributes at that point. */ | |
970 | ||
971 | static void | |
972 | process_function_and_variable_attributes (struct cgraph_node *first, | |
1d416bd7 | 973 | struct varpool_node *first_var) |
05806473 | 974 | { |
975 | struct cgraph_node *node; | |
1d416bd7 | 976 | struct varpool_node *vnode; |
05806473 | 977 | |
978 | for (node = cgraph_nodes; node != first; node = node->next) | |
979 | { | |
980 | tree decl = node->decl; | |
83a23b05 | 981 | if (DECL_PRESERVE_P (decl)) |
0b49f8f8 | 982 | cgraph_mark_needed_node (node); |
62433d51 | 983 | if (TARGET_DLLIMPORT_DECL_ATTRIBUTES |
984 | && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)) | |
985 | && TREE_PUBLIC (node->decl)) | |
986 | { | |
987 | if (node->local.finalized) | |
988 | cgraph_mark_needed_node (node); | |
989 | } | |
990 | else if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl))) | |
05806473 | 991 | { |
ba12ea31 | 992 | if (! TREE_PUBLIC (node->decl)) |
712d2297 | 993 | warning_at (DECL_SOURCE_LOCATION (node->decl), OPT_Wattributes, |
994 | "%<externally_visible%>" | |
995 | " attribute have effect only on public objects"); | |
59dd4830 | 996 | else if (node->local.finalized) |
997 | cgraph_mark_needed_node (node); | |
05806473 | 998 | } |
40b32d93 | 999 | if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)) |
c70f46b0 | 1000 | && (node->local.finalized && !node->alias)) |
40b32d93 | 1001 | { |
1002 | warning_at (DECL_SOURCE_LOCATION (node->decl), OPT_Wattributes, | |
1003 | "%<weakref%> attribute ignored" | |
1004 | " because function is defined"); | |
1005 | DECL_WEAK (decl) = 0; | |
1006 | DECL_ATTRIBUTES (decl) = remove_attribute ("weakref", | |
1007 | DECL_ATTRIBUTES (decl)); | |
1008 | } | |
a522e9eb | 1009 | |
1010 | if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (decl)) | |
1011 | && !DECL_DECLARED_INLINE_P (decl) | |
1012 | /* redefining extern inline function makes it DECL_UNINLINABLE. */ | |
1013 | && !DECL_UNINLINABLE (decl)) | |
1014 | warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wattributes, | |
1015 | "always_inline function might not be inlinable"); | |
1016 | ||
d05db70d | 1017 | process_common_attributes (decl); |
05806473 | 1018 | } |
1d416bd7 | 1019 | for (vnode = varpool_nodes; vnode != first_var; vnode = vnode->next) |
05806473 | 1020 | { |
1021 | tree decl = vnode->decl; | |
83a23b05 | 1022 | if (DECL_PRESERVE_P (decl)) |
05806473 | 1023 | { |
22671757 | 1024 | vnode->force_output = true; |
05806473 | 1025 | if (vnode->finalized) |
1d416bd7 | 1026 | varpool_mark_needed_node (vnode); |
05806473 | 1027 | } |
62433d51 | 1028 | if (TARGET_DLLIMPORT_DECL_ATTRIBUTES |
1029 | && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)) | |
0d9d5d69 | 1030 | && TREE_PUBLIC (vnode->decl)) |
62433d51 | 1031 | { |
1032 | if (vnode->finalized) | |
1033 | varpool_mark_needed_node (vnode); | |
1034 | } | |
1035 | else if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl))) | |
05806473 | 1036 | { |
ba12ea31 | 1037 | if (! TREE_PUBLIC (vnode->decl)) |
712d2297 | 1038 | warning_at (DECL_SOURCE_LOCATION (vnode->decl), OPT_Wattributes, |
1039 | "%<externally_visible%>" | |
1040 | " attribute have effect only on public objects"); | |
59dd4830 | 1041 | else if (vnode->finalized) |
1042 | varpool_mark_needed_node (vnode); | |
05806473 | 1043 | } |
40b32d93 | 1044 | if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)) |
1045 | && vnode->finalized | |
1046 | && DECL_INITIAL (decl)) | |
1047 | { | |
1048 | warning_at (DECL_SOURCE_LOCATION (vnode->decl), OPT_Wattributes, | |
1049 | "%<weakref%> attribute ignored" | |
1050 | " because variable is initialized"); | |
1051 | DECL_WEAK (decl) = 0; | |
1052 | DECL_ATTRIBUTES (decl) = remove_attribute ("weakref", | |
1053 | DECL_ATTRIBUTES (decl)); | |
1054 | } | |
d05db70d | 1055 | process_common_attributes (decl); |
05806473 | 1056 | } |
1057 | } | |
1058 | ||
aeeb194b | 1059 | /* Process CGRAPH_NODES_NEEDED queue, analyze each function (and transitively |
1060 | each reachable functions) and build cgraph. | |
1061 | The function can be called multiple times after inserting new nodes | |
0d424440 | 1062 | into beginning of queue. Just the new part of queue is re-scanned then. */ |
ae01b312 | 1063 | |
aeeb194b | 1064 | static void |
1065 | cgraph_analyze_functions (void) | |
ae01b312 | 1066 | { |
c1dcd13c | 1067 | /* Keep track of already processed nodes when called multiple times for |
06b27565 | 1068 | intermodule optimization. */ |
c1dcd13c | 1069 | static struct cgraph_node *first_analyzed; |
c17d0de1 | 1070 | struct cgraph_node *first_processed = first_analyzed; |
1d416bd7 | 1071 | static struct varpool_node *first_analyzed_var; |
aeeb194b | 1072 | struct cgraph_node *node, *next; |
ae01b312 | 1073 | |
f1c35659 | 1074 | bitmap_obstack_initialize (NULL); |
c17d0de1 | 1075 | process_function_and_variable_attributes (first_processed, |
1076 | first_analyzed_var); | |
1077 | first_processed = cgraph_nodes; | |
1d416bd7 | 1078 | first_analyzed_var = varpool_nodes; |
1079 | varpool_analyze_pending_decls (); | |
f79b6507 | 1080 | if (cgraph_dump_file) |
ae01b312 | 1081 | { |
e4200070 | 1082 | fprintf (cgraph_dump_file, "Initial entry points:"); |
c1dcd13c | 1083 | for (node = cgraph_nodes; node != first_analyzed; node = node->next) |
1a1a827a | 1084 | if (node->needed) |
f79b6507 | 1085 | fprintf (cgraph_dump_file, " %s", cgraph_node_name (node)); |
1086 | fprintf (cgraph_dump_file, "\n"); | |
ae01b312 | 1087 | } |
aeeb194b | 1088 | cgraph_process_new_functions (); |
ae01b312 | 1089 | |
e6d2b2d8 | 1090 | /* Propagate reachability flag and lower representation of all reachable |
1091 | functions. In the future, lowering will introduce new functions and | |
1092 | new entry points on the way (by template instantiation and virtual | |
1093 | method table generation for instance). */ | |
3d7bfc56 | 1094 | while (cgraph_nodes_queue) |
ae01b312 | 1095 | { |
0785e435 | 1096 | struct cgraph_edge *edge; |
3d7bfc56 | 1097 | tree decl = cgraph_nodes_queue->decl; |
1098 | ||
1099 | node = cgraph_nodes_queue; | |
d87976fb | 1100 | cgraph_nodes_queue = cgraph_nodes_queue->next_needed; |
b0cdf642 | 1101 | node->next_needed = NULL; |
ae01b312 | 1102 | |
638531ad | 1103 | /* ??? It is possible to create extern inline function and later using |
bbd5cba2 | 1104 | weak alias attribute to kill its body. See |
638531ad | 1105 | gcc.c-torture/compile/20011119-1.c */ |
91bf9d9a | 1106 | if (!DECL_STRUCT_FUNCTION (decl) |
c70f46b0 | 1107 | && (!node->alias || !node->thunk.alias) |
91bf9d9a | 1108 | && !node->thunk.thunk_p) |
9b8fb23a | 1109 | { |
1110 | cgraph_reset_node (node); | |
443089c1 | 1111 | node->local.redefined_extern_inline = true; |
9b8fb23a | 1112 | continue; |
1113 | } | |
638531ad | 1114 | |
7bfefa9d | 1115 | if (!node->analyzed) |
1116 | cgraph_analyze_function (node); | |
2c0b522d | 1117 | |
ae01b312 | 1118 | for (edge = node->callees; edge; edge = edge->next_callee) |
0785e435 | 1119 | if (!edge->callee->reachable) |
2c0b522d | 1120 | cgraph_mark_reachable_node (edge->callee); |
91bf9d9a | 1121 | for (edge = node->callers; edge; edge = edge->next_caller) |
1122 | if (!edge->caller->reachable && edge->caller->thunk.thunk_p) | |
1123 | cgraph_mark_reachable_node (edge->caller); | |
2c0b522d | 1124 | |
61c2c7b1 | 1125 | if (node->same_comdat_group) |
1126 | { | |
1127 | for (next = node->same_comdat_group; | |
1128 | next != node; | |
1129 | next = next->same_comdat_group) | |
1130 | cgraph_mark_reachable_node (next); | |
1131 | } | |
1132 | ||
d544ceff | 1133 | /* If decl is a clone of an abstract function, mark that abstract |
1134 | function so that we don't release its body. The DECL_INITIAL() of that | |
fd6a3c41 | 1135 | abstract function declaration will be later needed to output debug |
1136 | info. */ | |
d544ceff | 1137 | if (DECL_ABSTRACT_ORIGIN (decl)) |
1138 | { | |
fd6a3c41 | 1139 | struct cgraph_node *origin_node; |
1140 | origin_node = cgraph_get_node (DECL_ABSTRACT_ORIGIN (decl)); | |
d544ceff | 1141 | origin_node->abstract_and_needed = true; |
1142 | } | |
1143 | ||
c17d0de1 | 1144 | /* We finalize local static variables during constructing callgraph |
1145 | edges. Process their attributes too. */ | |
1146 | process_function_and_variable_attributes (first_processed, | |
1147 | first_analyzed_var); | |
1148 | first_processed = cgraph_nodes; | |
1d416bd7 | 1149 | first_analyzed_var = varpool_nodes; |
1150 | varpool_analyze_pending_decls (); | |
aeeb194b | 1151 | cgraph_process_new_functions (); |
ae01b312 | 1152 | } |
2c0b522d | 1153 | |
aa5e06c7 | 1154 | /* Collect entry points to the unit. */ |
f79b6507 | 1155 | if (cgraph_dump_file) |
3d7bfc56 | 1156 | { |
e4200070 | 1157 | fprintf (cgraph_dump_file, "Unit entry points:"); |
c1dcd13c | 1158 | for (node = cgraph_nodes; node != first_analyzed; node = node->next) |
1a1a827a | 1159 | if (node->needed) |
f79b6507 | 1160 | fprintf (cgraph_dump_file, " %s", cgraph_node_name (node)); |
e4200070 | 1161 | fprintf (cgraph_dump_file, "\n\nInitial "); |
0785e435 | 1162 | dump_cgraph (cgraph_dump_file); |
7410370b | 1163 | dump_varpool (cgraph_dump_file); |
3d7bfc56 | 1164 | } |
e6d2b2d8 | 1165 | |
f79b6507 | 1166 | if (cgraph_dump_file) |
1167 | fprintf (cgraph_dump_file, "\nReclaiming functions:"); | |
ae01b312 | 1168 | |
f4ec5ce1 | 1169 | for (node = cgraph_nodes; node != first_analyzed; node = next) |
ae01b312 | 1170 | { |
1171 | tree decl = node->decl; | |
f4ec5ce1 | 1172 | next = node->next; |
ae01b312 | 1173 | |
91bf9d9a | 1174 | if (node->local.finalized && !gimple_has_body_p (decl) |
c70f46b0 | 1175 | && (!node->alias || !node->thunk.alias) |
91bf9d9a | 1176 | && !node->thunk.thunk_p) |
a0c938f0 | 1177 | cgraph_reset_node (node); |
9b8fb23a | 1178 | |
91bf9d9a | 1179 | if (!node->reachable |
c70f46b0 | 1180 | && (gimple_has_body_p (decl) || node->thunk.thunk_p |
1181 | || (node->alias && node->thunk.alias))) | |
ae01b312 | 1182 | { |
f79b6507 | 1183 | if (cgraph_dump_file) |
1184 | fprintf (cgraph_dump_file, " %s", cgraph_node_name (node)); | |
b0cdf642 | 1185 | cgraph_remove_node (node); |
9b8fb23a | 1186 | continue; |
ae01b312 | 1187 | } |
bc5cab3b | 1188 | else |
1189 | node->next_needed = NULL; | |
91bf9d9a | 1190 | gcc_assert (!node->local.finalized || node->thunk.thunk_p |
c70f46b0 | 1191 | || node->alias |
91bf9d9a | 1192 | || gimple_has_body_p (decl)); |
9b8fb23a | 1193 | gcc_assert (node->analyzed == node->local.finalized); |
ae01b312 | 1194 | } |
f79b6507 | 1195 | if (cgraph_dump_file) |
e4200070 | 1196 | { |
1197 | fprintf (cgraph_dump_file, "\n\nReclaimed "); | |
1198 | dump_cgraph (cgraph_dump_file); | |
7410370b | 1199 | dump_varpool (cgraph_dump_file); |
e4200070 | 1200 | } |
f1c35659 | 1201 | bitmap_obstack_release (NULL); |
c1dcd13c | 1202 | first_analyzed = cgraph_nodes; |
ae01b312 | 1203 | ggc_collect (); |
aeeb194b | 1204 | } |
1205 | ||
3a849bc1 | 1206 | /* Translate the ugly representation of aliases as alias pairs into nice |
1207 | representation in callgraph. We don't handle all cases yet, | |
1208 | unforutnately. */ | |
1209 | ||
1210 | static void | |
1211 | handle_alias_pairs (void) | |
1212 | { | |
1213 | alias_pair *p; | |
1214 | unsigned i; | |
1215 | struct cgraph_node *target_node; | |
1216 | struct cgraph_node *src_node; | |
e0eaac80 | 1217 | struct varpool_node *target_vnode; |
3a849bc1 | 1218 | |
1219 | for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p);) | |
1220 | { | |
1221 | if (TREE_CODE (p->decl) == FUNCTION_DECL | |
3a849bc1 | 1222 | && (target_node = cgraph_node_for_asm (p->target)) != NULL) |
1223 | { | |
1224 | src_node = cgraph_get_node (p->decl); | |
1225 | if (src_node && src_node->local.finalized) | |
1226 | cgraph_reset_node (src_node); | |
1227 | /* Normally EXTERNAL flag is used to mark external inlines, | |
1228 | however for aliases it seems to be allowed to use it w/o | |
1229 | any meaning. See gcc.dg/attr-alias-3.c | |
1230 | However for weakref we insist on EXTERNAL flag being set. | |
1231 | See gcc.dg/attr-alias-5.c */ | |
1232 | if (DECL_EXTERNAL (p->decl)) | |
5e712541 | 1233 | DECL_EXTERNAL (p->decl) = lookup_attribute ("weakref", |
1234 | DECL_ATTRIBUTES (p->decl)) != NULL; | |
3a849bc1 | 1235 | cgraph_create_function_alias (p->decl, target_node->decl); |
1236 | VEC_unordered_remove (alias_pair, alias_pairs, i); | |
1237 | } | |
e0eaac80 | 1238 | else if (TREE_CODE (p->decl) == VAR_DECL |
e0eaac80 | 1239 | && (target_vnode = varpool_node_for_asm (p->target)) != NULL) |
1240 | { | |
1241 | /* Normally EXTERNAL flag is used to mark external inlines, | |
1242 | however for aliases it seems to be allowed to use it w/o | |
1243 | any meaning. See gcc.dg/attr-alias-3.c | |
1244 | However for weakref we insist on EXTERNAL flag being set. | |
1245 | See gcc.dg/attr-alias-5.c */ | |
1246 | if (DECL_EXTERNAL (p->decl)) | |
5e712541 | 1247 | DECL_EXTERNAL (p->decl) = lookup_attribute ("weakref", |
1248 | DECL_ATTRIBUTES (p->decl)) != NULL; | |
e0eaac80 | 1249 | varpool_create_variable_alias (p->decl, target_vnode->decl); |
1250 | VEC_unordered_remove (alias_pair, alias_pairs, i); | |
1251 | } | |
badeded8 | 1252 | /* Weakrefs with target not defined in current unit are easy to handle; they |
1253 | behave just as external variables except we need to note the alias flag | |
1254 | to later output the weakref pseudo op into asm file. */ | |
1255 | else if (lookup_attribute ("weakref", DECL_ATTRIBUTES (p->decl)) != NULL | |
1256 | && (TREE_CODE (p->decl) == FUNCTION_DECL | |
1257 | ? (varpool_node_for_asm (p->target) == NULL) | |
1258 | : (cgraph_node_for_asm (p->target) == NULL))) | |
1259 | { | |
1260 | if (TREE_CODE (p->decl) == FUNCTION_DECL) | |
1261 | cgraph_get_create_node (p->decl)->alias = true; | |
1262 | else | |
1263 | varpool_get_node (p->decl)->alias = true; | |
1264 | DECL_EXTERNAL (p->decl) = 1; | |
1265 | VEC_unordered_remove (alias_pair, alias_pairs, i); | |
1266 | } | |
3a849bc1 | 1267 | else |
1268 | { | |
1269 | if (dump_file) | |
1270 | fprintf (dump_file, "Unhandled alias %s->%s\n", | |
1271 | IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (p->decl)), | |
1272 | IDENTIFIER_POINTER (p->target)); | |
1273 | ||
1274 | i++; | |
1275 | } | |
1276 | } | |
1277 | } | |
1278 | ||
8f69fd82 | 1279 | |
aeeb194b | 1280 | /* Analyze the whole compilation unit once it is parsed completely. */ |
1281 | ||
1282 | void | |
1283 | cgraph_finalize_compilation_unit (void) | |
1284 | { | |
9929334e | 1285 | timevar_push (TV_CGRAPH); |
1286 | ||
a0605d65 | 1287 | /* If LTO is enabled, initialize the streamer hooks needed by GIMPLE. */ |
1288 | if (flag_lto) | |
1289 | lto_streamer_hooks_init (); | |
1290 | ||
bb903e9c | 1291 | /* If we're here there's no current function anymore. Some frontends |
1292 | are lazy in clearing these. */ | |
1293 | current_function_decl = NULL; | |
1294 | set_cfun (NULL); | |
1295 | ||
bfec3452 | 1296 | /* Do not skip analyzing the functions if there were errors, we |
1297 | miss diagnostics for following functions otherwise. */ | |
aeeb194b | 1298 | |
8f69fd82 | 1299 | /* Emit size functions we didn't inline. */ |
4189e677 | 1300 | finalize_size_functions (); |
8f69fd82 | 1301 | |
9929334e | 1302 | /* Mark alias targets necessary and emit diagnostics. */ |
1303 | finish_aliases_1 (); | |
3a849bc1 | 1304 | handle_alias_pairs (); |
9929334e | 1305 | |
aeeb194b | 1306 | if (!quiet_flag) |
1307 | { | |
1308 | fprintf (stderr, "\nAnalyzing compilation unit\n"); | |
1309 | fflush (stderr); | |
1310 | } | |
1311 | ||
ec4791a8 | 1312 | if (flag_dump_passes) |
1313 | dump_passes (); | |
1314 | ||
9929334e | 1315 | /* Gimplify and lower all functions, compute reachability and |
1316 | remove unreachable nodes. */ | |
1317 | cgraph_analyze_functions (); | |
1318 | ||
8f69fd82 | 1319 | /* Mark alias targets necessary and emit diagnostics. */ |
1320 | finish_aliases_1 (); | |
3a849bc1 | 1321 | handle_alias_pairs (); |
8f69fd82 | 1322 | |
9929334e | 1323 | /* Gimplify and lower thunks. */ |
aeeb194b | 1324 | cgraph_analyze_functions (); |
bfec3452 | 1325 | |
9929334e | 1326 | /* Finally drive the pass manager. */ |
bfec3452 | 1327 | cgraph_optimize (); |
9929334e | 1328 | |
1329 | timevar_pop (TV_CGRAPH); | |
ae01b312 | 1330 | } |
9ed5b1f5 | 1331 | |
1332 | ||
ae01b312 | 1333 | /* Figure out what functions we want to assemble. */ |
1334 | ||
1335 | static void | |
d9d9733a | 1336 | cgraph_mark_functions_to_output (void) |
ae01b312 | 1337 | { |
1338 | struct cgraph_node *node; | |
61c2c7b1 | 1339 | #ifdef ENABLE_CHECKING |
1340 | bool check_same_comdat_groups = false; | |
1341 | ||
1342 | for (node = cgraph_nodes; node; node = node->next) | |
1343 | gcc_assert (!node->process); | |
1344 | #endif | |
ae01b312 | 1345 | |
ae01b312 | 1346 | for (node = cgraph_nodes; node; node = node->next) |
1347 | { | |
1348 | tree decl = node->decl; | |
d7c6d889 | 1349 | struct cgraph_edge *e; |
a0c938f0 | 1350 | |
61c2c7b1 | 1351 | gcc_assert (!node->process || node->same_comdat_group); |
1352 | if (node->process) | |
1353 | continue; | |
d7c6d889 | 1354 | |
1355 | for (e = node->callers; e; e = e->next_caller) | |
611e5405 | 1356 | if (e->inline_failed) |
d7c6d889 | 1357 | break; |
ae01b312 | 1358 | |
e6d2b2d8 | 1359 | /* We need to output all local functions that are used and not |
1360 | always inlined, as well as those that are reachable from | |
1361 | outside the current compilation unit. */ | |
1a1a827a | 1362 | if (node->analyzed |
91bf9d9a | 1363 | && !node->thunk.thunk_p |
c70f46b0 | 1364 | && !node->alias |
b0cdf642 | 1365 | && !node->global.inlined_to |
1e3aebec | 1366 | && (!cgraph_only_called_directly_p (node) |
c70f46b0 | 1367 | || ((e || ipa_ref_has_aliases_p (&node->ref_list)) |
1368 | && node->reachable)) | |
4ee9c684 | 1369 | && !TREE_ASM_WRITTEN (decl) |
ae01b312 | 1370 | && !DECL_EXTERNAL (decl)) |
61c2c7b1 | 1371 | { |
1372 | node->process = 1; | |
1373 | if (node->same_comdat_group) | |
1374 | { | |
1375 | struct cgraph_node *next; | |
1376 | for (next = node->same_comdat_group; | |
1377 | next != node; | |
1378 | next = next->same_comdat_group) | |
c70f46b0 | 1379 | if (!next->thunk.thunk_p && !next->alias) |
91bf9d9a | 1380 | next->process = 1; |
61c2c7b1 | 1381 | } |
1382 | } | |
1383 | else if (node->same_comdat_group) | |
1384 | { | |
1385 | #ifdef ENABLE_CHECKING | |
1386 | check_same_comdat_groups = true; | |
1387 | #endif | |
1388 | } | |
cc636d56 | 1389 | else |
9cee7c3f | 1390 | { |
1391 | /* We should've reclaimed all functions that are not needed. */ | |
1392 | #ifdef ENABLE_CHECKING | |
75a70cf9 | 1393 | if (!node->global.inlined_to |
1a1a827a | 1394 | && gimple_has_body_p (decl) |
08843223 | 1395 | /* FIXME: in ltrans unit when offline copy is outside partition but inline copies |
1396 | are inside partition, we can end up not removing the body since we no longer | |
1397 | have analyzed node pointing to it. */ | |
1398 | && !node->in_other_partition | |
c70f46b0 | 1399 | && !node->alias |
9cee7c3f | 1400 | && !DECL_EXTERNAL (decl)) |
1401 | { | |
1402 | dump_cgraph_node (stderr, node); | |
1403 | internal_error ("failed to reclaim unneeded function"); | |
1404 | } | |
1405 | #endif | |
75a70cf9 | 1406 | gcc_assert (node->global.inlined_to |
1a1a827a | 1407 | || !gimple_has_body_p (decl) |
08843223 | 1408 | || node->in_other_partition |
9cee7c3f | 1409 | || DECL_EXTERNAL (decl)); |
1410 | ||
1411 | } | |
a0c938f0 | 1412 | |
961e3b13 | 1413 | } |
61c2c7b1 | 1414 | #ifdef ENABLE_CHECKING |
1415 | if (check_same_comdat_groups) | |
1416 | for (node = cgraph_nodes; node; node = node->next) | |
1417 | if (node->same_comdat_group && !node->process) | |
1418 | { | |
1419 | tree decl = node->decl; | |
1420 | if (!node->global.inlined_to | |
1421 | && gimple_has_body_p (decl) | |
08843223 | 1422 | /* FIXME: in ltrans unit when offline copy is outside partition but inline copies |
1423 | are inside partition, we can end up not removing the body since we no longer | |
1424 | have analyzed node pointing to it. */ | |
1425 | && !node->in_other_partition | |
61c2c7b1 | 1426 | && !DECL_EXTERNAL (decl)) |
1427 | { | |
1428 | dump_cgraph_node (stderr, node); | |
c70f46b0 | 1429 | internal_error ("failed to reclaim unneeded functionin same comdat group"); |
61c2c7b1 | 1430 | } |
1431 | } | |
1432 | #endif | |
961e3b13 | 1433 | } |
1434 | ||
28454517 | 1435 | /* DECL is FUNCTION_DECL. Initialize datastructures so DECL is a function |
1436 | in lowered gimple form. | |
1437 | ||
1438 | Set current_function_decl and cfun to newly constructed empty function body. | |
1439 | return basic block in the function body. */ | |
1440 | ||
1441 | static basic_block | |
1442 | init_lowered_empty_function (tree decl) | |
1443 | { | |
1444 | basic_block bb; | |
1445 | ||
1446 | current_function_decl = decl; | |
1447 | allocate_struct_function (decl, false); | |
1448 | gimple_register_cfg_hooks (); | |
1449 | init_empty_tree_cfg (); | |
1450 | init_tree_ssa (cfun); | |
1451 | init_ssa_operands (); | |
1452 | cfun->gimple_df->in_ssa_p = true; | |
1453 | DECL_INITIAL (decl) = make_node (BLOCK); | |
1454 | ||
1455 | DECL_SAVED_TREE (decl) = error_mark_node; | |
1456 | cfun->curr_properties |= | |
1457 | (PROP_gimple_lcf | PROP_gimple_leh | PROP_cfg | PROP_referenced_vars | | |
657e3a56 | 1458 | PROP_ssa | PROP_gimple_any); |
28454517 | 1459 | |
1460 | /* Create BB for body of the function and connect it properly. */ | |
1461 | bb = create_basic_block (NULL, (void *) 0, ENTRY_BLOCK_PTR); | |
167ef6d9 | 1462 | make_edge (ENTRY_BLOCK_PTR, bb, 0); |
1463 | make_edge (bb, EXIT_BLOCK_PTR, 0); | |
28454517 | 1464 | |
1465 | return bb; | |
1466 | } | |
1467 | ||
1468 | /* Adjust PTR by the constant FIXED_OFFSET, and by the vtable | |
1469 | offset indicated by VIRTUAL_OFFSET, if that is | |
1470 | non-null. THIS_ADJUSTING is nonzero for a this adjusting thunk and | |
1471 | zero for a result adjusting thunk. */ | |
1472 | ||
1473 | static tree | |
1474 | thunk_adjust (gimple_stmt_iterator * bsi, | |
1475 | tree ptr, bool this_adjusting, | |
1476 | HOST_WIDE_INT fixed_offset, tree virtual_offset) | |
1477 | { | |
1478 | gimple stmt; | |
1479 | tree ret; | |
1480 | ||
55d6cb23 | 1481 | if (this_adjusting |
1482 | && fixed_offset != 0) | |
28454517 | 1483 | { |
2cc66f2a | 1484 | stmt = gimple_build_assign |
1485 | (ptr, fold_build_pointer_plus_hwi_loc (input_location, | |
1486 | ptr, | |
1487 | fixed_offset)); | |
28454517 | 1488 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
1489 | } | |
1490 | ||
1491 | /* If there's a virtual offset, look up that value in the vtable and | |
1492 | adjust the pointer again. */ | |
1493 | if (virtual_offset) | |
1494 | { | |
1495 | tree vtabletmp; | |
1496 | tree vtabletmp2; | |
1497 | tree vtabletmp3; | |
28454517 | 1498 | |
1499 | if (!vtable_entry_type) | |
1500 | { | |
1501 | tree vfunc_type = make_node (FUNCTION_TYPE); | |
1502 | TREE_TYPE (vfunc_type) = integer_type_node; | |
1503 | TYPE_ARG_TYPES (vfunc_type) = NULL_TREE; | |
1504 | layout_type (vfunc_type); | |
1505 | ||
1506 | vtable_entry_type = build_pointer_type (vfunc_type); | |
1507 | } | |
1508 | ||
1509 | vtabletmp = | |
1510 | create_tmp_var (build_pointer_type | |
1511 | (build_pointer_type (vtable_entry_type)), "vptr"); | |
1512 | ||
1513 | /* The vptr is always at offset zero in the object. */ | |
1514 | stmt = gimple_build_assign (vtabletmp, | |
1515 | build1 (NOP_EXPR, TREE_TYPE (vtabletmp), | |
1516 | ptr)); | |
1517 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); | |
1518 | mark_symbols_for_renaming (stmt); | |
1519 | find_referenced_vars_in (stmt); | |
1520 | ||
1521 | /* Form the vtable address. */ | |
1522 | vtabletmp2 = create_tmp_var (TREE_TYPE (TREE_TYPE (vtabletmp)), | |
1523 | "vtableaddr"); | |
1524 | stmt = gimple_build_assign (vtabletmp2, | |
182cf5a9 | 1525 | build_simple_mem_ref (vtabletmp)); |
28454517 | 1526 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
1527 | mark_symbols_for_renaming (stmt); | |
1528 | find_referenced_vars_in (stmt); | |
1529 | ||
1530 | /* Find the entry with the vcall offset. */ | |
1531 | stmt = gimple_build_assign (vtabletmp2, | |
2cc66f2a | 1532 | fold_build_pointer_plus_loc (input_location, |
1533 | vtabletmp2, | |
1534 | virtual_offset)); | |
28454517 | 1535 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
1536 | ||
1537 | /* Get the offset itself. */ | |
1538 | vtabletmp3 = create_tmp_var (TREE_TYPE (TREE_TYPE (vtabletmp2)), | |
1539 | "vcalloffset"); | |
1540 | stmt = gimple_build_assign (vtabletmp3, | |
182cf5a9 | 1541 | build_simple_mem_ref (vtabletmp2)); |
28454517 | 1542 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
1543 | mark_symbols_for_renaming (stmt); | |
1544 | find_referenced_vars_in (stmt); | |
1545 | ||
28454517 | 1546 | /* Adjust the `this' pointer. */ |
a0553bff | 1547 | ptr = fold_build_pointer_plus_loc (input_location, ptr, vtabletmp3); |
1548 | ptr = force_gimple_operand_gsi (bsi, ptr, true, NULL_TREE, false, | |
1549 | GSI_CONTINUE_LINKING); | |
28454517 | 1550 | } |
1551 | ||
55d6cb23 | 1552 | if (!this_adjusting |
1553 | && fixed_offset != 0) | |
28454517 | 1554 | /* Adjust the pointer by the constant. */ |
1555 | { | |
1556 | tree ptrtmp; | |
1557 | ||
1558 | if (TREE_CODE (ptr) == VAR_DECL) | |
1559 | ptrtmp = ptr; | |
1560 | else | |
1561 | { | |
1562 | ptrtmp = create_tmp_var (TREE_TYPE (ptr), "ptr"); | |
1563 | stmt = gimple_build_assign (ptrtmp, ptr); | |
1564 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); | |
1565 | mark_symbols_for_renaming (stmt); | |
1566 | find_referenced_vars_in (stmt); | |
1567 | } | |
2cc66f2a | 1568 | ptr = fold_build_pointer_plus_hwi_loc (input_location, |
1569 | ptrtmp, fixed_offset); | |
28454517 | 1570 | } |
1571 | ||
1572 | /* Emit the statement and gimplify the adjustment expression. */ | |
1573 | ret = create_tmp_var (TREE_TYPE (ptr), "adjusted_this"); | |
1574 | stmt = gimple_build_assign (ret, ptr); | |
1575 | mark_symbols_for_renaming (stmt); | |
1576 | find_referenced_vars_in (stmt); | |
1577 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); | |
1578 | ||
1579 | return ret; | |
1580 | } | |
1581 | ||
1582 | /* Produce assembler for thunk NODE. */ | |
1583 | ||
1584 | static void | |
1585 | assemble_thunk (struct cgraph_node *node) | |
1586 | { | |
1587 | bool this_adjusting = node->thunk.this_adjusting; | |
1588 | HOST_WIDE_INT fixed_offset = node->thunk.fixed_offset; | |
1589 | HOST_WIDE_INT virtual_value = node->thunk.virtual_value; | |
1590 | tree virtual_offset = NULL; | |
1591 | tree alias = node->thunk.alias; | |
1592 | tree thunk_fndecl = node->decl; | |
1593 | tree a = DECL_ARGUMENTS (thunk_fndecl); | |
1594 | ||
1595 | current_function_decl = thunk_fndecl; | |
1596 | ||
aed6e608 | 1597 | /* Ensure thunks are emitted in their correct sections. */ |
1598 | resolve_unique_section (thunk_fndecl, 0, flag_function_sections); | |
1599 | ||
28454517 | 1600 | if (this_adjusting |
1601 | && targetm.asm_out.can_output_mi_thunk (thunk_fndecl, fixed_offset, | |
1602 | virtual_value, alias)) | |
1603 | { | |
1604 | const char *fnname; | |
1605 | tree fn_block; | |
28b2c6a7 | 1606 | tree restype = TREE_TYPE (TREE_TYPE (thunk_fndecl)); |
28454517 | 1607 | |
1608 | DECL_RESULT (thunk_fndecl) | |
1609 | = build_decl (DECL_SOURCE_LOCATION (thunk_fndecl), | |
28b2c6a7 | 1610 | RESULT_DECL, 0, restype); |
22ea3b47 | 1611 | fnname = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk_fndecl)); |
28454517 | 1612 | |
1613 | /* The back end expects DECL_INITIAL to contain a BLOCK, so we | |
1614 | create one. */ | |
1615 | fn_block = make_node (BLOCK); | |
1616 | BLOCK_VARS (fn_block) = a; | |
1617 | DECL_INITIAL (thunk_fndecl) = fn_block; | |
1618 | init_function_start (thunk_fndecl); | |
1619 | cfun->is_thunk = 1; | |
1620 | assemble_start_function (thunk_fndecl, fnname); | |
1621 | ||
1622 | targetm.asm_out.output_mi_thunk (asm_out_file, thunk_fndecl, | |
1623 | fixed_offset, virtual_value, alias); | |
1624 | ||
1625 | assemble_end_function (thunk_fndecl, fnname); | |
1626 | init_insn_lengths (); | |
1627 | free_after_compilation (cfun); | |
1628 | set_cfun (NULL); | |
1629 | TREE_ASM_WRITTEN (thunk_fndecl) = 1; | |
91bf9d9a | 1630 | node->thunk.thunk_p = false; |
1631 | node->analyzed = false; | |
28454517 | 1632 | } |
1633 | else | |
1634 | { | |
1635 | tree restype; | |
1636 | basic_block bb, then_bb, else_bb, return_bb; | |
1637 | gimple_stmt_iterator bsi; | |
1638 | int nargs = 0; | |
1639 | tree arg; | |
1640 | int i; | |
1641 | tree resdecl; | |
1642 | tree restmp = NULL; | |
1643 | VEC(tree, heap) *vargs; | |
1644 | ||
1645 | gimple call; | |
1646 | gimple ret; | |
1647 | ||
1648 | DECL_IGNORED_P (thunk_fndecl) = 1; | |
1649 | bitmap_obstack_initialize (NULL); | |
1650 | ||
1651 | if (node->thunk.virtual_offset_p) | |
1652 | virtual_offset = size_int (virtual_value); | |
1653 | ||
1654 | /* Build the return declaration for the function. */ | |
1655 | restype = TREE_TYPE (TREE_TYPE (thunk_fndecl)); | |
1656 | if (DECL_RESULT (thunk_fndecl) == NULL_TREE) | |
1657 | { | |
1658 | resdecl = build_decl (input_location, RESULT_DECL, 0, restype); | |
1659 | DECL_ARTIFICIAL (resdecl) = 1; | |
1660 | DECL_IGNORED_P (resdecl) = 1; | |
1661 | DECL_RESULT (thunk_fndecl) = resdecl; | |
1662 | } | |
1663 | else | |
1664 | resdecl = DECL_RESULT (thunk_fndecl); | |
1665 | ||
1666 | bb = then_bb = else_bb = return_bb = init_lowered_empty_function (thunk_fndecl); | |
1667 | ||
1668 | bsi = gsi_start_bb (bb); | |
1669 | ||
1670 | /* Build call to the function being thunked. */ | |
1671 | if (!VOID_TYPE_P (restype)) | |
1672 | { | |
1673 | if (!is_gimple_reg_type (restype)) | |
1674 | { | |
1675 | restmp = resdecl; | |
2ab2ce89 | 1676 | add_local_decl (cfun, restmp); |
28454517 | 1677 | BLOCK_VARS (DECL_INITIAL (current_function_decl)) = restmp; |
1678 | } | |
1679 | else | |
1680 | restmp = create_tmp_var_raw (restype, "retval"); | |
1681 | } | |
1682 | ||
1767a056 | 1683 | for (arg = a; arg; arg = DECL_CHAIN (arg)) |
28454517 | 1684 | nargs++; |
1685 | vargs = VEC_alloc (tree, heap, nargs); | |
1686 | if (this_adjusting) | |
1687 | VEC_quick_push (tree, vargs, | |
1688 | thunk_adjust (&bsi, | |
1689 | a, 1, fixed_offset, | |
1690 | virtual_offset)); | |
1691 | else | |
1692 | VEC_quick_push (tree, vargs, a); | |
1767a056 | 1693 | for (i = 1, arg = DECL_CHAIN (a); i < nargs; i++, arg = DECL_CHAIN (arg)) |
28454517 | 1694 | VEC_quick_push (tree, vargs, arg); |
1695 | call = gimple_build_call_vec (build_fold_addr_expr_loc (0, alias), vargs); | |
1696 | VEC_free (tree, heap, vargs); | |
28454517 | 1697 | gimple_call_set_from_thunk (call, true); |
1698 | if (restmp) | |
1699 | gimple_call_set_lhs (call, restmp); | |
1700 | gsi_insert_after (&bsi, call, GSI_NEW_STMT); | |
1701 | mark_symbols_for_renaming (call); | |
1702 | find_referenced_vars_in (call); | |
1703 | update_stmt (call); | |
1704 | ||
1705 | if (restmp && !this_adjusting) | |
1706 | { | |
57ab8ec3 | 1707 | tree true_label = NULL_TREE; |
28454517 | 1708 | |
1709 | if (TREE_CODE (TREE_TYPE (restmp)) == POINTER_TYPE) | |
1710 | { | |
1711 | gimple stmt; | |
1712 | /* If the return type is a pointer, we need to | |
1713 | protect against NULL. We know there will be an | |
1714 | adjustment, because that's why we're emitting a | |
1715 | thunk. */ | |
1716 | then_bb = create_basic_block (NULL, (void *) 0, bb); | |
1717 | return_bb = create_basic_block (NULL, (void *) 0, then_bb); | |
1718 | else_bb = create_basic_block (NULL, (void *) 0, else_bb); | |
1719 | remove_edge (single_succ_edge (bb)); | |
1720 | true_label = gimple_block_label (then_bb); | |
28454517 | 1721 | stmt = gimple_build_cond (NE_EXPR, restmp, |
385f3f36 | 1722 | build_zero_cst (TREE_TYPE (restmp)), |
28454517 | 1723 | NULL_TREE, NULL_TREE); |
1724 | gsi_insert_after (&bsi, stmt, GSI_NEW_STMT); | |
1725 | make_edge (bb, then_bb, EDGE_TRUE_VALUE); | |
1726 | make_edge (bb, else_bb, EDGE_FALSE_VALUE); | |
1727 | make_edge (return_bb, EXIT_BLOCK_PTR, 0); | |
1728 | make_edge (then_bb, return_bb, EDGE_FALLTHRU); | |
1729 | make_edge (else_bb, return_bb, EDGE_FALLTHRU); | |
1730 | bsi = gsi_last_bb (then_bb); | |
1731 | } | |
1732 | ||
1733 | restmp = thunk_adjust (&bsi, restmp, /*this_adjusting=*/0, | |
1734 | fixed_offset, virtual_offset); | |
1735 | if (true_label) | |
1736 | { | |
1737 | gimple stmt; | |
1738 | bsi = gsi_last_bb (else_bb); | |
385f3f36 | 1739 | stmt = gimple_build_assign (restmp, |
1740 | build_zero_cst (TREE_TYPE (restmp))); | |
28454517 | 1741 | gsi_insert_after (&bsi, stmt, GSI_NEW_STMT); |
1742 | bsi = gsi_last_bb (return_bb); | |
1743 | } | |
1744 | } | |
1745 | else | |
1746 | gimple_call_set_tail (call, true); | |
1747 | ||
1748 | /* Build return value. */ | |
1749 | ret = gimple_build_return (restmp); | |
1750 | gsi_insert_after (&bsi, ret, GSI_NEW_STMT); | |
1751 | ||
1752 | delete_unreachable_blocks (); | |
1753 | update_ssa (TODO_update_ssa); | |
1754 | ||
28454517 | 1755 | /* Since we want to emit the thunk, we explicitly mark its name as |
1756 | referenced. */ | |
91bf9d9a | 1757 | node->thunk.thunk_p = false; |
1758 | cgraph_node_remove_callees (node); | |
28454517 | 1759 | cgraph_add_new_function (thunk_fndecl, true); |
1760 | bitmap_obstack_release (NULL); | |
1761 | } | |
1762 | current_function_decl = NULL; | |
1763 | } | |
1764 | ||
91bf9d9a | 1765 | |
c70f46b0 | 1766 | |
1767 | /* Assemble thunks and aliases asociated to NODE. */ | |
91bf9d9a | 1768 | |
1769 | static void | |
c70f46b0 | 1770 | assemble_thunks_and_aliases (struct cgraph_node *node) |
91bf9d9a | 1771 | { |
1772 | struct cgraph_edge *e; | |
c70f46b0 | 1773 | int i; |
1774 | struct ipa_ref *ref; | |
1775 | ||
91bf9d9a | 1776 | for (e = node->callers; e;) |
1777 | if (e->caller->thunk.thunk_p) | |
1778 | { | |
1779 | struct cgraph_node *thunk = e->caller; | |
1780 | ||
1781 | e = e->next_caller; | |
c70f46b0 | 1782 | assemble_thunks_and_aliases (thunk); |
91bf9d9a | 1783 | assemble_thunk (thunk); |
1784 | } | |
1785 | else | |
1786 | e = e->next_caller; | |
c70f46b0 | 1787 | for (i = 0; ipa_ref_list_refering_iterate (&node->ref_list, i, ref); i++) |
1788 | if (ref->use == IPA_REF_ALIAS) | |
1789 | { | |
1790 | struct cgraph_node *alias = ipa_ref_refering_node (ref); | |
968b8c52 | 1791 | bool saved_written = TREE_ASM_WRITTEN (alias->thunk.alias); |
1792 | ||
1793 | /* Force assemble_alias to really output the alias this time instead | |
1794 | of buffering it in same alias pairs. */ | |
1795 | TREE_ASM_WRITTEN (alias->thunk.alias) = 1; | |
c70f46b0 | 1796 | assemble_alias (alias->decl, |
1797 | DECL_ASSEMBLER_NAME (alias->thunk.alias)); | |
1798 | assemble_thunks_and_aliases (alias); | |
968b8c52 | 1799 | TREE_ASM_WRITTEN (alias->thunk.alias) = saved_written; |
c70f46b0 | 1800 | } |
91bf9d9a | 1801 | } |
1802 | ||
ae01b312 | 1803 | /* Expand function specified by NODE. */ |
e6d2b2d8 | 1804 | |
ae01b312 | 1805 | static void |
d9d9733a | 1806 | cgraph_expand_function (struct cgraph_node *node) |
ae01b312 | 1807 | { |
1808 | tree decl = node->decl; | |
1809 | ||
b0cdf642 | 1810 | /* We ought to not compile any inline clones. */ |
cc636d56 | 1811 | gcc_assert (!node->global.inlined_to); |
b0cdf642 | 1812 | |
6329636b | 1813 | announce_function (decl); |
09fc9532 | 1814 | node->process = 0; |
f7777314 | 1815 | gcc_assert (node->lowered); |
1816 | ||
1817 | /* Generate RTL for the body of DECL. */ | |
1818 | tree_rest_of_compilation (decl); | |
1819 | ||
1820 | /* Make sure that BE didn't give up on compiling. */ | |
1821 | gcc_assert (TREE_ASM_WRITTEN (decl)); | |
1822 | current_function_decl = NULL; | |
cc91b414 | 1823 | gcc_assert (!cgraph_preserve_function_body_p (node)); |
f76f7453 | 1824 | |
1825 | /* It would make a lot more sense to output thunks before function body to get more | |
1826 | forward and lest backwarding jumps. This is however would need solving problem | |
1827 | with comdats. See PR48668. Also aliases must come after function itself to | |
1828 | make one pass assemblers, like one on AIX happy. See PR 50689. | |
1829 | FIXME: Perhaps thunks should be move before function IFF they are not in comdat | |
1830 | groups. */ | |
1831 | assemble_thunks_and_aliases (node); | |
1a1a827a | 1832 | cgraph_release_function_body (node); |
1833 | /* Eliminate all call edges. This is important so the GIMPLE_CALL no longer | |
1834 | points to the dead function body. */ | |
1835 | cgraph_node_remove_callees (node); | |
e1be32b8 | 1836 | |
1837 | cgraph_function_flags_ready = true; | |
ae01b312 | 1838 | } |
1839 | ||
b0cdf642 | 1840 | /* Return true when CALLER_DECL should be inlined into CALLEE_DECL. */ |
d7c6d889 | 1841 | |
1842 | bool | |
326a9581 | 1843 | cgraph_inline_p (struct cgraph_edge *e, cgraph_inline_failed_t *reason) |
d7c6d889 | 1844 | { |
b0cdf642 | 1845 | *reason = e->inline_failed; |
1846 | return !e->inline_failed; | |
d7c6d889 | 1847 | } |
b0cdf642 | 1848 | |
acc70efa | 1849 | |
acc70efa | 1850 | |
d9d9733a | 1851 | /* Expand all functions that must be output. |
1852 | ||
d7c6d889 | 1853 | Attempt to topologically sort the nodes so function is output when |
1854 | all called functions are already assembled to allow data to be | |
91c82c20 | 1855 | propagated across the callgraph. Use a stack to get smaller distance |
3927afe0 | 1856 | between a function and its callees (later we may choose to use a more |
d7c6d889 | 1857 | sophisticated algorithm for function reordering; we will likely want |
1858 | to use subsections to make the output functions appear in top-down | |
1859 | order). */ | |
1860 | ||
1861 | static void | |
a6868229 | 1862 | cgraph_expand_all_functions (void) |
d7c6d889 | 1863 | { |
1864 | struct cgraph_node *node; | |
4c36ffe6 | 1865 | struct cgraph_node **order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes); |
c04e3894 | 1866 | int order_pos, new_order_pos = 0; |
d7c6d889 | 1867 | int i; |
1868 | ||
7771d558 | 1869 | order_pos = ipa_reverse_postorder (order); |
cc636d56 | 1870 | gcc_assert (order_pos == cgraph_n_nodes); |
d7c6d889 | 1871 | |
7bd28bba | 1872 | /* Garbage collector may remove inline clones we eliminate during |
b0cdf642 | 1873 | optimization. So we must be sure to not reference them. */ |
1874 | for (i = 0; i < order_pos; i++) | |
09fc9532 | 1875 | if (order[i]->process) |
b0cdf642 | 1876 | order[new_order_pos++] = order[i]; |
1877 | ||
1878 | for (i = new_order_pos - 1; i >= 0; i--) | |
d7c6d889 | 1879 | { |
1880 | node = order[i]; | |
09fc9532 | 1881 | if (node->process) |
d7c6d889 | 1882 | { |
cc636d56 | 1883 | gcc_assert (node->reachable); |
09fc9532 | 1884 | node->process = 0; |
d7c6d889 | 1885 | cgraph_expand_function (node); |
1886 | } | |
1887 | } | |
523c1122 | 1888 | cgraph_process_new_functions (); |
773c5ba7 | 1889 | |
d7c6d889 | 1890 | free (order); |
773c5ba7 | 1891 | |
d7c6d889 | 1892 | } |
1893 | ||
56af936e | 1894 | /* This is used to sort the node types by the cgraph order number. */ |
1895 | ||
0b09525f | 1896 | enum cgraph_order_sort_kind |
1897 | { | |
1898 | ORDER_UNDEFINED = 0, | |
1899 | ORDER_FUNCTION, | |
1900 | ORDER_VAR, | |
1901 | ORDER_ASM | |
1902 | }; | |
1903 | ||
56af936e | 1904 | struct cgraph_order_sort |
1905 | { | |
0b09525f | 1906 | enum cgraph_order_sort_kind kind; |
56af936e | 1907 | union |
1908 | { | |
1909 | struct cgraph_node *f; | |
1d416bd7 | 1910 | struct varpool_node *v; |
56af936e | 1911 | struct cgraph_asm_node *a; |
1912 | } u; | |
1913 | }; | |
1914 | ||
1915 | /* Output all functions, variables, and asm statements in the order | |
1916 | according to their order fields, which is the order in which they | |
1917 | appeared in the file. This implements -fno-toplevel-reorder. In | |
1918 | this mode we may output functions and variables which don't really | |
1919 | need to be output. */ | |
1920 | ||
1921 | static void | |
1922 | cgraph_output_in_order (void) | |
1923 | { | |
1924 | int max; | |
56af936e | 1925 | struct cgraph_order_sort *nodes; |
1926 | int i; | |
1927 | struct cgraph_node *pf; | |
1d416bd7 | 1928 | struct varpool_node *pv; |
56af936e | 1929 | struct cgraph_asm_node *pa; |
1930 | ||
1931 | max = cgraph_order; | |
3e1cde87 | 1932 | nodes = XCNEWVEC (struct cgraph_order_sort, max); |
56af936e | 1933 | |
1d416bd7 | 1934 | varpool_analyze_pending_decls (); |
56af936e | 1935 | |
1936 | for (pf = cgraph_nodes; pf; pf = pf->next) | |
1937 | { | |
c70f46b0 | 1938 | if (pf->process && !pf->thunk.thunk_p && !pf->alias) |
56af936e | 1939 | { |
1940 | i = pf->order; | |
1941 | gcc_assert (nodes[i].kind == ORDER_UNDEFINED); | |
1942 | nodes[i].kind = ORDER_FUNCTION; | |
1943 | nodes[i].u.f = pf; | |
1944 | } | |
1945 | } | |
1946 | ||
1d416bd7 | 1947 | for (pv = varpool_nodes_queue; pv; pv = pv->next_needed) |
56af936e | 1948 | { |
1949 | i = pv->order; | |
1950 | gcc_assert (nodes[i].kind == ORDER_UNDEFINED); | |
1951 | nodes[i].kind = ORDER_VAR; | |
1952 | nodes[i].u.v = pv; | |
1953 | } | |
1954 | ||
1955 | for (pa = cgraph_asm_nodes; pa; pa = pa->next) | |
1956 | { | |
1957 | i = pa->order; | |
1958 | gcc_assert (nodes[i].kind == ORDER_UNDEFINED); | |
1959 | nodes[i].kind = ORDER_ASM; | |
1960 | nodes[i].u.a = pa; | |
1961 | } | |
56af936e | 1962 | |
304e5318 | 1963 | /* In toplevel reorder mode we output all statics; mark them as needed. */ |
1964 | for (i = 0; i < max; ++i) | |
1965 | { | |
1966 | if (nodes[i].kind == ORDER_VAR) | |
1967 | { | |
1968 | varpool_mark_needed_node (nodes[i].u.v); | |
1969 | } | |
1970 | } | |
1971 | varpool_empty_needed_queue (); | |
1972 | ||
91da0f1c | 1973 | for (i = 0; i < max; ++i) |
1974 | if (nodes[i].kind == ORDER_VAR) | |
1975 | varpool_finalize_named_section_flags (nodes[i].u.v); | |
1976 | ||
56af936e | 1977 | for (i = 0; i < max; ++i) |
1978 | { | |
1979 | switch (nodes[i].kind) | |
1980 | { | |
1981 | case ORDER_FUNCTION: | |
09fc9532 | 1982 | nodes[i].u.f->process = 0; |
56af936e | 1983 | cgraph_expand_function (nodes[i].u.f); |
1984 | break; | |
1985 | ||
1986 | case ORDER_VAR: | |
1d416bd7 | 1987 | varpool_assemble_decl (nodes[i].u.v); |
56af936e | 1988 | break; |
1989 | ||
1990 | case ORDER_ASM: | |
1991 | assemble_asm (nodes[i].u.a->asm_str); | |
1992 | break; | |
1993 | ||
1994 | case ORDER_UNDEFINED: | |
1995 | break; | |
1996 | ||
1997 | default: | |
1998 | gcc_unreachable (); | |
1999 | } | |
2000 | } | |
4b4ea2db | 2001 | |
2002 | cgraph_asm_nodes = NULL; | |
3e1cde87 | 2003 | free (nodes); |
56af936e | 2004 | } |
2005 | ||
b0cdf642 | 2006 | /* Return true when function body of DECL still needs to be kept around |
2007 | for later re-use. */ | |
2008 | bool | |
cc91b414 | 2009 | cgraph_preserve_function_body_p (struct cgraph_node *node) |
b0cdf642 | 2010 | { |
8d8c4c8d | 2011 | gcc_assert (cgraph_global_info_ready); |
c70f46b0 | 2012 | gcc_assert (!node->alias && !node->thunk.thunk_p); |
cc91b414 | 2013 | |
b0cdf642 | 2014 | /* Look if there is any clone around. */ |
ccf4ab6b | 2015 | if (node->clones) |
2016 | return true; | |
b0cdf642 | 2017 | return false; |
2018 | } | |
2019 | ||
77fce4cd | 2020 | static void |
2021 | ipa_passes (void) | |
2022 | { | |
87d4aa85 | 2023 | set_cfun (NULL); |
4b14adf9 | 2024 | current_function_decl = NULL; |
75a70cf9 | 2025 | gimple_register_cfg_hooks (); |
77fce4cd | 2026 | bitmap_obstack_initialize (NULL); |
59dd4830 | 2027 | |
c9036234 | 2028 | invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_START, NULL); |
2029 | ||
59dd4830 | 2030 | if (!in_lto_p) |
7b2e8956 | 2031 | { |
2032 | execute_ipa_pass_list (all_small_ipa_passes); | |
2033 | if (seen_error ()) | |
2034 | return; | |
2035 | } | |
9ed5b1f5 | 2036 | |
941125aa | 2037 | /* We never run removal of unreachable nodes after early passes. This is |
2038 | because TODO is run before the subpasses. It is important to remove | |
2039 | the unreachable functions to save works at IPA level and to get LTO | |
2040 | symbol tables right. */ | |
2041 | cgraph_remove_unreachable_nodes (true, cgraph_dump_file); | |
2042 | ||
7bfefa9d | 2043 | /* If pass_all_early_optimizations was not scheduled, the state of |
2044 | the cgraph will not be properly updated. Update it now. */ | |
2045 | if (cgraph_state < CGRAPH_STATE_IPA_SSA) | |
2046 | cgraph_state = CGRAPH_STATE_IPA_SSA; | |
9ed5b1f5 | 2047 | |
7bfefa9d | 2048 | if (!in_lto_p) |
2049 | { | |
2050 | /* Generate coverage variables and constructors. */ | |
2051 | coverage_finish (); | |
2052 | ||
2053 | /* Process new functions added. */ | |
2054 | set_cfun (NULL); | |
2055 | current_function_decl = NULL; | |
2056 | cgraph_process_new_functions (); | |
7bfefa9d | 2057 | |
c9036234 | 2058 | execute_ipa_summary_passes |
2059 | ((struct ipa_opt_pass_d *) all_regular_ipa_passes); | |
8867b500 | 2060 | } |
23433d72 | 2061 | |
2062 | /* Some targets need to handle LTO assembler output specially. */ | |
2063 | if (flag_generate_lto) | |
2064 | targetm.asm_out.lto_start (); | |
2065 | ||
7bfefa9d | 2066 | execute_ipa_summary_passes ((struct ipa_opt_pass_d *) all_lto_gen_passes); |
2067 | ||
2068 | if (!in_lto_p) | |
2069 | ipa_write_summaries (); | |
2070 | ||
23433d72 | 2071 | if (flag_generate_lto) |
2072 | targetm.asm_out.lto_end (); | |
2073 | ||
b33542ab | 2074 | if (!flag_ltrans && (in_lto_p || !flag_lto || flag_fat_lto_objects)) |
8867b500 | 2075 | execute_ipa_pass_list (all_regular_ipa_passes); |
c9036234 | 2076 | invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_END, NULL); |
9ed5b1f5 | 2077 | |
77fce4cd | 2078 | bitmap_obstack_release (NULL); |
2079 | } | |
2080 | ||
badeded8 | 2081 | |
2082 | /* Return string alias is alias of. */ | |
2083 | ||
2084 | static tree | |
2085 | get_alias_symbol (tree decl) | |
2086 | { | |
2087 | tree alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl)); | |
2088 | return get_identifier (TREE_STRING_POINTER | |
2089 | (TREE_VALUE (TREE_VALUE (alias)))); | |
2090 | } | |
2091 | ||
2092 | ||
5e712541 | 2093 | /* Weakrefs may be associated to external decls and thus not output |
2094 | at expansion time. Emit all neccesary aliases. */ | |
2095 | ||
5139ff04 | 2096 | static void |
5e712541 | 2097 | output_weakrefs (void) |
2098 | { | |
2099 | struct cgraph_node *node; | |
2100 | struct varpool_node *vnode; | |
2101 | for (node = cgraph_nodes; node; node = node->next) | |
badeded8 | 2102 | if (node->alias && DECL_EXTERNAL (node->decl) |
892b9268 | 2103 | && !TREE_ASM_WRITTEN (node->decl) |
2104 | && lookup_attribute ("weakref", DECL_ATTRIBUTES (node->decl))) | |
5e712541 | 2105 | assemble_alias (node->decl, |
badeded8 | 2106 | node->thunk.alias ? DECL_ASSEMBLER_NAME (node->thunk.alias) |
2107 | : get_alias_symbol (node->decl)); | |
5e712541 | 2108 | for (vnode = varpool_nodes; vnode; vnode = vnode->next) |
badeded8 | 2109 | if (vnode->alias && DECL_EXTERNAL (vnode->decl) |
892b9268 | 2110 | && !TREE_ASM_WRITTEN (vnode->decl) |
2111 | && lookup_attribute ("weakref", DECL_ATTRIBUTES (vnode->decl))) | |
5e712541 | 2112 | assemble_alias (vnode->decl, |
badeded8 | 2113 | vnode->alias_of ? DECL_ASSEMBLER_NAME (vnode->alias_of) |
2114 | : get_alias_symbol (vnode->decl)); | |
5e712541 | 2115 | } |
2116 | ||
34e5cced | 2117 | |
ae01b312 | 2118 | /* Perform simple optimizations based on callgraph. */ |
2119 | ||
7bfefa9d | 2120 | void |
d9d9733a | 2121 | cgraph_optimize (void) |
ae01b312 | 2122 | { |
852f689e | 2123 | if (seen_error ()) |
cb2b5570 | 2124 | return; |
2125 | ||
b0cdf642 | 2126 | #ifdef ENABLE_CHECKING |
2127 | verify_cgraph (); | |
2128 | #endif | |
a861fe52 | 2129 | |
c1dcd13c | 2130 | /* Frontend may output common variables after the unit has been finalized. |
2131 | It is safe to deal with them here as they are always zero initialized. */ | |
1d416bd7 | 2132 | varpool_analyze_pending_decls (); |
e9f08e82 | 2133 | |
f79b6507 | 2134 | timevar_push (TV_CGRAPHOPT); |
51949610 | 2135 | if (pre_ipa_mem_report) |
2136 | { | |
2137 | fprintf (stderr, "Memory consumption before IPA\n"); | |
2138 | dump_memory_report (false); | |
2139 | } | |
d7c6d889 | 2140 | if (!quiet_flag) |
cd6bca02 | 2141 | fprintf (stderr, "Performing interprocedural optimizations\n"); |
523c1122 | 2142 | cgraph_state = CGRAPH_STATE_IPA; |
c04e3894 | 2143 | |
be4d0974 | 2144 | /* Don't run the IPA passes if there was any error or sorry messages. */ |
852f689e | 2145 | if (!seen_error ()) |
be4d0974 | 2146 | ipa_passes (); |
2147 | ||
b33542ab | 2148 | /* Do nothing else if any IPA pass found errors or if we are just streaming LTO. */ |
2149 | if (seen_error () | |
2150 | || (!in_lto_p && flag_lto && !flag_fat_lto_objects)) | |
021c1c18 | 2151 | { |
2152 | timevar_pop (TV_CGRAPHOPT); | |
2153 | return; | |
2154 | } | |
34e5cced | 2155 | |
e1be32b8 | 2156 | /* This pass remove bodies of extern inline functions we never inlined. |
2157 | Do this later so other IPA passes see what is really going on. */ | |
2158 | cgraph_remove_unreachable_nodes (false, dump_file); | |
80a85d8a | 2159 | cgraph_global_info_ready = true; |
f79b6507 | 2160 | if (cgraph_dump_file) |
2161 | { | |
e4200070 | 2162 | fprintf (cgraph_dump_file, "Optimized "); |
f79b6507 | 2163 | dump_cgraph (cgraph_dump_file); |
c1dcd13c | 2164 | dump_varpool (cgraph_dump_file); |
f79b6507 | 2165 | } |
51949610 | 2166 | if (post_ipa_mem_report) |
2167 | { | |
defa2fa6 | 2168 | fprintf (stderr, "Memory consumption after IPA\n"); |
51949610 | 2169 | dump_memory_report (false); |
2170 | } | |
f79b6507 | 2171 | timevar_pop (TV_CGRAPHOPT); |
ae01b312 | 2172 | |
d7c6d889 | 2173 | /* Output everything. */ |
47306a5d | 2174 | (*debug_hooks->assembly_start) (); |
e4200070 | 2175 | if (!quiet_flag) |
2176 | fprintf (stderr, "Assembling functions:\n"); | |
b0cdf642 | 2177 | #ifdef ENABLE_CHECKING |
2178 | verify_cgraph (); | |
2179 | #endif | |
56af936e | 2180 | |
ccf4ab6b | 2181 | cgraph_materialize_all_clones (); |
657e3a56 | 2182 | bitmap_obstack_initialize (NULL); |
2183 | execute_ipa_pass_list (all_late_ipa_passes); | |
2184 | cgraph_remove_unreachable_nodes (true, dump_file); | |
2185 | #ifdef ENABLE_CHECKING | |
2186 | verify_cgraph (); | |
2187 | #endif | |
2188 | bitmap_obstack_release (NULL); | |
acc70efa | 2189 | cgraph_mark_functions_to_output (); |
5c8ad8f5 | 2190 | output_weakrefs (); |
c1dcd13c | 2191 | |
523c1122 | 2192 | cgraph_state = CGRAPH_STATE_EXPANSION; |
56af936e | 2193 | if (!flag_toplevel_reorder) |
2194 | cgraph_output_in_order (); | |
2195 | else | |
2196 | { | |
2197 | cgraph_output_pending_asms (); | |
2198 | ||
2199 | cgraph_expand_all_functions (); | |
1d416bd7 | 2200 | varpool_remove_unreferenced_decls (); |
56af936e | 2201 | |
1d416bd7 | 2202 | varpool_assemble_pending_decls (); |
56af936e | 2203 | } |
5e712541 | 2204 | |
523c1122 | 2205 | cgraph_process_new_functions (); |
2206 | cgraph_state = CGRAPH_STATE_FINISHED; | |
c1dcd13c | 2207 | |
f79b6507 | 2208 | if (cgraph_dump_file) |
2209 | { | |
e4200070 | 2210 | fprintf (cgraph_dump_file, "\nFinal "); |
f79b6507 | 2211 | dump_cgraph (cgraph_dump_file); |
7410370b | 2212 | dump_varpool (cgraph_dump_file); |
f79b6507 | 2213 | } |
b0cdf642 | 2214 | #ifdef ENABLE_CHECKING |
2215 | verify_cgraph (); | |
4ee9c684 | 2216 | /* Double check that all inline clones are gone and that all |
2217 | function bodies have been released from memory. */ | |
852f689e | 2218 | if (!seen_error ()) |
4ee9c684 | 2219 | { |
2220 | struct cgraph_node *node; | |
2221 | bool error_found = false; | |
2222 | ||
2223 | for (node = cgraph_nodes; node; node = node->next) | |
2224 | if (node->analyzed | |
2225 | && (node->global.inlined_to | |
1a1a827a | 2226 | || gimple_has_body_p (node->decl))) |
4ee9c684 | 2227 | { |
2228 | error_found = true; | |
2229 | dump_cgraph_node (stderr, node); | |
a0c938f0 | 2230 | } |
4ee9c684 | 2231 | if (error_found) |
c04e3894 | 2232 | internal_error ("nodes with unreleased memory found"); |
4ee9c684 | 2233 | } |
b0cdf642 | 2234 | #endif |
ae01b312 | 2235 | } |
34e5cced | 2236 | |
121f3051 | 2237 | void |
2238 | init_cgraph (void) | |
2239 | { | |
01ec0a6c | 2240 | if (!cgraph_dump_file) |
2241 | cgraph_dump_file = dump_begin (TDI_cgraph, NULL); | |
121f3051 | 2242 | } |
b5d36404 | 2243 | |
a0c938f0 | 2244 | /* The edges representing the callers of the NEW_VERSION node were |
b5d36404 | 2245 | fixed by cgraph_function_versioning (), now the call_expr in their |
2246 | respective tree code should be updated to call the NEW_VERSION. */ | |
2247 | ||
2248 | static void | |
2249 | update_call_expr (struct cgraph_node *new_version) | |
2250 | { | |
2251 | struct cgraph_edge *e; | |
2252 | ||
2253 | gcc_assert (new_version); | |
75a70cf9 | 2254 | |
2255 | /* Update the call expr on the edges to call the new version. */ | |
b5d36404 | 2256 | for (e = new_version->callers; e; e = e->next_caller) |
e03a95e7 | 2257 | { |
2258 | struct function *inner_function = DECL_STRUCT_FUNCTION (e->caller->decl); | |
2259 | gimple_call_set_fndecl (e->call_stmt, new_version->decl); | |
e38def9c | 2260 | maybe_clean_eh_stmt_fn (inner_function, e->call_stmt); |
e03a95e7 | 2261 | } |
b5d36404 | 2262 | } |
2263 | ||
2264 | ||
2265 | /* Create a new cgraph node which is the new version of | |
2266 | OLD_VERSION node. REDIRECT_CALLERS holds the callers | |
2267 | edges which should be redirected to point to | |
2268 | NEW_VERSION. ALL the callees edges of OLD_VERSION | |
2269 | are cloned to the new version node. Return the new | |
b06ab5fa | 2270 | version node. |
2271 | ||
2272 | If non-NULL BLOCK_TO_COPY determine what basic blocks | |
2273 | was copied to prevent duplications of calls that are dead | |
2274 | in the clone. */ | |
b5d36404 | 2275 | |
4c0315d0 | 2276 | struct cgraph_node * |
b5d36404 | 2277 | cgraph_copy_node_for_versioning (struct cgraph_node *old_version, |
4460a647 | 2278 | tree new_decl, |
b06ab5fa | 2279 | VEC(cgraph_edge_p,heap) *redirect_callers, |
2280 | bitmap bbs_to_copy) | |
2281 | { | |
b5d36404 | 2282 | struct cgraph_node *new_version; |
32936803 | 2283 | struct cgraph_edge *e; |
b5d36404 | 2284 | unsigned i; |
2285 | ||
2286 | gcc_assert (old_version); | |
a0c938f0 | 2287 | |
5a90471f | 2288 | new_version = cgraph_create_node (new_decl); |
b5d36404 | 2289 | |
4c0315d0 | 2290 | new_version->analyzed = old_version->analyzed; |
b5d36404 | 2291 | new_version->local = old_version->local; |
a70a5e2c | 2292 | new_version->local.externally_visible = false; |
2293 | new_version->local.local = true; | |
b5d36404 | 2294 | new_version->global = old_version->global; |
a93f1c3b | 2295 | new_version->rtl = old_version->rtl; |
b5d36404 | 2296 | new_version->reachable = true; |
2297 | new_version->count = old_version->count; | |
2298 | ||
a70a5e2c | 2299 | for (e = old_version->callees; e; e=e->next_callee) |
b06ab5fa | 2300 | if (!bbs_to_copy |
2301 | || bitmap_bit_p (bbs_to_copy, gimple_bb (e->call_stmt)->index)) | |
2302 | cgraph_clone_edge (e, new_version, e->call_stmt, | |
2303 | e->lto_stmt_uid, REG_BR_PROB_BASE, | |
2304 | CGRAPH_FREQ_BASE, | |
0835ad03 | 2305 | true); |
a70a5e2c | 2306 | for (e = old_version->indirect_calls; e; e=e->next_callee) |
b06ab5fa | 2307 | if (!bbs_to_copy |
2308 | || bitmap_bit_p (bbs_to_copy, gimple_bb (e->call_stmt)->index)) | |
2309 | cgraph_clone_edge (e, new_version, e->call_stmt, | |
2310 | e->lto_stmt_uid, REG_BR_PROB_BASE, | |
2311 | CGRAPH_FREQ_BASE, | |
0835ad03 | 2312 | true); |
48148244 | 2313 | FOR_EACH_VEC_ELT (cgraph_edge_p, redirect_callers, i, e) |
4460a647 | 2314 | { |
2315 | /* Redirect calls to the old version node to point to its new | |
2316 | version. */ | |
2317 | cgraph_redirect_edge_callee (e, new_version); | |
2318 | } | |
b5d36404 | 2319 | |
ad687a96 | 2320 | cgraph_call_node_duplication_hooks (old_version, new_version); |
2321 | ||
b5d36404 | 2322 | return new_version; |
2323 | } | |
2324 | ||
2325 | /* Perform function versioning. | |
a0c938f0 | 2326 | Function versioning includes copying of the tree and |
b5d36404 | 2327 | a callgraph update (creating a new cgraph node and updating |
2328 | its callees and callers). | |
2329 | ||
2330 | REDIRECT_CALLERS varray includes the edges to be redirected | |
2331 | to the new version. | |
2332 | ||
2333 | TREE_MAP is a mapping of tree nodes we want to replace with | |
2334 | new ones (according to results of prior analysis). | |
2335 | OLD_VERSION_NODE is the node that is versioned. | |
7a3ec978 | 2336 | |
b06ab5fa | 2337 | If non-NULL ARGS_TO_SKIP determine function parameters to remove |
2338 | from new version. | |
7a3ec978 | 2339 | If SKIP_RETURN is true, the new version will return void. |
b06ab5fa | 2340 | If non-NULL BLOCK_TO_COPY determine what basic blocks to copy. |
7a3ec978 | 2341 | If non_NULL NEW_ENTRY determine new entry BB of the clone. |
2342 | ||
2343 | Return the new version's cgraph node. */ | |
b5d36404 | 2344 | |
2345 | struct cgraph_node * | |
2346 | cgraph_function_versioning (struct cgraph_node *old_version_node, | |
4460a647 | 2347 | VEC(cgraph_edge_p,heap) *redirect_callers, |
ccf4ab6b | 2348 | VEC (ipa_replace_map_p,gc)* tree_map, |
a70a5e2c | 2349 | bitmap args_to_skip, |
7a3ec978 | 2350 | bool skip_return, |
b06ab5fa | 2351 | bitmap bbs_to_copy, |
2352 | basic_block new_entry_block, | |
a70a5e2c | 2353 | const char *clone_name) |
b5d36404 | 2354 | { |
2355 | tree old_decl = old_version_node->decl; | |
2356 | struct cgraph_node *new_version_node = NULL; | |
2357 | tree new_decl; | |
2358 | ||
2359 | if (!tree_versionable_function_p (old_decl)) | |
2360 | return NULL; | |
2361 | ||
3c97c75d | 2362 | gcc_assert (old_version_node->local.can_change_signature || !args_to_skip); |
2363 | ||
7a3ec978 | 2364 | /* Make a new FUNCTION_DECL tree node for the new version. */ |
2365 | if (!args_to_skip && !skip_return) | |
5afe38fe | 2366 | new_decl = copy_node (old_decl); |
2367 | else | |
7a3ec978 | 2368 | new_decl |
2369 | = build_function_decl_skip_args (old_decl, args_to_skip, skip_return); | |
b5d36404 | 2370 | |
df0b8dfb | 2371 | /* Generate a new name for the new version. */ |
2372 | DECL_NAME (new_decl) = clone_function_name (old_decl, clone_name); | |
2373 | SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl)); | |
2374 | SET_DECL_RTL (new_decl, NULL); | |
2375 | ||
e54aa8a4 | 2376 | /* When the old decl was a con-/destructor make sure the clone isn't. */ |
2377 | DECL_STATIC_CONSTRUCTOR(new_decl) = 0; | |
2378 | DECL_STATIC_DESTRUCTOR(new_decl) = 0; | |
2379 | ||
b5d36404 | 2380 | /* Create the new version's call-graph node. |
2381 | and update the edges of the new node. */ | |
2382 | new_version_node = | |
2383 | cgraph_copy_node_for_versioning (old_version_node, new_decl, | |
b06ab5fa | 2384 | redirect_callers, bbs_to_copy); |
b5d36404 | 2385 | |
2386 | /* Copy the OLD_VERSION_NODE function tree to the new version. */ | |
b06ab5fa | 2387 | tree_function_versioning (old_decl, new_decl, tree_map, false, args_to_skip, |
7a3ec978 | 2388 | skip_return, bbs_to_copy, new_entry_block); |
b5d36404 | 2389 | |
a0c938f0 | 2390 | /* Update the new version's properties. |
e03a95e7 | 2391 | Make The new version visible only within this translation unit. Make sure |
2392 | that is not weak also. | |
a0c938f0 | 2393 | ??? We cannot use COMDAT linkage because there is no |
b5d36404 | 2394 | ABI support for this. */ |
6137cc9f | 2395 | cgraph_make_decl_local (new_version_node->decl); |
f014e39d | 2396 | DECL_VIRTUAL_P (new_version_node->decl) = 0; |
b5d36404 | 2397 | new_version_node->local.externally_visible = 0; |
2398 | new_version_node->local.local = 1; | |
2399 | new_version_node->lowered = true; | |
f014e39d | 2400 | |
e03a95e7 | 2401 | /* Update the call_expr on the edges to call the new version node. */ |
2402 | update_call_expr (new_version_node); | |
48e1416a | 2403 | |
50828ed8 | 2404 | cgraph_call_function_insertion_hooks (new_version_node); |
b5d36404 | 2405 | return new_version_node; |
2406 | } | |
469679ab | 2407 | |
ccf4ab6b | 2408 | /* Given virtual clone, turn it into actual clone. */ |
2409 | static void | |
2410 | cgraph_materialize_clone (struct cgraph_node *node) | |
2411 | { | |
2412 | bitmap_obstack_initialize (NULL); | |
e748b31d | 2413 | node->former_clone_of = node->clone_of->decl; |
2414 | if (node->clone_of->former_clone_of) | |
2415 | node->former_clone_of = node->clone_of->former_clone_of; | |
ccf4ab6b | 2416 | /* Copy the OLD_VERSION_NODE function tree to the new version. */ |
2417 | tree_function_versioning (node->clone_of->decl, node->decl, | |
2418 | node->clone.tree_map, true, | |
7a3ec978 | 2419 | node->clone.args_to_skip, false, |
2420 | NULL, NULL); | |
e20422ea | 2421 | if (cgraph_dump_file) |
2422 | { | |
2423 | dump_function_to_file (node->clone_of->decl, cgraph_dump_file, dump_flags); | |
2424 | dump_function_to_file (node->decl, cgraph_dump_file, dump_flags); | |
2425 | } | |
ccf4ab6b | 2426 | |
2427 | /* Function is no longer clone. */ | |
2428 | if (node->next_sibling_clone) | |
2429 | node->next_sibling_clone->prev_sibling_clone = node->prev_sibling_clone; | |
2430 | if (node->prev_sibling_clone) | |
2431 | node->prev_sibling_clone->next_sibling_clone = node->next_sibling_clone; | |
2432 | else | |
2433 | node->clone_of->clones = node->next_sibling_clone; | |
2434 | node->next_sibling_clone = NULL; | |
2435 | node->prev_sibling_clone = NULL; | |
6d1cc52c | 2436 | if (!node->clone_of->analyzed && !node->clone_of->clones) |
7d6a1ec8 | 2437 | { |
2438 | cgraph_release_function_body (node->clone_of); | |
2439 | cgraph_node_remove_callees (node->clone_of); | |
2440 | ipa_remove_all_references (&node->clone_of->ref_list); | |
2441 | } | |
ccf4ab6b | 2442 | node->clone_of = NULL; |
2443 | bitmap_obstack_release (NULL); | |
2444 | } | |
2445 | ||
c596d830 | 2446 | /* If necessary, change the function declaration in the call statement |
2447 | associated with E so that it corresponds to the edge callee. */ | |
2448 | ||
2449 | gimple | |
2450 | cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge *e) | |
2451 | { | |
2452 | tree decl = gimple_call_fndecl (e->call_stmt); | |
2453 | gimple new_stmt; | |
3fd0ca33 | 2454 | gimple_stmt_iterator gsi; |
1f449108 | 2455 | #ifdef ENABLE_CHECKING |
2456 | struct cgraph_node *node; | |
2457 | #endif | |
c596d830 | 2458 | |
1caef38b | 2459 | if (e->indirect_unknown_callee |
0a31490e | 2460 | || decl == e->callee->decl) |
c596d830 | 2461 | return e->call_stmt; |
2462 | ||
1f449108 | 2463 | #ifdef ENABLE_CHECKING |
1caef38b | 2464 | if (decl) |
2465 | { | |
2466 | node = cgraph_get_node (decl); | |
2467 | gcc_assert (!node || !node->clone.combined_args_to_skip); | |
2468 | } | |
1f449108 | 2469 | #endif |
e748b31d | 2470 | |
c596d830 | 2471 | if (cgraph_dump_file) |
2472 | { | |
2473 | fprintf (cgraph_dump_file, "updating call of %s/%i -> %s/%i: ", | |
2474 | cgraph_node_name (e->caller), e->caller->uid, | |
2475 | cgraph_node_name (e->callee), e->callee->uid); | |
2476 | print_gimple_stmt (cgraph_dump_file, e->call_stmt, 0, dump_flags); | |
e748b31d | 2477 | if (e->callee->clone.combined_args_to_skip) |
91aba934 | 2478 | { |
2479 | fprintf (cgraph_dump_file, " combined args to skip: "); | |
2480 | dump_bitmap (cgraph_dump_file, | |
2481 | e->callee->clone.combined_args_to_skip); | |
e748b31d | 2482 | } |
c596d830 | 2483 | } |
2484 | ||
2485 | if (e->callee->clone.combined_args_to_skip) | |
91aba934 | 2486 | { |
092cd838 | 2487 | int lp_nr; |
91aba934 | 2488 | |
2489 | new_stmt | |
2490 | = gimple_call_copy_skip_args (e->call_stmt, | |
2491 | e->callee->clone.combined_args_to_skip); | |
75c7f5a5 | 2492 | gimple_call_set_fndecl (new_stmt, e->callee->decl); |
91aba934 | 2493 | |
2494 | if (gimple_vdef (new_stmt) | |
2495 | && TREE_CODE (gimple_vdef (new_stmt)) == SSA_NAME) | |
2496 | SSA_NAME_DEF_STMT (gimple_vdef (new_stmt)) = new_stmt; | |
2497 | ||
d4e80e2b | 2498 | gsi = gsi_for_stmt (e->call_stmt); |
9126b675 | 2499 | gsi_replace (&gsi, new_stmt, false); |
092cd838 | 2500 | /* We need to defer cleaning EH info on the new statement to |
2501 | fixup-cfg. We may not have dominator information at this point | |
2502 | and thus would end up with unreachable blocks and have no way | |
2503 | to communicate that we need to run CFG cleanup then. */ | |
2504 | lp_nr = lookup_stmt_eh_lp (e->call_stmt); | |
2505 | if (lp_nr != 0) | |
2506 | { | |
2507 | remove_stmt_from_eh_lp (e->call_stmt); | |
2508 | add_stmt_to_eh_lp (new_stmt, lp_nr); | |
2509 | } | |
91aba934 | 2510 | } |
c596d830 | 2511 | else |
75c7f5a5 | 2512 | { |
2513 | new_stmt = e->call_stmt; | |
2514 | gimple_call_set_fndecl (new_stmt, e->callee->decl); | |
2515 | update_stmt (new_stmt); | |
2516 | } | |
c596d830 | 2517 | |
c596d830 | 2518 | cgraph_set_call_stmt_including_clones (e->caller, e->call_stmt, new_stmt); |
2519 | ||
2520 | if (cgraph_dump_file) | |
2521 | { | |
2522 | fprintf (cgraph_dump_file, " updated to:"); | |
2523 | print_gimple_stmt (cgraph_dump_file, e->call_stmt, 0, dump_flags); | |
2524 | } | |
2525 | return new_stmt; | |
2526 | } | |
2527 | ||
ccf4ab6b | 2528 | /* Once all functions from compilation unit are in memory, produce all clones |
c596d830 | 2529 | and update all calls. We might also do this on demand if we don't want to |
2530 | bring all functions to memory prior compilation, but current WHOPR | |
2531 | implementation does that and it is is bit easier to keep everything right in | |
2532 | this order. */ | |
ccf4ab6b | 2533 | void |
2534 | cgraph_materialize_all_clones (void) | |
2535 | { | |
2536 | struct cgraph_node *node; | |
2537 | bool stabilized = false; | |
2538 | ||
2539 | if (cgraph_dump_file) | |
2540 | fprintf (cgraph_dump_file, "Materializing clones\n"); | |
2541 | #ifdef ENABLE_CHECKING | |
2542 | verify_cgraph (); | |
2543 | #endif | |
2544 | ||
2545 | /* We can also do topological order, but number of iterations should be | |
2546 | bounded by number of IPA passes since single IPA pass is probably not | |
2547 | going to create clones of clones it created itself. */ | |
2548 | while (!stabilized) | |
2549 | { | |
2550 | stabilized = true; | |
2551 | for (node = cgraph_nodes; node; node = node->next) | |
2552 | { | |
2553 | if (node->clone_of && node->decl != node->clone_of->decl | |
2554 | && !gimple_has_body_p (node->decl)) | |
2555 | { | |
2556 | if (gimple_has_body_p (node->clone_of->decl)) | |
2557 | { | |
2558 | if (cgraph_dump_file) | |
e20422ea | 2559 | { |
0a10fd82 | 2560 | fprintf (cgraph_dump_file, "cloning %s to %s\n", |
e20422ea | 2561 | cgraph_node_name (node->clone_of), |
2562 | cgraph_node_name (node)); | |
2563 | if (node->clone.tree_map) | |
2564 | { | |
2565 | unsigned int i; | |
2566 | fprintf (cgraph_dump_file, " replace map: "); | |
2567 | for (i = 0; i < VEC_length (ipa_replace_map_p, | |
2568 | node->clone.tree_map); | |
2569 | i++) | |
2570 | { | |
2571 | struct ipa_replace_map *replace_info; | |
2572 | replace_info = VEC_index (ipa_replace_map_p, | |
2573 | node->clone.tree_map, | |
2574 | i); | |
2575 | print_generic_expr (cgraph_dump_file, replace_info->old_tree, 0); | |
2576 | fprintf (cgraph_dump_file, " -> "); | |
2577 | print_generic_expr (cgraph_dump_file, replace_info->new_tree, 0); | |
2578 | fprintf (cgraph_dump_file, "%s%s;", | |
2579 | replace_info->replace_p ? "(replace)":"", | |
2580 | replace_info->ref_p ? "(ref)":""); | |
2581 | } | |
2582 | fprintf (cgraph_dump_file, "\n"); | |
2583 | } | |
2584 | if (node->clone.args_to_skip) | |
2585 | { | |
2586 | fprintf (cgraph_dump_file, " args_to_skip: "); | |
2587 | dump_bitmap (cgraph_dump_file, node->clone.args_to_skip); | |
2588 | } | |
2589 | if (node->clone.args_to_skip) | |
2590 | { | |
2591 | fprintf (cgraph_dump_file, " combined_args_to_skip:"); | |
2592 | dump_bitmap (cgraph_dump_file, node->clone.combined_args_to_skip); | |
2593 | } | |
2594 | } | |
ccf4ab6b | 2595 | cgraph_materialize_clone (node); |
a510bd8d | 2596 | stabilized = false; |
ccf4ab6b | 2597 | } |
ccf4ab6b | 2598 | } |
2599 | } | |
2600 | } | |
ee3f5fc0 | 2601 | for (node = cgraph_nodes; node; node = node->next) |
2602 | if (!node->analyzed && node->callees) | |
2603 | cgraph_node_remove_callees (node); | |
c596d830 | 2604 | if (cgraph_dump_file) |
2605 | fprintf (cgraph_dump_file, "Materialization Call site updates done.\n"); | |
947781ac | 2606 | #ifdef ENABLE_CHECKING |
2607 | verify_cgraph (); | |
2608 | #endif | |
ccf4ab6b | 2609 | cgraph_remove_unreachable_nodes (false, cgraph_dump_file); |
2610 | } | |
2611 | ||
a861fe52 | 2612 | #include "gt-cgraphunit.h" |