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