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