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