]>
Commit | Line | Data |
---|---|---|
65c1a668 | 1 | /* Basic IPA optimizations and utilities. |
d353bf18 | 2 | Copyright (C) 2003-2015 Free Software Foundation, Inc. |
65c1a668 | 3 | |
4 | This file is part of GCC. | |
5 | ||
6 | GCC is free software; you can redistribute it and/or modify it under | |
7 | the terms of the GNU General Public License as published by the Free | |
8c4c00c1 | 8 | Software Foundation; either version 3, or (at your option) any later |
65c1a668 | 9 | version. |
10 | ||
11 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
65c1a668 | 19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
9ef16211 | 23 | #include "backend.h" |
24 | #include "tree.h" | |
25 | #include "gimple.h" | |
26 | #include "hard-reg-set.h" | |
b20a8bb4 | 27 | #include "alias.h" |
b20a8bb4 | 28 | #include "options.h" |
b20a8bb4 | 29 | #include "fold-const.h" |
9ed99284 | 30 | #include "calls.h" |
31 | #include "stringpool.h" | |
1140c305 | 32 | #include "cgraph.h" |
33 | #include "tree-pass.h" | |
a8783bee | 34 | #include "gimplify.h" |
8dfbf71d | 35 | #include "flags.h" |
a53e7471 | 36 | #include "target.h" |
37 | #include "tree-iterator.h" | |
7771d558 | 38 | #include "ipa-utils.h" |
1140c305 | 39 | #include "alloc-pool.h" |
2cc80ac3 | 40 | #include "symbol-summary.h" |
1140c305 | 41 | #include "ipa-prop.h" |
91f0ab48 | 42 | #include "ipa-inline.h" |
9e179a64 | 43 | #include "tree-inline.h" |
44 | #include "profile.h" | |
45 | #include "params.h" | |
ceb49bba | 46 | #include "internal-fn.h" |
ceb49bba | 47 | #include "dbgcnt.h" |
65c1a668 | 48 | |
15ca8f90 | 49 | |
50 | /* Return true when NODE has ADDR reference. */ | |
51 | ||
52 | static bool | |
53 | has_addr_references_p (struct cgraph_node *node, | |
54 | void *data ATTRIBUTE_UNUSED) | |
55 | { | |
56 | int i; | |
51ce5652 | 57 | struct ipa_ref *ref = NULL; |
15ca8f90 | 58 | |
51ce5652 | 59 | for (i = 0; node->iterate_referring (i, ref); i++) |
15ca8f90 | 60 | if (ref->use == IPA_REF_ADDR) |
61 | return true; | |
62 | return false; | |
63 | } | |
64 | ||
21f41380 | 65 | /* Look for all functions inlined to NODE and update their inlined_to pointers |
66 | to INLINED_TO. */ | |
67 | ||
68 | static void | |
69 | update_inlined_to_pointer (struct cgraph_node *node, struct cgraph_node *inlined_to) | |
70 | { | |
71 | struct cgraph_edge *e; | |
72 | for (e = node->callees; e; e = e->next_callee) | |
73 | if (e->callee->global.inlined_to) | |
74 | { | |
75 | e->callee->global.inlined_to = inlined_to; | |
76 | update_inlined_to_pointer (e->callee, inlined_to); | |
77 | } | |
78 | } | |
79 | ||
91f0ab48 | 80 | /* Add symtab NODE to queue starting at FIRST. |
9da87cb8 | 81 | |
82 | The queue is linked via AUX pointers and terminated by pointer to 1. | |
83 | We enqueue nodes at two occasions: when we find them reachable or when we find | |
84 | their bodies needed for further clonning. In the second case we mark them | |
85 | by pointer to 2 after processing so they are re-queue when they become | |
86 | reachable. */ | |
6f932b06 | 87 | |
88 | static void | |
452659af | 89 | enqueue_node (symtab_node *node, symtab_node **first, |
431205b7 | 90 | hash_set<symtab_node *> *reachable) |
6f932b06 | 91 | { |
9da87cb8 | 92 | /* Node is still in queue; do nothing. */ |
02774f2d | 93 | if (node->aux && node->aux != (void *) 2) |
9da87cb8 | 94 | return; |
95 | /* Node was already processed as unreachable, re-enqueue | |
96 | only if it became reachable now. */ | |
431205b7 | 97 | if (node->aux == (void *)2 && !reachable->contains (node)) |
9da87cb8 | 98 | return; |
02774f2d | 99 | node->aux = *first; |
6f932b06 | 100 | *first = node; |
101 | } | |
102 | ||
6f932b06 | 103 | /* Process references. */ |
104 | ||
105 | static void | |
51ce5652 | 106 | process_references (symtab_node *snode, |
452659af | 107 | symtab_node **first, |
da751785 | 108 | bool before_inlining_p, |
431205b7 | 109 | hash_set<symtab_node *> *reachable) |
6f932b06 | 110 | { |
111 | int i; | |
51ce5652 | 112 | struct ipa_ref *ref = NULL; |
113 | for (i = 0; snode->iterate_reference (i, ref); i++) | |
6f932b06 | 114 | { |
452659af | 115 | symtab_node *node = ref->referred; |
366970c6 | 116 | symtab_node *body = node->ultimate_alias_target (); |
15ca8f90 | 117 | |
02774f2d | 118 | if (node->definition && !node->in_other_partition |
119 | && ((!DECL_EXTERNAL (node->decl) || node->alias) | |
f0d26d57 | 120 | || (((before_inlining_p |
3790d364 | 121 | && ((TREE_CODE (node->decl) != FUNCTION_DECL |
122 | && optimize) | |
123 | || (TREE_CODE (node->decl) == FUNCTION_DECL | |
124 | && opt_for_fn (body->decl, optimize)) | |
366970c6 | 125 | || (symtab->state < IPA_SSA |
126 | && lookup_attribute | |
127 | ("always_inline", | |
128 | DECL_ATTRIBUTES (body->decl)))))) | |
129 | /* We use variable constructors during late compilation for | |
15ca8f90 | 130 | constant folding. Keep references alive so partitioning |
131 | knows about potential references. */ | |
02774f2d | 132 | || (TREE_CODE (node->decl) == VAR_DECL |
df8d3e89 | 133 | && flag_wpa |
02774f2d | 134 | && ctor_for_folding (node->decl) |
df8d3e89 | 135 | != error_mark_node)))) |
366970c6 | 136 | { |
137 | /* Be sure that we will not optimize out alias target | |
138 | body. */ | |
139 | if (DECL_EXTERNAL (node->decl) | |
140 | && node->alias | |
141 | && before_inlining_p) | |
142 | reachable->add (body); | |
143 | reachable->add (node); | |
144 | } | |
02774f2d | 145 | enqueue_node (node, first, reachable); |
6f932b06 | 146 | } |
147 | } | |
148 | ||
e2fa5d74 | 149 | /* EDGE is an polymorphic call. If BEFORE_INLINING_P is set, mark |
150 | all its potential targets as reachable to permit later inlining if | |
151 | devirtualization happens. After inlining still keep their declarations | |
152 | around, so we can devirtualize to a direct call. | |
153 | ||
154 | Also try to make trivial devirutalization when no or only one target is | |
155 | possible. */ | |
156 | ||
157 | static void | |
431205b7 | 158 | walk_polymorphic_call_targets (hash_set<void *> *reachable_call_targets, |
e2fa5d74 | 159 | struct cgraph_edge *edge, |
452659af | 160 | symtab_node **first, |
431205b7 | 161 | hash_set<symtab_node *> *reachable, |
162 | bool before_inlining_p) | |
e2fa5d74 | 163 | { |
164 | unsigned int i; | |
165 | void *cache_token; | |
166 | bool final; | |
167 | vec <cgraph_node *>targets | |
168 | = possible_polymorphic_call_targets | |
169 | (edge, &final, &cache_token); | |
170 | ||
431205b7 | 171 | if (!reachable_call_targets->add (cache_token)) |
e2fa5d74 | 172 | { |
9af5ce0c | 173 | for (i = 0; i < targets.length (); i++) |
e2fa5d74 | 174 | { |
175 | struct cgraph_node *n = targets[i]; | |
176 | ||
177 | /* Do not bother to mark virtual methods in anonymous namespace; | |
178 | either we will find use of virtual table defining it, or it is | |
179 | unused. */ | |
02774f2d | 180 | if (TREE_CODE (TREE_TYPE (n->decl)) == METHOD_TYPE |
e2fa5d74 | 181 | && type_in_anonymous_namespace_p |
1fda15e2 | 182 | (TYPE_METHOD_BASETYPE (TREE_TYPE (n->decl)))) |
e2fa5d74 | 183 | continue; |
184 | ||
366970c6 | 185 | symtab_node *body = n->function_symbol (); |
186 | ||
e2fa5d74 | 187 | /* Prior inlining, keep alive bodies of possible targets for |
188 | devirtualization. */ | |
02774f2d | 189 | if (n->definition |
f0d26d57 | 190 | && (before_inlining_p |
366970c6 | 191 | && opt_for_fn (body->decl, optimize) |
192 | && opt_for_fn (body->decl, flag_devirtualize))) | |
193 | { | |
194 | /* Be sure that we will not optimize out alias target | |
195 | body. */ | |
196 | if (DECL_EXTERNAL (n->decl) | |
197 | && n->alias | |
198 | && before_inlining_p) | |
199 | reachable->add (body); | |
200 | reachable->add (n); | |
201 | } | |
e2fa5d74 | 202 | /* Even after inlining we want to keep the possible targets in the |
203 | boundary, so late passes can still produce direct call even if | |
204 | the chance for inlining is lost. */ | |
02774f2d | 205 | enqueue_node (n, first, reachable); |
e2fa5d74 | 206 | } |
207 | } | |
208 | ||
209 | /* Very trivial devirtualization; when the type is | |
210 | final or anonymous (so we know all its derivation) | |
211 | and there is only one possible virtual call target, | |
212 | make the edge direct. */ | |
213 | if (final) | |
214 | { | |
ceb49bba | 215 | if (targets.length () <= 1 && dbg_cnt (devirt)) |
e2fa5d74 | 216 | { |
749c5b03 | 217 | cgraph_node *target, *node = edge->caller; |
e2fa5d74 | 218 | if (targets.length () == 1) |
219 | target = targets[0]; | |
220 | else | |
415d1b9a | 221 | target = cgraph_node::get_create |
e2fa5d74 | 222 | (builtin_decl_implicit (BUILT_IN_UNREACHABLE)); |
223 | ||
ceb49bba | 224 | if (dump_enabled_p ()) |
225 | { | |
28787ac0 | 226 | location_t locus; |
227 | if (edge->call_stmt) | |
228 | locus = gimple_location (edge->call_stmt); | |
229 | else | |
230 | locus = UNKNOWN_LOCATION; | |
415d1b9a | 231 | dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, locus, |
ceb49bba | 232 | "devirtualizing call in %s/%i to %s/%i\n", |
233 | edge->caller->name (), edge->caller->order, | |
234 | target->name (), | |
235 | target->order); | |
236 | } | |
35ee1c66 | 237 | edge = edge->make_direct (target); |
b4bae7a0 | 238 | if (inline_summaries) |
749c5b03 | 239 | inline_update_overall_summary (node); |
6469adde | 240 | else if (edge->call_stmt) |
058a1b7a | 241 | { |
242 | edge->redirect_call_stmt_to_callee (); | |
243 | ||
244 | /* Call to __builtin_unreachable shouldn't be instrumented. */ | |
245 | if (!targets.length ()) | |
246 | gimple_call_set_with_bounds (edge->call_stmt, false); | |
247 | } | |
e2fa5d74 | 248 | } |
249 | } | |
250 | } | |
36a32361 | 251 | |
65c1a668 | 252 | /* Perform reachability analysis and reclaim all unreachable nodes. |
91f0ab48 | 253 | |
254 | The algorithm is basically mark&sweep but with some extra refinements: | |
255 | ||
256 | - reachable extern inline functions needs special handling; the bodies needs | |
257 | to stay in memory until inlining in hope that they will be inlined. | |
258 | After inlining we release their bodies and turn them into unanalyzed | |
259 | nodes even when they are reachable. | |
260 | ||
91f0ab48 | 261 | - virtual functions are kept in callgraph even if they seem unreachable in |
262 | hope calls to them will be devirtualized. | |
263 | ||
264 | Again we remove them after inlining. In late optimization some | |
6bcfabf2 | 265 | devirtualization may happen, but it is not important since we won't inline |
91f0ab48 | 266 | the call. In theory early opts and IPA should work out all important cases. |
267 | ||
268 | - virtual clones needs bodies of their origins for later materialization; | |
269 | this means that we want to keep the body even if the origin is unreachable | |
270 | otherwise. To avoid origin from sitting in the callgraph and being | |
271 | walked by IPA passes, we turn them into unanalyzed nodes with body | |
272 | defined. | |
273 | ||
274 | We maintain set of function declaration where body needs to stay in | |
275 | body_needed_for_clonning | |
276 | ||
277 | Inline clones represent special case: their declaration match the | |
278 | declaration of origin and cgraph_remove_node already knows how to | |
279 | reshape callgraph and preserve body when offline copy of function or | |
280 | inline clone is being removed. | |
281 | ||
aa419a52 | 282 | - C++ virtual tables keyed to other unit are represented as DECL_EXTERNAL |
283 | variables with DECL_INITIAL set. We finalize these and keep reachable | |
284 | ones around for constant folding purposes. After inlining we however | |
285 | stop walking their references to let everything static referneced by them | |
286 | to be removed when it is otherwise unreachable. | |
287 | ||
91f0ab48 | 288 | We maintain queue of both reachable symbols (i.e. defined symbols that needs |
289 | to stay) and symbols that are in boundary (i.e. external symbols referenced | |
290 | by reachable symbols or origins of clones). The queue is represented | |
291 | as linked list by AUX pointer terminated by 1. | |
292 | ||
6bcfabf2 | 293 | At the end we keep all reachable symbols. For symbols in boundary we always |
91f0ab48 | 294 | turn definition into a declaration, but we may keep function body around |
295 | based on body_needed_for_clonning | |
296 | ||
297 | All symbols that enter the queue have AUX pointer non-zero and are in the | |
298 | boundary. Pointer set REACHABLE is used to track reachable symbols. | |
299 | ||
300 | Every symbol can be visited twice - once as part of boundary and once | |
301 | as real reachable symbol. enqueue_node needs to decide whether the | |
302 | node needs to be re-queued for second processing. For this purpose | |
303 | we set AUX pointer of processed symbols in the boundary to constant 2. */ | |
65c1a668 | 304 | |
305 | bool | |
366970c6 | 306 | symbol_table::remove_unreachable_nodes (FILE *file) |
65c1a668 | 307 | { |
452659af | 308 | symtab_node *first = (symtab_node *) (void *) 1; |
f4ec5ce1 | 309 | struct cgraph_node *node, *next; |
098f44bc | 310 | varpool_node *vnode, *vnext; |
65c1a668 | 311 | bool changed = false; |
431205b7 | 312 | hash_set<symtab_node *> reachable; |
313 | hash_set<tree> body_needed_for_clonning; | |
314 | hash_set<void *> reachable_call_targets; | |
366970c6 | 315 | bool before_inlining_p = symtab->state < (!optimize ? IPA_SSA |
316 | : IPA_SSA_AFTER_INLINING); | |
65c1a668 | 317 | |
e2fa5d74 | 318 | timevar_push (TV_IPA_UNREACHABLE); |
d1f68cd8 | 319 | build_type_inheritance_graph (); |
3f5be5f4 | 320 | if (file) |
321 | fprintf (file, "\nReclaiming functions:"); | |
65c1a668 | 322 | #ifdef ENABLE_CHECKING |
7c455d87 | 323 | FOR_EACH_FUNCTION (node) |
02774f2d | 324 | gcc_assert (!node->aux); |
7c455d87 | 325 | FOR_EACH_VARIABLE (vnode) |
02774f2d | 326 | gcc_assert (!vnode->aux); |
65c1a668 | 327 | #endif |
7f74ac6b | 328 | /* Mark functions whose bodies are obviously needed. |
329 | This is mostly when they can be referenced externally. Inline clones | |
330 | are special since their declarations are shared with master clone and thus | |
331 | cgraph_can_remove_if_no_direct_calls_and_refs_p should not be called on them. */ | |
abb1a237 | 332 | FOR_EACH_FUNCTION (node) |
333 | { | |
334 | node->used_as_abstract_origin = false; | |
02774f2d | 335 | if (node->definition |
abb1a237 | 336 | && !node->global.inlined_to |
02774f2d | 337 | && !node->in_other_partition |
415d1b9a | 338 | && !node->can_remove_if_no_direct_calls_and_refs_p ()) |
abb1a237 | 339 | { |
340 | gcc_assert (!node->global.inlined_to); | |
431205b7 | 341 | reachable.add (node); |
342 | enqueue_node (node, &first, &reachable); | |
abb1a237 | 343 | } |
344 | else | |
02774f2d | 345 | gcc_assert (!node->aux); |
abb1a237 | 346 | } |
7f74ac6b | 347 | |
348 | /* Mark variables that are obviously needed. */ | |
91f0ab48 | 349 | FOR_EACH_DEFINED_VARIABLE (vnode) |
97221fd7 | 350 | if (!vnode->can_remove_if_no_refs_p() |
02774f2d | 351 | && !vnode->in_other_partition) |
91f0ab48 | 352 | { |
431205b7 | 353 | reachable.add (vnode); |
354 | enqueue_node (vnode, &first, &reachable); | |
91f0ab48 | 355 | } |
356 | ||
357 | /* Perform reachability analysis. */ | |
452659af | 358 | while (first != (symtab_node *) (void *) 1) |
6f932b06 | 359 | { |
431205b7 | 360 | bool in_boundary_p = !reachable.contains (first); |
452659af | 361 | symtab_node *node = first; |
65c1a668 | 362 | |
452659af | 363 | first = (symtab_node *)first->aux; |
9da87cb8 | 364 | |
91f0ab48 | 365 | /* If we are processing symbol in boundary, mark its AUX pointer for |
366 | possible later re-processing in enqueue_node. */ | |
367 | if (in_boundary_p) | |
c5e076fc | 368 | { |
369 | node->aux = (void *)2; | |
370 | if (node->alias && node->analyzed) | |
371 | enqueue_node (node->get_alias_target (), &first, &reachable); | |
372 | } | |
91f0ab48 | 373 | else |
374 | { | |
9f0b7378 | 375 | if (TREE_CODE (node->decl) == FUNCTION_DECL |
376 | && DECL_ABSTRACT_ORIGIN (node->decl)) | |
abb1a237 | 377 | { |
378 | struct cgraph_node *origin_node | |
ca92a251 | 379 | = cgraph_node::get (DECL_ABSTRACT_ORIGIN (node->decl)); |
380 | if (origin_node && !origin_node->used_as_abstract_origin) | |
381 | { | |
382 | origin_node->used_as_abstract_origin = true; | |
383 | gcc_assert (!origin_node->prev_sibling_clone); | |
384 | gcc_assert (!origin_node->next_sibling_clone); | |
385 | for (cgraph_node *n = origin_node->clones; n; | |
386 | n = n->next_sibling_clone) | |
387 | if (n->decl == DECL_ABSTRACT_ORIGIN (node->decl)) | |
388 | n->used_as_abstract_origin = true; | |
ca92a251 | 389 | } |
abb1a237 | 390 | } |
91f0ab48 | 391 | /* If any symbol in a comdat group is reachable, force |
468088ac | 392 | all externally visible symbols in the same comdat |
393 | group to be reachable as well. Comdat-local symbols | |
394 | can be discarded if all uses were inlined. */ | |
02774f2d | 395 | if (node->same_comdat_group) |
91f0ab48 | 396 | { |
452659af | 397 | symtab_node *next; |
02774f2d | 398 | for (next = node->same_comdat_group; |
91f0ab48 | 399 | next != node; |
02774f2d | 400 | next = next->same_comdat_group) |
415d1b9a | 401 | if (!next->comdat_local_p () |
431205b7 | 402 | && !reachable.add (next)) |
403 | enqueue_node (next, &first, &reachable); | |
91f0ab48 | 404 | } |
405 | /* Mark references as reachable. */ | |
431205b7 | 406 | process_references (node, &first, before_inlining_p, &reachable); |
91f0ab48 | 407 | } |
9da87cb8 | 408 | |
13cbeaac | 409 | if (cgraph_node *cnode = dyn_cast <cgraph_node *> (node)) |
6f932b06 | 410 | { |
91f0ab48 | 411 | /* Mark the callees reachable unless they are direct calls to extern |
412 | inline functions we decided to not inline. */ | |
413 | if (!in_boundary_p) | |
e12f85b7 | 414 | { |
91f0ab48 | 415 | struct cgraph_edge *e; |
e2fa5d74 | 416 | /* Keep alive possible targets for devirtualization. */ |
d1f68cd8 | 417 | if (opt_for_fn (cnode->decl, optimize) |
418 | && opt_for_fn (cnode->decl, flag_devirtualize)) | |
e2fa5d74 | 419 | { |
420 | struct cgraph_edge *next; | |
421 | for (e = cnode->indirect_calls; e; e = next) | |
422 | { | |
423 | next = e->next_callee; | |
424 | if (e->indirect_info->polymorphic) | |
431205b7 | 425 | walk_polymorphic_call_targets (&reachable_call_targets, |
426 | e, &first, &reachable, | |
e2fa5d74 | 427 | before_inlining_p); |
428 | } | |
429 | } | |
91f0ab48 | 430 | for (e = cnode->callees; e; e = e->next_callee) |
71ca01ff | 431 | { |
366970c6 | 432 | symtab_node *body = e->callee->function_symbol (); |
02774f2d | 433 | if (e->callee->definition |
434 | && !e->callee->in_other_partition | |
71ca01ff | 435 | && (!e->inline_failed |
02774f2d | 436 | || !DECL_EXTERNAL (e->callee->decl) |
437 | || e->callee->alias | |
366970c6 | 438 | || (before_inlining_p |
439 | && (opt_for_fn (body->decl, optimize) | |
440 | || (symtab->state < IPA_SSA | |
441 | && lookup_attribute | |
442 | ("always_inline", | |
443 | DECL_ATTRIBUTES (body->decl))))))) | |
89ae81e0 | 444 | { |
445 | /* Be sure that we will not optimize out alias target | |
446 | body. */ | |
447 | if (DECL_EXTERNAL (e->callee->decl) | |
448 | && e->callee->alias | |
449 | && before_inlining_p) | |
366970c6 | 450 | reachable.add (body); |
431205b7 | 451 | reachable.add (e->callee); |
89ae81e0 | 452 | } |
431205b7 | 453 | enqueue_node (e->callee, &first, &reachable); |
da751785 | 454 | } |
91f0ab48 | 455 | |
456 | /* When inline clone exists, mark body to be preserved so when removing | |
457 | offline copy of the function we don't kill it. */ | |
b9b49047 | 458 | if (cnode->global.inlined_to) |
431205b7 | 459 | body_needed_for_clonning.add (cnode->decl); |
61c2c7b1 | 460 | |
7f0dce59 | 461 | /* For instrumentation clones we always need original |
462 | function node for proper LTO privatization. */ | |
463 | if (cnode->instrumentation_clone | |
464 | && cnode->definition) | |
465 | { | |
466 | gcc_assert (cnode->instrumented_version || in_lto_p); | |
467 | if (cnode->instrumented_version) | |
468 | { | |
469 | enqueue_node (cnode->instrumented_version, &first, | |
470 | &reachable); | |
471 | reachable.add (cnode->instrumented_version); | |
472 | } | |
473 | } | |
474 | ||
b9b49047 | 475 | /* For non-inline clones, force their origins to the boundary and ensure |
476 | that body is not removed. */ | |
477 | while (cnode->clone_of) | |
478 | { | |
02774f2d | 479 | bool noninline = cnode->clone_of->decl != cnode->decl; |
b9b49047 | 480 | cnode = cnode->clone_of; |
481 | if (noninline) | |
482 | { | |
431205b7 | 483 | body_needed_for_clonning.add (cnode->decl); |
484 | enqueue_node (cnode, &first, &reachable); | |
b9b49047 | 485 | } |
6f932b06 | 486 | } |
d09768a4 | 487 | |
488 | } | |
c5e076fc | 489 | else if (cnode->thunk.thunk_p) |
490 | enqueue_node (cnode->callees->callee, &first, &reachable); | |
7f0dce59 | 491 | |
d09768a4 | 492 | /* If any reachable function has simd clones, mark them as |
493 | reachable as well. */ | |
494 | if (cnode->simd_clones) | |
495 | { | |
496 | cgraph_node *next; | |
497 | for (next = cnode->simd_clones; | |
498 | next; | |
499 | next = next->simdclone->next_clone) | |
500 | if (in_boundary_p | |
431205b7 | 501 | || !reachable.add (next)) |
502 | enqueue_node (next, &first, &reachable); | |
ee3f5fc0 | 503 | } |
6f932b06 | 504 | } |
aa419a52 | 505 | /* When we see constructor of external variable, keep referred nodes in the |
2dc9831f | 506 | boundary. This will also hold initializers of the external vars NODE |
507 | refers to. */ | |
13cbeaac | 508 | varpool_node *vnode = dyn_cast <varpool_node *> (node); |
2dc9831f | 509 | if (vnode |
02774f2d | 510 | && DECL_EXTERNAL (node->decl) |
511 | && !vnode->alias | |
aa419a52 | 512 | && in_boundary_p) |
2dc9831f | 513 | { |
51ce5652 | 514 | struct ipa_ref *ref = NULL; |
515 | for (int i = 0; node->iterate_reference (i, ref); i++) | |
431205b7 | 516 | enqueue_node (ref->referred, &first, &reachable); |
2dc9831f | 517 | } |
65c1a668 | 518 | } |
519 | ||
91f0ab48 | 520 | /* Remove unreachable functions. */ |
35ee1c66 | 521 | for (node = first_function (); node; node = next) |
65c1a668 | 522 | { |
35ee1c66 | 523 | next = next_function (node); |
15ca8f90 | 524 | |
525 | /* If node is not needed at all, remove it. */ | |
02774f2d | 526 | if (!node->aux) |
65c1a668 | 527 | { |
3f5be5f4 | 528 | if (file) |
3083a0b3 | 529 | fprintf (file, " %s/%i", node->name (), node->order); |
415d1b9a | 530 | node->remove (); |
91f0ab48 | 531 | changed = true; |
532 | } | |
15ca8f90 | 533 | /* If node is unreachable, remove its body. */ |
431205b7 | 534 | else if (!reachable.contains (node)) |
91f0ab48 | 535 | { |
6cb8fb82 | 536 | /* We keep definitions of thunks and aliases in the boundary so |
537 | we can walk to the ultimate alias targets and function symbols | |
538 | reliably. */ | |
539 | if (node->alias || node->thunk.thunk_p) | |
540 | ; | |
541 | else if (!body_needed_for_clonning.contains (node->decl) | |
542 | && !node->alias && !node->thunk.thunk_p) | |
415d1b9a | 543 | node->release_body (); |
b9b49047 | 544 | else if (!node->clone_of) |
02774f2d | 545 | gcc_assert (in_lto_p || DECL_RESULT (node->decl)); |
c5e076fc | 546 | if (node->definition && !node->alias && !node->thunk.thunk_p) |
7fb046a4 | 547 | { |
91f0ab48 | 548 | if (file) |
3083a0b3 | 549 | fprintf (file, " %s/%i", node->name (), node->order); |
fa4052b3 | 550 | node->body_removed = true; |
02774f2d | 551 | node->analyzed = false; |
552 | node->definition = false; | |
553 | node->cpp_implicit_alias = false; | |
554 | node->alias = false; | |
95d0bdb9 | 555 | node->thunk.thunk_p = false; |
02774f2d | 556 | node->weakref = false; |
f0d26d57 | 557 | /* After early inlining we drop always_inline attributes on |
558 | bodies of functions that are still referenced (have their | |
559 | address taken). */ | |
560 | DECL_ATTRIBUTES (node->decl) | |
561 | = remove_attribute ("always_inline", | |
562 | DECL_ATTRIBUTES (node->decl)); | |
02774f2d | 563 | if (!node->in_other_partition) |
281dea26 | 564 | node->local.local = false; |
415d1b9a | 565 | node->remove_callees (); |
51ce5652 | 566 | node->remove_all_references (); |
7fb046a4 | 567 | changed = true; |
058a1b7a | 568 | if (node->thunk.thunk_p |
569 | && node->thunk.add_pointer_bounds_args) | |
570 | { | |
571 | node->thunk.thunk_p = false; | |
572 | node->thunk.add_pointer_bounds_args = false; | |
573 | } | |
7fb046a4 | 574 | } |
65c1a668 | 575 | } |
b9b49047 | 576 | else |
415d1b9a | 577 | gcc_assert (node->clone_of || !node->has_gimple_body_p () |
02774f2d | 578 | || in_lto_p || DECL_RESULT (node->decl)); |
65c1a668 | 579 | } |
91f0ab48 | 580 | |
581 | /* Inline clones might be kept around so their materializing allows further | |
582 | cloning. If the function the clone is inlined into is removed, we need | |
583 | to turn it into normal cone. */ | |
7c455d87 | 584 | FOR_EACH_FUNCTION (node) |
ccf4ab6b | 585 | { |
ccf4ab6b | 586 | if (node->global.inlined_to |
587 | && !node->callers) | |
588 | { | |
589 | gcc_assert (node->clones); | |
21f41380 | 590 | node->global.inlined_to = NULL; |
591 | update_inlined_to_pointer (node, node); | |
ccf4ab6b | 592 | } |
02774f2d | 593 | node->aux = NULL; |
ccf4ab6b | 594 | } |
8dfbf71d | 595 | |
91f0ab48 | 596 | /* Remove unreachable variables. */ |
8dfbf71d | 597 | if (file) |
91f0ab48 | 598 | fprintf (file, "\nReclaiming variables:"); |
35ee1c66 | 599 | for (vnode = first_variable (); vnode; vnode = vnext) |
6f932b06 | 600 | { |
35ee1c66 | 601 | vnext = next_variable (vnode); |
02774f2d | 602 | if (!vnode->aux |
f1a7feee | 603 | /* For can_refer_decl_in_current_unit_p we want to track for |
604 | all external variables if they are defined in other partition | |
605 | or not. */ | |
02774f2d | 606 | && (!flag_ltrans || !DECL_EXTERNAL (vnode->decl))) |
91f0ab48 | 607 | { |
e7610412 | 608 | struct ipa_ref *ref = NULL; |
609 | ||
610 | /* First remove the aliases, so varpool::remove can possibly lookup | |
611 | the constructor and save it for future use. */ | |
612 | while (vnode->iterate_direct_aliases (0, ref)) | |
613 | { | |
614 | if (file) | |
615 | fprintf (file, " %s/%i", ref->referred->name (), | |
616 | ref->referred->order); | |
617 | ref->referring->remove (); | |
618 | } | |
8dfbf71d | 619 | if (file) |
3083a0b3 | 620 | fprintf (file, " %s/%i", vnode->name (), vnode->order); |
e7610412 | 621 | vnext = next_variable (vnode); |
415d1b9a | 622 | vnode->remove (); |
8dfbf71d | 623 | changed = true; |
6f932b06 | 624 | } |
c5e076fc | 625 | else if (!reachable.contains (vnode) && !vnode->alias) |
91f0ab48 | 626 | { |
df8d3e89 | 627 | tree init; |
02774f2d | 628 | if (vnode->definition) |
91f0ab48 | 629 | { |
630 | if (file) | |
f1c8b4d7 | 631 | fprintf (file, " %s", vnode->name ()); |
91f0ab48 | 632 | changed = true; |
633 | } | |
38889e98 | 634 | /* Keep body if it may be useful for constant folding. */ |
058a1b7a | 635 | if ((init = ctor_for_folding (vnode->decl)) == error_mark_node |
636 | && !POINTER_BOUNDS_P (vnode->decl)) | |
38889e98 | 637 | vnode->remove_initializer (); |
638 | else | |
639 | DECL_INITIAL (vnode->decl) = init; | |
fa4052b3 | 640 | vnode->body_removed = true; |
02774f2d | 641 | vnode->definition = false; |
642 | vnode->analyzed = false; | |
643 | vnode->aux = NULL; | |
15ca8f90 | 644 | |
415d1b9a | 645 | vnode->remove_from_same_comdat_group (); |
04f65f92 | 646 | |
51ce5652 | 647 | vnode->remove_all_references (); |
91f0ab48 | 648 | } |
649 | else | |
02774f2d | 650 | vnode->aux = NULL; |
6f932b06 | 651 | } |
8dfbf71d | 652 | |
91f0ab48 | 653 | /* Now update address_taken flags and try to promote functions to be local. */ |
cdedc740 | 654 | if (file) |
655 | fprintf (file, "\nClearing address taken flags:"); | |
7c455d87 | 656 | FOR_EACH_DEFINED_FUNCTION (node) |
02774f2d | 657 | if (node->address_taken |
658 | && !node->used_from_other_partition) | |
cdedc740 | 659 | { |
7feaa33e | 660 | if (!node->call_for_symbol_and_aliases |
058a1b7a | 661 | (has_addr_references_p, NULL, true) |
662 | && (!node->instrumentation_clone | |
663 | || !node->instrumented_version | |
664 | || !node->instrumented_version->address_taken)) | |
cdedc740 | 665 | { |
666 | if (file) | |
f1c8b4d7 | 667 | fprintf (file, " %s", node->name ()); |
02774f2d | 668 | node->address_taken = false; |
8dfbf71d | 669 | changed = true; |
415d1b9a | 670 | if (node->local_p ()) |
8dfbf71d | 671 | { |
672 | node->local.local = true; | |
673 | if (file) | |
674 | fprintf (file, " (local)"); | |
675 | } | |
cdedc740 | 676 | } |
677 | } | |
c7b2cc59 | 678 | if (file) |
679 | fprintf (file, "\n"); | |
6f932b06 | 680 | |
09a2e412 | 681 | #ifdef ENABLE_CHECKING |
415d1b9a | 682 | symtab_node::verify_symtab_nodes (); |
09a2e412 | 683 | #endif |
34e5cced | 684 | |
f8bfd7f7 | 685 | /* If we removed something, perhaps profile could be improved. */ |
f1f41a6c | 686 | if (changed && optimize && inline_edge_summary_vec.exists ()) |
f8bfd7f7 | 687 | FOR_EACH_DEFINED_FUNCTION (node) |
6eaf903b | 688 | ipa_propagate_frequency (node); |
f8bfd7f7 | 689 | |
e2fa5d74 | 690 | timevar_pop (TV_IPA_UNREACHABLE); |
65c1a668 | 691 | return changed; |
692 | } | |
f37a5008 | 693 | |
703ad42c | 694 | /* Process references to VNODE and set flags WRITTEN, ADDRESS_TAKEN, READ |
695 | as needed, also clear EXPLICIT_REFS if the references to given variable | |
696 | do not need to be explicit. */ | |
697 | ||
698 | void | |
699 | process_references (varpool_node *vnode, | |
700 | bool *written, bool *address_taken, | |
701 | bool *read, bool *explicit_refs) | |
702 | { | |
703 | int i; | |
704 | struct ipa_ref *ref; | |
705 | ||
97221fd7 | 706 | if (!vnode->all_refs_explicit_p () |
703ad42c | 707 | || TREE_THIS_VOLATILE (vnode->decl)) |
708 | *explicit_refs = false; | |
709 | ||
51ce5652 | 710 | for (i = 0; vnode->iterate_referring (i, ref) |
703ad42c | 711 | && *explicit_refs && (!*written || !*address_taken || !*read); i++) |
712 | switch (ref->use) | |
713 | { | |
714 | case IPA_REF_ADDR: | |
715 | *address_taken = true; | |
716 | break; | |
717 | case IPA_REF_LOAD: | |
718 | *read = true; | |
719 | break; | |
720 | case IPA_REF_STORE: | |
721 | *written = true; | |
722 | break; | |
723 | case IPA_REF_ALIAS: | |
415d1b9a | 724 | process_references (dyn_cast<varpool_node *> (ref->referring), written, |
725 | address_taken, read, explicit_refs); | |
703ad42c | 726 | break; |
058a1b7a | 727 | case IPA_REF_CHKP: |
728 | gcc_unreachable (); | |
703ad42c | 729 | } |
730 | } | |
731 | ||
732 | /* Set TREE_READONLY bit. */ | |
733 | ||
734 | bool | |
735 | set_readonly_bit (varpool_node *vnode, void *data ATTRIBUTE_UNUSED) | |
736 | { | |
737 | TREE_READONLY (vnode->decl) = true; | |
738 | return false; | |
739 | } | |
740 | ||
741 | /* Set writeonly bit and clear the initalizer, since it will not be needed. */ | |
742 | ||
743 | bool | |
30d89cd0 | 744 | set_writeonly_bit (varpool_node *vnode, void *data) |
703ad42c | 745 | { |
746 | vnode->writeonly = true; | |
747 | if (optimize) | |
748 | { | |
749 | DECL_INITIAL (vnode->decl) = NULL; | |
750 | if (!vnode->alias) | |
30d89cd0 | 751 | { |
752 | if (vnode->num_references ()) | |
753 | *(bool *)data = true; | |
754 | vnode->remove_all_references (); | |
755 | } | |
703ad42c | 756 | } |
757 | return false; | |
758 | } | |
759 | ||
760 | /* Clear addressale bit of VNODE. */ | |
761 | ||
762 | bool | |
763 | clear_addressable_bit (varpool_node *vnode, void *data ATTRIBUTE_UNUSED) | |
764 | { | |
765 | vnode->address_taken = false; | |
766 | TREE_ADDRESSABLE (vnode->decl) = 0; | |
767 | return false; | |
768 | } | |
769 | ||
8dfbf71d | 770 | /* Discover variables that have no longer address taken or that are read only |
771 | and update their flags. | |
772 | ||
30d89cd0 | 773 | Return true when unreachable symbol removan should be done. |
774 | ||
8dfbf71d | 775 | FIXME: This can not be done in between gimplify and omp_expand since |
776 | readonly flag plays role on what is shared and what is not. Currently we do | |
023a28e1 | 777 | this transformation as part of whole program visibility and re-do at |
778 | ipa-reference pass (to take into account clonning), but it would | |
779 | make sense to do it before early optimizations. */ | |
8dfbf71d | 780 | |
30d89cd0 | 781 | bool |
8dfbf71d | 782 | ipa_discover_readonly_nonaddressable_vars (void) |
783 | { | |
30d89cd0 | 784 | bool remove_p = false; |
098f44bc | 785 | varpool_node *vnode; |
8dfbf71d | 786 | if (dump_file) |
787 | fprintf (dump_file, "Clearing variable flags:"); | |
7c455d87 | 788 | FOR_EACH_VARIABLE (vnode) |
703ad42c | 789 | if (!vnode->alias |
02774f2d | 790 | && (TREE_ADDRESSABLE (vnode->decl) |
703ad42c | 791 | || !vnode->writeonly |
02774f2d | 792 | || !TREE_READONLY (vnode->decl))) |
8dfbf71d | 793 | { |
794 | bool written = false; | |
795 | bool address_taken = false; | |
703ad42c | 796 | bool read = false; |
797 | bool explicit_refs = true; | |
798 | ||
30d89cd0 | 799 | process_references (vnode, &written, &address_taken, &read, |
800 | &explicit_refs); | |
703ad42c | 801 | if (!explicit_refs) |
802 | continue; | |
803 | if (!address_taken) | |
8dfbf71d | 804 | { |
703ad42c | 805 | if (TREE_ADDRESSABLE (vnode->decl) && dump_file) |
4206bfac | 806 | fprintf (dump_file, " %s (non-addressable)", vnode->name ()); |
50f2a18b | 807 | vnode->call_for_symbol_and_aliases (clear_addressable_bit, NULL, |
808 | true); | |
8dfbf71d | 809 | } |
703ad42c | 810 | if (!address_taken && !written |
8dfbf71d | 811 | /* Making variable in explicit section readonly can cause section |
812 | type conflict. | |
813 | See e.g. gcc.c-torture/compile/pr23237.c */ | |
71e19e54 | 814 | && vnode->get_section () == NULL) |
8dfbf71d | 815 | { |
703ad42c | 816 | if (!TREE_READONLY (vnode->decl) && dump_file) |
f1c8b4d7 | 817 | fprintf (dump_file, " %s (read-only)", vnode->name ()); |
50f2a18b | 818 | vnode->call_for_symbol_and_aliases (set_readonly_bit, NULL, true); |
703ad42c | 819 | } |
4206bfac | 820 | if (!vnode->writeonly && !read && !address_taken && written) |
703ad42c | 821 | { |
822 | if (dump_file) | |
823 | fprintf (dump_file, " %s (write-only)", vnode->name ()); | |
50f2a18b | 824 | vnode->call_for_symbol_and_aliases (set_writeonly_bit, &remove_p, |
825 | true); | |
8dfbf71d | 826 | } |
827 | } | |
828 | if (dump_file) | |
829 | fprintf (dump_file, "\n"); | |
30d89cd0 | 830 | return remove_p; |
8dfbf71d | 831 | } |
832 | ||
f8bfd7f7 | 833 | /* Free inline summary. */ |
834 | ||
cbe8bda8 | 835 | namespace { |
836 | ||
837 | const pass_data pass_data_ipa_free_inline_summary = | |
f8bfd7f7 | 838 | { |
cbe8bda8 | 839 | SIMPLE_IPA_PASS, /* type */ |
289c4db4 | 840 | "free-inline-summary", /* name */ |
cbe8bda8 | 841 | OPTGROUP_NONE, /* optinfo_flags */ |
cbe8bda8 | 842 | TV_IPA_FREE_INLINE_SUMMARY, /* tv_id */ |
843 | 0, /* properties_required */ | |
844 | 0, /* properties_provided */ | |
845 | 0, /* properties_destroyed */ | |
846 | 0, /* todo_flags_start */ | |
289c4db4 | 847 | /* Early optimizations may make function unreachable. We can not |
848 | remove unreachable functions as part of the ealry opts pass because | |
849 | TODOs are run before subpasses. Do it here. */ | |
850 | ( TODO_remove_functions | TODO_dump_symtab ), /* todo_flags_finish */ | |
f8bfd7f7 | 851 | }; |
852 | ||
cbe8bda8 | 853 | class pass_ipa_free_inline_summary : public simple_ipa_opt_pass |
854 | { | |
855 | public: | |
9af5ce0c | 856 | pass_ipa_free_inline_summary (gcc::context *ctxt) |
857 | : simple_ipa_opt_pass (pass_data_ipa_free_inline_summary, ctxt) | |
cbe8bda8 | 858 | {} |
859 | ||
860 | /* opt_pass methods: */ | |
65b0537f | 861 | virtual unsigned int execute (function *) |
862 | { | |
863 | inline_free_summary (); | |
864 | return 0; | |
865 | } | |
cbe8bda8 | 866 | |
867 | }; // class pass_ipa_free_inline_summary | |
868 | ||
869 | } // anon namespace | |
870 | ||
871 | simple_ipa_opt_pass * | |
872 | make_pass_ipa_free_inline_summary (gcc::context *ctxt) | |
873 | { | |
874 | return new pass_ipa_free_inline_summary (ctxt); | |
875 | } | |
876 | ||
a53e7471 | 877 | /* Generate and emit a static constructor or destructor. WHICH must |
058a1b7a | 878 | be one of 'I' (for a constructor), 'D' (for a destructor), 'P' |
879 | (for chp static vars constructor) or 'B' (for chkp static bounds | |
880 | constructor). BODY is a STATEMENT_LIST containing GENERIC | |
881 | statements. PRIORITY is the initialization priority for this | |
882 | constructor or destructor. | |
a53e7471 | 883 | |
62510893 | 884 | FINAL specify whether the externally visible name for collect2 should |
885 | be produced. */ | |
886 | ||
887 | static void | |
888 | cgraph_build_static_cdtor_1 (char which, tree body, int priority, bool final) | |
a53e7471 | 889 | { |
890 | static int counter = 0; | |
891 | char which_buf[16]; | |
892 | tree decl, name, resdecl; | |
893 | ||
894 | /* The priority is encoded in the constructor or destructor name. | |
895 | collect2 will sort the names and arrange that they are called at | |
896 | program startup. */ | |
62510893 | 897 | if (final) |
898 | sprintf (which_buf, "%c_%.5d_%d", which, priority, counter++); | |
899 | else | |
900 | /* Proudce sane name but one not recognizable by collect2, just for the | |
901 | case we fail to inline the function. */ | |
902 | sprintf (which_buf, "sub_%c_%.5d_%d", which, priority, counter++); | |
a53e7471 | 903 | name = get_file_function_name (which_buf); |
904 | ||
905 | decl = build_decl (input_location, FUNCTION_DECL, name, | |
906 | build_function_type_list (void_type_node, NULL_TREE)); | |
907 | current_function_decl = decl; | |
908 | ||
909 | resdecl = build_decl (input_location, | |
910 | RESULT_DECL, NULL_TREE, void_type_node); | |
911 | DECL_ARTIFICIAL (resdecl) = 1; | |
912 | DECL_RESULT (decl) = resdecl; | |
913 | DECL_CONTEXT (resdecl) = decl; | |
914 | ||
915 | allocate_struct_function (decl, false); | |
916 | ||
917 | TREE_STATIC (decl) = 1; | |
918 | TREE_USED (decl) = 1; | |
919 | DECL_ARTIFICIAL (decl) = 1; | |
920 | DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1; | |
921 | DECL_SAVED_TREE (decl) = body; | |
62510893 | 922 | if (!targetm.have_ctors_dtors && final) |
a53e7471 | 923 | { |
924 | TREE_PUBLIC (decl) = 1; | |
925 | DECL_PRESERVE_P (decl) = 1; | |
926 | } | |
927 | DECL_UNINLINABLE (decl) = 1; | |
928 | ||
929 | DECL_INITIAL (decl) = make_node (BLOCK); | |
930 | TREE_USED (DECL_INITIAL (decl)) = 1; | |
931 | ||
932 | DECL_SOURCE_LOCATION (decl) = input_location; | |
933 | cfun->function_end_locus = input_location; | |
934 | ||
935 | switch (which) | |
936 | { | |
937 | case 'I': | |
938 | DECL_STATIC_CONSTRUCTOR (decl) = 1; | |
939 | decl_init_priority_insert (decl, priority); | |
940 | break; | |
058a1b7a | 941 | case 'P': |
942 | DECL_STATIC_CONSTRUCTOR (decl) = 1; | |
943 | DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("chkp ctor"), | |
944 | NULL, | |
945 | NULL_TREE); | |
946 | decl_init_priority_insert (decl, priority); | |
947 | break; | |
948 | case 'B': | |
949 | DECL_STATIC_CONSTRUCTOR (decl) = 1; | |
950 | DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("bnd_legacy"), | |
951 | NULL, | |
952 | NULL_TREE); | |
953 | decl_init_priority_insert (decl, priority); | |
954 | break; | |
a53e7471 | 955 | case 'D': |
956 | DECL_STATIC_DESTRUCTOR (decl) = 1; | |
957 | decl_fini_priority_insert (decl, priority); | |
958 | break; | |
959 | default: | |
960 | gcc_unreachable (); | |
961 | } | |
962 | ||
963 | gimplify_function_tree (decl); | |
964 | ||
415d1b9a | 965 | cgraph_node::add_new_function (decl, false); |
a53e7471 | 966 | |
967 | set_cfun (NULL); | |
968 | current_function_decl = NULL; | |
969 | } | |
970 | ||
62510893 | 971 | /* Generate and emit a static constructor or destructor. WHICH must |
058a1b7a | 972 | be one of 'I' (for a constructor), 'D' (for a destructor), 'P' |
973 | (for chkp static vars constructor) or 'B' (for chkp static bounds | |
974 | constructor). BODY is a STATEMENT_LIST containing GENERIC | |
975 | statements. PRIORITY is the initialization priority for this | |
976 | constructor or destructor. */ | |
62510893 | 977 | |
978 | void | |
979 | cgraph_build_static_cdtor (char which, tree body, int priority) | |
980 | { | |
981 | cgraph_build_static_cdtor_1 (which, body, priority, false); | |
982 | } | |
a53e7471 | 983 | |
984 | /* A vector of FUNCTION_DECLs declared as static constructors. */ | |
f1f41a6c | 985 | static vec<tree> static_ctors; |
a53e7471 | 986 | /* A vector of FUNCTION_DECLs declared as static destructors. */ |
f1f41a6c | 987 | static vec<tree> static_dtors; |
a53e7471 | 988 | |
989 | /* When target does not have ctors and dtors, we call all constructor | |
990 | and destructor by special initialization/destruction function | |
991 | recognized by collect2. | |
992 | ||
993 | When we are going to build this function, collect all constructors and | |
994 | destructors and turn them into normal functions. */ | |
995 | ||
996 | static void | |
997 | record_cdtor_fn (struct cgraph_node *node) | |
998 | { | |
02774f2d | 999 | if (DECL_STATIC_CONSTRUCTOR (node->decl)) |
1000 | static_ctors.safe_push (node->decl); | |
1001 | if (DECL_STATIC_DESTRUCTOR (node->decl)) | |
1002 | static_dtors.safe_push (node->decl); | |
415d1b9a | 1003 | node = cgraph_node::get (node->decl); |
02774f2d | 1004 | DECL_DISREGARD_INLINE_LIMITS (node->decl) = 1; |
a53e7471 | 1005 | } |
1006 | ||
1007 | /* Define global constructors/destructor functions for the CDTORS, of | |
1008 | which they are LEN. The CDTORS are sorted by initialization | |
1009 | priority. If CTOR_P is true, these are constructors; otherwise, | |
1010 | they are destructors. */ | |
1011 | ||
1012 | static void | |
f1f41a6c | 1013 | build_cdtor (bool ctor_p, vec<tree> cdtors) |
a53e7471 | 1014 | { |
1015 | size_t i,j; | |
f1f41a6c | 1016 | size_t len = cdtors.length (); |
a53e7471 | 1017 | |
1018 | i = 0; | |
1019 | while (i < len) | |
1020 | { | |
1021 | tree body; | |
1022 | tree fn; | |
1023 | priority_type priority; | |
1024 | ||
1025 | priority = 0; | |
1026 | body = NULL_TREE; | |
1027 | j = i; | |
1028 | do | |
1029 | { | |
1030 | priority_type p; | |
f1f41a6c | 1031 | fn = cdtors[j]; |
a53e7471 | 1032 | p = ctor_p ? DECL_INIT_PRIORITY (fn) : DECL_FINI_PRIORITY (fn); |
1033 | if (j == i) | |
1034 | priority = p; | |
1035 | else if (p != priority) | |
1036 | break; | |
1037 | j++; | |
1038 | } | |
1039 | while (j < len); | |
1040 | ||
d2435fb0 | 1041 | /* When there is only one cdtor and target supports them, do nothing. */ |
a53e7471 | 1042 | if (j == i + 1 |
1043 | && targetm.have_ctors_dtors) | |
1044 | { | |
1045 | i++; | |
1046 | continue; | |
1047 | } | |
1048 | /* Find the next batch of constructors/destructors with the same | |
1049 | initialization priority. */ | |
d2435fb0 | 1050 | for (;i < j; i++) |
a53e7471 | 1051 | { |
a53e7471 | 1052 | tree call; |
f1f41a6c | 1053 | fn = cdtors[i]; |
a53e7471 | 1054 | call = build_call_expr (fn, 0); |
1055 | if (ctor_p) | |
1056 | DECL_STATIC_CONSTRUCTOR (fn) = 0; | |
1057 | else | |
1058 | DECL_STATIC_DESTRUCTOR (fn) = 0; | |
1059 | /* We do not want to optimize away pure/const calls here. | |
1060 | When optimizing, these should be already removed, when not | |
1061 | optimizing, we want user to be able to breakpoint in them. */ | |
1062 | TREE_SIDE_EFFECTS (call) = 1; | |
1063 | append_to_statement_list (call, &body); | |
a53e7471 | 1064 | } |
a53e7471 | 1065 | gcc_assert (body != NULL_TREE); |
1066 | /* Generate a function to call all the function of like | |
1067 | priority. */ | |
62510893 | 1068 | cgraph_build_static_cdtor_1 (ctor_p ? 'I' : 'D', body, priority, true); |
a53e7471 | 1069 | } |
1070 | } | |
1071 | ||
1072 | /* Comparison function for qsort. P1 and P2 are actually of type | |
1073 | "tree *" and point to static constructors. DECL_INIT_PRIORITY is | |
1074 | used to determine the sort order. */ | |
1075 | ||
1076 | static int | |
1077 | compare_ctor (const void *p1, const void *p2) | |
1078 | { | |
1079 | tree f1; | |
1080 | tree f2; | |
1081 | int priority1; | |
1082 | int priority2; | |
1083 | ||
1084 | f1 = *(const tree *)p1; | |
1085 | f2 = *(const tree *)p2; | |
1086 | priority1 = DECL_INIT_PRIORITY (f1); | |
1087 | priority2 = DECL_INIT_PRIORITY (f2); | |
1088 | ||
1089 | if (priority1 < priority2) | |
1090 | return -1; | |
1091 | else if (priority1 > priority2) | |
1092 | return 1; | |
1093 | else | |
1094 | /* Ensure a stable sort. Constructors are executed in backwarding | |
1095 | order to make LTO initialize braries first. */ | |
1096 | return DECL_UID (f2) - DECL_UID (f1); | |
1097 | } | |
1098 | ||
1099 | /* Comparison function for qsort. P1 and P2 are actually of type | |
1100 | "tree *" and point to static destructors. DECL_FINI_PRIORITY is | |
1101 | used to determine the sort order. */ | |
1102 | ||
1103 | static int | |
1104 | compare_dtor (const void *p1, const void *p2) | |
1105 | { | |
1106 | tree f1; | |
1107 | tree f2; | |
1108 | int priority1; | |
1109 | int priority2; | |
1110 | ||
1111 | f1 = *(const tree *)p1; | |
1112 | f2 = *(const tree *)p2; | |
1113 | priority1 = DECL_FINI_PRIORITY (f1); | |
1114 | priority2 = DECL_FINI_PRIORITY (f2); | |
1115 | ||
1116 | if (priority1 < priority2) | |
1117 | return -1; | |
1118 | else if (priority1 > priority2) | |
1119 | return 1; | |
1120 | else | |
1121 | /* Ensure a stable sort. */ | |
1122 | return DECL_UID (f1) - DECL_UID (f2); | |
1123 | } | |
1124 | ||
1125 | /* Generate functions to call static constructors and destructors | |
1126 | for targets that do not support .ctors/.dtors sections. These | |
1127 | functions have magic names which are detected by collect2. */ | |
1128 | ||
1129 | static void | |
1130 | build_cdtor_fns (void) | |
1131 | { | |
f1f41a6c | 1132 | if (!static_ctors.is_empty ()) |
a53e7471 | 1133 | { |
1134 | gcc_assert (!targetm.have_ctors_dtors || in_lto_p); | |
f1f41a6c | 1135 | static_ctors.qsort (compare_ctor); |
d2435fb0 | 1136 | build_cdtor (/*ctor_p=*/true, static_ctors); |
a53e7471 | 1137 | } |
1138 | ||
f1f41a6c | 1139 | if (!static_dtors.is_empty ()) |
a53e7471 | 1140 | { |
1141 | gcc_assert (!targetm.have_ctors_dtors || in_lto_p); | |
f1f41a6c | 1142 | static_dtors.qsort (compare_dtor); |
d2435fb0 | 1143 | build_cdtor (/*ctor_p=*/false, static_dtors); |
a53e7471 | 1144 | } |
1145 | } | |
1146 | ||
1147 | /* Look for constructors and destructors and produce function calling them. | |
1148 | This is needed for targets not supporting ctors or dtors, but we perform the | |
9d75589a | 1149 | transformation also at linktime to merge possibly numerous |
a53e7471 | 1150 | constructors/destructors into single function to improve code locality and |
1151 | reduce size. */ | |
1152 | ||
1153 | static unsigned int | |
1154 | ipa_cdtor_merge (void) | |
1155 | { | |
1156 | struct cgraph_node *node; | |
7c455d87 | 1157 | FOR_EACH_DEFINED_FUNCTION (node) |
02774f2d | 1158 | if (DECL_STATIC_CONSTRUCTOR (node->decl) |
1159 | || DECL_STATIC_DESTRUCTOR (node->decl)) | |
a53e7471 | 1160 | record_cdtor_fn (node); |
1161 | build_cdtor_fns (); | |
f1f41a6c | 1162 | static_ctors.release (); |
1163 | static_dtors.release (); | |
a53e7471 | 1164 | return 0; |
1165 | } | |
1166 | ||
cbe8bda8 | 1167 | namespace { |
1168 | ||
1169 | const pass_data pass_data_ipa_cdtor_merge = | |
a53e7471 | 1170 | { |
cbe8bda8 | 1171 | IPA_PASS, /* type */ |
1172 | "cdtor", /* name */ | |
1173 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 1174 | TV_CGRAPHOPT, /* tv_id */ |
1175 | 0, /* properties_required */ | |
1176 | 0, /* properties_provided */ | |
1177 | 0, /* properties_destroyed */ | |
1178 | 0, /* todo_flags_start */ | |
1179 | 0, /* todo_flags_finish */ | |
a53e7471 | 1180 | }; |
cbe8bda8 | 1181 | |
1182 | class pass_ipa_cdtor_merge : public ipa_opt_pass_d | |
1183 | { | |
1184 | public: | |
9af5ce0c | 1185 | pass_ipa_cdtor_merge (gcc::context *ctxt) |
1186 | : ipa_opt_pass_d (pass_data_ipa_cdtor_merge, ctxt, | |
1187 | NULL, /* generate_summary */ | |
1188 | NULL, /* write_summary */ | |
1189 | NULL, /* read_summary */ | |
1190 | NULL, /* write_optimization_summary */ | |
1191 | NULL, /* read_optimization_summary */ | |
1192 | NULL, /* stmt_fixup */ | |
1193 | 0, /* function_transform_todo_flags_start */ | |
1194 | NULL, /* function_transform */ | |
1195 | NULL) /* variable_transform */ | |
cbe8bda8 | 1196 | {} |
1197 | ||
1198 | /* opt_pass methods: */ | |
31315c24 | 1199 | virtual bool gate (function *); |
65b0537f | 1200 | virtual unsigned int execute (function *) { return ipa_cdtor_merge (); } |
cbe8bda8 | 1201 | |
1202 | }; // class pass_ipa_cdtor_merge | |
1203 | ||
31315c24 | 1204 | bool |
1205 | pass_ipa_cdtor_merge::gate (function *) | |
1206 | { | |
1207 | /* Perform the pass when we have no ctors/dtors support | |
1208 | or at LTO time to merge multiple constructors into single | |
1209 | function. */ | |
1210 | return !targetm.have_ctors_dtors || (optimize && in_lto_p); | |
1211 | } | |
1212 | ||
cbe8bda8 | 1213 | } // anon namespace |
1214 | ||
1215 | ipa_opt_pass_d * | |
1216 | make_pass_ipa_cdtor_merge (gcc::context *ctxt) | |
1217 | { | |
1218 | return new pass_ipa_cdtor_merge (ctxt); | |
1219 | } | |
3f1f2be0 | 1220 | |
1221 | /* Invalid pointer representing BOTTOM for single user dataflow. */ | |
1222 | #define BOTTOM ((cgraph_node *)(size_t) 2) | |
1223 | ||
1224 | /* Meet operation for single user dataflow. | |
1225 | Here we want to associate variables with sigle function that may access it. | |
1226 | ||
1227 | FUNCTION is current single user of a variable, VAR is variable that uses it. | |
1228 | Latttice is stored in SINGLE_USER_MAP. | |
1229 | ||
1230 | We represent: | |
1231 | - TOP by no entry in SIGNLE_USER_MAP | |
1232 | - BOTTOM by BOTTOM in AUX pointer (to save lookups) | |
1233 | - known single user by cgraph pointer in SINGLE_USER_MAP. */ | |
1234 | ||
1235 | cgraph_node * | |
1236 | meet (cgraph_node *function, varpool_node *var, | |
d62dd039 | 1237 | hash_map<varpool_node *, cgraph_node *> &single_user_map) |
3f1f2be0 | 1238 | { |
1239 | struct cgraph_node *user, **f; | |
1240 | ||
1241 | if (var->aux == BOTTOM) | |
1242 | return BOTTOM; | |
1243 | ||
d62dd039 | 1244 | f = single_user_map.get (var); |
3f1f2be0 | 1245 | if (!f) |
1246 | return function; | |
1247 | user = *f; | |
1248 | if (!function) | |
1249 | return user; | |
1250 | else if (function != user) | |
1251 | return BOTTOM; | |
1252 | else | |
1253 | return function; | |
1254 | } | |
1255 | ||
1256 | /* Propagation step of single-use dataflow. | |
1257 | ||
1258 | Check all uses of VNODE and see if they are used by single function FUNCTION. | |
1259 | SINGLE_USER_MAP represents the dataflow lattice. */ | |
1260 | ||
1261 | cgraph_node * | |
1262 | propagate_single_user (varpool_node *vnode, cgraph_node *function, | |
d62dd039 | 1263 | hash_map<varpool_node *, cgraph_node *> &single_user_map) |
3f1f2be0 | 1264 | { |
1265 | int i; | |
1266 | struct ipa_ref *ref; | |
1267 | ||
1268 | gcc_assert (!vnode->externally_visible); | |
1269 | ||
1270 | /* If node is an alias, first meet with its target. */ | |
1271 | if (vnode->alias) | |
97221fd7 | 1272 | function = meet (function, vnode->get_alias_target (), single_user_map); |
3f1f2be0 | 1273 | |
1274 | /* Check all users and see if they correspond to a single function. */ | |
415d1b9a | 1275 | for (i = 0; vnode->iterate_referring (i, ref) && function != BOTTOM; i++) |
3f1f2be0 | 1276 | { |
1277 | struct cgraph_node *cnode = dyn_cast <cgraph_node *> (ref->referring); | |
1278 | if (cnode) | |
1279 | { | |
1280 | if (cnode->global.inlined_to) | |
1281 | cnode = cnode->global.inlined_to; | |
1282 | if (!function) | |
1283 | function = cnode; | |
1284 | else if (function != cnode) | |
1285 | function = BOTTOM; | |
1286 | } | |
1287 | else | |
366970c6 | 1288 | function = meet (function, dyn_cast <varpool_node *> (ref->referring), |
1289 | single_user_map); | |
3f1f2be0 | 1290 | } |
1291 | return function; | |
1292 | } | |
1293 | ||
1294 | /* Pass setting used_by_single_function flag. | |
366970c6 | 1295 | This flag is set on variable when there is only one function that may |
1296 | possibly referr to it. */ | |
3f1f2be0 | 1297 | |
1298 | static unsigned int | |
1299 | ipa_single_use (void) | |
1300 | { | |
1301 | varpool_node *first = (varpool_node *) (void *) 1; | |
1302 | varpool_node *var; | |
d62dd039 | 1303 | hash_map<varpool_node *, cgraph_node *> single_user_map; |
3f1f2be0 | 1304 | |
1305 | FOR_EACH_DEFINED_VARIABLE (var) | |
97221fd7 | 1306 | if (!var->all_refs_explicit_p ()) |
3f1f2be0 | 1307 | var->aux = BOTTOM; |
1308 | else | |
1309 | { | |
1310 | /* Enqueue symbol for dataflow. */ | |
1311 | var->aux = first; | |
1312 | first = var; | |
1313 | } | |
1314 | ||
1315 | /* The actual dataflow. */ | |
1316 | ||
1317 | while (first != (void *) 1) | |
1318 | { | |
1319 | cgraph_node *user, *orig_user, **f; | |
1320 | ||
1321 | var = first; | |
1322 | first = (varpool_node *)first->aux; | |
1323 | ||
d62dd039 | 1324 | f = single_user_map.get (var); |
3f1f2be0 | 1325 | if (f) |
1326 | orig_user = *f; | |
1327 | else | |
1328 | orig_user = NULL; | |
1329 | user = propagate_single_user (var, orig_user, single_user_map); | |
1330 | ||
1331 | gcc_checking_assert (var->aux != BOTTOM); | |
1332 | ||
1333 | /* If user differs, enqueue all references. */ | |
1334 | if (user != orig_user) | |
1335 | { | |
1336 | unsigned int i; | |
1337 | ipa_ref *ref; | |
1338 | ||
d62dd039 | 1339 | single_user_map.put (var, user); |
3f1f2be0 | 1340 | |
1341 | /* Enqueue all aliases for re-processing. */ | |
50f2a18b | 1342 | for (i = 0; var->iterate_direct_aliases (i, ref); i++) |
1343 | if (!ref->referring->aux) | |
3f1f2be0 | 1344 | { |
1345 | ref->referring->aux = first; | |
1346 | first = dyn_cast <varpool_node *> (ref->referring); | |
1347 | } | |
1348 | /* Enqueue all users for re-processing. */ | |
415d1b9a | 1349 | for (i = 0; var->iterate_reference (i, ref); i++) |
3f1f2be0 | 1350 | if (!ref->referred->aux |
1351 | && ref->referred->definition | |
1352 | && is_a <varpool_node *> (ref->referred)) | |
1353 | { | |
1354 | ref->referred->aux = first; | |
1355 | first = dyn_cast <varpool_node *> (ref->referred); | |
1356 | } | |
1357 | ||
1358 | /* If user is BOTTOM, just punt on this var. */ | |
1359 | if (user == BOTTOM) | |
1360 | var->aux = BOTTOM; | |
1361 | else | |
1362 | var->aux = NULL; | |
1363 | } | |
1364 | else | |
1365 | var->aux = NULL; | |
1366 | } | |
1367 | ||
1368 | FOR_EACH_DEFINED_VARIABLE (var) | |
1369 | { | |
1370 | if (var->aux != BOTTOM) | |
1371 | { | |
1372 | #ifdef ENABLE_CHECKING | |
366970c6 | 1373 | /* Not having the single user known means that the VAR is |
1374 | unreachable. Either someone forgot to remove unreachable | |
1375 | variables or the reachability here is wrong. */ | |
1376 | ||
d62dd039 | 1377 | gcc_assert (single_user_map.get (var)); |
3f1f2be0 | 1378 | #endif |
1379 | if (dump_file) | |
1380 | { | |
1381 | fprintf (dump_file, "Variable %s/%i is used by single function\n", | |
1382 | var->name (), var->order); | |
1383 | } | |
1384 | var->used_by_single_function = true; | |
1385 | } | |
1386 | var->aux = NULL; | |
1387 | } | |
1388 | return 0; | |
1389 | } | |
1390 | ||
1391 | namespace { | |
1392 | ||
1393 | const pass_data pass_data_ipa_single_use = | |
1394 | { | |
1395 | IPA_PASS, /* type */ | |
1396 | "single-use", /* name */ | |
1397 | OPTGROUP_NONE, /* optinfo_flags */ | |
3f1f2be0 | 1398 | TV_CGRAPHOPT, /* tv_id */ |
1399 | 0, /* properties_required */ | |
1400 | 0, /* properties_provided */ | |
1401 | 0, /* properties_destroyed */ | |
1402 | 0, /* todo_flags_start */ | |
1403 | 0, /* todo_flags_finish */ | |
1404 | }; | |
1405 | ||
1406 | class pass_ipa_single_use : public ipa_opt_pass_d | |
1407 | { | |
1408 | public: | |
1409 | pass_ipa_single_use (gcc::context *ctxt) | |
1410 | : ipa_opt_pass_d (pass_data_ipa_single_use, ctxt, | |
1411 | NULL, /* generate_summary */ | |
1412 | NULL, /* write_summary */ | |
1413 | NULL, /* read_summary */ | |
1414 | NULL, /* write_optimization_summary */ | |
1415 | NULL, /* read_optimization_summary */ | |
1416 | NULL, /* stmt_fixup */ | |
1417 | 0, /* function_transform_todo_flags_start */ | |
1418 | NULL, /* function_transform */ | |
1419 | NULL) /* variable_transform */ | |
1420 | {} | |
1421 | ||
1422 | /* opt_pass methods: */ | |
1423 | virtual bool gate (function *); | |
1424 | virtual unsigned int execute (function *) { return ipa_single_use (); } | |
1425 | ||
1426 | }; // class pass_ipa_single_use | |
1427 | ||
1428 | bool | |
1429 | pass_ipa_single_use::gate (function *) | |
1430 | { | |
1431 | return optimize; | |
1432 | } | |
1433 | ||
1434 | } // anon namespace | |
1435 | ||
1436 | ipa_opt_pass_d * | |
1437 | make_pass_ipa_single_use (gcc::context *ctxt) | |
1438 | { | |
1439 | return new pass_ipa_single_use (ctxt); | |
1440 | } |