1 /* Callgraph based interprocedural optimizations.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009
3 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 the call-graph construction and local function
49 analysis takes place here. Bodies of unreachable functions are released
50 to 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"
130 #include "function.h"
131 #include "ipa-prop.h"
133 #include "tree-iterator.h"
134 #include "tree-pass.h"
135 #include "tree-dump.h"
137 #include "coverage.h"
140 static void cgraph_expand_all_functions (void);
141 static void cgraph_mark_functions_to_output (void);
142 static void cgraph_expand_function (struct cgraph_node
*);
143 static void cgraph_output_pending_asms (void);
144 static void cgraph_analyze_function (struct cgraph_node
*);
146 static FILE *cgraph_dump_file
;
148 /* A vector of FUNCTION_DECLs declared as static constructors. */
149 static GTY (()) VEC(tree
, gc
) *static_ctors
;
150 /* A vector of FUNCTION_DECLs declared as static destructors. */
151 static GTY (()) VEC(tree
, gc
) *static_dtors
;
153 /* Used for vtable lookup in thunk adjusting. */
154 static GTY (()) tree vtable_entry_type
;
156 /* When target does not have ctors and dtors, we call all constructor
157 and destructor by special initialization/destruction function
158 recognized by collect2.
160 When we are going to build this function, collect all constructors and
161 destructors and turn them into normal functions. */
164 record_cdtor_fn (tree fndecl
)
166 struct cgraph_node
*node
;
167 if (targetm
.have_ctors_dtors
168 || (!DECL_STATIC_CONSTRUCTOR (fndecl
)
169 && !DECL_STATIC_DESTRUCTOR (fndecl
)))
172 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
174 VEC_safe_push (tree
, gc
, static_ctors
, fndecl
);
175 DECL_STATIC_CONSTRUCTOR (fndecl
) = 0;
177 if (DECL_STATIC_DESTRUCTOR (fndecl
))
179 VEC_safe_push (tree
, gc
, static_dtors
, fndecl
);
180 DECL_STATIC_DESTRUCTOR (fndecl
) = 0;
182 node
= cgraph_node (fndecl
);
183 node
->local
.disregard_inline_limits
= 1;
184 cgraph_mark_reachable_node (node
);
187 /* Define global constructors/destructor functions for the CDTORS, of
188 which they are LEN. The CDTORS are sorted by initialization
189 priority. If CTOR_P is true, these are constructors; otherwise,
190 they are destructors. */
193 build_cdtor (bool ctor_p
, tree
*cdtors
, size_t len
)
202 priority_type priority
;
206 /* Find the next batch of constructors/destructors with the same
207 initialization priority. */
212 p
= ctor_p
? DECL_INIT_PRIORITY (fn
) : DECL_FINI_PRIORITY (fn
);
215 else if (p
!= priority
)
217 append_to_statement_list (build_function_call_expr (UNKNOWN_LOCATION
,
223 gcc_assert (body
!= NULL_TREE
);
224 /* Generate a function to call all the function of like
226 cgraph_build_static_cdtor (ctor_p
? 'I' : 'D', body
, priority
);
230 /* Comparison function for qsort. P1 and P2 are actually of type
231 "tree *" and point to static constructors. DECL_INIT_PRIORITY is
232 used to determine the sort order. */
235 compare_ctor (const void *p1
, const void *p2
)
242 f1
= *(const tree
*)p1
;
243 f2
= *(const tree
*)p2
;
244 priority1
= DECL_INIT_PRIORITY (f1
);
245 priority2
= DECL_INIT_PRIORITY (f2
);
247 if (priority1
< priority2
)
249 else if (priority1
> priority2
)
252 /* Ensure a stable sort. */
253 return (const tree
*)p1
- (const tree
*)p2
;
256 /* Comparison function for qsort. P1 and P2 are actually of type
257 "tree *" and point to static destructors. DECL_FINI_PRIORITY is
258 used to determine the sort order. */
261 compare_dtor (const void *p1
, const void *p2
)
268 f1
= *(const tree
*)p1
;
269 f2
= *(const tree
*)p2
;
270 priority1
= DECL_FINI_PRIORITY (f1
);
271 priority2
= DECL_FINI_PRIORITY (f2
);
273 if (priority1
< priority2
)
275 else if (priority1
> priority2
)
278 /* Ensure a stable sort. */
279 return (const tree
*)p1
- (const tree
*)p2
;
282 /* Generate functions to call static constructors and destructors
283 for targets that do not support .ctors/.dtors sections. These
284 functions have magic names which are detected by collect2. */
287 cgraph_build_cdtor_fns (void)
289 if (!VEC_empty (tree
, static_ctors
))
291 gcc_assert (!targetm
.have_ctors_dtors
);
292 qsort (VEC_address (tree
, static_ctors
),
293 VEC_length (tree
, static_ctors
),
296 build_cdtor (/*ctor_p=*/true,
297 VEC_address (tree
, static_ctors
),
298 VEC_length (tree
, static_ctors
));
299 VEC_truncate (tree
, static_ctors
, 0);
302 if (!VEC_empty (tree
, static_dtors
))
304 gcc_assert (!targetm
.have_ctors_dtors
);
305 qsort (VEC_address (tree
, static_dtors
),
306 VEC_length (tree
, static_dtors
),
309 build_cdtor (/*ctor_p=*/false,
310 VEC_address (tree
, static_dtors
),
311 VEC_length (tree
, static_dtors
));
312 VEC_truncate (tree
, static_dtors
, 0);
316 /* Determine if function DECL is needed. That is, visible to something
317 either outside this translation unit, something magic in the system
321 cgraph_decide_is_function_needed (struct cgraph_node
*node
, tree decl
)
323 /* If the user told us it is used, then it must be so. */
324 if (node
->local
.externally_visible
)
327 /* ??? If the assembler name is set by hand, it is possible to assemble
328 the name later after finalizing the function and the fact is noticed
329 in assemble_name then. This is arguably a bug. */
330 if (DECL_ASSEMBLER_NAME_SET_P (decl
)
331 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl
)))
334 /* With -fkeep-inline-functions we are keeping all inline functions except
335 for extern inline ones. */
336 if (flag_keep_inline_functions
337 && DECL_DECLARED_INLINE_P (decl
)
338 && !DECL_EXTERNAL (decl
)
339 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (decl
)))
342 /* If we decided it was needed before, but at the time we didn't have
343 the body of the function available, then it's still needed. We have
344 to go back and re-check its dependencies now. */
348 /* Externally visible functions must be output. The exception is
349 COMDAT functions that must be output only when they are needed.
351 When not optimizing, also output the static functions. (see
352 PR24561), but don't do so for always_inline functions, functions
353 declared inline and nested functions. These was optimized out
354 in the original implementation and it is unclear whether we want
355 to change the behavior here. */
356 if (((TREE_PUBLIC (decl
)
357 || (!optimize
&& !node
->local
.disregard_inline_limits
358 && !DECL_DECLARED_INLINE_P (decl
)
360 && !flag_whole_program
363 && !DECL_COMDAT (decl
) && !DECL_EXTERNAL (decl
))
366 /* Constructors and destructors are reachable from the runtime by
368 if (DECL_STATIC_CONSTRUCTOR (decl
) || DECL_STATIC_DESTRUCTOR (decl
))
374 /* Process CGRAPH_NEW_FUNCTIONS and perform actions necessary to add these
375 functions into callgraph in a way so they look like ordinary reachable
376 functions inserted into callgraph already at construction time. */
379 cgraph_process_new_functions (void)
383 struct cgraph_node
*node
;
385 /* Note that this queue may grow as its being processed, as the new
386 functions may generate new ones. */
387 while (cgraph_new_nodes
)
389 node
= cgraph_new_nodes
;
391 cgraph_new_nodes
= cgraph_new_nodes
->next_needed
;
392 switch (cgraph_state
)
394 case CGRAPH_STATE_CONSTRUCTION
:
395 /* At construction time we just need to finalize function and move
396 it into reachable functions list. */
398 node
->next_needed
= NULL
;
399 cgraph_finalize_function (fndecl
, false);
400 cgraph_mark_reachable_node (node
);
404 case CGRAPH_STATE_IPA
:
405 case CGRAPH_STATE_IPA_SSA
:
406 /* When IPA optimization already started, do all essential
407 transformations that has been already performed on the whole
408 cgraph but not on this function. */
410 gimple_register_cfg_hooks ();
412 cgraph_analyze_function (node
);
413 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
414 current_function_decl
= fndecl
;
415 compute_inline_parameters (node
);
416 if ((cgraph_state
== CGRAPH_STATE_IPA_SSA
417 && !gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl
)))
418 /* When not optimizing, be sure we run early local passes anyway
421 execute_pass_list (pass_early_local_passes
.pass
.sub
);
422 free_dominance_info (CDI_POST_DOMINATORS
);
423 free_dominance_info (CDI_DOMINATORS
);
425 current_function_decl
= NULL
;
428 case CGRAPH_STATE_EXPANSION
:
429 /* Functions created during expansion shall be compiled
432 cgraph_expand_function (node
);
439 cgraph_call_function_insertion_hooks (node
);
444 /* As an GCC extension we allow redefinition of the function. The
445 semantics when both copies of bodies differ is not well defined.
446 We replace the old body with new body so in unit at a time mode
447 we always use new body, while in normal mode we may end up with
448 old body inlined into some functions and new body expanded and
451 ??? It may make more sense to use one body for inlining and other
452 body for expanding the function but this is difficult to do. */
455 cgraph_reset_node (struct cgraph_node
*node
)
457 /* If node->process is set, then we have already begun whole-unit analysis.
458 This is *not* testing for whether we've already emitted the function.
459 That case can be sort-of legitimately seen with real function redefinition
460 errors. I would argue that the front end should never present us with
461 such a case, but don't enforce that for now. */
462 gcc_assert (!node
->process
);
464 /* Reset our data structures so we can analyze the function again. */
465 memset (&node
->local
, 0, sizeof (node
->local
));
466 memset (&node
->global
, 0, sizeof (node
->global
));
467 memset (&node
->rtl
, 0, sizeof (node
->rtl
));
468 node
->analyzed
= false;
469 node
->local
.redefined_extern_inline
= true;
470 node
->local
.finalized
= false;
472 cgraph_node_remove_callees (node
);
474 /* We may need to re-queue the node for assembling in case
475 we already proceeded it and ignored as not needed or got
476 a re-declaration in IMA mode. */
479 struct cgraph_node
*n
;
481 for (n
= cgraph_nodes_queue
; n
; n
= n
->next_needed
)
490 cgraph_lower_function (struct cgraph_node
*node
)
496 lower_nested_functions (node
->decl
);
497 gcc_assert (!node
->nested
);
499 tree_lowering_passes (node
->decl
);
500 node
->lowered
= true;
503 /* DECL has been parsed. Take it, queue it, compile it at the whim of the
504 logic in effect. If NESTED is true, then our caller cannot stand to have
505 the garbage collector run at the moment. We would need to either create
506 a new GC context, or just not compile right now. */
509 cgraph_finalize_function (tree decl
, bool nested
)
511 struct cgraph_node
*node
= cgraph_node (decl
);
513 if (node
->local
.finalized
)
514 cgraph_reset_node (node
);
516 node
->pid
= cgraph_max_pid
++;
517 notice_global_symbol (decl
);
518 node
->local
.finalized
= true;
519 node
->lowered
= DECL_STRUCT_FUNCTION (decl
)->cfg
!= NULL
;
520 node
->finalized_by_frontend
= true;
521 record_cdtor_fn (node
->decl
);
523 if (cgraph_decide_is_function_needed (node
, decl
))
524 cgraph_mark_needed_node (node
);
526 /* Since we reclaim unreachable nodes at the end of every language
527 level unit, we need to be conservative about possible entry points
529 if ((TREE_PUBLIC (decl
) && !DECL_COMDAT (decl
) && !DECL_EXTERNAL (decl
)))
530 cgraph_mark_reachable_node (node
);
532 /* If we've not yet emitted decl, tell the debug info about it. */
533 if (!TREE_ASM_WRITTEN (decl
))
534 (*debug_hooks
->deferred_inline_function
) (decl
);
536 /* Possibly warn about unused parameters. */
537 if (warn_unused_parameter
)
538 do_warn_unused_parameter (decl
);
544 /* C99 extern inline keywords allow changing of declaration after function
545 has been finalized. We need to re-decide if we want to mark the function as
549 cgraph_mark_if_needed (tree decl
)
551 struct cgraph_node
*node
= cgraph_node (decl
);
552 if (node
->local
.finalized
&& cgraph_decide_is_function_needed (node
, decl
))
553 cgraph_mark_needed_node (node
);
556 /* Return TRUE if NODE2 is equivalent to NODE or its clone. */
558 clone_of_p (struct cgraph_node
*node
, struct cgraph_node
*node2
)
560 while (node
!= node2
&& node2
)
561 node2
= node2
->clone_of
;
562 return node2
!= NULL
;
565 /* Verify cgraph nodes of given cgraph node. */
567 verify_cgraph_node (struct cgraph_node
*node
)
569 struct cgraph_edge
*e
;
570 struct function
*this_cfun
= DECL_STRUCT_FUNCTION (node
->decl
);
571 struct function
*saved_cfun
= cfun
;
572 basic_block this_block
;
573 gimple_stmt_iterator gsi
;
574 bool error_found
= false;
576 if (errorcount
|| sorrycount
)
579 timevar_push (TV_CGRAPH_VERIFY
);
580 /* debug_generic_stmt needs correct cfun */
581 set_cfun (this_cfun
);
582 for (e
= node
->callees
; e
; e
= e
->next_callee
)
585 error ("aux field set for edge %s->%s",
586 identifier_to_locale (cgraph_node_name (e
->caller
)),
587 identifier_to_locale (cgraph_node_name (e
->callee
)));
592 error ("Execution count is negative");
595 if (node
->global
.inlined_to
&& node
->local
.externally_visible
)
597 error ("Externally visible inline clone");
600 if (node
->global
.inlined_to
&& node
->address_taken
)
602 error ("Inline clone with address taken");
605 if (node
->global
.inlined_to
&& node
->needed
)
607 error ("Inline clone is needed");
610 for (e
= node
->callers
; e
; e
= e
->next_caller
)
614 error ("caller edge count is negative");
617 if (e
->frequency
< 0)
619 error ("caller edge frequency is negative");
622 if (e
->frequency
> CGRAPH_FREQ_MAX
)
624 error ("caller edge frequency is too large");
627 if (gimple_has_body_p (e
->caller
->decl
)
628 && !e
->caller
->global
.inlined_to
630 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
631 gimple_bb (e
->call_stmt
))))
633 error ("caller edge frequency %i does not match BB freqency %i",
635 compute_call_stmt_bb_frequency (e
->caller
->decl
,
636 gimple_bb (e
->call_stmt
)));
639 if (!e
->inline_failed
)
641 if (node
->global
.inlined_to
642 != (e
->caller
->global
.inlined_to
643 ? e
->caller
->global
.inlined_to
: e
->caller
))
645 error ("inlined_to pointer is wrong");
648 if (node
->callers
->next_caller
)
650 error ("multiple inline callers");
655 if (node
->global
.inlined_to
)
657 error ("inlined_to pointer set for noninline callers");
661 if (!node
->callers
&& node
->global
.inlined_to
)
663 error ("inlined_to pointer is set but no predecessors found");
666 if (node
->global
.inlined_to
== node
)
668 error ("inlined_to pointer refers to itself");
672 if (!cgraph_node (node
->decl
))
674 error ("node not found in cgraph_hash");
680 struct cgraph_node
*n
;
681 for (n
= node
->clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
686 error ("node has wrong clone_of");
692 struct cgraph_node
*n
;
693 for (n
= node
->clones
; n
; n
= n
->next_sibling_clone
)
694 if (n
->clone_of
!= node
)
698 error ("node has wrong clone list");
702 if ((node
->prev_sibling_clone
|| node
->next_sibling_clone
) && !node
->clone_of
)
704 error ("node is in clone list but it is not clone");
707 if (!node
->prev_sibling_clone
&& node
->clone_of
&& node
->clone_of
->clones
!= node
)
709 error ("node has wrong prev_clone pointer");
712 if (node
->prev_sibling_clone
&& node
->prev_sibling_clone
->next_sibling_clone
!= node
)
714 error ("double linked list of clones corrupted");
718 if (node
->analyzed
&& gimple_has_body_p (node
->decl
)
719 && !TREE_ASM_WRITTEN (node
->decl
)
720 && (!DECL_EXTERNAL (node
->decl
) || node
->global
.inlined_to
)
725 /* The nodes we're interested in are never shared, so walk
726 the tree ignoring duplicates. */
727 struct pointer_set_t
*visited_nodes
= pointer_set_create ();
728 /* Reach the trees by walking over the CFG, and note the
729 enclosing basic-blocks in the call edges. */
730 FOR_EACH_BB_FN (this_block
, this_cfun
)
731 for (gsi
= gsi_start_bb (this_block
);
735 gimple stmt
= gsi_stmt (gsi
);
737 if (is_gimple_call (stmt
) && (decl
= gimple_call_fndecl (stmt
)))
739 struct cgraph_edge
*e
= cgraph_edge (node
, stmt
);
744 error ("shared call_stmt:");
745 debug_gimple_stmt (stmt
);
748 if (e
->callee
->same_body_alias
)
750 error ("edge points to same body alias:");
751 debug_tree (e
->callee
->decl
);
754 else if (!clone_of_p (cgraph_node (decl
), e
->callee
)
755 && !e
->callee
->global
.inlined_to
)
757 error ("edge points to wrong declaration:");
758 debug_tree (e
->callee
->decl
);
759 fprintf (stderr
," Instead of:");
767 error ("missing callgraph edge for call stmt:");
768 debug_gimple_stmt (stmt
);
773 pointer_set_destroy (visited_nodes
);
776 /* No CFG available?! */
779 for (e
= node
->callees
; e
; e
= e
->next_callee
)
781 if (!e
->aux
&& !e
->indirect_call
)
783 error ("edge %s->%s has no corresponding call_stmt",
784 identifier_to_locale (cgraph_node_name (e
->caller
)),
785 identifier_to_locale (cgraph_node_name (e
->callee
)));
786 debug_gimple_stmt (e
->call_stmt
);
794 dump_cgraph_node (stderr
, node
);
795 internal_error ("verify_cgraph_node failed");
797 set_cfun (saved_cfun
);
798 timevar_pop (TV_CGRAPH_VERIFY
);
801 /* Verify whole cgraph structure. */
805 struct cgraph_node
*node
;
807 if (sorrycount
|| errorcount
)
810 for (node
= cgraph_nodes
; node
; node
= node
->next
)
811 verify_cgraph_node (node
);
814 /* Output all asm statements we have stored up to be output. */
817 cgraph_output_pending_asms (void)
819 struct cgraph_asm_node
*can
;
821 if (errorcount
|| sorrycount
)
824 for (can
= cgraph_asm_nodes
; can
; can
= can
->next
)
825 assemble_asm (can
->asm_str
);
826 cgraph_asm_nodes
= NULL
;
829 /* Analyze the function scheduled to be output. */
831 cgraph_analyze_function (struct cgraph_node
*node
)
833 tree save
= current_function_decl
;
834 tree decl
= node
->decl
;
836 current_function_decl
= decl
;
837 push_cfun (DECL_STRUCT_FUNCTION (decl
));
839 /* Make sure to gimplify bodies only once. During analyzing a
840 function we lower it, which will require gimplified nested
841 functions, so we can end up here with an already gimplified
843 if (!gimple_body (decl
))
844 gimplify_function_tree (decl
);
845 dump_function (TDI_generic
, decl
);
847 cgraph_lower_function (node
);
848 node
->analyzed
= true;
851 current_function_decl
= save
;
854 /* Look for externally_visible and used attributes and mark cgraph nodes
857 We cannot mark the nodes at the point the attributes are processed (in
858 handle_*_attribute) because the copy of the declarations available at that
859 point may not be canonical. For example, in:
862 void f() __attribute__((used));
864 the declaration we see in handle_used_attribute will be the second
865 declaration -- but the front end will subsequently merge that declaration
866 with the original declaration and discard the second declaration.
868 Furthermore, we can't mark these nodes in cgraph_finalize_function because:
871 void f() __attribute__((externally_visible));
875 So, we walk the nodes at the end of the translation unit, applying the
876 attributes at that point. */
879 process_function_and_variable_attributes (struct cgraph_node
*first
,
880 struct varpool_node
*first_var
)
882 struct cgraph_node
*node
;
883 struct varpool_node
*vnode
;
885 for (node
= cgraph_nodes
; node
!= first
; node
= node
->next
)
887 tree decl
= node
->decl
;
888 if (lookup_attribute ("used", DECL_ATTRIBUTES (decl
)))
890 mark_decl_referenced (decl
);
891 if (node
->local
.finalized
)
892 cgraph_mark_needed_node (node
);
894 if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl
)))
896 if (! TREE_PUBLIC (node
->decl
))
897 warning_at (DECL_SOURCE_LOCATION (node
->decl
), OPT_Wattributes
,
898 "%<externally_visible%>"
899 " attribute have effect only on public objects");
900 else if (node
->local
.finalized
)
901 cgraph_mark_needed_node (node
);
904 for (vnode
= varpool_nodes
; vnode
!= first_var
; vnode
= vnode
->next
)
906 tree decl
= vnode
->decl
;
907 if (lookup_attribute ("used", DECL_ATTRIBUTES (decl
)))
909 mark_decl_referenced (decl
);
910 vnode
->force_output
= true;
911 if (vnode
->finalized
)
912 varpool_mark_needed_node (vnode
);
914 if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl
)))
916 if (! TREE_PUBLIC (vnode
->decl
))
917 warning_at (DECL_SOURCE_LOCATION (vnode
->decl
), OPT_Wattributes
,
918 "%<externally_visible%>"
919 " attribute have effect only on public objects");
920 else if (vnode
->finalized
)
921 varpool_mark_needed_node (vnode
);
926 /* Process CGRAPH_NODES_NEEDED queue, analyze each function (and transitively
927 each reachable functions) and build cgraph.
928 The function can be called multiple times after inserting new nodes
929 into beginning of queue. Just the new part of queue is re-scanned then. */
932 cgraph_analyze_functions (void)
934 /* Keep track of already processed nodes when called multiple times for
935 intermodule optimization. */
936 static struct cgraph_node
*first_analyzed
;
937 struct cgraph_node
*first_processed
= first_analyzed
;
938 static struct varpool_node
*first_analyzed_var
;
939 struct cgraph_node
*node
, *next
;
941 process_function_and_variable_attributes (first_processed
,
943 first_processed
= cgraph_nodes
;
944 first_analyzed_var
= varpool_nodes
;
945 varpool_analyze_pending_decls ();
946 if (cgraph_dump_file
)
948 fprintf (cgraph_dump_file
, "Initial entry points:");
949 for (node
= cgraph_nodes
; node
!= first_analyzed
; node
= node
->next
)
951 fprintf (cgraph_dump_file
, " %s", cgraph_node_name (node
));
952 fprintf (cgraph_dump_file
, "\n");
954 cgraph_process_new_functions ();
956 /* Propagate reachability flag and lower representation of all reachable
957 functions. In the future, lowering will introduce new functions and
958 new entry points on the way (by template instantiation and virtual
959 method table generation for instance). */
960 while (cgraph_nodes_queue
)
962 struct cgraph_edge
*edge
;
963 tree decl
= cgraph_nodes_queue
->decl
;
965 node
= cgraph_nodes_queue
;
966 cgraph_nodes_queue
= cgraph_nodes_queue
->next_needed
;
967 node
->next_needed
= NULL
;
969 /* ??? It is possible to create extern inline function and later using
970 weak alias attribute to kill its body. See
971 gcc.c-torture/compile/20011119-1.c */
972 if (!DECL_STRUCT_FUNCTION (decl
))
974 cgraph_reset_node (node
);
979 cgraph_analyze_function (node
);
981 for (edge
= node
->callees
; edge
; edge
= edge
->next_callee
)
982 if (!edge
->callee
->reachable
)
983 cgraph_mark_reachable_node (edge
->callee
);
985 /* If decl is a clone of an abstract function, mark that abstract
986 function so that we don't release its body. The DECL_INITIAL() of that
987 abstract function declaration will be later needed to output debug info. */
988 if (DECL_ABSTRACT_ORIGIN (decl
))
990 struct cgraph_node
*origin_node
= cgraph_node (DECL_ABSTRACT_ORIGIN (decl
));
991 origin_node
->abstract_and_needed
= true;
994 /* We finalize local static variables during constructing callgraph
995 edges. Process their attributes too. */
996 process_function_and_variable_attributes (first_processed
,
998 first_processed
= cgraph_nodes
;
999 first_analyzed_var
= varpool_nodes
;
1000 varpool_analyze_pending_decls ();
1001 cgraph_process_new_functions ();
1004 /* Collect entry points to the unit. */
1005 if (cgraph_dump_file
)
1007 fprintf (cgraph_dump_file
, "Unit entry points:");
1008 for (node
= cgraph_nodes
; node
!= first_analyzed
; node
= node
->next
)
1010 fprintf (cgraph_dump_file
, " %s", cgraph_node_name (node
));
1011 fprintf (cgraph_dump_file
, "\n\nInitial ");
1012 dump_cgraph (cgraph_dump_file
);
1015 if (cgraph_dump_file
)
1016 fprintf (cgraph_dump_file
, "\nReclaiming functions:");
1018 for (node
= cgraph_nodes
; node
!= first_analyzed
; node
= next
)
1020 tree decl
= node
->decl
;
1023 if (node
->local
.finalized
&& !gimple_has_body_p (decl
))
1024 cgraph_reset_node (node
);
1026 if (!node
->reachable
&& gimple_has_body_p (decl
))
1028 if (cgraph_dump_file
)
1029 fprintf (cgraph_dump_file
, " %s", cgraph_node_name (node
));
1030 cgraph_remove_node (node
);
1034 node
->next_needed
= NULL
;
1035 gcc_assert (!node
->local
.finalized
|| gimple_has_body_p (decl
));
1036 gcc_assert (node
->analyzed
== node
->local
.finalized
);
1038 if (cgraph_dump_file
)
1040 fprintf (cgraph_dump_file
, "\n\nReclaimed ");
1041 dump_cgraph (cgraph_dump_file
);
1043 first_analyzed
= cgraph_nodes
;
1048 /* Analyze the whole compilation unit once it is parsed completely. */
1051 cgraph_finalize_compilation_unit (void)
1053 timevar_push (TV_CGRAPH
);
1055 /* Do not skip analyzing the functions if there were errors, we
1056 miss diagnostics for following functions otherwise. */
1058 /* Emit size functions we didn't inline. */
1059 finalize_size_functions ();
1061 /* Call functions declared with the "constructor" or "destructor"
1063 cgraph_build_cdtor_fns ();
1065 /* Mark alias targets necessary and emit diagnostics. */
1066 finish_aliases_1 ();
1070 fprintf (stderr
, "\nAnalyzing compilation unit\n");
1074 /* Gimplify and lower all functions, compute reachability and
1075 remove unreachable nodes. */
1076 cgraph_analyze_functions ();
1078 /* Mark alias targets necessary and emit diagnostics. */
1079 finish_aliases_1 ();
1081 /* Gimplify and lower thunks. */
1082 cgraph_analyze_functions ();
1084 /* Finally drive the pass manager. */
1087 timevar_pop (TV_CGRAPH
);
1091 /* Figure out what functions we want to assemble. */
1094 cgraph_mark_functions_to_output (void)
1096 struct cgraph_node
*node
;
1098 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1100 tree decl
= node
->decl
;
1101 struct cgraph_edge
*e
;
1103 gcc_assert (!node
->process
);
1105 for (e
= node
->callers
; e
; e
= e
->next_caller
)
1106 if (e
->inline_failed
)
1109 /* We need to output all local functions that are used and not
1110 always inlined, as well as those that are reachable from
1111 outside the current compilation unit. */
1113 && !node
->global
.inlined_to
1115 || (e
&& node
->reachable
))
1116 && !TREE_ASM_WRITTEN (decl
)
1117 && !DECL_EXTERNAL (decl
))
1121 /* We should've reclaimed all functions that are not needed. */
1122 #ifdef ENABLE_CHECKING
1123 if (!node
->global
.inlined_to
1124 && gimple_has_body_p (decl
)
1125 && !DECL_EXTERNAL (decl
))
1127 dump_cgraph_node (stderr
, node
);
1128 internal_error ("failed to reclaim unneeded function");
1131 gcc_assert (node
->global
.inlined_to
1132 || !gimple_has_body_p (decl
)
1133 || DECL_EXTERNAL (decl
));
1140 /* DECL is FUNCTION_DECL. Initialize datastructures so DECL is a function
1141 in lowered gimple form.
1143 Set current_function_decl and cfun to newly constructed empty function body.
1144 return basic block in the function body. */
1147 init_lowered_empty_function (tree decl
)
1151 current_function_decl
= decl
;
1152 allocate_struct_function (decl
, false);
1153 gimple_register_cfg_hooks ();
1154 init_empty_tree_cfg ();
1155 init_tree_ssa (cfun
);
1156 init_ssa_operands ();
1157 cfun
->gimple_df
->in_ssa_p
= true;
1158 DECL_INITIAL (decl
) = make_node (BLOCK
);
1160 DECL_SAVED_TREE (decl
) = error_mark_node
;
1161 cfun
->curr_properties
|=
1162 (PROP_gimple_lcf
| PROP_gimple_leh
| PROP_cfg
| PROP_referenced_vars
|
1165 /* Create BB for body of the function and connect it properly. */
1166 bb
= create_basic_block (NULL
, (void *) 0, ENTRY_BLOCK_PTR
);
1167 make_edge (ENTRY_BLOCK_PTR
, bb
, 0);
1168 make_edge (bb
, EXIT_BLOCK_PTR
, 0);
1173 /* Adjust PTR by the constant FIXED_OFFSET, and by the vtable
1174 offset indicated by VIRTUAL_OFFSET, if that is
1175 non-null. THIS_ADJUSTING is nonzero for a this adjusting thunk and
1176 zero for a result adjusting thunk. */
1179 thunk_adjust (gimple_stmt_iterator
* bsi
,
1180 tree ptr
, bool this_adjusting
,
1181 HOST_WIDE_INT fixed_offset
, tree virtual_offset
)
1188 stmt
= gimple_build_assign (ptr
,
1189 fold_build2_loc (input_location
,
1191 TREE_TYPE (ptr
), ptr
,
1192 size_int (fixed_offset
)));
1193 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1196 /* If there's a virtual offset, look up that value in the vtable and
1197 adjust the pointer again. */
1205 if (!vtable_entry_type
)
1207 tree vfunc_type
= make_node (FUNCTION_TYPE
);
1208 TREE_TYPE (vfunc_type
) = integer_type_node
;
1209 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
1210 layout_type (vfunc_type
);
1212 vtable_entry_type
= build_pointer_type (vfunc_type
);
1216 create_tmp_var (build_pointer_type
1217 (build_pointer_type (vtable_entry_type
)), "vptr");
1219 /* The vptr is always at offset zero in the object. */
1220 stmt
= gimple_build_assign (vtabletmp
,
1221 build1 (NOP_EXPR
, TREE_TYPE (vtabletmp
),
1223 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1224 mark_symbols_for_renaming (stmt
);
1225 find_referenced_vars_in (stmt
);
1227 /* Form the vtable address. */
1228 vtabletmp2
= create_tmp_var (TREE_TYPE (TREE_TYPE (vtabletmp
)),
1230 stmt
= gimple_build_assign (vtabletmp2
,
1231 build1 (INDIRECT_REF
,
1232 TREE_TYPE (vtabletmp2
), vtabletmp
));
1233 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1234 mark_symbols_for_renaming (stmt
);
1235 find_referenced_vars_in (stmt
);
1237 /* Find the entry with the vcall offset. */
1238 stmt
= gimple_build_assign (vtabletmp2
,
1239 fold_build2_loc (input_location
,
1241 TREE_TYPE (vtabletmp2
),
1243 fold_convert (sizetype
,
1245 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1247 /* Get the offset itself. */
1248 vtabletmp3
= create_tmp_var (TREE_TYPE (TREE_TYPE (vtabletmp2
)),
1250 stmt
= gimple_build_assign (vtabletmp3
,
1251 build1 (INDIRECT_REF
,
1252 TREE_TYPE (vtabletmp3
),
1254 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1255 mark_symbols_for_renaming (stmt
);
1256 find_referenced_vars_in (stmt
);
1258 /* Cast to sizetype. */
1259 offsettmp
= create_tmp_var (sizetype
, "offset");
1260 stmt
= gimple_build_assign (offsettmp
, fold_convert (sizetype
, vtabletmp3
));
1261 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1262 mark_symbols_for_renaming (stmt
);
1263 find_referenced_vars_in (stmt
);
1265 /* Adjust the `this' pointer. */
1266 ptr
= fold_build2_loc (input_location
,
1267 POINTER_PLUS_EXPR
, TREE_TYPE (ptr
), ptr
,
1271 if (!this_adjusting
)
1272 /* Adjust the pointer by the constant. */
1276 if (TREE_CODE (ptr
) == VAR_DECL
)
1280 ptrtmp
= create_tmp_var (TREE_TYPE (ptr
), "ptr");
1281 stmt
= gimple_build_assign (ptrtmp
, ptr
);
1282 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1283 mark_symbols_for_renaming (stmt
);
1284 find_referenced_vars_in (stmt
);
1286 ptr
= fold_build2_loc (input_location
,
1287 POINTER_PLUS_EXPR
, TREE_TYPE (ptrtmp
), ptrtmp
,
1288 size_int (fixed_offset
));
1291 /* Emit the statement and gimplify the adjustment expression. */
1292 ret
= create_tmp_var (TREE_TYPE (ptr
), "adjusted_this");
1293 stmt
= gimple_build_assign (ret
, ptr
);
1294 mark_symbols_for_renaming (stmt
);
1295 find_referenced_vars_in (stmt
);
1296 gsi_insert_after (bsi
, stmt
, GSI_NEW_STMT
);
1301 /* Produce assembler for thunk NODE. */
1304 assemble_thunk (struct cgraph_node
*node
)
1306 bool this_adjusting
= node
->thunk
.this_adjusting
;
1307 HOST_WIDE_INT fixed_offset
= node
->thunk
.fixed_offset
;
1308 HOST_WIDE_INT virtual_value
= node
->thunk
.virtual_value
;
1309 tree virtual_offset
= NULL
;
1310 tree alias
= node
->thunk
.alias
;
1311 tree thunk_fndecl
= node
->decl
;
1312 tree a
= DECL_ARGUMENTS (thunk_fndecl
);
1314 current_function_decl
= thunk_fndecl
;
1317 && targetm
.asm_out
.can_output_mi_thunk (thunk_fndecl
, fixed_offset
,
1318 virtual_value
, alias
))
1323 DECL_RESULT (thunk_fndecl
)
1324 = build_decl (DECL_SOURCE_LOCATION (thunk_fndecl
),
1325 RESULT_DECL
, 0, integer_type_node
);
1326 fnname
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk_fndecl
));
1328 /* The back end expects DECL_INITIAL to contain a BLOCK, so we
1330 fn_block
= make_node (BLOCK
);
1331 BLOCK_VARS (fn_block
) = a
;
1332 DECL_INITIAL (thunk_fndecl
) = fn_block
;
1333 init_function_start (thunk_fndecl
);
1335 assemble_start_function (thunk_fndecl
, fnname
);
1337 targetm
.asm_out
.output_mi_thunk (asm_out_file
, thunk_fndecl
,
1338 fixed_offset
, virtual_value
, alias
);
1340 assemble_end_function (thunk_fndecl
, fnname
);
1341 init_insn_lengths ();
1342 free_after_compilation (cfun
);
1344 TREE_ASM_WRITTEN (thunk_fndecl
) = 1;
1349 basic_block bb
, then_bb
, else_bb
, return_bb
;
1350 gimple_stmt_iterator bsi
;
1356 VEC(tree
, heap
) *vargs
;
1361 DECL_IGNORED_P (thunk_fndecl
) = 1;
1362 bitmap_obstack_initialize (NULL
);
1364 if (node
->thunk
.virtual_offset_p
)
1365 virtual_offset
= size_int (virtual_value
);
1367 /* Build the return declaration for the function. */
1368 restype
= TREE_TYPE (TREE_TYPE (thunk_fndecl
));
1369 if (DECL_RESULT (thunk_fndecl
) == NULL_TREE
)
1371 resdecl
= build_decl (input_location
, RESULT_DECL
, 0, restype
);
1372 DECL_ARTIFICIAL (resdecl
) = 1;
1373 DECL_IGNORED_P (resdecl
) = 1;
1374 DECL_RESULT (thunk_fndecl
) = resdecl
;
1377 resdecl
= DECL_RESULT (thunk_fndecl
);
1379 bb
= then_bb
= else_bb
= return_bb
= init_lowered_empty_function (thunk_fndecl
);
1381 bsi
= gsi_start_bb (bb
);
1383 /* Build call to the function being thunked. */
1384 if (!VOID_TYPE_P (restype
))
1386 if (!is_gimple_reg_type (restype
))
1389 cfun
->local_decls
= tree_cons (NULL_TREE
, restmp
, cfun
->local_decls
);
1390 BLOCK_VARS (DECL_INITIAL (current_function_decl
)) = restmp
;
1393 restmp
= create_tmp_var_raw (restype
, "retval");
1396 for (arg
= a
; arg
; arg
= TREE_CHAIN (arg
))
1398 vargs
= VEC_alloc (tree
, heap
, nargs
);
1400 VEC_quick_push (tree
, vargs
,
1405 VEC_quick_push (tree
, vargs
, a
);
1406 for (i
= 1, arg
= TREE_CHAIN (a
); i
< nargs
; i
++, arg
= TREE_CHAIN (arg
))
1407 VEC_quick_push (tree
, vargs
, arg
);
1408 call
= gimple_build_call_vec (build_fold_addr_expr_loc (0, alias
), vargs
);
1409 VEC_free (tree
, heap
, vargs
);
1410 gimple_call_set_cannot_inline (call
, true);
1411 gimple_call_set_from_thunk (call
, true);
1413 gimple_call_set_lhs (call
, restmp
);
1414 gsi_insert_after (&bsi
, call
, GSI_NEW_STMT
);
1415 mark_symbols_for_renaming (call
);
1416 find_referenced_vars_in (call
);
1419 if (restmp
&& !this_adjusting
)
1421 tree true_label
= NULL_TREE
, false_label
= NULL_TREE
;
1423 if (TREE_CODE (TREE_TYPE (restmp
)) == POINTER_TYPE
)
1426 /* If the return type is a pointer, we need to
1427 protect against NULL. We know there will be an
1428 adjustment, because that's why we're emitting a
1430 then_bb
= create_basic_block (NULL
, (void *) 0, bb
);
1431 return_bb
= create_basic_block (NULL
, (void *) 0, then_bb
);
1432 else_bb
= create_basic_block (NULL
, (void *) 0, else_bb
);
1433 remove_edge (single_succ_edge (bb
));
1434 true_label
= gimple_block_label (then_bb
);
1435 false_label
= gimple_block_label (else_bb
);
1436 stmt
= gimple_build_cond (NE_EXPR
, restmp
,
1437 fold_convert (TREE_TYPE (restmp
),
1439 NULL_TREE
, NULL_TREE
);
1440 gsi_insert_after (&bsi
, stmt
, GSI_NEW_STMT
);
1441 make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
1442 make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
1443 make_edge (return_bb
, EXIT_BLOCK_PTR
, 0);
1444 make_edge (then_bb
, return_bb
, EDGE_FALLTHRU
);
1445 make_edge (else_bb
, return_bb
, EDGE_FALLTHRU
);
1446 bsi
= gsi_last_bb (then_bb
);
1449 restmp
= thunk_adjust (&bsi
, restmp
, /*this_adjusting=*/0,
1450 fixed_offset
, virtual_offset
);
1454 bsi
= gsi_last_bb (else_bb
);
1455 stmt
= gimple_build_assign (restmp
, fold_convert (TREE_TYPE (restmp
),
1456 integer_zero_node
));
1457 gsi_insert_after (&bsi
, stmt
, GSI_NEW_STMT
);
1458 bsi
= gsi_last_bb (return_bb
);
1462 gimple_call_set_tail (call
, true);
1464 /* Build return value. */
1465 ret
= gimple_build_return (restmp
);
1466 gsi_insert_after (&bsi
, ret
, GSI_NEW_STMT
);
1468 delete_unreachable_blocks ();
1469 update_ssa (TODO_update_ssa
);
1471 cgraph_remove_same_body_alias (node
);
1472 /* Since we want to emit the thunk, we explicitly mark its name as
1474 mark_decl_referenced (thunk_fndecl
);
1475 cgraph_add_new_function (thunk_fndecl
, true);
1476 bitmap_obstack_release (NULL
);
1478 current_function_decl
= NULL
;
1481 /* Expand function specified by NODE. */
1484 cgraph_expand_function (struct cgraph_node
*node
)
1486 tree decl
= node
->decl
;
1488 /* We ought to not compile any inline clones. */
1489 gcc_assert (!node
->global
.inlined_to
);
1491 announce_function (decl
);
1494 gcc_assert (node
->lowered
);
1496 /* Generate RTL for the body of DECL. */
1497 tree_rest_of_compilation (decl
);
1499 /* Make sure that BE didn't give up on compiling. */
1500 gcc_assert (TREE_ASM_WRITTEN (decl
));
1501 current_function_decl
= NULL
;
1502 if (node
->same_body
)
1504 struct cgraph_node
*alias
, *next
;
1505 bool saved_alias
= node
->alias
;
1506 for (alias
= node
->same_body
;
1507 alias
&& alias
->next
; alias
= alias
->next
)
1509 /* Walk aliases in the order they were created; it is possible that
1510 thunks reffers to the aliases made earlier. */
1511 for (; alias
; alias
= next
)
1513 next
= alias
->previous
;
1514 if (!alias
->thunk
.thunk_p
)
1515 assemble_alias (alias
->decl
,
1516 DECL_ASSEMBLER_NAME (alias
->thunk
.alias
));
1518 assemble_thunk (alias
);
1520 node
->alias
= saved_alias
;
1522 gcc_assert (!cgraph_preserve_function_body_p (decl
));
1523 cgraph_release_function_body (node
);
1524 /* Eliminate all call edges. This is important so the GIMPLE_CALL no longer
1525 points to the dead function body. */
1526 cgraph_node_remove_callees (node
);
1528 cgraph_function_flags_ready
= true;
1531 /* Return true when CALLER_DECL should be inlined into CALLEE_DECL. */
1534 cgraph_inline_p (struct cgraph_edge
*e
, cgraph_inline_failed_t
*reason
)
1536 *reason
= e
->inline_failed
;
1537 return !e
->inline_failed
;
1542 /* Expand all functions that must be output.
1544 Attempt to topologically sort the nodes so function is output when
1545 all called functions are already assembled to allow data to be
1546 propagated across the callgraph. Use a stack to get smaller distance
1547 between a function and its callees (later we may choose to use a more
1548 sophisticated algorithm for function reordering; we will likely want
1549 to use subsections to make the output functions appear in top-down
1553 cgraph_expand_all_functions (void)
1555 struct cgraph_node
*node
;
1556 struct cgraph_node
**order
= XCNEWVEC (struct cgraph_node
*, cgraph_n_nodes
);
1557 int order_pos
, new_order_pos
= 0;
1560 order_pos
= cgraph_postorder (order
);
1561 gcc_assert (order_pos
== cgraph_n_nodes
);
1563 /* Garbage collector may remove inline clones we eliminate during
1564 optimization. So we must be sure to not reference them. */
1565 for (i
= 0; i
< order_pos
; i
++)
1566 if (order
[i
]->process
)
1567 order
[new_order_pos
++] = order
[i
];
1569 for (i
= new_order_pos
- 1; i
>= 0; i
--)
1574 gcc_assert (node
->reachable
);
1576 cgraph_expand_function (node
);
1579 cgraph_process_new_functions ();
1585 /* This is used to sort the node types by the cgraph order number. */
1587 enum cgraph_order_sort_kind
1589 ORDER_UNDEFINED
= 0,
1595 struct cgraph_order_sort
1597 enum cgraph_order_sort_kind kind
;
1600 struct cgraph_node
*f
;
1601 struct varpool_node
*v
;
1602 struct cgraph_asm_node
*a
;
1606 /* Output all functions, variables, and asm statements in the order
1607 according to their order fields, which is the order in which they
1608 appeared in the file. This implements -fno-toplevel-reorder. In
1609 this mode we may output functions and variables which don't really
1610 need to be output. */
1613 cgraph_output_in_order (void)
1617 struct cgraph_order_sort
*nodes
;
1619 struct cgraph_node
*pf
;
1620 struct varpool_node
*pv
;
1621 struct cgraph_asm_node
*pa
;
1624 size
= max
* sizeof (struct cgraph_order_sort
);
1625 nodes
= (struct cgraph_order_sort
*) alloca (size
);
1626 memset (nodes
, 0, size
);
1628 varpool_analyze_pending_decls ();
1630 for (pf
= cgraph_nodes
; pf
; pf
= pf
->next
)
1635 gcc_assert (nodes
[i
].kind
== ORDER_UNDEFINED
);
1636 nodes
[i
].kind
= ORDER_FUNCTION
;
1641 for (pv
= varpool_nodes_queue
; pv
; pv
= pv
->next_needed
)
1644 gcc_assert (nodes
[i
].kind
== ORDER_UNDEFINED
);
1645 nodes
[i
].kind
= ORDER_VAR
;
1649 for (pa
= cgraph_asm_nodes
; pa
; pa
= pa
->next
)
1652 gcc_assert (nodes
[i
].kind
== ORDER_UNDEFINED
);
1653 nodes
[i
].kind
= ORDER_ASM
;
1657 /* In toplevel reorder mode we output all statics; mark them as needed. */
1658 for (i
= 0; i
< max
; ++i
)
1660 if (nodes
[i
].kind
== ORDER_VAR
)
1662 varpool_mark_needed_node (nodes
[i
].u
.v
);
1665 varpool_empty_needed_queue ();
1667 for (i
= 0; i
< max
; ++i
)
1669 switch (nodes
[i
].kind
)
1671 case ORDER_FUNCTION
:
1672 nodes
[i
].u
.f
->process
= 0;
1673 cgraph_expand_function (nodes
[i
].u
.f
);
1677 varpool_assemble_decl (nodes
[i
].u
.v
);
1681 assemble_asm (nodes
[i
].u
.a
->asm_str
);
1684 case ORDER_UNDEFINED
:
1692 cgraph_asm_nodes
= NULL
;
1695 /* Return true when function body of DECL still needs to be kept around
1696 for later re-use. */
1698 cgraph_preserve_function_body_p (tree decl
)
1700 struct cgraph_node
*node
;
1702 gcc_assert (cgraph_global_info_ready
);
1703 /* Look if there is any clone around. */
1704 node
= cgraph_node (decl
);
1714 current_function_decl
= NULL
;
1715 gimple_register_cfg_hooks ();
1716 bitmap_obstack_initialize (NULL
);
1718 invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_START
, NULL
);
1721 execute_ipa_pass_list (all_small_ipa_passes
);
1723 /* If pass_all_early_optimizations was not scheduled, the state of
1724 the cgraph will not be properly updated. Update it now. */
1725 if (cgraph_state
< CGRAPH_STATE_IPA_SSA
)
1726 cgraph_state
= CGRAPH_STATE_IPA_SSA
;
1730 /* Generate coverage variables and constructors. */
1733 /* Process new functions added. */
1735 current_function_decl
= NULL
;
1736 cgraph_process_new_functions ();
1738 execute_ipa_summary_passes
1739 ((struct ipa_opt_pass_d
*) all_regular_ipa_passes
);
1741 execute_ipa_summary_passes ((struct ipa_opt_pass_d
*) all_lto_gen_passes
);
1744 ipa_write_summaries ();
1747 execute_ipa_pass_list (all_regular_ipa_passes
);
1748 invoke_plugin_callbacks (PLUGIN_ALL_IPA_PASSES_END
, NULL
);
1750 bitmap_obstack_release (NULL
);
1754 /* Perform simple optimizations based on callgraph. */
1757 cgraph_optimize (void)
1759 if (errorcount
|| sorrycount
)
1762 #ifdef ENABLE_CHECKING
1766 /* Frontend may output common variables after the unit has been finalized.
1767 It is safe to deal with them here as they are always zero initialized. */
1768 varpool_analyze_pending_decls ();
1770 timevar_push (TV_CGRAPHOPT
);
1771 if (pre_ipa_mem_report
)
1773 fprintf (stderr
, "Memory consumption before IPA\n");
1774 dump_memory_report (false);
1777 fprintf (stderr
, "Performing interprocedural optimizations\n");
1778 cgraph_state
= CGRAPH_STATE_IPA
;
1780 /* Don't run the IPA passes if there was any error or sorry messages. */
1781 if (errorcount
== 0 && sorrycount
== 0)
1784 /* Do nothing else if any IPA pass found errors. */
1785 if (errorcount
|| sorrycount
)
1787 timevar_pop (TV_CGRAPHOPT
);
1791 /* This pass remove bodies of extern inline functions we never inlined.
1792 Do this later so other IPA passes see what is really going on. */
1793 cgraph_remove_unreachable_nodes (false, dump_file
);
1794 cgraph_global_info_ready
= true;
1795 if (cgraph_dump_file
)
1797 fprintf (cgraph_dump_file
, "Optimized ");
1798 dump_cgraph (cgraph_dump_file
);
1799 dump_varpool (cgraph_dump_file
);
1801 if (post_ipa_mem_report
)
1803 fprintf (stderr
, "Memory consumption after IPA\n");
1804 dump_memory_report (false);
1806 timevar_pop (TV_CGRAPHOPT
);
1808 /* Output everything. */
1809 (*debug_hooks
->assembly_start
) ();
1811 fprintf (stderr
, "Assembling functions:\n");
1812 #ifdef ENABLE_CHECKING
1816 cgraph_materialize_all_clones ();
1817 cgraph_mark_functions_to_output ();
1819 cgraph_state
= CGRAPH_STATE_EXPANSION
;
1820 if (!flag_toplevel_reorder
)
1821 cgraph_output_in_order ();
1824 cgraph_output_pending_asms ();
1826 cgraph_expand_all_functions ();
1827 varpool_remove_unreferenced_decls ();
1829 varpool_assemble_pending_decls ();
1831 cgraph_process_new_functions ();
1832 cgraph_state
= CGRAPH_STATE_FINISHED
;
1834 if (cgraph_dump_file
)
1836 fprintf (cgraph_dump_file
, "\nFinal ");
1837 dump_cgraph (cgraph_dump_file
);
1839 #ifdef ENABLE_CHECKING
1841 /* Double check that all inline clones are gone and that all
1842 function bodies have been released from memory. */
1843 if (!(sorrycount
|| errorcount
))
1845 struct cgraph_node
*node
;
1846 bool error_found
= false;
1848 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1850 && (node
->global
.inlined_to
1851 || gimple_has_body_p (node
->decl
)))
1854 dump_cgraph_node (stderr
, node
);
1857 internal_error ("nodes with unreleased memory found");
1863 /* Generate and emit a static constructor or destructor. WHICH must
1864 be one of 'I' (for a constructor) or 'D' (for a destructor). BODY
1865 is a STATEMENT_LIST containing GENERIC statements. PRIORITY is the
1866 initialization priority for this constructor or destructor. */
1869 cgraph_build_static_cdtor (char which
, tree body
, int priority
)
1871 static int counter
= 0;
1873 tree decl
, name
, resdecl
;
1875 /* The priority is encoded in the constructor or destructor name.
1876 collect2 will sort the names and arrange that they are called at
1878 sprintf (which_buf
, "%c_%.5d_%d", which
, priority
, counter
++);
1879 name
= get_file_function_name (which_buf
);
1881 decl
= build_decl (input_location
, FUNCTION_DECL
, name
,
1882 build_function_type (void_type_node
, void_list_node
));
1883 current_function_decl
= decl
;
1885 resdecl
= build_decl (input_location
,
1886 RESULT_DECL
, NULL_TREE
, void_type_node
);
1887 DECL_ARTIFICIAL (resdecl
) = 1;
1888 DECL_RESULT (decl
) = resdecl
;
1889 DECL_CONTEXT (resdecl
) = decl
;
1891 allocate_struct_function (decl
, false);
1893 TREE_STATIC (decl
) = 1;
1894 TREE_USED (decl
) = 1;
1895 DECL_ARTIFICIAL (decl
) = 1;
1896 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
1897 DECL_SAVED_TREE (decl
) = body
;
1898 TREE_PUBLIC (decl
) = ! targetm
.have_ctors_dtors
;
1899 DECL_UNINLINABLE (decl
) = 1;
1901 DECL_INITIAL (decl
) = make_node (BLOCK
);
1902 TREE_USED (DECL_INITIAL (decl
)) = 1;
1904 DECL_SOURCE_LOCATION (decl
) = input_location
;
1905 cfun
->function_end_locus
= input_location
;
1910 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
1911 decl_init_priority_insert (decl
, priority
);
1914 DECL_STATIC_DESTRUCTOR (decl
) = 1;
1915 decl_fini_priority_insert (decl
, priority
);
1921 gimplify_function_tree (decl
);
1923 cgraph_add_new_function (decl
, false);
1924 cgraph_mark_needed_node (cgraph_node (decl
));
1931 cgraph_dump_file
= dump_begin (TDI_cgraph
, NULL
);
1934 /* The edges representing the callers of the NEW_VERSION node were
1935 fixed by cgraph_function_versioning (), now the call_expr in their
1936 respective tree code should be updated to call the NEW_VERSION. */
1939 update_call_expr (struct cgraph_node
*new_version
)
1941 struct cgraph_edge
*e
;
1943 gcc_assert (new_version
);
1945 /* Update the call expr on the edges to call the new version. */
1946 for (e
= new_version
->callers
; e
; e
= e
->next_caller
)
1948 struct function
*inner_function
= DECL_STRUCT_FUNCTION (e
->caller
->decl
);
1949 gimple_call_set_fndecl (e
->call_stmt
, new_version
->decl
);
1950 maybe_clean_eh_stmt_fn (inner_function
, e
->call_stmt
);
1955 /* Create a new cgraph node which is the new version of
1956 OLD_VERSION node. REDIRECT_CALLERS holds the callers
1957 edges which should be redirected to point to
1958 NEW_VERSION. ALL the callees edges of OLD_VERSION
1959 are cloned to the new version node. Return the new
1962 static struct cgraph_node
*
1963 cgraph_copy_node_for_versioning (struct cgraph_node
*old_version
,
1965 VEC(cgraph_edge_p
,heap
) *redirect_callers
)
1967 struct cgraph_node
*new_version
;
1968 struct cgraph_edge
*e
, *new_e
;
1969 struct cgraph_edge
*next_callee
;
1972 gcc_assert (old_version
);
1974 new_version
= cgraph_node (new_decl
);
1976 new_version
->analyzed
= true;
1977 new_version
->local
= old_version
->local
;
1978 new_version
->global
= old_version
->global
;
1979 new_version
->rtl
= new_version
->rtl
;
1980 new_version
->reachable
= true;
1981 new_version
->count
= old_version
->count
;
1983 /* Clone the old node callees. Recursive calls are
1985 for (e
= old_version
->callees
;e
; e
=e
->next_callee
)
1987 new_e
= cgraph_clone_edge (e
, new_version
, e
->call_stmt
,
1988 e
->lto_stmt_uid
, 0, e
->frequency
,
1989 e
->loop_nest
, true);
1990 new_e
->count
= e
->count
;
1992 /* Fix recursive calls.
1993 If OLD_VERSION has a recursive call after the
1994 previous edge cloning, the new version will have an edge
1995 pointing to the old version, which is wrong;
1996 Redirect it to point to the new version. */
1997 for (e
= new_version
->callees
; e
; e
= next_callee
)
1999 next_callee
= e
->next_callee
;
2000 if (e
->callee
== old_version
)
2001 cgraph_redirect_edge_callee (e
, new_version
);
2006 for (i
= 0; VEC_iterate (cgraph_edge_p
, redirect_callers
, i
, e
); i
++)
2008 /* Redirect calls to the old version node to point to its new
2010 cgraph_redirect_edge_callee (e
, new_version
);
2016 /* Perform function versioning.
2017 Function versioning includes copying of the tree and
2018 a callgraph update (creating a new cgraph node and updating
2019 its callees and callers).
2021 REDIRECT_CALLERS varray includes the edges to be redirected
2024 TREE_MAP is a mapping of tree nodes we want to replace with
2025 new ones (according to results of prior analysis).
2026 OLD_VERSION_NODE is the node that is versioned.
2027 It returns the new version's cgraph node.
2028 ARGS_TO_SKIP lists arguments to be omitted from functions
2031 struct cgraph_node
*
2032 cgraph_function_versioning (struct cgraph_node
*old_version_node
,
2033 VEC(cgraph_edge_p
,heap
) *redirect_callers
,
2034 VEC (ipa_replace_map_p
,gc
)* tree_map
,
2035 bitmap args_to_skip
)
2037 tree old_decl
= old_version_node
->decl
;
2038 struct cgraph_node
*new_version_node
= NULL
;
2041 if (!tree_versionable_function_p (old_decl
))
2044 /* Make a new FUNCTION_DECL tree node for the
2047 new_decl
= copy_node (old_decl
);
2049 new_decl
= build_function_decl_skip_args (old_decl
, args_to_skip
);
2051 /* Create the new version's call-graph node.
2052 and update the edges of the new node. */
2054 cgraph_copy_node_for_versioning (old_version_node
, new_decl
,
2057 /* Copy the OLD_VERSION_NODE function tree to the new version. */
2058 tree_function_versioning (old_decl
, new_decl
, tree_map
, false, args_to_skip
);
2060 /* Update the new version's properties.
2061 Make The new version visible only within this translation unit. Make sure
2062 that is not weak also.
2063 ??? We cannot use COMDAT linkage because there is no
2064 ABI support for this. */
2065 DECL_EXTERNAL (new_version_node
->decl
) = 0;
2066 DECL_COMDAT_GROUP (new_version_node
->decl
) = NULL_TREE
;
2067 TREE_PUBLIC (new_version_node
->decl
) = 0;
2068 DECL_COMDAT (new_version_node
->decl
) = 0;
2069 DECL_WEAK (new_version_node
->decl
) = 0;
2070 DECL_VIRTUAL_P (new_version_node
->decl
) = 0;
2071 new_version_node
->local
.externally_visible
= 0;
2072 new_version_node
->local
.local
= 1;
2073 new_version_node
->lowered
= true;
2075 /* Update the call_expr on the edges to call the new version node. */
2076 update_call_expr (new_version_node
);
2078 cgraph_call_function_insertion_hooks (new_version_node
);
2079 return new_version_node
;
2082 /* Produce separate function body for inline clones so the offline copy can be
2083 modified without affecting them. */
2084 struct cgraph_node
*
2085 save_inline_function_body (struct cgraph_node
*node
)
2087 struct cgraph_node
*first_clone
, *n
;
2089 gcc_assert (node
== cgraph_node (node
->decl
));
2091 cgraph_lower_function (node
);
2093 first_clone
= node
->clones
;
2095 first_clone
->decl
= copy_node (node
->decl
);
2096 cgraph_insert_node_to_hashtable (first_clone
);
2097 gcc_assert (first_clone
== cgraph_node (first_clone
->decl
));
2098 if (first_clone
->next_sibling_clone
)
2100 for (n
= first_clone
->next_sibling_clone
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
2101 n
->clone_of
= first_clone
;
2102 n
->clone_of
= first_clone
;
2103 n
->next_sibling_clone
= first_clone
->clones
;
2104 if (first_clone
->clones
)
2105 first_clone
->clones
->prev_sibling_clone
= n
;
2106 first_clone
->clones
= first_clone
->next_sibling_clone
;
2107 first_clone
->next_sibling_clone
->prev_sibling_clone
= NULL
;
2108 first_clone
->next_sibling_clone
= NULL
;
2109 gcc_assert (!first_clone
->prev_sibling_clone
);
2111 first_clone
->clone_of
= NULL
;
2112 node
->clones
= NULL
;
2114 if (first_clone
->clones
)
2115 for (n
= first_clone
->clones
; n
!= first_clone
;)
2117 gcc_assert (n
->decl
== node
->decl
);
2118 n
->decl
= first_clone
->decl
;
2121 else if (n
->next_sibling_clone
)
2122 n
= n
->next_sibling_clone
;
2125 while (n
!= first_clone
&& !n
->next_sibling_clone
)
2127 if (n
!= first_clone
)
2128 n
= n
->next_sibling_clone
;
2132 /* Copy the OLD_VERSION_NODE function tree to the new version. */
2133 tree_function_versioning (node
->decl
, first_clone
->decl
, NULL
, true, NULL
);
2135 DECL_EXTERNAL (first_clone
->decl
) = 0;
2136 DECL_COMDAT_GROUP (first_clone
->decl
) = NULL_TREE
;
2137 TREE_PUBLIC (first_clone
->decl
) = 0;
2138 DECL_COMDAT (first_clone
->decl
) = 0;
2139 VEC_free (ipa_opt_pass
, heap
,
2140 first_clone
->ipa_transforms_to_apply
);
2141 first_clone
->ipa_transforms_to_apply
= NULL
;
2143 #ifdef ENABLE_CHECKING
2144 verify_cgraph_node (first_clone
);
2149 /* Given virtual clone, turn it into actual clone. */
2151 cgraph_materialize_clone (struct cgraph_node
*node
)
2153 bitmap_obstack_initialize (NULL
);
2154 /* Copy the OLD_VERSION_NODE function tree to the new version. */
2155 tree_function_versioning (node
->clone_of
->decl
, node
->decl
,
2156 node
->clone
.tree_map
, true,
2157 node
->clone
.args_to_skip
);
2158 if (cgraph_dump_file
)
2160 dump_function_to_file (node
->clone_of
->decl
, cgraph_dump_file
, dump_flags
);
2161 dump_function_to_file (node
->decl
, cgraph_dump_file
, dump_flags
);
2164 /* Function is no longer clone. */
2165 if (node
->next_sibling_clone
)
2166 node
->next_sibling_clone
->prev_sibling_clone
= node
->prev_sibling_clone
;
2167 if (node
->prev_sibling_clone
)
2168 node
->prev_sibling_clone
->next_sibling_clone
= node
->next_sibling_clone
;
2170 node
->clone_of
->clones
= node
->next_sibling_clone
;
2171 node
->next_sibling_clone
= NULL
;
2172 node
->prev_sibling_clone
= NULL
;
2173 if (!node
->clone_of
->analyzed
&& !node
->clone_of
->clones
)
2174 cgraph_remove_node (node
->clone_of
);
2175 node
->clone_of
= NULL
;
2176 bitmap_obstack_release (NULL
);
2179 /* Once all functions from compilation unit are in memory, produce all clones
2180 and update all calls.
2181 We might also do this on demand if we don't want to bring all functions to
2182 memory prior compilation, but current WHOPR implementation does that and it is
2183 is bit easier to keep everything right in this order. */
2185 cgraph_materialize_all_clones (void)
2187 struct cgraph_node
*node
;
2188 bool stabilized
= false;
2190 if (cgraph_dump_file
)
2191 fprintf (cgraph_dump_file
, "Materializing clones\n");
2192 #ifdef ENABLE_CHECKING
2196 /* We can also do topological order, but number of iterations should be
2197 bounded by number of IPA passes since single IPA pass is probably not
2198 going to create clones of clones it created itself. */
2202 for (node
= cgraph_nodes
; node
; node
= node
->next
)
2204 if (node
->clone_of
&& node
->decl
!= node
->clone_of
->decl
2205 && !gimple_has_body_p (node
->decl
))
2207 if (gimple_has_body_p (node
->clone_of
->decl
))
2209 if (cgraph_dump_file
)
2211 fprintf (cgraph_dump_file
, "clonning %s to %s\n",
2212 cgraph_node_name (node
->clone_of
),
2213 cgraph_node_name (node
));
2214 if (node
->clone
.tree_map
)
2217 fprintf (cgraph_dump_file
, " replace map: ");
2218 for (i
= 0; i
< VEC_length (ipa_replace_map_p
,
2219 node
->clone
.tree_map
);
2222 struct ipa_replace_map
*replace_info
;
2223 replace_info
= VEC_index (ipa_replace_map_p
,
2224 node
->clone
.tree_map
,
2226 print_generic_expr (cgraph_dump_file
, replace_info
->old_tree
, 0);
2227 fprintf (cgraph_dump_file
, " -> ");
2228 print_generic_expr (cgraph_dump_file
, replace_info
->new_tree
, 0);
2229 fprintf (cgraph_dump_file
, "%s%s;",
2230 replace_info
->replace_p
? "(replace)":"",
2231 replace_info
->ref_p
? "(ref)":"");
2233 fprintf (cgraph_dump_file
, "\n");
2235 if (node
->clone
.args_to_skip
)
2237 fprintf (cgraph_dump_file
, " args_to_skip: ");
2238 dump_bitmap (cgraph_dump_file
, node
->clone
.args_to_skip
);
2240 if (node
->clone
.args_to_skip
)
2242 fprintf (cgraph_dump_file
, " combined_args_to_skip:");
2243 dump_bitmap (cgraph_dump_file
, node
->clone
.combined_args_to_skip
);
2246 cgraph_materialize_clone (node
);
2253 for (node
= cgraph_nodes
; node
; node
= node
->next
)
2254 if (!node
->analyzed
&& node
->callees
)
2255 cgraph_node_remove_callees (node
);
2256 if (cgraph_dump_file
)
2257 fprintf (cgraph_dump_file
, "Updating call sites\n");
2258 for (node
= cgraph_nodes
; node
; node
= node
->next
)
2259 if (node
->analyzed
&& gimple_has_body_p (node
->decl
)
2260 && (!node
->clone_of
|| node
->clone_of
->decl
!= node
->decl
))
2262 struct cgraph_edge
*e
;
2264 current_function_decl
= node
->decl
;
2265 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
2266 for (e
= node
->callees
; e
; e
= e
->next_callee
)
2268 tree decl
= gimple_call_fndecl (e
->call_stmt
);
2269 /* When function gets inlined, indirect inlining might've invented
2270 new edge for orginally indirect stmt. Since we are not
2271 preserving clones in the original form, we must not update here
2272 since other inline clones don't need to contain call to the same
2273 call. Inliner will do the substitution for us later. */
2274 if (decl
&& decl
!= e
->callee
->decl
)
2277 gimple_stmt_iterator gsi
;
2279 if (e
->callee
->same_body
)
2281 struct cgraph_node
*alias
;
2283 for (alias
= e
->callee
->same_body
;
2285 alias
= alias
->next
)
2286 if (decl
== alias
->decl
)
2288 /* Don't update call from same body alias to the real
2294 if (cgraph_dump_file
)
2296 fprintf (cgraph_dump_file
, "updating call of %s in %s:",
2297 cgraph_node_name (node
),
2298 cgraph_node_name (e
->callee
));
2299 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
2302 if (e
->callee
->clone
.combined_args_to_skip
)
2303 new_stmt
= gimple_call_copy_skip_args (e
->call_stmt
,
2304 e
->callee
->clone
.combined_args_to_skip
);
2306 new_stmt
= e
->call_stmt
;
2307 if (gimple_vdef (new_stmt
)
2308 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
2309 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
2310 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
2312 gsi
= gsi_for_stmt (e
->call_stmt
);
2313 gsi_replace (&gsi
, new_stmt
, true);
2315 /* Update EH information too, just in case. */
2316 maybe_clean_or_replace_eh_stmt (e
->call_stmt
, new_stmt
);
2318 cgraph_set_call_stmt_including_clones (node
, e
->call_stmt
, new_stmt
);
2320 if (cgraph_dump_file
)
2322 fprintf (cgraph_dump_file
, " updated to:");
2323 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
2328 current_function_decl
= NULL
;
2329 #ifdef ENABLE_CHECKING
2330 verify_cgraph_node (node
);
2333 #ifdef ENABLE_CHECKING
2336 cgraph_remove_unreachable_nodes (false, cgraph_dump_file
);
2339 #include "gt-cgraphunit.h"