]>
Commit | Line | Data |
---|---|---|
e72fcfe8 | 1 | /* Callgraph handling code. |
5624e564 | 2 | Copyright (C) 2003-2015 Free Software Foundation, Inc. |
e72fcfe8 JH |
3 | Contributed by Jan Hubicka |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 9 | Software Foundation; either version 3, or (at your option) any later |
e72fcfe8 JH |
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 | |
9dcd6f09 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
e72fcfe8 | 20 | |
8a4a83ed | 21 | /* This file contains basic routines manipulating call graph |
c22cacf3 | 22 | |
9c8305f8 JH |
23 | The call-graph is a data structure designed for intra-procedural optimization. |
24 | It represents a multi-graph where nodes are functions and edges are call sites. */ | |
18c6ada9 | 25 | |
e72fcfe8 JH |
26 | #include "config.h" |
27 | #include "system.h" | |
28 | #include "coretypes.h" | |
29 | #include "tm.h" | |
40e23961 MC |
30 | #include "hash-set.h" |
31 | #include "machmode.h" | |
32 | #include "vec.h" | |
33 | #include "double-int.h" | |
34 | #include "input.h" | |
35 | #include "alias.h" | |
36 | #include "symtab.h" | |
37 | #include "wide-int.h" | |
38 | #include "inchash.h" | |
e72fcfe8 | 39 | #include "tree.h" |
40e23961 | 40 | #include "fold-const.h" |
d8a2d370 DN |
41 | #include "varasm.h" |
42 | #include "calls.h" | |
43 | #include "print-tree.h" | |
cd9c7bd2 | 44 | #include "tree-inline.h" |
e72fcfe8 JH |
45 | #include "langhooks.h" |
46 | #include "hashtab.h" | |
47 | #include "toplev.h" | |
48 | #include "flags.h" | |
e72fcfe8 JH |
49 | #include "debug.h" |
50 | #include "target.h" | |
60393bbc AM |
51 | #include "predict.h" |
52 | #include "dominance.h" | |
53 | #include "cfg.h" | |
54 | #include "basic-block.h" | |
c582198b AM |
55 | #include "hash-map.h" |
56 | #include "is-a.h" | |
57 | #include "plugin-api.h" | |
c582198b | 58 | #include "hard-reg-set.h" |
c582198b AM |
59 | #include "function.h" |
60 | #include "ipa-ref.h" | |
1c4a429a | 61 | #include "cgraph.h" |
dc0bfe6a | 62 | #include "intl.h" |
2fb9a547 AM |
63 | #include "tree-ssa-alias.h" |
64 | #include "internal-fn.h" | |
65 | #include "tree-eh.h" | |
66 | #include "gimple-expr.h" | |
726a989a | 67 | #include "gimple.h" |
5be5c238 | 68 | #include "gimple-iterator.h" |
7ee2468b SB |
69 | #include "timevar.h" |
70 | #include "dumpfile.h" | |
442b4905 | 71 | #include "gimple-ssa.h" |
442b4905 | 72 | #include "tree-cfg.h" |
7a300452 | 73 | #include "tree-ssa.h" |
a63f2942 | 74 | #include "value-prof.h" |
f9417da1 | 75 | #include "except.h" |
1da2ed5f | 76 | #include "diagnostic-core.h" |
715a4e08 | 77 | #include "rtl.h" |
a940b4d9 | 78 | #include "ipa-utils.h" |
99fecd47 | 79 | #include "lto-streamer.h" |
c582198b | 80 | #include "alloc-pool.h" |
dd912cb8 | 81 | #include "symbol-summary.h" |
c582198b | 82 | #include "ipa-prop.h" |
e7f23018 | 83 | #include "ipa-inline.h" |
7d776ee2 | 84 | #include "cfgloop.h" |
9c8305f8 | 85 | #include "gimple-pretty-print.h" |
36566b39 PK |
86 | #include "statistics.h" |
87 | #include "real.h" | |
88 | #include "fixed-value.h" | |
89 | #include "insn-config.h" | |
90 | #include "expmed.h" | |
91 | #include "dojump.h" | |
92 | #include "explow.h" | |
93 | #include "emit-rtl.h" | |
94 | #include "stmt.h" | |
23a04216 JH |
95 | #include "expr.h" |
96 | #include "tree-dfa.h" | |
893479de AM |
97 | #include "profile.h" |
98 | #include "params.h" | |
d5e254e1 | 99 | #include "tree-chkp.h" |
1f6be682 | 100 | #include "context.h" |
988d1653 | 101 | |
7ee2468b SB |
102 | /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */ |
103 | #include "tree-pass.h" | |
104 | ||
1668aabc | 105 | /* Queue of cgraph nodes scheduled to be lowered. */ |
5e20cdc9 | 106 | symtab_node *x_cgraph_nodes_queue; |
3dafb85c | 107 | #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue) |
f45e0ad1 | 108 | |
3dafb85c ML |
109 | /* Symbol table global context. */ |
110 | symbol_table *symtab; | |
cd9c7bd2 | 111 | |
61502ca8 | 112 | /* List of hooks triggered on cgraph_edge events. */ |
9088c1cc MJ |
113 | struct cgraph_edge_hook_list { |
114 | cgraph_edge_hook hook; | |
115 | void *data; | |
116 | struct cgraph_edge_hook_list *next; | |
117 | }; | |
118 | ||
61502ca8 | 119 | /* List of hooks triggered on cgraph_node events. */ |
9088c1cc MJ |
120 | struct cgraph_node_hook_list { |
121 | cgraph_node_hook hook; | |
122 | void *data; | |
123 | struct cgraph_node_hook_list *next; | |
124 | }; | |
125 | ||
61502ca8 | 126 | /* List of hooks triggered on events involving two cgraph_edges. */ |
9088c1cc MJ |
127 | struct cgraph_2edge_hook_list { |
128 | cgraph_2edge_hook hook; | |
129 | void *data; | |
130 | struct cgraph_2edge_hook_list *next; | |
131 | }; | |
132 | ||
61502ca8 | 133 | /* List of hooks triggered on events involving two cgraph_nodes. */ |
9088c1cc MJ |
134 | struct cgraph_2node_hook_list { |
135 | cgraph_2node_hook hook; | |
136 | void *data; | |
137 | struct cgraph_2node_hook_list *next; | |
138 | }; | |
139 | ||
2a22f99c TS |
140 | /* Hash descriptor for cgraph_function_version_info. */ |
141 | ||
142 | struct function_version_hasher : ggc_hasher<cgraph_function_version_info *> | |
143 | { | |
144 | static hashval_t hash (cgraph_function_version_info *); | |
145 | static bool equal (cgraph_function_version_info *, | |
146 | cgraph_function_version_info *); | |
147 | }; | |
148 | ||
3649b9b7 ST |
149 | /* Map a cgraph_node to cgraph_function_version_info using this htab. |
150 | The cgraph_function_version_info has a THIS_NODE field that is the | |
151 | corresponding cgraph_node.. */ | |
152 | ||
2a22f99c | 153 | static GTY(()) hash_table<function_version_hasher> *cgraph_fnver_htab = NULL; |
3649b9b7 ST |
154 | |
155 | /* Hash function for cgraph_fnver_htab. */ | |
2a22f99c TS |
156 | hashval_t |
157 | function_version_hasher::hash (cgraph_function_version_info *ptr) | |
3649b9b7 | 158 | { |
2a22f99c | 159 | int uid = ptr->this_node->uid; |
3649b9b7 ST |
160 | return (hashval_t)(uid); |
161 | } | |
162 | ||
163 | /* eq function for cgraph_fnver_htab. */ | |
2a22f99c TS |
164 | bool |
165 | function_version_hasher::equal (cgraph_function_version_info *n1, | |
166 | cgraph_function_version_info *n2) | |
3649b9b7 | 167 | { |
3649b9b7 ST |
168 | return n1->this_node->uid == n2->this_node->uid; |
169 | } | |
170 | ||
171 | /* Mark as GC root all allocated nodes. */ | |
172 | static GTY(()) struct cgraph_function_version_info * | |
173 | version_info_node = NULL; | |
174 | ||
175 | /* Get the cgraph_function_version_info node corresponding to node. */ | |
3dafb85c | 176 | cgraph_function_version_info * |
d52f5295 | 177 | cgraph_node::function_version (void) |
3649b9b7 | 178 | { |
3dafb85c | 179 | cgraph_function_version_info key; |
d52f5295 | 180 | key.this_node = this; |
3649b9b7 ST |
181 | |
182 | if (cgraph_fnver_htab == NULL) | |
183 | return NULL; | |
184 | ||
2a22f99c | 185 | return cgraph_fnver_htab->find (&key); |
3649b9b7 ST |
186 | } |
187 | ||
188 | /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab | |
189 | corresponding to cgraph_node NODE. */ | |
3dafb85c | 190 | cgraph_function_version_info * |
d52f5295 | 191 | cgraph_node::insert_new_function_version (void) |
3649b9b7 | 192 | { |
3649b9b7 | 193 | version_info_node = NULL; |
766090c2 | 194 | version_info_node = ggc_cleared_alloc<cgraph_function_version_info> (); |
d52f5295 | 195 | version_info_node->this_node = this; |
3649b9b7 ST |
196 | |
197 | if (cgraph_fnver_htab == NULL) | |
2a22f99c | 198 | cgraph_fnver_htab = hash_table<function_version_hasher>::create_ggc (2); |
3649b9b7 | 199 | |
2a22f99c TS |
200 | *cgraph_fnver_htab->find_slot (version_info_node, INSERT) |
201 | = version_info_node; | |
3649b9b7 ST |
202 | return version_info_node; |
203 | } | |
204 | ||
205 | /* Remove the cgraph_function_version_info and cgraph_node for DECL. This | |
206 | DECL is a duplicate declaration. */ | |
207 | void | |
d52f5295 | 208 | cgraph_node::delete_function_version (tree decl) |
3649b9b7 | 209 | { |
3dafb85c ML |
210 | cgraph_node *decl_node = cgraph_node::get (decl); |
211 | cgraph_function_version_info *decl_v = NULL; | |
3649b9b7 ST |
212 | |
213 | if (decl_node == NULL) | |
214 | return; | |
215 | ||
d52f5295 | 216 | decl_v = decl_node->function_version (); |
3649b9b7 ST |
217 | |
218 | if (decl_v == NULL) | |
219 | return; | |
220 | ||
221 | if (decl_v->prev != NULL) | |
222 | decl_v->prev->next = decl_v->next; | |
223 | ||
224 | if (decl_v->next != NULL) | |
225 | decl_v->next->prev = decl_v->prev; | |
226 | ||
227 | if (cgraph_fnver_htab != NULL) | |
2a22f99c | 228 | cgraph_fnver_htab->remove_elt (decl_v); |
3649b9b7 | 229 | |
d52f5295 | 230 | decl_node->remove (); |
3649b9b7 ST |
231 | } |
232 | ||
233 | /* Record that DECL1 and DECL2 are semantically identical function | |
234 | versions. */ | |
235 | void | |
d52f5295 | 236 | cgraph_node::record_function_versions (tree decl1, tree decl2) |
3649b9b7 | 237 | { |
3dafb85c ML |
238 | cgraph_node *decl1_node = cgraph_node::get_create (decl1); |
239 | cgraph_node *decl2_node = cgraph_node::get_create (decl2); | |
240 | cgraph_function_version_info *decl1_v = NULL; | |
241 | cgraph_function_version_info *decl2_v = NULL; | |
242 | cgraph_function_version_info *before; | |
243 | cgraph_function_version_info *after; | |
3649b9b7 ST |
244 | |
245 | gcc_assert (decl1_node != NULL && decl2_node != NULL); | |
d52f5295 ML |
246 | decl1_v = decl1_node->function_version (); |
247 | decl2_v = decl2_node->function_version (); | |
3649b9b7 ST |
248 | |
249 | if (decl1_v != NULL && decl2_v != NULL) | |
250 | return; | |
251 | ||
252 | if (decl1_v == NULL) | |
d52f5295 | 253 | decl1_v = decl1_node->insert_new_function_version (); |
3649b9b7 ST |
254 | |
255 | if (decl2_v == NULL) | |
d52f5295 | 256 | decl2_v = decl2_node->insert_new_function_version (); |
3649b9b7 ST |
257 | |
258 | /* Chain decl2_v and decl1_v. All semantically identical versions | |
259 | will be chained together. */ | |
260 | ||
261 | before = decl1_v; | |
262 | after = decl2_v; | |
263 | ||
264 | while (before->next != NULL) | |
265 | before = before->next; | |
266 | ||
267 | while (after->prev != NULL) | |
268 | after= after->prev; | |
269 | ||
270 | before->next = after; | |
271 | after->prev = before; | |
272 | } | |
273 | ||
c582198b AM |
274 | /* Initialize callgraph dump file. */ |
275 | ||
276 | void | |
277 | symbol_table::initialize (void) | |
278 | { | |
279 | if (!dump_file) | |
280 | dump_file = dump_begin (TDI_cgraph, NULL); | |
281 | } | |
282 | ||
60393bbc AM |
283 | /* Allocate new callgraph node and insert it into basic data structures. */ |
284 | ||
285 | cgraph_node * | |
286 | symbol_table::create_empty (void) | |
287 | { | |
288 | cgraph_node *node = allocate_cgraph_symbol (); | |
289 | ||
290 | node->type = SYMTAB_FUNCTION; | |
291 | node->frequency = NODE_FREQUENCY_NORMAL; | |
292 | node->count_materialization_scale = REG_BR_PROB_BASE; | |
293 | cgraph_count++; | |
294 | ||
295 | return node; | |
296 | } | |
297 | ||
9088c1cc | 298 | /* Register HOOK to be called with DATA on each removed edge. */ |
3dafb85c ML |
299 | cgraph_edge_hook_list * |
300 | symbol_table::add_edge_removal_hook (cgraph_edge_hook hook, void *data) | |
9088c1cc | 301 | { |
3dafb85c ML |
302 | cgraph_edge_hook_list *entry; |
303 | cgraph_edge_hook_list **ptr = &m_first_edge_removal_hook; | |
9088c1cc | 304 | |
3dafb85c | 305 | entry = (cgraph_edge_hook_list *) xmalloc (sizeof (*entry)); |
9088c1cc MJ |
306 | entry->hook = hook; |
307 | entry->data = data; | |
308 | entry->next = NULL; | |
309 | while (*ptr) | |
310 | ptr = &(*ptr)->next; | |
311 | *ptr = entry; | |
312 | return entry; | |
313 | } | |
314 | ||
315 | /* Remove ENTRY from the list of hooks called on removing edges. */ | |
316 | void | |
3dafb85c | 317 | symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list *entry) |
9088c1cc | 318 | { |
3dafb85c | 319 | cgraph_edge_hook_list **ptr = &m_first_edge_removal_hook; |
9088c1cc MJ |
320 | |
321 | while (*ptr != entry) | |
322 | ptr = &(*ptr)->next; | |
323 | *ptr = entry->next; | |
934cb78a | 324 | free (entry); |
9088c1cc MJ |
325 | } |
326 | ||
327 | /* Call all edge removal hooks. */ | |
3dafb85c ML |
328 | void |
329 | symbol_table::call_edge_removal_hooks (cgraph_edge *e) | |
9088c1cc | 330 | { |
3dafb85c | 331 | cgraph_edge_hook_list *entry = m_first_edge_removal_hook; |
9088c1cc MJ |
332 | while (entry) |
333 | { | |
334 | entry->hook (e, entry->data); | |
335 | entry = entry->next; | |
336 | } | |
337 | } | |
338 | ||
339 | /* Register HOOK to be called with DATA on each removed node. */ | |
3dafb85c ML |
340 | cgraph_node_hook_list * |
341 | symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook, void *data) | |
9088c1cc | 342 | { |
3dafb85c ML |
343 | cgraph_node_hook_list *entry; |
344 | cgraph_node_hook_list **ptr = &m_first_cgraph_removal_hook; | |
9088c1cc | 345 | |
3dafb85c | 346 | entry = (cgraph_node_hook_list *) xmalloc (sizeof (*entry)); |
9088c1cc MJ |
347 | entry->hook = hook; |
348 | entry->data = data; | |
349 | entry->next = NULL; | |
350 | while (*ptr) | |
351 | ptr = &(*ptr)->next; | |
352 | *ptr = entry; | |
353 | return entry; | |
354 | } | |
355 | ||
356 | /* Remove ENTRY from the list of hooks called on removing nodes. */ | |
357 | void | |
3dafb85c | 358 | symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list *entry) |
9088c1cc | 359 | { |
3dafb85c | 360 | cgraph_node_hook_list **ptr = &m_first_cgraph_removal_hook; |
9088c1cc MJ |
361 | |
362 | while (*ptr != entry) | |
363 | ptr = &(*ptr)->next; | |
364 | *ptr = entry->next; | |
934cb78a | 365 | free (entry); |
9088c1cc MJ |
366 | } |
367 | ||
368 | /* Call all node removal hooks. */ | |
3dafb85c ML |
369 | void |
370 | symbol_table::call_cgraph_removal_hooks (cgraph_node *node) | |
9088c1cc | 371 | { |
3dafb85c | 372 | cgraph_node_hook_list *entry = m_first_cgraph_removal_hook; |
9088c1cc MJ |
373 | while (entry) |
374 | { | |
375 | entry->hook (node, entry->data); | |
376 | entry = entry->next; | |
377 | } | |
378 | } | |
379 | ||
3dafb85c ML |
380 | /* Call all node removal hooks. */ |
381 | void | |
382 | symbol_table::call_cgraph_insertion_hooks (cgraph_node *node) | |
383 | { | |
384 | cgraph_node_hook_list *entry = m_first_cgraph_insertion_hook; | |
385 | while (entry) | |
386 | { | |
387 | entry->hook (node, entry->data); | |
388 | entry = entry->next; | |
389 | } | |
390 | } | |
391 | ||
392 | ||
6544865a | 393 | /* Register HOOK to be called with DATA on each inserted node. */ |
3dafb85c ML |
394 | cgraph_node_hook_list * |
395 | symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook, void *data) | |
129a37fc | 396 | { |
3dafb85c ML |
397 | cgraph_node_hook_list *entry; |
398 | cgraph_node_hook_list **ptr = &m_first_cgraph_insertion_hook; | |
129a37fc | 399 | |
3dafb85c | 400 | entry = (cgraph_node_hook_list *) xmalloc (sizeof (*entry)); |
129a37fc JH |
401 | entry->hook = hook; |
402 | entry->data = data; | |
403 | entry->next = NULL; | |
404 | while (*ptr) | |
405 | ptr = &(*ptr)->next; | |
406 | *ptr = entry; | |
407 | return entry; | |
408 | } | |
409 | ||
6544865a | 410 | /* Remove ENTRY from the list of hooks called on inserted nodes. */ |
129a37fc | 411 | void |
3dafb85c | 412 | symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list *entry) |
129a37fc | 413 | { |
3dafb85c | 414 | cgraph_node_hook_list **ptr = &m_first_cgraph_insertion_hook; |
129a37fc JH |
415 | |
416 | while (*ptr != entry) | |
417 | ptr = &(*ptr)->next; | |
418 | *ptr = entry->next; | |
934cb78a | 419 | free (entry); |
129a37fc JH |
420 | } |
421 | ||
9088c1cc | 422 | /* Register HOOK to be called with DATA on each duplicated edge. */ |
3dafb85c ML |
423 | cgraph_2edge_hook_list * |
424 | symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook, void *data) | |
9088c1cc | 425 | { |
3dafb85c ML |
426 | cgraph_2edge_hook_list *entry; |
427 | cgraph_2edge_hook_list **ptr = &m_first_edge_duplicated_hook; | |
9088c1cc | 428 | |
3dafb85c | 429 | entry = (cgraph_2edge_hook_list *) xmalloc (sizeof (*entry)); |
9088c1cc MJ |
430 | entry->hook = hook; |
431 | entry->data = data; | |
432 | entry->next = NULL; | |
433 | while (*ptr) | |
434 | ptr = &(*ptr)->next; | |
435 | *ptr = entry; | |
436 | return entry; | |
437 | } | |
438 | ||
439 | /* Remove ENTRY from the list of hooks called on duplicating edges. */ | |
440 | void | |
3dafb85c | 441 | symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list *entry) |
9088c1cc | 442 | { |
3dafb85c | 443 | cgraph_2edge_hook_list **ptr = &m_first_edge_duplicated_hook; |
9088c1cc MJ |
444 | |
445 | while (*ptr != entry) | |
446 | ptr = &(*ptr)->next; | |
447 | *ptr = entry->next; | |
934cb78a | 448 | free (entry); |
9088c1cc MJ |
449 | } |
450 | ||
451 | /* Call all edge duplication hooks. */ | |
66a20fc2 | 452 | void |
3dafb85c | 453 | symbol_table::call_edge_duplication_hooks (cgraph_edge *cs1, cgraph_edge *cs2) |
9088c1cc | 454 | { |
3dafb85c | 455 | cgraph_2edge_hook_list *entry = m_first_edge_duplicated_hook; |
9088c1cc MJ |
456 | while (entry) |
457 | { | |
458 | entry->hook (cs1, cs2, entry->data); | |
459 | entry = entry->next; | |
460 | } | |
461 | } | |
462 | ||
463 | /* Register HOOK to be called with DATA on each duplicated node. */ | |
3dafb85c ML |
464 | cgraph_2node_hook_list * |
465 | symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook, void *data) | |
9088c1cc | 466 | { |
3dafb85c ML |
467 | cgraph_2node_hook_list *entry; |
468 | cgraph_2node_hook_list **ptr = &m_first_cgraph_duplicated_hook; | |
9088c1cc | 469 | |
3dafb85c | 470 | entry = (cgraph_2node_hook_list *) xmalloc (sizeof (*entry)); |
9088c1cc MJ |
471 | entry->hook = hook; |
472 | entry->data = data; | |
473 | entry->next = NULL; | |
474 | while (*ptr) | |
475 | ptr = &(*ptr)->next; | |
476 | *ptr = entry; | |
477 | return entry; | |
478 | } | |
479 | ||
480 | /* Remove ENTRY from the list of hooks called on duplicating nodes. */ | |
481 | void | |
3dafb85c | 482 | symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list *entry) |
9088c1cc | 483 | { |
3dafb85c | 484 | cgraph_2node_hook_list **ptr = &m_first_cgraph_duplicated_hook; |
9088c1cc MJ |
485 | |
486 | while (*ptr != entry) | |
487 | ptr = &(*ptr)->next; | |
488 | *ptr = entry->next; | |
934cb78a | 489 | free (entry); |
9088c1cc MJ |
490 | } |
491 | ||
492 | /* Call all node duplication hooks. */ | |
b0d0a291 | 493 | void |
3dafb85c ML |
494 | symbol_table::call_cgraph_duplication_hooks (cgraph_node *node, |
495 | cgraph_node *node2) | |
9088c1cc | 496 | { |
3dafb85c | 497 | cgraph_2node_hook_list *entry = m_first_cgraph_duplicated_hook; |
9088c1cc MJ |
498 | while (entry) |
499 | { | |
3dafb85c | 500 | entry->hook (node, node2, entry->data); |
9088c1cc MJ |
501 | entry = entry->next; |
502 | } | |
503 | } | |
504 | ||
e72fcfe8 | 505 | /* Return cgraph node assigned to DECL. Create new one when needed. */ |
0550e7b7 | 506 | |
d52f5295 ML |
507 | cgraph_node * |
508 | cgraph_node::create (tree decl) | |
e72fcfe8 | 509 | { |
3dafb85c | 510 | cgraph_node *node = symtab->create_empty (); |
341c100f | 511 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
988d1653 | 512 | |
67348ccc | 513 | node->decl = decl; |
1f6be682 | 514 | |
41dbbb37 | 515 | if ((flag_openacc || flag_openmp) |
1f6be682 IV |
516 | && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl))) |
517 | { | |
518 | node->offloadable = 1; | |
844b0125 | 519 | #ifdef ENABLE_OFFLOADING |
1f6be682 | 520 | g->have_offload = true; |
844b0125 | 521 | #endif |
1f6be682 IV |
522 | } |
523 | ||
d52f5295 | 524 | node->register_symbol (); |
1ab24192 | 525 | |
5c2e00ee | 526 | if (DECL_CONTEXT (decl) && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL) |
e72fcfe8 | 527 | { |
d52f5295 | 528 | node->origin = cgraph_node::get_create (DECL_CONTEXT (decl)); |
e72fcfe8 JH |
529 | node->next_nested = node->origin->nested; |
530 | node->origin->nested = node; | |
531 | } | |
532 | return node; | |
533 | } | |
534 | ||
6f99e449 MJ |
535 | /* Try to find a call graph node for declaration DECL and if it does not exist |
536 | or if it corresponds to an inline clone, create a new one. */ | |
a358e188 | 537 | |
d52f5295 ML |
538 | cgraph_node * |
539 | cgraph_node::get_create (tree decl) | |
a358e188 | 540 | { |
3dafb85c | 541 | cgraph_node *first_clone = cgraph_node::get (decl); |
a358e188 | 542 | |
6f99e449 MJ |
543 | if (first_clone && !first_clone->global.inlined_to) |
544 | return first_clone; | |
a358e188 | 545 | |
3dafb85c | 546 | cgraph_node *node = cgraph_node::create (decl); |
6f99e449 MJ |
547 | if (first_clone) |
548 | { | |
549 | first_clone->clone_of = node; | |
550 | node->clones = first_clone; | |
3dafb85c | 551 | symtab->symtab_prevail_in_asm_name_hash (node); |
aede2c10 | 552 | node->decl->decl_with_vis.symtab_node = node; |
6f99e449 MJ |
553 | if (dump_file) |
554 | fprintf (dump_file, "Introduced new external node " | |
555 | "(%s/%i) and turned into root of the clone tree.\n", | |
2a72a953 | 556 | xstrdup_for_dump (node->name ()), node->order); |
6f99e449 MJ |
557 | } |
558 | else if (dump_file) | |
559 | fprintf (dump_file, "Introduced new external node " | |
2a72a953 | 560 | "(%s/%i).\n", xstrdup_for_dump (node->name ()), |
6f99e449 MJ |
561 | node->order); |
562 | return node; | |
a358e188 MJ |
563 | } |
564 | ||
87e7b310 | 565 | /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing |
073a8998 | 566 | the function body is associated with (not necessarily cgraph_node (DECL). */ |
b2583345 | 567 | |
d52f5295 ML |
568 | cgraph_node * |
569 | cgraph_node::create_alias (tree alias, tree target) | |
b2583345 | 570 | { |
d52f5295 | 571 | cgraph_node *alias_node; |
b2583345 | 572 | |
40a7fe1e JH |
573 | gcc_assert (TREE_CODE (target) == FUNCTION_DECL |
574 | || TREE_CODE (target) == IDENTIFIER_NODE); | |
b2583345 | 575 | gcc_assert (TREE_CODE (alias) == FUNCTION_DECL); |
d52f5295 | 576 | alias_node = cgraph_node::get_create (alias); |
67348ccc DM |
577 | gcc_assert (!alias_node->definition); |
578 | alias_node->alias_target = target; | |
579 | alias_node->definition = true; | |
580 | alias_node->alias = true; | |
08346abd | 581 | if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias)) != NULL) |
67348ccc | 582 | alias_node->weakref = true; |
6744a6ab JH |
583 | return alias_node; |
584 | } | |
585 | ||
051f8cc6 | 586 | /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful |
a358e188 | 587 | and NULL otherwise. |
6744a6ab | 588 | Same body aliases are output whenever the body of DECL is output, |
d52f5295 ML |
589 | and cgraph_node::get (ALIAS) transparently returns |
590 | cgraph_node::get (DECL). */ | |
6744a6ab | 591 | |
3dafb85c | 592 | cgraph_node * |
d52f5295 | 593 | cgraph_node::create_same_body_alias (tree alias, tree decl) |
6744a6ab | 594 | { |
3dafb85c | 595 | cgraph_node *n; |
6744a6ab JH |
596 | #ifndef ASM_OUTPUT_DEF |
597 | /* If aliases aren't supported by the assembler, fail. */ | |
051f8cc6 | 598 | return NULL; |
6744a6ab | 599 | #endif |
39e2db00 JH |
600 | /* Langhooks can create same body aliases of symbols not defined. |
601 | Those are useless. Drop them on the floor. */ | |
3dafb85c | 602 | if (symtab->global_info_ready) |
39e2db00 | 603 | return NULL; |
6744a6ab | 604 | |
d52f5295 | 605 | n = cgraph_node::create_alias (alias, decl); |
67348ccc | 606 | n->cpp_implicit_alias = true; |
3dafb85c | 607 | if (symtab->cpp_implicit_aliases_done) |
d52f5295 | 608 | n->resolve_alias (cgraph_node::get (decl)); |
39e2db00 | 609 | return n; |
6744a6ab JH |
610 | } |
611 | ||
051f8cc6 | 612 | /* Add thunk alias into callgraph. The alias declaration is ALIAS and it |
61502ca8 | 613 | aliases DECL with an adjustments made into the first parameter. |
051f8cc6 JH |
614 | See comments in thunk_adjust for detail on the parameters. */ |
615 | ||
3dafb85c | 616 | cgraph_node * |
d52f5295 ML |
617 | cgraph_node::create_thunk (tree alias, tree, bool this_adjusting, |
618 | HOST_WIDE_INT fixed_offset, | |
619 | HOST_WIDE_INT virtual_value, | |
620 | tree virtual_offset, | |
621 | tree real_alias) | |
6744a6ab | 622 | { |
3dafb85c | 623 | cgraph_node *node; |
6744a6ab | 624 | |
d52f5295 | 625 | node = cgraph_node::get (alias); |
6744a6ab | 626 | if (node) |
d52f5295 | 627 | node->reset (); |
24d047a3 | 628 | else |
d52f5295 | 629 | node = cgraph_node::create (alias); |
77a74ed7 | 630 | gcc_checking_assert (!virtual_offset |
807e902e | 631 | || wi::eq_p (virtual_offset, virtual_value)); |
6744a6ab JH |
632 | node->thunk.fixed_offset = fixed_offset; |
633 | node->thunk.this_adjusting = this_adjusting; | |
634 | node->thunk.virtual_value = virtual_value; | |
635 | node->thunk.virtual_offset_p = virtual_offset != NULL; | |
636 | node->thunk.alias = real_alias; | |
637 | node->thunk.thunk_p = true; | |
67348ccc | 638 | node->definition = true; |
c47d0034 | 639 | |
051f8cc6 | 640 | return node; |
b2583345 JJ |
641 | } |
642 | ||
bedb9fc0 RH |
643 | /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME. |
644 | Return NULL if there's no such node. */ | |
645 | ||
d52f5295 ML |
646 | cgraph_node * |
647 | cgraph_node::get_for_asmname (tree asmname) | |
bedb9fc0 | 648 | { |
1ab24192 | 649 | /* We do not want to look at inline clones. */ |
3dafb85c | 650 | for (symtab_node *node = symtab_node::get_for_asmname (asmname); |
5d59b5e1 | 651 | node; |
67348ccc | 652 | node = node->next_sharing_asm_name) |
5d59b5e1 | 653 | { |
7de90a6c | 654 | cgraph_node *cn = dyn_cast <cgraph_node *> (node); |
5d59b5e1 LC |
655 | if (cn && !cn->global.inlined_to) |
656 | return cn; | |
657 | } | |
bedb9fc0 RH |
658 | return NULL; |
659 | } | |
660 | ||
6bdf3519 | 661 | /* Returns a hash value for X (which really is a cgraph_edge). */ |
70d539ce | 662 | |
2a22f99c TS |
663 | hashval_t |
664 | cgraph_edge_hasher::hash (cgraph_edge *e) | |
70d539ce | 665 | { |
2a22f99c | 666 | return htab_hash_pointer (e->call_stmt); |
70d539ce JH |
667 | } |
668 | ||
6bdf3519 | 669 | /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */ |
70d539ce | 670 | |
2a22f99c TS |
671 | inline bool |
672 | cgraph_edge_hasher::equal (cgraph_edge *x, gimple y) | |
70d539ce | 673 | { |
2a22f99c | 674 | return x->call_stmt == y; |
70d539ce JH |
675 | } |
676 | ||
e33c6cd6 MJ |
677 | /* Add call graph edge E to call site hash of its caller. */ |
678 | ||
042ae7d2 | 679 | static inline void |
3dafb85c | 680 | cgraph_update_edge_in_call_site_hash (cgraph_edge *e) |
042ae7d2 | 681 | { |
2a22f99c TS |
682 | gimple call = e->call_stmt; |
683 | *e->caller->call_site_hash->find_slot_with_hash (call, | |
684 | htab_hash_pointer (call), | |
685 | INSERT) = e; | |
042ae7d2 JH |
686 | } |
687 | ||
688 | /* Add call graph edge E to call site hash of its caller. */ | |
689 | ||
e33c6cd6 | 690 | static inline void |
3dafb85c | 691 | cgraph_add_edge_to_call_site_hash (cgraph_edge *e) |
e33c6cd6 | 692 | { |
042ae7d2 JH |
693 | /* There are two speculative edges for every statement (one direct, |
694 | one indirect); always hash the direct one. */ | |
695 | if (e->speculative && e->indirect_unknown_callee) | |
696 | return; | |
2a22f99c TS |
697 | cgraph_edge **slot = e->caller->call_site_hash->find_slot_with_hash |
698 | (e->call_stmt, | |
699 | htab_hash_pointer (e->call_stmt), INSERT); | |
042ae7d2 JH |
700 | if (*slot) |
701 | { | |
3dafb85c | 702 | gcc_assert (((cgraph_edge *)*slot)->speculative); |
bfa3b50a JH |
703 | if (e->callee) |
704 | *slot = e; | |
042ae7d2 JH |
705 | return; |
706 | } | |
707 | gcc_assert (!*slot || e->speculative); | |
e33c6cd6 MJ |
708 | *slot = e; |
709 | } | |
726a989a RB |
710 | |
711 | /* Return the callgraph edge representing the GIMPLE_CALL statement | |
712 | CALL_STMT. */ | |
713 | ||
d52f5295 ML |
714 | cgraph_edge * |
715 | cgraph_node::get_edge (gimple call_stmt) | |
18c6ada9 | 716 | { |
3dafb85c | 717 | cgraph_edge *e, *e2; |
70d539ce JH |
718 | int n = 0; |
719 | ||
d52f5295 | 720 | if (call_site_hash) |
2a22f99c TS |
721 | return call_site_hash->find_with_hash (call_stmt, |
722 | htab_hash_pointer (call_stmt)); | |
18c6ada9 JH |
723 | |
724 | /* This loop may turn out to be performance problem. In such case adding | |
725 | hashtables into call nodes with very many edges is probably best | |
2b8a92de | 726 | solution. It is not good idea to add pointer into CALL_EXPR itself |
18c6ada9 JH |
727 | because we want to make possible having multiple cgraph nodes representing |
728 | different clones of the same body before the body is actually cloned. */ | |
d52f5295 | 729 | for (e = callees; e; e = e->next_callee) |
70d539ce JH |
730 | { |
731 | if (e->call_stmt == call_stmt) | |
732 | break; | |
733 | n++; | |
734 | } | |
726a989a | 735 | |
e33c6cd6 | 736 | if (!e) |
d52f5295 | 737 | for (e = indirect_calls; e; e = e->next_callee) |
e33c6cd6 MJ |
738 | { |
739 | if (e->call_stmt == call_stmt) | |
740 | break; | |
741 | n++; | |
742 | } | |
743 | ||
70d539ce JH |
744 | if (n > 100) |
745 | { | |
2a22f99c | 746 | call_site_hash = hash_table<cgraph_edge_hasher>::create_ggc (120); |
d52f5295 | 747 | for (e2 = callees; e2; e2 = e2->next_callee) |
e33c6cd6 | 748 | cgraph_add_edge_to_call_site_hash (e2); |
d52f5295 | 749 | for (e2 = indirect_calls; e2; e2 = e2->next_callee) |
e33c6cd6 | 750 | cgraph_add_edge_to_call_site_hash (e2); |
70d539ce | 751 | } |
726a989a | 752 | |
18c6ada9 JH |
753 | return e; |
754 | } | |
755 | ||
726a989a | 756 | |
3dafb85c | 757 | /* Change field call_stmt of edge to NEW_STMT. |
042ae7d2 JH |
758 | If UPDATE_SPECULATIVE and E is any component of speculative |
759 | edge, then update all components. */ | |
0550e7b7 | 760 | |
70d539ce | 761 | void |
538dd0b7 | 762 | cgraph_edge::set_call_stmt (gcall *new_stmt, bool update_speculative) |
70d539ce | 763 | { |
e33c6cd6 MJ |
764 | tree decl; |
765 | ||
042ae7d2 JH |
766 | /* Speculative edges has three component, update all of them |
767 | when asked to. */ | |
3dafb85c | 768 | if (update_speculative && speculative) |
042ae7d2 | 769 | { |
3dafb85c ML |
770 | cgraph_edge *direct, *indirect; |
771 | ipa_ref *ref; | |
042ae7d2 | 772 | |
3dafb85c ML |
773 | speculative_call_info (direct, indirect, ref); |
774 | direct->set_call_stmt (new_stmt, false); | |
775 | indirect->set_call_stmt (new_stmt, false); | |
042ae7d2 JH |
776 | ref->stmt = new_stmt; |
777 | return; | |
778 | } | |
779 | ||
780 | /* Only direct speculative edges go to call_site_hash. */ | |
3dafb85c ML |
781 | if (caller->call_site_hash |
782 | && (!speculative || !indirect_unknown_callee)) | |
70d539ce | 783 | { |
2a22f99c TS |
784 | caller->call_site_hash->remove_elt_with_hash |
785 | (call_stmt, htab_hash_pointer (call_stmt)); | |
70d539ce | 786 | } |
e33c6cd6 | 787 | |
3dafb85c ML |
788 | cgraph_edge *e = this; |
789 | ||
790 | call_stmt = new_stmt; | |
791 | if (indirect_unknown_callee | |
e33c6cd6 MJ |
792 | && (decl = gimple_call_fndecl (new_stmt))) |
793 | { | |
794 | /* Constant propagation (and possibly also inlining?) can turn an | |
795 | indirect call into a direct one. */ | |
3dafb85c | 796 | cgraph_node *new_callee = cgraph_node::get (decl); |
e33c6cd6 | 797 | |
a358e188 | 798 | gcc_checking_assert (new_callee); |
3dafb85c | 799 | e = make_direct (new_callee); |
e33c6cd6 MJ |
800 | } |
801 | ||
67348ccc | 802 | push_cfun (DECL_STRUCT_FUNCTION (e->caller->decl)); |
2505c5ed | 803 | e->can_throw_external = stmt_can_throw_external (new_stmt); |
b6fa5b01 | 804 | pop_cfun (); |
70d539ce | 805 | if (e->caller->call_site_hash) |
e33c6cd6 | 806 | cgraph_add_edge_to_call_site_hash (e); |
70d539ce JH |
807 | } |
808 | ||
e33c6cd6 MJ |
809 | /* Allocate a cgraph_edge structure and fill it with data according to the |
810 | parameters of which only CALLEE can be NULL (when creating an indirect call | |
811 | edge). */ | |
e72fcfe8 | 812 | |
d52f5295 | 813 | cgraph_edge * |
3dafb85c | 814 | symbol_table::create_edge (cgraph_node *caller, cgraph_node *callee, |
538dd0b7 DM |
815 | gcall *call_stmt, gcov_type count, int freq, |
816 | bool indir_unknown_callee) | |
e72fcfe8 | 817 | { |
d52f5295 | 818 | cgraph_edge *edge; |
18c6ada9 | 819 | |
d7f09764 DN |
820 | /* LTO does not actually have access to the call_stmt since these |
821 | have not been loaded yet. */ | |
822 | if (call_stmt) | |
823 | { | |
61502ca8 | 824 | /* This is a rather expensive check possibly triggering |
77a74ed7 | 825 | construction of call stmt hashtable. */ |
042ae7d2 | 826 | #ifdef ENABLE_CHECKING |
3dafb85c | 827 | cgraph_edge *e; |
d52f5295 ML |
828 | gcc_checking_assert ( |
829 | !(e = caller->get_edge (call_stmt)) || e->speculative); | |
042ae7d2 | 830 | #endif |
18c6ada9 | 831 | |
d7f09764 DN |
832 | gcc_assert (is_gimple_call (call_stmt)); |
833 | } | |
b58b1157 | 834 | |
934cb78a MJ |
835 | if (free_edges) |
836 | { | |
837 | edge = free_edges; | |
838 | free_edges = NEXT_FREE_EDGE (edge); | |
839 | } | |
840 | else | |
841 | { | |
3dafb85c ML |
842 | edge = ggc_alloc<cgraph_edge> (); |
843 | edge->uid = edges_max_uid++; | |
934cb78a MJ |
844 | } |
845 | ||
3dafb85c ML |
846 | edges_count++; |
847 | ||
18c6ada9 | 848 | edge->aux = NULL; |
e72fcfe8 JH |
849 | edge->caller = caller; |
850 | edge->callee = callee; | |
e33c6cd6 MJ |
851 | edge->prev_caller = NULL; |
852 | edge->next_caller = NULL; | |
853 | edge->prev_callee = NULL; | |
854 | edge->next_callee = NULL; | |
042ae7d2 | 855 | edge->lto_stmt_uid = 0; |
e33c6cd6 MJ |
856 | |
857 | edge->count = count; | |
858 | gcc_assert (count >= 0); | |
859 | edge->frequency = freq; | |
860 | gcc_assert (freq >= 0); | |
861 | gcc_assert (freq <= CGRAPH_FREQ_MAX); | |
e33c6cd6 | 862 | |
e0704a46 | 863 | edge->call_stmt = call_stmt; |
67348ccc | 864 | push_cfun (DECL_STRUCT_FUNCTION (caller->decl)); |
9f3f7d13 RG |
865 | edge->can_throw_external |
866 | = call_stmt ? stmt_can_throw_external (call_stmt) : false; | |
b6fa5b01 | 867 | pop_cfun (); |
89faf322 | 868 | if (call_stmt |
67348ccc DM |
869 | && callee && callee->decl |
870 | && !gimple_check_call_matching_types (call_stmt, callee->decl, | |
4de09b85 | 871 | false)) |
89faf322 RG |
872 | edge->call_stmt_cannot_inline_p = true; |
873 | else | |
874 | edge->call_stmt_cannot_inline_p = false; | |
e33c6cd6 MJ |
875 | |
876 | edge->indirect_info = NULL; | |
877 | edge->indirect_inlining_edge = 0; | |
5979aa54 | 878 | edge->speculative = false; |
51ce0547 | 879 | edge->indirect_unknown_callee = indir_unknown_callee; |
a6b1490d JH |
880 | if (opt_for_fn (edge->caller->decl, flag_devirtualize) |
881 | && call_stmt && DECL_STRUCT_FUNCTION (caller->decl)) | |
f9bb202b JH |
882 | edge->in_polymorphic_cdtor |
883 | = decl_maybe_in_construction_p (NULL, NULL, call_stmt, | |
884 | caller->decl); | |
885 | else | |
886 | edge->in_polymorphic_cdtor = caller->thunk.thunk_p; | |
188c7d00 JH |
887 | if (call_stmt && caller->call_site_hash) |
888 | cgraph_add_edge_to_call_site_hash (edge); | |
e33c6cd6 MJ |
889 | |
890 | return edge; | |
891 | } | |
892 | ||
d52f5295 | 893 | /* Create edge from a given function to CALLEE in the cgraph. */ |
e33c6cd6 | 894 | |
3dafb85c ML |
895 | cgraph_edge * |
896 | cgraph_node::create_edge (cgraph_node *callee, | |
538dd0b7 | 897 | gcall *call_stmt, gcov_type count, int freq) |
e33c6cd6 | 898 | { |
3dafb85c ML |
899 | cgraph_edge *edge = symtab->create_edge (this, callee, call_stmt, count, |
900 | freq, false); | |
e33c6cd6 | 901 | |
e33c6cd6 MJ |
902 | initialize_inline_failed (edge); |
903 | ||
e72fcfe8 | 904 | edge->next_caller = callee->callers; |
2563c224 RG |
905 | if (callee->callers) |
906 | callee->callers->prev_caller = edge; | |
d52f5295 ML |
907 | edge->next_callee = callees; |
908 | if (callees) | |
909 | callees->prev_callee = edge; | |
910 | callees = edge; | |
e72fcfe8 | 911 | callee->callers = edge; |
3dc9eaa6 | 912 | |
e33c6cd6 MJ |
913 | return edge; |
914 | } | |
915 | ||
ce47fda3 MJ |
916 | /* Allocate cgraph_indirect_call_info and set its fields to default values. */ |
917 | ||
3dafb85c | 918 | cgraph_indirect_call_info * |
ce47fda3 MJ |
919 | cgraph_allocate_init_indirect_info (void) |
920 | { | |
3dafb85c | 921 | cgraph_indirect_call_info *ii; |
ce47fda3 | 922 | |
766090c2 | 923 | ii = ggc_cleared_alloc<cgraph_indirect_call_info> (); |
ce47fda3 MJ |
924 | ii->param_index = -1; |
925 | return ii; | |
926 | } | |
e33c6cd6 MJ |
927 | |
928 | /* Create an indirect edge with a yet-undetermined callee where the call | |
929 | statement destination is a formal parameter of the caller with index | |
930 | PARAM_INDEX. */ | |
931 | ||
3dafb85c | 932 | cgraph_edge * |
538dd0b7 | 933 | cgraph_node::create_indirect_edge (gcall *call_stmt, int ecf_flags, |
d34af022 IE |
934 | gcov_type count, int freq, |
935 | bool compute_indirect_info) | |
e33c6cd6 | 936 | { |
3dafb85c ML |
937 | cgraph_edge *edge = symtab->create_edge (this, NULL, call_stmt, |
938 | count, freq, true); | |
1d5755ef | 939 | tree target; |
e33c6cd6 | 940 | |
3dc9eaa6 AN |
941 | initialize_inline_failed (edge); |
942 | ||
ce47fda3 | 943 | edge->indirect_info = cgraph_allocate_init_indirect_info (); |
5f902d76 | 944 | edge->indirect_info->ecf_flags = ecf_flags; |
0127c169 | 945 | edge->indirect_info->vptr_changed = true; |
e33c6cd6 | 946 | |
1d5755ef | 947 | /* Record polymorphic call info. */ |
d34af022 IE |
948 | if (compute_indirect_info |
949 | && call_stmt | |
1d5755ef JH |
950 | && (target = gimple_call_fn (call_stmt)) |
951 | && virtual_method_call_p (target)) | |
952 | { | |
6f8091fc | 953 | ipa_polymorphic_call_context context (decl, target, call_stmt); |
1d5755ef JH |
954 | |
955 | /* Only record types can have virtual calls. */ | |
68377e53 | 956 | edge->indirect_info->polymorphic = true; |
1d5755ef | 957 | edge->indirect_info->param_index = -1; |
6f8091fc JH |
958 | edge->indirect_info->otr_token |
959 | = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target)); | |
960 | edge->indirect_info->otr_type = obj_type_ref_class (target); | |
961 | gcc_assert (TREE_CODE (edge->indirect_info->otr_type) == RECORD_TYPE); | |
ba392339 | 962 | edge->indirect_info->context = context; |
1d5755ef JH |
963 | } |
964 | ||
d52f5295 ML |
965 | edge->next_callee = indirect_calls; |
966 | if (indirect_calls) | |
967 | indirect_calls->prev_callee = edge; | |
968 | indirect_calls = edge; | |
e33c6cd6 | 969 | |
e72fcfe8 JH |
970 | return edge; |
971 | } | |
972 | ||
3dafb85c | 973 | /* Remove the edge from the list of the callees of the caller. */ |
2563c224 | 974 | |
3dafb85c ML |
975 | void |
976 | cgraph_edge::remove_caller (void) | |
2563c224 | 977 | { |
3dafb85c ML |
978 | if (prev_callee) |
979 | prev_callee->next_callee = next_callee; | |
980 | if (next_callee) | |
981 | next_callee->prev_callee = prev_callee; | |
982 | if (!prev_callee) | |
e33c6cd6 | 983 | { |
3dafb85c ML |
984 | if (indirect_unknown_callee) |
985 | caller->indirect_calls = next_callee; | |
e33c6cd6 | 986 | else |
3dafb85c | 987 | caller->callees = next_callee; |
e33c6cd6 | 988 | } |
3dafb85c | 989 | if (caller->call_site_hash) |
2a22f99c TS |
990 | caller->call_site_hash->remove_elt_with_hash (call_stmt, |
991 | htab_hash_pointer (call_stmt)); | |
2563c224 RG |
992 | } |
993 | ||
934cb78a MJ |
994 | /* Put the edge onto the free list. */ |
995 | ||
3dafb85c ML |
996 | void |
997 | symbol_table::free_edge (cgraph_edge *e) | |
934cb78a MJ |
998 | { |
999 | int uid = e->uid; | |
1000 | ||
042ae7d2 JH |
1001 | if (e->indirect_info) |
1002 | ggc_free (e->indirect_info); | |
1003 | ||
934cb78a | 1004 | /* Clear out the edge so we do not dangle pointers. */ |
5c0466b5 | 1005 | memset (e, 0, sizeof (*e)); |
934cb78a MJ |
1006 | e->uid = uid; |
1007 | NEXT_FREE_EDGE (e) = free_edges; | |
1008 | free_edges = e; | |
3dafb85c | 1009 | edges_count--; |
934cb78a MJ |
1010 | } |
1011 | ||
3dafb85c | 1012 | /* Remove the edge in the cgraph. */ |
e72fcfe8 | 1013 | |
cb967da5 | 1014 | void |
3dafb85c | 1015 | cgraph_edge::remove (void) |
e72fcfe8 | 1016 | { |
934cb78a | 1017 | /* Call all edge removal hooks. */ |
3dafb85c | 1018 | symtab->call_edge_removal_hooks (this); |
934cb78a | 1019 | |
3dafb85c | 1020 | if (!indirect_unknown_callee) |
e33c6cd6 | 1021 | /* Remove from callers list of the callee. */ |
3dafb85c | 1022 | remove_callee (); |
2563c224 RG |
1023 | |
1024 | /* Remove from callees list of the callers. */ | |
3dafb85c | 1025 | remove_caller (); |
934cb78a MJ |
1026 | |
1027 | /* Put the edge onto the free list. */ | |
3dafb85c | 1028 | symtab->free_edge (this); |
e72fcfe8 JH |
1029 | } |
1030 | ||
3dafb85c | 1031 | /* Turn edge into speculative call calling N2. Update |
042ae7d2 JH |
1032 | the profile so the direct call is taken COUNT times |
1033 | with FREQUENCY. | |
1034 | ||
1035 | At clone materialization time, the indirect call E will | |
1036 | be expanded as: | |
1037 | ||
1038 | if (call_dest == N2) | |
1039 | n2 (); | |
1040 | else | |
1041 | call call_dest | |
1042 | ||
1043 | At this time the function just creates the direct call, | |
1044 | the referencd representing the if conditional and attaches | |
09ce3660 | 1045 | them all to the orginal indirect call statement. |
042ae7d2 | 1046 | |
09ce3660 JH |
1047 | Return direct edge created. */ |
1048 | ||
3dafb85c ML |
1049 | cgraph_edge * |
1050 | cgraph_edge::make_speculative (cgraph_node *n2, gcov_type direct_count, | |
1051 | int direct_frequency) | |
042ae7d2 | 1052 | { |
3dafb85c ML |
1053 | cgraph_node *n = caller; |
1054 | ipa_ref *ref = NULL; | |
1055 | cgraph_edge *e2; | |
042ae7d2 JH |
1056 | |
1057 | if (dump_file) | |
1058 | { | |
d5c3d3ef JH |
1059 | fprintf (dump_file, "Indirect call -> speculative call" |
1060 | " %s/%i => %s/%i\n", | |
2a72a953 DM |
1061 | xstrdup_for_dump (n->name ()), n->order, |
1062 | xstrdup_for_dump (n2->name ()), n2->order); | |
042ae7d2 | 1063 | } |
3dafb85c ML |
1064 | speculative = true; |
1065 | e2 = n->create_edge (n2, call_stmt, direct_count, direct_frequency); | |
042ae7d2 JH |
1066 | initialize_inline_failed (e2); |
1067 | e2->speculative = true; | |
67348ccc | 1068 | if (TREE_NOTHROW (n2->decl)) |
bfa3b50a JH |
1069 | e2->can_throw_external = false; |
1070 | else | |
3dafb85c ML |
1071 | e2->can_throw_external = can_throw_external; |
1072 | e2->lto_stmt_uid = lto_stmt_uid; | |
f9bb202b | 1073 | e2->in_polymorphic_cdtor = in_polymorphic_cdtor; |
3dafb85c ML |
1074 | count -= e2->count; |
1075 | frequency -= e2->frequency; | |
1076 | symtab->call_edge_duplication_hooks (this, e2); | |
1077 | ref = n->create_reference (n2, IPA_REF_ADDR, call_stmt); | |
1078 | ref->lto_stmt_uid = lto_stmt_uid; | |
1079 | ref->speculative = speculative; | |
d52f5295 | 1080 | n2->mark_address_taken (); |
09ce3660 | 1081 | return e2; |
042ae7d2 JH |
1082 | } |
1083 | ||
1084 | /* Speculative call consist of three components: | |
1085 | 1) an indirect edge representing the original call | |
1086 | 2) an direct edge representing the new call | |
1087 | 3) ADDR_EXPR reference representing the speculative check. | |
1088 | All three components are attached to single statement (the indirect | |
1089 | call) and if one of them exists, all of them must exist. | |
1090 | ||
3dafb85c | 1091 | Given speculative call edge, return all three components. |
042ae7d2 JH |
1092 | */ |
1093 | ||
1094 | void | |
3dafb85c ML |
1095 | cgraph_edge::speculative_call_info (cgraph_edge *&direct, |
1096 | cgraph_edge *&indirect, | |
1097 | ipa_ref *&reference) | |
042ae7d2 | 1098 | { |
3dafb85c | 1099 | ipa_ref *ref; |
042ae7d2 | 1100 | int i; |
3dafb85c ML |
1101 | cgraph_edge *e2; |
1102 | cgraph_edge *e = this; | |
042ae7d2 JH |
1103 | |
1104 | if (!e->indirect_unknown_callee) | |
1105 | for (e2 = e->caller->indirect_calls; | |
1106 | e2->call_stmt != e->call_stmt || e2->lto_stmt_uid != e->lto_stmt_uid; | |
1107 | e2 = e2->next_callee) | |
1108 | ; | |
1109 | else | |
1110 | { | |
1111 | e2 = e; | |
1112 | /* We can take advantage of the call stmt hash. */ | |
1113 | if (e2->call_stmt) | |
1114 | { | |
d52f5295 | 1115 | e = e->caller->get_edge (e2->call_stmt); |
09ce3660 | 1116 | gcc_assert (e->speculative && !e->indirect_unknown_callee); |
042ae7d2 JH |
1117 | } |
1118 | else | |
1119 | for (e = e->caller->callees; | |
d0b66480 JH |
1120 | e2->call_stmt != e->call_stmt |
1121 | || e2->lto_stmt_uid != e->lto_stmt_uid; | |
042ae7d2 JH |
1122 | e = e->next_callee) |
1123 | ; | |
1124 | } | |
1125 | gcc_assert (e->speculative && e2->speculative); | |
d0b66480 JH |
1126 | direct = e; |
1127 | indirect = e2; | |
042ae7d2 JH |
1128 | |
1129 | reference = NULL; | |
d122681a | 1130 | for (i = 0; e->caller->iterate_reference (i, ref); i++) |
042ae7d2 JH |
1131 | if (ref->speculative |
1132 | && ((ref->stmt && ref->stmt == e->call_stmt) | |
57292ce9 | 1133 | || (!ref->stmt && ref->lto_stmt_uid == e->lto_stmt_uid))) |
042ae7d2 JH |
1134 | { |
1135 | reference = ref; | |
1136 | break; | |
1137 | } | |
d0b66480 JH |
1138 | |
1139 | /* Speculative edge always consist of all three components - direct edge, | |
1140 | indirect and reference. */ | |
1141 | ||
1142 | gcc_assert (e && e2 && ref); | |
042ae7d2 JH |
1143 | } |
1144 | ||
3dafb85c | 1145 | /* Speculative call edge turned out to be direct call to CALLE_DECL. |
042ae7d2 JH |
1146 | Remove the speculative call sequence and return edge representing the call. |
1147 | It is up to caller to redirect the call as appropriate. */ | |
1148 | ||
3dafb85c ML |
1149 | cgraph_edge * |
1150 | cgraph_edge::resolve_speculation (tree callee_decl) | |
042ae7d2 | 1151 | { |
3dafb85c ML |
1152 | cgraph_edge *edge = this; |
1153 | cgraph_edge *e2; | |
1154 | ipa_ref *ref; | |
042ae7d2 JH |
1155 | |
1156 | gcc_assert (edge->speculative); | |
3dafb85c | 1157 | edge->speculative_call_info (e2, edge, ref); |
123485ca | 1158 | if (!callee_decl |
d52f5295 ML |
1159 | || !ref->referred->semantically_equivalent_p |
1160 | (symtab_node::get (callee_decl))) | |
042ae7d2 JH |
1161 | { |
1162 | if (dump_file) | |
1163 | { | |
09ce3660 JH |
1164 | if (callee_decl) |
1165 | { | |
1166 | fprintf (dump_file, "Speculative indirect call %s/%i => %s/%i has " | |
1167 | "turned out to have contradicting known target ", | |
2a72a953 DM |
1168 | xstrdup_for_dump (edge->caller->name ()), |
1169 | edge->caller->order, | |
1170 | xstrdup_for_dump (e2->callee->name ()), | |
1171 | e2->callee->order); | |
09ce3660 JH |
1172 | print_generic_expr (dump_file, callee_decl, 0); |
1173 | fprintf (dump_file, "\n"); | |
1174 | } | |
1175 | else | |
1176 | { | |
1177 | fprintf (dump_file, "Removing speculative call %s/%i => %s/%i\n", | |
2a72a953 DM |
1178 | xstrdup_for_dump (edge->caller->name ()), |
1179 | edge->caller->order, | |
1180 | xstrdup_for_dump (e2->callee->name ()), | |
1181 | e2->callee->order); | |
09ce3660 | 1182 | } |
042ae7d2 JH |
1183 | } |
1184 | } | |
1185 | else | |
1186 | { | |
3dafb85c | 1187 | cgraph_edge *tmp = edge; |
042ae7d2 JH |
1188 | if (dump_file) |
1189 | fprintf (dump_file, "Speculative call turned into direct call.\n"); | |
1190 | edge = e2; | |
1191 | e2 = tmp; | |
d0b66480 JH |
1192 | /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts |
1193 | in the functions inlined through it. */ | |
042ae7d2 JH |
1194 | } |
1195 | edge->count += e2->count; | |
1196 | edge->frequency += e2->frequency; | |
634ab819 JH |
1197 | if (edge->frequency > CGRAPH_FREQ_MAX) |
1198 | edge->frequency = CGRAPH_FREQ_MAX; | |
042ae7d2 JH |
1199 | edge->speculative = false; |
1200 | e2->speculative = false; | |
d122681a | 1201 | ref->remove_reference (); |
042ae7d2 | 1202 | if (e2->indirect_unknown_callee || e2->inline_failed) |
3dafb85c | 1203 | e2->remove (); |
042ae7d2 | 1204 | else |
d52f5295 | 1205 | e2->callee->remove_symbol_and_inline_clones (); |
042ae7d2 JH |
1206 | if (edge->caller->call_site_hash) |
1207 | cgraph_update_edge_in_call_site_hash (edge); | |
042ae7d2 JH |
1208 | return edge; |
1209 | } | |
1210 | ||
3dafb85c | 1211 | /* Make an indirect edge with an unknown callee an ordinary edge leading to |
ce47fda3 MJ |
1212 | CALLEE. DELTA is an integer constant that is to be added to the this |
1213 | pointer (first parameter) to compensate for skipping a thunk adjustment. */ | |
e33c6cd6 | 1214 | |
3dafb85c ML |
1215 | cgraph_edge * |
1216 | cgraph_edge::make_direct (cgraph_node *callee) | |
e33c6cd6 | 1217 | { |
3dafb85c ML |
1218 | cgraph_edge *edge = this; |
1219 | gcc_assert (indirect_unknown_callee); | |
042ae7d2 JH |
1220 | |
1221 | /* If we are redirecting speculative call, make it non-speculative. */ | |
3dafb85c | 1222 | if (indirect_unknown_callee && speculative) |
042ae7d2 | 1223 | { |
3dafb85c | 1224 | edge = edge->resolve_speculation (callee->decl); |
042ae7d2 JH |
1225 | |
1226 | /* On successful speculation just return the pre existing direct edge. */ | |
3dafb85c | 1227 | if (!indirect_unknown_callee) |
042ae7d2 JH |
1228 | return edge; |
1229 | } | |
1230 | ||
3dafb85c ML |
1231 | indirect_unknown_callee = 0; |
1232 | ggc_free (indirect_info); | |
1233 | indirect_info = NULL; | |
e33c6cd6 MJ |
1234 | |
1235 | /* Get the edge out of the indirect edge list. */ | |
3dafb85c ML |
1236 | if (prev_callee) |
1237 | prev_callee->next_callee = next_callee; | |
1238 | if (next_callee) | |
1239 | next_callee->prev_callee = prev_callee; | |
1240 | if (!prev_callee) | |
1241 | caller->indirect_calls = next_callee; | |
e33c6cd6 MJ |
1242 | |
1243 | /* Put it into the normal callee list */ | |
3dafb85c ML |
1244 | prev_callee = NULL; |
1245 | next_callee = caller->callees; | |
1246 | if (caller->callees) | |
1247 | caller->callees->prev_callee = edge; | |
1248 | caller->callees = edge; | |
e33c6cd6 MJ |
1249 | |
1250 | /* Insert to callers list of the new callee. */ | |
90988f77 | 1251 | edge->set_callee (callee); |
e33c6cd6 | 1252 | |
3dafb85c ML |
1253 | if (call_stmt) |
1254 | call_stmt_cannot_inline_p | |
1255 | = !gimple_check_call_matching_types (call_stmt, callee->decl, | |
4de09b85 | 1256 | false); |
f2906a8e | 1257 | |
e33c6cd6 MJ |
1258 | /* We need to re-determine the inlining status of the edge. */ |
1259 | initialize_inline_failed (edge); | |
042ae7d2 | 1260 | return edge; |
2563c224 RG |
1261 | } |
1262 | ||
66a20fc2 JH |
1263 | /* If necessary, change the function declaration in the call statement |
1264 | associated with E so that it corresponds to the edge callee. */ | |
1265 | ||
1266 | gimple | |
3dafb85c | 1267 | cgraph_edge::redirect_call_stmt_to_callee (void) |
66a20fc2 | 1268 | { |
3dafb85c ML |
1269 | cgraph_edge *e = this; |
1270 | ||
66a20fc2 | 1271 | tree decl = gimple_call_fndecl (e->call_stmt); |
23a04216 | 1272 | tree lhs = gimple_call_lhs (e->call_stmt); |
538dd0b7 | 1273 | gcall *new_stmt; |
66a20fc2 JH |
1274 | gimple_stmt_iterator gsi; |
1275 | #ifdef ENABLE_CHECKING | |
3dafb85c | 1276 | cgraph_node *node; |
66a20fc2 JH |
1277 | #endif |
1278 | ||
042ae7d2 JH |
1279 | if (e->speculative) |
1280 | { | |
3dafb85c | 1281 | cgraph_edge *e2; |
538dd0b7 | 1282 | gcall *new_stmt; |
3dafb85c | 1283 | ipa_ref *ref; |
042ae7d2 | 1284 | |
3dafb85c | 1285 | e->speculative_call_info (e, e2, ref); |
a21e735e JH |
1286 | /* If there already is an direct call (i.e. as a result of inliner's |
1287 | substitution), forget about speculating. */ | |
eefe9a99 | 1288 | if (decl) |
3dafb85c | 1289 | e = e->resolve_speculation (decl); |
a21e735e JH |
1290 | /* If types do not match, speculation was likely wrong. |
1291 | The direct edge was posisbly redirected to the clone with a different | |
1292 | signature. We did not update the call statement yet, so compare it | |
1293 | with the reference that still points to the proper type. */ | |
1294 | else if (!gimple_check_call_matching_types (e->call_stmt, | |
67348ccc | 1295 | ref->referred->decl, |
eefe9a99 | 1296 | true)) |
042ae7d2 JH |
1297 | { |
1298 | if (dump_file) | |
09ce3660 JH |
1299 | fprintf (dump_file, "Not expanding speculative call of %s/%i -> %s/%i\n" |
1300 | "Type mismatch.\n", | |
2a72a953 | 1301 | xstrdup_for_dump (e->caller->name ()), |
67348ccc | 1302 | e->caller->order, |
2a72a953 | 1303 | xstrdup_for_dump (e->callee->name ()), |
67348ccc | 1304 | e->callee->order); |
3dafb85c | 1305 | e = e->resolve_speculation (); |
a21e735e JH |
1306 | /* We are producing the final function body and will throw away the |
1307 | callgraph edges really soon. Reset the counts/frequencies to | |
1308 | keep verifier happy in the case of roundoff errors. */ | |
1309 | e->count = gimple_bb (e->call_stmt)->count; | |
1310 | e->frequency = compute_call_stmt_bb_frequency | |
67348ccc | 1311 | (e->caller->decl, gimple_bb (e->call_stmt)); |
09ce3660 | 1312 | } |
eefe9a99 | 1313 | /* Expand speculation into GIMPLE code. */ |
09ce3660 JH |
1314 | else |
1315 | { | |
1316 | if (dump_file) | |
a21e735e JH |
1317 | fprintf (dump_file, |
1318 | "Expanding speculative call of %s/%i -> %s/%i count:" | |
a9243bfc | 1319 | "%"PRId64"\n", |
2a72a953 | 1320 | xstrdup_for_dump (e->caller->name ()), |
67348ccc | 1321 | e->caller->order, |
2a72a953 | 1322 | xstrdup_for_dump (e->callee->name ()), |
67348ccc | 1323 | e->callee->order, |
a9243bfc | 1324 | (int64_t)e->count); |
042ae7d2 | 1325 | gcc_assert (e2->speculative); |
67348ccc | 1326 | push_cfun (DECL_STRUCT_FUNCTION (e->caller->decl)); |
0b986c6a JH |
1327 | new_stmt = gimple_ic (e->call_stmt, |
1328 | dyn_cast<cgraph_node *> (ref->referred), | |
042ae7d2 JH |
1329 | e->count || e2->count |
1330 | ? RDIV (e->count * REG_BR_PROB_BASE, | |
1331 | e->count + e2->count) | |
1332 | : e->frequency || e2->frequency | |
1333 | ? RDIV (e->frequency * REG_BR_PROB_BASE, | |
1334 | e->frequency + e2->frequency) | |
1335 | : REG_BR_PROB_BASE / 2, | |
1336 | e->count, e->count + e2->count); | |
1337 | e->speculative = false; | |
d52f5295 ML |
1338 | e->caller->set_call_stmt_including_clones (e->call_stmt, new_stmt, |
1339 | false); | |
d5e254e1 IE |
1340 | |
1341 | /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the | |
1342 | processed call stmt. */ | |
1343 | if (gimple_call_with_bounds_p (new_stmt) | |
1344 | && gimple_call_lhs (new_stmt) | |
1345 | && chkp_retbnd_call_by_val (gimple_call_lhs (e2->call_stmt))) | |
1346 | { | |
1347 | tree dresult = gimple_call_lhs (new_stmt); | |
1348 | tree iresult = gimple_call_lhs (e2->call_stmt); | |
538dd0b7 DM |
1349 | gcall *dbndret = chkp_retbnd_call_by_val (dresult); |
1350 | gcall *ibndret = chkp_retbnd_call_by_val (iresult); | |
d5e254e1 IE |
1351 | struct cgraph_edge *iedge |
1352 | = e2->caller->cgraph_node::get_edge (ibndret); | |
1353 | struct cgraph_edge *dedge; | |
1354 | ||
1355 | if (dbndret) | |
1356 | { | |
1357 | dedge = iedge->caller->create_edge (iedge->callee, | |
1358 | dbndret, e->count, | |
1359 | e->frequency); | |
1360 | dedge->frequency = compute_call_stmt_bb_frequency | |
1361 | (dedge->caller->decl, gimple_bb (dedge->call_stmt)); | |
1362 | } | |
1363 | iedge->frequency = compute_call_stmt_bb_frequency | |
1364 | (iedge->caller->decl, gimple_bb (iedge->call_stmt)); | |
1365 | } | |
1366 | ||
a21e735e | 1367 | e->frequency = compute_call_stmt_bb_frequency |
67348ccc | 1368 | (e->caller->decl, gimple_bb (e->call_stmt)); |
a21e735e | 1369 | e2->frequency = compute_call_stmt_bb_frequency |
67348ccc | 1370 | (e2->caller->decl, gimple_bb (e2->call_stmt)); |
042ae7d2 JH |
1371 | e2->speculative = false; |
1372 | ref->speculative = false; | |
1373 | ref->stmt = NULL; | |
1374 | /* Indirect edges are not both in the call site hash. | |
1375 | get it updated. */ | |
1376 | if (e->caller->call_site_hash) | |
1377 | cgraph_update_edge_in_call_site_hash (e2); | |
1378 | pop_cfun (); | |
1379 | /* Continue redirecting E to proper target. */ | |
1380 | } | |
1381 | } | |
1382 | ||
66a20fc2 | 1383 | if (e->indirect_unknown_callee |
67348ccc | 1384 | || decl == e->callee->decl) |
66a20fc2 JH |
1385 | return e->call_stmt; |
1386 | ||
1387 | #ifdef ENABLE_CHECKING | |
1388 | if (decl) | |
1389 | { | |
d52f5295 | 1390 | node = cgraph_node::get (decl); |
66a20fc2 JH |
1391 | gcc_assert (!node || !node->clone.combined_args_to_skip); |
1392 | } | |
1393 | #endif | |
1394 | ||
3dafb85c | 1395 | if (symtab->dump_file) |
66a20fc2 | 1396 | { |
3dafb85c | 1397 | fprintf (symtab->dump_file, "updating call of %s/%i -> %s/%i: ", |
2a72a953 DM |
1398 | xstrdup_for_dump (e->caller->name ()), e->caller->order, |
1399 | xstrdup_for_dump (e->callee->name ()), e->callee->order); | |
3dafb85c | 1400 | print_gimple_stmt (symtab->dump_file, e->call_stmt, 0, dump_flags); |
66a20fc2 JH |
1401 | if (e->callee->clone.combined_args_to_skip) |
1402 | { | |
3dafb85c ML |
1403 | fprintf (symtab->dump_file, " combined args to skip: "); |
1404 | dump_bitmap (symtab->dump_file, | |
66a20fc2 JH |
1405 | e->callee->clone.combined_args_to_skip); |
1406 | } | |
1407 | } | |
1408 | ||
1409 | if (e->callee->clone.combined_args_to_skip) | |
1410 | { | |
1411 | int lp_nr; | |
1412 | ||
1413 | new_stmt | |
1414 | = gimple_call_copy_skip_args (e->call_stmt, | |
1415 | e->callee->clone.combined_args_to_skip); | |
67348ccc | 1416 | gimple_call_set_fndecl (new_stmt, e->callee->decl); |
c52da5f7 | 1417 | gimple_call_set_fntype (new_stmt, gimple_call_fntype (e->call_stmt)); |
66a20fc2 JH |
1418 | |
1419 | if (gimple_vdef (new_stmt) | |
1420 | && TREE_CODE (gimple_vdef (new_stmt)) == SSA_NAME) | |
1421 | SSA_NAME_DEF_STMT (gimple_vdef (new_stmt)) = new_stmt; | |
1422 | ||
1423 | gsi = gsi_for_stmt (e->call_stmt); | |
1424 | gsi_replace (&gsi, new_stmt, false); | |
1425 | /* We need to defer cleaning EH info on the new statement to | |
1426 | fixup-cfg. We may not have dominator information at this point | |
1427 | and thus would end up with unreachable blocks and have no way | |
1428 | to communicate that we need to run CFG cleanup then. */ | |
1429 | lp_nr = lookup_stmt_eh_lp (e->call_stmt); | |
1430 | if (lp_nr != 0) | |
1431 | { | |
1432 | remove_stmt_from_eh_lp (e->call_stmt); | |
1433 | add_stmt_to_eh_lp (new_stmt, lp_nr); | |
1434 | } | |
1435 | } | |
1436 | else | |
1437 | { | |
1438 | new_stmt = e->call_stmt; | |
67348ccc | 1439 | gimple_call_set_fndecl (new_stmt, e->callee->decl); |
6a58ccca | 1440 | update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt); |
66a20fc2 JH |
1441 | } |
1442 | ||
23a04216 JH |
1443 | /* If the call becomes noreturn, remove the lhs. */ |
1444 | if (lhs && (gimple_call_flags (new_stmt) & ECF_NORETURN)) | |
1445 | { | |
1446 | if (TREE_CODE (lhs) == SSA_NAME) | |
1447 | { | |
45b62594 RB |
1448 | tree var = create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e->caller->decl), |
1449 | TREE_TYPE (lhs), NULL); | |
1450 | var = get_or_create_ssa_default_def | |
1451 | (DECL_STRUCT_FUNCTION (e->caller->decl), var); | |
1452 | gimple set_stmt = gimple_build_assign (lhs, var); | |
23a04216 | 1453 | gsi = gsi_for_stmt (new_stmt); |
45b62594 RB |
1454 | gsi_insert_before_without_update (&gsi, set_stmt, GSI_SAME_STMT); |
1455 | update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), set_stmt); | |
23a04216 JH |
1456 | } |
1457 | gimple_call_set_lhs (new_stmt, NULL_TREE); | |
1f91035f JH |
1458 | update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt); |
1459 | } | |
1460 | ||
1461 | /* If new callee has no static chain, remove it. */ | |
1462 | if (gimple_call_chain (new_stmt) && !DECL_STATIC_CHAIN (e->callee->decl)) | |
1463 | { | |
1464 | gimple_call_set_chain (new_stmt, NULL); | |
1465 | update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt); | |
23a04216 JH |
1466 | } |
1467 | ||
0b986c6a JH |
1468 | maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e->caller->decl), |
1469 | new_stmt); | |
1470 | ||
d52f5295 | 1471 | e->caller->set_call_stmt_including_clones (e->call_stmt, new_stmt, false); |
66a20fc2 | 1472 | |
3dafb85c | 1473 | if (symtab->dump_file) |
66a20fc2 | 1474 | { |
3dafb85c ML |
1475 | fprintf (symtab->dump_file, " updated to:"); |
1476 | print_gimple_stmt (symtab->dump_file, e->call_stmt, 0, dump_flags); | |
66a20fc2 JH |
1477 | } |
1478 | return new_stmt; | |
1479 | } | |
726a989a RB |
1480 | |
1481 | /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL | |
4b685e14 | 1482 | OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl |
a9d24544 JJ |
1483 | of OLD_STMT if it was previously call statement. |
1484 | If NEW_STMT is NULL, the call has been dropped without any | |
1485 | replacement. */ | |
2bafad93 | 1486 | |
9187e02d | 1487 | static void |
3dafb85c | 1488 | cgraph_update_edges_for_call_stmt_node (cgraph_node *node, |
a9d24544 JJ |
1489 | gimple old_stmt, tree old_call, |
1490 | gimple new_stmt) | |
2bafad93 | 1491 | { |
a9d24544 JJ |
1492 | tree new_call = (new_stmt && is_gimple_call (new_stmt)) |
1493 | ? gimple_call_fndecl (new_stmt) : 0; | |
2bafad93 | 1494 | |
4b685e14 JH |
1495 | /* We are seeing indirect calls, then there is nothing to update. */ |
1496 | if (!new_call && !old_call) | |
1497 | return; | |
1498 | /* See if we turned indirect call into direct call or folded call to one builtin | |
61502ca8 | 1499 | into different builtin. */ |
2bafad93 JJ |
1500 | if (old_call != new_call) |
1501 | { | |
3dafb85c ML |
1502 | cgraph_edge *e = node->get_edge (old_stmt); |
1503 | cgraph_edge *ne = NULL; | |
4b685e14 JH |
1504 | gcov_type count; |
1505 | int frequency; | |
2bafad93 JJ |
1506 | |
1507 | if (e) | |
1508 | { | |
e33c6cd6 MJ |
1509 | /* See if the edge is already there and has the correct callee. It |
1510 | might be so because of indirect inlining has already updated | |
97ba0040 JH |
1511 | it. We also might've cloned and redirected the edge. */ |
1512 | if (new_call && e->callee) | |
1513 | { | |
3dafb85c | 1514 | cgraph_node *callee = e->callee; |
97ba0040 JH |
1515 | while (callee) |
1516 | { | |
67348ccc | 1517 | if (callee->decl == new_call |
97ba0040 | 1518 | || callee->former_clone_of == new_call) |
eb14a79f | 1519 | { |
538dd0b7 | 1520 | e->set_call_stmt (as_a <gcall *> (new_stmt)); |
eb14a79f ML |
1521 | return; |
1522 | } | |
97ba0040 JH |
1523 | callee = callee->clone_of; |
1524 | } | |
1525 | } | |
4b685e14 JH |
1526 | |
1527 | /* Otherwise remove edge and create new one; we can't simply redirect | |
1528 | since function has changed, so inline plan and other information | |
1529 | attached to edge is invalid. */ | |
4b685e14 JH |
1530 | count = e->count; |
1531 | frequency = e->frequency; | |
2dbe8b70 | 1532 | if (e->indirect_unknown_callee || e->inline_failed) |
3dafb85c | 1533 | e->remove (); |
2dbe8b70 | 1534 | else |
d52f5295 | 1535 | e->callee->remove_symbol_and_inline_clones (); |
4b685e14 | 1536 | } |
a9d24544 | 1537 | else if (new_call) |
4b685e14 JH |
1538 | { |
1539 | /* We are seeing new direct call; compute profile info based on BB. */ | |
1540 | basic_block bb = gimple_bb (new_stmt); | |
1541 | count = bb->count; | |
1542 | frequency = compute_call_stmt_bb_frequency (current_function_decl, | |
1543 | bb); | |
2bafad93 | 1544 | } |
2bafad93 | 1545 | |
4b685e14 JH |
1546 | if (new_call) |
1547 | { | |
d52f5295 | 1548 | ne = node->create_edge (cgraph_node::get_create (new_call), |
538dd0b7 DM |
1549 | as_a <gcall *> (new_stmt), count, |
1550 | frequency); | |
4b685e14 JH |
1551 | gcc_assert (ne->inline_failed); |
1552 | } | |
2bafad93 | 1553 | } |
4b685e14 JH |
1554 | /* We only updated the call stmt; update pointer in cgraph edge.. */ |
1555 | else if (old_stmt != new_stmt) | |
538dd0b7 | 1556 | node->get_edge (old_stmt)->set_call_stmt (as_a <gcall *> (new_stmt)); |
2bafad93 JJ |
1557 | } |
1558 | ||
9187e02d | 1559 | /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL |
4b685e14 JH |
1560 | OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl |
1561 | of OLD_STMT before it was updated (updating can happen inplace). */ | |
9187e02d JH |
1562 | |
1563 | void | |
4b685e14 | 1564 | cgraph_update_edges_for_call_stmt (gimple old_stmt, tree old_decl, gimple new_stmt) |
9187e02d | 1565 | { |
3dafb85c ML |
1566 | cgraph_node *orig = cgraph_node::get (cfun->decl); |
1567 | cgraph_node *node; | |
9187e02d | 1568 | |
a358e188 | 1569 | gcc_checking_assert (orig); |
4b685e14 | 1570 | cgraph_update_edges_for_call_stmt_node (orig, old_stmt, old_decl, new_stmt); |
9187e02d JH |
1571 | if (orig->clones) |
1572 | for (node = orig->clones; node != orig;) | |
1573 | { | |
4b685e14 | 1574 | cgraph_update_edges_for_call_stmt_node (node, old_stmt, old_decl, new_stmt); |
9187e02d JH |
1575 | if (node->clones) |
1576 | node = node->clones; | |
1577 | else if (node->next_sibling_clone) | |
1578 | node = node->next_sibling_clone; | |
1579 | else | |
1580 | { | |
1581 | while (node != orig && !node->next_sibling_clone) | |
1582 | node = node->clone_of; | |
1583 | if (node != orig) | |
1584 | node = node->next_sibling_clone; | |
1585 | } | |
1586 | } | |
1587 | } | |
1588 | ||
726a989a | 1589 | |
2563c224 RG |
1590 | /* Remove all callees from the node. */ |
1591 | ||
1592 | void | |
d52f5295 | 1593 | cgraph_node::remove_callees (void) |
2563c224 | 1594 | { |
3dafb85c | 1595 | cgraph_edge *e, *f; |
2563c224 RG |
1596 | |
1597 | /* It is sufficient to remove the edges from the lists of callers of | |
1598 | the callees. The callee list of the node can be zapped with one | |
1599 | assignment. */ | |
d52f5295 | 1600 | for (e = callees; e; e = f) |
9088c1cc | 1601 | { |
5c0466b5 | 1602 | f = e->next_callee; |
3dafb85c | 1603 | symtab->call_edge_removal_hooks (e); |
e33c6cd6 | 1604 | if (!e->indirect_unknown_callee) |
3dafb85c ML |
1605 | e->remove_callee (); |
1606 | symtab->free_edge (e); | |
9088c1cc | 1607 | } |
d52f5295 | 1608 | for (e = indirect_calls; e; e = f) |
5f902d76 JH |
1609 | { |
1610 | f = e->next_callee; | |
3dafb85c | 1611 | symtab->call_edge_removal_hooks (e); |
5f902d76 | 1612 | if (!e->indirect_unknown_callee) |
3dafb85c ML |
1613 | e->remove_callee (); |
1614 | symtab->free_edge (e); | |
5f902d76 | 1615 | } |
d52f5295 ML |
1616 | indirect_calls = NULL; |
1617 | callees = NULL; | |
1618 | if (call_site_hash) | |
70d539ce | 1619 | { |
2a22f99c | 1620 | call_site_hash->empty (); |
d52f5295 | 1621 | call_site_hash = NULL; |
70d539ce | 1622 | } |
2563c224 RG |
1623 | } |
1624 | ||
1625 | /* Remove all callers from the node. */ | |
1626 | ||
d52f5295 ML |
1627 | void |
1628 | cgraph_node::remove_callers (void) | |
2563c224 | 1629 | { |
3dafb85c | 1630 | cgraph_edge *e, *f; |
2563c224 RG |
1631 | |
1632 | /* It is sufficient to remove the edges from the lists of callees of | |
1633 | the callers. The caller list of the node can be zapped with one | |
1634 | assignment. */ | |
d52f5295 | 1635 | for (e = callers; e; e = f) |
9088c1cc | 1636 | { |
5c0466b5 | 1637 | f = e->next_caller; |
3dafb85c ML |
1638 | symtab->call_edge_removal_hooks (e); |
1639 | e->remove_caller (); | |
1640 | symtab->free_edge (e); | |
9088c1cc | 1641 | } |
d52f5295 | 1642 | callers = NULL; |
18c6ada9 JH |
1643 | } |
1644 | ||
49bde175 JH |
1645 | /* Helper function for cgraph_release_function_body and free_lang_data. |
1646 | It releases body from function DECL without having to inspect its | |
1647 | possibly non-existent symtab node. */ | |
3a40c18a JH |
1648 | |
1649 | void | |
49bde175 | 1650 | release_function_body (tree decl) |
3a40c18a | 1651 | { |
49bde175 | 1652 | if (DECL_STRUCT_FUNCTION (decl)) |
3a40c18a | 1653 | { |
70486010 JH |
1654 | if (DECL_STRUCT_FUNCTION (decl)->cfg |
1655 | || DECL_STRUCT_FUNCTION (decl)->gimple_df) | |
936fc9ba | 1656 | { |
70486010 JH |
1657 | push_cfun (DECL_STRUCT_FUNCTION (decl)); |
1658 | if (cfun->cfg | |
1659 | && current_loops) | |
1660 | { | |
1661 | cfun->curr_properties &= ~PROP_loops; | |
1662 | loop_optimizer_finalize (); | |
1663 | } | |
1664 | if (cfun->gimple_df) | |
1665 | { | |
1666 | delete_tree_ssa (); | |
1667 | delete_tree_cfg_annotations (); | |
1668 | cfun->eh = NULL; | |
1669 | } | |
1670 | if (cfun->cfg) | |
1671 | { | |
1672 | gcc_assert (!dom_info_available_p (CDI_DOMINATORS)); | |
1673 | gcc_assert (!dom_info_available_p (CDI_POST_DOMINATORS)); | |
1674 | clear_edges (); | |
1675 | cfun->cfg = NULL; | |
1676 | } | |
1677 | if (cfun->value_histograms) | |
1678 | free_histograms (); | |
1679 | pop_cfun (); | |
936fc9ba | 1680 | } |
49bde175 | 1681 | gimple_set_body (decl, NULL); |
936fc9ba JH |
1682 | /* Struct function hangs a lot of data that would leak if we didn't |
1683 | removed all pointers to it. */ | |
49bde175 JH |
1684 | ggc_free (DECL_STRUCT_FUNCTION (decl)); |
1685 | DECL_STRUCT_FUNCTION (decl) = NULL; | |
1686 | } | |
1687 | DECL_SAVED_TREE (decl) = NULL; | |
1688 | } | |
1689 | ||
d52f5295 | 1690 | /* Release memory used to represent body of function. |
49bde175 JH |
1691 | Use this only for functions that are released before being translated to |
1692 | target code (i.e. RTL). Functions that are compiled to RTL and beyond | |
bf898b30 ML |
1693 | are free'd in final.c via free_after_compilation(). |
1694 | KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */ | |
49bde175 JH |
1695 | |
1696 | void | |
bf898b30 | 1697 | cgraph_node::release_body (bool keep_arguments) |
49bde175 | 1698 | { |
d52f5295 | 1699 | ipa_transforms_to_apply.release (); |
3dafb85c | 1700 | if (!used_as_abstract_origin && symtab->state != PARSING) |
49bde175 | 1701 | { |
d52f5295 | 1702 | DECL_RESULT (decl) = NULL; |
bf898b30 ML |
1703 | |
1704 | if (!keep_arguments) | |
1705 | DECL_ARGUMENTS (decl) = NULL; | |
3a40c18a | 1706 | } |
6b20f353 DS |
1707 | /* If the node is abstract and needed, then do not clear DECL_INITIAL |
1708 | of its associated function function declaration because it's | |
1709 | needed to emit debug info later. */ | |
d52f5295 ML |
1710 | if (!used_as_abstract_origin && DECL_INITIAL (decl)) |
1711 | DECL_INITIAL (decl) = error_mark_node; | |
1712 | release_function_body (decl); | |
1713 | if (lto_file_data) | |
1714 | lto_free_function_in_decl_state_for_node (this); | |
3a40c18a JH |
1715 | } |
1716 | ||
d52f5295 | 1717 | /* Remove function from symbol table. */ |
18d13f34 JH |
1718 | |
1719 | void | |
d52f5295 | 1720 | cgraph_node::remove (void) |
18d13f34 | 1721 | { |
3dafb85c | 1722 | cgraph_node *n; |
d52f5295 | 1723 | int uid = this->uid; |
18c6ada9 | 1724 | |
3dafb85c | 1725 | symtab->call_cgraph_removal_hooks (this); |
d52f5295 ML |
1726 | remove_callers (); |
1727 | remove_callees (); | |
1728 | ipa_transforms_to_apply.release (); | |
266ad5c8 | 1729 | |
96fc428c JH |
1730 | /* Incremental inlining access removed nodes stored in the postorder list. |
1731 | */ | |
d52f5295 ML |
1732 | force_output = false; |
1733 | forced_by_abi = false; | |
1734 | for (n = nested; n; n = n->next_nested) | |
ca30a539 | 1735 | n->origin = NULL; |
d52f5295 ML |
1736 | nested = NULL; |
1737 | if (origin) | |
18d13f34 | 1738 | { |
3dafb85c | 1739 | cgraph_node **node2 = &origin->nested; |
18d13f34 | 1740 | |
d52f5295 | 1741 | while (*node2 != this) |
18d13f34 | 1742 | node2 = &(*node2)->next_nested; |
d52f5295 | 1743 | *node2 = next_nested; |
18d13f34 | 1744 | } |
d52f5295 ML |
1745 | unregister (); |
1746 | if (prev_sibling_clone) | |
1747 | prev_sibling_clone->next_sibling_clone = next_sibling_clone; | |
1748 | else if (clone_of) | |
1749 | clone_of->clones = next_sibling_clone; | |
1750 | if (next_sibling_clone) | |
1751 | next_sibling_clone->prev_sibling_clone = prev_sibling_clone; | |
1752 | if (clones) | |
18c6ada9 | 1753 | { |
3dafb85c | 1754 | cgraph_node *n, *next; |
47cb0d7d | 1755 | |
d52f5295 | 1756 | if (clone_of) |
47cb0d7d | 1757 | { |
d52f5295 ML |
1758 | for (n = clones; n->next_sibling_clone; n = n->next_sibling_clone) |
1759 | n->clone_of = clone_of; | |
1760 | n->clone_of = clone_of; | |
1761 | n->next_sibling_clone = clone_of->clones; | |
1762 | if (clone_of->clones) | |
1763 | clone_of->clones->prev_sibling_clone = n; | |
1764 | clone_of->clones = clones; | |
47cb0d7d JH |
1765 | } |
1766 | else | |
1767 | { | |
66a20fc2 | 1768 | /* We are removing node with clones. This makes clones inconsistent, |
47cb0d7d JH |
1769 | but assume they will be removed subsequently and just keep clone |
1770 | tree intact. This can happen in unreachable function removal since | |
1771 | we remove unreachable functions in random order, not by bottom-up | |
1772 | walk of clone trees. */ | |
d52f5295 | 1773 | for (n = clones; n; n = next) |
47cb0d7d JH |
1774 | { |
1775 | next = n->next_sibling_clone; | |
1776 | n->next_sibling_clone = NULL; | |
1777 | n->prev_sibling_clone = NULL; | |
1778 | n->clone_of = NULL; | |
1779 | } | |
1780 | } | |
18c6ada9 JH |
1781 | } |
1782 | ||
c22cacf3 | 1783 | /* While all the clones are removed after being proceeded, the function |
4a76d91a JH |
1784 | itself is kept in the cgraph even after it is compiled. Check whether |
1785 | we are done with this body and reclaim it proactively if this is the case. | |
1786 | */ | |
3dafb85c | 1787 | if (symtab->state != LTO_STREAMING) |
4f63dfc6 | 1788 | { |
d52f5295 | 1789 | n = cgraph_node::get (decl); |
4f63dfc6 JH |
1790 | if (!n |
1791 | || (!n->clones && !n->clone_of && !n->global.inlined_to | |
3dafb85c | 1792 | && (symtab->global_info_ready |
67348ccc DM |
1793 | && (TREE_ASM_WRITTEN (n->decl) |
1794 | || DECL_EXTERNAL (n->decl) | |
1795 | || !n->analyzed | |
1796 | || (!flag_wpa && n->in_other_partition))))) | |
d52f5295 | 1797 | release_body (); |
4f63dfc6 | 1798 | } |
1ab24192 | 1799 | |
d52f5295 ML |
1800 | decl = NULL; |
1801 | if (call_site_hash) | |
70d539ce | 1802 | { |
2a22f99c | 1803 | call_site_hash->empty (); |
d52f5295 | 1804 | call_site_hash = NULL; |
70d539ce | 1805 | } |
2fb16412 | 1806 | |
d5e254e1 IE |
1807 | if (instrumented_version) |
1808 | { | |
1809 | instrumented_version->instrumented_version = NULL; | |
1810 | instrumented_version = NULL; | |
1811 | } | |
1812 | ||
3dafb85c | 1813 | symtab->release_symbol (this, uid); |
18d13f34 JH |
1814 | } |
1815 | ||
39ff5a96 JH |
1816 | /* Likewise indicate that a node is having address taken. */ |
1817 | ||
1818 | void | |
d52f5295 | 1819 | cgraph_node::mark_address_taken (void) |
39ff5a96 | 1820 | { |
4502fe8d MJ |
1821 | /* Indirect inlining can figure out that all uses of the address are |
1822 | inlined. */ | |
d52f5295 | 1823 | if (global.inlined_to) |
4502fe8d MJ |
1824 | { |
1825 | gcc_assert (cfun->after_inlining); | |
d52f5295 | 1826 | gcc_assert (callers->indirect_inlining_edge); |
4502fe8d MJ |
1827 | return; |
1828 | } | |
39e2db00 JH |
1829 | /* FIXME: address_taken flag is used both as a shortcut for testing whether |
1830 | IPA_REF_ADDR reference exists (and thus it should be set on node | |
1831 | representing alias we take address of) and as a test whether address | |
1832 | of the object was taken (and thus it should be set on node alias is | |
1833 | referring to). We should remove the first use and the remove the | |
1834 | following set. */ | |
d52f5295 ML |
1835 | address_taken = 1; |
1836 | cgraph_node *node = ultimate_alias_target (); | |
67348ccc | 1837 | node->address_taken = 1; |
39ff5a96 JH |
1838 | } |
1839 | ||
dafc5b82 JH |
1840 | /* Return local info for the compiled function. */ |
1841 | ||
3dafb85c ML |
1842 | cgraph_local_info * |
1843 | cgraph_node::local_info (tree decl) | |
dafc5b82 | 1844 | { |
341c100f | 1845 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
3dafb85c | 1846 | cgraph_node *node = get (decl); |
9f9ebcdf MJ |
1847 | if (!node) |
1848 | return NULL; | |
4bd019b8 | 1849 | return &node->ultimate_alias_target ()->local; |
dafc5b82 JH |
1850 | } |
1851 | ||
b255a036 JH |
1852 | /* Return local info for the compiled function. */ |
1853 | ||
3dafb85c ML |
1854 | cgraph_rtl_info * |
1855 | cgraph_node::rtl_info (tree decl) | |
b255a036 | 1856 | { |
341c100f | 1857 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
3dafb85c | 1858 | cgraph_node *node = get (decl); |
4bd019b8 JH |
1859 | if (!node) |
1860 | return NULL; | |
1861 | node = node->ultimate_alias_target (); | |
1862 | if (node->decl != current_function_decl | |
1863 | && !TREE_ASM_WRITTEN (node->decl)) | |
b255a036 | 1864 | return NULL; |
4bd019b8 | 1865 | return &node->ultimate_alias_target ()->rtl; |
b255a036 JH |
1866 | } |
1867 | ||
61a05df1 JH |
1868 | /* Return a string describing the failure REASON. */ |
1869 | ||
1870 | const char* | |
1871 | cgraph_inline_failed_string (cgraph_inline_failed_t reason) | |
1872 | { | |
1873 | #undef DEFCIFCODE | |
1cf11770 | 1874 | #define DEFCIFCODE(code, type, string) string, |
61a05df1 JH |
1875 | |
1876 | static const char *cif_string_table[CIF_N_REASONS] = { | |
1877 | #include "cif-code.def" | |
1878 | }; | |
1879 | ||
1880 | /* Signedness of an enum type is implementation defined, so cast it | |
1881 | to unsigned before testing. */ | |
1882 | gcc_assert ((unsigned) reason < CIF_N_REASONS); | |
1883 | return cif_string_table[reason]; | |
1884 | } | |
1885 | ||
1cf11770 L |
1886 | /* Return a type describing the failure REASON. */ |
1887 | ||
1888 | cgraph_inline_failed_type_t | |
1889 | cgraph_inline_failed_type (cgraph_inline_failed_t reason) | |
1890 | { | |
1891 | #undef DEFCIFCODE | |
1892 | #define DEFCIFCODE(code, type, string) type, | |
1893 | ||
1894 | static cgraph_inline_failed_type_t cif_type_table[CIF_N_REASONS] = { | |
1895 | #include "cif-code.def" | |
1896 | }; | |
1897 | ||
1898 | /* Signedness of an enum type is implementation defined, so cast it | |
1899 | to unsigned before testing. */ | |
1900 | gcc_assert ((unsigned) reason < CIF_N_REASONS); | |
1901 | return cif_type_table[reason]; | |
1902 | } | |
1903 | ||
6b02a499 | 1904 | /* Names used to print out the availability enum. */ |
8a4a83ed | 1905 | const char * const cgraph_availability_names[] = |
fa10beec | 1906 | {"unset", "not_available", "overwritable", "available", "local"}; |
6b02a499 | 1907 | |
90988f77 | 1908 | /* Output flags of edge to a file F. */ |
ba392339 | 1909 | |
90988f77 ML |
1910 | void |
1911 | cgraph_edge::dump_edge_flags (FILE *f) | |
ba392339 | 1912 | { |
90988f77 | 1913 | if (speculative) |
ba392339 | 1914 | fprintf (f, "(speculative) "); |
90988f77 | 1915 | if (!inline_failed) |
ba392339 | 1916 | fprintf (f, "(inlined) "); |
90988f77 | 1917 | if (indirect_inlining_edge) |
ba392339 | 1918 | fprintf (f, "(indirect_inlining) "); |
90988f77 ML |
1919 | if (count) |
1920 | fprintf (f, "(%"PRId64"x) ", (int64_t)count); | |
1921 | if (frequency) | |
1922 | fprintf (f, "(%.2f per call) ", frequency / (double)CGRAPH_FREQ_BASE); | |
1923 | if (can_throw_external) | |
ba392339 JH |
1924 | fprintf (f, "(can throw external) "); |
1925 | } | |
c4e622b6 | 1926 | |
d52f5295 | 1927 | /* Dump call graph node to file F. */ |
c4e622b6 | 1928 | |
18c6ada9 | 1929 | void |
d52f5295 | 1930 | cgraph_node::dump (FILE *f) |
18c6ada9 | 1931 | { |
3dafb85c | 1932 | cgraph_edge *edge; |
e33c6cd6 | 1933 | |
d52f5295 | 1934 | dump_base (f); |
8f940ee6 | 1935 | |
d52f5295 | 1936 | if (global.inlined_to) |
8f940ee6 | 1937 | fprintf (f, " Function %s/%i is inline copy in %s/%i\n", |
2a72a953 | 1938 | xstrdup_for_dump (name ()), |
d52f5295 | 1939 | order, |
2a72a953 | 1940 | xstrdup_for_dump (global.inlined_to->name ()), |
d52f5295 ML |
1941 | global.inlined_to->order); |
1942 | if (clone_of) | |
8f940ee6 | 1943 | fprintf (f, " Clone of %s/%i\n", |
d52f5295 ML |
1944 | clone_of->asm_name (), |
1945 | clone_of->order); | |
3dafb85c | 1946 | if (symtab->function_flags_ready) |
8f940ee6 | 1947 | fprintf (f, " Availability: %s\n", |
d52f5295 | 1948 | cgraph_availability_names [get_availability ()]); |
8f940ee6 | 1949 | |
d52f5295 | 1950 | if (profile_id) |
634ab819 | 1951 | fprintf (f, " Profile id: %i\n", |
d52f5295 ML |
1952 | profile_id); |
1953 | fprintf (f, " First run: %i\n", tp_first_run); | |
8f940ee6 | 1954 | fprintf (f, " Function flags:"); |
d52f5295 | 1955 | if (count) |
a9243bfc | 1956 | fprintf (f, " executed %"PRId64"x", |
d52f5295 ML |
1957 | (int64_t)count); |
1958 | if (origin) | |
1959 | fprintf (f, " nested in: %s", origin->asm_name ()); | |
1960 | if (gimple_has_body_p (decl)) | |
726a989a | 1961 | fprintf (f, " body"); |
d52f5295 | 1962 | if (process) |
257eb6e3 | 1963 | fprintf (f, " process"); |
d52f5295 | 1964 | if (local.local) |
18c6ada9 | 1965 | fprintf (f, " local"); |
d52f5295 | 1966 | if (local.redefined_extern_inline) |
e7d6beb0 | 1967 | fprintf (f, " redefined_extern_inline"); |
d52f5295 | 1968 | if (only_called_at_startup) |
844db5d0 | 1969 | fprintf (f, " only_called_at_startup"); |
d52f5295 | 1970 | if (only_called_at_exit) |
844db5d0 | 1971 | fprintf (f, " only_called_at_exit"); |
d52f5295 | 1972 | if (tm_clone) |
0a35513e | 1973 | fprintf (f, " tm_clone"); |
b84d4347 ML |
1974 | if (icf_merged) |
1975 | fprintf (f, " icf_merged"); | |
8413ca87 JJ |
1976 | if (nonfreeing_fn) |
1977 | fprintf (f, " nonfreeing_fn"); | |
d52f5295 ML |
1978 | if (DECL_STATIC_CONSTRUCTOR (decl)) |
1979 | fprintf (f," static_constructor (priority:%i)", get_init_priority ()); | |
1980 | if (DECL_STATIC_DESTRUCTOR (decl)) | |
1981 | fprintf (f," static_destructor (priority:%i)", get_fini_priority ()); | |
a89bd7d2 JH |
1982 | if (frequency == NODE_FREQUENCY_HOT) |
1983 | fprintf (f, " hot"); | |
1984 | if (frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED) | |
1985 | fprintf (f, " unlikely_executed"); | |
1986 | if (frequency == NODE_FREQUENCY_EXECUTED_ONCE) | |
1987 | fprintf (f, " executed_once"); | |
1988 | if (only_called_at_startup) | |
1989 | fprintf (f, " only_called_at_startup"); | |
1990 | if (only_called_at_exit) | |
1991 | fprintf (f, " only_called_at_exit"); | |
1992 | if (opt_for_fn (decl, optimize_size)) | |
1993 | fprintf (f, " optimize_size"); | |
18c6ada9 | 1994 | |
c47d0034 JH |
1995 | fprintf (f, "\n"); |
1996 | ||
d52f5295 | 1997 | if (thunk.thunk_p) |
c47d0034 | 1998 | { |
40a7fe1e | 1999 | fprintf (f, " Thunk"); |
d52f5295 | 2000 | if (thunk.alias) |
40a7fe1e | 2001 | fprintf (f, " of %s (asm: %s)", |
d52f5295 ML |
2002 | lang_hooks.decl_printable_name (thunk.alias, 2), |
2003 | IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk.alias))); | |
40a7fe1e | 2004 | fprintf (f, " fixed offset %i virtual value %i has " |
c47d0034 | 2005 | "virtual offset %i)\n", |
d52f5295 ML |
2006 | (int)thunk.fixed_offset, |
2007 | (int)thunk.virtual_value, | |
2008 | (int)thunk.virtual_offset_p); | |
c47d0034 | 2009 | } |
d52f5295 ML |
2010 | if (alias && thunk.alias |
2011 | && DECL_P (thunk.alias)) | |
39e2db00 | 2012 | { |
8f940ee6 | 2013 | fprintf (f, " Alias of %s", |
d52f5295 ML |
2014 | lang_hooks.decl_printable_name (thunk.alias, 2)); |
2015 | if (DECL_ASSEMBLER_NAME_SET_P (thunk.alias)) | |
39e2db00 | 2016 | fprintf (f, " (asm: %s)", |
d52f5295 | 2017 | IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk.alias))); |
39e2db00 JH |
2018 | fprintf (f, "\n"); |
2019 | } | |
c47d0034 | 2020 | |
8f940ee6 | 2021 | fprintf (f, " Called by: "); |
c47d0034 | 2022 | |
d52f5295 | 2023 | for (edge = callers; edge; edge = edge->next_caller) |
18c6ada9 | 2024 | { |
fec39fa6 | 2025 | fprintf (f, "%s/%i ", edge->caller->asm_name (), |
67348ccc | 2026 | edge->caller->order); |
90988f77 | 2027 | edge->dump_edge_flags (f); |
18c6ada9 JH |
2028 | } |
2029 | ||
8f940ee6 | 2030 | fprintf (f, "\n Calls: "); |
d52f5295 | 2031 | for (edge = callees; edge; edge = edge->next_callee) |
18c6ada9 | 2032 | { |
fec39fa6 | 2033 | fprintf (f, "%s/%i ", edge->callee->asm_name (), |
67348ccc | 2034 | edge->callee->order); |
90988f77 | 2035 | edge->dump_edge_flags (f); |
18c6ada9 JH |
2036 | } |
2037 | fprintf (f, "\n"); | |
6744a6ab | 2038 | |
d52f5295 | 2039 | for (edge = indirect_calls; edge; edge = edge->next_callee) |
ba392339 JH |
2040 | { |
2041 | if (edge->indirect_info->polymorphic) | |
2042 | { | |
2043 | fprintf (f, " Polymorphic indirect call of type "); | |
2044 | print_generic_expr (f, edge->indirect_info->otr_type, TDF_SLIM); | |
2045 | fprintf (f, " token:%i", (int) edge->indirect_info->otr_token); | |
2046 | } | |
2047 | else | |
2048 | fprintf (f, " Indirect call"); | |
90988f77 | 2049 | edge->dump_edge_flags (f); |
ba392339 JH |
2050 | if (edge->indirect_info->param_index != -1) |
2051 | { | |
2052 | fprintf (f, " of param:%i", edge->indirect_info->param_index); | |
2053 | if (edge->indirect_info->agg_contents) | |
2054 | fprintf (f, " loaded from %s %s at offset %i", | |
2055 | edge->indirect_info->member_ptr ? "member ptr" : "aggregate", | |
2056 | edge->indirect_info->by_ref ? "passed by reference":"", | |
2057 | (int)edge->indirect_info->offset); | |
0127c169 JH |
2058 | if (edge->indirect_info->vptr_changed) |
2059 | fprintf (f, " (vptr maybe changed)"); | |
ba392339 JH |
2060 | } |
2061 | fprintf (f, "\n"); | |
2062 | if (edge->indirect_info->polymorphic) | |
2063 | edge->indirect_info->context.dump (f); | |
2064 | } | |
d5e254e1 IE |
2065 | |
2066 | if (instrumentation_clone) | |
2067 | fprintf (f, " Is instrumented version.\n"); | |
2068 | else if (instrumented_version) | |
2069 | fprintf (f, " Has instrumented version.\n"); | |
18c6ada9 JH |
2070 | } |
2071 | ||
c4e622b6 DN |
2072 | /* Dump call graph node NODE to stderr. */ |
2073 | ||
24e47c76 | 2074 | DEBUG_FUNCTION void |
d52f5295 | 2075 | cgraph_node::debug (void) |
c4e622b6 | 2076 | { |
d52f5295 | 2077 | dump (stderr); |
c4e622b6 DN |
2078 | } |
2079 | ||
c4e622b6 | 2080 | /* Dump the callgraph to file F. */ |
e72fcfe8 JH |
2081 | |
2082 | void | |
d52f5295 | 2083 | cgraph_node::dump_cgraph (FILE *f) |
e72fcfe8 | 2084 | { |
3dafb85c | 2085 | cgraph_node *node; |
e72fcfe8 | 2086 | |
7d82fe7c | 2087 | fprintf (f, "callgraph:\n\n"); |
65c70e6b | 2088 | FOR_EACH_FUNCTION (node) |
d52f5295 | 2089 | node->dump (f); |
c4e622b6 DN |
2090 | } |
2091 | ||
1bb17c21 | 2092 | /* Return true when the DECL can possibly be inlined. */ |
d52f5295 | 2093 | |
1bb17c21 JH |
2094 | bool |
2095 | cgraph_function_possibly_inlined_p (tree decl) | |
2096 | { | |
3dafb85c | 2097 | if (!symtab->global_info_ready) |
e90acd93 | 2098 | return !DECL_UNINLINABLE (decl); |
6f312d18 | 2099 | return DECL_POSSIBLY_INLINED (decl); |
18c6ada9 JH |
2100 | } |
2101 | ||
d52f5295 | 2102 | /* cgraph_node is no longer nested function; update cgraph accordingly. */ |
8f235343 | 2103 | void |
d52f5295 | 2104 | cgraph_node::unnest (void) |
8f235343 | 2105 | { |
3dafb85c | 2106 | cgraph_node **node2 = &origin->nested; |
d52f5295 | 2107 | gcc_assert (origin); |
8f235343 | 2108 | |
d52f5295 | 2109 | while (*node2 != this) |
8f235343 | 2110 | node2 = &(*node2)->next_nested; |
d52f5295 ML |
2111 | *node2 = next_nested; |
2112 | origin = NULL; | |
8f235343 | 2113 | } |
6b02a499 JH |
2114 | |
2115 | /* Return function availability. See cgraph.h for description of individual | |
2116 | return values. */ | |
2117 | enum availability | |
d52f5295 | 2118 | cgraph_node::get_availability (void) |
6b02a499 JH |
2119 | { |
2120 | enum availability avail; | |
d52f5295 | 2121 | if (!analyzed) |
6b02a499 | 2122 | avail = AVAIL_NOT_AVAILABLE; |
d52f5295 | 2123 | else if (local.local) |
6b02a499 | 2124 | avail = AVAIL_LOCAL; |
d52f5295 ML |
2125 | else if (alias && weakref) |
2126 | ultimate_alias_target (&avail); | |
2127 | else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl))) | |
2128 | avail = AVAIL_INTERPOSABLE; | |
2129 | else if (!externally_visible) | |
6b02a499 | 2130 | avail = AVAIL_AVAILABLE; |
61502ca8 NF |
2131 | /* Inline functions are safe to be analyzed even if their symbol can |
2132 | be overwritten at runtime. It is not meaningful to enforce any sane | |
4a371c8d | 2133 | behaviour on replacing inline function by different body. */ |
d52f5295 | 2134 | else if (DECL_DECLARED_INLINE_P (decl)) |
4a371c8d | 2135 | avail = AVAIL_AVAILABLE; |
6b02a499 JH |
2136 | |
2137 | /* If the function can be overwritten, return OVERWRITABLE. Take | |
2138 | care at least of two notable extensions - the COMDAT functions | |
2139 | used to share template instantiations in C++ (this is symmetric | |
2140 | to code cp_cannot_inline_tree_fn and probably shall be shared and | |
ff5c4582 | 2141 | the inlinability hooks completely eliminated). |
6b02a499 JH |
2142 | |
2143 | ??? Does the C++ one definition rule allow us to always return | |
2144 | AVAIL_AVAILABLE here? That would be good reason to preserve this | |
4a371c8d JH |
2145 | bit. */ |
2146 | ||
d52f5295 ML |
2147 | else if (decl_replaceable_p (decl) && !DECL_EXTERNAL (decl)) |
2148 | avail = AVAIL_INTERPOSABLE; | |
6b02a499 JH |
2149 | else avail = AVAIL_AVAILABLE; |
2150 | ||
2151 | return avail; | |
2152 | } | |
2153 | ||
be330ed4 JH |
2154 | /* Worker for cgraph_node_can_be_local_p. */ |
2155 | static bool | |
3dafb85c | 2156 | cgraph_node_cannot_be_local_p_1 (cgraph_node *node, void *) |
be330ed4 | 2157 | { |
67348ccc DM |
2158 | return !(!node->force_output |
2159 | && ((DECL_COMDAT (node->decl) | |
2160 | && !node->forced_by_abi | |
d52f5295 | 2161 | && !node->used_from_object_file_p () |
67348ccc DM |
2162 | && !node->same_comdat_group) |
2163 | || !node->externally_visible)); | |
be330ed4 JH |
2164 | } |
2165 | ||
d52f5295 | 2166 | /* Return true if cgraph_node can be made local for API change. |
a550d677 MJ |
2167 | Extern inline functions and C++ COMDAT functions can be made local |
2168 | at the expense of possible code size growth if function is used in multiple | |
2169 | compilation units. */ | |
2170 | bool | |
d52f5295 | 2171 | cgraph_node::can_be_local_p (void) |
a550d677 | 2172 | { |
d52f5295 ML |
2173 | return (!address_taken |
2174 | && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1, | |
2175 | NULL, true)); | |
a550d677 MJ |
2176 | } |
2177 | ||
6cbde2e3 | 2178 | /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node. |
be330ed4 | 2179 | When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are |
6cbde2e3 BE |
2180 | skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are |
2181 | skipped. */ | |
be330ed4 | 2182 | bool |
d52f5295 ML |
2183 | cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback) |
2184 | (cgraph_node *, void *), | |
2185 | void *data, | |
6cbde2e3 BE |
2186 | bool include_overwritable, |
2187 | bool exclude_virtual_thunks) | |
be330ed4 | 2188 | { |
3dafb85c ML |
2189 | cgraph_edge *e; |
2190 | ipa_ref *ref; | |
be330ed4 | 2191 | |
d52f5295 | 2192 | if (callback (this, data)) |
be330ed4 | 2193 | return true; |
1ede94c5 JH |
2194 | FOR_EACH_ALIAS (this, ref) |
2195 | { | |
2196 | cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); | |
2197 | if (include_overwritable | |
2198 | || alias->get_availability () > AVAIL_INTERPOSABLE) | |
2199 | if (alias->call_for_symbol_thunks_and_aliases (callback, data, | |
2200 | include_overwritable, | |
2201 | exclude_virtual_thunks)) | |
2202 | return true; | |
2203 | } | |
d52f5295 | 2204 | for (e = callers; e; e = e->next_caller) |
be330ed4 JH |
2205 | if (e->caller->thunk.thunk_p |
2206 | && (include_overwritable | |
6cbde2e3 BE |
2207 | || e->caller->get_availability () > AVAIL_INTERPOSABLE) |
2208 | && !(exclude_virtual_thunks | |
2209 | && e->caller->thunk.virtual_offset_p)) | |
d52f5295 | 2210 | if (e->caller->call_for_symbol_thunks_and_aliases (callback, data, |
6cbde2e3 BE |
2211 | include_overwritable, |
2212 | exclude_virtual_thunks)) | |
9aa3f5c5 | 2213 | return true; |
e55637b7 | 2214 | |
be330ed4 JH |
2215 | return false; |
2216 | } | |
2217 | ||
be330ed4 JH |
2218 | /* Worker to bring NODE local. */ |
2219 | ||
d52f5295 | 2220 | bool |
3dafb85c | 2221 | cgraph_node::make_local (cgraph_node *node, void *) |
be330ed4 | 2222 | { |
d52f5295 | 2223 | gcc_checking_assert (node->can_be_local_p ()); |
67348ccc | 2224 | if (DECL_COMDAT (node->decl) || DECL_EXTERNAL (node->decl)) |
a550d677 | 2225 | { |
d52f5295 | 2226 | node->make_decl_local (); |
da66d596 | 2227 | node->set_section (NULL); |
24d047a3 | 2228 | node->set_comdat_group (NULL); |
67348ccc DM |
2229 | node->externally_visible = false; |
2230 | node->forced_by_abi = false; | |
a550d677 | 2231 | node->local.local = true; |
da66d596 | 2232 | node->set_section (NULL); |
67348ccc | 2233 | node->unique_name = (node->resolution == LDPR_PREVAILING_DEF_IRONLY |
da66d596 | 2234 | || node->resolution == LDPR_PREVAILING_DEF_IRONLY_EXP); |
67348ccc | 2235 | node->resolution = LDPR_PREVAILING_DEF_IRONLY; |
d52f5295 | 2236 | gcc_assert (node->get_availability () == AVAIL_LOCAL); |
a550d677 | 2237 | } |
be330ed4 | 2238 | return false; |
a550d677 MJ |
2239 | } |
2240 | ||
d52f5295 | 2241 | /* Bring cgraph node local. */ |
be330ed4 JH |
2242 | |
2243 | void | |
d52f5295 | 2244 | cgraph_node::make_local (void) |
be330ed4 | 2245 | { |
d52f5295 | 2246 | call_for_symbol_thunks_and_aliases (cgraph_node::make_local, NULL, true); |
be330ed4 JH |
2247 | } |
2248 | ||
2249 | /* Worker to set nothrow flag. */ | |
2250 | ||
2251 | static bool | |
3dafb85c | 2252 | cgraph_set_nothrow_flag_1 (cgraph_node *node, void *data) |
be330ed4 | 2253 | { |
3dafb85c | 2254 | cgraph_edge *e; |
71fb4f92 | 2255 | |
67348ccc | 2256 | TREE_NOTHROW (node->decl) = data != NULL; |
71fb4f92 JH |
2257 | |
2258 | if (data != NULL) | |
2259 | for (e = node->callers; e; e = e->next_caller) | |
2260 | e->can_throw_external = false; | |
be330ed4 JH |
2261 | return false; |
2262 | } | |
2263 | ||
2264 | /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE | |
20cdc2be JJ |
2265 | if any to NOTHROW. */ |
2266 | ||
2267 | void | |
d52f5295 | 2268 | cgraph_node::set_nothrow_flag (bool nothrow) |
20cdc2be | 2269 | { |
d52f5295 ML |
2270 | call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1, |
2271 | (void *)(size_t)nothrow, false); | |
20cdc2be JJ |
2272 | } |
2273 | ||
be330ed4 | 2274 | /* Worker to set const flag. */ |
20cdc2be | 2275 | |
be330ed4 | 2276 | static bool |
3dafb85c | 2277 | cgraph_set_const_flag_1 (cgraph_node *node, void *data) |
20cdc2be | 2278 | { |
530f3a1b JH |
2279 | /* Static constructors and destructors without a side effect can be |
2280 | optimized out. */ | |
be330ed4 | 2281 | if (data && !((size_t)data & 2)) |
530f3a1b | 2282 | { |
67348ccc DM |
2283 | if (DECL_STATIC_CONSTRUCTOR (node->decl)) |
2284 | DECL_STATIC_CONSTRUCTOR (node->decl) = 0; | |
2285 | if (DECL_STATIC_DESTRUCTOR (node->decl)) | |
2286 | DECL_STATIC_DESTRUCTOR (node->decl) = 0; | |
530f3a1b | 2287 | } |
67348ccc DM |
2288 | TREE_READONLY (node->decl) = data != NULL; |
2289 | DECL_LOOPING_CONST_OR_PURE_P (node->decl) = ((size_t)data & 2) != 0; | |
be330ed4 | 2290 | return false; |
20cdc2be JJ |
2291 | } |
2292 | ||
d52f5295 | 2293 | /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node |
be330ed4 | 2294 | if any to READONLY. */ |
20cdc2be JJ |
2295 | |
2296 | void | |
d52f5295 | 2297 | cgraph_node::set_const_flag (bool readonly, bool looping) |
20cdc2be | 2298 | { |
d52f5295 ML |
2299 | call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1, |
2300 | (void *)(size_t)(readonly + (int)looping * 2), | |
6cbde2e3 | 2301 | false, true); |
be330ed4 JH |
2302 | } |
2303 | ||
2304 | /* Worker to set pure flag. */ | |
2305 | ||
2306 | static bool | |
3dafb85c | 2307 | cgraph_set_pure_flag_1 (cgraph_node *node, void *data) |
be330ed4 | 2308 | { |
a1ffba98 | 2309 | /* Static constructors and destructors without a side effect can be |
530f3a1b | 2310 | optimized out. */ |
be330ed4 | 2311 | if (data && !((size_t)data & 2)) |
530f3a1b | 2312 | { |
67348ccc DM |
2313 | if (DECL_STATIC_CONSTRUCTOR (node->decl)) |
2314 | DECL_STATIC_CONSTRUCTOR (node->decl) = 0; | |
2315 | if (DECL_STATIC_DESTRUCTOR (node->decl)) | |
2316 | DECL_STATIC_DESTRUCTOR (node->decl) = 0; | |
530f3a1b | 2317 | } |
67348ccc DM |
2318 | DECL_PURE_P (node->decl) = data != NULL; |
2319 | DECL_LOOPING_CONST_OR_PURE_P (node->decl) = ((size_t)data & 2) != 0; | |
be330ed4 | 2320 | return false; |
20cdc2be JJ |
2321 | } |
2322 | ||
d52f5295 | 2323 | /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node |
be330ed4 JH |
2324 | if any to PURE. */ |
2325 | ||
2326 | void | |
d52f5295 | 2327 | cgraph_node::set_pure_flag (bool pure, bool looping) |
fa5f5e27 | 2328 | { |
d52f5295 ML |
2329 | call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1, |
2330 | (void *)(size_t)(pure + (int)looping * 2), | |
6cbde2e3 | 2331 | false, true); |
be330ed4 | 2332 | } |
844db5d0 | 2333 | |
d52f5295 | 2334 | /* Return true when cgraph_node can not return or throw and thus |
d56026c2 JH |
2335 | it is safe to ignore its side effects for IPA analysis. */ |
2336 | ||
2337 | bool | |
d52f5295 | 2338 | cgraph_node::cannot_return_p (void) |
d56026c2 | 2339 | { |
d52f5295 | 2340 | int flags = flags_from_decl_or_type (decl); |
a6b1490d | 2341 | if (!opt_for_fn (decl, flag_exceptions)) |
d56026c2 JH |
2342 | return (flags & ECF_NORETURN) != 0; |
2343 | else | |
2344 | return ((flags & (ECF_NORETURN | ECF_NOTHROW)) | |
2345 | == (ECF_NORETURN | ECF_NOTHROW)); | |
2346 | } | |
2347 | ||
3dafb85c | 2348 | /* Return true when call of edge can not lead to return from caller |
d56026c2 JH |
2349 | and thus it is safe to ignore its side effects for IPA analysis |
2350 | when computing side effects of the caller. | |
2351 | FIXME: We could actually mark all edges that have no reaching | |
6626665f | 2352 | patch to the exit block or throw to get better results. */ |
d56026c2 | 2353 | bool |
3dafb85c | 2354 | cgraph_edge::cannot_lead_to_return_p (void) |
d56026c2 | 2355 | { |
3dafb85c | 2356 | if (caller->cannot_return_p ()) |
f10ea640 | 2357 | return true; |
3dafb85c | 2358 | if (indirect_unknown_callee) |
d56026c2 | 2359 | { |
3dafb85c | 2360 | int flags = indirect_info->ecf_flags; |
a6b1490d | 2361 | if (!opt_for_fn (caller->decl, flag_exceptions)) |
d56026c2 JH |
2362 | return (flags & ECF_NORETURN) != 0; |
2363 | else | |
2364 | return ((flags & (ECF_NORETURN | ECF_NOTHROW)) | |
2365 | == (ECF_NORETURN | ECF_NOTHROW)); | |
2366 | } | |
2367 | else | |
3dafb85c | 2368 | return callee->cannot_return_p (); |
d56026c2 JH |
2369 | } |
2370 | ||
893479de AM |
2371 | /* Return true if the call can be hot. */ |
2372 | ||
2373 | bool | |
2374 | cgraph_edge::maybe_hot_p (void) | |
2375 | { | |
a6b1490d JH |
2376 | /* TODO: Export profile_status from cfun->cfg to cgraph_node. */ |
2377 | if (profile_info | |
2378 | && opt_for_fn (caller->decl, flag_branch_probabilities) | |
893479de AM |
2379 | && !maybe_hot_count_p (NULL, count)) |
2380 | return false; | |
2381 | if (caller->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED | |
2382 | || (callee | |
2383 | && callee->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED)) | |
2384 | return false; | |
2385 | if (caller->frequency > NODE_FREQUENCY_UNLIKELY_EXECUTED | |
2386 | && (callee | |
2387 | && callee->frequency <= NODE_FREQUENCY_EXECUTED_ONCE)) | |
2388 | return false; | |
a6b1490d JH |
2389 | if (opt_for_fn (caller->decl, optimize_size)) |
2390 | return false; | |
893479de AM |
2391 | if (caller->frequency == NODE_FREQUENCY_HOT) |
2392 | return true; | |
2393 | if (caller->frequency == NODE_FREQUENCY_EXECUTED_ONCE | |
2394 | && frequency < CGRAPH_FREQ_BASE * 3 / 2) | |
2395 | return false; | |
a6b1490d | 2396 | if (opt_for_fn (caller->decl, flag_guess_branch_prob)) |
893479de AM |
2397 | { |
2398 | if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION) == 0 | |
2399 | || frequency <= (CGRAPH_FREQ_BASE | |
a6b1490d | 2400 | / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION))) |
893479de AM |
2401 | return false; |
2402 | } | |
2403 | return true; | |
2404 | } | |
2405 | ||
9aa3f5c5 JH |
2406 | /* Worker for cgraph_can_remove_if_no_direct_calls_p. */ |
2407 | ||
2408 | static bool | |
3dafb85c | 2409 | nonremovable_p (cgraph_node *node, void *) |
9aa3f5c5 | 2410 | { |
d52f5295 | 2411 | return !node->can_remove_if_no_direct_calls_and_refs_p (); |
9aa3f5c5 JH |
2412 | } |
2413 | ||
d52f5295 ML |
2414 | /* Return true when function cgraph_node and its aliases can be removed from |
2415 | callgraph if all direct calls are eliminated. */ | |
9aa3f5c5 JH |
2416 | |
2417 | bool | |
d52f5295 | 2418 | cgraph_node::can_remove_if_no_direct_calls_p (void) |
9aa3f5c5 JH |
2419 | { |
2420 | /* Extern inlines can always go, we will use the external definition. */ | |
d52f5295 | 2421 | if (DECL_EXTERNAL (decl)) |
9aa3f5c5 | 2422 | return true; |
d52f5295 | 2423 | if (address_taken) |
9aa3f5c5 | 2424 | return false; |
d52f5295 | 2425 | return !call_for_symbol_and_aliases (nonremovable_p, NULL, true); |
9aa3f5c5 JH |
2426 | } |
2427 | ||
d52f5295 | 2428 | /* Return true when function cgraph_node can be expected to be removed |
09411461 JH |
2429 | from program when direct calls in this compilation unit are removed. |
2430 | ||
2431 | As a special case COMDAT functions are | |
2432 | cgraph_can_remove_if_no_direct_calls_p while the are not | |
2433 | cgraph_only_called_directly_p (it is possible they are called from other | |
2434 | unit) | |
2435 | ||
2436 | This function behaves as cgraph_only_called_directly_p because eliminating | |
61502ca8 | 2437 | all uses of COMDAT function does not make it necessarily disappear from |
09411461 JH |
2438 | the program unless we are compiling whole program or we do LTO. In this |
2439 | case we know we win since dynamic linking will not really discard the | |
2440 | linkonce section. */ | |
2441 | ||
2442 | bool | |
d52f5295 | 2443 | cgraph_node::will_be_removed_from_program_if_no_direct_calls_p (void) |
09411461 | 2444 | { |
d52f5295 ML |
2445 | gcc_assert (!global.inlined_to); |
2446 | ||
2447 | if (call_for_symbol_and_aliases (used_from_object_file_p_worker, | |
2448 | NULL, true)) | |
09411461 JH |
2449 | return false; |
2450 | if (!in_lto_p && !flag_whole_program) | |
d52f5295 | 2451 | return only_called_directly_p (); |
09411461 | 2452 | else |
530f3a1b | 2453 | { |
d52f5295 | 2454 | if (DECL_EXTERNAL (decl)) |
530f3a1b | 2455 | return true; |
d52f5295 | 2456 | return can_remove_if_no_direct_calls_p (); |
530f3a1b | 2457 | } |
09411461 JH |
2458 | } |
2459 | ||
051f8cc6 | 2460 | |
be330ed4 JH |
2461 | /* Worker for cgraph_only_called_directly_p. */ |
2462 | ||
2463 | static bool | |
3dafb85c | 2464 | cgraph_not_only_called_directly_p_1 (cgraph_node *node, void *) |
be330ed4 | 2465 | { |
d52f5295 | 2466 | return !node->only_called_directly_or_aliased_p (); |
be330ed4 JH |
2467 | } |
2468 | ||
d52f5295 | 2469 | /* Return true when function cgraph_node and all its aliases are only called |
be330ed4 JH |
2470 | directly. |
2471 | i.e. it is not externally visible, address was not taken and | |
2472 | it is not used in any other non-standard way. */ | |
2473 | ||
2474 | bool | |
d52f5295 | 2475 | cgraph_node::only_called_directly_p (void) |
be330ed4 | 2476 | { |
d52f5295 ML |
2477 | gcc_assert (ultimate_alias_target () == this); |
2478 | return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1, | |
be330ed4 JH |
2479 | NULL, true); |
2480 | } | |
2481 | ||
2482 | ||
2483 | /* Collect all callers of NODE. Worker for collect_callers_of_node. */ | |
2484 | ||
2485 | static bool | |
3dafb85c | 2486 | collect_callers_of_node_1 (cgraph_node *node, void *data) |
be330ed4 | 2487 | { |
d52f5295 | 2488 | vec<cgraph_edge *> *redirect_callers = (vec<cgraph_edge *> *)data; |
3dafb85c | 2489 | cgraph_edge *cs; |
be330ed4 | 2490 | enum availability avail; |
d52f5295 | 2491 | node->ultimate_alias_target (&avail); |
be330ed4 | 2492 | |
d52f5295 | 2493 | if (avail > AVAIL_INTERPOSABLE) |
be330ed4 JH |
2494 | for (cs = node->callers; cs != NULL; cs = cs->next_caller) |
2495 | if (!cs->indirect_inlining_edge) | |
9771b263 | 2496 | redirect_callers->safe_push (cs); |
be330ed4 JH |
2497 | return false; |
2498 | } | |
2499 | ||
d52f5295 ML |
2500 | /* Collect all callers of cgraph_node and its aliases that are known to lead to |
2501 | cgraph_node (i.e. are not overwritable). */ | |
be330ed4 | 2502 | |
d52f5295 ML |
2503 | vec<cgraph_edge *> |
2504 | cgraph_node::collect_callers (void) | |
be330ed4 | 2505 | { |
d52f5295 ML |
2506 | vec<cgraph_edge *> redirect_callers = vNULL; |
2507 | call_for_symbol_thunks_and_aliases (collect_callers_of_node_1, | |
2508 | &redirect_callers, false); | |
be330ed4 JH |
2509 | return redirect_callers; |
2510 | } | |
2511 | ||
610c8ef0 MJ |
2512 | /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */ |
2513 | ||
9c8305f8 | 2514 | static bool |
3dafb85c | 2515 | clone_of_p (cgraph_node *node, cgraph_node *node2) |
9c8305f8 | 2516 | { |
610c8ef0 | 2517 | bool skipped_thunk = false; |
d52f5295 ML |
2518 | node = node->ultimate_alias_target (); |
2519 | node2 = node2->ultimate_alias_target (); | |
610c8ef0 MJ |
2520 | |
2521 | /* There are no virtual clones of thunks so check former_clone_of or if we | |
2522 | might have skipped thunks because this adjustments are no longer | |
2523 | necessary. */ | |
2524 | while (node->thunk.thunk_p) | |
2525 | { | |
2526 | if (node2->former_clone_of == node->decl) | |
2527 | return true; | |
2528 | if (!node->thunk.this_adjusting) | |
2529 | return false; | |
d52f5295 | 2530 | node = node->callees->callee->ultimate_alias_target (); |
610c8ef0 MJ |
2531 | skipped_thunk = true; |
2532 | } | |
2533 | ||
803d0ab0 MJ |
2534 | if (skipped_thunk) |
2535 | { | |
2536 | if (!node2->clone.args_to_skip | |
2537 | || !bitmap_bit_p (node2->clone.args_to_skip, 0)) | |
2538 | return false; | |
2539 | if (node2->former_clone_of == node->decl) | |
2540 | return true; | |
2541 | else if (!node2->clone_of) | |
2542 | return false; | |
2543 | } | |
610c8ef0 | 2544 | |
9c8305f8 JH |
2545 | while (node != node2 && node2) |
2546 | node2 = node2->clone_of; | |
2547 | return node2 != NULL; | |
2548 | } | |
2549 | ||
90988f77 | 2550 | /* Verify edge count and frequency. */ |
9c8305f8 | 2551 | |
90988f77 ML |
2552 | bool |
2553 | cgraph_edge::verify_count_and_frequency () | |
9c8305f8 JH |
2554 | { |
2555 | bool error_found = false; | |
90988f77 | 2556 | if (count < 0) |
9c8305f8 JH |
2557 | { |
2558 | error ("caller edge count is negative"); | |
2559 | error_found = true; | |
2560 | } | |
90988f77 | 2561 | if (frequency < 0) |
9c8305f8 JH |
2562 | { |
2563 | error ("caller edge frequency is negative"); | |
2564 | error_found = true; | |
2565 | } | |
90988f77 | 2566 | if (frequency > CGRAPH_FREQ_MAX) |
9c8305f8 JH |
2567 | { |
2568 | error ("caller edge frequency is too large"); | |
2569 | error_found = true; | |
2570 | } | |
90988f77 ML |
2571 | if (gimple_has_body_p (caller->decl) |
2572 | && !caller->global.inlined_to | |
2573 | && !speculative | |
9c8305f8 | 2574 | /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out. |
073a8998 | 2575 | Remove this once edges are actually removed from the function at that time. */ |
90988f77 | 2576 | && (frequency |
9771b263 | 2577 | || (inline_edge_summary_vec.exists () |
90988f77 ML |
2578 | && ((inline_edge_summary_vec.length () <= (unsigned) uid) |
2579 | || !inline_edge_summary (this)->predicate))) | |
2580 | && (frequency | |
2581 | != compute_call_stmt_bb_frequency (caller->decl, | |
2582 | gimple_bb (call_stmt)))) | |
9c8305f8 JH |
2583 | { |
2584 | error ("caller edge frequency %i does not match BB frequency %i", | |
90988f77 ML |
2585 | frequency, |
2586 | compute_call_stmt_bb_frequency (caller->decl, | |
2587 | gimple_bb (call_stmt))); | |
9c8305f8 JH |
2588 | error_found = true; |
2589 | } | |
2590 | return error_found; | |
2591 | } | |
2592 | ||
2593 | /* Switch to THIS_CFUN if needed and print STMT to stderr. */ | |
2594 | static void | |
3dafb85c | 2595 | cgraph_debug_gimple_stmt (function *this_cfun, gimple stmt) |
9c8305f8 | 2596 | { |
27f7e1c3 | 2597 | bool fndecl_was_null = false; |
9c8305f8 JH |
2598 | /* debug_gimple_stmt needs correct cfun */ |
2599 | if (cfun != this_cfun) | |
2600 | set_cfun (this_cfun); | |
27f7e1c3 AH |
2601 | /* ...and an actual current_function_decl */ |
2602 | if (!current_function_decl) | |
2603 | { | |
2604 | current_function_decl = this_cfun->decl; | |
2605 | fndecl_was_null = true; | |
2606 | } | |
9c8305f8 | 2607 | debug_gimple_stmt (stmt); |
27f7e1c3 AH |
2608 | if (fndecl_was_null) |
2609 | current_function_decl = NULL; | |
9c8305f8 JH |
2610 | } |
2611 | ||
90988f77 | 2612 | /* Verify that call graph edge corresponds to DECL from the associated |
9c8305f8 JH |
2613 | statement. Return true if the verification should fail. */ |
2614 | ||
90988f77 ML |
2615 | bool |
2616 | cgraph_edge::verify_corresponds_to_fndecl (tree decl) | |
9c8305f8 | 2617 | { |
3dafb85c | 2618 | cgraph_node *node; |
9c8305f8 | 2619 | |
90988f77 | 2620 | if (!decl || callee->global.inlined_to) |
9c8305f8 | 2621 | return false; |
3dafb85c | 2622 | if (symtab->state == LTO_STREAMING) |
ca0f62a8 | 2623 | return false; |
d52f5295 | 2624 | node = cgraph_node::get (decl); |
9c8305f8 JH |
2625 | |
2626 | /* We do not know if a node from a different partition is an alias or what it | |
3d8d0043 MJ |
2627 | aliases and therefore cannot do the former_clone_of check reliably. When |
2628 | body_removed is set, we have lost all information about what was alias or | |
2629 | thunk of and also cannot proceed. */ | |
2630 | if (!node | |
2631 | || node->body_removed | |
2632 | || node->in_other_partition | |
0a7246ee | 2633 | || callee->icf_merged |
90988f77 | 2634 | || callee->in_other_partition) |
9c8305f8 | 2635 | return false; |
9de6f6c3 | 2636 | |
d52f5295 ML |
2637 | node = node->ultimate_alias_target (); |
2638 | ||
9de6f6c3 JH |
2639 | /* Optimizers can redirect unreachable calls or calls triggering undefined |
2640 | behaviour to builtin_unreachable. */ | |
90988f77 ML |
2641 | if (DECL_BUILT_IN_CLASS (callee->decl) == BUILT_IN_NORMAL |
2642 | && DECL_FUNCTION_CODE (callee->decl) == BUILT_IN_UNREACHABLE) | |
9de6f6c3 | 2643 | return false; |
9c8305f8 | 2644 | |
90988f77 ML |
2645 | if (callee->former_clone_of != node->decl |
2646 | && (node != callee->ultimate_alias_target ()) | |
2647 | && !clone_of_p (node, callee)) | |
9c8305f8 JH |
2648 | return true; |
2649 | else | |
2650 | return false; | |
2651 | } | |
2652 | ||
2653 | /* Verify cgraph nodes of given cgraph node. */ | |
2654 | DEBUG_FUNCTION void | |
d52f5295 | 2655 | cgraph_node::verify_node (void) |
9c8305f8 | 2656 | { |
3dafb85c ML |
2657 | cgraph_edge *e; |
2658 | function *this_cfun = DECL_STRUCT_FUNCTION (decl); | |
9c8305f8 JH |
2659 | basic_block this_block; |
2660 | gimple_stmt_iterator gsi; | |
2661 | bool error_found = false; | |
2662 | ||
2663 | if (seen_error ()) | |
2664 | return; | |
2665 | ||
2666 | timevar_push (TV_CGRAPH_VERIFY); | |
d52f5295 ML |
2667 | error_found |= verify_base (); |
2668 | for (e = callees; e; e = e->next_callee) | |
9c8305f8 JH |
2669 | if (e->aux) |
2670 | { | |
2671 | error ("aux field set for edge %s->%s", | |
fec39fa6 TS |
2672 | identifier_to_locale (e->caller->name ()), |
2673 | identifier_to_locale (e->callee->name ())); | |
9c8305f8 JH |
2674 | error_found = true; |
2675 | } | |
d52f5295 | 2676 | if (count < 0) |
9c8305f8 JH |
2677 | { |
2678 | error ("execution count is negative"); | |
2679 | error_found = true; | |
2680 | } | |
d52f5295 | 2681 | if (global.inlined_to && same_comdat_group) |
65d630d4 JH |
2682 | { |
2683 | error ("inline clone in same comdat group list"); | |
2684 | error_found = true; | |
2685 | } | |
d52f5295 | 2686 | if (!definition && !in_other_partition && local.local) |
e70670cf JH |
2687 | { |
2688 | error ("local symbols must be defined"); | |
2689 | error_found = true; | |
2690 | } | |
d52f5295 | 2691 | if (global.inlined_to && externally_visible) |
9c8305f8 JH |
2692 | { |
2693 | error ("externally visible inline clone"); | |
2694 | error_found = true; | |
2695 | } | |
d52f5295 | 2696 | if (global.inlined_to && address_taken) |
9c8305f8 JH |
2697 | { |
2698 | error ("inline clone with address taken"); | |
2699 | error_found = true; | |
2700 | } | |
d52f5295 | 2701 | if (global.inlined_to && force_output) |
9c8305f8 JH |
2702 | { |
2703 | error ("inline clone is forced to output"); | |
2704 | error_found = true; | |
2705 | } | |
d52f5295 | 2706 | for (e = indirect_calls; e; e = e->next_callee) |
9c8305f8 JH |
2707 | { |
2708 | if (e->aux) | |
2709 | { | |
2710 | error ("aux field set for indirect edge from %s", | |
fec39fa6 | 2711 | identifier_to_locale (e->caller->name ())); |
9c8305f8 JH |
2712 | error_found = true; |
2713 | } | |
2714 | if (!e->indirect_unknown_callee | |
2715 | || !e->indirect_info) | |
2716 | { | |
2717 | error ("An indirect edge from %s is not marked as indirect or has " | |
2718 | "associated indirect_info, the corresponding statement is: ", | |
fec39fa6 | 2719 | identifier_to_locale (e->caller->name ())); |
9c8305f8 JH |
2720 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
2721 | error_found = true; | |
2722 | } | |
2723 | } | |
d52f5295 ML |
2724 | bool check_comdat = comdat_local_p (); |
2725 | for (e = callers; e; e = e->next_caller) | |
9c8305f8 | 2726 | { |
90988f77 | 2727 | if (e->verify_count_and_frequency ()) |
9c8305f8 | 2728 | error_found = true; |
1f26ac87 | 2729 | if (check_comdat |
d52f5295 | 2730 | && !in_same_comdat_group_p (e->caller)) |
1f26ac87 JM |
2731 | { |
2732 | error ("comdat-local function called by %s outside its comdat", | |
2733 | identifier_to_locale (e->caller->name ())); | |
2734 | error_found = true; | |
2735 | } | |
9c8305f8 JH |
2736 | if (!e->inline_failed) |
2737 | { | |
d52f5295 | 2738 | if (global.inlined_to |
9c8305f8 JH |
2739 | != (e->caller->global.inlined_to |
2740 | ? e->caller->global.inlined_to : e->caller)) | |
2741 | { | |
2742 | error ("inlined_to pointer is wrong"); | |
2743 | error_found = true; | |
2744 | } | |
d52f5295 | 2745 | if (callers->next_caller) |
9c8305f8 JH |
2746 | { |
2747 | error ("multiple inline callers"); | |
2748 | error_found = true; | |
2749 | } | |
2750 | } | |
2751 | else | |
d52f5295 | 2752 | if (global.inlined_to) |
9c8305f8 JH |
2753 | { |
2754 | error ("inlined_to pointer set for noninline callers"); | |
2755 | error_found = true; | |
2756 | } | |
2757 | } | |
d52f5295 | 2758 | for (e = indirect_calls; e; e = e->next_callee) |
90988f77 | 2759 | if (e->verify_count_and_frequency ()) |
9c8305f8 | 2760 | error_found = true; |
d52f5295 | 2761 | if (!callers && global.inlined_to) |
9c8305f8 JH |
2762 | { |
2763 | error ("inlined_to pointer is set but no predecessors found"); | |
2764 | error_found = true; | |
2765 | } | |
d52f5295 | 2766 | if (global.inlined_to == this) |
9c8305f8 JH |
2767 | { |
2768 | error ("inlined_to pointer refers to itself"); | |
2769 | error_found = true; | |
2770 | } | |
2771 | ||
d52f5295 | 2772 | if (clone_of) |
9c8305f8 | 2773 | { |
3dafb85c | 2774 | cgraph_node *n; |
d52f5295 ML |
2775 | for (n = clone_of->clones; n; n = n->next_sibling_clone) |
2776 | if (n == this) | |
9c8305f8 JH |
2777 | break; |
2778 | if (!n) | |
2779 | { | |
d52f5295 | 2780 | error ("cgraph_node has wrong clone_of"); |
9c8305f8 JH |
2781 | error_found = true; |
2782 | } | |
2783 | } | |
d52f5295 | 2784 | if (clones) |
9c8305f8 | 2785 | { |
3dafb85c | 2786 | cgraph_node *n; |
d52f5295 ML |
2787 | for (n = clones; n; n = n->next_sibling_clone) |
2788 | if (n->clone_of != this) | |
9c8305f8 JH |
2789 | break; |
2790 | if (n) | |
2791 | { | |
d52f5295 | 2792 | error ("cgraph_node has wrong clone list"); |
9c8305f8 JH |
2793 | error_found = true; |
2794 | } | |
2795 | } | |
d52f5295 | 2796 | if ((prev_sibling_clone || next_sibling_clone) && !clone_of) |
9c8305f8 | 2797 | { |
d52f5295 | 2798 | error ("cgraph_node is in clone list but it is not clone"); |
9c8305f8 JH |
2799 | error_found = true; |
2800 | } | |
d52f5295 | 2801 | if (!prev_sibling_clone && clone_of && clone_of->clones != this) |
9c8305f8 | 2802 | { |
d52f5295 | 2803 | error ("cgraph_node has wrong prev_clone pointer"); |
9c8305f8 JH |
2804 | error_found = true; |
2805 | } | |
d52f5295 | 2806 | if (prev_sibling_clone && prev_sibling_clone->next_sibling_clone != this) |
9c8305f8 JH |
2807 | { |
2808 | error ("double linked list of clones corrupted"); | |
2809 | error_found = true; | |
2810 | } | |
2811 | ||
d52f5295 | 2812 | if (analyzed && alias) |
9c8305f8 JH |
2813 | { |
2814 | bool ref_found = false; | |
2815 | int i; | |
3dafb85c | 2816 | ipa_ref *ref = NULL; |
9c8305f8 | 2817 | |
d52f5295 | 2818 | if (callees) |
9c8305f8 JH |
2819 | { |
2820 | error ("Alias has call edges"); | |
2821 | error_found = true; | |
2822 | } | |
d52f5295 | 2823 | for (i = 0; iterate_reference (i, ref); i++) |
d5e254e1 IE |
2824 | if (ref->use == IPA_REF_CHKP) |
2825 | ; | |
2826 | else if (ref->use != IPA_REF_ALIAS) | |
9c8305f8 JH |
2827 | { |
2828 | error ("Alias has non-alias reference"); | |
2829 | error_found = true; | |
2830 | } | |
2831 | else if (ref_found) | |
2832 | { | |
2833 | error ("Alias has more than one alias reference"); | |
2834 | error_found = true; | |
2835 | } | |
2836 | else | |
2837 | ref_found = true; | |
2838 | if (!ref_found) | |
2839 | { | |
2840 | error ("Analyzed alias has no reference"); | |
2841 | error_found = true; | |
2842 | } | |
2843 | } | |
d5e254e1 IE |
2844 | |
2845 | /* Check instrumented version reference. */ | |
2846 | if (instrumented_version | |
2847 | && instrumented_version->instrumented_version != this) | |
2848 | { | |
2849 | error ("Instrumentation clone does not reference original node"); | |
2850 | error_found = true; | |
2851 | } | |
2852 | ||
2853 | /* Cannot have orig_decl for not instrumented nodes. */ | |
2854 | if (!instrumentation_clone && orig_decl) | |
2855 | { | |
2856 | error ("Not instrumented node has non-NULL original declaration"); | |
2857 | error_found = true; | |
2858 | } | |
2859 | ||
2860 | /* If original not instrumented node still exists then we may check | |
2861 | original declaration is set properly. */ | |
2862 | if (instrumented_version | |
2863 | && orig_decl | |
2864 | && orig_decl != instrumented_version->decl) | |
2865 | { | |
2866 | error ("Instrumented node has wrong original declaration"); | |
2867 | error_found = true; | |
2868 | } | |
2869 | ||
2870 | /* Check all nodes have chkp reference to their instrumented versions. */ | |
2871 | if (analyzed | |
2872 | && instrumented_version | |
2873 | && !instrumentation_clone) | |
2874 | { | |
2875 | bool ref_found = false; | |
2876 | int i; | |
2877 | struct ipa_ref *ref; | |
2878 | ||
2879 | for (i = 0; iterate_reference (i, ref); i++) | |
2880 | if (ref->use == IPA_REF_CHKP) | |
2881 | { | |
2882 | if (ref_found) | |
2883 | { | |
2884 | error ("Node has more than one chkp reference"); | |
2885 | error_found = true; | |
2886 | } | |
2887 | if (ref->referred != instrumented_version) | |
2888 | { | |
2889 | error ("Wrong node is referenced with chkp reference"); | |
2890 | error_found = true; | |
2891 | } | |
2892 | ref_found = true; | |
2893 | } | |
2894 | ||
2895 | if (!ref_found) | |
2896 | { | |
2897 | error ("Analyzed node has no reference to instrumented version"); | |
2898 | error_found = true; | |
2899 | } | |
2900 | } | |
2901 | ||
d52f5295 | 2902 | if (analyzed && thunk.thunk_p) |
9c8305f8 | 2903 | { |
d52f5295 | 2904 | if (!callees) |
9c8305f8 JH |
2905 | { |
2906 | error ("No edge out of thunk node"); | |
2907 | error_found = true; | |
2908 | } | |
d52f5295 | 2909 | else if (callees->next_callee) |
9c8305f8 JH |
2910 | { |
2911 | error ("More than one edge out of thunk node"); | |
2912 | error_found = true; | |
2913 | } | |
d52f5295 | 2914 | if (gimple_has_body_p (decl)) |
9c8305f8 JH |
2915 | { |
2916 | error ("Thunk is not supposed to have body"); | |
2917 | error_found = true; | |
2918 | } | |
d5e254e1 IE |
2919 | if (thunk.add_pointer_bounds_args |
2920 | && !instrumented_version->semantically_equivalent_p (callees->callee)) | |
2921 | { | |
2922 | error ("Instrumentation thunk has wrong edge callee"); | |
2923 | error_found = true; | |
2924 | } | |
9c8305f8 | 2925 | } |
d52f5295 ML |
2926 | else if (analyzed && gimple_has_body_p (decl) |
2927 | && !TREE_ASM_WRITTEN (decl) | |
2928 | && (!DECL_EXTERNAL (decl) || global.inlined_to) | |
2929 | && !flag_wpa) | |
9c8305f8 JH |
2930 | { |
2931 | if (this_cfun->cfg) | |
2932 | { | |
6e2830c3 | 2933 | hash_set<gimple> stmts; |
71cafea9 | 2934 | int i; |
3dafb85c | 2935 | ipa_ref *ref = NULL; |
71cafea9 | 2936 | |
9c8305f8 JH |
2937 | /* Reach the trees by walking over the CFG, and note the |
2938 | enclosing basic-blocks in the call edges. */ | |
2939 | FOR_EACH_BB_FN (this_block, this_cfun) | |
71cafea9 JH |
2940 | { |
2941 | for (gsi = gsi_start_phis (this_block); | |
2942 | !gsi_end_p (gsi); gsi_next (&gsi)) | |
6e2830c3 | 2943 | stmts.add (gsi_stmt (gsi)); |
71cafea9 JH |
2944 | for (gsi = gsi_start_bb (this_block); |
2945 | !gsi_end_p (gsi); | |
2946 | gsi_next (&gsi)) | |
2947 | { | |
2948 | gimple stmt = gsi_stmt (gsi); | |
6e2830c3 | 2949 | stmts.add (stmt); |
71cafea9 JH |
2950 | if (is_gimple_call (stmt)) |
2951 | { | |
3dafb85c | 2952 | cgraph_edge *e = get_edge (stmt); |
71cafea9 JH |
2953 | tree decl = gimple_call_fndecl (stmt); |
2954 | if (e) | |
2955 | { | |
2956 | if (e->aux) | |
2957 | { | |
2958 | error ("shared call_stmt:"); | |
2959 | cgraph_debug_gimple_stmt (this_cfun, stmt); | |
2960 | error_found = true; | |
2961 | } | |
2962 | if (!e->indirect_unknown_callee) | |
2963 | { | |
90988f77 | 2964 | if (e->verify_corresponds_to_fndecl (decl)) |
71cafea9 JH |
2965 | { |
2966 | error ("edge points to wrong declaration:"); | |
67348ccc | 2967 | debug_tree (e->callee->decl); |
71cafea9 JH |
2968 | fprintf (stderr," Instead of:"); |
2969 | debug_tree (decl); | |
2970 | error_found = true; | |
2971 | } | |
2972 | } | |
2973 | else if (decl) | |
2974 | { | |
2975 | error ("an indirect edge with unknown callee " | |
2976 | "corresponding to a call_stmt with " | |
2977 | "a known declaration:"); | |
2978 | error_found = true; | |
2979 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); | |
2980 | } | |
2981 | e->aux = (void *)1; | |
2982 | } | |
2983 | else if (decl) | |
2984 | { | |
2985 | error ("missing callgraph edge for call stmt:"); | |
2986 | cgraph_debug_gimple_stmt (this_cfun, stmt); | |
2987 | error_found = true; | |
2988 | } | |
2989 | } | |
2990 | } | |
9c8305f8 | 2991 | } |
d52f5295 | 2992 | for (i = 0; iterate_reference (i, ref); i++) |
6e2830c3 | 2993 | if (ref->stmt && !stmts.contains (ref->stmt)) |
71cafea9 JH |
2994 | { |
2995 | error ("reference to dead statement"); | |
2996 | cgraph_debug_gimple_stmt (this_cfun, ref->stmt); | |
2997 | error_found = true; | |
2998 | } | |
9c8305f8 JH |
2999 | } |
3000 | else | |
3001 | /* No CFG available?! */ | |
3002 | gcc_unreachable (); | |
3003 | ||
d52f5295 | 3004 | for (e = callees; e; e = e->next_callee) |
9c8305f8 JH |
3005 | { |
3006 | if (!e->aux) | |
3007 | { | |
3008 | error ("edge %s->%s has no corresponding call_stmt", | |
fec39fa6 TS |
3009 | identifier_to_locale (e->caller->name ()), |
3010 | identifier_to_locale (e->callee->name ())); | |
9c8305f8 JH |
3011 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
3012 | error_found = true; | |
3013 | } | |
3014 | e->aux = 0; | |
3015 | } | |
d52f5295 | 3016 | for (e = indirect_calls; e; e = e->next_callee) |
9c8305f8 | 3017 | { |
042ae7d2 | 3018 | if (!e->aux && !e->speculative) |
9c8305f8 JH |
3019 | { |
3020 | error ("an indirect edge from %s has no corresponding call_stmt", | |
fec39fa6 | 3021 | identifier_to_locale (e->caller->name ())); |
9c8305f8 JH |
3022 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
3023 | error_found = true; | |
3024 | } | |
3025 | e->aux = 0; | |
3026 | } | |
3027 | } | |
3028 | if (error_found) | |
3029 | { | |
d52f5295 | 3030 | dump (stderr); |
9c8305f8 JH |
3031 | internal_error ("verify_cgraph_node failed"); |
3032 | } | |
3033 | timevar_pop (TV_CGRAPH_VERIFY); | |
3034 | } | |
3035 | ||
3036 | /* Verify whole cgraph structure. */ | |
3037 | DEBUG_FUNCTION void | |
d52f5295 | 3038 | cgraph_node::verify_cgraph_nodes (void) |
9c8305f8 | 3039 | { |
3dafb85c | 3040 | cgraph_node *node; |
9c8305f8 JH |
3041 | |
3042 | if (seen_error ()) | |
3043 | return; | |
3044 | ||
3045 | FOR_EACH_FUNCTION (node) | |
d52f5295 | 3046 | node->verify (); |
9c8305f8 | 3047 | } |
48f4a6fa | 3048 | |
d52f5295 | 3049 | /* Walk the alias chain to return the function cgraph_node is alias of. |
6cbde2e3 | 3050 | Walk through thunks, too. |
e70670cf JH |
3051 | When AVAILABILITY is non-NULL, get minimal availability in the chain. */ |
3052 | ||
d52f5295 ML |
3053 | cgraph_node * |
3054 | cgraph_node::function_symbol (enum availability *availability) | |
e70670cf | 3055 | { |
6cbde2e3 | 3056 | cgraph_node *node = ultimate_alias_target (availability); |
d52f5295 | 3057 | |
6cbde2e3 | 3058 | while (node->thunk.thunk_p) |
e70670cf | 3059 | { |
6cbde2e3 BE |
3060 | node = node->callees->callee; |
3061 | if (availability) | |
3062 | { | |
3063 | enum availability a; | |
3064 | a = node->get_availability (); | |
3065 | if (a < *availability) | |
3066 | *availability = a; | |
3067 | } | |
1113596f | 3068 | node = node->ultimate_alias_target (availability); |
6cbde2e3 BE |
3069 | } |
3070 | return node; | |
3071 | } | |
3072 | ||
3073 | /* Walk the alias chain to return the function cgraph_node is alias of. | |
3074 | Walk through non virtual thunks, too. Thus we return either a function | |
3075 | or a virtual thunk node. | |
3076 | When AVAILABILITY is non-NULL, get minimal availability in the chain. */ | |
3077 | ||
3078 | cgraph_node * | |
3079 | cgraph_node::function_or_virtual_thunk_symbol | |
3080 | (enum availability *availability) | |
3081 | { | |
3082 | cgraph_node *node = ultimate_alias_target (availability); | |
3083 | ||
3084 | while (node->thunk.thunk_p && !node->thunk.virtual_offset_p) | |
3085 | { | |
3086 | node = node->callees->callee; | |
3087 | if (availability) | |
e70670cf | 3088 | { |
6cbde2e3 BE |
3089 | enum availability a; |
3090 | a = node->get_availability (); | |
3091 | if (a < *availability) | |
3092 | *availability = a; | |
e70670cf | 3093 | } |
6cbde2e3 BE |
3094 | node = node->ultimate_alias_target (availability); |
3095 | } | |
e70670cf JH |
3096 | return node; |
3097 | } | |
3098 | ||
d52f5295 ML |
3099 | /* When doing LTO, read cgraph_node's body from disk if it is not already |
3100 | present. */ | |
a2e2a668 JH |
3101 | |
3102 | bool | |
70486010 | 3103 | cgraph_node::get_untransformed_body (void) |
a2e2a668 | 3104 | { |
3dafb85c | 3105 | lto_file_decl_data *file_data; |
a2e2a668 JH |
3106 | const char *data, *name; |
3107 | size_t len; | |
d52f5295 | 3108 | tree decl = this->decl; |
a2e2a668 JH |
3109 | |
3110 | if (DECL_RESULT (decl)) | |
3111 | return false; | |
3112 | ||
3113 | gcc_assert (in_lto_p); | |
3114 | ||
917dd9bf JH |
3115 | timevar_push (TV_IPA_LTO_GIMPLE_IN); |
3116 | ||
d52f5295 | 3117 | file_data = lto_file_data; |
a2e2a668 JH |
3118 | name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)); |
3119 | ||
3120 | /* We may have renamed the declaration, e.g., a static function. */ | |
3121 | name = lto_get_decl_name_mapping (file_data, name); | |
3122 | ||
3123 | data = lto_get_section_data (file_data, LTO_section_function_body, | |
3124 | name, &len); | |
3125 | if (!data) | |
40fecdd6 | 3126 | fatal_error (input_location, "%s: section %s is missing", |
a2e2a668 JH |
3127 | file_data->file_name, |
3128 | name); | |
a2e2a668 JH |
3129 | |
3130 | gcc_assert (DECL_STRUCT_FUNCTION (decl) == NULL); | |
3131 | ||
d52f5295 | 3132 | lto_input_function_body (file_data, this, data); |
a2e2a668 JH |
3133 | lto_stats.num_function_bodies++; |
3134 | lto_free_section_data (file_data, LTO_section_function_body, name, | |
3135 | data, len); | |
d52f5295 | 3136 | lto_free_function_in_decl_state_for_node (this); |
917dd9bf JH |
3137 | |
3138 | timevar_pop (TV_IPA_LTO_GIMPLE_IN); | |
3139 | ||
a2e2a668 JH |
3140 | return true; |
3141 | } | |
3142 | ||
70486010 JH |
3143 | /* Prepare function body. When doing LTO, read cgraph_node's body from disk |
3144 | if it is not already present. When some IPA transformations are scheduled, | |
3145 | apply them. */ | |
3146 | ||
3147 | bool | |
3148 | cgraph_node::get_body (void) | |
3149 | { | |
3150 | bool updated; | |
3151 | ||
3152 | updated = get_untransformed_body (); | |
3153 | ||
3154 | /* Getting transformed body makes no sense for inline clones; | |
3155 | we should never use this on real clones becuase they are materialized | |
3156 | early. | |
3157 | TODO: Materializing clones here will likely lead to smaller LTRANS | |
3158 | footprint. */ | |
3159 | gcc_assert (!global.inlined_to && !clone_of); | |
3160 | if (ipa_transforms_to_apply.exists ()) | |
3161 | { | |
3162 | opt_pass *saved_current_pass = current_pass; | |
3163 | FILE *saved_dump_file = dump_file; | |
3164 | int saved_dump_flags = dump_flags; | |
3165 | ||
3166 | push_cfun (DECL_STRUCT_FUNCTION (decl)); | |
3167 | execute_all_ipa_transforms (); | |
3168 | cgraph_edge::rebuild_edges (); | |
3169 | free_dominance_info (CDI_DOMINATORS); | |
3170 | free_dominance_info (CDI_POST_DOMINATORS); | |
3171 | pop_cfun (); | |
3172 | updated = true; | |
3173 | ||
3174 | current_pass = saved_current_pass; | |
3175 | dump_file = saved_dump_file; | |
3176 | dump_flags = saved_dump_flags; | |
3177 | } | |
3178 | return updated; | |
3179 | } | |
3180 | ||
8ccda8bc EB |
3181 | /* Return the DECL_STRUCT_FUNCTION of the function. */ |
3182 | ||
3183 | struct function * | |
3184 | cgraph_node::get_fun (void) | |
3185 | { | |
3186 | cgraph_node *node = this; | |
3187 | struct function *fun = DECL_STRUCT_FUNCTION (node->decl); | |
3188 | ||
3189 | while (!fun && node->clone_of) | |
3190 | { | |
3191 | node = node->clone_of; | |
3192 | fun = DECL_STRUCT_FUNCTION (node->decl); | |
3193 | } | |
3194 | ||
3195 | return fun; | |
3196 | } | |
3197 | ||
4484a35a AM |
3198 | /* Verify if the type of the argument matches that of the function |
3199 | declaration. If we cannot verify this or there is a mismatch, | |
3200 | return false. */ | |
3201 | ||
3202 | static bool | |
3203 | gimple_check_call_args (gimple stmt, tree fndecl, bool args_count_match) | |
3204 | { | |
3205 | tree parms, p; | |
3206 | unsigned int i, nargs; | |
3207 | ||
3208 | /* Calls to internal functions always match their signature. */ | |
3209 | if (gimple_call_internal_p (stmt)) | |
3210 | return true; | |
3211 | ||
3212 | nargs = gimple_call_num_args (stmt); | |
3213 | ||
3214 | /* Get argument types for verification. */ | |
3215 | if (fndecl) | |
3216 | parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); | |
3217 | else | |
3218 | parms = TYPE_ARG_TYPES (gimple_call_fntype (stmt)); | |
3219 | ||
3220 | /* Verify if the type of the argument matches that of the function | |
3221 | declaration. If we cannot verify this or there is a mismatch, | |
3222 | return false. */ | |
3223 | if (fndecl && DECL_ARGUMENTS (fndecl)) | |
3224 | { | |
3225 | for (i = 0, p = DECL_ARGUMENTS (fndecl); | |
3226 | i < nargs; | |
3227 | i++, p = DECL_CHAIN (p)) | |
3228 | { | |
3229 | tree arg; | |
3230 | /* We cannot distinguish a varargs function from the case | |
3231 | of excess parameters, still deferring the inlining decision | |
3232 | to the callee is possible. */ | |
3233 | if (!p) | |
3234 | break; | |
3235 | arg = gimple_call_arg (stmt, i); | |
3236 | if (p == error_mark_node | |
5147d10a | 3237 | || DECL_ARG_TYPE (p) == error_mark_node |
4484a35a AM |
3238 | || arg == error_mark_node |
3239 | || (!types_compatible_p (DECL_ARG_TYPE (p), TREE_TYPE (arg)) | |
3240 | && !fold_convertible_p (DECL_ARG_TYPE (p), arg))) | |
3241 | return false; | |
3242 | } | |
3243 | if (args_count_match && p) | |
3244 | return false; | |
3245 | } | |
3246 | else if (parms) | |
3247 | { | |
3248 | for (i = 0, p = parms; i < nargs; i++, p = TREE_CHAIN (p)) | |
3249 | { | |
3250 | tree arg; | |
3251 | /* If this is a varargs function defer inlining decision | |
3252 | to callee. */ | |
3253 | if (!p) | |
3254 | break; | |
3255 | arg = gimple_call_arg (stmt, i); | |
3256 | if (TREE_VALUE (p) == error_mark_node | |
3257 | || arg == error_mark_node | |
3258 | || TREE_CODE (TREE_VALUE (p)) == VOID_TYPE | |
3259 | || (!types_compatible_p (TREE_VALUE (p), TREE_TYPE (arg)) | |
3260 | && !fold_convertible_p (TREE_VALUE (p), arg))) | |
3261 | return false; | |
3262 | } | |
3263 | } | |
3264 | else | |
3265 | { | |
3266 | if (nargs != 0) | |
3267 | return false; | |
3268 | } | |
3269 | return true; | |
3270 | } | |
3271 | ||
3272 | /* Verify if the type of the argument and lhs of CALL_STMT matches | |
3273 | that of the function declaration CALLEE. If ARGS_COUNT_MATCH is | |
3274 | true, the arg count needs to be the same. | |
3275 | If we cannot verify this or there is a mismatch, return false. */ | |
3276 | ||
3277 | bool | |
3278 | gimple_check_call_matching_types (gimple call_stmt, tree callee, | |
3279 | bool args_count_match) | |
3280 | { | |
3281 | tree lhs; | |
3282 | ||
3283 | if ((DECL_RESULT (callee) | |
3284 | && !DECL_BY_REFERENCE (DECL_RESULT (callee)) | |
3285 | && (lhs = gimple_call_lhs (call_stmt)) != NULL_TREE | |
3286 | && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee)), | |
3287 | TREE_TYPE (lhs)) | |
3288 | && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee)), lhs)) | |
3289 | || !gimple_check_call_args (call_stmt, callee, args_count_match)) | |
3290 | return false; | |
3291 | return true; | |
3292 | } | |
3293 | ||
3edf64aa DM |
3294 | /* Reset all state within cgraph.c so that we can rerun the compiler |
3295 | within the same process. For use by toplev::finalize. */ | |
3296 | ||
3297 | void | |
3298 | cgraph_c_finalize (void) | |
3299 | { | |
3300 | symtab = NULL; | |
3301 | ||
3302 | x_cgraph_nodes_queue = NULL; | |
3303 | ||
3304 | cgraph_fnver_htab = NULL; | |
3305 | version_info_node = NULL; | |
3306 | } | |
3307 | ||
31de7606 JH |
3308 | /* A wroker for call_for_symbol_and_aliases. */ |
3309 | ||
3310 | bool | |
3311 | cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback) (cgraph_node *, | |
3312 | void *), | |
3313 | void *data, | |
3314 | bool include_overwritable) | |
3315 | { | |
3316 | ipa_ref *ref; | |
3317 | FOR_EACH_ALIAS (this, ref) | |
3318 | { | |
3319 | cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); | |
3320 | if (include_overwritable | |
3321 | || alias->get_availability () > AVAIL_INTERPOSABLE) | |
3322 | if (alias->call_for_symbol_and_aliases (callback, data, | |
3323 | include_overwritable)) | |
3324 | return true; | |
3325 | } | |
3326 | return false; | |
3327 | } | |
988d1653 | 3328 | #include "gt-cgraph.h" |