1 /* Callgraph based interprocedural optimizations.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
3 2011 Free Software Foundation, Inc.
4 Contributed by Jan Hubicka
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This module implements main driver of compilation process as well as
23 few basic interprocedural optimizers.
25 The main scope of this file is to act as an interface in between
26 tree based frontends and the backend (and middle end)
28 The front-end is supposed to use following functionality:
30 - cgraph_finalize_function
32 This function is called once front-end has parsed whole body of function
33 and it is certain that the function body nor the declaration will change.
35 (There is one exception needed for implementing GCC extern inline
38 - varpool_finalize_variable
40 This function has same behavior as the above but is used for static
43 - cgraph_finalize_compilation_unit
45 This function is called once (source level) compilation unit is finalized
46 and it will no longer change.
48 In the call-graph construction and local function analysis takes
49 place here. Bodies of unreachable functions are released to
50 conserve memory usage.
52 The function can be called multiple times when multiple source level
53 compilation units are combined (such as in C frontend)
57 In this unit-at-a-time compilation the intra procedural analysis takes
58 place here. In particular the static functions whose address is never
59 taken are marked as local. Backend can then use this information to
60 modify calling conventions, do better inlining or similar optimizations.
62 - cgraph_mark_needed_node
63 - varpool_mark_needed_node
65 When function or variable is referenced by some hidden way the call-graph
66 data structure must be updated accordingly by this function.
67 There should be little need to call this function and all the references
68 should be made explicit to cgraph code. At present these functions are
69 used by C++ frontend to explicitly mark the keyed methods.
71 - analyze_expr callback
73 This function is responsible for lowering tree nodes not understood by
74 generic code into understandable ones or alternatively marking
75 callgraph and varpool nodes referenced by the as needed.
77 ??? On the tree-ssa genericizing should take place here and we will avoid
78 need for these hooks (replacing them by genericizing hook)
80 Analyzing of all functions is deferred
81 to cgraph_finalize_compilation_unit and expansion into cgraph_optimize.
83 In cgraph_finalize_compilation_unit the reachable functions are
84 analyzed. During analysis the call-graph edges from reachable
85 functions are constructed and their destinations are marked as
86 reachable. References to functions and variables are discovered too
87 and variables found to be needed output to the assembly file. Via
88 mark_referenced call in assemble_variable functions referenced by
89 static variables are noticed too.
91 The intra-procedural information is produced and its existence
92 indicated by global_info_ready. Once this flag is set it is impossible
93 to change function from !reachable to reachable and thus
94 assemble_variable no longer call mark_referenced.
96 Finally the call-graph is topologically sorted and all reachable functions
97 that has not been completely inlined or are not external are output.
99 ??? It is possible that reference to function or variable is optimized
100 out. We can not deal with this nicely because topological order is not
101 suitable for it. For tree-ssa we may consider another pass doing
102 optimization and re-discovering reachable functions.
104 ??? Reorganize code so variables are output very last and only if they
105 really has been referenced by produced code, so we catch more cases
106 where reference has been optimized out. */
111 #include "coretypes.h"
115 #include "tree-flow.h"
116 #include "tree-inline.h"
117 #include "langhooks.h"
118 #include "pointer-set.h"
125 #include "diagnostic.h"
126 #include "tree-pretty-print.h"
127 #include "gimple-pretty-print.h"
132 #include "function.h"
133 #include "ipa-prop.h"
135 #include "tree-iterator.h"
136 #include "tree-pass.h"
137 #include "tree-dump.h"
139 #include "coverage.h"
141 #include "ipa-inline.h"
142 #include "ipa-utils.h"
143 #include "lto-streamer.h"
145 static void cgraph_expand_all_functions (void);
146 static void cgraph_mark_functions_to_output (void);
147 static void cgraph_expand_function (struct cgraph_node *);
148 static void cgraph_output_pending_asms (void);
150 FILE *cgraph_dump_file;
152 /* Used for vtable lookup in thunk adjusting. */
153 static GTY (()) tree vtable_entry_type;
155 /* Determine if function DECL is needed. That is, visible to something
156 either outside this translation unit, something magic in the system
160 cgraph_decide_is_function_needed (struct cgraph_node *node, tree decl)
162 /* If the user told us it is used, then it must be so. */
163 if (node->local.externally_visible)
166 /* ??? If the assembler name is set by hand, it is possible to assemble
167 the name later after finalizing the function and the fact is noticed
168 in assemble_name then. This is arguably a bug. */
169 if (DECL_ASSEMBLER_NAME_SET_P (decl)
170 && (!node->thunk.thunk_p && !node->same_body_alias)
171 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)))
174 /* With -fkeep-inline-functions we are keeping all inline functions except
175 for extern inline ones. */
176 if (flag_keep_inline_functions
177 && DECL_DECLARED_INLINE_P (decl)
178 && !DECL_EXTERNAL (decl)
179 && !DECL_DISREGARD_INLINE_LIMITS (decl))
182 /* If we decided it was needed before, but at the time we didn't have
183 the body of the function available, then it's still needed. We have
184 to go back and re-check its dependencies now. */
188 /* Externally visible functions must be output. The exception is
189 COMDAT functions that must be output only when they are needed.
191 When not optimizing, also output the static functions. (see
192 PR24561), but don't do so for always_inline functions, functions
193 declared inline and nested functions. These were optimized out
194 in the original implementation and it is unclear whether we want
195 to change the behavior here. */
196 if (((TREE_PUBLIC (decl)
198 && !DECL_DISREGARD_INLINE_LIMITS (decl)
199 && !DECL_DECLARED_INLINE_P (decl)
200 && !(DECL_CONTEXT (decl)
201 && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)))
202 && !flag_whole_program
204 && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl))
210 /* Process CGRAPH_NEW_FUNCTIONS and perform actions necessary to add these
211 functions into callgraph in a way so they look like ordinary reachable
212 functions inserted into callgraph already at construction time. */
215 cgraph_process_new_functions (void)
219 struct cgraph_node *node;
221 varpool_analyze_pending_decls ();
222 /* Note that this queue may grow as its being processed, as the new
223 functions may generate new ones. */
224 while (cgraph_new_nodes)
226 node = cgraph_new_nodes;
228 cgraph_new_nodes = cgraph_new_nodes->next_needed;
229 switch (cgraph_state)
231 case CGRAPH_STATE_CONSTRUCTION:
232 /* At construction time we just need to finalize function and move
233 it into reachable functions list. */
235 node->next_needed = NULL;
236 cgraph_finalize_function (fndecl, false);
237 cgraph_mark_reachable_node (node);
239 cgraph_call_function_insertion_hooks (node);
242 case CGRAPH_STATE_IPA:
243 case CGRAPH_STATE_IPA_SSA:
244 /* When IPA optimization already started, do all essential
245 transformations that has been already performed on the whole
246 cgraph but not on this function. */
248 gimple_register_cfg_hooks ();
250 cgraph_analyze_function (node);
251 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
252 current_function_decl = fndecl;
253 if ((cgraph_state == CGRAPH_STATE_IPA_SSA
254 && !gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl)))
255 /* When not optimizing, be sure we run early local passes anyway
258 execute_pass_list (pass_early_local_passes.pass.sub);
260 compute_inline_parameters (node, true);
261 free_dominance_info (CDI_POST_DOMINATORS);
262 free_dominance_info (CDI_DOMINATORS);
264 current_function_decl = NULL;
265 cgraph_call_function_insertion_hooks (node);
268 case CGRAPH_STATE_EXPANSION:
269 /* Functions created during expansion shall be compiled
272 cgraph_call_function_insertion_hooks (node);
273 cgraph_expand_function (node);
280 varpool_analyze_pending_decls ();
285 /* As an GCC extension we allow redefinition of the function. The
286 semantics when both copies of bodies differ is not well defined.
287 We replace the old body with new body so in unit at a time mode
288 we always use new body, while in normal mode we may end up with
289 old body inlined into some functions and new body expanded and
292 ??? It may make more sense to use one body for inlining and other
293 body for expanding the function but this is difficult to do. */
296 cgraph_reset_node (struct cgraph_node *node)
298 /* If node->process is set, then we have already begun whole-unit analysis.
299 This is *not* testing for whether we've already emitted the function.
300 That case can be sort-of legitimately seen with real function redefinition
301 errors. I would argue that the front end should never present us with
302 such a case, but don't enforce that for now. */
303 gcc_assert (!node->process);
305 /* Reset our data structures so we can analyze the function again. */
306 memset (&node->local, 0, sizeof (node->local));
307 memset (&node->global, 0, sizeof (node->global));
308 memset (&node->rtl, 0, sizeof (node->rtl));
309 node->analyzed = false;
310 node->local.finalized = false;
312 cgraph_node_remove_callees (node);
316 cgraph_lower_function (struct cgraph_node *node)
322 lower_nested_functions (node->decl);
323 gcc_assert (!node->nested);
325 tree_lowering_passes (node->decl);
326 node->lowered = true;
329 /* DECL has been parsed. Take it, queue it, compile it at the whim of the
330 logic in effect. If NESTED is true, then our caller cannot stand to have
331 the garbage collector run at the moment. We would need to either create
332 a new GC context, or just not compile right now. */
335 cgraph_finalize_function (tree decl, bool nested)
337 struct cgraph_node *node = cgraph_get_create_node (decl);
339 if (node->local.finalized)
341 cgraph_reset_node (node);
342 node->local.redefined_extern_inline = true;
345 notice_global_symbol (decl);
346 node->local.finalized = true;
347 node->lowered = DECL_STRUCT_FUNCTION (decl)->cfg != NULL;
349 if (cgraph_decide_is_function_needed (node, decl))
350 cgraph_mark_needed_node (node);
352 /* Since we reclaim unreachable nodes at the end of every language
353 level unit, we need to be conservative about possible entry points
355 if ((TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl))
356 || DECL_STATIC_CONSTRUCTOR (decl)
357 || DECL_STATIC_DESTRUCTOR (decl)
358 /* COMDAT virtual functions may be referenced by vtable from
359 other compilation unit. Still we want to devirtualize calls
360 to those so we need to analyze them.
361 FIXME: We should introduce may edges for this purpose and update
362 their handling in unreachable function removal and inliner too. */
363 || (DECL_VIRTUAL_P (decl)
364 && optimize && (DECL_COMDAT (decl) || DECL_EXTERNAL (decl))))
365 cgraph_mark_reachable_node (node);
367 /* If we've not yet emitted decl, tell the debug info about it. */
368 if (!TREE_ASM_WRITTEN (decl))
369 (*debug_hooks->deferred_inline_function) (decl);
371 /* Possibly warn about unused parameters. */
372 if (warn_unused_parameter)
373 do_warn_unused_parameter (decl);
379 /* C99 extern inline keywords allow changing of declaration after function
380 has been finalized. We need to re-decide if we want to mark the function as
384 cgraph_mark_if_needed (tree decl)
386 struct cgraph_node *node = cgraph_get_node (decl);
387 if (node->local.finalized && cgraph_decide_is_function_needed (node, decl))
388 cgraph_mark_needed_node (node);
391 /* Return TRUE if NODE2 is equivalent to NODE or its clone. */
393 clone_of_p (struct cgraph_node *node, struct cgraph_node *node2)
395 node = cgraph_function_or_thunk_node (node, NULL);
396 node2 = cgraph_function_or_thunk_node (node2, NULL);
397 while (node != node2 && node2)
398 node2 = node2->clone_of;
399 return node2 != NULL;
402 /* Verify edge E count and frequency. */
405 verify_edge_count_and_frequency (struct cgraph_edge *e)
407 bool error_found = false;
410 error ("caller edge count is negative");
413 if (e->frequency < 0)
415 error ("caller edge frequency is negative");
418 if (e->frequency > CGRAPH_FREQ_MAX)
420 error ("caller edge frequency is too large");
423 if (gimple_has_body_p (e->caller->decl)
424 && !e->caller->global.inlined_to
425 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
426 Remove this once edges are actualy removed from the function at that time. */
428 || (inline_edge_summary_vec
429 && !inline_edge_summary (e)->predicate))
431 != compute_call_stmt_bb_frequency (e->caller->decl,
432 gimple_bb (e->call_stmt))))
434 error ("caller edge frequency %i does not match BB frequency %i",
436 compute_call_stmt_bb_frequency (e->caller->decl,
437 gimple_bb (e->call_stmt)));
443 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
445 cgraph_debug_gimple_stmt (struct function *this_cfun, gimple stmt)
447 /* debug_gimple_stmt needs correct cfun */
448 if (cfun != this_cfun)
449 set_cfun (this_cfun);
450 debug_gimple_stmt (stmt);
453 /* Verify cgraph nodes of given cgraph node. */
455 verify_cgraph_node (struct cgraph_node *node)
457 struct cgraph_edge *e;
458 struct function *this_cfun = DECL_STRUCT_FUNCTION (node->decl);
459 basic_block this_block;
460 gimple_stmt_iterator gsi;
461 bool error_found = false;
466 timevar_push (TV_CGRAPH_VERIFY);
467 for (e = node->callees; e; e = e->next_callee)
470 error ("aux field set for edge %s->%s",
471 identifier_to_locale (cgraph_node_name (e->caller)),
472 identifier_to_locale (cgraph_node_name (e->callee)));
477 error ("execution count is negative");
480 if (node->global.inlined_to && node->local.externally_visible)
482 error ("externally visible inline clone");
485 if (node->global.inlined_to && node->address_taken)
487 error ("inline clone with address taken");
490 if (node->global.inlined_to && node->needed)
492 error ("inline clone is needed");
495 for (e = node->indirect_calls; e; e = e->next_callee)
499 error ("aux field set for indirect edge from %s",
500 identifier_to_locale (cgraph_node_name (e->caller)));
503 if (!e->indirect_unknown_callee
504 || !e->indirect_info)
506 error ("An indirect edge from %s is not marked as indirect or has "
507 "associated indirect_info, the corresponding statement is: ",
508 identifier_to_locale (cgraph_node_name (e->caller)));
509 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
513 for (e = node->callers; e; e = e->next_caller)
515 if (verify_edge_count_and_frequency (e))
517 if (!e->inline_failed)
519 if (node->global.inlined_to
520 != (e->caller->global.inlined_to
521 ? e->caller->global.inlined_to : e->caller))
523 error ("inlined_to pointer is wrong");
526 if (node->callers->next_caller)
528 error ("multiple inline callers");
533 if (node->global.inlined_to)
535 error ("inlined_to pointer set for noninline callers");
539 for (e = node->indirect_calls; e; e = e->next_callee)
540 if (verify_edge_count_and_frequency (e))
542 if (!node->callers && node->global.inlined_to)
544 error ("inlined_to pointer is set but no predecessors found");
547 if (node->global.inlined_to == node)
549 error ("inlined_to pointer refers to itself");
553 if (!cgraph_get_node (node->decl))
555 error ("node not found in cgraph_hash");
561 struct cgraph_node *n;
562 for (n = node->clone_of->clones; n; n = n->next_sibling_clone)
567 error ("node has wrong clone_of");
573 struct cgraph_node *n;
574 for (n = node->clones; n; n = n->next_sibling_clone)
575 if (n->clone_of != node)
579 error ("node has wrong clone list");
583 if ((node->prev_sibling_clone || node->next_sibling_clone) && !node->clone_of)
585 error ("node is in clone list but it is not clone");
588 if (!node->prev_sibling_clone && node->clone_of && node->clone_of->clones != node)
590 error ("node has wrong prev_clone pointer");
593 if (node->prev_sibling_clone && node->prev_sibling_clone->next_sibling_clone != node)
595 error ("double linked list of clones corrupted");
598 if (node->same_comdat_group)
600 struct cgraph_node *n = node->same_comdat_group;
602 if (!DECL_ONE_ONLY (node->decl))
604 error ("non-DECL_ONE_ONLY node in a same_comdat_group list");
609 error ("node is alone in a comdat group");
614 if (!n->same_comdat_group)
616 error ("same_comdat_group is not a circular list");
620 n = n->same_comdat_group;
625 if (node->analyzed && node->alias)
627 bool ref_found = false;
633 error ("Alias has call edges");
636 for (i = 0; ipa_ref_list_reference_iterate (&node->ref_list, i, ref); i++)
637 if (ref->use != IPA_REF_ALIAS)
639 error ("Alias has non-alias refernece");
644 error ("Alias has more than one alias reference");
651 error ("Analyzed alias has no reference");
655 if (node->analyzed && node->thunk.thunk_p)
659 error ("No edge out of thunk node");
662 else if (node->callees->next_callee)
664 error ("More than one edge out of thunk node");
667 if (gimple_has_body_p (node->decl))
669 error ("Thunk is not supposed to have body");
673 else if (node->analyzed && gimple_has_body_p (node->decl)
674 && !TREE_ASM_WRITTEN (node->decl)
675 && (!DECL_EXTERNAL (node->decl) || node->global.inlined_to)
680 /* The nodes we're interested in are never shared, so walk
681 the tree ignoring duplicates. */
682 struct pointer_set_t *visited_nodes = pointer_set_create ();
683 /* Reach the trees by walking over the CFG, and note the
684 enclosing basic-blocks in the call edges. */
685 FOR_EACH_BB_FN (this_block, this_cfun)
686 for (gsi = gsi_start_bb (this_block);
690 gimple stmt = gsi_stmt (gsi);
691 if (is_gimple_call (stmt))
693 struct cgraph_edge *e = cgraph_edge (node, stmt);
694 tree decl = gimple_call_fndecl (stmt);
699 error ("shared call_stmt:");
700 cgraph_debug_gimple_stmt (this_cfun, stmt);
703 if (!e->indirect_unknown_callee)
705 if (!e->callee->global.inlined_to
707 && cgraph_get_node (decl)
708 && (e->callee->former_clone_of
709 != cgraph_get_node (decl)->decl)
710 /* IPA-CP sometimes redirect edge to clone and then back to the former
711 function. This ping-pong has to go, eventaully. */
712 && (cgraph_function_or_thunk_node (cgraph_get_node (decl), NULL)
713 != cgraph_function_or_thunk_node (e->callee, NULL))
714 && !clone_of_p (cgraph_get_node (decl),
717 error ("edge points to wrong declaration:");
718 debug_tree (e->callee->decl);
719 fprintf (stderr," Instead of:");
726 error ("an indirect edge with unknown callee "
727 "corresponding to a call_stmt with "
728 "a known declaration:");
730 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
736 error ("missing callgraph edge for call stmt:");
737 cgraph_debug_gimple_stmt (this_cfun, stmt);
742 pointer_set_destroy (visited_nodes);
745 /* No CFG available?! */
748 for (e = node->callees; e; e = e->next_callee)
752 error ("edge %s->%s has no corresponding call_stmt",
753 identifier_to_locale (cgraph_node_name (e->caller)),
754 identifier_to_locale (cgraph_node_name (e->callee)));
755 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
760 for (e = node->indirect_calls; e; e = e->next_callee)
764 error ("an indirect edge from %s has no corresponding call_stmt",
765 identifier_to_locale (cgraph_node_name (e->caller)));
766 cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
774 dump_cgraph_node (stderr, node);
775 internal_error ("verify_cgraph_node failed");
777 timevar_pop (TV_CGRAPH_VERIFY);
780 /* Verify whole cgraph structure. */
784 struct cgraph_node *node;
789 for (node = cgraph_nodes; node; node = node->next)
790 verify_cgraph_node (node);
793 /* Output all asm statements we have stored up to be output. */
796 cgraph_output_pending_asms (void)
798 struct cgraph_asm_node *can;
803 for (can = cgraph_asm_nodes; can; can = can->next)
804 assemble_asm (can->asm_str);
805 cgraph_asm_nodes = NULL;
808 /* Analyze the function scheduled to be output. */
810 cgraph_analyze_function (struct cgraph_node *node)
812 tree save = current_function_decl;
813 tree decl = node->decl;
815 if (node->alias && node->thunk.alias)
817 struct cgraph_node *tgt = cgraph_get_node (node->thunk.alias);
818 if (!VEC_length (ipa_ref_t, node->ref_list.references))
819 ipa_record_reference (node, NULL, tgt, NULL, IPA_REF_ALIAS, NULL);
820 if (node->same_body_alias)
822 DECL_VIRTUAL_P (node->decl) = DECL_VIRTUAL_P (node->thunk.alias);
823 DECL_DECLARED_INLINE_P (node->decl)
824 = DECL_DECLARED_INLINE_P (node->thunk.alias);
825 DECL_DISREGARD_INLINE_LIMITS (node->decl)
826 = DECL_DISREGARD_INLINE_LIMITS (node->thunk.alias);
829 /* Fixup visibility nonsences C++ frontend produce on same body aliases. */
830 if (TREE_PUBLIC (node->decl) && node->same_body_alias)
832 DECL_EXTERNAL (node->decl) = DECL_EXTERNAL (node->thunk.alias);
833 if (DECL_ONE_ONLY (node->thunk.alias))
835 DECL_COMDAT (node->decl) = DECL_COMDAT (node->thunk.alias);
836 DECL_COMDAT_GROUP (node->decl) = DECL_COMDAT_GROUP (node->thunk.alias);
837 if (DECL_ONE_ONLY (node->thunk.alias) && !node->same_comdat_group)
839 struct cgraph_node *tgt = cgraph_get_node (node->thunk.alias);
840 node->same_comdat_group = tgt;
841 if (!tgt->same_comdat_group)
842 tgt->same_comdat_group = node;
845 struct cgraph_node *n;
846 for (n = tgt->same_comdat_group;
847 n->same_comdat_group != tgt;
848 n = n->same_comdat_group)
850 n->same_comdat_group = node;
855 cgraph_mark_reachable_node (cgraph_alias_aliased_node (node));
856 if (node->address_taken)
857 cgraph_mark_address_taken_node (cgraph_alias_aliased_node (node));
858 if (cgraph_decide_is_function_needed (node, node->decl))
859 cgraph_mark_needed_node (node);
861 else if (node->thunk.thunk_p)
863 cgraph_create_edge (node, cgraph_get_node (node->thunk.alias),
864 NULL, 0, CGRAPH_FREQ_BASE);
868 current_function_decl = decl;
869 push_cfun (DECL_STRUCT_FUNCTION (decl));
871 assign_assembler_name_if_neeeded (node->decl);
873 /* Make sure to gimplify bodies only once. During analyzing a
874 function we lower it, which will require gimplified nested
875 functions, so we can end up here with an already gimplified
877 if (!gimple_body (decl))
878 gimplify_function_tree (decl);
879 dump_function (TDI_generic, decl);
881 cgraph_lower_function (node);
884 node->analyzed = true;
886 current_function_decl = save;
889 /* C++ frontend produce same body aliases all over the place, even before PCH
890 gets streamed out. It relies on us linking the aliases with their function
891 in order to do the fixups, but ipa-ref is not PCH safe. Consequentely we
892 first produce aliases without links, but once C++ FE is sure he won't sream
893 PCH we build the links via this function. */
896 cgraph_process_same_body_aliases (void)
898 struct cgraph_node *node;
899 for (node = cgraph_nodes; node; node = node->next)
900 if (node->same_body_alias
901 && !VEC_length (ipa_ref_t, node->ref_list.references))
903 struct cgraph_node *tgt = cgraph_get_node (node->thunk.alias);
904 ipa_record_reference (node, NULL, tgt, NULL, IPA_REF_ALIAS, NULL);
906 same_body_aliases_done = true;
909 /* Process attributes common for vars and functions. */
912 process_common_attributes (tree decl)
914 tree weakref = lookup_attribute ("weakref", DECL_ATTRIBUTES (decl));
916 if (weakref && !lookup_attribute ("alias", DECL_ATTRIBUTES (decl)))
918 warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wattributes,
919 "%<weakref%> attribute should be accompanied with"
920 " an %<alias%> attribute");
921 DECL_WEAK (decl) = 0;
922 DECL_ATTRIBUTES (decl) = remove_attribute ("weakref",
923 DECL_ATTRIBUTES (decl));
927 /* Look for externally_visible and used attributes and mark cgraph nodes
930 We cannot mark the nodes at the point the attributes are processed (in
931 handle_*_attribute) because the copy of the declarations available at that
932 point may not be canonical. For example, in:
935 void f() __attribute__((used));
937 the declaration we see in handle_used_attribute will be the second
938 declaration -- but the front end will subsequently merge that declaration
939 with the original declaration and discard the second declaration.
941 Furthermore, we can't mark these nodes in cgraph_finalize_function because:
944 void f() __attribute__((externally_visible));
948 So, we walk the nodes at the end of the translation unit, applying the
949 attributes at that point. */
952 process_function_and_variable_attributes (struct cgraph_node *first,
953 struct varpool_node *first_var)
955 struct cgraph_node *node;
956 struct varpool_node *vnode;
958 for (node = cgraph_nodes; node != first; node = node->next)
960 tree decl = node->decl;
961 if (DECL_PRESERVE_P (decl))
962 cgraph_mark_needed_node (node);
963 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
964 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl))
965 && TREE_PUBLIC (node->decl))
967 if (node->local.finalized)
968 cgraph_mark_needed_node (node);
970 else if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl)))
972 if (! TREE_PUBLIC (node->decl))
973 warning_at (DECL_SOURCE_LOCATION (node->decl), OPT_Wattributes,
974 "%<externally_visible%>"
975 " attribute have effect only on public objects");
976 else if (node->local.finalized)
977 cgraph_mark_needed_node (node);
979 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl))
980 && (node->local.finalized && !node->alias))
982 warning_at (DECL_SOURCE_LOCATION (node->decl), OPT_Wattributes,
983 "%<weakref%> attribute ignored"
984 " because function is defined");
985 DECL_WEAK (decl) = 0;
986 DECL_ATTRIBUTES (decl) = remove_attribute ("weakref",
987 DECL_ATTRIBUTES (decl));
990 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (decl))
991 && !DECL_DECLARED_INLINE_P (decl)
992 /* redefining extern inline function makes it DECL_UNINLINABLE. */
993 && !DECL_UNINLINABLE (decl))
994 warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wattributes,
995 "always_inline function might not be inlinable");
997 process_common_attributes (decl);
999 for (vnode = varpool_nodes; vnode != first_var; vnode = vnode->next)
1001 tree decl = vnode->decl;
1002 if (DECL_PRESERVE_P (decl))
1004 vnode->force_output = true;
1005 if (vnode->finalized)
1006 varpool_mark_needed_node (vnode);
1008 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
1009 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl))
1010 && TREE_PUBLIC (vnode->decl))
1012 if (vnode->finalized)
1013 varpool_mark_needed_node (vnode);
1015 else if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl)))
1017 if (! TREE_PUBLIC (vnode->decl))
1018 warning_at (DECL_SOURCE_LOCATION (vnode->decl), OPT_Wattributes,
1019 "%<externally_visible%>"
1020 " attribute have effect only on public objects");
1021 else if (vnode->finalized)
1022 varpool_mark_needed_node (vnode);
1024 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl))
1026 && DECL_INITIAL (decl))
1028 warning_at (DECL_SOURCE_LOCATION (vnode->decl), OPT_Wattributes,
1029 "%<weakref%> attribute ignored"
1030 " because variable is initialized");
1031 DECL_WEAK (decl) = 0;
1032 DECL_ATTRIBUTES (decl) = remove_attribute ("weakref",
1033 DECL_ATTRIBUTES (decl));
1035 process_common_attributes (decl);
1039 /* Process CGRAPH_NODES_NEEDED queue, analyze each function (and transitively
1040 each reachable functions) and build cgraph.
1041 The function can be called multiple times after inserting new nodes
1042 into beginning of queue. Just the new part of queue is re-scanned then. */
1045 cgraph_analyze_functions (void)
1047 /* Keep track of already processed nodes when called multiple times for
1048 intermodule optimization. */
1049 static struct cgraph_node *first_analyzed;
1050 struct cgraph_node *first_processed = first_analyzed;
1051 static struct varpool_node *first_analyzed_var;
1052 struct cgraph_node *node, *next;
1054 bitmap_obstack_initialize (NULL);
1055 process_function_and_variable_attributes (first_processed,
1056 first_analyzed_var);
1057 first_processed = cgraph_nodes;
1058 first_analyzed_var = varpool_nodes;
1059 varpool_analyze_pending_decls ();
1060 if (cgraph_dump_file)
1062 fprintf (cgraph_dump_file, "Initial entry points:");
1063 for (node = cgraph_nodes; node != first_analyzed; node = node->next)
1065 fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
1066 fprintf (cgraph_dump_file, "\n");
1068 cgraph_process_new_functions ();
1070 /* Propagate reachability flag and lower representation of all reachable
1071 functions. In the future, lowering will introduce new functions and
1072 new entry points on the way (by template instantiation and virtual
1073 method table generation for instance). */
1074 while (cgraph_nodes_queue)
1076 struct cgraph_edge *edge;
1077 tree decl = cgraph_nodes_queue->decl;
1079 node = cgraph_nodes_queue;
1080 cgraph_nodes_queue = cgraph_nodes_queue->next_needed;
1081 node->next_needed = NULL;
1083 /* ??? It is possible to create extern inline function and later using
1084 weak alias attribute to kill its body. See
1085 gcc.c-torture/compile/20011119-1.c */
1086 if (!DECL_STRUCT_FUNCTION (decl)
1087 && (!node->alias || !node->thunk.alias)
1088 && !node->thunk.thunk_p)
1090 cgraph_reset_node (node);
1091 node->local.redefined_extern_inline = true;
1095 if (!node->analyzed)
1096 cgraph_analyze_function (node);
1098 for (edge = node->callees; edge; edge = edge->next_callee)
1099 if (!edge->callee->reachable)
1100 cgraph_mark_reachable_node (edge->callee);
1101 for (edge = node->callers; edge; edge = edge->next_caller)
1102 if (!edge->caller->reachable && edge->caller->thunk.thunk_p)
1103 cgraph_mark_reachable_node (edge->caller);
1105 if (node->same_comdat_group)
1107 for (next = node->same_comdat_group;
1109 next = next->same_comdat_group)
1110 cgraph_mark_reachable_node (next);
1113 /* If decl is a clone of an abstract function, mark that abstract
1114 function so that we don't release its body. The DECL_INITIAL() of that
1115 abstract function declaration will be later needed to output debug
1117 if (DECL_ABSTRACT_ORIGIN (decl))
1119 struct cgraph_node *origin_node;
1120 origin_node = cgraph_get_node (DECL_ABSTRACT_ORIGIN (decl));
1121 origin_node->abstract_and_needed = true;
1124 /* We finalize local static variables during constructing callgraph
1125 edges. Process their attributes too. */
1126 process_function_and_variable_attributes (first_processed,
1127 first_analyzed_var);
1128 first_processed = cgraph_nodes;
1129 first_analyzed_var = varpool_nodes;
1130 varpool_analyze_pending_decls ();
1131 cgraph_process_new_functions ();
1134 /* Collect entry points to the unit. */
1135 if (cgraph_dump_file)
1137 fprintf (cgraph_dump_file, "Unit entry points:");
1138 for (node = cgraph_nodes; node != first_analyzed; node = node->next)
1140 fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
1141 fprintf (cgraph_dump_file, "\n\nInitial ");
1142 dump_cgraph (cgraph_dump_file);
1143 dump_varpool (cgraph_dump_file);
1146 if (cgraph_dump_file)
1147 fprintf (cgraph_dump_file, "\nReclaiming functions:");
1149 for (node = cgraph_nodes; node != first_analyzed; node = next)
1151 tree decl = node->decl;
1154 if (node->local.finalized && !gimple_has_body_p (decl)
1155 && (!node->alias || !node->thunk.alias)
1156 && !node->thunk.thunk_p)
1157 cgraph_reset_node (node);
1159 if (!node->reachable
1160 && (gimple_has_body_p (decl) || node->thunk.thunk_p
1161 || (node->alias && node->thunk.alias)))
1163 if (cgraph_dump_file)
1164 fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
1165 cgraph_remove_node (node);
1169 node->next_needed = NULL;
1170 gcc_assert (!node->local.finalized || node->thunk.thunk_p
1172 || gimple_has_body_p (decl));
1173 gcc_assert (node->analyzed == node->local.finalized);
1175 if (cgraph_dump_file)
1177 fprintf (cgraph_dump_file, "\n\nReclaimed ");
1178 dump_cgraph (cgraph_dump_file);
1179 dump_varpool (cgraph_dump_file);
1181 bitmap_obstack_release (NULL);
1182 first_analyzed = cgraph_nodes;
1186 /* Translate the ugly representation of aliases as alias pairs into nice
1187 representation in callgraph. We don't handle all cases yet,
1191 handle_alias_pairs (void)
1195 struct cgraph_node *target_node;
1196 struct cgraph_node *src_node;
1197 struct varpool_node *target_vnode;
1199 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p);)
1201 if (TREE_CODE (p->decl) == FUNCTION_DECL
1202 && !lookup_attribute ("weakref", DECL_ATTRIBUTES (p->decl))
1203 && (target_node = cgraph_node_for_asm (p->target)) != NULL)
1205 src_node = cgraph_get_node (p->decl);
1206 if (src_node && src_node->local.finalized)
1207 cgraph_reset_node (src_node);
1208 /* Normally EXTERNAL flag is used to mark external inlines,
1209 however for aliases it seems to be allowed to use it w/o
1210 any meaning. See gcc.dg/attr-alias-3.c
1211 However for weakref we insist on EXTERNAL flag being set.
1212 See gcc.dg/attr-alias-5.c */
1213 if (DECL_EXTERNAL (p->decl))
1214 DECL_EXTERNAL (p->decl) = 0;
1215 cgraph_create_function_alias (p->decl, target_node->decl);
1216 VEC_unordered_remove (alias_pair, alias_pairs, i);
1218 else if (TREE_CODE (p->decl) == VAR_DECL
1219 && !lookup_attribute ("weakref", DECL_ATTRIBUTES (p->decl))
1220 && (target_vnode = varpool_node_for_asm (p->target)) != NULL)
1222 /* Normally EXTERNAL flag is used to mark external inlines,
1223 however for aliases it seems to be allowed to use it w/o
1224 any meaning. See gcc.dg/attr-alias-3.c
1225 However for weakref we insist on EXTERNAL flag being set.
1226 See gcc.dg/attr-alias-5.c */
1227 if (DECL_EXTERNAL (p->decl))
1228 DECL_EXTERNAL (p->decl) = 0;
1229 varpool_create_variable_alias (p->decl, target_vnode->decl);
1230 VEC_unordered_remove (alias_pair, alias_pairs, i);
1235 fprintf (dump_file, "Unhandled alias %s->%s\n",
1236 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (p->decl)),
1237 IDENTIFIER_POINTER (p->target));
1245 /* Analyze the whole compilation unit once it is parsed completely. */
1248 cgraph_finalize_compilation_unit (void)
1250 timevar_push (TV_CGRAPH);
1252 /* If LTO is enabled, initialize the streamer hooks needed by GIMPLE. */
1254 lto_streamer_hooks_init ();
1256 /* If we're here there's no current function anymore. Some frontends
1257 are lazy in clearing these. */
1258 current_function_decl = NULL;
1261 /* Do not skip analyzing the functions if there were errors, we
1262 miss diagnostics for following functions otherwise. */
1264 /* Emit size functions we didn't inline. */
1265 finalize_size_functions ();
1267 /* Mark alias targets necessary and emit diagnostics. */
1268 finish_aliases_1 ();
1269 handle_alias_pairs ();
1273 fprintf (stderr, "\nAnalyzing compilation unit\n");
1277 if (flag_dump_passes)
1280 /* Gimplify and lower all functions, compute reachability and
1281 remove unreachable nodes. */
1282 cgraph_analyze_functions ();
1284 /* Mark alias targets necessary and emit diagnostics. */
1285 finish_aliases_1 ();
1286 handle_alias_pairs ();
1288 /* Gimplify and lower thunks. */
1289 cgraph_analyze_functions ();
1291 /* Finally drive the pass manager. */
1294 timevar_pop (TV_CGRAPH);
1298 /* Figure out what functions we want to assemble. */
1301 cgraph_mark_functions_to_output (void)
1303 struct cgraph_node *node;
1304 #ifdef ENABLE_CHECKING
1305 bool check_same_comdat_groups = false;
1307 for (node = cgraph_nodes; node; node = node->next)
1308 gcc_assert (!node->process);
1311 for (node = cgraph_nodes; node; node = node->next)
1313 tree decl = node->decl;
1314 struct cgraph_edge *e;
1316 gcc_assert (!node->process || node->same_comdat_group);
1320 for (e = node->callers; e; e = e->next_caller)
1321 if (e->inline_failed)
1324 /* We need to output all local functions that are used and not
1325 always inlined, as well as those that are reachable from
1326 outside the current compilation unit. */
1328 && !node->thunk.thunk_p
1330 && !node->global.inlined_to
1331 && (!cgraph_only_called_directly_p (node)
1332 || ((e || ipa_ref_has_aliases_p (&node->ref_list))
1333 && node->reachable))
1334 && !TREE_ASM_WRITTEN (decl)
1335 && !DECL_EXTERNAL (decl))
1338 if (node->same_comdat_group)
1340 struct cgraph_node *next;
1341 for (next = node->same_comdat_group;
1343 next = next->same_comdat_group)
1344 if (!next->thunk.thunk_p && !next->alias)
1348 else if (node->same_comdat_group)
1350 #ifdef ENABLE_CHECKING
1351 check_same_comdat_groups = true;
1356 /* We should've reclaimed all functions that are not needed. */
1357 #ifdef ENABLE_CHECKING
1358 if (!node->global.inlined_to
1359 && gimple_has_body_p (decl)
1360 /* FIXME: in ltrans unit when offline copy is outside partition but inline copies
1361 are inside partition, we can end up not removing the body since we no longer
1362 have analyzed node pointing to it. */
1363 && !node->in_other_partition
1365 && !DECL_EXTERNAL (decl))
1367 dump_cgraph_node (stderr, node);
1368 internal_error ("failed to reclaim unneeded function");
1371 gcc_assert (node->global.inlined_to
1372 || !gimple_has_body_p (decl)
1373 || node->in_other_partition
1374 || DECL_EXTERNAL (decl));
1379 #ifdef ENABLE_CHECKING
1380 if (check_same_comdat_groups)
1381 for (node = cgraph_nodes; node; node = node->next)
1382 if (node->same_comdat_group && !node->process)
1384 tree decl = node->decl;
1385 if (!node->global.inlined_to
1386 && gimple_has_body_p (decl)
1387 /* FIXME: in ltrans unit when offline copy is outside partition but inline copies
1388 are inside partition, we can end up not removing the body since we no longer
1389 have analyzed node pointing to it. */
1390 && !node->in_other_partition
1391 && !DECL_EXTERNAL (decl))
1393 dump_cgraph_node (stderr, node);
1394 internal_error ("failed to reclaim unneeded functionin same comdat group");
1400 /* DECL is FUNCTION_DECL. Initialize datastructures so DECL is a function
1401 in lowered gimple form.
1403 Set current_function_decl and cfun to newly constructed empty function body.
1404 return basic block in the function body. */
1407 init_lowered_empty_function (tree decl)
1411 current_function_decl = decl;
1412 allocate_struct_function (decl, false);
1413 gimple_register_cfg_hooks ();
1414 init_empty_tree_cfg ();
1415 init_tree_ssa (cfun);
1416 init_ssa_operands ();
1417 cfun->gimple_df->in_ssa_p = true;
1418 DECL_INITIAL (decl) = make_node (BLOCK);
1420 DECL_SAVED_TREE (decl) = error_mark_node;
1421 cfun->curr_properties |=
1422 (PROP_gimple_lcf | PROP_gimple_leh | PROP_cfg | PROP_referenced_vars |
1423 PROP_ssa | PROP_gimple_any);
1425 /* Create BB for body of the function and connect it properly. */
1426 bb = create_basic_block (NULL, (void *) 0, ENTRY_BLOCK_PTR);
1427 make_edge (ENTRY_BLOCK_PTR, bb, 0);
1428 make_edge (bb, EXIT_BLOCK_PTR, 0);
1433 /* Adjust PTR by the constant FIXED_OFFSET, and by the vtable
1434 offset indicated by VIRTUAL_OFFSET, if that is
1435 non-null. THIS_ADJUSTING is nonzero for a this adjusting thunk and
1436 zero for a result adjusting thunk. */
1439 thunk_adjust (gimple_stmt_iterator * bsi,
1440 tree ptr, bool this_adjusting,
1441 HOST_WIDE_INT fixed_offset, tree virtual_offset)
1447 && fixed_offset != 0)
1449 stmt = gimple_build_assign (ptr,
1450 fold_build2_loc (input_location,
1452 TREE_TYPE (ptr), ptr,
1453 size_int (fixed_offset)));
1454 gsi_insert_after (bsi, stmt, GSI_NEW_STMT);
1457 /* If there's a virtual offset, look up that value in the vtable and
1458 adjust the pointer again. */
1466 if (!vtable_entry_type)
1468 tree vfunc_type = make_node (FUNCTION_TYPE);
1469 TREE_TYPE (vfunc_type) = integer_type_node;
1470 TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
1471 layout_type (vfunc_type);
1473 vtable_entry_type = build_pointer_type (vfunc_type);
1477 create_tmp_var (build_pointer_type
1478 (build_pointer_type (vtable_entry_type)), "vptr");
1480 /* The vptr is always at offset zero in the object. */
1481 stmt = gimple_build_assign (vtabletmp,
1482 build1 (NOP_EXPR, TREE_TYPE (vtabletmp),
1484 gsi_insert_after (bsi, stmt, GSI_NEW_STMT);
1485 mark_symbols_for_renaming (stmt);
1486 find_referenced_vars_in (stmt);
1488 /* Form the vtable address. */
1489 vtabletmp2 = create_tmp_var (TREE_TYPE (TREE_TYPE (vtabletmp)),
1491 stmt = gimple_build_assign (vtabletmp2,
1492 build_simple_mem_ref (vtabletmp));
1493 gsi_insert_after (bsi, stmt, GSI_NEW_STMT);
1494 mark_symbols_for_renaming (stmt);
1495 find_referenced_vars_in (stmt);
1497 /* Find the entry with the vcall offset. */
1498 stmt = gimple_build_assign (vtabletmp2,
1499 fold_build2_loc (input_location,
1501 TREE_TYPE (vtabletmp2),
1503 fold_convert (sizetype,
1505 gsi_insert_after (bsi, stmt, GSI_NEW_STMT);
1507 /* Get the offset itself. */
1508 vtabletmp3 = create_tmp_var (TREE_TYPE (TREE_TYPE (vtabletmp2)),
1510 stmt = gimple_build_assign (vtabletmp3,
1511 build_simple_mem_ref (vtabletmp2));
1512 gsi_insert_after (bsi, stmt, GSI_NEW_STMT);
1513 mark_symbols_for_renaming (stmt);
1514 find_referenced_vars_in (stmt);
1516 /* Cast to sizetype. */
1517 offsettmp = create_tmp_var (sizetype, "offset");
1518 stmt = gimple_build_assign (offsettmp, fold_convert (sizetype, vtabletmp3));
1519 gsi_insert_after (bsi, stmt, GSI_NEW_STMT);
1520 mark_symbols_for_renaming (stmt);
1521 find_referenced_vars_in (stmt);
1523 /* Adjust the `this' pointer. */
1524 ptr = fold_build2_loc (input_location,
1525 POINTER_PLUS_EXPR, TREE_TYPE (ptr), ptr,
1530 && fixed_offset != 0)
1531 /* Adjust the pointer by the constant. */
1535 if (TREE_CODE (ptr) == VAR_DECL)
1539 ptrtmp = create_tmp_var (TREE_TYPE (ptr), "ptr");
1540 stmt = gimple_build_assign (ptrtmp, ptr);
1541 gsi_insert_after (bsi, stmt, GSI_NEW_STMT);
1542 mark_symbols_for_renaming (stmt);
1543 find_referenced_vars_in (stmt);
1545 ptr = fold_build2_loc (input_location,
1546 POINTER_PLUS_EXPR, TREE_TYPE (ptrtmp), ptrtmp,
1547 size_int (fixed_offset));
1550 /* Emit the statement and gimplify the adjustment expression. */
1551 ret = create_tmp_var (TREE_TYPE (ptr), "adjusted_this");
1552 stmt = gimple_build_assign (ret, ptr);
1553 mark_symbols_for_renaming (stmt);
1554 find_referenced_vars_in (stmt);
1555 gsi_insert_after (bsi, stmt, GSI_NEW_STMT);
1560 /* Produce assembler for thunk NODE. */
1563 assemble_thunk (struct cgraph_node *node)
1565 bool this_adjusting = node->thunk.this_adjusting;
1566 HOST_WIDE_INT fixed_offset = node->thunk.fixed_offset;
1567 HOST_WIDE_INT virtual_value = node->thunk.virtual_value;
1568 tree virtual_offset = NULL;
1569 tree alias = node->thunk.alias;
1570 tree thunk_fndecl = node->decl;
1571 tree a = DECL_ARGUMENTS (thunk_fndecl);
1573 current_function_decl = thunk_fndecl;
1575 /* Ensure thunks are emitted in their correct sections. */
1576 resolve_unique_section (thunk_fndecl, 0, flag_function_sections);
1579 && targetm.asm_out.can_output_mi_thunk (thunk_fndecl, fixed_offset,
1580 virtual_value, alias))
1584 tree restype = TREE_TYPE (TREE_TYPE (thunk_fndecl));
1586 DECL_RESULT (thunk_fndecl)
1587 = build_decl (DECL_SOURCE_LOCATION (thunk_fndecl),
1588 RESULT_DECL, 0, restype);
1589 fnname = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk_fndecl));
1591 /* The back end expects DECL_INITIAL to contain a BLOCK, so we
1593 fn_block = make_node (BLOCK);
1594 BLOCK_VARS (fn_block) = a;
1595 DECL_INITIAL (thunk_fndecl) = fn_block;
1596 init_function_start (thunk_fndecl);
1598 assemble_start_function (thunk_fndecl, fnname);
1600 targetm.asm_out.output_mi_thunk (asm_out_file, thunk_fndecl,
1601 fixed_offset, virtual_value, alias);
1603 assemble_end_function (thunk_fndecl, fnname);
1604 init_insn_lengths ();
1605 free_after_compilation (cfun);
1607 TREE_ASM_WRITTEN (thunk_fndecl) = 1;
1608 node->thunk.thunk_p = false;
1609 node->analyzed = false;
1614 basic_block bb, then_bb, else_bb, return_bb;
1615 gimple_stmt_iterator bsi;
1621 VEC(tree, heap) *vargs;
1626 DECL_IGNORED_P (thunk_fndecl) = 1;
1627 bitmap_obstack_initialize (NULL);
1629 if (node->thunk.virtual_offset_p)
1630 virtual_offset = size_int (virtual_value);
1632 /* Build the return declaration for the function. */
1633 restype = TREE_TYPE (TREE_TYPE (thunk_fndecl));
1634 if (DECL_RESULT (thunk_fndecl) == NULL_TREE)
1636 resdecl = build_decl (input_location, RESULT_DECL, 0, restype);
1637 DECL_ARTIFICIAL (resdecl) = 1;
1638 DECL_IGNORED_P (resdecl) = 1;
1639 DECL_RESULT (thunk_fndecl) = resdecl;
1642 resdecl = DECL_RESULT (thunk_fndecl);
1644 bb = then_bb = else_bb = return_bb = init_lowered_empty_function (thunk_fndecl);
1646 bsi = gsi_start_bb (bb);
1648 /* Build call to the function being thunked. */
1649 if (!VOID_TYPE_P (restype))
1651 if (!is_gimple_reg_type (restype))
1654 add_local_decl (cfun, restmp);
1655 BLOCK_VARS (DECL_INITIAL (current_function_decl)) = restmp;
1658 restmp = create_tmp_var_raw (restype, "retval");
1661 for (arg = a; arg; arg = DECL_CHAIN (arg))
1663 vargs = VEC_alloc (tree, heap, nargs);
1665 VEC_quick_push (tree, vargs,
1670 VEC_quick_push (tree, vargs, a);
1671 for (i = 1, arg = DECL_CHAIN (a); i < nargs; i++, arg = DECL_CHAIN (arg))
1672 VEC_quick_push (tree, vargs, arg);
1673 call = gimple_build_call_vec (build_fold_addr_expr_loc (0, alias), vargs);
1674 VEC_free (tree, heap, vargs);
1675 gimple_call_set_cannot_inline (call, true);
1676 gimple_call_set_from_thunk (call, true);
1678 gimple_call_set_lhs (call, restmp);
1679 gsi_insert_after (&bsi, call, GSI_NEW_STMT);
1680 mark_symbols_for_renaming (call);
1681 find_referenced_vars_in (call);
1684 if (restmp && !this_adjusting)
1686 tree true_label = NULL_TREE;
1688 if (TREE_CODE (TREE_TYPE (restmp)) == POINTER_TYPE)
1691 /* If the return type is a pointer, we need to
1692 protect against NULL. We know there will be an
1693 adjustment, because that's why we're emitting a
1695 then_bb = create_basic_block (NULL, (void *) 0, bb);
1696 return_bb = create_basic_block (NULL, (void *) 0, then_bb);
1697 else_bb = create_basic_block (NULL, (void *) 0, else_bb);
1698 remove_edge (single_succ_edge (bb));
1699 true_label = gimple_block_label (then_bb);
1700 stmt = gimple_build_cond (NE_EXPR, restmp,
1701 build_zero_cst (TREE_TYPE (restmp)),
1702 NULL_TREE, NULL_TREE);
1703 gsi_insert_after (&bsi, stmt, GSI_NEW_STMT);
1704 make_edge (bb, then_bb, EDGE_TRUE_VALUE);
1705 make_edge (bb, else_bb, EDGE_FALSE_VALUE);
1706 make_edge (return_bb, EXIT_BLOCK_PTR, 0);
1707 make_edge (then_bb, return_bb, EDGE_FALLTHRU);
1708 make_edge (else_bb, return_bb, EDGE_FALLTHRU);
1709 bsi = gsi_last_bb (then_bb);
1712 restmp = thunk_adjust (&bsi, restmp, /*this_adjusting=*/0,
1713 fixed_offset, virtual_offset);
1717 bsi = gsi_last_bb (else_bb);
1718 stmt = gimple_build_assign (restmp,
1719 build_zero_cst (TREE_TYPE (restmp)));
1720 gsi_insert_after (&bsi, stmt, GSI_NEW_STMT);
1721 bsi = gsi_last_bb (return_bb);
1725 gimple_call_set_tail (call, true);
1727 /* Build return value. */
1728 ret = gimple_build_return (restmp);
1729 gsi_insert_after (&bsi, ret, GSI_NEW_STMT);
1731 delete_unreachable_blocks ();
1732 update_ssa (TODO_update_ssa);
1734 /* Since we want to emit the thunk, we explicitly mark its name as
1736 node->thunk.thunk_p = false;
1737 cgraph_node_remove_callees (node);
1738 cgraph_add_new_function (thunk_fndecl, true);
1739 bitmap_obstack_release (NULL);
1741 current_function_decl = NULL;
1746 /* Assemble thunks and aliases asociated to NODE. */
1749 assemble_thunks_and_aliases (struct cgraph_node *node)
1751 struct cgraph_edge *e;
1753 struct ipa_ref *ref;
1755 for (e = node->callers; e;)
1756 if (e->caller->thunk.thunk_p)
1758 struct cgraph_node *thunk = e->caller;
1761 assemble_thunks_and_aliases (thunk);
1762 assemble_thunk (thunk);
1766 for (i = 0; ipa_ref_list_refering_iterate (&node->ref_list, i, ref); i++)
1767 if (ref->use == IPA_REF_ALIAS)
1769 struct cgraph_node *alias = ipa_ref_refering_node (ref);
1770 assemble_alias (alias->decl,
1771 DECL_ASSEMBLER_NAME (alias->thunk.alias));
1772 assemble_thunks_and_aliases (alias);
1776 /* Expand function specified by NODE. */
1779 cgraph_expand_function (struct cgraph_node *node)
1781 tree decl = node->decl;
1783 /* We ought to not compile any inline clones. */
1784 gcc_assert (!node->global.inlined_to);
1786 announce_function (decl);
1788 assemble_thunks_and_aliases (node);
1789 gcc_assert (node->lowered);
1791 /* Generate RTL for the body of DECL. */
1792 tree_rest_of_compilation (decl);
1794 /* Make sure that BE didn't give up on compiling. */
1795 gcc_assert (TREE_ASM_WRITTEN (decl));
1796 current_function_decl = NULL;
1797 gcc_assert (!cgraph_preserve_function_body_p (node));
1798 cgraph_release_function_body (node);
1799 /* Eliminate all call edges. This is important so the GIMPLE_CALL no longer
1800 points to the dead function body. */
1801 cgraph_node_remove_callees (node);
1803 cgraph_function_flags_ready = true;
1806 /* Return true when CALLER_DECL should be inlined into CALLEE_DECL. */
1809 cgraph_inline_p (struct cgraph_edge *e, cgraph_inline_failed_t *reason)
1811 *reason = e->inline_failed;
1812 return !e->inline_failed;
1817 /* Expand all functions that must be output.
1819 Attempt to topologically sort the nodes so function is output when
1820 all called functions are already assembled to allow data to be
1821 propagated across the callgraph. Use a stack to get smaller distance
1822 between a function and its callees (later we may choose to use a more
1823 sophisticated algorithm for function reordering; we will likely want
1824 to use subsections to make the output functions appear in top-down
1828 cgraph_expand_all_functions (void)
1830 struct cgraph_node *node;
1831 struct cgraph_node **order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
1832 int order_pos, new_order_pos = 0;
1835 order_pos = ipa_reverse_postorder (order);
1836 gcc_assert (order_pos == cgraph_n_nodes);
1838 /* Garbage collector may remove inline clones we eliminate during
1839 optimization. So we must be sure to not reference them. */
1840 for (i = 0; i < order_pos; i++)
1841 if (order[i]->process)
1842 order[new_order_pos++] = order[i];
1844 for (i = new_order_pos - 1; i >= 0; i--)
1849 gcc_assert (node->reachable);
1851 cgraph_expand_function (node);
1854 cgraph_process_new_functions ();
1860 /* This is used to sort the node types by the cgraph order number. */
1862 enum cgraph_order_sort_kind
1864 ORDER_UNDEFINED = 0,
1870 struct cgraph_order_sort
1872 enum cgraph_order_sort_kind kind;
1875 struct cgraph_node *f;
1876 struct varpool_node *v;
1877 struct cgraph_asm_node *a;
1881 /* Output all functions, variables, and asm statements in the order
1882 according to their order fields, which is the order in which they
1883 appeared in the file. This implements -fno-toplevel-reorder. In
1884 this mode we may output functions and variables which don't really
1885 need to be output. */
1888 cgraph_output_in_order (void)
1891 struct cgraph_order_sort *nodes;
1893 struct cgraph_node *pf;
1894 struct varpool_node *pv;
1895 struct cgraph_asm_node *pa;
1898 nodes = XCNEWVEC (struct cgraph_order_sort, max);
1900 varpool_analyze_pending_decls ();
1902 for (pf = cgraph_nodes; pf; pf = pf->next)
1904 if (pf->process && !pf->thunk.thunk_p && !pf->alias)
1907 gcc_assert (nodes[i].kind == ORDER_UNDEFINED);
1908 nodes[i].kind = ORDER_FUNCTION;
1913 for (pv = varpool_nodes_queue; pv; pv = pv->next_needed)
1916 gcc_assert (nodes[i].kind == ORDER_UNDEFINED);
1917 nodes[i].kind = ORDER_VAR;
1921 for (pa = cgraph_asm_nodes; pa; pa = pa->next)
1924 gcc_assert (nodes[i].kind == ORDER_UNDEFINED);
1925 nodes[i].kind = ORDER_ASM;
1929 /* In toplevel reorder mode we output all statics; mark them as needed. */
1930 for (i = 0; i < max; ++i)
1932 if (nodes[i].kind == ORDER_VAR)
1934 varpool_mark_needed_node (nodes[i].u.v);
1937 varpool_empty_needed_queue ();
1939 for (i = 0; i < max; ++i)
1940 if (nodes[i].kind == ORDER_VAR)
1941 varpool_finalize_named_section_flags (nodes[i].u.v);
1943 for (i = 0; i < max; ++i)
1945 switch (nodes[i].kind)
1947 case ORDER_FUNCTION:
1948 nodes[i].u.f->process = 0;
1949 cgraph_expand_function (nodes[i].u.f);
1953 varpool_assemble_decl (nodes[i].u.v);
1957 assemble_asm (nodes[i].u.a->asm_str);
1960 case ORDER_UNDEFINED:
1968 cgraph_asm_nodes = NULL;
1972 /* Return true when function body of DECL still needs to be kept around
1973 for later re-use. */
1975 cgraph_preserve_function_body_p (struct cgraph_node *node)
1977 gcc_assert (cgraph_global_info_ready);
1978 gcc_assert (!node->alias && !node->thunk.thunk_p);
1980 /* Look if there is any clone around. */
1990 current_function_decl = NULL;
1991 gimple_register_cfg_hooks ();
1992 bitmap_obstack_initialize (NULL);
1994 invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_START, NULL);
1998 execute_ipa_pass_list (all_small_ipa_passes);
2003 /* If pass_all_early_optimizations was not scheduled, the state of
2004 the cgraph will not be properly updated. Update it now. */
2005 if (cgraph_state < CGRAPH_STATE_IPA_SSA)
2006 cgraph_state = CGRAPH_STATE_IPA_SSA;
2010 /* Generate coverage variables and constructors. */
2013 /* Process new functions added. */
2015 current_function_decl = NULL;
2016 cgraph_process_new_functions ();
2018 execute_ipa_summary_passes
2019 ((struct ipa_opt_pass_d *) all_regular_ipa_passes);
2022 /* Some targets need to handle LTO assembler output specially. */
2023 if (flag_generate_lto)
2024 targetm.asm_out.lto_start ();
2026 execute_ipa_summary_passes ((struct ipa_opt_pass_d *) all_lto_gen_passes);
2029 ipa_write_summaries ();
2031 if (flag_generate_lto)
2032 targetm.asm_out.lto_end ();
2035 execute_ipa_pass_list (all_regular_ipa_passes);
2036 invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_END, NULL);
2038 bitmap_obstack_release (NULL);
2042 /* Perform simple optimizations based on callgraph. */
2045 cgraph_optimize (void)
2050 #ifdef ENABLE_CHECKING
2054 /* Frontend may output common variables after the unit has been finalized.
2055 It is safe to deal with them here as they are always zero initialized. */
2056 varpool_analyze_pending_decls ();
2058 timevar_push (TV_CGRAPHOPT);
2059 if (pre_ipa_mem_report)
2061 fprintf (stderr, "Memory consumption before IPA\n");
2062 dump_memory_report (false);
2065 fprintf (stderr, "Performing interprocedural optimizations\n");
2066 cgraph_state = CGRAPH_STATE_IPA;
2068 /* Don't run the IPA passes if there was any error or sorry messages. */
2072 /* Do nothing else if any IPA pass found errors. */
2075 timevar_pop (TV_CGRAPHOPT);
2079 /* This pass remove bodies of extern inline functions we never inlined.
2080 Do this later so other IPA passes see what is really going on. */
2081 cgraph_remove_unreachable_nodes (false, dump_file);
2082 cgraph_global_info_ready = true;
2083 if (cgraph_dump_file)
2085 fprintf (cgraph_dump_file, "Optimized ");
2086 dump_cgraph (cgraph_dump_file);
2087 dump_varpool (cgraph_dump_file);
2089 if (post_ipa_mem_report)
2091 fprintf (stderr, "Memory consumption after IPA\n");
2092 dump_memory_report (false);
2094 timevar_pop (TV_CGRAPHOPT);
2096 /* Output everything. */
2097 (*debug_hooks->assembly_start) ();
2099 fprintf (stderr, "Assembling functions:\n");
2100 #ifdef ENABLE_CHECKING
2104 cgraph_materialize_all_clones ();
2105 bitmap_obstack_initialize (NULL);
2106 execute_ipa_pass_list (all_late_ipa_passes);
2107 cgraph_remove_unreachable_nodes (true, dump_file);
2108 #ifdef ENABLE_CHECKING
2111 bitmap_obstack_release (NULL);
2112 cgraph_mark_functions_to_output ();
2114 cgraph_state = CGRAPH_STATE_EXPANSION;
2115 if (!flag_toplevel_reorder)
2116 cgraph_output_in_order ();
2119 cgraph_output_pending_asms ();
2121 cgraph_expand_all_functions ();
2122 varpool_remove_unreferenced_decls ();
2124 varpool_assemble_pending_decls ();
2126 cgraph_process_new_functions ();
2127 cgraph_state = CGRAPH_STATE_FINISHED;
2129 if (cgraph_dump_file)
2131 fprintf (cgraph_dump_file, "\nFinal ");
2132 dump_cgraph (cgraph_dump_file);
2133 dump_varpool (cgraph_dump_file);
2135 #ifdef ENABLE_CHECKING
2137 /* Double check that all inline clones are gone and that all
2138 function bodies have been released from memory. */
2141 struct cgraph_node *node;
2142 bool error_found = false;
2144 for (node = cgraph_nodes; node; node = node->next)
2146 && (node->global.inlined_to
2147 || gimple_has_body_p (node->decl)))
2150 dump_cgraph_node (stderr, node);
2153 internal_error ("nodes with unreleased memory found");
2161 if (!cgraph_dump_file)
2162 cgraph_dump_file = dump_begin (TDI_cgraph, NULL);
2165 /* The edges representing the callers of the NEW_VERSION node were
2166 fixed by cgraph_function_versioning (), now the call_expr in their
2167 respective tree code should be updated to call the NEW_VERSION. */
2170 update_call_expr (struct cgraph_node *new_version)
2172 struct cgraph_edge *e;
2174 gcc_assert (new_version);
2176 /* Update the call expr on the edges to call the new version. */
2177 for (e = new_version->callers; e; e = e->next_caller)
2179 struct function *inner_function = DECL_STRUCT_FUNCTION (e->caller->decl);
2180 gimple_call_set_fndecl (e->call_stmt, new_version->decl);
2181 maybe_clean_eh_stmt_fn (inner_function, e->call_stmt);
2186 /* Create a new cgraph node which is the new version of
2187 OLD_VERSION node. REDIRECT_CALLERS holds the callers
2188 edges which should be redirected to point to
2189 NEW_VERSION. ALL the callees edges of OLD_VERSION
2190 are cloned to the new version node. Return the new
2193 If non-NULL BLOCK_TO_COPY determine what basic blocks
2194 was copied to prevent duplications of calls that are dead
2197 static struct cgraph_node *
2198 cgraph_copy_node_for_versioning (struct cgraph_node *old_version,
2200 VEC(cgraph_edge_p,heap) *redirect_callers,
2203 struct cgraph_node *new_version;
2204 struct cgraph_edge *e;
2207 gcc_assert (old_version);
2209 new_version = cgraph_create_node (new_decl);
2211 new_version->analyzed = true;
2212 new_version->local = old_version->local;
2213 new_version->local.externally_visible = false;
2214 new_version->local.local = true;
2215 new_version->global = old_version->global;
2216 new_version->rtl = old_version->rtl;
2217 new_version->reachable = true;
2218 new_version->count = old_version->count;
2220 for (e = old_version->callees; e; e=e->next_callee)
2222 || bitmap_bit_p (bbs_to_copy, gimple_bb (e->call_stmt)->index))
2223 cgraph_clone_edge (e, new_version, e->call_stmt,
2224 e->lto_stmt_uid, REG_BR_PROB_BASE,
2227 for (e = old_version->indirect_calls; e; e=e->next_callee)
2229 || bitmap_bit_p (bbs_to_copy, gimple_bb (e->call_stmt)->index))
2230 cgraph_clone_edge (e, new_version, e->call_stmt,
2231 e->lto_stmt_uid, REG_BR_PROB_BASE,
2234 FOR_EACH_VEC_ELT (cgraph_edge_p, redirect_callers, i, e)
2236 /* Redirect calls to the old version node to point to its new
2238 cgraph_redirect_edge_callee (e, new_version);
2244 /* Perform function versioning.
2245 Function versioning includes copying of the tree and
2246 a callgraph update (creating a new cgraph node and updating
2247 its callees and callers).
2249 REDIRECT_CALLERS varray includes the edges to be redirected
2252 TREE_MAP is a mapping of tree nodes we want to replace with
2253 new ones (according to results of prior analysis).
2254 OLD_VERSION_NODE is the node that is versioned.
2255 It returns the new version's cgraph node.
2256 If non-NULL ARGS_TO_SKIP determine function parameters to remove
2258 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
2259 If non_NULL NEW_ENTRY determine new entry BB of the clone. */
2261 struct cgraph_node *
2262 cgraph_function_versioning (struct cgraph_node *old_version_node,
2263 VEC(cgraph_edge_p,heap) *redirect_callers,
2264 VEC (ipa_replace_map_p,gc)* tree_map,
2265 bitmap args_to_skip,
2267 basic_block new_entry_block,
2268 const char *clone_name)
2270 tree old_decl = old_version_node->decl;
2271 struct cgraph_node *new_version_node = NULL;
2274 if (!tree_versionable_function_p (old_decl))
2277 gcc_assert (old_version_node->local.can_change_signature || !args_to_skip);
2279 /* Make a new FUNCTION_DECL tree node for the
2282 new_decl = copy_node (old_decl);
2284 new_decl = build_function_decl_skip_args (old_decl, args_to_skip);
2286 /* Generate a new name for the new version. */
2287 DECL_NAME (new_decl) = clone_function_name (old_decl, clone_name);
2288 SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl));
2289 SET_DECL_RTL (new_decl, NULL);
2291 /* Create the new version's call-graph node.
2292 and update the edges of the new node. */
2294 cgraph_copy_node_for_versioning (old_version_node, new_decl,
2295 redirect_callers, bbs_to_copy);
2297 /* Copy the OLD_VERSION_NODE function tree to the new version. */
2298 tree_function_versioning (old_decl, new_decl, tree_map, false, args_to_skip,
2299 bbs_to_copy, new_entry_block);
2301 /* Update the new version's properties.
2302 Make The new version visible only within this translation unit. Make sure
2303 that is not weak also.
2304 ??? We cannot use COMDAT linkage because there is no
2305 ABI support for this. */
2306 cgraph_make_decl_local (new_version_node->decl);
2307 DECL_VIRTUAL_P (new_version_node->decl) = 0;
2308 new_version_node->local.externally_visible = 0;
2309 new_version_node->local.local = 1;
2310 new_version_node->lowered = true;
2312 /* Update the call_expr on the edges to call the new version node. */
2313 update_call_expr (new_version_node);
2315 cgraph_call_function_insertion_hooks (new_version_node);
2316 return new_version_node;
2319 /* Given virtual clone, turn it into actual clone. */
2321 cgraph_materialize_clone (struct cgraph_node *node)
2323 bitmap_obstack_initialize (NULL);
2324 node->former_clone_of = node->clone_of->decl;
2325 if (node->clone_of->former_clone_of)
2326 node->former_clone_of = node->clone_of->former_clone_of;
2327 /* Copy the OLD_VERSION_NODE function tree to the new version. */
2328 tree_function_versioning (node->clone_of->decl, node->decl,
2329 node->clone.tree_map, true,
2330 node->clone.args_to_skip, NULL, NULL);
2331 if (cgraph_dump_file)
2333 dump_function_to_file (node->clone_of->decl, cgraph_dump_file, dump_flags);
2334 dump_function_to_file (node->decl, cgraph_dump_file, dump_flags);
2337 /* Function is no longer clone. */
2338 if (node->next_sibling_clone)
2339 node->next_sibling_clone->prev_sibling_clone = node->prev_sibling_clone;
2340 if (node->prev_sibling_clone)
2341 node->prev_sibling_clone->next_sibling_clone = node->next_sibling_clone;
2343 node->clone_of->clones = node->next_sibling_clone;
2344 node->next_sibling_clone = NULL;
2345 node->prev_sibling_clone = NULL;
2346 if (!node->clone_of->analyzed && !node->clone_of->clones)
2348 cgraph_release_function_body (node->clone_of);
2349 cgraph_node_remove_callees (node->clone_of);
2350 ipa_remove_all_references (&node->clone_of->ref_list);
2352 node->clone_of = NULL;
2353 bitmap_obstack_release (NULL);
2356 /* If necessary, change the function declaration in the call statement
2357 associated with E so that it corresponds to the edge callee. */
2360 cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge *e)
2362 tree decl = gimple_call_fndecl (e->call_stmt);
2364 gimple_stmt_iterator gsi;
2365 bool gsi_computed = false;
2366 #ifdef ENABLE_CHECKING
2367 struct cgraph_node *node;
2370 if (e->indirect_unknown_callee
2371 || decl == e->callee->decl
2372 /* Don't update call from same body alias to the real function. */
2373 || (decl && cgraph_get_node (decl) == cgraph_get_node (e->callee->decl)))
2374 return e->call_stmt;
2376 #ifdef ENABLE_CHECKING
2379 node = cgraph_get_node (decl);
2380 gcc_assert (!node || !node->clone.combined_args_to_skip);
2384 if (cgraph_dump_file)
2386 fprintf (cgraph_dump_file, "updating call of %s/%i -> %s/%i: ",
2387 cgraph_node_name (e->caller), e->caller->uid,
2388 cgraph_node_name (e->callee), e->callee->uid);
2389 print_gimple_stmt (cgraph_dump_file, e->call_stmt, 0, dump_flags);
2390 if (e->callee->clone.combined_args_to_skip)
2392 fprintf (cgraph_dump_file, " combined args to skip: ");
2393 dump_bitmap (cgraph_dump_file,
2394 e->callee->clone.combined_args_to_skip);
2398 if (e->indirect_info &&
2399 e->indirect_info->thunk_delta != 0
2400 && (!e->callee->clone.combined_args_to_skip
2401 || !bitmap_bit_p (e->callee->clone.combined_args_to_skip, 0)))
2403 if (cgraph_dump_file)
2404 fprintf (cgraph_dump_file, " Thunk delta is "
2405 HOST_WIDE_INT_PRINT_DEC "\n", e->indirect_info->thunk_delta);
2406 gsi = gsi_for_stmt (e->call_stmt);
2407 gsi_computed = true;
2408 gimple_adjust_this_by_delta (&gsi,
2409 build_int_cst (sizetype,
2410 e->indirect_info->thunk_delta));
2411 e->indirect_info->thunk_delta = 0;
2414 if (e->callee->clone.combined_args_to_skip)
2419 = gimple_call_copy_skip_args (e->call_stmt,
2420 e->callee->clone.combined_args_to_skip);
2421 gimple_call_set_fndecl (new_stmt, e->callee->decl);
2423 if (gimple_vdef (new_stmt)
2424 && TREE_CODE (gimple_vdef (new_stmt)) == SSA_NAME)
2425 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt)) = new_stmt;
2428 gsi = gsi_for_stmt (e->call_stmt);
2429 gsi_replace (&gsi, new_stmt, false);
2430 /* We need to defer cleaning EH info on the new statement to
2431 fixup-cfg. We may not have dominator information at this point
2432 and thus would end up with unreachable blocks and have no way
2433 to communicate that we need to run CFG cleanup then. */
2434 lp_nr = lookup_stmt_eh_lp (e->call_stmt);
2437 remove_stmt_from_eh_lp (e->call_stmt);
2438 add_stmt_to_eh_lp (new_stmt, lp_nr);
2443 new_stmt = e->call_stmt;
2444 gimple_call_set_fndecl (new_stmt, e->callee->decl);
2445 update_stmt (new_stmt);
2448 cgraph_set_call_stmt_including_clones (e->caller, e->call_stmt, new_stmt);
2450 if (cgraph_dump_file)
2452 fprintf (cgraph_dump_file, " updated to:");
2453 print_gimple_stmt (cgraph_dump_file, e->call_stmt, 0, dump_flags);
2458 /* Once all functions from compilation unit are in memory, produce all clones
2459 and update all calls. We might also do this on demand if we don't want to
2460 bring all functions to memory prior compilation, but current WHOPR
2461 implementation does that and it is is bit easier to keep everything right in
2464 cgraph_materialize_all_clones (void)
2466 struct cgraph_node *node;
2467 bool stabilized = false;
2469 if (cgraph_dump_file)
2470 fprintf (cgraph_dump_file, "Materializing clones\n");
2471 #ifdef ENABLE_CHECKING
2475 /* We can also do topological order, but number of iterations should be
2476 bounded by number of IPA passes since single IPA pass is probably not
2477 going to create clones of clones it created itself. */
2481 for (node = cgraph_nodes; node; node = node->next)
2483 if (node->clone_of && node->decl != node->clone_of->decl
2484 && !gimple_has_body_p (node->decl))
2486 if (gimple_has_body_p (node->clone_of->decl))
2488 if (cgraph_dump_file)
2490 fprintf (cgraph_dump_file, "cloning %s to %s\n",
2491 cgraph_node_name (node->clone_of),
2492 cgraph_node_name (node));
2493 if (node->clone.tree_map)
2496 fprintf (cgraph_dump_file, " replace map: ");
2497 for (i = 0; i < VEC_length (ipa_replace_map_p,
2498 node->clone.tree_map);
2501 struct ipa_replace_map *replace_info;
2502 replace_info = VEC_index (ipa_replace_map_p,
2503 node->clone.tree_map,
2505 print_generic_expr (cgraph_dump_file, replace_info->old_tree, 0);
2506 fprintf (cgraph_dump_file, " -> ");
2507 print_generic_expr (cgraph_dump_file, replace_info->new_tree, 0);
2508 fprintf (cgraph_dump_file, "%s%s;",
2509 replace_info->replace_p ? "(replace)":"",
2510 replace_info->ref_p ? "(ref)":"");
2512 fprintf (cgraph_dump_file, "\n");
2514 if (node->clone.args_to_skip)
2516 fprintf (cgraph_dump_file, " args_to_skip: ");
2517 dump_bitmap (cgraph_dump_file, node->clone.args_to_skip);
2519 if (node->clone.args_to_skip)
2521 fprintf (cgraph_dump_file, " combined_args_to_skip:");
2522 dump_bitmap (cgraph_dump_file, node->clone.combined_args_to_skip);
2525 cgraph_materialize_clone (node);
2531 for (node = cgraph_nodes; node; node = node->next)
2532 if (!node->analyzed && node->callees)
2533 cgraph_node_remove_callees (node);
2534 if (cgraph_dump_file)
2535 fprintf (cgraph_dump_file, "Materialization Call site updates done.\n");
2536 #ifdef ENABLE_CHECKING
2539 cgraph_remove_unreachable_nodes (false, cgraph_dump_file);
2542 #include "gt-cgraphunit.h"