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