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