]>
Commit | Line | Data |
---|---|---|
e72fcfe8 | 1 | /* Callgraph handling code. |
d1e082c2 | 2 | Copyright (C) 2003-2013 Free Software Foundation, Inc. |
e72fcfe8 JH |
3 | Contributed by Jan Hubicka |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 9 | Software Foundation; either version 3, or (at your option) any later |
e72fcfe8 JH |
10 | version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
e72fcfe8 | 20 | |
8a4a83ed | 21 | /* This file contains basic routines manipulating call graph |
c22cacf3 | 22 | |
9c8305f8 JH |
23 | The call-graph is a data structure designed for intra-procedural optimization. |
24 | It represents a multi-graph where nodes are functions and edges are call sites. */ | |
18c6ada9 | 25 | |
e72fcfe8 JH |
26 | #include "config.h" |
27 | #include "system.h" | |
28 | #include "coretypes.h" | |
29 | #include "tm.h" | |
30 | #include "tree.h" | |
cd9c7bd2 | 31 | #include "tree-inline.h" |
e72fcfe8 JH |
32 | #include "langhooks.h" |
33 | #include "hashtab.h" | |
34 | #include "toplev.h" | |
35 | #include "flags.h" | |
36 | #include "ggc.h" | |
37 | #include "debug.h" | |
38 | #include "target.h" | |
cd9c7bd2 | 39 | #include "basic-block.h" |
1c4a429a | 40 | #include "cgraph.h" |
dc0bfe6a | 41 | #include "intl.h" |
726a989a | 42 | #include "gimple.h" |
7ee2468b SB |
43 | #include "timevar.h" |
44 | #include "dumpfile.h" | |
7a388ee4 | 45 | #include "tree-flow.h" |
a63f2942 | 46 | #include "value-prof.h" |
f9417da1 | 47 | #include "except.h" |
1da2ed5f | 48 | #include "diagnostic-core.h" |
715a4e08 | 49 | #include "rtl.h" |
a940b4d9 | 50 | #include "ipa-utils.h" |
99fecd47 | 51 | #include "lto-streamer.h" |
e7f23018 | 52 | #include "ipa-inline.h" |
7d776ee2 | 53 | #include "cfgloop.h" |
9c8305f8 | 54 | #include "gimple-pretty-print.h" |
988d1653 | 55 | |
7ee2468b SB |
56 | /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */ |
57 | #include "tree-pass.h" | |
58 | ||
2563c224 RG |
59 | static void cgraph_node_remove_callers (struct cgraph_node *node); |
60 | static inline void cgraph_edge_remove_caller (struct cgraph_edge *e); | |
61 | static inline void cgraph_edge_remove_callee (struct cgraph_edge *e); | |
62 | ||
1668aabc | 63 | /* Queue of cgraph nodes scheduled to be lowered. */ |
960bfb69 JH |
64 | symtab_node x_cgraph_nodes_queue; |
65 | #define cgraph_nodes_queue ((struct cgraph_node *)x_cgraph_nodes_queue) | |
1668aabc | 66 | |
e72fcfe8 | 67 | /* Number of nodes in existence. */ |
1c4a429a | 68 | int cgraph_n_nodes; |
e72fcfe8 | 69 | |
b58b1157 JH |
70 | /* Maximal uid used in cgraph nodes. */ |
71 | int cgraph_max_uid; | |
72 | ||
9088c1cc MJ |
73 | /* Maximal uid used in cgraph edges. */ |
74 | int cgraph_edge_max_uid; | |
75 | ||
dafc5b82 JH |
76 | /* Set when whole unit has been analyzed so we can access global info. */ |
77 | bool cgraph_global_info_ready = false; | |
78 | ||
f45e0ad1 | 79 | /* What state callgraph is in right now. */ |
66058468 | 80 | enum cgraph_state cgraph_state = CGRAPH_STATE_PARSING; |
f45e0ad1 | 81 | |
cd9c7bd2 JH |
82 | /* Set when the cgraph is fully build and the basic flags are computed. */ |
83 | bool cgraph_function_flags_ready = false; | |
84 | ||
61502ca8 | 85 | /* List of hooks triggered on cgraph_edge events. */ |
9088c1cc MJ |
86 | struct cgraph_edge_hook_list { |
87 | cgraph_edge_hook hook; | |
88 | void *data; | |
89 | struct cgraph_edge_hook_list *next; | |
90 | }; | |
91 | ||
61502ca8 | 92 | /* List of hooks triggered on cgraph_node events. */ |
9088c1cc MJ |
93 | struct cgraph_node_hook_list { |
94 | cgraph_node_hook hook; | |
95 | void *data; | |
96 | struct cgraph_node_hook_list *next; | |
97 | }; | |
98 | ||
61502ca8 | 99 | /* List of hooks triggered on events involving two cgraph_edges. */ |
9088c1cc MJ |
100 | struct cgraph_2edge_hook_list { |
101 | cgraph_2edge_hook hook; | |
102 | void *data; | |
103 | struct cgraph_2edge_hook_list *next; | |
104 | }; | |
105 | ||
61502ca8 | 106 | /* List of hooks triggered on events involving two cgraph_nodes. */ |
9088c1cc MJ |
107 | struct cgraph_2node_hook_list { |
108 | cgraph_2node_hook hook; | |
109 | void *data; | |
110 | struct cgraph_2node_hook_list *next; | |
111 | }; | |
112 | ||
113 | /* List of hooks triggered when an edge is removed. */ | |
114 | struct cgraph_edge_hook_list *first_cgraph_edge_removal_hook; | |
115 | /* List of hooks triggered when a node is removed. */ | |
116 | struct cgraph_node_hook_list *first_cgraph_node_removal_hook; | |
117 | /* List of hooks triggered when an edge is duplicated. */ | |
118 | struct cgraph_2edge_hook_list *first_cgraph_edge_duplicated_hook; | |
119 | /* List of hooks triggered when a node is duplicated. */ | |
120 | struct cgraph_2node_hook_list *first_cgraph_node_duplicated_hook; | |
129a37fc JH |
121 | /* List of hooks triggered when an function is inserted. */ |
122 | struct cgraph_node_hook_list *first_cgraph_function_insertion_hook; | |
9088c1cc | 123 | |
2fb16412 MJ |
124 | /* Head of a linked list of unused (freed) call graph nodes. |
125 | Do not GTY((delete)) this list so UIDs gets reliably recycled. */ | |
126 | static GTY(()) struct cgraph_node *free_nodes; | |
934cb78a MJ |
127 | /* Head of a linked list of unused (freed) call graph edges. |
128 | Do not GTY((delete)) this list so UIDs gets reliably recycled. */ | |
129 | static GTY(()) struct cgraph_edge *free_edges; | |
130 | ||
39e2db00 JH |
131 | /* Did procss_same_body_aliases run? */ |
132 | bool same_body_aliases_done; | |
133 | ||
3649b9b7 ST |
134 | /* Map a cgraph_node to cgraph_function_version_info using this htab. |
135 | The cgraph_function_version_info has a THIS_NODE field that is the | |
136 | corresponding cgraph_node.. */ | |
137 | ||
138 | static htab_t GTY((param_is (struct cgraph_function_version_info *))) | |
139 | cgraph_fnver_htab = NULL; | |
140 | ||
141 | /* Hash function for cgraph_fnver_htab. */ | |
142 | static hashval_t | |
143 | cgraph_fnver_htab_hash (const void *ptr) | |
144 | { | |
145 | int uid = ((const struct cgraph_function_version_info *)ptr)->this_node->uid; | |
146 | return (hashval_t)(uid); | |
147 | } | |
148 | ||
149 | /* eq function for cgraph_fnver_htab. */ | |
150 | static int | |
151 | cgraph_fnver_htab_eq (const void *p1, const void *p2) | |
152 | { | |
153 | const struct cgraph_function_version_info *n1 | |
154 | = (const struct cgraph_function_version_info *)p1; | |
155 | const struct cgraph_function_version_info *n2 | |
156 | = (const struct cgraph_function_version_info *)p2; | |
157 | ||
158 | return n1->this_node->uid == n2->this_node->uid; | |
159 | } | |
160 | ||
161 | /* Mark as GC root all allocated nodes. */ | |
162 | static GTY(()) struct cgraph_function_version_info * | |
163 | version_info_node = NULL; | |
164 | ||
165 | /* Get the cgraph_function_version_info node corresponding to node. */ | |
166 | struct cgraph_function_version_info * | |
167 | get_cgraph_node_version (struct cgraph_node *node) | |
168 | { | |
169 | struct cgraph_function_version_info *ret; | |
170 | struct cgraph_function_version_info key; | |
171 | key.this_node = node; | |
172 | ||
173 | if (cgraph_fnver_htab == NULL) | |
174 | return NULL; | |
175 | ||
176 | ret = (struct cgraph_function_version_info *) | |
177 | htab_find (cgraph_fnver_htab, &key); | |
178 | ||
179 | return ret; | |
180 | } | |
181 | ||
182 | /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab | |
183 | corresponding to cgraph_node NODE. */ | |
184 | struct cgraph_function_version_info * | |
185 | insert_new_cgraph_node_version (struct cgraph_node *node) | |
186 | { | |
187 | void **slot; | |
188 | ||
189 | version_info_node = NULL; | |
190 | version_info_node = ggc_alloc_cleared_cgraph_function_version_info (); | |
191 | version_info_node->this_node = node; | |
192 | ||
193 | if (cgraph_fnver_htab == NULL) | |
194 | cgraph_fnver_htab = htab_create_ggc (2, cgraph_fnver_htab_hash, | |
195 | cgraph_fnver_htab_eq, NULL); | |
196 | ||
197 | slot = htab_find_slot (cgraph_fnver_htab, version_info_node, INSERT); | |
198 | gcc_assert (slot != NULL); | |
199 | *slot = version_info_node; | |
200 | return version_info_node; | |
201 | } | |
202 | ||
203 | /* Remove the cgraph_function_version_info and cgraph_node for DECL. This | |
204 | DECL is a duplicate declaration. */ | |
205 | void | |
206 | delete_function_version (tree decl) | |
207 | { | |
beb42d20 | 208 | struct cgraph_node *decl_node = cgraph_get_node (decl); |
3649b9b7 ST |
209 | struct cgraph_function_version_info *decl_v = NULL; |
210 | ||
211 | if (decl_node == NULL) | |
212 | return; | |
213 | ||
214 | decl_v = get_cgraph_node_version (decl_node); | |
215 | ||
216 | if (decl_v == NULL) | |
217 | return; | |
218 | ||
219 | if (decl_v->prev != NULL) | |
220 | decl_v->prev->next = decl_v->next; | |
221 | ||
222 | if (decl_v->next != NULL) | |
223 | decl_v->next->prev = decl_v->prev; | |
224 | ||
225 | if (cgraph_fnver_htab != NULL) | |
226 | htab_remove_elt (cgraph_fnver_htab, decl_v); | |
227 | ||
228 | cgraph_remove_node (decl_node); | |
229 | } | |
230 | ||
231 | /* Record that DECL1 and DECL2 are semantically identical function | |
232 | versions. */ | |
233 | void | |
234 | record_function_versions (tree decl1, tree decl2) | |
235 | { | |
236 | struct cgraph_node *decl1_node = cgraph_get_create_node (decl1); | |
237 | struct cgraph_node *decl2_node = cgraph_get_create_node (decl2); | |
238 | struct cgraph_function_version_info *decl1_v = NULL; | |
239 | struct cgraph_function_version_info *decl2_v = NULL; | |
240 | struct cgraph_function_version_info *before; | |
241 | struct cgraph_function_version_info *after; | |
242 | ||
243 | gcc_assert (decl1_node != NULL && decl2_node != NULL); | |
244 | decl1_v = get_cgraph_node_version (decl1_node); | |
245 | decl2_v = get_cgraph_node_version (decl2_node); | |
246 | ||
247 | if (decl1_v != NULL && decl2_v != NULL) | |
248 | return; | |
249 | ||
250 | if (decl1_v == NULL) | |
251 | decl1_v = insert_new_cgraph_node_version (decl1_node); | |
252 | ||
253 | if (decl2_v == NULL) | |
254 | decl2_v = insert_new_cgraph_node_version (decl2_node); | |
255 | ||
256 | /* Chain decl2_v and decl1_v. All semantically identical versions | |
257 | will be chained together. */ | |
258 | ||
259 | before = decl1_v; | |
260 | after = decl2_v; | |
261 | ||
262 | while (before->next != NULL) | |
263 | before = before->next; | |
264 | ||
265 | while (after->prev != NULL) | |
266 | after= after->prev; | |
267 | ||
268 | before->next = after; | |
269 | after->prev = before; | |
270 | } | |
271 | ||
2fb16412 MJ |
272 | /* Macros to access the next item in the list of free cgraph nodes and |
273 | edges. */ | |
2aae7680 JH |
274 | #define NEXT_FREE_NODE(NODE) cgraph ((NODE)->symbol.next) |
275 | #define SET_NEXT_FREE_NODE(NODE,NODE2) ((NODE))->symbol.next = (symtab_node)NODE2 | |
934cb78a | 276 | #define NEXT_FREE_EDGE(EDGE) (EDGE)->prev_caller |
9088c1cc MJ |
277 | |
278 | /* Register HOOK to be called with DATA on each removed edge. */ | |
279 | struct cgraph_edge_hook_list * | |
280 | cgraph_add_edge_removal_hook (cgraph_edge_hook hook, void *data) | |
281 | { | |
282 | struct cgraph_edge_hook_list *entry; | |
283 | struct cgraph_edge_hook_list **ptr = &first_cgraph_edge_removal_hook; | |
284 | ||
285 | entry = (struct cgraph_edge_hook_list *) xmalloc (sizeof (*entry)); | |
286 | entry->hook = hook; | |
287 | entry->data = data; | |
288 | entry->next = NULL; | |
289 | while (*ptr) | |
290 | ptr = &(*ptr)->next; | |
291 | *ptr = entry; | |
292 | return entry; | |
293 | } | |
294 | ||
295 | /* Remove ENTRY from the list of hooks called on removing edges. */ | |
296 | void | |
297 | cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *entry) | |
298 | { | |
299 | struct cgraph_edge_hook_list **ptr = &first_cgraph_edge_removal_hook; | |
300 | ||
301 | while (*ptr != entry) | |
302 | ptr = &(*ptr)->next; | |
303 | *ptr = entry->next; | |
934cb78a | 304 | free (entry); |
9088c1cc MJ |
305 | } |
306 | ||
307 | /* Call all edge removal hooks. */ | |
308 | static void | |
309 | cgraph_call_edge_removal_hooks (struct cgraph_edge *e) | |
310 | { | |
311 | struct cgraph_edge_hook_list *entry = first_cgraph_edge_removal_hook; | |
312 | while (entry) | |
313 | { | |
314 | entry->hook (e, entry->data); | |
315 | entry = entry->next; | |
316 | } | |
317 | } | |
318 | ||
319 | /* Register HOOK to be called with DATA on each removed node. */ | |
320 | struct cgraph_node_hook_list * | |
321 | cgraph_add_node_removal_hook (cgraph_node_hook hook, void *data) | |
322 | { | |
323 | struct cgraph_node_hook_list *entry; | |
324 | struct cgraph_node_hook_list **ptr = &first_cgraph_node_removal_hook; | |
325 | ||
326 | entry = (struct cgraph_node_hook_list *) xmalloc (sizeof (*entry)); | |
327 | entry->hook = hook; | |
328 | entry->data = data; | |
329 | entry->next = NULL; | |
330 | while (*ptr) | |
331 | ptr = &(*ptr)->next; | |
332 | *ptr = entry; | |
333 | return entry; | |
334 | } | |
335 | ||
336 | /* Remove ENTRY from the list of hooks called on removing nodes. */ | |
337 | void | |
338 | cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *entry) | |
339 | { | |
340 | struct cgraph_node_hook_list **ptr = &first_cgraph_node_removal_hook; | |
341 | ||
342 | while (*ptr != entry) | |
343 | ptr = &(*ptr)->next; | |
344 | *ptr = entry->next; | |
934cb78a | 345 | free (entry); |
9088c1cc MJ |
346 | } |
347 | ||
348 | /* Call all node removal hooks. */ | |
349 | static void | |
350 | cgraph_call_node_removal_hooks (struct cgraph_node *node) | |
351 | { | |
352 | struct cgraph_node_hook_list *entry = first_cgraph_node_removal_hook; | |
353 | while (entry) | |
354 | { | |
355 | entry->hook (node, entry->data); | |
356 | entry = entry->next; | |
357 | } | |
358 | } | |
359 | ||
6544865a | 360 | /* Register HOOK to be called with DATA on each inserted node. */ |
129a37fc JH |
361 | struct cgraph_node_hook_list * |
362 | cgraph_add_function_insertion_hook (cgraph_node_hook hook, void *data) | |
363 | { | |
364 | struct cgraph_node_hook_list *entry; | |
365 | struct cgraph_node_hook_list **ptr = &first_cgraph_function_insertion_hook; | |
366 | ||
367 | entry = (struct cgraph_node_hook_list *) xmalloc (sizeof (*entry)); | |
368 | entry->hook = hook; | |
369 | entry->data = data; | |
370 | entry->next = NULL; | |
371 | while (*ptr) | |
372 | ptr = &(*ptr)->next; | |
373 | *ptr = entry; | |
374 | return entry; | |
375 | } | |
376 | ||
6544865a | 377 | /* Remove ENTRY from the list of hooks called on inserted nodes. */ |
129a37fc JH |
378 | void |
379 | cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *entry) | |
380 | { | |
381 | struct cgraph_node_hook_list **ptr = &first_cgraph_function_insertion_hook; | |
382 | ||
383 | while (*ptr != entry) | |
384 | ptr = &(*ptr)->next; | |
385 | *ptr = entry->next; | |
934cb78a | 386 | free (entry); |
129a37fc JH |
387 | } |
388 | ||
6544865a | 389 | /* Call all node insertion hooks. */ |
129a37fc JH |
390 | void |
391 | cgraph_call_function_insertion_hooks (struct cgraph_node *node) | |
392 | { | |
393 | struct cgraph_node_hook_list *entry = first_cgraph_function_insertion_hook; | |
394 | while (entry) | |
395 | { | |
396 | entry->hook (node, entry->data); | |
397 | entry = entry->next; | |
398 | } | |
399 | } | |
400 | ||
9088c1cc MJ |
401 | /* Register HOOK to be called with DATA on each duplicated edge. */ |
402 | struct cgraph_2edge_hook_list * | |
403 | cgraph_add_edge_duplication_hook (cgraph_2edge_hook hook, void *data) | |
404 | { | |
405 | struct cgraph_2edge_hook_list *entry; | |
406 | struct cgraph_2edge_hook_list **ptr = &first_cgraph_edge_duplicated_hook; | |
407 | ||
408 | entry = (struct cgraph_2edge_hook_list *) xmalloc (sizeof (*entry)); | |
409 | entry->hook = hook; | |
410 | entry->data = data; | |
411 | entry->next = NULL; | |
412 | while (*ptr) | |
413 | ptr = &(*ptr)->next; | |
414 | *ptr = entry; | |
415 | return entry; | |
416 | } | |
417 | ||
418 | /* Remove ENTRY from the list of hooks called on duplicating edges. */ | |
419 | void | |
420 | cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *entry) | |
421 | { | |
422 | struct cgraph_2edge_hook_list **ptr = &first_cgraph_edge_duplicated_hook; | |
423 | ||
424 | while (*ptr != entry) | |
425 | ptr = &(*ptr)->next; | |
426 | *ptr = entry->next; | |
934cb78a | 427 | free (entry); |
9088c1cc MJ |
428 | } |
429 | ||
430 | /* Call all edge duplication hooks. */ | |
66a20fc2 | 431 | void |
9088c1cc MJ |
432 | cgraph_call_edge_duplication_hooks (struct cgraph_edge *cs1, |
433 | struct cgraph_edge *cs2) | |
434 | { | |
435 | struct cgraph_2edge_hook_list *entry = first_cgraph_edge_duplicated_hook; | |
436 | while (entry) | |
437 | { | |
438 | entry->hook (cs1, cs2, entry->data); | |
439 | entry = entry->next; | |
440 | } | |
441 | } | |
442 | ||
443 | /* Register HOOK to be called with DATA on each duplicated node. */ | |
444 | struct cgraph_2node_hook_list * | |
445 | cgraph_add_node_duplication_hook (cgraph_2node_hook hook, void *data) | |
446 | { | |
447 | struct cgraph_2node_hook_list *entry; | |
448 | struct cgraph_2node_hook_list **ptr = &first_cgraph_node_duplicated_hook; | |
449 | ||
450 | entry = (struct cgraph_2node_hook_list *) xmalloc (sizeof (*entry)); | |
451 | entry->hook = hook; | |
452 | entry->data = data; | |
453 | entry->next = NULL; | |
454 | while (*ptr) | |
455 | ptr = &(*ptr)->next; | |
456 | *ptr = entry; | |
457 | return entry; | |
458 | } | |
459 | ||
460 | /* Remove ENTRY from the list of hooks called on duplicating nodes. */ | |
461 | void | |
462 | cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *entry) | |
463 | { | |
464 | struct cgraph_2node_hook_list **ptr = &first_cgraph_node_duplicated_hook; | |
465 | ||
466 | while (*ptr != entry) | |
467 | ptr = &(*ptr)->next; | |
468 | *ptr = entry->next; | |
934cb78a | 469 | free (entry); |
9088c1cc MJ |
470 | } |
471 | ||
472 | /* Call all node duplication hooks. */ | |
b0d0a291 | 473 | void |
9088c1cc MJ |
474 | cgraph_call_node_duplication_hooks (struct cgraph_node *node1, |
475 | struct cgraph_node *node2) | |
476 | { | |
477 | struct cgraph_2node_hook_list *entry = first_cgraph_node_duplicated_hook; | |
478 | while (entry) | |
479 | { | |
480 | entry->hook (node1, node2, entry->data); | |
481 | entry = entry->next; | |
482 | } | |
483 | } | |
484 | ||
b2583345 | 485 | /* Allocate new callgraph node. */ |
0550e7b7 | 486 | |
b2583345 JJ |
487 | static inline struct cgraph_node * |
488 | cgraph_allocate_node (void) | |
18c6ada9 JH |
489 | { |
490 | struct cgraph_node *node; | |
491 | ||
2fb16412 MJ |
492 | if (free_nodes) |
493 | { | |
494 | node = free_nodes; | |
495 | free_nodes = NEXT_FREE_NODE (node); | |
496 | } | |
497 | else | |
498 | { | |
a9429e29 | 499 | node = ggc_alloc_cleared_cgraph_node (); |
2fb16412 MJ |
500 | node->uid = cgraph_max_uid++; |
501 | } | |
502 | ||
b2583345 JJ |
503 | return node; |
504 | } | |
505 | ||
506 | /* Allocate new callgraph node and insert it into basic data structures. */ | |
507 | ||
66a20fc2 JH |
508 | struct cgraph_node * |
509 | cgraph_create_empty_node (void) | |
b2583345 JJ |
510 | { |
511 | struct cgraph_node *node = cgraph_allocate_node (); | |
512 | ||
1f00098b | 513 | node->symbol.type = SYMTAB_FUNCTION; |
5fefcf92 | 514 | node->frequency = NODE_FREQUENCY_NORMAL; |
db0bf14f | 515 | node->count_materialization_scale = REG_BR_PROB_BASE; |
18c6ada9 JH |
516 | cgraph_n_nodes++; |
517 | return node; | |
518 | } | |
519 | ||
e72fcfe8 | 520 | /* Return cgraph node assigned to DECL. Create new one when needed. */ |
0550e7b7 | 521 | |
1c4a429a | 522 | struct cgraph_node * |
a358e188 | 523 | cgraph_create_node (tree decl) |
e72fcfe8 | 524 | { |
66a20fc2 | 525 | struct cgraph_node *node = cgraph_create_empty_node (); |
341c100f | 526 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
988d1653 | 527 | |
960bfb69 | 528 | node->symbol.decl = decl; |
1ab24192 JH |
529 | symtab_register_node ((symtab_node) node); |
530 | ||
5c2e00ee | 531 | if (DECL_CONTEXT (decl) && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL) |
e72fcfe8 | 532 | { |
a358e188 | 533 | node->origin = cgraph_get_create_node (DECL_CONTEXT (decl)); |
e72fcfe8 JH |
534 | node->next_nested = node->origin->nested; |
535 | node->origin->nested = node; | |
536 | } | |
537 | return node; | |
538 | } | |
539 | ||
a358e188 MJ |
540 | /* Try to find a call graph node for declaration DECL and if it does not exist, |
541 | create it. */ | |
542 | ||
543 | struct cgraph_node * | |
544 | cgraph_get_create_node (tree decl) | |
545 | { | |
546 | struct cgraph_node *node; | |
547 | ||
548 | node = cgraph_get_node (decl); | |
549 | if (node) | |
550 | return node; | |
551 | ||
552 | return cgraph_create_node (decl); | |
553 | } | |
554 | ||
87e7b310 | 555 | /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing |
073a8998 | 556 | the function body is associated with (not necessarily cgraph_node (DECL). */ |
b2583345 | 557 | |
39e2db00 JH |
558 | struct cgraph_node * |
559 | cgraph_create_function_alias (tree alias, tree decl) | |
b2583345 | 560 | { |
39e2db00 | 561 | struct cgraph_node *alias_node; |
b2583345 JJ |
562 | |
563 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); | |
564 | gcc_assert (TREE_CODE (alias) == FUNCTION_DECL); | |
39e2db00 | 565 | alias_node = cgraph_get_create_node (alias); |
e70670cf | 566 | gcc_assert (!alias_node->symbol.definition); |
6744a6ab | 567 | alias_node->thunk.alias = decl; |
e70670cf JH |
568 | alias_node->symbol.definition = true; |
569 | alias_node->symbol.alias = true; | |
6744a6ab JH |
570 | return alias_node; |
571 | } | |
572 | ||
051f8cc6 | 573 | /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful |
a358e188 | 574 | and NULL otherwise. |
6744a6ab | 575 | Same body aliases are output whenever the body of DECL is output, |
a358e188 | 576 | and cgraph_get_node (ALIAS) transparently returns cgraph_get_node (DECL). */ |
6744a6ab | 577 | |
051f8cc6 | 578 | struct cgraph_node * |
39e2db00 | 579 | cgraph_same_body_alias (struct cgraph_node *decl_node ATTRIBUTE_UNUSED, tree alias, tree decl) |
6744a6ab | 580 | { |
39e2db00 | 581 | struct cgraph_node *n; |
6744a6ab JH |
582 | #ifndef ASM_OUTPUT_DEF |
583 | /* If aliases aren't supported by the assembler, fail. */ | |
051f8cc6 | 584 | return NULL; |
6744a6ab | 585 | #endif |
39e2db00 JH |
586 | /* Langhooks can create same body aliases of symbols not defined. |
587 | Those are useless. Drop them on the floor. */ | |
588 | if (cgraph_global_info_ready) | |
589 | return NULL; | |
6744a6ab | 590 | |
39e2db00 JH |
591 | n = cgraph_create_function_alias (alias, decl); |
592 | n->same_body_alias = true; | |
593 | if (same_body_aliases_done) | |
5932a4d4 JH |
594 | ipa_record_reference ((symtab_node)n, (symtab_node)cgraph_get_node (decl), |
595 | IPA_REF_ALIAS, NULL); | |
39e2db00 | 596 | return n; |
6744a6ab JH |
597 | } |
598 | ||
051f8cc6 | 599 | /* Add thunk alias into callgraph. The alias declaration is ALIAS and it |
61502ca8 | 600 | aliases DECL with an adjustments made into the first parameter. |
051f8cc6 JH |
601 | See comments in thunk_adjust for detail on the parameters. */ |
602 | ||
603 | struct cgraph_node * | |
c47d0034 | 604 | cgraph_add_thunk (struct cgraph_node *decl_node ATTRIBUTE_UNUSED, |
66058468 | 605 | tree alias, tree decl ATTRIBUTE_UNUSED, |
87e7b310 | 606 | bool this_adjusting, |
6744a6ab JH |
607 | HOST_WIDE_INT fixed_offset, HOST_WIDE_INT virtual_value, |
608 | tree virtual_offset, | |
609 | tree real_alias) | |
610 | { | |
c47d0034 | 611 | struct cgraph_node *node; |
6744a6ab | 612 | |
c47d0034 | 613 | node = cgraph_get_node (alias); |
6744a6ab JH |
614 | if (node) |
615 | { | |
e70670cf JH |
616 | gcc_assert (node->symbol.definition); |
617 | gcc_assert (!node->symbol.alias); | |
be330ed4 | 618 | gcc_assert (!node->thunk.thunk_p); |
6744a6ab JH |
619 | cgraph_remove_node (node); |
620 | } | |
621 | ||
c47d0034 | 622 | node = cgraph_create_node (alias); |
77a74ed7 | 623 | gcc_checking_assert (!virtual_offset |
27bcd47c LC |
624 | || tree_to_double_int (virtual_offset) == |
625 | double_int::from_shwi (virtual_value)); | |
6744a6ab JH |
626 | node->thunk.fixed_offset = fixed_offset; |
627 | node->thunk.this_adjusting = this_adjusting; | |
628 | node->thunk.virtual_value = virtual_value; | |
629 | node->thunk.virtual_offset_p = virtual_offset != NULL; | |
630 | node->thunk.alias = real_alias; | |
631 | node->thunk.thunk_p = true; | |
e70670cf | 632 | node->symbol.definition = true; |
c47d0034 | 633 | |
051f8cc6 | 634 | return node; |
b2583345 JJ |
635 | } |
636 | ||
bedb9fc0 RH |
637 | /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME. |
638 | Return NULL if there's no such node. */ | |
639 | ||
640 | struct cgraph_node * | |
641 | cgraph_node_for_asm (tree asmname) | |
642 | { | |
1ab24192 | 643 | /* We do not want to look at inline clones. */ |
5d59b5e1 LC |
644 | for (symtab_node node = symtab_node_for_asm (asmname); |
645 | node; | |
646 | node = node->symbol.next_sharing_asm_name) | |
647 | { | |
648 | cgraph_node *cn = dyn_cast <cgraph_node> (node); | |
649 | if (cn && !cn->global.inlined_to) | |
650 | return cn; | |
651 | } | |
bedb9fc0 RH |
652 | return NULL; |
653 | } | |
654 | ||
6bdf3519 | 655 | /* Returns a hash value for X (which really is a cgraph_edge). */ |
70d539ce JH |
656 | |
657 | static hashval_t | |
658 | edge_hash (const void *x) | |
659 | { | |
741ac903 | 660 | return htab_hash_pointer (((const struct cgraph_edge *) x)->call_stmt); |
70d539ce JH |
661 | } |
662 | ||
6bdf3519 | 663 | /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */ |
70d539ce JH |
664 | |
665 | static int | |
666 | edge_eq (const void *x, const void *y) | |
667 | { | |
741ac903 | 668 | return ((const struct cgraph_edge *) x)->call_stmt == y; |
70d539ce JH |
669 | } |
670 | ||
e33c6cd6 MJ |
671 | /* Add call graph edge E to call site hash of its caller. */ |
672 | ||
673 | static inline void | |
674 | cgraph_add_edge_to_call_site_hash (struct cgraph_edge *e) | |
675 | { | |
676 | void **slot; | |
677 | slot = htab_find_slot_with_hash (e->caller->call_site_hash, | |
678 | e->call_stmt, | |
679 | htab_hash_pointer (e->call_stmt), | |
680 | INSERT); | |
681 | gcc_assert (!*slot); | |
682 | *slot = e; | |
683 | } | |
726a989a RB |
684 | |
685 | /* Return the callgraph edge representing the GIMPLE_CALL statement | |
686 | CALL_STMT. */ | |
687 | ||
18c6ada9 | 688 | struct cgraph_edge * |
726a989a | 689 | cgraph_edge (struct cgraph_node *node, gimple call_stmt) |
18c6ada9 | 690 | { |
70d539ce JH |
691 | struct cgraph_edge *e, *e2; |
692 | int n = 0; | |
693 | ||
694 | if (node->call_site_hash) | |
f883e0a7 KG |
695 | return (struct cgraph_edge *) |
696 | htab_find_with_hash (node->call_site_hash, call_stmt, | |
52c76998 | 697 | htab_hash_pointer (call_stmt)); |
18c6ada9 JH |
698 | |
699 | /* This loop may turn out to be performance problem. In such case adding | |
700 | hashtables into call nodes with very many edges is probably best | |
2b8a92de | 701 | solution. It is not good idea to add pointer into CALL_EXPR itself |
18c6ada9 JH |
702 | because we want to make possible having multiple cgraph nodes representing |
703 | different clones of the same body before the body is actually cloned. */ | |
e33c6cd6 | 704 | for (e = node->callees; e; e = e->next_callee) |
70d539ce JH |
705 | { |
706 | if (e->call_stmt == call_stmt) | |
707 | break; | |
708 | n++; | |
709 | } | |
726a989a | 710 | |
e33c6cd6 MJ |
711 | if (!e) |
712 | for (e = node->indirect_calls; e; e = e->next_callee) | |
713 | { | |
714 | if (e->call_stmt == call_stmt) | |
715 | break; | |
716 | n++; | |
717 | } | |
718 | ||
70d539ce JH |
719 | if (n > 100) |
720 | { | |
721 | node->call_site_hash = htab_create_ggc (120, edge_hash, edge_eq, NULL); | |
722 | for (e2 = node->callees; e2; e2 = e2->next_callee) | |
e33c6cd6 MJ |
723 | cgraph_add_edge_to_call_site_hash (e2); |
724 | for (e2 = node->indirect_calls; e2; e2 = e2->next_callee) | |
725 | cgraph_add_edge_to_call_site_hash (e2); | |
70d539ce | 726 | } |
726a989a | 727 | |
18c6ada9 JH |
728 | return e; |
729 | } | |
730 | ||
726a989a | 731 | |
9187e02d | 732 | /* Change field call_stmt of edge E to NEW_STMT. */ |
0550e7b7 | 733 | |
70d539ce | 734 | void |
726a989a | 735 | cgraph_set_call_stmt (struct cgraph_edge *e, gimple new_stmt) |
70d539ce | 736 | { |
e33c6cd6 MJ |
737 | tree decl; |
738 | ||
70d539ce JH |
739 | if (e->caller->call_site_hash) |
740 | { | |
741 | htab_remove_elt_with_hash (e->caller->call_site_hash, | |
742 | e->call_stmt, | |
743 | htab_hash_pointer (e->call_stmt)); | |
744 | } | |
e33c6cd6 | 745 | |
70d539ce | 746 | e->call_stmt = new_stmt; |
e33c6cd6 MJ |
747 | if (e->indirect_unknown_callee |
748 | && (decl = gimple_call_fndecl (new_stmt))) | |
749 | { | |
750 | /* Constant propagation (and possibly also inlining?) can turn an | |
751 | indirect call into a direct one. */ | |
a358e188 | 752 | struct cgraph_node *new_callee = cgraph_get_node (decl); |
e33c6cd6 | 753 | |
a358e188 | 754 | gcc_checking_assert (new_callee); |
81fa35bd | 755 | cgraph_make_edge_direct (e, new_callee); |
e33c6cd6 MJ |
756 | } |
757 | ||
960bfb69 | 758 | push_cfun (DECL_STRUCT_FUNCTION (e->caller->symbol.decl)); |
2505c5ed | 759 | e->can_throw_external = stmt_can_throw_external (new_stmt); |
b6fa5b01 | 760 | pop_cfun (); |
70d539ce | 761 | if (e->caller->call_site_hash) |
e33c6cd6 | 762 | cgraph_add_edge_to_call_site_hash (e); |
70d539ce JH |
763 | } |
764 | ||
e33c6cd6 MJ |
765 | /* Allocate a cgraph_edge structure and fill it with data according to the |
766 | parameters of which only CALLEE can be NULL (when creating an indirect call | |
767 | edge). */ | |
e72fcfe8 | 768 | |
e33c6cd6 MJ |
769 | static struct cgraph_edge * |
770 | cgraph_create_edge_1 (struct cgraph_node *caller, struct cgraph_node *callee, | |
898b8927 | 771 | gimple call_stmt, gcov_type count, int freq) |
e72fcfe8 | 772 | { |
934cb78a | 773 | struct cgraph_edge *edge; |
18c6ada9 | 774 | |
d7f09764 DN |
775 | /* LTO does not actually have access to the call_stmt since these |
776 | have not been loaded yet. */ | |
777 | if (call_stmt) | |
778 | { | |
61502ca8 | 779 | /* This is a rather expensive check possibly triggering |
77a74ed7 NF |
780 | construction of call stmt hashtable. */ |
781 | gcc_checking_assert (!cgraph_edge (caller, call_stmt)); | |
18c6ada9 | 782 | |
d7f09764 DN |
783 | gcc_assert (is_gimple_call (call_stmt)); |
784 | } | |
b58b1157 | 785 | |
934cb78a MJ |
786 | if (free_edges) |
787 | { | |
788 | edge = free_edges; | |
789 | free_edges = NEXT_FREE_EDGE (edge); | |
790 | } | |
791 | else | |
792 | { | |
a9429e29 | 793 | edge = ggc_alloc_cgraph_edge (); |
934cb78a MJ |
794 | edge->uid = cgraph_edge_max_uid++; |
795 | } | |
796 | ||
18c6ada9 | 797 | edge->aux = NULL; |
e72fcfe8 JH |
798 | edge->caller = caller; |
799 | edge->callee = callee; | |
e33c6cd6 MJ |
800 | edge->prev_caller = NULL; |
801 | edge->next_caller = NULL; | |
802 | edge->prev_callee = NULL; | |
803 | edge->next_callee = NULL; | |
804 | ||
805 | edge->count = count; | |
806 | gcc_assert (count >= 0); | |
807 | edge->frequency = freq; | |
808 | gcc_assert (freq >= 0); | |
809 | gcc_assert (freq <= CGRAPH_FREQ_MAX); | |
e33c6cd6 | 810 | |
e0704a46 | 811 | edge->call_stmt = call_stmt; |
960bfb69 | 812 | push_cfun (DECL_STRUCT_FUNCTION (caller->symbol.decl)); |
9f3f7d13 RG |
813 | edge->can_throw_external |
814 | = call_stmt ? stmt_can_throw_external (call_stmt) : false; | |
b6fa5b01 | 815 | pop_cfun (); |
89faf322 | 816 | if (call_stmt |
960bfb69 JH |
817 | && callee && callee->symbol.decl |
818 | && !gimple_check_call_matching_types (call_stmt, callee->symbol.decl)) | |
89faf322 RG |
819 | edge->call_stmt_cannot_inline_p = true; |
820 | else | |
821 | edge->call_stmt_cannot_inline_p = false; | |
e33c6cd6 MJ |
822 | if (call_stmt && caller->call_site_hash) |
823 | cgraph_add_edge_to_call_site_hash (edge); | |
824 | ||
825 | edge->indirect_info = NULL; | |
826 | edge->indirect_inlining_edge = 0; | |
827 | ||
828 | return edge; | |
829 | } | |
830 | ||
831 | /* Create edge from CALLER to CALLEE in the cgraph. */ | |
832 | ||
833 | struct cgraph_edge * | |
834 | cgraph_create_edge (struct cgraph_node *caller, struct cgraph_node *callee, | |
898b8927 | 835 | gimple call_stmt, gcov_type count, int freq) |
e33c6cd6 MJ |
836 | { |
837 | struct cgraph_edge *edge = cgraph_create_edge_1 (caller, callee, call_stmt, | |
898b8927 | 838 | count, freq); |
e33c6cd6 MJ |
839 | |
840 | edge->indirect_unknown_callee = 0; | |
841 | initialize_inline_failed (edge); | |
842 | ||
e72fcfe8 | 843 | edge->next_caller = callee->callers; |
2563c224 RG |
844 | if (callee->callers) |
845 | callee->callers->prev_caller = edge; | |
e72fcfe8 | 846 | edge->next_callee = caller->callees; |
2563c224 RG |
847 | if (caller->callees) |
848 | caller->callees->prev_callee = edge; | |
e72fcfe8 JH |
849 | caller->callees = edge; |
850 | callee->callers = edge; | |
3dc9eaa6 | 851 | |
e33c6cd6 MJ |
852 | return edge; |
853 | } | |
854 | ||
ce47fda3 MJ |
855 | /* Allocate cgraph_indirect_call_info and set its fields to default values. */ |
856 | ||
857 | struct cgraph_indirect_call_info * | |
858 | cgraph_allocate_init_indirect_info (void) | |
859 | { | |
860 | struct cgraph_indirect_call_info *ii; | |
861 | ||
862 | ii = ggc_alloc_cleared_cgraph_indirect_call_info (); | |
863 | ii->param_index = -1; | |
864 | return ii; | |
865 | } | |
e33c6cd6 MJ |
866 | |
867 | /* Create an indirect edge with a yet-undetermined callee where the call | |
868 | statement destination is a formal parameter of the caller with index | |
869 | PARAM_INDEX. */ | |
870 | ||
871 | struct cgraph_edge * | |
872 | cgraph_create_indirect_edge (struct cgraph_node *caller, gimple call_stmt, | |
5f902d76 | 873 | int ecf_flags, |
898b8927 | 874 | gcov_type count, int freq) |
e33c6cd6 MJ |
875 | { |
876 | struct cgraph_edge *edge = cgraph_create_edge_1 (caller, NULL, call_stmt, | |
898b8927 | 877 | count, freq); |
e33c6cd6 MJ |
878 | |
879 | edge->indirect_unknown_callee = 1; | |
3dc9eaa6 AN |
880 | initialize_inline_failed (edge); |
881 | ||
ce47fda3 | 882 | edge->indirect_info = cgraph_allocate_init_indirect_info (); |
5f902d76 | 883 | edge->indirect_info->ecf_flags = ecf_flags; |
e33c6cd6 MJ |
884 | |
885 | edge->next_callee = caller->indirect_calls; | |
886 | if (caller->indirect_calls) | |
887 | caller->indirect_calls->prev_callee = edge; | |
888 | caller->indirect_calls = edge; | |
889 | ||
e72fcfe8 JH |
890 | return edge; |
891 | } | |
892 | ||
2563c224 RG |
893 | /* Remove the edge E from the list of the callers of the callee. */ |
894 | ||
895 | static inline void | |
896 | cgraph_edge_remove_callee (struct cgraph_edge *e) | |
897 | { | |
e33c6cd6 | 898 | gcc_assert (!e->indirect_unknown_callee); |
2563c224 RG |
899 | if (e->prev_caller) |
900 | e->prev_caller->next_caller = e->next_caller; | |
901 | if (e->next_caller) | |
902 | e->next_caller->prev_caller = e->prev_caller; | |
903 | if (!e->prev_caller) | |
904 | e->callee->callers = e->next_caller; | |
905 | } | |
906 | ||
907 | /* Remove the edge E from the list of the callees of the caller. */ | |
908 | ||
909 | static inline void | |
910 | cgraph_edge_remove_caller (struct cgraph_edge *e) | |
911 | { | |
912 | if (e->prev_callee) | |
913 | e->prev_callee->next_callee = e->next_callee; | |
914 | if (e->next_callee) | |
915 | e->next_callee->prev_callee = e->prev_callee; | |
916 | if (!e->prev_callee) | |
e33c6cd6 MJ |
917 | { |
918 | if (e->indirect_unknown_callee) | |
919 | e->caller->indirect_calls = e->next_callee; | |
920 | else | |
921 | e->caller->callees = e->next_callee; | |
922 | } | |
70d539ce JH |
923 | if (e->caller->call_site_hash) |
924 | htab_remove_elt_with_hash (e->caller->call_site_hash, | |
925 | e->call_stmt, | |
926 | htab_hash_pointer (e->call_stmt)); | |
2563c224 RG |
927 | } |
928 | ||
934cb78a MJ |
929 | /* Put the edge onto the free list. */ |
930 | ||
931 | static void | |
932 | cgraph_free_edge (struct cgraph_edge *e) | |
933 | { | |
934 | int uid = e->uid; | |
935 | ||
936 | /* Clear out the edge so we do not dangle pointers. */ | |
5c0466b5 | 937 | memset (e, 0, sizeof (*e)); |
934cb78a MJ |
938 | e->uid = uid; |
939 | NEXT_FREE_EDGE (e) = free_edges; | |
940 | free_edges = e; | |
941 | } | |
942 | ||
2563c224 | 943 | /* Remove the edge E in the cgraph. */ |
e72fcfe8 | 944 | |
cb967da5 | 945 | void |
18c6ada9 | 946 | cgraph_remove_edge (struct cgraph_edge *e) |
e72fcfe8 | 947 | { |
934cb78a | 948 | /* Call all edge removal hooks. */ |
9088c1cc | 949 | cgraph_call_edge_removal_hooks (e); |
934cb78a | 950 | |
e33c6cd6 MJ |
951 | if (!e->indirect_unknown_callee) |
952 | /* Remove from callers list of the callee. */ | |
953 | cgraph_edge_remove_callee (e); | |
2563c224 RG |
954 | |
955 | /* Remove from callees list of the callers. */ | |
956 | cgraph_edge_remove_caller (e); | |
934cb78a MJ |
957 | |
958 | /* Put the edge onto the free list. */ | |
959 | cgraph_free_edge (e); | |
e72fcfe8 JH |
960 | } |
961 | ||
e33c6cd6 MJ |
962 | /* Set callee of call graph edge E and add it to the corresponding set of |
963 | callers. */ | |
964 | ||
965 | static void | |
966 | cgraph_set_edge_callee (struct cgraph_edge *e, struct cgraph_node *n) | |
967 | { | |
968 | e->prev_caller = NULL; | |
969 | if (n->callers) | |
970 | n->callers->prev_caller = e; | |
971 | e->next_caller = n->callers; | |
972 | n->callers = e; | |
973 | e->callee = n; | |
974 | } | |
975 | ||
18c6ada9 JH |
976 | /* Redirect callee of E to N. The function does not update underlying |
977 | call expression. */ | |
978 | ||
979 | void | |
980 | cgraph_redirect_edge_callee (struct cgraph_edge *e, struct cgraph_node *n) | |
981 | { | |
2563c224 RG |
982 | /* Remove from callers list of the current callee. */ |
983 | cgraph_edge_remove_callee (e); | |
18c6ada9 | 984 | |
2563c224 | 985 | /* Insert to callers list of the new callee. */ |
e33c6cd6 MJ |
986 | cgraph_set_edge_callee (e, n); |
987 | } | |
988 | ||
989 | /* Make an indirect EDGE with an unknown callee an ordinary edge leading to | |
ce47fda3 MJ |
990 | CALLEE. DELTA is an integer constant that is to be added to the this |
991 | pointer (first parameter) to compensate for skipping a thunk adjustment. */ | |
e33c6cd6 MJ |
992 | |
993 | void | |
81fa35bd | 994 | cgraph_make_edge_direct (struct cgraph_edge *edge, struct cgraph_node *callee) |
e33c6cd6 MJ |
995 | { |
996 | edge->indirect_unknown_callee = 0; | |
997 | ||
998 | /* Get the edge out of the indirect edge list. */ | |
999 | if (edge->prev_callee) | |
1000 | edge->prev_callee->next_callee = edge->next_callee; | |
1001 | if (edge->next_callee) | |
1002 | edge->next_callee->prev_callee = edge->prev_callee; | |
1003 | if (!edge->prev_callee) | |
1004 | edge->caller->indirect_calls = edge->next_callee; | |
1005 | ||
1006 | /* Put it into the normal callee list */ | |
1007 | edge->prev_callee = NULL; | |
1008 | edge->next_callee = edge->caller->callees; | |
1009 | if (edge->caller->callees) | |
1010 | edge->caller->callees->prev_callee = edge; | |
1011 | edge->caller->callees = edge; | |
1012 | ||
1013 | /* Insert to callers list of the new callee. */ | |
1014 | cgraph_set_edge_callee (edge, callee); | |
1015 | ||
89faf322 RG |
1016 | if (edge->call_stmt) |
1017 | edge->call_stmt_cannot_inline_p | |
960bfb69 | 1018 | = !gimple_check_call_matching_types (edge->call_stmt, callee->symbol.decl); |
f2906a8e | 1019 | |
e33c6cd6 MJ |
1020 | /* We need to re-determine the inlining status of the edge. */ |
1021 | initialize_inline_failed (edge); | |
2563c224 RG |
1022 | } |
1023 | ||
66a20fc2 JH |
1024 | /* If necessary, change the function declaration in the call statement |
1025 | associated with E so that it corresponds to the edge callee. */ | |
1026 | ||
1027 | gimple | |
1028 | cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge *e) | |
1029 | { | |
1030 | tree decl = gimple_call_fndecl (e->call_stmt); | |
1031 | gimple new_stmt; | |
1032 | gimple_stmt_iterator gsi; | |
1033 | #ifdef ENABLE_CHECKING | |
1034 | struct cgraph_node *node; | |
1035 | #endif | |
1036 | ||
1037 | if (e->indirect_unknown_callee | |
1038 | || decl == e->callee->symbol.decl) | |
1039 | return e->call_stmt; | |
1040 | ||
1041 | #ifdef ENABLE_CHECKING | |
1042 | if (decl) | |
1043 | { | |
1044 | node = cgraph_get_node (decl); | |
1045 | gcc_assert (!node || !node->clone.combined_args_to_skip); | |
1046 | } | |
1047 | #endif | |
1048 | ||
1049 | if (cgraph_dump_file) | |
1050 | { | |
1051 | fprintf (cgraph_dump_file, "updating call of %s/%i -> %s/%i: ", | |
9de04252 MJ |
1052 | xstrdup (cgraph_node_name (e->caller)), e->caller->symbol.order, |
1053 | xstrdup (cgraph_node_name (e->callee)), e->callee->symbol.order); | |
66a20fc2 JH |
1054 | print_gimple_stmt (cgraph_dump_file, e->call_stmt, 0, dump_flags); |
1055 | if (e->callee->clone.combined_args_to_skip) | |
1056 | { | |
1057 | fprintf (cgraph_dump_file, " combined args to skip: "); | |
1058 | dump_bitmap (cgraph_dump_file, | |
1059 | e->callee->clone.combined_args_to_skip); | |
1060 | } | |
1061 | } | |
1062 | ||
1063 | if (e->callee->clone.combined_args_to_skip) | |
1064 | { | |
1065 | int lp_nr; | |
1066 | ||
1067 | new_stmt | |
1068 | = gimple_call_copy_skip_args (e->call_stmt, | |
1069 | e->callee->clone.combined_args_to_skip); | |
1070 | gimple_call_set_fndecl (new_stmt, e->callee->symbol.decl); | |
c52da5f7 | 1071 | gimple_call_set_fntype (new_stmt, gimple_call_fntype (e->call_stmt)); |
66a20fc2 JH |
1072 | |
1073 | if (gimple_vdef (new_stmt) | |
1074 | && TREE_CODE (gimple_vdef (new_stmt)) == SSA_NAME) | |
1075 | SSA_NAME_DEF_STMT (gimple_vdef (new_stmt)) = new_stmt; | |
1076 | ||
1077 | gsi = gsi_for_stmt (e->call_stmt); | |
1078 | gsi_replace (&gsi, new_stmt, false); | |
1079 | /* We need to defer cleaning EH info on the new statement to | |
1080 | fixup-cfg. We may not have dominator information at this point | |
1081 | and thus would end up with unreachable blocks and have no way | |
1082 | to communicate that we need to run CFG cleanup then. */ | |
1083 | lp_nr = lookup_stmt_eh_lp (e->call_stmt); | |
1084 | if (lp_nr != 0) | |
1085 | { | |
1086 | remove_stmt_from_eh_lp (e->call_stmt); | |
1087 | add_stmt_to_eh_lp (new_stmt, lp_nr); | |
1088 | } | |
1089 | } | |
1090 | else | |
1091 | { | |
1092 | new_stmt = e->call_stmt; | |
1093 | gimple_call_set_fndecl (new_stmt, e->callee->symbol.decl); | |
1094 | update_stmt (new_stmt); | |
1095 | } | |
1096 | ||
1097 | cgraph_set_call_stmt_including_clones (e->caller, e->call_stmt, new_stmt); | |
1098 | ||
1099 | if (cgraph_dump_file) | |
1100 | { | |
1101 | fprintf (cgraph_dump_file, " updated to:"); | |
1102 | print_gimple_stmt (cgraph_dump_file, e->call_stmt, 0, dump_flags); | |
1103 | } | |
1104 | return new_stmt; | |
1105 | } | |
726a989a RB |
1106 | |
1107 | /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL | |
4b685e14 | 1108 | OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl |
a9d24544 JJ |
1109 | of OLD_STMT if it was previously call statement. |
1110 | If NEW_STMT is NULL, the call has been dropped without any | |
1111 | replacement. */ | |
2bafad93 | 1112 | |
9187e02d JH |
1113 | static void |
1114 | cgraph_update_edges_for_call_stmt_node (struct cgraph_node *node, | |
a9d24544 JJ |
1115 | gimple old_stmt, tree old_call, |
1116 | gimple new_stmt) | |
2bafad93 | 1117 | { |
a9d24544 JJ |
1118 | tree new_call = (new_stmt && is_gimple_call (new_stmt)) |
1119 | ? gimple_call_fndecl (new_stmt) : 0; | |
2bafad93 | 1120 | |
4b685e14 JH |
1121 | /* We are seeing indirect calls, then there is nothing to update. */ |
1122 | if (!new_call && !old_call) | |
1123 | return; | |
1124 | /* See if we turned indirect call into direct call or folded call to one builtin | |
61502ca8 | 1125 | into different builtin. */ |
2bafad93 JJ |
1126 | if (old_call != new_call) |
1127 | { | |
1128 | struct cgraph_edge *e = cgraph_edge (node, old_stmt); | |
1129 | struct cgraph_edge *ne = NULL; | |
4b685e14 JH |
1130 | gcov_type count; |
1131 | int frequency; | |
2bafad93 JJ |
1132 | |
1133 | if (e) | |
1134 | { | |
e33c6cd6 MJ |
1135 | /* See if the edge is already there and has the correct callee. It |
1136 | might be so because of indirect inlining has already updated | |
97ba0040 JH |
1137 | it. We also might've cloned and redirected the edge. */ |
1138 | if (new_call && e->callee) | |
1139 | { | |
1140 | struct cgraph_node *callee = e->callee; | |
1141 | while (callee) | |
1142 | { | |
960bfb69 | 1143 | if (callee->symbol.decl == new_call |
97ba0040 JH |
1144 | || callee->former_clone_of == new_call) |
1145 | return; | |
1146 | callee = callee->clone_of; | |
1147 | } | |
1148 | } | |
4b685e14 JH |
1149 | |
1150 | /* Otherwise remove edge and create new one; we can't simply redirect | |
1151 | since function has changed, so inline plan and other information | |
1152 | attached to edge is invalid. */ | |
4b685e14 JH |
1153 | count = e->count; |
1154 | frequency = e->frequency; | |
f8754107 | 1155 | cgraph_remove_edge (e); |
4b685e14 | 1156 | } |
a9d24544 | 1157 | else if (new_call) |
4b685e14 JH |
1158 | { |
1159 | /* We are seeing new direct call; compute profile info based on BB. */ | |
1160 | basic_block bb = gimple_bb (new_stmt); | |
1161 | count = bb->count; | |
1162 | frequency = compute_call_stmt_bb_frequency (current_function_decl, | |
1163 | bb); | |
2bafad93 | 1164 | } |
2bafad93 | 1165 | |
4b685e14 JH |
1166 | if (new_call) |
1167 | { | |
a358e188 | 1168 | ne = cgraph_create_edge (node, cgraph_get_create_node (new_call), |
898b8927 | 1169 | new_stmt, count, frequency); |
4b685e14 JH |
1170 | gcc_assert (ne->inline_failed); |
1171 | } | |
2bafad93 | 1172 | } |
4b685e14 JH |
1173 | /* We only updated the call stmt; update pointer in cgraph edge.. */ |
1174 | else if (old_stmt != new_stmt) | |
1175 | cgraph_set_call_stmt (cgraph_edge (node, old_stmt), new_stmt); | |
2bafad93 JJ |
1176 | } |
1177 | ||
9187e02d | 1178 | /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL |
4b685e14 JH |
1179 | OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl |
1180 | of OLD_STMT before it was updated (updating can happen inplace). */ | |
9187e02d JH |
1181 | |
1182 | void | |
4b685e14 | 1183 | cgraph_update_edges_for_call_stmt (gimple old_stmt, tree old_decl, gimple new_stmt) |
9187e02d | 1184 | { |
a358e188 | 1185 | struct cgraph_node *orig = cgraph_get_node (cfun->decl); |
9187e02d JH |
1186 | struct cgraph_node *node; |
1187 | ||
a358e188 | 1188 | gcc_checking_assert (orig); |
4b685e14 | 1189 | cgraph_update_edges_for_call_stmt_node (orig, old_stmt, old_decl, new_stmt); |
9187e02d JH |
1190 | if (orig->clones) |
1191 | for (node = orig->clones; node != orig;) | |
1192 | { | |
4b685e14 | 1193 | cgraph_update_edges_for_call_stmt_node (node, old_stmt, old_decl, new_stmt); |
9187e02d JH |
1194 | if (node->clones) |
1195 | node = node->clones; | |
1196 | else if (node->next_sibling_clone) | |
1197 | node = node->next_sibling_clone; | |
1198 | else | |
1199 | { | |
1200 | while (node != orig && !node->next_sibling_clone) | |
1201 | node = node->clone_of; | |
1202 | if (node != orig) | |
1203 | node = node->next_sibling_clone; | |
1204 | } | |
1205 | } | |
1206 | } | |
1207 | ||
726a989a | 1208 | |
2563c224 RG |
1209 | /* Remove all callees from the node. */ |
1210 | ||
1211 | void | |
1212 | cgraph_node_remove_callees (struct cgraph_node *node) | |
1213 | { | |
5c0466b5 | 1214 | struct cgraph_edge *e, *f; |
2563c224 RG |
1215 | |
1216 | /* It is sufficient to remove the edges from the lists of callers of | |
1217 | the callees. The callee list of the node can be zapped with one | |
1218 | assignment. */ | |
5c0466b5 | 1219 | for (e = node->callees; e; e = f) |
9088c1cc | 1220 | { |
5c0466b5 | 1221 | f = e->next_callee; |
9088c1cc | 1222 | cgraph_call_edge_removal_hooks (e); |
e33c6cd6 MJ |
1223 | if (!e->indirect_unknown_callee) |
1224 | cgraph_edge_remove_callee (e); | |
934cb78a | 1225 | cgraph_free_edge (e); |
9088c1cc | 1226 | } |
5f902d76 JH |
1227 | for (e = node->indirect_calls; e; e = f) |
1228 | { | |
1229 | f = e->next_callee; | |
1230 | cgraph_call_edge_removal_hooks (e); | |
1231 | if (!e->indirect_unknown_callee) | |
1232 | cgraph_edge_remove_callee (e); | |
1233 | cgraph_free_edge (e); | |
1234 | } | |
1235 | node->indirect_calls = NULL; | |
2563c224 | 1236 | node->callees = NULL; |
70d539ce JH |
1237 | if (node->call_site_hash) |
1238 | { | |
1239 | htab_delete (node->call_site_hash); | |
1240 | node->call_site_hash = NULL; | |
1241 | } | |
2563c224 RG |
1242 | } |
1243 | ||
1244 | /* Remove all callers from the node. */ | |
1245 | ||
1246 | static void | |
1247 | cgraph_node_remove_callers (struct cgraph_node *node) | |
1248 | { | |
5c0466b5 | 1249 | struct cgraph_edge *e, *f; |
2563c224 RG |
1250 | |
1251 | /* It is sufficient to remove the edges from the lists of callees of | |
1252 | the callers. The caller list of the node can be zapped with one | |
1253 | assignment. */ | |
5c0466b5 | 1254 | for (e = node->callers; e; e = f) |
9088c1cc | 1255 | { |
5c0466b5 | 1256 | f = e->next_caller; |
9088c1cc MJ |
1257 | cgraph_call_edge_removal_hooks (e); |
1258 | cgraph_edge_remove_caller (e); | |
934cb78a | 1259 | cgraph_free_edge (e); |
9088c1cc | 1260 | } |
2563c224 | 1261 | node->callers = NULL; |
18c6ada9 JH |
1262 | } |
1263 | ||
7bca81dc SB |
1264 | /* Release memory used to represent body of function NODE. |
1265 | Use this only for functions that are released before being translated to | |
1266 | target code (i.e. RTL). Functions that are compiled to RTL and beyond | |
1267 | are free'd in final.c via free_after_compilation(). */ | |
3a40c18a JH |
1268 | |
1269 | void | |
1270 | cgraph_release_function_body (struct cgraph_node *node) | |
1271 | { | |
960bfb69 | 1272 | if (DECL_STRUCT_FUNCTION (node->symbol.decl)) |
3a40c18a | 1273 | { |
960bfb69 | 1274 | push_cfun (DECL_STRUCT_FUNCTION (node->symbol.decl)); |
7d776ee2 RG |
1275 | if (cfun->cfg |
1276 | && current_loops) | |
1277 | { | |
1278 | cfun->curr_properties &= ~PROP_loops; | |
1279 | loop_optimizer_finalize (); | |
1280 | } | |
936fc9ba JH |
1281 | if (cfun->gimple_df) |
1282 | { | |
936fc9ba JH |
1283 | delete_tree_ssa (); |
1284 | delete_tree_cfg_annotations (); | |
1285 | cfun->eh = NULL; | |
936fc9ba JH |
1286 | } |
1287 | if (cfun->cfg) | |
1288 | { | |
1289 | gcc_assert (dom_computed[0] == DOM_NONE); | |
1290 | gcc_assert (dom_computed[1] == DOM_NONE); | |
1291 | clear_edges (); | |
7bca81dc | 1292 | cfun->cfg = NULL; |
936fc9ba | 1293 | } |
a63f2942 JH |
1294 | if (cfun->value_histograms) |
1295 | free_histograms (); | |
3a40c18a | 1296 | pop_cfun(); |
960bfb69 | 1297 | gimple_set_body (node->symbol.decl, NULL); |
9771b263 | 1298 | node->ipa_transforms_to_apply.release (); |
936fc9ba JH |
1299 | /* Struct function hangs a lot of data that would leak if we didn't |
1300 | removed all pointers to it. */ | |
960bfb69 JH |
1301 | ggc_free (DECL_STRUCT_FUNCTION (node->symbol.decl)); |
1302 | DECL_STRUCT_FUNCTION (node->symbol.decl) = NULL; | |
3a40c18a | 1303 | } |
960bfb69 | 1304 | DECL_SAVED_TREE (node->symbol.decl) = NULL; |
6b20f353 DS |
1305 | /* If the node is abstract and needed, then do not clear DECL_INITIAL |
1306 | of its associated function function declaration because it's | |
1307 | needed to emit debug info later. */ | |
04142cc3 | 1308 | if (!node->abstract_and_needed && DECL_INITIAL (node->symbol.decl)) |
960bfb69 | 1309 | DECL_INITIAL (node->symbol.decl) = error_mark_node; |
3a40c18a JH |
1310 | } |
1311 | ||
18d13f34 JH |
1312 | /* Remove the node from cgraph. */ |
1313 | ||
1314 | void | |
439f7bc3 | 1315 | cgraph_remove_node (struct cgraph_node *node) |
18d13f34 | 1316 | { |
ca30a539 | 1317 | struct cgraph_node *n; |
2fb16412 | 1318 | int uid = node->uid; |
18c6ada9 | 1319 | |
9088c1cc | 1320 | cgraph_call_node_removal_hooks (node); |
2563c224 RG |
1321 | cgraph_node_remove_callers (node); |
1322 | cgraph_node_remove_callees (node); | |
9771b263 | 1323 | node->ipa_transforms_to_apply.release (); |
266ad5c8 | 1324 | |
96fc428c JH |
1325 | /* Incremental inlining access removed nodes stored in the postorder list. |
1326 | */ | |
93a18a70 | 1327 | node->symbol.force_output = false; |
ca30a539 JH |
1328 | for (n = node->nested; n; n = n->next_nested) |
1329 | n->origin = NULL; | |
1330 | node->nested = NULL; | |
18d13f34 JH |
1331 | if (node->origin) |
1332 | { | |
1333 | struct cgraph_node **node2 = &node->origin->nested; | |
1334 | ||
1335 | while (*node2 != node) | |
1336 | node2 = &(*node2)->next_nested; | |
1337 | *node2 = node->next_nested; | |
1338 | } | |
2aae7680 | 1339 | symtab_unregister_node ((symtab_node)node); |
9187e02d JH |
1340 | if (node->prev_sibling_clone) |
1341 | node->prev_sibling_clone->next_sibling_clone = node->next_sibling_clone; | |
1342 | else if (node->clone_of) | |
1343 | node->clone_of->clones = node->next_sibling_clone; | |
1344 | if (node->next_sibling_clone) | |
1345 | node->next_sibling_clone->prev_sibling_clone = node->prev_sibling_clone; | |
1346 | if (node->clones) | |
18c6ada9 | 1347 | { |
47cb0d7d JH |
1348 | struct cgraph_node *n, *next; |
1349 | ||
1350 | if (node->clone_of) | |
1351 | { | |
1352 | for (n = node->clones; n->next_sibling_clone; n = n->next_sibling_clone) | |
1353 | n->clone_of = node->clone_of; | |
1354 | n->clone_of = node->clone_of; | |
1355 | n->next_sibling_clone = node->clone_of->clones; | |
1356 | if (node->clone_of->clones) | |
1357 | node->clone_of->clones->prev_sibling_clone = n; | |
1358 | node->clone_of->clones = node->clones; | |
1359 | } | |
1360 | else | |
1361 | { | |
66a20fc2 | 1362 | /* We are removing node with clones. This makes clones inconsistent, |
47cb0d7d JH |
1363 | but assume they will be removed subsequently and just keep clone |
1364 | tree intact. This can happen in unreachable function removal since | |
1365 | we remove unreachable functions in random order, not by bottom-up | |
1366 | walk of clone trees. */ | |
1367 | for (n = node->clones; n; n = next) | |
1368 | { | |
1369 | next = n->next_sibling_clone; | |
1370 | n->next_sibling_clone = NULL; | |
1371 | n->prev_sibling_clone = NULL; | |
1372 | n->clone_of = NULL; | |
1373 | } | |
1374 | } | |
18c6ada9 JH |
1375 | } |
1376 | ||
c22cacf3 | 1377 | /* While all the clones are removed after being proceeded, the function |
4a76d91a JH |
1378 | itself is kept in the cgraph even after it is compiled. Check whether |
1379 | we are done with this body and reclaim it proactively if this is the case. | |
1380 | */ | |
1ab24192 JH |
1381 | n = cgraph_get_node (node->symbol.decl); |
1382 | if (!n | |
1383 | || (!n->clones && !n->clone_of && !n->global.inlined_to | |
d63db217 | 1384 | && (cgraph_global_info_ready |
960bfb69 JH |
1385 | && (TREE_ASM_WRITTEN (n->symbol.decl) |
1386 | || DECL_EXTERNAL (n->symbol.decl) | |
e70670cf | 1387 | || !n->symbol.analyzed |
1ab24192 | 1388 | || n->symbol.in_other_partition)))) |
3a40c18a | 1389 | cgraph_release_function_body (node); |
1ab24192 | 1390 | |
960bfb69 | 1391 | node->symbol.decl = NULL; |
70d539ce JH |
1392 | if (node->call_site_hash) |
1393 | { | |
1394 | htab_delete (node->call_site_hash); | |
1395 | node->call_site_hash = NULL; | |
1396 | } | |
18c6ada9 | 1397 | cgraph_n_nodes--; |
2fb16412 MJ |
1398 | |
1399 | /* Clear out the node to NULL all pointers and add the node to the free | |
1400 | list. */ | |
1401 | memset (node, 0, sizeof(*node)); | |
960bfb69 | 1402 | node->symbol.type = SYMTAB_FUNCTION; |
2fb16412 | 1403 | node->uid = uid; |
2aae7680 | 1404 | SET_NEXT_FREE_NODE (node, free_nodes); |
2fb16412 | 1405 | free_nodes = node; |
18d13f34 JH |
1406 | } |
1407 | ||
39ff5a96 JH |
1408 | /* Likewise indicate that a node is having address taken. */ |
1409 | ||
1410 | void | |
1411 | cgraph_mark_address_taken_node (struct cgraph_node *node) | |
1412 | { | |
4502fe8d MJ |
1413 | /* Indirect inlining can figure out that all uses of the address are |
1414 | inlined. */ | |
1415 | if (node->global.inlined_to) | |
1416 | { | |
1417 | gcc_assert (cfun->after_inlining); | |
1418 | gcc_assert (node->callers->indirect_inlining_edge); | |
1419 | return; | |
1420 | } | |
39e2db00 JH |
1421 | /* FIXME: address_taken flag is used both as a shortcut for testing whether |
1422 | IPA_REF_ADDR reference exists (and thus it should be set on node | |
1423 | representing alias we take address of) and as a test whether address | |
1424 | of the object was taken (and thus it should be set on node alias is | |
1425 | referring to). We should remove the first use and the remove the | |
1426 | following set. */ | |
960bfb69 | 1427 | node->symbol.address_taken = 1; |
39e2db00 | 1428 | node = cgraph_function_or_thunk_node (node, NULL); |
960bfb69 | 1429 | node->symbol.address_taken = 1; |
39ff5a96 JH |
1430 | } |
1431 | ||
dafc5b82 JH |
1432 | /* Return local info for the compiled function. */ |
1433 | ||
1434 | struct cgraph_local_info * | |
439f7bc3 | 1435 | cgraph_local_info (tree decl) |
dafc5b82 JH |
1436 | { |
1437 | struct cgraph_node *node; | |
c22cacf3 | 1438 | |
341c100f | 1439 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
9f9ebcdf MJ |
1440 | node = cgraph_get_node (decl); |
1441 | if (!node) | |
1442 | return NULL; | |
dafc5b82 JH |
1443 | return &node->local; |
1444 | } | |
1445 | ||
1446 | /* Return local info for the compiled function. */ | |
1447 | ||
1448 | struct cgraph_global_info * | |
439f7bc3 | 1449 | cgraph_global_info (tree decl) |
dafc5b82 JH |
1450 | { |
1451 | struct cgraph_node *node; | |
c22cacf3 | 1452 | |
341c100f | 1453 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL && cgraph_global_info_ready); |
9f9ebcdf MJ |
1454 | node = cgraph_get_node (decl); |
1455 | if (!node) | |
1456 | return NULL; | |
dafc5b82 JH |
1457 | return &node->global; |
1458 | } | |
1459 | ||
b255a036 JH |
1460 | /* Return local info for the compiled function. */ |
1461 | ||
1462 | struct cgraph_rtl_info * | |
439f7bc3 | 1463 | cgraph_rtl_info (tree decl) |
b255a036 JH |
1464 | { |
1465 | struct cgraph_node *node; | |
c22cacf3 | 1466 | |
341c100f | 1467 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
9f9ebcdf MJ |
1468 | node = cgraph_get_node (decl); |
1469 | if (!node | |
1470 | || (decl != current_function_decl | |
960bfb69 | 1471 | && !TREE_ASM_WRITTEN (node->symbol.decl))) |
b255a036 JH |
1472 | return NULL; |
1473 | return &node->rtl; | |
1474 | } | |
1475 | ||
61a05df1 JH |
1476 | /* Return a string describing the failure REASON. */ |
1477 | ||
1478 | const char* | |
1479 | cgraph_inline_failed_string (cgraph_inline_failed_t reason) | |
1480 | { | |
1481 | #undef DEFCIFCODE | |
1482 | #define DEFCIFCODE(code, string) string, | |
1483 | ||
1484 | static const char *cif_string_table[CIF_N_REASONS] = { | |
1485 | #include "cif-code.def" | |
1486 | }; | |
1487 | ||
1488 | /* Signedness of an enum type is implementation defined, so cast it | |
1489 | to unsigned before testing. */ | |
1490 | gcc_assert ((unsigned) reason < CIF_N_REASONS); | |
1491 | return cif_string_table[reason]; | |
1492 | } | |
1493 | ||
6b02a499 | 1494 | /* Names used to print out the availability enum. */ |
8a4a83ed | 1495 | const char * const cgraph_availability_names[] = |
fa10beec | 1496 | {"unset", "not_available", "overwritable", "available", "local"}; |
6b02a499 | 1497 | |
c4e622b6 DN |
1498 | |
1499 | /* Dump call graph node NODE to file F. */ | |
1500 | ||
18c6ada9 JH |
1501 | void |
1502 | dump_cgraph_node (FILE *f, struct cgraph_node *node) | |
1503 | { | |
1504 | struct cgraph_edge *edge; | |
e33c6cd6 MJ |
1505 | int indirect_calls_count = 0; |
1506 | ||
8f940ee6 JH |
1507 | dump_symtab_base (f, (symtab_node) node); |
1508 | ||
18c6ada9 | 1509 | if (node->global.inlined_to) |
8f940ee6 | 1510 | fprintf (f, " Function %s/%i is inline copy in %s/%i\n", |
036c0102 | 1511 | xstrdup (cgraph_node_name (node)), |
8f940ee6 | 1512 | node->symbol.order, |
036c0102 | 1513 | xstrdup (cgraph_node_name (node->global.inlined_to)), |
8f940ee6 | 1514 | node->global.inlined_to->symbol.order); |
9187e02d | 1515 | if (node->clone_of) |
8f940ee6 JH |
1516 | fprintf (f, " Clone of %s/%i\n", |
1517 | cgraph_node_asm_name (node->clone_of), | |
1518 | node->clone_of->symbol.order); | |
6b02a499 | 1519 | if (cgraph_function_flags_ready) |
8f940ee6 | 1520 | fprintf (f, " Availability: %s\n", |
8a4a83ed | 1521 | cgraph_availability_names [cgraph_function_body_availability (node)]); |
8f940ee6 JH |
1522 | |
1523 | fprintf (f, " Function flags:"); | |
e42922b1 JH |
1524 | if (node->count) |
1525 | fprintf (f, " executed "HOST_WIDEST_INT_PRINT_DEC"x", | |
1526 | (HOST_WIDEST_INT)node->count); | |
18c6ada9 | 1527 | if (node->origin) |
8f940ee6 | 1528 | fprintf (f, " nested in: %s", cgraph_node_asm_name (node->origin)); |
960bfb69 | 1529 | if (gimple_has_body_p (node->symbol.decl)) |
726a989a | 1530 | fprintf (f, " body"); |
257eb6e3 JH |
1531 | if (node->process) |
1532 | fprintf (f, " process"); | |
18c6ada9 JH |
1533 | if (node->local.local) |
1534 | fprintf (f, " local"); | |
e7d6beb0 JH |
1535 | if (node->local.redefined_extern_inline) |
1536 | fprintf (f, " redefined_extern_inline"); | |
844db5d0 JH |
1537 | if (node->only_called_at_startup) |
1538 | fprintf (f, " only_called_at_startup"); | |
1539 | if (node->only_called_at_exit) | |
1540 | fprintf (f, " only_called_at_exit"); | |
0a35513e AH |
1541 | if (node->tm_clone) |
1542 | fprintf (f, " tm_clone"); | |
18c6ada9 | 1543 | |
c47d0034 JH |
1544 | fprintf (f, "\n"); |
1545 | ||
1546 | if (node->thunk.thunk_p) | |
1547 | { | |
8f940ee6 | 1548 | fprintf (f, " Thunk of %s (asm: %s) fixed offset %i virtual value %i has " |
c47d0034 JH |
1549 | "virtual offset %i)\n", |
1550 | lang_hooks.decl_printable_name (node->thunk.alias, 2), | |
1551 | IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node->thunk.alias)), | |
1552 | (int)node->thunk.fixed_offset, | |
1553 | (int)node->thunk.virtual_value, | |
1554 | (int)node->thunk.virtual_offset_p); | |
1555 | } | |
e70670cf JH |
1556 | if (node->symbol.alias && node->thunk.alias |
1557 | && DECL_P (node->thunk.alias)) | |
39e2db00 | 1558 | { |
8f940ee6 | 1559 | fprintf (f, " Alias of %s", |
39e2db00 JH |
1560 | lang_hooks.decl_printable_name (node->thunk.alias, 2)); |
1561 | if (DECL_ASSEMBLER_NAME_SET_P (node->thunk.alias)) | |
1562 | fprintf (f, " (asm: %s)", | |
1563 | IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node->thunk.alias))); | |
1564 | fprintf (f, "\n"); | |
1565 | } | |
c47d0034 | 1566 | |
8f940ee6 | 1567 | fprintf (f, " Called by: "); |
c47d0034 | 1568 | |
18c6ada9 JH |
1569 | for (edge = node->callers; edge; edge = edge->next_caller) |
1570 | { | |
8f940ee6 JH |
1571 | fprintf (f, "%s/%i ", cgraph_node_asm_name (edge->caller), |
1572 | edge->caller->symbol.order); | |
e42922b1 JH |
1573 | if (edge->count) |
1574 | fprintf (f, "("HOST_WIDEST_INT_PRINT_DEC"x) ", | |
1575 | (HOST_WIDEST_INT)edge->count); | |
45a80bb9 JH |
1576 | if (edge->frequency) |
1577 | fprintf (f, "(%.2f per call) ", | |
1578 | edge->frequency / (double)CGRAPH_FREQ_BASE); | |
18c6ada9 JH |
1579 | if (!edge->inline_failed) |
1580 | fprintf(f, "(inlined) "); | |
e33c6cd6 MJ |
1581 | if (edge->indirect_inlining_edge) |
1582 | fprintf(f, "(indirect_inlining) "); | |
2505c5ed JH |
1583 | if (edge->can_throw_external) |
1584 | fprintf(f, "(can throw external) "); | |
18c6ada9 JH |
1585 | } |
1586 | ||
8f940ee6 | 1587 | fprintf (f, "\n Calls: "); |
18c6ada9 JH |
1588 | for (edge = node->callees; edge; edge = edge->next_callee) |
1589 | { | |
8f940ee6 JH |
1590 | fprintf (f, "%s/%i ", cgraph_node_asm_name (edge->callee), |
1591 | edge->callee->symbol.order); | |
18c6ada9 JH |
1592 | if (!edge->inline_failed) |
1593 | fprintf(f, "(inlined) "); | |
e33c6cd6 MJ |
1594 | if (edge->indirect_inlining_edge) |
1595 | fprintf(f, "(indirect_inlining) "); | |
6b02a499 JH |
1596 | if (edge->count) |
1597 | fprintf (f, "("HOST_WIDEST_INT_PRINT_DEC"x) ", | |
1598 | (HOST_WIDEST_INT)edge->count); | |
45a80bb9 JH |
1599 | if (edge->frequency) |
1600 | fprintf (f, "(%.2f per call) ", | |
1601 | edge->frequency / (double)CGRAPH_FREQ_BASE); | |
b6fa5b01 JH |
1602 | if (edge->can_throw_external) |
1603 | fprintf(f, "(can throw external) "); | |
18c6ada9 JH |
1604 | } |
1605 | fprintf (f, "\n"); | |
6744a6ab | 1606 | |
e33c6cd6 MJ |
1607 | for (edge = node->indirect_calls; edge; edge = edge->next_callee) |
1608 | indirect_calls_count++; | |
1609 | if (indirect_calls_count) | |
8f940ee6 | 1610 | fprintf (f, " Has %i outgoing edges for indirect calls.\n", |
e33c6cd6 | 1611 | indirect_calls_count); |
18c6ada9 JH |
1612 | } |
1613 | ||
c4e622b6 DN |
1614 | |
1615 | /* Dump call graph node NODE to stderr. */ | |
1616 | ||
24e47c76 | 1617 | DEBUG_FUNCTION void |
c4e622b6 DN |
1618 | debug_cgraph_node (struct cgraph_node *node) |
1619 | { | |
1620 | dump_cgraph_node (stderr, node); | |
1621 | } | |
1622 | ||
1623 | ||
1624 | /* Dump the callgraph to file F. */ | |
e72fcfe8 JH |
1625 | |
1626 | void | |
439f7bc3 | 1627 | dump_cgraph (FILE *f) |
e72fcfe8 JH |
1628 | { |
1629 | struct cgraph_node *node; | |
1630 | ||
7d82fe7c | 1631 | fprintf (f, "callgraph:\n\n"); |
65c70e6b | 1632 | FOR_EACH_FUNCTION (node) |
18c6ada9 | 1633 | dump_cgraph_node (f, node); |
e72fcfe8 | 1634 | } |
988d1653 | 1635 | |
c4e622b6 DN |
1636 | |
1637 | /* Dump the call graph to stderr. */ | |
1638 | ||
24e47c76 | 1639 | DEBUG_FUNCTION void |
c4e622b6 DN |
1640 | debug_cgraph (void) |
1641 | { | |
1642 | dump_cgraph (stderr); | |
1643 | } | |
1644 | ||
1bb17c21 JH |
1645 | /* Return true when the DECL can possibly be inlined. */ |
1646 | bool | |
1647 | cgraph_function_possibly_inlined_p (tree decl) | |
1648 | { | |
1bb17c21 | 1649 | if (!cgraph_global_info_ready) |
e90acd93 | 1650 | return !DECL_UNINLINABLE (decl); |
6f312d18 | 1651 | return DECL_POSSIBLY_INLINED (decl); |
18c6ada9 JH |
1652 | } |
1653 | ||
8f235343 JH |
1654 | /* NODE is no longer nested function; update cgraph accordingly. */ |
1655 | void | |
1656 | cgraph_unnest_node (struct cgraph_node *node) | |
1657 | { | |
1658 | struct cgraph_node **node2 = &node->origin->nested; | |
1659 | gcc_assert (node->origin); | |
1660 | ||
1661 | while (*node2 != node) | |
1662 | node2 = &(*node2)->next_nested; | |
1663 | *node2 = node->next_nested; | |
1664 | node->origin = NULL; | |
1665 | } | |
6b02a499 JH |
1666 | |
1667 | /* Return function availability. See cgraph.h for description of individual | |
1668 | return values. */ | |
1669 | enum availability | |
1670 | cgraph_function_body_availability (struct cgraph_node *node) | |
1671 | { | |
1672 | enum availability avail; | |
1673 | gcc_assert (cgraph_function_flags_ready); | |
e70670cf | 1674 | if (!node->symbol.analyzed) |
6b02a499 JH |
1675 | avail = AVAIL_NOT_AVAILABLE; |
1676 | else if (node->local.local) | |
1677 | avail = AVAIL_LOCAL; | |
960bfb69 | 1678 | else if (!node->symbol.externally_visible) |
6b02a499 | 1679 | avail = AVAIL_AVAILABLE; |
61502ca8 NF |
1680 | /* Inline functions are safe to be analyzed even if their symbol can |
1681 | be overwritten at runtime. It is not meaningful to enforce any sane | |
4a371c8d | 1682 | behaviour on replacing inline function by different body. */ |
960bfb69 | 1683 | else if (DECL_DECLARED_INLINE_P (node->symbol.decl)) |
4a371c8d | 1684 | avail = AVAIL_AVAILABLE; |
6b02a499 JH |
1685 | |
1686 | /* If the function can be overwritten, return OVERWRITABLE. Take | |
1687 | care at least of two notable extensions - the COMDAT functions | |
1688 | used to share template instantiations in C++ (this is symmetric | |
1689 | to code cp_cannot_inline_tree_fn and probably shall be shared and | |
ff5c4582 | 1690 | the inlinability hooks completely eliminated). |
6b02a499 JH |
1691 | |
1692 | ??? Does the C++ one definition rule allow us to always return | |
1693 | AVAIL_AVAILABLE here? That would be good reason to preserve this | |
4a371c8d JH |
1694 | bit. */ |
1695 | ||
960bfb69 JH |
1696 | else if (decl_replaceable_p (node->symbol.decl) |
1697 | && !DECL_EXTERNAL (node->symbol.decl)) | |
6b02a499 JH |
1698 | avail = AVAIL_OVERWRITABLE; |
1699 | else avail = AVAIL_AVAILABLE; | |
1700 | ||
1701 | return avail; | |
1702 | } | |
1703 | ||
be330ed4 JH |
1704 | /* Worker for cgraph_node_can_be_local_p. */ |
1705 | static bool | |
1706 | cgraph_node_cannot_be_local_p_1 (struct cgraph_node *node, | |
1707 | void *data ATTRIBUTE_UNUSED) | |
1708 | { | |
ead84f73 | 1709 | return !(!node->symbol.force_output |
960bfb69 JH |
1710 | && ((DECL_COMDAT (node->symbol.decl) |
1711 | && !node->symbol.same_comdat_group) | |
1712 | || !node->symbol.externally_visible)); | |
be330ed4 JH |
1713 | } |
1714 | ||
a550d677 MJ |
1715 | /* Return true if NODE can be made local for API change. |
1716 | Extern inline functions and C++ COMDAT functions can be made local | |
1717 | at the expense of possible code size growth if function is used in multiple | |
1718 | compilation units. */ | |
1719 | bool | |
1720 | cgraph_node_can_be_local_p (struct cgraph_node *node) | |
1721 | { | |
960bfb69 | 1722 | return (!node->symbol.address_taken |
be330ed4 JH |
1723 | && !cgraph_for_node_and_aliases (node, |
1724 | cgraph_node_cannot_be_local_p_1, | |
1725 | NULL, true)); | |
a550d677 MJ |
1726 | } |
1727 | ||
073a8998 | 1728 | /* Call calback on NODE, thunks and aliases associated to NODE. |
be330ed4 JH |
1729 | When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are |
1730 | skipped. */ | |
1731 | ||
1732 | bool | |
1733 | cgraph_for_node_thunks_and_aliases (struct cgraph_node *node, | |
1734 | bool (*callback) (struct cgraph_node *, void *), | |
1735 | void *data, | |
1736 | bool include_overwritable) | |
1737 | { | |
1738 | struct cgraph_edge *e; | |
39e2db00 JH |
1739 | int i; |
1740 | struct ipa_ref *ref; | |
be330ed4 JH |
1741 | |
1742 | if (callback (node, data)) | |
1743 | return true; | |
be330ed4 JH |
1744 | for (e = node->callers; e; e = e->next_caller) |
1745 | if (e->caller->thunk.thunk_p | |
1746 | && (include_overwritable | |
25e2c40d | 1747 | || cgraph_function_body_availability (e->caller) > AVAIL_OVERWRITABLE)) |
9aa3f5c5 JH |
1748 | if (cgraph_for_node_thunks_and_aliases (e->caller, callback, data, |
1749 | include_overwritable)) | |
1750 | return true; | |
5932a4d4 | 1751 | for (i = 0; ipa_ref_list_referring_iterate (&node->symbol.ref_list, i, ref); i++) |
39e2db00 JH |
1752 | if (ref->use == IPA_REF_ALIAS) |
1753 | { | |
5932a4d4 | 1754 | struct cgraph_node *alias = ipa_ref_referring_node (ref); |
39e2db00 JH |
1755 | if (include_overwritable |
1756 | || cgraph_function_body_availability (alias) > AVAIL_OVERWRITABLE) | |
9aa3f5c5 JH |
1757 | if (cgraph_for_node_thunks_and_aliases (alias, callback, data, |
1758 | include_overwritable)) | |
1759 | return true; | |
39e2db00 | 1760 | } |
be330ed4 JH |
1761 | return false; |
1762 | } | |
1763 | ||
073a8998 | 1764 | /* Call calback on NODE and aliases associated to NODE. |
be330ed4 JH |
1765 | When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are |
1766 | skipped. */ | |
1767 | ||
1768 | bool | |
1769 | cgraph_for_node_and_aliases (struct cgraph_node *node, | |
1770 | bool (*callback) (struct cgraph_node *, void *), | |
1771 | void *data, | |
39e2db00 | 1772 | bool include_overwritable) |
a550d677 | 1773 | { |
39e2db00 JH |
1774 | int i; |
1775 | struct ipa_ref *ref; | |
be330ed4 JH |
1776 | |
1777 | if (callback (node, data)) | |
1778 | return true; | |
5932a4d4 | 1779 | for (i = 0; ipa_ref_list_referring_iterate (&node->symbol.ref_list, i, ref); i++) |
39e2db00 JH |
1780 | if (ref->use == IPA_REF_ALIAS) |
1781 | { | |
5932a4d4 | 1782 | struct cgraph_node *alias = ipa_ref_referring_node (ref); |
39e2db00 JH |
1783 | if (include_overwritable |
1784 | || cgraph_function_body_availability (alias) > AVAIL_OVERWRITABLE) | |
9aa3f5c5 JH |
1785 | if (cgraph_for_node_and_aliases (alias, callback, data, |
1786 | include_overwritable)) | |
1787 | return true; | |
39e2db00 | 1788 | } |
be330ed4 JH |
1789 | return false; |
1790 | } | |
1791 | ||
1792 | /* Worker to bring NODE local. */ | |
1793 | ||
1794 | static bool | |
1795 | cgraph_make_node_local_1 (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) | |
1796 | { | |
1797 | gcc_checking_assert (cgraph_node_can_be_local_p (node)); | |
960bfb69 | 1798 | if (DECL_COMDAT (node->symbol.decl) || DECL_EXTERNAL (node->symbol.decl)) |
a550d677 | 1799 | { |
65d630d4 | 1800 | symtab_make_decl_local (node->symbol.decl); |
715a4e08 | 1801 | |
960bfb69 | 1802 | node->symbol.externally_visible = false; |
a550d677 | 1803 | node->local.local = true; |
702d8703 JH |
1804 | node->symbol.unique_name = (node->symbol.resolution == LDPR_PREVAILING_DEF_IRONLY |
1805 | || node->symbol.resolution == LDPR_PREVAILING_DEF_IRONLY_EXP); | |
960bfb69 | 1806 | node->symbol.resolution = LDPR_PREVAILING_DEF_IRONLY; |
a550d677 MJ |
1807 | gcc_assert (cgraph_function_body_availability (node) == AVAIL_LOCAL); |
1808 | } | |
be330ed4 | 1809 | return false; |
a550d677 MJ |
1810 | } |
1811 | ||
be330ed4 JH |
1812 | /* Bring NODE local. */ |
1813 | ||
1814 | void | |
1815 | cgraph_make_node_local (struct cgraph_node *node) | |
1816 | { | |
1817 | cgraph_for_node_thunks_and_aliases (node, cgraph_make_node_local_1, | |
1818 | NULL, true); | |
1819 | } | |
1820 | ||
1821 | /* Worker to set nothrow flag. */ | |
1822 | ||
1823 | static bool | |
1824 | cgraph_set_nothrow_flag_1 (struct cgraph_node *node, void *data) | |
1825 | { | |
71fb4f92 JH |
1826 | struct cgraph_edge *e; |
1827 | ||
960bfb69 | 1828 | TREE_NOTHROW (node->symbol.decl) = data != NULL; |
71fb4f92 JH |
1829 | |
1830 | if (data != NULL) | |
1831 | for (e = node->callers; e; e = e->next_caller) | |
1832 | e->can_throw_external = false; | |
be330ed4 JH |
1833 | return false; |
1834 | } | |
1835 | ||
1836 | /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE | |
20cdc2be JJ |
1837 | if any to NOTHROW. */ |
1838 | ||
1839 | void | |
1840 | cgraph_set_nothrow_flag (struct cgraph_node *node, bool nothrow) | |
1841 | { | |
be330ed4 JH |
1842 | cgraph_for_node_thunks_and_aliases (node, cgraph_set_nothrow_flag_1, |
1843 | (void *)(size_t)nothrow, false); | |
20cdc2be JJ |
1844 | } |
1845 | ||
be330ed4 | 1846 | /* Worker to set const flag. */ |
20cdc2be | 1847 | |
be330ed4 JH |
1848 | static bool |
1849 | cgraph_set_const_flag_1 (struct cgraph_node *node, void *data) | |
20cdc2be | 1850 | { |
530f3a1b JH |
1851 | /* Static constructors and destructors without a side effect can be |
1852 | optimized out. */ | |
be330ed4 | 1853 | if (data && !((size_t)data & 2)) |
530f3a1b | 1854 | { |
960bfb69 JH |
1855 | if (DECL_STATIC_CONSTRUCTOR (node->symbol.decl)) |
1856 | DECL_STATIC_CONSTRUCTOR (node->symbol.decl) = 0; | |
1857 | if (DECL_STATIC_DESTRUCTOR (node->symbol.decl)) | |
1858 | DECL_STATIC_DESTRUCTOR (node->symbol.decl) = 0; | |
530f3a1b | 1859 | } |
960bfb69 JH |
1860 | TREE_READONLY (node->symbol.decl) = data != NULL; |
1861 | DECL_LOOPING_CONST_OR_PURE_P (node->symbol.decl) = ((size_t)data & 2) != 0; | |
be330ed4 | 1862 | return false; |
20cdc2be JJ |
1863 | } |
1864 | ||
be330ed4 JH |
1865 | /* Set TREE_READONLY on NODE's decl and on aliases of NODE |
1866 | if any to READONLY. */ | |
20cdc2be JJ |
1867 | |
1868 | void | |
be330ed4 | 1869 | cgraph_set_const_flag (struct cgraph_node *node, bool readonly, bool looping) |
20cdc2be | 1870 | { |
be330ed4 JH |
1871 | cgraph_for_node_thunks_and_aliases (node, cgraph_set_const_flag_1, |
1872 | (void *)(size_t)(readonly + (int)looping * 2), | |
1873 | false); | |
1874 | } | |
1875 | ||
1876 | /* Worker to set pure flag. */ | |
1877 | ||
1878 | static bool | |
1879 | cgraph_set_pure_flag_1 (struct cgraph_node *node, void *data) | |
1880 | { | |
a1ffba98 | 1881 | /* Static constructors and destructors without a side effect can be |
530f3a1b | 1882 | optimized out. */ |
be330ed4 | 1883 | if (data && !((size_t)data & 2)) |
530f3a1b | 1884 | { |
960bfb69 JH |
1885 | if (DECL_STATIC_CONSTRUCTOR (node->symbol.decl)) |
1886 | DECL_STATIC_CONSTRUCTOR (node->symbol.decl) = 0; | |
1887 | if (DECL_STATIC_DESTRUCTOR (node->symbol.decl)) | |
1888 | DECL_STATIC_DESTRUCTOR (node->symbol.decl) = 0; | |
530f3a1b | 1889 | } |
960bfb69 JH |
1890 | DECL_PURE_P (node->symbol.decl) = data != NULL; |
1891 | DECL_LOOPING_CONST_OR_PURE_P (node->symbol.decl) = ((size_t)data & 2) != 0; | |
be330ed4 | 1892 | return false; |
20cdc2be JJ |
1893 | } |
1894 | ||
be330ed4 JH |
1895 | /* Set DECL_PURE_P on NODE's decl and on aliases of NODE |
1896 | if any to PURE. */ | |
1897 | ||
1898 | void | |
1899 | cgraph_set_pure_flag (struct cgraph_node *node, bool pure, bool looping) | |
fa5f5e27 | 1900 | { |
be330ed4 JH |
1901 | cgraph_for_node_thunks_and_aliases (node, cgraph_set_pure_flag_1, |
1902 | (void *)(size_t)(pure + (int)looping * 2), | |
1903 | false); | |
1904 | } | |
844db5d0 | 1905 | |
be330ed4 | 1906 | /* Data used by cgraph_propagate_frequency. */ |
844db5d0 | 1907 | |
be330ed4 JH |
1908 | struct cgraph_propagate_frequency_data |
1909 | { | |
1910 | bool maybe_unlikely_executed; | |
1911 | bool maybe_executed_once; | |
1912 | bool only_called_at_startup; | |
1913 | bool only_called_at_exit; | |
1914 | }; | |
1915 | ||
1916 | /* Worker for cgraph_propagate_frequency_1. */ | |
1917 | ||
1918 | static bool | |
1919 | cgraph_propagate_frequency_1 (struct cgraph_node *node, void *data) | |
1920 | { | |
1921 | struct cgraph_propagate_frequency_data *d; | |
1922 | struct cgraph_edge *edge; | |
1923 | ||
1924 | d = (struct cgraph_propagate_frequency_data *)data; | |
fa5f5e27 | 1925 | for (edge = node->callers; |
be330ed4 JH |
1926 | edge && (d->maybe_unlikely_executed || d->maybe_executed_once |
1927 | || d->only_called_at_startup || d->only_called_at_exit); | |
fa5f5e27 JH |
1928 | edge = edge->next_caller) |
1929 | { | |
844db5d0 JH |
1930 | if (edge->caller != node) |
1931 | { | |
be330ed4 | 1932 | d->only_called_at_startup &= edge->caller->only_called_at_startup; |
61502ca8 | 1933 | /* It makes sense to put main() together with the static constructors. |
844db5d0 | 1934 | It will be executed for sure, but rest of functions called from |
61502ca8 | 1935 | main are definitely not at startup only. */ |
960bfb69 | 1936 | if (MAIN_NAME_P (DECL_NAME (edge->caller->symbol.decl))) |
be330ed4 JH |
1937 | d->only_called_at_startup = 0; |
1938 | d->only_called_at_exit &= edge->caller->only_called_at_exit; | |
844db5d0 | 1939 | } |
fa5f5e27 JH |
1940 | if (!edge->frequency) |
1941 | continue; | |
1942 | switch (edge->caller->frequency) | |
1943 | { | |
1944 | case NODE_FREQUENCY_UNLIKELY_EXECUTED: | |
1945 | break; | |
1946 | case NODE_FREQUENCY_EXECUTED_ONCE: | |
1947 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
844db5d0 | 1948 | fprintf (dump_file, " Called by %s that is executed once\n", |
87e7b310 | 1949 | cgraph_node_name (edge->caller)); |
be330ed4 | 1950 | d->maybe_unlikely_executed = false; |
898b8927 | 1951 | if (inline_edge_summary (edge)->loop_depth) |
fa5f5e27 | 1952 | { |
be330ed4 | 1953 | d->maybe_executed_once = false; |
fa5f5e27 JH |
1954 | if (dump_file && (dump_flags & TDF_DETAILS)) |
1955 | fprintf (dump_file, " Called in loop\n"); | |
1956 | } | |
1957 | break; | |
1958 | case NODE_FREQUENCY_HOT: | |
1959 | case NODE_FREQUENCY_NORMAL: | |
1960 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
844db5d0 | 1961 | fprintf (dump_file, " Called by %s that is normal or hot\n", |
87e7b310 | 1962 | cgraph_node_name (edge->caller)); |
be330ed4 JH |
1963 | d->maybe_unlikely_executed = false; |
1964 | d->maybe_executed_once = false; | |
fa5f5e27 JH |
1965 | break; |
1966 | } | |
1967 | } | |
be330ed4 JH |
1968 | return edge != NULL; |
1969 | } | |
1970 | ||
1971 | /* See if the frequency of NODE can be updated based on frequencies of its | |
1972 | callers. */ | |
1973 | bool | |
1974 | cgraph_propagate_frequency (struct cgraph_node *node) | |
1975 | { | |
1976 | struct cgraph_propagate_frequency_data d = {true, true, true, true}; | |
1977 | bool changed = false; | |
1978 | ||
1979 | if (!node->local.local) | |
1980 | return false; | |
e70670cf | 1981 | gcc_assert (node->symbol.analyzed); |
be330ed4 JH |
1982 | if (dump_file && (dump_flags & TDF_DETAILS)) |
1983 | fprintf (dump_file, "Processing frequency %s\n", cgraph_node_name (node)); | |
1984 | ||
1985 | cgraph_for_node_and_aliases (node, cgraph_propagate_frequency_1, &d, true); | |
1986 | ||
1987 | if ((d.only_called_at_startup && !d.only_called_at_exit) | |
844db5d0 JH |
1988 | && !node->only_called_at_startup) |
1989 | { | |
1990 | node->only_called_at_startup = true; | |
fa5f5e27 | 1991 | if (dump_file) |
844db5d0 JH |
1992 | fprintf (dump_file, "Node %s promoted to only called at startup.\n", |
1993 | cgraph_node_name (node)); | |
1994 | changed = true; | |
1995 | } | |
be330ed4 | 1996 | if ((d.only_called_at_exit && !d.only_called_at_startup) |
844db5d0 JH |
1997 | && !node->only_called_at_exit) |
1998 | { | |
1999 | node->only_called_at_exit = true; | |
fa5f5e27 | 2000 | if (dump_file) |
844db5d0 JH |
2001 | fprintf (dump_file, "Node %s promoted to only called at exit.\n", |
2002 | cgraph_node_name (node)); | |
2003 | changed = true; | |
2004 | } | |
2005 | /* These come either from profile or user hints; never update them. */ | |
2006 | if (node->frequency == NODE_FREQUENCY_HOT | |
2007 | || node->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED) | |
2008 | return changed; | |
be330ed4 | 2009 | if (d.maybe_unlikely_executed) |
844db5d0 JH |
2010 | { |
2011 | node->frequency = NODE_FREQUENCY_UNLIKELY_EXECUTED; | |
2012 | if (dump_file) | |
2013 | fprintf (dump_file, "Node %s promoted to unlikely executed.\n", | |
2014 | cgraph_node_name (node)); | |
2015 | changed = true; | |
2016 | } | |
be330ed4 | 2017 | else if (d.maybe_executed_once && node->frequency != NODE_FREQUENCY_EXECUTED_ONCE) |
844db5d0 JH |
2018 | { |
2019 | node->frequency = NODE_FREQUENCY_EXECUTED_ONCE; | |
2020 | if (dump_file) | |
2021 | fprintf (dump_file, "Node %s promoted to executed once.\n", | |
2022 | cgraph_node_name (node)); | |
2023 | changed = true; | |
2024 | } | |
2025 | return changed; | |
fa5f5e27 JH |
2026 | } |
2027 | ||
d56026c2 JH |
2028 | /* Return true when NODE can not return or throw and thus |
2029 | it is safe to ignore its side effects for IPA analysis. */ | |
2030 | ||
2031 | bool | |
2032 | cgraph_node_cannot_return (struct cgraph_node *node) | |
2033 | { | |
960bfb69 | 2034 | int flags = flags_from_decl_or_type (node->symbol.decl); |
d56026c2 JH |
2035 | if (!flag_exceptions) |
2036 | return (flags & ECF_NORETURN) != 0; | |
2037 | else | |
2038 | return ((flags & (ECF_NORETURN | ECF_NOTHROW)) | |
2039 | == (ECF_NORETURN | ECF_NOTHROW)); | |
2040 | } | |
2041 | ||
2042 | /* Return true when call of E can not lead to return from caller | |
2043 | and thus it is safe to ignore its side effects for IPA analysis | |
2044 | when computing side effects of the caller. | |
2045 | FIXME: We could actually mark all edges that have no reaching | |
2046 | patch to EXIT_BLOCK_PTR or throw to get better results. */ | |
2047 | bool | |
2048 | cgraph_edge_cannot_lead_to_return (struct cgraph_edge *e) | |
2049 | { | |
f10ea640 JH |
2050 | if (cgraph_node_cannot_return (e->caller)) |
2051 | return true; | |
d56026c2 JH |
2052 | if (e->indirect_unknown_callee) |
2053 | { | |
2054 | int flags = e->indirect_info->ecf_flags; | |
2055 | if (!flag_exceptions) | |
2056 | return (flags & ECF_NORETURN) != 0; | |
2057 | else | |
2058 | return ((flags & (ECF_NORETURN | ECF_NOTHROW)) | |
2059 | == (ECF_NORETURN | ECF_NOTHROW)); | |
2060 | } | |
2061 | else | |
2062 | return cgraph_node_cannot_return (e->callee); | |
2063 | } | |
2064 | ||
508e4757 JH |
2065 | /* Return true when function NODE can be removed from callgraph |
2066 | if all direct calls are eliminated. */ | |
2067 | ||
2068 | bool | |
2069 | cgraph_can_remove_if_no_direct_calls_and_refs_p (struct cgraph_node *node) | |
2070 | { | |
530f3a1b JH |
2071 | gcc_assert (!node->global.inlined_to); |
2072 | /* Extern inlines can always go, we will use the external definition. */ | |
960bfb69 | 2073 | if (DECL_EXTERNAL (node->symbol.decl)) |
530f3a1b | 2074 | return true; |
508e4757 | 2075 | /* When function is needed, we can not remove it. */ |
ead84f73 | 2076 | if (node->symbol.force_output || node->symbol.used_from_other_partition) |
508e4757 | 2077 | return false; |
960bfb69 JH |
2078 | if (DECL_STATIC_CONSTRUCTOR (node->symbol.decl) |
2079 | || DECL_STATIC_DESTRUCTOR (node->symbol.decl)) | |
530f3a1b | 2080 | return false; |
508e4757 | 2081 | /* Only COMDAT functions can be removed if externally visible. */ |
960bfb69 JH |
2082 | if (node->symbol.externally_visible |
2083 | && (!DECL_COMDAT (node->symbol.decl) | |
65d630d4 | 2084 | || symtab_used_from_object_file_p ((symtab_node) node))) |
508e4757 | 2085 | return false; |
508e4757 JH |
2086 | return true; |
2087 | } | |
2088 | ||
9aa3f5c5 JH |
2089 | /* Worker for cgraph_can_remove_if_no_direct_calls_p. */ |
2090 | ||
2091 | static bool | |
2092 | nonremovable_p (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) | |
2093 | { | |
2094 | return !cgraph_can_remove_if_no_direct_calls_and_refs_p (node); | |
2095 | } | |
2096 | ||
2097 | /* Return true when function NODE and its aliases can be removed from callgraph | |
2098 | if all direct calls are eliminated. */ | |
2099 | ||
2100 | bool | |
2101 | cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node *node) | |
2102 | { | |
2103 | /* Extern inlines can always go, we will use the external definition. */ | |
960bfb69 | 2104 | if (DECL_EXTERNAL (node->symbol.decl)) |
9aa3f5c5 | 2105 | return true; |
960bfb69 | 2106 | if (node->symbol.address_taken) |
9aa3f5c5 JH |
2107 | return false; |
2108 | return !cgraph_for_node_and_aliases (node, nonremovable_p, NULL, true); | |
2109 | } | |
2110 | ||
2111 | /* Worker for cgraph_can_remove_if_no_direct_calls_p. */ | |
2112 | ||
2113 | static bool | |
2114 | used_from_object_file_p (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) | |
2115 | { | |
65d630d4 | 2116 | return symtab_used_from_object_file_p ((symtab_node) node); |
9aa3f5c5 JH |
2117 | } |
2118 | ||
61502ca8 | 2119 | /* Return true when function NODE can be expected to be removed |
09411461 JH |
2120 | from program when direct calls in this compilation unit are removed. |
2121 | ||
2122 | As a special case COMDAT functions are | |
2123 | cgraph_can_remove_if_no_direct_calls_p while the are not | |
2124 | cgraph_only_called_directly_p (it is possible they are called from other | |
2125 | unit) | |
2126 | ||
2127 | This function behaves as cgraph_only_called_directly_p because eliminating | |
61502ca8 | 2128 | all uses of COMDAT function does not make it necessarily disappear from |
09411461 JH |
2129 | the program unless we are compiling whole program or we do LTO. In this |
2130 | case we know we win since dynamic linking will not really discard the | |
2131 | linkonce section. */ | |
2132 | ||
2133 | bool | |
2134 | cgraph_will_be_removed_from_program_if_no_direct_calls (struct cgraph_node *node) | |
2135 | { | |
530f3a1b | 2136 | gcc_assert (!node->global.inlined_to); |
9aa3f5c5 | 2137 | if (cgraph_for_node_and_aliases (node, used_from_object_file_p, NULL, true)) |
09411461 JH |
2138 | return false; |
2139 | if (!in_lto_p && !flag_whole_program) | |
2140 | return cgraph_only_called_directly_p (node); | |
2141 | else | |
530f3a1b | 2142 | { |
960bfb69 | 2143 | if (DECL_EXTERNAL (node->symbol.decl)) |
530f3a1b JH |
2144 | return true; |
2145 | return cgraph_can_remove_if_no_direct_calls_p (node); | |
2146 | } | |
09411461 JH |
2147 | } |
2148 | ||
051f8cc6 | 2149 | |
be330ed4 JH |
2150 | /* Worker for cgraph_only_called_directly_p. */ |
2151 | ||
2152 | static bool | |
2153 | cgraph_not_only_called_directly_p_1 (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) | |
2154 | { | |
2155 | return !cgraph_only_called_directly_or_aliased_p (node); | |
2156 | } | |
2157 | ||
2158 | /* Return true when function NODE and all its aliases are only called | |
2159 | directly. | |
2160 | i.e. it is not externally visible, address was not taken and | |
2161 | it is not used in any other non-standard way. */ | |
2162 | ||
2163 | bool | |
2164 | cgraph_only_called_directly_p (struct cgraph_node *node) | |
2165 | { | |
2166 | gcc_assert (cgraph_function_or_thunk_node (node, NULL) == node); | |
2167 | return !cgraph_for_node_and_aliases (node, cgraph_not_only_called_directly_p_1, | |
2168 | NULL, true); | |
2169 | } | |
2170 | ||
2171 | ||
2172 | /* Collect all callers of NODE. Worker for collect_callers_of_node. */ | |
2173 | ||
2174 | static bool | |
2175 | collect_callers_of_node_1 (struct cgraph_node *node, void *data) | |
2176 | { | |
9771b263 | 2177 | vec<cgraph_edge_p> *redirect_callers = (vec<cgraph_edge_p> *)data; |
be330ed4 JH |
2178 | struct cgraph_edge *cs; |
2179 | enum availability avail; | |
2180 | cgraph_function_or_thunk_node (node, &avail); | |
2181 | ||
2182 | if (avail > AVAIL_OVERWRITABLE) | |
2183 | for (cs = node->callers; cs != NULL; cs = cs->next_caller) | |
2184 | if (!cs->indirect_inlining_edge) | |
9771b263 | 2185 | redirect_callers->safe_push (cs); |
be330ed4 JH |
2186 | return false; |
2187 | } | |
2188 | ||
2189 | /* Collect all callers of NODE and its aliases that are known to lead to NODE | |
2190 | (i.e. are not overwritable). */ | |
2191 | ||
9771b263 | 2192 | vec<cgraph_edge_p> |
be330ed4 JH |
2193 | collect_callers_of_node (struct cgraph_node *node) |
2194 | { | |
6e1aa848 | 2195 | vec<cgraph_edge_p> redirect_callers = vNULL; |
be330ed4 JH |
2196 | cgraph_for_node_and_aliases (node, collect_callers_of_node_1, |
2197 | &redirect_callers, false); | |
2198 | return redirect_callers; | |
2199 | } | |
2200 | ||
9c8305f8 JH |
2201 | /* Return TRUE if NODE2 is equivalent to NODE or its clone. */ |
2202 | static bool | |
2203 | clone_of_p (struct cgraph_node *node, struct cgraph_node *node2) | |
2204 | { | |
2205 | node = cgraph_function_or_thunk_node (node, NULL); | |
2206 | node2 = cgraph_function_or_thunk_node (node2, NULL); | |
2207 | while (node != node2 && node2) | |
2208 | node2 = node2->clone_of; | |
2209 | return node2 != NULL; | |
2210 | } | |
2211 | ||
2212 | /* Verify edge E count and frequency. */ | |
2213 | ||
2214 | static bool | |
2215 | verify_edge_count_and_frequency (struct cgraph_edge *e) | |
2216 | { | |
2217 | bool error_found = false; | |
2218 | if (e->count < 0) | |
2219 | { | |
2220 | error ("caller edge count is negative"); | |
2221 | error_found = true; | |
2222 | } | |
2223 | if (e->frequency < 0) | |
2224 | { | |
2225 | error ("caller edge frequency is negative"); | |
2226 | error_found = true; | |
2227 | } | |
2228 | if (e->frequency > CGRAPH_FREQ_MAX) | |
2229 | { | |
2230 | error ("caller edge frequency is too large"); | |
2231 | error_found = true; | |
2232 | } | |
2233 | if (gimple_has_body_p (e->caller->symbol.decl) | |
2234 | && !e->caller->global.inlined_to | |
2235 | /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out. | |
073a8998 | 2236 | Remove this once edges are actually removed from the function at that time. */ |
9c8305f8 | 2237 | && (e->frequency |
9771b263 DN |
2238 | || (inline_edge_summary_vec.exists () |
2239 | && ((inline_edge_summary_vec.length () <= (unsigned) e->uid) | |
9c8305f8 JH |
2240 | || !inline_edge_summary (e)->predicate))) |
2241 | && (e->frequency | |
2242 | != compute_call_stmt_bb_frequency (e->caller->symbol.decl, | |
2243 | gimple_bb (e->call_stmt)))) | |
2244 | { | |
2245 | error ("caller edge frequency %i does not match BB frequency %i", | |
2246 | e->frequency, | |
2247 | compute_call_stmt_bb_frequency (e->caller->symbol.decl, | |
2248 | gimple_bb (e->call_stmt))); | |
2249 | error_found = true; | |
2250 | } | |
2251 | return error_found; | |
2252 | } | |
2253 | ||
2254 | /* Switch to THIS_CFUN if needed and print STMT to stderr. */ | |
2255 | static void | |
2256 | cgraph_debug_gimple_stmt (struct function *this_cfun, gimple stmt) | |
2257 | { | |
27f7e1c3 | 2258 | bool fndecl_was_null = false; |
9c8305f8 JH |
2259 | /* debug_gimple_stmt needs correct cfun */ |
2260 | if (cfun != this_cfun) | |
2261 | set_cfun (this_cfun); | |
27f7e1c3 AH |
2262 | /* ...and an actual current_function_decl */ |
2263 | if (!current_function_decl) | |
2264 | { | |
2265 | current_function_decl = this_cfun->decl; | |
2266 | fndecl_was_null = true; | |
2267 | } | |
9c8305f8 | 2268 | debug_gimple_stmt (stmt); |
27f7e1c3 AH |
2269 | if (fndecl_was_null) |
2270 | current_function_decl = NULL; | |
9c8305f8 JH |
2271 | } |
2272 | ||
2273 | /* Verify that call graph edge E corresponds to DECL from the associated | |
2274 | statement. Return true if the verification should fail. */ | |
2275 | ||
2276 | static bool | |
2277 | verify_edge_corresponds_to_fndecl (struct cgraph_edge *e, tree decl) | |
2278 | { | |
2279 | struct cgraph_node *node; | |
2280 | ||
2281 | if (!decl || e->callee->global.inlined_to) | |
2282 | return false; | |
2283 | node = cgraph_get_node (decl); | |
2284 | ||
2285 | /* We do not know if a node from a different partition is an alias or what it | |
2286 | aliases and therefore cannot do the former_clone_of check reliably. */ | |
2287 | if (!node || node->symbol.in_other_partition) | |
2288 | return false; | |
2289 | node = cgraph_function_or_thunk_node (node, NULL); | |
2290 | ||
2291 | if ((e->callee->former_clone_of != node->symbol.decl | |
2292 | && (!node->same_body_alias | |
2293 | || e->callee->former_clone_of != node->thunk.alias)) | |
2294 | /* IPA-CP sometimes redirect edge to clone and then back to the former | |
2295 | function. This ping-pong has to go, eventually. */ | |
2296 | && (node != cgraph_function_or_thunk_node (e->callee, NULL)) | |
2297 | && !clone_of_p (node, e->callee) | |
2298 | /* If decl is a same body alias of some other decl, allow e->callee to be | |
2299 | a clone of a clone of that other decl too. */ | |
2300 | && (!node->same_body_alias | |
2301 | || !clone_of_p (cgraph_get_node (node->thunk.alias), e->callee))) | |
2302 | return true; | |
2303 | else | |
2304 | return false; | |
2305 | } | |
2306 | ||
2307 | /* Verify cgraph nodes of given cgraph node. */ | |
2308 | DEBUG_FUNCTION void | |
2309 | verify_cgraph_node (struct cgraph_node *node) | |
2310 | { | |
2311 | struct cgraph_edge *e; | |
2312 | struct function *this_cfun = DECL_STRUCT_FUNCTION (node->symbol.decl); | |
2313 | basic_block this_block; | |
2314 | gimple_stmt_iterator gsi; | |
2315 | bool error_found = false; | |
2316 | ||
2317 | if (seen_error ()) | |
2318 | return; | |
2319 | ||
2320 | timevar_push (TV_CGRAPH_VERIFY); | |
2321 | error_found |= verify_symtab_base ((symtab_node) node); | |
2322 | for (e = node->callees; e; e = e->next_callee) | |
2323 | if (e->aux) | |
2324 | { | |
2325 | error ("aux field set for edge %s->%s", | |
2326 | identifier_to_locale (cgraph_node_name (e->caller)), | |
2327 | identifier_to_locale (cgraph_node_name (e->callee))); | |
2328 | error_found = true; | |
2329 | } | |
2330 | if (node->count < 0) | |
2331 | { | |
2332 | error ("execution count is negative"); | |
2333 | error_found = true; | |
2334 | } | |
65d630d4 JH |
2335 | if (node->global.inlined_to && node->symbol.same_comdat_group) |
2336 | { | |
2337 | error ("inline clone in same comdat group list"); | |
2338 | error_found = true; | |
2339 | } | |
e70670cf JH |
2340 | if (!node->symbol.definition && node->local.local) |
2341 | { | |
2342 | error ("local symbols must be defined"); | |
2343 | error_found = true; | |
2344 | } | |
9c8305f8 JH |
2345 | if (node->global.inlined_to && node->symbol.externally_visible) |
2346 | { | |
2347 | error ("externally visible inline clone"); | |
2348 | error_found = true; | |
2349 | } | |
2350 | if (node->global.inlined_to && node->symbol.address_taken) | |
2351 | { | |
2352 | error ("inline clone with address taken"); | |
2353 | error_found = true; | |
2354 | } | |
2355 | if (node->global.inlined_to && node->symbol.force_output) | |
2356 | { | |
2357 | error ("inline clone is forced to output"); | |
2358 | error_found = true; | |
2359 | } | |
2360 | for (e = node->indirect_calls; e; e = e->next_callee) | |
2361 | { | |
2362 | if (e->aux) | |
2363 | { | |
2364 | error ("aux field set for indirect edge from %s", | |
2365 | identifier_to_locale (cgraph_node_name (e->caller))); | |
2366 | error_found = true; | |
2367 | } | |
2368 | if (!e->indirect_unknown_callee | |
2369 | || !e->indirect_info) | |
2370 | { | |
2371 | error ("An indirect edge from %s is not marked as indirect or has " | |
2372 | "associated indirect_info, the corresponding statement is: ", | |
2373 | identifier_to_locale (cgraph_node_name (e->caller))); | |
2374 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); | |
2375 | error_found = true; | |
2376 | } | |
2377 | } | |
2378 | for (e = node->callers; e; e = e->next_caller) | |
2379 | { | |
2380 | if (verify_edge_count_and_frequency (e)) | |
2381 | error_found = true; | |
2382 | if (!e->inline_failed) | |
2383 | { | |
2384 | if (node->global.inlined_to | |
2385 | != (e->caller->global.inlined_to | |
2386 | ? e->caller->global.inlined_to : e->caller)) | |
2387 | { | |
2388 | error ("inlined_to pointer is wrong"); | |
2389 | error_found = true; | |
2390 | } | |
2391 | if (node->callers->next_caller) | |
2392 | { | |
2393 | error ("multiple inline callers"); | |
2394 | error_found = true; | |
2395 | } | |
2396 | } | |
2397 | else | |
2398 | if (node->global.inlined_to) | |
2399 | { | |
2400 | error ("inlined_to pointer set for noninline callers"); | |
2401 | error_found = true; | |
2402 | } | |
2403 | } | |
2404 | for (e = node->indirect_calls; e; e = e->next_callee) | |
2405 | if (verify_edge_count_and_frequency (e)) | |
2406 | error_found = true; | |
2407 | if (!node->callers && node->global.inlined_to) | |
2408 | { | |
2409 | error ("inlined_to pointer is set but no predecessors found"); | |
2410 | error_found = true; | |
2411 | } | |
2412 | if (node->global.inlined_to == node) | |
2413 | { | |
2414 | error ("inlined_to pointer refers to itself"); | |
2415 | error_found = true; | |
2416 | } | |
2417 | ||
2418 | if (node->clone_of) | |
2419 | { | |
2420 | struct cgraph_node *n; | |
2421 | for (n = node->clone_of->clones; n; n = n->next_sibling_clone) | |
2422 | if (n == node) | |
2423 | break; | |
2424 | if (!n) | |
2425 | { | |
2426 | error ("node has wrong clone_of"); | |
2427 | error_found = true; | |
2428 | } | |
2429 | } | |
2430 | if (node->clones) | |
2431 | { | |
2432 | struct cgraph_node *n; | |
2433 | for (n = node->clones; n; n = n->next_sibling_clone) | |
2434 | if (n->clone_of != node) | |
2435 | break; | |
2436 | if (n) | |
2437 | { | |
2438 | error ("node has wrong clone list"); | |
2439 | error_found = true; | |
2440 | } | |
2441 | } | |
2442 | if ((node->prev_sibling_clone || node->next_sibling_clone) && !node->clone_of) | |
2443 | { | |
2444 | error ("node is in clone list but it is not clone"); | |
2445 | error_found = true; | |
2446 | } | |
2447 | if (!node->prev_sibling_clone && node->clone_of && node->clone_of->clones != node) | |
2448 | { | |
2449 | error ("node has wrong prev_clone pointer"); | |
2450 | error_found = true; | |
2451 | } | |
2452 | if (node->prev_sibling_clone && node->prev_sibling_clone->next_sibling_clone != node) | |
2453 | { | |
2454 | error ("double linked list of clones corrupted"); | |
2455 | error_found = true; | |
2456 | } | |
2457 | ||
e70670cf | 2458 | if (node->symbol.analyzed && node->symbol.alias) |
9c8305f8 JH |
2459 | { |
2460 | bool ref_found = false; | |
2461 | int i; | |
2462 | struct ipa_ref *ref; | |
2463 | ||
2464 | if (node->callees) | |
2465 | { | |
2466 | error ("Alias has call edges"); | |
2467 | error_found = true; | |
2468 | } | |
2469 | for (i = 0; ipa_ref_list_reference_iterate (&node->symbol.ref_list, | |
2470 | i, ref); i++) | |
2471 | if (ref->use != IPA_REF_ALIAS) | |
2472 | { | |
2473 | error ("Alias has non-alias reference"); | |
2474 | error_found = true; | |
2475 | } | |
2476 | else if (ref_found) | |
2477 | { | |
2478 | error ("Alias has more than one alias reference"); | |
2479 | error_found = true; | |
2480 | } | |
2481 | else | |
2482 | ref_found = true; | |
2483 | if (!ref_found) | |
2484 | { | |
2485 | error ("Analyzed alias has no reference"); | |
2486 | error_found = true; | |
2487 | } | |
2488 | } | |
e70670cf | 2489 | if (node->symbol.analyzed && node->thunk.thunk_p) |
9c8305f8 JH |
2490 | { |
2491 | if (!node->callees) | |
2492 | { | |
2493 | error ("No edge out of thunk node"); | |
2494 | error_found = true; | |
2495 | } | |
2496 | else if (node->callees->next_callee) | |
2497 | { | |
2498 | error ("More than one edge out of thunk node"); | |
2499 | error_found = true; | |
2500 | } | |
2501 | if (gimple_has_body_p (node->symbol.decl)) | |
2502 | { | |
2503 | error ("Thunk is not supposed to have body"); | |
2504 | error_found = true; | |
2505 | } | |
2506 | } | |
e70670cf | 2507 | else if (node->symbol.analyzed && gimple_has_body_p (node->symbol.decl) |
9c8305f8 JH |
2508 | && !TREE_ASM_WRITTEN (node->symbol.decl) |
2509 | && (!DECL_EXTERNAL (node->symbol.decl) || node->global.inlined_to) | |
2510 | && !flag_wpa) | |
2511 | { | |
2512 | if (this_cfun->cfg) | |
2513 | { | |
9c8305f8 JH |
2514 | /* Reach the trees by walking over the CFG, and note the |
2515 | enclosing basic-blocks in the call edges. */ | |
2516 | FOR_EACH_BB_FN (this_block, this_cfun) | |
2517 | for (gsi = gsi_start_bb (this_block); | |
2518 | !gsi_end_p (gsi); | |
2519 | gsi_next (&gsi)) | |
2520 | { | |
2521 | gimple stmt = gsi_stmt (gsi); | |
2522 | if (is_gimple_call (stmt)) | |
2523 | { | |
2524 | struct cgraph_edge *e = cgraph_edge (node, stmt); | |
2525 | tree decl = gimple_call_fndecl (stmt); | |
2526 | if (e) | |
2527 | { | |
2528 | if (e->aux) | |
2529 | { | |
2530 | error ("shared call_stmt:"); | |
2531 | cgraph_debug_gimple_stmt (this_cfun, stmt); | |
2532 | error_found = true; | |
2533 | } | |
2534 | if (!e->indirect_unknown_callee) | |
2535 | { | |
2536 | if (verify_edge_corresponds_to_fndecl (e, decl)) | |
2537 | { | |
2538 | error ("edge points to wrong declaration:"); | |
2539 | debug_tree (e->callee->symbol.decl); | |
2540 | fprintf (stderr," Instead of:"); | |
2541 | debug_tree (decl); | |
2542 | error_found = true; | |
2543 | } | |
2544 | } | |
2545 | else if (decl) | |
2546 | { | |
2547 | error ("an indirect edge with unknown callee " | |
2548 | "corresponding to a call_stmt with " | |
2549 | "a known declaration:"); | |
2550 | error_found = true; | |
2551 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); | |
2552 | } | |
2553 | e->aux = (void *)1; | |
2554 | } | |
2555 | else if (decl) | |
2556 | { | |
2557 | error ("missing callgraph edge for call stmt:"); | |
2558 | cgraph_debug_gimple_stmt (this_cfun, stmt); | |
2559 | error_found = true; | |
2560 | } | |
2561 | } | |
2562 | } | |
9c8305f8 JH |
2563 | } |
2564 | else | |
2565 | /* No CFG available?! */ | |
2566 | gcc_unreachable (); | |
2567 | ||
2568 | for (e = node->callees; e; e = e->next_callee) | |
2569 | { | |
2570 | if (!e->aux) | |
2571 | { | |
2572 | error ("edge %s->%s has no corresponding call_stmt", | |
2573 | identifier_to_locale (cgraph_node_name (e->caller)), | |
2574 | identifier_to_locale (cgraph_node_name (e->callee))); | |
2575 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); | |
2576 | error_found = true; | |
2577 | } | |
2578 | e->aux = 0; | |
2579 | } | |
2580 | for (e = node->indirect_calls; e; e = e->next_callee) | |
2581 | { | |
2582 | if (!e->aux) | |
2583 | { | |
2584 | error ("an indirect edge from %s has no corresponding call_stmt", | |
2585 | identifier_to_locale (cgraph_node_name (e->caller))); | |
2586 | cgraph_debug_gimple_stmt (this_cfun, e->call_stmt); | |
2587 | error_found = true; | |
2588 | } | |
2589 | e->aux = 0; | |
2590 | } | |
2591 | } | |
2592 | if (error_found) | |
2593 | { | |
2594 | dump_cgraph_node (stderr, node); | |
2595 | internal_error ("verify_cgraph_node failed"); | |
2596 | } | |
2597 | timevar_pop (TV_CGRAPH_VERIFY); | |
2598 | } | |
2599 | ||
2600 | /* Verify whole cgraph structure. */ | |
2601 | DEBUG_FUNCTION void | |
2602 | verify_cgraph (void) | |
2603 | { | |
2604 | struct cgraph_node *node; | |
2605 | ||
2606 | if (seen_error ()) | |
2607 | return; | |
2608 | ||
2609 | FOR_EACH_FUNCTION (node) | |
2610 | verify_cgraph_node (node); | |
2611 | } | |
48f4a6fa JH |
2612 | |
2613 | /* Create external decl node for DECL. | |
2614 | The difference i nbetween cgraph_get_create_node and | |
2615 | cgraph_get_create_real_symbol_node is that cgraph_get_create_node | |
2616 | may return inline clone, while cgraph_get_create_real_symbol_node | |
2617 | will create a new node in this case. | |
2618 | FIXME: This function should be removed once clones are put out of decl | |
2619 | hash. */ | |
2620 | ||
2621 | struct cgraph_node * | |
2622 | cgraph_get_create_real_symbol_node (tree decl) | |
2623 | { | |
2624 | struct cgraph_node *first_clone = cgraph_get_node (decl); | |
2625 | struct cgraph_node *node; | |
2626 | /* create symbol table node. even if inline clone exists, we can not take | |
2627 | it as a target of non-inlined call. */ | |
2628 | node = cgraph_get_node (decl); | |
2629 | if (node && !node->global.inlined_to) | |
2630 | return node; | |
2631 | ||
2632 | node = cgraph_create_node (decl); | |
2633 | ||
2634 | /* ok, we previously inlined the function, then removed the offline copy and | |
2635 | now we want it back for external call. this can happen when devirtualizing | |
2636 | while inlining function called once that happens after extern inlined and | |
2637 | virtuals are already removed. in this case introduce the external node | |
2638 | and make it available for call. */ | |
2639 | if (first_clone) | |
2640 | { | |
2641 | first_clone->clone_of = node; | |
2642 | node->clones = first_clone; | |
2643 | symtab_prevail_in_asm_name_hash ((symtab_node) node); | |
2644 | symtab_insert_node_to_hashtable ((symtab_node) node); | |
2645 | if (dump_file) | |
2646 | fprintf (dump_file, "Introduced new external node " | |
2647 | "(%s/%i) and turned into root of the clone tree.\n", | |
9de04252 | 2648 | xstrdup (cgraph_node_name (node)), node->symbol.order); |
48f4a6fa JH |
2649 | } |
2650 | else if (dump_file) | |
2651 | fprintf (dump_file, "Introduced new external node " | |
9de04252 MJ |
2652 | "(%s/%i).\n", xstrdup (cgraph_node_name (node)), |
2653 | node->symbol.order); | |
48f4a6fa JH |
2654 | return node; |
2655 | } | |
e70670cf JH |
2656 | |
2657 | ||
2658 | /* Given NODE, walk the alias chain to return the function NODE is alias of. | |
2659 | Walk through thunk, too. | |
2660 | When AVAILABILITY is non-NULL, get minimal availability in the chain. */ | |
2661 | ||
2662 | struct cgraph_node * | |
2663 | cgraph_function_node (struct cgraph_node *node, enum availability *availability) | |
2664 | { | |
2665 | do | |
2666 | { | |
2667 | node = cgraph_function_or_thunk_node (node, availability); | |
2668 | if (node->thunk.thunk_p) | |
2669 | { | |
2670 | node = node->callees->callee; | |
2671 | if (availability) | |
2672 | { | |
2673 | enum availability a; | |
2674 | a = cgraph_function_body_availability (node); | |
2675 | if (a < *availability) | |
2676 | *availability = a; | |
2677 | } | |
2678 | node = cgraph_function_or_thunk_node (node, availability); | |
2679 | } | |
2680 | } while (node && node->thunk.thunk_p); | |
2681 | return node; | |
2682 | } | |
2683 | ||
988d1653 | 2684 | #include "gt-cgraph.h" |