]>
Commit | Line | Data |
---|---|---|
a418679d | 1 | /* Callgraph based interprocedural optimizations. |
d06865bf DK |
2 | Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, |
3 | 2011 Free Software Foundation, Inc. | |
1c4a429a JH |
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 | |
9dcd6f09 | 10 | Software Foundation; either version 3, or (at your option) any later |
1c4a429a JH |
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 | |
9dcd6f09 NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
1c4a429a | 21 | |
18c6ada9 | 22 | /* This module implements main driver of compilation process as well as |
a418679d | 23 | few basic interprocedural optimizers. |
18c6ada9 JH |
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 | ||
efe75b6f JH |
35 | (There is one exception needed for implementing GCC extern inline |
36 | function.) | |
18c6ada9 | 37 | |
8a4a83ed | 38 | - varpool_finalize_variable |
18c6ada9 | 39 | |
1ae58c30 | 40 | This function has same behavior as the above but is used for static |
18c6ada9 JH |
41 | variables. |
42 | ||
43 | - cgraph_finalize_compilation_unit | |
44 | ||
efe75b6f JH |
45 | This function is called once (source level) compilation unit is finalized |
46 | and it will no longer change. | |
18c6ada9 | 47 | |
dd5a833e MS |
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. | |
18c6ada9 | 51 | |
efe75b6f JH |
52 | The function can be called multiple times when multiple source level |
53 | compilation units are combined (such as in C frontend) | |
18c6ada9 JH |
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 | ||
18c6ada9 | 62 | - cgraph_mark_needed_node |
8a4a83ed | 63 | - varpool_mark_needed_node |
18c6ada9 | 64 | |
efe75b6f JH |
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 | |
dbb23ff7 | 69 | used by C++ frontend to explicitly mark the keyed methods. |
18c6ada9 JH |
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 | ||
7e8b322a | 80 | Analyzing of all functions is deferred |
18c6ada9 JH |
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 | ||
e1990f69 | 91 | The intra-procedural information is produced and its existence |
18c6ada9 JH |
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 | |
7e8b322a | 106 | where reference has been optimized out. */ |
9b3e897d | 107 | |
6674a6ce | 108 | |
1c4a429a JH |
109 | #include "config.h" |
110 | #include "system.h" | |
111 | #include "coretypes.h" | |
112 | #include "tm.h" | |
113 | #include "tree.h" | |
c9b9aa64 | 114 | #include "rtl.h" |
6674a6ce | 115 | #include "tree-flow.h" |
1c4a429a JH |
116 | #include "tree-inline.h" |
117 | #include "langhooks.h" | |
0c58f841 | 118 | #include "pointer-set.h" |
1c4a429a JH |
119 | #include "toplev.h" |
120 | #include "flags.h" | |
121 | #include "ggc.h" | |
122 | #include "debug.h" | |
123 | #include "target.h" | |
124 | #include "cgraph.h" | |
dafc5b82 | 125 | #include "diagnostic.h" |
cf835838 JM |
126 | #include "tree-pretty-print.h" |
127 | #include "gimple-pretty-print.h" | |
a194aa56 | 128 | #include "timevar.h" |
b58b1157 JH |
129 | #include "params.h" |
130 | #include "fibheap.h" | |
dc0bfe6a | 131 | #include "intl.h" |
902edd36 | 132 | #include "function.h" |
57fb5341 | 133 | #include "ipa-prop.h" |
726a989a RB |
134 | #include "gimple.h" |
135 | #include "tree-iterator.h" | |
b4861090 | 136 | #include "tree-pass.h" |
a406865a | 137 | #include "tree-dump.h" |
cd9c7bd2 | 138 | #include "output.h" |
3baf459d | 139 | #include "coverage.h" |
090fa0ab | 140 | #include "plugin.h" |
632b4f8e | 141 | #include "ipa-inline.h" |
af8bca3c | 142 | #include "ipa-utils.h" |
47c79d56 | 143 | #include "lto-streamer.h" |
b58b1157 | 144 | |
a20af5b8 | 145 | static void cgraph_expand_all_functions (void); |
db0e878d AJ |
146 | static void cgraph_mark_functions_to_output (void); |
147 | static void cgraph_expand_function (struct cgraph_node *); | |
21c4a6a7 | 148 | static void cgraph_output_pending_asms (void); |
7dff32e6 | 149 | |
0a5fa5a1 | 150 | FILE *cgraph_dump_file; |
9b3e897d | 151 | |
6744a6ab JH |
152 | /* Used for vtable lookup in thunk adjusting. */ |
153 | static GTY (()) tree vtable_entry_type; | |
154 | ||
8dafba3c RH |
155 | /* Determine if function DECL is needed. That is, visible to something |
156 | either outside this translation unit, something magic in the system | |
7e8b322a | 157 | configury. */ |
8dafba3c | 158 | |
d7f09764 DN |
159 | bool |
160 | cgraph_decide_is_function_needed (struct cgraph_node *node, tree decl) | |
8dafba3c | 161 | { |
e7d6beb0 | 162 | /* If the user told us it is used, then it must be so. */ |
386b46cf JH |
163 | if (node->local.externally_visible) |
164 | return true; | |
165 | ||
e7d6beb0 JH |
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) | |
39e2db00 | 170 | && (!node->thunk.thunk_p && !node->same_body_alias) |
e7d6beb0 JH |
171 | && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))) |
172 | return true; | |
173 | ||
a1d31187 JH |
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) | |
b521dcbe | 178 | && !DECL_EXTERNAL (decl) |
e7f23018 | 179 | && !DECL_DISREGARD_INLINE_LIMITS (decl)) |
a1d31187 JH |
180 | return true; |
181 | ||
8dafba3c RH |
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 | |
c22cacf3 | 189 | COMDAT functions that must be output only when they are needed. |
04f77d0f JH |
190 | |
191 | When not optimizing, also output the static functions. (see | |
46f5f7f2 | 192 | PR24561), but don't do so for always_inline functions, functions |
c5d01958 | 193 | declared inline and nested functions. These were optimized out |
b633db7b | 194 | in the original implementation and it is unclear whether we want |
6fc0bb99 | 195 | to change the behavior here. */ |
5d342ef9 | 196 | if (((TREE_PUBLIC (decl) |
c5d01958 | 197 | || (!optimize |
e7f23018 | 198 | && !DECL_DISREGARD_INLINE_LIMITS (decl) |
b633db7b | 199 | && !DECL_DECLARED_INLINE_P (decl) |
c5d01958 EB |
200 | && !(DECL_CONTEXT (decl) |
201 | && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL))) | |
b20996ff | 202 | && !flag_whole_program |
014d92e1 | 203 | && !flag_lto) |
ce91e74c | 204 | && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl)) |
8dafba3c RH |
205 | return true; |
206 | ||
8dafba3c RH |
207 | return false; |
208 | } | |
209 | ||
d60ab196 | 210 | /* Process CGRAPH_NEW_FUNCTIONS and perform actions necessary to add these |
f45e0ad1 JH |
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 | ||
2942c502 | 221 | varpool_analyze_pending_decls (); |
f45e0ad1 JH |
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; | |
4d5dcfb2 | 239 | cgraph_call_function_insertion_hooks (node); |
f45e0ad1 JH |
240 | break; |
241 | ||
242 | case CGRAPH_STATE_IPA: | |
7a388ee4 | 243 | case CGRAPH_STATE_IPA_SSA: |
f45e0ad1 JH |
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 | ||
726a989a | 248 | gimple_register_cfg_hooks (); |
f45e0ad1 JH |
249 | if (!node->analyzed) |
250 | cgraph_analyze_function (node); | |
251 | push_cfun (DECL_STRUCT_FUNCTION (fndecl)); | |
252 | current_function_decl = fndecl; | |
7a388ee4 JH |
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) | |
8ddbbcae | 258 | execute_pass_list (pass_early_local_passes.pass.sub); |
bb7e6d55 | 259 | else |
632b4f8e | 260 | compute_inline_parameters (node, true); |
f45e0ad1 JH |
261 | free_dominance_info (CDI_POST_DOMINATORS); |
262 | free_dominance_info (CDI_DOMINATORS); | |
263 | pop_cfun (); | |
264 | current_function_decl = NULL; | |
4d5dcfb2 | 265 | cgraph_call_function_insertion_hooks (node); |
f45e0ad1 JH |
266 | break; |
267 | ||
268 | case CGRAPH_STATE_EXPANSION: | |
269 | /* Functions created during expansion shall be compiled | |
270 | directly. */ | |
257eb6e3 | 271 | node->process = 0; |
4d5dcfb2 | 272 | cgraph_call_function_insertion_hooks (node); |
f45e0ad1 JH |
273 | cgraph_expand_function (node); |
274 | break; | |
275 | ||
276 | default: | |
277 | gcc_unreachable (); | |
278 | break; | |
279 | } | |
2942c502 | 280 | varpool_analyze_pending_decls (); |
f45e0ad1 JH |
281 | } |
282 | return output; | |
283 | } | |
284 | ||
d71cc23f JH |
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 | { | |
257eb6e3 | 298 | /* If node->process is set, then we have already begun whole-unit analysis. |
7e8b322a JH |
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. */ | |
257eb6e3 | 303 | gcc_assert (!node->process); |
d71cc23f JH |
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; | |
d71cc23f JH |
310 | node->local.finalized = false; |
311 | ||
d71cc23f | 312 | cgraph_node_remove_callees (node); |
d71cc23f | 313 | } |
d853a20e | 314 | |
953ff289 DN |
315 | static void |
316 | cgraph_lower_function (struct cgraph_node *node) | |
317 | { | |
318 | if (node->lowered) | |
319 | return; | |
a406865a RG |
320 | |
321 | if (node->nested) | |
322 | lower_nested_functions (node->decl); | |
323 | gcc_assert (!node->nested); | |
324 | ||
953ff289 DN |
325 | tree_lowering_passes (node->decl); |
326 | node->lowered = true; | |
327 | } | |
328 | ||
6b00c969 RH |
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. */ | |
1c4a429a JH |
333 | |
334 | void | |
6b00c969 | 335 | cgraph_finalize_function (tree decl, bool nested) |
1c4a429a | 336 | { |
a358e188 | 337 | struct cgraph_node *node = cgraph_get_create_node (decl); |
1c4a429a | 338 | |
d853a20e | 339 | if (node->local.finalized) |
b125ad45 JH |
340 | { |
341 | cgraph_reset_node (node); | |
342 | node->local.redefined_extern_inline = true; | |
343 | } | |
6b00c969 | 344 | |
d853a20e | 345 | notice_global_symbol (decl); |
f6981e16 | 346 | node->local.finalized = true; |
e21aff8a | 347 | node->lowered = DECL_STRUCT_FUNCTION (decl)->cfg != NULL; |
1c4a429a | 348 | |
d7f09764 | 349 | if (cgraph_decide_is_function_needed (node, decl)) |
8dafba3c RH |
350 | cgraph_mark_needed_node (node); |
351 | ||
ff5c4582 | 352 | /* Since we reclaim unreachable nodes at the end of every language |
e7d6beb0 JH |
353 | level unit, we need to be conservative about possible entry points |
354 | there. */ | |
508e4757 JH |
355 | if ((TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl)) |
356 | || DECL_STATIC_CONSTRUCTOR (decl) | |
9b389a5e JH |
357 | || DECL_STATIC_DESTRUCTOR (decl) |
358 | /* COMDAT virtual functions may be referenced by vtable from | |
61502ca8 | 359 | other compilation unit. Still we want to devirtualize calls |
9b389a5e JH |
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. */ | |
c47d0034 JH |
363 | || (DECL_VIRTUAL_P (decl) |
364 | && optimize && (DECL_COMDAT (decl) || DECL_EXTERNAL (decl)))) | |
e7d6beb0 JH |
365 | cgraph_mark_reachable_node (node); |
366 | ||
8dafba3c | 367 | /* If we've not yet emitted decl, tell the debug info about it. */ |
6b00c969 | 368 | if (!TREE_ASM_WRITTEN (decl)) |
8dafba3c | 369 | (*debug_hooks->deferred_inline_function) (decl); |
d173e685 | 370 | |
902edd36 JH |
371 | /* Possibly warn about unused parameters. */ |
372 | if (warn_unused_parameter) | |
373 | do_warn_unused_parameter (decl); | |
7e8b322a JH |
374 | |
375 | if (!nested) | |
376 | ggc_collect (); | |
1c4a429a JH |
377 | } |
378 | ||
f0c882ab JH |
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 | { | |
581985d7 | 386 | struct cgraph_node *node = cgraph_get_node (decl); |
d7f09764 | 387 | if (node->local.finalized && cgraph_decide_is_function_needed (node, decl)) |
f0c882ab JH |
388 | cgraph_mark_needed_node (node); |
389 | } | |
390 | ||
9187e02d JH |
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 | { | |
39e2db00 JH |
395 | node = cgraph_function_or_thunk_node (node, NULL); |
396 | node2 = cgraph_function_or_thunk_node (node2, NULL); | |
9187e02d JH |
397 | while (node != node2 && node2) |
398 | node2 = node2->clone_of; | |
399 | return node2 != NULL; | |
400 | } | |
401 | ||
02ec6988 MJ |
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 | |
74605a11 JH |
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 | |
4762f561 JH |
429 | && ((VEC_length(inline_edge_summary_t, inline_edge_summary_vec) |
430 | <= (unsigned) e->uid) | |
431 | || !inline_edge_summary (e)->predicate))) | |
02ec6988 MJ |
432 | && (e->frequency |
433 | != compute_call_stmt_bb_frequency (e->caller->decl, | |
434 | gimple_bb (e->call_stmt)))) | |
435 | { | |
61502ca8 | 436 | error ("caller edge frequency %i does not match BB frequency %i", |
02ec6988 MJ |
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 | ||
89843f5d JJ |
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 | ||
81361831 MJ |
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 | { | |
b75d1e21 MJ |
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) | |
81361831 MJ |
474 | /* IPA-CP sometimes redirect edge to clone and then back to the former |
475 | function. This ping-pong has to go, eventaully. */ | |
b75d1e21 MJ |
476 | && (node != cgraph_function_or_thunk_node (e->callee, NULL)) |
477 | && !clone_of_p (node, e->callee)) | |
81361831 MJ |
478 | return true; |
479 | else | |
480 | return false; | |
481 | } | |
482 | ||
18c6ada9 | 483 | /* Verify cgraph nodes of given cgraph node. */ |
24e47c76 | 484 | DEBUG_FUNCTION void |
18c6ada9 JH |
485 | verify_cgraph_node (struct cgraph_node *node) |
486 | { | |
487 | struct cgraph_edge *e; | |
e21aff8a SB |
488 | struct function *this_cfun = DECL_STRUCT_FUNCTION (node->decl); |
489 | basic_block this_block; | |
726a989a | 490 | gimple_stmt_iterator gsi; |
e0704a46 | 491 | bool error_found = false; |
18c6ada9 | 492 | |
1da2ed5f | 493 | if (seen_error ()) |
5771bd91 RG |
494 | return; |
495 | ||
18c6ada9 | 496 | timevar_push (TV_CGRAPH_VERIFY); |
18c6ada9 JH |
497 | for (e = node->callees; e; e = e->next_callee) |
498 | if (e->aux) | |
499 | { | |
ab532386 | 500 | error ("aux field set for edge %s->%s", |
4f1e4960 JM |
501 | identifier_to_locale (cgraph_node_name (e->caller)), |
502 | identifier_to_locale (cgraph_node_name (e->callee))); | |
18c6ada9 JH |
503 | error_found = true; |
504 | } | |
06191a23 JH |
505 | if (node->count < 0) |
506 | { | |
d8a07487 | 507 | error ("execution count is negative"); |
06191a23 JH |
508 | error_found = true; |
509 | } | |
b20996ff JH |
510 | if (node->global.inlined_to && node->local.externally_visible) |
511 | { | |
d8a07487 | 512 | error ("externally visible inline clone"); |
b20996ff JH |
513 | error_found = true; |
514 | } | |
515 | if (node->global.inlined_to && node->address_taken) | |
516 | { | |
d8a07487 | 517 | error ("inline clone with address taken"); |
b20996ff JH |
518 | error_found = true; |
519 | } | |
520 | if (node->global.inlined_to && node->needed) | |
521 | { | |
d8a07487 | 522 | error ("inline clone is needed"); |
b20996ff JH |
523 | error_found = true; |
524 | } | |
e33c6cd6 MJ |
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))); | |
89843f5d | 539 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
e33c6cd6 MJ |
540 | error_found = true; |
541 | } | |
542 | } | |
18c6ada9 JH |
543 | for (e = node->callers; e; e = e->next_caller) |
544 | { | |
02ec6988 MJ |
545 | if (verify_edge_count_and_frequency (e)) |
546 | error_found = true; | |
18c6ada9 JH |
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 | { | |
ab532386 | 553 | error ("inlined_to pointer is wrong"); |
18c6ada9 JH |
554 | error_found = true; |
555 | } | |
556 | if (node->callers->next_caller) | |
557 | { | |
ab532386 | 558 | error ("multiple inline callers"); |
18c6ada9 JH |
559 | error_found = true; |
560 | } | |
561 | } | |
562 | else | |
563 | if (node->global.inlined_to) | |
564 | { | |
ab532386 | 565 | error ("inlined_to pointer set for noninline callers"); |
18c6ada9 JH |
566 | error_found = true; |
567 | } | |
568 | } | |
02ec6988 MJ |
569 | for (e = node->indirect_calls; e; e = e->next_callee) |
570 | if (verify_edge_count_and_frequency (e)) | |
571 | error_found = true; | |
18c6ada9 JH |
572 | if (!node->callers && node->global.inlined_to) |
573 | { | |
95a52ebb | 574 | error ("inlined_to pointer is set but no predecessors found"); |
18c6ada9 JH |
575 | error_found = true; |
576 | } | |
577 | if (node->global.inlined_to == node) | |
578 | { | |
ab532386 | 579 | error ("inlined_to pointer refers to itself"); |
18c6ada9 JH |
580 | error_found = true; |
581 | } | |
582 | ||
62ecfeb8 | 583 | if (!cgraph_get_node (node->decl)) |
18c6ada9 | 584 | { |
69fb1284 | 585 | error ("node not found in cgraph_hash"); |
18c6ada9 JH |
586 | error_found = true; |
587 | } | |
c22cacf3 | 588 | |
9187e02d JH |
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 | } | |
78eaf7bf MJ |
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 | } | |
9187e02d | 654 | |
39e2db00 JH |
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 | } | |
c47d0034 JH |
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) | |
18c6ada9 | 707 | { |
e21aff8a SB |
708 | if (this_cfun->cfg) |
709 | { | |
710 | /* The nodes we're interested in are never shared, so walk | |
711 | the tree ignoring duplicates. */ | |
2dee695b | 712 | struct pointer_set_t *visited_nodes = pointer_set_create (); |
e21aff8a SB |
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) | |
726a989a RB |
716 | for (gsi = gsi_start_bb (this_block); |
717 | !gsi_end_p (gsi); | |
718 | gsi_next (&gsi)) | |
e0704a46 | 719 | { |
726a989a | 720 | gimple stmt = gsi_stmt (gsi); |
e33c6cd6 | 721 | if (is_gimple_call (stmt)) |
e0704a46 JH |
722 | { |
723 | struct cgraph_edge *e = cgraph_edge (node, stmt); | |
e33c6cd6 | 724 | tree decl = gimple_call_fndecl (stmt); |
e0704a46 JH |
725 | if (e) |
726 | { | |
727 | if (e->aux) | |
728 | { | |
ab532386 | 729 | error ("shared call_stmt:"); |
89843f5d | 730 | cgraph_debug_gimple_stmt (this_cfun, stmt); |
e0704a46 JH |
731 | error_found = true; |
732 | } | |
e33c6cd6 | 733 | if (!e->indirect_unknown_callee) |
6744a6ab | 734 | { |
81361831 | 735 | if (verify_edge_corresponds_to_fndecl (e, decl)) |
e33c6cd6 MJ |
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 | } | |
6744a6ab | 743 | } |
e33c6cd6 | 744 | else if (decl) |
e0704a46 | 745 | { |
e33c6cd6 MJ |
746 | error ("an indirect edge with unknown callee " |
747 | "corresponding to a call_stmt with " | |
748 | "a known declaration:"); | |
47cb0d7d | 749 | error_found = true; |
89843f5d | 750 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
e0704a46 JH |
751 | } |
752 | e->aux = (void *)1; | |
753 | } | |
e33c6cd6 | 754 | else if (decl) |
e0704a46 | 755 | { |
ab532386 | 756 | error ("missing callgraph edge for call stmt:"); |
89843f5d | 757 | cgraph_debug_gimple_stmt (this_cfun, stmt); |
e0704a46 JH |
758 | error_found = true; |
759 | } | |
760 | } | |
761 | } | |
e21aff8a | 762 | pointer_set_destroy (visited_nodes); |
e21aff8a SB |
763 | } |
764 | else | |
765 | /* No CFG available?! */ | |
766 | gcc_unreachable (); | |
767 | ||
18c6ada9 JH |
768 | for (e = node->callees; e; e = e->next_callee) |
769 | { | |
e33c6cd6 | 770 | if (!e->aux) |
18c6ada9 | 771 | { |
ab532386 | 772 | error ("edge %s->%s has no corresponding call_stmt", |
4f1e4960 JM |
773 | identifier_to_locale (cgraph_node_name (e->caller)), |
774 | identifier_to_locale (cgraph_node_name (e->callee))); | |
89843f5d | 775 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
18c6ada9 JH |
776 | error_found = true; |
777 | } | |
778 | e->aux = 0; | |
779 | } | |
e33c6cd6 MJ |
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))); | |
89843f5d | 786 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
e33c6cd6 MJ |
787 | error_found = true; |
788 | } | |
789 | e->aux = 0; | |
790 | } | |
18c6ada9 JH |
791 | } |
792 | if (error_found) | |
793 | { | |
794 | dump_cgraph_node (stderr, node); | |
ab532386 | 795 | internal_error ("verify_cgraph_node failed"); |
18c6ada9 JH |
796 | } |
797 | timevar_pop (TV_CGRAPH_VERIFY); | |
798 | } | |
799 | ||
800 | /* Verify whole cgraph structure. */ | |
24e47c76 | 801 | DEBUG_FUNCTION void |
18c6ada9 JH |
802 | verify_cgraph (void) |
803 | { | |
804 | struct cgraph_node *node; | |
805 | ||
1da2ed5f | 806 | if (seen_error ()) |
89480522 JH |
807 | return; |
808 | ||
18c6ada9 JH |
809 | for (node = cgraph_nodes; node; node = node->next) |
810 | verify_cgraph_node (node); | |
811 | } | |
812 | ||
474eccc6 ILT |
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 | ||
1da2ed5f | 820 | if (seen_error ()) |
474eccc6 ILT |
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 | ||
e767b5be | 828 | /* Analyze the function scheduled to be output. */ |
322dd859 | 829 | void |
e767b5be JH |
830 | cgraph_analyze_function (struct cgraph_node *node) |
831 | { | |
a406865a | 832 | tree save = current_function_decl; |
e767b5be JH |
833 | tree decl = node->decl; |
834 | ||
39e2db00 JH |
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); | |
ee6f1177 | 853 | if (DECL_ONE_ONLY (node->thunk.alias)) |
39e2db00 | 854 | { |
ee6f1177 | 855 | DECL_COMDAT (node->decl) = DECL_COMDAT (node->thunk.alias); |
39e2db00 JH |
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) | |
c47d0034 JH |
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)); | |
a406865a | 890 | |
c47d0034 | 891 | assign_assembler_name_if_neeeded (node->decl); |
0e0a1359 | 892 | |
c47d0034 JH |
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); | |
a406865a | 900 | |
c47d0034 JH |
901 | cgraph_lower_function (node); |
902 | pop_cfun (); | |
903 | } | |
6a84c098 | 904 | node->analyzed = true; |
e767b5be | 905 | |
a406865a | 906 | current_function_decl = save; |
e767b5be JH |
907 | } |
908 | ||
39e2db00 JH |
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 | ||
768e3c60 RG |
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; | |
779d4b91 JH |
942 | DECL_ATTRIBUTES (decl) = remove_attribute ("weakref", |
943 | DECL_ATTRIBUTES (decl)); | |
768e3c60 RG |
944 | } |
945 | } | |
946 | ||
386b46cf JH |
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, | |
8a4a83ed | 973 | struct varpool_node *first_var) |
386b46cf JH |
974 | { |
975 | struct cgraph_node *node; | |
8a4a83ed | 976 | struct varpool_node *vnode; |
386b46cf JH |
977 | |
978 | for (node = cgraph_nodes; node != first; node = node->next) | |
979 | { | |
980 | tree decl = node->decl; | |
b42186f1 | 981 | if (DECL_PRESERVE_P (decl)) |
152464d2 | 982 | cgraph_mark_needed_node (node); |
9d602c59 KT |
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))) | |
386b46cf | 991 | { |
343d4b27 | 992 | if (! TREE_PUBLIC (node->decl)) |
c5d75364 MLI |
993 | warning_at (DECL_SOURCE_LOCATION (node->decl), OPT_Wattributes, |
994 | "%<externally_visible%>" | |
995 | " attribute have effect only on public objects"); | |
b20996ff JH |
996 | else if (node->local.finalized) |
997 | cgraph_mark_needed_node (node); | |
386b46cf | 998 | } |
779d4b91 | 999 | if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)) |
39e2db00 | 1000 | && (node->local.finalized && !node->alias)) |
779d4b91 JH |
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 | } | |
c9fc06dc CB |
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 | ||
768e3c60 | 1017 | process_common_attributes (decl); |
386b46cf | 1018 | } |
8a4a83ed | 1019 | for (vnode = varpool_nodes; vnode != first_var; vnode = vnode->next) |
386b46cf JH |
1020 | { |
1021 | tree decl = vnode->decl; | |
b42186f1 | 1022 | if (DECL_PRESERVE_P (decl)) |
386b46cf | 1023 | { |
a8289259 | 1024 | vnode->force_output = true; |
386b46cf | 1025 | if (vnode->finalized) |
8a4a83ed | 1026 | varpool_mark_needed_node (vnode); |
386b46cf | 1027 | } |
9d602c59 KT |
1028 | if (TARGET_DLLIMPORT_DECL_ATTRIBUTES |
1029 | && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)) | |
9659ff6e | 1030 | && TREE_PUBLIC (vnode->decl)) |
9d602c59 KT |
1031 | { |
1032 | if (vnode->finalized) | |
1033 | varpool_mark_needed_node (vnode); | |
1034 | } | |
1035 | else if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl))) | |
386b46cf | 1036 | { |
343d4b27 | 1037 | if (! TREE_PUBLIC (vnode->decl)) |
c5d75364 MLI |
1038 | warning_at (DECL_SOURCE_LOCATION (vnode->decl), OPT_Wattributes, |
1039 | "%<externally_visible%>" | |
1040 | " attribute have effect only on public objects"); | |
b20996ff JH |
1041 | else if (vnode->finalized) |
1042 | varpool_mark_needed_node (vnode); | |
386b46cf | 1043 | } |
779d4b91 JH |
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 | } | |
768e3c60 | 1055 | process_common_attributes (decl); |
386b46cf JH |
1056 | } |
1057 | } | |
1058 | ||
151e6f24 JH |
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 | |
88512ba0 | 1062 | into beginning of queue. Just the new part of queue is re-scanned then. */ |
1c4a429a | 1063 | |
151e6f24 JH |
1064 | static void |
1065 | cgraph_analyze_functions (void) | |
1c4a429a | 1066 | { |
cd9c7bd2 | 1067 | /* Keep track of already processed nodes when called multiple times for |
aabcd309 | 1068 | intermodule optimization. */ |
cd9c7bd2 | 1069 | static struct cgraph_node *first_analyzed; |
61e00a5e | 1070 | struct cgraph_node *first_processed = first_analyzed; |
8a4a83ed | 1071 | static struct varpool_node *first_analyzed_var; |
151e6f24 | 1072 | struct cgraph_node *node, *next; |
1c4a429a | 1073 | |
1389294c | 1074 | bitmap_obstack_initialize (NULL); |
61e00a5e JH |
1075 | process_function_and_variable_attributes (first_processed, |
1076 | first_analyzed_var); | |
1077 | first_processed = cgraph_nodes; | |
8a4a83ed JH |
1078 | first_analyzed_var = varpool_nodes; |
1079 | varpool_analyze_pending_decls (); | |
a194aa56 | 1080 | if (cgraph_dump_file) |
1c4a429a | 1081 | { |
7d82fe7c | 1082 | fprintf (cgraph_dump_file, "Initial entry points:"); |
cd9c7bd2 | 1083 | for (node = cgraph_nodes; node != first_analyzed; node = node->next) |
39ecc018 | 1084 | if (node->needed) |
a194aa56 JH |
1085 | fprintf (cgraph_dump_file, " %s", cgraph_node_name (node)); |
1086 | fprintf (cgraph_dump_file, "\n"); | |
1c4a429a | 1087 | } |
151e6f24 | 1088 | cgraph_process_new_functions (); |
1c4a429a | 1089 | |
7660e67e SB |
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). */ | |
1668aabc | 1094 | while (cgraph_nodes_queue) |
1c4a429a | 1095 | { |
e767b5be | 1096 | struct cgraph_edge *edge; |
1668aabc JH |
1097 | tree decl = cgraph_nodes_queue->decl; |
1098 | ||
1099 | node = cgraph_nodes_queue; | |
8bd87c4e | 1100 | cgraph_nodes_queue = cgraph_nodes_queue->next_needed; |
18c6ada9 | 1101 | node->next_needed = NULL; |
1c4a429a | 1102 | |
cd4dea62 | 1103 | /* ??? It is possible to create extern inline function and later using |
9d203871 | 1104 | weak alias attribute to kill its body. See |
cd4dea62 | 1105 | gcc.c-torture/compile/20011119-1.c */ |
c47d0034 | 1106 | if (!DECL_STRUCT_FUNCTION (decl) |
39e2db00 | 1107 | && (!node->alias || !node->thunk.alias) |
c47d0034 | 1108 | && !node->thunk.thunk_p) |
d71cc23f JH |
1109 | { |
1110 | cgraph_reset_node (node); | |
b125ad45 | 1111 | node->local.redefined_extern_inline = true; |
d71cc23f JH |
1112 | continue; |
1113 | } | |
cd4dea62 | 1114 | |
d7f09764 DN |
1115 | if (!node->analyzed) |
1116 | cgraph_analyze_function (node); | |
8dafba3c | 1117 | |
1c4a429a | 1118 | for (edge = node->callees; edge; edge = edge->next_callee) |
e767b5be | 1119 | if (!edge->callee->reachable) |
8dafba3c | 1120 | cgraph_mark_reachable_node (edge->callee); |
c47d0034 JH |
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); | |
8dafba3c | 1124 | |
b66887e4 JJ |
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 | ||
6b20f353 DS |
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 | |
581985d7 MJ |
1135 | abstract function declaration will be later needed to output debug |
1136 | info. */ | |
6b20f353 DS |
1137 | if (DECL_ABSTRACT_ORIGIN (decl)) |
1138 | { | |
581985d7 MJ |
1139 | struct cgraph_node *origin_node; |
1140 | origin_node = cgraph_get_node (DECL_ABSTRACT_ORIGIN (decl)); | |
6b20f353 DS |
1141 | origin_node->abstract_and_needed = true; |
1142 | } | |
1143 | ||
61e00a5e JH |
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; | |
8a4a83ed JH |
1149 | first_analyzed_var = varpool_nodes; |
1150 | varpool_analyze_pending_decls (); | |
151e6f24 | 1151 | cgraph_process_new_functions (); |
1c4a429a | 1152 | } |
8dafba3c | 1153 | |
564738df | 1154 | /* Collect entry points to the unit. */ |
a194aa56 | 1155 | if (cgraph_dump_file) |
1668aabc | 1156 | { |
7d82fe7c | 1157 | fprintf (cgraph_dump_file, "Unit entry points:"); |
cd9c7bd2 | 1158 | for (node = cgraph_nodes; node != first_analyzed; node = node->next) |
39ecc018 | 1159 | if (node->needed) |
a194aa56 | 1160 | fprintf (cgraph_dump_file, " %s", cgraph_node_name (node)); |
7d82fe7c | 1161 | fprintf (cgraph_dump_file, "\n\nInitial "); |
e767b5be | 1162 | dump_cgraph (cgraph_dump_file); |
df7705b1 | 1163 | dump_varpool (cgraph_dump_file); |
1668aabc | 1164 | } |
7660e67e | 1165 | |
a194aa56 JH |
1166 | if (cgraph_dump_file) |
1167 | fprintf (cgraph_dump_file, "\nReclaiming functions:"); | |
1c4a429a | 1168 | |
96fc428c | 1169 | for (node = cgraph_nodes; node != first_analyzed; node = next) |
1c4a429a JH |
1170 | { |
1171 | tree decl = node->decl; | |
96fc428c | 1172 | next = node->next; |
1c4a429a | 1173 | |
c47d0034 | 1174 | if (node->local.finalized && !gimple_has_body_p (decl) |
39e2db00 | 1175 | && (!node->alias || !node->thunk.alias) |
c47d0034 | 1176 | && !node->thunk.thunk_p) |
c22cacf3 | 1177 | cgraph_reset_node (node); |
d71cc23f | 1178 | |
c47d0034 | 1179 | if (!node->reachable |
39e2db00 JH |
1180 | && (gimple_has_body_p (decl) || node->thunk.thunk_p |
1181 | || (node->alias && node->thunk.alias))) | |
1c4a429a | 1182 | { |
a194aa56 JH |
1183 | if (cgraph_dump_file) |
1184 | fprintf (cgraph_dump_file, " %s", cgraph_node_name (node)); | |
18c6ada9 | 1185 | cgraph_remove_node (node); |
d71cc23f | 1186 | continue; |
1c4a429a | 1187 | } |
9b0436b7 JH |
1188 | else |
1189 | node->next_needed = NULL; | |
c47d0034 | 1190 | gcc_assert (!node->local.finalized || node->thunk.thunk_p |
39e2db00 | 1191 | || node->alias |
c47d0034 | 1192 | || gimple_has_body_p (decl)); |
d71cc23f | 1193 | gcc_assert (node->analyzed == node->local.finalized); |
1c4a429a | 1194 | } |
a194aa56 | 1195 | if (cgraph_dump_file) |
7d82fe7c KC |
1196 | { |
1197 | fprintf (cgraph_dump_file, "\n\nReclaimed "); | |
1198 | dump_cgraph (cgraph_dump_file); | |
df7705b1 | 1199 | dump_varpool (cgraph_dump_file); |
7d82fe7c | 1200 | } |
1389294c | 1201 | bitmap_obstack_release (NULL); |
cd9c7bd2 | 1202 | first_analyzed = cgraph_nodes; |
1c4a429a | 1203 | ggc_collect (); |
151e6f24 JH |
1204 | } |
1205 | ||
85ce9375 JH |
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; | |
cd35bcf7 | 1217 | struct varpool_node *target_vnode; |
85ce9375 JH |
1218 | |
1219 | for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p);) | |
1220 | { | |
1221 | if (TREE_CODE (p->decl) == FUNCTION_DECL | |
85ce9375 JH |
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)) | |
c9552bff JH |
1233 | DECL_EXTERNAL (p->decl) = lookup_attribute ("weakref", |
1234 | DECL_ATTRIBUTES (p->decl)) != NULL; | |
85ce9375 JH |
1235 | cgraph_create_function_alias (p->decl, target_node->decl); |
1236 | VEC_unordered_remove (alias_pair, alias_pairs, i); | |
1237 | } | |
cd35bcf7 | 1238 | else if (TREE_CODE (p->decl) == VAR_DECL |
cd35bcf7 JH |
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)) | |
c9552bff JH |
1247 | DECL_EXTERNAL (p->decl) = lookup_attribute ("weakref", |
1248 | DECL_ATTRIBUTES (p->decl)) != NULL; | |
cd35bcf7 JH |
1249 | varpool_create_variable_alias (p->decl, target_vnode->decl); |
1250 | VEC_unordered_remove (alias_pair, alias_pairs, i); | |
1251 | } | |
85ce9375 JH |
1252 | else |
1253 | { | |
1254 | if (dump_file) | |
1255 | fprintf (dump_file, "Unhandled alias %s->%s\n", | |
1256 | IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (p->decl)), | |
1257 | IDENTIFIER_POINTER (p->target)); | |
1258 | ||
1259 | i++; | |
1260 | } | |
1261 | } | |
1262 | } | |
1263 | ||
5f1a9ebb | 1264 | |
151e6f24 JH |
1265 | /* Analyze the whole compilation unit once it is parsed completely. */ |
1266 | ||
1267 | void | |
1268 | cgraph_finalize_compilation_unit (void) | |
1269 | { | |
90097c67 RG |
1270 | timevar_push (TV_CGRAPH); |
1271 | ||
47c79d56 DN |
1272 | /* If LTO is enabled, initialize the streamer hooks needed by GIMPLE. */ |
1273 | if (flag_lto) | |
1274 | lto_streamer_hooks_init (); | |
1275 | ||
0038d4e0 MM |
1276 | /* If we're here there's no current function anymore. Some frontends |
1277 | are lazy in clearing these. */ | |
1278 | current_function_decl = NULL; | |
1279 | set_cfun (NULL); | |
1280 | ||
a406865a RG |
1281 | /* Do not skip analyzing the functions if there were errors, we |
1282 | miss diagnostics for following functions otherwise. */ | |
151e6f24 | 1283 | |
5f1a9ebb | 1284 | /* Emit size functions we didn't inline. */ |
f82a627c | 1285 | finalize_size_functions (); |
5f1a9ebb | 1286 | |
90097c67 RG |
1287 | /* Mark alias targets necessary and emit diagnostics. */ |
1288 | finish_aliases_1 (); | |
85ce9375 | 1289 | handle_alias_pairs (); |
90097c67 | 1290 | |
151e6f24 JH |
1291 | if (!quiet_flag) |
1292 | { | |
1293 | fprintf (stderr, "\nAnalyzing compilation unit\n"); | |
1294 | fflush (stderr); | |
1295 | } | |
1296 | ||
deced1e2 XDL |
1297 | if (flag_dump_passes) |
1298 | dump_passes (); | |
1299 | ||
90097c67 RG |
1300 | /* Gimplify and lower all functions, compute reachability and |
1301 | remove unreachable nodes. */ | |
1302 | cgraph_analyze_functions (); | |
1303 | ||
5f1a9ebb RG |
1304 | /* Mark alias targets necessary and emit diagnostics. */ |
1305 | finish_aliases_1 (); | |
85ce9375 | 1306 | handle_alias_pairs (); |
5f1a9ebb | 1307 | |
90097c67 | 1308 | /* Gimplify and lower thunks. */ |
151e6f24 | 1309 | cgraph_analyze_functions (); |
a406865a | 1310 | |
90097c67 | 1311 | /* Finally drive the pass manager. */ |
a406865a | 1312 | cgraph_optimize (); |
90097c67 RG |
1313 | |
1314 | timevar_pop (TV_CGRAPH); | |
1c4a429a | 1315 | } |
3baf459d DN |
1316 | |
1317 | ||
1c4a429a JH |
1318 | /* Figure out what functions we want to assemble. */ |
1319 | ||
1320 | static void | |
db0e878d | 1321 | cgraph_mark_functions_to_output (void) |
1c4a429a JH |
1322 | { |
1323 | struct cgraph_node *node; | |
b66887e4 JJ |
1324 | #ifdef ENABLE_CHECKING |
1325 | bool check_same_comdat_groups = false; | |
1326 | ||
1327 | for (node = cgraph_nodes; node; node = node->next) | |
1328 | gcc_assert (!node->process); | |
1329 | #endif | |
1c4a429a | 1330 | |
1c4a429a JH |
1331 | for (node = cgraph_nodes; node; node = node->next) |
1332 | { | |
1333 | tree decl = node->decl; | |
b58b1157 | 1334 | struct cgraph_edge *e; |
c22cacf3 | 1335 | |
b66887e4 JJ |
1336 | gcc_assert (!node->process || node->same_comdat_group); |
1337 | if (node->process) | |
1338 | continue; | |
b58b1157 JH |
1339 | |
1340 | for (e = node->callers; e; e = e->next_caller) | |
dc0bfe6a | 1341 | if (e->inline_failed) |
b58b1157 | 1342 | break; |
1c4a429a | 1343 | |
7660e67e SB |
1344 | /* We need to output all local functions that are used and not |
1345 | always inlined, as well as those that are reachable from | |
1346 | outside the current compilation unit. */ | |
39ecc018 | 1347 | if (node->analyzed |
c47d0034 | 1348 | && !node->thunk.thunk_p |
39e2db00 | 1349 | && !node->alias |
18c6ada9 | 1350 | && !node->global.inlined_to |
508e4757 | 1351 | && (!cgraph_only_called_directly_p (node) |
39e2db00 JH |
1352 | || ((e || ipa_ref_has_aliases_p (&node->ref_list)) |
1353 | && node->reachable)) | |
6de9cd9a | 1354 | && !TREE_ASM_WRITTEN (decl) |
1c4a429a | 1355 | && !DECL_EXTERNAL (decl)) |
b66887e4 JJ |
1356 | { |
1357 | node->process = 1; | |
1358 | if (node->same_comdat_group) | |
1359 | { | |
1360 | struct cgraph_node *next; | |
1361 | for (next = node->same_comdat_group; | |
1362 | next != node; | |
1363 | next = next->same_comdat_group) | |
39e2db00 | 1364 | if (!next->thunk.thunk_p && !next->alias) |
c47d0034 | 1365 | next->process = 1; |
b66887e4 JJ |
1366 | } |
1367 | } | |
1368 | else if (node->same_comdat_group) | |
1369 | { | |
1370 | #ifdef ENABLE_CHECKING | |
1371 | check_same_comdat_groups = true; | |
1372 | #endif | |
1373 | } | |
341c100f | 1374 | else |
1a2caa7a NS |
1375 | { |
1376 | /* We should've reclaimed all functions that are not needed. */ | |
1377 | #ifdef ENABLE_CHECKING | |
726a989a | 1378 | if (!node->global.inlined_to |
39ecc018 | 1379 | && gimple_has_body_p (decl) |
a837268b JH |
1380 | /* FIXME: in ltrans unit when offline copy is outside partition but inline copies |
1381 | are inside partition, we can end up not removing the body since we no longer | |
1382 | have analyzed node pointing to it. */ | |
1383 | && !node->in_other_partition | |
39e2db00 | 1384 | && !node->alias |
1a2caa7a NS |
1385 | && !DECL_EXTERNAL (decl)) |
1386 | { | |
1387 | dump_cgraph_node (stderr, node); | |
1388 | internal_error ("failed to reclaim unneeded function"); | |
1389 | } | |
1390 | #endif | |
726a989a | 1391 | gcc_assert (node->global.inlined_to |
39ecc018 | 1392 | || !gimple_has_body_p (decl) |
a837268b | 1393 | || node->in_other_partition |
1a2caa7a NS |
1394 | || DECL_EXTERNAL (decl)); |
1395 | ||
1396 | } | |
c22cacf3 | 1397 | |
18d13f34 | 1398 | } |
b66887e4 JJ |
1399 | #ifdef ENABLE_CHECKING |
1400 | if (check_same_comdat_groups) | |
1401 | for (node = cgraph_nodes; node; node = node->next) | |
1402 | if (node->same_comdat_group && !node->process) | |
1403 | { | |
1404 | tree decl = node->decl; | |
1405 | if (!node->global.inlined_to | |
1406 | && gimple_has_body_p (decl) | |
a837268b JH |
1407 | /* FIXME: in ltrans unit when offline copy is outside partition but inline copies |
1408 | are inside partition, we can end up not removing the body since we no longer | |
1409 | have analyzed node pointing to it. */ | |
1410 | && !node->in_other_partition | |
b66887e4 JJ |
1411 | && !DECL_EXTERNAL (decl)) |
1412 | { | |
1413 | dump_cgraph_node (stderr, node); | |
39e2db00 | 1414 | internal_error ("failed to reclaim unneeded functionin same comdat group"); |
b66887e4 JJ |
1415 | } |
1416 | } | |
1417 | #endif | |
18d13f34 JH |
1418 | } |
1419 | ||
6744a6ab JH |
1420 | /* DECL is FUNCTION_DECL. Initialize datastructures so DECL is a function |
1421 | in lowered gimple form. | |
1422 | ||
1423 | Set current_function_decl and cfun to newly constructed empty function body. | |
1424 | return basic block in the function body. */ | |
1425 | ||
1426 | static basic_block | |
1427 | init_lowered_empty_function (tree decl) | |
1428 | { | |
1429 | basic_block bb; | |
1430 | ||
1431 | current_function_decl = decl; | |
1432 | allocate_struct_function (decl, false); | |
1433 | gimple_register_cfg_hooks (); | |
1434 | init_empty_tree_cfg (); | |
1435 | init_tree_ssa (cfun); | |
1436 | init_ssa_operands (); | |
1437 | cfun->gimple_df->in_ssa_p = true; | |
1438 | DECL_INITIAL (decl) = make_node (BLOCK); | |
1439 | ||
1440 | DECL_SAVED_TREE (decl) = error_mark_node; | |
1441 | cfun->curr_properties |= | |
1442 | (PROP_gimple_lcf | PROP_gimple_leh | PROP_cfg | PROP_referenced_vars | | |
febb1302 | 1443 | PROP_ssa | PROP_gimple_any); |
6744a6ab JH |
1444 | |
1445 | /* Create BB for body of the function and connect it properly. */ | |
1446 | bb = create_basic_block (NULL, (void *) 0, ENTRY_BLOCK_PTR); | |
1447 | make_edge (ENTRY_BLOCK_PTR, bb, 0); | |
1448 | make_edge (bb, EXIT_BLOCK_PTR, 0); | |
1449 | ||
1450 | return bb; | |
1451 | } | |
1452 | ||
1453 | /* Adjust PTR by the constant FIXED_OFFSET, and by the vtable | |
1454 | offset indicated by VIRTUAL_OFFSET, if that is | |
1455 | non-null. THIS_ADJUSTING is nonzero for a this adjusting thunk and | |
1456 | zero for a result adjusting thunk. */ | |
1457 | ||
1458 | static tree | |
1459 | thunk_adjust (gimple_stmt_iterator * bsi, | |
1460 | tree ptr, bool this_adjusting, | |
1461 | HOST_WIDE_INT fixed_offset, tree virtual_offset) | |
1462 | { | |
1463 | gimple stmt; | |
1464 | tree ret; | |
1465 | ||
313333a6 RG |
1466 | if (this_adjusting |
1467 | && fixed_offset != 0) | |
6744a6ab | 1468 | { |
5d49b6a7 RG |
1469 | stmt = gimple_build_assign |
1470 | (ptr, fold_build_pointer_plus_hwi_loc (input_location, | |
1471 | ptr, | |
1472 | fixed_offset)); | |
6744a6ab JH |
1473 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
1474 | } | |
1475 | ||
1476 | /* If there's a virtual offset, look up that value in the vtable and | |
1477 | adjust the pointer again. */ | |
1478 | if (virtual_offset) | |
1479 | { | |
1480 | tree vtabletmp; | |
1481 | tree vtabletmp2; | |
1482 | tree vtabletmp3; | |
6744a6ab JH |
1483 | |
1484 | if (!vtable_entry_type) | |
1485 | { | |
1486 | tree vfunc_type = make_node (FUNCTION_TYPE); | |
1487 | TREE_TYPE (vfunc_type) = integer_type_node; | |
1488 | TYPE_ARG_TYPES (vfunc_type) = NULL_TREE; | |
1489 | layout_type (vfunc_type); | |
1490 | ||
1491 | vtable_entry_type = build_pointer_type (vfunc_type); | |
1492 | } | |
1493 | ||
1494 | vtabletmp = | |
1495 | create_tmp_var (build_pointer_type | |
1496 | (build_pointer_type (vtable_entry_type)), "vptr"); | |
1497 | ||
1498 | /* The vptr is always at offset zero in the object. */ | |
1499 | stmt = gimple_build_assign (vtabletmp, | |
1500 | build1 (NOP_EXPR, TREE_TYPE (vtabletmp), | |
1501 | ptr)); | |
1502 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); | |
1503 | mark_symbols_for_renaming (stmt); | |
1504 | find_referenced_vars_in (stmt); | |
1505 | ||
1506 | /* Form the vtable address. */ | |
1507 | vtabletmp2 = create_tmp_var (TREE_TYPE (TREE_TYPE (vtabletmp)), | |
1508 | "vtableaddr"); | |
1509 | stmt = gimple_build_assign (vtabletmp2, | |
70f34814 | 1510 | build_simple_mem_ref (vtabletmp)); |
6744a6ab JH |
1511 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
1512 | mark_symbols_for_renaming (stmt); | |
1513 | find_referenced_vars_in (stmt); | |
1514 | ||
1515 | /* Find the entry with the vcall offset. */ | |
1516 | stmt = gimple_build_assign (vtabletmp2, | |
5d49b6a7 RG |
1517 | fold_build_pointer_plus_loc (input_location, |
1518 | vtabletmp2, | |
1519 | virtual_offset)); | |
6744a6ab JH |
1520 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
1521 | ||
1522 | /* Get the offset itself. */ | |
1523 | vtabletmp3 = create_tmp_var (TREE_TYPE (TREE_TYPE (vtabletmp2)), | |
1524 | "vcalloffset"); | |
1525 | stmt = gimple_build_assign (vtabletmp3, | |
70f34814 | 1526 | build_simple_mem_ref (vtabletmp2)); |
6744a6ab JH |
1527 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
1528 | mark_symbols_for_renaming (stmt); | |
1529 | find_referenced_vars_in (stmt); | |
1530 | ||
6744a6ab | 1531 | /* Adjust the `this' pointer. */ |
0d82a1c8 RG |
1532 | ptr = fold_build_pointer_plus_loc (input_location, ptr, vtabletmp3); |
1533 | ptr = force_gimple_operand_gsi (bsi, ptr, true, NULL_TREE, false, | |
1534 | GSI_CONTINUE_LINKING); | |
6744a6ab JH |
1535 | } |
1536 | ||
313333a6 RG |
1537 | if (!this_adjusting |
1538 | && fixed_offset != 0) | |
6744a6ab JH |
1539 | /* Adjust the pointer by the constant. */ |
1540 | { | |
1541 | tree ptrtmp; | |
1542 | ||
1543 | if (TREE_CODE (ptr) == VAR_DECL) | |
1544 | ptrtmp = ptr; | |
1545 | else | |
1546 | { | |
1547 | ptrtmp = create_tmp_var (TREE_TYPE (ptr), "ptr"); | |
1548 | stmt = gimple_build_assign (ptrtmp, ptr); | |
1549 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); | |
1550 | mark_symbols_for_renaming (stmt); | |
1551 | find_referenced_vars_in (stmt); | |
1552 | } | |
5d49b6a7 RG |
1553 | ptr = fold_build_pointer_plus_hwi_loc (input_location, |
1554 | ptrtmp, fixed_offset); | |
6744a6ab JH |
1555 | } |
1556 | ||
1557 | /* Emit the statement and gimplify the adjustment expression. */ | |
1558 | ret = create_tmp_var (TREE_TYPE (ptr), "adjusted_this"); | |
1559 | stmt = gimple_build_assign (ret, ptr); | |
1560 | mark_symbols_for_renaming (stmt); | |
1561 | find_referenced_vars_in (stmt); | |
1562 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); | |
1563 | ||
1564 | return ret; | |
1565 | } | |
1566 | ||
1567 | /* Produce assembler for thunk NODE. */ | |
1568 | ||
1569 | static void | |
1570 | assemble_thunk (struct cgraph_node *node) | |
1571 | { | |
1572 | bool this_adjusting = node->thunk.this_adjusting; | |
1573 | HOST_WIDE_INT fixed_offset = node->thunk.fixed_offset; | |
1574 | HOST_WIDE_INT virtual_value = node->thunk.virtual_value; | |
1575 | tree virtual_offset = NULL; | |
1576 | tree alias = node->thunk.alias; | |
1577 | tree thunk_fndecl = node->decl; | |
1578 | tree a = DECL_ARGUMENTS (thunk_fndecl); | |
1579 | ||
1580 | current_function_decl = thunk_fndecl; | |
1581 | ||
d06865bf DK |
1582 | /* Ensure thunks are emitted in their correct sections. */ |
1583 | resolve_unique_section (thunk_fndecl, 0, flag_function_sections); | |
1584 | ||
6744a6ab JH |
1585 | if (this_adjusting |
1586 | && targetm.asm_out.can_output_mi_thunk (thunk_fndecl, fixed_offset, | |
1587 | virtual_value, alias)) | |
1588 | { | |
1589 | const char *fnname; | |
1590 | tree fn_block; | |
4399cf59 | 1591 | tree restype = TREE_TYPE (TREE_TYPE (thunk_fndecl)); |
6744a6ab JH |
1592 | |
1593 | DECL_RESULT (thunk_fndecl) | |
1594 | = build_decl (DECL_SOURCE_LOCATION (thunk_fndecl), | |
4399cf59 | 1595 | RESULT_DECL, 0, restype); |
15488554 | 1596 | fnname = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk_fndecl)); |
6744a6ab JH |
1597 | |
1598 | /* The back end expects DECL_INITIAL to contain a BLOCK, so we | |
1599 | create one. */ | |
1600 | fn_block = make_node (BLOCK); | |
1601 | BLOCK_VARS (fn_block) = a; | |
1602 | DECL_INITIAL (thunk_fndecl) = fn_block; | |
1603 | init_function_start (thunk_fndecl); | |
1604 | cfun->is_thunk = 1; | |
1605 | assemble_start_function (thunk_fndecl, fnname); | |
1606 | ||
1607 | targetm.asm_out.output_mi_thunk (asm_out_file, thunk_fndecl, | |
1608 | fixed_offset, virtual_value, alias); | |
1609 | ||
1610 | assemble_end_function (thunk_fndecl, fnname); | |
1611 | init_insn_lengths (); | |
1612 | free_after_compilation (cfun); | |
1613 | set_cfun (NULL); | |
1614 | TREE_ASM_WRITTEN (thunk_fndecl) = 1; | |
c47d0034 JH |
1615 | node->thunk.thunk_p = false; |
1616 | node->analyzed = false; | |
6744a6ab JH |
1617 | } |
1618 | else | |
1619 | { | |
1620 | tree restype; | |
1621 | basic_block bb, then_bb, else_bb, return_bb; | |
1622 | gimple_stmt_iterator bsi; | |
1623 | int nargs = 0; | |
1624 | tree arg; | |
1625 | int i; | |
1626 | tree resdecl; | |
1627 | tree restmp = NULL; | |
1628 | VEC(tree, heap) *vargs; | |
1629 | ||
1630 | gimple call; | |
1631 | gimple ret; | |
1632 | ||
1633 | DECL_IGNORED_P (thunk_fndecl) = 1; | |
1634 | bitmap_obstack_initialize (NULL); | |
1635 | ||
1636 | if (node->thunk.virtual_offset_p) | |
1637 | virtual_offset = size_int (virtual_value); | |
1638 | ||
1639 | /* Build the return declaration for the function. */ | |
1640 | restype = TREE_TYPE (TREE_TYPE (thunk_fndecl)); | |
1641 | if (DECL_RESULT (thunk_fndecl) == NULL_TREE) | |
1642 | { | |
1643 | resdecl = build_decl (input_location, RESULT_DECL, 0, restype); | |
1644 | DECL_ARTIFICIAL (resdecl) = 1; | |
1645 | DECL_IGNORED_P (resdecl) = 1; | |
1646 | DECL_RESULT (thunk_fndecl) = resdecl; | |
1647 | } | |
1648 | else | |
1649 | resdecl = DECL_RESULT (thunk_fndecl); | |
1650 | ||
1651 | bb = then_bb = else_bb = return_bb = init_lowered_empty_function (thunk_fndecl); | |
1652 | ||
1653 | bsi = gsi_start_bb (bb); | |
1654 | ||
1655 | /* Build call to the function being thunked. */ | |
1656 | if (!VOID_TYPE_P (restype)) | |
1657 | { | |
1658 | if (!is_gimple_reg_type (restype)) | |
1659 | { | |
1660 | restmp = resdecl; | |
c021f10b | 1661 | add_local_decl (cfun, restmp); |
6744a6ab JH |
1662 | BLOCK_VARS (DECL_INITIAL (current_function_decl)) = restmp; |
1663 | } | |
1664 | else | |
1665 | restmp = create_tmp_var_raw (restype, "retval"); | |
1666 | } | |
1667 | ||
910ad8de | 1668 | for (arg = a; arg; arg = DECL_CHAIN (arg)) |
6744a6ab JH |
1669 | nargs++; |
1670 | vargs = VEC_alloc (tree, heap, nargs); | |
1671 | if (this_adjusting) | |
1672 | VEC_quick_push (tree, vargs, | |
1673 | thunk_adjust (&bsi, | |
1674 | a, 1, fixed_offset, | |
1675 | virtual_offset)); | |
1676 | else | |
1677 | VEC_quick_push (tree, vargs, a); | |
910ad8de | 1678 | for (i = 1, arg = DECL_CHAIN (a); i < nargs; i++, arg = DECL_CHAIN (arg)) |
6744a6ab JH |
1679 | VEC_quick_push (tree, vargs, arg); |
1680 | call = gimple_build_call_vec (build_fold_addr_expr_loc (0, alias), vargs); | |
1681 | VEC_free (tree, heap, vargs); | |
1682 | gimple_call_set_cannot_inline (call, true); | |
1683 | gimple_call_set_from_thunk (call, true); | |
1684 | if (restmp) | |
1685 | gimple_call_set_lhs (call, restmp); | |
1686 | gsi_insert_after (&bsi, call, GSI_NEW_STMT); | |
1687 | mark_symbols_for_renaming (call); | |
1688 | find_referenced_vars_in (call); | |
1689 | update_stmt (call); | |
1690 | ||
1691 | if (restmp && !this_adjusting) | |
1692 | { | |
1124098b | 1693 | tree true_label = NULL_TREE; |
6744a6ab JH |
1694 | |
1695 | if (TREE_CODE (TREE_TYPE (restmp)) == POINTER_TYPE) | |
1696 | { | |
1697 | gimple stmt; | |
1698 | /* If the return type is a pointer, we need to | |
1699 | protect against NULL. We know there will be an | |
1700 | adjustment, because that's why we're emitting a | |
1701 | thunk. */ | |
1702 | then_bb = create_basic_block (NULL, (void *) 0, bb); | |
1703 | return_bb = create_basic_block (NULL, (void *) 0, then_bb); | |
1704 | else_bb = create_basic_block (NULL, (void *) 0, else_bb); | |
1705 | remove_edge (single_succ_edge (bb)); | |
1706 | true_label = gimple_block_label (then_bb); | |
6744a6ab | 1707 | stmt = gimple_build_cond (NE_EXPR, restmp, |
e8160c9a | 1708 | build_zero_cst (TREE_TYPE (restmp)), |
6744a6ab JH |
1709 | NULL_TREE, NULL_TREE); |
1710 | gsi_insert_after (&bsi, stmt, GSI_NEW_STMT); | |
1711 | make_edge (bb, then_bb, EDGE_TRUE_VALUE); | |
1712 | make_edge (bb, else_bb, EDGE_FALSE_VALUE); | |
1713 | make_edge (return_bb, EXIT_BLOCK_PTR, 0); | |
1714 | make_edge (then_bb, return_bb, EDGE_FALLTHRU); | |
1715 | make_edge (else_bb, return_bb, EDGE_FALLTHRU); | |
1716 | bsi = gsi_last_bb (then_bb); | |
1717 | } | |
1718 | ||
1719 | restmp = thunk_adjust (&bsi, restmp, /*this_adjusting=*/0, | |
1720 | fixed_offset, virtual_offset); | |
1721 | if (true_label) | |
1722 | { | |
1723 | gimple stmt; | |
1724 | bsi = gsi_last_bb (else_bb); | |
e8160c9a NF |
1725 | stmt = gimple_build_assign (restmp, |
1726 | build_zero_cst (TREE_TYPE (restmp))); | |
6744a6ab JH |
1727 | gsi_insert_after (&bsi, stmt, GSI_NEW_STMT); |
1728 | bsi = gsi_last_bb (return_bb); | |
1729 | } | |
1730 | } | |
1731 | else | |
1732 | gimple_call_set_tail (call, true); | |
1733 | ||
1734 | /* Build return value. */ | |
1735 | ret = gimple_build_return (restmp); | |
1736 | gsi_insert_after (&bsi, ret, GSI_NEW_STMT); | |
1737 | ||
1738 | delete_unreachable_blocks (); | |
1739 | update_ssa (TODO_update_ssa); | |
1740 | ||
6744a6ab JH |
1741 | /* Since we want to emit the thunk, we explicitly mark its name as |
1742 | referenced. */ | |
c47d0034 JH |
1743 | node->thunk.thunk_p = false; |
1744 | cgraph_node_remove_callees (node); | |
6744a6ab JH |
1745 | cgraph_add_new_function (thunk_fndecl, true); |
1746 | bitmap_obstack_release (NULL); | |
1747 | } | |
1748 | current_function_decl = NULL; | |
1749 | } | |
1750 | ||
c47d0034 | 1751 | |
39e2db00 JH |
1752 | |
1753 | /* Assemble thunks and aliases asociated to NODE. */ | |
c47d0034 JH |
1754 | |
1755 | static void | |
39e2db00 | 1756 | assemble_thunks_and_aliases (struct cgraph_node *node) |
c47d0034 JH |
1757 | { |
1758 | struct cgraph_edge *e; | |
39e2db00 JH |
1759 | int i; |
1760 | struct ipa_ref *ref; | |
1761 | ||
c47d0034 JH |
1762 | for (e = node->callers; e;) |
1763 | if (e->caller->thunk.thunk_p) | |
1764 | { | |
1765 | struct cgraph_node *thunk = e->caller; | |
1766 | ||
1767 | e = e->next_caller; | |
39e2db00 | 1768 | assemble_thunks_and_aliases (thunk); |
c47d0034 JH |
1769 | assemble_thunk (thunk); |
1770 | } | |
1771 | else | |
1772 | e = e->next_caller; | |
39e2db00 JH |
1773 | for (i = 0; ipa_ref_list_refering_iterate (&node->ref_list, i, ref); i++) |
1774 | if (ref->use == IPA_REF_ALIAS) | |
1775 | { | |
1776 | struct cgraph_node *alias = ipa_ref_refering_node (ref); | |
42f833bc JH |
1777 | bool saved_written = TREE_ASM_WRITTEN (alias->thunk.alias); |
1778 | ||
1779 | /* Force assemble_alias to really output the alias this time instead | |
1780 | of buffering it in same alias pairs. */ | |
1781 | TREE_ASM_WRITTEN (alias->thunk.alias) = 1; | |
39e2db00 JH |
1782 | assemble_alias (alias->decl, |
1783 | DECL_ASSEMBLER_NAME (alias->thunk.alias)); | |
1784 | assemble_thunks_and_aliases (alias); | |
42f833bc | 1785 | TREE_ASM_WRITTEN (alias->thunk.alias) = saved_written; |
39e2db00 | 1786 | } |
c47d0034 JH |
1787 | } |
1788 | ||
1c4a429a | 1789 | /* Expand function specified by NODE. */ |
7660e67e | 1790 | |
1c4a429a | 1791 | static void |
db0e878d | 1792 | cgraph_expand_function (struct cgraph_node *node) |
1c4a429a JH |
1793 | { |
1794 | tree decl = node->decl; | |
1795 | ||
18c6ada9 | 1796 | /* We ought to not compile any inline clones. */ |
341c100f | 1797 | gcc_assert (!node->global.inlined_to); |
18c6ada9 | 1798 | |
7e8b322a | 1799 | announce_function (decl); |
257eb6e3 | 1800 | node->process = 0; |
5806d9ac JH |
1801 | gcc_assert (node->lowered); |
1802 | ||
1803 | /* Generate RTL for the body of DECL. */ | |
1804 | tree_rest_of_compilation (decl); | |
1805 | ||
1806 | /* Make sure that BE didn't give up on compiling. */ | |
1807 | gcc_assert (TREE_ASM_WRITTEN (decl)); | |
1808 | current_function_decl = NULL; | |
85ad2ef5 | 1809 | gcc_assert (!cgraph_preserve_function_body_p (node)); |
1bb7e8f8 JH |
1810 | |
1811 | /* It would make a lot more sense to output thunks before function body to get more | |
1812 | forward and lest backwarding jumps. This is however would need solving problem | |
1813 | with comdats. See PR48668. Also aliases must come after function itself to | |
1814 | make one pass assemblers, like one on AIX happy. See PR 50689. | |
1815 | FIXME: Perhaps thunks should be move before function IFF they are not in comdat | |
1816 | groups. */ | |
1817 | assemble_thunks_and_aliases (node); | |
39ecc018 JH |
1818 | cgraph_release_function_body (node); |
1819 | /* Eliminate all call edges. This is important so the GIMPLE_CALL no longer | |
1820 | points to the dead function body. */ | |
1821 | cgraph_node_remove_callees (node); | |
6b02a499 JH |
1822 | |
1823 | cgraph_function_flags_ready = true; | |
1c4a429a JH |
1824 | } |
1825 | ||
18c6ada9 | 1826 | /* Return true when CALLER_DECL should be inlined into CALLEE_DECL. */ |
b58b1157 JH |
1827 | |
1828 | bool | |
61a05df1 | 1829 | cgraph_inline_p (struct cgraph_edge *e, cgraph_inline_failed_t *reason) |
b58b1157 | 1830 | { |
18c6ada9 JH |
1831 | *reason = e->inline_failed; |
1832 | return !e->inline_failed; | |
b58b1157 | 1833 | } |
18c6ada9 | 1834 | |
6674a6ce | 1835 | |
6674a6ce | 1836 | |
db0e878d AJ |
1837 | /* Expand all functions that must be output. |
1838 | ||
b58b1157 JH |
1839 | Attempt to topologically sort the nodes so function is output when |
1840 | all called functions are already assembled to allow data to be | |
a98ebe2e | 1841 | propagated across the callgraph. Use a stack to get smaller distance |
d1a6adeb | 1842 | between a function and its callees (later we may choose to use a more |
b58b1157 JH |
1843 | sophisticated algorithm for function reordering; we will likely want |
1844 | to use subsections to make the output functions appear in top-down | |
1845 | order). */ | |
1846 | ||
1847 | static void | |
a20af5b8 | 1848 | cgraph_expand_all_functions (void) |
b58b1157 JH |
1849 | { |
1850 | struct cgraph_node *node; | |
5ed6ace5 | 1851 | struct cgraph_node **order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes); |
f30cfcb1 | 1852 | int order_pos, new_order_pos = 0; |
b58b1157 JH |
1853 | int i; |
1854 | ||
af8bca3c | 1855 | order_pos = ipa_reverse_postorder (order); |
341c100f | 1856 | gcc_assert (order_pos == cgraph_n_nodes); |
b58b1157 | 1857 | |
1ae58c30 | 1858 | /* Garbage collector may remove inline clones we eliminate during |
18c6ada9 JH |
1859 | optimization. So we must be sure to not reference them. */ |
1860 | for (i = 0; i < order_pos; i++) | |
257eb6e3 | 1861 | if (order[i]->process) |
18c6ada9 JH |
1862 | order[new_order_pos++] = order[i]; |
1863 | ||
1864 | for (i = new_order_pos - 1; i >= 0; i--) | |
b58b1157 JH |
1865 | { |
1866 | node = order[i]; | |
257eb6e3 | 1867 | if (node->process) |
b58b1157 | 1868 | { |
341c100f | 1869 | gcc_assert (node->reachable); |
257eb6e3 | 1870 | node->process = 0; |
b58b1157 JH |
1871 | cgraph_expand_function (node); |
1872 | } | |
1873 | } | |
f45e0ad1 | 1874 | cgraph_process_new_functions (); |
50674e96 | 1875 | |
b58b1157 | 1876 | free (order); |
50674e96 | 1877 | |
b58b1157 JH |
1878 | } |
1879 | ||
474eccc6 ILT |
1880 | /* This is used to sort the node types by the cgraph order number. */ |
1881 | ||
24b97832 ILT |
1882 | enum cgraph_order_sort_kind |
1883 | { | |
1884 | ORDER_UNDEFINED = 0, | |
1885 | ORDER_FUNCTION, | |
1886 | ORDER_VAR, | |
1887 | ORDER_ASM | |
1888 | }; | |
1889 | ||
474eccc6 ILT |
1890 | struct cgraph_order_sort |
1891 | { | |
24b97832 | 1892 | enum cgraph_order_sort_kind kind; |
474eccc6 ILT |
1893 | union |
1894 | { | |
1895 | struct cgraph_node *f; | |
8a4a83ed | 1896 | struct varpool_node *v; |
474eccc6 ILT |
1897 | struct cgraph_asm_node *a; |
1898 | } u; | |
1899 | }; | |
1900 | ||
1901 | /* Output all functions, variables, and asm statements in the order | |
1902 | according to their order fields, which is the order in which they | |
1903 | appeared in the file. This implements -fno-toplevel-reorder. In | |
1904 | this mode we may output functions and variables which don't really | |
1905 | need to be output. */ | |
1906 | ||
1907 | static void | |
1908 | cgraph_output_in_order (void) | |
1909 | { | |
1910 | int max; | |
474eccc6 ILT |
1911 | struct cgraph_order_sort *nodes; |
1912 | int i; | |
1913 | struct cgraph_node *pf; | |
8a4a83ed | 1914 | struct varpool_node *pv; |
474eccc6 ILT |
1915 | struct cgraph_asm_node *pa; |
1916 | ||
1917 | max = cgraph_order; | |
33283dad | 1918 | nodes = XCNEWVEC (struct cgraph_order_sort, max); |
474eccc6 | 1919 | |
8a4a83ed | 1920 | varpool_analyze_pending_decls (); |
474eccc6 ILT |
1921 | |
1922 | for (pf = cgraph_nodes; pf; pf = pf->next) | |
1923 | { | |
39e2db00 | 1924 | if (pf->process && !pf->thunk.thunk_p && !pf->alias) |
474eccc6 ILT |
1925 | { |
1926 | i = pf->order; | |
1927 | gcc_assert (nodes[i].kind == ORDER_UNDEFINED); | |
1928 | nodes[i].kind = ORDER_FUNCTION; | |
1929 | nodes[i].u.f = pf; | |
1930 | } | |
1931 | } | |
1932 | ||
8a4a83ed | 1933 | for (pv = varpool_nodes_queue; pv; pv = pv->next_needed) |
474eccc6 ILT |
1934 | { |
1935 | i = pv->order; | |
1936 | gcc_assert (nodes[i].kind == ORDER_UNDEFINED); | |
1937 | nodes[i].kind = ORDER_VAR; | |
1938 | nodes[i].u.v = pv; | |
1939 | } | |
1940 | ||
1941 | for (pa = cgraph_asm_nodes; pa; pa = pa->next) | |
1942 | { | |
1943 | i = pa->order; | |
1944 | gcc_assert (nodes[i].kind == ORDER_UNDEFINED); | |
1945 | nodes[i].kind = ORDER_ASM; | |
1946 | nodes[i].u.a = pa; | |
1947 | } | |
474eccc6 | 1948 | |
7386e3ee JH |
1949 | /* In toplevel reorder mode we output all statics; mark them as needed. */ |
1950 | for (i = 0; i < max; ++i) | |
1951 | { | |
1952 | if (nodes[i].kind == ORDER_VAR) | |
1953 | { | |
1954 | varpool_mark_needed_node (nodes[i].u.v); | |
1955 | } | |
1956 | } | |
1957 | varpool_empty_needed_queue (); | |
1958 | ||
7fece979 JJ |
1959 | for (i = 0; i < max; ++i) |
1960 | if (nodes[i].kind == ORDER_VAR) | |
1961 | varpool_finalize_named_section_flags (nodes[i].u.v); | |
1962 | ||
474eccc6 ILT |
1963 | for (i = 0; i < max; ++i) |
1964 | { | |
1965 | switch (nodes[i].kind) | |
1966 | { | |
1967 | case ORDER_FUNCTION: | |
257eb6e3 | 1968 | nodes[i].u.f->process = 0; |
474eccc6 ILT |
1969 | cgraph_expand_function (nodes[i].u.f); |
1970 | break; | |
1971 | ||
1972 | case ORDER_VAR: | |
8a4a83ed | 1973 | varpool_assemble_decl (nodes[i].u.v); |
474eccc6 ILT |
1974 | break; |
1975 | ||
1976 | case ORDER_ASM: | |
1977 | assemble_asm (nodes[i].u.a->asm_str); | |
1978 | break; | |
1979 | ||
1980 | case ORDER_UNDEFINED: | |
1981 | break; | |
1982 | ||
1983 | default: | |
1984 | gcc_unreachable (); | |
1985 | } | |
1986 | } | |
e7b9eb2c ILT |
1987 | |
1988 | cgraph_asm_nodes = NULL; | |
33283dad | 1989 | free (nodes); |
474eccc6 ILT |
1990 | } |
1991 | ||
18c6ada9 JH |
1992 | /* Return true when function body of DECL still needs to be kept around |
1993 | for later re-use. */ | |
1994 | bool | |
85ad2ef5 | 1995 | cgraph_preserve_function_body_p (struct cgraph_node *node) |
18c6ada9 | 1996 | { |
c37f4ba4 | 1997 | gcc_assert (cgraph_global_info_ready); |
39e2db00 | 1998 | gcc_assert (!node->alias && !node->thunk.thunk_p); |
85ad2ef5 | 1999 | |
18c6ada9 | 2000 | /* Look if there is any clone around. */ |
9187e02d JH |
2001 | if (node->clones) |
2002 | return true; | |
18c6ada9 JH |
2003 | return false; |
2004 | } | |
2005 | ||
ef330312 PB |
2006 | static void |
2007 | ipa_passes (void) | |
2008 | { | |
db2960f4 | 2009 | set_cfun (NULL); |
04b201a2 | 2010 | current_function_decl = NULL; |
726a989a | 2011 | gimple_register_cfg_hooks (); |
ef330312 | 2012 | bitmap_obstack_initialize (NULL); |
b20996ff | 2013 | |
090fa0ab GF |
2014 | invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_START, NULL); |
2015 | ||
b20996ff | 2016 | if (!in_lto_p) |
0430f80c RG |
2017 | { |
2018 | execute_ipa_pass_list (all_small_ipa_passes); | |
2019 | if (seen_error ()) | |
2020 | return; | |
2021 | } | |
3baf459d | 2022 | |
467a8db0 JH |
2023 | /* We never run removal of unreachable nodes after early passes. This is |
2024 | because TODO is run before the subpasses. It is important to remove | |
2025 | the unreachable functions to save works at IPA level and to get LTO | |
2026 | symbol tables right. */ | |
2027 | cgraph_remove_unreachable_nodes (true, cgraph_dump_file); | |
2028 | ||
d7f09764 DN |
2029 | /* If pass_all_early_optimizations was not scheduled, the state of |
2030 | the cgraph will not be properly updated. Update it now. */ | |
2031 | if (cgraph_state < CGRAPH_STATE_IPA_SSA) | |
2032 | cgraph_state = CGRAPH_STATE_IPA_SSA; | |
3baf459d | 2033 | |
d7f09764 DN |
2034 | if (!in_lto_p) |
2035 | { | |
2036 | /* Generate coverage variables and constructors. */ | |
2037 | coverage_finish (); | |
2038 | ||
2039 | /* Process new functions added. */ | |
2040 | set_cfun (NULL); | |
2041 | current_function_decl = NULL; | |
2042 | cgraph_process_new_functions (); | |
d7f09764 | 2043 | |
090fa0ab GF |
2044 | execute_ipa_summary_passes |
2045 | ((struct ipa_opt_pass_d *) all_regular_ipa_passes); | |
fb3f88cc | 2046 | } |
c082f9f3 SB |
2047 | |
2048 | /* Some targets need to handle LTO assembler output specially. */ | |
2049 | if (flag_generate_lto) | |
2050 | targetm.asm_out.lto_start (); | |
2051 | ||
d7f09764 DN |
2052 | execute_ipa_summary_passes ((struct ipa_opt_pass_d *) all_lto_gen_passes); |
2053 | ||
2054 | if (!in_lto_p) | |
2055 | ipa_write_summaries (); | |
2056 | ||
c082f9f3 SB |
2057 | if (flag_generate_lto) |
2058 | targetm.asm_out.lto_end (); | |
2059 | ||
cc8547a7 | 2060 | if (!flag_ltrans && (in_lto_p || !flag_lto || flag_fat_lto_objects)) |
fb3f88cc | 2061 | execute_ipa_pass_list (all_regular_ipa_passes); |
090fa0ab | 2062 | invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_END, NULL); |
3baf459d | 2063 | |
ef330312 PB |
2064 | bitmap_obstack_release (NULL); |
2065 | } | |
2066 | ||
c9552bff JH |
2067 | /* Weakrefs may be associated to external decls and thus not output |
2068 | at expansion time. Emit all neccesary aliases. */ | |
2069 | ||
a66f86bb | 2070 | static void |
c9552bff JH |
2071 | output_weakrefs (void) |
2072 | { | |
2073 | struct cgraph_node *node; | |
2074 | struct varpool_node *vnode; | |
2075 | for (node = cgraph_nodes; node; node = node->next) | |
2076 | if (node->alias && node->thunk.alias && DECL_EXTERNAL (node->decl) | |
2077 | && !TREE_ASM_WRITTEN (node->decl)) | |
2078 | assemble_alias (node->decl, | |
2079 | DECL_ASSEMBLER_NAME (node->thunk.alias)); | |
2080 | for (vnode = varpool_nodes; vnode; vnode = vnode->next) | |
2081 | if (vnode->alias && vnode->alias_of && DECL_EXTERNAL (vnode->decl) | |
2082 | && !TREE_ASM_WRITTEN (vnode->decl)) | |
2083 | assemble_alias (vnode->decl, | |
2084 | DECL_ASSEMBLER_NAME (vnode->alias_of)); | |
2085 | } | |
2086 | ||
4537ec0c | 2087 | |
1c4a429a JH |
2088 | /* Perform simple optimizations based on callgraph. */ |
2089 | ||
d7f09764 | 2090 | void |
db0e878d | 2091 | cgraph_optimize (void) |
1c4a429a | 2092 | { |
1da2ed5f | 2093 | if (seen_error ()) |
413803d3 VR |
2094 | return; |
2095 | ||
18c6ada9 JH |
2096 | #ifdef ENABLE_CHECKING |
2097 | verify_cgraph (); | |
2098 | #endif | |
7be82279 | 2099 | |
cd9c7bd2 JH |
2100 | /* Frontend may output common variables after the unit has been finalized. |
2101 | It is safe to deal with them here as they are always zero initialized. */ | |
8a4a83ed | 2102 | varpool_analyze_pending_decls (); |
857e7259 | 2103 | |
a194aa56 | 2104 | timevar_push (TV_CGRAPHOPT); |
a5573239 JH |
2105 | if (pre_ipa_mem_report) |
2106 | { | |
2107 | fprintf (stderr, "Memory consumption before IPA\n"); | |
2108 | dump_memory_report (false); | |
2109 | } | |
b58b1157 | 2110 | if (!quiet_flag) |
a418679d | 2111 | fprintf (stderr, "Performing interprocedural optimizations\n"); |
f45e0ad1 | 2112 | cgraph_state = CGRAPH_STATE_IPA; |
f30cfcb1 | 2113 | |
7e2fe9d8 | 2114 | /* Don't run the IPA passes if there was any error or sorry messages. */ |
1da2ed5f | 2115 | if (!seen_error ()) |
7e2fe9d8 AP |
2116 | ipa_passes (); |
2117 | ||
cc8547a7 AK |
2118 | /* Do nothing else if any IPA pass found errors or if we are just streaming LTO. */ |
2119 | if (seen_error () | |
2120 | || (!in_lto_p && flag_lto && !flag_fat_lto_objects)) | |
9ba0399e RH |
2121 | { |
2122 | timevar_pop (TV_CGRAPHOPT); | |
2123 | return; | |
2124 | } | |
4537ec0c | 2125 | |
6b02a499 JH |
2126 | /* This pass remove bodies of extern inline functions we never inlined. |
2127 | Do this later so other IPA passes see what is really going on. */ | |
2128 | cgraph_remove_unreachable_nodes (false, dump_file); | |
dafc5b82 | 2129 | cgraph_global_info_ready = true; |
a194aa56 JH |
2130 | if (cgraph_dump_file) |
2131 | { | |
7d82fe7c | 2132 | fprintf (cgraph_dump_file, "Optimized "); |
a194aa56 | 2133 | dump_cgraph (cgraph_dump_file); |
cd9c7bd2 | 2134 | dump_varpool (cgraph_dump_file); |
a194aa56 | 2135 | } |
a5573239 JH |
2136 | if (post_ipa_mem_report) |
2137 | { | |
7fa982e5 | 2138 | fprintf (stderr, "Memory consumption after IPA\n"); |
a5573239 JH |
2139 | dump_memory_report (false); |
2140 | } | |
a194aa56 | 2141 | timevar_pop (TV_CGRAPHOPT); |
1c4a429a | 2142 | |
b58b1157 | 2143 | /* Output everything. */ |
3df9609a | 2144 | (*debug_hooks->assembly_start) (); |
7d82fe7c KC |
2145 | if (!quiet_flag) |
2146 | fprintf (stderr, "Assembling functions:\n"); | |
18c6ada9 JH |
2147 | #ifdef ENABLE_CHECKING |
2148 | verify_cgraph (); | |
2149 | #endif | |
474eccc6 | 2150 | |
9187e02d | 2151 | cgraph_materialize_all_clones (); |
febb1302 JH |
2152 | bitmap_obstack_initialize (NULL); |
2153 | execute_ipa_pass_list (all_late_ipa_passes); | |
2154 | cgraph_remove_unreachable_nodes (true, dump_file); | |
2155 | #ifdef ENABLE_CHECKING | |
2156 | verify_cgraph (); | |
2157 | #endif | |
2158 | bitmap_obstack_release (NULL); | |
6674a6ce | 2159 | cgraph_mark_functions_to_output (); |
cd9c7bd2 | 2160 | |
f45e0ad1 | 2161 | cgraph_state = CGRAPH_STATE_EXPANSION; |
474eccc6 ILT |
2162 | if (!flag_toplevel_reorder) |
2163 | cgraph_output_in_order (); | |
2164 | else | |
2165 | { | |
2166 | cgraph_output_pending_asms (); | |
2167 | ||
2168 | cgraph_expand_all_functions (); | |
8a4a83ed | 2169 | varpool_remove_unreferenced_decls (); |
474eccc6 | 2170 | |
8a4a83ed | 2171 | varpool_assemble_pending_decls (); |
474eccc6 | 2172 | } |
c9552bff JH |
2173 | |
2174 | output_weakrefs (); | |
f45e0ad1 JH |
2175 | cgraph_process_new_functions (); |
2176 | cgraph_state = CGRAPH_STATE_FINISHED; | |
cd9c7bd2 | 2177 | |
a194aa56 JH |
2178 | if (cgraph_dump_file) |
2179 | { | |
7d82fe7c | 2180 | fprintf (cgraph_dump_file, "\nFinal "); |
a194aa56 | 2181 | dump_cgraph (cgraph_dump_file); |
df7705b1 | 2182 | dump_varpool (cgraph_dump_file); |
a194aa56 | 2183 | } |
18c6ada9 JH |
2184 | #ifdef ENABLE_CHECKING |
2185 | verify_cgraph (); | |
6de9cd9a DN |
2186 | /* Double check that all inline clones are gone and that all |
2187 | function bodies have been released from memory. */ | |
1da2ed5f | 2188 | if (!seen_error ()) |
6de9cd9a DN |
2189 | { |
2190 | struct cgraph_node *node; | |
2191 | bool error_found = false; | |
2192 | ||
2193 | for (node = cgraph_nodes; node; node = node->next) | |
2194 | if (node->analyzed | |
2195 | && (node->global.inlined_to | |
39ecc018 | 2196 | || gimple_has_body_p (node->decl))) |
6de9cd9a DN |
2197 | { |
2198 | error_found = true; | |
2199 | dump_cgraph_node (stderr, node); | |
c22cacf3 | 2200 | } |
6de9cd9a | 2201 | if (error_found) |
f30cfcb1 | 2202 | internal_error ("nodes with unreleased memory found"); |
6de9cd9a | 2203 | } |
18c6ada9 | 2204 | #endif |
1c4a429a | 2205 | } |
4537ec0c | 2206 | |
9b3e897d PB |
2207 | void |
2208 | init_cgraph (void) | |
2209 | { | |
a05541a9 JH |
2210 | if (!cgraph_dump_file) |
2211 | cgraph_dump_file = dump_begin (TDI_cgraph, NULL); | |
9b3e897d | 2212 | } |
57fb5341 | 2213 | |
c22cacf3 | 2214 | /* The edges representing the callers of the NEW_VERSION node were |
57fb5341 RL |
2215 | fixed by cgraph_function_versioning (), now the call_expr in their |
2216 | respective tree code should be updated to call the NEW_VERSION. */ | |
2217 | ||
2218 | static void | |
2219 | update_call_expr (struct cgraph_node *new_version) | |
2220 | { | |
2221 | struct cgraph_edge *e; | |
2222 | ||
2223 | gcc_assert (new_version); | |
726a989a RB |
2224 | |
2225 | /* Update the call expr on the edges to call the new version. */ | |
57fb5341 | 2226 | for (e = new_version->callers; e; e = e->next_caller) |
c0ab1df3 AP |
2227 | { |
2228 | struct function *inner_function = DECL_STRUCT_FUNCTION (e->caller->decl); | |
2229 | gimple_call_set_fndecl (e->call_stmt, new_version->decl); | |
1d65f45c | 2230 | maybe_clean_eh_stmt_fn (inner_function, e->call_stmt); |
c0ab1df3 | 2231 | } |
57fb5341 RL |
2232 | } |
2233 | ||
2234 | ||
2235 | /* Create a new cgraph node which is the new version of | |
2236 | OLD_VERSION node. REDIRECT_CALLERS holds the callers | |
2237 | edges which should be redirected to point to | |
2238 | NEW_VERSION. ALL the callees edges of OLD_VERSION | |
2239 | are cloned to the new version node. Return the new | |
91382288 JH |
2240 | version node. |
2241 | ||
2242 | If non-NULL BLOCK_TO_COPY determine what basic blocks | |
2243 | was copied to prevent duplications of calls that are dead | |
2244 | in the clone. */ | |
57fb5341 RL |
2245 | |
2246 | static struct cgraph_node * | |
2247 | cgraph_copy_node_for_versioning (struct cgraph_node *old_version, | |
b2c0ad40 | 2248 | tree new_decl, |
91382288 JH |
2249 | VEC(cgraph_edge_p,heap) *redirect_callers, |
2250 | bitmap bbs_to_copy) | |
2251 | { | |
57fb5341 | 2252 | struct cgraph_node *new_version; |
ae2b0888 | 2253 | struct cgraph_edge *e; |
57fb5341 RL |
2254 | unsigned i; |
2255 | ||
2256 | gcc_assert (old_version); | |
c22cacf3 | 2257 | |
a358e188 | 2258 | new_version = cgraph_create_node (new_decl); |
57fb5341 RL |
2259 | |
2260 | new_version->analyzed = true; | |
2261 | new_version->local = old_version->local; | |
036546e5 JH |
2262 | new_version->local.externally_visible = false; |
2263 | new_version->local.local = true; | |
57fb5341 | 2264 | new_version->global = old_version->global; |
8cf9feca | 2265 | new_version->rtl = old_version->rtl; |
57fb5341 RL |
2266 | new_version->reachable = true; |
2267 | new_version->count = old_version->count; | |
2268 | ||
036546e5 | 2269 | for (e = old_version->callees; e; e=e->next_callee) |
91382288 JH |
2270 | if (!bbs_to_copy |
2271 | || bitmap_bit_p (bbs_to_copy, gimple_bb (e->call_stmt)->index)) | |
2272 | cgraph_clone_edge (e, new_version, e->call_stmt, | |
2273 | e->lto_stmt_uid, REG_BR_PROB_BASE, | |
2274 | CGRAPH_FREQ_BASE, | |
898b8927 | 2275 | true); |
036546e5 | 2276 | for (e = old_version->indirect_calls; e; e=e->next_callee) |
91382288 JH |
2277 | if (!bbs_to_copy |
2278 | || bitmap_bit_p (bbs_to_copy, gimple_bb (e->call_stmt)->index)) | |
2279 | cgraph_clone_edge (e, new_version, e->call_stmt, | |
2280 | e->lto_stmt_uid, REG_BR_PROB_BASE, | |
2281 | CGRAPH_FREQ_BASE, | |
898b8927 | 2282 | true); |
ac47786e | 2283 | FOR_EACH_VEC_ELT (cgraph_edge_p, redirect_callers, i, e) |
b2c0ad40 KH |
2284 | { |
2285 | /* Redirect calls to the old version node to point to its new | |
2286 | version. */ | |
2287 | cgraph_redirect_edge_callee (e, new_version); | |
2288 | } | |
57fb5341 RL |
2289 | |
2290 | return new_version; | |
2291 | } | |
2292 | ||
2293 | /* Perform function versioning. | |
c22cacf3 | 2294 | Function versioning includes copying of the tree and |
57fb5341 RL |
2295 | a callgraph update (creating a new cgraph node and updating |
2296 | its callees and callers). | |
2297 | ||
2298 | REDIRECT_CALLERS varray includes the edges to be redirected | |
2299 | to the new version. | |
2300 | ||
2301 | TREE_MAP is a mapping of tree nodes we want to replace with | |
2302 | new ones (according to results of prior analysis). | |
2303 | OLD_VERSION_NODE is the node that is versioned. | |
b8698a0f | 2304 | It returns the new version's cgraph node. |
91382288 JH |
2305 | If non-NULL ARGS_TO_SKIP determine function parameters to remove |
2306 | from new version. | |
2307 | If non-NULL BLOCK_TO_COPY determine what basic blocks to copy. | |
2308 | If non_NULL NEW_ENTRY determine new entry BB of the clone. */ | |
57fb5341 RL |
2309 | |
2310 | struct cgraph_node * | |
2311 | cgraph_function_versioning (struct cgraph_node *old_version_node, | |
b2c0ad40 | 2312 | VEC(cgraph_edge_p,heap) *redirect_callers, |
9187e02d | 2313 | VEC (ipa_replace_map_p,gc)* tree_map, |
036546e5 | 2314 | bitmap args_to_skip, |
91382288 JH |
2315 | bitmap bbs_to_copy, |
2316 | basic_block new_entry_block, | |
036546e5 | 2317 | const char *clone_name) |
57fb5341 RL |
2318 | { |
2319 | tree old_decl = old_version_node->decl; | |
2320 | struct cgraph_node *new_version_node = NULL; | |
2321 | tree new_decl; | |
2322 | ||
2323 | if (!tree_versionable_function_p (old_decl)) | |
2324 | return NULL; | |
2325 | ||
61e03ffc JH |
2326 | gcc_assert (old_version_node->local.can_change_signature || !args_to_skip); |
2327 | ||
57fb5341 RL |
2328 | /* Make a new FUNCTION_DECL tree node for the |
2329 | new version. */ | |
c6f7cfc1 JH |
2330 | if (!args_to_skip) |
2331 | new_decl = copy_node (old_decl); | |
2332 | else | |
2333 | new_decl = build_function_decl_skip_args (old_decl, args_to_skip); | |
57fb5341 | 2334 | |
9990e02a JH |
2335 | /* Generate a new name for the new version. */ |
2336 | DECL_NAME (new_decl) = clone_function_name (old_decl, clone_name); | |
2337 | SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl)); | |
2338 | SET_DECL_RTL (new_decl, NULL); | |
2339 | ||
57fb5341 RL |
2340 | /* Create the new version's call-graph node. |
2341 | and update the edges of the new node. */ | |
2342 | new_version_node = | |
2343 | cgraph_copy_node_for_versioning (old_version_node, new_decl, | |
91382288 | 2344 | redirect_callers, bbs_to_copy); |
57fb5341 RL |
2345 | |
2346 | /* Copy the OLD_VERSION_NODE function tree to the new version. */ | |
91382288 JH |
2347 | tree_function_versioning (old_decl, new_decl, tree_map, false, args_to_skip, |
2348 | bbs_to_copy, new_entry_block); | |
57fb5341 | 2349 | |
c22cacf3 | 2350 | /* Update the new version's properties. |
c0ab1df3 AP |
2351 | Make The new version visible only within this translation unit. Make sure |
2352 | that is not weak also. | |
c22cacf3 | 2353 | ??? We cannot use COMDAT linkage because there is no |
57fb5341 | 2354 | ABI support for this. */ |
715a4e08 | 2355 | cgraph_make_decl_local (new_version_node->decl); |
e6e1c050 | 2356 | DECL_VIRTUAL_P (new_version_node->decl) = 0; |
57fb5341 RL |
2357 | new_version_node->local.externally_visible = 0; |
2358 | new_version_node->local.local = 1; | |
2359 | new_version_node->lowered = true; | |
e6e1c050 | 2360 | |
c0ab1df3 AP |
2361 | /* Update the call_expr on the edges to call the new version node. */ |
2362 | update_call_expr (new_version_node); | |
b8698a0f | 2363 | |
129a37fc | 2364 | cgraph_call_function_insertion_hooks (new_version_node); |
57fb5341 RL |
2365 | return new_version_node; |
2366 | } | |
ea99e0be | 2367 | |
9187e02d JH |
2368 | /* Given virtual clone, turn it into actual clone. */ |
2369 | static void | |
2370 | cgraph_materialize_clone (struct cgraph_node *node) | |
2371 | { | |
2372 | bitmap_obstack_initialize (NULL); | |
e466e2ce JH |
2373 | node->former_clone_of = node->clone_of->decl; |
2374 | if (node->clone_of->former_clone_of) | |
2375 | node->former_clone_of = node->clone_of->former_clone_of; | |
9187e02d JH |
2376 | /* Copy the OLD_VERSION_NODE function tree to the new version. */ |
2377 | tree_function_versioning (node->clone_of->decl, node->decl, | |
2378 | node->clone.tree_map, true, | |
91382288 | 2379 | node->clone.args_to_skip, NULL, NULL); |
08ad1d6d JH |
2380 | if (cgraph_dump_file) |
2381 | { | |
2382 | dump_function_to_file (node->clone_of->decl, cgraph_dump_file, dump_flags); | |
2383 | dump_function_to_file (node->decl, cgraph_dump_file, dump_flags); | |
2384 | } | |
9187e02d JH |
2385 | |
2386 | /* Function is no longer clone. */ | |
2387 | if (node->next_sibling_clone) | |
2388 | node->next_sibling_clone->prev_sibling_clone = node->prev_sibling_clone; | |
2389 | if (node->prev_sibling_clone) | |
2390 | node->prev_sibling_clone->next_sibling_clone = node->next_sibling_clone; | |
2391 | else | |
2392 | node->clone_of->clones = node->next_sibling_clone; | |
2393 | node->next_sibling_clone = NULL; | |
2394 | node->prev_sibling_clone = NULL; | |
0e3776db | 2395 | if (!node->clone_of->analyzed && !node->clone_of->clones) |
f0c418dc JH |
2396 | { |
2397 | cgraph_release_function_body (node->clone_of); | |
2398 | cgraph_node_remove_callees (node->clone_of); | |
2399 | ipa_remove_all_references (&node->clone_of->ref_list); | |
2400 | } | |
9187e02d JH |
2401 | node->clone_of = NULL; |
2402 | bitmap_obstack_release (NULL); | |
2403 | } | |
2404 | ||
8132a837 MJ |
2405 | /* If necessary, change the function declaration in the call statement |
2406 | associated with E so that it corresponds to the edge callee. */ | |
2407 | ||
2408 | gimple | |
2409 | cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge *e) | |
2410 | { | |
2411 | tree decl = gimple_call_fndecl (e->call_stmt); | |
2412 | gimple new_stmt; | |
ceeffab0 | 2413 | gimple_stmt_iterator gsi; |
437ffe7b JH |
2414 | #ifdef ENABLE_CHECKING |
2415 | struct cgraph_node *node; | |
2416 | #endif | |
8132a837 | 2417 | |
3949c4a7 | 2418 | if (e->indirect_unknown_callee |
51093fca | 2419 | || decl == e->callee->decl) |
8132a837 MJ |
2420 | return e->call_stmt; |
2421 | ||
437ffe7b | 2422 | #ifdef ENABLE_CHECKING |
3949c4a7 MJ |
2423 | if (decl) |
2424 | { | |
2425 | node = cgraph_get_node (decl); | |
2426 | gcc_assert (!node || !node->clone.combined_args_to_skip); | |
2427 | } | |
437ffe7b | 2428 | #endif |
e466e2ce | 2429 | |
8132a837 MJ |
2430 | if (cgraph_dump_file) |
2431 | { | |
2432 | fprintf (cgraph_dump_file, "updating call of %s/%i -> %s/%i: ", | |
2433 | cgraph_node_name (e->caller), e->caller->uid, | |
2434 | cgraph_node_name (e->callee), e->callee->uid); | |
2435 | print_gimple_stmt (cgraph_dump_file, e->call_stmt, 0, dump_flags); | |
e466e2ce | 2436 | if (e->callee->clone.combined_args_to_skip) |
8d2adc24 EB |
2437 | { |
2438 | fprintf (cgraph_dump_file, " combined args to skip: "); | |
2439 | dump_bitmap (cgraph_dump_file, | |
2440 | e->callee->clone.combined_args_to_skip); | |
e466e2ce | 2441 | } |
8132a837 MJ |
2442 | } |
2443 | ||
2444 | if (e->callee->clone.combined_args_to_skip) | |
8d2adc24 | 2445 | { |
1b7d2dd1 | 2446 | int lp_nr; |
8d2adc24 EB |
2447 | |
2448 | new_stmt | |
2449 | = gimple_call_copy_skip_args (e->call_stmt, | |
2450 | e->callee->clone.combined_args_to_skip); | |
3d113394 | 2451 | gimple_call_set_fndecl (new_stmt, e->callee->decl); |
8d2adc24 EB |
2452 | |
2453 | if (gimple_vdef (new_stmt) | |
2454 | && TREE_CODE (gimple_vdef (new_stmt)) == SSA_NAME) | |
2455 | SSA_NAME_DEF_STMT (gimple_vdef (new_stmt)) = new_stmt; | |
2456 | ||
81fa35bd | 2457 | gsi = gsi_for_stmt (e->call_stmt); |
72351fa3 | 2458 | gsi_replace (&gsi, new_stmt, false); |
1b7d2dd1 RG |
2459 | /* We need to defer cleaning EH info on the new statement to |
2460 | fixup-cfg. We may not have dominator information at this point | |
2461 | and thus would end up with unreachable blocks and have no way | |
2462 | to communicate that we need to run CFG cleanup then. */ | |
2463 | lp_nr = lookup_stmt_eh_lp (e->call_stmt); | |
2464 | if (lp_nr != 0) | |
2465 | { | |
2466 | remove_stmt_from_eh_lp (e->call_stmt); | |
2467 | add_stmt_to_eh_lp (new_stmt, lp_nr); | |
2468 | } | |
8d2adc24 | 2469 | } |
8132a837 | 2470 | else |
3d113394 RG |
2471 | { |
2472 | new_stmt = e->call_stmt; | |
2473 | gimple_call_set_fndecl (new_stmt, e->callee->decl); | |
2474 | update_stmt (new_stmt); | |
2475 | } | |
8132a837 | 2476 | |
8132a837 MJ |
2477 | cgraph_set_call_stmt_including_clones (e->caller, e->call_stmt, new_stmt); |
2478 | ||
2479 | if (cgraph_dump_file) | |
2480 | { | |
2481 | fprintf (cgraph_dump_file, " updated to:"); | |
2482 | print_gimple_stmt (cgraph_dump_file, e->call_stmt, 0, dump_flags); | |
2483 | } | |
2484 | return new_stmt; | |
2485 | } | |
2486 | ||
9187e02d | 2487 | /* Once all functions from compilation unit are in memory, produce all clones |
8132a837 MJ |
2488 | and update all calls. We might also do this on demand if we don't want to |
2489 | bring all functions to memory prior compilation, but current WHOPR | |
2490 | implementation does that and it is is bit easier to keep everything right in | |
2491 | this order. */ | |
9187e02d JH |
2492 | void |
2493 | cgraph_materialize_all_clones (void) | |
2494 | { | |
2495 | struct cgraph_node *node; | |
2496 | bool stabilized = false; | |
2497 | ||
2498 | if (cgraph_dump_file) | |
2499 | fprintf (cgraph_dump_file, "Materializing clones\n"); | |
2500 | #ifdef ENABLE_CHECKING | |
2501 | verify_cgraph (); | |
2502 | #endif | |
2503 | ||
2504 | /* We can also do topological order, but number of iterations should be | |
2505 | bounded by number of IPA passes since single IPA pass is probably not | |
2506 | going to create clones of clones it created itself. */ | |
2507 | while (!stabilized) | |
2508 | { | |
2509 | stabilized = true; | |
2510 | for (node = cgraph_nodes; node; node = node->next) | |
2511 | { | |
2512 | if (node->clone_of && node->decl != node->clone_of->decl | |
2513 | && !gimple_has_body_p (node->decl)) | |
2514 | { | |
2515 | if (gimple_has_body_p (node->clone_of->decl)) | |
2516 | { | |
2517 | if (cgraph_dump_file) | |
08ad1d6d | 2518 | { |
61502ca8 | 2519 | fprintf (cgraph_dump_file, "cloning %s to %s\n", |
08ad1d6d JH |
2520 | cgraph_node_name (node->clone_of), |
2521 | cgraph_node_name (node)); | |
2522 | if (node->clone.tree_map) | |
2523 | { | |
2524 | unsigned int i; | |
2525 | fprintf (cgraph_dump_file, " replace map: "); | |
2526 | for (i = 0; i < VEC_length (ipa_replace_map_p, | |
2527 | node->clone.tree_map); | |
2528 | i++) | |
2529 | { | |
2530 | struct ipa_replace_map *replace_info; | |
2531 | replace_info = VEC_index (ipa_replace_map_p, | |
2532 | node->clone.tree_map, | |
2533 | i); | |
2534 | print_generic_expr (cgraph_dump_file, replace_info->old_tree, 0); | |
2535 | fprintf (cgraph_dump_file, " -> "); | |
2536 | print_generic_expr (cgraph_dump_file, replace_info->new_tree, 0); | |
2537 | fprintf (cgraph_dump_file, "%s%s;", | |
2538 | replace_info->replace_p ? "(replace)":"", | |
2539 | replace_info->ref_p ? "(ref)":""); | |
2540 | } | |
2541 | fprintf (cgraph_dump_file, "\n"); | |
2542 | } | |
2543 | if (node->clone.args_to_skip) | |
2544 | { | |
2545 | fprintf (cgraph_dump_file, " args_to_skip: "); | |
2546 | dump_bitmap (cgraph_dump_file, node->clone.args_to_skip); | |
2547 | } | |
2548 | if (node->clone.args_to_skip) | |
2549 | { | |
2550 | fprintf (cgraph_dump_file, " combined_args_to_skip:"); | |
2551 | dump_bitmap (cgraph_dump_file, node->clone.combined_args_to_skip); | |
2552 | } | |
2553 | } | |
9187e02d | 2554 | cgraph_materialize_clone (node); |
36576655 | 2555 | stabilized = false; |
9187e02d | 2556 | } |
9187e02d JH |
2557 | } |
2558 | } | |
2559 | } | |
47cb0d7d JH |
2560 | for (node = cgraph_nodes; node; node = node->next) |
2561 | if (!node->analyzed && node->callees) | |
2562 | cgraph_node_remove_callees (node); | |
8132a837 MJ |
2563 | if (cgraph_dump_file) |
2564 | fprintf (cgraph_dump_file, "Materialization Call site updates done.\n"); | |
9a23acef JH |
2565 | #ifdef ENABLE_CHECKING |
2566 | verify_cgraph (); | |
2567 | #endif | |
9187e02d JH |
2568 | cgraph_remove_unreachable_nodes (false, cgraph_dump_file); |
2569 | } | |
2570 | ||
7be82279 | 2571 | #include "gt-cgraphunit.h" |