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