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