]>
Commit | Line | Data |
---|---|---|
b58b1157 | 1 | /* Callgraph based intraprocedural optimizations. |
a4de48bc | 2 | Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc. |
1c4a429a JH |
3 | Contributed by Jan Hubicka |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
9 | Software Foundation; either version 2, or (at your option) any later | |
10 | version. | |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GCC; see the file COPYING. If not, write to the Free | |
366ccddb KC |
19 | Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA |
20 | 02110-1301, USA. */ | |
1c4a429a | 21 | |
18c6ada9 JH |
22 | /* This module implements main driver of compilation process as well as |
23 | few basic intraprocedural optimizers. | |
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 | ||
35 | (There is one exception needed for implementing GCC extern inline function.) | |
36 | ||
37 | - cgraph_varpool_finalize_variable | |
38 | ||
1ae58c30 | 39 | This function has same behavior as the above but is used for static |
18c6ada9 JH |
40 | variables. |
41 | ||
42 | - cgraph_finalize_compilation_unit | |
43 | ||
44 | This function is called once compilation unit is finalized and it will | |
45 | no longer change. | |
46 | ||
47 | In the unit-at-a-time the call-graph construction and local function | |
48 | analysis takes place here. Bodies of unreachable functions are released | |
49 | to conserve memory usage. | |
50 | ||
51 | ??? The compilation unit in this point of view should be compilation | |
52 | unit as defined by the language - for instance C frontend allows multiple | |
53 | compilation units to be parsed at once and it should call function each | |
54 | time parsing is done so we save memory. | |
55 | ||
56 | - cgraph_optimize | |
57 | ||
58 | In this unit-at-a-time compilation the intra procedural analysis takes | |
59 | place here. In particular the static functions whose address is never | |
60 | taken are marked as local. Backend can then use this information to | |
61 | modify calling conventions, do better inlining or similar optimizations. | |
62 | ||
63 | - cgraph_assemble_pending_functions | |
64 | - cgraph_varpool_assemble_pending_variables | |
65 | ||
66 | In non-unit-at-a-time mode these functions can be used to force compilation | |
67 | of functions or variables that are known to be needed at given stage | |
68 | of compilation | |
69 | ||
70 | - cgraph_mark_needed_node | |
71 | - cgraph_varpool_mark_needed_node | |
72 | ||
73 | When function or variable is referenced by some hidden way (for instance | |
74 | via assembly code and marked by attribute "used"), the call-graph data structure | |
75 | must be updated accordingly by this function. | |
76 | ||
77 | - analyze_expr callback | |
78 | ||
79 | This function is responsible for lowering tree nodes not understood by | |
80 | generic code into understandable ones or alternatively marking | |
81 | callgraph and varpool nodes referenced by the as needed. | |
82 | ||
83 | ??? On the tree-ssa genericizing should take place here and we will avoid | |
84 | need for these hooks (replacing them by genericizing hook) | |
85 | ||
86 | - expand_function callback | |
87 | ||
88 | This function is used to expand function and pass it into RTL back-end. | |
89 | Front-end should not make any assumptions about when this function can be | |
90 | called. In particular cgraph_assemble_pending_functions, | |
91 | cgraph_varpool_assemble_pending_variables, cgraph_finalize_function, | |
92 | cgraph_varpool_finalize_function, cgraph_optimize can cause arbitrarily | |
93 | previously finalized functions to be expanded. | |
94 | ||
95 | We implement two compilation modes. | |
96 | ||
97 | - unit-at-a-time: In this mode analyzing of all functions is deferred | |
98 | to cgraph_finalize_compilation_unit and expansion into cgraph_optimize. | |
99 | ||
100 | In cgraph_finalize_compilation_unit the reachable functions are | |
101 | analyzed. During analysis the call-graph edges from reachable | |
102 | functions are constructed and their destinations are marked as | |
103 | reachable. References to functions and variables are discovered too | |
104 | and variables found to be needed output to the assembly file. Via | |
105 | mark_referenced call in assemble_variable functions referenced by | |
106 | static variables are noticed too. | |
107 | ||
e1990f69 | 108 | The intra-procedural information is produced and its existence |
18c6ada9 JH |
109 | indicated by global_info_ready. Once this flag is set it is impossible |
110 | to change function from !reachable to reachable and thus | |
111 | assemble_variable no longer call mark_referenced. | |
112 | ||
113 | Finally the call-graph is topologically sorted and all reachable functions | |
114 | that has not been completely inlined or are not external are output. | |
115 | ||
116 | ??? It is possible that reference to function or variable is optimized | |
117 | out. We can not deal with this nicely because topological order is not | |
118 | suitable for it. For tree-ssa we may consider another pass doing | |
119 | optimization and re-discovering reachable functions. | |
120 | ||
121 | ??? Reorganize code so variables are output very last and only if they | |
122 | really has been referenced by produced code, so we catch more cases | |
123 | where reference has been optimized out. | |
124 | ||
125 | - non-unit-at-a-time | |
126 | ||
127 | All functions are variables are output as early as possible to conserve | |
128 | memory consumption. This may or may not result in less memory used but | |
129 | it is still needed for some legacy code that rely on particular ordering | |
130 | of things output from the compiler. | |
131 | ||
132 | Varpool data structures are not used and variables are output directly. | |
133 | ||
134 | Functions are output early using call of | |
135 | cgraph_assemble_pending_function from cgraph_finalize_function. The | |
136 | decision on whether function is needed is made more conservative so | |
137 | uninlininable static functions are needed too. During the call-graph | |
138 | construction the edge destinations are not marked as reachable and it | |
e42922b1 | 139 | is completely relied upn assemble_variable to mark them. */ |
9b3e897d | 140 | |
6674a6ce | 141 | |
1c4a429a JH |
142 | #include "config.h" |
143 | #include "system.h" | |
144 | #include "coretypes.h" | |
145 | #include "tm.h" | |
146 | #include "tree.h" | |
c9b9aa64 | 147 | #include "rtl.h" |
6674a6ce | 148 | #include "tree-flow.h" |
1c4a429a JH |
149 | #include "tree-inline.h" |
150 | #include "langhooks.h" | |
0c58f841 | 151 | #include "pointer-set.h" |
1c4a429a JH |
152 | #include "toplev.h" |
153 | #include "flags.h" | |
154 | #include "ggc.h" | |
155 | #include "debug.h" | |
156 | #include "target.h" | |
157 | #include "cgraph.h" | |
dafc5b82 | 158 | #include "diagnostic.h" |
a194aa56 | 159 | #include "timevar.h" |
b58b1157 JH |
160 | #include "params.h" |
161 | #include "fibheap.h" | |
162 | #include "c-common.h" | |
dc0bfe6a | 163 | #include "intl.h" |
902edd36 | 164 | #include "function.h" |
6674a6ce | 165 | #include "tree-gimple.h" |
b4861090 | 166 | #include "tree-pass.h" |
cd9c7bd2 | 167 | #include "output.h" |
b58b1157 | 168 | |
a20af5b8 | 169 | static void cgraph_expand_all_functions (void); |
db0e878d AJ |
170 | static void cgraph_mark_functions_to_output (void); |
171 | static void cgraph_expand_function (struct cgraph_node *); | |
e0704a46 | 172 | static tree record_reference (tree *, int *, void *); |
4a46cbfb | 173 | static void cgraph_analyze_function (struct cgraph_node *node); |
b58b1157 | 174 | |
e0704a46 | 175 | /* Records tree nodes seen in record_reference. Simply using |
7dff32e6 JS |
176 | walk_tree_without_duplicates doesn't guarantee each node is visited |
177 | once because it gets a new htab upon each recursive call from | |
e0704a46 | 178 | record_reference itself. */ |
0c58f841 | 179 | static struct pointer_set_t *visited_nodes; |
7dff32e6 | 180 | |
9b3e897d PB |
181 | static FILE *cgraph_dump_file; |
182 | ||
8dafba3c RH |
183 | /* Determine if function DECL is needed. That is, visible to something |
184 | either outside this translation unit, something magic in the system | |
185 | configury, or (if not doing unit-at-a-time) to something we havn't | |
186 | seen yet. */ | |
187 | ||
188 | static bool | |
189 | decide_is_function_needed (struct cgraph_node *node, tree decl) | |
190 | { | |
8f235343 | 191 | tree origin; |
ce91e74c JH |
192 | if (MAIN_NAME_P (DECL_NAME (decl)) |
193 | && TREE_PUBLIC (decl)) | |
194 | { | |
195 | node->local.externally_visible = true; | |
196 | return true; | |
197 | } | |
6de9cd9a | 198 | |
e7d6beb0 | 199 | /* If the user told us it is used, then it must be so. */ |
ce91e74c JH |
200 | if (node->local.externally_visible |
201 | || lookup_attribute ("used", DECL_ATTRIBUTES (decl))) | |
e7d6beb0 JH |
202 | return true; |
203 | ||
204 | /* ??? If the assembler name is set by hand, it is possible to assemble | |
205 | the name later after finalizing the function and the fact is noticed | |
206 | in assemble_name then. This is arguably a bug. */ | |
207 | if (DECL_ASSEMBLER_NAME_SET_P (decl) | |
208 | && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))) | |
209 | return true; | |
210 | ||
8dafba3c RH |
211 | /* If we decided it was needed before, but at the time we didn't have |
212 | the body of the function available, then it's still needed. We have | |
213 | to go back and re-check its dependencies now. */ | |
214 | if (node->needed) | |
215 | return true; | |
216 | ||
217 | /* Externally visible functions must be output. The exception is | |
218 | COMDAT functions that must be output only when they are needed. */ | |
ce91e74c JH |
219 | if ((TREE_PUBLIC (decl) && !flag_whole_program) |
220 | && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl)) | |
8dafba3c RH |
221 | return true; |
222 | ||
223 | /* Constructors and destructors are reachable from the runtime by | |
224 | some mechanism. */ | |
225 | if (DECL_STATIC_CONSTRUCTOR (decl) || DECL_STATIC_DESTRUCTOR (decl)) | |
226 | return true; | |
227 | ||
8dafba3c RH |
228 | if (flag_unit_at_a_time) |
229 | return false; | |
230 | ||
231 | /* If not doing unit at a time, then we'll only defer this function | |
232 | if its marked for inlining. Otherwise we want to emit it now. */ | |
233 | ||
234 | /* "extern inline" functions are never output locally. */ | |
235 | if (DECL_EXTERNAL (decl)) | |
236 | return false; | |
6de9cd9a DN |
237 | /* Nested functions of extern inline function shall not be emit unless |
238 | we inlined the origin. */ | |
8f235343 JH |
239 | for (origin = decl_function_context (decl); origin; |
240 | origin = decl_function_context (origin)) | |
241 | if (DECL_EXTERNAL (origin)) | |
6de9cd9a | 242 | return false; |
2067c116 | 243 | /* We want to emit COMDAT functions only when absolutely necessary. */ |
d853a20e | 244 | if (DECL_COMDAT (decl)) |
8dafba3c RH |
245 | return false; |
246 | if (!DECL_INLINE (decl) | |
247 | || (!node->local.disregard_inline_limits | |
248 | /* When declared inline, defer even the uninlinable functions. | |
7d82fe7c | 249 | This allows them to be eliminated when unused. */ |
8dafba3c | 250 | && !DECL_DECLARED_INLINE_P (decl) |
9de21a23 | 251 | && (!node->local.inlinable || !cgraph_default_inline_p (node, NULL)))) |
8dafba3c RH |
252 | return true; |
253 | ||
254 | return false; | |
255 | } | |
256 | ||
aabcd309 KH |
257 | /* Walk the decls we marked as necessary and see if they reference new |
258 | variables or functions and add them into the worklists. */ | |
cd9c7bd2 JH |
259 | static bool |
260 | cgraph_varpool_analyze_pending_decls (void) | |
261 | { | |
262 | bool changed = false; | |
263 | timevar_push (TV_CGRAPH); | |
264 | ||
265 | while (cgraph_varpool_first_unanalyzed_node) | |
266 | { | |
267 | tree decl = cgraph_varpool_first_unanalyzed_node->decl; | |
268 | ||
269 | cgraph_varpool_first_unanalyzed_node->analyzed = true; | |
270 | ||
271 | cgraph_varpool_first_unanalyzed_node = cgraph_varpool_first_unanalyzed_node->next_needed; | |
272 | ||
273 | if (DECL_INITIAL (decl)) | |
e0704a46 JH |
274 | { |
275 | visited_nodes = pointer_set_create (); | |
276 | walk_tree (&DECL_INITIAL (decl), record_reference, NULL, visited_nodes); | |
277 | pointer_set_destroy (visited_nodes); | |
278 | visited_nodes = NULL; | |
279 | } | |
cd9c7bd2 JH |
280 | changed = true; |
281 | } | |
282 | timevar_pop (TV_CGRAPH); | |
283 | return changed; | |
284 | } | |
285 | ||
286 | /* Optimization of function bodies might've rendered some variables as | |
aabcd309 | 287 | unnecessary so we want to avoid these from being compiled. |
cd9c7bd2 | 288 | |
0fa2e4df | 289 | This is done by pruning the queue and keeping only the variables that |
aabcd309 | 290 | really appear needed (ie they are either externally visible or referenced |
cd9c7bd2 JH |
291 | by compiled function). Re-doing the reachability analysis on variables |
292 | brings back the remaining variables referenced by these. */ | |
293 | static void | |
294 | cgraph_varpool_remove_unreferenced_decls (void) | |
295 | { | |
296 | struct cgraph_varpool_node *next, *node = cgraph_varpool_nodes_queue; | |
297 | ||
298 | cgraph_varpool_reset_queue (); | |
299 | ||
300 | if (errorcount || sorrycount) | |
301 | return; | |
302 | ||
303 | while (node) | |
304 | { | |
305 | tree decl = node->decl; | |
306 | next = node->next_needed; | |
307 | node->needed = 0; | |
308 | ||
309 | if (node->finalized | |
310 | && ((DECL_ASSEMBLER_NAME_SET_P (decl) | |
311 | && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))) | |
312 | || node->force_output | |
313 | || decide_is_variable_needed (node, decl))) | |
314 | cgraph_varpool_mark_needed_node (node); | |
315 | ||
316 | node = next; | |
317 | } | |
318 | cgraph_varpool_analyze_pending_decls (); | |
319 | } | |
6674a6ce | 320 | |
6674a6ce | 321 | |
d853a20e JH |
322 | /* When not doing unit-at-a-time, output all functions enqueued. |
323 | Return true when such a functions were found. */ | |
f6d1b84a RH |
324 | |
325 | bool | |
d853a20e JH |
326 | cgraph_assemble_pending_functions (void) |
327 | { | |
328 | bool output = false; | |
329 | ||
330 | if (flag_unit_at_a_time) | |
331 | return false; | |
332 | ||
333 | while (cgraph_nodes_queue) | |
334 | { | |
335 | struct cgraph_node *n = cgraph_nodes_queue; | |
336 | ||
337 | cgraph_nodes_queue = cgraph_nodes_queue->next_needed; | |
18c6ada9 | 338 | n->next_needed = NULL; |
12527dce RH |
339 | if (!n->global.inlined_to |
340 | && !n->alias | |
341 | && !DECL_EXTERNAL (n->decl)) | |
f6d1b84a RH |
342 | { |
343 | cgraph_expand_function (n); | |
344 | output = true; | |
345 | } | |
d853a20e | 346 | } |
f6d1b84a | 347 | |
d853a20e JH |
348 | return output; |
349 | } | |
d71cc23f JH |
350 | /* As an GCC extension we allow redefinition of the function. The |
351 | semantics when both copies of bodies differ is not well defined. | |
352 | We replace the old body with new body so in unit at a time mode | |
353 | we always use new body, while in normal mode we may end up with | |
354 | old body inlined into some functions and new body expanded and | |
355 | inlined in others. | |
356 | ||
357 | ??? It may make more sense to use one body for inlining and other | |
358 | body for expanding the function but this is difficult to do. */ | |
359 | ||
360 | static void | |
361 | cgraph_reset_node (struct cgraph_node *node) | |
362 | { | |
363 | /* If node->output is set, then this is a unit-at-a-time compilation | |
364 | and we have already begun whole-unit analysis. This is *not* | |
365 | testing for whether we've already emitted the function. That | |
366 | case can be sort-of legitimately seen with real function | |
367 | redefinition errors. I would argue that the front end should | |
368 | never present us with such a case, but don't enforce that for now. */ | |
369 | gcc_assert (!node->output); | |
370 | ||
371 | /* Reset our data structures so we can analyze the function again. */ | |
372 | memset (&node->local, 0, sizeof (node->local)); | |
373 | memset (&node->global, 0, sizeof (node->global)); | |
374 | memset (&node->rtl, 0, sizeof (node->rtl)); | |
375 | node->analyzed = false; | |
376 | node->local.redefined_extern_inline = true; | |
377 | node->local.finalized = false; | |
378 | ||
379 | if (!flag_unit_at_a_time) | |
380 | { | |
381 | struct cgraph_node *n; | |
382 | ||
383 | for (n = cgraph_nodes; n; n = n->next) | |
384 | if (n->global.inlined_to == node) | |
385 | cgraph_remove_node (n); | |
386 | } | |
387 | ||
388 | cgraph_node_remove_callees (node); | |
389 | ||
390 | /* We may need to re-queue the node for assembling in case | |
391 | we already proceeded it and ignored as not needed. */ | |
392 | if (node->reachable && !flag_unit_at_a_time) | |
393 | { | |
394 | struct cgraph_node *n; | |
395 | ||
396 | for (n = cgraph_nodes_queue; n; n = n->next_needed) | |
397 | if (n == node) | |
398 | break; | |
399 | if (!n) | |
400 | node->reachable = 0; | |
401 | } | |
402 | } | |
d853a20e | 403 | |
6b00c969 RH |
404 | /* DECL has been parsed. Take it, queue it, compile it at the whim of the |
405 | logic in effect. If NESTED is true, then our caller cannot stand to have | |
406 | the garbage collector run at the moment. We would need to either create | |
407 | a new GC context, or just not compile right now. */ | |
1c4a429a JH |
408 | |
409 | void | |
6b00c969 | 410 | cgraph_finalize_function (tree decl, bool nested) |
1c4a429a JH |
411 | { |
412 | struct cgraph_node *node = cgraph_node (decl); | |
413 | ||
d853a20e | 414 | if (node->local.finalized) |
d71cc23f | 415 | cgraph_reset_node (node); |
6b00c969 | 416 | |
d853a20e | 417 | notice_global_symbol (decl); |
1c4a429a | 418 | node->decl = decl; |
f6981e16 | 419 | node->local.finalized = true; |
e21aff8a | 420 | node->lowered = DECL_STRUCT_FUNCTION (decl)->cfg != NULL; |
8f235343 JH |
421 | if (node->nested) |
422 | lower_nested_functions (decl); | |
423 | gcc_assert (!node->nested); | |
1c4a429a | 424 | |
8dafba3c RH |
425 | /* If not unit at a time, then we need to create the call graph |
426 | now, so that called functions can be queued and emitted now. */ | |
4a46cbfb | 427 | if (!flag_unit_at_a_time) |
d4d1ebc1 JH |
428 | { |
429 | cgraph_analyze_function (node); | |
d63db217 | 430 | cgraph_decide_inlining_incrementally (node, false); |
d4d1ebc1 | 431 | } |
4a46cbfb | 432 | |
8dafba3c RH |
433 | if (decide_is_function_needed (node, decl)) |
434 | cgraph_mark_needed_node (node); | |
435 | ||
ff5c4582 | 436 | /* Since we reclaim unreachable nodes at the end of every language |
e7d6beb0 JH |
437 | level unit, we need to be conservative about possible entry points |
438 | there. */ | |
ce91e74c | 439 | if ((TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl))) |
e7d6beb0 JH |
440 | cgraph_mark_reachable_node (node); |
441 | ||
6b00c969 RH |
442 | /* If not unit at a time, go ahead and emit everything we've found |
443 | to be reachable at this time. */ | |
444 | if (!nested) | |
d34cb6a1 JH |
445 | { |
446 | if (!cgraph_assemble_pending_functions ()) | |
447 | ggc_collect (); | |
448 | } | |
1668aabc | 449 | |
8dafba3c | 450 | /* If we've not yet emitted decl, tell the debug info about it. */ |
6b00c969 | 451 | if (!TREE_ASM_WRITTEN (decl)) |
8dafba3c | 452 | (*debug_hooks->deferred_inline_function) (decl); |
d173e685 | 453 | |
902edd36 JH |
454 | /* Possibly warn about unused parameters. */ |
455 | if (warn_unused_parameter) | |
456 | do_warn_unused_parameter (decl); | |
1c4a429a JH |
457 | } |
458 | ||
e21aff8a SB |
459 | void |
460 | cgraph_lower_function (struct cgraph_node *node) | |
461 | { | |
462 | if (node->lowered) | |
463 | return; | |
464 | tree_lowering_passes (node->decl); | |
465 | node->lowered = true; | |
466 | } | |
467 | ||
1c4a429a JH |
468 | /* Walk tree and record all calls. Called via walk_tree. */ |
469 | static tree | |
e0704a46 | 470 | record_reference (tree *tp, int *walk_subtrees, void *data) |
1c4a429a | 471 | { |
25c84396 RH |
472 | tree t = *tp; |
473 | ||
474 | switch (TREE_CODE (t)) | |
1c4a429a | 475 | { |
25c84396 RH |
476 | case VAR_DECL: |
477 | /* ??? Really, we should mark this decl as *potentially* referenced | |
478 | by this function and re-examine whether the decl is actually used | |
479 | after rtl has been generated. */ | |
cd9c7bd2 | 480 | if (TREE_STATIC (t) || DECL_EXTERNAL (t)) |
4684cd27 MM |
481 | { |
482 | cgraph_varpool_mark_needed_node (cgraph_varpool_node (t)); | |
483 | if (lang_hooks.callgraph.analyze_expr) | |
484 | return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees, | |
485 | data); | |
486 | } | |
25c84396 RH |
487 | break; |
488 | ||
c7bcbc2c | 489 | case FDESC_EXPR: |
25c84396 RH |
490 | case ADDR_EXPR: |
491 | if (flag_unit_at_a_time) | |
492 | { | |
493 | /* Record dereferences to the functions. This makes the | |
494 | functions reachable unconditionally. */ | |
495 | tree decl = TREE_OPERAND (*tp, 0); | |
496 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
497 | cgraph_mark_needed_node (cgraph_node (decl)); | |
498 | } | |
499 | break; | |
500 | ||
25c84396 RH |
501 | default: |
502 | /* Save some cycles by not walking types and declaration as we | |
503 | won't find anything useful there anyway. */ | |
6615c446 | 504 | if (IS_TYPE_OR_DECL_P (*tp)) |
1c4a429a | 505 | { |
1c4a429a | 506 | *walk_subtrees = 0; |
25c84396 | 507 | break; |
1c4a429a | 508 | } |
25c84396 RH |
509 | |
510 | if ((unsigned int) TREE_CODE (t) >= LAST_AND_UNUSED_TREE_CODE) | |
ae2bcd98 | 511 | return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees, data); |
25c84396 | 512 | break; |
1c4a429a | 513 | } |
25c84396 | 514 | |
1c4a429a JH |
515 | return NULL; |
516 | } | |
517 | ||
18c6ada9 | 518 | /* Create cgraph edges for function calls inside BODY from NODE. */ |
1c4a429a | 519 | |
e42922b1 | 520 | static void |
18c6ada9 | 521 | cgraph_create_edges (struct cgraph_node *node, tree body) |
1c4a429a | 522 | { |
e0704a46 JH |
523 | basic_block bb; |
524 | ||
525 | struct function *this_cfun = DECL_STRUCT_FUNCTION (body); | |
526 | block_stmt_iterator bsi; | |
527 | tree step; | |
0c58f841 | 528 | visited_nodes = pointer_set_create (); |
e21aff8a | 529 | |
e0704a46 JH |
530 | /* Reach the trees by walking over the CFG, and note the |
531 | enclosing basic-blocks in the call edges. */ | |
532 | FOR_EACH_BB_FN (bb, this_cfun) | |
533 | for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) | |
534 | { | |
535 | tree stmt = bsi_stmt (bsi); | |
536 | tree call = get_call_expr_in (stmt); | |
537 | tree decl; | |
538 | ||
539 | if (call && (decl = get_callee_fndecl (call))) | |
e21aff8a | 540 | { |
e0704a46 JH |
541 | cgraph_create_edge (node, cgraph_node (decl), stmt, |
542 | bb->count, | |
543 | bb->loop_depth); | |
544 | walk_tree (&TREE_OPERAND (call, 1), | |
545 | record_reference, node, visited_nodes); | |
546 | if (TREE_CODE (stmt) == MODIFY_EXPR) | |
547 | walk_tree (&TREE_OPERAND (stmt, 0), | |
548 | record_reference, node, visited_nodes); | |
e21aff8a | 549 | } |
e0704a46 JH |
550 | else |
551 | walk_tree (bsi_stmt_ptr (bsi), record_reference, node, visited_nodes); | |
552 | } | |
553 | ||
30be951a JH |
554 | /* Look for initializers of constant variables and private statics. */ |
555 | for (step = DECL_STRUCT_FUNCTION (body)->unexpanded_var_list; | |
556 | step; | |
557 | step = TREE_CHAIN (step)) | |
e0704a46 | 558 | { |
30be951a JH |
559 | tree decl = TREE_VALUE (step); |
560 | if (TREE_CODE (decl) == VAR_DECL | |
561 | && (TREE_STATIC (decl) && !DECL_EXTERNAL (decl)) | |
562 | && flag_unit_at_a_time) | |
563 | cgraph_varpool_finalize_decl (decl); | |
564 | else if (TREE_CODE (decl) == VAR_DECL && DECL_INITIAL (decl)) | |
565 | walk_tree (&DECL_INITIAL (decl), record_reference, node, visited_nodes); | |
e21aff8a | 566 | } |
e21aff8a | 567 | |
0c58f841 | 568 | pointer_set_destroy (visited_nodes); |
7dff32e6 | 569 | visited_nodes = NULL; |
1c4a429a JH |
570 | } |
571 | ||
d63db217 JH |
572 | /* Give initial reasons why inlining would fail. Those gets |
573 | either NULLified or usually overwritten by more precise reason | |
574 | later. */ | |
575 | static void | |
576 | initialize_inline_failed (struct cgraph_node *node) | |
577 | { | |
578 | struct cgraph_edge *e; | |
579 | ||
580 | for (e = node->callers; e; e = e->next_caller) | |
581 | { | |
582 | gcc_assert (!e->callee->global.inlined_to); | |
583 | gcc_assert (e->inline_failed); | |
584 | if (node->local.redefined_extern_inline) | |
585 | e->inline_failed = N_("redefined extern inline functions are not " | |
586 | "considered for inlining"); | |
587 | else if (!node->local.inlinable) | |
588 | e->inline_failed = N_("function not inlinable"); | |
589 | else | |
590 | e->inline_failed = N_("function not considered for inlining"); | |
591 | } | |
592 | } | |
593 | ||
594 | /* Rebuild call edges from current function after a passes not aware | |
595 | of cgraph updating. */ | |
596 | static void | |
597 | rebuild_cgraph_edges (void) | |
598 | { | |
599 | basic_block bb; | |
600 | struct cgraph_node *node = cgraph_node (current_function_decl); | |
601 | block_stmt_iterator bsi; | |
602 | ||
603 | cgraph_node_remove_callees (node); | |
604 | ||
605 | node->count = ENTRY_BLOCK_PTR->count; | |
606 | ||
607 | FOR_EACH_BB (bb) | |
608 | for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) | |
609 | { | |
610 | tree stmt = bsi_stmt (bsi); | |
611 | tree call = get_call_expr_in (stmt); | |
612 | tree decl; | |
613 | ||
614 | if (call && (decl = get_callee_fndecl (call))) | |
615 | cgraph_create_edge (node, cgraph_node (decl), stmt, | |
616 | bb->count, | |
617 | bb->loop_depth); | |
618 | } | |
619 | initialize_inline_failed (node); | |
620 | gcc_assert (!node->global.inlined_to); | |
621 | } | |
622 | ||
623 | struct tree_opt_pass pass_rebuild_cgraph_edges = | |
624 | { | |
625 | NULL, /* name */ | |
626 | NULL, /* gate */ | |
627 | rebuild_cgraph_edges, /* execute */ | |
628 | NULL, /* sub */ | |
629 | NULL, /* next */ | |
630 | 0, /* static_pass_number */ | |
631 | 0, /* tv_id */ | |
632 | PROP_cfg, /* properties_required */ | |
633 | 0, /* properties_provided */ | |
634 | 0, /* properties_destroyed */ | |
635 | 0, /* todo_flags_start */ | |
636 | 0, /* todo_flags_finish */ | |
637 | 0 /* letter */ | |
638 | }; | |
18c6ada9 JH |
639 | |
640 | /* Verify cgraph nodes of given cgraph node. */ | |
641 | void | |
642 | verify_cgraph_node (struct cgraph_node *node) | |
643 | { | |
644 | struct cgraph_edge *e; | |
645 | struct cgraph_node *main_clone; | |
e21aff8a SB |
646 | struct function *this_cfun = DECL_STRUCT_FUNCTION (node->decl); |
647 | basic_block this_block; | |
648 | block_stmt_iterator bsi; | |
e0704a46 | 649 | bool error_found = false; |
18c6ada9 JH |
650 | |
651 | timevar_push (TV_CGRAPH_VERIFY); | |
18c6ada9 JH |
652 | for (e = node->callees; e; e = e->next_callee) |
653 | if (e->aux) | |
654 | { | |
ab532386 | 655 | error ("aux field set for edge %s->%s", |
18c6ada9 JH |
656 | cgraph_node_name (e->caller), cgraph_node_name (e->callee)); |
657 | error_found = true; | |
658 | } | |
659 | for (e = node->callers; e; e = e->next_caller) | |
660 | { | |
661 | if (!e->inline_failed) | |
662 | { | |
663 | if (node->global.inlined_to | |
664 | != (e->caller->global.inlined_to | |
665 | ? e->caller->global.inlined_to : e->caller)) | |
666 | { | |
ab532386 | 667 | error ("inlined_to pointer is wrong"); |
18c6ada9 JH |
668 | error_found = true; |
669 | } | |
670 | if (node->callers->next_caller) | |
671 | { | |
ab532386 | 672 | error ("multiple inline callers"); |
18c6ada9 JH |
673 | error_found = true; |
674 | } | |
675 | } | |
676 | else | |
677 | if (node->global.inlined_to) | |
678 | { | |
ab532386 | 679 | error ("inlined_to pointer set for noninline callers"); |
18c6ada9 JH |
680 | error_found = true; |
681 | } | |
682 | } | |
683 | if (!node->callers && node->global.inlined_to) | |
684 | { | |
ab532386 | 685 | error ("inlined_to pointer is set but no predecesors found"); |
18c6ada9 JH |
686 | error_found = true; |
687 | } | |
688 | if (node->global.inlined_to == node) | |
689 | { | |
ab532386 | 690 | error ("inlined_to pointer refers to itself"); |
18c6ada9 JH |
691 | error_found = true; |
692 | } | |
693 | ||
694 | for (main_clone = cgraph_node (node->decl); main_clone; | |
695 | main_clone = main_clone->next_clone) | |
696 | if (main_clone == node) | |
697 | break; | |
698 | if (!node) | |
699 | { | |
ab532386 | 700 | error ("node not found in DECL_ASSEMBLER_NAME hash"); |
18c6ada9 JH |
701 | error_found = true; |
702 | } | |
703 | ||
704 | if (node->analyzed | |
705 | && DECL_SAVED_TREE (node->decl) && !TREE_ASM_WRITTEN (node->decl) | |
706 | && (!DECL_EXTERNAL (node->decl) || node->global.inlined_to)) | |
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. */ | |
712 | visited_nodes = pointer_set_create (); | |
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) | |
716 | for (bsi = bsi_start (this_block); !bsi_end_p (bsi); bsi_next (&bsi)) | |
e0704a46 JH |
717 | { |
718 | tree stmt = bsi_stmt (bsi); | |
719 | tree call = get_call_expr_in (stmt); | |
720 | tree decl; | |
721 | if (call && (decl = get_callee_fndecl (call))) | |
722 | { | |
723 | struct cgraph_edge *e = cgraph_edge (node, stmt); | |
724 | if (e) | |
725 | { | |
726 | if (e->aux) | |
727 | { | |
ab532386 | 728 | error ("shared call_stmt:"); |
e0704a46 JH |
729 | debug_generic_stmt (stmt); |
730 | error_found = true; | |
731 | } | |
732 | if (e->callee->decl != cgraph_node (decl)->decl) | |
733 | { | |
ab532386 | 734 | error ("edge points to wrong declaration:"); |
e0704a46 JH |
735 | debug_tree (e->callee->decl); |
736 | fprintf (stderr," Instead of:"); | |
737 | debug_tree (decl); | |
738 | } | |
739 | e->aux = (void *)1; | |
740 | } | |
741 | else | |
742 | { | |
ab532386 | 743 | error ("missing callgraph edge for call stmt:"); |
e0704a46 JH |
744 | debug_generic_stmt (stmt); |
745 | error_found = true; | |
746 | } | |
747 | } | |
748 | } | |
e21aff8a SB |
749 | pointer_set_destroy (visited_nodes); |
750 | visited_nodes = NULL; | |
751 | } | |
752 | else | |
753 | /* No CFG available?! */ | |
754 | gcc_unreachable (); | |
755 | ||
18c6ada9 JH |
756 | for (e = node->callees; e; e = e->next_callee) |
757 | { | |
758 | if (!e->aux) | |
759 | { | |
ab532386 | 760 | error ("edge %s->%s has no corresponding call_stmt", |
18c6ada9 JH |
761 | cgraph_node_name (e->caller), |
762 | cgraph_node_name (e->callee)); | |
e0704a46 | 763 | debug_generic_stmt (e->call_stmt); |
18c6ada9 JH |
764 | error_found = true; |
765 | } | |
766 | e->aux = 0; | |
767 | } | |
768 | } | |
769 | if (error_found) | |
770 | { | |
771 | dump_cgraph_node (stderr, node); | |
ab532386 | 772 | internal_error ("verify_cgraph_node failed"); |
18c6ada9 JH |
773 | } |
774 | timevar_pop (TV_CGRAPH_VERIFY); | |
775 | } | |
776 | ||
777 | /* Verify whole cgraph structure. */ | |
778 | void | |
779 | verify_cgraph (void) | |
780 | { | |
781 | struct cgraph_node *node; | |
782 | ||
89480522 JH |
783 | if (sorrycount || errorcount) |
784 | return; | |
785 | ||
18c6ada9 JH |
786 | for (node = cgraph_nodes; node; node = node->next) |
787 | verify_cgraph_node (node); | |
788 | } | |
789 | ||
cd9c7bd2 JH |
790 | |
791 | /* Output all variables enqueued to be assembled. */ | |
792 | bool | |
793 | cgraph_varpool_assemble_pending_decls (void) | |
794 | { | |
795 | bool changed = false; | |
796 | ||
797 | if (errorcount || sorrycount) | |
798 | return false; | |
799 | ||
800 | /* EH might mark decls as needed during expansion. This should be safe since | |
801 | we don't create references to new function, but it should not be used | |
802 | elsewhere. */ | |
803 | cgraph_varpool_analyze_pending_decls (); | |
804 | ||
805 | while (cgraph_varpool_nodes_queue) | |
806 | { | |
807 | tree decl = cgraph_varpool_nodes_queue->decl; | |
808 | struct cgraph_varpool_node *node = cgraph_varpool_nodes_queue; | |
809 | ||
810 | cgraph_varpool_nodes_queue = cgraph_varpool_nodes_queue->next_needed; | |
811 | if (!TREE_ASM_WRITTEN (decl) && !node->alias && !DECL_EXTERNAL (decl)) | |
812 | { | |
813 | assemble_variable (decl, 0, 1, 0); | |
607fb860 | 814 | /* Local static variables are never seen by check_global_declarations |
30be951a JH |
815 | so we need to output debug info by hand. */ |
816 | if (decl_function_context (decl) && errorcount == 0 && sorrycount == 0) | |
817 | { | |
818 | timevar_push (TV_SYMOUT); | |
819 | (*debug_hooks->global_decl) (decl); | |
820 | timevar_pop (TV_SYMOUT); | |
821 | } | |
cd9c7bd2 JH |
822 | changed = true; |
823 | } | |
824 | node->next_needed = NULL; | |
825 | } | |
826 | return changed; | |
827 | } | |
828 | ||
e767b5be JH |
829 | /* Analyze the function scheduled to be output. */ |
830 | static void | |
831 | cgraph_analyze_function (struct cgraph_node *node) | |
832 | { | |
833 | tree decl = node->decl; | |
834 | ||
25c84396 | 835 | current_function_decl = decl; |
e21aff8a SB |
836 | push_cfun (DECL_STRUCT_FUNCTION (decl)); |
837 | cgraph_lower_function (node); | |
e767b5be JH |
838 | |
839 | /* First kill forward declaration so reverse inlining works properly. */ | |
e21aff8a | 840 | cgraph_create_edges (node, decl); |
e767b5be JH |
841 | |
842 | node->local.inlinable = tree_inlinable_function_p (decl); | |
e21aff8a | 843 | node->local.self_insns = estimate_num_insns (decl); |
e767b5be JH |
844 | if (node->local.inlinable) |
845 | node->local.disregard_inline_limits | |
ae2bcd98 | 846 | = lang_hooks.tree_inlining.disregard_inline_limits (decl); |
d63db217 | 847 | initialize_inline_failed (node); |
b684a3df JH |
848 | if (flag_really_no_inline && !node->local.disregard_inline_limits) |
849 | node->local.inlinable = 0; | |
e767b5be JH |
850 | /* Inlining characteristics are maintained by the cgraph_mark_inline. */ |
851 | node->global.insns = node->local.self_insns; | |
e767b5be | 852 | |
25c84396 | 853 | node->analyzed = true; |
e21aff8a | 854 | pop_cfun (); |
d853a20e | 855 | current_function_decl = NULL; |
e767b5be JH |
856 | } |
857 | ||
1c4a429a JH |
858 | /* Analyze the whole compilation unit once it is parsed completely. */ |
859 | ||
860 | void | |
db0e878d | 861 | cgraph_finalize_compilation_unit (void) |
1c4a429a JH |
862 | { |
863 | struct cgraph_node *node; | |
cd9c7bd2 | 864 | /* Keep track of already processed nodes when called multiple times for |
aabcd309 | 865 | intermodule optimization. */ |
cd9c7bd2 | 866 | static struct cgraph_node *first_analyzed; |
1c4a429a | 867 | |
e4d5432a RH |
868 | finish_aliases_1 (); |
869 | ||
4a46cbfb | 870 | if (!flag_unit_at_a_time) |
d853a20e JH |
871 | { |
872 | cgraph_assemble_pending_functions (); | |
873 | return; | |
874 | } | |
4a46cbfb | 875 | |
b58b1157 | 876 | if (!quiet_flag) |
cd9c7bd2 JH |
877 | { |
878 | fprintf (stderr, "\nAnalyzing compilation unit"); | |
879 | fflush (stderr); | |
880 | } | |
e69529cd | 881 | |
a194aa56 | 882 | timevar_push (TV_CGRAPH); |
cd9c7bd2 | 883 | cgraph_varpool_analyze_pending_decls (); |
a194aa56 | 884 | if (cgraph_dump_file) |
1c4a429a | 885 | { |
7d82fe7c | 886 | fprintf (cgraph_dump_file, "Initial entry points:"); |
cd9c7bd2 | 887 | for (node = cgraph_nodes; node != first_analyzed; node = node->next) |
1668aabc | 888 | if (node->needed && DECL_SAVED_TREE (node->decl)) |
a194aa56 JH |
889 | fprintf (cgraph_dump_file, " %s", cgraph_node_name (node)); |
890 | fprintf (cgraph_dump_file, "\n"); | |
1c4a429a JH |
891 | } |
892 | ||
7660e67e SB |
893 | /* Propagate reachability flag and lower representation of all reachable |
894 | functions. In the future, lowering will introduce new functions and | |
895 | new entry points on the way (by template instantiation and virtual | |
896 | method table generation for instance). */ | |
1668aabc | 897 | while (cgraph_nodes_queue) |
1c4a429a | 898 | { |
e767b5be | 899 | struct cgraph_edge *edge; |
1668aabc JH |
900 | tree decl = cgraph_nodes_queue->decl; |
901 | ||
902 | node = cgraph_nodes_queue; | |
8bd87c4e | 903 | cgraph_nodes_queue = cgraph_nodes_queue->next_needed; |
18c6ada9 | 904 | node->next_needed = NULL; |
1c4a429a | 905 | |
cd4dea62 | 906 | /* ??? It is possible to create extern inline function and later using |
9d203871 | 907 | weak alias attribute to kill its body. See |
cd4dea62 JH |
908 | gcc.c-torture/compile/20011119-1.c */ |
909 | if (!DECL_SAVED_TREE (decl)) | |
d71cc23f JH |
910 | { |
911 | cgraph_reset_node (node); | |
912 | continue; | |
913 | } | |
cd4dea62 | 914 | |
341c100f NS |
915 | gcc_assert (!node->analyzed && node->reachable); |
916 | gcc_assert (DECL_SAVED_TREE (decl)); | |
1c4a429a | 917 | |
e767b5be | 918 | cgraph_analyze_function (node); |
8dafba3c | 919 | |
1c4a429a | 920 | for (edge = node->callees; edge; edge = edge->next_callee) |
e767b5be | 921 | if (!edge->callee->reachable) |
8dafba3c RH |
922 | cgraph_mark_reachable_node (edge->callee); |
923 | ||
cd9c7bd2 | 924 | cgraph_varpool_analyze_pending_decls (); |
1c4a429a | 925 | } |
8dafba3c | 926 | |
1668aabc JH |
927 | /* Collect entry points to the unit. */ |
928 | ||
a194aa56 | 929 | if (cgraph_dump_file) |
1668aabc | 930 | { |
7d82fe7c | 931 | fprintf (cgraph_dump_file, "Unit entry points:"); |
cd9c7bd2 | 932 | for (node = cgraph_nodes; node != first_analyzed; node = node->next) |
1668aabc | 933 | if (node->needed && DECL_SAVED_TREE (node->decl)) |
a194aa56 | 934 | fprintf (cgraph_dump_file, " %s", cgraph_node_name (node)); |
7d82fe7c | 935 | fprintf (cgraph_dump_file, "\n\nInitial "); |
e767b5be | 936 | dump_cgraph (cgraph_dump_file); |
1668aabc | 937 | } |
7660e67e | 938 | |
a194aa56 JH |
939 | if (cgraph_dump_file) |
940 | fprintf (cgraph_dump_file, "\nReclaiming functions:"); | |
1c4a429a | 941 | |
cd9c7bd2 | 942 | for (node = cgraph_nodes; node != first_analyzed; node = node->next) |
1c4a429a JH |
943 | { |
944 | tree decl = node->decl; | |
945 | ||
d71cc23f JH |
946 | if (node->local.finalized && !DECL_SAVED_TREE (decl)) |
947 | cgraph_reset_node (node); | |
948 | ||
1c4a429a JH |
949 | if (!node->reachable && DECL_SAVED_TREE (decl)) |
950 | { | |
a194aa56 JH |
951 | if (cgraph_dump_file) |
952 | fprintf (cgraph_dump_file, " %s", cgraph_node_name (node)); | |
18c6ada9 | 953 | cgraph_remove_node (node); |
d71cc23f | 954 | continue; |
1c4a429a | 955 | } |
9b0436b7 JH |
956 | else |
957 | node->next_needed = NULL; | |
d71cc23f JH |
958 | gcc_assert (!node->local.finalized || DECL_SAVED_TREE (decl)); |
959 | gcc_assert (node->analyzed == node->local.finalized); | |
1c4a429a | 960 | } |
a194aa56 | 961 | if (cgraph_dump_file) |
7d82fe7c KC |
962 | { |
963 | fprintf (cgraph_dump_file, "\n\nReclaimed "); | |
964 | dump_cgraph (cgraph_dump_file); | |
965 | } | |
cd9c7bd2 | 966 | first_analyzed = cgraph_nodes; |
1c4a429a | 967 | ggc_collect (); |
a194aa56 | 968 | timevar_pop (TV_CGRAPH); |
1c4a429a | 969 | } |
1c4a429a JH |
970 | /* Figure out what functions we want to assemble. */ |
971 | ||
972 | static void | |
db0e878d | 973 | cgraph_mark_functions_to_output (void) |
1c4a429a JH |
974 | { |
975 | struct cgraph_node *node; | |
976 | ||
1c4a429a JH |
977 | for (node = cgraph_nodes; node; node = node->next) |
978 | { | |
979 | tree decl = node->decl; | |
b58b1157 | 980 | struct cgraph_edge *e; |
341c100f NS |
981 | |
982 | gcc_assert (!node->output); | |
b58b1157 JH |
983 | |
984 | for (e = node->callers; e; e = e->next_caller) | |
dc0bfe6a | 985 | if (e->inline_failed) |
b58b1157 | 986 | break; |
1c4a429a | 987 | |
7660e67e SB |
988 | /* We need to output all local functions that are used and not |
989 | always inlined, as well as those that are reachable from | |
990 | outside the current compilation unit. */ | |
1c4a429a | 991 | if (DECL_SAVED_TREE (decl) |
18c6ada9 | 992 | && !node->global.inlined_to |
1c4a429a | 993 | && (node->needed |
b58b1157 | 994 | || (e && node->reachable)) |
6de9cd9a | 995 | && !TREE_ASM_WRITTEN (decl) |
1c4a429a JH |
996 | && !DECL_EXTERNAL (decl)) |
997 | node->output = 1; | |
341c100f | 998 | else |
1a2caa7a NS |
999 | { |
1000 | /* We should've reclaimed all functions that are not needed. */ | |
1001 | #ifdef ENABLE_CHECKING | |
1002 | if (!node->global.inlined_to && DECL_SAVED_TREE (decl) | |
1003 | && !DECL_EXTERNAL (decl)) | |
1004 | { | |
1005 | dump_cgraph_node (stderr, node); | |
1006 | internal_error ("failed to reclaim unneeded function"); | |
1007 | } | |
1008 | #endif | |
1009 | gcc_assert (node->global.inlined_to || !DECL_SAVED_TREE (decl) | |
1010 | || DECL_EXTERNAL (decl)); | |
1011 | ||
1012 | } | |
1013 | ||
18d13f34 JH |
1014 | } |
1015 | } | |
1016 | ||
1c4a429a | 1017 | /* Expand function specified by NODE. */ |
7660e67e | 1018 | |
1c4a429a | 1019 | static void |
db0e878d | 1020 | cgraph_expand_function (struct cgraph_node *node) |
1c4a429a JH |
1021 | { |
1022 | tree decl = node->decl; | |
1023 | ||
18c6ada9 | 1024 | /* We ought to not compile any inline clones. */ |
341c100f | 1025 | gcc_assert (!node->global.inlined_to); |
18c6ada9 | 1026 | |
6b00c969 RH |
1027 | if (flag_unit_at_a_time) |
1028 | announce_function (decl); | |
18d13f34 | 1029 | |
776b966e JH |
1030 | cgraph_lower_function (node); |
1031 | ||
a3546141 | 1032 | /* Generate RTL for the body of DECL. */ |
ae2bcd98 | 1033 | lang_hooks.callgraph.expand_function (decl); |
18d13f34 | 1034 | |
6de9cd9a DN |
1035 | /* Make sure that BE didn't give up on compiling. */ |
1036 | /* ??? Can happen with nested function of extern inline. */ | |
341c100f | 1037 | gcc_assert (TREE_ASM_WRITTEN (node->decl)); |
18c6ada9 | 1038 | |
1c4a429a | 1039 | current_function_decl = NULL; |
89480522 | 1040 | if (!cgraph_preserve_function_body_p (node->decl)) |
6de9cd9a DN |
1041 | { |
1042 | DECL_SAVED_TREE (node->decl) = NULL; | |
1043 | DECL_STRUCT_FUNCTION (node->decl) = NULL; | |
6de9cd9a | 1044 | DECL_INITIAL (node->decl) = error_mark_node; |
229031d0 | 1045 | /* Eliminate all call edges. This is important so the call_expr no longer |
89480522 | 1046 | points to the dead function body. */ |
2563c224 | 1047 | cgraph_node_remove_callees (node); |
6de9cd9a | 1048 | } |
6b02a499 JH |
1049 | |
1050 | cgraph_function_flags_ready = true; | |
1c4a429a JH |
1051 | } |
1052 | ||
18c6ada9 | 1053 | /* Return true when CALLER_DECL should be inlined into CALLEE_DECL. */ |
b58b1157 JH |
1054 | |
1055 | bool | |
18c6ada9 | 1056 | cgraph_inline_p (struct cgraph_edge *e, const char **reason) |
b58b1157 | 1057 | { |
18c6ada9 JH |
1058 | *reason = e->inline_failed; |
1059 | return !e->inline_failed; | |
b58b1157 | 1060 | } |
18c6ada9 | 1061 | |
6674a6ce | 1062 | |
6674a6ce | 1063 | |
db0e878d AJ |
1064 | /* Expand all functions that must be output. |
1065 | ||
b58b1157 JH |
1066 | Attempt to topologically sort the nodes so function is output when |
1067 | all called functions are already assembled to allow data to be | |
a98ebe2e | 1068 | propagated across the callgraph. Use a stack to get smaller distance |
d1a6adeb | 1069 | between a function and its callees (later we may choose to use a more |
b58b1157 JH |
1070 | sophisticated algorithm for function reordering; we will likely want |
1071 | to use subsections to make the output functions appear in top-down | |
1072 | order). */ | |
1073 | ||
1074 | static void | |
a20af5b8 | 1075 | cgraph_expand_all_functions (void) |
b58b1157 JH |
1076 | { |
1077 | struct cgraph_node *node; | |
1078 | struct cgraph_node **order = | |
b3c3af2f | 1079 | xcalloc (cgraph_n_nodes, sizeof (struct cgraph_node *)); |
18c6ada9 | 1080 | int order_pos = 0, new_order_pos = 0; |
b58b1157 JH |
1081 | int i; |
1082 | ||
b58b1157 | 1083 | order_pos = cgraph_postorder (order); |
341c100f | 1084 | gcc_assert (order_pos == cgraph_n_nodes); |
b58b1157 | 1085 | |
1ae58c30 | 1086 | /* Garbage collector may remove inline clones we eliminate during |
18c6ada9 JH |
1087 | optimization. So we must be sure to not reference them. */ |
1088 | for (i = 0; i < order_pos; i++) | |
1089 | if (order[i]->output) | |
1090 | order[new_order_pos++] = order[i]; | |
1091 | ||
1092 | for (i = new_order_pos - 1; i >= 0; i--) | |
b58b1157 JH |
1093 | { |
1094 | node = order[i]; | |
1095 | if (node->output) | |
1096 | { | |
341c100f | 1097 | gcc_assert (node->reachable); |
b58b1157 JH |
1098 | node->output = 0; |
1099 | cgraph_expand_function (node); | |
1100 | } | |
1101 | } | |
1102 | free (order); | |
1103 | } | |
1104 | ||
e7d6beb0 | 1105 | /* Mark visibility of all functions. |
6674a6ce KZ |
1106 | |
1107 | A local function is one whose calls can occur only in the current | |
1108 | compilation unit and all its calls are explicit, so we can change | |
1109 | its calling convention. We simply mark all static functions whose | |
e7d6beb0 JH |
1110 | address is not taken as local. |
1111 | ||
1112 | We also change the TREE_PUBLIC flag of all declarations that are public | |
1113 | in language point of view but we want to overwrite this default | |
1114 | via visibilities for the backend point of view. */ | |
b58b1157 JH |
1115 | |
1116 | static void | |
e7d6beb0 | 1117 | cgraph_function_and_variable_visibility (void) |
b58b1157 JH |
1118 | { |
1119 | struct cgraph_node *node; | |
e7d6beb0 | 1120 | struct cgraph_varpool_node *vnode; |
b58b1157 | 1121 | |
b58b1157 JH |
1122 | for (node = cgraph_nodes; node; node = node->next) |
1123 | { | |
e7d6beb0 JH |
1124 | if (node->reachable |
1125 | && (DECL_COMDAT (node->decl) | |
57a73709 JH |
1126 | || (!flag_whole_program |
1127 | && TREE_PUBLIC (node->decl) && !DECL_EXTERNAL (node->decl)))) | |
ce91e74c JH |
1128 | node->local.externally_visible = true; |
1129 | if (!node->local.externally_visible && node->analyzed | |
1130 | && !DECL_EXTERNAL (node->decl)) | |
1131 | { | |
1132 | gcc_assert (flag_whole_program || !TREE_PUBLIC (node->decl)); | |
1133 | TREE_PUBLIC (node->decl) = 0; | |
1134 | } | |
b58b1157 | 1135 | node->local.local = (!node->needed |
e7d6beb0 | 1136 | && node->analyzed |
e2089d72 | 1137 | && !DECL_EXTERNAL (node->decl) |
04b0eed0 | 1138 | && !node->local.externally_visible); |
e7d6beb0 JH |
1139 | } |
1140 | for (vnode = cgraph_varpool_nodes_queue; vnode; vnode = vnode->next_needed) | |
1141 | { | |
1142 | if (vnode->needed | |
57a73709 | 1143 | && !flag_whole_program |
e7d6beb0 JH |
1144 | && (DECL_COMDAT (vnode->decl) || TREE_PUBLIC (vnode->decl))) |
1145 | vnode->externally_visible = 1; | |
ce91e74c JH |
1146 | if (!vnode->externally_visible) |
1147 | { | |
1148 | gcc_assert (flag_whole_program || !TREE_PUBLIC (vnode->decl)); | |
1149 | TREE_PUBLIC (vnode->decl) = 0; | |
1150 | } | |
e7d6beb0 | 1151 | gcc_assert (TREE_STATIC (vnode->decl)); |
b58b1157 | 1152 | } |
6674a6ce | 1153 | |
e7d6beb0 JH |
1154 | /* Because we have to be conservative on the boundaries of source |
1155 | level units, it is possible that we marked some functions in | |
1156 | reachable just because they might be used later via external | |
1157 | linkage, but after making them local they are really unreachable | |
1158 | now. */ | |
1159 | cgraph_remove_unreachable_nodes (true, cgraph_dump_file); | |
1160 | ||
b58b1157 | 1161 | if (cgraph_dump_file) |
6674a6ce KZ |
1162 | { |
1163 | fprintf (cgraph_dump_file, "\nMarking local functions:"); | |
1164 | for (node = cgraph_nodes; node; node = node->next) | |
1165 | if (node->local.local) | |
1166 | fprintf (cgraph_dump_file, " %s", cgraph_node_name (node)); | |
1167 | fprintf (cgraph_dump_file, "\n\n"); | |
e7d6beb0 JH |
1168 | fprintf (cgraph_dump_file, "\nMarking externally visible functions:"); |
1169 | for (node = cgraph_nodes; node; node = node->next) | |
1170 | if (node->local.externally_visible) | |
1171 | fprintf (cgraph_dump_file, " %s", cgraph_node_name (node)); | |
1172 | fprintf (cgraph_dump_file, "\n\n"); | |
85c33455 | 1173 | } |
e7d6beb0 | 1174 | cgraph_function_flags_ready = true; |
6674a6ce | 1175 | } |
dafc5b82 | 1176 | |
18c6ada9 JH |
1177 | /* Return true when function body of DECL still needs to be kept around |
1178 | for later re-use. */ | |
1179 | bool | |
1180 | cgraph_preserve_function_body_p (tree decl) | |
1181 | { | |
1182 | struct cgraph_node *node; | |
1183 | /* Keep the body; we're going to dump it. */ | |
9f8628ba | 1184 | if (dump_enabled_p (TDI_tree_all)) |
18c6ada9 JH |
1185 | return true; |
1186 | if (!cgraph_global_info_ready) | |
1187 | return (DECL_INLINE (decl) && !flag_really_no_inline); | |
1188 | /* Look if there is any clone around. */ | |
1189 | for (node = cgraph_node (decl); node; node = node->next_clone) | |
1190 | if (node->global.inlined_to) | |
1191 | return true; | |
1192 | return false; | |
1193 | } | |
1194 | ||
ef330312 PB |
1195 | static void |
1196 | ipa_passes (void) | |
1197 | { | |
1198 | cfun = NULL; | |
1199 | tree_register_cfg_hooks (); | |
1200 | bitmap_obstack_initialize (NULL); | |
1201 | execute_ipa_pass_list (all_ipa_passes); | |
1202 | bitmap_obstack_release (NULL); | |
1203 | } | |
1204 | ||
1c4a429a JH |
1205 | /* Perform simple optimizations based on callgraph. */ |
1206 | ||
1207 | void | |
db0e878d | 1208 | cgraph_optimize (void) |
1c4a429a | 1209 | { |
18c6ada9 JH |
1210 | #ifdef ENABLE_CHECKING |
1211 | verify_cgraph (); | |
1212 | #endif | |
4a46cbfb | 1213 | if (!flag_unit_at_a_time) |
cd9c7bd2 JH |
1214 | { |
1215 | cgraph_varpool_assemble_pending_decls (); | |
1216 | return; | |
1217 | } | |
857e7259 ZW |
1218 | |
1219 | process_pending_assemble_externals (); | |
cd9c7bd2 JH |
1220 | |
1221 | /* Frontend may output common variables after the unit has been finalized. | |
1222 | It is safe to deal with them here as they are always zero initialized. */ | |
1223 | cgraph_varpool_analyze_pending_decls (); | |
857e7259 | 1224 | |
a194aa56 | 1225 | timevar_push (TV_CGRAPHOPT); |
b58b1157 JH |
1226 | if (!quiet_flag) |
1227 | fprintf (stderr, "Performing intraprocedural optimizations\n"); | |
7d82fe7c | 1228 | |
e7d6beb0 | 1229 | cgraph_function_and_variable_visibility (); |
a194aa56 JH |
1230 | if (cgraph_dump_file) |
1231 | { | |
7d82fe7c | 1232 | fprintf (cgraph_dump_file, "Marked "); |
a194aa56 JH |
1233 | dump_cgraph (cgraph_dump_file); |
1234 | } | |
b4861090 | 1235 | ipa_passes (); |
6b02a499 JH |
1236 | /* This pass remove bodies of extern inline functions we never inlined. |
1237 | Do this later so other IPA passes see what is really going on. */ | |
1238 | cgraph_remove_unreachable_nodes (false, dump_file); | |
dafc5b82 | 1239 | cgraph_global_info_ready = true; |
a194aa56 JH |
1240 | if (cgraph_dump_file) |
1241 | { | |
7d82fe7c | 1242 | fprintf (cgraph_dump_file, "Optimized "); |
a194aa56 | 1243 | dump_cgraph (cgraph_dump_file); |
cd9c7bd2 | 1244 | dump_varpool (cgraph_dump_file); |
a194aa56 JH |
1245 | } |
1246 | timevar_pop (TV_CGRAPHOPT); | |
1c4a429a | 1247 | |
b58b1157 | 1248 | /* Output everything. */ |
7d82fe7c KC |
1249 | if (!quiet_flag) |
1250 | fprintf (stderr, "Assembling functions:\n"); | |
18c6ada9 JH |
1251 | #ifdef ENABLE_CHECKING |
1252 | verify_cgraph (); | |
1253 | #endif | |
6674a6ce | 1254 | |
6674a6ce | 1255 | cgraph_mark_functions_to_output (); |
a20af5b8 | 1256 | cgraph_expand_all_functions (); |
cd9c7bd2 JH |
1257 | cgraph_varpool_remove_unreferenced_decls (); |
1258 | ||
1259 | cgraph_varpool_assemble_pending_decls (); | |
1260 | ||
a194aa56 JH |
1261 | if (cgraph_dump_file) |
1262 | { | |
7d82fe7c | 1263 | fprintf (cgraph_dump_file, "\nFinal "); |
a194aa56 JH |
1264 | dump_cgraph (cgraph_dump_file); |
1265 | } | |
18c6ada9 JH |
1266 | #ifdef ENABLE_CHECKING |
1267 | verify_cgraph (); | |
6de9cd9a DN |
1268 | /* Double check that all inline clones are gone and that all |
1269 | function bodies have been released from memory. */ | |
1270 | if (flag_unit_at_a_time | |
9f8628ba | 1271 | && !dump_enabled_p (TDI_tree_all) |
6de9cd9a DN |
1272 | && !(sorrycount || errorcount)) |
1273 | { | |
1274 | struct cgraph_node *node; | |
1275 | bool error_found = false; | |
1276 | ||
1277 | for (node = cgraph_nodes; node; node = node->next) | |
1278 | if (node->analyzed | |
1279 | && (node->global.inlined_to | |
1280 | || DECL_SAVED_TREE (node->decl))) | |
1281 | { | |
1282 | error_found = true; | |
1283 | dump_cgraph_node (stderr, node); | |
1284 | } | |
1285 | if (error_found) | |
ab532386 | 1286 | internal_error ("nodes with no released memory found"); |
6de9cd9a | 1287 | } |
18c6ada9 | 1288 | #endif |
1c4a429a | 1289 | } |
c9b9aa64 RH |
1290 | |
1291 | /* Generate and emit a static constructor or destructor. WHICH must be | |
1292 | one of 'I' or 'D'. BODY should be a STATEMENT_LIST containing | |
1293 | GENERIC statements. */ | |
1294 | ||
1295 | void | |
35b6fdcf | 1296 | cgraph_build_static_cdtor (char which, tree body, int priority) |
c9b9aa64 RH |
1297 | { |
1298 | static int counter = 0; | |
1299 | char which_buf[16]; | |
b785f485 | 1300 | tree decl, name, resdecl; |
c9b9aa64 RH |
1301 | |
1302 | sprintf (which_buf, "%c_%d", which, counter++); | |
1303 | name = get_file_function_name_long (which_buf); | |
1304 | ||
1305 | decl = build_decl (FUNCTION_DECL, name, | |
1306 | build_function_type (void_type_node, void_list_node)); | |
1307 | current_function_decl = decl; | |
1308 | ||
b785f485 RH |
1309 | resdecl = build_decl (RESULT_DECL, NULL_TREE, void_type_node); |
1310 | DECL_ARTIFICIAL (resdecl) = 1; | |
1311 | DECL_IGNORED_P (resdecl) = 1; | |
1312 | DECL_RESULT (decl) = resdecl; | |
1313 | ||
c9b9aa64 RH |
1314 | allocate_struct_function (decl); |
1315 | ||
1316 | TREE_STATIC (decl) = 1; | |
1317 | TREE_USED (decl) = 1; | |
1318 | DECL_ARTIFICIAL (decl) = 1; | |
1319 | DECL_IGNORED_P (decl) = 1; | |
1320 | DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1; | |
1321 | DECL_SAVED_TREE (decl) = body; | |
1322 | TREE_PUBLIC (decl) = ! targetm.have_ctors_dtors; | |
1323 | DECL_UNINLINABLE (decl) = 1; | |
1324 | ||
1325 | DECL_INITIAL (decl) = make_node (BLOCK); | |
1326 | TREE_USED (DECL_INITIAL (decl)) = 1; | |
1327 | ||
1328 | DECL_SOURCE_LOCATION (decl) = input_location; | |
1329 | cfun->function_end_locus = input_location; | |
1330 | ||
341c100f NS |
1331 | switch (which) |
1332 | { | |
1333 | case 'I': | |
1334 | DECL_STATIC_CONSTRUCTOR (decl) = 1; | |
1335 | break; | |
1336 | case 'D': | |
1337 | DECL_STATIC_DESTRUCTOR (decl) = 1; | |
1338 | break; | |
1339 | default: | |
1340 | gcc_unreachable (); | |
1341 | } | |
c9b9aa64 RH |
1342 | |
1343 | gimplify_function_tree (decl); | |
1344 | ||
1345 | /* ??? We will get called LATE in the compilation process. */ | |
1346 | if (cgraph_global_info_ready) | |
e21aff8a SB |
1347 | { |
1348 | tree_lowering_passes (decl); | |
1349 | tree_rest_of_compilation (decl); | |
1350 | } | |
c9b9aa64 RH |
1351 | else |
1352 | cgraph_finalize_function (decl, 0); | |
1353 | ||
1354 | if (targetm.have_ctors_dtors) | |
1355 | { | |
1356 | void (*fn) (rtx, int); | |
1357 | ||
1358 | if (which == 'I') | |
1359 | fn = targetm.asm_out.constructor; | |
1360 | else | |
1361 | fn = targetm.asm_out.destructor; | |
35b6fdcf | 1362 | fn (XEXP (DECL_RTL (decl), 0), priority); |
c9b9aa64 RH |
1363 | } |
1364 | } | |
9b3e897d PB |
1365 | |
1366 | void | |
1367 | init_cgraph (void) | |
1368 | { | |
1369 | cgraph_dump_file = dump_begin (TDI_cgraph, NULL); | |
1370 | } |