1 /* Driver of optimization process
2 Copyright (C) 2003-2014 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 module implements main driver of compilation process.
23 The main scope of this file is to act as an interface in between
24 tree based frontends and the backend.
26 The front-end is supposed to use following functionality:
28 - cgraph_finalize_function
30 This function is called once front-end has parsed whole body of function
31 and it is certain that the function body nor the declaration will change.
33 (There is one exception needed for implementing GCC extern inline
36 - varpool_finalize_decl
38 This function has same behavior as the above but is used for static
43 Insert new toplevel ASM statement
45 - finalize_compilation_unit
47 This function is called once (source level) compilation unit is finalized
48 and it will no longer change.
50 The symbol table is constructed starting from the trivially needed
51 symbols finalized by the frontend. Functions are lowered into
52 GIMPLE representation and callgraph/reference lists are constructed.
53 Those are used to discover other necessary functions and variables.
55 At the end the bodies of unreachable functions are removed.
57 The function can be called multiple times when multiple source level
58 compilation units are combined.
62 This passes control to the back-end. Optimizations are performed and
63 final assembler is generated. This is done in the following way. Note
64 that with link time optimization the process is split into three
65 stages (compile time, linktime analysis and parallel linktime as
70 1) Inter-procedural optimization.
73 This part is further split into:
75 a) early optimizations. These are local passes executed in
76 the topological order on the callgraph.
78 The purpose of early optimiations is to optimize away simple
79 things that may otherwise confuse IP analysis. Very simple
80 propagation across the callgraph is done i.e. to discover
81 functions without side effects and simple inlining is performed.
83 b) early small interprocedural passes.
85 Those are interprocedural passes executed only at compilation
86 time. These include, for example, transational memory lowering,
87 unreachable code removal and other simple transformations.
89 c) IP analysis stage. All interprocedural passes do their
92 Interprocedural passes differ from small interprocedural
93 passes by their ability to operate across whole program
94 at linktime. Their analysis stage is performed early to
95 both reduce linking times and linktime memory usage by
96 not having to represent whole program in memory.
98 d) LTO sreaming. When doing LTO, everything important gets
99 streamed into the object file.
101 Compile time and or linktime analysis stage (WPA):
103 At linktime units gets streamed back and symbol table is
104 merged. Function bodies are not streamed in and not
106 e) IP propagation stage. All IP passes execute their
107 IP propagation. This is done based on the earlier analysis
108 without having function bodies at hand.
109 f) Ltrans streaming. When doing WHOPR LTO, the program
110 is partitioned and streamed into multple object files.
112 Compile time and/or parallel linktime stage (ltrans)
114 Each of the object files is streamed back and compiled
115 separately. Now the function bodies becomes available
118 2) Virtual clone materialization
119 (cgraph_materialize_clone)
121 IP passes can produce copies of existing functoins (such
122 as versioned clones or inline clones) without actually
123 manipulating their bodies by creating virtual clones in
124 the callgraph. At this time the virtual clones are
125 turned into real functions
128 All IP passes transform function bodies based on earlier
129 decision of the IP propagation.
131 4) late small IP passes
133 Simple IP passes working within single program partition.
136 (expand_all_functions)
138 At this stage functions that needs to be output into
139 assembler are identified and compiled in topological order
140 6) Output of variables and aliases
141 Now it is known what variable references was not optimized
142 out and thus all variables are output to the file.
144 Note that with -fno-toplevel-reorder passes 5 and 6
145 are combined together in cgraph_output_in_order.
147 Finally there are functions to manipulate the callgraph from
149 - cgraph_add_new_function is used to add backend produced
150 functions introduced after the unit is finalized.
151 The functions are enqueue for later processing and inserted
152 into callgraph with cgraph_process_new_functions.
154 - cgraph_function_versioning
156 produces a copy of function into new one (a version)
157 and apply simple transformations
162 #include "coretypes.h"
166 #include "stor-layout.h"
167 #include "stringpool.h"
170 #include "basic-block.h"
171 #include "tree-ssa-alias.h"
172 #include "internal-fn.h"
173 #include "gimple-fold.h"
174 #include "gimple-expr.h"
177 #include "gimplify.h"
178 #include "gimple-iterator.h"
179 #include "gimplify-me.h"
180 #include "gimple-ssa.h"
181 #include "tree-cfg.h"
182 #include "tree-into-ssa.h"
183 #include "tree-ssa.h"
184 #include "tree-inline.h"
185 #include "langhooks.h"
190 #include "diagnostic.h"
194 #include "function.h"
195 #include "ipa-prop.h"
196 #include "tree-iterator.h"
197 #include "tree-pass.h"
198 #include "tree-dump.h"
199 #include "gimple-pretty-print.h"
201 #include "coverage.h"
203 #include "ipa-inline.h"
204 #include "ipa-utils.h"
205 #include "lto-streamer.h"
208 #include "regset.h" /* FIXME: For reg_obstack. */
210 #include "pass_manager.h"
211 #include "tree-nested.h"
212 #include "gimplify.h"
214 /* Queue of cgraph nodes scheduled to be added into cgraph. This is a
215 secondary queue used during optimization to accommodate passes that
216 may generate new functions that need to be optimized and expanded. */
217 cgraph_node_set cgraph_new_nodes
;
219 static void expand_all_functions (void);
220 static void mark_functions_to_output (void);
221 static void expand_function (struct cgraph_node
*);
222 static void handle_alias_pairs (void);
224 FILE *cgraph_dump_file
;
226 /* Linked list of cgraph asm nodes. */
227 struct asm_node
*asm_nodes
;
229 /* Last node in cgraph_asm_nodes. */
230 static GTY(()) struct asm_node
*asm_last_node
;
232 /* Used for vtable lookup in thunk adjusting. */
233 static GTY (()) tree vtable_entry_type
;
235 /* Determine if symbol DECL is needed. That is, visible to something
236 either outside this translation unit, something magic in the system
239 decide_is_symbol_needed (symtab_node
*node
)
241 tree decl
= node
->decl
;
243 /* Double check that no one output the function into assembly file
245 gcc_checking_assert (!DECL_ASSEMBLER_NAME_SET_P (decl
)
246 || !TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl
)));
248 if (!node
->definition
)
251 if (DECL_EXTERNAL (decl
))
254 /* If the user told us it is used, then it must be so. */
255 if (node
->force_output
)
258 /* ABI forced symbols are needed when they are external. */
259 if (node
->forced_by_abi
&& TREE_PUBLIC (decl
))
262 /* Keep constructors, destructors and virtual functions. */
263 if (TREE_CODE (decl
) == FUNCTION_DECL
264 && (DECL_STATIC_CONSTRUCTOR (decl
) || DECL_STATIC_DESTRUCTOR (decl
)))
267 /* Externally visible variables must be output. The exception is
268 COMDAT variables that must be output only when they are needed. */
269 if (TREE_PUBLIC (decl
) && !DECL_COMDAT (decl
))
275 /* Head and terminator of the queue of nodes to be processed while building
278 static symtab_node symtab_terminator
;
279 static symtab_node
*queued_nodes
= &symtab_terminator
;
281 /* Add NODE to queue starting at QUEUED_NODES.
282 The queue is linked via AUX pointers and terminated by pointer to 1. */
285 enqueue_node (symtab_node
*node
)
289 gcc_checking_assert (queued_nodes
);
290 node
->aux
= queued_nodes
;
294 /* Process CGRAPH_NEW_FUNCTIONS and perform actions necessary to add these
295 functions into callgraph in a way so they look like ordinary reachable
296 functions inserted into callgraph already at construction time. */
299 cgraph_process_new_functions (void)
302 struct cgraph_node
*node
;
303 cgraph_node_set_iterator csi
;
305 if (!cgraph_new_nodes
)
307 handle_alias_pairs ();
308 /* Note that this queue may grow as its being processed, as the new
309 functions may generate new ones. */
310 for (csi
= csi_start (cgraph_new_nodes
); !csi_end_p (csi
); csi_next (&csi
))
312 node
= csi_node (csi
);
314 switch (cgraph_state
)
316 case CGRAPH_STATE_CONSTRUCTION
:
317 /* At construction time we just need to finalize function and move
318 it into reachable functions list. */
320 cgraph_finalize_function (fndecl
, false);
321 cgraph_call_function_insertion_hooks (node
);
325 case CGRAPH_STATE_IPA
:
326 case CGRAPH_STATE_IPA_SSA
:
327 /* When IPA optimization already started, do all essential
328 transformations that has been already performed on the whole
329 cgraph but not on this function. */
331 gimple_register_cfg_hooks ();
333 cgraph_analyze_function (node
);
334 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
335 if (cgraph_state
== CGRAPH_STATE_IPA_SSA
336 && !gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl
)))
337 g
->get_passes ()->execute_early_local_passes ();
338 else if (inline_summary_vec
!= NULL
)
339 compute_inline_parameters (node
, true);
340 free_dominance_info (CDI_POST_DOMINATORS
);
341 free_dominance_info (CDI_DOMINATORS
);
343 cgraph_call_function_insertion_hooks (node
);
346 case CGRAPH_STATE_EXPANSION
:
347 /* Functions created during expansion shall be compiled
350 cgraph_call_function_insertion_hooks (node
);
351 expand_function (node
);
359 free_cgraph_node_set (cgraph_new_nodes
);
360 cgraph_new_nodes
= NULL
;
363 /* As an GCC extension we allow redefinition of the function. The
364 semantics when both copies of bodies differ is not well defined.
365 We replace the old body with new body so in unit at a time mode
366 we always use new body, while in normal mode we may end up with
367 old body inlined into some functions and new body expanded and
370 ??? It may make more sense to use one body for inlining and other
371 body for expanding the function but this is difficult to do. */
374 cgraph_reset_node (struct cgraph_node
*node
)
376 /* If node->process is set, then we have already begun whole-unit analysis.
377 This is *not* testing for whether we've already emitted the function.
378 That case can be sort-of legitimately seen with real function redefinition
379 errors. I would argue that the front end should never present us with
380 such a case, but don't enforce that for now. */
381 gcc_assert (!node
->process
);
383 /* Reset our data structures so we can analyze the function again. */
384 memset (&node
->local
, 0, sizeof (node
->local
));
385 memset (&node
->global
, 0, sizeof (node
->global
));
386 memset (&node
->rtl
, 0, sizeof (node
->rtl
));
387 node
->analyzed
= false;
388 node
->definition
= false;
390 node
->weakref
= false;
391 node
->cpp_implicit_alias
= false;
393 cgraph_node_remove_callees (node
);
394 ipa_remove_all_references (&node
->ref_list
);
397 /* Return true when there are references to NODE. */
400 referred_to_p (symtab_node
*node
)
404 /* See if there are any references at all. */
405 if (ipa_ref_list_referring_iterate (&node
->ref_list
, 0, ref
))
407 /* For functions check also calls. */
408 cgraph_node
*cn
= dyn_cast
<cgraph_node
> (node
);
409 if (cn
&& cn
->callers
)
414 /* DECL has been parsed. Take it, queue it, compile it at the whim of the
415 logic in effect. If NO_COLLECT is true, then our caller cannot stand to have
416 the garbage collector run at the moment. We would need to either create
417 a new GC context, or just not compile right now. */
420 cgraph_finalize_function (tree decl
, bool no_collect
)
422 struct cgraph_node
*node
= cgraph_get_create_node (decl
);
424 if (node
->definition
)
426 /* Nested functions should only be defined once. */
427 gcc_assert (!DECL_CONTEXT (decl
)
428 || TREE_CODE (DECL_CONTEXT (decl
)) != FUNCTION_DECL
);
429 cgraph_reset_node (node
);
430 node
->local
.redefined_extern_inline
= true;
433 notice_global_symbol (decl
);
434 node
->definition
= true;
435 node
->lowered
= DECL_STRUCT_FUNCTION (decl
)->cfg
!= NULL
;
437 /* With -fkeep-inline-functions we are keeping all inline functions except
438 for extern inline ones. */
439 if (flag_keep_inline_functions
440 && DECL_DECLARED_INLINE_P (decl
)
441 && !DECL_EXTERNAL (decl
)
442 && !DECL_DISREGARD_INLINE_LIMITS (decl
))
443 node
->force_output
= 1;
445 /* When not optimizing, also output the static functions. (see
446 PR24561), but don't do so for always_inline functions, functions
447 declared inline and nested functions. These were optimized out
448 in the original implementation and it is unclear whether we want
449 to change the behavior here. */
451 && !node
->cpp_implicit_alias
452 && !DECL_DISREGARD_INLINE_LIMITS (decl
)
453 && !DECL_DECLARED_INLINE_P (decl
)
454 && !(DECL_CONTEXT (decl
)
455 && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
))
456 && !DECL_COMDAT (decl
) && !DECL_EXTERNAL (decl
))
457 node
->force_output
= 1;
459 /* If we've not yet emitted decl, tell the debug info about it. */
460 if (!TREE_ASM_WRITTEN (decl
))
461 (*debug_hooks
->deferred_inline_function
) (decl
);
463 /* Possibly warn about unused parameters. */
464 if (warn_unused_parameter
)
465 do_warn_unused_parameter (decl
);
470 if (cgraph_state
== CGRAPH_STATE_CONSTRUCTION
471 && (decide_is_symbol_needed (node
)
472 || referred_to_p (node
)))
476 /* Add the function FNDECL to the call graph.
477 Unlike cgraph_finalize_function, this function is intended to be used
478 by middle end and allows insertion of new function at arbitrary point
479 of compilation. The function can be either in high, low or SSA form
482 The function is assumed to be reachable and have address taken (so no
483 API breaking optimizations are performed on it).
485 Main work done by this function is to enqueue the function for later
486 processing to avoid need the passes to be re-entrant. */
489 cgraph_add_new_function (tree fndecl
, bool lowered
)
491 gcc::pass_manager
*passes
= g
->get_passes ();
492 struct cgraph_node
*node
;
493 switch (cgraph_state
)
495 case CGRAPH_STATE_PARSING
:
496 cgraph_finalize_function (fndecl
, false);
498 case CGRAPH_STATE_CONSTRUCTION
:
499 /* Just enqueue function to be processed at nearest occurrence. */
500 node
= cgraph_create_node (fndecl
);
502 node
->lowered
= true;
503 if (!cgraph_new_nodes
)
504 cgraph_new_nodes
= cgraph_node_set_new ();
505 cgraph_node_set_add (cgraph_new_nodes
, node
);
508 case CGRAPH_STATE_IPA
:
509 case CGRAPH_STATE_IPA_SSA
:
510 case CGRAPH_STATE_EXPANSION
:
511 /* Bring the function into finalized state and enqueue for later
512 analyzing and compilation. */
513 node
= cgraph_get_create_node (fndecl
);
514 node
->local
.local
= false;
515 node
->definition
= true;
516 node
->force_output
= true;
517 if (!lowered
&& cgraph_state
== CGRAPH_STATE_EXPANSION
)
519 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
520 gimple_register_cfg_hooks ();
521 bitmap_obstack_initialize (NULL
);
522 execute_pass_list (passes
->all_lowering_passes
);
523 passes
->execute_early_local_passes ();
524 bitmap_obstack_release (NULL
);
530 node
->lowered
= true;
531 if (!cgraph_new_nodes
)
532 cgraph_new_nodes
= cgraph_node_set_new ();
533 cgraph_node_set_add (cgraph_new_nodes
, node
);
536 case CGRAPH_STATE_FINISHED
:
537 /* At the very end of compilation we have to do all the work up
539 node
= cgraph_create_node (fndecl
);
541 node
->lowered
= true;
542 node
->definition
= true;
543 cgraph_analyze_function (node
);
544 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
545 gimple_register_cfg_hooks ();
546 bitmap_obstack_initialize (NULL
);
547 if (!gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl
)))
548 g
->get_passes ()->execute_early_local_passes ();
549 bitmap_obstack_release (NULL
);
551 expand_function (node
);
558 /* Set a personality if required and we already passed EH lowering. */
560 && (function_needs_eh_personality (DECL_STRUCT_FUNCTION (fndecl
))
561 == eh_personality_lang
))
562 DECL_FUNCTION_PERSONALITY (fndecl
) = lang_hooks
.eh_personality ();
565 /* Add a top-level asm statement to the list. */
568 add_asm_node (tree asm_str
)
570 struct asm_node
*node
;
572 node
= ggc_alloc_cleared_asm_node ();
573 node
->asm_str
= asm_str
;
574 node
->order
= symtab_order
++;
576 if (asm_nodes
== NULL
)
579 asm_last_node
->next
= node
;
580 asm_last_node
= node
;
584 /* Output all asm statements we have stored up to be output. */
587 output_asm_statements (void)
589 struct asm_node
*can
;
594 for (can
= asm_nodes
; can
; can
= can
->next
)
595 assemble_asm (can
->asm_str
);
599 /* Analyze the function scheduled to be output. */
601 cgraph_analyze_function (struct cgraph_node
*node
)
603 tree decl
= node
->decl
;
604 location_t saved_loc
= input_location
;
605 input_location
= DECL_SOURCE_LOCATION (decl
);
607 if (node
->thunk
.thunk_p
)
609 cgraph_create_edge (node
, cgraph_get_node (node
->thunk
.alias
),
610 NULL
, 0, CGRAPH_FREQ_BASE
);
611 if (!expand_thunk (node
, false))
613 node
->thunk
.alias
= NULL
;
614 node
->analyzed
= true;
617 node
->thunk
.alias
= NULL
;
621 (node
, cgraph_get_node (node
->alias_target
));
622 else if (node
->dispatcher_function
)
624 /* Generate the dispatcher body of multi-versioned functions. */
625 struct cgraph_function_version_info
*dispatcher_version_info
626 = get_cgraph_node_version (node
);
627 if (dispatcher_version_info
!= NULL
628 && (dispatcher_version_info
->dispatcher_resolver
631 tree resolver
= NULL_TREE
;
632 gcc_assert (targetm
.generate_version_dispatcher_body
);
633 resolver
= targetm
.generate_version_dispatcher_body (node
);
634 gcc_assert (resolver
!= NULL_TREE
);
639 push_cfun (DECL_STRUCT_FUNCTION (decl
));
641 assign_assembler_name_if_neeeded (node
->decl
);
643 /* Make sure to gimplify bodies only once. During analyzing a
644 function we lower it, which will require gimplified nested
645 functions, so we can end up here with an already gimplified
647 if (!gimple_has_body_p (decl
))
648 gimplify_function_tree (decl
);
649 dump_function (TDI_generic
, decl
);
651 /* Lower the function. */
655 lower_nested_functions (node
->decl
);
656 gcc_assert (!node
->nested
);
658 gimple_register_cfg_hooks ();
659 bitmap_obstack_initialize (NULL
);
660 execute_pass_list (g
->get_passes ()->all_lowering_passes
);
661 free_dominance_info (CDI_POST_DOMINATORS
);
662 free_dominance_info (CDI_DOMINATORS
);
664 bitmap_obstack_release (NULL
);
665 node
->lowered
= true;
670 node
->analyzed
= true;
672 input_location
= saved_loc
;
675 /* C++ frontend produce same body aliases all over the place, even before PCH
676 gets streamed out. It relies on us linking the aliases with their function
677 in order to do the fixups, but ipa-ref is not PCH safe. Consequentely we
678 first produce aliases without links, but once C++ FE is sure he won't sream
679 PCH we build the links via this function. */
682 cgraph_process_same_body_aliases (void)
685 FOR_EACH_SYMBOL (node
)
686 if (node
->cpp_implicit_alias
&& !node
->analyzed
)
689 TREE_CODE (node
->alias_target
) == VAR_DECL
690 ? (symtab_node
*)varpool_node_for_decl (node
->alias_target
)
691 : (symtab_node
*)cgraph_get_create_node (node
->alias_target
));
692 cpp_implicit_aliases_done
= true;
695 /* Process attributes common for vars and functions. */
698 process_common_attributes (tree decl
)
700 tree weakref
= lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
));
702 if (weakref
&& !lookup_attribute ("alias", DECL_ATTRIBUTES (decl
)))
704 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wattributes
,
705 "%<weakref%> attribute should be accompanied with"
706 " an %<alias%> attribute");
707 DECL_WEAK (decl
) = 0;
708 DECL_ATTRIBUTES (decl
) = remove_attribute ("weakref",
709 DECL_ATTRIBUTES (decl
));
713 /* Look for externally_visible and used attributes and mark cgraph nodes
716 We cannot mark the nodes at the point the attributes are processed (in
717 handle_*_attribute) because the copy of the declarations available at that
718 point may not be canonical. For example, in:
721 void f() __attribute__((used));
723 the declaration we see in handle_used_attribute will be the second
724 declaration -- but the front end will subsequently merge that declaration
725 with the original declaration and discard the second declaration.
727 Furthermore, we can't mark these nodes in cgraph_finalize_function because:
730 void f() __attribute__((externally_visible));
734 So, we walk the nodes at the end of the translation unit, applying the
735 attributes at that point. */
738 process_function_and_variable_attributes (struct cgraph_node
*first
,
739 varpool_node
*first_var
)
741 struct cgraph_node
*node
;
744 for (node
= cgraph_first_function (); node
!= first
;
745 node
= cgraph_next_function (node
))
747 tree decl
= node
->decl
;
748 if (DECL_PRESERVE_P (decl
))
749 cgraph_mark_force_output_node (node
);
750 else if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl
)))
752 if (! TREE_PUBLIC (node
->decl
))
753 warning_at (DECL_SOURCE_LOCATION (node
->decl
), OPT_Wattributes
,
754 "%<externally_visible%>"
755 " attribute have effect only on public objects");
757 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
))
758 && (node
->definition
&& !node
->alias
))
760 warning_at (DECL_SOURCE_LOCATION (node
->decl
), OPT_Wattributes
,
761 "%<weakref%> attribute ignored"
762 " because function is defined");
763 DECL_WEAK (decl
) = 0;
764 DECL_ATTRIBUTES (decl
) = remove_attribute ("weakref",
765 DECL_ATTRIBUTES (decl
));
768 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (decl
))
769 && !DECL_DECLARED_INLINE_P (decl
)
770 /* redefining extern inline function makes it DECL_UNINLINABLE. */
771 && !DECL_UNINLINABLE (decl
))
772 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wattributes
,
773 "always_inline function might not be inlinable");
775 process_common_attributes (decl
);
777 for (vnode
= varpool_first_variable (); vnode
!= first_var
;
778 vnode
= varpool_next_variable (vnode
))
780 tree decl
= vnode
->decl
;
781 if (DECL_EXTERNAL (decl
)
782 && DECL_INITIAL (decl
))
783 varpool_finalize_decl (decl
);
784 if (DECL_PRESERVE_P (decl
))
785 vnode
->force_output
= true;
786 else if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl
)))
788 if (! TREE_PUBLIC (vnode
->decl
))
789 warning_at (DECL_SOURCE_LOCATION (vnode
->decl
), OPT_Wattributes
,
790 "%<externally_visible%>"
791 " attribute have effect only on public objects");
793 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
))
795 && DECL_INITIAL (decl
))
797 warning_at (DECL_SOURCE_LOCATION (vnode
->decl
), OPT_Wattributes
,
798 "%<weakref%> attribute ignored"
799 " because variable is initialized");
800 DECL_WEAK (decl
) = 0;
801 DECL_ATTRIBUTES (decl
) = remove_attribute ("weakref",
802 DECL_ATTRIBUTES (decl
));
804 process_common_attributes (decl
);
808 /* Mark DECL as finalized. By finalizing the declaration, frontend instruct the
809 middle end to output the variable to asm file, if needed or externally
813 varpool_finalize_decl (tree decl
)
815 varpool_node
*node
= varpool_node_for_decl (decl
);
817 gcc_assert (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
));
819 if (node
->definition
)
821 notice_global_symbol (decl
);
822 node
->definition
= true;
823 if (TREE_THIS_VOLATILE (decl
) || DECL_PRESERVE_P (decl
)
824 /* Traditionally we do not eliminate static variables when not
825 optimizing and when not doing toplevel reoder. */
826 || (!flag_toplevel_reorder
&& !DECL_COMDAT (node
->decl
)
827 && !DECL_ARTIFICIAL (node
->decl
)))
828 node
->force_output
= true;
830 if (cgraph_state
== CGRAPH_STATE_CONSTRUCTION
831 && (decide_is_symbol_needed (node
)
832 || referred_to_p (node
)))
834 if (cgraph_state
>= CGRAPH_STATE_IPA_SSA
)
835 varpool_analyze_node (node
);
836 /* Some frontends produce various interface variables after compilation
838 if (cgraph_state
== CGRAPH_STATE_FINISHED
839 || (!flag_toplevel_reorder
&& cgraph_state
== CGRAPH_STATE_EXPANSION
))
840 varpool_assemble_decl (node
);
843 /* EDGE is an polymorphic call. Mark all possible targets as reachable
844 and if there is only one target, perform trivial devirtualization.
845 REACHABLE_CALL_TARGETS collects target lists we already walked to
846 avoid udplicate work. */
849 walk_polymorphic_call_targets (pointer_set_t
*reachable_call_targets
,
850 struct cgraph_edge
*edge
)
855 vec
<cgraph_node
*>targets
856 = possible_polymorphic_call_targets
857 (edge
, &final
, &cache_token
);
859 if (!pointer_set_insert (reachable_call_targets
,
862 if (cgraph_dump_file
)
863 dump_possible_polymorphic_call_targets
864 (cgraph_dump_file
, edge
);
866 for (i
= 0; i
< targets
.length (); i
++)
868 /* Do not bother to mark virtual methods in anonymous namespace;
869 either we will find use of virtual table defining it, or it is
871 if (targets
[i
]->definition
873 (TREE_TYPE (targets
[i
]->decl
))
875 && !type_in_anonymous_namespace_p
877 (TREE_TYPE (targets
[i
]->decl
))))
878 enqueue_node (targets
[i
]);
882 /* Very trivial devirtualization; when the type is
883 final or anonymous (so we know all its derivation)
884 and there is only one possible virtual call target,
885 make the edge direct. */
888 if (targets
.length () <= 1)
891 if (targets
.length () == 1)
894 target
= cgraph_get_create_node
895 (builtin_decl_implicit (BUILT_IN_UNREACHABLE
));
897 if (cgraph_dump_file
)
899 fprintf (cgraph_dump_file
,
900 "Devirtualizing call: ");
901 print_gimple_stmt (cgraph_dump_file
,
905 cgraph_make_edge_direct (edge
, target
);
906 cgraph_redirect_edge_call_stmt_to_callee (edge
);
907 if (cgraph_dump_file
)
909 fprintf (cgraph_dump_file
,
910 "Devirtualized as: ");
911 print_gimple_stmt (cgraph_dump_file
,
920 /* Discover all functions and variables that are trivially needed, analyze
921 them as well as all functions and variables referred by them */
924 analyze_functions (void)
926 /* Keep track of already processed nodes when called multiple times for
927 intermodule optimization. */
928 static struct cgraph_node
*first_analyzed
;
929 struct cgraph_node
*first_handled
= first_analyzed
;
930 static varpool_node
*first_analyzed_var
;
931 varpool_node
*first_handled_var
= first_analyzed_var
;
932 struct pointer_set_t
*reachable_call_targets
= pointer_set_create ();
939 location_t saved_loc
= input_location
;
941 bitmap_obstack_initialize (NULL
);
942 cgraph_state
= CGRAPH_STATE_CONSTRUCTION
;
943 input_location
= UNKNOWN_LOCATION
;
945 /* Ugly, but the fixup can not happen at a time same body alias is created;
946 C++ FE is confused about the COMDAT groups being right. */
947 if (cpp_implicit_aliases_done
)
948 FOR_EACH_SYMBOL (node
)
949 if (node
->cpp_implicit_alias
)
950 fixup_same_cpp_alias_visibility (node
, symtab_alias_target (node
));
951 if (optimize
&& flag_devirtualize
)
952 build_type_inheritance_graph ();
954 /* Analysis adds static variables that in turn adds references to new functions.
955 So we need to iterate the process until it stabilize. */
959 process_function_and_variable_attributes (first_analyzed
,
962 /* First identify the trivially needed symbols. */
963 for (node
= symtab_nodes
;
964 node
!= first_analyzed
965 && node
!= first_analyzed_var
; node
= node
->next
)
967 if (decide_is_symbol_needed (node
))
970 if (!changed
&& cgraph_dump_file
)
971 fprintf (cgraph_dump_file
, "Trivially needed symbols:");
973 if (cgraph_dump_file
)
974 fprintf (cgraph_dump_file
, " %s", node
->asm_name ());
975 if (!changed
&& cgraph_dump_file
)
976 fprintf (cgraph_dump_file
, "\n");
978 if (node
== first_analyzed
979 || node
== first_analyzed_var
)
982 cgraph_process_new_functions ();
983 first_analyzed_var
= varpool_first_variable ();
984 first_analyzed
= cgraph_first_function ();
986 if (changed
&& dump_file
)
987 fprintf (cgraph_dump_file
, "\n");
989 /* Lower representation, build callgraph edges and references for all trivially
990 needed symbols and all symbols referred by them. */
991 while (queued_nodes
!= &symtab_terminator
)
995 queued_nodes
= (symtab_node
*)queued_nodes
->aux
;
996 cgraph_node
*cnode
= dyn_cast
<cgraph_node
> (node
);
997 if (cnode
&& cnode
->definition
)
999 struct cgraph_edge
*edge
;
1000 tree decl
= cnode
->decl
;
1002 /* ??? It is possible to create extern inline function
1003 and later using weak alias attribute to kill its body.
1004 See gcc.c-torture/compile/20011119-1.c */
1005 if (!DECL_STRUCT_FUNCTION (decl
)
1007 && !cnode
->thunk
.thunk_p
1008 && !cnode
->dispatcher_function
)
1010 cgraph_reset_node (cnode
);
1011 cnode
->local
.redefined_extern_inline
= true;
1015 if (!cnode
->analyzed
)
1016 cgraph_analyze_function (cnode
);
1018 for (edge
= cnode
->callees
; edge
; edge
= edge
->next_callee
)
1019 if (edge
->callee
->definition
)
1020 enqueue_node (edge
->callee
);
1021 if (optimize
&& flag_devirtualize
)
1023 struct cgraph_edge
*next
;
1025 for (edge
= cnode
->indirect_calls
; edge
; edge
= next
)
1027 next
= edge
->next_callee
;
1028 if (edge
->indirect_info
->polymorphic
)
1029 walk_polymorphic_call_targets (reachable_call_targets
,
1034 /* If decl is a clone of an abstract function,
1035 mark that abstract function so that we don't release its body.
1036 The DECL_INITIAL() of that abstract function declaration
1037 will be later needed to output debug info. */
1038 if (DECL_ABSTRACT_ORIGIN (decl
))
1040 struct cgraph_node
*origin_node
1041 = cgraph_get_create_node (DECL_ABSTRACT_ORIGIN (decl
));
1042 origin_node
->used_as_abstract_origin
= true;
1047 varpool_node
*vnode
= dyn_cast
<varpool_node
> (node
);
1048 if (vnode
&& vnode
->definition
&& !vnode
->analyzed
)
1049 varpool_analyze_node (vnode
);
1052 if (node
->same_comdat_group
)
1055 for (next
= node
->same_comdat_group
;
1057 next
= next
->same_comdat_group
)
1058 enqueue_node (next
);
1060 for (i
= 0; ipa_ref_list_reference_iterate (&node
->ref_list
, i
, ref
); i
++)
1061 if (ref
->referred
->definition
)
1062 enqueue_node (ref
->referred
);
1063 cgraph_process_new_functions ();
1066 if (optimize
&& flag_devirtualize
)
1067 update_type_inheritance_graph ();
1069 /* Collect entry points to the unit. */
1070 if (cgraph_dump_file
)
1072 fprintf (cgraph_dump_file
, "\n\nInitial ");
1073 dump_symtab (cgraph_dump_file
);
1076 if (cgraph_dump_file
)
1077 fprintf (cgraph_dump_file
, "\nRemoving unused symbols:");
1079 for (node
= symtab_nodes
;
1080 node
!= first_handled
1081 && node
!= first_handled_var
; node
= next
)
1084 if (!node
->aux
&& !referred_to_p (node
))
1086 if (cgraph_dump_file
)
1087 fprintf (cgraph_dump_file
, " %s", node
->name ());
1088 symtab_remove_node (node
);
1091 if (cgraph_node
*cnode
= dyn_cast
<cgraph_node
> (node
))
1093 tree decl
= node
->decl
;
1095 if (cnode
->definition
&& !gimple_has_body_p (decl
)
1097 && !cnode
->thunk
.thunk_p
)
1098 cgraph_reset_node (cnode
);
1100 gcc_assert (!cnode
->definition
|| cnode
->thunk
.thunk_p
1102 || gimple_has_body_p (decl
));
1103 gcc_assert (cnode
->analyzed
== cnode
->definition
);
1107 for (;node
; node
= node
->next
)
1109 first_analyzed
= cgraph_first_function ();
1110 first_analyzed_var
= varpool_first_variable ();
1111 if (cgraph_dump_file
)
1113 fprintf (cgraph_dump_file
, "\n\nReclaimed ");
1114 dump_symtab (cgraph_dump_file
);
1116 bitmap_obstack_release (NULL
);
1117 pointer_set_destroy (reachable_call_targets
);
1119 /* Initialize assembler name hash, in particular we want to trigger C++
1120 mangling and same body alias creation before we free DECL_ARGUMENTS
1123 symtab_initialize_asm_name_hash ();
1125 input_location
= saved_loc
;
1128 /* Translate the ugly representation of aliases as alias pairs into nice
1129 representation in callgraph. We don't handle all cases yet,
1133 handle_alias_pairs (void)
1138 for (i
= 0; alias_pairs
&& alias_pairs
->iterate (i
, &p
);)
1140 symtab_node
*target_node
= symtab_node_for_asm (p
->target
);
1142 /* Weakrefs with target not defined in current unit are easy to handle:
1143 they behave just as external variables except we need to note the
1144 alias flag to later output the weakref pseudo op into asm file. */
1146 && lookup_attribute ("weakref", DECL_ATTRIBUTES (p
->decl
)) != NULL
)
1148 symtab_node
*node
= symtab_get_node (p
->decl
);
1151 node
->alias_target
= p
->target
;
1152 node
->weakref
= true;
1155 alias_pairs
->unordered_remove (i
);
1158 else if (!target_node
)
1160 error ("%q+D aliased to undefined symbol %qE", p
->decl
, p
->target
);
1161 symtab_node
*node
= symtab_get_node (p
->decl
);
1163 node
->alias
= false;
1164 alias_pairs
->unordered_remove (i
);
1168 if (DECL_EXTERNAL (target_node
->decl
)
1169 /* We use local aliases for C++ thunks to force the tailcall
1170 to bind locally. This is a hack - to keep it working do
1171 the following (which is not strictly correct). */
1172 && (TREE_CODE (target_node
->decl
) != FUNCTION_DECL
1173 || ! DECL_VIRTUAL_P (target_node
->decl
))
1174 && ! lookup_attribute ("weakref", DECL_ATTRIBUTES (p
->decl
)))
1176 error ("%q+D aliased to external symbol %qE",
1177 p
->decl
, p
->target
);
1180 if (TREE_CODE (p
->decl
) == FUNCTION_DECL
1181 && target_node
&& is_a
<cgraph_node
> (target_node
))
1183 struct cgraph_node
*src_node
= cgraph_get_node (p
->decl
);
1184 if (src_node
&& src_node
->definition
)
1185 cgraph_reset_node (src_node
);
1186 cgraph_create_function_alias (p
->decl
, target_node
->decl
);
1187 alias_pairs
->unordered_remove (i
);
1189 else if (TREE_CODE (p
->decl
) == VAR_DECL
1190 && target_node
&& is_a
<varpool_node
> (target_node
))
1192 varpool_create_variable_alias (p
->decl
, target_node
->decl
);
1193 alias_pairs
->unordered_remove (i
);
1197 error ("%q+D alias in between function and variable is not supported",
1199 warning (0, "%q+D aliased declaration",
1201 alias_pairs
->unordered_remove (i
);
1204 vec_free (alias_pairs
);
1208 /* Figure out what functions we want to assemble. */
1211 mark_functions_to_output (void)
1213 struct cgraph_node
*node
;
1214 #ifdef ENABLE_CHECKING
1215 bool check_same_comdat_groups
= false;
1217 FOR_EACH_FUNCTION (node
)
1218 gcc_assert (!node
->process
);
1221 FOR_EACH_FUNCTION (node
)
1223 tree decl
= node
->decl
;
1225 gcc_assert (!node
->process
|| node
->same_comdat_group
);
1229 /* We need to output all local functions that are used and not
1230 always inlined, as well as those that are reachable from
1231 outside the current compilation unit. */
1233 && !node
->thunk
.thunk_p
1235 && !node
->global
.inlined_to
1236 && !TREE_ASM_WRITTEN (decl
)
1237 && !DECL_EXTERNAL (decl
))
1240 if (node
->same_comdat_group
)
1242 struct cgraph_node
*next
;
1243 for (next
= cgraph (node
->same_comdat_group
);
1245 next
= cgraph (next
->same_comdat_group
))
1246 if (!next
->thunk
.thunk_p
&& !next
->alias
1247 && !symtab_comdat_local_p (next
))
1251 else if (node
->same_comdat_group
)
1253 #ifdef ENABLE_CHECKING
1254 check_same_comdat_groups
= true;
1259 /* We should've reclaimed all functions that are not needed. */
1260 #ifdef ENABLE_CHECKING
1261 if (!node
->global
.inlined_to
1262 && gimple_has_body_p (decl
)
1263 /* FIXME: in ltrans unit when offline copy is outside partition but inline copies
1264 are inside partition, we can end up not removing the body since we no longer
1265 have analyzed node pointing to it. */
1266 && !node
->in_other_partition
1269 && !DECL_EXTERNAL (decl
))
1271 dump_cgraph_node (stderr
, node
);
1272 internal_error ("failed to reclaim unneeded function");
1275 gcc_assert (node
->global
.inlined_to
1276 || !gimple_has_body_p (decl
)
1277 || node
->in_other_partition
1279 || DECL_ARTIFICIAL (decl
)
1280 || DECL_EXTERNAL (decl
));
1285 #ifdef ENABLE_CHECKING
1286 if (check_same_comdat_groups
)
1287 FOR_EACH_FUNCTION (node
)
1288 if (node
->same_comdat_group
&& !node
->process
)
1290 tree decl
= node
->decl
;
1291 if (!node
->global
.inlined_to
1292 && gimple_has_body_p (decl
)
1293 /* FIXME: in an ltrans unit when the offline copy is outside a
1294 partition but inline copies are inside a partition, we can
1295 end up not removing the body since we no longer have an
1296 analyzed node pointing to it. */
1297 && !node
->in_other_partition
1299 && !DECL_EXTERNAL (decl
))
1301 dump_cgraph_node (stderr
, node
);
1302 internal_error ("failed to reclaim unneeded function in same "
1309 /* DECL is FUNCTION_DECL. Initialize datastructures so DECL is a function
1310 in lowered gimple form. IN_SSA is true if the gimple is in SSA.
1312 Set current_function_decl and cfun to newly constructed empty function body.
1313 return basic block in the function body. */
1316 init_lowered_empty_function (tree decl
, bool in_ssa
)
1320 current_function_decl
= decl
;
1321 allocate_struct_function (decl
, false);
1322 gimple_register_cfg_hooks ();
1323 init_empty_tree_cfg ();
1327 init_tree_ssa (cfun
);
1328 init_ssa_operands (cfun
);
1329 cfun
->gimple_df
->in_ssa_p
= true;
1330 cfun
->curr_properties
|= PROP_ssa
;
1333 DECL_INITIAL (decl
) = make_node (BLOCK
);
1335 DECL_SAVED_TREE (decl
) = error_mark_node
;
1336 cfun
->curr_properties
|= (PROP_gimple_lcf
| PROP_gimple_leh
| PROP_gimple_any
1337 | PROP_cfg
| PROP_loops
);
1339 set_loops_for_fn (cfun
, ggc_alloc_cleared_loops ());
1340 init_loops_structure (cfun
, loops_for_fn (cfun
), 1);
1341 loops_for_fn (cfun
)->state
|= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
1343 /* Create BB for body of the function and connect it properly. */
1344 bb
= create_basic_block (NULL
, (void *) 0, ENTRY_BLOCK_PTR_FOR_FN (cfun
));
1345 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
), bb
, EDGE_FALLTHRU
);
1346 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
1347 add_bb_to_loop (bb
, ENTRY_BLOCK_PTR_FOR_FN (cfun
)->loop_father
);
1352 /* Adjust PTR by the constant FIXED_OFFSET, and by the vtable
1353 offset indicated by VIRTUAL_OFFSET, if that is
1354 non-null. THIS_ADJUSTING is nonzero for a this adjusting thunk and
1355 zero for a result adjusting thunk. */
1358 thunk_adjust (gimple_stmt_iterator
* bsi
,
1359 tree ptr
, bool this_adjusting
,
1360 HOST_WIDE_INT fixed_offset
, tree virtual_offset
)
1366 && fixed_offset
!= 0)
1368 stmt
= gimple_build_assign
1369 (ptr
, fold_build_pointer_plus_hwi_loc (input_location
,
1372 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1375 /* If there's a virtual offset, look up that value in the vtable and
1376 adjust the pointer again. */
1383 if (!vtable_entry_type
)
1385 tree vfunc_type
= make_node (FUNCTION_TYPE
);
1386 TREE_TYPE (vfunc_type
) = integer_type_node
;
1387 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
1388 layout_type (vfunc_type
);
1390 vtable_entry_type
= build_pointer_type (vfunc_type
);
1394 create_tmp_reg (build_pointer_type
1395 (build_pointer_type (vtable_entry_type
)), "vptr");
1397 /* The vptr is always at offset zero in the object. */
1398 stmt
= gimple_build_assign (vtabletmp
,
1399 build1 (NOP_EXPR
, TREE_TYPE (vtabletmp
),
1401 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1403 /* Form the vtable address. */
1404 vtabletmp2
= create_tmp_reg (TREE_TYPE (TREE_TYPE (vtabletmp
)),
1406 stmt
= gimple_build_assign (vtabletmp2
,
1407 build_simple_mem_ref (vtabletmp
));
1408 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1410 /* Find the entry with the vcall offset. */
1411 stmt
= gimple_build_assign (vtabletmp2
,
1412 fold_build_pointer_plus_loc (input_location
,
1415 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1417 /* Get the offset itself. */
1418 vtabletmp3
= create_tmp_reg (TREE_TYPE (TREE_TYPE (vtabletmp2
)),
1420 stmt
= gimple_build_assign (vtabletmp3
,
1421 build_simple_mem_ref (vtabletmp2
));
1422 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1424 /* Adjust the `this' pointer. */
1425 ptr
= fold_build_pointer_plus_loc (input_location
, ptr
, vtabletmp3
);
1426 ptr
= force_gimple_operand_gsi (bsi
, ptr
, true, NULL_TREE
, false,
1427 GSI_CONTINUE_LINKING
);
1431 && fixed_offset
!= 0)
1432 /* Adjust the pointer by the constant. */
1436 if (TREE_CODE (ptr
) == VAR_DECL
)
1440 ptrtmp
= create_tmp_reg (TREE_TYPE (ptr
), "ptr");
1441 stmt
= gimple_build_assign (ptrtmp
, ptr
);
1442 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1444 ptr
= fold_build_pointer_plus_hwi_loc (input_location
,
1445 ptrtmp
, fixed_offset
);
1448 /* Emit the statement and gimplify the adjustment expression. */
1449 ret
= create_tmp_reg (TREE_TYPE (ptr
), "adjusted_this");
1450 stmt
= gimple_build_assign (ret
, ptr
);
1451 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1456 /* Expand thunk NODE to gimple if possible.
1457 When OUTPUT_ASM_THUNK is true, also produce assembler for
1458 thunks that are not lowered. */
1461 expand_thunk (struct cgraph_node
*node
, bool output_asm_thunks
)
1463 bool this_adjusting
= node
->thunk
.this_adjusting
;
1464 HOST_WIDE_INT fixed_offset
= node
->thunk
.fixed_offset
;
1465 HOST_WIDE_INT virtual_value
= node
->thunk
.virtual_value
;
1466 tree virtual_offset
= NULL
;
1467 tree alias
= node
->callees
->callee
->decl
;
1468 tree thunk_fndecl
= node
->decl
;
1473 && targetm
.asm_out
.can_output_mi_thunk (thunk_fndecl
, fixed_offset
,
1474 virtual_value
, alias
))
1478 tree restype
= TREE_TYPE (TREE_TYPE (thunk_fndecl
));
1480 if (!output_asm_thunks
)
1484 cgraph_get_body (node
);
1485 a
= DECL_ARGUMENTS (thunk_fndecl
);
1487 current_function_decl
= thunk_fndecl
;
1489 /* Ensure thunks are emitted in their correct sections. */
1490 resolve_unique_section (thunk_fndecl
, 0, flag_function_sections
);
1492 DECL_RESULT (thunk_fndecl
)
1493 = build_decl (DECL_SOURCE_LOCATION (thunk_fndecl
),
1494 RESULT_DECL
, 0, restype
);
1495 DECL_CONTEXT (DECL_RESULT (thunk_fndecl
)) = thunk_fndecl
;
1496 fnname
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk_fndecl
));
1498 /* The back end expects DECL_INITIAL to contain a BLOCK, so we
1500 fn_block
= make_node (BLOCK
);
1501 BLOCK_VARS (fn_block
) = a
;
1502 DECL_INITIAL (thunk_fndecl
) = fn_block
;
1503 init_function_start (thunk_fndecl
);
1505 insn_locations_init ();
1506 set_curr_insn_location (DECL_SOURCE_LOCATION (thunk_fndecl
));
1507 prologue_location
= curr_insn_location ();
1508 assemble_start_function (thunk_fndecl
, fnname
);
1510 targetm
.asm_out
.output_mi_thunk (asm_out_file
, thunk_fndecl
,
1511 fixed_offset
, virtual_value
, alias
);
1513 assemble_end_function (thunk_fndecl
, fnname
);
1514 insn_locations_finalize ();
1515 init_insn_lengths ();
1516 free_after_compilation (cfun
);
1518 TREE_ASM_WRITTEN (thunk_fndecl
) = 1;
1519 node
->thunk
.thunk_p
= false;
1520 node
->analyzed
= false;
1525 basic_block bb
, then_bb
, else_bb
, return_bb
;
1526 gimple_stmt_iterator bsi
;
1537 cgraph_get_body (node
);
1538 a
= DECL_ARGUMENTS (thunk_fndecl
);
1540 current_function_decl
= thunk_fndecl
;
1542 /* Ensure thunks are emitted in their correct sections. */
1543 resolve_unique_section (thunk_fndecl
, 0, flag_function_sections
);
1545 DECL_IGNORED_P (thunk_fndecl
) = 1;
1546 bitmap_obstack_initialize (NULL
);
1548 if (node
->thunk
.virtual_offset_p
)
1549 virtual_offset
= size_int (virtual_value
);
1551 /* Build the return declaration for the function. */
1552 restype
= TREE_TYPE (TREE_TYPE (thunk_fndecl
));
1553 if (DECL_RESULT (thunk_fndecl
) == NULL_TREE
)
1555 resdecl
= build_decl (input_location
, RESULT_DECL
, 0, restype
);
1556 DECL_ARTIFICIAL (resdecl
) = 1;
1557 DECL_IGNORED_P (resdecl
) = 1;
1558 DECL_RESULT (thunk_fndecl
) = resdecl
;
1559 DECL_CONTEXT (DECL_RESULT (thunk_fndecl
)) = thunk_fndecl
;
1562 resdecl
= DECL_RESULT (thunk_fndecl
);
1564 bb
= then_bb
= else_bb
= return_bb
= init_lowered_empty_function (thunk_fndecl
, true);
1566 bsi
= gsi_start_bb (bb
);
1568 /* Build call to the function being thunked. */
1569 if (!VOID_TYPE_P (restype
))
1571 if (DECL_BY_REFERENCE (resdecl
))
1572 restmp
= gimple_fold_indirect_ref (resdecl
);
1573 else if (!is_gimple_reg_type (restype
))
1576 add_local_decl (cfun
, restmp
);
1577 BLOCK_VARS (DECL_INITIAL (current_function_decl
)) = restmp
;
1580 restmp
= create_tmp_reg (restype
, "retval");
1583 for (arg
= a
; arg
; arg
= DECL_CHAIN (arg
))
1585 auto_vec
<tree
> vargs (nargs
);
1587 vargs
.quick_push (thunk_adjust (&bsi
, a
, 1, fixed_offset
,
1590 vargs
.quick_push (a
);
1593 for (i
= 1, arg
= DECL_CHAIN (a
); i
< nargs
; i
++, arg
= DECL_CHAIN (arg
))
1596 if (!is_gimple_val (arg
))
1598 tmp
= create_tmp_reg (TYPE_MAIN_VARIANT
1599 (TREE_TYPE (arg
)), "arg");
1600 gimple stmt
= gimple_build_assign (tmp
, arg
);
1601 gsi_insert_after (&bsi
, stmt
, GSI_NEW_STMT
);
1603 vargs
.quick_push (tmp
);
1605 call
= gimple_build_call_vec (build_fold_addr_expr_loc (0, alias
), vargs
);
1606 node
->callees
->call_stmt
= call
;
1607 gimple_call_set_from_thunk (call
, true);
1610 gimple_call_set_lhs (call
, restmp
);
1611 gcc_assert (useless_type_conversion_p (TREE_TYPE (restmp
),
1612 TREE_TYPE (TREE_TYPE (alias
))));
1614 gsi_insert_after (&bsi
, call
, GSI_NEW_STMT
);
1615 if (!(gimple_call_flags (call
) & ECF_NORETURN
))
1617 if (restmp
&& !this_adjusting
1618 && (fixed_offset
|| virtual_offset
))
1620 tree true_label
= NULL_TREE
;
1622 if (TREE_CODE (TREE_TYPE (restmp
)) == POINTER_TYPE
)
1625 /* If the return type is a pointer, we need to
1626 protect against NULL. We know there will be an
1627 adjustment, because that's why we're emitting a
1629 then_bb
= create_basic_block (NULL
, (void *) 0, bb
);
1630 return_bb
= create_basic_block (NULL
, (void *) 0, then_bb
);
1631 else_bb
= create_basic_block (NULL
, (void *) 0, else_bb
);
1632 add_bb_to_loop (then_bb
, bb
->loop_father
);
1633 add_bb_to_loop (return_bb
, bb
->loop_father
);
1634 add_bb_to_loop (else_bb
, bb
->loop_father
);
1635 remove_edge (single_succ_edge (bb
));
1636 true_label
= gimple_block_label (then_bb
);
1637 stmt
= gimple_build_cond (NE_EXPR
, restmp
,
1638 build_zero_cst (TREE_TYPE (restmp
)),
1639 NULL_TREE
, NULL_TREE
);
1640 gsi_insert_after (&bsi
, stmt
, GSI_NEW_STMT
);
1641 make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
1642 make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
1643 make_edge (return_bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
1644 make_edge (then_bb
, return_bb
, EDGE_FALLTHRU
);
1645 make_edge (else_bb
, return_bb
, EDGE_FALLTHRU
);
1646 bsi
= gsi_last_bb (then_bb
);
1649 restmp
= thunk_adjust (&bsi
, restmp
, /*this_adjusting=*/0,
1650 fixed_offset
, virtual_offset
);
1654 bsi
= gsi_last_bb (else_bb
);
1655 stmt
= gimple_build_assign (restmp
,
1656 build_zero_cst (TREE_TYPE (restmp
)));
1657 gsi_insert_after (&bsi
, stmt
, GSI_NEW_STMT
);
1658 bsi
= gsi_last_bb (return_bb
);
1662 gimple_call_set_tail (call
, true);
1664 /* Build return value. */
1665 ret
= gimple_build_return (restmp
);
1666 gsi_insert_after (&bsi
, ret
, GSI_NEW_STMT
);
1670 gimple_call_set_tail (call
, true);
1671 remove_edge (single_succ_edge (bb
));
1674 cfun
->gimple_df
->in_ssa_p
= true;
1675 /* FIXME: C++ FE should stop setting TREE_ASM_WRITTEN on thunks. */
1676 TREE_ASM_WRITTEN (thunk_fndecl
) = false;
1677 delete_unreachable_blocks ();
1678 update_ssa (TODO_update_ssa
);
1679 #ifdef ENABLE_CHECKING
1680 verify_flow_info ();
1682 free_dominance_info (CDI_DOMINATORS
);
1684 /* Since we want to emit the thunk, we explicitly mark its name as
1686 node
->thunk
.thunk_p
= false;
1687 node
->lowered
= true;
1688 bitmap_obstack_release (NULL
);
1690 current_function_decl
= NULL
;
1695 /* Assemble thunks and aliases associated to NODE. */
1698 assemble_thunks_and_aliases (struct cgraph_node
*node
)
1700 struct cgraph_edge
*e
;
1702 struct ipa_ref
*ref
;
1704 for (e
= node
->callers
; e
;)
1705 if (e
->caller
->thunk
.thunk_p
)
1707 struct cgraph_node
*thunk
= e
->caller
;
1710 assemble_thunks_and_aliases (thunk
);
1711 expand_thunk (thunk
, true);
1715 for (i
= 0; ipa_ref_list_referring_iterate (&node
->ref_list
,
1717 if (ref
->use
== IPA_REF_ALIAS
)
1719 struct cgraph_node
*alias
= ipa_ref_referring_node (ref
);
1720 bool saved_written
= TREE_ASM_WRITTEN (node
->decl
);
1722 /* Force assemble_alias to really output the alias this time instead
1723 of buffering it in same alias pairs. */
1724 TREE_ASM_WRITTEN (node
->decl
) = 1;
1725 do_assemble_alias (alias
->decl
,
1726 DECL_ASSEMBLER_NAME (node
->decl
));
1727 assemble_thunks_and_aliases (alias
);
1728 TREE_ASM_WRITTEN (node
->decl
) = saved_written
;
1732 /* Expand function specified by NODE. */
1735 expand_function (struct cgraph_node
*node
)
1737 tree decl
= node
->decl
;
1738 location_t saved_loc
;
1740 /* We ought to not compile any inline clones. */
1741 gcc_assert (!node
->global
.inlined_to
);
1743 announce_function (decl
);
1745 gcc_assert (node
->lowered
);
1746 cgraph_get_body (node
);
1748 /* Generate RTL for the body of DECL. */
1750 timevar_push (TV_REST_OF_COMPILATION
);
1752 gcc_assert (cgraph_global_info_ready
);
1754 /* Initialize the default bitmap obstack. */
1755 bitmap_obstack_initialize (NULL
);
1757 /* Initialize the RTL code for the function. */
1758 current_function_decl
= decl
;
1759 saved_loc
= input_location
;
1760 input_location
= DECL_SOURCE_LOCATION (decl
);
1761 init_function_start (decl
);
1763 gimple_register_cfg_hooks ();
1765 bitmap_obstack_initialize (®_obstack
); /* FIXME, only at RTL generation*/
1767 execute_all_ipa_transforms ();
1769 /* Perform all tree transforms and optimizations. */
1771 /* Signal the start of passes. */
1772 invoke_plugin_callbacks (PLUGIN_ALL_PASSES_START
, NULL
);
1774 execute_pass_list (g
->get_passes ()->all_passes
);
1776 /* Signal the end of passes. */
1777 invoke_plugin_callbacks (PLUGIN_ALL_PASSES_END
, NULL
);
1779 bitmap_obstack_release (®_obstack
);
1781 /* Release the default bitmap obstack. */
1782 bitmap_obstack_release (NULL
);
1784 /* If requested, warn about function definitions where the function will
1785 return a value (usually of some struct or union type) which itself will
1786 take up a lot of stack space. */
1787 if (warn_larger_than
&& !DECL_EXTERNAL (decl
) && TREE_TYPE (decl
))
1789 tree ret_type
= TREE_TYPE (TREE_TYPE (decl
));
1791 if (ret_type
&& TYPE_SIZE_UNIT (ret_type
)
1792 && TREE_CODE (TYPE_SIZE_UNIT (ret_type
)) == INTEGER_CST
1793 && 0 < compare_tree_int (TYPE_SIZE_UNIT (ret_type
),
1796 unsigned int size_as_int
1797 = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (ret_type
));
1799 if (compare_tree_int (TYPE_SIZE_UNIT (ret_type
), size_as_int
) == 0)
1800 warning (OPT_Wlarger_than_
, "size of return value of %q+D is %u bytes",
1803 warning (OPT_Wlarger_than_
, "size of return value of %q+D is larger than %wd bytes",
1804 decl
, larger_than_size
);
1808 gimple_set_body (decl
, NULL
);
1809 if (DECL_STRUCT_FUNCTION (decl
) == 0
1810 && !cgraph_get_node (decl
)->origin
)
1812 /* Stop pointing to the local nodes about to be freed.
1813 But DECL_INITIAL must remain nonzero so we know this
1814 was an actual function definition.
1815 For a nested function, this is done in c_pop_function_context.
1816 If rest_of_compilation set this to 0, leave it 0. */
1817 if (DECL_INITIAL (decl
) != 0)
1818 DECL_INITIAL (decl
) = error_mark_node
;
1821 input_location
= saved_loc
;
1824 timevar_pop (TV_REST_OF_COMPILATION
);
1826 /* Make sure that BE didn't give up on compiling. */
1827 gcc_assert (TREE_ASM_WRITTEN (decl
));
1829 current_function_decl
= NULL
;
1831 /* It would make a lot more sense to output thunks before function body to get more
1832 forward and lest backwarding jumps. This however would need solving problem
1833 with comdats. See PR48668. Also aliases must come after function itself to
1834 make one pass assemblers, like one on AIX, happy. See PR 50689.
1835 FIXME: Perhaps thunks should be move before function IFF they are not in comdat
1837 assemble_thunks_and_aliases (node
);
1838 cgraph_release_function_body (node
);
1839 /* Eliminate all call edges. This is important so the GIMPLE_CALL no longer
1840 points to the dead function body. */
1841 cgraph_node_remove_callees (node
);
1842 ipa_remove_all_references (&node
->ref_list
);
1845 /* Node comparer that is responsible for the order that corresponds
1846 to time when a function was launched for the first time. */
1849 node_cmp (const void *pa
, const void *pb
)
1851 const struct cgraph_node
*a
= *(const struct cgraph_node
* const *) pa
;
1852 const struct cgraph_node
*b
= *(const struct cgraph_node
* const *) pb
;
1854 /* Functions with time profile must be before these without profile. */
1855 if (!a
->tp_first_run
|| !b
->tp_first_run
)
1856 return a
->tp_first_run
- b
->tp_first_run
;
1858 return a
->tp_first_run
!= b
->tp_first_run
1859 ? b
->tp_first_run
- a
->tp_first_run
1860 : b
->order
- a
->order
;
1863 /* Expand all functions that must be output.
1865 Attempt to topologically sort the nodes so function is output when
1866 all called functions are already assembled to allow data to be
1867 propagated across the callgraph. Use a stack to get smaller distance
1868 between a function and its callees (later we may choose to use a more
1869 sophisticated algorithm for function reordering; we will likely want
1870 to use subsections to make the output functions appear in top-down
1874 expand_all_functions (void)
1876 struct cgraph_node
*node
;
1877 struct cgraph_node
**order
= XCNEWVEC (struct cgraph_node
*, cgraph_n_nodes
);
1878 unsigned int expanded_func_count
= 0, profiled_func_count
= 0;
1879 int order_pos
, new_order_pos
= 0;
1882 order_pos
= ipa_reverse_postorder (order
);
1883 gcc_assert (order_pos
== cgraph_n_nodes
);
1885 /* Garbage collector may remove inline clones we eliminate during
1886 optimization. So we must be sure to not reference them. */
1887 for (i
= 0; i
< order_pos
; i
++)
1888 if (order
[i
]->process
)
1889 order
[new_order_pos
++] = order
[i
];
1891 if (flag_profile_reorder_functions
)
1892 qsort (order
, new_order_pos
, sizeof (struct cgraph_node
*), node_cmp
);
1894 for (i
= new_order_pos
- 1; i
>= 0; i
--)
1900 expanded_func_count
++;
1901 if(node
->tp_first_run
)
1902 profiled_func_count
++;
1904 if (cgraph_dump_file
)
1905 fprintf (cgraph_dump_file
, "Time profile order in expand_all_functions:%s:%d\n", node
->asm_name (), node
->tp_first_run
);
1908 expand_function (node
);
1913 fprintf (dump_file
, "Expanded functions with time profile (%s):%u/%u\n",
1914 main_input_filename
, profiled_func_count
, expanded_func_count
);
1916 if (cgraph_dump_file
&& flag_profile_reorder_functions
)
1917 fprintf (cgraph_dump_file
, "Expanded functions with time profile:%u/%u\n",
1918 profiled_func_count
, expanded_func_count
);
1920 cgraph_process_new_functions ();
1921 free_gimplify_stack ();
1926 /* This is used to sort the node types by the cgraph order number. */
1928 enum cgraph_order_sort_kind
1930 ORDER_UNDEFINED
= 0,
1936 struct cgraph_order_sort
1938 enum cgraph_order_sort_kind kind
;
1941 struct cgraph_node
*f
;
1947 /* Output all functions, variables, and asm statements in the order
1948 according to their order fields, which is the order in which they
1949 appeared in the file. This implements -fno-toplevel-reorder. In
1950 this mode we may output functions and variables which don't really
1951 need to be output. */
1954 output_in_order (void)
1957 struct cgraph_order_sort
*nodes
;
1959 struct cgraph_node
*pf
;
1961 struct asm_node
*pa
;
1964 nodes
= XCNEWVEC (struct cgraph_order_sort
, max
);
1966 FOR_EACH_DEFINED_FUNCTION (pf
)
1968 if (pf
->process
&& !pf
->thunk
.thunk_p
&& !pf
->alias
)
1971 gcc_assert (nodes
[i
].kind
== ORDER_UNDEFINED
);
1972 nodes
[i
].kind
= ORDER_FUNCTION
;
1977 FOR_EACH_DEFINED_VARIABLE (pv
)
1978 if (!DECL_EXTERNAL (pv
->decl
))
1981 gcc_assert (nodes
[i
].kind
== ORDER_UNDEFINED
);
1982 nodes
[i
].kind
= ORDER_VAR
;
1986 for (pa
= asm_nodes
; pa
; pa
= pa
->next
)
1989 gcc_assert (nodes
[i
].kind
== ORDER_UNDEFINED
);
1990 nodes
[i
].kind
= ORDER_ASM
;
1994 /* In toplevel reorder mode we output all statics; mark them as needed. */
1996 for (i
= 0; i
< max
; ++i
)
1997 if (nodes
[i
].kind
== ORDER_VAR
)
1998 varpool_finalize_named_section_flags (nodes
[i
].u
.v
);
2000 for (i
= 0; i
< max
; ++i
)
2002 switch (nodes
[i
].kind
)
2004 case ORDER_FUNCTION
:
2005 nodes
[i
].u
.f
->process
= 0;
2006 expand_function (nodes
[i
].u
.f
);
2010 varpool_assemble_decl (nodes
[i
].u
.v
);
2014 assemble_asm (nodes
[i
].u
.a
->asm_str
);
2017 case ORDER_UNDEFINED
:
2032 gcc::pass_manager
*passes
= g
->get_passes ();
2035 current_function_decl
= NULL
;
2036 gimple_register_cfg_hooks ();
2037 bitmap_obstack_initialize (NULL
);
2039 invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_START
, NULL
);
2043 execute_ipa_pass_list (passes
->all_small_ipa_passes
);
2048 /* We never run removal of unreachable nodes after early passes. This is
2049 because TODO is run before the subpasses. It is important to remove
2050 the unreachable functions to save works at IPA level and to get LTO
2051 symbol tables right. */
2052 symtab_remove_unreachable_nodes (true, cgraph_dump_file
);
2054 /* If pass_all_early_optimizations was not scheduled, the state of
2055 the cgraph will not be properly updated. Update it now. */
2056 if (cgraph_state
< CGRAPH_STATE_IPA_SSA
)
2057 cgraph_state
= CGRAPH_STATE_IPA_SSA
;
2061 /* Generate coverage variables and constructors. */
2064 /* Process new functions added. */
2066 current_function_decl
= NULL
;
2067 cgraph_process_new_functions ();
2069 execute_ipa_summary_passes
2070 ((ipa_opt_pass_d
*) passes
->all_regular_ipa_passes
);
2073 /* Some targets need to handle LTO assembler output specially. */
2074 if (flag_generate_lto
)
2075 targetm
.asm_out
.lto_start ();
2078 ipa_write_summaries ();
2080 if (flag_generate_lto
)
2081 targetm
.asm_out
.lto_end ();
2083 if (!flag_ltrans
&& (in_lto_p
|| !flag_lto
|| flag_fat_lto_objects
))
2084 execute_ipa_pass_list (passes
->all_regular_ipa_passes
);
2085 invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_END
, NULL
);
2087 bitmap_obstack_release (NULL
);
2091 /* Return string alias is alias of. */
2094 get_alias_symbol (tree decl
)
2096 tree alias
= lookup_attribute ("alias", DECL_ATTRIBUTES (decl
));
2097 return get_identifier (TREE_STRING_POINTER
2098 (TREE_VALUE (TREE_VALUE (alias
))));
2102 /* Weakrefs may be associated to external decls and thus not output
2103 at expansion time. Emit all necessary aliases. */
2106 output_weakrefs (void)
2109 FOR_EACH_SYMBOL (node
)
2111 && !TREE_ASM_WRITTEN (node
->decl
)
2116 /* Weakrefs are special by not requiring target definition in current
2117 compilation unit. It is thus bit hard to work out what we want to
2119 When alias target is defined, we need to fetch it from symtab reference,
2120 otherwise it is pointed to by alias_target. */
2121 if (node
->alias_target
)
2122 target
= (DECL_P (node
->alias_target
)
2123 ? DECL_ASSEMBLER_NAME (node
->alias_target
)
2124 : node
->alias_target
);
2125 else if (node
->analyzed
)
2126 target
= DECL_ASSEMBLER_NAME (symtab_alias_target (node
)->decl
);
2130 target
= get_alias_symbol (node
->decl
);
2132 do_assemble_alias (node
->decl
, target
);
2136 /* Initialize callgraph dump file. */
2141 if (!cgraph_dump_file
)
2142 cgraph_dump_file
= dump_begin (TDI_cgraph
, NULL
);
2146 /* Perform simple optimizations based on callgraph. */
2154 #ifdef ENABLE_CHECKING
2158 timevar_push (TV_CGRAPHOPT
);
2159 if (pre_ipa_mem_report
)
2161 fprintf (stderr
, "Memory consumption before IPA\n");
2162 dump_memory_report (false);
2165 fprintf (stderr
, "Performing interprocedural optimizations\n");
2166 cgraph_state
= CGRAPH_STATE_IPA
;
2168 /* If LTO is enabled, initialize the streamer hooks needed by GIMPLE. */
2170 lto_streamer_hooks_init ();
2172 /* Don't run the IPA passes if there was any error or sorry messages. */
2176 /* Do nothing else if any IPA pass found errors or if we are just streaming LTO. */
2178 || (!in_lto_p
&& flag_lto
&& !flag_fat_lto_objects
))
2180 timevar_pop (TV_CGRAPHOPT
);
2184 /* This pass remove bodies of extern inline functions we never inlined.
2185 Do this later so other IPA passes see what is really going on. */
2186 symtab_remove_unreachable_nodes (false, dump_file
);
2187 cgraph_global_info_ready
= true;
2188 if (cgraph_dump_file
)
2190 fprintf (cgraph_dump_file
, "Optimized ");
2191 dump_symtab (cgraph_dump_file
);
2193 if (post_ipa_mem_report
)
2195 fprintf (stderr
, "Memory consumption after IPA\n");
2196 dump_memory_report (false);
2198 timevar_pop (TV_CGRAPHOPT
);
2200 /* Output everything. */
2201 (*debug_hooks
->assembly_start
) ();
2203 fprintf (stderr
, "Assembling functions:\n");
2204 #ifdef ENABLE_CHECKING
2208 cgraph_materialize_all_clones ();
2209 bitmap_obstack_initialize (NULL
);
2210 execute_ipa_pass_list (g
->get_passes ()->all_late_ipa_passes
);
2211 symtab_remove_unreachable_nodes (true, dump_file
);
2212 #ifdef ENABLE_CHECKING
2215 bitmap_obstack_release (NULL
);
2216 mark_functions_to_output ();
2218 /* When weakref support is missing, we autmatically translate all
2219 references to NODE to references to its ultimate alias target.
2220 The renaming mechanizm uses flag IDENTIFIER_TRANSPARENT_ALIAS and
2223 Set up this mapping before we output any assembler but once we are sure
2224 that all symbol renaming is done.
2226 FIXME: All this uglyness can go away if we just do renaming at gimple
2227 level by physically rewritting the IL. At the moment we can only redirect
2228 calls, so we need infrastructure for renaming references as well. */
2229 #ifndef ASM_OUTPUT_WEAKREF
2232 FOR_EACH_SYMBOL (node
)
2234 && lookup_attribute ("weakref", DECL_ATTRIBUTES (node
->decl
)))
2236 IDENTIFIER_TRANSPARENT_ALIAS
2237 (DECL_ASSEMBLER_NAME (node
->decl
)) = 1;
2238 TREE_CHAIN (DECL_ASSEMBLER_NAME (node
->decl
))
2239 = (node
->alias_target
? node
->alias_target
2240 : DECL_ASSEMBLER_NAME (symtab_alias_target (node
)->decl
));
2244 cgraph_state
= CGRAPH_STATE_EXPANSION
;
2246 if (!flag_toplevel_reorder
)
2250 output_asm_statements ();
2252 expand_all_functions ();
2253 varpool_output_variables ();
2256 cgraph_process_new_functions ();
2257 cgraph_state
= CGRAPH_STATE_FINISHED
;
2260 if (cgraph_dump_file
)
2262 fprintf (cgraph_dump_file
, "\nFinal ");
2263 dump_symtab (cgraph_dump_file
);
2265 #ifdef ENABLE_CHECKING
2267 /* Double check that all inline clones are gone and that all
2268 function bodies have been released from memory. */
2271 struct cgraph_node
*node
;
2272 bool error_found
= false;
2274 FOR_EACH_DEFINED_FUNCTION (node
)
2275 if (node
->global
.inlined_to
2276 || gimple_has_body_p (node
->decl
))
2279 dump_cgraph_node (stderr
, node
);
2282 internal_error ("nodes with unreleased memory found");
2288 /* Analyze the whole compilation unit once it is parsed completely. */
2291 finalize_compilation_unit (void)
2293 timevar_push (TV_CGRAPH
);
2295 /* If we're here there's no current function anymore. Some frontends
2296 are lazy in clearing these. */
2297 current_function_decl
= NULL
;
2300 /* Do not skip analyzing the functions if there were errors, we
2301 miss diagnostics for following functions otherwise. */
2303 /* Emit size functions we didn't inline. */
2304 finalize_size_functions ();
2306 /* Mark alias targets necessary and emit diagnostics. */
2307 handle_alias_pairs ();
2311 fprintf (stderr
, "\nAnalyzing compilation unit\n");
2315 if (flag_dump_passes
)
2318 /* Gimplify and lower all functions, compute reachability and
2319 remove unreachable nodes. */
2320 analyze_functions ();
2322 /* Mark alias targets necessary and emit diagnostics. */
2323 handle_alias_pairs ();
2325 /* Gimplify and lower thunks. */
2326 analyze_functions ();
2328 /* Finally drive the pass manager. */
2331 timevar_pop (TV_CGRAPH
);
2335 #include "gt-cgraphunit.h"