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