]>
Commit | Line | Data |
---|---|---|
da5e1e7c | 1 | /* Driver of optimization process |
aad93da1 | 2 | Copyright (C) 2003-2017 Free Software Foundation, Inc. |
ae01b312 | 3 | Contributed by Jan Hubicka |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
8c4c00c1 | 9 | Software Foundation; either version 3, or (at your option) any later |
ae01b312 | 10 | version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
ae01b312 | 20 | |
da5e1e7c | 21 | /* This module implements main driver of compilation process. |
b0cdf642 | 22 | |
23 | The main scope of this file is to act as an interface in between | |
da5e1e7c | 24 | tree based frontends and the backend. |
b0cdf642 | 25 | |
26 | The front-end is supposed to use following functionality: | |
27 | ||
35ee1c66 | 28 | - finalize_function |
b0cdf642 | 29 | |
30 | This function is called once front-end has parsed whole body of function | |
31 | and it is certain that the function body nor the declaration will change. | |
32 | ||
b326746d | 33 | (There is one exception needed for implementing GCC extern inline |
34 | function.) | |
b0cdf642 | 35 | |
a2d67028 | 36 | - varpool_finalize_decl |
b0cdf642 | 37 | |
7bd28bba | 38 | This function has same behavior as the above but is used for static |
b0cdf642 | 39 | variables. |
40 | ||
cf951b1a | 41 | - add_asm_node |
42 | ||
43 | Insert new toplevel ASM statement | |
44 | ||
45 | - finalize_compilation_unit | |
b0cdf642 | 46 | |
b326746d | 47 | This function is called once (source level) compilation unit is finalized |
48 | and it will no longer change. | |
b0cdf642 | 49 | |
da5e1e7c | 50 | The symbol table is constructed starting from the trivially needed |
51 | symbols finalized by the frontend. Functions are lowered into | |
52 | GIMPLE representation and callgraph/reference lists are constructed. | |
9d75589a | 53 | Those are used to discover other necessary functions and variables. |
da5e1e7c | 54 | |
55 | At the end the bodies of unreachable functions are removed. | |
b0cdf642 | 56 | |
b326746d | 57 | The function can be called multiple times when multiple source level |
da5e1e7c | 58 | compilation units are combined. |
b0cdf642 | 59 | |
cf951b1a | 60 | - compile |
b0cdf642 | 61 | |
da5e1e7c | 62 | This passes control to the back-end. Optimizations are performed and |
63 | final assembler is generated. This is done in the following way. Note | |
64 | that with link time optimization the process is split into three | |
65 | stages (compile time, linktime analysis and parallel linktime as | |
66 | indicated bellow). | |
67 | ||
68 | Compile time: | |
69 | ||
70 | 1) Inter-procedural optimization. | |
71 | (ipa_passes) | |
72 | ||
73 | This part is further split into: | |
74 | ||
75 | a) early optimizations. These are local passes executed in | |
76 | the topological order on the callgraph. | |
77 | ||
78 | The purpose of early optimiations is to optimize away simple | |
79 | things that may otherwise confuse IP analysis. Very simple | |
80 | propagation across the callgraph is done i.e. to discover | |
81 | functions without side effects and simple inlining is performed. | |
82 | ||
83 | b) early small interprocedural passes. | |
84 | ||
85 | Those are interprocedural passes executed only at compilation | |
a04e8d62 | 86 | time. These include, for example, transational memory lowering, |
da5e1e7c | 87 | unreachable code removal and other simple transformations. |
88 | ||
89 | c) IP analysis stage. All interprocedural passes do their | |
90 | analysis. | |
91 | ||
92 | Interprocedural passes differ from small interprocedural | |
93 | passes by their ability to operate across whole program | |
94 | at linktime. Their analysis stage is performed early to | |
95 | both reduce linking times and linktime memory usage by | |
96 | not having to represent whole program in memory. | |
97 | ||
98 | d) LTO sreaming. When doing LTO, everything important gets | |
99 | streamed into the object file. | |
100 | ||
101 | Compile time and or linktime analysis stage (WPA): | |
102 | ||
103 | At linktime units gets streamed back and symbol table is | |
104 | merged. Function bodies are not streamed in and not | |
105 | available. | |
106 | e) IP propagation stage. All IP passes execute their | |
107 | IP propagation. This is done based on the earlier analysis | |
108 | without having function bodies at hand. | |
109 | f) Ltrans streaming. When doing WHOPR LTO, the program | |
110 | is partitioned and streamed into multple object files. | |
b0cdf642 | 111 | |
da5e1e7c | 112 | Compile time and/or parallel linktime stage (ltrans) |
b0cdf642 | 113 | |
da5e1e7c | 114 | Each of the object files is streamed back and compiled |
115 | separately. Now the function bodies becomes available | |
116 | again. | |
b0cdf642 | 117 | |
da5e1e7c | 118 | 2) Virtual clone materialization |
119 | (cgraph_materialize_clone) | |
b0cdf642 | 120 | |
da5e1e7c | 121 | IP passes can produce copies of existing functoins (such |
122 | as versioned clones or inline clones) without actually | |
123 | manipulating their bodies by creating virtual clones in | |
124 | the callgraph. At this time the virtual clones are | |
125 | turned into real functions | |
126 | 3) IP transformation | |
b0cdf642 | 127 | |
da5e1e7c | 128 | All IP passes transform function bodies based on earlier |
129 | decision of the IP propagation. | |
b0cdf642 | 130 | |
da5e1e7c | 131 | 4) late small IP passes |
b0cdf642 | 132 | |
da5e1e7c | 133 | Simple IP passes working within single program partition. |
b0cdf642 | 134 | |
da5e1e7c | 135 | 5) Expansion |
cf951b1a | 136 | (expand_all_functions) |
b0cdf642 | 137 | |
da5e1e7c | 138 | At this stage functions that needs to be output into |
139 | assembler are identified and compiled in topological order | |
140 | 6) Output of variables and aliases | |
141 | Now it is known what variable references was not optimized | |
142 | out and thus all variables are output to the file. | |
b0cdf642 | 143 | |
da5e1e7c | 144 | Note that with -fno-toplevel-reorder passes 5 and 6 |
145 | are combined together in cgraph_output_in_order. | |
b0cdf642 | 146 | |
da5e1e7c | 147 | Finally there are functions to manipulate the callgraph from |
148 | backend. | |
149 | - cgraph_add_new_function is used to add backend produced | |
150 | functions introduced after the unit is finalized. | |
151 | The functions are enqueue for later processing and inserted | |
152 | into callgraph with cgraph_process_new_functions. | |
121f3051 | 153 | |
da5e1e7c | 154 | - cgraph_function_versioning |
155 | ||
156 | produces a copy of function into new one (a version) | |
157 | and apply simple transformations | |
158 | */ | |
acc70efa | 159 | |
ae01b312 | 160 | #include "config.h" |
161 | #include "system.h" | |
162 | #include "coretypes.h" | |
9ef16211 | 163 | #include "backend.h" |
7c29e30e | 164 | #include "target.h" |
165 | #include "rtl.h" | |
ae01b312 | 166 | #include "tree.h" |
9ef16211 | 167 | #include "gimple.h" |
7c29e30e | 168 | #include "cfghooks.h" |
169 | #include "regset.h" /* FIXME: For reg_obstack. */ | |
170 | #include "alloc-pool.h" | |
171 | #include "tree-pass.h" | |
172 | #include "stringpool.h" | |
173 | #include "gimple-ssa.h" | |
174 | #include "cgraph.h" | |
175 | #include "coverage.h" | |
176 | #include "lto-streamer.h" | |
b20a8bb4 | 177 | #include "fold-const.h" |
9ed99284 | 178 | #include "varasm.h" |
179 | #include "stor-layout.h" | |
941366fd | 180 | #include "output.h" |
a5cb93e3 | 181 | #include "cfgcleanup.h" |
bc61cadb | 182 | #include "gimple-fold.h" |
a8783bee | 183 | #include "gimplify.h" |
dcf1a1ec | 184 | #include "gimple-iterator.h" |
e795d6e1 | 185 | #include "gimplify-me.h" |
073c1fd5 | 186 | #include "tree-cfg.h" |
187 | #include "tree-into-ssa.h" | |
69ee5dbb | 188 | #include "tree-ssa.h" |
ae01b312 | 189 | #include "langhooks.h" |
ae01b312 | 190 | #include "toplev.h" |
ae01b312 | 191 | #include "debug.h" |
2cc80ac3 | 192 | #include "symbol-summary.h" |
25a8e007 | 193 | #include "tree-vrp.h" |
b5d36404 | 194 | #include "ipa-prop.h" |
da5e1e7c | 195 | #include "gimple-pretty-print.h" |
c9036234 | 196 | #include "plugin.h" |
b9a58fc5 | 197 | #include "ipa-fnsummary.h" |
7771d558 | 198 | #include "ipa-utils.h" |
3db65b62 | 199 | #include "except.h" |
7eacb0dd | 200 | #include "cfgloop.h" |
3ea50c01 | 201 | #include "context.h" |
202 | #include "pass_manager.h" | |
e797f49f | 203 | #include "tree-nested.h" |
ceb49bba | 204 | #include "dbgcnt.h" |
058a1b7a | 205 | #include "tree-chkp.h" |
b0c5e347 | 206 | #include "lto-section-names.h" |
30a86690 | 207 | #include "stringpool.h" |
208 | #include "attribs.h" | |
d7c6d889 | 209 | |
ff2a5ada | 210 | /* Queue of cgraph nodes scheduled to be added into cgraph. This is a |
211 | secondary queue used during optimization to accommodate passes that | |
212 | may generate new functions that need to be optimized and expanded. */ | |
347a47cb | 213 | vec<cgraph_node *> cgraph_new_nodes; |
ff2a5ada | 214 | |
cf951b1a | 215 | static void expand_all_functions (void); |
216 | static void mark_functions_to_output (void); | |
18a71d50 | 217 | static void handle_alias_pairs (void); |
25bb88de | 218 | |
28454517 | 219 | /* Used for vtable lookup in thunk adjusting. */ |
220 | static GTY (()) tree vtable_entry_type; | |
221 | ||
175e0d6b | 222 | /* Return true if this symbol is a function from the C frontend specified |
223 | directly in RTL form (with "__RTL"). */ | |
224 | ||
225 | bool | |
226 | symtab_node::native_rtl_p () const | |
227 | { | |
228 | if (TREE_CODE (decl) != FUNCTION_DECL) | |
229 | return false; | |
230 | if (!DECL_STRUCT_FUNCTION (decl)) | |
231 | return false; | |
232 | return DECL_STRUCT_FUNCTION (decl)->curr_properties & PROP_rtl; | |
233 | } | |
234 | ||
35ee1c66 | 235 | /* Determine if symbol declaration is needed. That is, visible to something |
6a1c0403 | 236 | either outside this translation unit, something magic in the system |
237 | configury */ | |
238 | bool | |
35ee1c66 | 239 | symtab_node::needed_p (void) |
2c0b522d | 240 | { |
8efa224a | 241 | /* Double check that no one output the function into assembly file |
242 | early. */ | |
175e0d6b | 243 | if (!native_rtl_p ()) |
244 | gcc_checking_assert | |
245 | (!DECL_ASSEMBLER_NAME_SET_P (decl) | |
246 | || !TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))); | |
3f82b628 | 247 | |
35ee1c66 | 248 | if (!definition) |
6a1c0403 | 249 | return false; |
55680bef | 250 | |
6a1c0403 | 251 | if (DECL_EXTERNAL (decl)) |
252 | return false; | |
8baa9d15 | 253 | |
6a1c0403 | 254 | /* If the user told us it is used, then it must be so. */ |
35ee1c66 | 255 | if (force_output) |
6a1c0403 | 256 | return true; |
257 | ||
258 | /* ABI forced symbols are needed when they are external. */ | |
35ee1c66 | 259 | if (forced_by_abi && TREE_PUBLIC (decl)) |
6a1c0403 | 260 | return true; |
261 | ||
af822fd2 | 262 | /* Keep constructors, destructors and virtual functions. */ |
6a1c0403 | 263 | if (TREE_CODE (decl) == FUNCTION_DECL |
264 | && (DECL_STATIC_CONSTRUCTOR (decl) || DECL_STATIC_DESTRUCTOR (decl))) | |
265 | return true; | |
266 | ||
267 | /* Externally visible variables must be output. The exception is | |
268 | COMDAT variables that must be output only when they are needed. */ | |
269 | if (TREE_PUBLIC (decl) && !DECL_COMDAT (decl)) | |
2c0b522d | 270 | return true; |
271 | ||
2c0b522d | 272 | return false; |
273 | } | |
274 | ||
3cb3fce5 | 275 | /* Head and terminator of the queue of nodes to be processed while building |
276 | callgraph. */ | |
ff2a5ada | 277 | |
3cb3fce5 | 278 | static symtab_node symtab_terminator; |
279 | static symtab_node *queued_nodes = &symtab_terminator; | |
ff2a5ada | 280 | |
3cb3fce5 | 281 | /* Add NODE to queue starting at QUEUED_NODES. |
ff2a5ada | 282 | The queue is linked via AUX pointers and terminated by pointer to 1. */ |
283 | ||
284 | static void | |
452659af | 285 | enqueue_node (symtab_node *node) |
ff2a5ada | 286 | { |
02774f2d | 287 | if (node->aux) |
ff2a5ada | 288 | return; |
3cb3fce5 | 289 | gcc_checking_assert (queued_nodes); |
290 | node->aux = queued_nodes; | |
291 | queued_nodes = node; | |
ff2a5ada | 292 | } |
293 | ||
bdc40eb8 | 294 | /* Process CGRAPH_NEW_FUNCTIONS and perform actions necessary to add these |
523c1122 | 295 | functions into callgraph in a way so they look like ordinary reachable |
296 | functions inserted into callgraph already at construction time. */ | |
297 | ||
3cb3fce5 | 298 | void |
35ee1c66 | 299 | symbol_table::process_new_functions (void) |
523c1122 | 300 | { |
523c1122 | 301 | tree fndecl; |
523c1122 | 302 | |
347a47cb | 303 | if (!cgraph_new_nodes.exists ()) |
3cb3fce5 | 304 | return; |
347a47cb | 305 | |
18a71d50 | 306 | handle_alias_pairs (); |
523c1122 | 307 | /* Note that this queue may grow as its being processed, as the new |
308 | functions may generate new ones. */ | |
347a47cb | 309 | for (unsigned i = 0; i < cgraph_new_nodes.length (); i++) |
523c1122 | 310 | { |
347a47cb | 311 | cgraph_node *node = cgraph_new_nodes[i]; |
02774f2d | 312 | fndecl = node->decl; |
35ee1c66 | 313 | switch (state) |
523c1122 | 314 | { |
35ee1c66 | 315 | case CONSTRUCTION: |
523c1122 | 316 | /* At construction time we just need to finalize function and move |
317 | it into reachable functions list. */ | |
318 | ||
35ee1c66 | 319 | cgraph_node::finalize_function (fndecl, false); |
320 | call_cgraph_insertion_hooks (node); | |
02774f2d | 321 | enqueue_node (node); |
523c1122 | 322 | break; |
323 | ||
35ee1c66 | 324 | case IPA: |
325 | case IPA_SSA: | |
366970c6 | 326 | case IPA_SSA_AFTER_INLINING: |
523c1122 | 327 | /* When IPA optimization already started, do all essential |
328 | transformations that has been already performed on the whole | |
329 | cgraph but not on this function. */ | |
330 | ||
75a70cf9 | 331 | gimple_register_cfg_hooks (); |
02774f2d | 332 | if (!node->analyzed) |
415d1b9a | 333 | node->analyze (); |
523c1122 | 334 | push_cfun (DECL_STRUCT_FUNCTION (fndecl)); |
366970c6 | 335 | if ((state == IPA_SSA || state == IPA_SSA_AFTER_INLINING) |
f517b36e | 336 | && !gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl))) |
1297cbcd | 337 | { |
338 | bool summaried_computed = ipa_fn_summaries != NULL; | |
339 | g->get_passes ()->execute_early_local_passes (); | |
340 | /* Early passes compure inline parameters to do inlining | |
341 | and splitting. This is redundant for functions added late. | |
342 | Just throw away whatever it did. */ | |
343 | if (!summaried_computed) | |
a2da7d8a | 344 | ipa_free_fn_summary (); |
1297cbcd | 345 | } |
346 | else if (ipa_fn_summaries != NULL) | |
347 | compute_fn_summary (node, true); | |
523c1122 | 348 | free_dominance_info (CDI_POST_DOMINATORS); |
349 | free_dominance_info (CDI_DOMINATORS); | |
350 | pop_cfun (); | |
51c5d4d3 | 351 | call_cgraph_insertion_hooks (node); |
523c1122 | 352 | break; |
353 | ||
35ee1c66 | 354 | case EXPANSION: |
523c1122 | 355 | /* Functions created during expansion shall be compiled |
356 | directly. */ | |
09fc9532 | 357 | node->process = 0; |
35ee1c66 | 358 | call_cgraph_insertion_hooks (node); |
359 | node->expand (); | |
523c1122 | 360 | break; |
361 | ||
362 | default: | |
363 | gcc_unreachable (); | |
364 | break; | |
365 | } | |
366 | } | |
347a47cb | 367 | |
368 | cgraph_new_nodes.release (); | |
523c1122 | 369 | } |
370 | ||
9b8fb23a | 371 | /* As an GCC extension we allow redefinition of the function. The |
372 | semantics when both copies of bodies differ is not well defined. | |
373 | We replace the old body with new body so in unit at a time mode | |
374 | we always use new body, while in normal mode we may end up with | |
375 | old body inlined into some functions and new body expanded and | |
376 | inlined in others. | |
377 | ||
378 | ??? It may make more sense to use one body for inlining and other | |
379 | body for expanding the function but this is difficult to do. */ | |
380 | ||
15ca8f90 | 381 | void |
415d1b9a | 382 | cgraph_node::reset (void) |
9b8fb23a | 383 | { |
415d1b9a | 384 | /* If process is set, then we have already begun whole-unit analysis. |
6329636b | 385 | This is *not* testing for whether we've already emitted the function. |
386 | That case can be sort-of legitimately seen with real function redefinition | |
387 | errors. I would argue that the front end should never present us with | |
388 | such a case, but don't enforce that for now. */ | |
415d1b9a | 389 | gcc_assert (!process); |
9b8fb23a | 390 | |
391 | /* Reset our data structures so we can analyze the function again. */ | |
415d1b9a | 392 | memset (&local, 0, sizeof (local)); |
393 | memset (&global, 0, sizeof (global)); | |
394 | memset (&rtl, 0, sizeof (rtl)); | |
395 | analyzed = false; | |
396 | definition = false; | |
397 | alias = false; | |
e0dec29d | 398 | transparent_alias = false; |
415d1b9a | 399 | weakref = false; |
400 | cpp_implicit_alias = false; | |
401 | ||
402 | remove_callees (); | |
403 | remove_all_references (); | |
9b8fb23a | 404 | } |
c08871a9 | 405 | |
3a1c9df2 | 406 | /* Return true when there are references to the node. INCLUDE_SELF is |
407 | true if a self reference counts as a reference. */ | |
9a2639fc | 408 | |
35ee1c66 | 409 | bool |
3a1c9df2 | 410 | symtab_node::referred_to_p (bool include_self) |
9a2639fc | 411 | { |
35ee1c66 | 412 | ipa_ref *ref = NULL; |
9a2639fc | 413 | |
9d75589a | 414 | /* See if there are any references at all. */ |
35ee1c66 | 415 | if (iterate_referring (0, ref)) |
9a2639fc | 416 | return true; |
cf951b1a | 417 | /* For functions check also calls. */ |
35ee1c66 | 418 | cgraph_node *cn = dyn_cast <cgraph_node *> (this); |
2dc9831f | 419 | if (cn && cn->callers) |
3a1c9df2 | 420 | { |
421 | if (include_self) | |
422 | return true; | |
423 | for (cgraph_edge *e = cn->callers; e; e = e->next_caller) | |
424 | if (e->caller != this) | |
425 | return true; | |
426 | } | |
9a2639fc | 427 | return false; |
428 | } | |
429 | ||
28df663b | 430 | /* DECL has been parsed. Take it, queue it, compile it at the whim of the |
1f7747bd | 431 | logic in effect. If NO_COLLECT is true, then our caller cannot stand to have |
28df663b | 432 | the garbage collector run at the moment. We would need to either create |
433 | a new GC context, or just not compile right now. */ | |
ae01b312 | 434 | |
435 | void | |
35ee1c66 | 436 | cgraph_node::finalize_function (tree decl, bool no_collect) |
ae01b312 | 437 | { |
35ee1c66 | 438 | cgraph_node *node = cgraph_node::get_create (decl); |
ae01b312 | 439 | |
02774f2d | 440 | if (node->definition) |
443089c1 | 441 | { |
1f7747bd | 442 | /* Nested functions should only be defined once. */ |
443 | gcc_assert (!DECL_CONTEXT (decl) | |
444 | || TREE_CODE (DECL_CONTEXT (decl)) != FUNCTION_DECL); | |
415d1b9a | 445 | node->reset (); |
443089c1 | 446 | node->local.redefined_extern_inline = true; |
447 | } | |
28df663b | 448 | |
78db4b4d | 449 | /* Set definition first before calling notice_global_symbol so that |
450 | it is available to notice_global_symbol. */ | |
02774f2d | 451 | node->definition = true; |
78db4b4d | 452 | notice_global_symbol (decl); |
e27482aa | 453 | node->lowered = DECL_STRUCT_FUNCTION (decl)->cfg != NULL; |
d508ad6f | 454 | if (!flag_toplevel_reorder) |
455 | node->no_reorder = true; | |
ae01b312 | 456 | |
8efa224a | 457 | /* With -fkeep-inline-functions we are keeping all inline functions except |
458 | for extern inline ones. */ | |
459 | if (flag_keep_inline_functions | |
460 | && DECL_DECLARED_INLINE_P (decl) | |
461 | && !DECL_EXTERNAL (decl) | |
462 | && !DECL_DISREGARD_INLINE_LIMITS (decl)) | |
02774f2d | 463 | node->force_output = 1; |
2c0b522d | 464 | |
175e0d6b | 465 | /* __RTL functions were already output as soon as they were parsed (due |
466 | to the large amount of global state in the backend). | |
467 | Mark such functions as "force_output" to reflect the fact that they | |
468 | will be in the asm file when considering the symbols they reference. | |
469 | The attempt to output them later on will bail out immediately. */ | |
470 | if (node->native_rtl_p ()) | |
471 | node->force_output = 1; | |
472 | ||
8efa224a | 473 | /* When not optimizing, also output the static functions. (see |
474 | PR24561), but don't do so for always_inline functions, functions | |
475 | declared inline and nested functions. These were optimized out | |
476 | in the original implementation and it is unclear whether we want | |
477 | to change the behavior here. */ | |
d508ad6f | 478 | if (((!opt_for_fn (decl, optimize) || flag_keep_static_functions |
479 | || node->no_reorder) | |
02774f2d | 480 | && !node->cpp_implicit_alias |
8efa224a | 481 | && !DECL_DISREGARD_INLINE_LIMITS (decl) |
482 | && !DECL_DECLARED_INLINE_P (decl) | |
483 | && !(DECL_CONTEXT (decl) | |
484 | && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)) | |
485 | && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl)) | |
02774f2d | 486 | node->force_output = 1; |
8efa224a | 487 | |
2c0b522d | 488 | /* If we've not yet emitted decl, tell the debug info about it. */ |
28df663b | 489 | if (!TREE_ASM_WRITTEN (decl)) |
2c0b522d | 490 | (*debug_hooks->deferred_inline_function) (decl); |
4e8871a0 | 491 | |
1f7747bd | 492 | if (!no_collect) |
6329636b | 493 | ggc_collect (); |
9a2639fc | 494 | |
35ee1c66 | 495 | if (symtab->state == CONSTRUCTION |
496 | && (node->needed_p () || node->referred_to_p ())) | |
02774f2d | 497 | enqueue_node (node); |
ae01b312 | 498 | } |
499 | ||
3db65b62 | 500 | /* Add the function FNDECL to the call graph. |
35ee1c66 | 501 | Unlike finalize_function, this function is intended to be used |
3db65b62 | 502 | by middle end and allows insertion of new function at arbitrary point |
503 | of compilation. The function can be either in high, low or SSA form | |
504 | GIMPLE. | |
505 | ||
506 | The function is assumed to be reachable and have address taken (so no | |
507 | API breaking optimizations are performed on it). | |
508 | ||
509 | Main work done by this function is to enqueue the function for later | |
510 | processing to avoid need the passes to be re-entrant. */ | |
511 | ||
512 | void | |
415d1b9a | 513 | cgraph_node::add_new_function (tree fndecl, bool lowered) |
3db65b62 | 514 | { |
3ea50c01 | 515 | gcc::pass_manager *passes = g->get_passes (); |
35ee1c66 | 516 | cgraph_node *node; |
f48e5cbc | 517 | |
518 | if (dump_file) | |
519 | { | |
520 | struct function *fn = DECL_STRUCT_FUNCTION (fndecl); | |
521 | const char *function_type = ((gimple_has_body_p (fndecl)) | |
522 | ? (lowered | |
523 | ? (gimple_in_ssa_p (fn) | |
524 | ? "ssa gimple" | |
525 | : "low gimple") | |
526 | : "high gimple") | |
527 | : "to-be-gimplified"); | |
528 | fprintf (dump_file, | |
529 | "Added new %s function %s to callgraph\n", | |
530 | function_type, | |
531 | fndecl_name (fndecl)); | |
532 | } | |
533 | ||
35ee1c66 | 534 | switch (symtab->state) |
3db65b62 | 535 | { |
35ee1c66 | 536 | case PARSING: |
537 | cgraph_node::finalize_function (fndecl, false); | |
ff2a5ada | 538 | break; |
35ee1c66 | 539 | case CONSTRUCTION: |
3db65b62 | 540 | /* Just enqueue function to be processed at nearest occurrence. */ |
415d1b9a | 541 | node = cgraph_node::get_create (fndecl); |
3db65b62 | 542 | if (lowered) |
543 | node->lowered = true; | |
347a47cb | 544 | cgraph_new_nodes.safe_push (node); |
3db65b62 | 545 | break; |
546 | ||
35ee1c66 | 547 | case IPA: |
548 | case IPA_SSA: | |
366970c6 | 549 | case IPA_SSA_AFTER_INLINING: |
35ee1c66 | 550 | case EXPANSION: |
3db65b62 | 551 | /* Bring the function into finalized state and enqueue for later |
552 | analyzing and compilation. */ | |
415d1b9a | 553 | node = cgraph_node::get_create (fndecl); |
3db65b62 | 554 | node->local.local = false; |
02774f2d | 555 | node->definition = true; |
556 | node->force_output = true; | |
ed38a810 | 557 | if (TREE_PUBLIC (fndecl)) |
558 | node->externally_visible = true; | |
35ee1c66 | 559 | if (!lowered && symtab->state == EXPANSION) |
3db65b62 | 560 | { |
561 | push_cfun (DECL_STRUCT_FUNCTION (fndecl)); | |
3db65b62 | 562 | gimple_register_cfg_hooks (); |
563 | bitmap_obstack_initialize (NULL); | |
3538ae0d | 564 | execute_pass_list (cfun, passes->all_lowering_passes); |
bcfddb5b | 565 | passes->execute_early_local_passes (); |
3db65b62 | 566 | bitmap_obstack_release (NULL); |
567 | pop_cfun (); | |
3db65b62 | 568 | |
569 | lowered = true; | |
570 | } | |
571 | if (lowered) | |
572 | node->lowered = true; | |
347a47cb | 573 | cgraph_new_nodes.safe_push (node); |
3db65b62 | 574 | break; |
575 | ||
35ee1c66 | 576 | case FINISHED: |
3db65b62 | 577 | /* At the very end of compilation we have to do all the work up |
578 | to expansion. */ | |
415d1b9a | 579 | node = cgraph_node::create (fndecl); |
3db65b62 | 580 | if (lowered) |
581 | node->lowered = true; | |
02774f2d | 582 | node->definition = true; |
415d1b9a | 583 | node->analyze (); |
3db65b62 | 584 | push_cfun (DECL_STRUCT_FUNCTION (fndecl)); |
3db65b62 | 585 | gimple_register_cfg_hooks (); |
586 | bitmap_obstack_initialize (NULL); | |
587 | if (!gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl))) | |
bcfddb5b | 588 | g->get_passes ()->execute_early_local_passes (); |
3db65b62 | 589 | bitmap_obstack_release (NULL); |
3db65b62 | 590 | pop_cfun (); |
35ee1c66 | 591 | node->expand (); |
3db65b62 | 592 | break; |
593 | ||
594 | default: | |
595 | gcc_unreachable (); | |
596 | } | |
597 | ||
598 | /* Set a personality if required and we already passed EH lowering. */ | |
599 | if (lowered | |
600 | && (function_needs_eh_personality (DECL_STRUCT_FUNCTION (fndecl)) | |
601 | == eh_personality_lang)) | |
602 | DECL_FUNCTION_PERSONALITY (fndecl) = lang_hooks.eh_personality (); | |
603 | } | |
604 | ||
0785e435 | 605 | /* Analyze the function scheduled to be output. */ |
415d1b9a | 606 | void |
607 | cgraph_node::analyze (void) | |
0785e435 | 608 | { |
175e0d6b | 609 | if (native_rtl_p ()) |
610 | { | |
611 | analyzed = true; | |
612 | return; | |
613 | } | |
614 | ||
415d1b9a | 615 | tree decl = this->decl; |
da5e1e7c | 616 | location_t saved_loc = input_location; |
617 | input_location = DECL_SOURCE_LOCATION (decl); | |
0785e435 | 618 | |
415d1b9a | 619 | if (thunk.thunk_p) |
91bf9d9a | 620 | { |
07f32730 | 621 | cgraph_node *t = cgraph_node::get (thunk.alias); |
622 | ||
db9cef39 | 623 | create_edge (t, NULL, t->count, CGRAPH_FREQ_BASE); |
d863cfe6 | 624 | callees->can_throw_external = !TREE_NOTHROW (t->decl); |
07f32730 | 625 | /* Target code in expand_thunk may need the thunk's target |
626 | to be analyzed, so recurse here. */ | |
627 | if (!t->analyzed) | |
628 | t->analyze (); | |
629 | if (t->alias) | |
630 | { | |
631 | t = t->get_alias_target (); | |
632 | if (!t->analyzed) | |
633 | t->analyze (); | |
634 | } | |
415d1b9a | 635 | if (!expand_thunk (false, false)) |
6e1aa353 | 636 | { |
415d1b9a | 637 | thunk.alias = NULL; |
6e1aa353 | 638 | return; |
639 | } | |
415d1b9a | 640 | thunk.alias = NULL; |
91bf9d9a | 641 | } |
415d1b9a | 642 | if (alias) |
e0dec29d | 643 | resolve_alias (cgraph_node::get (alias_target), transparent_alias); |
415d1b9a | 644 | else if (dispatcher_function) |
cc8ef84f | 645 | { |
646 | /* Generate the dispatcher body of multi-versioned functions. */ | |
35ee1c66 | 647 | cgraph_function_version_info *dispatcher_version_info |
415d1b9a | 648 | = function_version (); |
cc8ef84f | 649 | if (dispatcher_version_info != NULL |
650 | && (dispatcher_version_info->dispatcher_resolver | |
651 | == NULL_TREE)) | |
652 | { | |
653 | tree resolver = NULL_TREE; | |
654 | gcc_assert (targetm.generate_version_dispatcher_body); | |
415d1b9a | 655 | resolver = targetm.generate_version_dispatcher_body (this); |
cc8ef84f | 656 | gcc_assert (resolver != NULL_TREE); |
657 | } | |
658 | } | |
91bf9d9a | 659 | else |
660 | { | |
91bf9d9a | 661 | push_cfun (DECL_STRUCT_FUNCTION (decl)); |
bfec3452 | 662 | |
d687f868 | 663 | assign_assembler_name_if_needed (decl); |
6816d0c4 | 664 | |
91bf9d9a | 665 | /* Make sure to gimplify bodies only once. During analyzing a |
666 | function we lower it, which will require gimplified nested | |
667 | functions, so we can end up here with an already gimplified | |
668 | body. */ | |
e3a19533 | 669 | if (!gimple_has_body_p (decl)) |
91bf9d9a | 670 | gimplify_function_tree (decl); |
bfec3452 | 671 | |
47199071 | 672 | /* Lower the function. */ |
415d1b9a | 673 | if (!lowered) |
47199071 | 674 | { |
415d1b9a | 675 | if (nested) |
676 | lower_nested_functions (decl); | |
677 | gcc_assert (!nested); | |
47199071 | 678 | |
679 | gimple_register_cfg_hooks (); | |
680 | bitmap_obstack_initialize (NULL); | |
3538ae0d | 681 | execute_pass_list (cfun, g->get_passes ()->all_lowering_passes); |
47199071 | 682 | free_dominance_info (CDI_POST_DOMINATORS); |
683 | free_dominance_info (CDI_DOMINATORS); | |
684 | compact_blocks (); | |
685 | bitmap_obstack_release (NULL); | |
415d1b9a | 686 | lowered = true; |
47199071 | 687 | } |
688 | ||
91bf9d9a | 689 | pop_cfun (); |
690 | } | |
415d1b9a | 691 | analyzed = true; |
0785e435 | 692 | |
da5e1e7c | 693 | input_location = saved_loc; |
0785e435 | 694 | } |
695 | ||
c70f46b0 | 696 | /* C++ frontend produce same body aliases all over the place, even before PCH |
697 | gets streamed out. It relies on us linking the aliases with their function | |
698 | in order to do the fixups, but ipa-ref is not PCH safe. Consequentely we | |
699 | first produce aliases without links, but once C++ FE is sure he won't sream | |
700 | PCH we build the links via this function. */ | |
701 | ||
702 | void | |
35ee1c66 | 703 | symbol_table::process_same_body_aliases (void) |
c70f46b0 | 704 | { |
452659af | 705 | symtab_node *node; |
48669653 | 706 | FOR_EACH_SYMBOL (node) |
02774f2d | 707 | if (node->cpp_implicit_alias && !node->analyzed) |
415d1b9a | 708 | node->resolve_alias |
53e9c5c4 | 709 | (VAR_P (node->alias_target) |
97221fd7 | 710 | ? (symtab_node *)varpool_node::get_create (node->alias_target) |
415d1b9a | 711 | : (symtab_node *)cgraph_node::get_create (node->alias_target)); |
48669653 | 712 | cpp_implicit_aliases_done = true; |
c70f46b0 | 713 | } |
714 | ||
d05db70d | 715 | /* Process attributes common for vars and functions. */ |
716 | ||
717 | static void | |
6b722052 | 718 | process_common_attributes (symtab_node *node, tree decl) |
d05db70d | 719 | { |
720 | tree weakref = lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)); | |
721 | ||
722 | if (weakref && !lookup_attribute ("alias", DECL_ATTRIBUTES (decl))) | |
723 | { | |
724 | warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wattributes, | |
725 | "%<weakref%> attribute should be accompanied with" | |
726 | " an %<alias%> attribute"); | |
727 | DECL_WEAK (decl) = 0; | |
40b32d93 | 728 | DECL_ATTRIBUTES (decl) = remove_attribute ("weakref", |
729 | DECL_ATTRIBUTES (decl)); | |
d05db70d | 730 | } |
6b722052 | 731 | |
732 | if (lookup_attribute ("no_reorder", DECL_ATTRIBUTES (decl))) | |
733 | node->no_reorder = 1; | |
d05db70d | 734 | } |
735 | ||
05806473 | 736 | /* Look for externally_visible and used attributes and mark cgraph nodes |
737 | accordingly. | |
738 | ||
739 | We cannot mark the nodes at the point the attributes are processed (in | |
740 | handle_*_attribute) because the copy of the declarations available at that | |
741 | point may not be canonical. For example, in: | |
742 | ||
743 | void f(); | |
744 | void f() __attribute__((used)); | |
745 | ||
746 | the declaration we see in handle_used_attribute will be the second | |
747 | declaration -- but the front end will subsequently merge that declaration | |
748 | with the original declaration and discard the second declaration. | |
749 | ||
35ee1c66 | 750 | Furthermore, we can't mark these nodes in finalize_function because: |
05806473 | 751 | |
752 | void f() {} | |
753 | void f() __attribute__((externally_visible)); | |
754 | ||
755 | is valid. | |
756 | ||
757 | So, we walk the nodes at the end of the translation unit, applying the | |
758 | attributes at that point. */ | |
759 | ||
760 | static void | |
35ee1c66 | 761 | process_function_and_variable_attributes (cgraph_node *first, |
098f44bc | 762 | varpool_node *first_var) |
05806473 | 763 | { |
35ee1c66 | 764 | cgraph_node *node; |
098f44bc | 765 | varpool_node *vnode; |
05806473 | 766 | |
35ee1c66 | 767 | for (node = symtab->first_function (); node != first; |
768 | node = symtab->next_function (node)) | |
05806473 | 769 | { |
02774f2d | 770 | tree decl = node->decl; |
83a23b05 | 771 | if (DECL_PRESERVE_P (decl)) |
415d1b9a | 772 | node->mark_force_output (); |
62433d51 | 773 | else if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl))) |
05806473 | 774 | { |
02774f2d | 775 | if (! TREE_PUBLIC (node->decl)) |
776 | warning_at (DECL_SOURCE_LOCATION (node->decl), OPT_Wattributes, | |
712d2297 | 777 | "%<externally_visible%>" |
778 | " attribute have effect only on public objects"); | |
05806473 | 779 | } |
40b32d93 | 780 | if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)) |
02774f2d | 781 | && (node->definition && !node->alias)) |
40b32d93 | 782 | { |
02774f2d | 783 | warning_at (DECL_SOURCE_LOCATION (node->decl), OPT_Wattributes, |
40b32d93 | 784 | "%<weakref%> attribute ignored" |
785 | " because function is defined"); | |
786 | DECL_WEAK (decl) = 0; | |
787 | DECL_ATTRIBUTES (decl) = remove_attribute ("weakref", | |
788 | DECL_ATTRIBUTES (decl)); | |
789 | } | |
a522e9eb | 790 | |
791 | if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (decl)) | |
792 | && !DECL_DECLARED_INLINE_P (decl) | |
793 | /* redefining extern inline function makes it DECL_UNINLINABLE. */ | |
794 | && !DECL_UNINLINABLE (decl)) | |
795 | warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wattributes, | |
796 | "always_inline function might not be inlinable"); | |
797 | ||
6b722052 | 798 | process_common_attributes (node, decl); |
05806473 | 799 | } |
35ee1c66 | 800 | for (vnode = symtab->first_variable (); vnode != first_var; |
801 | vnode = symtab->next_variable (vnode)) | |
05806473 | 802 | { |
02774f2d | 803 | tree decl = vnode->decl; |
aa419a52 | 804 | if (DECL_EXTERNAL (decl) |
df8d3e89 | 805 | && DECL_INITIAL (decl)) |
97221fd7 | 806 | varpool_node::finalize_decl (decl); |
83a23b05 | 807 | if (DECL_PRESERVE_P (decl)) |
02774f2d | 808 | vnode->force_output = true; |
62433d51 | 809 | else if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl))) |
05806473 | 810 | { |
02774f2d | 811 | if (! TREE_PUBLIC (vnode->decl)) |
812 | warning_at (DECL_SOURCE_LOCATION (vnode->decl), OPT_Wattributes, | |
712d2297 | 813 | "%<externally_visible%>" |
814 | " attribute have effect only on public objects"); | |
05806473 | 815 | } |
40b32d93 | 816 | if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)) |
02774f2d | 817 | && vnode->definition |
40b32d93 | 818 | && DECL_INITIAL (decl)) |
819 | { | |
02774f2d | 820 | warning_at (DECL_SOURCE_LOCATION (vnode->decl), OPT_Wattributes, |
40b32d93 | 821 | "%<weakref%> attribute ignored" |
822 | " because variable is initialized"); | |
823 | DECL_WEAK (decl) = 0; | |
824 | DECL_ATTRIBUTES (decl) = remove_attribute ("weakref", | |
825 | DECL_ATTRIBUTES (decl)); | |
826 | } | |
6b722052 | 827 | process_common_attributes (vnode, decl); |
05806473 | 828 | } |
829 | } | |
830 | ||
ff2a5ada | 831 | /* Mark DECL as finalized. By finalizing the declaration, frontend instruct the |
832 | middle end to output the variable to asm file, if needed or externally | |
833 | visible. */ | |
834 | ||
835 | void | |
97221fd7 | 836 | varpool_node::finalize_decl (tree decl) |
ff2a5ada | 837 | { |
97221fd7 | 838 | varpool_node *node = varpool_node::get_create (decl); |
ff2a5ada | 839 | |
2d4bf241 | 840 | gcc_assert (TREE_STATIC (decl) || DECL_EXTERNAL (decl)); |
ff2a5ada | 841 | |
02774f2d | 842 | if (node->definition) |
ff2a5ada | 843 | return; |
78db4b4d | 844 | /* Set definition first before calling notice_global_symbol so that |
845 | it is available to notice_global_symbol. */ | |
02774f2d | 846 | node->definition = true; |
78db4b4d | 847 | notice_global_symbol (decl); |
d508ad6f | 848 | if (!flag_toplevel_reorder) |
849 | node->no_reorder = true; | |
ff2a5ada | 850 | if (TREE_THIS_VOLATILE (decl) || DECL_PRESERVE_P (decl) |
851 | /* Traditionally we do not eliminate static variables when not | |
852 | optimizing and when not doing toplevel reoder. */ | |
d508ad6f | 853 | || (node->no_reorder && !DECL_COMDAT (node->decl) |
854 | && !DECL_ARTIFICIAL (node->decl))) | |
02774f2d | 855 | node->force_output = true; |
ff2a5ada | 856 | |
35ee1c66 | 857 | if (symtab->state == CONSTRUCTION |
858 | && (node->needed_p () || node->referred_to_p ())) | |
02774f2d | 859 | enqueue_node (node); |
35ee1c66 | 860 | if (symtab->state >= IPA_SSA) |
97221fd7 | 861 | node->analyze (); |
3d1c0354 | 862 | /* Some frontends produce various interface variables after compilation |
863 | finished. */ | |
35ee1c66 | 864 | if (symtab->state == FINISHED |
d508ad6f | 865 | || (node->no_reorder |
866 | && symtab->state == EXPANSION)) | |
97221fd7 | 867 | node->assemble_decl (); |
058a1b7a | 868 | |
869 | if (DECL_INITIAL (decl)) | |
870 | chkp_register_var_initializer (decl); | |
ff2a5ada | 871 | } |
872 | ||
98e7a67f | 873 | /* EDGE is an polymorphic call. Mark all possible targets as reachable |
874 | and if there is only one target, perform trivial devirtualization. | |
875 | REACHABLE_CALL_TARGETS collects target lists we already walked to | |
876 | avoid udplicate work. */ | |
877 | ||
878 | static void | |
431205b7 | 879 | walk_polymorphic_call_targets (hash_set<void *> *reachable_call_targets, |
35ee1c66 | 880 | cgraph_edge *edge) |
98e7a67f | 881 | { |
882 | unsigned int i; | |
883 | void *cache_token; | |
884 | bool final; | |
885 | vec <cgraph_node *>targets | |
886 | = possible_polymorphic_call_targets | |
887 | (edge, &final, &cache_token); | |
888 | ||
431205b7 | 889 | if (!reachable_call_targets->add (cache_token)) |
98e7a67f | 890 | { |
35ee1c66 | 891 | if (symtab->dump_file) |
98e7a67f | 892 | dump_possible_polymorphic_call_targets |
35ee1c66 | 893 | (symtab->dump_file, edge); |
98e7a67f | 894 | |
9af5ce0c | 895 | for (i = 0; i < targets.length (); i++) |
98e7a67f | 896 | { |
897 | /* Do not bother to mark virtual methods in anonymous namespace; | |
898 | either we will find use of virtual table defining it, or it is | |
899 | unused. */ | |
02774f2d | 900 | if (targets[i]->definition |
98e7a67f | 901 | && TREE_CODE |
02774f2d | 902 | (TREE_TYPE (targets[i]->decl)) |
98e7a67f | 903 | == METHOD_TYPE |
904 | && !type_in_anonymous_namespace_p | |
1fda15e2 | 905 | (TYPE_METHOD_BASETYPE (TREE_TYPE (targets[i]->decl)))) |
906 | enqueue_node (targets[i]); | |
98e7a67f | 907 | } |
908 | } | |
909 | ||
910 | /* Very trivial devirtualization; when the type is | |
911 | final or anonymous (so we know all its derivation) | |
912 | and there is only one possible virtual call target, | |
913 | make the edge direct. */ | |
914 | if (final) | |
915 | { | |
ceb49bba | 916 | if (targets.length () <= 1 && dbg_cnt (devirt)) |
98e7a67f | 917 | { |
e2fa5d74 | 918 | cgraph_node *target; |
919 | if (targets.length () == 1) | |
920 | target = targets[0]; | |
921 | else | |
415d1b9a | 922 | target = cgraph_node::create |
923 | (builtin_decl_implicit (BUILT_IN_UNREACHABLE)); | |
e2fa5d74 | 924 | |
35ee1c66 | 925 | if (symtab->dump_file) |
98e7a67f | 926 | { |
35ee1c66 | 927 | fprintf (symtab->dump_file, |
98e7a67f | 928 | "Devirtualizing call: "); |
35ee1c66 | 929 | print_gimple_stmt (symtab->dump_file, |
98e7a67f | 930 | edge->call_stmt, 0, |
931 | TDF_SLIM); | |
932 | } | |
ceb49bba | 933 | if (dump_enabled_p ()) |
934 | { | |
4c8041d7 | 935 | location_t locus = gimple_location_safe (edge->call_stmt); |
ceb49bba | 936 | dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, locus, |
937 | "devirtualizing call in %s to %s\n", | |
938 | edge->caller->name (), target->name ()); | |
939 | } | |
940 | ||
35ee1c66 | 941 | edge->make_direct (target); |
942 | edge->redirect_call_stmt_to_callee (); | |
058a1b7a | 943 | |
944 | /* Call to __builtin_unreachable shouldn't be instrumented. */ | |
945 | if (!targets.length ()) | |
946 | gimple_call_set_with_bounds (edge->call_stmt, false); | |
947 | ||
35ee1c66 | 948 | if (symtab->dump_file) |
98e7a67f | 949 | { |
35ee1c66 | 950 | fprintf (symtab->dump_file, |
98e7a67f | 951 | "Devirtualized as: "); |
35ee1c66 | 952 | print_gimple_stmt (symtab->dump_file, |
98e7a67f | 953 | edge->call_stmt, 0, |
954 | TDF_SLIM); | |
955 | } | |
956 | } | |
957 | } | |
958 | } | |
959 | ||
22c5bcc6 | 960 | /* Issue appropriate warnings for the global declaration DECL. */ |
961 | ||
962 | static void | |
963 | check_global_declaration (symtab_node *snode) | |
964 | { | |
87792fbc | 965 | const char *decl_file; |
22c5bcc6 | 966 | tree decl = snode->decl; |
967 | ||
968 | /* Warn about any function declared static but not defined. We don't | |
969 | warn about variables, because many programs have static variables | |
970 | that exist only to get some text into the object file. */ | |
971 | if (TREE_CODE (decl) == FUNCTION_DECL | |
972 | && DECL_INITIAL (decl) == 0 | |
973 | && DECL_EXTERNAL (decl) | |
974 | && ! DECL_ARTIFICIAL (decl) | |
975 | && ! TREE_NO_WARNING (decl) | |
976 | && ! TREE_PUBLIC (decl) | |
977 | && (warn_unused_function | |
978 | || snode->referred_to_p (/*include_self=*/false))) | |
979 | { | |
980 | if (snode->referred_to_p (/*include_self=*/false)) | |
981 | pedwarn (input_location, 0, "%q+F used but never defined", decl); | |
982 | else | |
983 | warning (OPT_Wunused_function, "%q+F declared %<static%> but never defined", decl); | |
984 | /* This symbol is effectively an "extern" declaration now. */ | |
985 | TREE_PUBLIC (decl) = 1; | |
986 | } | |
987 | ||
988 | /* Warn about static fns or vars defined but not used. */ | |
989 | if (((warn_unused_function && TREE_CODE (decl) == FUNCTION_DECL) | |
990 | || (((warn_unused_variable && ! TREE_READONLY (decl)) | |
e53f41d5 | 991 | || (warn_unused_const_variable > 0 && TREE_READONLY (decl) |
992 | && (warn_unused_const_variable == 2 | |
87792fbc | 993 | || (main_input_filename != NULL |
994 | && (decl_file = DECL_SOURCE_FILE (decl)) != NULL | |
995 | && filename_cmp (main_input_filename, | |
996 | decl_file) == 0)))) | |
53e9c5c4 | 997 | && VAR_P (decl))) |
22c5bcc6 | 998 | && ! DECL_IN_SYSTEM_HEADER (decl) |
999 | && ! snode->referred_to_p (/*include_self=*/false) | |
1000 | /* This TREE_USED check is needed in addition to referred_to_p | |
1001 | above, because the `__unused__' attribute is not being | |
1002 | considered for referred_to_p. */ | |
1003 | && ! TREE_USED (decl) | |
1004 | /* The TREE_USED bit for file-scope decls is kept in the identifier, | |
1005 | to handle multiple external decls in different scopes. */ | |
1006 | && ! (DECL_NAME (decl) && TREE_USED (DECL_NAME (decl))) | |
1007 | && ! DECL_EXTERNAL (decl) | |
1008 | && ! DECL_ARTIFICIAL (decl) | |
1009 | && ! DECL_ABSTRACT_ORIGIN (decl) | |
1010 | && ! TREE_PUBLIC (decl) | |
1011 | /* A volatile variable might be used in some non-obvious way. */ | |
97fc724d | 1012 | && (! VAR_P (decl) || ! TREE_THIS_VOLATILE (decl)) |
22c5bcc6 | 1013 | /* Global register variables must be declared to reserve them. */ |
53e9c5c4 | 1014 | && ! (VAR_P (decl) && DECL_REGISTER (decl)) |
22c5bcc6 | 1015 | /* Global ctors and dtors are called by the runtime. */ |
1016 | && (TREE_CODE (decl) != FUNCTION_DECL | |
1017 | || (!DECL_STATIC_CONSTRUCTOR (decl) | |
1018 | && !DECL_STATIC_DESTRUCTOR (decl))) | |
1019 | /* Otherwise, ask the language. */ | |
1020 | && lang_hooks.decls.warn_unused_global (decl)) | |
1021 | warning_at (DECL_SOURCE_LOCATION (decl), | |
1022 | (TREE_CODE (decl) == FUNCTION_DECL) | |
1023 | ? OPT_Wunused_function | |
1024 | : (TREE_READONLY (decl) | |
e53f41d5 | 1025 | ? OPT_Wunused_const_variable_ |
22c5bcc6 | 1026 | : OPT_Wunused_variable), |
1027 | "%qD defined but not used", decl); | |
1028 | } | |
2dc9831f | 1029 | |
ff2a5ada | 1030 | /* Discover all functions and variables that are trivially needed, analyze |
1031 | them as well as all functions and variables referred by them */ | |
415309e2 | 1032 | static cgraph_node *first_analyzed; |
1033 | static varpool_node *first_analyzed_var; | |
ae01b312 | 1034 | |
3a1c9df2 | 1035 | /* FIRST_TIME is set to TRUE for the first time we are called for a |
1036 | translation unit from finalize_compilation_unit() or false | |
1037 | otherwise. */ | |
1038 | ||
aeeb194b | 1039 | static void |
3a1c9df2 | 1040 | analyze_functions (bool first_time) |
ae01b312 | 1041 | { |
c1dcd13c | 1042 | /* Keep track of already processed nodes when called multiple times for |
06b27565 | 1043 | intermodule optimization. */ |
35ee1c66 | 1044 | cgraph_node *first_handled = first_analyzed; |
098f44bc | 1045 | varpool_node *first_handled_var = first_analyzed_var; |
431205b7 | 1046 | hash_set<void *> reachable_call_targets; |
ff2a5ada | 1047 | |
452659af | 1048 | symtab_node *node; |
1049 | symtab_node *next; | |
ff2a5ada | 1050 | int i; |
35ee1c66 | 1051 | ipa_ref *ref; |
ff2a5ada | 1052 | bool changed = true; |
fd9fde78 | 1053 | location_t saved_loc = input_location; |
ae01b312 | 1054 | |
f1c35659 | 1055 | bitmap_obstack_initialize (NULL); |
35ee1c66 | 1056 | symtab->state = CONSTRUCTION; |
fd9fde78 | 1057 | input_location = UNKNOWN_LOCATION; |
ae01b312 | 1058 | |
48669653 | 1059 | /* Ugly, but the fixup can not happen at a time same body alias is created; |
1060 | C++ FE is confused about the COMDAT groups being right. */ | |
35ee1c66 | 1061 | if (symtab->cpp_implicit_aliases_done) |
48669653 | 1062 | FOR_EACH_SYMBOL (node) |
02774f2d | 1063 | if (node->cpp_implicit_alias) |
415d1b9a | 1064 | node->fixup_same_cpp_alias_visibility (node->get_alias_target ()); |
d1f68cd8 | 1065 | build_type_inheritance_graph (); |
48669653 | 1066 | |
ff2a5ada | 1067 | /* Analysis adds static variables that in turn adds references to new functions. |
1068 | So we need to iterate the process until it stabilize. */ | |
1069 | while (changed) | |
ae01b312 | 1070 | { |
ff2a5ada | 1071 | changed = false; |
1072 | process_function_and_variable_attributes (first_analyzed, | |
1073 | first_analyzed_var); | |
1074 | ||
1075 | /* First identify the trivially needed symbols. */ | |
35ee1c66 | 1076 | for (node = symtab->first_symbol (); |
02774f2d | 1077 | node != first_analyzed |
1078 | && node != first_analyzed_var; node = node->next) | |
9b8fb23a | 1079 | { |
1d9ca4f0 | 1080 | /* Convert COMDAT group designators to IDENTIFIER_NODEs. */ |
1081 | node->get_comdat_group_id (); | |
35ee1c66 | 1082 | if (node->needed_p ()) |
ff2a5ada | 1083 | { |
1084 | enqueue_node (node); | |
35ee1c66 | 1085 | if (!changed && symtab->dump_file) |
1086 | fprintf (symtab->dump_file, "Trivially needed symbols:"); | |
ff2a5ada | 1087 | changed = true; |
35ee1c66 | 1088 | if (symtab->dump_file) |
1089 | fprintf (symtab->dump_file, " %s", node->asm_name ()); | |
1090 | if (!changed && symtab->dump_file) | |
1091 | fprintf (symtab->dump_file, "\n"); | |
ff2a5ada | 1092 | } |
02774f2d | 1093 | if (node == first_analyzed |
1094 | || node == first_analyzed_var) | |
ff2a5ada | 1095 | break; |
9b8fb23a | 1096 | } |
35ee1c66 | 1097 | symtab->process_new_functions (); |
1098 | first_analyzed_var = symtab->first_variable (); | |
1099 | first_analyzed = symtab->first_function (); | |
638531ad | 1100 | |
35ee1c66 | 1101 | if (changed && symtab->dump_file) |
1102 | fprintf (symtab->dump_file, "\n"); | |
2c0b522d | 1103 | |
ff2a5ada | 1104 | /* Lower representation, build callgraph edges and references for all trivially |
1105 | needed symbols and all symbols referred by them. */ | |
3cb3fce5 | 1106 | while (queued_nodes != &symtab_terminator) |
61c2c7b1 | 1107 | { |
ff2a5ada | 1108 | changed = true; |
3cb3fce5 | 1109 | node = queued_nodes; |
1110 | queued_nodes = (symtab_node *)queued_nodes->aux; | |
13cbeaac | 1111 | cgraph_node *cnode = dyn_cast <cgraph_node *> (node); |
02774f2d | 1112 | if (cnode && cnode->definition) |
ff2a5ada | 1113 | { |
35ee1c66 | 1114 | cgraph_edge *edge; |
02774f2d | 1115 | tree decl = cnode->decl; |
ff2a5ada | 1116 | |
2dc9831f | 1117 | /* ??? It is possible to create extern inline function |
1118 | and later using weak alias attribute to kill its body. | |
1119 | See gcc.c-torture/compile/20011119-1.c */ | |
ff2a5ada | 1120 | if (!DECL_STRUCT_FUNCTION (decl) |
02774f2d | 1121 | && !cnode->alias |
cc8ef84f | 1122 | && !cnode->thunk.thunk_p |
1123 | && !cnode->dispatcher_function) | |
ff2a5ada | 1124 | { |
415d1b9a | 1125 | cnode->reset (); |
ff2a5ada | 1126 | cnode->local.redefined_extern_inline = true; |
1127 | continue; | |
1128 | } | |
61c2c7b1 | 1129 | |
02774f2d | 1130 | if (!cnode->analyzed) |
415d1b9a | 1131 | cnode->analyze (); |
d544ceff | 1132 | |
ff2a5ada | 1133 | for (edge = cnode->callees; edge; edge = edge->next_callee) |
af822fd2 | 1134 | if (edge->callee->definition |
1135 | && (!DECL_EXTERNAL (edge->callee->decl) | |
1136 | /* When not optimizing, do not try to analyze extern | |
1137 | inline functions. Doing so is pointless. */ | |
1138 | || opt_for_fn (edge->callee->decl, optimize) | |
1139 | /* Weakrefs needs to be preserved. */ | |
1140 | || edge->callee->alias | |
1141 | /* always_inline functions are inlined aven at -O0. */ | |
1142 | || lookup_attribute | |
1143 | ("always_inline", | |
1144 | DECL_ATTRIBUTES (edge->callee->decl)) | |
1145 | /* Multiversioned functions needs the dispatcher to | |
1146 | be produced locally even for extern functions. */ | |
1147 | || edge->callee->function_version ())) | |
02774f2d | 1148 | enqueue_node (edge->callee); |
d1f68cd8 | 1149 | if (opt_for_fn (cnode->decl, optimize) |
1150 | && opt_for_fn (cnode->decl, flag_devirtualize)) | |
5514adf9 | 1151 | { |
35ee1c66 | 1152 | cgraph_edge *next; |
98e7a67f | 1153 | |
1154 | for (edge = cnode->indirect_calls; edge; edge = next) | |
1e4f4118 | 1155 | { |
1156 | next = edge->next_callee; | |
1157 | if (edge->indirect_info->polymorphic) | |
431205b7 | 1158 | walk_polymorphic_call_targets (&reachable_call_targets, |
98e7a67f | 1159 | edge); |
1e4f4118 | 1160 | } |
5514adf9 | 1161 | } |
ff2a5ada | 1162 | |
2dc9831f | 1163 | /* If decl is a clone of an abstract function, |
3e7c21b1 | 1164 | mark that abstract function so that we don't release its body. |
1165 | The DECL_INITIAL() of that abstract function declaration | |
1166 | will be later needed to output debug info. */ | |
ff2a5ada | 1167 | if (DECL_ABSTRACT_ORIGIN (decl)) |
1168 | { | |
35ee1c66 | 1169 | cgraph_node *origin_node |
b3a78a8c | 1170 | = cgraph_node::get_create (DECL_ABSTRACT_ORIGIN (decl)); |
abb1a237 | 1171 | origin_node->used_as_abstract_origin = true; |
ff2a5ada | 1172 | } |
3e7c21b1 | 1173 | /* Preserve a functions function context node. It will |
1174 | later be needed to output debug info. */ | |
1175 | if (tree fn = decl_function_context (decl)) | |
1176 | { | |
1177 | cgraph_node *origin_node = cgraph_node::get_create (fn); | |
1178 | enqueue_node (origin_node); | |
1179 | } | |
ff2a5ada | 1180 | } |
2dc9831f | 1181 | else |
1182 | { | |
13cbeaac | 1183 | varpool_node *vnode = dyn_cast <varpool_node *> (node); |
02774f2d | 1184 | if (vnode && vnode->definition && !vnode->analyzed) |
97221fd7 | 1185 | vnode->analyze (); |
2dc9831f | 1186 | } |
ff2a5ada | 1187 | |
02774f2d | 1188 | if (node->same_comdat_group) |
ff2a5ada | 1189 | { |
452659af | 1190 | symtab_node *next; |
02774f2d | 1191 | for (next = node->same_comdat_group; |
ff2a5ada | 1192 | next != node; |
02774f2d | 1193 | next = next->same_comdat_group) |
af822fd2 | 1194 | if (!next->comdat_local_p ()) |
1195 | enqueue_node (next); | |
ff2a5ada | 1196 | } |
51ce5652 | 1197 | for (i = 0; node->iterate_reference (i, ref); i++) |
af822fd2 | 1198 | if (ref->referred->definition |
1199 | && (!DECL_EXTERNAL (ref->referred->decl) | |
1200 | || ((TREE_CODE (ref->referred->decl) != FUNCTION_DECL | |
1201 | && optimize) | |
1202 | || (TREE_CODE (ref->referred->decl) == FUNCTION_DECL | |
1203 | && opt_for_fn (ref->referred->decl, optimize)) | |
8a407369 | 1204 | || node->alias |
af822fd2 | 1205 | || ref->referred->alias))) |
ff2a5ada | 1206 | enqueue_node (ref->referred); |
35ee1c66 | 1207 | symtab->process_new_functions (); |
ff2a5ada | 1208 | } |
ae01b312 | 1209 | } |
d1f68cd8 | 1210 | update_type_inheritance_graph (); |
2c0b522d | 1211 | |
aa5e06c7 | 1212 | /* Collect entry points to the unit. */ |
35ee1c66 | 1213 | if (symtab->dump_file) |
3d7bfc56 | 1214 | { |
35ee1c66 | 1215 | fprintf (symtab->dump_file, "\n\nInitial "); |
acd183e4 | 1216 | symtab->dump (symtab->dump_file); |
3d7bfc56 | 1217 | } |
e6d2b2d8 | 1218 | |
3a1c9df2 | 1219 | if (first_time) |
1220 | { | |
1221 | symtab_node *snode; | |
1222 | FOR_EACH_SYMBOL (snode) | |
22c5bcc6 | 1223 | check_global_declaration (snode); |
3a1c9df2 | 1224 | } |
1225 | ||
35ee1c66 | 1226 | if (symtab->dump_file) |
1227 | fprintf (symtab->dump_file, "\nRemoving unused symbols:"); | |
ae01b312 | 1228 | |
35ee1c66 | 1229 | for (node = symtab->first_symbol (); |
02774f2d | 1230 | node != first_handled |
1231 | && node != first_handled_var; node = next) | |
ae01b312 | 1232 | { |
02774f2d | 1233 | next = node->next; |
35ee1c66 | 1234 | if (!node->aux && !node->referred_to_p ()) |
ae01b312 | 1235 | { |
35ee1c66 | 1236 | if (symtab->dump_file) |
1237 | fprintf (symtab->dump_file, " %s", node->name ()); | |
3a1c9df2 | 1238 | |
1239 | /* See if the debugger can use anything before the DECL | |
1240 | passes away. Perhaps it can notice a DECL that is now a | |
1241 | constant and can tag the early DIE with an appropriate | |
1242 | attribute. | |
1243 | ||
1244 | Otherwise, this is the last chance the debug_hooks have | |
1245 | at looking at optimized away DECLs, since | |
1246 | late_global_decl will subsequently be called from the | |
1247 | contents of the now pruned symbol table. */ | |
53e9c5c4 | 1248 | if (VAR_P (node->decl) |
3de0cb5e | 1249 | && !decl_function_context (node->decl)) |
1250 | { | |
1251 | /* We are reclaiming totally unreachable code and variables | |
1252 | so they effectively appear as readonly. Show that to | |
1253 | the debug machinery. */ | |
1254 | TREE_READONLY (node->decl) = 1; | |
c72bf911 | 1255 | node->definition = false; |
3de0cb5e | 1256 | (*debug_hooks->late_global_decl) (node->decl); |
1257 | } | |
3a1c9df2 | 1258 | |
415d1b9a | 1259 | node->remove (); |
9b8fb23a | 1260 | continue; |
ae01b312 | 1261 | } |
13cbeaac | 1262 | if (cgraph_node *cnode = dyn_cast <cgraph_node *> (node)) |
ff2a5ada | 1263 | { |
02774f2d | 1264 | tree decl = node->decl; |
ff2a5ada | 1265 | |
02774f2d | 1266 | if (cnode->definition && !gimple_has_body_p (decl) |
1267 | && !cnode->alias | |
ff2a5ada | 1268 | && !cnode->thunk.thunk_p) |
415d1b9a | 1269 | cnode->reset (); |
ff2a5ada | 1270 | |
02774f2d | 1271 | gcc_assert (!cnode->definition || cnode->thunk.thunk_p |
1272 | || cnode->alias | |
175e0d6b | 1273 | || gimple_has_body_p (decl) |
1274 | || cnode->native_rtl_p ()); | |
02774f2d | 1275 | gcc_assert (cnode->analyzed == cnode->definition); |
ff2a5ada | 1276 | } |
02774f2d | 1277 | node->aux = NULL; |
ae01b312 | 1278 | } |
02774f2d | 1279 | for (;node; node = node->next) |
1280 | node->aux = NULL; | |
35ee1c66 | 1281 | first_analyzed = symtab->first_function (); |
1282 | first_analyzed_var = symtab->first_variable (); | |
1283 | if (symtab->dump_file) | |
e4200070 | 1284 | { |
35ee1c66 | 1285 | fprintf (symtab->dump_file, "\n\nReclaimed "); |
acd183e4 | 1286 | symtab->dump (symtab->dump_file); |
e4200070 | 1287 | } |
f1c35659 | 1288 | bitmap_obstack_release (NULL); |
ae01b312 | 1289 | ggc_collect (); |
d5b66e83 | 1290 | /* Initialize assembler name hash, in particular we want to trigger C++ |
1291 | mangling and same body alias creation before we free DECL_ARGUMENTS | |
1292 | used by it. */ | |
1293 | if (!seen_error ()) | |
35ee1c66 | 1294 | symtab->symtab_initialize_asm_name_hash (); |
fd9fde78 | 1295 | |
1296 | input_location = saved_loc; | |
aeeb194b | 1297 | } |
1298 | ||
3a849bc1 | 1299 | /* Translate the ugly representation of aliases as alias pairs into nice |
1300 | representation in callgraph. We don't handle all cases yet, | |
a3ddd82f | 1301 | unfortunately. */ |
3a849bc1 | 1302 | |
1303 | static void | |
1304 | handle_alias_pairs (void) | |
1305 | { | |
1306 | alias_pair *p; | |
1307 | unsigned i; | |
3a849bc1 | 1308 | |
f1f41a6c | 1309 | for (i = 0; alias_pairs && alias_pairs->iterate (i, &p);) |
3a849bc1 | 1310 | { |
35ee1c66 | 1311 | symtab_node *target_node = symtab_node::get_for_asmname (p->target); |
48c84ee3 | 1312 | |
a3ddd82f | 1313 | /* Weakrefs with target not defined in current unit are easy to handle: |
1314 | they behave just as external variables except we need to note the | |
1315 | alias flag to later output the weakref pseudo op into asm file. */ | |
1316 | if (!target_node | |
1317 | && lookup_attribute ("weakref", DECL_ATTRIBUTES (p->decl)) != NULL) | |
badeded8 | 1318 | { |
415d1b9a | 1319 | symtab_node *node = symtab_node::get (p->decl); |
48669653 | 1320 | if (node) |
fc8456b4 | 1321 | { |
02774f2d | 1322 | node->alias_target = p->target; |
1323 | node->weakref = true; | |
1324 | node->alias = true; | |
e0dec29d | 1325 | node->transparent_alias = true; |
fc8456b4 | 1326 | } |
f1f41a6c | 1327 | alias_pairs->unordered_remove (i); |
48c84ee3 | 1328 | continue; |
badeded8 | 1329 | } |
48c84ee3 | 1330 | else if (!target_node) |
3a849bc1 | 1331 | { |
48c84ee3 | 1332 | error ("%q+D aliased to undefined symbol %qE", p->decl, p->target); |
415d1b9a | 1333 | symtab_node *node = symtab_node::get (p->decl); |
a3ddd82f | 1334 | if (node) |
02774f2d | 1335 | node->alias = false; |
f1f41a6c | 1336 | alias_pairs->unordered_remove (i); |
48c84ee3 | 1337 | continue; |
1338 | } | |
1339 | ||
02774f2d | 1340 | if (DECL_EXTERNAL (target_node->decl) |
afea39ad | 1341 | /* We use local aliases for C++ thunks to force the tailcall |
1342 | to bind locally. This is a hack - to keep it working do | |
1343 | the following (which is not strictly correct). */ | |
e4b77b71 | 1344 | && (TREE_CODE (target_node->decl) != FUNCTION_DECL |
02774f2d | 1345 | || ! DECL_VIRTUAL_P (target_node->decl)) |
afea39ad | 1346 | && ! lookup_attribute ("weakref", DECL_ATTRIBUTES (p->decl))) |
1347 | { | |
1348 | error ("%q+D aliased to external symbol %qE", | |
1349 | p->decl, p->target); | |
1350 | } | |
1351 | ||
48c84ee3 | 1352 | if (TREE_CODE (p->decl) == FUNCTION_DECL |
13cbeaac | 1353 | && target_node && is_a <cgraph_node *> (target_node)) |
48c84ee3 | 1354 | { |
a0c6c7c1 | 1355 | tree t1 = TREE_TYPE (p->decl); |
1356 | tree t2 = TREE_TYPE (target_node->decl); | |
1357 | ||
1358 | if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (p->decl))) | |
1359 | { | |
1360 | t2 = TREE_TYPE (t2); | |
1361 | if (POINTER_TYPE_P (t2)) | |
1362 | { | |
1363 | t2 = TREE_TYPE (t2); | |
1364 | if (!FUNC_OR_METHOD_TYPE_P (t2)) | |
1365 | { | |
1366 | if (warning_at (DECL_SOURCE_LOCATION (p->decl), | |
1367 | OPT_Wattributes, | |
1368 | "%q+D %<ifunc%> resolver should return " | |
1369 | "a function pointer", | |
1370 | p->decl)) | |
1371 | inform (DECL_SOURCE_LOCATION (target_node->decl), | |
1372 | "resolver declaration here"); | |
1373 | ||
1374 | t2 = NULL_TREE; | |
1375 | } | |
1376 | } | |
1377 | else | |
1378 | { | |
1379 | /* Deal with static member function pointers. */ | |
1380 | if (TREE_CODE (t2) == RECORD_TYPE | |
1381 | && TYPE_FIELDS (t2) | |
1382 | && TREE_CODE (TREE_TYPE (TYPE_FIELDS (t2))) == POINTER_TYPE | |
1383 | && (TREE_CODE (TREE_TYPE (TREE_TYPE (TYPE_FIELDS (t2)))) | |
1384 | == METHOD_TYPE)) | |
1385 | t2 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (t2))); | |
1386 | else | |
1387 | { | |
1388 | error ("%q+D %<ifunc%> resolver must return a function " | |
1389 | "pointer", | |
1390 | p->decl); | |
1391 | inform (DECL_SOURCE_LOCATION (target_node->decl), | |
1392 | "resolver declaration here"); | |
1393 | ||
1394 | t2 = NULL_TREE; | |
1395 | } | |
1396 | } | |
1397 | } | |
1398 | ||
1399 | if (t2 | |
1400 | && (!FUNC_OR_METHOD_TYPE_P (t2) | |
1401 | || (prototype_p (t1) | |
1402 | && prototype_p (t2) | |
1403 | && !types_compatible_p (t1, t2)))) | |
1404 | { | |
1405 | /* Warn for incompatibilities. Avoid warning for functions | |
1406 | without a prototype to make it possible to declare aliases | |
1407 | without knowing the exact type, as libstdc++ does. */ | |
1408 | if (warning_at (DECL_SOURCE_LOCATION (p->decl), OPT_Wattributes, | |
1409 | "%q+D alias between functions of incompatible " | |
1410 | "types %qT and %qT", p->decl, t1, t2)) | |
1411 | inform (DECL_SOURCE_LOCATION (target_node->decl), | |
1412 | "aliased declaration here"); | |
1413 | } | |
1414 | ||
35ee1c66 | 1415 | cgraph_node *src_node = cgraph_node::get (p->decl); |
02774f2d | 1416 | if (src_node && src_node->definition) |
415d1b9a | 1417 | src_node->reset (); |
1418 | cgraph_node::create_alias (p->decl, target_node->decl); | |
f1f41a6c | 1419 | alias_pairs->unordered_remove (i); |
48c84ee3 | 1420 | } |
53e9c5c4 | 1421 | else if (VAR_P (p->decl) |
13cbeaac | 1422 | && target_node && is_a <varpool_node *> (target_node)) |
48c84ee3 | 1423 | { |
97221fd7 | 1424 | varpool_node::create_alias (p->decl, target_node->decl); |
f1f41a6c | 1425 | alias_pairs->unordered_remove (i); |
48c84ee3 | 1426 | } |
1427 | else | |
1428 | { | |
a0c6c7c1 | 1429 | error ("%q+D alias between function and variable is not supported", |
48c84ee3 | 1430 | p->decl); |
a0c6c7c1 | 1431 | inform (DECL_SOURCE_LOCATION (target_node->decl), |
1432 | "aliased declaration here"); | |
1433 | ||
f1f41a6c | 1434 | alias_pairs->unordered_remove (i); |
3a849bc1 | 1435 | } |
1436 | } | |
f1f41a6c | 1437 | vec_free (alias_pairs); |
3a849bc1 | 1438 | } |
1439 | ||
8f69fd82 | 1440 | |
ae01b312 | 1441 | /* Figure out what functions we want to assemble. */ |
1442 | ||
1443 | static void | |
cf951b1a | 1444 | mark_functions_to_output (void) |
ae01b312 | 1445 | { |
61c2c7b1 | 1446 | bool check_same_comdat_groups = false; |
382ecba7 | 1447 | cgraph_node *node; |
61c2c7b1 | 1448 | |
382ecba7 | 1449 | if (flag_checking) |
1450 | FOR_EACH_FUNCTION (node) | |
1451 | gcc_assert (!node->process); | |
ae01b312 | 1452 | |
7c455d87 | 1453 | FOR_EACH_FUNCTION (node) |
ae01b312 | 1454 | { |
02774f2d | 1455 | tree decl = node->decl; |
a0c938f0 | 1456 | |
02774f2d | 1457 | gcc_assert (!node->process || node->same_comdat_group); |
61c2c7b1 | 1458 | if (node->process) |
1459 | continue; | |
d7c6d889 | 1460 | |
e6d2b2d8 | 1461 | /* We need to output all local functions that are used and not |
1462 | always inlined, as well as those that are reachable from | |
1463 | outside the current compilation unit. */ | |
02774f2d | 1464 | if (node->analyzed |
91bf9d9a | 1465 | && !node->thunk.thunk_p |
02774f2d | 1466 | && !node->alias |
b0cdf642 | 1467 | && !node->global.inlined_to |
4ee9c684 | 1468 | && !TREE_ASM_WRITTEN (decl) |
ae01b312 | 1469 | && !DECL_EXTERNAL (decl)) |
61c2c7b1 | 1470 | { |
1471 | node->process = 1; | |
02774f2d | 1472 | if (node->same_comdat_group) |
61c2c7b1 | 1473 | { |
35ee1c66 | 1474 | cgraph_node *next; |
415d1b9a | 1475 | for (next = dyn_cast<cgraph_node *> (node->same_comdat_group); |
61c2c7b1 | 1476 | next != node; |
415d1b9a | 1477 | next = dyn_cast<cgraph_node *> (next->same_comdat_group)) |
468088ac | 1478 | if (!next->thunk.thunk_p && !next->alias |
415d1b9a | 1479 | && !next->comdat_local_p ()) |
91bf9d9a | 1480 | next->process = 1; |
61c2c7b1 | 1481 | } |
1482 | } | |
02774f2d | 1483 | else if (node->same_comdat_group) |
61c2c7b1 | 1484 | { |
382ecba7 | 1485 | if (flag_checking) |
1486 | check_same_comdat_groups = true; | |
61c2c7b1 | 1487 | } |
cc636d56 | 1488 | else |
9cee7c3f | 1489 | { |
1490 | /* We should've reclaimed all functions that are not needed. */ | |
382ecba7 | 1491 | if (flag_checking |
1492 | && !node->global.inlined_to | |
1a1a827a | 1493 | && gimple_has_body_p (decl) |
08843223 | 1494 | /* FIXME: in ltrans unit when offline copy is outside partition but inline copies |
1495 | are inside partition, we can end up not removing the body since we no longer | |
1496 | have analyzed node pointing to it. */ | |
02774f2d | 1497 | && !node->in_other_partition |
1498 | && !node->alias | |
2d4bf241 | 1499 | && !node->clones |
9cee7c3f | 1500 | && !DECL_EXTERNAL (decl)) |
1501 | { | |
415d1b9a | 1502 | node->debug (); |
9cee7c3f | 1503 | internal_error ("failed to reclaim unneeded function"); |
1504 | } | |
75a70cf9 | 1505 | gcc_assert (node->global.inlined_to |
1a1a827a | 1506 | || !gimple_has_body_p (decl) |
02774f2d | 1507 | || node->in_other_partition |
aa419a52 | 1508 | || node->clones |
1509 | || DECL_ARTIFICIAL (decl) | |
9cee7c3f | 1510 | || DECL_EXTERNAL (decl)); |
1511 | ||
1512 | } | |
a0c938f0 | 1513 | |
961e3b13 | 1514 | } |
382ecba7 | 1515 | if (flag_checking && check_same_comdat_groups) |
7c455d87 | 1516 | FOR_EACH_FUNCTION (node) |
02774f2d | 1517 | if (node->same_comdat_group && !node->process) |
61c2c7b1 | 1518 | { |
02774f2d | 1519 | tree decl = node->decl; |
61c2c7b1 | 1520 | if (!node->global.inlined_to |
1521 | && gimple_has_body_p (decl) | |
6d36105a | 1522 | /* FIXME: in an ltrans unit when the offline copy is outside a |
1523 | partition but inline copies are inside a partition, we can | |
1524 | end up not removing the body since we no longer have an | |
1525 | analyzed node pointing to it. */ | |
02774f2d | 1526 | && !node->in_other_partition |
afea39ad | 1527 | && !node->clones |
61c2c7b1 | 1528 | && !DECL_EXTERNAL (decl)) |
1529 | { | |
415d1b9a | 1530 | node->debug (); |
6d36105a | 1531 | internal_error ("failed to reclaim unneeded function in same " |
1532 | "comdat group"); | |
61c2c7b1 | 1533 | } |
1534 | } | |
961e3b13 | 1535 | } |
1536 | ||
28454517 | 1537 | /* DECL is FUNCTION_DECL. Initialize datastructures so DECL is a function |
cc8ef84f | 1538 | in lowered gimple form. IN_SSA is true if the gimple is in SSA. |
28454517 | 1539 | |
1540 | Set current_function_decl and cfun to newly constructed empty function body. | |
1541 | return basic block in the function body. */ | |
1542 | ||
cc8ef84f | 1543 | basic_block |
db9cef39 | 1544 | init_lowered_empty_function (tree decl, bool in_ssa, profile_count count) |
28454517 | 1545 | { |
1546 | basic_block bb; | |
3a9f48e7 | 1547 | edge e; |
28454517 | 1548 | |
1549 | current_function_decl = decl; | |
1550 | allocate_struct_function (decl, false); | |
1551 | gimple_register_cfg_hooks (); | |
1552 | init_empty_tree_cfg (); | |
9ae1b28a | 1553 | init_tree_ssa (cfun); |
cc8ef84f | 1554 | |
1555 | if (in_ssa) | |
1556 | { | |
cc8ef84f | 1557 | init_ssa_operands (cfun); |
1558 | cfun->gimple_df->in_ssa_p = true; | |
7eacb0dd | 1559 | cfun->curr_properties |= PROP_ssa; |
cc8ef84f | 1560 | } |
1561 | ||
28454517 | 1562 | DECL_INITIAL (decl) = make_node (BLOCK); |
2a066179 | 1563 | BLOCK_SUPERCONTEXT (DECL_INITIAL (decl)) = decl; |
28454517 | 1564 | |
1565 | DECL_SAVED_TREE (decl) = error_mark_node; | |
7eacb0dd | 1566 | cfun->curr_properties |= (PROP_gimple_lcf | PROP_gimple_leh | PROP_gimple_any |
1567 | | PROP_cfg | PROP_loops); | |
1568 | ||
25a27413 | 1569 | set_loops_for_fn (cfun, ggc_cleared_alloc<loops> ()); |
7eacb0dd | 1570 | init_loops_structure (cfun, loops_for_fn (cfun), 1); |
1571 | loops_for_fn (cfun)->state |= LOOPS_MAY_HAVE_MULTIPLE_LATCHES; | |
28454517 | 1572 | |
1573 | /* Create BB for body of the function and connect it properly. */ | |
3a9f48e7 | 1574 | ENTRY_BLOCK_PTR_FOR_FN (cfun)->count = count; |
720cfc43 | 1575 | ENTRY_BLOCK_PTR_FOR_FN (cfun)->frequency = BB_FREQ_MAX; |
3a9f48e7 | 1576 | EXIT_BLOCK_PTR_FOR_FN (cfun)->count = count; |
720cfc43 | 1577 | EXIT_BLOCK_PTR_FOR_FN (cfun)->frequency = BB_FREQ_MAX; |
4302d619 | 1578 | bb = create_basic_block (NULL, ENTRY_BLOCK_PTR_FOR_FN (cfun)); |
3a9f48e7 | 1579 | bb->count = count; |
1580 | bb->frequency = BB_FREQ_MAX; | |
1581 | e = make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun), bb, EDGE_FALLTHRU); | |
1582 | e->count = count; | |
720cfc43 | 1583 | e->probability = profile_probability::always (); |
3a9f48e7 | 1584 | e = make_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun), 0); |
1585 | e->count = count; | |
720cfc43 | 1586 | e->probability = profile_probability::always (); |
34154e27 | 1587 | add_bb_to_loop (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun)->loop_father); |
28454517 | 1588 | |
1589 | return bb; | |
1590 | } | |
1591 | ||
1592 | /* Adjust PTR by the constant FIXED_OFFSET, and by the vtable | |
1593 | offset indicated by VIRTUAL_OFFSET, if that is | |
1594 | non-null. THIS_ADJUSTING is nonzero for a this adjusting thunk and | |
1595 | zero for a result adjusting thunk. */ | |
1596 | ||
76e435b5 | 1597 | tree |
28454517 | 1598 | thunk_adjust (gimple_stmt_iterator * bsi, |
1599 | tree ptr, bool this_adjusting, | |
1600 | HOST_WIDE_INT fixed_offset, tree virtual_offset) | |
1601 | { | |
1a91d914 | 1602 | gassign *stmt; |
28454517 | 1603 | tree ret; |
1604 | ||
55d6cb23 | 1605 | if (this_adjusting |
1606 | && fixed_offset != 0) | |
28454517 | 1607 | { |
2cc66f2a | 1608 | stmt = gimple_build_assign |
1609 | (ptr, fold_build_pointer_plus_hwi_loc (input_location, | |
1610 | ptr, | |
1611 | fixed_offset)); | |
28454517 | 1612 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
1613 | } | |
1614 | ||
1615 | /* If there's a virtual offset, look up that value in the vtable and | |
1616 | adjust the pointer again. */ | |
1617 | if (virtual_offset) | |
1618 | { | |
1619 | tree vtabletmp; | |
1620 | tree vtabletmp2; | |
1621 | tree vtabletmp3; | |
28454517 | 1622 | |
1623 | if (!vtable_entry_type) | |
1624 | { | |
1625 | tree vfunc_type = make_node (FUNCTION_TYPE); | |
1626 | TREE_TYPE (vfunc_type) = integer_type_node; | |
1627 | TYPE_ARG_TYPES (vfunc_type) = NULL_TREE; | |
1628 | layout_type (vfunc_type); | |
1629 | ||
1630 | vtable_entry_type = build_pointer_type (vfunc_type); | |
1631 | } | |
1632 | ||
1633 | vtabletmp = | |
072f7ab1 | 1634 | create_tmp_reg (build_pointer_type |
37ffa8fe | 1635 | (build_pointer_type (vtable_entry_type)), "vptr"); |
28454517 | 1636 | |
1637 | /* The vptr is always at offset zero in the object. */ | |
1638 | stmt = gimple_build_assign (vtabletmp, | |
1639 | build1 (NOP_EXPR, TREE_TYPE (vtabletmp), | |
1640 | ptr)); | |
1641 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); | |
28454517 | 1642 | |
1643 | /* Form the vtable address. */ | |
072f7ab1 | 1644 | vtabletmp2 = create_tmp_reg (TREE_TYPE (TREE_TYPE (vtabletmp)), |
37ffa8fe | 1645 | "vtableaddr"); |
28454517 | 1646 | stmt = gimple_build_assign (vtabletmp2, |
182cf5a9 | 1647 | build_simple_mem_ref (vtabletmp)); |
28454517 | 1648 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
28454517 | 1649 | |
1650 | /* Find the entry with the vcall offset. */ | |
1651 | stmt = gimple_build_assign (vtabletmp2, | |
2cc66f2a | 1652 | fold_build_pointer_plus_loc (input_location, |
1653 | vtabletmp2, | |
1654 | virtual_offset)); | |
28454517 | 1655 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
1656 | ||
1657 | /* Get the offset itself. */ | |
072f7ab1 | 1658 | vtabletmp3 = create_tmp_reg (TREE_TYPE (TREE_TYPE (vtabletmp2)), |
37ffa8fe | 1659 | "vcalloffset"); |
28454517 | 1660 | stmt = gimple_build_assign (vtabletmp3, |
182cf5a9 | 1661 | build_simple_mem_ref (vtabletmp2)); |
28454517 | 1662 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
28454517 | 1663 | |
28454517 | 1664 | /* Adjust the `this' pointer. */ |
a0553bff | 1665 | ptr = fold_build_pointer_plus_loc (input_location, ptr, vtabletmp3); |
1666 | ptr = force_gimple_operand_gsi (bsi, ptr, true, NULL_TREE, false, | |
1667 | GSI_CONTINUE_LINKING); | |
28454517 | 1668 | } |
1669 | ||
55d6cb23 | 1670 | if (!this_adjusting |
1671 | && fixed_offset != 0) | |
28454517 | 1672 | /* Adjust the pointer by the constant. */ |
1673 | { | |
1674 | tree ptrtmp; | |
1675 | ||
53e9c5c4 | 1676 | if (VAR_P (ptr)) |
28454517 | 1677 | ptrtmp = ptr; |
1678 | else | |
1679 | { | |
072f7ab1 | 1680 | ptrtmp = create_tmp_reg (TREE_TYPE (ptr), "ptr"); |
28454517 | 1681 | stmt = gimple_build_assign (ptrtmp, ptr); |
1682 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); | |
28454517 | 1683 | } |
2cc66f2a | 1684 | ptr = fold_build_pointer_plus_hwi_loc (input_location, |
1685 | ptrtmp, fixed_offset); | |
28454517 | 1686 | } |
1687 | ||
1688 | /* Emit the statement and gimplify the adjustment expression. */ | |
072f7ab1 | 1689 | ret = create_tmp_reg (TREE_TYPE (ptr), "adjusted_this"); |
28454517 | 1690 | stmt = gimple_build_assign (ret, ptr); |
28454517 | 1691 | gsi_insert_after (bsi, stmt, GSI_NEW_STMT); |
1692 | ||
1693 | return ret; | |
1694 | } | |
1695 | ||
6e1aa353 | 1696 | /* Expand thunk NODE to gimple if possible. |
46e5ad0c | 1697 | When FORCE_GIMPLE_THUNK is true, gimple thunk is created and |
1698 | no assembler is produced. | |
6e1aa353 | 1699 | When OUTPUT_ASM_THUNK is true, also produce assembler for |
1700 | thunks that are not lowered. */ | |
28454517 | 1701 | |
6e1aa353 | 1702 | bool |
415d1b9a | 1703 | cgraph_node::expand_thunk (bool output_asm_thunks, bool force_gimple_thunk) |
28454517 | 1704 | { |
415d1b9a | 1705 | bool this_adjusting = thunk.this_adjusting; |
1706 | HOST_WIDE_INT fixed_offset = thunk.fixed_offset; | |
1707 | HOST_WIDE_INT virtual_value = thunk.virtual_value; | |
28454517 | 1708 | tree virtual_offset = NULL; |
415d1b9a | 1709 | tree alias = callees->callee->decl; |
1710 | tree thunk_fndecl = decl; | |
bb251465 | 1711 | tree a; |
1712 | ||
e4436fff | 1713 | /* Instrumentation thunk is the same function with |
1714 | a different signature. Never need to expand it. */ | |
1715 | if (thunk.add_pointer_bounds_args) | |
1716 | return false; | |
aed6e608 | 1717 | |
46e5ad0c | 1718 | if (!force_gimple_thunk && this_adjusting |
28454517 | 1719 | && targetm.asm_out.can_output_mi_thunk (thunk_fndecl, fixed_offset, |
1720 | virtual_value, alias)) | |
1721 | { | |
1722 | const char *fnname; | |
1723 | tree fn_block; | |
28b2c6a7 | 1724 | tree restype = TREE_TYPE (TREE_TYPE (thunk_fndecl)); |
6e1aa353 | 1725 | |
1726 | if (!output_asm_thunks) | |
ae949f2f | 1727 | { |
1728 | analyzed = true; | |
1729 | return false; | |
1730 | } | |
6e1aa353 | 1731 | |
1732 | if (in_lto_p) | |
4560777c | 1733 | get_untransformed_body (); |
6e1aa353 | 1734 | a = DECL_ARGUMENTS (thunk_fndecl); |
28454517 | 1735 | |
6e1aa353 | 1736 | current_function_decl = thunk_fndecl; |
1737 | ||
1738 | /* Ensure thunks are emitted in their correct sections. */ | |
07f32730 | 1739 | resolve_unique_section (thunk_fndecl, 0, |
1740 | flag_function_sections); | |
6e1aa353 | 1741 | |
28454517 | 1742 | DECL_RESULT (thunk_fndecl) |
1743 | = build_decl (DECL_SOURCE_LOCATION (thunk_fndecl), | |
28b2c6a7 | 1744 | RESULT_DECL, 0, restype); |
6e1aa353 | 1745 | DECL_CONTEXT (DECL_RESULT (thunk_fndecl)) = thunk_fndecl; |
22ea3b47 | 1746 | fnname = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk_fndecl)); |
28454517 | 1747 | |
1748 | /* The back end expects DECL_INITIAL to contain a BLOCK, so we | |
1749 | create one. */ | |
1750 | fn_block = make_node (BLOCK); | |
1751 | BLOCK_VARS (fn_block) = a; | |
1752 | DECL_INITIAL (thunk_fndecl) = fn_block; | |
2a066179 | 1753 | BLOCK_SUPERCONTEXT (fn_block) = thunk_fndecl; |
bf3a27b8 | 1754 | allocate_struct_function (thunk_fndecl, false); |
28454517 | 1755 | init_function_start (thunk_fndecl); |
1756 | cfun->is_thunk = 1; | |
32c7c682 | 1757 | insn_locations_init (); |
1758 | set_curr_insn_location (DECL_SOURCE_LOCATION (thunk_fndecl)); | |
1759 | prologue_location = curr_insn_location (); | |
28454517 | 1760 | assemble_start_function (thunk_fndecl, fnname); |
1761 | ||
1762 | targetm.asm_out.output_mi_thunk (asm_out_file, thunk_fndecl, | |
1763 | fixed_offset, virtual_value, alias); | |
1764 | ||
1765 | assemble_end_function (thunk_fndecl, fnname); | |
32c7c682 | 1766 | insn_locations_finalize (); |
28454517 | 1767 | init_insn_lengths (); |
1768 | free_after_compilation (cfun); | |
28454517 | 1769 | TREE_ASM_WRITTEN (thunk_fndecl) = 1; |
415d1b9a | 1770 | thunk.thunk_p = false; |
1771 | analyzed = false; | |
28454517 | 1772 | } |
17bbda62 | 1773 | else if (stdarg_p (TREE_TYPE (thunk_fndecl))) |
1774 | { | |
1775 | error ("generic thunk code fails for method %qD which uses %<...%>", | |
1776 | thunk_fndecl); | |
1777 | TREE_ASM_WRITTEN (thunk_fndecl) = 1; | |
1778 | analyzed = true; | |
1779 | return false; | |
1780 | } | |
28454517 | 1781 | else |
1782 | { | |
1783 | tree restype; | |
1784 | basic_block bb, then_bb, else_bb, return_bb; | |
1785 | gimple_stmt_iterator bsi; | |
1786 | int nargs = 0; | |
1787 | tree arg; | |
1788 | int i; | |
1789 | tree resdecl; | |
1790 | tree restmp = NULL; | |
17c596cc | 1791 | tree resbnd = NULL; |
28454517 | 1792 | |
1a91d914 | 1793 | gcall *call; |
1794 | greturn *ret; | |
e9a9dc09 | 1795 | bool alias_is_noreturn = TREE_THIS_VOLATILE (alias); |
28454517 | 1796 | |
72a985d7 | 1797 | /* We may be called from expand_thunk that releses body except for |
1798 | DECL_ARGUMENTS. In this case force_gimple_thunk is true. */ | |
1799 | if (in_lto_p && !force_gimple_thunk) | |
4560777c | 1800 | get_untransformed_body (); |
6e1aa353 | 1801 | a = DECL_ARGUMENTS (thunk_fndecl); |
52200d03 | 1802 | |
6e1aa353 | 1803 | current_function_decl = thunk_fndecl; |
1804 | ||
1805 | /* Ensure thunks are emitted in their correct sections. */ | |
07f32730 | 1806 | resolve_unique_section (thunk_fndecl, 0, |
1807 | flag_function_sections); | |
6e1aa353 | 1808 | |
28454517 | 1809 | DECL_IGNORED_P (thunk_fndecl) = 1; |
1810 | bitmap_obstack_initialize (NULL); | |
1811 | ||
415d1b9a | 1812 | if (thunk.virtual_offset_p) |
28454517 | 1813 | virtual_offset = size_int (virtual_value); |
1814 | ||
1815 | /* Build the return declaration for the function. */ | |
1816 | restype = TREE_TYPE (TREE_TYPE (thunk_fndecl)); | |
1817 | if (DECL_RESULT (thunk_fndecl) == NULL_TREE) | |
1818 | { | |
1819 | resdecl = build_decl (input_location, RESULT_DECL, 0, restype); | |
1820 | DECL_ARTIFICIAL (resdecl) = 1; | |
1821 | DECL_IGNORED_P (resdecl) = 1; | |
1822 | DECL_RESULT (thunk_fndecl) = resdecl; | |
6e1aa353 | 1823 | DECL_CONTEXT (DECL_RESULT (thunk_fndecl)) = thunk_fndecl; |
28454517 | 1824 | } |
1825 | else | |
1826 | resdecl = DECL_RESULT (thunk_fndecl); | |
1827 | ||
3a9f48e7 | 1828 | bb = then_bb = else_bb = return_bb |
1829 | = init_lowered_empty_function (thunk_fndecl, true, count); | |
28454517 | 1830 | |
1831 | bsi = gsi_start_bb (bb); | |
1832 | ||
1833 | /* Build call to the function being thunked. */ | |
e5d1ea31 | 1834 | if (!VOID_TYPE_P (restype) |
462ca422 | 1835 | && (!alias_is_noreturn |
1836 | || TREE_ADDRESSABLE (restype) | |
1837 | || TREE_CODE (TYPE_SIZE_UNIT (restype)) != INTEGER_CST)) | |
28454517 | 1838 | { |
f2c6b33f | 1839 | if (DECL_BY_REFERENCE (resdecl)) |
fd43cc59 | 1840 | { |
1841 | restmp = gimple_fold_indirect_ref (resdecl); | |
1842 | if (!restmp) | |
1843 | restmp = build2 (MEM_REF, | |
1844 | TREE_TYPE (TREE_TYPE (DECL_RESULT (alias))), | |
1845 | resdecl, | |
1846 | build_int_cst (TREE_TYPE | |
1847 | (DECL_RESULT (alias)), 0)); | |
1848 | } | |
f2c6b33f | 1849 | else if (!is_gimple_reg_type (restype)) |
28454517 | 1850 | { |
91df30af | 1851 | if (aggregate_value_p (resdecl, TREE_TYPE (thunk_fndecl))) |
1852 | { | |
1853 | restmp = resdecl; | |
bdb8985a | 1854 | |
53e9c5c4 | 1855 | if (VAR_P (restmp)) |
91df30af | 1856 | add_local_decl (cfun, restmp); |
1857 | BLOCK_VARS (DECL_INITIAL (current_function_decl)) = restmp; | |
1858 | } | |
1859 | else | |
1860 | restmp = create_tmp_var (restype, "retval"); | |
28454517 | 1861 | } |
1862 | else | |
072f7ab1 | 1863 | restmp = create_tmp_reg (restype, "retval"); |
28454517 | 1864 | } |
1865 | ||
1767a056 | 1866 | for (arg = a; arg; arg = DECL_CHAIN (arg)) |
28454517 | 1867 | nargs++; |
c2078b80 | 1868 | auto_vec<tree> vargs (nargs); |
8c2b231e | 1869 | i = 0; |
1870 | arg = a; | |
28454517 | 1871 | if (this_adjusting) |
8c2b231e | 1872 | { |
1873 | vargs.quick_push (thunk_adjust (&bsi, a, 1, fixed_offset, | |
1874 | virtual_offset)); | |
1875 | arg = DECL_CHAIN (a); | |
1876 | i = 1; | |
1877 | } | |
f2c6b33f | 1878 | |
1879 | if (nargs) | |
8c2b231e | 1880 | for (; i < nargs; i++, arg = DECL_CHAIN (arg)) |
08a057fa | 1881 | { |
1882 | tree tmp = arg; | |
8fbe8250 | 1883 | if (VECTOR_TYPE_P (TREE_TYPE (arg)) |
1884 | || TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE) | |
1885 | DECL_GIMPLE_REG_P (arg) = 1; | |
1886 | ||
08a057fa | 1887 | if (!is_gimple_val (arg)) |
1888 | { | |
1889 | tmp = create_tmp_reg (TYPE_MAIN_VARIANT | |
1890 | (TREE_TYPE (arg)), "arg"); | |
42acab1c | 1891 | gimple *stmt = gimple_build_assign (tmp, arg); |
08a057fa | 1892 | gsi_insert_after (&bsi, stmt, GSI_NEW_STMT); |
1893 | } | |
1894 | vargs.quick_push (tmp); | |
1895 | } | |
28454517 | 1896 | call = gimple_build_call_vec (build_fold_addr_expr_loc (0, alias), vargs); |
415d1b9a | 1897 | callees->call_stmt = call; |
28454517 | 1898 | gimple_call_set_from_thunk (call, true); |
058a1b7a | 1899 | gimple_call_set_with_bounds (call, instrumentation_clone); |
86bbd552 | 1900 | |
1901 | /* Return slot optimization is always possible and in fact requred to | |
1902 | return values with DECL_BY_REFERENCE. */ | |
1903 | if (aggregate_value_p (resdecl, TREE_TYPE (thunk_fndecl)) | |
1904 | && (!is_gimple_reg_type (TREE_TYPE (resdecl)) | |
1905 | || DECL_BY_REFERENCE (resdecl))) | |
1906 | gimple_call_set_return_slot_opt (call, true); | |
1907 | ||
e5d1ea31 | 1908 | if (restmp) |
f2c6b33f | 1909 | { |
1910 | gimple_call_set_lhs (call, restmp); | |
1911 | gcc_assert (useless_type_conversion_p (TREE_TYPE (restmp), | |
1912 | TREE_TYPE (TREE_TYPE (alias)))); | |
1913 | } | |
28454517 | 1914 | gsi_insert_after (&bsi, call, GSI_NEW_STMT); |
e9a9dc09 | 1915 | if (!alias_is_noreturn) |
f2c6b33f | 1916 | { |
17c596cc | 1917 | if (instrumentation_clone |
1918 | && !DECL_BY_REFERENCE (resdecl) | |
1919 | && restmp | |
1920 | && BOUNDED_P (restmp)) | |
1921 | { | |
1922 | resbnd = chkp_insert_retbnd_call (NULL, restmp, &bsi); | |
1923 | create_edge (get_create (gimple_call_fndecl (gsi_stmt (bsi))), | |
1924 | as_a <gcall *> (gsi_stmt (bsi)), | |
1925 | callees->count, callees->frequency); | |
1926 | } | |
1927 | ||
f2c6b33f | 1928 | if (restmp && !this_adjusting |
1929 | && (fixed_offset || virtual_offset)) | |
1930 | { | |
1931 | tree true_label = NULL_TREE; | |
28454517 | 1932 | |
f2c6b33f | 1933 | if (TREE_CODE (TREE_TYPE (restmp)) == POINTER_TYPE) |
1934 | { | |
42acab1c | 1935 | gimple *stmt; |
3a9f48e7 | 1936 | edge e; |
f2c6b33f | 1937 | /* If the return type is a pointer, we need to |
1938 | protect against NULL. We know there will be an | |
1939 | adjustment, because that's why we're emitting a | |
1940 | thunk. */ | |
4302d619 | 1941 | then_bb = create_basic_block (NULL, bb); |
db9cef39 | 1942 | then_bb->count = count - count.apply_scale (1, 16); |
3a9f48e7 | 1943 | then_bb->frequency = BB_FREQ_MAX - BB_FREQ_MAX / 16; |
4302d619 | 1944 | return_bb = create_basic_block (NULL, then_bb); |
3a9f48e7 | 1945 | return_bb->count = count; |
1946 | return_bb->frequency = BB_FREQ_MAX; | |
4302d619 | 1947 | else_bb = create_basic_block (NULL, else_bb); |
db9cef39 | 1948 | then_bb->count = count.apply_scale (1, 16); |
3a9f48e7 | 1949 | then_bb->frequency = BB_FREQ_MAX / 16; |
f2c6b33f | 1950 | add_bb_to_loop (then_bb, bb->loop_father); |
1951 | add_bb_to_loop (return_bb, bb->loop_father); | |
1952 | add_bb_to_loop (else_bb, bb->loop_father); | |
1953 | remove_edge (single_succ_edge (bb)); | |
1954 | true_label = gimple_block_label (then_bb); | |
1955 | stmt = gimple_build_cond (NE_EXPR, restmp, | |
1956 | build_zero_cst (TREE_TYPE (restmp)), | |
1957 | NULL_TREE, NULL_TREE); | |
1958 | gsi_insert_after (&bsi, stmt, GSI_NEW_STMT); | |
3a9f48e7 | 1959 | e = make_edge (bb, then_bb, EDGE_TRUE_VALUE); |
720cfc43 | 1960 | e->probability = profile_probability::guessed_always () |
1961 | .apply_scale (1, 16); | |
db9cef39 | 1962 | e->count = count - count.apply_scale (1, 16); |
3a9f48e7 | 1963 | e = make_edge (bb, else_bb, EDGE_FALSE_VALUE); |
720cfc43 | 1964 | e->probability = profile_probability::guessed_always () |
1965 | .apply_scale (1, 16); | |
db9cef39 | 1966 | e->count = count.apply_scale (1, 16); |
720cfc43 | 1967 | make_single_succ_edge (return_bb, |
1968 | EXIT_BLOCK_PTR_FOR_FN (cfun), 0); | |
1969 | make_single_succ_edge (then_bb, return_bb, EDGE_FALLTHRU); | |
3a9f48e7 | 1970 | e = make_edge (else_bb, return_bb, EDGE_FALLTHRU); |
720cfc43 | 1971 | e->probability = profile_probability::always (); |
db9cef39 | 1972 | e->count = count.apply_scale (1, 16); |
f2c6b33f | 1973 | bsi = gsi_last_bb (then_bb); |
1974 | } | |
28454517 | 1975 | |
f2c6b33f | 1976 | restmp = thunk_adjust (&bsi, restmp, /*this_adjusting=*/0, |
1977 | fixed_offset, virtual_offset); | |
1978 | if (true_label) | |
1979 | { | |
42acab1c | 1980 | gimple *stmt; |
f2c6b33f | 1981 | bsi = gsi_last_bb (else_bb); |
1982 | stmt = gimple_build_assign (restmp, | |
1983 | build_zero_cst (TREE_TYPE (restmp))); | |
1984 | gsi_insert_after (&bsi, stmt, GSI_NEW_STMT); | |
1985 | bsi = gsi_last_bb (return_bb); | |
1986 | } | |
28454517 | 1987 | } |
f2c6b33f | 1988 | else |
1989 | gimple_call_set_tail (call, true); | |
28454517 | 1990 | |
f2c6b33f | 1991 | /* Build return value. */ |
fd43cc59 | 1992 | if (!DECL_BY_REFERENCE (resdecl)) |
1993 | ret = gimple_build_return (restmp); | |
1994 | else | |
1995 | ret = gimple_build_return (resdecl); | |
17c596cc | 1996 | gimple_return_set_retbnd (ret, resbnd); |
fd43cc59 | 1997 | |
f2c6b33f | 1998 | gsi_insert_after (&bsi, ret, GSI_NEW_STMT); |
28454517 | 1999 | } |
2000 | else | |
f2c6b33f | 2001 | { |
2002 | gimple_call_set_tail (call, true); | |
2003 | remove_edge (single_succ_edge (bb)); | |
2004 | } | |
28454517 | 2005 | |
6e1aa353 | 2006 | cfun->gimple_df->in_ssa_p = true; |
3a9f48e7 | 2007 | profile_status_for_fn (cfun) |
db9cef39 | 2008 | = count.initialized_p () ? PROFILE_READ : PROFILE_GUESSED; |
6e1aa353 | 2009 | /* FIXME: C++ FE should stop setting TREE_ASM_WRITTEN on thunks. */ |
2010 | TREE_ASM_WRITTEN (thunk_fndecl) = false; | |
28454517 | 2011 | delete_unreachable_blocks (); |
2012 | update_ssa (TODO_update_ssa); | |
382ecba7 | 2013 | checking_verify_flow_info (); |
ba4dc75f | 2014 | free_dominance_info (CDI_DOMINATORS); |
28454517 | 2015 | |
28454517 | 2016 | /* Since we want to emit the thunk, we explicitly mark its name as |
2017 | referenced. */ | |
415d1b9a | 2018 | thunk.thunk_p = false; |
2019 | lowered = true; | |
28454517 | 2020 | bitmap_obstack_release (NULL); |
2021 | } | |
2022 | current_function_decl = NULL; | |
9078126c | 2023 | set_cfun (NULL); |
6e1aa353 | 2024 | return true; |
28454517 | 2025 | } |
2026 | ||
35ee1c66 | 2027 | /* Assemble thunks and aliases associated to node. */ |
91bf9d9a | 2028 | |
35ee1c66 | 2029 | void |
2030 | cgraph_node::assemble_thunks_and_aliases (void) | |
91bf9d9a | 2031 | { |
35ee1c66 | 2032 | cgraph_edge *e; |
2033 | ipa_ref *ref; | |
c70f46b0 | 2034 | |
35ee1c66 | 2035 | for (e = callers; e;) |
058a1b7a | 2036 | if (e->caller->thunk.thunk_p |
76e435b5 | 2037 | && !e->caller->global.inlined_to |
058a1b7a | 2038 | && !e->caller->thunk.add_pointer_bounds_args) |
91bf9d9a | 2039 | { |
35ee1c66 | 2040 | cgraph_node *thunk = e->caller; |
91bf9d9a | 2041 | |
2042 | e = e->next_caller; | |
415d1b9a | 2043 | thunk->expand_thunk (true, false); |
35ee1c66 | 2044 | thunk->assemble_thunks_and_aliases (); |
91bf9d9a | 2045 | } |
2046 | else | |
2047 | e = e->next_caller; | |
e4a2b488 | 2048 | |
35ee1c66 | 2049 | FOR_EACH_ALIAS (this, ref) |
e4a2b488 | 2050 | { |
35ee1c66 | 2051 | cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); |
e0dec29d | 2052 | if (!alias->transparent_alias) |
2053 | { | |
2054 | bool saved_written = TREE_ASM_WRITTEN (decl); | |
2055 | ||
2056 | /* Force assemble_alias to really output the alias this time instead | |
2057 | of buffering it in same alias pairs. */ | |
2058 | TREE_ASM_WRITTEN (decl) = 1; | |
2059 | do_assemble_alias (alias->decl, | |
2060 | DECL_ASSEMBLER_NAME (decl)); | |
2061 | alias->assemble_thunks_and_aliases (); | |
2062 | TREE_ASM_WRITTEN (decl) = saved_written; | |
2063 | } | |
e4a2b488 | 2064 | } |
91bf9d9a | 2065 | } |
2066 | ||
35ee1c66 | 2067 | /* Expand function specified by node. */ |
941366fd | 2068 | |
35ee1c66 | 2069 | void |
2070 | cgraph_node::expand (void) | |
941366fd | 2071 | { |
941366fd | 2072 | location_t saved_loc; |
2073 | ||
da5e1e7c | 2074 | /* We ought to not compile any inline clones. */ |
35ee1c66 | 2075 | gcc_assert (!global.inlined_to); |
da5e1e7c | 2076 | |
175e0d6b | 2077 | /* __RTL functions are compiled as soon as they are parsed, so don't |
2078 | do it again. */ | |
2079 | if (native_rtl_p ()) | |
2080 | return; | |
2081 | ||
da5e1e7c | 2082 | announce_function (decl); |
35ee1c66 | 2083 | process = 0; |
2084 | gcc_assert (lowered); | |
4560777c | 2085 | get_untransformed_body (); |
da5e1e7c | 2086 | |
2087 | /* Generate RTL for the body of DECL. */ | |
2088 | ||
941366fd | 2089 | timevar_push (TV_REST_OF_COMPILATION); |
2090 | ||
35ee1c66 | 2091 | gcc_assert (symtab->global_info_ready); |
941366fd | 2092 | |
2093 | /* Initialize the default bitmap obstack. */ | |
2094 | bitmap_obstack_initialize (NULL); | |
2095 | ||
2096 | /* Initialize the RTL code for the function. */ | |
941366fd | 2097 | saved_loc = input_location; |
da5e1e7c | 2098 | input_location = DECL_SOURCE_LOCATION (decl); |
bf3a27b8 | 2099 | |
2100 | gcc_assert (DECL_STRUCT_FUNCTION (decl)); | |
2101 | push_cfun (DECL_STRUCT_FUNCTION (decl)); | |
da5e1e7c | 2102 | init_function_start (decl); |
941366fd | 2103 | |
2104 | gimple_register_cfg_hooks (); | |
2105 | ||
2106 | bitmap_obstack_initialize (®_obstack); /* FIXME, only at RTL generation*/ | |
2107 | ||
2108 | execute_all_ipa_transforms (); | |
2109 | ||
2110 | /* Perform all tree transforms and optimizations. */ | |
2111 | ||
2112 | /* Signal the start of passes. */ | |
2113 | invoke_plugin_callbacks (PLUGIN_ALL_PASSES_START, NULL); | |
2114 | ||
3538ae0d | 2115 | execute_pass_list (cfun, g->get_passes ()->all_passes); |
941366fd | 2116 | |
2117 | /* Signal the end of passes. */ | |
2118 | invoke_plugin_callbacks (PLUGIN_ALL_PASSES_END, NULL); | |
2119 | ||
2120 | bitmap_obstack_release (®_obstack); | |
2121 | ||
2122 | /* Release the default bitmap obstack. */ | |
2123 | bitmap_obstack_release (NULL); | |
2124 | ||
941366fd | 2125 | /* If requested, warn about function definitions where the function will |
2126 | return a value (usually of some struct or union type) which itself will | |
2127 | take up a lot of stack space. */ | |
da5e1e7c | 2128 | if (warn_larger_than && !DECL_EXTERNAL (decl) && TREE_TYPE (decl)) |
941366fd | 2129 | { |
da5e1e7c | 2130 | tree ret_type = TREE_TYPE (TREE_TYPE (decl)); |
941366fd | 2131 | |
2132 | if (ret_type && TYPE_SIZE_UNIT (ret_type) | |
2133 | && TREE_CODE (TYPE_SIZE_UNIT (ret_type)) == INTEGER_CST | |
2134 | && 0 < compare_tree_int (TYPE_SIZE_UNIT (ret_type), | |
2135 | larger_than_size)) | |
2136 | { | |
2137 | unsigned int size_as_int | |
2138 | = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (ret_type)); | |
2139 | ||
2140 | if (compare_tree_int (TYPE_SIZE_UNIT (ret_type), size_as_int) == 0) | |
2141 | warning (OPT_Wlarger_than_, "size of return value of %q+D is %u bytes", | |
da5e1e7c | 2142 | decl, size_as_int); |
941366fd | 2143 | else |
2144 | warning (OPT_Wlarger_than_, "size of return value of %q+D is larger than %wd bytes", | |
da5e1e7c | 2145 | decl, larger_than_size); |
941366fd | 2146 | } |
2147 | } | |
2148 | ||
da5e1e7c | 2149 | gimple_set_body (decl, NULL); |
2150 | if (DECL_STRUCT_FUNCTION (decl) == 0 | |
415d1b9a | 2151 | && !cgraph_node::get (decl)->origin) |
941366fd | 2152 | { |
2153 | /* Stop pointing to the local nodes about to be freed. | |
2154 | But DECL_INITIAL must remain nonzero so we know this | |
2155 | was an actual function definition. | |
2156 | For a nested function, this is done in c_pop_function_context. | |
2157 | If rest_of_compilation set this to 0, leave it 0. */ | |
da5e1e7c | 2158 | if (DECL_INITIAL (decl) != 0) |
2159 | DECL_INITIAL (decl) = error_mark_node; | |
941366fd | 2160 | } |
2161 | ||
2162 | input_location = saved_loc; | |
2163 | ||
2164 | ggc_collect (); | |
2165 | timevar_pop (TV_REST_OF_COMPILATION); | |
f7777314 | 2166 | |
2167 | /* Make sure that BE didn't give up on compiling. */ | |
2168 | gcc_assert (TREE_ASM_WRITTEN (decl)); | |
bf3a27b8 | 2169 | if (cfun) |
2170 | pop_cfun (); | |
f76f7453 | 2171 | |
2172 | /* It would make a lot more sense to output thunks before function body to get more | |
cf951b1a | 2173 | forward and lest backwarding jumps. This however would need solving problem |
f76f7453 | 2174 | with comdats. See PR48668. Also aliases must come after function itself to |
cf951b1a | 2175 | make one pass assemblers, like one on AIX, happy. See PR 50689. |
f76f7453 | 2176 | FIXME: Perhaps thunks should be move before function IFF they are not in comdat |
2177 | groups. */ | |
35ee1c66 | 2178 | assemble_thunks_and_aliases (); |
2179 | release_body (); | |
1a1a827a | 2180 | /* Eliminate all call edges. This is important so the GIMPLE_CALL no longer |
2181 | points to the dead function body. */ | |
35ee1c66 | 2182 | remove_callees (); |
2183 | remove_all_references (); | |
ae01b312 | 2184 | } |
2185 | ||
af48f0b1 | 2186 | /* Node comparer that is responsible for the order that corresponds |
2187 | to time when a function was launched for the first time. */ | |
2188 | ||
2189 | static int | |
2190 | node_cmp (const void *pa, const void *pb) | |
2191 | { | |
35ee1c66 | 2192 | const cgraph_node *a = *(const cgraph_node * const *) pa; |
2193 | const cgraph_node *b = *(const cgraph_node * const *) pb; | |
af48f0b1 | 2194 | |
2195 | /* Functions with time profile must be before these without profile. */ | |
2196 | if (!a->tp_first_run || !b->tp_first_run) | |
2197 | return a->tp_first_run - b->tp_first_run; | |
2198 | ||
2199 | return a->tp_first_run != b->tp_first_run | |
2200 | ? b->tp_first_run - a->tp_first_run | |
2201 | : b->order - a->order; | |
2202 | } | |
acc70efa | 2203 | |
d9d9733a | 2204 | /* Expand all functions that must be output. |
2205 | ||
d7c6d889 | 2206 | Attempt to topologically sort the nodes so function is output when |
2207 | all called functions are already assembled to allow data to be | |
91c82c20 | 2208 | propagated across the callgraph. Use a stack to get smaller distance |
3927afe0 | 2209 | between a function and its callees (later we may choose to use a more |
d7c6d889 | 2210 | sophisticated algorithm for function reordering; we will likely want |
2211 | to use subsections to make the output functions appear in top-down | |
2212 | order). */ | |
2213 | ||
2214 | static void | |
cf951b1a | 2215 | expand_all_functions (void) |
d7c6d889 | 2216 | { |
35ee1c66 | 2217 | cgraph_node *node; |
2218 | cgraph_node **order = XCNEWVEC (cgraph_node *, | |
2219 | symtab->cgraph_count); | |
af48f0b1 | 2220 | unsigned int expanded_func_count = 0, profiled_func_count = 0; |
c04e3894 | 2221 | int order_pos, new_order_pos = 0; |
d7c6d889 | 2222 | int i; |
2223 | ||
7771d558 | 2224 | order_pos = ipa_reverse_postorder (order); |
35ee1c66 | 2225 | gcc_assert (order_pos == symtab->cgraph_count); |
d7c6d889 | 2226 | |
7bd28bba | 2227 | /* Garbage collector may remove inline clones we eliminate during |
b0cdf642 | 2228 | optimization. So we must be sure to not reference them. */ |
2229 | for (i = 0; i < order_pos; i++) | |
09fc9532 | 2230 | if (order[i]->process) |
b0cdf642 | 2231 | order[new_order_pos++] = order[i]; |
2232 | ||
af48f0b1 | 2233 | if (flag_profile_reorder_functions) |
35ee1c66 | 2234 | qsort (order, new_order_pos, sizeof (cgraph_node *), node_cmp); |
af48f0b1 | 2235 | |
b0cdf642 | 2236 | for (i = new_order_pos - 1; i >= 0; i--) |
d7c6d889 | 2237 | { |
2238 | node = order[i]; | |
af48f0b1 | 2239 | |
09fc9532 | 2240 | if (node->process) |
d7c6d889 | 2241 | { |
5c6f6a61 | 2242 | expanded_func_count++; |
2243 | if(node->tp_first_run) | |
2244 | profiled_func_count++; | |
2245 | ||
2246 | if (symtab->dump_file) | |
2247 | fprintf (symtab->dump_file, | |
2248 | "Time profile order in expand_all_functions:%s:%d\n", | |
2249 | node->asm_name (), node->tp_first_run); | |
09fc9532 | 2250 | node->process = 0; |
35ee1c66 | 2251 | node->expand (); |
d7c6d889 | 2252 | } |
2253 | } | |
af48f0b1 | 2254 | |
2255 | if (dump_file) | |
2256 | fprintf (dump_file, "Expanded functions with time profile (%s):%u/%u\n", | |
2257 | main_input_filename, profiled_func_count, expanded_func_count); | |
2258 | ||
35ee1c66 | 2259 | if (symtab->dump_file && flag_profile_reorder_functions) |
2260 | fprintf (symtab->dump_file, "Expanded functions with time profile:%u/%u\n", | |
af48f0b1 | 2261 | profiled_func_count, expanded_func_count); |
2262 | ||
35ee1c66 | 2263 | symtab->process_new_functions (); |
8a4a28a8 | 2264 | free_gimplify_stack (); |
773c5ba7 | 2265 | |
d7c6d889 | 2266 | free (order); |
2267 | } | |
2268 | ||
56af936e | 2269 | /* This is used to sort the node types by the cgraph order number. */ |
2270 | ||
0b09525f | 2271 | enum cgraph_order_sort_kind |
2272 | { | |
2273 | ORDER_UNDEFINED = 0, | |
2274 | ORDER_FUNCTION, | |
2275 | ORDER_VAR, | |
511b1ef2 | 2276 | ORDER_VAR_UNDEF, |
0b09525f | 2277 | ORDER_ASM |
2278 | }; | |
2279 | ||
56af936e | 2280 | struct cgraph_order_sort |
2281 | { | |
0b09525f | 2282 | enum cgraph_order_sort_kind kind; |
56af936e | 2283 | union |
2284 | { | |
35ee1c66 | 2285 | cgraph_node *f; |
098f44bc | 2286 | varpool_node *v; |
35ee1c66 | 2287 | asm_node *a; |
56af936e | 2288 | } u; |
2289 | }; | |
2290 | ||
2291 | /* Output all functions, variables, and asm statements in the order | |
2292 | according to their order fields, which is the order in which they | |
2293 | appeared in the file. This implements -fno-toplevel-reorder. In | |
2294 | this mode we may output functions and variables which don't really | |
d508ad6f | 2295 | need to be output. */ |
56af936e | 2296 | |
2297 | static void | |
d508ad6f | 2298 | output_in_order (void) |
56af936e | 2299 | { |
2300 | int max; | |
35ee1c66 | 2301 | cgraph_order_sort *nodes; |
56af936e | 2302 | int i; |
35ee1c66 | 2303 | cgraph_node *pf; |
098f44bc | 2304 | varpool_node *pv; |
35ee1c66 | 2305 | asm_node *pa; |
2306 | max = symtab->order; | |
2307 | nodes = XCNEWVEC (cgraph_order_sort, max); | |
56af936e | 2308 | |
7c455d87 | 2309 | FOR_EACH_DEFINED_FUNCTION (pf) |
56af936e | 2310 | { |
02774f2d | 2311 | if (pf->process && !pf->thunk.thunk_p && !pf->alias) |
56af936e | 2312 | { |
d508ad6f | 2313 | if (!pf->no_reorder) |
6b722052 | 2314 | continue; |
02774f2d | 2315 | i = pf->order; |
56af936e | 2316 | gcc_assert (nodes[i].kind == ORDER_UNDEFINED); |
2317 | nodes[i].kind = ORDER_FUNCTION; | |
2318 | nodes[i].u.f = pf; | |
2319 | } | |
2320 | } | |
2321 | ||
511b1ef2 | 2322 | /* There is a similar loop in symbol_table::output_variables. |
2323 | Please keep them in sync. */ | |
2324 | FOR_EACH_VARIABLE (pv) | |
2325 | { | |
d508ad6f | 2326 | if (!pv->no_reorder) |
511b1ef2 | 2327 | continue; |
2328 | if (DECL_HARD_REGISTER (pv->decl) | |
2329 | || DECL_HAS_VALUE_EXPR_P (pv->decl)) | |
2330 | continue; | |
2331 | i = pv->order; | |
2332 | gcc_assert (nodes[i].kind == ORDER_UNDEFINED); | |
2333 | nodes[i].kind = pv->definition ? ORDER_VAR : ORDER_VAR_UNDEF; | |
2334 | nodes[i].u.v = pv; | |
2335 | } | |
56af936e | 2336 | |
35ee1c66 | 2337 | for (pa = symtab->first_asm_symbol (); pa; pa = pa->next) |
56af936e | 2338 | { |
2339 | i = pa->order; | |
2340 | gcc_assert (nodes[i].kind == ORDER_UNDEFINED); | |
2341 | nodes[i].kind = ORDER_ASM; | |
2342 | nodes[i].u.a = pa; | |
2343 | } | |
56af936e | 2344 | |
304e5318 | 2345 | /* In toplevel reorder mode we output all statics; mark them as needed. */ |
304e5318 | 2346 | |
91da0f1c | 2347 | for (i = 0; i < max; ++i) |
2348 | if (nodes[i].kind == ORDER_VAR) | |
97221fd7 | 2349 | nodes[i].u.v->finalize_named_section_flags (); |
91da0f1c | 2350 | |
56af936e | 2351 | for (i = 0; i < max; ++i) |
2352 | { | |
2353 | switch (nodes[i].kind) | |
2354 | { | |
2355 | case ORDER_FUNCTION: | |
09fc9532 | 2356 | nodes[i].u.f->process = 0; |
35ee1c66 | 2357 | nodes[i].u.f->expand (); |
56af936e | 2358 | break; |
2359 | ||
2360 | case ORDER_VAR: | |
97221fd7 | 2361 | nodes[i].u.v->assemble_decl (); |
56af936e | 2362 | break; |
2363 | ||
511b1ef2 | 2364 | case ORDER_VAR_UNDEF: |
2365 | assemble_undefined_decl (nodes[i].u.v->decl); | |
2366 | break; | |
2367 | ||
56af936e | 2368 | case ORDER_ASM: |
2369 | assemble_asm (nodes[i].u.a->asm_str); | |
2370 | break; | |
2371 | ||
2372 | case ORDER_UNDEFINED: | |
2373 | break; | |
2374 | ||
2375 | default: | |
2376 | gcc_unreachable (); | |
2377 | } | |
2378 | } | |
4b4ea2db | 2379 | |
35ee1c66 | 2380 | symtab->clear_asm_symbols (); |
2381 | ||
3e1cde87 | 2382 | free (nodes); |
56af936e | 2383 | } |
2384 | ||
77fce4cd | 2385 | static void |
2386 | ipa_passes (void) | |
2387 | { | |
3ea50c01 | 2388 | gcc::pass_manager *passes = g->get_passes (); |
2389 | ||
87d4aa85 | 2390 | set_cfun (NULL); |
4b14adf9 | 2391 | current_function_decl = NULL; |
75a70cf9 | 2392 | gimple_register_cfg_hooks (); |
77fce4cd | 2393 | bitmap_obstack_initialize (NULL); |
59dd4830 | 2394 | |
c9036234 | 2395 | invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_START, NULL); |
2396 | ||
59dd4830 | 2397 | if (!in_lto_p) |
7b2e8956 | 2398 | { |
3ea50c01 | 2399 | execute_ipa_pass_list (passes->all_small_ipa_passes); |
7b2e8956 | 2400 | if (seen_error ()) |
2401 | return; | |
2402 | } | |
9ed5b1f5 | 2403 | |
289c4db4 | 2404 | /* This extra symtab_remove_unreachable_nodes pass tends to catch some |
2405 | devirtualization and other changes where removal iterate. */ | |
366970c6 | 2406 | symtab->remove_unreachable_nodes (symtab->dump_file); |
941125aa | 2407 | |
7bfefa9d | 2408 | /* If pass_all_early_optimizations was not scheduled, the state of |
2409 | the cgraph will not be properly updated. Update it now. */ | |
35ee1c66 | 2410 | if (symtab->state < IPA_SSA) |
2411 | symtab->state = IPA_SSA; | |
9ed5b1f5 | 2412 | |
7bfefa9d | 2413 | if (!in_lto_p) |
2414 | { | |
2415 | /* Generate coverage variables and constructors. */ | |
2416 | coverage_finish (); | |
2417 | ||
2418 | /* Process new functions added. */ | |
2419 | set_cfun (NULL); | |
2420 | current_function_decl = NULL; | |
35ee1c66 | 2421 | symtab->process_new_functions (); |
7bfefa9d | 2422 | |
c9036234 | 2423 | execute_ipa_summary_passes |
b23e5d49 | 2424 | ((ipa_opt_pass_d *) passes->all_regular_ipa_passes); |
8867b500 | 2425 | } |
23433d72 | 2426 | |
2427 | /* Some targets need to handle LTO assembler output specially. */ | |
9f28dc4c | 2428 | if (flag_generate_lto || flag_generate_offload) |
23433d72 | 2429 | targetm.asm_out.lto_start (); |
2430 | ||
7bfefa9d | 2431 | if (!in_lto_p) |
b0c5e347 | 2432 | { |
2433 | if (g->have_offload) | |
2434 | { | |
2435 | section_name_prefix = OFFLOAD_SECTION_NAME_PREFIX; | |
ba000093 | 2436 | lto_stream_offload_p = true; |
9d65fe51 | 2437 | ipa_write_summaries (); |
ba000093 | 2438 | lto_stream_offload_p = false; |
b0c5e347 | 2439 | } |
2440 | if (flag_lto) | |
2441 | { | |
2442 | section_name_prefix = LTO_SECTION_NAME_PREFIX; | |
ba000093 | 2443 | lto_stream_offload_p = false; |
9d65fe51 | 2444 | ipa_write_summaries (); |
b0c5e347 | 2445 | } |
2446 | } | |
7bfefa9d | 2447 | |
9f28dc4c | 2448 | if (flag_generate_lto || flag_generate_offload) |
23433d72 | 2449 | targetm.asm_out.lto_end (); |
2450 | ||
b33542ab | 2451 | if (!flag_ltrans && (in_lto_p || !flag_lto || flag_fat_lto_objects)) |
3ea50c01 | 2452 | execute_ipa_pass_list (passes->all_regular_ipa_passes); |
c9036234 | 2453 | invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_END, NULL); |
9ed5b1f5 | 2454 | |
77fce4cd | 2455 | bitmap_obstack_release (NULL); |
2456 | } | |
2457 | ||
badeded8 | 2458 | |
2459 | /* Return string alias is alias of. */ | |
2460 | ||
2461 | static tree | |
2462 | get_alias_symbol (tree decl) | |
2463 | { | |
2464 | tree alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl)); | |
2465 | return get_identifier (TREE_STRING_POINTER | |
2466 | (TREE_VALUE (TREE_VALUE (alias)))); | |
2467 | } | |
2468 | ||
2469 | ||
5e712541 | 2470 | /* Weakrefs may be associated to external decls and thus not output |
9d75589a | 2471 | at expansion time. Emit all necessary aliases. */ |
5e712541 | 2472 | |
35ee1c66 | 2473 | void |
2474 | symbol_table::output_weakrefs (void) | |
5e712541 | 2475 | { |
452659af | 2476 | symtab_node *node; |
058a1b7a | 2477 | cgraph_node *cnode; |
48669653 | 2478 | FOR_EACH_SYMBOL (node) |
02774f2d | 2479 | if (node->alias |
2480 | && !TREE_ASM_WRITTEN (node->decl) | |
058a1b7a | 2481 | && (!(cnode = dyn_cast <cgraph_node *> (node)) |
2482 | || !cnode->instrumented_version | |
2483 | || !TREE_ASM_WRITTEN (cnode->instrumented_version->decl)) | |
02774f2d | 2484 | && node->weakref) |
48669653 | 2485 | { |
2486 | tree target; | |
2487 | ||
2488 | /* Weakrefs are special by not requiring target definition in current | |
2489 | compilation unit. It is thus bit hard to work out what we want to | |
2490 | alias. | |
2491 | When alias target is defined, we need to fetch it from symtab reference, | |
2492 | otherwise it is pointed to by alias_target. */ | |
02774f2d | 2493 | if (node->alias_target) |
2494 | target = (DECL_P (node->alias_target) | |
2495 | ? DECL_ASSEMBLER_NAME (node->alias_target) | |
2496 | : node->alias_target); | |
2497 | else if (node->analyzed) | |
415d1b9a | 2498 | target = DECL_ASSEMBLER_NAME (node->get_alias_target ()->decl); |
48669653 | 2499 | else |
2500 | { | |
2501 | gcc_unreachable (); | |
02774f2d | 2502 | target = get_alias_symbol (node->decl); |
48669653 | 2503 | } |
02774f2d | 2504 | do_assemble_alias (node->decl, target); |
48669653 | 2505 | } |
5e712541 | 2506 | } |
2507 | ||
d2bb3f9d | 2508 | /* Perform simple optimizations based on callgraph. */ |
2509 | ||
2510 | void | |
35ee1c66 | 2511 | symbol_table::compile (void) |
d2bb3f9d | 2512 | { |
2513 | if (seen_error ()) | |
2514 | return; | |
2515 | ||
382ecba7 | 2516 | symtab_node::checking_verify_symtab_nodes (); |
d2bb3f9d | 2517 | |
d2bb3f9d | 2518 | timevar_push (TV_CGRAPHOPT); |
2519 | if (pre_ipa_mem_report) | |
2520 | { | |
2521 | fprintf (stderr, "Memory consumption before IPA\n"); | |
2522 | dump_memory_report (false); | |
2523 | } | |
2524 | if (!quiet_flag) | |
2525 | fprintf (stderr, "Performing interprocedural optimizations\n"); | |
35ee1c66 | 2526 | state = IPA; |
d2bb3f9d | 2527 | |
cf951b1a | 2528 | /* If LTO is enabled, initialize the streamer hooks needed by GIMPLE. */ |
9f28dc4c | 2529 | if (flag_generate_lto || flag_generate_offload) |
cf951b1a | 2530 | lto_streamer_hooks_init (); |
2531 | ||
d2bb3f9d | 2532 | /* Don't run the IPA passes if there was any error or sorry messages. */ |
2533 | if (!seen_error ()) | |
2534 | ipa_passes (); | |
2535 | ||
2536 | /* Do nothing else if any IPA pass found errors or if we are just streaming LTO. */ | |
2537 | if (seen_error () | |
2538 | || (!in_lto_p && flag_lto && !flag_fat_lto_objects)) | |
2539 | { | |
2540 | timevar_pop (TV_CGRAPHOPT); | |
2541 | return; | |
2542 | } | |
2543 | ||
35ee1c66 | 2544 | global_info_ready = true; |
2545 | if (dump_file) | |
d2bb3f9d | 2546 | { |
35ee1c66 | 2547 | fprintf (dump_file, "Optimized "); |
acd183e4 | 2548 | symtab->dump (dump_file); |
d2bb3f9d | 2549 | } |
2550 | if (post_ipa_mem_report) | |
2551 | { | |
2552 | fprintf (stderr, "Memory consumption after IPA\n"); | |
2553 | dump_memory_report (false); | |
2554 | } | |
2555 | timevar_pop (TV_CGRAPHOPT); | |
2556 | ||
2557 | /* Output everything. */ | |
2558 | (*debug_hooks->assembly_start) (); | |
2559 | if (!quiet_flag) | |
2560 | fprintf (stderr, "Assembling functions:\n"); | |
382ecba7 | 2561 | symtab_node::checking_verify_symtab_nodes (); |
d2bb3f9d | 2562 | |
d2bb3f9d | 2563 | bitmap_obstack_initialize (NULL); |
3ea50c01 | 2564 | execute_ipa_pass_list (g->get_passes ()->all_late_ipa_passes); |
d2bb3f9d | 2565 | bitmap_obstack_release (NULL); |
cf951b1a | 2566 | mark_functions_to_output (); |
d2bb3f9d | 2567 | |
2fbe7a32 | 2568 | /* When weakref support is missing, we automatically translate all |
4cd8ae4b | 2569 | references to NODE to references to its ultimate alias target. |
2570 | The renaming mechanizm uses flag IDENTIFIER_TRANSPARENT_ALIAS and | |
2571 | TREE_CHAIN. | |
2572 | ||
2573 | Set up this mapping before we output any assembler but once we are sure | |
2574 | that all symbol renaming is done. | |
2575 | ||
2576 | FIXME: All this uglyness can go away if we just do renaming at gimple | |
2577 | level by physically rewritting the IL. At the moment we can only redirect | |
2578 | calls, so we need infrastructure for renaming references as well. */ | |
2579 | #ifndef ASM_OUTPUT_WEAKREF | |
452659af | 2580 | symtab_node *node; |
4cd8ae4b | 2581 | |
2582 | FOR_EACH_SYMBOL (node) | |
02774f2d | 2583 | if (node->alias |
2584 | && lookup_attribute ("weakref", DECL_ATTRIBUTES (node->decl))) | |
4cd8ae4b | 2585 | { |
2586 | IDENTIFIER_TRANSPARENT_ALIAS | |
02774f2d | 2587 | (DECL_ASSEMBLER_NAME (node->decl)) = 1; |
2588 | TREE_CHAIN (DECL_ASSEMBLER_NAME (node->decl)) | |
2589 | = (node->alias_target ? node->alias_target | |
448d76c7 | 2590 | : DECL_ASSEMBLER_NAME (node->get_alias_target ()->decl)); |
4cd8ae4b | 2591 | } |
2592 | #endif | |
2593 | ||
35ee1c66 | 2594 | state = EXPANSION; |
af48f0b1 | 2595 | |
d508ad6f | 2596 | /* Output first asm statements and anything ordered. The process |
2597 | flag is cleared for these nodes, so we skip them later. */ | |
2598 | output_in_order (); | |
2599 | expand_all_functions (); | |
2600 | output_variables (); | |
d2bb3f9d | 2601 | |
35ee1c66 | 2602 | process_new_functions (); |
2603 | state = FINISHED; | |
afea39ad | 2604 | output_weakrefs (); |
d2bb3f9d | 2605 | |
35ee1c66 | 2606 | if (dump_file) |
d2bb3f9d | 2607 | { |
35ee1c66 | 2608 | fprintf (dump_file, "\nFinal "); |
acd183e4 | 2609 | symtab->dump (dump_file); |
d2bb3f9d | 2610 | } |
382ecba7 | 2611 | if (!flag_checking) |
2612 | return; | |
415d1b9a | 2613 | symtab_node::verify_symtab_nodes (); |
d2bb3f9d | 2614 | /* Double check that all inline clones are gone and that all |
2615 | function bodies have been released from memory. */ | |
2616 | if (!seen_error ()) | |
2617 | { | |
35ee1c66 | 2618 | cgraph_node *node; |
d2bb3f9d | 2619 | bool error_found = false; |
2620 | ||
7c455d87 | 2621 | FOR_EACH_DEFINED_FUNCTION (node) |
2622 | if (node->global.inlined_to | |
02774f2d | 2623 | || gimple_has_body_p (node->decl)) |
d2bb3f9d | 2624 | { |
2625 | error_found = true; | |
415d1b9a | 2626 | node->debug (); |
d2bb3f9d | 2627 | } |
2628 | if (error_found) | |
2629 | internal_error ("nodes with unreleased memory found"); | |
2630 | } | |
d2bb3f9d | 2631 | } |
2632 | ||
2633 | ||
2634 | /* Analyze the whole compilation unit once it is parsed completely. */ | |
2635 | ||
2636 | void | |
35ee1c66 | 2637 | symbol_table::finalize_compilation_unit (void) |
d2bb3f9d | 2638 | { |
2639 | timevar_push (TV_CGRAPH); | |
2640 | ||
d2bb3f9d | 2641 | /* If we're here there's no current function anymore. Some frontends |
2642 | are lazy in clearing these. */ | |
2643 | current_function_decl = NULL; | |
2644 | set_cfun (NULL); | |
2645 | ||
2646 | /* Do not skip analyzing the functions if there were errors, we | |
2647 | miss diagnostics for following functions otherwise. */ | |
2648 | ||
2649 | /* Emit size functions we didn't inline. */ | |
2650 | finalize_size_functions (); | |
2651 | ||
2652 | /* Mark alias targets necessary and emit diagnostics. */ | |
d2bb3f9d | 2653 | handle_alias_pairs (); |
2654 | ||
2655 | if (!quiet_flag) | |
2656 | { | |
2657 | fprintf (stderr, "\nAnalyzing compilation unit\n"); | |
2658 | fflush (stderr); | |
2659 | } | |
2660 | ||
2661 | if (flag_dump_passes) | |
2662 | dump_passes (); | |
2663 | ||
2664 | /* Gimplify and lower all functions, compute reachability and | |
2665 | remove unreachable nodes. */ | |
3a1c9df2 | 2666 | analyze_functions (/*first_time=*/true); |
d2bb3f9d | 2667 | |
2668 | /* Mark alias targets necessary and emit diagnostics. */ | |
d2bb3f9d | 2669 | handle_alias_pairs (); |
2670 | ||
2671 | /* Gimplify and lower thunks. */ | |
3a1c9df2 | 2672 | analyze_functions (/*first_time=*/false); |
2673 | ||
be72c866 | 2674 | /* Offloading requires LTO infrastructure. */ |
2675 | if (!in_lto_p && g->have_offload) | |
2676 | flag_generate_offload = 1; | |
2677 | ||
68f04316 | 2678 | if (!seen_error ()) |
2679 | { | |
2680 | /* Emit early debug for reachable functions, and by consequence, | |
2681 | locally scoped symbols. */ | |
2682 | struct cgraph_node *cnode; | |
2683 | FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (cnode) | |
2684 | (*debug_hooks->early_global_decl) (cnode->decl); | |
2685 | ||
2686 | /* Clean up anything that needs cleaning up after initial debug | |
2687 | generation. */ | |
6a4203b6 | 2688 | (*debug_hooks->early_finish) (main_input_filename); |
68f04316 | 2689 | } |
2690 | ||
d2bb3f9d | 2691 | /* Finally drive the pass manager. */ |
cf951b1a | 2692 | compile (); |
d2bb3f9d | 2693 | |
2694 | timevar_pop (TV_CGRAPH); | |
2695 | } | |
2696 | ||
415309e2 | 2697 | /* Reset all state within cgraphunit.c so that we can rerun the compiler |
2698 | within the same process. For use by toplev::finalize. */ | |
2699 | ||
2700 | void | |
2701 | cgraphunit_c_finalize (void) | |
2702 | { | |
2703 | gcc_assert (cgraph_new_nodes.length () == 0); | |
2704 | cgraph_new_nodes.truncate (0); | |
2705 | ||
2706 | vtable_entry_type = NULL; | |
2707 | queued_nodes = &symtab_terminator; | |
2708 | ||
2709 | first_analyzed = NULL; | |
2710 | first_analyzed_var = NULL; | |
2711 | } | |
2712 | ||
415d1b9a | 2713 | /* Creates a wrapper from cgraph_node to TARGET node. Thunk is used for this |
cb8994e9 | 2714 | kind of wrapper method. */ |
2715 | ||
2716 | void | |
35ee1c66 | 2717 | cgraph_node::create_wrapper (cgraph_node *target) |
cb8994e9 | 2718 | { |
275e2756 | 2719 | /* Preserve DECL_RESULT so we get right by reference flag. */ |
2720 | tree decl_result = DECL_RESULT (decl); | |
cb8994e9 | 2721 | |
275e2756 | 2722 | /* Remove the function's body but keep arguments to be reused |
2723 | for thunk. */ | |
2724 | release_body (true); | |
2725 | reset (); | |
cb8994e9 | 2726 | |
ce7711df | 2727 | DECL_UNINLINABLE (decl) = false; |
275e2756 | 2728 | DECL_RESULT (decl) = decl_result; |
2729 | DECL_INITIAL (decl) = NULL; | |
2730 | allocate_struct_function (decl, false); | |
2731 | set_cfun (NULL); | |
cb8994e9 | 2732 | |
275e2756 | 2733 | /* Turn alias into thunk and expand it into GIMPLE representation. */ |
2734 | definition = true; | |
50671005 | 2735 | |
2736 | memset (&thunk, 0, sizeof (cgraph_thunk_info)); | |
275e2756 | 2737 | thunk.thunk_p = true; |
3a9f48e7 | 2738 | create_edge (target, NULL, count, CGRAPH_FREQ_BASE); |
519627d3 | 2739 | callees->can_throw_external = !TREE_NOTHROW (target->decl); |
cb8994e9 | 2740 | |
275e2756 | 2741 | tree arguments = DECL_ARGUMENTS (decl); |
f9516d28 | 2742 | |
275e2756 | 2743 | while (arguments) |
2744 | { | |
2745 | TREE_ADDRESSABLE (arguments) = false; | |
2746 | arguments = TREE_CHAIN (arguments); | |
2747 | } | |
f9516d28 | 2748 | |
275e2756 | 2749 | expand_thunk (false, true); |
cb8994e9 | 2750 | |
275e2756 | 2751 | /* Inline summary set-up. */ |
2752 | analyze (); | |
2753 | inline_analyze_function (this); | |
cb8994e9 | 2754 | } |
d2bb3f9d | 2755 | |
a861fe52 | 2756 | #include "gt-cgraphunit.h" |