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
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
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. */
28 #include "coretypes.h"
33 #include "double-int.h"
40 #include "fold-const.h"
43 #include "print-tree.h"
44 #include "tree-inline.h"
45 #include "langhooks.h"
52 #include "dominance.h"
54 #include "basic-block.h"
57 #include "plugin-api.h"
58 #include "hard-reg-set.h"
63 #include "tree-ssa-alias.h"
64 #include "internal-fn.h"
66 #include "gimple-expr.h"
68 #include "gimple-iterator.h"
71 #include "gimple-ssa.h"
74 #include "value-prof.h"
76 #include "diagnostic-core.h"
78 #include "ipa-utils.h"
79 #include "lto-streamer.h"
80 #include "alloc-pool.h"
81 #include "symbol-summary.h"
83 #include "ipa-inline.h"
85 #include "gimple-pretty-print.h"
86 #include "statistics.h"
88 #include "fixed-value.h"
89 #include "insn-config.h"
99 #include "tree-chkp.h"
102 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
103 #include "tree-pass.h"
105 /* Queue of cgraph nodes scheduled to be lowered. */
106 symtab_node *x_cgraph_nodes_queue;
107 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
109 /* Symbol table global context. */
110 symbol_table *symtab;
112 /* List of hooks triggered on cgraph_edge events. */
113 struct cgraph_edge_hook_list {
114 cgraph_edge_hook hook;
116 struct cgraph_edge_hook_list *next;
119 /* List of hooks triggered on cgraph_node events. */
120 struct cgraph_node_hook_list {
121 cgraph_node_hook hook;
123 struct cgraph_node_hook_list *next;
126 /* List of hooks triggered on events involving two cgraph_edges. */
127 struct cgraph_2edge_hook_list {
128 cgraph_2edge_hook hook;
130 struct cgraph_2edge_hook_list *next;
133 /* List of hooks triggered on events involving two cgraph_nodes. */
134 struct cgraph_2node_hook_list {
135 cgraph_2node_hook hook;
137 struct cgraph_2node_hook_list *next;
140 /* Hash descriptor for cgraph_function_version_info. */
142 struct function_version_hasher : ggc_hasher<cgraph_function_version_info *>
144 static hashval_t hash (cgraph_function_version_info *);
145 static bool equal (cgraph_function_version_info *,
146 cgraph_function_version_info *);
149 /* Map a cgraph_node to cgraph_function_version_info using this htab.
150 The cgraph_function_version_info has a THIS_NODE field that is the
151 corresponding cgraph_node.. */
153 static GTY(()) hash_table<function_version_hasher> *cgraph_fnver_htab = NULL;
155 /* Hash function for cgraph_fnver_htab. */
157 function_version_hasher::hash (cgraph_function_version_info *ptr)
159 int uid = ptr->this_node->uid;
160 return (hashval_t)(uid);
163 /* eq function for cgraph_fnver_htab. */
165 function_version_hasher::equal (cgraph_function_version_info *n1,
166 cgraph_function_version_info *n2)
168 return n1->this_node->uid == n2->this_node->uid;
171 /* Mark as GC root all allocated nodes. */
172 static GTY(()) struct cgraph_function_version_info *
173 version_info_node = NULL;
175 /* Get the cgraph_function_version_info node corresponding to node. */
176 cgraph_function_version_info *
177 cgraph_node::function_version (void)
179 cgraph_function_version_info key;
180 key.this_node = this;
182 if (cgraph_fnver_htab == NULL)
185 return cgraph_fnver_htab->find (&key);
188 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
189 corresponding to cgraph_node NODE. */
190 cgraph_function_version_info *
191 cgraph_node::insert_new_function_version (void)
193 version_info_node = NULL;
194 version_info_node = ggc_cleared_alloc<cgraph_function_version_info> ();
195 version_info_node->this_node = this;
197 if (cgraph_fnver_htab == NULL)
198 cgraph_fnver_htab = hash_table<function_version_hasher>::create_ggc (2);
200 *cgraph_fnver_htab->find_slot (version_info_node, INSERT)
202 return version_info_node;
205 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
206 DECL is a duplicate declaration. */
208 cgraph_node::delete_function_version (tree decl)
210 cgraph_node *decl_node = cgraph_node::get (decl);
211 cgraph_function_version_info *decl_v = NULL;
213 if (decl_node == NULL)
216 decl_v = decl_node->function_version ();
221 if (decl_v->prev != NULL)
222 decl_v->prev->next = decl_v->next;
224 if (decl_v->next != NULL)
225 decl_v->next->prev = decl_v->prev;
227 if (cgraph_fnver_htab != NULL)
228 cgraph_fnver_htab->remove_elt (decl_v);
230 decl_node->remove ();
233 /* Record that DECL1 and DECL2 are semantically identical function
236 cgraph_node::record_function_versions (tree decl1, tree decl2)
238 cgraph_node *decl1_node = cgraph_node::get_create (decl1);
239 cgraph_node *decl2_node = cgraph_node::get_create (decl2);
240 cgraph_function_version_info *decl1_v = NULL;
241 cgraph_function_version_info *decl2_v = NULL;
242 cgraph_function_version_info *before;
243 cgraph_function_version_info *after;
245 gcc_assert (decl1_node != NULL && decl2_node != NULL);
246 decl1_v = decl1_node->function_version ();
247 decl2_v = decl2_node->function_version ();
249 if (decl1_v != NULL && decl2_v != NULL)
253 decl1_v = decl1_node->insert_new_function_version ();
256 decl2_v = decl2_node->insert_new_function_version ();
258 /* Chain decl2_v and decl1_v. All semantically identical versions
259 will be chained together. */
264 while (before->next != NULL)
265 before = before->next;
267 while (after->prev != NULL)
270 before->next = after;
271 after->prev = before;
274 /* Initialize callgraph dump file. */
277 symbol_table::initialize (void)
280 dump_file = dump_begin (TDI_cgraph, NULL);
283 /* Allocate new callgraph node and insert it into basic data structures. */
286 symbol_table::create_empty (void)
288 cgraph_node *node = allocate_cgraph_symbol ();
290 node->type = SYMTAB_FUNCTION;
291 node->frequency = NODE_FREQUENCY_NORMAL;
292 node->count_materialization_scale = REG_BR_PROB_BASE;
298 /* Register HOOK to be called with DATA on each removed edge. */
299 cgraph_edge_hook_list *
300 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook, void *data)
302 cgraph_edge_hook_list *entry;
303 cgraph_edge_hook_list **ptr = &m_first_edge_removal_hook;
305 entry = (cgraph_edge_hook_list *) xmalloc (sizeof (*entry));
315 /* Remove ENTRY from the list of hooks called on removing edges. */
317 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list *entry)
319 cgraph_edge_hook_list **ptr = &m_first_edge_removal_hook;
321 while (*ptr != entry)
327 /* Call all edge removal hooks. */
329 symbol_table::call_edge_removal_hooks (cgraph_edge *e)
331 cgraph_edge_hook_list *entry = m_first_edge_removal_hook;
334 entry->hook (e, entry->data);
339 /* Register HOOK to be called with DATA on each removed node. */
340 cgraph_node_hook_list *
341 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook, void *data)
343 cgraph_node_hook_list *entry;
344 cgraph_node_hook_list **ptr = &m_first_cgraph_removal_hook;
346 entry = (cgraph_node_hook_list *) xmalloc (sizeof (*entry));
356 /* Remove ENTRY from the list of hooks called on removing nodes. */
358 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list *entry)
360 cgraph_node_hook_list **ptr = &m_first_cgraph_removal_hook;
362 while (*ptr != entry)
368 /* Call all node removal hooks. */
370 symbol_table::call_cgraph_removal_hooks (cgraph_node *node)
372 cgraph_node_hook_list *entry = m_first_cgraph_removal_hook;
375 entry->hook (node, entry->data);
380 /* Call all node removal hooks. */
382 symbol_table::call_cgraph_insertion_hooks (cgraph_node *node)
384 cgraph_node_hook_list *entry = m_first_cgraph_insertion_hook;
387 entry->hook (node, entry->data);
393 /* Register HOOK to be called with DATA on each inserted node. */
394 cgraph_node_hook_list *
395 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook, void *data)
397 cgraph_node_hook_list *entry;
398 cgraph_node_hook_list **ptr = &m_first_cgraph_insertion_hook;
400 entry = (cgraph_node_hook_list *) xmalloc (sizeof (*entry));
410 /* Remove ENTRY from the list of hooks called on inserted nodes. */
412 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list *entry)
414 cgraph_node_hook_list **ptr = &m_first_cgraph_insertion_hook;
416 while (*ptr != entry)
422 /* Register HOOK to be called with DATA on each duplicated edge. */
423 cgraph_2edge_hook_list *
424 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook, void *data)
426 cgraph_2edge_hook_list *entry;
427 cgraph_2edge_hook_list **ptr = &m_first_edge_duplicated_hook;
429 entry = (cgraph_2edge_hook_list *) xmalloc (sizeof (*entry));
439 /* Remove ENTRY from the list of hooks called on duplicating edges. */
441 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list *entry)
443 cgraph_2edge_hook_list **ptr = &m_first_edge_duplicated_hook;
445 while (*ptr != entry)
451 /* Call all edge duplication hooks. */
453 symbol_table::call_edge_duplication_hooks (cgraph_edge *cs1, cgraph_edge *cs2)
455 cgraph_2edge_hook_list *entry = m_first_edge_duplicated_hook;
458 entry->hook (cs1, cs2, entry->data);
463 /* Register HOOK to be called with DATA on each duplicated node. */
464 cgraph_2node_hook_list *
465 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook, void *data)
467 cgraph_2node_hook_list *entry;
468 cgraph_2node_hook_list **ptr = &m_first_cgraph_duplicated_hook;
470 entry = (cgraph_2node_hook_list *) xmalloc (sizeof (*entry));
480 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
482 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list *entry)
484 cgraph_2node_hook_list **ptr = &m_first_cgraph_duplicated_hook;
486 while (*ptr != entry)
492 /* Call all node duplication hooks. */
494 symbol_table::call_cgraph_duplication_hooks (cgraph_node *node,
497 cgraph_2node_hook_list *entry = m_first_cgraph_duplicated_hook;
500 entry->hook (node, node2, entry->data);
505 /* Return cgraph node assigned to DECL. Create new one when needed. */
508 cgraph_node::create (tree decl)
510 cgraph_node *node = symtab->create_empty ();
511 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
515 if ((flag_openacc || flag_openmp)
516 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl)))
518 node->offloadable = 1;
519 #ifdef ENABLE_OFFLOADING
520 g->have_offload = true;
524 node->register_symbol ();
526 if (DECL_CONTEXT (decl) && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
528 node->origin = cgraph_node::get_create (DECL_CONTEXT (decl));
529 node->next_nested = node->origin->nested;
530 node->origin->nested = node;
535 /* Try to find a call graph node for declaration DECL and if it does not exist
536 or if it corresponds to an inline clone, create a new one. */
539 cgraph_node::get_create (tree decl)
541 cgraph_node *first_clone = cgraph_node::get (decl);
543 if (first_clone && !first_clone->global.inlined_to)
546 cgraph_node *node = cgraph_node::create (decl);
549 first_clone->clone_of = node;
550 node->clones = first_clone;
551 symtab->symtab_prevail_in_asm_name_hash (node);
552 node->decl->decl_with_vis.symtab_node = node;
554 fprintf (dump_file, "Introduced new external node "
555 "(%s/%i) and turned into root of the clone tree.\n",
556 node->name (), node->order);
559 fprintf (dump_file, "Introduced new external node "
560 "(%s/%i).\n", node->name (), node->order);
564 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
565 the function body is associated with (not necessarily cgraph_node (DECL). */
568 cgraph_node::create_alias (tree alias, tree target)
570 cgraph_node *alias_node;
572 gcc_assert (TREE_CODE (target) == FUNCTION_DECL
573 || TREE_CODE (target) == IDENTIFIER_NODE);
574 gcc_assert (TREE_CODE (alias) == FUNCTION_DECL);
575 alias_node = cgraph_node::get_create (alias);
576 gcc_assert (!alias_node->definition);
577 alias_node->alias_target = target;
578 alias_node->definition = true;
579 alias_node->alias = true;
580 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias)) != NULL)
581 alias_node->weakref = true;
585 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
587 Same body aliases are output whenever the body of DECL is output,
588 and cgraph_node::get (ALIAS) transparently returns
589 cgraph_node::get (DECL). */
592 cgraph_node::create_same_body_alias (tree alias, tree decl)
595 #ifndef ASM_OUTPUT_DEF
596 /* If aliases aren't supported by the assembler, fail. */
599 /* Langhooks can create same body aliases of symbols not defined.
600 Those are useless. Drop them on the floor. */
601 if (symtab->global_info_ready)
604 n = cgraph_node::create_alias (alias, decl);
605 n->cpp_implicit_alias = true;
606 if (symtab->cpp_implicit_aliases_done)
607 n->resolve_alias (cgraph_node::get (decl));
611 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
612 aliases DECL with an adjustments made into the first parameter.
613 See comments in thunk_adjust for detail on the parameters. */
616 cgraph_node::create_thunk (tree alias, tree, bool this_adjusting,
617 HOST_WIDE_INT fixed_offset,
618 HOST_WIDE_INT virtual_value,
624 node = cgraph_node::get (alias);
628 node = cgraph_node::create (alias);
629 gcc_checking_assert (!virtual_offset
630 || wi::eq_p (virtual_offset, virtual_value));
631 node->thunk.fixed_offset = fixed_offset;
632 node->thunk.this_adjusting = this_adjusting;
633 node->thunk.virtual_value = virtual_value;
634 node->thunk.virtual_offset_p = virtual_offset != NULL;
635 node->thunk.alias = real_alias;
636 node->thunk.thunk_p = true;
637 node->definition = true;
642 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
643 Return NULL if there's no such node. */
646 cgraph_node::get_for_asmname (tree asmname)
648 /* We do not want to look at inline clones. */
649 for (symtab_node *node = symtab_node::get_for_asmname (asmname);
651 node = node->next_sharing_asm_name)
653 cgraph_node *cn = dyn_cast <cgraph_node *> (node);
654 if (cn && !cn->global.inlined_to)
660 /* Returns a hash value for X (which really is a cgraph_edge). */
663 cgraph_edge_hasher::hash (cgraph_edge *e)
665 /* This is a really poor hash function, but it is what htab_hash_pointer
667 return (hashval_t) ((intptr_t)e->call_stmt >> 3);
670 /* Returns a hash value for X (which really is a cgraph_edge). */
673 cgraph_edge_hasher::hash (gimple call_stmt)
675 /* This is a really poor hash function, but it is what htab_hash_pointer
677 return (hashval_t) ((intptr_t)call_stmt >> 3);
680 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
683 cgraph_edge_hasher::equal (cgraph_edge *x, gimple y)
685 return x->call_stmt == y;
688 /* Add call graph edge E to call site hash of its caller. */
691 cgraph_update_edge_in_call_site_hash (cgraph_edge *e)
693 gimple call = e->call_stmt;
694 *e->caller->call_site_hash->find_slot_with_hash
695 (call, cgraph_edge_hasher::hash (call), INSERT) = e;
698 /* Add call graph edge E to call site hash of its caller. */
701 cgraph_add_edge_to_call_site_hash (cgraph_edge *e)
703 /* There are two speculative edges for every statement (one direct,
704 one indirect); always hash the direct one. */
705 if (e->speculative && e->indirect_unknown_callee)
707 cgraph_edge **slot = e->caller->call_site_hash->find_slot_with_hash
708 (e->call_stmt, cgraph_edge_hasher::hash (e->call_stmt), INSERT);
711 gcc_assert (((cgraph_edge *)*slot)->speculative);
716 gcc_assert (!*slot || e->speculative);
720 /* Return the callgraph edge representing the GIMPLE_CALL statement
724 cgraph_node::get_edge (gimple call_stmt)
730 return call_site_hash->find_with_hash
731 (call_stmt, cgraph_edge_hasher::hash (call_stmt));
733 /* This loop may turn out to be performance problem. In such case adding
734 hashtables into call nodes with very many edges is probably best
735 solution. It is not good idea to add pointer into CALL_EXPR itself
736 because we want to make possible having multiple cgraph nodes representing
737 different clones of the same body before the body is actually cloned. */
738 for (e = callees; e; e = e->next_callee)
740 if (e->call_stmt == call_stmt)
746 for (e = indirect_calls; e; e = e->next_callee)
748 if (e->call_stmt == call_stmt)
755 call_site_hash = hash_table<cgraph_edge_hasher>::create_ggc (120);
756 for (e2 = callees; e2; e2 = e2->next_callee)
757 cgraph_add_edge_to_call_site_hash (e2);
758 for (e2 = indirect_calls; e2; e2 = e2->next_callee)
759 cgraph_add_edge_to_call_site_hash (e2);
766 /* Change field call_stmt of edge to NEW_STMT.
767 If UPDATE_SPECULATIVE and E is any component of speculative
768 edge, then update all components. */
771 cgraph_edge::set_call_stmt (gcall *new_stmt, bool update_speculative)
775 /* Speculative edges has three component, update all of them
777 if (update_speculative && speculative)
779 cgraph_edge *direct, *indirect;
782 speculative_call_info (direct, indirect, ref);
783 direct->set_call_stmt (new_stmt, false);
784 indirect->set_call_stmt (new_stmt, false);
785 ref->stmt = new_stmt;
789 /* Only direct speculative edges go to call_site_hash. */
790 if (caller->call_site_hash
791 && (!speculative || !indirect_unknown_callee))
793 caller->call_site_hash->remove_elt_with_hash
794 (call_stmt, cgraph_edge_hasher::hash (call_stmt));
797 cgraph_edge *e = this;
799 call_stmt = new_stmt;
800 if (indirect_unknown_callee
801 && (decl = gimple_call_fndecl (new_stmt)))
803 /* Constant propagation (and possibly also inlining?) can turn an
804 indirect call into a direct one. */
805 cgraph_node *new_callee = cgraph_node::get (decl);
807 gcc_checking_assert (new_callee);
808 e = make_direct (new_callee);
811 push_cfun (DECL_STRUCT_FUNCTION (e->caller->decl));
812 e->can_throw_external = stmt_can_throw_external (new_stmt);
814 if (e->caller->call_site_hash)
815 cgraph_add_edge_to_call_site_hash (e);
818 /* Allocate a cgraph_edge structure and fill it with data according to the
819 parameters of which only CALLEE can be NULL (when creating an indirect call
823 symbol_table::create_edge (cgraph_node *caller, cgraph_node *callee,
824 gcall *call_stmt, gcov_type count, int freq,
825 bool indir_unknown_callee)
829 /* LTO does not actually have access to the call_stmt since these
830 have not been loaded yet. */
833 /* This is a rather expensive check possibly triggering
834 construction of call stmt hashtable. */
835 #ifdef ENABLE_CHECKING
837 gcc_checking_assert (
838 !(e = caller->get_edge (call_stmt)) || e->speculative);
841 gcc_assert (is_gimple_call (call_stmt));
847 free_edges = NEXT_FREE_EDGE (edge);
851 edge = ggc_alloc<cgraph_edge> ();
852 edge->uid = edges_max_uid++;
858 edge->caller = caller;
859 edge->callee = callee;
860 edge->prev_caller = NULL;
861 edge->next_caller = NULL;
862 edge->prev_callee = NULL;
863 edge->next_callee = NULL;
864 edge->lto_stmt_uid = 0;
867 gcc_assert (count >= 0);
868 edge->frequency = freq;
869 gcc_assert (freq >= 0);
870 gcc_assert (freq <= CGRAPH_FREQ_MAX);
872 edge->call_stmt = call_stmt;
873 push_cfun (DECL_STRUCT_FUNCTION (caller->decl));
874 edge->can_throw_external
875 = call_stmt ? stmt_can_throw_external (call_stmt) : false;
878 && callee && callee->decl
879 && !gimple_check_call_matching_types (call_stmt, callee->decl,
881 edge->call_stmt_cannot_inline_p = true;
883 edge->call_stmt_cannot_inline_p = false;
885 edge->indirect_info = NULL;
886 edge->indirect_inlining_edge = 0;
887 edge->speculative = false;
888 edge->indirect_unknown_callee = indir_unknown_callee;
889 if (opt_for_fn (edge->caller->decl, flag_devirtualize)
890 && call_stmt && DECL_STRUCT_FUNCTION (caller->decl))
891 edge->in_polymorphic_cdtor
892 = decl_maybe_in_construction_p (NULL, NULL, call_stmt,
895 edge->in_polymorphic_cdtor = caller->thunk.thunk_p;
896 if (call_stmt && caller->call_site_hash)
897 cgraph_add_edge_to_call_site_hash (edge);
902 /* Create edge from a given function to CALLEE in the cgraph. */
905 cgraph_node::create_edge (cgraph_node *callee,
906 gcall *call_stmt, gcov_type count, int freq)
908 cgraph_edge *edge = symtab->create_edge (this, callee, call_stmt, count,
911 initialize_inline_failed (edge);
913 edge->next_caller = callee->callers;
915 callee->callers->prev_caller = edge;
916 edge->next_callee = callees;
918 callees->prev_callee = edge;
920 callee->callers = edge;
925 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
927 cgraph_indirect_call_info *
928 cgraph_allocate_init_indirect_info (void)
930 cgraph_indirect_call_info *ii;
932 ii = ggc_cleared_alloc<cgraph_indirect_call_info> ();
933 ii->param_index = -1;
937 /* Create an indirect edge with a yet-undetermined callee where the call
938 statement destination is a formal parameter of the caller with index
942 cgraph_node::create_indirect_edge (gcall *call_stmt, int ecf_flags,
943 gcov_type count, int freq,
944 bool compute_indirect_info)
946 cgraph_edge *edge = symtab->create_edge (this, NULL, call_stmt,
950 initialize_inline_failed (edge);
952 edge->indirect_info = cgraph_allocate_init_indirect_info ();
953 edge->indirect_info->ecf_flags = ecf_flags;
954 edge->indirect_info->vptr_changed = true;
956 /* Record polymorphic call info. */
957 if (compute_indirect_info
959 && (target = gimple_call_fn (call_stmt))
960 && virtual_method_call_p (target))
962 ipa_polymorphic_call_context context (decl, target, call_stmt);
964 /* Only record types can have virtual calls. */
965 edge->indirect_info->polymorphic = true;
966 edge->indirect_info->param_index = -1;
967 edge->indirect_info->otr_token
968 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target));
969 edge->indirect_info->otr_type = obj_type_ref_class (target);
970 gcc_assert (TREE_CODE (edge->indirect_info->otr_type) == RECORD_TYPE);
971 edge->indirect_info->context = context;
974 edge->next_callee = indirect_calls;
976 indirect_calls->prev_callee = edge;
977 indirect_calls = edge;
982 /* Remove the edge from the list of the callees of the caller. */
985 cgraph_edge::remove_caller (void)
988 prev_callee->next_callee = next_callee;
990 next_callee->prev_callee = prev_callee;
993 if (indirect_unknown_callee)
994 caller->indirect_calls = next_callee;
996 caller->callees = next_callee;
998 if (caller->call_site_hash)
999 caller->call_site_hash->remove_elt_with_hash
1000 (call_stmt, cgraph_edge_hasher::hash (call_stmt));
1003 /* Put the edge onto the free list. */
1006 symbol_table::free_edge (cgraph_edge *e)
1010 if (e->indirect_info)
1011 ggc_free (e->indirect_info);
1013 /* Clear out the edge so we do not dangle pointers. */
1014 memset (e, 0, sizeof (*e));
1016 NEXT_FREE_EDGE (e) = free_edges;
1021 /* Remove the edge in the cgraph. */
1024 cgraph_edge::remove (void)
1026 /* Call all edge removal hooks. */
1027 symtab->call_edge_removal_hooks (this);
1029 if (!indirect_unknown_callee)
1030 /* Remove from callers list of the callee. */
1033 /* Remove from callees list of the callers. */
1036 /* Put the edge onto the free list. */
1037 symtab->free_edge (this);
1040 /* Turn edge into speculative call calling N2. Update
1041 the profile so the direct call is taken COUNT times
1044 At clone materialization time, the indirect call E will
1047 if (call_dest == N2)
1052 At this time the function just creates the direct call,
1053 the referencd representing the if conditional and attaches
1054 them all to the orginal indirect call statement.
1056 Return direct edge created. */
1059 cgraph_edge::make_speculative (cgraph_node *n2, gcov_type direct_count,
1060 int direct_frequency)
1062 cgraph_node *n = caller;
1063 ipa_ref *ref = NULL;
1068 fprintf (dump_file, "Indirect call -> speculative call"
1069 " %s/%i => %s/%i\n",
1070 xstrdup_for_dump (n->name ()), n->order,
1071 xstrdup_for_dump (n2->name ()), n2->order);
1074 e2 = n->create_edge (n2, call_stmt, direct_count, direct_frequency);
1075 initialize_inline_failed (e2);
1076 e2->speculative = true;
1077 if (TREE_NOTHROW (n2->decl))
1078 e2->can_throw_external = false;
1080 e2->can_throw_external = can_throw_external;
1081 e2->lto_stmt_uid = lto_stmt_uid;
1082 e2->in_polymorphic_cdtor = in_polymorphic_cdtor;
1084 frequency -= e2->frequency;
1085 symtab->call_edge_duplication_hooks (this, e2);
1086 ref = n->create_reference (n2, IPA_REF_ADDR, call_stmt);
1087 ref->lto_stmt_uid = lto_stmt_uid;
1088 ref->speculative = speculative;
1089 n2->mark_address_taken ();
1093 /* Speculative call consist of three components:
1094 1) an indirect edge representing the original call
1095 2) an direct edge representing the new call
1096 3) ADDR_EXPR reference representing the speculative check.
1097 All three components are attached to single statement (the indirect
1098 call) and if one of them exists, all of them must exist.
1100 Given speculative call edge, return all three components.
1104 cgraph_edge::speculative_call_info (cgraph_edge *&direct,
1105 cgraph_edge *&indirect,
1106 ipa_ref *&reference)
1111 cgraph_edge *e = this;
1113 if (!e->indirect_unknown_callee)
1114 for (e2 = e->caller->indirect_calls;
1115 e2->call_stmt != e->call_stmt || e2->lto_stmt_uid != e->lto_stmt_uid;
1116 e2 = e2->next_callee)
1121 /* We can take advantage of the call stmt hash. */
1124 e = e->caller->get_edge (e2->call_stmt);
1125 gcc_assert (e->speculative && !e->indirect_unknown_callee);
1128 for (e = e->caller->callees;
1129 e2->call_stmt != e->call_stmt
1130 || e2->lto_stmt_uid != e->lto_stmt_uid;
1134 gcc_assert (e->speculative && e2->speculative);
1139 for (i = 0; e->caller->iterate_reference (i, ref); i++)
1140 if (ref->speculative
1141 && ((ref->stmt && ref->stmt == e->call_stmt)
1142 || (!ref->stmt && ref->lto_stmt_uid == e->lto_stmt_uid)))
1148 /* Speculative edge always consist of all three components - direct edge,
1149 indirect and reference. */
1151 gcc_assert (e && e2 && ref);
1154 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1155 Remove the speculative call sequence and return edge representing the call.
1156 It is up to caller to redirect the call as appropriate. */
1159 cgraph_edge::resolve_speculation (tree callee_decl)
1161 cgraph_edge *edge = this;
1165 gcc_assert (edge->speculative);
1166 edge->speculative_call_info (e2, edge, ref);
1168 || !ref->referred->semantically_equivalent_p
1169 (symtab_node::get (callee_decl)))
1175 fprintf (dump_file, "Speculative indirect call %s/%i => %s/%i has "
1176 "turned out to have contradicting known target ",
1177 xstrdup_for_dump (edge->caller->name ()),
1178 edge->caller->order,
1179 xstrdup_for_dump (e2->callee->name ()),
1181 print_generic_expr (dump_file, callee_decl, 0);
1182 fprintf (dump_file, "\n");
1186 fprintf (dump_file, "Removing speculative call %s/%i => %s/%i\n",
1187 xstrdup_for_dump (edge->caller->name ()),
1188 edge->caller->order,
1189 xstrdup_for_dump (e2->callee->name ()),
1196 cgraph_edge *tmp = edge;
1198 fprintf (dump_file, "Speculative call turned into direct call.\n");
1201 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1202 in the functions inlined through it. */
1204 edge->count += e2->count;
1205 edge->frequency += e2->frequency;
1206 if (edge->frequency > CGRAPH_FREQ_MAX)
1207 edge->frequency = CGRAPH_FREQ_MAX;
1208 edge->speculative = false;
1209 e2->speculative = false;
1210 ref->remove_reference ();
1211 if (e2->indirect_unknown_callee || e2->inline_failed)
1214 e2->callee->remove_symbol_and_inline_clones ();
1215 if (edge->caller->call_site_hash)
1216 cgraph_update_edge_in_call_site_hash (edge);
1220 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1221 CALLEE. DELTA is an integer constant that is to be added to the this
1222 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1225 cgraph_edge::make_direct (cgraph_node *callee)
1227 cgraph_edge *edge = this;
1228 gcc_assert (indirect_unknown_callee);
1230 /* If we are redirecting speculative call, make it non-speculative. */
1231 if (indirect_unknown_callee && speculative)
1233 edge = edge->resolve_speculation (callee->decl);
1235 /* On successful speculation just return the pre existing direct edge. */
1236 if (!indirect_unknown_callee)
1240 indirect_unknown_callee = 0;
1241 ggc_free (indirect_info);
1242 indirect_info = NULL;
1244 /* Get the edge out of the indirect edge list. */
1246 prev_callee->next_callee = next_callee;
1248 next_callee->prev_callee = prev_callee;
1250 caller->indirect_calls = next_callee;
1252 /* Put it into the normal callee list */
1254 next_callee = caller->callees;
1255 if (caller->callees)
1256 caller->callees->prev_callee = edge;
1257 caller->callees = edge;
1259 /* Insert to callers list of the new callee. */
1260 edge->set_callee (callee);
1263 call_stmt_cannot_inline_p
1264 = !gimple_check_call_matching_types (call_stmt, callee->decl,
1267 /* We need to re-determine the inlining status of the edge. */
1268 initialize_inline_failed (edge);
1272 /* If necessary, change the function declaration in the call statement
1273 associated with E so that it corresponds to the edge callee. */
1276 cgraph_edge::redirect_call_stmt_to_callee (void)
1278 cgraph_edge *e = this;
1280 tree decl = gimple_call_fndecl (e->call_stmt);
1281 tree lhs = gimple_call_lhs (e->call_stmt);
1283 gimple_stmt_iterator gsi;
1284 bool skip_bounds = false;
1285 #ifdef ENABLE_CHECKING
1295 e->speculative_call_info (e, e2, ref);
1296 /* If there already is an direct call (i.e. as a result of inliner's
1297 substitution), forget about speculating. */
1299 e = e->resolve_speculation (decl);
1300 /* If types do not match, speculation was likely wrong.
1301 The direct edge was posisbly redirected to the clone with a different
1302 signature. We did not update the call statement yet, so compare it
1303 with the reference that still points to the proper type. */
1304 else if (!gimple_check_call_matching_types (e->call_stmt,
1305 ref->referred->decl,
1309 fprintf (dump_file, "Not expanding speculative call of %s/%i -> %s/%i\n"
1311 xstrdup_for_dump (e->caller->name ()),
1313 xstrdup_for_dump (e->callee->name ()),
1315 e = e->resolve_speculation ();
1316 /* We are producing the final function body and will throw away the
1317 callgraph edges really soon. Reset the counts/frequencies to
1318 keep verifier happy in the case of roundoff errors. */
1319 e->count = gimple_bb (e->call_stmt)->count;
1320 e->frequency = compute_call_stmt_bb_frequency
1321 (e->caller->decl, gimple_bb (e->call_stmt));
1323 /* Expand speculation into GIMPLE code. */
1328 "Expanding speculative call of %s/%i -> %s/%i count:"
1330 xstrdup_for_dump (e->caller->name ()),
1332 xstrdup_for_dump (e->callee->name ()),
1335 gcc_assert (e2->speculative);
1336 push_cfun (DECL_STRUCT_FUNCTION (e->caller->decl));
1337 new_stmt = gimple_ic (e->call_stmt,
1338 dyn_cast<cgraph_node *> (ref->referred),
1339 e->count || e2->count
1340 ? RDIV (e->count * REG_BR_PROB_BASE,
1341 e->count + e2->count)
1342 : e->frequency || e2->frequency
1343 ? RDIV (e->frequency * REG_BR_PROB_BASE,
1344 e->frequency + e2->frequency)
1345 : REG_BR_PROB_BASE / 2,
1346 e->count, e->count + e2->count);
1347 e->speculative = false;
1348 e->caller->set_call_stmt_including_clones (e->call_stmt, new_stmt,
1351 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1352 processed call stmt. */
1353 if (gimple_call_with_bounds_p (new_stmt)
1354 && gimple_call_lhs (new_stmt)
1355 && chkp_retbnd_call_by_val (gimple_call_lhs (e2->call_stmt)))
1357 tree dresult = gimple_call_lhs (new_stmt);
1358 tree iresult = gimple_call_lhs (e2->call_stmt);
1359 gcall *dbndret = chkp_retbnd_call_by_val (dresult);
1360 gcall *ibndret = chkp_retbnd_call_by_val (iresult);
1361 struct cgraph_edge *iedge
1362 = e2->caller->cgraph_node::get_edge (ibndret);
1363 struct cgraph_edge *dedge;
1367 dedge = iedge->caller->create_edge (iedge->callee,
1370 dedge->frequency = compute_call_stmt_bb_frequency
1371 (dedge->caller->decl, gimple_bb (dedge->call_stmt));
1373 iedge->frequency = compute_call_stmt_bb_frequency
1374 (iedge->caller->decl, gimple_bb (iedge->call_stmt));
1377 e->frequency = compute_call_stmt_bb_frequency
1378 (e->caller->decl, gimple_bb (e->call_stmt));
1379 e2->frequency = compute_call_stmt_bb_frequency
1380 (e2->caller->decl, gimple_bb (e2->call_stmt));
1381 e2->speculative = false;
1382 ref->speculative = false;
1384 /* Indirect edges are not both in the call site hash.
1386 if (e->caller->call_site_hash)
1387 cgraph_update_edge_in_call_site_hash (e2);
1389 /* Continue redirecting E to proper target. */
1393 /* We might propagate instrumented function pointer into
1394 not instrumented function and vice versa. In such a
1395 case we need to either fix function declaration or
1396 remove bounds from call statement. */
1397 if (flag_check_pointer_bounds && e->callee)
1398 skip_bounds = chkp_redirect_edge (e);
1400 if (e->indirect_unknown_callee
1401 || (decl == e->callee->decl
1403 return e->call_stmt;
1405 #ifdef ENABLE_CHECKING
1408 node = cgraph_node::get (decl);
1409 gcc_assert (!node || !node->clone.combined_args_to_skip);
1413 if (symtab->dump_file)
1415 fprintf (symtab->dump_file, "updating call of %s/%i -> %s/%i: ",
1416 xstrdup_for_dump (e->caller->name ()), e->caller->order,
1417 xstrdup_for_dump (e->callee->name ()), e->callee->order);
1418 print_gimple_stmt (symtab->dump_file, e->call_stmt, 0, dump_flags);
1419 if (e->callee->clone.combined_args_to_skip)
1421 fprintf (symtab->dump_file, " combined args to skip: ");
1422 dump_bitmap (symtab->dump_file,
1423 e->callee->clone.combined_args_to_skip);
1427 if (e->callee->clone.combined_args_to_skip
1432 new_stmt = e->call_stmt;
1433 if (e->callee->clone.combined_args_to_skip)
1435 = gimple_call_copy_skip_args (new_stmt,
1436 e->callee->clone.combined_args_to_skip);
1438 new_stmt = chkp_copy_call_skip_bounds (new_stmt);
1440 gimple_call_set_fndecl (new_stmt, e->callee->decl);
1441 gimple_call_set_fntype (new_stmt, gimple_call_fntype (e->call_stmt));
1443 if (gimple_vdef (new_stmt)
1444 && TREE_CODE (gimple_vdef (new_stmt)) == SSA_NAME)
1445 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt)) = new_stmt;
1447 gsi = gsi_for_stmt (e->call_stmt);
1448 gsi_replace (&gsi, new_stmt, false);
1449 /* We need to defer cleaning EH info on the new statement to
1450 fixup-cfg. We may not have dominator information at this point
1451 and thus would end up with unreachable blocks and have no way
1452 to communicate that we need to run CFG cleanup then. */
1453 lp_nr = lookup_stmt_eh_lp (e->call_stmt);
1456 remove_stmt_from_eh_lp (e->call_stmt);
1457 add_stmt_to_eh_lp (new_stmt, lp_nr);
1462 new_stmt = e->call_stmt;
1463 gimple_call_set_fndecl (new_stmt, e->callee->decl);
1464 update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt);
1467 /* If the call becomes noreturn, remove the lhs. */
1468 if (lhs && (gimple_call_flags (new_stmt) & ECF_NORETURN))
1470 if (TREE_CODE (lhs) == SSA_NAME)
1472 tree var = create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e->caller->decl),
1473 TREE_TYPE (lhs), NULL);
1474 var = get_or_create_ssa_default_def
1475 (DECL_STRUCT_FUNCTION (e->caller->decl), var);
1476 gimple set_stmt = gimple_build_assign (lhs, var);
1477 gsi = gsi_for_stmt (new_stmt);
1478 gsi_insert_before_without_update (&gsi, set_stmt, GSI_SAME_STMT);
1479 update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), set_stmt);
1481 gimple_call_set_lhs (new_stmt, NULL_TREE);
1482 update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt);
1485 /* If new callee has no static chain, remove it. */
1486 if (gimple_call_chain (new_stmt) && !DECL_STATIC_CHAIN (e->callee->decl))
1488 gimple_call_set_chain (new_stmt, NULL);
1489 update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt);
1492 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e->caller->decl),
1495 e->caller->set_call_stmt_including_clones (e->call_stmt, new_stmt, false);
1497 if (symtab->dump_file)
1499 fprintf (symtab->dump_file, " updated to:");
1500 print_gimple_stmt (symtab->dump_file, e->call_stmt, 0, dump_flags);
1505 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1506 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1507 of OLD_STMT if it was previously call statement.
1508 If NEW_STMT is NULL, the call has been dropped without any
1512 cgraph_update_edges_for_call_stmt_node (cgraph_node *node,
1513 gimple old_stmt, tree old_call,
1516 tree new_call = (new_stmt && is_gimple_call (new_stmt))
1517 ? gimple_call_fndecl (new_stmt) : 0;
1519 /* We are seeing indirect calls, then there is nothing to update. */
1520 if (!new_call && !old_call)
1522 /* See if we turned indirect call into direct call or folded call to one builtin
1523 into different builtin. */
1524 if (old_call != new_call)
1526 cgraph_edge *e = node->get_edge (old_stmt);
1527 cgraph_edge *ne = NULL;
1533 /* Keep calls marked as dead dead. */
1534 if (new_stmt && is_gimple_call (new_stmt) && e->callee
1535 && DECL_BUILT_IN_CLASS (e->callee->decl) == BUILT_IN_NORMAL
1536 && DECL_FUNCTION_CODE (e->callee->decl) == BUILT_IN_UNREACHABLE)
1538 node->get_edge (old_stmt)->set_call_stmt
1539 (as_a <gcall *> (new_stmt));
1542 /* See if the edge is already there and has the correct callee. It
1543 might be so because of indirect inlining has already updated
1544 it. We also might've cloned and redirected the edge. */
1545 if (new_call && e->callee)
1547 cgraph_node *callee = e->callee;
1550 if (callee->decl == new_call
1551 || callee->former_clone_of == new_call)
1553 e->set_call_stmt (as_a <gcall *> (new_stmt));
1556 callee = callee->clone_of;
1560 /* Otherwise remove edge and create new one; we can't simply redirect
1561 since function has changed, so inline plan and other information
1562 attached to edge is invalid. */
1564 frequency = e->frequency;
1565 if (e->indirect_unknown_callee || e->inline_failed)
1568 e->callee->remove_symbol_and_inline_clones ();
1572 /* We are seeing new direct call; compute profile info based on BB. */
1573 basic_block bb = gimple_bb (new_stmt);
1575 frequency = compute_call_stmt_bb_frequency (current_function_decl,
1581 ne = node->create_edge (cgraph_node::get_create (new_call),
1582 as_a <gcall *> (new_stmt), count,
1584 gcc_assert (ne->inline_failed);
1587 /* We only updated the call stmt; update pointer in cgraph edge.. */
1588 else if (old_stmt != new_stmt)
1589 node->get_edge (old_stmt)->set_call_stmt (as_a <gcall *> (new_stmt));
1592 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1593 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1594 of OLD_STMT before it was updated (updating can happen inplace). */
1597 cgraph_update_edges_for_call_stmt (gimple old_stmt, tree old_decl, gimple new_stmt)
1599 cgraph_node *orig = cgraph_node::get (cfun->decl);
1602 gcc_checking_assert (orig);
1603 cgraph_update_edges_for_call_stmt_node (orig, old_stmt, old_decl, new_stmt);
1605 for (node = orig->clones; node != orig;)
1607 cgraph_update_edges_for_call_stmt_node (node, old_stmt, old_decl, new_stmt);
1609 node = node->clones;
1610 else if (node->next_sibling_clone)
1611 node = node->next_sibling_clone;
1614 while (node != orig && !node->next_sibling_clone)
1615 node = node->clone_of;
1617 node = node->next_sibling_clone;
1623 /* Remove all callees from the node. */
1626 cgraph_node::remove_callees (void)
1630 /* It is sufficient to remove the edges from the lists of callers of
1631 the callees. The callee list of the node can be zapped with one
1633 for (e = callees; e; e = f)
1636 symtab->call_edge_removal_hooks (e);
1637 if (!e->indirect_unknown_callee)
1638 e->remove_callee ();
1639 symtab->free_edge (e);
1641 for (e = indirect_calls; e; e = f)
1644 symtab->call_edge_removal_hooks (e);
1645 if (!e->indirect_unknown_callee)
1646 e->remove_callee ();
1647 symtab->free_edge (e);
1649 indirect_calls = NULL;
1653 call_site_hash->empty ();
1654 call_site_hash = NULL;
1658 /* Remove all callers from the node. */
1661 cgraph_node::remove_callers (void)
1665 /* It is sufficient to remove the edges from the lists of callees of
1666 the callers. The caller list of the node can be zapped with one
1668 for (e = callers; e; e = f)
1671 symtab->call_edge_removal_hooks (e);
1672 e->remove_caller ();
1673 symtab->free_edge (e);
1678 /* Helper function for cgraph_release_function_body and free_lang_data.
1679 It releases body from function DECL without having to inspect its
1680 possibly non-existent symtab node. */
1683 release_function_body (tree decl)
1685 if (DECL_STRUCT_FUNCTION (decl))
1687 if (DECL_STRUCT_FUNCTION (decl)->cfg
1688 || DECL_STRUCT_FUNCTION (decl)->gimple_df)
1690 push_cfun (DECL_STRUCT_FUNCTION (decl));
1694 cfun->curr_properties &= ~PROP_loops;
1695 loop_optimizer_finalize ();
1697 if (cfun->gimple_df)
1700 delete_tree_cfg_annotations ();
1705 gcc_assert (!dom_info_available_p (CDI_DOMINATORS));
1706 gcc_assert (!dom_info_available_p (CDI_POST_DOMINATORS));
1710 if (cfun->value_histograms)
1714 gimple_set_body (decl, NULL);
1715 /* Struct function hangs a lot of data that would leak if we didn't
1716 removed all pointers to it. */
1717 ggc_free (DECL_STRUCT_FUNCTION (decl));
1718 DECL_STRUCT_FUNCTION (decl) = NULL;
1720 DECL_SAVED_TREE (decl) = NULL;
1723 /* Release memory used to represent body of function.
1724 Use this only for functions that are released before being translated to
1725 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1726 are free'd in final.c via free_after_compilation().
1727 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1730 cgraph_node::release_body (bool keep_arguments)
1732 ipa_transforms_to_apply.release ();
1733 if (!used_as_abstract_origin && symtab->state != PARSING)
1735 DECL_RESULT (decl) = NULL;
1737 if (!keep_arguments)
1738 DECL_ARGUMENTS (decl) = NULL;
1740 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1741 of its associated function function declaration because it's
1742 needed to emit debug info later. */
1743 if (!used_as_abstract_origin && DECL_INITIAL (decl))
1744 DECL_INITIAL (decl) = error_mark_node;
1745 release_function_body (decl);
1748 lto_free_function_in_decl_state_for_node (this);
1749 lto_file_data = NULL;
1753 /* Remove function from symbol table. */
1756 cgraph_node::remove (void)
1759 int uid = this->uid;
1761 symtab->call_cgraph_removal_hooks (this);
1764 ipa_transforms_to_apply.release ();
1766 /* Incremental inlining access removed nodes stored in the postorder list.
1768 force_output = false;
1769 forced_by_abi = false;
1770 for (n = nested; n; n = n->next_nested)
1775 cgraph_node **node2 = &origin->nested;
1777 while (*node2 != this)
1778 node2 = &(*node2)->next_nested;
1779 *node2 = next_nested;
1782 if (prev_sibling_clone)
1783 prev_sibling_clone->next_sibling_clone = next_sibling_clone;
1785 clone_of->clones = next_sibling_clone;
1786 if (next_sibling_clone)
1787 next_sibling_clone->prev_sibling_clone = prev_sibling_clone;
1790 cgraph_node *n, *next;
1794 for (n = clones; n->next_sibling_clone; n = n->next_sibling_clone)
1795 n->clone_of = clone_of;
1796 n->clone_of = clone_of;
1797 n->next_sibling_clone = clone_of->clones;
1798 if (clone_of->clones)
1799 clone_of->clones->prev_sibling_clone = n;
1800 clone_of->clones = clones;
1804 /* We are removing node with clones. This makes clones inconsistent,
1805 but assume they will be removed subsequently and just keep clone
1806 tree intact. This can happen in unreachable function removal since
1807 we remove unreachable functions in random order, not by bottom-up
1808 walk of clone trees. */
1809 for (n = clones; n; n = next)
1811 next = n->next_sibling_clone;
1812 n->next_sibling_clone = NULL;
1813 n->prev_sibling_clone = NULL;
1819 /* While all the clones are removed after being proceeded, the function
1820 itself is kept in the cgraph even after it is compiled. Check whether
1821 we are done with this body and reclaim it proactively if this is the case.
1823 if (symtab->state != LTO_STREAMING)
1825 n = cgraph_node::get (decl);
1827 || (!n->clones && !n->clone_of && !n->global.inlined_to
1828 && ((symtab->global_info_ready || in_lto_p)
1829 && (TREE_ASM_WRITTEN (n->decl)
1830 || DECL_EXTERNAL (n->decl)
1832 || (!flag_wpa && n->in_other_partition)))))
1837 lto_free_function_in_decl_state_for_node (this);
1838 lto_file_data = NULL;
1844 call_site_hash->empty ();
1845 call_site_hash = NULL;
1848 if (instrumented_version)
1850 instrumented_version->instrumented_version = NULL;
1851 instrumented_version = NULL;
1854 symtab->release_symbol (this, uid);
1857 /* Likewise indicate that a node is having address taken. */
1860 cgraph_node::mark_address_taken (void)
1862 /* Indirect inlining can figure out that all uses of the address are
1864 if (global.inlined_to)
1866 gcc_assert (cfun->after_inlining);
1867 gcc_assert (callers->indirect_inlining_edge);
1870 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1871 IPA_REF_ADDR reference exists (and thus it should be set on node
1872 representing alias we take address of) and as a test whether address
1873 of the object was taken (and thus it should be set on node alias is
1874 referring to). We should remove the first use and the remove the
1877 cgraph_node *node = ultimate_alias_target ();
1878 node->address_taken = 1;
1881 /* Return local info for the compiled function. */
1884 cgraph_node::local_info (tree decl)
1886 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
1887 cgraph_node *node = get (decl);
1890 return &node->ultimate_alias_target ()->local;
1893 /* Return local info for the compiled function. */
1896 cgraph_node::rtl_info (tree decl)
1898 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
1899 cgraph_node *node = get (decl);
1902 node = node->ultimate_alias_target ();
1903 if (node->decl != current_function_decl
1904 && !TREE_ASM_WRITTEN (node->decl))
1906 return &node->ultimate_alias_target ()->rtl;
1909 /* Return a string describing the failure REASON. */
1912 cgraph_inline_failed_string (cgraph_inline_failed_t reason)
1915 #define DEFCIFCODE(code, type, string) string,
1917 static const char *cif_string_table[CIF_N_REASONS] = {
1918 #include "cif-code.def"
1921 /* Signedness of an enum type is implementation defined, so cast it
1922 to unsigned before testing. */
1923 gcc_assert ((unsigned) reason < CIF_N_REASONS);
1924 return cif_string_table[reason];
1927 /* Return a type describing the failure REASON. */
1929 cgraph_inline_failed_type_t
1930 cgraph_inline_failed_type (cgraph_inline_failed_t reason)
1933 #define DEFCIFCODE(code, type, string) type,
1935 static cgraph_inline_failed_type_t cif_type_table[CIF_N_REASONS] = {
1936 #include "cif-code.def"
1939 /* Signedness of an enum type is implementation defined, so cast it
1940 to unsigned before testing. */
1941 gcc_assert ((unsigned) reason < CIF_N_REASONS);
1942 return cif_type_table[reason];
1945 /* Names used to print out the availability enum. */
1946 const char * const cgraph_availability_names[] =
1947 {"unset", "not_available", "overwritable", "available", "local"};
1949 /* Output flags of edge to a file F. */
1952 cgraph_edge::dump_edge_flags (FILE *f)
1955 fprintf (f, "(speculative) ");
1957 fprintf (f, "(inlined) ");
1958 if (indirect_inlining_edge)
1959 fprintf (f, "(indirect_inlining) ");
1961 fprintf (f, "(%"PRId64"x) ", (int64_t)count);
1963 fprintf (f, "(%.2f per call) ", frequency / (double)CGRAPH_FREQ_BASE);
1964 if (can_throw_external)
1965 fprintf (f, "(can throw external) ");
1968 /* Dump call graph node to file F. */
1971 cgraph_node::dump (FILE *f)
1977 if (global.inlined_to)
1978 fprintf (f, " Function %s/%i is inline copy in %s/%i\n",
1979 xstrdup_for_dump (name ()),
1981 xstrdup_for_dump (global.inlined_to->name ()),
1982 global.inlined_to->order);
1984 fprintf (f, " Clone of %s/%i\n",
1985 clone_of->asm_name (),
1987 if (symtab->function_flags_ready)
1988 fprintf (f, " Availability: %s\n",
1989 cgraph_availability_names [get_availability ()]);
1992 fprintf (f, " Profile id: %i\n",
1994 fprintf (f, " First run: %i\n", tp_first_run);
1995 fprintf (f, " Function flags:");
1997 fprintf (f, " executed %"PRId64"x",
2000 fprintf (f, " nested in: %s", origin->asm_name ());
2001 if (gimple_has_body_p (decl))
2002 fprintf (f, " body");
2004 fprintf (f, " process");
2006 fprintf (f, " local");
2007 if (local.redefined_extern_inline)
2008 fprintf (f, " redefined_extern_inline");
2009 if (only_called_at_startup)
2010 fprintf (f, " only_called_at_startup");
2011 if (only_called_at_exit)
2012 fprintf (f, " only_called_at_exit");
2014 fprintf (f, " tm_clone");
2016 fprintf (f, " icf_merged");
2018 fprintf (f, " nonfreeing_fn");
2019 if (DECL_STATIC_CONSTRUCTOR (decl))
2020 fprintf (f," static_constructor (priority:%i)", get_init_priority ());
2021 if (DECL_STATIC_DESTRUCTOR (decl))
2022 fprintf (f," static_destructor (priority:%i)", get_fini_priority ());
2023 if (frequency == NODE_FREQUENCY_HOT)
2024 fprintf (f, " hot");
2025 if (frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED)
2026 fprintf (f, " unlikely_executed");
2027 if (frequency == NODE_FREQUENCY_EXECUTED_ONCE)
2028 fprintf (f, " executed_once");
2029 if (only_called_at_startup)
2030 fprintf (f, " only_called_at_startup");
2031 if (only_called_at_exit)
2032 fprintf (f, " only_called_at_exit");
2033 if (opt_for_fn (decl, optimize_size))
2034 fprintf (f, " optimize_size");
2035 if (parallelized_function)
2036 fprintf (f, " parallelized_function");
2042 fprintf (f, " Thunk");
2044 fprintf (f, " of %s (asm: %s)",
2045 lang_hooks.decl_printable_name (thunk.alias, 2),
2046 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk.alias)));
2047 fprintf (f, " fixed offset %i virtual value %i has "
2048 "virtual offset %i)\n",
2049 (int)thunk.fixed_offset,
2050 (int)thunk.virtual_value,
2051 (int)thunk.virtual_offset_p);
2053 if (alias && thunk.alias
2054 && DECL_P (thunk.alias))
2056 fprintf (f, " Alias of %s",
2057 lang_hooks.decl_printable_name (thunk.alias, 2));
2058 if (DECL_ASSEMBLER_NAME_SET_P (thunk.alias))
2059 fprintf (f, " (asm: %s)",
2060 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk.alias)));
2064 fprintf (f, " Called by: ");
2066 for (edge = callers; edge; edge = edge->next_caller)
2068 fprintf (f, "%s/%i ", edge->caller->asm_name (),
2069 edge->caller->order);
2070 edge->dump_edge_flags (f);
2073 fprintf (f, "\n Calls: ");
2074 for (edge = callees; edge; edge = edge->next_callee)
2076 fprintf (f, "%s/%i ", edge->callee->asm_name (),
2077 edge->callee->order);
2078 edge->dump_edge_flags (f);
2082 for (edge = indirect_calls; edge; edge = edge->next_callee)
2084 if (edge->indirect_info->polymorphic)
2086 fprintf (f, " Polymorphic indirect call of type ");
2087 print_generic_expr (f, edge->indirect_info->otr_type, TDF_SLIM);
2088 fprintf (f, " token:%i", (int) edge->indirect_info->otr_token);
2091 fprintf (f, " Indirect call");
2092 edge->dump_edge_flags (f);
2093 if (edge->indirect_info->param_index != -1)
2095 fprintf (f, " of param:%i", edge->indirect_info->param_index);
2096 if (edge->indirect_info->agg_contents)
2097 fprintf (f, " loaded from %s %s at offset %i",
2098 edge->indirect_info->member_ptr ? "member ptr" : "aggregate",
2099 edge->indirect_info->by_ref ? "passed by reference":"",
2100 (int)edge->indirect_info->offset);
2101 if (edge->indirect_info->vptr_changed)
2102 fprintf (f, " (vptr maybe changed)");
2105 if (edge->indirect_info->polymorphic)
2106 edge->indirect_info->context.dump (f);
2109 if (instrumentation_clone)
2110 fprintf (f, " Is instrumented version.\n");
2111 else if (instrumented_version)
2112 fprintf (f, " Has instrumented version.\n");
2115 /* Dump call graph node NODE to stderr. */
2118 cgraph_node::debug (void)
2123 /* Dump the callgraph to file F. */
2126 cgraph_node::dump_cgraph (FILE *f)
2130 fprintf (f, "callgraph:\n\n");
2131 FOR_EACH_FUNCTION (node)
2135 /* Return true when the DECL can possibly be inlined. */
2138 cgraph_function_possibly_inlined_p (tree decl)
2140 if (!symtab->global_info_ready)
2141 return !DECL_UNINLINABLE (decl);
2142 return DECL_POSSIBLY_INLINED (decl);
2145 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2147 cgraph_node::unnest (void)
2149 cgraph_node **node2 = &origin->nested;
2150 gcc_assert (origin);
2152 while (*node2 != this)
2153 node2 = &(*node2)->next_nested;
2154 *node2 = next_nested;
2158 /* Return function availability. See cgraph.h for description of individual
2161 cgraph_node::get_availability (void)
2163 enum availability avail;
2165 avail = AVAIL_NOT_AVAILABLE;
2166 else if (local.local)
2167 avail = AVAIL_LOCAL;
2168 else if (alias && weakref)
2169 ultimate_alias_target (&avail);
2170 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl)))
2171 avail = AVAIL_INTERPOSABLE;
2172 else if (!externally_visible)
2173 avail = AVAIL_AVAILABLE;
2174 /* Inline functions are safe to be analyzed even if their symbol can
2175 be overwritten at runtime. It is not meaningful to enforce any sane
2176 behaviour on replacing inline function by different body. */
2177 else if (DECL_DECLARED_INLINE_P (decl))
2178 avail = AVAIL_AVAILABLE;
2180 /* If the function can be overwritten, return OVERWRITABLE. Take
2181 care at least of two notable extensions - the COMDAT functions
2182 used to share template instantiations in C++ (this is symmetric
2183 to code cp_cannot_inline_tree_fn and probably shall be shared and
2184 the inlinability hooks completely eliminated).
2186 ??? Does the C++ one definition rule allow us to always return
2187 AVAIL_AVAILABLE here? That would be good reason to preserve this
2190 else if (decl_replaceable_p (decl) && !DECL_EXTERNAL (decl))
2191 avail = AVAIL_INTERPOSABLE;
2192 else avail = AVAIL_AVAILABLE;
2197 /* Worker for cgraph_node_can_be_local_p. */
2199 cgraph_node_cannot_be_local_p_1 (cgraph_node *node, void *)
2201 return !(!node->force_output
2202 && ((DECL_COMDAT (node->decl)
2203 && !node->forced_by_abi
2204 && !node->used_from_object_file_p ()
2205 && !node->same_comdat_group)
2206 || !node->externally_visible));
2209 /* Return true if cgraph_node can be made local for API change.
2210 Extern inline functions and C++ COMDAT functions can be made local
2211 at the expense of possible code size growth if function is used in multiple
2212 compilation units. */
2214 cgraph_node::can_be_local_p (void)
2216 return (!address_taken
2217 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1,
2221 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2222 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2223 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2226 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback)
2227 (cgraph_node *, void *),
2229 bool include_overwritable,
2230 bool exclude_virtual_thunks)
2235 if (callback (this, data))
2237 FOR_EACH_ALIAS (this, ref)
2239 cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring);
2240 if (include_overwritable
2241 || alias->get_availability () > AVAIL_INTERPOSABLE)
2242 if (alias->call_for_symbol_thunks_and_aliases (callback, data,
2243 include_overwritable,
2244 exclude_virtual_thunks))
2247 for (e = callers; e; e = e->next_caller)
2248 if (e->caller->thunk.thunk_p
2249 && (include_overwritable
2250 || e->caller->get_availability () > AVAIL_INTERPOSABLE)
2251 && !(exclude_virtual_thunks
2252 && e->caller->thunk.virtual_offset_p))
2253 if (e->caller->call_for_symbol_thunks_and_aliases (callback, data,
2254 include_overwritable,
2255 exclude_virtual_thunks))
2261 /* Worker to bring NODE local. */
2264 cgraph_node::make_local (cgraph_node *node, void *)
2266 gcc_checking_assert (node->can_be_local_p ());
2267 if (DECL_COMDAT (node->decl) || DECL_EXTERNAL (node->decl))
2269 node->make_decl_local ();
2270 node->set_section (NULL);
2271 node->set_comdat_group (NULL);
2272 node->externally_visible = false;
2273 node->forced_by_abi = false;
2274 node->local.local = true;
2275 node->set_section (NULL);
2276 node->unique_name = (node->resolution == LDPR_PREVAILING_DEF_IRONLY
2277 || node->resolution == LDPR_PREVAILING_DEF_IRONLY_EXP);
2278 node->resolution = LDPR_PREVAILING_DEF_IRONLY;
2279 gcc_assert (node->get_availability () == AVAIL_LOCAL);
2284 /* Bring cgraph node local. */
2287 cgraph_node::make_local (void)
2289 call_for_symbol_thunks_and_aliases (cgraph_node::make_local, NULL, true);
2292 /* Worker to set nothrow flag. */
2295 cgraph_set_nothrow_flag_1 (cgraph_node *node, void *data)
2299 TREE_NOTHROW (node->decl) = data != NULL;
2302 for (e = node->callers; e; e = e->next_caller)
2303 e->can_throw_external = false;
2307 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2308 if any to NOTHROW. */
2311 cgraph_node::set_nothrow_flag (bool nothrow)
2313 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1,
2314 (void *)(size_t)nothrow, false);
2317 /* Worker to set const flag. */
2320 cgraph_set_const_flag_1 (cgraph_node *node, void *data)
2322 /* Static constructors and destructors without a side effect can be
2324 if (data && !((size_t)data & 2))
2326 if (DECL_STATIC_CONSTRUCTOR (node->decl))
2327 DECL_STATIC_CONSTRUCTOR (node->decl) = 0;
2328 if (DECL_STATIC_DESTRUCTOR (node->decl))
2329 DECL_STATIC_DESTRUCTOR (node->decl) = 0;
2331 TREE_READONLY (node->decl) = data != NULL;
2332 DECL_LOOPING_CONST_OR_PURE_P (node->decl) = ((size_t)data & 2) != 0;
2336 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2337 if any to READONLY. */
2340 cgraph_node::set_const_flag (bool readonly, bool looping)
2342 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1,
2343 (void *)(size_t)(readonly + (int)looping * 2),
2347 /* Worker to set pure flag. */
2350 cgraph_set_pure_flag_1 (cgraph_node *node, void *data)
2352 /* Static constructors and destructors without a side effect can be
2354 if (data && !((size_t)data & 2))
2356 if (DECL_STATIC_CONSTRUCTOR (node->decl))
2357 DECL_STATIC_CONSTRUCTOR (node->decl) = 0;
2358 if (DECL_STATIC_DESTRUCTOR (node->decl))
2359 DECL_STATIC_DESTRUCTOR (node->decl) = 0;
2361 DECL_PURE_P (node->decl) = data != NULL;
2362 DECL_LOOPING_CONST_OR_PURE_P (node->decl) = ((size_t)data & 2) != 0;
2366 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2370 cgraph_node::set_pure_flag (bool pure, bool looping)
2372 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1,
2373 (void *)(size_t)(pure + (int)looping * 2),
2377 /* Return true when cgraph_node can not return or throw and thus
2378 it is safe to ignore its side effects for IPA analysis. */
2381 cgraph_node::cannot_return_p (void)
2383 int flags = flags_from_decl_or_type (decl);
2384 if (!opt_for_fn (decl, flag_exceptions))
2385 return (flags & ECF_NORETURN) != 0;
2387 return ((flags & (ECF_NORETURN | ECF_NOTHROW))
2388 == (ECF_NORETURN | ECF_NOTHROW));
2391 /* Return true when call of edge can not lead to return from caller
2392 and thus it is safe to ignore its side effects for IPA analysis
2393 when computing side effects of the caller.
2394 FIXME: We could actually mark all edges that have no reaching
2395 patch to the exit block or throw to get better results. */
2397 cgraph_edge::cannot_lead_to_return_p (void)
2399 if (caller->cannot_return_p ())
2401 if (indirect_unknown_callee)
2403 int flags = indirect_info->ecf_flags;
2404 if (!opt_for_fn (caller->decl, flag_exceptions))
2405 return (flags & ECF_NORETURN) != 0;
2407 return ((flags & (ECF_NORETURN | ECF_NOTHROW))
2408 == (ECF_NORETURN | ECF_NOTHROW));
2411 return callee->cannot_return_p ();
2414 /* Return true if the call can be hot. */
2417 cgraph_edge::maybe_hot_p (void)
2419 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2421 && opt_for_fn (caller->decl, flag_branch_probabilities)
2422 && !maybe_hot_count_p (NULL, count))
2424 if (caller->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED
2426 && callee->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED))
2428 if (caller->frequency > NODE_FREQUENCY_UNLIKELY_EXECUTED
2430 && callee->frequency <= NODE_FREQUENCY_EXECUTED_ONCE))
2432 if (opt_for_fn (caller->decl, optimize_size))
2434 if (caller->frequency == NODE_FREQUENCY_HOT)
2436 if (caller->frequency == NODE_FREQUENCY_EXECUTED_ONCE
2437 && frequency < CGRAPH_FREQ_BASE * 3 / 2)
2439 if (opt_for_fn (caller->decl, flag_guess_branch_prob))
2441 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION) == 0
2442 || frequency <= (CGRAPH_FREQ_BASE
2443 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION)))
2449 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2452 nonremovable_p (cgraph_node *node, void *)
2454 return !node->can_remove_if_no_direct_calls_and_refs_p ();
2457 /* Return true if whole comdat group can be removed if there are no direct
2461 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline)
2463 struct ipa_ref *ref;
2465 /* For local symbols or non-comdat group it is the same as
2466 can_remove_if_no_direct_calls_p. */
2467 if (!externally_visible || !same_comdat_group)
2469 if (DECL_EXTERNAL (decl))
2473 return !call_for_symbol_and_aliases (nonremovable_p, NULL, true);
2476 if (will_inline && address_taken)
2479 /* Otheriwse check if we can remove the symbol itself and then verify
2480 that only uses of the comdat groups are direct call to THIS
2482 if (!can_remove_if_no_direct_calls_and_refs_p ())
2485 /* Check that all refs come from within the comdat group. */
2486 for (int i = 0; iterate_referring (i, ref); i++)
2487 if (ref->referring->get_comdat_group () != get_comdat_group ())
2490 struct cgraph_node *target = ultimate_alias_target ();
2491 for (cgraph_node *next = dyn_cast<cgraph_node *> (same_comdat_group);
2492 next != this; next = dyn_cast<cgraph_node *> (next->same_comdat_group))
2494 if (!externally_visible)
2497 && !next->can_remove_if_no_direct_calls_and_refs_p ())
2500 /* If we see different symbol than THIS, be sure to check calls. */
2501 if (next->ultimate_alias_target () != target)
2502 for (cgraph_edge *e = next->callers; e; e = e->next_caller)
2503 if (e->caller->get_comdat_group () != get_comdat_group ()
2507 /* If function is not being inlined, we care only about
2508 references outside of the comdat group. */
2510 for (int i = 0; next->iterate_referring (i, ref); i++)
2511 if (ref->referring->get_comdat_group () != get_comdat_group ())
2517 /* Return true when function cgraph_node can be expected to be removed
2518 from program when direct calls in this compilation unit are removed.
2520 As a special case COMDAT functions are
2521 cgraph_can_remove_if_no_direct_calls_p while the are not
2522 cgraph_only_called_directly_p (it is possible they are called from other
2525 This function behaves as cgraph_only_called_directly_p because eliminating
2526 all uses of COMDAT function does not make it necessarily disappear from
2527 the program unless we are compiling whole program or we do LTO. In this
2528 case we know we win since dynamic linking will not really discard the
2529 linkonce section. */
2532 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2535 gcc_assert (!global.inlined_to);
2536 if (DECL_EXTERNAL (decl))
2539 if (!in_lto_p && !flag_whole_program)
2541 /* If the symbol is in comdat group, we need to verify that whole comdat
2542 group becomes unreachable. Technically we could skip references from
2543 within the group, too. */
2544 if (!only_called_directly_p ())
2546 if (same_comdat_group && externally_visible)
2548 struct cgraph_node *target = ultimate_alias_target ();
2550 if (will_inline && address_taken)
2552 for (cgraph_node *next = dyn_cast<cgraph_node *> (same_comdat_group);
2554 next = dyn_cast<cgraph_node *> (next->same_comdat_group))
2556 if (!externally_visible)
2559 && !next->only_called_directly_p ())
2562 /* If we see different symbol than THIS,
2563 be sure to check calls. */
2564 if (next->ultimate_alias_target () != target)
2565 for (cgraph_edge *e = next->callers; e; e = e->next_caller)
2566 if (e->caller->get_comdat_group () != get_comdat_group ()
2574 return can_remove_if_no_direct_calls_p (will_inline);
2578 /* Worker for cgraph_only_called_directly_p. */
2581 cgraph_not_only_called_directly_p_1 (cgraph_node *node, void *)
2583 return !node->only_called_directly_or_aliased_p ();
2586 /* Return true when function cgraph_node and all its aliases are only called
2588 i.e. it is not externally visible, address was not taken and
2589 it is not used in any other non-standard way. */
2592 cgraph_node::only_called_directly_p (void)
2594 gcc_assert (ultimate_alias_target () == this);
2595 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1,
2600 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2603 collect_callers_of_node_1 (cgraph_node *node, void *data)
2605 vec<cgraph_edge *> *redirect_callers = (vec<cgraph_edge *> *)data;
2607 enum availability avail;
2608 node->ultimate_alias_target (&avail);
2610 if (avail > AVAIL_INTERPOSABLE)
2611 for (cs = node->callers; cs != NULL; cs = cs->next_caller)
2612 if (!cs->indirect_inlining_edge)
2613 redirect_callers->safe_push (cs);
2617 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2618 cgraph_node (i.e. are not overwritable). */
2621 cgraph_node::collect_callers (void)
2623 vec<cgraph_edge *> redirect_callers = vNULL;
2624 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1,
2625 &redirect_callers, false);
2626 return redirect_callers;
2629 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2632 clone_of_p (cgraph_node *node, cgraph_node *node2)
2634 bool skipped_thunk = false;
2635 node = node->ultimate_alias_target ();
2636 node2 = node2->ultimate_alias_target ();
2638 /* There are no virtual clones of thunks so check former_clone_of or if we
2639 might have skipped thunks because this adjustments are no longer
2641 while (node->thunk.thunk_p)
2643 if (node2->former_clone_of == node->decl)
2645 if (!node->thunk.this_adjusting)
2647 node = node->callees->callee->ultimate_alias_target ();
2648 skipped_thunk = true;
2653 if (!node2->clone.args_to_skip
2654 || !bitmap_bit_p (node2->clone.args_to_skip, 0))
2656 if (node2->former_clone_of == node->decl)
2658 else if (!node2->clone_of)
2662 while (node != node2 && node2)
2663 node2 = node2->clone_of;
2664 return node2 != NULL;
2667 /* Verify edge count and frequency. */
2670 cgraph_edge::verify_count_and_frequency ()
2672 bool error_found = false;
2675 error ("caller edge count is negative");
2680 error ("caller edge frequency is negative");
2683 if (frequency > CGRAPH_FREQ_MAX)
2685 error ("caller edge frequency is too large");
2691 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2693 cgraph_debug_gimple_stmt (function *this_cfun, gimple stmt)
2695 bool fndecl_was_null = false;
2696 /* debug_gimple_stmt needs correct cfun */
2697 if (cfun != this_cfun)
2698 set_cfun (this_cfun);
2699 /* ...and an actual current_function_decl */
2700 if (!current_function_decl)
2702 current_function_decl = this_cfun->decl;
2703 fndecl_was_null = true;
2705 debug_gimple_stmt (stmt);
2706 if (fndecl_was_null)
2707 current_function_decl = NULL;
2710 /* Verify that call graph edge corresponds to DECL from the associated
2711 statement. Return true if the verification should fail. */
2714 cgraph_edge::verify_corresponds_to_fndecl (tree decl)
2718 if (!decl || callee->global.inlined_to)
2720 if (symtab->state == LTO_STREAMING)
2722 node = cgraph_node::get (decl);
2724 /* We do not know if a node from a different partition is an alias or what it
2725 aliases and therefore cannot do the former_clone_of check reliably. When
2726 body_removed is set, we have lost all information about what was alias or
2727 thunk of and also cannot proceed. */
2729 || node->body_removed
2730 || node->in_other_partition
2731 || callee->icf_merged
2732 || callee->in_other_partition)
2735 node = node->ultimate_alias_target ();
2737 /* Optimizers can redirect unreachable calls or calls triggering undefined
2738 behaviour to builtin_unreachable. */
2739 if (DECL_BUILT_IN_CLASS (callee->decl) == BUILT_IN_NORMAL
2740 && DECL_FUNCTION_CODE (callee->decl) == BUILT_IN_UNREACHABLE)
2743 if (callee->former_clone_of != node->decl
2744 && (node != callee->ultimate_alias_target ())
2745 && !clone_of_p (node, callee))
2751 /* Verify cgraph nodes of given cgraph node. */
2753 cgraph_node::verify_node (void)
2756 function *this_cfun = DECL_STRUCT_FUNCTION (decl);
2757 basic_block this_block;
2758 gimple_stmt_iterator gsi;
2759 bool error_found = false;
2764 timevar_push (TV_CGRAPH_VERIFY);
2765 error_found |= verify_base ();
2766 for (e = callees; e; e = e->next_callee)
2769 error ("aux field set for edge %s->%s",
2770 identifier_to_locale (e->caller->name ()),
2771 identifier_to_locale (e->callee->name ()));
2776 error ("execution count is negative");
2779 if (global.inlined_to && same_comdat_group)
2781 error ("inline clone in same comdat group list");
2784 if (!definition && !in_other_partition && local.local)
2786 error ("local symbols must be defined");
2789 if (global.inlined_to && externally_visible)
2791 error ("externally visible inline clone");
2794 if (global.inlined_to && address_taken)
2796 error ("inline clone with address taken");
2799 if (global.inlined_to && force_output)
2801 error ("inline clone is forced to output");
2804 for (e = indirect_calls; e; e = e->next_callee)
2808 error ("aux field set for indirect edge from %s",
2809 identifier_to_locale (e->caller->name ()));
2812 if (!e->indirect_unknown_callee
2813 || !e->indirect_info)
2815 error ("An indirect edge from %s is not marked as indirect or has "
2816 "associated indirect_info, the corresponding statement is: ",
2817 identifier_to_locale (e->caller->name ()));
2818 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
2822 bool check_comdat = comdat_local_p ();
2823 for (e = callers; e; e = e->next_caller)
2825 if (e->verify_count_and_frequency ())
2828 && !in_same_comdat_group_p (e->caller))
2830 error ("comdat-local function called by %s outside its comdat",
2831 identifier_to_locale (e->caller->name ()));
2834 if (!e->inline_failed)
2836 if (global.inlined_to
2837 != (e->caller->global.inlined_to
2838 ? e->caller->global.inlined_to : e->caller))
2840 error ("inlined_to pointer is wrong");
2843 if (callers->next_caller)
2845 error ("multiple inline callers");
2850 if (global.inlined_to)
2852 error ("inlined_to pointer set for noninline callers");
2856 for (e = callees; e; e = e->next_callee)
2858 if (e->verify_count_and_frequency ())
2860 if (gimple_has_body_p (e->caller->decl)
2861 && !e->caller->global.inlined_to
2863 /* Optimized out calls are redirected to __builtin_unreachable. */
2866 != builtin_decl_implicit (BUILT_IN_UNREACHABLE))
2868 != compute_call_stmt_bb_frequency (e->caller->decl,
2869 gimple_bb (e->call_stmt))))
2871 error ("caller edge frequency %i does not match BB frequency %i",
2873 compute_call_stmt_bb_frequency (e->caller->decl,
2874 gimple_bb (e->call_stmt)));
2878 for (e = indirect_calls; e; e = e->next_callee)
2880 if (e->verify_count_and_frequency ())
2882 if (gimple_has_body_p (e->caller->decl)
2883 && !e->caller->global.inlined_to
2886 != compute_call_stmt_bb_frequency (e->caller->decl,
2887 gimple_bb (e->call_stmt))))
2889 error ("indirect call frequency %i does not match BB frequency %i",
2891 compute_call_stmt_bb_frequency (e->caller->decl,
2892 gimple_bb (e->call_stmt)));
2896 if (!callers && global.inlined_to)
2898 error ("inlined_to pointer is set but no predecessors found");
2901 if (global.inlined_to == this)
2903 error ("inlined_to pointer refers to itself");
2910 for (n = clone_of->clones; n; n = n->next_sibling_clone)
2915 error ("cgraph_node has wrong clone_of");
2922 for (n = clones; n; n = n->next_sibling_clone)
2923 if (n->clone_of != this)
2927 error ("cgraph_node has wrong clone list");
2931 if ((prev_sibling_clone || next_sibling_clone) && !clone_of)
2933 error ("cgraph_node is in clone list but it is not clone");
2936 if (!prev_sibling_clone && clone_of && clone_of->clones != this)
2938 error ("cgraph_node has wrong prev_clone pointer");
2941 if (prev_sibling_clone && prev_sibling_clone->next_sibling_clone != this)
2943 error ("double linked list of clones corrupted");
2947 if (analyzed && alias)
2949 bool ref_found = false;
2951 ipa_ref *ref = NULL;
2955 error ("Alias has call edges");
2958 for (i = 0; iterate_reference (i, ref); i++)
2959 if (ref->use == IPA_REF_CHKP)
2961 else if (ref->use != IPA_REF_ALIAS)
2963 error ("Alias has non-alias reference");
2968 error ("Alias has more than one alias reference");
2975 error ("Analyzed alias has no reference");
2980 /* Check instrumented version reference. */
2981 if (instrumented_version
2982 && instrumented_version->instrumented_version != this)
2984 error ("Instrumentation clone does not reference original node");
2988 /* Cannot have orig_decl for not instrumented nodes. */
2989 if (!instrumentation_clone && orig_decl)
2991 error ("Not instrumented node has non-NULL original declaration");
2995 /* If original not instrumented node still exists then we may check
2996 original declaration is set properly. */
2997 if (instrumented_version
2999 && orig_decl != instrumented_version->decl)
3001 error ("Instrumented node has wrong original declaration");
3005 /* Check all nodes have chkp reference to their instrumented versions. */
3007 && instrumented_version
3008 && !instrumentation_clone)
3010 bool ref_found = false;
3012 struct ipa_ref *ref;
3014 for (i = 0; iterate_reference (i, ref); i++)
3015 if (ref->use == IPA_REF_CHKP)
3019 error ("Node has more than one chkp reference");
3022 if (ref->referred != instrumented_version)
3024 error ("Wrong node is referenced with chkp reference");
3032 error ("Analyzed node has no reference to instrumented version");
3037 if (instrumentation_clone
3038 && DECL_BUILT_IN_CLASS (decl) == NOT_BUILT_IN)
3040 tree name = DECL_ASSEMBLER_NAME (decl);
3041 tree orig_name = DECL_ASSEMBLER_NAME (orig_decl);
3043 if (!IDENTIFIER_TRANSPARENT_ALIAS (name)
3044 || TREE_CHAIN (name) != orig_name)
3046 error ("Alias chain for instrumented node is broken");
3051 if (analyzed && thunk.thunk_p)
3055 error ("No edge out of thunk node");
3058 else if (callees->next_callee)
3060 error ("More than one edge out of thunk node");
3063 if (gimple_has_body_p (decl))
3065 error ("Thunk is not supposed to have body");
3068 if (thunk.add_pointer_bounds_args
3069 && !instrumented_version->semantically_equivalent_p (callees->callee))
3071 error ("Instrumentation thunk has wrong edge callee");
3075 else if (analyzed && gimple_has_body_p (decl)
3076 && !TREE_ASM_WRITTEN (decl)
3077 && (!DECL_EXTERNAL (decl) || global.inlined_to)
3082 hash_set<gimple> stmts;
3084 ipa_ref *ref = NULL;
3086 /* Reach the trees by walking over the CFG, and note the
3087 enclosing basic-blocks in the call edges. */
3088 FOR_EACH_BB_FN (this_block, this_cfun)
3090 for (gsi = gsi_start_phis (this_block);
3091 !gsi_end_p (gsi); gsi_next (&gsi))
3092 stmts.add (gsi_stmt (gsi));
3093 for (gsi = gsi_start_bb (this_block);
3097 gimple stmt = gsi_stmt (gsi);
3099 if (is_gimple_call (stmt))
3101 cgraph_edge *e = get_edge (stmt);
3102 tree decl = gimple_call_fndecl (stmt);
3107 error ("shared call_stmt:");
3108 cgraph_debug_gimple_stmt (this_cfun, stmt);
3111 if (!e->indirect_unknown_callee)
3113 if (e->verify_corresponds_to_fndecl (decl))
3115 error ("edge points to wrong declaration:");
3116 debug_tree (e->callee->decl);
3117 fprintf (stderr," Instead of:");
3124 error ("an indirect edge with unknown callee "
3125 "corresponding to a call_stmt with "
3126 "a known declaration:");
3128 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
3134 error ("missing callgraph edge for call stmt:");
3135 cgraph_debug_gimple_stmt (this_cfun, stmt);
3141 for (i = 0; iterate_reference (i, ref); i++)
3142 if (ref->stmt && !stmts.contains (ref->stmt))
3144 error ("reference to dead statement");
3145 cgraph_debug_gimple_stmt (this_cfun, ref->stmt);
3150 /* No CFG available?! */
3153 for (e = callees; e; e = e->next_callee)
3157 error ("edge %s->%s has no corresponding call_stmt",
3158 identifier_to_locale (e->caller->name ()),
3159 identifier_to_locale (e->callee->name ()));
3160 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
3165 for (e = indirect_calls; e; e = e->next_callee)
3167 if (!e->aux && !e->speculative)
3169 error ("an indirect edge from %s has no corresponding call_stmt",
3170 identifier_to_locale (e->caller->name ()));
3171 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
3180 internal_error ("verify_cgraph_node failed");
3182 timevar_pop (TV_CGRAPH_VERIFY);
3185 /* Verify whole cgraph structure. */
3187 cgraph_node::verify_cgraph_nodes (void)
3194 FOR_EACH_FUNCTION (node)
3198 /* Walk the alias chain to return the function cgraph_node is alias of.
3199 Walk through thunks, too.
3200 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3203 cgraph_node::function_symbol (enum availability *availability)
3205 cgraph_node *node = ultimate_alias_target (availability);
3207 while (node->thunk.thunk_p)
3209 node = node->callees->callee;
3212 enum availability a;
3213 a = node->get_availability ();
3214 if (a < *availability)
3217 node = node->ultimate_alias_target (availability);
3222 /* Walk the alias chain to return the function cgraph_node is alias of.
3223 Walk through non virtual thunks, too. Thus we return either a function
3224 or a virtual thunk node.
3225 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3228 cgraph_node::function_or_virtual_thunk_symbol
3229 (enum availability *availability)
3231 cgraph_node *node = ultimate_alias_target (availability);
3233 while (node->thunk.thunk_p && !node->thunk.virtual_offset_p)
3235 node = node->callees->callee;
3238 enum availability a;
3239 a = node->get_availability ();
3240 if (a < *availability)
3243 node = node->ultimate_alias_target (availability);
3248 /* When doing LTO, read cgraph_node's body from disk if it is not already
3252 cgraph_node::get_untransformed_body (void)
3254 lto_file_decl_data *file_data;
3255 const char *data, *name;
3257 tree decl = this->decl;
3259 if (DECL_RESULT (decl))
3262 gcc_assert (in_lto_p);
3264 timevar_push (TV_IPA_LTO_GIMPLE_IN);
3266 file_data = lto_file_data;
3267 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
3269 /* We may have renamed the declaration, e.g., a static function. */
3270 name = lto_get_decl_name_mapping (file_data, name);
3272 data = lto_get_section_data (file_data, LTO_section_function_body,
3275 fatal_error (input_location, "%s: section %s is missing",
3276 file_data->file_name,
3279 gcc_assert (DECL_STRUCT_FUNCTION (decl) == NULL);
3281 lto_input_function_body (file_data, this, data);
3282 lto_stats.num_function_bodies++;
3283 lto_free_section_data (file_data, LTO_section_function_body, name,
3285 lto_free_function_in_decl_state_for_node (this);
3286 /* Keep lto file data so ipa-inline-analysis knows about cross module
3289 timevar_pop (TV_IPA_LTO_GIMPLE_IN);
3294 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3295 if it is not already present. When some IPA transformations are scheduled,
3299 cgraph_node::get_body (void)
3303 updated = get_untransformed_body ();
3305 /* Getting transformed body makes no sense for inline clones;
3306 we should never use this on real clones becuase they are materialized
3308 TODO: Materializing clones here will likely lead to smaller LTRANS
3310 gcc_assert (!global.inlined_to && !clone_of);
3311 if (ipa_transforms_to_apply.exists ())
3313 opt_pass *saved_current_pass = current_pass;
3314 FILE *saved_dump_file = dump_file;
3315 int saved_dump_flags = dump_flags;
3317 push_cfun (DECL_STRUCT_FUNCTION (decl));
3318 execute_all_ipa_transforms ();
3319 cgraph_edge::rebuild_edges ();
3320 free_dominance_info (CDI_DOMINATORS);
3321 free_dominance_info (CDI_POST_DOMINATORS);
3325 current_pass = saved_current_pass;
3326 dump_file = saved_dump_file;
3327 dump_flags = saved_dump_flags;
3332 /* Return the DECL_STRUCT_FUNCTION of the function. */
3335 cgraph_node::get_fun (void)
3337 cgraph_node *node = this;
3338 struct function *fun = DECL_STRUCT_FUNCTION (node->decl);
3340 while (!fun && node->clone_of)
3342 node = node->clone_of;
3343 fun = DECL_STRUCT_FUNCTION (node->decl);
3349 /* Verify if the type of the argument matches that of the function
3350 declaration. If we cannot verify this or there is a mismatch,
3354 gimple_check_call_args (gimple stmt, tree fndecl, bool args_count_match)
3357 unsigned int i, nargs;
3359 /* Calls to internal functions always match their signature. */
3360 if (gimple_call_internal_p (stmt))
3363 nargs = gimple_call_num_args (stmt);
3365 /* Get argument types for verification. */
3367 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
3369 parms = TYPE_ARG_TYPES (gimple_call_fntype (stmt));
3371 /* Verify if the type of the argument matches that of the function
3372 declaration. If we cannot verify this or there is a mismatch,
3374 if (fndecl && DECL_ARGUMENTS (fndecl))
3376 for (i = 0, p = DECL_ARGUMENTS (fndecl);
3378 i++, p = DECL_CHAIN (p))
3381 /* We cannot distinguish a varargs function from the case
3382 of excess parameters, still deferring the inlining decision
3383 to the callee is possible. */
3386 arg = gimple_call_arg (stmt, i);
3387 if (p == error_mark_node
3388 || DECL_ARG_TYPE (p) == error_mark_node
3389 || arg == error_mark_node
3390 || (!types_compatible_p (DECL_ARG_TYPE (p), TREE_TYPE (arg))
3391 && !fold_convertible_p (DECL_ARG_TYPE (p), arg)))
3394 if (args_count_match && p)
3399 for (i = 0, p = parms; i < nargs; i++, p = TREE_CHAIN (p))
3402 /* If this is a varargs function defer inlining decision
3406 arg = gimple_call_arg (stmt, i);
3407 if (TREE_VALUE (p) == error_mark_node
3408 || arg == error_mark_node
3409 || TREE_CODE (TREE_VALUE (p)) == VOID_TYPE
3410 || (!types_compatible_p (TREE_VALUE (p), TREE_TYPE (arg))
3411 && !fold_convertible_p (TREE_VALUE (p), arg)))
3423 /* Verify if the type of the argument and lhs of CALL_STMT matches
3424 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3425 true, the arg count needs to be the same.
3426 If we cannot verify this or there is a mismatch, return false. */
3429 gimple_check_call_matching_types (gimple call_stmt, tree callee,
3430 bool args_count_match)
3434 if ((DECL_RESULT (callee)
3435 && !DECL_BY_REFERENCE (DECL_RESULT (callee))
3436 && (lhs = gimple_call_lhs (call_stmt)) != NULL_TREE
3437 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee)),
3439 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee)), lhs))
3440 || !gimple_check_call_args (call_stmt, callee, args_count_match))
3445 /* Reset all state within cgraph.c so that we can rerun the compiler
3446 within the same process. For use by toplev::finalize. */
3449 cgraph_c_finalize (void)
3453 x_cgraph_nodes_queue = NULL;
3455 cgraph_fnver_htab = NULL;
3456 version_info_node = NULL;
3459 /* A wroker for call_for_symbol_and_aliases. */
3462 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback) (cgraph_node *,
3465 bool include_overwritable)
3468 FOR_EACH_ALIAS (this, ref)
3470 cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring);
3471 if (include_overwritable
3472 || alias->get_availability () > AVAIL_INTERPOSABLE)
3473 if (alias->call_for_symbol_and_aliases (callback, data,
3474 include_overwritable))
3480 /* Return true if NODE has thunk. */
3483 cgraph_node::has_thunk_p (cgraph_node *node, void *)
3485 for (cgraph_edge *e = node->callers; e; e = e->next_caller)
3486 if (e->caller->thunk.thunk_p)
3491 #include "gt-cgraph.h"