gcc/
[official-gcc.git] / gcc / cgraph.c
blob8314ecfc48376475db8ff9f3239f608414f7a241
1 /* Callgraph handling code.
2 Copyright (C) 2003-2015 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
5 This file is part of GCC.
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
9 Software Foundation; either version 3, or (at your option) any later
10 version.
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.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file contains basic routines manipulating call graph
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. */
26 #include "config.h"
27 #include "system.h"
28 #include "coretypes.h"
29 #include "tm.h"
30 #include "alias.h"
31 #include "symtab.h"
32 #include "tree.h"
33 #include "fold-const.h"
34 #include "varasm.h"
35 #include "calls.h"
36 #include "print-tree.h"
37 #include "tree-inline.h"
38 #include "langhooks.h"
39 #include "toplev.h"
40 #include "flags.h"
41 #include "debug.h"
42 #include "target.h"
43 #include "predict.h"
44 #include "dominance.h"
45 #include "cfg.h"
46 #include "basic-block.h"
47 #include "hard-reg-set.h"
48 #include "function.h"
49 #include "cgraph.h"
50 #include "intl.h"
51 #include "tree-ssa-alias.h"
52 #include "internal-fn.h"
53 #include "tree-eh.h"
54 #include "gimple-expr.h"
55 #include "gimple.h"
56 #include "gimple-iterator.h"
57 #include "timevar.h"
58 #include "dumpfile.h"
59 #include "gimple-ssa.h"
60 #include "tree-cfg.h"
61 #include "tree-ssa.h"
62 #include "value-prof.h"
63 #include "except.h"
64 #include "diagnostic-core.h"
65 #include "rtl.h"
66 #include "ipa-utils.h"
67 #include "lto-streamer.h"
68 #include "alloc-pool.h"
69 #include "symbol-summary.h"
70 #include "ipa-prop.h"
71 #include "ipa-inline.h"
72 #include "cfgloop.h"
73 #include "gimple-pretty-print.h"
74 #include "insn-config.h"
75 #include "expmed.h"
76 #include "dojump.h"
77 #include "explow.h"
78 #include "emit-rtl.h"
79 #include "stmt.h"
80 #include "expr.h"
81 #include "tree-dfa.h"
82 #include "profile.h"
83 #include "params.h"
84 #include "tree-chkp.h"
85 #include "context.h"
87 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
88 #include "tree-pass.h"
90 /* Queue of cgraph nodes scheduled to be lowered. */
91 symtab_node *x_cgraph_nodes_queue;
92 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
94 /* Symbol table global context. */
95 symbol_table *symtab;
97 /* List of hooks triggered on cgraph_edge events. */
98 struct cgraph_edge_hook_list {
99 cgraph_edge_hook hook;
100 void *data;
101 struct cgraph_edge_hook_list *next;
104 /* List of hooks triggered on cgraph_node events. */
105 struct cgraph_node_hook_list {
106 cgraph_node_hook hook;
107 void *data;
108 struct cgraph_node_hook_list *next;
111 /* List of hooks triggered on events involving two cgraph_edges. */
112 struct cgraph_2edge_hook_list {
113 cgraph_2edge_hook hook;
114 void *data;
115 struct cgraph_2edge_hook_list *next;
118 /* List of hooks triggered on events involving two cgraph_nodes. */
119 struct cgraph_2node_hook_list {
120 cgraph_2node_hook hook;
121 void *data;
122 struct cgraph_2node_hook_list *next;
125 /* Hash descriptor for cgraph_function_version_info. */
127 struct function_version_hasher : ggc_ptr_hash<cgraph_function_version_info>
129 static hashval_t hash (cgraph_function_version_info *);
130 static bool equal (cgraph_function_version_info *,
131 cgraph_function_version_info *);
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.. */
138 static GTY(()) hash_table<function_version_hasher> *cgraph_fnver_htab = NULL;
140 /* Hash function for cgraph_fnver_htab. */
141 hashval_t
142 function_version_hasher::hash (cgraph_function_version_info *ptr)
144 int uid = ptr->this_node->uid;
145 return (hashval_t)(uid);
148 /* eq function for cgraph_fnver_htab. */
149 bool
150 function_version_hasher::equal (cgraph_function_version_info *n1,
151 cgraph_function_version_info *n2)
153 return n1->this_node->uid == n2->this_node->uid;
156 /* Mark as GC root all allocated nodes. */
157 static GTY(()) struct cgraph_function_version_info *
158 version_info_node = NULL;
160 /* Return true if NODE's address can be compared. */
162 bool
163 symtab_node::address_can_be_compared_p ()
165 /* Address of virtual tables and functions is never compared. */
166 if (DECL_VIRTUAL_P (decl))
167 return false;
168 /* Address of C++ cdtors is never compared. */
169 if (is_a <cgraph_node *> (this)
170 && (DECL_CXX_CONSTRUCTOR_P (decl)
171 || DECL_CXX_DESTRUCTOR_P (decl)))
172 return false;
173 /* Constant pool symbols addresses are never compared.
174 flag_merge_constants permits us to assume the same on readonly vars. */
175 if (is_a <varpool_node *> (this)
176 && (DECL_IN_CONSTANT_POOL (decl)
177 || (flag_merge_constants >= 2
178 && TREE_READONLY (decl) && !TREE_THIS_VOLATILE (decl))))
179 return false;
180 return true;
183 /* Get the cgraph_function_version_info node corresponding to node. */
184 cgraph_function_version_info *
185 cgraph_node::function_version (void)
187 cgraph_function_version_info key;
188 key.this_node = this;
190 if (cgraph_fnver_htab == NULL)
191 return NULL;
193 return cgraph_fnver_htab->find (&key);
196 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
197 corresponding to cgraph_node NODE. */
198 cgraph_function_version_info *
199 cgraph_node::insert_new_function_version (void)
201 version_info_node = NULL;
202 version_info_node = ggc_cleared_alloc<cgraph_function_version_info> ();
203 version_info_node->this_node = this;
205 if (cgraph_fnver_htab == NULL)
206 cgraph_fnver_htab = hash_table<function_version_hasher>::create_ggc (2);
208 *cgraph_fnver_htab->find_slot (version_info_node, INSERT)
209 = version_info_node;
210 return version_info_node;
213 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
214 DECL is a duplicate declaration. */
215 void
216 cgraph_node::delete_function_version (tree decl)
218 cgraph_node *decl_node = cgraph_node::get (decl);
219 cgraph_function_version_info *decl_v = NULL;
221 if (decl_node == NULL)
222 return;
224 decl_v = decl_node->function_version ();
226 if (decl_v == NULL)
227 return;
229 if (decl_v->prev != NULL)
230 decl_v->prev->next = decl_v->next;
232 if (decl_v->next != NULL)
233 decl_v->next->prev = decl_v->prev;
235 if (cgraph_fnver_htab != NULL)
236 cgraph_fnver_htab->remove_elt (decl_v);
238 decl_node->remove ();
241 /* Record that DECL1 and DECL2 are semantically identical function
242 versions. */
243 void
244 cgraph_node::record_function_versions (tree decl1, tree decl2)
246 cgraph_node *decl1_node = cgraph_node::get_create (decl1);
247 cgraph_node *decl2_node = cgraph_node::get_create (decl2);
248 cgraph_function_version_info *decl1_v = NULL;
249 cgraph_function_version_info *decl2_v = NULL;
250 cgraph_function_version_info *before;
251 cgraph_function_version_info *after;
253 gcc_assert (decl1_node != NULL && decl2_node != NULL);
254 decl1_v = decl1_node->function_version ();
255 decl2_v = decl2_node->function_version ();
257 if (decl1_v != NULL && decl2_v != NULL)
258 return;
260 if (decl1_v == NULL)
261 decl1_v = decl1_node->insert_new_function_version ();
263 if (decl2_v == NULL)
264 decl2_v = decl2_node->insert_new_function_version ();
266 /* Chain decl2_v and decl1_v. All semantically identical versions
267 will be chained together. */
269 before = decl1_v;
270 after = decl2_v;
272 while (before->next != NULL)
273 before = before->next;
275 while (after->prev != NULL)
276 after= after->prev;
278 before->next = after;
279 after->prev = before;
282 /* Initialize callgraph dump file. */
284 void
285 symbol_table::initialize (void)
287 if (!dump_file)
288 dump_file = dump_begin (TDI_cgraph, NULL);
291 /* Allocate new callgraph node and insert it into basic data structures. */
293 cgraph_node *
294 symbol_table::create_empty (void)
296 cgraph_node *node = allocate_cgraph_symbol ();
298 node->type = SYMTAB_FUNCTION;
299 node->frequency = NODE_FREQUENCY_NORMAL;
300 node->count_materialization_scale = REG_BR_PROB_BASE;
301 cgraph_count++;
303 return node;
306 /* Register HOOK to be called with DATA on each removed edge. */
307 cgraph_edge_hook_list *
308 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook, void *data)
310 cgraph_edge_hook_list *entry;
311 cgraph_edge_hook_list **ptr = &m_first_edge_removal_hook;
313 entry = (cgraph_edge_hook_list *) xmalloc (sizeof (*entry));
314 entry->hook = hook;
315 entry->data = data;
316 entry->next = NULL;
317 while (*ptr)
318 ptr = &(*ptr)->next;
319 *ptr = entry;
320 return entry;
323 /* Remove ENTRY from the list of hooks called on removing edges. */
324 void
325 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list *entry)
327 cgraph_edge_hook_list **ptr = &m_first_edge_removal_hook;
329 while (*ptr != entry)
330 ptr = &(*ptr)->next;
331 *ptr = entry->next;
332 free (entry);
335 /* Call all edge removal hooks. */
336 void
337 symbol_table::call_edge_removal_hooks (cgraph_edge *e)
339 cgraph_edge_hook_list *entry = m_first_edge_removal_hook;
340 while (entry)
342 entry->hook (e, entry->data);
343 entry = entry->next;
347 /* Register HOOK to be called with DATA on each removed node. */
348 cgraph_node_hook_list *
349 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook, void *data)
351 cgraph_node_hook_list *entry;
352 cgraph_node_hook_list **ptr = &m_first_cgraph_removal_hook;
354 entry = (cgraph_node_hook_list *) xmalloc (sizeof (*entry));
355 entry->hook = hook;
356 entry->data = data;
357 entry->next = NULL;
358 while (*ptr)
359 ptr = &(*ptr)->next;
360 *ptr = entry;
361 return entry;
364 /* Remove ENTRY from the list of hooks called on removing nodes. */
365 void
366 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list *entry)
368 cgraph_node_hook_list **ptr = &m_first_cgraph_removal_hook;
370 while (*ptr != entry)
371 ptr = &(*ptr)->next;
372 *ptr = entry->next;
373 free (entry);
376 /* Call all node removal hooks. */
377 void
378 symbol_table::call_cgraph_removal_hooks (cgraph_node *node)
380 cgraph_node_hook_list *entry = m_first_cgraph_removal_hook;
381 while (entry)
383 entry->hook (node, entry->data);
384 entry = entry->next;
388 /* Call all node removal hooks. */
389 void
390 symbol_table::call_cgraph_insertion_hooks (cgraph_node *node)
392 cgraph_node_hook_list *entry = m_first_cgraph_insertion_hook;
393 while (entry)
395 entry->hook (node, entry->data);
396 entry = entry->next;
401 /* Register HOOK to be called with DATA on each inserted node. */
402 cgraph_node_hook_list *
403 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook, void *data)
405 cgraph_node_hook_list *entry;
406 cgraph_node_hook_list **ptr = &m_first_cgraph_insertion_hook;
408 entry = (cgraph_node_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;
418 /* Remove ENTRY from the list of hooks called on inserted nodes. */
419 void
420 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list *entry)
422 cgraph_node_hook_list **ptr = &m_first_cgraph_insertion_hook;
424 while (*ptr != entry)
425 ptr = &(*ptr)->next;
426 *ptr = entry->next;
427 free (entry);
430 /* Register HOOK to be called with DATA on each duplicated edge. */
431 cgraph_2edge_hook_list *
432 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook, void *data)
434 cgraph_2edge_hook_list *entry;
435 cgraph_2edge_hook_list **ptr = &m_first_edge_duplicated_hook;
437 entry = (cgraph_2edge_hook_list *) xmalloc (sizeof (*entry));
438 entry->hook = hook;
439 entry->data = data;
440 entry->next = NULL;
441 while (*ptr)
442 ptr = &(*ptr)->next;
443 *ptr = entry;
444 return entry;
447 /* Remove ENTRY from the list of hooks called on duplicating edges. */
448 void
449 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list *entry)
451 cgraph_2edge_hook_list **ptr = &m_first_edge_duplicated_hook;
453 while (*ptr != entry)
454 ptr = &(*ptr)->next;
455 *ptr = entry->next;
456 free (entry);
459 /* Call all edge duplication hooks. */
460 void
461 symbol_table::call_edge_duplication_hooks (cgraph_edge *cs1, cgraph_edge *cs2)
463 cgraph_2edge_hook_list *entry = m_first_edge_duplicated_hook;
464 while (entry)
466 entry->hook (cs1, cs2, entry->data);
467 entry = entry->next;
471 /* Register HOOK to be called with DATA on each duplicated node. */
472 cgraph_2node_hook_list *
473 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook, void *data)
475 cgraph_2node_hook_list *entry;
476 cgraph_2node_hook_list **ptr = &m_first_cgraph_duplicated_hook;
478 entry = (cgraph_2node_hook_list *) xmalloc (sizeof (*entry));
479 entry->hook = hook;
480 entry->data = data;
481 entry->next = NULL;
482 while (*ptr)
483 ptr = &(*ptr)->next;
484 *ptr = entry;
485 return entry;
488 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
489 void
490 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list *entry)
492 cgraph_2node_hook_list **ptr = &m_first_cgraph_duplicated_hook;
494 while (*ptr != entry)
495 ptr = &(*ptr)->next;
496 *ptr = entry->next;
497 free (entry);
500 /* Call all node duplication hooks. */
501 void
502 symbol_table::call_cgraph_duplication_hooks (cgraph_node *node,
503 cgraph_node *node2)
505 cgraph_2node_hook_list *entry = m_first_cgraph_duplicated_hook;
506 while (entry)
508 entry->hook (node, node2, entry->data);
509 entry = entry->next;
513 /* Return cgraph node assigned to DECL. Create new one when needed. */
515 cgraph_node *
516 cgraph_node::create (tree decl)
518 cgraph_node *node = symtab->create_empty ();
519 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
521 node->decl = decl;
523 if ((flag_openacc || flag_openmp)
524 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl)))
526 node->offloadable = 1;
527 #ifdef ENABLE_OFFLOADING
528 g->have_offload = true;
529 #endif
532 node->register_symbol ();
534 if (DECL_CONTEXT (decl) && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
536 node->origin = cgraph_node::get_create (DECL_CONTEXT (decl));
537 node->next_nested = node->origin->nested;
538 node->origin->nested = node;
540 return node;
543 /* Try to find a call graph node for declaration DECL and if it does not exist
544 or if it corresponds to an inline clone, create a new one. */
546 cgraph_node *
547 cgraph_node::get_create (tree decl)
549 cgraph_node *first_clone = cgraph_node::get (decl);
551 if (first_clone && !first_clone->global.inlined_to)
552 return first_clone;
554 cgraph_node *node = cgraph_node::create (decl);
555 if (first_clone)
557 first_clone->clone_of = node;
558 node->clones = first_clone;
559 symtab->symtab_prevail_in_asm_name_hash (node);
560 node->decl->decl_with_vis.symtab_node = node;
561 if (dump_file)
562 fprintf (dump_file, "Introduced new external node "
563 "(%s/%i) and turned into root of the clone tree.\n",
564 node->name (), node->order);
566 else if (dump_file)
567 fprintf (dump_file, "Introduced new external node "
568 "(%s/%i).\n", node->name (), node->order);
569 return node;
572 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
573 the function body is associated with (not necessarily cgraph_node (DECL). */
575 cgraph_node *
576 cgraph_node::create_alias (tree alias, tree target)
578 cgraph_node *alias_node;
580 gcc_assert (TREE_CODE (target) == FUNCTION_DECL
581 || TREE_CODE (target) == IDENTIFIER_NODE);
582 gcc_assert (TREE_CODE (alias) == FUNCTION_DECL);
583 alias_node = cgraph_node::get_create (alias);
584 gcc_assert (!alias_node->definition);
585 alias_node->alias_target = target;
586 alias_node->definition = true;
587 alias_node->alias = true;
588 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias)) != NULL)
589 alias_node->weakref = true;
590 return alias_node;
593 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
594 and NULL otherwise.
595 Same body aliases are output whenever the body of DECL is output,
596 and cgraph_node::get (ALIAS) transparently returns
597 cgraph_node::get (DECL). */
599 cgraph_node *
600 cgraph_node::create_same_body_alias (tree alias, tree decl)
602 cgraph_node *n;
603 #ifndef ASM_OUTPUT_DEF
604 /* If aliases aren't supported by the assembler, fail. */
605 return NULL;
606 #endif
607 /* Langhooks can create same body aliases of symbols not defined.
608 Those are useless. Drop them on the floor. */
609 if (symtab->global_info_ready)
610 return NULL;
612 n = cgraph_node::create_alias (alias, decl);
613 n->cpp_implicit_alias = true;
614 if (symtab->cpp_implicit_aliases_done)
615 n->resolve_alias (cgraph_node::get (decl));
616 return n;
619 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
620 aliases DECL with an adjustments made into the first parameter.
621 See comments in thunk_adjust for detail on the parameters. */
623 cgraph_node *
624 cgraph_node::create_thunk (tree alias, tree, bool this_adjusting,
625 HOST_WIDE_INT fixed_offset,
626 HOST_WIDE_INT virtual_value,
627 tree virtual_offset,
628 tree real_alias)
630 cgraph_node *node;
632 node = cgraph_node::get (alias);
633 if (node)
634 node->reset ();
635 else
636 node = cgraph_node::create (alias);
637 gcc_checking_assert (!virtual_offset
638 || wi::eq_p (virtual_offset, virtual_value));
639 node->thunk.fixed_offset = fixed_offset;
640 node->thunk.this_adjusting = this_adjusting;
641 node->thunk.virtual_value = virtual_value;
642 node->thunk.virtual_offset_p = virtual_offset != NULL;
643 node->thunk.alias = real_alias;
644 node->thunk.thunk_p = true;
645 node->definition = true;
647 return node;
650 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
651 Return NULL if there's no such node. */
653 cgraph_node *
654 cgraph_node::get_for_asmname (tree asmname)
656 /* We do not want to look at inline clones. */
657 for (symtab_node *node = symtab_node::get_for_asmname (asmname);
658 node;
659 node = node->next_sharing_asm_name)
661 cgraph_node *cn = dyn_cast <cgraph_node *> (node);
662 if (cn && !cn->global.inlined_to)
663 return cn;
665 return NULL;
668 /* Returns a hash value for X (which really is a cgraph_edge). */
670 hashval_t
671 cgraph_edge_hasher::hash (cgraph_edge *e)
673 /* This is a really poor hash function, but it is what htab_hash_pointer
674 uses. */
675 return (hashval_t) ((intptr_t)e->call_stmt >> 3);
678 /* Returns a hash value for X (which really is a cgraph_edge). */
680 hashval_t
681 cgraph_edge_hasher::hash (gimple call_stmt)
683 /* This is a really poor hash function, but it is what htab_hash_pointer
684 uses. */
685 return (hashval_t) ((intptr_t)call_stmt >> 3);
688 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
690 inline bool
691 cgraph_edge_hasher::equal (cgraph_edge *x, gimple y)
693 return x->call_stmt == y;
696 /* Add call graph edge E to call site hash of its caller. */
698 static inline void
699 cgraph_update_edge_in_call_site_hash (cgraph_edge *e)
701 gimple call = e->call_stmt;
702 *e->caller->call_site_hash->find_slot_with_hash
703 (call, cgraph_edge_hasher::hash (call), INSERT) = e;
706 /* Add call graph edge E to call site hash of its caller. */
708 static inline void
709 cgraph_add_edge_to_call_site_hash (cgraph_edge *e)
711 /* There are two speculative edges for every statement (one direct,
712 one indirect); always hash the direct one. */
713 if (e->speculative && e->indirect_unknown_callee)
714 return;
715 cgraph_edge **slot = e->caller->call_site_hash->find_slot_with_hash
716 (e->call_stmt, cgraph_edge_hasher::hash (e->call_stmt), INSERT);
717 if (*slot)
719 gcc_assert (((cgraph_edge *)*slot)->speculative);
720 if (e->callee)
721 *slot = e;
722 return;
724 gcc_assert (!*slot || e->speculative);
725 *slot = e;
728 /* Return the callgraph edge representing the GIMPLE_CALL statement
729 CALL_STMT. */
731 cgraph_edge *
732 cgraph_node::get_edge (gimple call_stmt)
734 cgraph_edge *e, *e2;
735 int n = 0;
737 if (call_site_hash)
738 return call_site_hash->find_with_hash
739 (call_stmt, cgraph_edge_hasher::hash (call_stmt));
741 /* This loop may turn out to be performance problem. In such case adding
742 hashtables into call nodes with very many edges is probably best
743 solution. It is not good idea to add pointer into CALL_EXPR itself
744 because we want to make possible having multiple cgraph nodes representing
745 different clones of the same body before the body is actually cloned. */
746 for (e = callees; e; e = e->next_callee)
748 if (e->call_stmt == call_stmt)
749 break;
750 n++;
753 if (!e)
754 for (e = indirect_calls; e; e = e->next_callee)
756 if (e->call_stmt == call_stmt)
757 break;
758 n++;
761 if (n > 100)
763 call_site_hash = hash_table<cgraph_edge_hasher>::create_ggc (120);
764 for (e2 = callees; e2; e2 = e2->next_callee)
765 cgraph_add_edge_to_call_site_hash (e2);
766 for (e2 = indirect_calls; e2; e2 = e2->next_callee)
767 cgraph_add_edge_to_call_site_hash (e2);
770 return e;
774 /* Change field call_stmt of edge to NEW_STMT.
775 If UPDATE_SPECULATIVE and E is any component of speculative
776 edge, then update all components. */
778 void
779 cgraph_edge::set_call_stmt (gcall *new_stmt, bool update_speculative)
781 tree decl;
783 /* Speculative edges has three component, update all of them
784 when asked to. */
785 if (update_speculative && speculative)
787 cgraph_edge *direct, *indirect;
788 ipa_ref *ref;
790 speculative_call_info (direct, indirect, ref);
791 direct->set_call_stmt (new_stmt, false);
792 indirect->set_call_stmt (new_stmt, false);
793 ref->stmt = new_stmt;
794 return;
797 /* Only direct speculative edges go to call_site_hash. */
798 if (caller->call_site_hash
799 && (!speculative || !indirect_unknown_callee))
801 caller->call_site_hash->remove_elt_with_hash
802 (call_stmt, cgraph_edge_hasher::hash (call_stmt));
805 cgraph_edge *e = this;
807 call_stmt = new_stmt;
808 if (indirect_unknown_callee
809 && (decl = gimple_call_fndecl (new_stmt)))
811 /* Constant propagation (and possibly also inlining?) can turn an
812 indirect call into a direct one. */
813 cgraph_node *new_callee = cgraph_node::get (decl);
815 gcc_checking_assert (new_callee);
816 e = make_direct (new_callee);
819 push_cfun (DECL_STRUCT_FUNCTION (e->caller->decl));
820 e->can_throw_external = stmt_can_throw_external (new_stmt);
821 pop_cfun ();
822 if (e->caller->call_site_hash)
823 cgraph_add_edge_to_call_site_hash (e);
826 /* Allocate a cgraph_edge structure and fill it with data according to the
827 parameters of which only CALLEE can be NULL (when creating an indirect call
828 edge). */
830 cgraph_edge *
831 symbol_table::create_edge (cgraph_node *caller, cgraph_node *callee,
832 gcall *call_stmt, gcov_type count, int freq,
833 bool indir_unknown_callee)
835 cgraph_edge *edge;
837 /* LTO does not actually have access to the call_stmt since these
838 have not been loaded yet. */
839 if (call_stmt)
841 /* This is a rather expensive check possibly triggering
842 construction of call stmt hashtable. */
843 #ifdef ENABLE_CHECKING
844 cgraph_edge *e;
845 gcc_checking_assert (
846 !(e = caller->get_edge (call_stmt)) || e->speculative);
847 #endif
849 gcc_assert (is_gimple_call (call_stmt));
852 if (free_edges)
854 edge = free_edges;
855 free_edges = NEXT_FREE_EDGE (edge);
857 else
859 edge = ggc_alloc<cgraph_edge> ();
860 edge->uid = edges_max_uid++;
863 edges_count++;
865 edge->aux = NULL;
866 edge->caller = caller;
867 edge->callee = callee;
868 edge->prev_caller = NULL;
869 edge->next_caller = NULL;
870 edge->prev_callee = NULL;
871 edge->next_callee = NULL;
872 edge->lto_stmt_uid = 0;
874 edge->count = count;
875 gcc_assert (count >= 0);
876 edge->frequency = freq;
877 gcc_assert (freq >= 0);
878 gcc_assert (freq <= CGRAPH_FREQ_MAX);
880 edge->call_stmt = call_stmt;
881 push_cfun (DECL_STRUCT_FUNCTION (caller->decl));
882 edge->can_throw_external
883 = call_stmt ? stmt_can_throw_external (call_stmt) : false;
884 pop_cfun ();
885 if (call_stmt
886 && callee && callee->decl
887 && !gimple_check_call_matching_types (call_stmt, callee->decl,
888 false))
889 edge->call_stmt_cannot_inline_p = true;
890 else
891 edge->call_stmt_cannot_inline_p = false;
893 edge->indirect_info = NULL;
894 edge->indirect_inlining_edge = 0;
895 edge->speculative = false;
896 edge->indirect_unknown_callee = indir_unknown_callee;
897 if (opt_for_fn (edge->caller->decl, flag_devirtualize)
898 && call_stmt && DECL_STRUCT_FUNCTION (caller->decl))
899 edge->in_polymorphic_cdtor
900 = decl_maybe_in_construction_p (NULL, NULL, call_stmt,
901 caller->decl);
902 else
903 edge->in_polymorphic_cdtor = caller->thunk.thunk_p;
904 if (call_stmt && caller->call_site_hash)
905 cgraph_add_edge_to_call_site_hash (edge);
907 return edge;
910 /* Create edge from a given function to CALLEE in the cgraph. */
912 cgraph_edge *
913 cgraph_node::create_edge (cgraph_node *callee,
914 gcall *call_stmt, gcov_type count, int freq)
916 cgraph_edge *edge = symtab->create_edge (this, callee, call_stmt, count,
917 freq, false);
919 initialize_inline_failed (edge);
921 edge->next_caller = callee->callers;
922 if (callee->callers)
923 callee->callers->prev_caller = edge;
924 edge->next_callee = callees;
925 if (callees)
926 callees->prev_callee = edge;
927 callees = edge;
928 callee->callers = edge;
930 return edge;
933 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
935 cgraph_indirect_call_info *
936 cgraph_allocate_init_indirect_info (void)
938 cgraph_indirect_call_info *ii;
940 ii = ggc_cleared_alloc<cgraph_indirect_call_info> ();
941 ii->param_index = -1;
942 return ii;
945 /* Create an indirect edge with a yet-undetermined callee where the call
946 statement destination is a formal parameter of the caller with index
947 PARAM_INDEX. */
949 cgraph_edge *
950 cgraph_node::create_indirect_edge (gcall *call_stmt, int ecf_flags,
951 gcov_type count, int freq,
952 bool compute_indirect_info)
954 cgraph_edge *edge = symtab->create_edge (this, NULL, call_stmt,
955 count, freq, true);
956 tree target;
958 initialize_inline_failed (edge);
960 edge->indirect_info = cgraph_allocate_init_indirect_info ();
961 edge->indirect_info->ecf_flags = ecf_flags;
962 edge->indirect_info->vptr_changed = true;
964 /* Record polymorphic call info. */
965 if (compute_indirect_info
966 && call_stmt
967 && (target = gimple_call_fn (call_stmt))
968 && virtual_method_call_p (target))
970 ipa_polymorphic_call_context context (decl, target, call_stmt);
972 /* Only record types can have virtual calls. */
973 edge->indirect_info->polymorphic = true;
974 edge->indirect_info->param_index = -1;
975 edge->indirect_info->otr_token
976 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target));
977 edge->indirect_info->otr_type = obj_type_ref_class (target);
978 gcc_assert (TREE_CODE (edge->indirect_info->otr_type) == RECORD_TYPE);
979 edge->indirect_info->context = context;
982 edge->next_callee = indirect_calls;
983 if (indirect_calls)
984 indirect_calls->prev_callee = edge;
985 indirect_calls = edge;
987 return edge;
990 /* Remove the edge from the list of the callees of the caller. */
992 void
993 cgraph_edge::remove_caller (void)
995 if (prev_callee)
996 prev_callee->next_callee = next_callee;
997 if (next_callee)
998 next_callee->prev_callee = prev_callee;
999 if (!prev_callee)
1001 if (indirect_unknown_callee)
1002 caller->indirect_calls = next_callee;
1003 else
1004 caller->callees = next_callee;
1006 if (caller->call_site_hash)
1007 caller->call_site_hash->remove_elt_with_hash
1008 (call_stmt, cgraph_edge_hasher::hash (call_stmt));
1011 /* Put the edge onto the free list. */
1013 void
1014 symbol_table::free_edge (cgraph_edge *e)
1016 int uid = e->uid;
1018 if (e->indirect_info)
1019 ggc_free (e->indirect_info);
1021 /* Clear out the edge so we do not dangle pointers. */
1022 memset (e, 0, sizeof (*e));
1023 e->uid = uid;
1024 NEXT_FREE_EDGE (e) = free_edges;
1025 free_edges = e;
1026 edges_count--;
1029 /* Remove the edge in the cgraph. */
1031 void
1032 cgraph_edge::remove (void)
1034 /* Call all edge removal hooks. */
1035 symtab->call_edge_removal_hooks (this);
1037 if (!indirect_unknown_callee)
1038 /* Remove from callers list of the callee. */
1039 remove_callee ();
1041 /* Remove from callees list of the callers. */
1042 remove_caller ();
1044 /* Put the edge onto the free list. */
1045 symtab->free_edge (this);
1048 /* Turn edge into speculative call calling N2. Update
1049 the profile so the direct call is taken COUNT times
1050 with FREQUENCY.
1052 At clone materialization time, the indirect call E will
1053 be expanded as:
1055 if (call_dest == N2)
1056 n2 ();
1057 else
1058 call call_dest
1060 At this time the function just creates the direct call,
1061 the referencd representing the if conditional and attaches
1062 them all to the orginal indirect call statement.
1064 Return direct edge created. */
1066 cgraph_edge *
1067 cgraph_edge::make_speculative (cgraph_node *n2, gcov_type direct_count,
1068 int direct_frequency)
1070 cgraph_node *n = caller;
1071 ipa_ref *ref = NULL;
1072 cgraph_edge *e2;
1074 if (dump_file)
1076 fprintf (dump_file, "Indirect call -> speculative call"
1077 " %s/%i => %s/%i\n",
1078 xstrdup_for_dump (n->name ()), n->order,
1079 xstrdup_for_dump (n2->name ()), n2->order);
1081 speculative = true;
1082 e2 = n->create_edge (n2, call_stmt, direct_count, direct_frequency);
1083 initialize_inline_failed (e2);
1084 e2->speculative = true;
1085 if (TREE_NOTHROW (n2->decl))
1086 e2->can_throw_external = false;
1087 else
1088 e2->can_throw_external = can_throw_external;
1089 e2->lto_stmt_uid = lto_stmt_uid;
1090 e2->in_polymorphic_cdtor = in_polymorphic_cdtor;
1091 count -= e2->count;
1092 frequency -= e2->frequency;
1093 symtab->call_edge_duplication_hooks (this, e2);
1094 ref = n->create_reference (n2, IPA_REF_ADDR, call_stmt);
1095 ref->lto_stmt_uid = lto_stmt_uid;
1096 ref->speculative = speculative;
1097 n2->mark_address_taken ();
1098 return e2;
1101 /* Speculative call consist of three components:
1102 1) an indirect edge representing the original call
1103 2) an direct edge representing the new call
1104 3) ADDR_EXPR reference representing the speculative check.
1105 All three components are attached to single statement (the indirect
1106 call) and if one of them exists, all of them must exist.
1108 Given speculative call edge, return all three components.
1111 void
1112 cgraph_edge::speculative_call_info (cgraph_edge *&direct,
1113 cgraph_edge *&indirect,
1114 ipa_ref *&reference)
1116 ipa_ref *ref;
1117 int i;
1118 cgraph_edge *e2;
1119 cgraph_edge *e = this;
1121 if (!e->indirect_unknown_callee)
1122 for (e2 = e->caller->indirect_calls;
1123 e2->call_stmt != e->call_stmt || e2->lto_stmt_uid != e->lto_stmt_uid;
1124 e2 = e2->next_callee)
1126 else
1128 e2 = e;
1129 /* We can take advantage of the call stmt hash. */
1130 if (e2->call_stmt)
1132 e = e->caller->get_edge (e2->call_stmt);
1133 gcc_assert (e->speculative && !e->indirect_unknown_callee);
1135 else
1136 for (e = e->caller->callees;
1137 e2->call_stmt != e->call_stmt
1138 || e2->lto_stmt_uid != e->lto_stmt_uid;
1139 e = e->next_callee)
1142 gcc_assert (e->speculative && e2->speculative);
1143 direct = e;
1144 indirect = e2;
1146 reference = NULL;
1147 for (i = 0; e->caller->iterate_reference (i, ref); i++)
1148 if (ref->speculative
1149 && ((ref->stmt && ref->stmt == e->call_stmt)
1150 || (!ref->stmt && ref->lto_stmt_uid == e->lto_stmt_uid)))
1152 reference = ref;
1153 break;
1156 /* Speculative edge always consist of all three components - direct edge,
1157 indirect and reference. */
1159 gcc_assert (e && e2 && ref);
1162 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1163 Remove the speculative call sequence and return edge representing the call.
1164 It is up to caller to redirect the call as appropriate. */
1166 cgraph_edge *
1167 cgraph_edge::resolve_speculation (tree callee_decl)
1169 cgraph_edge *edge = this;
1170 cgraph_edge *e2;
1171 ipa_ref *ref;
1173 gcc_assert (edge->speculative);
1174 edge->speculative_call_info (e2, edge, ref);
1175 if (!callee_decl
1176 || !ref->referred->semantically_equivalent_p
1177 (symtab_node::get (callee_decl)))
1179 if (dump_file)
1181 if (callee_decl)
1183 fprintf (dump_file, "Speculative indirect call %s/%i => %s/%i has "
1184 "turned out to have contradicting known target ",
1185 xstrdup_for_dump (edge->caller->name ()),
1186 edge->caller->order,
1187 xstrdup_for_dump (e2->callee->name ()),
1188 e2->callee->order);
1189 print_generic_expr (dump_file, callee_decl, 0);
1190 fprintf (dump_file, "\n");
1192 else
1194 fprintf (dump_file, "Removing speculative call %s/%i => %s/%i\n",
1195 xstrdup_for_dump (edge->caller->name ()),
1196 edge->caller->order,
1197 xstrdup_for_dump (e2->callee->name ()),
1198 e2->callee->order);
1202 else
1204 cgraph_edge *tmp = edge;
1205 if (dump_file)
1206 fprintf (dump_file, "Speculative call turned into direct call.\n");
1207 edge = e2;
1208 e2 = tmp;
1209 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1210 in the functions inlined through it. */
1212 edge->count += e2->count;
1213 edge->frequency += e2->frequency;
1214 if (edge->frequency > CGRAPH_FREQ_MAX)
1215 edge->frequency = CGRAPH_FREQ_MAX;
1216 edge->speculative = false;
1217 e2->speculative = false;
1218 ref->remove_reference ();
1219 if (e2->indirect_unknown_callee || e2->inline_failed)
1220 e2->remove ();
1221 else
1222 e2->callee->remove_symbol_and_inline_clones ();
1223 if (edge->caller->call_site_hash)
1224 cgraph_update_edge_in_call_site_hash (edge);
1225 return edge;
1228 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1229 CALLEE. DELTA is an integer constant that is to be added to the this
1230 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1232 cgraph_edge *
1233 cgraph_edge::make_direct (cgraph_node *callee)
1235 cgraph_edge *edge = this;
1236 gcc_assert (indirect_unknown_callee);
1238 /* If we are redirecting speculative call, make it non-speculative. */
1239 if (indirect_unknown_callee && speculative)
1241 edge = edge->resolve_speculation (callee->decl);
1243 /* On successful speculation just return the pre existing direct edge. */
1244 if (!indirect_unknown_callee)
1245 return edge;
1248 indirect_unknown_callee = 0;
1249 ggc_free (indirect_info);
1250 indirect_info = NULL;
1252 /* Get the edge out of the indirect edge list. */
1253 if (prev_callee)
1254 prev_callee->next_callee = next_callee;
1255 if (next_callee)
1256 next_callee->prev_callee = prev_callee;
1257 if (!prev_callee)
1258 caller->indirect_calls = next_callee;
1260 /* Put it into the normal callee list */
1261 prev_callee = NULL;
1262 next_callee = caller->callees;
1263 if (caller->callees)
1264 caller->callees->prev_callee = edge;
1265 caller->callees = edge;
1267 /* Insert to callers list of the new callee. */
1268 edge->set_callee (callee);
1270 if (call_stmt)
1271 call_stmt_cannot_inline_p
1272 = !gimple_check_call_matching_types (call_stmt, callee->decl,
1273 false);
1275 /* We need to re-determine the inlining status of the edge. */
1276 initialize_inline_failed (edge);
1277 return edge;
1280 /* If necessary, change the function declaration in the call statement
1281 associated with E so that it corresponds to the edge callee. */
1283 gimple
1284 cgraph_edge::redirect_call_stmt_to_callee (void)
1286 cgraph_edge *e = this;
1288 tree decl = gimple_call_fndecl (e->call_stmt);
1289 tree lhs = gimple_call_lhs (e->call_stmt);
1290 gcall *new_stmt;
1291 gimple_stmt_iterator gsi;
1292 bool skip_bounds = false;
1293 #ifdef ENABLE_CHECKING
1294 cgraph_node *node;
1295 #endif
1297 if (e->speculative)
1299 cgraph_edge *e2;
1300 gcall *new_stmt;
1301 ipa_ref *ref;
1303 e->speculative_call_info (e, e2, ref);
1304 /* If there already is an direct call (i.e. as a result of inliner's
1305 substitution), forget about speculating. */
1306 if (decl)
1307 e = e->resolve_speculation (decl);
1308 /* If types do not match, speculation was likely wrong.
1309 The direct edge was posisbly redirected to the clone with a different
1310 signature. We did not update the call statement yet, so compare it
1311 with the reference that still points to the proper type. */
1312 else if (!gimple_check_call_matching_types (e->call_stmt,
1313 ref->referred->decl,
1314 true))
1316 if (dump_file)
1317 fprintf (dump_file, "Not expanding speculative call of %s/%i -> %s/%i\n"
1318 "Type mismatch.\n",
1319 xstrdup_for_dump (e->caller->name ()),
1320 e->caller->order,
1321 xstrdup_for_dump (e->callee->name ()),
1322 e->callee->order);
1323 e = e->resolve_speculation ();
1324 /* We are producing the final function body and will throw away the
1325 callgraph edges really soon. Reset the counts/frequencies to
1326 keep verifier happy in the case of roundoff errors. */
1327 e->count = gimple_bb (e->call_stmt)->count;
1328 e->frequency = compute_call_stmt_bb_frequency
1329 (e->caller->decl, gimple_bb (e->call_stmt));
1331 /* Expand speculation into GIMPLE code. */
1332 else
1334 if (dump_file)
1335 fprintf (dump_file,
1336 "Expanding speculative call of %s/%i -> %s/%i count:"
1337 "%" PRId64"\n",
1338 xstrdup_for_dump (e->caller->name ()),
1339 e->caller->order,
1340 xstrdup_for_dump (e->callee->name ()),
1341 e->callee->order,
1342 (int64_t)e->count);
1343 gcc_assert (e2->speculative);
1344 push_cfun (DECL_STRUCT_FUNCTION (e->caller->decl));
1345 new_stmt = gimple_ic (e->call_stmt,
1346 dyn_cast<cgraph_node *> (ref->referred),
1347 e->count || e2->count
1348 ? RDIV (e->count * REG_BR_PROB_BASE,
1349 e->count + e2->count)
1350 : e->frequency || e2->frequency
1351 ? RDIV (e->frequency * REG_BR_PROB_BASE,
1352 e->frequency + e2->frequency)
1353 : REG_BR_PROB_BASE / 2,
1354 e->count, e->count + e2->count);
1355 e->speculative = false;
1356 e->caller->set_call_stmt_including_clones (e->call_stmt, new_stmt,
1357 false);
1359 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1360 processed call stmt. */
1361 if (gimple_call_with_bounds_p (new_stmt)
1362 && gimple_call_lhs (new_stmt)
1363 && chkp_retbnd_call_by_val (gimple_call_lhs (e2->call_stmt)))
1365 tree dresult = gimple_call_lhs (new_stmt);
1366 tree iresult = gimple_call_lhs (e2->call_stmt);
1367 gcall *dbndret = chkp_retbnd_call_by_val (dresult);
1368 gcall *ibndret = chkp_retbnd_call_by_val (iresult);
1369 struct cgraph_edge *iedge
1370 = e2->caller->cgraph_node::get_edge (ibndret);
1371 struct cgraph_edge *dedge;
1373 if (dbndret)
1375 dedge = iedge->caller->create_edge (iedge->callee,
1376 dbndret, e->count,
1377 e->frequency);
1378 dedge->frequency = compute_call_stmt_bb_frequency
1379 (dedge->caller->decl, gimple_bb (dedge->call_stmt));
1381 iedge->frequency = compute_call_stmt_bb_frequency
1382 (iedge->caller->decl, gimple_bb (iedge->call_stmt));
1385 e->frequency = compute_call_stmt_bb_frequency
1386 (e->caller->decl, gimple_bb (e->call_stmt));
1387 e2->frequency = compute_call_stmt_bb_frequency
1388 (e2->caller->decl, gimple_bb (e2->call_stmt));
1389 e2->speculative = false;
1390 ref->speculative = false;
1391 ref->stmt = NULL;
1392 /* Indirect edges are not both in the call site hash.
1393 get it updated. */
1394 if (e->caller->call_site_hash)
1395 cgraph_update_edge_in_call_site_hash (e2);
1396 pop_cfun ();
1397 /* Continue redirecting E to proper target. */
1401 /* We might propagate instrumented function pointer into
1402 not instrumented function and vice versa. In such a
1403 case we need to either fix function declaration or
1404 remove bounds from call statement. */
1405 if (flag_check_pointer_bounds && e->callee)
1406 skip_bounds = chkp_redirect_edge (e);
1408 if (e->indirect_unknown_callee
1409 || (decl == e->callee->decl
1410 && !skip_bounds))
1411 return e->call_stmt;
1413 #ifdef ENABLE_CHECKING
1414 if (decl)
1416 node = cgraph_node::get (decl);
1417 gcc_assert (!node || !node->clone.combined_args_to_skip);
1419 #endif
1421 if (symtab->dump_file)
1423 fprintf (symtab->dump_file, "updating call of %s/%i -> %s/%i: ",
1424 xstrdup_for_dump (e->caller->name ()), e->caller->order,
1425 xstrdup_for_dump (e->callee->name ()), e->callee->order);
1426 print_gimple_stmt (symtab->dump_file, e->call_stmt, 0, dump_flags);
1427 if (e->callee->clone.combined_args_to_skip)
1429 fprintf (symtab->dump_file, " combined args to skip: ");
1430 dump_bitmap (symtab->dump_file,
1431 e->callee->clone.combined_args_to_skip);
1435 if (e->callee->clone.combined_args_to_skip
1436 || skip_bounds)
1438 int lp_nr;
1440 new_stmt = e->call_stmt;
1441 if (e->callee->clone.combined_args_to_skip)
1442 new_stmt
1443 = gimple_call_copy_skip_args (new_stmt,
1444 e->callee->clone.combined_args_to_skip);
1445 if (skip_bounds)
1446 new_stmt = chkp_copy_call_skip_bounds (new_stmt);
1448 gimple_call_set_fndecl (new_stmt, e->callee->decl);
1449 gimple_call_set_fntype (new_stmt, gimple_call_fntype (e->call_stmt));
1451 if (gimple_vdef (new_stmt)
1452 && TREE_CODE (gimple_vdef (new_stmt)) == SSA_NAME)
1453 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt)) = new_stmt;
1455 gsi = gsi_for_stmt (e->call_stmt);
1456 gsi_replace (&gsi, new_stmt, false);
1457 /* We need to defer cleaning EH info on the new statement to
1458 fixup-cfg. We may not have dominator information at this point
1459 and thus would end up with unreachable blocks and have no way
1460 to communicate that we need to run CFG cleanup then. */
1461 lp_nr = lookup_stmt_eh_lp (e->call_stmt);
1462 if (lp_nr != 0)
1464 remove_stmt_from_eh_lp (e->call_stmt);
1465 add_stmt_to_eh_lp (new_stmt, lp_nr);
1468 else
1470 new_stmt = e->call_stmt;
1471 gimple_call_set_fndecl (new_stmt, e->callee->decl);
1472 update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt);
1475 /* If the call becomes noreturn, remove the LHS if possible. */
1476 if (lhs
1477 && (gimple_call_flags (new_stmt) & ECF_NORETURN)
1478 && TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (lhs))) == INTEGER_CST)
1480 if (TREE_CODE (lhs) == SSA_NAME)
1482 tree var = create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e->caller->decl),
1483 TREE_TYPE (lhs), NULL);
1484 var = get_or_create_ssa_default_def
1485 (DECL_STRUCT_FUNCTION (e->caller->decl), var);
1486 gimple set_stmt = gimple_build_assign (lhs, var);
1487 gsi = gsi_for_stmt (new_stmt);
1488 gsi_insert_before_without_update (&gsi, set_stmt, GSI_SAME_STMT);
1489 update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), set_stmt);
1491 gimple_call_set_lhs (new_stmt, NULL_TREE);
1492 update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt);
1495 /* If new callee has no static chain, remove it. */
1496 if (gimple_call_chain (new_stmt) && !DECL_STATIC_CHAIN (e->callee->decl))
1498 gimple_call_set_chain (new_stmt, NULL);
1499 update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt);
1502 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e->caller->decl),
1503 new_stmt);
1505 e->caller->set_call_stmt_including_clones (e->call_stmt, new_stmt, false);
1507 if (symtab->dump_file)
1509 fprintf (symtab->dump_file, " updated to:");
1510 print_gimple_stmt (symtab->dump_file, e->call_stmt, 0, dump_flags);
1512 return new_stmt;
1515 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1516 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1517 of OLD_STMT if it was previously call statement.
1518 If NEW_STMT is NULL, the call has been dropped without any
1519 replacement. */
1521 static void
1522 cgraph_update_edges_for_call_stmt_node (cgraph_node *node,
1523 gimple old_stmt, tree old_call,
1524 gimple new_stmt)
1526 tree new_call = (new_stmt && is_gimple_call (new_stmt))
1527 ? gimple_call_fndecl (new_stmt) : 0;
1529 /* We are seeing indirect calls, then there is nothing to update. */
1530 if (!new_call && !old_call)
1531 return;
1532 /* See if we turned indirect call into direct call or folded call to one builtin
1533 into different builtin. */
1534 if (old_call != new_call)
1536 cgraph_edge *e = node->get_edge (old_stmt);
1537 cgraph_edge *ne = NULL;
1538 gcov_type count;
1539 int frequency;
1541 if (e)
1543 /* Keep calls marked as dead dead. */
1544 if (new_stmt && is_gimple_call (new_stmt) && e->callee
1545 && DECL_BUILT_IN_CLASS (e->callee->decl) == BUILT_IN_NORMAL
1546 && DECL_FUNCTION_CODE (e->callee->decl) == BUILT_IN_UNREACHABLE)
1548 node->get_edge (old_stmt)->set_call_stmt
1549 (as_a <gcall *> (new_stmt));
1550 return;
1552 /* See if the edge is already there and has the correct callee. It
1553 might be so because of indirect inlining has already updated
1554 it. We also might've cloned and redirected the edge. */
1555 if (new_call && e->callee)
1557 cgraph_node *callee = e->callee;
1558 while (callee)
1560 if (callee->decl == new_call
1561 || callee->former_clone_of == new_call)
1563 e->set_call_stmt (as_a <gcall *> (new_stmt));
1564 return;
1566 callee = callee->clone_of;
1570 /* Otherwise remove edge and create new one; we can't simply redirect
1571 since function has changed, so inline plan and other information
1572 attached to edge is invalid. */
1573 count = e->count;
1574 frequency = e->frequency;
1575 if (e->indirect_unknown_callee || e->inline_failed)
1576 e->remove ();
1577 else
1578 e->callee->remove_symbol_and_inline_clones ();
1580 else if (new_call)
1582 /* We are seeing new direct call; compute profile info based on BB. */
1583 basic_block bb = gimple_bb (new_stmt);
1584 count = bb->count;
1585 frequency = compute_call_stmt_bb_frequency (current_function_decl,
1586 bb);
1589 if (new_call)
1591 ne = node->create_edge (cgraph_node::get_create (new_call),
1592 as_a <gcall *> (new_stmt), count,
1593 frequency);
1594 gcc_assert (ne->inline_failed);
1597 /* We only updated the call stmt; update pointer in cgraph edge.. */
1598 else if (old_stmt != new_stmt)
1599 node->get_edge (old_stmt)->set_call_stmt (as_a <gcall *> (new_stmt));
1602 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1603 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1604 of OLD_STMT before it was updated (updating can happen inplace). */
1606 void
1607 cgraph_update_edges_for_call_stmt (gimple old_stmt, tree old_decl, gimple new_stmt)
1609 cgraph_node *orig = cgraph_node::get (cfun->decl);
1610 cgraph_node *node;
1612 gcc_checking_assert (orig);
1613 cgraph_update_edges_for_call_stmt_node (orig, old_stmt, old_decl, new_stmt);
1614 if (orig->clones)
1615 for (node = orig->clones; node != orig;)
1617 cgraph_update_edges_for_call_stmt_node (node, old_stmt, old_decl, new_stmt);
1618 if (node->clones)
1619 node = node->clones;
1620 else if (node->next_sibling_clone)
1621 node = node->next_sibling_clone;
1622 else
1624 while (node != orig && !node->next_sibling_clone)
1625 node = node->clone_of;
1626 if (node != orig)
1627 node = node->next_sibling_clone;
1633 /* Remove all callees from the node. */
1635 void
1636 cgraph_node::remove_callees (void)
1638 cgraph_edge *e, *f;
1640 /* It is sufficient to remove the edges from the lists of callers of
1641 the callees. The callee list of the node can be zapped with one
1642 assignment. */
1643 for (e = callees; e; e = f)
1645 f = e->next_callee;
1646 symtab->call_edge_removal_hooks (e);
1647 if (!e->indirect_unknown_callee)
1648 e->remove_callee ();
1649 symtab->free_edge (e);
1651 for (e = indirect_calls; e; e = f)
1653 f = e->next_callee;
1654 symtab->call_edge_removal_hooks (e);
1655 if (!e->indirect_unknown_callee)
1656 e->remove_callee ();
1657 symtab->free_edge (e);
1659 indirect_calls = NULL;
1660 callees = NULL;
1661 if (call_site_hash)
1663 call_site_hash->empty ();
1664 call_site_hash = NULL;
1668 /* Remove all callers from the node. */
1670 void
1671 cgraph_node::remove_callers (void)
1673 cgraph_edge *e, *f;
1675 /* It is sufficient to remove the edges from the lists of callees of
1676 the callers. The caller list of the node can be zapped with one
1677 assignment. */
1678 for (e = callers; e; e = f)
1680 f = e->next_caller;
1681 symtab->call_edge_removal_hooks (e);
1682 e->remove_caller ();
1683 symtab->free_edge (e);
1685 callers = NULL;
1688 /* Helper function for cgraph_release_function_body and free_lang_data.
1689 It releases body from function DECL without having to inspect its
1690 possibly non-existent symtab node. */
1692 void
1693 release_function_body (tree decl)
1695 if (DECL_STRUCT_FUNCTION (decl))
1697 if (DECL_STRUCT_FUNCTION (decl)->cfg
1698 || DECL_STRUCT_FUNCTION (decl)->gimple_df)
1700 push_cfun (DECL_STRUCT_FUNCTION (decl));
1701 if (cfun->cfg
1702 && current_loops)
1704 cfun->curr_properties &= ~PROP_loops;
1705 loop_optimizer_finalize ();
1707 if (cfun->gimple_df)
1709 delete_tree_ssa ();
1710 delete_tree_cfg_annotations ();
1711 cfun->eh = NULL;
1713 if (cfun->cfg)
1715 gcc_assert (!dom_info_available_p (CDI_DOMINATORS));
1716 gcc_assert (!dom_info_available_p (CDI_POST_DOMINATORS));
1717 clear_edges ();
1718 cfun->cfg = NULL;
1720 if (cfun->value_histograms)
1721 free_histograms ();
1722 pop_cfun ();
1724 gimple_set_body (decl, NULL);
1725 /* Struct function hangs a lot of data that would leak if we didn't
1726 removed all pointers to it. */
1727 ggc_free (DECL_STRUCT_FUNCTION (decl));
1728 DECL_STRUCT_FUNCTION (decl) = NULL;
1730 DECL_SAVED_TREE (decl) = NULL;
1733 /* Release memory used to represent body of function.
1734 Use this only for functions that are released before being translated to
1735 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1736 are free'd in final.c via free_after_compilation().
1737 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1739 void
1740 cgraph_node::release_body (bool keep_arguments)
1742 ipa_transforms_to_apply.release ();
1743 if (!used_as_abstract_origin && symtab->state != PARSING)
1745 DECL_RESULT (decl) = NULL;
1747 if (!keep_arguments)
1748 DECL_ARGUMENTS (decl) = NULL;
1750 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1751 of its associated function function declaration because it's
1752 needed to emit debug info later. */
1753 if (!used_as_abstract_origin && DECL_INITIAL (decl))
1754 DECL_INITIAL (decl) = error_mark_node;
1755 release_function_body (decl);
1756 if (lto_file_data)
1758 lto_free_function_in_decl_state_for_node (this);
1759 lto_file_data = NULL;
1763 /* Remove function from symbol table. */
1765 void
1766 cgraph_node::remove (void)
1768 cgraph_node *n;
1769 int uid = this->uid;
1771 symtab->call_cgraph_removal_hooks (this);
1772 remove_callers ();
1773 remove_callees ();
1774 ipa_transforms_to_apply.release ();
1776 /* Incremental inlining access removed nodes stored in the postorder list.
1778 force_output = false;
1779 forced_by_abi = false;
1780 for (n = nested; n; n = n->next_nested)
1781 n->origin = NULL;
1782 nested = NULL;
1783 if (origin)
1785 cgraph_node **node2 = &origin->nested;
1787 while (*node2 != this)
1788 node2 = &(*node2)->next_nested;
1789 *node2 = next_nested;
1791 unregister ();
1792 if (prev_sibling_clone)
1793 prev_sibling_clone->next_sibling_clone = next_sibling_clone;
1794 else if (clone_of)
1795 clone_of->clones = next_sibling_clone;
1796 if (next_sibling_clone)
1797 next_sibling_clone->prev_sibling_clone = prev_sibling_clone;
1798 if (clones)
1800 cgraph_node *n, *next;
1802 if (clone_of)
1804 for (n = clones; n->next_sibling_clone; n = n->next_sibling_clone)
1805 n->clone_of = clone_of;
1806 n->clone_of = clone_of;
1807 n->next_sibling_clone = clone_of->clones;
1808 if (clone_of->clones)
1809 clone_of->clones->prev_sibling_clone = n;
1810 clone_of->clones = clones;
1812 else
1814 /* We are removing node with clones. This makes clones inconsistent,
1815 but assume they will be removed subsequently and just keep clone
1816 tree intact. This can happen in unreachable function removal since
1817 we remove unreachable functions in random order, not by bottom-up
1818 walk of clone trees. */
1819 for (n = clones; n; n = next)
1821 next = n->next_sibling_clone;
1822 n->next_sibling_clone = NULL;
1823 n->prev_sibling_clone = NULL;
1824 n->clone_of = NULL;
1829 /* While all the clones are removed after being proceeded, the function
1830 itself is kept in the cgraph even after it is compiled. Check whether
1831 we are done with this body and reclaim it proactively if this is the case.
1833 if (symtab->state != LTO_STREAMING)
1835 n = cgraph_node::get (decl);
1836 if (!n
1837 || (!n->clones && !n->clone_of && !n->global.inlined_to
1838 && ((symtab->global_info_ready || in_lto_p)
1839 && (TREE_ASM_WRITTEN (n->decl)
1840 || DECL_EXTERNAL (n->decl)
1841 || !n->analyzed
1842 || (!flag_wpa && n->in_other_partition)))))
1843 release_body ();
1845 else
1847 lto_free_function_in_decl_state_for_node (this);
1848 lto_file_data = NULL;
1851 decl = NULL;
1852 if (call_site_hash)
1854 call_site_hash->empty ();
1855 call_site_hash = NULL;
1858 if (instrumented_version)
1860 instrumented_version->instrumented_version = NULL;
1861 instrumented_version = NULL;
1864 symtab->release_symbol (this, uid);
1867 /* Likewise indicate that a node is having address taken. */
1869 void
1870 cgraph_node::mark_address_taken (void)
1872 /* Indirect inlining can figure out that all uses of the address are
1873 inlined. */
1874 if (global.inlined_to)
1876 gcc_assert (cfun->after_inlining);
1877 gcc_assert (callers->indirect_inlining_edge);
1878 return;
1880 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1881 IPA_REF_ADDR reference exists (and thus it should be set on node
1882 representing alias we take address of) and as a test whether address
1883 of the object was taken (and thus it should be set on node alias is
1884 referring to). We should remove the first use and the remove the
1885 following set. */
1886 address_taken = 1;
1887 cgraph_node *node = ultimate_alias_target ();
1888 node->address_taken = 1;
1891 /* Return local info for the compiled function. */
1893 cgraph_local_info *
1894 cgraph_node::local_info (tree decl)
1896 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
1897 cgraph_node *node = get (decl);
1898 if (!node)
1899 return NULL;
1900 return &node->ultimate_alias_target ()->local;
1903 /* Return local info for the compiled function. */
1905 cgraph_rtl_info *
1906 cgraph_node::rtl_info (tree decl)
1908 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
1909 cgraph_node *node = get (decl);
1910 if (!node)
1911 return NULL;
1912 node = node->ultimate_alias_target ();
1913 if (node->decl != current_function_decl
1914 && !TREE_ASM_WRITTEN (node->decl))
1915 return NULL;
1916 /* Allocate if it doesnt exist. */
1917 if (node->ultimate_alias_target ()->rtl == NULL)
1918 node->ultimate_alias_target ()->rtl = ggc_cleared_alloc<cgraph_rtl_info> ();
1919 return node->ultimate_alias_target ()->rtl;
1922 /* Return a string describing the failure REASON. */
1924 const char*
1925 cgraph_inline_failed_string (cgraph_inline_failed_t reason)
1927 #undef DEFCIFCODE
1928 #define DEFCIFCODE(code, type, string) string,
1930 static const char *cif_string_table[CIF_N_REASONS] = {
1931 #include "cif-code.def"
1934 /* Signedness of an enum type is implementation defined, so cast it
1935 to unsigned before testing. */
1936 gcc_assert ((unsigned) reason < CIF_N_REASONS);
1937 return cif_string_table[reason];
1940 /* Return a type describing the failure REASON. */
1942 cgraph_inline_failed_type_t
1943 cgraph_inline_failed_type (cgraph_inline_failed_t reason)
1945 #undef DEFCIFCODE
1946 #define DEFCIFCODE(code, type, string) type,
1948 static cgraph_inline_failed_type_t cif_type_table[CIF_N_REASONS] = {
1949 #include "cif-code.def"
1952 /* Signedness of an enum type is implementation defined, so cast it
1953 to unsigned before testing. */
1954 gcc_assert ((unsigned) reason < CIF_N_REASONS);
1955 return cif_type_table[reason];
1958 /* Names used to print out the availability enum. */
1959 const char * const cgraph_availability_names[] =
1960 {"unset", "not_available", "overwritable", "available", "local"};
1962 /* Output flags of edge to a file F. */
1964 void
1965 cgraph_edge::dump_edge_flags (FILE *f)
1967 if (speculative)
1968 fprintf (f, "(speculative) ");
1969 if (!inline_failed)
1970 fprintf (f, "(inlined) ");
1971 if (indirect_inlining_edge)
1972 fprintf (f, "(indirect_inlining) ");
1973 if (count)
1974 fprintf (f, "(%" PRId64"x) ", (int64_t)count);
1975 if (frequency)
1976 fprintf (f, "(%.2f per call) ", frequency / (double)CGRAPH_FREQ_BASE);
1977 if (can_throw_external)
1978 fprintf (f, "(can throw external) ");
1981 /* Dump call graph node to file F. */
1983 void
1984 cgraph_node::dump (FILE *f)
1986 cgraph_edge *edge;
1988 dump_base (f);
1990 if (global.inlined_to)
1991 fprintf (f, " Function %s/%i is inline copy in %s/%i\n",
1992 xstrdup_for_dump (name ()),
1993 order,
1994 xstrdup_for_dump (global.inlined_to->name ()),
1995 global.inlined_to->order);
1996 if (clone_of)
1997 fprintf (f, " Clone of %s/%i\n",
1998 clone_of->asm_name (),
1999 clone_of->order);
2000 if (symtab->function_flags_ready)
2001 fprintf (f, " Availability: %s\n",
2002 cgraph_availability_names [get_availability ()]);
2004 if (profile_id)
2005 fprintf (f, " Profile id: %i\n",
2006 profile_id);
2007 fprintf (f, " First run: %i\n", tp_first_run);
2008 fprintf (f, " Function flags:");
2009 if (count)
2010 fprintf (f, " executed %" PRId64"x",
2011 (int64_t)count);
2012 if (origin)
2013 fprintf (f, " nested in: %s", origin->asm_name ());
2014 if (gimple_has_body_p (decl))
2015 fprintf (f, " body");
2016 if (process)
2017 fprintf (f, " process");
2018 if (local.local)
2019 fprintf (f, " local");
2020 if (local.redefined_extern_inline)
2021 fprintf (f, " redefined_extern_inline");
2022 if (only_called_at_startup)
2023 fprintf (f, " only_called_at_startup");
2024 if (only_called_at_exit)
2025 fprintf (f, " only_called_at_exit");
2026 if (tm_clone)
2027 fprintf (f, " tm_clone");
2028 if (icf_merged)
2029 fprintf (f, " icf_merged");
2030 if (nonfreeing_fn)
2031 fprintf (f, " nonfreeing_fn");
2032 if (DECL_STATIC_CONSTRUCTOR (decl))
2033 fprintf (f," static_constructor (priority:%i)", get_init_priority ());
2034 if (DECL_STATIC_DESTRUCTOR (decl))
2035 fprintf (f," static_destructor (priority:%i)", get_fini_priority ());
2036 if (frequency == NODE_FREQUENCY_HOT)
2037 fprintf (f, " hot");
2038 if (frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED)
2039 fprintf (f, " unlikely_executed");
2040 if (frequency == NODE_FREQUENCY_EXECUTED_ONCE)
2041 fprintf (f, " executed_once");
2042 if (only_called_at_startup)
2043 fprintf (f, " only_called_at_startup");
2044 if (only_called_at_exit)
2045 fprintf (f, " only_called_at_exit");
2046 if (opt_for_fn (decl, optimize_size))
2047 fprintf (f, " optimize_size");
2048 if (parallelized_function)
2049 fprintf (f, " parallelized_function");
2051 fprintf (f, "\n");
2053 if (thunk.thunk_p)
2055 fprintf (f, " Thunk");
2056 if (thunk.alias)
2057 fprintf (f, " of %s (asm: %s)",
2058 lang_hooks.decl_printable_name (thunk.alias, 2),
2059 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk.alias)));
2060 fprintf (f, " fixed offset %i virtual value %i has "
2061 "virtual offset %i)\n",
2062 (int)thunk.fixed_offset,
2063 (int)thunk.virtual_value,
2064 (int)thunk.virtual_offset_p);
2066 if (alias && thunk.alias
2067 && DECL_P (thunk.alias))
2069 fprintf (f, " Alias of %s",
2070 lang_hooks.decl_printable_name (thunk.alias, 2));
2071 if (DECL_ASSEMBLER_NAME_SET_P (thunk.alias))
2072 fprintf (f, " (asm: %s)",
2073 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk.alias)));
2074 fprintf (f, "\n");
2077 fprintf (f, " Called by: ");
2079 for (edge = callers; edge; edge = edge->next_caller)
2081 fprintf (f, "%s/%i ", edge->caller->asm_name (),
2082 edge->caller->order);
2083 edge->dump_edge_flags (f);
2086 fprintf (f, "\n Calls: ");
2087 for (edge = callees; edge; edge = edge->next_callee)
2089 fprintf (f, "%s/%i ", edge->callee->asm_name (),
2090 edge->callee->order);
2091 edge->dump_edge_flags (f);
2093 fprintf (f, "\n");
2095 for (edge = indirect_calls; edge; edge = edge->next_callee)
2097 if (edge->indirect_info->polymorphic)
2099 fprintf (f, " Polymorphic indirect call of type ");
2100 print_generic_expr (f, edge->indirect_info->otr_type, TDF_SLIM);
2101 fprintf (f, " token:%i", (int) edge->indirect_info->otr_token);
2103 else
2104 fprintf (f, " Indirect call");
2105 edge->dump_edge_flags (f);
2106 if (edge->indirect_info->param_index != -1)
2108 fprintf (f, " of param:%i", edge->indirect_info->param_index);
2109 if (edge->indirect_info->agg_contents)
2110 fprintf (f, " loaded from %s %s at offset %i",
2111 edge->indirect_info->member_ptr ? "member ptr" : "aggregate",
2112 edge->indirect_info->by_ref ? "passed by reference":"",
2113 (int)edge->indirect_info->offset);
2114 if (edge->indirect_info->vptr_changed)
2115 fprintf (f, " (vptr maybe changed)");
2117 fprintf (f, "\n");
2118 if (edge->indirect_info->polymorphic)
2119 edge->indirect_info->context.dump (f);
2122 if (instrumentation_clone)
2123 fprintf (f, " Is instrumented version.\n");
2124 else if (instrumented_version)
2125 fprintf (f, " Has instrumented version.\n");
2128 /* Dump call graph node NODE to stderr. */
2130 DEBUG_FUNCTION void
2131 cgraph_node::debug (void)
2133 dump (stderr);
2136 /* Dump the callgraph to file F. */
2138 void
2139 cgraph_node::dump_cgraph (FILE *f)
2141 cgraph_node *node;
2143 fprintf (f, "callgraph:\n\n");
2144 FOR_EACH_FUNCTION (node)
2145 node->dump (f);
2148 /* Return true when the DECL can possibly be inlined. */
2150 bool
2151 cgraph_function_possibly_inlined_p (tree decl)
2153 if (!symtab->global_info_ready)
2154 return !DECL_UNINLINABLE (decl);
2155 return DECL_POSSIBLY_INLINED (decl);
2158 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2159 void
2160 cgraph_node::unnest (void)
2162 cgraph_node **node2 = &origin->nested;
2163 gcc_assert (origin);
2165 while (*node2 != this)
2166 node2 = &(*node2)->next_nested;
2167 *node2 = next_nested;
2168 origin = NULL;
2171 /* Return function availability. See cgraph.h for description of individual
2172 return values. */
2173 enum availability
2174 cgraph_node::get_availability (void)
2176 enum availability avail;
2177 if (!analyzed)
2178 avail = AVAIL_NOT_AVAILABLE;
2179 else if (local.local)
2180 avail = AVAIL_LOCAL;
2181 else if (alias && weakref)
2182 ultimate_alias_target (&avail);
2183 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl)))
2184 avail = AVAIL_INTERPOSABLE;
2185 else if (!externally_visible)
2186 avail = AVAIL_AVAILABLE;
2187 /* Inline functions are safe to be analyzed even if their symbol can
2188 be overwritten at runtime. It is not meaningful to enforce any sane
2189 behaviour on replacing inline function by different body. */
2190 else if (DECL_DECLARED_INLINE_P (decl))
2191 avail = AVAIL_AVAILABLE;
2193 /* If the function can be overwritten, return OVERWRITABLE. Take
2194 care at least of two notable extensions - the COMDAT functions
2195 used to share template instantiations in C++ (this is symmetric
2196 to code cp_cannot_inline_tree_fn and probably shall be shared and
2197 the inlinability hooks completely eliminated).
2199 ??? Does the C++ one definition rule allow us to always return
2200 AVAIL_AVAILABLE here? That would be good reason to preserve this
2201 bit. */
2203 else if (decl_replaceable_p (decl) && !DECL_EXTERNAL (decl))
2204 avail = AVAIL_INTERPOSABLE;
2205 else avail = AVAIL_AVAILABLE;
2207 return avail;
2210 /* Worker for cgraph_node_can_be_local_p. */
2211 static bool
2212 cgraph_node_cannot_be_local_p_1 (cgraph_node *node, void *)
2214 return !(!node->force_output
2215 && ((DECL_COMDAT (node->decl)
2216 && !node->forced_by_abi
2217 && !node->used_from_object_file_p ()
2218 && !node->same_comdat_group)
2219 || !node->externally_visible));
2222 /* Return true if cgraph_node can be made local for API change.
2223 Extern inline functions and C++ COMDAT functions can be made local
2224 at the expense of possible code size growth if function is used in multiple
2225 compilation units. */
2226 bool
2227 cgraph_node::can_be_local_p (void)
2229 return (!address_taken
2230 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1,
2231 NULL, true));
2234 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2235 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2236 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2237 skipped. */
2238 bool
2239 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback)
2240 (cgraph_node *, void *),
2241 void *data,
2242 bool include_overwritable,
2243 bool exclude_virtual_thunks)
2245 cgraph_edge *e;
2246 ipa_ref *ref;
2248 if (callback (this, data))
2249 return true;
2250 FOR_EACH_ALIAS (this, ref)
2252 cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring);
2253 if (include_overwritable
2254 || alias->get_availability () > AVAIL_INTERPOSABLE)
2255 if (alias->call_for_symbol_thunks_and_aliases (callback, data,
2256 include_overwritable,
2257 exclude_virtual_thunks))
2258 return true;
2260 for (e = callers; e; e = e->next_caller)
2261 if (e->caller->thunk.thunk_p
2262 && (include_overwritable
2263 || e->caller->get_availability () > AVAIL_INTERPOSABLE)
2264 && !(exclude_virtual_thunks
2265 && e->caller->thunk.virtual_offset_p))
2266 if (e->caller->call_for_symbol_thunks_and_aliases (callback, data,
2267 include_overwritable,
2268 exclude_virtual_thunks))
2269 return true;
2271 return false;
2274 /* Worker to bring NODE local. */
2276 bool
2277 cgraph_node::make_local (cgraph_node *node, void *)
2279 gcc_checking_assert (node->can_be_local_p ());
2280 if (DECL_COMDAT (node->decl) || DECL_EXTERNAL (node->decl))
2282 node->make_decl_local ();
2283 node->set_section (NULL);
2284 node->set_comdat_group (NULL);
2285 node->externally_visible = false;
2286 node->forced_by_abi = false;
2287 node->local.local = true;
2288 node->set_section (NULL);
2289 node->unique_name = (node->resolution == LDPR_PREVAILING_DEF_IRONLY
2290 || node->resolution == LDPR_PREVAILING_DEF_IRONLY_EXP);
2291 node->resolution = LDPR_PREVAILING_DEF_IRONLY;
2292 gcc_assert (node->get_availability () == AVAIL_LOCAL);
2294 return false;
2297 /* Bring cgraph node local. */
2299 void
2300 cgraph_node::make_local (void)
2302 call_for_symbol_thunks_and_aliases (cgraph_node::make_local, NULL, true);
2305 /* Worker to set nothrow flag. */
2307 static bool
2308 cgraph_set_nothrow_flag_1 (cgraph_node *node, void *data)
2310 cgraph_edge *e;
2312 TREE_NOTHROW (node->decl) = data != NULL;
2314 if (data != NULL)
2315 for (e = node->callers; e; e = e->next_caller)
2316 e->can_throw_external = false;
2317 return false;
2320 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2321 if any to NOTHROW. */
2323 void
2324 cgraph_node::set_nothrow_flag (bool nothrow)
2326 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1,
2327 (void *)(size_t)nothrow, false);
2330 /* Worker to set const flag. */
2332 static bool
2333 cgraph_set_const_flag_1 (cgraph_node *node, void *data)
2335 /* Static constructors and destructors without a side effect can be
2336 optimized out. */
2337 if (data && !((size_t)data & 2))
2339 if (DECL_STATIC_CONSTRUCTOR (node->decl))
2340 DECL_STATIC_CONSTRUCTOR (node->decl) = 0;
2341 if (DECL_STATIC_DESTRUCTOR (node->decl))
2342 DECL_STATIC_DESTRUCTOR (node->decl) = 0;
2344 TREE_READONLY (node->decl) = data != NULL;
2345 DECL_LOOPING_CONST_OR_PURE_P (node->decl) = ((size_t)data & 2) != 0;
2346 return false;
2349 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2350 if any to READONLY. */
2352 void
2353 cgraph_node::set_const_flag (bool readonly, bool looping)
2355 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1,
2356 (void *)(size_t)(readonly + (int)looping * 2),
2357 false, true);
2360 /* Worker to set pure flag. */
2362 static bool
2363 cgraph_set_pure_flag_1 (cgraph_node *node, void *data)
2365 /* Static constructors and destructors without a side effect can be
2366 optimized out. */
2367 if (data && !((size_t)data & 2))
2369 if (DECL_STATIC_CONSTRUCTOR (node->decl))
2370 DECL_STATIC_CONSTRUCTOR (node->decl) = 0;
2371 if (DECL_STATIC_DESTRUCTOR (node->decl))
2372 DECL_STATIC_DESTRUCTOR (node->decl) = 0;
2374 DECL_PURE_P (node->decl) = data != NULL;
2375 DECL_LOOPING_CONST_OR_PURE_P (node->decl) = ((size_t)data & 2) != 0;
2376 return false;
2379 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2380 if any to PURE. */
2382 void
2383 cgraph_node::set_pure_flag (bool pure, bool looping)
2385 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1,
2386 (void *)(size_t)(pure + (int)looping * 2),
2387 false, true);
2390 /* Return true when cgraph_node can not return or throw and thus
2391 it is safe to ignore its side effects for IPA analysis. */
2393 bool
2394 cgraph_node::cannot_return_p (void)
2396 int flags = flags_from_decl_or_type (decl);
2397 if (!opt_for_fn (decl, flag_exceptions))
2398 return (flags & ECF_NORETURN) != 0;
2399 else
2400 return ((flags & (ECF_NORETURN | ECF_NOTHROW))
2401 == (ECF_NORETURN | ECF_NOTHROW));
2404 /* Return true when call of edge can not lead to return from caller
2405 and thus it is safe to ignore its side effects for IPA analysis
2406 when computing side effects of the caller.
2407 FIXME: We could actually mark all edges that have no reaching
2408 patch to the exit block or throw to get better results. */
2409 bool
2410 cgraph_edge::cannot_lead_to_return_p (void)
2412 if (caller->cannot_return_p ())
2413 return true;
2414 if (indirect_unknown_callee)
2416 int flags = indirect_info->ecf_flags;
2417 if (!opt_for_fn (caller->decl, flag_exceptions))
2418 return (flags & ECF_NORETURN) != 0;
2419 else
2420 return ((flags & (ECF_NORETURN | ECF_NOTHROW))
2421 == (ECF_NORETURN | ECF_NOTHROW));
2423 else
2424 return callee->cannot_return_p ();
2427 /* Return true if the call can be hot. */
2429 bool
2430 cgraph_edge::maybe_hot_p (void)
2432 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2433 if (profile_info
2434 && opt_for_fn (caller->decl, flag_branch_probabilities)
2435 && !maybe_hot_count_p (NULL, count))
2436 return false;
2437 if (caller->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED
2438 || (callee
2439 && callee->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED))
2440 return false;
2441 if (caller->frequency > NODE_FREQUENCY_UNLIKELY_EXECUTED
2442 && (callee
2443 && callee->frequency <= NODE_FREQUENCY_EXECUTED_ONCE))
2444 return false;
2445 if (opt_for_fn (caller->decl, optimize_size))
2446 return false;
2447 if (caller->frequency == NODE_FREQUENCY_HOT)
2448 return true;
2449 if (caller->frequency == NODE_FREQUENCY_EXECUTED_ONCE
2450 && frequency < CGRAPH_FREQ_BASE * 3 / 2)
2451 return false;
2452 if (opt_for_fn (caller->decl, flag_guess_branch_prob))
2454 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION) == 0
2455 || frequency <= (CGRAPH_FREQ_BASE
2456 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION)))
2457 return false;
2459 return true;
2462 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2464 static bool
2465 nonremovable_p (cgraph_node *node, void *)
2467 return !node->can_remove_if_no_direct_calls_and_refs_p ();
2470 /* Return true if whole comdat group can be removed if there are no direct
2471 calls to THIS. */
2473 bool
2474 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline)
2476 struct ipa_ref *ref;
2478 /* For local symbols or non-comdat group it is the same as
2479 can_remove_if_no_direct_calls_p. */
2480 if (!externally_visible || !same_comdat_group)
2482 if (DECL_EXTERNAL (decl))
2483 return true;
2484 if (address_taken)
2485 return false;
2486 return !call_for_symbol_and_aliases (nonremovable_p, NULL, true);
2489 if (will_inline && address_taken)
2490 return false;
2492 /* Otheriwse check if we can remove the symbol itself and then verify
2493 that only uses of the comdat groups are direct call to THIS
2494 or its aliases. */
2495 if (!can_remove_if_no_direct_calls_and_refs_p ())
2496 return false;
2498 /* Check that all refs come from within the comdat group. */
2499 for (int i = 0; iterate_referring (i, ref); i++)
2500 if (ref->referring->get_comdat_group () != get_comdat_group ())
2501 return false;
2503 struct cgraph_node *target = ultimate_alias_target ();
2504 for (cgraph_node *next = dyn_cast<cgraph_node *> (same_comdat_group);
2505 next != this; next = dyn_cast<cgraph_node *> (next->same_comdat_group))
2507 if (!externally_visible)
2508 continue;
2509 if (!next->alias
2510 && !next->can_remove_if_no_direct_calls_and_refs_p ())
2511 return false;
2513 /* If we see different symbol than THIS, be sure to check calls. */
2514 if (next->ultimate_alias_target () != target)
2515 for (cgraph_edge *e = next->callers; e; e = e->next_caller)
2516 if (e->caller->get_comdat_group () != get_comdat_group ()
2517 || will_inline)
2518 return false;
2520 /* If function is not being inlined, we care only about
2521 references outside of the comdat group. */
2522 if (!will_inline)
2523 for (int i = 0; next->iterate_referring (i, ref); i++)
2524 if (ref->referring->get_comdat_group () != get_comdat_group ())
2525 return false;
2527 return true;
2530 /* Return true when function cgraph_node can be expected to be removed
2531 from program when direct calls in this compilation unit are removed.
2533 As a special case COMDAT functions are
2534 cgraph_can_remove_if_no_direct_calls_p while the are not
2535 cgraph_only_called_directly_p (it is possible they are called from other
2536 unit)
2538 This function behaves as cgraph_only_called_directly_p because eliminating
2539 all uses of COMDAT function does not make it necessarily disappear from
2540 the program unless we are compiling whole program or we do LTO. In this
2541 case we know we win since dynamic linking will not really discard the
2542 linkonce section. */
2544 bool
2545 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2546 (bool will_inline)
2548 gcc_assert (!global.inlined_to);
2549 if (DECL_EXTERNAL (decl))
2550 return true;
2552 if (!in_lto_p && !flag_whole_program)
2554 /* If the symbol is in comdat group, we need to verify that whole comdat
2555 group becomes unreachable. Technically we could skip references from
2556 within the group, too. */
2557 if (!only_called_directly_p ())
2558 return false;
2559 if (same_comdat_group && externally_visible)
2561 struct cgraph_node *target = ultimate_alias_target ();
2563 if (will_inline && address_taken)
2564 return true;
2565 for (cgraph_node *next = dyn_cast<cgraph_node *> (same_comdat_group);
2566 next != this;
2567 next = dyn_cast<cgraph_node *> (next->same_comdat_group))
2569 if (!externally_visible)
2570 continue;
2571 if (!next->alias
2572 && !next->only_called_directly_p ())
2573 return false;
2575 /* If we see different symbol than THIS,
2576 be sure to check calls. */
2577 if (next->ultimate_alias_target () != target)
2578 for (cgraph_edge *e = next->callers; e; e = e->next_caller)
2579 if (e->caller->get_comdat_group () != get_comdat_group ()
2580 || will_inline)
2581 return false;
2584 return true;
2586 else
2587 return can_remove_if_no_direct_calls_p (will_inline);
2591 /* Worker for cgraph_only_called_directly_p. */
2593 static bool
2594 cgraph_not_only_called_directly_p_1 (cgraph_node *node, void *)
2596 return !node->only_called_directly_or_aliased_p ();
2599 /* Return true when function cgraph_node and all its aliases are only called
2600 directly.
2601 i.e. it is not externally visible, address was not taken and
2602 it is not used in any other non-standard way. */
2604 bool
2605 cgraph_node::only_called_directly_p (void)
2607 gcc_assert (ultimate_alias_target () == this);
2608 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1,
2609 NULL, true);
2613 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2615 static bool
2616 collect_callers_of_node_1 (cgraph_node *node, void *data)
2618 vec<cgraph_edge *> *redirect_callers = (vec<cgraph_edge *> *)data;
2619 cgraph_edge *cs;
2620 enum availability avail;
2621 node->ultimate_alias_target (&avail);
2623 if (avail > AVAIL_INTERPOSABLE)
2624 for (cs = node->callers; cs != NULL; cs = cs->next_caller)
2625 if (!cs->indirect_inlining_edge)
2626 redirect_callers->safe_push (cs);
2627 return false;
2630 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2631 cgraph_node (i.e. are not overwritable). */
2633 vec<cgraph_edge *>
2634 cgraph_node::collect_callers (void)
2636 vec<cgraph_edge *> redirect_callers = vNULL;
2637 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1,
2638 &redirect_callers, false);
2639 return redirect_callers;
2642 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2644 static bool
2645 clone_of_p (cgraph_node *node, cgraph_node *node2)
2647 bool skipped_thunk = false;
2648 node = node->ultimate_alias_target ();
2649 node2 = node2->ultimate_alias_target ();
2651 /* There are no virtual clones of thunks so check former_clone_of or if we
2652 might have skipped thunks because this adjustments are no longer
2653 necessary. */
2654 while (node->thunk.thunk_p)
2656 if (node2->former_clone_of == node->decl)
2657 return true;
2658 if (!node->thunk.this_adjusting)
2659 return false;
2660 node = node->callees->callee->ultimate_alias_target ();
2661 skipped_thunk = true;
2664 if (skipped_thunk)
2666 if (!node2->clone.args_to_skip
2667 || !bitmap_bit_p (node2->clone.args_to_skip, 0))
2668 return false;
2669 if (node2->former_clone_of == node->decl)
2670 return true;
2671 else if (!node2->clone_of)
2672 return false;
2675 while (node != node2 && node2)
2676 node2 = node2->clone_of;
2677 return node2 != NULL;
2680 /* Verify edge count and frequency. */
2682 bool
2683 cgraph_edge::verify_count_and_frequency ()
2685 bool error_found = false;
2686 if (count < 0)
2688 error ("caller edge count is negative");
2689 error_found = true;
2691 if (frequency < 0)
2693 error ("caller edge frequency is negative");
2694 error_found = true;
2696 if (frequency > CGRAPH_FREQ_MAX)
2698 error ("caller edge frequency is too large");
2699 error_found = true;
2701 return error_found;
2704 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2705 static void
2706 cgraph_debug_gimple_stmt (function *this_cfun, gimple stmt)
2708 bool fndecl_was_null = false;
2709 /* debug_gimple_stmt needs correct cfun */
2710 if (cfun != this_cfun)
2711 set_cfun (this_cfun);
2712 /* ...and an actual current_function_decl */
2713 if (!current_function_decl)
2715 current_function_decl = this_cfun->decl;
2716 fndecl_was_null = true;
2718 debug_gimple_stmt (stmt);
2719 if (fndecl_was_null)
2720 current_function_decl = NULL;
2723 /* Verify that call graph edge corresponds to DECL from the associated
2724 statement. Return true if the verification should fail. */
2726 bool
2727 cgraph_edge::verify_corresponds_to_fndecl (tree decl)
2729 cgraph_node *node;
2731 if (!decl || callee->global.inlined_to)
2732 return false;
2733 if (symtab->state == LTO_STREAMING)
2734 return false;
2735 node = cgraph_node::get (decl);
2737 /* We do not know if a node from a different partition is an alias or what it
2738 aliases and therefore cannot do the former_clone_of check reliably. When
2739 body_removed is set, we have lost all information about what was alias or
2740 thunk of and also cannot proceed. */
2741 if (!node
2742 || node->body_removed
2743 || node->in_other_partition
2744 || callee->icf_merged
2745 || callee->in_other_partition)
2746 return false;
2748 node = node->ultimate_alias_target ();
2750 /* Optimizers can redirect unreachable calls or calls triggering undefined
2751 behaviour to builtin_unreachable. */
2752 if (DECL_BUILT_IN_CLASS (callee->decl) == BUILT_IN_NORMAL
2753 && DECL_FUNCTION_CODE (callee->decl) == BUILT_IN_UNREACHABLE)
2754 return false;
2756 if (callee->former_clone_of != node->decl
2757 && (node != callee->ultimate_alias_target ())
2758 && !clone_of_p (node, callee))
2759 return true;
2760 else
2761 return false;
2764 /* Verify cgraph nodes of given cgraph node. */
2765 DEBUG_FUNCTION void
2766 cgraph_node::verify_node (void)
2768 cgraph_edge *e;
2769 function *this_cfun = DECL_STRUCT_FUNCTION (decl);
2770 basic_block this_block;
2771 gimple_stmt_iterator gsi;
2772 bool error_found = false;
2774 if (seen_error ())
2775 return;
2777 timevar_push (TV_CGRAPH_VERIFY);
2778 error_found |= verify_base ();
2779 for (e = callees; e; e = e->next_callee)
2780 if (e->aux)
2782 error ("aux field set for edge %s->%s",
2783 identifier_to_locale (e->caller->name ()),
2784 identifier_to_locale (e->callee->name ()));
2785 error_found = true;
2787 if (count < 0)
2789 error ("execution count is negative");
2790 error_found = true;
2792 if (global.inlined_to && same_comdat_group)
2794 error ("inline clone in same comdat group list");
2795 error_found = true;
2797 if (!definition && !in_other_partition && local.local)
2799 error ("local symbols must be defined");
2800 error_found = true;
2802 if (global.inlined_to && externally_visible)
2804 error ("externally visible inline clone");
2805 error_found = true;
2807 if (global.inlined_to && address_taken)
2809 error ("inline clone with address taken");
2810 error_found = true;
2812 if (global.inlined_to && force_output)
2814 error ("inline clone is forced to output");
2815 error_found = true;
2817 for (e = indirect_calls; e; e = e->next_callee)
2819 if (e->aux)
2821 error ("aux field set for indirect edge from %s",
2822 identifier_to_locale (e->caller->name ()));
2823 error_found = true;
2825 if (!e->indirect_unknown_callee
2826 || !e->indirect_info)
2828 error ("An indirect edge from %s is not marked as indirect or has "
2829 "associated indirect_info, the corresponding statement is: ",
2830 identifier_to_locale (e->caller->name ()));
2831 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
2832 error_found = true;
2835 bool check_comdat = comdat_local_p ();
2836 for (e = callers; e; e = e->next_caller)
2838 if (e->verify_count_and_frequency ())
2839 error_found = true;
2840 if (check_comdat
2841 && !in_same_comdat_group_p (e->caller))
2843 error ("comdat-local function called by %s outside its comdat",
2844 identifier_to_locale (e->caller->name ()));
2845 error_found = true;
2847 if (!e->inline_failed)
2849 if (global.inlined_to
2850 != (e->caller->global.inlined_to
2851 ? e->caller->global.inlined_to : e->caller))
2853 error ("inlined_to pointer is wrong");
2854 error_found = true;
2856 if (callers->next_caller)
2858 error ("multiple inline callers");
2859 error_found = true;
2862 else
2863 if (global.inlined_to)
2865 error ("inlined_to pointer set for noninline callers");
2866 error_found = true;
2869 for (e = callees; e; e = e->next_callee)
2871 if (e->verify_count_and_frequency ())
2872 error_found = true;
2873 if (gimple_has_body_p (e->caller->decl)
2874 && !e->caller->global.inlined_to
2875 && !e->speculative
2876 /* Optimized out calls are redirected to __builtin_unreachable. */
2877 && (e->frequency
2878 || e->callee->decl
2879 != builtin_decl_implicit (BUILT_IN_UNREACHABLE))
2880 && (e->frequency
2881 != compute_call_stmt_bb_frequency (e->caller->decl,
2882 gimple_bb (e->call_stmt))))
2884 error ("caller edge frequency %i does not match BB frequency %i",
2885 e->frequency,
2886 compute_call_stmt_bb_frequency (e->caller->decl,
2887 gimple_bb (e->call_stmt)));
2888 error_found = true;
2891 for (e = indirect_calls; e; e = e->next_callee)
2893 if (e->verify_count_and_frequency ())
2894 error_found = true;
2895 if (gimple_has_body_p (e->caller->decl)
2896 && !e->caller->global.inlined_to
2897 && !e->speculative
2898 && (e->frequency
2899 != compute_call_stmt_bb_frequency (e->caller->decl,
2900 gimple_bb (e->call_stmt))))
2902 error ("indirect call frequency %i does not match BB frequency %i",
2903 e->frequency,
2904 compute_call_stmt_bb_frequency (e->caller->decl,
2905 gimple_bb (e->call_stmt)));
2906 error_found = true;
2909 if (!callers && global.inlined_to)
2911 error ("inlined_to pointer is set but no predecessors found");
2912 error_found = true;
2914 if (global.inlined_to == this)
2916 error ("inlined_to pointer refers to itself");
2917 error_found = true;
2920 if (clone_of)
2922 cgraph_node *n;
2923 for (n = clone_of->clones; n; n = n->next_sibling_clone)
2924 if (n == this)
2925 break;
2926 if (!n)
2928 error ("cgraph_node has wrong clone_of");
2929 error_found = true;
2932 if (clones)
2934 cgraph_node *n;
2935 for (n = clones; n; n = n->next_sibling_clone)
2936 if (n->clone_of != this)
2937 break;
2938 if (n)
2940 error ("cgraph_node has wrong clone list");
2941 error_found = true;
2944 if ((prev_sibling_clone || next_sibling_clone) && !clone_of)
2946 error ("cgraph_node is in clone list but it is not clone");
2947 error_found = true;
2949 if (!prev_sibling_clone && clone_of && clone_of->clones != this)
2951 error ("cgraph_node has wrong prev_clone pointer");
2952 error_found = true;
2954 if (prev_sibling_clone && prev_sibling_clone->next_sibling_clone != this)
2956 error ("double linked list of clones corrupted");
2957 error_found = true;
2960 if (analyzed && alias)
2962 bool ref_found = false;
2963 int i;
2964 ipa_ref *ref = NULL;
2966 if (callees)
2968 error ("Alias has call edges");
2969 error_found = true;
2971 for (i = 0; iterate_reference (i, ref); i++)
2972 if (ref->use == IPA_REF_CHKP)
2974 else if (ref->use != IPA_REF_ALIAS)
2976 error ("Alias has non-alias reference");
2977 error_found = true;
2979 else if (ref_found)
2981 error ("Alias has more than one alias reference");
2982 error_found = true;
2984 else
2985 ref_found = true;
2986 if (!ref_found)
2988 error ("Analyzed alias has no reference");
2989 error_found = true;
2993 /* Check instrumented version reference. */
2994 if (instrumented_version
2995 && instrumented_version->instrumented_version != this)
2997 error ("Instrumentation clone does not reference original node");
2998 error_found = true;
3001 /* Cannot have orig_decl for not instrumented nodes. */
3002 if (!instrumentation_clone && orig_decl)
3004 error ("Not instrumented node has non-NULL original declaration");
3005 error_found = true;
3008 /* If original not instrumented node still exists then we may check
3009 original declaration is set properly. */
3010 if (instrumented_version
3011 && orig_decl
3012 && orig_decl != instrumented_version->decl)
3014 error ("Instrumented node has wrong original declaration");
3015 error_found = true;
3018 /* Check all nodes have chkp reference to their instrumented versions. */
3019 if (analyzed
3020 && instrumented_version
3021 && !instrumentation_clone)
3023 bool ref_found = false;
3024 int i;
3025 struct ipa_ref *ref;
3027 for (i = 0; iterate_reference (i, ref); i++)
3028 if (ref->use == IPA_REF_CHKP)
3030 if (ref_found)
3032 error ("Node has more than one chkp reference");
3033 error_found = true;
3035 if (ref->referred != instrumented_version)
3037 error ("Wrong node is referenced with chkp reference");
3038 error_found = true;
3040 ref_found = true;
3043 if (!ref_found)
3045 error ("Analyzed node has no reference to instrumented version");
3046 error_found = true;
3050 if (instrumentation_clone
3051 && DECL_BUILT_IN_CLASS (decl) == NOT_BUILT_IN)
3053 tree name = DECL_ASSEMBLER_NAME (decl);
3054 tree orig_name = DECL_ASSEMBLER_NAME (orig_decl);
3056 if (!IDENTIFIER_TRANSPARENT_ALIAS (name)
3057 || TREE_CHAIN (name) != orig_name)
3059 error ("Alias chain for instrumented node is broken");
3060 error_found = true;
3064 if (analyzed && thunk.thunk_p)
3066 if (!callees)
3068 error ("No edge out of thunk node");
3069 error_found = true;
3071 else if (callees->next_callee)
3073 error ("More than one edge out of thunk node");
3074 error_found = true;
3076 if (gimple_has_body_p (decl))
3078 error ("Thunk is not supposed to have body");
3079 error_found = true;
3081 if (thunk.add_pointer_bounds_args
3082 && !instrumented_version->semantically_equivalent_p (callees->callee))
3084 error ("Instrumentation thunk has wrong edge callee");
3085 error_found = true;
3088 else if (analyzed && gimple_has_body_p (decl)
3089 && !TREE_ASM_WRITTEN (decl)
3090 && (!DECL_EXTERNAL (decl) || global.inlined_to)
3091 && !flag_wpa)
3093 if (this_cfun->cfg)
3095 hash_set<gimple> stmts;
3096 int i;
3097 ipa_ref *ref = NULL;
3099 /* Reach the trees by walking over the CFG, and note the
3100 enclosing basic-blocks in the call edges. */
3101 FOR_EACH_BB_FN (this_block, this_cfun)
3103 for (gsi = gsi_start_phis (this_block);
3104 !gsi_end_p (gsi); gsi_next (&gsi))
3105 stmts.add (gsi_stmt (gsi));
3106 for (gsi = gsi_start_bb (this_block);
3107 !gsi_end_p (gsi);
3108 gsi_next (&gsi))
3110 gimple stmt = gsi_stmt (gsi);
3111 stmts.add (stmt);
3112 if (is_gimple_call (stmt))
3114 cgraph_edge *e = get_edge (stmt);
3115 tree decl = gimple_call_fndecl (stmt);
3116 if (e)
3118 if (e->aux)
3120 error ("shared call_stmt:");
3121 cgraph_debug_gimple_stmt (this_cfun, stmt);
3122 error_found = true;
3124 if (!e->indirect_unknown_callee)
3126 if (e->verify_corresponds_to_fndecl (decl))
3128 error ("edge points to wrong declaration:");
3129 debug_tree (e->callee->decl);
3130 fprintf (stderr," Instead of:");
3131 debug_tree (decl);
3132 error_found = true;
3135 else if (decl)
3137 error ("an indirect edge with unknown callee "
3138 "corresponding to a call_stmt with "
3139 "a known declaration:");
3140 error_found = true;
3141 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
3143 e->aux = (void *)1;
3145 else if (decl)
3147 error ("missing callgraph edge for call stmt:");
3148 cgraph_debug_gimple_stmt (this_cfun, stmt);
3149 error_found = true;
3154 for (i = 0; iterate_reference (i, ref); i++)
3155 if (ref->stmt && !stmts.contains (ref->stmt))
3157 error ("reference to dead statement");
3158 cgraph_debug_gimple_stmt (this_cfun, ref->stmt);
3159 error_found = true;
3162 else
3163 /* No CFG available?! */
3164 gcc_unreachable ();
3166 for (e = callees; e; e = e->next_callee)
3168 if (!e->aux)
3170 error ("edge %s->%s has no corresponding call_stmt",
3171 identifier_to_locale (e->caller->name ()),
3172 identifier_to_locale (e->callee->name ()));
3173 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
3174 error_found = true;
3176 e->aux = 0;
3178 for (e = indirect_calls; e; e = e->next_callee)
3180 if (!e->aux && !e->speculative)
3182 error ("an indirect edge from %s has no corresponding call_stmt",
3183 identifier_to_locale (e->caller->name ()));
3184 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
3185 error_found = true;
3187 e->aux = 0;
3190 if (error_found)
3192 dump (stderr);
3193 internal_error ("verify_cgraph_node failed");
3195 timevar_pop (TV_CGRAPH_VERIFY);
3198 /* Verify whole cgraph structure. */
3199 DEBUG_FUNCTION void
3200 cgraph_node::verify_cgraph_nodes (void)
3202 cgraph_node *node;
3204 if (seen_error ())
3205 return;
3207 FOR_EACH_FUNCTION (node)
3208 node->verify ();
3211 /* Walk the alias chain to return the function cgraph_node is alias of.
3212 Walk through thunks, too.
3213 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3215 cgraph_node *
3216 cgraph_node::function_symbol (enum availability *availability)
3218 cgraph_node *node = ultimate_alias_target (availability);
3220 while (node->thunk.thunk_p)
3222 node = node->callees->callee;
3223 if (availability)
3225 enum availability a;
3226 a = node->get_availability ();
3227 if (a < *availability)
3228 *availability = a;
3230 node = node->ultimate_alias_target (availability);
3232 return node;
3235 /* Walk the alias chain to return the function cgraph_node is alias of.
3236 Walk through non virtual thunks, too. Thus we return either a function
3237 or a virtual thunk node.
3238 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3240 cgraph_node *
3241 cgraph_node::function_or_virtual_thunk_symbol
3242 (enum availability *availability)
3244 cgraph_node *node = ultimate_alias_target (availability);
3246 while (node->thunk.thunk_p && !node->thunk.virtual_offset_p)
3248 node = node->callees->callee;
3249 if (availability)
3251 enum availability a;
3252 a = node->get_availability ();
3253 if (a < *availability)
3254 *availability = a;
3256 node = node->ultimate_alias_target (availability);
3258 return node;
3261 /* When doing LTO, read cgraph_node's body from disk if it is not already
3262 present. */
3264 bool
3265 cgraph_node::get_untransformed_body (void)
3267 lto_file_decl_data *file_data;
3268 const char *data, *name;
3269 size_t len;
3270 tree decl = this->decl;
3272 if (DECL_RESULT (decl))
3273 return false;
3275 gcc_assert (in_lto_p);
3277 timevar_push (TV_IPA_LTO_GIMPLE_IN);
3279 file_data = lto_file_data;
3280 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
3282 /* We may have renamed the declaration, e.g., a static function. */
3283 name = lto_get_decl_name_mapping (file_data, name);
3285 data = lto_get_section_data (file_data, LTO_section_function_body,
3286 name, &len);
3287 if (!data)
3288 fatal_error (input_location, "%s: section %s is missing",
3289 file_data->file_name,
3290 name);
3292 gcc_assert (DECL_STRUCT_FUNCTION (decl) == NULL);
3294 lto_input_function_body (file_data, this, data);
3295 lto_stats.num_function_bodies++;
3296 lto_free_section_data (file_data, LTO_section_function_body, name,
3297 data, len);
3298 lto_free_function_in_decl_state_for_node (this);
3299 /* Keep lto file data so ipa-inline-analysis knows about cross module
3300 inlining. */
3302 timevar_pop (TV_IPA_LTO_GIMPLE_IN);
3304 return true;
3307 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3308 if it is not already present. When some IPA transformations are scheduled,
3309 apply them. */
3311 bool
3312 cgraph_node::get_body (void)
3314 bool updated;
3316 updated = get_untransformed_body ();
3318 /* Getting transformed body makes no sense for inline clones;
3319 we should never use this on real clones becuase they are materialized
3320 early.
3321 TODO: Materializing clones here will likely lead to smaller LTRANS
3322 footprint. */
3323 gcc_assert (!global.inlined_to && !clone_of);
3324 if (ipa_transforms_to_apply.exists ())
3326 opt_pass *saved_current_pass = current_pass;
3327 FILE *saved_dump_file = dump_file;
3328 int saved_dump_flags = dump_flags;
3330 push_cfun (DECL_STRUCT_FUNCTION (decl));
3331 execute_all_ipa_transforms ();
3332 cgraph_edge::rebuild_edges ();
3333 free_dominance_info (CDI_DOMINATORS);
3334 free_dominance_info (CDI_POST_DOMINATORS);
3335 pop_cfun ();
3336 updated = true;
3338 current_pass = saved_current_pass;
3339 dump_file = saved_dump_file;
3340 dump_flags = saved_dump_flags;
3342 return updated;
3345 /* Return the DECL_STRUCT_FUNCTION of the function. */
3347 struct function *
3348 cgraph_node::get_fun (void)
3350 cgraph_node *node = this;
3351 struct function *fun = DECL_STRUCT_FUNCTION (node->decl);
3353 while (!fun && node->clone_of)
3355 node = node->clone_of;
3356 fun = DECL_STRUCT_FUNCTION (node->decl);
3359 return fun;
3362 /* Verify if the type of the argument matches that of the function
3363 declaration. If we cannot verify this or there is a mismatch,
3364 return false. */
3366 static bool
3367 gimple_check_call_args (gimple stmt, tree fndecl, bool args_count_match)
3369 tree parms, p;
3370 unsigned int i, nargs;
3372 /* Calls to internal functions always match their signature. */
3373 if (gimple_call_internal_p (stmt))
3374 return true;
3376 nargs = gimple_call_num_args (stmt);
3378 /* Get argument types for verification. */
3379 if (fndecl)
3380 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
3381 else
3382 parms = TYPE_ARG_TYPES (gimple_call_fntype (stmt));
3384 /* Verify if the type of the argument matches that of the function
3385 declaration. If we cannot verify this or there is a mismatch,
3386 return false. */
3387 if (fndecl && DECL_ARGUMENTS (fndecl))
3389 for (i = 0, p = DECL_ARGUMENTS (fndecl);
3390 i < nargs;
3391 i++, p = DECL_CHAIN (p))
3393 tree arg;
3394 /* We cannot distinguish a varargs function from the case
3395 of excess parameters, still deferring the inlining decision
3396 to the callee is possible. */
3397 if (!p)
3398 break;
3399 arg = gimple_call_arg (stmt, i);
3400 if (p == error_mark_node
3401 || DECL_ARG_TYPE (p) == error_mark_node
3402 || arg == error_mark_node
3403 || (!types_compatible_p (DECL_ARG_TYPE (p), TREE_TYPE (arg))
3404 && !fold_convertible_p (DECL_ARG_TYPE (p), arg)))
3405 return false;
3407 if (args_count_match && p)
3408 return false;
3410 else if (parms)
3412 for (i = 0, p = parms; i < nargs; i++, p = TREE_CHAIN (p))
3414 tree arg;
3415 /* If this is a varargs function defer inlining decision
3416 to callee. */
3417 if (!p)
3418 break;
3419 arg = gimple_call_arg (stmt, i);
3420 if (TREE_VALUE (p) == error_mark_node
3421 || arg == error_mark_node
3422 || TREE_CODE (TREE_VALUE (p)) == VOID_TYPE
3423 || (!types_compatible_p (TREE_VALUE (p), TREE_TYPE (arg))
3424 && !fold_convertible_p (TREE_VALUE (p), arg)))
3425 return false;
3428 else
3430 if (nargs != 0)
3431 return false;
3433 return true;
3436 /* Verify if the type of the argument and lhs of CALL_STMT matches
3437 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3438 true, the arg count needs to be the same.
3439 If we cannot verify this or there is a mismatch, return false. */
3441 bool
3442 gimple_check_call_matching_types (gimple call_stmt, tree callee,
3443 bool args_count_match)
3445 tree lhs;
3447 if ((DECL_RESULT (callee)
3448 && !DECL_BY_REFERENCE (DECL_RESULT (callee))
3449 && (lhs = gimple_call_lhs (call_stmt)) != NULL_TREE
3450 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee)),
3451 TREE_TYPE (lhs))
3452 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee)), lhs))
3453 || !gimple_check_call_args (call_stmt, callee, args_count_match))
3454 return false;
3455 return true;
3458 /* Reset all state within cgraph.c so that we can rerun the compiler
3459 within the same process. For use by toplev::finalize. */
3461 void
3462 cgraph_c_finalize (void)
3464 symtab = NULL;
3466 x_cgraph_nodes_queue = NULL;
3468 cgraph_fnver_htab = NULL;
3469 version_info_node = NULL;
3472 /* A wroker for call_for_symbol_and_aliases. */
3474 bool
3475 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback) (cgraph_node *,
3476 void *),
3477 void *data,
3478 bool include_overwritable)
3480 ipa_ref *ref;
3481 FOR_EACH_ALIAS (this, ref)
3483 cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring);
3484 if (include_overwritable
3485 || alias->get_availability () > AVAIL_INTERPOSABLE)
3486 if (alias->call_for_symbol_and_aliases (callback, data,
3487 include_overwritable))
3488 return true;
3490 return false;
3493 /* Return true if NODE has thunk. */
3495 bool
3496 cgraph_node::has_thunk_p (cgraph_node *node, void *)
3498 for (cgraph_edge *e = node->callers; e; e = e->next_caller)
3499 if (e->caller->thunk.thunk_p)
3500 return true;
3501 return false;
3504 #include "gt-cgraph.h"