]>
Commit | Line | Data |
---|---|---|
e72fcfe8 | 1 | /* Callgraph handling code. |
99dee823 | 2 | Copyright (C) 2003-2021 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 | |
357067f2 JH |
23 | The call-graph is a data structure designed for inter-procedural |
24 | optimization. It represents a multi-graph where nodes are functions | |
25 | (symbols within symbol table) and edges are call sites. */ | |
18c6ada9 | 26 | |
e72fcfe8 JH |
27 | #include "config.h" |
28 | #include "system.h" | |
29 | #include "coretypes.h" | |
c7131fb2 | 30 | #include "backend.h" |
957060b5 AM |
31 | #include "target.h" |
32 | #include "rtl.h" | |
e72fcfe8 | 33 | #include "tree.h" |
c7131fb2 | 34 | #include "gimple.h" |
957060b5 AM |
35 | #include "predict.h" |
36 | #include "alloc-pool.h" | |
957060b5 | 37 | #include "gimple-ssa.h" |
957060b5 AM |
38 | #include "cgraph.h" |
39 | #include "lto-streamer.h" | |
40e23961 | 40 | #include "fold-const.h" |
d8a2d370 DN |
41 | #include "varasm.h" |
42 | #include "calls.h" | |
43 | #include "print-tree.h" | |
e72fcfe8 | 44 | #include "langhooks.h" |
dc0bfe6a | 45 | #include "intl.h" |
2fb9a547 | 46 | #include "tree-eh.h" |
5be5c238 | 47 | #include "gimple-iterator.h" |
442b4905 | 48 | #include "tree-cfg.h" |
7a300452 | 49 | #include "tree-ssa.h" |
a63f2942 | 50 | #include "value-prof.h" |
a940b4d9 | 51 | #include "ipa-utils.h" |
dd912cb8 | 52 | #include "symbol-summary.h" |
8bc5448f | 53 | #include "tree-vrp.h" |
c582198b | 54 | #include "ipa-prop.h" |
27d020cf | 55 | #include "ipa-fnsummary.h" |
7d776ee2 | 56 | #include "cfgloop.h" |
9c8305f8 | 57 | #include "gimple-pretty-print.h" |
23a04216 | 58 | #include "tree-dfa.h" |
893479de | 59 | #include "profile.h" |
2631d4eb | 60 | #include "context.h" |
a49de7a4 | 61 | #include "gimplify.h" |
314e6352 ML |
62 | #include "stringpool.h" |
63 | #include "attribs.h" | |
212755ff | 64 | #include "selftest.h" |
4f75f97b | 65 | #include "tree-into-ssa.h" |
7123347c | 66 | #include "ipa-inline.h" |
89576d86 | 67 | #include "tree-nested.h" |
67f3791f | 68 | #include "symtab-thunks.h" |
ae7a23a3 | 69 | #include "symtab-clones.h" |
988d1653 | 70 | |
7ee2468b SB |
71 | /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */ |
72 | #include "tree-pass.h" | |
73 | ||
1668aabc | 74 | /* Queue of cgraph nodes scheduled to be lowered. */ |
5e20cdc9 | 75 | symtab_node *x_cgraph_nodes_queue; |
3dafb85c | 76 | #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue) |
f45e0ad1 | 77 | |
3dafb85c ML |
78 | /* Symbol table global context. */ |
79 | symbol_table *symtab; | |
cd9c7bd2 | 80 | |
61502ca8 | 81 | /* List of hooks triggered on cgraph_edge events. */ |
9088c1cc MJ |
82 | struct cgraph_edge_hook_list { |
83 | cgraph_edge_hook hook; | |
84 | void *data; | |
85 | struct cgraph_edge_hook_list *next; | |
86 | }; | |
87 | ||
61502ca8 | 88 | /* List of hooks triggered on cgraph_node events. */ |
9088c1cc MJ |
89 | struct cgraph_node_hook_list { |
90 | cgraph_node_hook hook; | |
91 | void *data; | |
92 | struct cgraph_node_hook_list *next; | |
93 | }; | |
94 | ||
61502ca8 | 95 | /* List of hooks triggered on events involving two cgraph_edges. */ |
9088c1cc MJ |
96 | struct cgraph_2edge_hook_list { |
97 | cgraph_2edge_hook hook; | |
98 | void *data; | |
99 | struct cgraph_2edge_hook_list *next; | |
100 | }; | |
101 | ||
61502ca8 | 102 | /* List of hooks triggered on events involving two cgraph_nodes. */ |
9088c1cc MJ |
103 | struct cgraph_2node_hook_list { |
104 | cgraph_2node_hook hook; | |
105 | void *data; | |
106 | struct cgraph_2node_hook_list *next; | |
107 | }; | |
108 | ||
2a22f99c TS |
109 | /* Hash descriptor for cgraph_function_version_info. */ |
110 | ||
ca752f39 | 111 | struct function_version_hasher : ggc_ptr_hash<cgraph_function_version_info> |
2a22f99c TS |
112 | { |
113 | static hashval_t hash (cgraph_function_version_info *); | |
114 | static bool equal (cgraph_function_version_info *, | |
115 | cgraph_function_version_info *); | |
116 | }; | |
117 | ||
3649b9b7 ST |
118 | /* Map a cgraph_node to cgraph_function_version_info using this htab. |
119 | The cgraph_function_version_info has a THIS_NODE field that is the | |
120 | corresponding cgraph_node.. */ | |
121 | ||
2a22f99c | 122 | static GTY(()) hash_table<function_version_hasher> *cgraph_fnver_htab = NULL; |
3649b9b7 ST |
123 | |
124 | /* Hash function for cgraph_fnver_htab. */ | |
2a22f99c TS |
125 | hashval_t |
126 | function_version_hasher::hash (cgraph_function_version_info *ptr) | |
3649b9b7 | 127 | { |
4325656f | 128 | int uid = ptr->this_node->get_uid (); |
3649b9b7 ST |
129 | return (hashval_t)(uid); |
130 | } | |
131 | ||
132 | /* eq function for cgraph_fnver_htab. */ | |
2a22f99c TS |
133 | bool |
134 | function_version_hasher::equal (cgraph_function_version_info *n1, | |
135 | cgraph_function_version_info *n2) | |
3649b9b7 | 136 | { |
4325656f | 137 | return n1->this_node->get_uid () == n2->this_node->get_uid (); |
3649b9b7 ST |
138 | } |
139 | ||
140 | /* Mark as GC root all allocated nodes. */ | |
141 | static GTY(()) struct cgraph_function_version_info * | |
142 | version_info_node = NULL; | |
143 | ||
f0889939 AM |
144 | /* Return true if NODE's address can be compared. */ |
145 | ||
146 | bool | |
147 | symtab_node::address_can_be_compared_p () | |
148 | { | |
149 | /* Address of virtual tables and functions is never compared. */ | |
150 | if (DECL_VIRTUAL_P (decl)) | |
151 | return false; | |
152 | /* Address of C++ cdtors is never compared. */ | |
153 | if (is_a <cgraph_node *> (this) | |
154 | && (DECL_CXX_CONSTRUCTOR_P (decl) | |
155 | || DECL_CXX_DESTRUCTOR_P (decl))) | |
156 | return false; | |
157 | /* Constant pool symbols addresses are never compared. | |
158 | flag_merge_constants permits us to assume the same on readonly vars. */ | |
159 | if (is_a <varpool_node *> (this) | |
160 | && (DECL_IN_CONSTANT_POOL (decl) | |
161 | || (flag_merge_constants >= 2 | |
162 | && TREE_READONLY (decl) && !TREE_THIS_VOLATILE (decl)))) | |
163 | return false; | |
164 | return true; | |
165 | } | |
166 | ||
3649b9b7 | 167 | /* Get the cgraph_function_version_info node corresponding to node. */ |
3dafb85c | 168 | cgraph_function_version_info * |
d52f5295 | 169 | cgraph_node::function_version (void) |
3649b9b7 | 170 | { |
3dafb85c | 171 | cgraph_function_version_info key; |
d52f5295 | 172 | key.this_node = this; |
3649b9b7 ST |
173 | |
174 | if (cgraph_fnver_htab == NULL) | |
175 | return NULL; | |
176 | ||
2a22f99c | 177 | return cgraph_fnver_htab->find (&key); |
3649b9b7 ST |
178 | } |
179 | ||
180 | /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab | |
181 | corresponding to cgraph_node NODE. */ | |
3dafb85c | 182 | cgraph_function_version_info * |
d52f5295 | 183 | cgraph_node::insert_new_function_version (void) |
3649b9b7 | 184 | { |
3649b9b7 | 185 | version_info_node = NULL; |
766090c2 | 186 | version_info_node = ggc_cleared_alloc<cgraph_function_version_info> (); |
d52f5295 | 187 | version_info_node->this_node = this; |
3649b9b7 ST |
188 | |
189 | if (cgraph_fnver_htab == NULL) | |
2a22f99c | 190 | cgraph_fnver_htab = hash_table<function_version_hasher>::create_ggc (2); |
3649b9b7 | 191 | |
2a22f99c TS |
192 | *cgraph_fnver_htab->find_slot (version_info_node, INSERT) |
193 | = version_info_node; | |
3649b9b7 ST |
194 | return version_info_node; |
195 | } | |
196 | ||
9acb4592 EK |
197 | /* Remove the cgraph_function_version_info node given by DECL_V. */ |
198 | static void | |
199 | delete_function_version (cgraph_function_version_info *decl_v) | |
3649b9b7 | 200 | { |
3649b9b7 ST |
201 | if (decl_v == NULL) |
202 | return; | |
203 | ||
e9d01715 ML |
204 | if (version_info_node == decl_v) |
205 | version_info_node = NULL; | |
206 | ||
3649b9b7 | 207 | if (decl_v->prev != NULL) |
9acb4592 | 208 | decl_v->prev->next = decl_v->next; |
3649b9b7 ST |
209 | |
210 | if (decl_v->next != NULL) | |
211 | decl_v->next->prev = decl_v->prev; | |
212 | ||
213 | if (cgraph_fnver_htab != NULL) | |
2a22f99c | 214 | cgraph_fnver_htab->remove_elt (decl_v); |
9acb4592 EK |
215 | } |
216 | ||
217 | /* Remove the cgraph_function_version_info and cgraph_node for DECL. This | |
218 | DECL is a duplicate declaration. */ | |
219 | void | |
220 | cgraph_node::delete_function_version_by_decl (tree decl) | |
221 | { | |
222 | cgraph_node *decl_node = cgraph_node::get (decl); | |
223 | ||
224 | if (decl_node == NULL) | |
225 | return; | |
226 | ||
227 | delete_function_version (decl_node->function_version ()); | |
3649b9b7 | 228 | |
d52f5295 | 229 | decl_node->remove (); |
3649b9b7 ST |
230 | } |
231 | ||
232 | /* Record that DECL1 and DECL2 are semantically identical function | |
233 | versions. */ | |
234 | void | |
d52f5295 | 235 | cgraph_node::record_function_versions (tree decl1, tree decl2) |
3649b9b7 | 236 | { |
3dafb85c ML |
237 | cgraph_node *decl1_node = cgraph_node::get_create (decl1); |
238 | cgraph_node *decl2_node = cgraph_node::get_create (decl2); | |
239 | cgraph_function_version_info *decl1_v = NULL; | |
240 | cgraph_function_version_info *decl2_v = NULL; | |
241 | cgraph_function_version_info *before; | |
242 | cgraph_function_version_info *after; | |
3649b9b7 ST |
243 | |
244 | gcc_assert (decl1_node != NULL && decl2_node != NULL); | |
d52f5295 ML |
245 | decl1_v = decl1_node->function_version (); |
246 | decl2_v = decl2_node->function_version (); | |
3649b9b7 ST |
247 | |
248 | if (decl1_v != NULL && decl2_v != NULL) | |
249 | return; | |
250 | ||
251 | if (decl1_v == NULL) | |
d52f5295 | 252 | decl1_v = decl1_node->insert_new_function_version (); |
3649b9b7 ST |
253 | |
254 | if (decl2_v == NULL) | |
d52f5295 | 255 | decl2_v = decl2_node->insert_new_function_version (); |
3649b9b7 ST |
256 | |
257 | /* Chain decl2_v and decl1_v. All semantically identical versions | |
258 | will be chained together. */ | |
259 | ||
260 | before = decl1_v; | |
261 | after = decl2_v; | |
262 | ||
263 | while (before->next != NULL) | |
264 | before = before->next; | |
265 | ||
266 | while (after->prev != NULL) | |
267 | after= after->prev; | |
268 | ||
269 | before->next = after; | |
270 | after->prev = before; | |
271 | } | |
272 | ||
c582198b AM |
273 | /* Initialize callgraph dump file. */ |
274 | ||
275 | void | |
276 | symbol_table::initialize (void) | |
277 | { | |
278 | if (!dump_file) | |
279 | dump_file = dump_begin (TDI_cgraph, NULL); | |
0bdad123 ML |
280 | |
281 | if (!ipa_clones_dump_file) | |
282 | ipa_clones_dump_file = dump_begin (TDI_clones, NULL); | |
c582198b AM |
283 | } |
284 | ||
60393bbc AM |
285 | /* Allocate new callgraph node and insert it into basic data structures. */ |
286 | ||
287 | cgraph_node * | |
288 | symbol_table::create_empty (void) | |
289 | { | |
60393bbc | 290 | cgraph_count++; |
a65d584d | 291 | return new (ggc_alloc<cgraph_node> ()) cgraph_node (cgraph_max_uid++); |
60393bbc AM |
292 | } |
293 | ||
9088c1cc | 294 | /* Register HOOK to be called with DATA on each removed edge. */ |
3dafb85c ML |
295 | cgraph_edge_hook_list * |
296 | symbol_table::add_edge_removal_hook (cgraph_edge_hook hook, void *data) | |
9088c1cc | 297 | { |
3dafb85c ML |
298 | cgraph_edge_hook_list *entry; |
299 | cgraph_edge_hook_list **ptr = &m_first_edge_removal_hook; | |
9088c1cc | 300 | |
3dafb85c | 301 | entry = (cgraph_edge_hook_list *) xmalloc (sizeof (*entry)); |
9088c1cc MJ |
302 | entry->hook = hook; |
303 | entry->data = data; | |
304 | entry->next = NULL; | |
305 | while (*ptr) | |
306 | ptr = &(*ptr)->next; | |
307 | *ptr = entry; | |
308 | return entry; | |
309 | } | |
310 | ||
311 | /* Remove ENTRY from the list of hooks called on removing edges. */ | |
312 | void | |
3dafb85c | 313 | symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list *entry) |
9088c1cc | 314 | { |
3dafb85c | 315 | cgraph_edge_hook_list **ptr = &m_first_edge_removal_hook; |
9088c1cc MJ |
316 | |
317 | while (*ptr != entry) | |
318 | ptr = &(*ptr)->next; | |
319 | *ptr = entry->next; | |
934cb78a | 320 | free (entry); |
9088c1cc MJ |
321 | } |
322 | ||
323 | /* Call all edge removal hooks. */ | |
3dafb85c ML |
324 | void |
325 | symbol_table::call_edge_removal_hooks (cgraph_edge *e) | |
9088c1cc | 326 | { |
3dafb85c | 327 | cgraph_edge_hook_list *entry = m_first_edge_removal_hook; |
9088c1cc MJ |
328 | while (entry) |
329 | { | |
330 | entry->hook (e, entry->data); | |
331 | entry = entry->next; | |
332 | } | |
333 | } | |
334 | ||
335 | /* Register HOOK to be called with DATA on each removed node. */ | |
3dafb85c ML |
336 | cgraph_node_hook_list * |
337 | symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook, void *data) | |
9088c1cc | 338 | { |
3dafb85c ML |
339 | cgraph_node_hook_list *entry; |
340 | cgraph_node_hook_list **ptr = &m_first_cgraph_removal_hook; | |
9088c1cc | 341 | |
3dafb85c | 342 | entry = (cgraph_node_hook_list *) xmalloc (sizeof (*entry)); |
9088c1cc MJ |
343 | entry->hook = hook; |
344 | entry->data = data; | |
345 | entry->next = NULL; | |
346 | while (*ptr) | |
347 | ptr = &(*ptr)->next; | |
348 | *ptr = entry; | |
349 | return entry; | |
350 | } | |
351 | ||
352 | /* Remove ENTRY from the list of hooks called on removing nodes. */ | |
353 | void | |
3dafb85c | 354 | symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list *entry) |
9088c1cc | 355 | { |
3dafb85c | 356 | cgraph_node_hook_list **ptr = &m_first_cgraph_removal_hook; |
9088c1cc MJ |
357 | |
358 | while (*ptr != entry) | |
359 | ptr = &(*ptr)->next; | |
360 | *ptr = entry->next; | |
934cb78a | 361 | free (entry); |
9088c1cc MJ |
362 | } |
363 | ||
364 | /* Call all node removal hooks. */ | |
3dafb85c ML |
365 | void |
366 | symbol_table::call_cgraph_removal_hooks (cgraph_node *node) | |
9088c1cc | 367 | { |
3dafb85c | 368 | cgraph_node_hook_list *entry = m_first_cgraph_removal_hook; |
9088c1cc MJ |
369 | while (entry) |
370 | { | |
371 | entry->hook (node, entry->data); | |
372 | entry = entry->next; | |
373 | } | |
374 | } | |
375 | ||
3dafb85c ML |
376 | /* Call all node removal hooks. */ |
377 | void | |
378 | symbol_table::call_cgraph_insertion_hooks (cgraph_node *node) | |
379 | { | |
380 | cgraph_node_hook_list *entry = m_first_cgraph_insertion_hook; | |
381 | while (entry) | |
382 | { | |
383 | entry->hook (node, entry->data); | |
384 | entry = entry->next; | |
385 | } | |
386 | } | |
387 | ||
388 | ||
6544865a | 389 | /* Register HOOK to be called with DATA on each inserted node. */ |
3dafb85c ML |
390 | cgraph_node_hook_list * |
391 | symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook, void *data) | |
129a37fc | 392 | { |
3dafb85c ML |
393 | cgraph_node_hook_list *entry; |
394 | cgraph_node_hook_list **ptr = &m_first_cgraph_insertion_hook; | |
129a37fc | 395 | |
3dafb85c | 396 | entry = (cgraph_node_hook_list *) xmalloc (sizeof (*entry)); |
129a37fc JH |
397 | entry->hook = hook; |
398 | entry->data = data; | |
399 | entry->next = NULL; | |
400 | while (*ptr) | |
401 | ptr = &(*ptr)->next; | |
402 | *ptr = entry; | |
403 | return entry; | |
404 | } | |
405 | ||
6544865a | 406 | /* Remove ENTRY from the list of hooks called on inserted nodes. */ |
129a37fc | 407 | void |
3dafb85c | 408 | symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list *entry) |
129a37fc | 409 | { |
3dafb85c | 410 | cgraph_node_hook_list **ptr = &m_first_cgraph_insertion_hook; |
129a37fc JH |
411 | |
412 | while (*ptr != entry) | |
413 | ptr = &(*ptr)->next; | |
414 | *ptr = entry->next; | |
934cb78a | 415 | free (entry); |
129a37fc JH |
416 | } |
417 | ||
9088c1cc | 418 | /* Register HOOK to be called with DATA on each duplicated edge. */ |
3dafb85c ML |
419 | cgraph_2edge_hook_list * |
420 | symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook, void *data) | |
9088c1cc | 421 | { |
3dafb85c ML |
422 | cgraph_2edge_hook_list *entry; |
423 | cgraph_2edge_hook_list **ptr = &m_first_edge_duplicated_hook; | |
9088c1cc | 424 | |
3dafb85c | 425 | entry = (cgraph_2edge_hook_list *) xmalloc (sizeof (*entry)); |
9088c1cc MJ |
426 | entry->hook = hook; |
427 | entry->data = data; | |
428 | entry->next = NULL; | |
429 | while (*ptr) | |
430 | ptr = &(*ptr)->next; | |
431 | *ptr = entry; | |
432 | return entry; | |
433 | } | |
434 | ||
435 | /* Remove ENTRY from the list of hooks called on duplicating edges. */ | |
436 | void | |
3dafb85c | 437 | symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list *entry) |
9088c1cc | 438 | { |
3dafb85c | 439 | cgraph_2edge_hook_list **ptr = &m_first_edge_duplicated_hook; |
9088c1cc MJ |
440 | |
441 | while (*ptr != entry) | |
442 | ptr = &(*ptr)->next; | |
443 | *ptr = entry->next; | |
934cb78a | 444 | free (entry); |
9088c1cc MJ |
445 | } |
446 | ||
447 | /* Call all edge duplication hooks. */ | |
66a20fc2 | 448 | void |
3dafb85c | 449 | symbol_table::call_edge_duplication_hooks (cgraph_edge *cs1, cgraph_edge *cs2) |
9088c1cc | 450 | { |
3dafb85c | 451 | cgraph_2edge_hook_list *entry = m_first_edge_duplicated_hook; |
9088c1cc MJ |
452 | while (entry) |
453 | { | |
454 | entry->hook (cs1, cs2, entry->data); | |
455 | entry = entry->next; | |
456 | } | |
457 | } | |
458 | ||
459 | /* Register HOOK to be called with DATA on each duplicated node. */ | |
3dafb85c ML |
460 | cgraph_2node_hook_list * |
461 | symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook, void *data) | |
9088c1cc | 462 | { |
3dafb85c ML |
463 | cgraph_2node_hook_list *entry; |
464 | cgraph_2node_hook_list **ptr = &m_first_cgraph_duplicated_hook; | |
9088c1cc | 465 | |
3dafb85c | 466 | entry = (cgraph_2node_hook_list *) xmalloc (sizeof (*entry)); |
9088c1cc MJ |
467 | entry->hook = hook; |
468 | entry->data = data; | |
469 | entry->next = NULL; | |
470 | while (*ptr) | |
471 | ptr = &(*ptr)->next; | |
472 | *ptr = entry; | |
473 | return entry; | |
474 | } | |
475 | ||
476 | /* Remove ENTRY from the list of hooks called on duplicating nodes. */ | |
477 | void | |
3dafb85c | 478 | symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list *entry) |
9088c1cc | 479 | { |
3dafb85c | 480 | cgraph_2node_hook_list **ptr = &m_first_cgraph_duplicated_hook; |
9088c1cc MJ |
481 | |
482 | while (*ptr != entry) | |
483 | ptr = &(*ptr)->next; | |
484 | *ptr = entry->next; | |
934cb78a | 485 | free (entry); |
9088c1cc MJ |
486 | } |
487 | ||
488 | /* Call all node duplication hooks. */ | |
b0d0a291 | 489 | void |
3dafb85c ML |
490 | symbol_table::call_cgraph_duplication_hooks (cgraph_node *node, |
491 | cgraph_node *node2) | |
9088c1cc | 492 | { |
3dafb85c | 493 | cgraph_2node_hook_list *entry = m_first_cgraph_duplicated_hook; |
9088c1cc MJ |
494 | while (entry) |
495 | { | |
3dafb85c | 496 | entry->hook (node, node2, entry->data); |
9088c1cc MJ |
497 | entry = entry->next; |
498 | } | |
499 | } | |
500 | ||
e72fcfe8 | 501 | /* Return cgraph node assigned to DECL. Create new one when needed. */ |
0550e7b7 | 502 | |
d52f5295 ML |
503 | cgraph_node * |
504 | cgraph_node::create (tree decl) | |
e72fcfe8 | 505 | { |
3dafb85c | 506 | cgraph_node *node = symtab->create_empty (); |
341c100f | 507 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
988d1653 | 508 | |
67348ccc | 509 | node->decl = decl; |
1f6be682 | 510 | |
41dbbb37 | 511 | if ((flag_openacc || flag_openmp) |
1f6be682 IV |
512 | && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl))) |
513 | { | |
514 | node->offloadable = 1; | |
1d899da2 TS |
515 | if (ENABLE_OFFLOADING) |
516 | g->have_offload = true; | |
1f6be682 IV |
517 | } |
518 | ||
aab778d3 L |
519 | if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl))) |
520 | node->ifunc_resolver = true; | |
521 | ||
d52f5295 | 522 | node->register_symbol (); |
89576d86 | 523 | maybe_record_nested_function (node); |
1ab24192 | 524 | |
e72fcfe8 JH |
525 | return node; |
526 | } | |
527 | ||
6f99e449 MJ |
528 | /* Try to find a call graph node for declaration DECL and if it does not exist |
529 | or if it corresponds to an inline clone, create a new one. */ | |
a358e188 | 530 | |
d52f5295 ML |
531 | cgraph_node * |
532 | cgraph_node::get_create (tree decl) | |
a358e188 | 533 | { |
3dafb85c | 534 | cgraph_node *first_clone = cgraph_node::get (decl); |
a358e188 | 535 | |
a62bfab5 | 536 | if (first_clone && !first_clone->inlined_to) |
6f99e449 | 537 | return first_clone; |
a358e188 | 538 | |
3dafb85c | 539 | cgraph_node *node = cgraph_node::create (decl); |
6f99e449 MJ |
540 | if (first_clone) |
541 | { | |
542 | first_clone->clone_of = node; | |
543 | node->clones = first_clone; | |
3c56d8d8 | 544 | node->order = first_clone->order; |
3dafb85c | 545 | symtab->symtab_prevail_in_asm_name_hash (node); |
aede2c10 | 546 | node->decl->decl_with_vis.symtab_node = node; |
6f99e449 MJ |
547 | if (dump_file) |
548 | fprintf (dump_file, "Introduced new external node " | |
464d0118 ML |
549 | "(%s) and turned into root of the clone tree.\n", |
550 | node->dump_name ()); | |
6f99e449 MJ |
551 | } |
552 | else if (dump_file) | |
553 | fprintf (dump_file, "Introduced new external node " | |
464d0118 | 554 | "(%s).\n", node->dump_name ()); |
6f99e449 | 555 | return node; |
a358e188 MJ |
556 | } |
557 | ||
87e7b310 | 558 | /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing |
72b3bc89 JH |
559 | the function body is associated with |
560 | (not necessarily cgraph_node (DECL)). */ | |
b2583345 | 561 | |
d52f5295 ML |
562 | cgraph_node * |
563 | cgraph_node::create_alias (tree alias, tree target) | |
b2583345 | 564 | { |
d52f5295 | 565 | cgraph_node *alias_node; |
b2583345 | 566 | |
40a7fe1e JH |
567 | gcc_assert (TREE_CODE (target) == FUNCTION_DECL |
568 | || TREE_CODE (target) == IDENTIFIER_NODE); | |
b2583345 | 569 | gcc_assert (TREE_CODE (alias) == FUNCTION_DECL); |
d52f5295 | 570 | alias_node = cgraph_node::get_create (alias); |
67348ccc DM |
571 | gcc_assert (!alias_node->definition); |
572 | alias_node->alias_target = target; | |
573 | alias_node->definition = true; | |
574 | alias_node->alias = true; | |
08346abd | 575 | if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias)) != NULL) |
71e54687 | 576 | alias_node->transparent_alias = alias_node->weakref = true; |
aab778d3 L |
577 | if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (alias))) |
578 | alias_node->ifunc_resolver = true; | |
6744a6ab JH |
579 | return alias_node; |
580 | } | |
581 | ||
051f8cc6 | 582 | /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful |
a358e188 | 583 | and NULL otherwise. |
6744a6ab | 584 | Same body aliases are output whenever the body of DECL is output, |
d52f5295 ML |
585 | and cgraph_node::get (ALIAS) transparently returns |
586 | cgraph_node::get (DECL). */ | |
6744a6ab | 587 | |
3dafb85c | 588 | cgraph_node * |
d52f5295 | 589 | cgraph_node::create_same_body_alias (tree alias, tree decl) |
6744a6ab | 590 | { |
3dafb85c | 591 | cgraph_node *n; |
a8b522b4 | 592 | |
6744a6ab | 593 | /* If aliases aren't supported by the assembler, fail. */ |
a8b522b4 ML |
594 | if (!TARGET_SUPPORTS_ALIASES) |
595 | return NULL; | |
596 | ||
39e2db00 JH |
597 | /* Langhooks can create same body aliases of symbols not defined. |
598 | Those are useless. Drop them on the floor. */ | |
3dafb85c | 599 | if (symtab->global_info_ready) |
39e2db00 | 600 | return NULL; |
6744a6ab | 601 | |
d52f5295 | 602 | n = cgraph_node::create_alias (alias, decl); |
67348ccc | 603 | n->cpp_implicit_alias = true; |
3dafb85c | 604 | if (symtab->cpp_implicit_aliases_done) |
d52f5295 | 605 | n->resolve_alias (cgraph_node::get (decl)); |
39e2db00 | 606 | return n; |
6744a6ab JH |
607 | } |
608 | ||
051f8cc6 | 609 | /* Add thunk alias into callgraph. The alias declaration is ALIAS and it |
61502ca8 | 610 | aliases DECL with an adjustments made into the first parameter. |
a3e61d61 | 611 | See comments in struct cgraph_thunk_info for detail on the parameters. */ |
051f8cc6 | 612 | |
3dafb85c | 613 | cgraph_node * |
d52f5295 ML |
614 | cgraph_node::create_thunk (tree alias, tree, bool this_adjusting, |
615 | HOST_WIDE_INT fixed_offset, | |
616 | HOST_WIDE_INT virtual_value, | |
44662f68 | 617 | HOST_WIDE_INT indirect_offset, |
d52f5295 ML |
618 | tree virtual_offset, |
619 | tree real_alias) | |
6744a6ab | 620 | { |
3dafb85c | 621 | cgraph_node *node; |
6744a6ab | 622 | |
d52f5295 | 623 | node = cgraph_node::get (alias); |
6744a6ab | 624 | if (node) |
d52f5295 | 625 | node->reset (); |
24d047a3 | 626 | else |
d52f5295 | 627 | node = cgraph_node::create (alias); |
a3e61d61 PMR |
628 | |
629 | /* Make sure that if VIRTUAL_OFFSET is in sync with VIRTUAL_VALUE. */ | |
630 | gcc_checking_assert (virtual_offset | |
8e6cdc90 | 631 | ? virtual_value == wi::to_wide (virtual_offset) |
a3e61d61 PMR |
632 | : virtual_value == 0); |
633 | ||
67f3791f | 634 | node->thunk = true; |
67348ccc | 635 | node->definition = true; |
c47d0034 | 636 | |
aa701610 JH |
637 | thunk_info *i; |
638 | thunk_info local_info; | |
639 | if (symtab->state < CONSTRUCTION) | |
640 | i = &local_info; | |
641 | else | |
642 | i = thunk_info::get_create (node); | |
67f3791f JH |
643 | i->fixed_offset = fixed_offset; |
644 | i->virtual_value = virtual_value; | |
645 | i->indirect_offset = indirect_offset; | |
646 | i->alias = real_alias; | |
647 | i->this_adjusting = this_adjusting; | |
648 | i->virtual_offset_p = virtual_offset != NULL; | |
aa701610 JH |
649 | if (symtab->state < CONSTRUCTION) |
650 | i->register_early (node); | |
67f3791f | 651 | |
051f8cc6 | 652 | return node; |
b2583345 JJ |
653 | } |
654 | ||
bedb9fc0 RH |
655 | /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME. |
656 | Return NULL if there's no such node. */ | |
657 | ||
d52f5295 ML |
658 | cgraph_node * |
659 | cgraph_node::get_for_asmname (tree asmname) | |
bedb9fc0 | 660 | { |
1ab24192 | 661 | /* We do not want to look at inline clones. */ |
3dafb85c | 662 | for (symtab_node *node = symtab_node::get_for_asmname (asmname); |
5d59b5e1 | 663 | node; |
67348ccc | 664 | node = node->next_sharing_asm_name) |
5d59b5e1 | 665 | { |
7de90a6c | 666 | cgraph_node *cn = dyn_cast <cgraph_node *> (node); |
a62bfab5 | 667 | if (cn && !cn->inlined_to) |
5d59b5e1 LC |
668 | return cn; |
669 | } | |
bedb9fc0 RH |
670 | return NULL; |
671 | } | |
672 | ||
6bdf3519 | 673 | /* Returns a hash value for X (which really is a cgraph_edge). */ |
70d539ce | 674 | |
2a22f99c TS |
675 | hashval_t |
676 | cgraph_edge_hasher::hash (cgraph_edge *e) | |
70d539ce | 677 | { |
40ff1364 RB |
678 | /* This is a really poor hash function, but it is what htab_hash_pointer |
679 | uses. */ | |
680 | return (hashval_t) ((intptr_t)e->call_stmt >> 3); | |
681 | } | |
682 | ||
683 | /* Returns a hash value for X (which really is a cgraph_edge). */ | |
684 | ||
685 | hashval_t | |
355fe088 | 686 | cgraph_edge_hasher::hash (gimple *call_stmt) |
40ff1364 RB |
687 | { |
688 | /* This is a really poor hash function, but it is what htab_hash_pointer | |
689 | uses. */ | |
690 | return (hashval_t) ((intptr_t)call_stmt >> 3); | |
70d539ce JH |
691 | } |
692 | ||
026c3cfd | 693 | /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */ |
70d539ce | 694 | |
2a22f99c | 695 | inline bool |
355fe088 | 696 | cgraph_edge_hasher::equal (cgraph_edge *x, gimple *y) |
70d539ce | 697 | { |
2a22f99c | 698 | return x->call_stmt == y; |
70d539ce JH |
699 | } |
700 | ||
e33c6cd6 MJ |
701 | /* Add call graph edge E to call site hash of its caller. */ |
702 | ||
042ae7d2 | 703 | static inline void |
3dafb85c | 704 | cgraph_update_edge_in_call_site_hash (cgraph_edge *e) |
042ae7d2 | 705 | { |
355fe088 | 706 | gimple *call = e->call_stmt; |
40ff1364 RB |
707 | *e->caller->call_site_hash->find_slot_with_hash |
708 | (call, cgraph_edge_hasher::hash (call), INSERT) = e; | |
042ae7d2 JH |
709 | } |
710 | ||
711 | /* Add call graph edge E to call site hash of its caller. */ | |
712 | ||
e33c6cd6 | 713 | static inline void |
3dafb85c | 714 | cgraph_add_edge_to_call_site_hash (cgraph_edge *e) |
e33c6cd6 | 715 | { |
042ae7d2 JH |
716 | /* There are two speculative edges for every statement (one direct, |
717 | one indirect); always hash the direct one. */ | |
718 | if (e->speculative && e->indirect_unknown_callee) | |
719 | return; | |
2a22f99c | 720 | cgraph_edge **slot = e->caller->call_site_hash->find_slot_with_hash |
40ff1364 | 721 | (e->call_stmt, cgraph_edge_hasher::hash (e->call_stmt), INSERT); |
042ae7d2 JH |
722 | if (*slot) |
723 | { | |
3dafb85c | 724 | gcc_assert (((cgraph_edge *)*slot)->speculative); |
845bb366 JH |
725 | if (e->callee && (!e->prev_callee |
726 | || !e->prev_callee->speculative | |
727 | || e->prev_callee->call_stmt != e->call_stmt)) | |
bfa3b50a | 728 | *slot = e; |
042ae7d2 JH |
729 | return; |
730 | } | |
731 | gcc_assert (!*slot || e->speculative); | |
e33c6cd6 MJ |
732 | *slot = e; |
733 | } | |
726a989a RB |
734 | |
735 | /* Return the callgraph edge representing the GIMPLE_CALL statement | |
736 | CALL_STMT. */ | |
737 | ||
d52f5295 | 738 | cgraph_edge * |
355fe088 | 739 | cgraph_node::get_edge (gimple *call_stmt) |
18c6ada9 | 740 | { |
3dafb85c | 741 | cgraph_edge *e, *e2; |
70d539ce JH |
742 | int n = 0; |
743 | ||
d52f5295 | 744 | if (call_site_hash) |
40ff1364 RB |
745 | return call_site_hash->find_with_hash |
746 | (call_stmt, cgraph_edge_hasher::hash (call_stmt)); | |
18c6ada9 JH |
747 | |
748 | /* This loop may turn out to be performance problem. In such case adding | |
749 | hashtables into call nodes with very many edges is probably best | |
2b8a92de | 750 | solution. It is not good idea to add pointer into CALL_EXPR itself |
18c6ada9 JH |
751 | because we want to make possible having multiple cgraph nodes representing |
752 | different clones of the same body before the body is actually cloned. */ | |
d52f5295 | 753 | for (e = callees; e; e = e->next_callee) |
70d539ce JH |
754 | { |
755 | if (e->call_stmt == call_stmt) | |
756 | break; | |
757 | n++; | |
758 | } | |
726a989a | 759 | |
e33c6cd6 | 760 | if (!e) |
d52f5295 | 761 | for (e = indirect_calls; e; e = e->next_callee) |
e33c6cd6 MJ |
762 | { |
763 | if (e->call_stmt == call_stmt) | |
764 | break; | |
765 | n++; | |
766 | } | |
767 | ||
70d539ce JH |
768 | if (n > 100) |
769 | { | |
2a22f99c | 770 | call_site_hash = hash_table<cgraph_edge_hasher>::create_ggc (120); |
d52f5295 | 771 | for (e2 = callees; e2; e2 = e2->next_callee) |
e33c6cd6 | 772 | cgraph_add_edge_to_call_site_hash (e2); |
d52f5295 | 773 | for (e2 = indirect_calls; e2; e2 = e2->next_callee) |
e33c6cd6 | 774 | cgraph_add_edge_to_call_site_hash (e2); |
70d539ce | 775 | } |
726a989a | 776 | |
18c6ada9 JH |
777 | return e; |
778 | } | |
779 | ||
726a989a | 780 | |
27c5a177 MJ |
781 | /* Change field call_stmt of edge E to NEW_STMT. If UPDATE_SPECULATIVE and E |
782 | is any component of speculative edge, then update all components. | |
783 | Speculations can be resolved in the process and EDGE can be removed and | |
784 | deallocated. Return the edge that now represents the call. */ | |
0550e7b7 | 785 | |
27c5a177 MJ |
786 | cgraph_edge * |
787 | cgraph_edge::set_call_stmt (cgraph_edge *e, gcall *new_stmt, | |
788 | bool update_speculative) | |
70d539ce | 789 | { |
e33c6cd6 MJ |
790 | tree decl; |
791 | ||
b8188b7d MJ |
792 | cgraph_node *new_direct_callee = NULL; |
793 | if ((e->indirect_unknown_callee || e->speculative) | |
794 | && (decl = gimple_call_fndecl (new_stmt))) | |
795 | { | |
796 | /* Constant propagation and especially inlining can turn an indirect call | |
797 | into a direct one. */ | |
798 | new_direct_callee = cgraph_node::get (decl); | |
799 | gcc_checking_assert (new_direct_callee); | |
800 | } | |
801 | ||
042ae7d2 JH |
802 | /* Speculative edges has three component, update all of them |
803 | when asked to. */ | |
b8188b7d MJ |
804 | if (update_speculative && e->speculative |
805 | /* If we are about to resolve the speculation by calling make_direct | |
806 | below, do not bother going over all the speculative edges now. */ | |
807 | && !new_direct_callee) | |
042ae7d2 | 808 | { |
845bb366 | 809 | cgraph_edge *direct, *indirect, *next; |
3dafb85c | 810 | ipa_ref *ref; |
27c5a177 | 811 | bool e_indirect = e->indirect_unknown_callee; |
845bb366 JH |
812 | int n = 0; |
813 | ||
814 | direct = e->first_speculative_call_target (); | |
815 | indirect = e->speculative_call_indirect_edge (); | |
816 | ||
817 | gcall *old_stmt = direct->call_stmt; | |
818 | for (cgraph_edge *d = direct; d; d = next) | |
819 | { | |
820 | next = d->next_speculative_call_target (); | |
821 | cgraph_edge *d2 = set_call_stmt (d, new_stmt, false); | |
822 | gcc_assert (d2 == d); | |
823 | n++; | |
824 | } | |
825 | gcc_checking_assert (indirect->num_speculative_call_targets_p () == n); | |
826 | for (unsigned int i = 0; e->caller->iterate_reference (i, ref); i++) | |
827 | if (ref->speculative && ref->stmt == old_stmt) | |
828 | { | |
829 | ref->stmt = new_stmt; | |
830 | n--; | |
831 | } | |
042ae7d2 | 832 | |
27c5a177 MJ |
833 | indirect = set_call_stmt (indirect, new_stmt, false); |
834 | return e_indirect ? indirect : direct; | |
042ae7d2 JH |
835 | } |
836 | ||
b8188b7d MJ |
837 | if (new_direct_callee) |
838 | e = make_direct (e, new_direct_callee); | |
839 | ||
042ae7d2 | 840 | /* Only direct speculative edges go to call_site_hash. */ |
27c5a177 | 841 | if (e->caller->call_site_hash |
845bb366 JH |
842 | && (!e->speculative || !e->indirect_unknown_callee) |
843 | /* It is possible that edge was previously speculative. In this case | |
844 | we have different value in call stmt hash which needs preserving. */ | |
845 | && e->caller->get_edge (e->call_stmt) == e) | |
27c5a177 MJ |
846 | e->caller->call_site_hash->remove_elt_with_hash |
847 | (e->call_stmt, cgraph_edge_hasher::hash (e->call_stmt)); | |
3dafb85c | 848 | |
27c5a177 | 849 | e->call_stmt = new_stmt; |
e33c6cd6 | 850 | |
36bbc05d MJ |
851 | function *fun = DECL_STRUCT_FUNCTION (e->caller->decl); |
852 | e->can_throw_external = stmt_can_throw_external (fun, new_stmt); | |
845bb366 JH |
853 | /* Update call stite hash. For speculative calls we only record the first |
854 | direct edge. */ | |
855 | if (e->caller->call_site_hash | |
856 | && (!e->speculative | |
857 | || (e->callee | |
858 | && (!e->prev_callee || !e->prev_callee->speculative | |
859 | || e->prev_callee->call_stmt != e->call_stmt)) | |
860 | || (e->speculative && !e->callee))) | |
e33c6cd6 | 861 | cgraph_add_edge_to_call_site_hash (e); |
27c5a177 | 862 | return e; |
70d539ce JH |
863 | } |
864 | ||
e33c6cd6 MJ |
865 | /* Allocate a cgraph_edge structure and fill it with data according to the |
866 | parameters of which only CALLEE can be NULL (when creating an indirect call | |
3187c8a5 MJ |
867 | edge). CLONING_P should be set if properties that are copied from an |
868 | original edge should not be calculated. */ | |
e72fcfe8 | 869 | |
d52f5295 | 870 | cgraph_edge * |
3dafb85c | 871 | symbol_table::create_edge (cgraph_node *caller, cgraph_node *callee, |
1bad9c18 | 872 | gcall *call_stmt, profile_count count, |
3187c8a5 | 873 | bool indir_unknown_callee, bool cloning_p) |
e72fcfe8 | 874 | { |
d52f5295 | 875 | cgraph_edge *edge; |
18c6ada9 | 876 | |
d7f09764 DN |
877 | /* LTO does not actually have access to the call_stmt since these |
878 | have not been loaded yet. */ | |
879 | if (call_stmt) | |
880 | { | |
61502ca8 | 881 | /* This is a rather expensive check possibly triggering |
77a74ed7 | 882 | construction of call stmt hashtable. */ |
3dafb85c | 883 | cgraph_edge *e; |
b2b29377 MM |
884 | gcc_checking_assert (!(e = caller->get_edge (call_stmt)) |
885 | || e->speculative); | |
18c6ada9 | 886 | |
d7f09764 DN |
887 | gcc_assert (is_gimple_call (call_stmt)); |
888 | } | |
b58b1157 | 889 | |
fe248a88 ML |
890 | edge = ggc_alloc<cgraph_edge> (); |
891 | edge->m_summary_id = -1; | |
3dafb85c ML |
892 | edges_count++; |
893 | ||
8b25212d ML |
894 | gcc_assert (++edges_max_uid != 0); |
895 | edge->m_uid = edges_max_uid; | |
18c6ada9 | 896 | edge->aux = NULL; |
e72fcfe8 JH |
897 | edge->caller = caller; |
898 | edge->callee = callee; | |
e33c6cd6 MJ |
899 | edge->prev_caller = NULL; |
900 | edge->next_caller = NULL; | |
901 | edge->prev_callee = NULL; | |
902 | edge->next_callee = NULL; | |
042ae7d2 | 903 | edge->lto_stmt_uid = 0; |
f1ba88b1 | 904 | edge->speculative_id = 0; |
e33c6cd6 | 905 | |
1bad9c18 | 906 | edge->count = count; |
e0704a46 | 907 | edge->call_stmt = call_stmt; |
3187c8a5 MJ |
908 | edge->indirect_info = NULL; |
909 | edge->indirect_inlining_edge = 0; | |
910 | edge->speculative = false; | |
911 | edge->indirect_unknown_callee = indir_unknown_callee; | |
912 | if (call_stmt && caller->call_site_hash) | |
913 | cgraph_add_edge_to_call_site_hash (edge); | |
914 | ||
915 | if (cloning_p) | |
916 | return edge; | |
917 | ||
9f3f7d13 | 918 | edge->can_throw_external |
36bbc05d MJ |
919 | = call_stmt ? stmt_can_throw_external (DECL_STRUCT_FUNCTION (caller->decl), |
920 | call_stmt) : false; | |
73136074 MJ |
921 | edge->inline_failed = CIF_FUNCTION_NOT_CONSIDERED; |
922 | edge->call_stmt_cannot_inline_p = false; | |
e33c6cd6 | 923 | |
a6b1490d JH |
924 | if (opt_for_fn (edge->caller->decl, flag_devirtualize) |
925 | && call_stmt && DECL_STRUCT_FUNCTION (caller->decl)) | |
f9bb202b JH |
926 | edge->in_polymorphic_cdtor |
927 | = decl_maybe_in_construction_p (NULL, NULL, call_stmt, | |
928 | caller->decl); | |
929 | else | |
67f3791f | 930 | edge->in_polymorphic_cdtor = caller->thunk; |
7a50e708 JJ |
931 | if (callee) |
932 | caller->calls_declare_variant_alt |= callee->declare_variant_alt; | |
e33c6cd6 | 933 | |
72b3bc89 JH |
934 | if (callee && symtab->state != LTO_STREAMING |
935 | && edge->callee->comdat_local_p ()) | |
936 | edge->caller->calls_comdat_local = true; | |
937 | ||
e33c6cd6 MJ |
938 | return edge; |
939 | } | |
940 | ||
3187c8a5 MJ |
941 | /* Create edge from a given function to CALLEE in the cgraph. CLONING_P should |
942 | be set if properties that are copied from an original edge should not be | |
943 | calculated. */ | |
e33c6cd6 | 944 | |
3dafb85c ML |
945 | cgraph_edge * |
946 | cgraph_node::create_edge (cgraph_node *callee, | |
3187c8a5 | 947 | gcall *call_stmt, profile_count count, bool cloning_p) |
e33c6cd6 | 948 | { |
3dafb85c | 949 | cgraph_edge *edge = symtab->create_edge (this, callee, call_stmt, count, |
3187c8a5 | 950 | false, cloning_p); |
e33c6cd6 | 951 | |
3187c8a5 MJ |
952 | if (!cloning_p) |
953 | initialize_inline_failed (edge); | |
e33c6cd6 | 954 | |
e72fcfe8 | 955 | edge->next_caller = callee->callers; |
2563c224 RG |
956 | if (callee->callers) |
957 | callee->callers->prev_caller = edge; | |
d52f5295 ML |
958 | edge->next_callee = callees; |
959 | if (callees) | |
960 | callees->prev_callee = edge; | |
961 | callees = edge; | |
e72fcfe8 | 962 | callee->callers = edge; |
3dc9eaa6 | 963 | |
e33c6cd6 MJ |
964 | return edge; |
965 | } | |
966 | ||
ce47fda3 MJ |
967 | /* Allocate cgraph_indirect_call_info and set its fields to default values. */ |
968 | ||
3dafb85c | 969 | cgraph_indirect_call_info * |
ce47fda3 MJ |
970 | cgraph_allocate_init_indirect_info (void) |
971 | { | |
3dafb85c | 972 | cgraph_indirect_call_info *ii; |
ce47fda3 | 973 | |
766090c2 | 974 | ii = ggc_cleared_alloc<cgraph_indirect_call_info> (); |
ce47fda3 MJ |
975 | ii->param_index = -1; |
976 | return ii; | |
977 | } | |
e33c6cd6 MJ |
978 | |
979 | /* Create an indirect edge with a yet-undetermined callee where the call | |
980 | statement destination is a formal parameter of the caller with index | |
3187c8a5 MJ |
981 | PARAM_INDEX. CLONING_P should be set if properties that are copied from an |
982 | original edge should not be calculated and indirect_info structure should | |
983 | not be calculated. */ | |
e33c6cd6 | 984 | |
3dafb85c | 985 | cgraph_edge * |
538dd0b7 | 986 | cgraph_node::create_indirect_edge (gcall *call_stmt, int ecf_flags, |
1bad9c18 | 987 | profile_count count, |
3187c8a5 | 988 | bool cloning_p) |
e33c6cd6 | 989 | { |
3187c8a5 MJ |
990 | cgraph_edge *edge = symtab->create_edge (this, NULL, call_stmt, count, true, |
991 | cloning_p); | |
1d5755ef | 992 | tree target; |
e33c6cd6 | 993 | |
3187c8a5 MJ |
994 | if (!cloning_p) |
995 | initialize_inline_failed (edge); | |
3dc9eaa6 | 996 | |
ce47fda3 | 997 | edge->indirect_info = cgraph_allocate_init_indirect_info (); |
5f902d76 | 998 | edge->indirect_info->ecf_flags = ecf_flags; |
0127c169 | 999 | edge->indirect_info->vptr_changed = true; |
e33c6cd6 | 1000 | |
1d5755ef | 1001 | /* Record polymorphic call info. */ |
3187c8a5 | 1002 | if (!cloning_p |
d34af022 | 1003 | && call_stmt |
1d5755ef JH |
1004 | && (target = gimple_call_fn (call_stmt)) |
1005 | && virtual_method_call_p (target)) | |
1006 | { | |
6f8091fc | 1007 | ipa_polymorphic_call_context context (decl, target, call_stmt); |
1d5755ef JH |
1008 | |
1009 | /* Only record types can have virtual calls. */ | |
68377e53 | 1010 | edge->indirect_info->polymorphic = true; |
1d5755ef | 1011 | edge->indirect_info->param_index = -1; |
6f8091fc JH |
1012 | edge->indirect_info->otr_token |
1013 | = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target)); | |
1014 | edge->indirect_info->otr_type = obj_type_ref_class (target); | |
1015 | gcc_assert (TREE_CODE (edge->indirect_info->otr_type) == RECORD_TYPE); | |
ba392339 | 1016 | edge->indirect_info->context = context; |
1d5755ef JH |
1017 | } |
1018 | ||
d52f5295 ML |
1019 | edge->next_callee = indirect_calls; |
1020 | if (indirect_calls) | |
1021 | indirect_calls->prev_callee = edge; | |
1022 | indirect_calls = edge; | |
e33c6cd6 | 1023 | |
e72fcfe8 JH |
1024 | return edge; |
1025 | } | |
1026 | ||
3dafb85c | 1027 | /* Remove the edge from the list of the callees of the caller. */ |
2563c224 | 1028 | |
3dafb85c ML |
1029 | void |
1030 | cgraph_edge::remove_caller (void) | |
2563c224 | 1031 | { |
3dafb85c ML |
1032 | if (prev_callee) |
1033 | prev_callee->next_callee = next_callee; | |
1034 | if (next_callee) | |
1035 | next_callee->prev_callee = prev_callee; | |
1036 | if (!prev_callee) | |
e33c6cd6 | 1037 | { |
3dafb85c ML |
1038 | if (indirect_unknown_callee) |
1039 | caller->indirect_calls = next_callee; | |
e33c6cd6 | 1040 | else |
3dafb85c | 1041 | caller->callees = next_callee; |
e33c6cd6 | 1042 | } |
845bb366 JH |
1043 | if (caller->call_site_hash |
1044 | && this == caller->get_edge (call_stmt)) | |
40ff1364 RB |
1045 | caller->call_site_hash->remove_elt_with_hash |
1046 | (call_stmt, cgraph_edge_hasher::hash (call_stmt)); | |
2563c224 RG |
1047 | } |
1048 | ||
934cb78a MJ |
1049 | /* Put the edge onto the free list. */ |
1050 | ||
3dafb85c ML |
1051 | void |
1052 | symbol_table::free_edge (cgraph_edge *e) | |
934cb78a | 1053 | { |
fe248a88 ML |
1054 | edges_count--; |
1055 | if (e->m_summary_id != -1) | |
1056 | edge_released_summary_ids.safe_push (e->m_summary_id); | |
1057 | ||
042ae7d2 JH |
1058 | if (e->indirect_info) |
1059 | ggc_free (e->indirect_info); | |
fe248a88 | 1060 | ggc_free (e); |
934cb78a MJ |
1061 | } |
1062 | ||
3dafb85c | 1063 | /* Remove the edge in the cgraph. */ |
e72fcfe8 | 1064 | |
cb967da5 | 1065 | void |
27c5a177 | 1066 | cgraph_edge::remove (cgraph_edge *edge) |
e72fcfe8 | 1067 | { |
934cb78a | 1068 | /* Call all edge removal hooks. */ |
27c5a177 | 1069 | symtab->call_edge_removal_hooks (edge); |
934cb78a | 1070 | |
27c5a177 | 1071 | if (!edge->indirect_unknown_callee) |
e33c6cd6 | 1072 | /* Remove from callers list of the callee. */ |
27c5a177 | 1073 | edge->remove_callee (); |
2563c224 RG |
1074 | |
1075 | /* Remove from callees list of the callers. */ | |
27c5a177 | 1076 | edge->remove_caller (); |
934cb78a MJ |
1077 | |
1078 | /* Put the edge onto the free list. */ | |
27c5a177 | 1079 | symtab->free_edge (edge); |
e72fcfe8 JH |
1080 | } |
1081 | ||
3dafb85c | 1082 | /* Turn edge into speculative call calling N2. Update |
042ae7d2 JH |
1083 | the profile so the direct call is taken COUNT times |
1084 | with FREQUENCY. | |
1085 | ||
1086 | At clone materialization time, the indirect call E will | |
1087 | be expanded as: | |
1088 | ||
1089 | if (call_dest == N2) | |
1090 | n2 (); | |
1091 | else | |
1092 | call call_dest | |
1093 | ||
1094 | At this time the function just creates the direct call, | |
dfea3d6f JJ |
1095 | the reference representing the if conditional and attaches |
1096 | them all to the original indirect call statement. | |
042ae7d2 | 1097 | |
f1ba88b1 XHL |
1098 | speculative_id is used to link direct calls with their corresponding |
1099 | IPA_REF_ADDR references when representing speculative calls. | |
1100 | ||
09ce3660 JH |
1101 | Return direct edge created. */ |
1102 | ||
3dafb85c | 1103 | cgraph_edge * |
f1ba88b1 | 1104 | cgraph_edge::make_speculative (cgraph_node *n2, profile_count direct_count, |
845bb366 | 1105 | unsigned int speculative_id) |
042ae7d2 | 1106 | { |
3dafb85c ML |
1107 | cgraph_node *n = caller; |
1108 | ipa_ref *ref = NULL; | |
1109 | cgraph_edge *e2; | |
042ae7d2 JH |
1110 | |
1111 | if (dump_file) | |
464d0118 ML |
1112 | fprintf (dump_file, "Indirect call -> speculative call %s => %s\n", |
1113 | n->dump_name (), n2->dump_name ()); | |
3dafb85c | 1114 | speculative = true; |
1bad9c18 | 1115 | e2 = n->create_edge (n2, call_stmt, direct_count); |
042ae7d2 JH |
1116 | initialize_inline_failed (e2); |
1117 | e2->speculative = true; | |
67348ccc | 1118 | if (TREE_NOTHROW (n2->decl)) |
bfa3b50a JH |
1119 | e2->can_throw_external = false; |
1120 | else | |
3dafb85c ML |
1121 | e2->can_throw_external = can_throw_external; |
1122 | e2->lto_stmt_uid = lto_stmt_uid; | |
f1ba88b1 | 1123 | e2->speculative_id = speculative_id; |
f9bb202b | 1124 | e2->in_polymorphic_cdtor = in_polymorphic_cdtor; |
bf6fc129 | 1125 | indirect_info->num_speculative_call_targets++; |
3dafb85c | 1126 | count -= e2->count; |
3dafb85c ML |
1127 | symtab->call_edge_duplication_hooks (this, e2); |
1128 | ref = n->create_reference (n2, IPA_REF_ADDR, call_stmt); | |
1129 | ref->lto_stmt_uid = lto_stmt_uid; | |
f1ba88b1 | 1130 | ref->speculative_id = speculative_id; |
3dafb85c | 1131 | ref->speculative = speculative; |
d52f5295 | 1132 | n2->mark_address_taken (); |
09ce3660 | 1133 | return e2; |
042ae7d2 JH |
1134 | } |
1135 | ||
845bb366 JH |
1136 | /* Speculative call consists of an indirect edge and one or more |
1137 | direct edge+ref pairs. | |
f1ba88b1 | 1138 | |
845bb366 JH |
1139 | Given an edge which is part of speculative call, return the first |
1140 | direct call edge in the speculative call sequence. */ | |
f1ba88b1 | 1141 | |
845bb366 JH |
1142 | cgraph_edge * |
1143 | cgraph_edge::first_speculative_call_target () | |
042ae7d2 | 1144 | { |
3dafb85c | 1145 | cgraph_edge *e = this; |
042ae7d2 | 1146 | |
845bb366 JH |
1147 | gcc_checking_assert (e->speculative); |
1148 | if (e->callee) | |
1149 | { | |
1150 | while (e->prev_callee && e->prev_callee->speculative | |
1151 | && e->prev_callee->call_stmt == e->call_stmt | |
1152 | && e->prev_callee->lto_stmt_uid == e->lto_stmt_uid) | |
1153 | e = e->prev_callee; | |
1154 | return e; | |
1155 | } | |
1156 | /* Call stmt site hash always points to the first target of the | |
1157 | speculative call sequence. */ | |
1158 | if (e->call_stmt) | |
1159 | return e->caller->get_edge (e->call_stmt); | |
1160 | for (cgraph_edge *e2 = e->caller->callees; true; e2 = e2->next_callee) | |
1161 | if (e2->speculative | |
1162 | && e->call_stmt == e2->call_stmt | |
1163 | && e->lto_stmt_uid == e2->lto_stmt_uid) | |
1164 | return e2; | |
1165 | } | |
1166 | ||
1167 | /* We always maintain first direct edge in the call site hash, if one | |
1168 | exists. E is going to be removed. See if it is first one and update | |
1169 | hash accordingly. INDIRECT is the indirect edge of speculative call. | |
1170 | We assume that INDIRECT->num_speculative_call_targets_p () is already | |
1171 | updated for removal of E. */ | |
1172 | static void | |
1173 | update_call_stmt_hash_for_removing_direct_edge (cgraph_edge *e, | |
1174 | cgraph_edge *indirect) | |
1175 | { | |
1176 | if (e->caller->call_site_hash) | |
042ae7d2 | 1177 | { |
845bb366 JH |
1178 | if (e->caller->get_edge (e->call_stmt) != e) |
1179 | ; | |
1180 | else if (!indirect->num_speculative_call_targets_p ()) | |
1181 | cgraph_update_edge_in_call_site_hash (indirect); | |
1182 | else | |
042ae7d2 | 1183 | { |
845bb366 JH |
1184 | gcc_checking_assert (e->next_callee && e->next_callee->speculative |
1185 | && e->next_callee->call_stmt == e->call_stmt); | |
1186 | cgraph_update_edge_in_call_site_hash (e->next_callee); | |
042ae7d2 | 1187 | } |
845bb366 | 1188 | } |
042ae7d2 JH |
1189 | } |
1190 | ||
27c5a177 MJ |
1191 | /* Speculative call EDGE turned out to be direct call to CALLEE_DECL. Remove |
1192 | the speculative call sequence and return edge representing the call, the | |
f1ba88b1 XHL |
1193 | original EDGE can be removed and deallocated. Return the edge that now |
1194 | represents the call. | |
1195 | ||
1196 | For "speculative" indirect call that contains multiple "speculative" | |
1197 | targets (i.e. edge->indirect_info->num_speculative_call_targets > 1), | |
1198 | decrease the count and only remove current direct edge. | |
1199 | ||
1200 | If no speculative direct call left to the speculative indirect call, remove | |
1201 | the speculative of both the indirect call and corresponding direct edge. | |
1202 | ||
1203 | It is up to caller to iteratively resolve each "speculative" direct call and | |
1204 | redirect the call as appropriate. */ | |
042ae7d2 | 1205 | |
3dafb85c | 1206 | cgraph_edge * |
27c5a177 | 1207 | cgraph_edge::resolve_speculation (cgraph_edge *edge, tree callee_decl) |
042ae7d2 | 1208 | { |
3dafb85c ML |
1209 | cgraph_edge *e2; |
1210 | ipa_ref *ref; | |
042ae7d2 | 1211 | |
845bb366 | 1212 | gcc_assert (edge->speculative && (!callee_decl || edge->callee)); |
7c710777 JH |
1213 | if (!edge->callee) |
1214 | e2 = edge->first_speculative_call_target (); | |
1215 | else | |
1216 | e2 = edge; | |
845bb366 JH |
1217 | ref = e2->speculative_call_target_ref (); |
1218 | edge = edge->speculative_call_indirect_edge (); | |
123485ca | 1219 | if (!callee_decl |
d52f5295 ML |
1220 | || !ref->referred->semantically_equivalent_p |
1221 | (symtab_node::get (callee_decl))) | |
042ae7d2 JH |
1222 | { |
1223 | if (dump_file) | |
1224 | { | |
09ce3660 JH |
1225 | if (callee_decl) |
1226 | { | |
464d0118 | 1227 | fprintf (dump_file, "Speculative indirect call %s => %s has " |
09ce3660 | 1228 | "turned out to have contradicting known target ", |
464d0118 ML |
1229 | edge->caller->dump_name (), |
1230 | e2->callee->dump_name ()); | |
ef6cb4c7 | 1231 | print_generic_expr (dump_file, callee_decl); |
09ce3660 JH |
1232 | fprintf (dump_file, "\n"); |
1233 | } | |
1234 | else | |
1235 | { | |
464d0118 ML |
1236 | fprintf (dump_file, "Removing speculative call %s => %s\n", |
1237 | edge->caller->dump_name (), | |
1238 | e2->callee->dump_name ()); | |
09ce3660 | 1239 | } |
042ae7d2 JH |
1240 | } |
1241 | } | |
1242 | else | |
1243 | { | |
3dafb85c | 1244 | cgraph_edge *tmp = edge; |
042ae7d2 | 1245 | if (dump_file) |
ae7a23a3 | 1246 | fprintf (dump_file, "Speculative call turned into direct call.\n"); |
042ae7d2 JH |
1247 | edge = e2; |
1248 | e2 = tmp; | |
118aa5e3 JH |
1249 | /* FIXME: If EDGE is inlined, we should scale up the frequencies |
1250 | and counts in the functions inlined through it. */ | |
042ae7d2 JH |
1251 | } |
1252 | edge->count += e2->count; | |
f1ba88b1 XHL |
1253 | if (edge->num_speculative_call_targets_p ()) |
1254 | { | |
1255 | /* The indirect edge has multiple speculative targets, don't remove | |
1256 | speculative until all related direct edges are resolved. */ | |
1257 | edge->indirect_info->num_speculative_call_targets--; | |
1258 | if (!edge->indirect_info->num_speculative_call_targets) | |
1259 | edge->speculative = false; | |
1260 | } | |
1261 | else | |
1262 | edge->speculative = false; | |
042ae7d2 | 1263 | e2->speculative = false; |
845bb366 | 1264 | update_call_stmt_hash_for_removing_direct_edge (e2, edge); |
d122681a | 1265 | ref->remove_reference (); |
042ae7d2 | 1266 | if (e2->indirect_unknown_callee || e2->inline_failed) |
27c5a177 | 1267 | remove (e2); |
042ae7d2 | 1268 | else |
d52f5295 | 1269 | e2->callee->remove_symbol_and_inline_clones (); |
042ae7d2 JH |
1270 | return edge; |
1271 | } | |
1272 | ||
845bb366 JH |
1273 | /* Return edge corresponding to speculative call to a given target. |
1274 | NULL if speculative call does not have one. */ | |
1275 | ||
1276 | cgraph_edge * | |
1277 | cgraph_edge::speculative_call_for_target (cgraph_node *target) | |
1278 | { | |
1279 | for (cgraph_edge *direct = first_speculative_call_target (); | |
1280 | direct; | |
1281 | direct = direct->next_speculative_call_target ()) | |
1282 | if (direct->speculative_call_target_ref () | |
1283 | ->referred->semantically_equivalent_p (target)) | |
1284 | return direct; | |
1285 | return NULL; | |
1286 | } | |
1287 | ||
b8188b7d MJ |
1288 | /* Make an indirect or speculative EDGE with an unknown callee an ordinary edge |
1289 | leading to CALLEE. Speculations can be resolved in the process and EDGE can | |
1290 | be removed and deallocated. Return the edge that now represents the | |
1291 | call. */ | |
e33c6cd6 | 1292 | |
3dafb85c | 1293 | cgraph_edge * |
27c5a177 | 1294 | cgraph_edge::make_direct (cgraph_edge *edge, cgraph_node *callee) |
e33c6cd6 | 1295 | { |
b8188b7d | 1296 | gcc_assert (edge->indirect_unknown_callee || edge->speculative); |
042ae7d2 JH |
1297 | |
1298 | /* If we are redirecting speculative call, make it non-speculative. */ | |
27c5a177 | 1299 | if (edge->speculative) |
042ae7d2 | 1300 | { |
118aa5e3 JH |
1301 | cgraph_edge *found = NULL; |
1302 | cgraph_edge *direct, *next; | |
118aa5e3 | 1303 | |
845bb366 | 1304 | edge = edge->speculative_call_indirect_edge (); |
042ae7d2 | 1305 | |
118aa5e3 | 1306 | /* Look all speculative targets and remove all but one corresponding |
845bb366 JH |
1307 | to callee (if it exists). */ |
1308 | for (direct = edge->first_speculative_call_target (); | |
1309 | direct; | |
1310 | direct = next) | |
1311 | { | |
1312 | next = direct->next_speculative_call_target (); | |
1313 | ||
1314 | /* Compare ref not direct->callee. Direct edge is possibly | |
1315 | inlined or redirected. */ | |
1316 | if (!direct->speculative_call_target_ref () | |
1317 | ->referred->semantically_equivalent_p (callee)) | |
1318 | edge = direct->resolve_speculation (direct, NULL); | |
1319 | else | |
1320 | { | |
1321 | gcc_checking_assert (!found); | |
1322 | found = direct; | |
1323 | } | |
1324 | } | |
118aa5e3 JH |
1325 | |
1326 | /* On successful speculation just remove the indirect edge and | |
1327 | return the pre existing direct edge. | |
1328 | It is important to not remove it and redirect because the direct | |
1329 | edge may be inlined or redirected. */ | |
1330 | if (found) | |
1331 | { | |
845bb366 JH |
1332 | cgraph_edge *e2 = resolve_speculation (found, callee->decl); |
1333 | gcc_checking_assert (!found->speculative && e2 == found); | |
118aa5e3 JH |
1334 | return found; |
1335 | } | |
1336 | gcc_checking_assert (!edge->speculative); | |
042ae7d2 JH |
1337 | } |
1338 | ||
27c5a177 MJ |
1339 | edge->indirect_unknown_callee = 0; |
1340 | ggc_free (edge->indirect_info); | |
1341 | edge->indirect_info = NULL; | |
e33c6cd6 MJ |
1342 | |
1343 | /* Get the edge out of the indirect edge list. */ | |
27c5a177 MJ |
1344 | if (edge->prev_callee) |
1345 | edge->prev_callee->next_callee = edge->next_callee; | |
1346 | if (edge->next_callee) | |
1347 | edge->next_callee->prev_callee = edge->prev_callee; | |
1348 | if (!edge->prev_callee) | |
1349 | edge->caller->indirect_calls = edge->next_callee; | |
e33c6cd6 MJ |
1350 | |
1351 | /* Put it into the normal callee list */ | |
27c5a177 MJ |
1352 | edge->prev_callee = NULL; |
1353 | edge->next_callee = edge->caller->callees; | |
1354 | if (edge->caller->callees) | |
1355 | edge->caller->callees->prev_callee = edge; | |
1356 | edge->caller->callees = edge; | |
e33c6cd6 MJ |
1357 | |
1358 | /* Insert to callers list of the new callee. */ | |
90988f77 | 1359 | edge->set_callee (callee); |
e33c6cd6 MJ |
1360 | |
1361 | /* We need to re-determine the inlining status of the edge. */ | |
1362 | initialize_inline_failed (edge); | |
042ae7d2 | 1363 | return edge; |
2563c224 RG |
1364 | } |
1365 | ||
72b3bc89 JH |
1366 | /* Redirect callee of the edge to N. The function does not update underlying |
1367 | call expression. */ | |
1368 | ||
1369 | void | |
1370 | cgraph_edge::redirect_callee (cgraph_node *n) | |
1371 | { | |
1372 | bool loc = callee->comdat_local_p (); | |
1373 | /* Remove from callers list of the current callee. */ | |
1374 | remove_callee (); | |
1375 | ||
1376 | /* Insert to callers list of the new callee. */ | |
1377 | set_callee (n); | |
1378 | ||
1379 | if (!inline_failed) | |
1380 | return; | |
1381 | if (!loc && n->comdat_local_p ()) | |
1382 | { | |
1383 | cgraph_node *to = caller->inlined_to ? caller->inlined_to : caller; | |
1384 | to->calls_comdat_local = true; | |
1385 | } | |
1386 | else if (loc && !n->comdat_local_p ()) | |
1387 | { | |
1388 | cgraph_node *to = caller->inlined_to ? caller->inlined_to : caller; | |
1389 | gcc_checking_assert (to->calls_comdat_local); | |
1390 | to->calls_comdat_local = to->check_calls_comdat_local_p (); | |
1391 | } | |
1392 | } | |
1393 | ||
66a20fc2 | 1394 | /* If necessary, change the function declaration in the call statement |
27c5a177 | 1395 | associated with E so that it corresponds to the edge callee. Speculations |
f1ba88b1 XHL |
1396 | can be resolved in the process and EDGE can be removed and deallocated. |
1397 | ||
1398 | The edge could be one of speculative direct call generated from speculative | |
1399 | indirect call. In this circumstance, decrease the speculative targets | |
1400 | count (i.e. num_speculative_call_targets) and redirect call stmt to the | |
1401 | corresponding i-th target. If no speculative direct call left to the | |
1402 | speculative indirect call, remove "speculative" of the indirect call and | |
1403 | also redirect stmt to it's final direct target. | |
1404 | ||
1405 | It is up to caller to iteratively transform each "speculative" | |
1406 | direct call as appropriate. */ | |
66a20fc2 | 1407 | |
355fe088 | 1408 | gimple * |
27c5a177 | 1409 | cgraph_edge::redirect_call_stmt_to_callee (cgraph_edge *e) |
66a20fc2 JH |
1410 | { |
1411 | tree decl = gimple_call_fndecl (e->call_stmt); | |
538dd0b7 | 1412 | gcall *new_stmt; |
66a20fc2 | 1413 | gimple_stmt_iterator gsi; |
66a20fc2 | 1414 | |
042ae7d2 JH |
1415 | if (e->speculative) |
1416 | { | |
a21e735e JH |
1417 | /* If there already is an direct call (i.e. as a result of inliner's |
1418 | substitution), forget about speculating. */ | |
eefe9a99 | 1419 | if (decl) |
7c710777 JH |
1420 | e = make_direct (e->speculative_call_indirect_edge (), |
1421 | cgraph_node::get (decl)); | |
09ce3660 JH |
1422 | else |
1423 | { | |
845bb366 JH |
1424 | /* Be sure we redirect all speculative targets before poking |
1425 | abou tindirect edge. */ | |
1426 | gcc_checking_assert (e->callee); | |
1427 | cgraph_edge *indirect = e->speculative_call_indirect_edge (); | |
1428 | gcall *new_stmt; | |
1429 | ipa_ref *ref; | |
1430 | ||
73136074 | 1431 | /* Expand speculation into GIMPLE code. */ |
09ce3660 | 1432 | if (dump_file) |
3995f3a2 JH |
1433 | { |
1434 | fprintf (dump_file, | |
1435 | "Expanding speculative call of %s -> %s count: ", | |
1436 | e->caller->dump_name (), | |
1437 | e->callee->dump_name ()); | |
1438 | e->count.dump (dump_file); | |
1439 | fprintf (dump_file, "\n"); | |
1440 | } | |
67348ccc | 1441 | push_cfun (DECL_STRUCT_FUNCTION (e->caller->decl)); |
109bb9be | 1442 | |
845bb366 JH |
1443 | profile_count all = indirect->count; |
1444 | for (cgraph_edge *e2 = e->first_speculative_call_target (); | |
1445 | e2; | |
1446 | e2 = e2->next_speculative_call_target ()) | |
1447 | all = all + e2->count; | |
1448 | profile_probability prob = e->count.probability_in (all); | |
1bad9c18 | 1449 | if (!prob.initialized_p ()) |
109bb9be | 1450 | prob = profile_probability::even (); |
845bb366 | 1451 | ref = e->speculative_call_target_ref (); |
0b986c6a JH |
1452 | new_stmt = gimple_ic (e->call_stmt, |
1453 | dyn_cast<cgraph_node *> (ref->referred), | |
e7a74006 | 1454 | prob); |
042ae7d2 | 1455 | e->speculative = false; |
845bb366 | 1456 | if (indirect->num_speculative_call_targets_p ()) |
f1ba88b1 XHL |
1457 | { |
1458 | /* The indirect edge has multiple speculative targets, don't | |
1459 | remove speculative until all related direct edges are | |
1460 | redirected. */ | |
845bb366 JH |
1461 | indirect->indirect_info->num_speculative_call_targets--; |
1462 | if (!indirect->indirect_info->num_speculative_call_targets) | |
1463 | indirect->speculative = false; | |
f1ba88b1 XHL |
1464 | } |
1465 | else | |
845bb366 | 1466 | indirect->speculative = false; |
042ae7d2 JH |
1467 | /* Indirect edges are not both in the call site hash. |
1468 | get it updated. */ | |
845bb366 JH |
1469 | update_call_stmt_hash_for_removing_direct_edge (e, indirect); |
1470 | cgraph_edge::set_call_stmt (e, new_stmt, false); | |
1471 | e->count = gimple_bb (e->call_stmt)->count; | |
1472 | ||
1473 | /* Once we are done with expanding the sequence, update also indirect | |
1474 | call probability. Until then the basic block accounts for the | |
1475 | sum of indirect edge and all non-expanded speculations. */ | |
1476 | if (!indirect->speculative) | |
1477 | indirect->count = gimple_bb (indirect->call_stmt)->count; | |
1478 | ref->speculative = false; | |
1479 | ref->stmt = NULL; | |
042ae7d2 JH |
1480 | pop_cfun (); |
1481 | /* Continue redirecting E to proper target. */ | |
1482 | } | |
1483 | } | |
1484 | ||
8e9b2773 | 1485 | |
66a20fc2 | 1486 | if (e->indirect_unknown_callee |
31db0fe0 | 1487 | || decl == e->callee->decl) |
66a20fc2 JH |
1488 | return e->call_stmt; |
1489 | ||
7123347c MJ |
1490 | if (decl && ipa_saved_clone_sources) |
1491 | { | |
1492 | tree *p = ipa_saved_clone_sources->get (e->callee); | |
1493 | if (p && decl == *p) | |
1494 | { | |
1495 | gimple_call_set_fndecl (e->call_stmt, e->callee->decl); | |
1496 | return e->call_stmt; | |
1497 | } | |
1498 | } | |
b2b29377 | 1499 | if (flag_checking && decl) |
66a20fc2 | 1500 | { |
895fdc1f IB |
1501 | if (cgraph_node *node = cgraph_node::get (decl)) |
1502 | { | |
1503 | clone_info *info = clone_info::get (node); | |
1504 | gcc_assert (!info || !info->param_adjustments); | |
1505 | } | |
66a20fc2 | 1506 | } |
66a20fc2 | 1507 | |
ae7a23a3 JH |
1508 | clone_info *callee_info = clone_info::get (e->callee); |
1509 | clone_info *caller_info = clone_info::get (e->caller); | |
1510 | ||
3dafb85c | 1511 | if (symtab->dump_file) |
66a20fc2 | 1512 | { |
464d0118 ML |
1513 | fprintf (symtab->dump_file, "updating call of %s -> %s: ", |
1514 | e->caller->dump_name (), e->callee->dump_name ()); | |
3dafb85c | 1515 | print_gimple_stmt (symtab->dump_file, e->call_stmt, 0, dump_flags); |
ae7a23a3 JH |
1516 | if (callee_info && callee_info->param_adjustments) |
1517 | callee_info->param_adjustments->dump (symtab->dump_file); | |
ff6686d2 | 1518 | unsigned performed_len |
ab4664eb | 1519 | = caller_info ? vec_safe_length (caller_info->performed_splits) : 0; |
ff6686d2 MJ |
1520 | if (performed_len > 0) |
1521 | fprintf (symtab->dump_file, "Performed splits records:\n"); | |
1522 | for (unsigned i = 0; i < performed_len; i++) | |
66a20fc2 | 1523 | { |
ff6686d2 | 1524 | ipa_param_performed_split *sm |
ae7a23a3 | 1525 | = &(*caller_info->performed_splits)[i]; |
ff6686d2 MJ |
1526 | print_node_brief (symtab->dump_file, " dummy_decl: ", sm->dummy_decl, |
1527 | TDF_UID); | |
1528 | fprintf (symtab->dump_file, ", unit_offset: %u\n", sm->unit_offset); | |
66a20fc2 JH |
1529 | } |
1530 | } | |
1531 | ||
ae7a23a3 JH |
1532 | if (ipa_param_adjustments *padjs |
1533 | = callee_info ? callee_info->param_adjustments : NULL) | |
66a20fc2 | 1534 | { |
ff6686d2 | 1535 | /* We need to defer cleaning EH info on the new statement to |
ae7a23a3 | 1536 | fixup-cfg. We may not have dominator information at this point |
ff6686d2 MJ |
1537 | and thus would end up with unreachable blocks and have no way |
1538 | to communicate that we need to run CFG cleanup then. */ | |
1539 | int lp_nr = lookup_stmt_eh_lp (e->call_stmt); | |
1540 | if (lp_nr != 0) | |
1541 | remove_stmt_from_eh_lp (e->call_stmt); | |
66a20fc2 | 1542 | |
b0fd4d7e | 1543 | tree old_fntype = gimple_call_fntype (e->call_stmt); |
ff6686d2 | 1544 | new_stmt = padjs->modify_call (e->call_stmt, |
ae7a23a3 JH |
1545 | caller_info |
1546 | ? caller_info->performed_splits : NULL, | |
ff6686d2 | 1547 | e->callee->decl, false); |
b0fd4d7e MJ |
1548 | cgraph_node *origin = e->callee; |
1549 | while (origin->clone_of) | |
1550 | origin = origin->clone_of; | |
1551 | ||
1552 | if ((origin->former_clone_of | |
1553 | && old_fntype == TREE_TYPE (origin->former_clone_of)) | |
1554 | || old_fntype == TREE_TYPE (origin->decl)) | |
1555 | gimple_call_set_fntype (new_stmt, TREE_TYPE (e->callee->decl)); | |
1556 | else | |
1557 | { | |
ff6686d2 MJ |
1558 | tree new_fntype = padjs->build_new_function_type (old_fntype, true); |
1559 | gimple_call_set_fntype (new_stmt, new_fntype); | |
a49de7a4 JJ |
1560 | } |
1561 | ||
66a20fc2 | 1562 | if (lp_nr != 0) |
ff6686d2 | 1563 | add_stmt_to_eh_lp (new_stmt, lp_nr); |
66a20fc2 JH |
1564 | } |
1565 | else | |
1566 | { | |
1567 | new_stmt = e->call_stmt; | |
67348ccc | 1568 | gimple_call_set_fndecl (new_stmt, e->callee->decl); |
6a58ccca | 1569 | update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt); |
66a20fc2 JH |
1570 | } |
1571 | ||
1f91747b JJ |
1572 | /* If changing the call to __cxa_pure_virtual or similar noreturn function, |
1573 | adjust gimple_call_fntype too. */ | |
1574 | if (gimple_call_noreturn_p (new_stmt) | |
1575 | && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (e->callee->decl))) | |
1576 | && TYPE_ARG_TYPES (TREE_TYPE (e->callee->decl)) | |
1577 | && (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (e->callee->decl))) | |
1578 | == void_type_node)) | |
1579 | gimple_call_set_fntype (new_stmt, TREE_TYPE (e->callee->decl)); | |
1580 | ||
e6a54b01 | 1581 | /* If the call becomes noreturn, remove the LHS if possible. */ |
77f1efdb | 1582 | tree lhs = gimple_call_lhs (new_stmt); |
1f91747b JJ |
1583 | if (lhs |
1584 | && gimple_call_noreturn_p (new_stmt) | |
1585 | && (VOID_TYPE_P (TREE_TYPE (gimple_call_fntype (new_stmt))) | |
1586 | || should_remove_lhs_p (lhs))) | |
23a04216 JH |
1587 | { |
1588 | if (TREE_CODE (lhs) == SSA_NAME) | |
1589 | { | |
45b62594 RB |
1590 | tree var = create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e->caller->decl), |
1591 | TREE_TYPE (lhs), NULL); | |
1592 | var = get_or_create_ssa_default_def | |
1593 | (DECL_STRUCT_FUNCTION (e->caller->decl), var); | |
355fe088 | 1594 | gimple *set_stmt = gimple_build_assign (lhs, var); |
ae7a23a3 | 1595 | gsi = gsi_for_stmt (new_stmt); |
45b62594 RB |
1596 | gsi_insert_before_without_update (&gsi, set_stmt, GSI_SAME_STMT); |
1597 | update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), set_stmt); | |
23a04216 JH |
1598 | } |
1599 | gimple_call_set_lhs (new_stmt, NULL_TREE); | |
1f91035f JH |
1600 | update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt); |
1601 | } | |
1602 | ||
1603 | /* If new callee has no static chain, remove it. */ | |
1604 | if (gimple_call_chain (new_stmt) && !DECL_STATIC_CHAIN (e->callee->decl)) | |
1605 | { | |
1606 | gimple_call_set_chain (new_stmt, NULL); | |
1607 | update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt); | |
23a04216 JH |
1608 | } |
1609 | ||
0b986c6a JH |
1610 | maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e->caller->decl), |
1611 | new_stmt); | |
1612 | ||
d52f5295 | 1613 | e->caller->set_call_stmt_including_clones (e->call_stmt, new_stmt, false); |
66a20fc2 | 1614 | |
3dafb85c | 1615 | if (symtab->dump_file) |
66a20fc2 | 1616 | { |
3dafb85c ML |
1617 | fprintf (symtab->dump_file, " updated to:"); |
1618 | print_gimple_stmt (symtab->dump_file, e->call_stmt, 0, dump_flags); | |
66a20fc2 JH |
1619 | } |
1620 | return new_stmt; | |
1621 | } | |
726a989a RB |
1622 | |
1623 | /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL | |
4b685e14 | 1624 | OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl |
a9d24544 JJ |
1625 | of OLD_STMT if it was previously call statement. |
1626 | If NEW_STMT is NULL, the call has been dropped without any | |
1627 | replacement. */ | |
2bafad93 | 1628 | |
9187e02d | 1629 | static void |
3dafb85c | 1630 | cgraph_update_edges_for_call_stmt_node (cgraph_node *node, |
355fe088 TS |
1631 | gimple *old_stmt, tree old_call, |
1632 | gimple *new_stmt) | |
2bafad93 | 1633 | { |
a9d24544 JJ |
1634 | tree new_call = (new_stmt && is_gimple_call (new_stmt)) |
1635 | ? gimple_call_fndecl (new_stmt) : 0; | |
2bafad93 | 1636 | |
4b685e14 JH |
1637 | /* We are seeing indirect calls, then there is nothing to update. */ |
1638 | if (!new_call && !old_call) | |
1639 | return; | |
1640 | /* See if we turned indirect call into direct call or folded call to one builtin | |
61502ca8 | 1641 | into different builtin. */ |
2bafad93 JJ |
1642 | if (old_call != new_call) |
1643 | { | |
3dafb85c ML |
1644 | cgraph_edge *e = node->get_edge (old_stmt); |
1645 | cgraph_edge *ne = NULL; | |
3995f3a2 | 1646 | profile_count count; |
2bafad93 JJ |
1647 | |
1648 | if (e) | |
1649 | { | |
1f4eb0e9 | 1650 | /* Keep calls marked as dead dead. */ |
931c8e9a | 1651 | if (new_stmt && is_gimple_call (new_stmt) && e->callee |
3d78e008 | 1652 | && fndecl_built_in_p (e->callee->decl, BUILT_IN_UNREACHABLE)) |
1f4eb0e9 | 1653 | { |
27c5a177 MJ |
1654 | cgraph_edge::set_call_stmt (node->get_edge (old_stmt), |
1655 | as_a <gcall *> (new_stmt)); | |
1f4eb0e9 JH |
1656 | return; |
1657 | } | |
e33c6cd6 MJ |
1658 | /* See if the edge is already there and has the correct callee. It |
1659 | might be so because of indirect inlining has already updated | |
97ba0040 JH |
1660 | it. We also might've cloned and redirected the edge. */ |
1661 | if (new_call && e->callee) | |
1662 | { | |
3dafb85c | 1663 | cgraph_node *callee = e->callee; |
97ba0040 JH |
1664 | while (callee) |
1665 | { | |
67348ccc | 1666 | if (callee->decl == new_call |
97ba0040 | 1667 | || callee->former_clone_of == new_call) |
eb14a79f | 1668 | { |
27c5a177 | 1669 | cgraph_edge::set_call_stmt (e, as_a <gcall *> (new_stmt)); |
eb14a79f ML |
1670 | return; |
1671 | } | |
97ba0040 JH |
1672 | callee = callee->clone_of; |
1673 | } | |
1674 | } | |
4b685e14 JH |
1675 | |
1676 | /* Otherwise remove edge and create new one; we can't simply redirect | |
1677 | since function has changed, so inline plan and other information | |
1678 | attached to edge is invalid. */ | |
1bad9c18 | 1679 | count = e->count; |
2dbe8b70 | 1680 | if (e->indirect_unknown_callee || e->inline_failed) |
27c5a177 | 1681 | cgraph_edge::remove (e); |
2dbe8b70 | 1682 | else |
d52f5295 | 1683 | e->callee->remove_symbol_and_inline_clones (); |
4b685e14 | 1684 | } |
a9d24544 | 1685 | else if (new_call) |
4b685e14 JH |
1686 | { |
1687 | /* We are seeing new direct call; compute profile info based on BB. */ | |
1688 | basic_block bb = gimple_bb (new_stmt); | |
1bad9c18 | 1689 | count = bb->count; |
2bafad93 | 1690 | } |
2bafad93 | 1691 | |
4b685e14 JH |
1692 | if (new_call) |
1693 | { | |
d52f5295 | 1694 | ne = node->create_edge (cgraph_node::get_create (new_call), |
1bad9c18 | 1695 | as_a <gcall *> (new_stmt), count); |
4b685e14 JH |
1696 | gcc_assert (ne->inline_failed); |
1697 | } | |
2bafad93 | 1698 | } |
4b685e14 JH |
1699 | /* We only updated the call stmt; update pointer in cgraph edge.. */ |
1700 | else if (old_stmt != new_stmt) | |
27c5a177 MJ |
1701 | cgraph_edge::set_call_stmt (node->get_edge (old_stmt), |
1702 | as_a <gcall *> (new_stmt)); | |
2bafad93 JJ |
1703 | } |
1704 | ||
9187e02d | 1705 | /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL |
4b685e14 JH |
1706 | OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl |
1707 | of OLD_STMT before it was updated (updating can happen inplace). */ | |
9187e02d JH |
1708 | |
1709 | void | |
355fe088 TS |
1710 | cgraph_update_edges_for_call_stmt (gimple *old_stmt, tree old_decl, |
1711 | gimple *new_stmt) | |
9187e02d | 1712 | { |
3dafb85c ML |
1713 | cgraph_node *orig = cgraph_node::get (cfun->decl); |
1714 | cgraph_node *node; | |
9187e02d | 1715 | |
a358e188 | 1716 | gcc_checking_assert (orig); |
4b685e14 | 1717 | cgraph_update_edges_for_call_stmt_node (orig, old_stmt, old_decl, new_stmt); |
9187e02d JH |
1718 | if (orig->clones) |
1719 | for (node = orig->clones; node != orig;) | |
1720 | { | |
ae7a23a3 JH |
1721 | cgraph_update_edges_for_call_stmt_node (node, old_stmt, old_decl, |
1722 | new_stmt); | |
9187e02d JH |
1723 | if (node->clones) |
1724 | node = node->clones; | |
1725 | else if (node->next_sibling_clone) | |
1726 | node = node->next_sibling_clone; | |
1727 | else | |
1728 | { | |
1729 | while (node != orig && !node->next_sibling_clone) | |
1730 | node = node->clone_of; | |
1731 | if (node != orig) | |
1732 | node = node->next_sibling_clone; | |
1733 | } | |
1734 | } | |
1735 | } | |
1736 | ||
726a989a | 1737 | |
2563c224 RG |
1738 | /* Remove all callees from the node. */ |
1739 | ||
1740 | void | |
d52f5295 | 1741 | cgraph_node::remove_callees (void) |
2563c224 | 1742 | { |
3dafb85c | 1743 | cgraph_edge *e, *f; |
2563c224 | 1744 | |
72b3bc89 JH |
1745 | calls_comdat_local = false; |
1746 | ||
2563c224 RG |
1747 | /* It is sufficient to remove the edges from the lists of callers of |
1748 | the callees. The callee list of the node can be zapped with one | |
1749 | assignment. */ | |
d52f5295 | 1750 | for (e = callees; e; e = f) |
9088c1cc | 1751 | { |
5c0466b5 | 1752 | f = e->next_callee; |
3dafb85c | 1753 | symtab->call_edge_removal_hooks (e); |
e33c6cd6 | 1754 | if (!e->indirect_unknown_callee) |
3dafb85c ML |
1755 | e->remove_callee (); |
1756 | symtab->free_edge (e); | |
9088c1cc | 1757 | } |
d52f5295 | 1758 | for (e = indirect_calls; e; e = f) |
5f902d76 JH |
1759 | { |
1760 | f = e->next_callee; | |
3dafb85c | 1761 | symtab->call_edge_removal_hooks (e); |
5f902d76 | 1762 | if (!e->indirect_unknown_callee) |
3dafb85c ML |
1763 | e->remove_callee (); |
1764 | symtab->free_edge (e); | |
5f902d76 | 1765 | } |
d52f5295 ML |
1766 | indirect_calls = NULL; |
1767 | callees = NULL; | |
1768 | if (call_site_hash) | |
70d539ce | 1769 | { |
2a22f99c | 1770 | call_site_hash->empty (); |
d52f5295 | 1771 | call_site_hash = NULL; |
70d539ce | 1772 | } |
2563c224 RG |
1773 | } |
1774 | ||
1775 | /* Remove all callers from the node. */ | |
1776 | ||
d52f5295 ML |
1777 | void |
1778 | cgraph_node::remove_callers (void) | |
2563c224 | 1779 | { |
3dafb85c | 1780 | cgraph_edge *e, *f; |
2563c224 RG |
1781 | |
1782 | /* It is sufficient to remove the edges from the lists of callees of | |
1783 | the callers. The caller list of the node can be zapped with one | |
1784 | assignment. */ | |
d52f5295 | 1785 | for (e = callers; e; e = f) |
9088c1cc | 1786 | { |
5c0466b5 | 1787 | f = e->next_caller; |
3dafb85c ML |
1788 | symtab->call_edge_removal_hooks (e); |
1789 | e->remove_caller (); | |
1790 | symtab->free_edge (e); | |
9088c1cc | 1791 | } |
d52f5295 | 1792 | callers = NULL; |
18c6ada9 JH |
1793 | } |
1794 | ||
49bde175 JH |
1795 | /* Helper function for cgraph_release_function_body and free_lang_data. |
1796 | It releases body from function DECL without having to inspect its | |
1797 | possibly non-existent symtab node. */ | |
3a40c18a JH |
1798 | |
1799 | void | |
49bde175 | 1800 | release_function_body (tree decl) |
3a40c18a | 1801 | { |
61183076 RB |
1802 | function *fn = DECL_STRUCT_FUNCTION (decl); |
1803 | if (fn) | |
3a40c18a | 1804 | { |
61183076 | 1805 | if (fn->cfg |
381cdae4 | 1806 | && loops_for_fn (fn)) |
936fc9ba | 1807 | { |
381cdae4 RB |
1808 | fn->curr_properties &= ~PROP_loops; |
1809 | loop_optimizer_finalize (fn); | |
1810 | } | |
1811 | if (fn->gimple_df) | |
1812 | { | |
1813 | delete_tree_ssa (fn); | |
1814 | fn->eh = NULL; | |
1815 | } | |
1816 | if (fn->cfg) | |
1817 | { | |
1818 | gcc_assert (!dom_info_available_p (fn, CDI_DOMINATORS)); | |
1819 | gcc_assert (!dom_info_available_p (fn, CDI_POST_DOMINATORS)); | |
1820 | delete_tree_cfg_annotations (fn); | |
45281f12 | 1821 | free_cfg (fn); |
381cdae4 | 1822 | fn->cfg = NULL; |
936fc9ba | 1823 | } |
381cdae4 RB |
1824 | if (fn->value_histograms) |
1825 | free_histograms (fn); | |
49bde175 | 1826 | gimple_set_body (decl, NULL); |
936fc9ba | 1827 | /* Struct function hangs a lot of data that would leak if we didn't |
ae7a23a3 | 1828 | removed all pointers to it. */ |
61183076 | 1829 | ggc_free (fn); |
49bde175 JH |
1830 | DECL_STRUCT_FUNCTION (decl) = NULL; |
1831 | } | |
1832 | DECL_SAVED_TREE (decl) = NULL; | |
1833 | } | |
1834 | ||
d52f5295 | 1835 | /* Release memory used to represent body of function. |
49bde175 JH |
1836 | Use this only for functions that are released before being translated to |
1837 | target code (i.e. RTL). Functions that are compiled to RTL and beyond | |
bf898b30 ML |
1838 | are free'd in final.c via free_after_compilation(). |
1839 | KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */ | |
49bde175 JH |
1840 | |
1841 | void | |
bf898b30 | 1842 | cgraph_node::release_body (bool keep_arguments) |
49bde175 | 1843 | { |
d52f5295 | 1844 | ipa_transforms_to_apply.release (); |
3dafb85c | 1845 | if (!used_as_abstract_origin && symtab->state != PARSING) |
49bde175 | 1846 | { |
d52f5295 | 1847 | DECL_RESULT (decl) = NULL; |
bf898b30 ML |
1848 | |
1849 | if (!keep_arguments) | |
1850 | DECL_ARGUMENTS (decl) = NULL; | |
3a40c18a | 1851 | } |
026c3cfd AH |
1852 | /* If the node is abstract and needed, then do not clear |
1853 | DECL_INITIAL of its associated function declaration because it's | |
6b20f353 | 1854 | needed to emit debug info later. */ |
d52f5295 ML |
1855 | if (!used_as_abstract_origin && DECL_INITIAL (decl)) |
1856 | DECL_INITIAL (decl) = error_mark_node; | |
1857 | release_function_body (decl); | |
1858 | if (lto_file_data) | |
1c4db829 JH |
1859 | { |
1860 | lto_free_function_in_decl_state_for_node (this); | |
1861 | lto_file_data = NULL; | |
1862 | } | |
23ce9945 JH |
1863 | if (flag_checking && clones) |
1864 | { | |
1865 | /* It is invalid to release body before materializing clones except | |
1866 | for thunks that don't really need a body. Verify also that we do | |
1867 | not leak pointers to the call statements. */ | |
1868 | for (cgraph_node *node = clones; node; | |
1869 | node = node->next_sibling_clone) | |
1870 | gcc_assert (node->thunk && !node->callees->call_stmt); | |
1871 | } | |
d7145b4b JH |
1872 | remove_callees (); |
1873 | remove_all_references (); | |
3a40c18a JH |
1874 | } |
1875 | ||
d52f5295 | 1876 | /* Remove function from symbol table. */ |
18d13f34 JH |
1877 | |
1878 | void | |
d52f5295 | 1879 | cgraph_node::remove (void) |
18d13f34 | 1880 | { |
ab4664eb JH |
1881 | bool clone_info_set = false; |
1882 | clone_info *info, saved_info; | |
0bdad123 ML |
1883 | if (symtab->ipa_clones_dump_file && symtab->cloned_nodes.contains (this)) |
1884 | fprintf (symtab->ipa_clones_dump_file, | |
1885 | "Callgraph removal;%s;%d;%s;%d;%d\n", asm_name (), order, | |
1886 | DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl), | |
1887 | DECL_SOURCE_COLUMN (decl)); | |
1888 | ||
ab4664eb JH |
1889 | if ((info = clone_info::get (this)) != NULL) |
1890 | { | |
1891 | saved_info = *info; | |
1892 | clone_info_set = true; | |
1893 | } | |
3dafb85c | 1894 | symtab->call_cgraph_removal_hooks (this); |
d52f5295 ML |
1895 | remove_callers (); |
1896 | remove_callees (); | |
1897 | ipa_transforms_to_apply.release (); | |
9acb4592 | 1898 | delete_function_version (function_version ()); |
266ad5c8 | 1899 | |
96fc428c JH |
1900 | /* Incremental inlining access removed nodes stored in the postorder list. |
1901 | */ | |
d52f5295 ML |
1902 | force_output = false; |
1903 | forced_by_abi = false; | |
18d13f34 | 1904 | |
ab4664eb | 1905 | unregister (clone_info_set ? &saved_info : NULL); |
d52f5295 ML |
1906 | if (prev_sibling_clone) |
1907 | prev_sibling_clone->next_sibling_clone = next_sibling_clone; | |
1908 | else if (clone_of) | |
1909 | clone_of->clones = next_sibling_clone; | |
1910 | if (next_sibling_clone) | |
1911 | next_sibling_clone->prev_sibling_clone = prev_sibling_clone; | |
1912 | if (clones) | |
18c6ada9 | 1913 | { |
3dafb85c | 1914 | cgraph_node *n, *next; |
47cb0d7d | 1915 | |
d52f5295 | 1916 | if (clone_of) |
ae7a23a3 | 1917 | { |
d52f5295 ML |
1918 | for (n = clones; n->next_sibling_clone; n = n->next_sibling_clone) |
1919 | n->clone_of = clone_of; | |
1920 | n->clone_of = clone_of; | |
1921 | n->next_sibling_clone = clone_of->clones; | |
1922 | if (clone_of->clones) | |
1923 | clone_of->clones->prev_sibling_clone = n; | |
1924 | clone_of->clones = clones; | |
47cb0d7d JH |
1925 | } |
1926 | else | |
ae7a23a3 | 1927 | { |
66a20fc2 | 1928 | /* We are removing node with clones. This makes clones inconsistent, |
47cb0d7d JH |
1929 | but assume they will be removed subsequently and just keep clone |
1930 | tree intact. This can happen in unreachable function removal since | |
1931 | we remove unreachable functions in random order, not by bottom-up | |
1932 | walk of clone trees. */ | |
d52f5295 | 1933 | for (n = clones; n; n = next) |
47cb0d7d JH |
1934 | { |
1935 | next = n->next_sibling_clone; | |
1936 | n->next_sibling_clone = NULL; | |
1937 | n->prev_sibling_clone = NULL; | |
1938 | n->clone_of = NULL; | |
1939 | } | |
1940 | } | |
18c6ada9 JH |
1941 | } |
1942 | ||
c22cacf3 | 1943 | /* While all the clones are removed after being proceeded, the function |
4a76d91a JH |
1944 | itself is kept in the cgraph even after it is compiled. Check whether |
1945 | we are done with this body and reclaim it proactively if this is the case. | |
1946 | */ | |
3dafb85c | 1947 | if (symtab->state != LTO_STREAMING) |
4f63dfc6 | 1948 | { |
cc849505 | 1949 | cgraph_node *n = cgraph_node::get (decl); |
4f63dfc6 | 1950 | if (!n |
a62bfab5 | 1951 | || (!n->clones && !n->clone_of && !n->inlined_to |
1c4db829 | 1952 | && ((symtab->global_info_ready || in_lto_p) |
67348ccc DM |
1953 | && (TREE_ASM_WRITTEN (n->decl) |
1954 | || DECL_EXTERNAL (n->decl) | |
1955 | || !n->analyzed | |
1956 | || (!flag_wpa && n->in_other_partition))))) | |
d52f5295 | 1957 | release_body (); |
4f63dfc6 | 1958 | } |
1c4db829 JH |
1959 | else |
1960 | { | |
1961 | lto_free_function_in_decl_state_for_node (this); | |
1962 | lto_file_data = NULL; | |
1963 | } | |
1ab24192 | 1964 | |
d52f5295 ML |
1965 | decl = NULL; |
1966 | if (call_site_hash) | |
70d539ce | 1967 | { |
2a22f99c | 1968 | call_site_hash->empty (); |
d52f5295 | 1969 | call_site_hash = NULL; |
70d539ce | 1970 | } |
2fb16412 | 1971 | |
74644756 | 1972 | symtab->release_symbol (this); |
18d13f34 JH |
1973 | } |
1974 | ||
39ff5a96 JH |
1975 | /* Likewise indicate that a node is having address taken. */ |
1976 | ||
1977 | void | |
d52f5295 | 1978 | cgraph_node::mark_address_taken (void) |
39ff5a96 | 1979 | { |
4502fe8d MJ |
1980 | /* Indirect inlining can figure out that all uses of the address are |
1981 | inlined. */ | |
a62bfab5 | 1982 | if (inlined_to) |
4502fe8d MJ |
1983 | { |
1984 | gcc_assert (cfun->after_inlining); | |
d52f5295 | 1985 | gcc_assert (callers->indirect_inlining_edge); |
4502fe8d MJ |
1986 | return; |
1987 | } | |
39e2db00 JH |
1988 | /* FIXME: address_taken flag is used both as a shortcut for testing whether |
1989 | IPA_REF_ADDR reference exists (and thus it should be set on node | |
1990 | representing alias we take address of) and as a test whether address | |
1991 | of the object was taken (and thus it should be set on node alias is | |
1992 | referring to). We should remove the first use and the remove the | |
1993 | following set. */ | |
d52f5295 ML |
1994 | address_taken = 1; |
1995 | cgraph_node *node = ultimate_alias_target (); | |
67348ccc | 1996 | node->address_taken = 1; |
39ff5a96 JH |
1997 | } |
1998 | ||
87f94429 | 1999 | /* Return local info node for the compiled function. */ |
dafc5b82 | 2000 | |
87f94429 ML |
2001 | cgraph_node * |
2002 | cgraph_node::local_info_node (tree decl) | |
dafc5b82 | 2003 | { |
341c100f | 2004 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
3dafb85c | 2005 | cgraph_node *node = get (decl); |
9f9ebcdf MJ |
2006 | if (!node) |
2007 | return NULL; | |
87f94429 | 2008 | return node->ultimate_alias_target (); |
dafc5b82 JH |
2009 | } |
2010 | ||
ef736163 | 2011 | /* Return RTL info for the compiled function. */ |
b255a036 | 2012 | |
3dafb85c | 2013 | cgraph_rtl_info * |
5a5a3bc5 | 2014 | cgraph_node::rtl_info (const_tree decl) |
b255a036 | 2015 | { |
341c100f | 2016 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
3dafb85c | 2017 | cgraph_node *node = get (decl); |
4bd019b8 JH |
2018 | if (!node) |
2019 | return NULL; | |
fc15d9ec JJ |
2020 | enum availability avail; |
2021 | node = node->ultimate_alias_target (&avail); | |
2022 | if (decl != current_function_decl | |
2023 | && (avail < AVAIL_AVAILABLE | |
2024 | || (node->decl != current_function_decl | |
2025 | && !TREE_ASM_WRITTEN (node->decl)))) | |
b255a036 | 2026 | return NULL; |
fc15d9ec JJ |
2027 | /* Allocate if it doesn't exist. */ |
2028 | if (node->rtl == NULL) | |
5a5a3bc5 RS |
2029 | { |
2030 | node->rtl = ggc_cleared_alloc<cgraph_rtl_info> (); | |
aa29ed6d | 2031 | SET_HARD_REG_SET (node->rtl->function_used_regs); |
5a5a3bc5 | 2032 | } |
fc15d9ec | 2033 | return node->rtl; |
b255a036 JH |
2034 | } |
2035 | ||
61a05df1 JH |
2036 | /* Return a string describing the failure REASON. */ |
2037 | ||
2038 | const char* | |
2039 | cgraph_inline_failed_string (cgraph_inline_failed_t reason) | |
2040 | { | |
2041 | #undef DEFCIFCODE | |
1cf11770 | 2042 | #define DEFCIFCODE(code, type, string) string, |
61a05df1 JH |
2043 | |
2044 | static const char *cif_string_table[CIF_N_REASONS] = { | |
2045 | #include "cif-code.def" | |
2046 | }; | |
2047 | ||
2048 | /* Signedness of an enum type is implementation defined, so cast it | |
2049 | to unsigned before testing. */ | |
2050 | gcc_assert ((unsigned) reason < CIF_N_REASONS); | |
2051 | return cif_string_table[reason]; | |
2052 | } | |
2053 | ||
1cf11770 L |
2054 | /* Return a type describing the failure REASON. */ |
2055 | ||
2056 | cgraph_inline_failed_type_t | |
2057 | cgraph_inline_failed_type (cgraph_inline_failed_t reason) | |
2058 | { | |
2059 | #undef DEFCIFCODE | |
2060 | #define DEFCIFCODE(code, type, string) type, | |
2061 | ||
2062 | static cgraph_inline_failed_type_t cif_type_table[CIF_N_REASONS] = { | |
2063 | #include "cif-code.def" | |
2064 | }; | |
2065 | ||
2066 | /* Signedness of an enum type is implementation defined, so cast it | |
2067 | to unsigned before testing. */ | |
2068 | gcc_assert ((unsigned) reason < CIF_N_REASONS); | |
2069 | return cif_type_table[reason]; | |
2070 | } | |
2071 | ||
6b02a499 | 2072 | /* Names used to print out the availability enum. */ |
8a4a83ed | 2073 | const char * const cgraph_availability_names[] = |
fa10beec | 2074 | {"unset", "not_available", "overwritable", "available", "local"}; |
6b02a499 | 2075 | |
90988f77 | 2076 | /* Output flags of edge to a file F. */ |
ba392339 | 2077 | |
90988f77 ML |
2078 | void |
2079 | cgraph_edge::dump_edge_flags (FILE *f) | |
ba392339 | 2080 | { |
90988f77 | 2081 | if (speculative) |
ba392339 | 2082 | fprintf (f, "(speculative) "); |
90988f77 | 2083 | if (!inline_failed) |
ba392339 | 2084 | fprintf (f, "(inlined) "); |
1a0bf5e1 JH |
2085 | if (call_stmt_cannot_inline_p) |
2086 | fprintf (f, "(call_stmt_cannot_inline_p) "); | |
90988f77 | 2087 | if (indirect_inlining_edge) |
ba392339 | 2088 | fprintf (f, "(indirect_inlining) "); |
3995f3a2 JH |
2089 | if (count.initialized_p ()) |
2090 | { | |
2091 | fprintf (f, "("); | |
2092 | count.dump (f); | |
1bad9c18 | 2093 | fprintf (f, ","); |
7349698e | 2094 | fprintf (f, "%.2f per call) ", sreal_frequency ().to_double ()); |
3995f3a2 | 2095 | } |
90988f77 | 2096 | if (can_throw_external) |
ba392339 JH |
2097 | fprintf (f, "(can throw external) "); |
2098 | } | |
c4e622b6 | 2099 | |
b2784a96 ML |
2100 | /* Dump edge to stderr. */ |
2101 | ||
2102 | void | |
2103 | cgraph_edge::debug (void) | |
2104 | { | |
2105 | fprintf (stderr, "%s -> %s ", caller->dump_asm_name (), | |
2106 | callee == NULL ? "(null)" : callee->dump_asm_name ()); | |
2107 | dump_edge_flags (stderr); | |
2108 | fprintf (stderr, "\n\n"); | |
2109 | caller->debug (); | |
2110 | if (callee != NULL) | |
2111 | callee->debug (); | |
2112 | } | |
2113 | ||
d52f5295 | 2114 | /* Dump call graph node to file F. */ |
c4e622b6 | 2115 | |
18c6ada9 | 2116 | void |
d52f5295 | 2117 | cgraph_node::dump (FILE *f) |
18c6ada9 | 2118 | { |
3dafb85c | 2119 | cgraph_edge *edge; |
e33c6cd6 | 2120 | |
d52f5295 | 2121 | dump_base (f); |
8f940ee6 | 2122 | |
a62bfab5 | 2123 | if (inlined_to) |
464d0118 ML |
2124 | fprintf (f, " Function %s is inline copy in %s\n", |
2125 | dump_name (), | |
a62bfab5 | 2126 | inlined_to->dump_name ()); |
d52f5295 | 2127 | if (clone_of) |
464d0118 | 2128 | fprintf (f, " Clone of %s\n", clone_of->dump_asm_name ()); |
3dafb85c | 2129 | if (symtab->function_flags_ready) |
8f940ee6 | 2130 | fprintf (f, " Availability: %s\n", |
d52f5295 | 2131 | cgraph_availability_names [get_availability ()]); |
8f940ee6 | 2132 | |
d52f5295 | 2133 | if (profile_id) |
634ab819 | 2134 | fprintf (f, " Profile id: %i\n", |
d52f5295 | 2135 | profile_id); |
b74d8dc4 JH |
2136 | if (unit_id) |
2137 | fprintf (f, " Unit id: %i\n", | |
2138 | unit_id); | |
9e57787b ML |
2139 | cgraph_function_version_info *vi = function_version (); |
2140 | if (vi != NULL) | |
2141 | { | |
2142 | fprintf (f, " Version info: "); | |
2143 | if (vi->prev != NULL) | |
2144 | { | |
2145 | fprintf (f, "prev: "); | |
464d0118 | 2146 | fprintf (f, "%s ", vi->prev->this_node->dump_asm_name ()); |
9e57787b ML |
2147 | } |
2148 | if (vi->next != NULL) | |
2149 | { | |
2150 | fprintf (f, "next: "); | |
464d0118 | 2151 | fprintf (f, "%s ", vi->next->this_node->dump_asm_name ()); |
9e57787b ML |
2152 | } |
2153 | if (vi->dispatcher_resolver != NULL_TREE) | |
2154 | fprintf (f, "dispatcher: %s", | |
2155 | lang_hooks.decl_printable_name (vi->dispatcher_resolver, 2)); | |
2156 | ||
2157 | fprintf (f, "\n"); | |
2158 | } | |
8f940ee6 | 2159 | fprintf (f, " Function flags:"); |
3995f3a2 JH |
2160 | if (count.initialized_p ()) |
2161 | { | |
19b55958 | 2162 | fprintf (f, " count:"); |
3995f3a2 JH |
2163 | count.dump (f); |
2164 | } | |
19b55958 | 2165 | if (tp_first_run > 0) |
6d8fd122 | 2166 | fprintf (f, " first_run:%" PRId64, (int64_t) tp_first_run); |
89576d86 | 2167 | if (cgraph_node *origin = nested_function_origin (this)) |
3629ff8a | 2168 | fprintf (f, " nested in:%s", origin->dump_asm_name ()); |
d52f5295 | 2169 | if (gimple_has_body_p (decl)) |
726a989a | 2170 | fprintf (f, " body"); |
d52f5295 | 2171 | if (process) |
257eb6e3 | 2172 | fprintf (f, " process"); |
87f94429 | 2173 | if (local) |
18c6ada9 | 2174 | fprintf (f, " local"); |
87f94429 | 2175 | if (redefined_extern_inline) |
e7d6beb0 | 2176 | fprintf (f, " redefined_extern_inline"); |
d52f5295 | 2177 | if (only_called_at_startup) |
844db5d0 | 2178 | fprintf (f, " only_called_at_startup"); |
d52f5295 | 2179 | if (only_called_at_exit) |
844db5d0 | 2180 | fprintf (f, " only_called_at_exit"); |
d52f5295 | 2181 | if (tm_clone) |
0a35513e | 2182 | fprintf (f, " tm_clone"); |
c6cf6ef7 ML |
2183 | if (calls_comdat_local) |
2184 | fprintf (f, " calls_comdat_local"); | |
b84d4347 ML |
2185 | if (icf_merged) |
2186 | fprintf (f, " icf_merged"); | |
88636b62 JH |
2187 | if (merged_comdat) |
2188 | fprintf (f, " merged_comdat"); | |
b74d8dc4 JH |
2189 | if (merged_extern_inline) |
2190 | fprintf (f, " merged_extern_inline"); | |
4f4ada6a JH |
2191 | if (split_part) |
2192 | fprintf (f, " split_part"); | |
2193 | if (indirect_call_target) | |
2194 | fprintf (f, " indirect_call_target"); | |
8413ca87 JJ |
2195 | if (nonfreeing_fn) |
2196 | fprintf (f, " nonfreeing_fn"); | |
d52f5295 ML |
2197 | if (DECL_STATIC_CONSTRUCTOR (decl)) |
2198 | fprintf (f," static_constructor (priority:%i)", get_init_priority ()); | |
2199 | if (DECL_STATIC_DESTRUCTOR (decl)) | |
2200 | fprintf (f," static_destructor (priority:%i)", get_fini_priority ()); | |
a89bd7d2 JH |
2201 | if (frequency == NODE_FREQUENCY_HOT) |
2202 | fprintf (f, " hot"); | |
2203 | if (frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED) | |
2204 | fprintf (f, " unlikely_executed"); | |
2205 | if (frequency == NODE_FREQUENCY_EXECUTED_ONCE) | |
2206 | fprintf (f, " executed_once"); | |
a89bd7d2 JH |
2207 | if (opt_for_fn (decl, optimize_size)) |
2208 | fprintf (f, " optimize_size"); | |
a79b7ec5 TV |
2209 | if (parallelized_function) |
2210 | fprintf (f, " parallelized_function"); | |
f5850e7d ML |
2211 | if (DECL_IS_MALLOC (decl)) |
2212 | fprintf (f, " decl_is_malloc"); | |
3a961aea | 2213 | if (DECL_IS_OPERATOR_NEW_P (decl)) |
70df40ca ML |
2214 | fprintf (f, " %soperator_new", |
2215 | DECL_IS_REPLACEABLE_OPERATOR (decl) ? "replaceable_" : ""); | |
3a961aea | 2216 | if (DECL_IS_OPERATOR_DELETE_P (decl)) |
70df40ca ML |
2217 | fprintf (f, " %soperator_delete", |
2218 | DECL_IS_REPLACEABLE_OPERATOR (decl) ? "replaceable_" : ""); | |
18c6ada9 | 2219 | |
c47d0034 JH |
2220 | fprintf (f, "\n"); |
2221 | ||
67f3791f | 2222 | if (thunk) |
c47d0034 | 2223 | { |
40a7fe1e | 2224 | fprintf (f, " Thunk"); |
67f3791f | 2225 | thunk_info::get (this)->dump (f); |
c47d0034 | 2226 | } |
1738b522 | 2227 | else if (former_thunk_p ()) |
39e2db00 | 2228 | { |
67f3791f JH |
2229 | fprintf (f, " Former thunk "); |
2230 | thunk_info::get (this)->dump (f); | |
39e2db00 | 2231 | } |
67f3791f | 2232 | else gcc_checking_assert (!thunk_info::get (this)); |
c47d0034 | 2233 | |
8f940ee6 | 2234 | fprintf (f, " Called by: "); |
c47d0034 | 2235 | |
7c41b76e | 2236 | profile_count sum = profile_count::zero (); |
d52f5295 | 2237 | for (edge = callers; edge; edge = edge->next_caller) |
18c6ada9 | 2238 | { |
4dfa3251 | 2239 | fprintf (f, "%s ", edge->caller->dump_asm_name ()); |
90988f77 | 2240 | edge->dump_edge_flags (f); |
7c41b76e | 2241 | if (edge->count.initialized_p ()) |
d53a5d8b | 2242 | sum += edge->count.ipa (); |
18c6ada9 JH |
2243 | } |
2244 | ||
8f940ee6 | 2245 | fprintf (f, "\n Calls: "); |
d52f5295 | 2246 | for (edge = callees; edge; edge = edge->next_callee) |
18c6ada9 | 2247 | { |
4dfa3251 | 2248 | fprintf (f, "%s ", edge->callee->dump_asm_name ()); |
90988f77 | 2249 | edge->dump_edge_flags (f); |
18c6ada9 JH |
2250 | } |
2251 | fprintf (f, "\n"); | |
6744a6ab | 2252 | |
1bad9c18 | 2253 | if (count.ipa ().initialized_p ()) |
7c41b76e JH |
2254 | { |
2255 | bool ok = true; | |
2256 | bool min = false; | |
2257 | ipa_ref *ref; | |
2258 | ||
2259 | FOR_EACH_ALIAS (this, ref) | |
2260 | if (dyn_cast <cgraph_node *> (ref->referring)->count.initialized_p ()) | |
1bad9c18 | 2261 | sum += dyn_cast <cgraph_node *> (ref->referring)->count.ipa (); |
7c41b76e | 2262 | |
a62bfab5 | 2263 | if (inlined_to |
7c41b76e JH |
2264 | || (symtab->state < EXPANSION |
2265 | && ultimate_alias_target () == this && only_called_directly_p ())) | |
d53a5d8b | 2266 | ok = !count.ipa ().differs_from_p (sum); |
1bad9c18 JH |
2267 | else if (count.ipa () > profile_count::from_gcov_type (100) |
2268 | && count.ipa () < sum.apply_scale (99, 100)) | |
7c41b76e JH |
2269 | ok = false, min = true; |
2270 | if (!ok) | |
2271 | { | |
2272 | fprintf (f, " Invalid sum of caller counts "); | |
2273 | sum.dump (f); | |
2274 | if (min) | |
2275 | fprintf (f, ", should be at most "); | |
2276 | else | |
2277 | fprintf (f, ", should be "); | |
d53a5d8b | 2278 | count.ipa ().dump (f); |
7c41b76e JH |
2279 | fprintf (f, "\n"); |
2280 | } | |
2281 | } | |
2282 | ||
d52f5295 | 2283 | for (edge = indirect_calls; edge; edge = edge->next_callee) |
ba392339 JH |
2284 | { |
2285 | if (edge->indirect_info->polymorphic) | |
2286 | { | |
ae7a23a3 | 2287 | fprintf (f, " Polymorphic indirect call of type "); |
ba392339 JH |
2288 | print_generic_expr (f, edge->indirect_info->otr_type, TDF_SLIM); |
2289 | fprintf (f, " token:%i", (int) edge->indirect_info->otr_token); | |
2290 | } | |
2291 | else | |
ae7a23a3 | 2292 | fprintf (f, " Indirect call"); |
90988f77 | 2293 | edge->dump_edge_flags (f); |
ba392339 JH |
2294 | if (edge->indirect_info->param_index != -1) |
2295 | { | |
e9e2953c | 2296 | fprintf (f, "of param:%i ", edge->indirect_info->param_index); |
ba392339 | 2297 | if (edge->indirect_info->agg_contents) |
e9e2953c | 2298 | fprintf (f, "loaded from %s %s at offset %i ", |
ba392339 JH |
2299 | edge->indirect_info->member_ptr ? "member ptr" : "aggregate", |
2300 | edge->indirect_info->by_ref ? "passed by reference":"", | |
2301 | (int)edge->indirect_info->offset); | |
0127c169 | 2302 | if (edge->indirect_info->vptr_changed) |
e9e2953c | 2303 | fprintf (f, "(vptr maybe changed) "); |
ba392339 | 2304 | } |
e9e2953c | 2305 | fprintf (f, "num speculative call targets: %i\n", |
f1ba88b1 | 2306 | edge->indirect_info->num_speculative_call_targets); |
ba392339 JH |
2307 | if (edge->indirect_info->polymorphic) |
2308 | edge->indirect_info->context.dump (f); | |
2309 | } | |
18c6ada9 JH |
2310 | } |
2311 | ||
34e64622 GB |
2312 | /* Dump call graph node to file F in graphviz format. */ |
2313 | ||
2314 | void | |
2315 | cgraph_node::dump_graphviz (FILE *f) | |
2316 | { | |
2317 | cgraph_edge *edge; | |
2318 | ||
2319 | for (edge = callees; edge; edge = edge->next_callee) | |
2320 | { | |
2321 | cgraph_node *callee = edge->callee; | |
2322 | ||
51940760 | 2323 | fprintf (f, "\t\"%s\" -> \"%s\"\n", dump_name (), callee->dump_name ()); |
34e64622 GB |
2324 | } |
2325 | } | |
2326 | ||
2327 | ||
c4e622b6 DN |
2328 | /* Dump call graph node NODE to stderr. */ |
2329 | ||
24e47c76 | 2330 | DEBUG_FUNCTION void |
d52f5295 | 2331 | cgraph_node::debug (void) |
c4e622b6 | 2332 | { |
d52f5295 | 2333 | dump (stderr); |
c4e622b6 DN |
2334 | } |
2335 | ||
c4e622b6 | 2336 | /* Dump the callgraph to file F. */ |
e72fcfe8 JH |
2337 | |
2338 | void | |
d52f5295 | 2339 | cgraph_node::dump_cgraph (FILE *f) |
e72fcfe8 | 2340 | { |
3dafb85c | 2341 | cgraph_node *node; |
e72fcfe8 | 2342 | |
7d82fe7c | 2343 | fprintf (f, "callgraph:\n\n"); |
65c70e6b | 2344 | FOR_EACH_FUNCTION (node) |
d52f5295 | 2345 | node->dump (f); |
c4e622b6 DN |
2346 | } |
2347 | ||
1bb17c21 | 2348 | /* Return true when the DECL can possibly be inlined. */ |
d52f5295 | 2349 | |
1bb17c21 JH |
2350 | bool |
2351 | cgraph_function_possibly_inlined_p (tree decl) | |
2352 | { | |
3dafb85c | 2353 | if (!symtab->global_info_ready) |
e90acd93 | 2354 | return !DECL_UNINLINABLE (decl); |
6f312d18 | 2355 | return DECL_POSSIBLY_INLINED (decl); |
18c6ada9 JH |
2356 | } |
2357 | ||
6b02a499 JH |
2358 | /* Return function availability. See cgraph.h for description of individual |
2359 | return values. */ | |
2360 | enum availability | |
f13fe18b | 2361 | cgraph_node::get_availability (symtab_node *ref) |
6b02a499 | 2362 | { |
f13fe18b JH |
2363 | if (ref) |
2364 | { | |
2365 | cgraph_node *cref = dyn_cast <cgraph_node *> (ref); | |
2366 | if (cref) | |
a62bfab5 | 2367 | ref = cref->inlined_to; |
f13fe18b | 2368 | } |
6b02a499 | 2369 | enum availability avail; |
27eac88a | 2370 | if (!analyzed && !in_other_partition) |
6b02a499 | 2371 | avail = AVAIL_NOT_AVAILABLE; |
87f94429 | 2372 | else if (local) |
6b02a499 | 2373 | avail = AVAIL_LOCAL; |
a62bfab5 | 2374 | else if (inlined_to) |
f13fe18b | 2375 | avail = AVAIL_AVAILABLE; |
71e54687 | 2376 | else if (transparent_alias) |
f13fe18b | 2377 | ultimate_alias_target (&avail, ref); |
aab778d3 | 2378 | else if (ifunc_resolver |
036ea399 | 2379 | || lookup_attribute ("noipa", DECL_ATTRIBUTES (decl))) |
d52f5295 ML |
2380 | avail = AVAIL_INTERPOSABLE; |
2381 | else if (!externally_visible) | |
6b02a499 | 2382 | avail = AVAIL_AVAILABLE; |
f13fe18b | 2383 | /* If this is a reference from symbol itself and there are no aliases, we |
65c74eb2 | 2384 | may be sure that the symbol was not interposed by something else because |
f13fe18b JH |
2385 | the symbol itself would be unreachable otherwise. |
2386 | ||
2387 | Also comdat groups are always resolved in groups. */ | |
2388 | else if ((this == ref && !has_aliases_p ()) | |
ae7a23a3 JH |
2389 | || (ref && get_comdat_group () |
2390 | && get_comdat_group () == ref->get_comdat_group ())) | |
f13fe18b | 2391 | avail = AVAIL_AVAILABLE; |
61502ca8 NF |
2392 | /* Inline functions are safe to be analyzed even if their symbol can |
2393 | be overwritten at runtime. It is not meaningful to enforce any sane | |
9c582551 | 2394 | behavior on replacing inline function by different body. */ |
d52f5295 | 2395 | else if (DECL_DECLARED_INLINE_P (decl)) |
4a371c8d | 2396 | avail = AVAIL_AVAILABLE; |
6b02a499 JH |
2397 | |
2398 | /* If the function can be overwritten, return OVERWRITABLE. Take | |
2399 | care at least of two notable extensions - the COMDAT functions | |
2400 | used to share template instantiations in C++ (this is symmetric | |
2401 | to code cp_cannot_inline_tree_fn and probably shall be shared and | |
f13fe18b | 2402 | the inlinability hooks completely eliminated). */ |
4a371c8d | 2403 | |
d52f5295 ML |
2404 | else if (decl_replaceable_p (decl) && !DECL_EXTERNAL (decl)) |
2405 | avail = AVAIL_INTERPOSABLE; | |
6b02a499 JH |
2406 | else avail = AVAIL_AVAILABLE; |
2407 | ||
2408 | return avail; | |
2409 | } | |
2410 | ||
be330ed4 JH |
2411 | /* Worker for cgraph_node_can_be_local_p. */ |
2412 | static bool | |
3dafb85c | 2413 | cgraph_node_cannot_be_local_p_1 (cgraph_node *node, void *) |
be330ed4 | 2414 | { |
67348ccc | 2415 | return !(!node->force_output |
2dfd63de | 2416 | && !node->ifunc_resolver |
40ebe1fc JH |
2417 | /* Limitation of gas requires us to output targets of symver aliases |
2418 | as global symbols. This is binutils PR 25295. */ | |
2419 | && !node->symver | |
67348ccc DM |
2420 | && ((DECL_COMDAT (node->decl) |
2421 | && !node->forced_by_abi | |
d52f5295 | 2422 | && !node->used_from_object_file_p () |
67348ccc DM |
2423 | && !node->same_comdat_group) |
2424 | || !node->externally_visible)); | |
be330ed4 JH |
2425 | } |
2426 | ||
d52f5295 | 2427 | /* Return true if cgraph_node can be made local for API change. |
a550d677 MJ |
2428 | Extern inline functions and C++ COMDAT functions can be made local |
2429 | at the expense of possible code size growth if function is used in multiple | |
2430 | compilation units. */ | |
2431 | bool | |
d52f5295 | 2432 | cgraph_node::can_be_local_p (void) |
a550d677 | 2433 | { |
d52f5295 ML |
2434 | return (!address_taken |
2435 | && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1, | |
2436 | NULL, true)); | |
a550d677 MJ |
2437 | } |
2438 | ||
6cbde2e3 | 2439 | /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node. |
6b715bf6 | 2440 | When INCLUDE_OVERWRITABLE is false, overwritable symbols are |
6cbde2e3 BE |
2441 | skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are |
2442 | skipped. */ | |
be330ed4 | 2443 | bool |
d52f5295 ML |
2444 | cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback) |
2445 | (cgraph_node *, void *), | |
2446 | void *data, | |
6cbde2e3 BE |
2447 | bool include_overwritable, |
2448 | bool exclude_virtual_thunks) | |
be330ed4 | 2449 | { |
3dafb85c ML |
2450 | cgraph_edge *e; |
2451 | ipa_ref *ref; | |
6b715bf6 | 2452 | enum availability avail = AVAIL_AVAILABLE; |
be330ed4 | 2453 | |
6b715bf6 JH |
2454 | if (include_overwritable |
2455 | || (avail = get_availability ()) > AVAIL_INTERPOSABLE) | |
2456 | { | |
2457 | if (callback (this, data)) | |
ae7a23a3 | 2458 | return true; |
6b715bf6 | 2459 | } |
1ede94c5 JH |
2460 | FOR_EACH_ALIAS (this, ref) |
2461 | { | |
2462 | cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); | |
2463 | if (include_overwritable | |
2464 | || alias->get_availability () > AVAIL_INTERPOSABLE) | |
2465 | if (alias->call_for_symbol_thunks_and_aliases (callback, data, | |
2466 | include_overwritable, | |
2467 | exclude_virtual_thunks)) | |
2468 | return true; | |
2469 | } | |
6b715bf6 | 2470 | if (avail <= AVAIL_INTERPOSABLE) |
69a4e898 | 2471 | return false; |
d52f5295 | 2472 | for (e = callers; e; e = e->next_caller) |
67f3791f | 2473 | if (e->caller->thunk |
be330ed4 | 2474 | && (include_overwritable |
6cbde2e3 BE |
2475 | || e->caller->get_availability () > AVAIL_INTERPOSABLE) |
2476 | && !(exclude_virtual_thunks | |
67f3791f | 2477 | && thunk_info::get (e->caller)->virtual_offset_p)) |
d52f5295 | 2478 | if (e->caller->call_for_symbol_thunks_and_aliases (callback, data, |
6cbde2e3 BE |
2479 | include_overwritable, |
2480 | exclude_virtual_thunks)) | |
9aa3f5c5 | 2481 | return true; |
e55637b7 | 2482 | |
be330ed4 JH |
2483 | return false; |
2484 | } | |
2485 | ||
be330ed4 JH |
2486 | /* Worker to bring NODE local. */ |
2487 | ||
d52f5295 | 2488 | bool |
3dafb85c | 2489 | cgraph_node::make_local (cgraph_node *node, void *) |
be330ed4 | 2490 | { |
d52f5295 | 2491 | gcc_checking_assert (node->can_be_local_p ()); |
67348ccc | 2492 | if (DECL_COMDAT (node->decl) || DECL_EXTERNAL (node->decl)) |
a550d677 | 2493 | { |
d52f5295 | 2494 | node->make_decl_local (); |
da66d596 | 2495 | node->set_section (NULL); |
24d047a3 | 2496 | node->set_comdat_group (NULL); |
67348ccc DM |
2497 | node->externally_visible = false; |
2498 | node->forced_by_abi = false; | |
87f94429 | 2499 | node->local = true; |
da66d596 | 2500 | node->set_section (NULL); |
f1703a2e JH |
2501 | node->unique_name = ((node->resolution == LDPR_PREVAILING_DEF_IRONLY |
2502 | || node->resolution == LDPR_PREVAILING_DEF_IRONLY_EXP) | |
2503 | && !flag_incremental_link); | |
67348ccc | 2504 | node->resolution = LDPR_PREVAILING_DEF_IRONLY; |
d52f5295 | 2505 | gcc_assert (node->get_availability () == AVAIL_LOCAL); |
a550d677 | 2506 | } |
be330ed4 | 2507 | return false; |
a550d677 MJ |
2508 | } |
2509 | ||
d52f5295 | 2510 | /* Bring cgraph node local. */ |
be330ed4 JH |
2511 | |
2512 | void | |
d52f5295 | 2513 | cgraph_node::make_local (void) |
be330ed4 | 2514 | { |
d52f5295 | 2515 | call_for_symbol_thunks_and_aliases (cgraph_node::make_local, NULL, true); |
be330ed4 JH |
2516 | } |
2517 | ||
2518 | /* Worker to set nothrow flag. */ | |
2519 | ||
a2b056a3 JH |
2520 | static void |
2521 | set_nothrow_flag_1 (cgraph_node *node, bool nothrow, bool non_call, | |
2522 | bool *changed) | |
be330ed4 | 2523 | { |
3dafb85c | 2524 | cgraph_edge *e; |
71fb4f92 | 2525 | |
a2b056a3 JH |
2526 | if (nothrow && !TREE_NOTHROW (node->decl)) |
2527 | { | |
2528 | /* With non-call exceptions we can't say for sure if other function body | |
dfea3d6f | 2529 | was not possibly optimized to still throw. */ |
a2b056a3 JH |
2530 | if (!non_call || node->binds_to_current_def_p ()) |
2531 | { | |
2532 | TREE_NOTHROW (node->decl) = true; | |
2533 | *changed = true; | |
2534 | for (e = node->callers; e; e = e->next_caller) | |
2535 | e->can_throw_external = false; | |
2536 | } | |
2537 | } | |
2538 | else if (!nothrow && TREE_NOTHROW (node->decl)) | |
2539 | { | |
2540 | TREE_NOTHROW (node->decl) = false; | |
2541 | *changed = true; | |
2542 | } | |
2543 | ipa_ref *ref; | |
2544 | FOR_EACH_ALIAS (node, ref) | |
2545 | { | |
2546 | cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); | |
2547 | if (!nothrow || alias->get_availability () > AVAIL_INTERPOSABLE) | |
2548 | set_nothrow_flag_1 (alias, nothrow, non_call, changed); | |
2549 | } | |
2550 | for (cgraph_edge *e = node->callers; e; e = e->next_caller) | |
67f3791f | 2551 | if (e->caller->thunk |
a2b056a3 JH |
2552 | && (!nothrow || e->caller->get_availability () > AVAIL_INTERPOSABLE)) |
2553 | set_nothrow_flag_1 (e->caller, nothrow, non_call, changed); | |
be330ed4 JH |
2554 | } |
2555 | ||
2556 | /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE | |
20cdc2be JJ |
2557 | if any to NOTHROW. */ |
2558 | ||
a2b056a3 | 2559 | bool |
d52f5295 | 2560 | cgraph_node::set_nothrow_flag (bool nothrow) |
20cdc2be | 2561 | { |
a2b056a3 JH |
2562 | bool changed = false; |
2563 | bool non_call = opt_for_fn (decl, flag_non_call_exceptions); | |
2564 | ||
2565 | if (!nothrow || get_availability () > AVAIL_INTERPOSABLE) | |
2566 | set_nothrow_flag_1 (this, nothrow, non_call, &changed); | |
2567 | else | |
2568 | { | |
2569 | ipa_ref *ref; | |
2570 | ||
2571 | FOR_EACH_ALIAS (this, ref) | |
2572 | { | |
2573 | cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); | |
2574 | if (!nothrow || alias->get_availability () > AVAIL_INTERPOSABLE) | |
2575 | set_nothrow_flag_1 (alias, nothrow, non_call, &changed); | |
2576 | } | |
2577 | } | |
2578 | return changed; | |
20cdc2be JJ |
2579 | } |
2580 | ||
0fab169b PK |
2581 | /* Worker to set malloc flag. */ |
2582 | static void | |
2583 | set_malloc_flag_1 (cgraph_node *node, bool malloc_p, bool *changed) | |
2584 | { | |
2585 | if (malloc_p && !DECL_IS_MALLOC (node->decl)) | |
2586 | { | |
2587 | DECL_IS_MALLOC (node->decl) = true; | |
2588 | *changed = true; | |
2589 | } | |
2590 | ||
2591 | ipa_ref *ref; | |
2592 | FOR_EACH_ALIAS (node, ref) | |
2593 | { | |
2594 | cgraph_node *alias = dyn_cast<cgraph_node *> (ref->referring); | |
2595 | if (!malloc_p || alias->get_availability () > AVAIL_INTERPOSABLE) | |
2596 | set_malloc_flag_1 (alias, malloc_p, changed); | |
2597 | } | |
2598 | ||
2599 | for (cgraph_edge *e = node->callers; e; e = e->next_caller) | |
67f3791f | 2600 | if (e->caller->thunk |
0fab169b PK |
2601 | && (!malloc_p || e->caller->get_availability () > AVAIL_INTERPOSABLE)) |
2602 | set_malloc_flag_1 (e->caller, malloc_p, changed); | |
2603 | } | |
2604 | ||
2605 | /* Set DECL_IS_MALLOC on NODE's decl and on NODE's aliases if any. */ | |
2606 | ||
2607 | bool | |
2608 | cgraph_node::set_malloc_flag (bool malloc_p) | |
2609 | { | |
2610 | bool changed = false; | |
2611 | ||
2612 | if (!malloc_p || get_availability () > AVAIL_INTERPOSABLE) | |
2613 | set_malloc_flag_1 (this, malloc_p, &changed); | |
2614 | else | |
2615 | { | |
2616 | ipa_ref *ref; | |
2617 | ||
2618 | FOR_EACH_ALIAS (this, ref) | |
2619 | { | |
2620 | cgraph_node *alias = dyn_cast<cgraph_node *> (ref->referring); | |
2621 | if (!malloc_p || alias->get_availability () > AVAIL_INTERPOSABLE) | |
2622 | set_malloc_flag_1 (alias, malloc_p, &changed); | |
2623 | } | |
2624 | } | |
2625 | return changed; | |
2626 | } | |
2627 | ||
69a4e898 | 2628 | /* Worker to set_const_flag. */ |
20cdc2be | 2629 | |
69a4e898 JH |
2630 | static void |
2631 | set_const_flag_1 (cgraph_node *node, bool set_const, bool looping, | |
2632 | bool *changed) | |
20cdc2be | 2633 | { |
530f3a1b JH |
2634 | /* Static constructors and destructors without a side effect can be |
2635 | optimized out. */ | |
69a4e898 | 2636 | if (set_const && !looping) |
530f3a1b | 2637 | { |
67348ccc | 2638 | if (DECL_STATIC_CONSTRUCTOR (node->decl)) |
69a4e898 JH |
2639 | { |
2640 | DECL_STATIC_CONSTRUCTOR (node->decl) = 0; | |
2641 | *changed = true; | |
2642 | } | |
67348ccc | 2643 | if (DECL_STATIC_DESTRUCTOR (node->decl)) |
69a4e898 JH |
2644 | { |
2645 | DECL_STATIC_DESTRUCTOR (node->decl) = 0; | |
2646 | *changed = true; | |
2647 | } | |
530f3a1b | 2648 | } |
69a4e898 JH |
2649 | if (!set_const) |
2650 | { | |
2651 | if (TREE_READONLY (node->decl)) | |
2652 | { | |
ae7a23a3 JH |
2653 | TREE_READONLY (node->decl) = 0; |
2654 | DECL_LOOPING_CONST_OR_PURE_P (node->decl) = false; | |
69a4e898 JH |
2655 | *changed = true; |
2656 | } | |
2657 | } | |
2658 | else | |
2659 | { | |
2660 | /* Consider function: | |
cc950f98 | 2661 | |
69a4e898 JH |
2662 | bool a(int *p) |
2663 | { | |
2664 | return *p==*p; | |
2665 | } | |
cc950f98 | 2666 | |
69a4e898 | 2667 | During early optimization we will turn this into: |
cc950f98 | 2668 | |
69a4e898 JH |
2669 | bool a(int *p) |
2670 | { | |
2671 | return true; | |
2672 | } | |
cc950f98 | 2673 | |
69a4e898 JH |
2674 | Now if this function will be detected as CONST however when interposed |
2675 | it may end up being just pure. We always must assume the worst | |
2676 | scenario here. */ | |
2677 | if (TREE_READONLY (node->decl)) | |
2678 | { | |
2679 | if (!looping && DECL_LOOPING_CONST_OR_PURE_P (node->decl)) | |
2680 | { | |
ae7a23a3 | 2681 | DECL_LOOPING_CONST_OR_PURE_P (node->decl) = false; |
69a4e898 JH |
2682 | *changed = true; |
2683 | } | |
2684 | } | |
2685 | else if (node->binds_to_current_def_p ()) | |
2686 | { | |
2687 | TREE_READONLY (node->decl) = true; | |
ae7a23a3 | 2688 | DECL_LOOPING_CONST_OR_PURE_P (node->decl) = looping; |
69a4e898 JH |
2689 | DECL_PURE_P (node->decl) = false; |
2690 | *changed = true; | |
2691 | } | |
2692 | else | |
2693 | { | |
2694 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
2695 | fprintf (dump_file, "Dropping state to PURE because function does " | |
2696 | "not bind to current def.\n"); | |
2697 | if (!DECL_PURE_P (node->decl)) | |
2698 | { | |
2699 | DECL_PURE_P (node->decl) = true; | |
ae7a23a3 | 2700 | DECL_LOOPING_CONST_OR_PURE_P (node->decl) = looping; |
69a4e898 JH |
2701 | *changed = true; |
2702 | } | |
2703 | else if (!looping && DECL_LOOPING_CONST_OR_PURE_P (node->decl)) | |
2704 | { | |
ae7a23a3 | 2705 | DECL_LOOPING_CONST_OR_PURE_P (node->decl) = false; |
69a4e898 JH |
2706 | *changed = true; |
2707 | } | |
2708 | } | |
2709 | } | |
cc950f98 | 2710 | |
69a4e898 JH |
2711 | ipa_ref *ref; |
2712 | FOR_EACH_ALIAS (node, ref) | |
cc950f98 | 2713 | { |
69a4e898 JH |
2714 | cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); |
2715 | if (!set_const || alias->get_availability () > AVAIL_INTERPOSABLE) | |
2716 | set_const_flag_1 (alias, set_const, looping, changed); | |
cc950f98 | 2717 | } |
69a4e898 | 2718 | for (cgraph_edge *e = node->callers; e; e = e->next_caller) |
67f3791f | 2719 | if (e->caller->thunk |
69a4e898 JH |
2720 | && (!set_const || e->caller->get_availability () > AVAIL_INTERPOSABLE)) |
2721 | { | |
2722 | /* Virtual thunks access virtual offset in the vtable, so they can | |
2723 | only be pure, never const. */ | |
ae7a23a3 | 2724 | if (set_const |
67f3791f | 2725 | && (thunk_info::get (e->caller)->virtual_offset_p |
ae7a23a3 | 2726 | || !node->binds_to_current_def_p (e->caller))) |
69a4e898 JH |
2727 | *changed |= e->caller->set_pure_flag (true, looping); |
2728 | else | |
2729 | set_const_flag_1 (e->caller, set_const, looping, changed); | |
2730 | } | |
20cdc2be JJ |
2731 | } |
2732 | ||
69a4e898 JH |
2733 | /* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST. |
2734 | If SET_CONST if false, clear the flag. | |
20cdc2be | 2735 | |
69a4e898 | 2736 | When setting the flag be careful about possible interposition and |
dfea3d6f | 2737 | do not set the flag for functions that can be interposed and set pure |
69a4e898 JH |
2738 | flag for functions that can bind to other definition. |
2739 | ||
2740 | Return true if any change was done. */ | |
2741 | ||
2742 | bool | |
2743 | cgraph_node::set_const_flag (bool set_const, bool looping) | |
20cdc2be | 2744 | { |
69a4e898 JH |
2745 | bool changed = false; |
2746 | if (!set_const || get_availability () > AVAIL_INTERPOSABLE) | |
2747 | set_const_flag_1 (this, set_const, looping, &changed); | |
2748 | else | |
2749 | { | |
2750 | ipa_ref *ref; | |
2751 | ||
2752 | FOR_EACH_ALIAS (this, ref) | |
2753 | { | |
2754 | cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); | |
2755 | if (!set_const || alias->get_availability () > AVAIL_INTERPOSABLE) | |
2756 | set_const_flag_1 (alias, set_const, looping, &changed); | |
2757 | } | |
2758 | } | |
2759 | return changed; | |
be330ed4 JH |
2760 | } |
2761 | ||
69a4e898 JH |
2762 | /* Info used by set_pure_flag_1. */ |
2763 | ||
a2b056a3 | 2764 | struct set_pure_flag_info |
69a4e898 JH |
2765 | { |
2766 | bool pure; | |
2767 | bool looping; | |
2768 | bool changed; | |
2769 | }; | |
2770 | ||
2771 | /* Worker to set_pure_flag. */ | |
be330ed4 JH |
2772 | |
2773 | static bool | |
69a4e898 | 2774 | set_pure_flag_1 (cgraph_node *node, void *data) |
be330ed4 | 2775 | { |
69a4e898 | 2776 | struct set_pure_flag_info *info = (struct set_pure_flag_info *)data; |
a1ffba98 | 2777 | /* Static constructors and destructors without a side effect can be |
530f3a1b | 2778 | optimized out. */ |
69a4e898 | 2779 | if (info->pure && !info->looping) |
530f3a1b | 2780 | { |
67348ccc | 2781 | if (DECL_STATIC_CONSTRUCTOR (node->decl)) |
69a4e898 JH |
2782 | { |
2783 | DECL_STATIC_CONSTRUCTOR (node->decl) = 0; | |
2784 | info->changed = true; | |
2785 | } | |
67348ccc | 2786 | if (DECL_STATIC_DESTRUCTOR (node->decl)) |
69a4e898 JH |
2787 | { |
2788 | DECL_STATIC_DESTRUCTOR (node->decl) = 0; | |
2789 | info->changed = true; | |
2790 | } | |
2791 | } | |
2792 | if (info->pure) | |
2793 | { | |
2794 | if (!DECL_PURE_P (node->decl) && !TREE_READONLY (node->decl)) | |
2795 | { | |
ae7a23a3 JH |
2796 | DECL_PURE_P (node->decl) = true; |
2797 | DECL_LOOPING_CONST_OR_PURE_P (node->decl) = info->looping; | |
69a4e898 JH |
2798 | info->changed = true; |
2799 | } | |
2800 | else if (DECL_LOOPING_CONST_OR_PURE_P (node->decl) | |
2801 | && !info->looping) | |
2802 | { | |
ae7a23a3 | 2803 | DECL_LOOPING_CONST_OR_PURE_P (node->decl) = false; |
69a4e898 JH |
2804 | info->changed = true; |
2805 | } | |
2806 | } | |
2807 | else | |
2808 | { | |
2809 | if (DECL_PURE_P (node->decl)) | |
2810 | { | |
ae7a23a3 JH |
2811 | DECL_PURE_P (node->decl) = false; |
2812 | DECL_LOOPING_CONST_OR_PURE_P (node->decl) = false; | |
69a4e898 JH |
2813 | info->changed = true; |
2814 | } | |
530f3a1b | 2815 | } |
be330ed4 | 2816 | return false; |
20cdc2be JJ |
2817 | } |
2818 | ||
d52f5295 | 2819 | /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node |
69a4e898 | 2820 | if any to PURE. |
be330ed4 | 2821 | |
69a4e898 JH |
2822 | When setting the flag, be careful about possible interposition. |
2823 | Return true if any change was done. */ | |
2824 | ||
2825 | bool | |
d52f5295 | 2826 | cgraph_node::set_pure_flag (bool pure, bool looping) |
fa5f5e27 | 2827 | { |
69a4e898 | 2828 | struct set_pure_flag_info info = {pure, looping, false}; |
69a4e898 JH |
2829 | call_for_symbol_thunks_and_aliases (set_pure_flag_1, &info, !pure, true); |
2830 | return info.changed; | |
be330ed4 | 2831 | } |
844db5d0 | 2832 | |
67914693 | 2833 | /* Return true when cgraph_node cannot return or throw and thus |
d56026c2 JH |
2834 | it is safe to ignore its side effects for IPA analysis. */ |
2835 | ||
2836 | bool | |
d52f5295 | 2837 | cgraph_node::cannot_return_p (void) |
d56026c2 | 2838 | { |
d52f5295 | 2839 | int flags = flags_from_decl_or_type (decl); |
a6b1490d | 2840 | if (!opt_for_fn (decl, flag_exceptions)) |
d56026c2 JH |
2841 | return (flags & ECF_NORETURN) != 0; |
2842 | else | |
2843 | return ((flags & (ECF_NORETURN | ECF_NOTHROW)) | |
2844 | == (ECF_NORETURN | ECF_NOTHROW)); | |
2845 | } | |
2846 | ||
67914693 | 2847 | /* Return true when call of edge cannot lead to return from caller |
d56026c2 JH |
2848 | and thus it is safe to ignore its side effects for IPA analysis |
2849 | when computing side effects of the caller. | |
2850 | FIXME: We could actually mark all edges that have no reaching | |
6626665f | 2851 | patch to the exit block or throw to get better results. */ |
d56026c2 | 2852 | bool |
3dafb85c | 2853 | cgraph_edge::cannot_lead_to_return_p (void) |
d56026c2 | 2854 | { |
3dafb85c | 2855 | if (caller->cannot_return_p ()) |
f10ea640 | 2856 | return true; |
3dafb85c | 2857 | if (indirect_unknown_callee) |
d56026c2 | 2858 | { |
3dafb85c | 2859 | int flags = indirect_info->ecf_flags; |
a6b1490d | 2860 | if (!opt_for_fn (caller->decl, flag_exceptions)) |
d56026c2 JH |
2861 | return (flags & ECF_NORETURN) != 0; |
2862 | else | |
2863 | return ((flags & (ECF_NORETURN | ECF_NOTHROW)) | |
2864 | == (ECF_NORETURN | ECF_NOTHROW)); | |
2865 | } | |
2866 | else | |
3dafb85c | 2867 | return callee->cannot_return_p (); |
d56026c2 JH |
2868 | } |
2869 | ||
bf321336 | 2870 | /* Return true if the edge may be considered hot. */ |
893479de AM |
2871 | |
2872 | bool | |
2873 | cgraph_edge::maybe_hot_p (void) | |
2874 | { | |
1bad9c18 | 2875 | if (!maybe_hot_count_p (NULL, count.ipa ())) |
893479de AM |
2876 | return false; |
2877 | if (caller->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED | |
2878 | || (callee | |
2879 | && callee->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED)) | |
2880 | return false; | |
2881 | if (caller->frequency > NODE_FREQUENCY_UNLIKELY_EXECUTED | |
2882 | && (callee | |
2883 | && callee->frequency <= NODE_FREQUENCY_EXECUTED_ONCE)) | |
2884 | return false; | |
a6b1490d JH |
2885 | if (opt_for_fn (caller->decl, optimize_size)) |
2886 | return false; | |
893479de AM |
2887 | if (caller->frequency == NODE_FREQUENCY_HOT) |
2888 | return true; | |
d07f74fa | 2889 | if (!count.initialized_p ()) |
3995f3a2 | 2890 | return true; |
d07f74fa JH |
2891 | cgraph_node *where = caller->inlined_to ? caller->inlined_to : caller; |
2892 | if (!where->count.initialized_p ()) | |
7349698e | 2893 | return false; |
d07f74fa JH |
2894 | if (caller->frequency == NODE_FREQUENCY_EXECUTED_ONCE) |
2895 | { | |
2896 | if (count.apply_scale (2, 1) < where->count.apply_scale (3, 1)) | |
2897 | return false; | |
2898 | } | |
028d4092 | 2899 | else if (count.apply_scale (param_hot_bb_frequency_fraction , 1) |
d07f74fa | 2900 | < where->count) |
893479de | 2901 | return false; |
893479de AM |
2902 | return true; |
2903 | } | |
2904 | ||
9aa3f5c5 JH |
2905 | /* Worker for cgraph_can_remove_if_no_direct_calls_p. */ |
2906 | ||
2907 | static bool | |
3dafb85c | 2908 | nonremovable_p (cgraph_node *node, void *) |
9aa3f5c5 | 2909 | { |
d52f5295 | 2910 | return !node->can_remove_if_no_direct_calls_and_refs_p (); |
9aa3f5c5 JH |
2911 | } |
2912 | ||
a6a543bf JH |
2913 | /* Return true if whole comdat group can be removed if there are no direct |
2914 | calls to THIS. */ | |
9aa3f5c5 JH |
2915 | |
2916 | bool | |
e0d514da | 2917 | cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline) |
9aa3f5c5 | 2918 | { |
a6a543bf JH |
2919 | struct ipa_ref *ref; |
2920 | ||
2921 | /* For local symbols or non-comdat group it is the same as | |
2922 | can_remove_if_no_direct_calls_p. */ | |
2923 | if (!externally_visible || !same_comdat_group) | |
2924 | { | |
2925 | if (DECL_EXTERNAL (decl)) | |
2926 | return true; | |
2927 | if (address_taken) | |
2928 | return false; | |
2929 | return !call_for_symbol_and_aliases (nonremovable_p, NULL, true); | |
2930 | } | |
2931 | ||
e0d514da JH |
2932 | if (will_inline && address_taken) |
2933 | return false; | |
2934 | ||
dfea3d6f | 2935 | /* Otherwise check if we can remove the symbol itself and then verify |
a6a543bf JH |
2936 | that only uses of the comdat groups are direct call to THIS |
2937 | or its aliases. */ | |
2938 | if (!can_remove_if_no_direct_calls_and_refs_p ()) | |
9aa3f5c5 | 2939 | return false; |
a6a543bf JH |
2940 | |
2941 | /* Check that all refs come from within the comdat group. */ | |
2942 | for (int i = 0; iterate_referring (i, ref); i++) | |
2943 | if (ref->referring->get_comdat_group () != get_comdat_group ()) | |
2944 | return false; | |
2945 | ||
2946 | struct cgraph_node *target = ultimate_alias_target (); | |
2947 | for (cgraph_node *next = dyn_cast<cgraph_node *> (same_comdat_group); | |
2948 | next != this; next = dyn_cast<cgraph_node *> (next->same_comdat_group)) | |
2949 | { | |
2950 | if (!externally_visible) | |
2951 | continue; | |
2952 | if (!next->alias | |
2953 | && !next->can_remove_if_no_direct_calls_and_refs_p ()) | |
2954 | return false; | |
2955 | ||
2956 | /* If we see different symbol than THIS, be sure to check calls. */ | |
2957 | if (next->ultimate_alias_target () != target) | |
2958 | for (cgraph_edge *e = next->callers; e; e = e->next_caller) | |
e0d514da JH |
2959 | if (e->caller->get_comdat_group () != get_comdat_group () |
2960 | || will_inline) | |
a6a543bf JH |
2961 | return false; |
2962 | ||
e0d514da JH |
2963 | /* If function is not being inlined, we care only about |
2964 | references outside of the comdat group. */ | |
2965 | if (!will_inline) | |
ae7a23a3 | 2966 | for (int i = 0; next->iterate_referring (i, ref); i++) |
e0d514da JH |
2967 | if (ref->referring->get_comdat_group () != get_comdat_group ()) |
2968 | return false; | |
a6a543bf JH |
2969 | } |
2970 | return true; | |
9aa3f5c5 JH |
2971 | } |
2972 | ||
d52f5295 | 2973 | /* Return true when function cgraph_node can be expected to be removed |
09411461 JH |
2974 | from program when direct calls in this compilation unit are removed. |
2975 | ||
2976 | As a special case COMDAT functions are | |
2977 | cgraph_can_remove_if_no_direct_calls_p while the are not | |
2978 | cgraph_only_called_directly_p (it is possible they are called from other | |
2979 | unit) | |
2980 | ||
2981 | This function behaves as cgraph_only_called_directly_p because eliminating | |
61502ca8 | 2982 | all uses of COMDAT function does not make it necessarily disappear from |
09411461 JH |
2983 | the program unless we are compiling whole program or we do LTO. In this |
2984 | case we know we win since dynamic linking will not really discard the | |
2985 | linkonce section. */ | |
2986 | ||
2987 | bool | |
e0d514da JH |
2988 | cgraph_node::will_be_removed_from_program_if_no_direct_calls_p |
2989 | (bool will_inline) | |
09411461 | 2990 | { |
a62bfab5 | 2991 | gcc_assert (!inlined_to); |
a6a543bf JH |
2992 | if (DECL_EXTERNAL (decl)) |
2993 | return true; | |
d52f5295 | 2994 | |
09411461 | 2995 | if (!in_lto_p && !flag_whole_program) |
530f3a1b | 2996 | { |
a6a543bf JH |
2997 | /* If the symbol is in comdat group, we need to verify that whole comdat |
2998 | group becomes unreachable. Technically we could skip references from | |
2999 | within the group, too. */ | |
3000 | if (!only_called_directly_p ()) | |
3001 | return false; | |
3002 | if (same_comdat_group && externally_visible) | |
3003 | { | |
3004 | struct cgraph_node *target = ultimate_alias_target (); | |
e0d514da JH |
3005 | |
3006 | if (will_inline && address_taken) | |
3007 | return true; | |
a6a543bf JH |
3008 | for (cgraph_node *next = dyn_cast<cgraph_node *> (same_comdat_group); |
3009 | next != this; | |
3010 | next = dyn_cast<cgraph_node *> (next->same_comdat_group)) | |
3011 | { | |
3012 | if (!externally_visible) | |
3013 | continue; | |
3014 | if (!next->alias | |
3015 | && !next->only_called_directly_p ()) | |
3016 | return false; | |
3017 | ||
3018 | /* If we see different symbol than THIS, | |
3019 | be sure to check calls. */ | |
3020 | if (next->ultimate_alias_target () != target) | |
3021 | for (cgraph_edge *e = next->callers; e; e = e->next_caller) | |
e0d514da JH |
3022 | if (e->caller->get_comdat_group () != get_comdat_group () |
3023 | || will_inline) | |
a6a543bf | 3024 | return false; |
a6a543bf JH |
3025 | } |
3026 | } | |
3027 | return true; | |
530f3a1b | 3028 | } |
a6a543bf | 3029 | else |
e0d514da | 3030 | return can_remove_if_no_direct_calls_p (will_inline); |
09411461 JH |
3031 | } |
3032 | ||
051f8cc6 | 3033 | |
be330ed4 JH |
3034 | /* Worker for cgraph_only_called_directly_p. */ |
3035 | ||
3036 | static bool | |
3dafb85c | 3037 | cgraph_not_only_called_directly_p_1 (cgraph_node *node, void *) |
be330ed4 | 3038 | { |
d52f5295 | 3039 | return !node->only_called_directly_or_aliased_p (); |
be330ed4 JH |
3040 | } |
3041 | ||
d52f5295 | 3042 | /* Return true when function cgraph_node and all its aliases are only called |
be330ed4 JH |
3043 | directly. |
3044 | i.e. it is not externally visible, address was not taken and | |
3045 | it is not used in any other non-standard way. */ | |
3046 | ||
3047 | bool | |
d52f5295 | 3048 | cgraph_node::only_called_directly_p (void) |
be330ed4 | 3049 | { |
d52f5295 ML |
3050 | gcc_assert (ultimate_alias_target () == this); |
3051 | return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1, | |
be330ed4 JH |
3052 | NULL, true); |
3053 | } | |
3054 | ||
3055 | ||
3056 | /* Collect all callers of NODE. Worker for collect_callers_of_node. */ | |
3057 | ||
3058 | static bool | |
3dafb85c | 3059 | collect_callers_of_node_1 (cgraph_node *node, void *data) |
be330ed4 | 3060 | { |
d52f5295 | 3061 | vec<cgraph_edge *> *redirect_callers = (vec<cgraph_edge *> *)data; |
3dafb85c | 3062 | cgraph_edge *cs; |
be330ed4 | 3063 | enum availability avail; |
d52f5295 | 3064 | node->ultimate_alias_target (&avail); |
be330ed4 | 3065 | |
d52f5295 | 3066 | if (avail > AVAIL_INTERPOSABLE) |
be330ed4 | 3067 | for (cs = node->callers; cs != NULL; cs = cs->next_caller) |
4a414de8 | 3068 | if (!cs->indirect_inlining_edge |
67f3791f | 3069 | && !cs->caller->thunk) |
ae7a23a3 | 3070 | redirect_callers->safe_push (cs); |
be330ed4 JH |
3071 | return false; |
3072 | } | |
3073 | ||
d52f5295 ML |
3074 | /* Collect all callers of cgraph_node and its aliases that are known to lead to |
3075 | cgraph_node (i.e. are not overwritable). */ | |
be330ed4 | 3076 | |
d52f5295 ML |
3077 | vec<cgraph_edge *> |
3078 | cgraph_node::collect_callers (void) | |
be330ed4 | 3079 | { |
d52f5295 ML |
3080 | vec<cgraph_edge *> redirect_callers = vNULL; |
3081 | call_for_symbol_thunks_and_aliases (collect_callers_of_node_1, | |
3082 | &redirect_callers, false); | |
be330ed4 JH |
3083 | return redirect_callers; |
3084 | } | |
3085 | ||
1738b522 MJ |
3086 | |
3087 | /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. Return | |
3088 | optimistically true if this cannot be determined. */ | |
610c8ef0 | 3089 | |
9c8305f8 | 3090 | static bool |
3dafb85c | 3091 | clone_of_p (cgraph_node *node, cgraph_node *node2) |
9c8305f8 | 3092 | { |
d52f5295 ML |
3093 | node = node->ultimate_alias_target (); |
3094 | node2 = node2->ultimate_alias_target (); | |
610c8ef0 | 3095 | |
79a18702 MJ |
3096 | if (node2->clone_of == node |
3097 | || node2->former_clone_of == node->decl) | |
3098 | return true; | |
3099 | ||
67f3791f | 3100 | if (!node->thunk && !node->former_thunk_p ()) |
79a18702 | 3101 | { |
0f4c8f51 MJ |
3102 | while (node2 |
3103 | && node->decl != node2->decl | |
3104 | && node->decl != node2->former_clone_of) | |
79a18702 MJ |
3105 | node2 = node2->clone_of; |
3106 | return node2 != NULL; | |
3107 | } | |
3108 | ||
610c8ef0 MJ |
3109 | /* There are no virtual clones of thunks so check former_clone_of or if we |
3110 | might have skipped thunks because this adjustments are no longer | |
3111 | necessary. */ | |
67f3791f | 3112 | while (node->thunk || node->former_thunk_p ()) |
610c8ef0 | 3113 | { |
67f3791f | 3114 | if (!thunk_info::get (node)->this_adjusting) |
610c8ef0 | 3115 | return false; |
1738b522 MJ |
3116 | /* In case of instrumented expanded thunks, which can have multiple calls |
3117 | in them, we do not know how to continue and just have to be | |
b31ede6e MJ |
3118 | optimistic. The same applies if all calls have already been inlined |
3119 | into the thunk. */ | |
3120 | if (!node->callees || node->callees->next_callee) | |
1738b522 | 3121 | return true; |
d52f5295 | 3122 | node = node->callees->callee->ultimate_alias_target (); |
610c8ef0 | 3123 | |
ae7a23a3 JH |
3124 | clone_info *info = clone_info::get (node2); |
3125 | if (!info || !info->param_adjustments | |
3126 | || info->param_adjustments->first_param_intact_p ()) | |
803d0ab0 | 3127 | return false; |
b31ede6e MJ |
3128 | if (node2->former_clone_of == node->decl |
3129 | || node2->former_clone_of == node->former_clone_of) | |
803d0ab0 | 3130 | return true; |
79a18702 MJ |
3131 | |
3132 | cgraph_node *n2 = node2; | |
3133 | while (n2 && node->decl != n2->decl) | |
3134 | n2 = n2->clone_of; | |
3135 | if (n2) | |
3136 | return true; | |
803d0ab0 | 3137 | } |
610c8ef0 | 3138 | |
79a18702 | 3139 | return false; |
9c8305f8 JH |
3140 | } |
3141 | ||
90988f77 | 3142 | /* Verify edge count and frequency. */ |
9c8305f8 | 3143 | |
90988f77 | 3144 | bool |
1bad9c18 | 3145 | cgraph_edge::verify_count () |
9c8305f8 JH |
3146 | { |
3147 | bool error_found = false; | |
e7a74006 | 3148 | if (!count.verify ()) |
9c8305f8 | 3149 | { |
e7a74006 JH |
3150 | error ("caller edge count invalid"); |
3151 | error_found = true; | |
3152 | } | |
9c8305f8 JH |
3153 | return error_found; |
3154 | } | |
3155 | ||
3156 | /* Switch to THIS_CFUN if needed and print STMT to stderr. */ | |
3157 | static void | |
355fe088 | 3158 | cgraph_debug_gimple_stmt (function *this_cfun, gimple *stmt) |
9c8305f8 | 3159 | { |
27f7e1c3 | 3160 | bool fndecl_was_null = false; |
9c8305f8 JH |
3161 | /* debug_gimple_stmt needs correct cfun */ |
3162 | if (cfun != this_cfun) | |
3163 | set_cfun (this_cfun); | |
27f7e1c3 AH |
3164 | /* ...and an actual current_function_decl */ |
3165 | if (!current_function_decl) | |
3166 | { | |
3167 | current_function_decl = this_cfun->decl; | |
3168 | fndecl_was_null = true; | |
3169 | } | |
9c8305f8 | 3170 | debug_gimple_stmt (stmt); |
27f7e1c3 AH |
3171 | if (fndecl_was_null) |
3172 | current_function_decl = NULL; | |
9c8305f8 JH |
3173 | } |
3174 | ||
90988f77 | 3175 | /* Verify that call graph edge corresponds to DECL from the associated |
9c8305f8 JH |
3176 | statement. Return true if the verification should fail. */ |
3177 | ||
90988f77 ML |
3178 | bool |
3179 | cgraph_edge::verify_corresponds_to_fndecl (tree decl) | |
9c8305f8 | 3180 | { |
3dafb85c | 3181 | cgraph_node *node; |
9c8305f8 | 3182 | |
a62bfab5 | 3183 | if (!decl || callee->inlined_to) |
9c8305f8 | 3184 | return false; |
3dafb85c | 3185 | if (symtab->state == LTO_STREAMING) |
ca0f62a8 | 3186 | return false; |
d52f5295 | 3187 | node = cgraph_node::get (decl); |
9c8305f8 JH |
3188 | |
3189 | /* We do not know if a node from a different partition is an alias or what it | |
3d8d0043 MJ |
3190 | aliases and therefore cannot do the former_clone_of check reliably. When |
3191 | body_removed is set, we have lost all information about what was alias or | |
3192 | thunk of and also cannot proceed. */ | |
3193 | if (!node | |
3194 | || node->body_removed | |
3195 | || node->in_other_partition | |
0a7246ee | 3196 | || callee->icf_merged |
90988f77 | 3197 | || callee->in_other_partition) |
9c8305f8 | 3198 | return false; |
9de6f6c3 | 3199 | |
d52f5295 ML |
3200 | node = node->ultimate_alias_target (); |
3201 | ||
9de6f6c3 | 3202 | /* Optimizers can redirect unreachable calls or calls triggering undefined |
9c582551 | 3203 | behavior to builtin_unreachable. */ |
3d78e008 ML |
3204 | |
3205 | if (fndecl_built_in_p (callee->decl, BUILT_IN_UNREACHABLE)) | |
9de6f6c3 | 3206 | return false; |
9c8305f8 | 3207 | |
90988f77 ML |
3208 | if (callee->former_clone_of != node->decl |
3209 | && (node != callee->ultimate_alias_target ()) | |
3210 | && !clone_of_p (node, callee)) | |
9c8305f8 JH |
3211 | return true; |
3212 | else | |
3213 | return false; | |
3214 | } | |
3215 | ||
0ecf545c MS |
3216 | /* Disable warnings about missing quoting in GCC diagnostics for |
3217 | the verification errors. Their format strings don't follow GCC | |
3218 | diagnostic conventions and the calls are ultimately followed by | |
3219 | one to internal_error. */ | |
3220 | #if __GNUC__ >= 10 | |
3221 | # pragma GCC diagnostic push | |
3222 | # pragma GCC diagnostic ignored "-Wformat-diag" | |
3223 | #endif | |
3224 | ||
bf6fc129 JH |
3225 | /* Verify consistency of speculative call in NODE corresponding to STMT |
3226 | and LTO_STMT_UID. If INDIRECT is set, assume that it is the indirect | |
3227 | edge of call sequence. Return true if error is found. | |
3228 | ||
3229 | This function is called to every component of indirect call (direct edges, | |
3230 | indirect edge and refs). To save duplicated work, do full testing only | |
3231 | in that case. */ | |
3232 | static bool | |
3233 | verify_speculative_call (struct cgraph_node *node, gimple *stmt, | |
3234 | unsigned int lto_stmt_uid, | |
3235 | struct cgraph_edge *indirect) | |
3236 | { | |
3237 | if (indirect == NULL) | |
3238 | { | |
3239 | for (indirect = node->indirect_calls; indirect; | |
3240 | indirect = indirect->next_callee) | |
3241 | if (indirect->call_stmt == stmt | |
3242 | && indirect->lto_stmt_uid == lto_stmt_uid) | |
3243 | break; | |
3244 | if (!indirect) | |
3245 | { | |
3246 | error ("missing indirect call in speculative call sequence"); | |
3247 | return true; | |
3248 | } | |
3249 | if (!indirect->speculative) | |
3250 | { | |
3251 | error ("indirect call in speculative call sequence has no " | |
3252 | "speculative flag"); | |
3253 | return true; | |
3254 | } | |
3255 | return false; | |
3256 | } | |
3257 | ||
3258 | /* Maximal number of targets. We probably will never want to have more than | |
3259 | this. */ | |
3260 | const unsigned int num = 256; | |
3261 | cgraph_edge *direct_calls[num]; | |
3262 | ipa_ref *refs[num]; | |
3263 | ||
3264 | for (unsigned int i = 0; i < num; i++) | |
3265 | { | |
3266 | direct_calls[i] = NULL; | |
3267 | refs[i] = NULL; | |
3268 | } | |
3269 | ||
845bb366 JH |
3270 | cgraph_edge *first_call = NULL; |
3271 | cgraph_edge *prev_call = NULL; | |
3272 | ||
bf6fc129 JH |
3273 | for (cgraph_edge *direct = node->callees; direct; |
3274 | direct = direct->next_callee) | |
3275 | if (direct->call_stmt == stmt && direct->lto_stmt_uid == lto_stmt_uid) | |
3276 | { | |
845bb366 JH |
3277 | if (!first_call) |
3278 | first_call = direct; | |
3279 | if (prev_call && direct != prev_call->next_callee) | |
3280 | { | |
3281 | error ("speculative edges are not adjacent"); | |
3282 | return true; | |
3283 | } | |
3284 | prev_call = direct; | |
bf6fc129 JH |
3285 | if (!direct->speculative) |
3286 | { | |
3287 | error ("direct call to %s in speculative call sequence has no " | |
3288 | "speculative flag", direct->callee->dump_name ()); | |
3289 | return true; | |
3290 | } | |
3291 | if (direct->speculative_id >= num) | |
3292 | { | |
3293 | error ("direct call to %s in speculative call sequence has " | |
da67227b | 3294 | "speculative_id %i out of range", |
bf6fc129 JH |
3295 | direct->callee->dump_name (), direct->speculative_id); |
3296 | return true; | |
3297 | } | |
3298 | if (direct_calls[direct->speculative_id]) | |
3299 | { | |
3300 | error ("duplicate direct call to %s in speculative call sequence " | |
da67227b | 3301 | "with speculative_id %i", |
bf6fc129 JH |
3302 | direct->callee->dump_name (), direct->speculative_id); |
3303 | return true; | |
3304 | } | |
3305 | direct_calls[direct->speculative_id] = direct; | |
3306 | } | |
3307 | ||
845bb366 JH |
3308 | if (first_call->call_stmt |
3309 | && first_call != node->get_edge (first_call->call_stmt)) | |
3310 | { | |
3311 | error ("call stmt hash does not point to first direct edge of " | |
da67227b | 3312 | "speculative call sequence"); |
845bb366 JH |
3313 | return true; |
3314 | } | |
3315 | ||
bf6fc129 JH |
3316 | ipa_ref *ref; |
3317 | for (int i = 0; node->iterate_reference (i, ref); i++) | |
3318 | if (ref->speculative | |
3319 | && ref->stmt == stmt && ref->lto_stmt_uid == lto_stmt_uid) | |
3320 | { | |
3321 | if (ref->speculative_id >= num) | |
3322 | { | |
3323 | error ("direct call to %s in speculative call sequence has " | |
da67227b | 3324 | "speculative_id %i out of range", |
bf6fc129 JH |
3325 | ref->referred->dump_name (), ref->speculative_id); |
3326 | return true; | |
3327 | } | |
3328 | if (refs[ref->speculative_id]) | |
3329 | { | |
3330 | error ("duplicate reference %s in speculative call sequence " | |
da67227b | 3331 | "with speculative_id %i", |
bf6fc129 JH |
3332 | ref->referred->dump_name (), ref->speculative_id); |
3333 | return true; | |
3334 | } | |
3335 | refs[ref->speculative_id] = ref; | |
3336 | } | |
3337 | ||
3338 | int num_targets = 0; | |
3339 | for (unsigned int i = 0 ; i < num ; i++) | |
3340 | { | |
3341 | if (refs[i] && !direct_calls[i]) | |
3342 | { | |
3343 | error ("missing direct call for speculation %i", i); | |
3344 | return true; | |
3345 | } | |
3346 | if (!refs[i] && direct_calls[i]) | |
3347 | { | |
3348 | error ("missing ref for speculation %i", i); | |
3349 | return true; | |
3350 | } | |
3351 | if (refs[i] != NULL) | |
3352 | num_targets++; | |
3353 | } | |
3354 | ||
3355 | if (num_targets != indirect->num_speculative_call_targets_p ()) | |
3356 | { | |
3357 | error ("number of speculative targets %i mismatched with " | |
da67227b | 3358 | "num_speculative_call_targets %i", |
bf6fc129 JH |
3359 | num_targets, |
3360 | indirect->num_speculative_call_targets_p ()); | |
3361 | return true; | |
3362 | } | |
3363 | return false; | |
3364 | } | |
3365 | ||
9c8305f8 JH |
3366 | /* Verify cgraph nodes of given cgraph node. */ |
3367 | DEBUG_FUNCTION void | |
d52f5295 | 3368 | cgraph_node::verify_node (void) |
9c8305f8 | 3369 | { |
3dafb85c ML |
3370 | cgraph_edge *e; |
3371 | function *this_cfun = DECL_STRUCT_FUNCTION (decl); | |
9c8305f8 JH |
3372 | basic_block this_block; |
3373 | gimple_stmt_iterator gsi; | |
3374 | bool error_found = false; | |
118aa5e3 JH |
3375 | int i; |
3376 | ipa_ref *ref = NULL; | |
9c8305f8 JH |
3377 | |
3378 | if (seen_error ()) | |
3379 | return; | |
3380 | ||
3381 | timevar_push (TV_CGRAPH_VERIFY); | |
d52f5295 ML |
3382 | error_found |= verify_base (); |
3383 | for (e = callees; e; e = e->next_callee) | |
9c8305f8 JH |
3384 | if (e->aux) |
3385 | { | |
3386 | error ("aux field set for edge %s->%s", | |
fec39fa6 TS |
3387 | identifier_to_locale (e->caller->name ()), |
3388 | identifier_to_locale (e->callee->name ())); | |
9c8305f8 JH |
3389 | error_found = true; |
3390 | } | |
e7a74006 JH |
3391 | if (!count.verify ()) |
3392 | { | |
3393 | error ("cgraph count invalid"); | |
3394 | error_found = true; | |
3395 | } | |
a62bfab5 | 3396 | if (inlined_to && same_comdat_group) |
65d630d4 JH |
3397 | { |
3398 | error ("inline clone in same comdat group list"); | |
3399 | error_found = true; | |
3400 | } | |
db51f624 JH |
3401 | if (inlined_to && !count.compatible_p (inlined_to->count)) |
3402 | { | |
3403 | error ("inline clone count is not compatible"); | |
3404 | count.debug (); | |
3405 | inlined_to->count.debug (); | |
3406 | error_found = true; | |
3407 | } | |
59c7b29e JH |
3408 | if (tp_first_run < 0) |
3409 | { | |
3410 | error ("tp_first_run must be non-negative"); | |
3411 | error_found = true; | |
3412 | } | |
87f94429 | 3413 | if (!definition && !in_other_partition && local) |
e70670cf JH |
3414 | { |
3415 | error ("local symbols must be defined"); | |
3416 | error_found = true; | |
3417 | } | |
a62bfab5 | 3418 | if (inlined_to && externally_visible) |
9c8305f8 JH |
3419 | { |
3420 | error ("externally visible inline clone"); | |
3421 | error_found = true; | |
3422 | } | |
a62bfab5 | 3423 | if (inlined_to && address_taken) |
9c8305f8 JH |
3424 | { |
3425 | error ("inline clone with address taken"); | |
3426 | error_found = true; | |
3427 | } | |
a62bfab5 | 3428 | if (inlined_to && force_output) |
9c8305f8 JH |
3429 | { |
3430 | error ("inline clone is forced to output"); | |
3431 | error_found = true; | |
3432 | } | |
72b3bc89 | 3433 | if (symtab->state != LTO_STREAMING) |
21cd8589 | 3434 | { |
72b3bc89 JH |
3435 | if (calls_comdat_local && !same_comdat_group) |
3436 | { | |
3437 | error ("calls_comdat_local is set outside of a comdat group"); | |
3438 | error_found = true; | |
3439 | } | |
3440 | if (!inlined_to && calls_comdat_local != check_calls_comdat_local_p ()) | |
3441 | { | |
3442 | error ("invalid calls_comdat_local flag"); | |
3443 | error_found = true; | |
3444 | } | |
21cd8589 | 3445 | } |
33351ff9 ML |
3446 | if (DECL_IS_MALLOC (decl) |
3447 | && !POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (decl)))) | |
3448 | { | |
3449 | error ("malloc attribute should be used for a function that " | |
3450 | "returns a pointer"); | |
3451 | error_found = true; | |
3452 | } | |
d52f5295 | 3453 | for (e = indirect_calls; e; e = e->next_callee) |
9c8305f8 JH |
3454 | { |
3455 | if (e->aux) | |
3456 | { | |
3457 | error ("aux field set for indirect edge from %s", | |
fec39fa6 | 3458 | identifier_to_locale (e->caller->name ())); |
9c8305f8 JH |
3459 | error_found = true; |
3460 | } | |
db51f624 JH |
3461 | if (!e->count.compatible_p (count)) |
3462 | { | |
3463 | error ("edge count is not compatible with function count"); | |
3464 | e->count.debug (); | |
3465 | count.debug (); | |
3466 | error_found = true; | |
3467 | } | |
9c8305f8 JH |
3468 | if (!e->indirect_unknown_callee |
3469 | || !e->indirect_info) | |
3470 | { | |
3471 | error ("An indirect edge from %s is not marked as indirect or has " | |
3472 | "associated indirect_info, the corresponding statement is: ", | |
fec39fa6 | 3473 | identifier_to_locale (e->caller->name ())); |
9c8305f8 JH |
3474 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
3475 | error_found = true; | |
3476 | } | |
118aa5e3 JH |
3477 | if (e->call_stmt && e->lto_stmt_uid) |
3478 | { | |
da67227b | 3479 | error ("edge has both call_stmt and lto_stmt_uid set"); |
118aa5e3 JH |
3480 | error_found = true; |
3481 | } | |
9c8305f8 | 3482 | } |
d52f5295 ML |
3483 | bool check_comdat = comdat_local_p (); |
3484 | for (e = callers; e; e = e->next_caller) | |
9c8305f8 | 3485 | { |
1bad9c18 | 3486 | if (e->verify_count ()) |
9c8305f8 | 3487 | error_found = true; |
1f26ac87 | 3488 | if (check_comdat |
d52f5295 | 3489 | && !in_same_comdat_group_p (e->caller)) |
1f26ac87 JM |
3490 | { |
3491 | error ("comdat-local function called by %s outside its comdat", | |
3492 | identifier_to_locale (e->caller->name ())); | |
3493 | error_found = true; | |
3494 | } | |
9c8305f8 JH |
3495 | if (!e->inline_failed) |
3496 | { | |
a62bfab5 ML |
3497 | if (inlined_to |
3498 | != (e->caller->inlined_to | |
3499 | ? e->caller->inlined_to : e->caller)) | |
9c8305f8 JH |
3500 | { |
3501 | error ("inlined_to pointer is wrong"); | |
3502 | error_found = true; | |
3503 | } | |
d52f5295 | 3504 | if (callers->next_caller) |
9c8305f8 JH |
3505 | { |
3506 | error ("multiple inline callers"); | |
3507 | error_found = true; | |
3508 | } | |
3509 | } | |
3510 | else | |
a62bfab5 | 3511 | if (inlined_to) |
9c8305f8 JH |
3512 | { |
3513 | error ("inlined_to pointer set for noninline callers"); | |
3514 | error_found = true; | |
3515 | } | |
3516 | } | |
1f4eb0e9 JH |
3517 | for (e = callees; e; e = e->next_callee) |
3518 | { | |
1bad9c18 | 3519 | if (e->verify_count ()) |
1f4eb0e9 | 3520 | error_found = true; |
db51f624 JH |
3521 | if (!e->count.compatible_p (count)) |
3522 | { | |
3523 | error ("edge count is not compatible with function count"); | |
3524 | e->count.debug (); | |
3525 | count.debug (); | |
3526 | error_found = true; | |
3527 | } | |
1f4eb0e9 | 3528 | if (gimple_has_body_p (e->caller->decl) |
a62bfab5 | 3529 | && !e->caller->inlined_to |
1f4eb0e9 JH |
3530 | && !e->speculative |
3531 | /* Optimized out calls are redirected to __builtin_unreachable. */ | |
1bad9c18 | 3532 | && (e->count.nonzero_p () |
ea6e17d5 | 3533 | || ! e->callee->decl |
3d78e008 | 3534 | || !fndecl_built_in_p (e->callee->decl, BUILT_IN_UNREACHABLE)) |
1bad9c18 JH |
3535 | && count |
3536 | == ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (decl))->count | |
3537 | && (!e->count.ipa_p () | |
3538 | && e->count.differs_from_p (gimple_bb (e->call_stmt)->count))) | |
1f4eb0e9 | 3539 | { |
1bad9c18 JH |
3540 | error ("caller edge count does not match BB count"); |
3541 | fprintf (stderr, "edge count: "); | |
3542 | e->count.dump (stderr); | |
3543 | fprintf (stderr, "\n bb count: "); | |
3544 | gimple_bb (e->call_stmt)->count.dump (stderr); | |
3545 | fprintf (stderr, "\n"); | |
1f4eb0e9 JH |
3546 | error_found = true; |
3547 | } | |
118aa5e3 JH |
3548 | if (e->call_stmt && e->lto_stmt_uid) |
3549 | { | |
da67227b | 3550 | error ("edge has both call_stmt and lto_stmt_uid set"); |
118aa5e3 JH |
3551 | error_found = true; |
3552 | } | |
bf6fc129 JH |
3553 | if (e->speculative |
3554 | && verify_speculative_call (e->caller, e->call_stmt, e->lto_stmt_uid, | |
3555 | NULL)) | |
3556 | error_found = true; | |
1f4eb0e9 | 3557 | } |
d52f5295 | 3558 | for (e = indirect_calls; e; e = e->next_callee) |
1f4eb0e9 | 3559 | { |
1bad9c18 | 3560 | if (e->verify_count ()) |
1f4eb0e9 JH |
3561 | error_found = true; |
3562 | if (gimple_has_body_p (e->caller->decl) | |
a62bfab5 | 3563 | && !e->caller->inlined_to |
1f4eb0e9 | 3564 | && !e->speculative |
1bad9c18 JH |
3565 | && e->count.ipa_p () |
3566 | && count | |
3567 | == ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (decl))->count | |
3568 | && (!e->count.ipa_p () | |
3569 | && e->count.differs_from_p (gimple_bb (e->call_stmt)->count))) | |
1f4eb0e9 | 3570 | { |
1bad9c18 JH |
3571 | error ("indirect call count does not match BB count"); |
3572 | fprintf (stderr, "edge count: "); | |
3573 | e->count.dump (stderr); | |
3574 | fprintf (stderr, "\n bb count: "); | |
3575 | gimple_bb (e->call_stmt)->count.dump (stderr); | |
3576 | fprintf (stderr, "\n"); | |
1f4eb0e9 JH |
3577 | error_found = true; |
3578 | } | |
bf6fc129 JH |
3579 | if (e->speculative |
3580 | && verify_speculative_call (e->caller, e->call_stmt, e->lto_stmt_uid, | |
3581 | e)) | |
3582 | error_found = true; | |
1f4eb0e9 | 3583 | } |
bf6fc129 JH |
3584 | for (i = 0; iterate_reference (i, ref); i++) |
3585 | { | |
3586 | if (ref->stmt && ref->lto_stmt_uid) | |
3587 | { | |
da67227b | 3588 | error ("reference has both stmt and lto_stmt_uid set"); |
bf6fc129 JH |
3589 | error_found = true; |
3590 | } | |
3591 | if (ref->speculative | |
3592 | && verify_speculative_call (this, ref->stmt, | |
3593 | ref->lto_stmt_uid, NULL)) | |
3594 | error_found = true; | |
3595 | } | |
3596 | ||
a62bfab5 | 3597 | if (!callers && inlined_to) |
9c8305f8 JH |
3598 | { |
3599 | error ("inlined_to pointer is set but no predecessors found"); | |
3600 | error_found = true; | |
3601 | } | |
a62bfab5 | 3602 | if (inlined_to == this) |
9c8305f8 JH |
3603 | { |
3604 | error ("inlined_to pointer refers to itself"); | |
3605 | error_found = true; | |
3606 | } | |
3607 | ||
d52f5295 | 3608 | if (clone_of) |
9c8305f8 | 3609 | { |
606711a1 ML |
3610 | cgraph_node *first_clone = clone_of->clones; |
3611 | if (first_clone != this) | |
9c8305f8 | 3612 | { |
606711a1 ML |
3613 | if (prev_sibling_clone->clone_of != clone_of) |
3614 | { | |
3615 | error ("cgraph_node has wrong clone_of"); | |
3616 | error_found = true; | |
3617 | } | |
9c8305f8 JH |
3618 | } |
3619 | } | |
d52f5295 | 3620 | if (clones) |
9c8305f8 | 3621 | { |
3dafb85c | 3622 | cgraph_node *n; |
d52f5295 ML |
3623 | for (n = clones; n; n = n->next_sibling_clone) |
3624 | if (n->clone_of != this) | |
9c8305f8 JH |
3625 | break; |
3626 | if (n) | |
3627 | { | |
d52f5295 | 3628 | error ("cgraph_node has wrong clone list"); |
9c8305f8 JH |
3629 | error_found = true; |
3630 | } | |
3631 | } | |
d52f5295 | 3632 | if ((prev_sibling_clone || next_sibling_clone) && !clone_of) |
9c8305f8 | 3633 | { |
d52f5295 | 3634 | error ("cgraph_node is in clone list but it is not clone"); |
9c8305f8 JH |
3635 | error_found = true; |
3636 | } | |
d52f5295 | 3637 | if (!prev_sibling_clone && clone_of && clone_of->clones != this) |
9c8305f8 | 3638 | { |
d52f5295 | 3639 | error ("cgraph_node has wrong prev_clone pointer"); |
9c8305f8 JH |
3640 | error_found = true; |
3641 | } | |
d52f5295 | 3642 | if (prev_sibling_clone && prev_sibling_clone->next_sibling_clone != this) |
9c8305f8 JH |
3643 | { |
3644 | error ("double linked list of clones corrupted"); | |
3645 | error_found = true; | |
3646 | } | |
3647 | ||
d52f5295 | 3648 | if (analyzed && alias) |
9c8305f8 JH |
3649 | { |
3650 | bool ref_found = false; | |
3651 | int i; | |
3dafb85c | 3652 | ipa_ref *ref = NULL; |
9c8305f8 | 3653 | |
d52f5295 | 3654 | if (callees) |
9c8305f8 JH |
3655 | { |
3656 | error ("Alias has call edges"); | |
ae7a23a3 | 3657 | error_found = true; |
9c8305f8 | 3658 | } |
d52f5295 | 3659 | for (i = 0; iterate_reference (i, ref); i++) |
31db0fe0 | 3660 | if (ref->use != IPA_REF_ALIAS) |
9c8305f8 JH |
3661 | { |
3662 | error ("Alias has non-alias reference"); | |
3663 | error_found = true; | |
3664 | } | |
3665 | else if (ref_found) | |
3666 | { | |
3667 | error ("Alias has more than one alias reference"); | |
3668 | error_found = true; | |
3669 | } | |
3670 | else | |
3671 | ref_found = true; | |
21c0a521 DM |
3672 | if (!ref_found) |
3673 | { | |
3674 | error ("Analyzed alias has no reference"); | |
3675 | error_found = true; | |
3676 | } | |
9c8305f8 | 3677 | } |
d5e254e1 | 3678 | |
67f3791f | 3679 | if (analyzed && thunk) |
9c8305f8 | 3680 | { |
d52f5295 | 3681 | if (!callees) |
9c8305f8 JH |
3682 | { |
3683 | error ("No edge out of thunk node"); | |
ae7a23a3 | 3684 | error_found = true; |
9c8305f8 | 3685 | } |
d52f5295 | 3686 | else if (callees->next_callee) |
9c8305f8 JH |
3687 | { |
3688 | error ("More than one edge out of thunk node"); | |
ae7a23a3 | 3689 | error_found = true; |
9c8305f8 | 3690 | } |
a62bfab5 | 3691 | if (gimple_has_body_p (decl) && !inlined_to) |
ae7a23a3 | 3692 | { |
9c8305f8 | 3693 | error ("Thunk is not supposed to have body"); |
ae7a23a3 JH |
3694 | error_found = true; |
3695 | } | |
9c8305f8 | 3696 | } |
d52f5295 ML |
3697 | else if (analyzed && gimple_has_body_p (decl) |
3698 | && !TREE_ASM_WRITTEN (decl) | |
a62bfab5 | 3699 | && (!DECL_EXTERNAL (decl) || inlined_to) |
d52f5295 | 3700 | && !flag_wpa) |
9c8305f8 JH |
3701 | { |
3702 | if (this_cfun->cfg) | |
3703 | { | |
355fe088 | 3704 | hash_set<gimple *> stmts; |
71cafea9 | 3705 | |
9c8305f8 JH |
3706 | /* Reach the trees by walking over the CFG, and note the |
3707 | enclosing basic-blocks in the call edges. */ | |
3708 | FOR_EACH_BB_FN (this_block, this_cfun) | |
71cafea9 JH |
3709 | { |
3710 | for (gsi = gsi_start_phis (this_block); | |
3711 | !gsi_end_p (gsi); gsi_next (&gsi)) | |
6e2830c3 | 3712 | stmts.add (gsi_stmt (gsi)); |
71cafea9 JH |
3713 | for (gsi = gsi_start_bb (this_block); |
3714 | !gsi_end_p (gsi); | |
3715 | gsi_next (&gsi)) | |
3716 | { | |
355fe088 | 3717 | gimple *stmt = gsi_stmt (gsi); |
6e2830c3 | 3718 | stmts.add (stmt); |
71cafea9 JH |
3719 | if (is_gimple_call (stmt)) |
3720 | { | |
3dafb85c | 3721 | cgraph_edge *e = get_edge (stmt); |
71cafea9 JH |
3722 | tree decl = gimple_call_fndecl (stmt); |
3723 | if (e) | |
3724 | { | |
3725 | if (e->aux) | |
3726 | { | |
3727 | error ("shared call_stmt:"); | |
3728 | cgraph_debug_gimple_stmt (this_cfun, stmt); | |
3729 | error_found = true; | |
3730 | } | |
3731 | if (!e->indirect_unknown_callee) | |
3732 | { | |
90988f77 | 3733 | if (e->verify_corresponds_to_fndecl (decl)) |
71cafea9 JH |
3734 | { |
3735 | error ("edge points to wrong declaration:"); | |
67348ccc | 3736 | debug_tree (e->callee->decl); |
71cafea9 JH |
3737 | fprintf (stderr," Instead of:"); |
3738 | debug_tree (decl); | |
3739 | error_found = true; | |
3740 | } | |
3741 | } | |
3742 | else if (decl) | |
3743 | { | |
3744 | error ("an indirect edge with unknown callee " | |
3745 | "corresponding to a call_stmt with " | |
3746 | "a known declaration:"); | |
3747 | error_found = true; | |
3748 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); | |
3749 | } | |
3750 | e->aux = (void *)1; | |
3751 | } | |
3752 | else if (decl) | |
3753 | { | |
3754 | error ("missing callgraph edge for call stmt:"); | |
3755 | cgraph_debug_gimple_stmt (this_cfun, stmt); | |
3756 | error_found = true; | |
3757 | } | |
3758 | } | |
3759 | } | |
9c8305f8 | 3760 | } |
d52f5295 | 3761 | for (i = 0; iterate_reference (i, ref); i++) |
6e2830c3 | 3762 | if (ref->stmt && !stmts.contains (ref->stmt)) |
71cafea9 JH |
3763 | { |
3764 | error ("reference to dead statement"); | |
3765 | cgraph_debug_gimple_stmt (this_cfun, ref->stmt); | |
3766 | error_found = true; | |
3767 | } | |
9c8305f8 JH |
3768 | } |
3769 | else | |
3770 | /* No CFG available?! */ | |
3771 | gcc_unreachable (); | |
3772 | ||
d52f5295 | 3773 | for (e = callees; e; e = e->next_callee) |
9c8305f8 | 3774 | { |
f1ba88b1 | 3775 | if (!e->aux && !e->speculative) |
9c8305f8 JH |
3776 | { |
3777 | error ("edge %s->%s has no corresponding call_stmt", | |
fec39fa6 TS |
3778 | identifier_to_locale (e->caller->name ()), |
3779 | identifier_to_locale (e->callee->name ())); | |
9c8305f8 JH |
3780 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
3781 | error_found = true; | |
3782 | } | |
3783 | e->aux = 0; | |
3784 | } | |
d52f5295 | 3785 | for (e = indirect_calls; e; e = e->next_callee) |
9c8305f8 | 3786 | { |
042ae7d2 | 3787 | if (!e->aux && !e->speculative) |
9c8305f8 JH |
3788 | { |
3789 | error ("an indirect edge from %s has no corresponding call_stmt", | |
fec39fa6 | 3790 | identifier_to_locale (e->caller->name ())); |
9c8305f8 JH |
3791 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); |
3792 | error_found = true; | |
3793 | } | |
3794 | e->aux = 0; | |
3795 | } | |
3796 | } | |
b275fd98 | 3797 | |
89576d86 | 3798 | if (nested_function_info *info = nested_function_info::get (this)) |
b275fd98 | 3799 | { |
89576d86 | 3800 | if (info->nested != NULL) |
b275fd98 | 3801 | { |
89576d86 JH |
3802 | for (cgraph_node *n = info->nested; n != NULL; |
3803 | n = next_nested_function (n)) | |
b275fd98 | 3804 | { |
89576d86 JH |
3805 | nested_function_info *ninfo = nested_function_info::get (n); |
3806 | if (ninfo->origin == NULL) | |
3807 | { | |
3808 | error ("missing origin for a node in a nested list"); | |
3809 | error_found = true; | |
3810 | } | |
3811 | else if (ninfo->origin != this) | |
3812 | { | |
3813 | error ("origin points to a different parent"); | |
3814 | error_found = true; | |
3815 | break; | |
3816 | } | |
b275fd98 ML |
3817 | } |
3818 | } | |
89576d86 JH |
3819 | if (info->next_nested != NULL && info->origin == NULL) |
3820 | { | |
3821 | error ("missing origin for a node in a nested list"); | |
3822 | error_found = true; | |
3823 | } | |
b275fd98 ML |
3824 | } |
3825 | ||
9c8305f8 JH |
3826 | if (error_found) |
3827 | { | |
d52f5295 | 3828 | dump (stderr); |
9c8305f8 JH |
3829 | internal_error ("verify_cgraph_node failed"); |
3830 | } | |
3831 | timevar_pop (TV_CGRAPH_VERIFY); | |
3832 | } | |
3833 | ||
3834 | /* Verify whole cgraph structure. */ | |
3835 | DEBUG_FUNCTION void | |
d52f5295 | 3836 | cgraph_node::verify_cgraph_nodes (void) |
9c8305f8 | 3837 | { |
3dafb85c | 3838 | cgraph_node *node; |
9c8305f8 JH |
3839 | |
3840 | if (seen_error ()) | |
3841 | return; | |
3842 | ||
3843 | FOR_EACH_FUNCTION (node) | |
d52f5295 | 3844 | node->verify (); |
9c8305f8 | 3845 | } |
48f4a6fa | 3846 | |
0ecf545c MS |
3847 | #if __GNUC__ >= 10 |
3848 | # pragma GCC diagnostic pop | |
3849 | #endif | |
3850 | ||
d52f5295 | 3851 | /* Walk the alias chain to return the function cgraph_node is alias of. |
6cbde2e3 | 3852 | Walk through thunks, too. |
f13fe18b JH |
3853 | When AVAILABILITY is non-NULL, get minimal availability in the chain. |
3854 | When REF is non-NULL, assume that reference happens in symbol REF | |
3855 | when determining the availability. */ | |
e70670cf | 3856 | |
d52f5295 | 3857 | cgraph_node * |
f13fe18b JH |
3858 | cgraph_node::function_symbol (enum availability *availability, |
3859 | struct symtab_node *ref) | |
e70670cf | 3860 | { |
f13fe18b | 3861 | cgraph_node *node = ultimate_alias_target (availability, ref); |
d52f5295 | 3862 | |
67f3791f | 3863 | while (node->thunk) |
e70670cf | 3864 | { |
f7dceb4e JH |
3865 | enum availability a; |
3866 | ||
f13fe18b | 3867 | ref = node; |
6cbde2e3 | 3868 | node = node->callees->callee; |
f7dceb4e JH |
3869 | node = node->ultimate_alias_target (availability ? &a : NULL, ref); |
3870 | if (availability && a < *availability) | |
3871 | *availability = a; | |
6cbde2e3 BE |
3872 | } |
3873 | return node; | |
3874 | } | |
3875 | ||
3876 | /* Walk the alias chain to return the function cgraph_node is alias of. | |
3877 | Walk through non virtual thunks, too. Thus we return either a function | |
3878 | or a virtual thunk node. | |
f13fe18b JH |
3879 | When AVAILABILITY is non-NULL, get minimal availability in the chain. |
3880 | When REF is non-NULL, assume that reference happens in symbol REF | |
3881 | when determining the availability. */ | |
6cbde2e3 BE |
3882 | |
3883 | cgraph_node * | |
3884 | cgraph_node::function_or_virtual_thunk_symbol | |
f13fe18b JH |
3885 | (enum availability *availability, |
3886 | struct symtab_node *ref) | |
6cbde2e3 | 3887 | { |
f13fe18b | 3888 | cgraph_node *node = ultimate_alias_target (availability, ref); |
6cbde2e3 | 3889 | |
67f3791f | 3890 | while (node->thunk && !thunk_info::get (node)->virtual_offset_p) |
6cbde2e3 | 3891 | { |
f7dceb4e JH |
3892 | enum availability a; |
3893 | ||
f13fe18b | 3894 | ref = node; |
6cbde2e3 | 3895 | node = node->callees->callee; |
f7dceb4e JH |
3896 | node = node->ultimate_alias_target (availability ? &a : NULL, ref); |
3897 | if (availability && a < *availability) | |
3898 | *availability = a; | |
6cbde2e3 | 3899 | } |
e70670cf JH |
3900 | return node; |
3901 | } | |
3902 | ||
d52f5295 | 3903 | /* When doing LTO, read cgraph_node's body from disk if it is not already |
0e590b68 | 3904 | present. Also perform any necessary clone materializations. */ |
a2e2a668 JH |
3905 | |
3906 | bool | |
0e590b68 | 3907 | cgraph_node::get_untransformed_body () |
a2e2a668 | 3908 | { |
3dafb85c | 3909 | lto_file_decl_data *file_data; |
a2e2a668 JH |
3910 | const char *data, *name; |
3911 | size_t len; | |
d52f5295 | 3912 | tree decl = this->decl; |
a2e2a668 | 3913 | |
0e590b68 JH |
3914 | /* See if there is clone to be materialized. |
3915 | (inline clones does not need materialization, but we can be seeing | |
3916 | an inline clone of real clone). */ | |
3917 | cgraph_node *p = this; | |
3918 | for (cgraph_node *c = clone_of; c; c = c->clone_of) | |
3919 | { | |
3920 | if (c->decl != decl) | |
3921 | p->materialize_clone (); | |
3922 | p = c; | |
3923 | } | |
3924 | ||
e9191ad3 JH |
3925 | /* Check if body is already there. Either we have gimple body or |
3926 | the function is thunk and in that case we set DECL_ARGUMENTS. */ | |
3927 | if (DECL_ARGUMENTS (decl) || gimple_has_body_p (decl)) | |
a2e2a668 JH |
3928 | return false; |
3929 | ||
e9191ad3 | 3930 | gcc_assert (in_lto_p && !DECL_RESULT (decl)); |
a2e2a668 | 3931 | |
917dd9bf JH |
3932 | timevar_push (TV_IPA_LTO_GIMPLE_IN); |
3933 | ||
d52f5295 | 3934 | file_data = lto_file_data; |
a2e2a668 JH |
3935 | name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)); |
3936 | ||
3937 | /* We may have renamed the declaration, e.g., a static function. */ | |
3938 | name = lto_get_decl_name_mapping (file_data, name); | |
ca834876 JH |
3939 | struct lto_in_decl_state *decl_state |
3940 | = lto_get_function_in_decl_state (file_data, decl); | |
a2e2a668 | 3941 | |
3c56d8d8 ML |
3942 | cgraph_node *origin = this; |
3943 | while (origin->clone_of) | |
3944 | origin = origin->clone_of; | |
3945 | ||
3946 | int stream_order = origin->order - file_data->order_base; | |
a2e2a668 | 3947 | data = lto_get_section_data (file_data, LTO_section_function_body, |
3c56d8d8 ML |
3948 | name, stream_order, &len, |
3949 | decl_state->compressed); | |
a2e2a668 | 3950 | if (!data) |
3c56d8d8 ML |
3951 | fatal_error (input_location, "%s: section %s.%d is missing", |
3952 | file_data->file_name, name, stream_order); | |
a2e2a668 JH |
3953 | |
3954 | gcc_assert (DECL_STRUCT_FUNCTION (decl) == NULL); | |
3955 | ||
b4da704c JH |
3956 | if (!quiet_flag) |
3957 | fprintf (stderr, " in:%s", IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl))); | |
d52f5295 | 3958 | lto_input_function_body (file_data, this, data); |
a2e2a668 JH |
3959 | lto_stats.num_function_bodies++; |
3960 | lto_free_section_data (file_data, LTO_section_function_body, name, | |
ca834876 | 3961 | data, len, decl_state->compressed); |
d52f5295 | 3962 | lto_free_function_in_decl_state_for_node (this); |
1c4db829 JH |
3963 | /* Keep lto file data so ipa-inline-analysis knows about cross module |
3964 | inlining. */ | |
917dd9bf JH |
3965 | |
3966 | timevar_pop (TV_IPA_LTO_GIMPLE_IN); | |
3967 | ||
a2e2a668 JH |
3968 | return true; |
3969 | } | |
3970 | ||
70486010 JH |
3971 | /* Prepare function body. When doing LTO, read cgraph_node's body from disk |
3972 | if it is not already present. When some IPA transformations are scheduled, | |
3973 | apply them. */ | |
3974 | ||
3975 | bool | |
3976 | cgraph_node::get_body (void) | |
3977 | { | |
3978 | bool updated; | |
3979 | ||
3980 | updated = get_untransformed_body (); | |
3981 | ||
3982 | /* Getting transformed body makes no sense for inline clones; | |
56aae4b7 | 3983 | we should never use this on real clones because they are materialized |
70486010 JH |
3984 | early. |
3985 | TODO: Materializing clones here will likely lead to smaller LTRANS | |
3986 | footprint. */ | |
a62bfab5 | 3987 | gcc_assert (!inlined_to && !clone_of); |
70486010 JH |
3988 | if (ipa_transforms_to_apply.exists ()) |
3989 | { | |
3990 | opt_pass *saved_current_pass = current_pass; | |
3991 | FILE *saved_dump_file = dump_file; | |
5a15be97 | 3992 | const char *saved_dump_file_name = dump_file_name; |
1a817418 | 3993 | dump_flags_t saved_dump_flags = dump_flags; |
5a15be97 | 3994 | dump_file_name = NULL; |
29b54a9d | 3995 | set_dump_file (NULL); |
70486010 JH |
3996 | |
3997 | push_cfun (DECL_STRUCT_FUNCTION (decl)); | |
4f75f97b JH |
3998 | |
3999 | update_ssa (TODO_update_ssa_only_virtuals); | |
e57c896e | 4000 | execute_all_ipa_transforms (true); |
70486010 JH |
4001 | cgraph_edge::rebuild_edges (); |
4002 | free_dominance_info (CDI_DOMINATORS); | |
4003 | free_dominance_info (CDI_POST_DOMINATORS); | |
4004 | pop_cfun (); | |
4005 | updated = true; | |
4006 | ||
4007 | current_pass = saved_current_pass; | |
29b54a9d | 4008 | set_dump_file (saved_dump_file); |
5a15be97 | 4009 | dump_file_name = saved_dump_file_name; |
70486010 JH |
4010 | dump_flags = saved_dump_flags; |
4011 | } | |
4012 | return updated; | |
4013 | } | |
4014 | ||
8ccda8bc EB |
4015 | /* Return the DECL_STRUCT_FUNCTION of the function. */ |
4016 | ||
4017 | struct function * | |
975d043f | 4018 | cgraph_node::get_fun () const |
8ccda8bc | 4019 | { |
975d043f | 4020 | const cgraph_node *node = this; |
8ccda8bc EB |
4021 | struct function *fun = DECL_STRUCT_FUNCTION (node->decl); |
4022 | ||
4023 | while (!fun && node->clone_of) | |
4024 | { | |
4025 | node = node->clone_of; | |
4026 | fun = DECL_STRUCT_FUNCTION (node->decl); | |
4027 | } | |
4028 | ||
4029 | return fun; | |
4030 | } | |
4031 | ||
3edf64aa DM |
4032 | /* Reset all state within cgraph.c so that we can rerun the compiler |
4033 | within the same process. For use by toplev::finalize. */ | |
4034 | ||
4035 | void | |
4036 | cgraph_c_finalize (void) | |
4037 | { | |
89576d86 | 4038 | nested_function_info::release (); |
67f3791f | 4039 | thunk_info::release (); |
ae7a23a3 | 4040 | clone_info::release (); |
3edf64aa DM |
4041 | symtab = NULL; |
4042 | ||
4043 | x_cgraph_nodes_queue = NULL; | |
4044 | ||
4045 | cgraph_fnver_htab = NULL; | |
4046 | version_info_node = NULL; | |
4047 | } | |
4048 | ||
dfea3d6f | 4049 | /* A worker for call_for_symbol_and_aliases. */ |
31de7606 JH |
4050 | |
4051 | bool | |
4052 | cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback) (cgraph_node *, | |
4053 | void *), | |
4054 | void *data, | |
4055 | bool include_overwritable) | |
4056 | { | |
4057 | ipa_ref *ref; | |
4058 | FOR_EACH_ALIAS (this, ref) | |
4059 | { | |
4060 | cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); | |
4061 | if (include_overwritable | |
4062 | || alias->get_availability () > AVAIL_INTERPOSABLE) | |
4063 | if (alias->call_for_symbol_and_aliases (callback, data, | |
4064 | include_overwritable)) | |
4065 | return true; | |
4066 | } | |
4067 | return false; | |
4068 | } | |
17d1bf76 ML |
4069 | |
4070 | /* Return true if NODE has thunk. */ | |
4071 | ||
4072 | bool | |
4073 | cgraph_node::has_thunk_p (cgraph_node *node, void *) | |
4074 | { | |
4075 | for (cgraph_edge *e = node->callers; e; e = e->next_caller) | |
67f3791f | 4076 | if (e->caller->thunk) |
17d1bf76 ML |
4077 | return true; |
4078 | return false; | |
4079 | } | |
4080 | ||
7349698e | 4081 | /* Expected frequency of executions within the function. */ |
41f0e819 JH |
4082 | |
4083 | sreal | |
4084 | cgraph_edge::sreal_frequency () | |
4085 | { | |
a62bfab5 ML |
4086 | return count.to_sreal_scale (caller->inlined_to |
4087 | ? caller->inlined_to->count | |
41f0e819 JH |
4088 | : caller->count); |
4089 | } | |
4090 | ||
f714ecf5 JH |
4091 | |
4092 | /* During LTO stream in this can be used to check whether call can possibly | |
4093 | be internal to the current translation unit. */ | |
4094 | ||
4095 | bool | |
4096 | cgraph_edge::possibly_call_in_translation_unit_p (void) | |
4097 | { | |
4098 | gcc_checking_assert (in_lto_p && caller->prevailing_p ()); | |
4099 | ||
4100 | /* While incremental linking we may end up getting function body later. */ | |
4101 | if (flag_incremental_link == INCREMENTAL_LINK_LTO) | |
4102 | return true; | |
4103 | ||
dfea3d6f JJ |
4104 | /* We may be smarter here and avoid streaming in indirect calls we can't |
4105 | track, but that would require arranging streaming the indirect call | |
f714ecf5 JH |
4106 | summary first. */ |
4107 | if (!callee) | |
4108 | return true; | |
4109 | ||
dfea3d6f JJ |
4110 | /* If callee is local to the original translation unit, it will be |
4111 | defined. */ | |
f714ecf5 JH |
4112 | if (!TREE_PUBLIC (callee->decl) && !DECL_EXTERNAL (callee->decl)) |
4113 | return true; | |
4114 | ||
4115 | /* Otherwise we need to lookup prevailing symbol (symbol table is not merged, | |
4116 | yet) and see if it is a definition. In fact we may also resolve aliases, | |
4117 | but that is probably not too important. */ | |
4118 | symtab_node *node = callee; | |
4119 | for (int n = 10; node->previous_sharing_asm_name && n ; n--) | |
4120 | node = node->previous_sharing_asm_name; | |
4121 | if (node->previous_sharing_asm_name) | |
4122 | node = symtab_node::get_for_asmname (DECL_ASSEMBLER_NAME (callee->decl)); | |
4123 | gcc_assert (TREE_PUBLIC (node->decl)); | |
f653eb0e | 4124 | return node->get_availability () >= AVAIL_INTERPOSABLE; |
f714ecf5 JH |
4125 | } |
4126 | ||
f1ba88b1 XHL |
4127 | /* Return num_speculative_targets of this edge. */ |
4128 | ||
4129 | int | |
4130 | cgraph_edge::num_speculative_call_targets_p (void) | |
4131 | { | |
4132 | return indirect_info ? indirect_info->num_speculative_call_targets : 0; | |
4133 | } | |
4134 | ||
72b3bc89 JH |
4135 | /* Check if function calls comdat local. This is used to recompute |
4136 | calls_comdat_local flag after function transformations. */ | |
4137 | bool | |
4138 | cgraph_node::check_calls_comdat_local_p () | |
4139 | { | |
4140 | for (cgraph_edge *e = callees; e; e = e->next_callee) | |
4141 | if (e->inline_failed | |
4142 | ? e->callee->comdat_local_p () | |
4143 | : e->callee->check_calls_comdat_local_p ()) | |
4144 | return true; | |
4145 | return false; | |
4146 | } | |
4147 | ||
a29ff9c5 ML |
4148 | /* Return true if this node represents a former, i.e. an expanded, thunk. */ |
4149 | ||
4150 | bool | |
4151 | cgraph_node::former_thunk_p (void) | |
4152 | { | |
4153 | if (thunk) | |
4154 | return false; | |
4155 | thunk_info *i = thunk_info::get (this); | |
4156 | if (!i) | |
4157 | return false; | |
4158 | gcc_checking_assert (i->fixed_offset || i->virtual_offset_p | |
4159 | || i->indirect_offset); | |
4160 | return true; | |
4161 | } | |
4162 | ||
212755ff DM |
4163 | /* A stashed copy of "symtab" for use by selftest::symbol_table_test. |
4164 | This needs to be a global so that it can be a GC root, and thus | |
4165 | prevent the stashed copy from being garbage-collected if the GC runs | |
4166 | during a symbol_table_test. */ | |
4167 | ||
4168 | symbol_table *saved_symtab; | |
4169 | ||
4170 | #if CHECKING_P | |
4171 | ||
4172 | namespace selftest { | |
4173 | ||
4174 | /* class selftest::symbol_table_test. */ | |
4175 | ||
4176 | /* Constructor. Store the old value of symtab, and create a new one. */ | |
4177 | ||
4178 | symbol_table_test::symbol_table_test () | |
4179 | { | |
4180 | gcc_assert (saved_symtab == NULL); | |
4181 | saved_symtab = symtab; | |
a65d584d | 4182 | symtab = new (ggc_alloc<symbol_table> ()) symbol_table (); |
212755ff DM |
4183 | } |
4184 | ||
4185 | /* Destructor. Restore the old value of symtab. */ | |
4186 | ||
4187 | symbol_table_test::~symbol_table_test () | |
4188 | { | |
4189 | gcc_assert (saved_symtab != NULL); | |
4190 | symtab = saved_symtab; | |
4191 | saved_symtab = NULL; | |
4192 | } | |
4193 | ||
4194 | /* Verify that symbol_table_test works. */ | |
4195 | ||
4196 | static void | |
4197 | test_symbol_table_test () | |
4198 | { | |
4199 | /* Simulate running two selftests involving symbol tables. */ | |
4200 | for (int i = 0; i < 2; i++) | |
4201 | { | |
4202 | symbol_table_test stt; | |
4203 | tree test_decl = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, | |
4204 | get_identifier ("test_decl"), | |
4205 | build_function_type_list (void_type_node, | |
4206 | NULL_TREE)); | |
4207 | cgraph_node *node = cgraph_node::get_create (test_decl); | |
4208 | gcc_assert (node); | |
4209 | ||
4210 | /* Verify that the node has order 0 on both iterations, | |
4211 | and thus that nodes have predictable dump names in selftests. */ | |
4212 | ASSERT_EQ (node->order, 0); | |
4213 | ASSERT_STREQ (node->dump_name (), "test_decl/0"); | |
4214 | } | |
4215 | } | |
4216 | ||
4217 | /* Run all of the selftests within this file. */ | |
4218 | ||
4219 | void | |
4220 | cgraph_c_tests () | |
4221 | { | |
4222 | test_symbol_table_test (); | |
4223 | } | |
4224 | ||
4225 | } // namespace selftest | |
4226 | ||
4227 | #endif /* CHECKING_P */ | |
4228 | ||
988d1653 | 4229 | #include "gt-cgraph.h" |