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