1 /* Callgraph handling code.
2 Copyright (C) 2003-2019 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/>. */
24 #include "profile-count.h"
26 #include "plugin-api.h"
27 #include "ipa-param-manipulation.h"
29 extern void debuginfo_early_init (void);
30 extern void debuginfo_init (void);
31 extern void debuginfo_fini (void);
32 extern void debuginfo_start (void);
33 extern void debuginfo_stop (void);
34 extern void debuginfo_early_start (void);
35 extern void debuginfo_early_stop (void);
38 typedef ipa_opt_pass_d
*ipa_opt_pass
;
40 /* Symbol table consists of functions and variables.
41 TODO: add labels and CONST_DECLs. */
49 /* Section names are stored as reference counted strings in GGC safe hashtable
50 (to make them survive through PCH). */
52 struct GTY((for_user
)) section_hash_entry
55 char *name
; /* As long as this datastructure stays in GGC, we cannot put
56 string at the tail of structure of GGC dies in horrible
60 struct section_name_hasher
: ggc_ptr_hash
<section_hash_entry
>
62 typedef const char *compare_type
;
64 static hashval_t
hash (section_hash_entry
*);
65 static bool equal (section_hash_entry
*, const char *);
70 /* Not yet set by cgraph_function_body_availability. */
72 /* Function body/variable initializer is unknown. */
74 /* Function body/variable initializer is known but might be replaced
75 by a different one from other compilation unit and thus needs to
76 be dealt with a care. Like AVAIL_NOT_AVAILABLE it can have
77 arbitrary side effects on escaping variables and functions, while
78 like AVAILABLE it might access static variables. */
80 /* Function body/variable initializer is known and will be used in final
83 /* Function body/variable initializer is known and all it's uses are
84 explicitly visible within current unit (i.e. it's address is never taken
85 and it is not exported to other units). Currently used only for
90 /* Classification of symbols WRT partitioning. */
91 enum symbol_partitioning_class
93 /* External declarations are ignored by partitioning algorithms and they are
94 added into the boundary later via compute_ltrans_boundary. */
96 /* Partitioned symbols are put into one of partitions. */
98 /* Duplicated symbols (such as comdat or constant pool references) are
99 copied into every node needing them via add_symbol_to_partition. */
103 /* Base of all entries in the symbol table.
104 The symtab_node is inherited by cgraph and varpol nodes. */
105 struct GTY((desc ("%h.type"), tag ("SYMTAB_SYMBOL"),
106 chain_next ("%h.next"), chain_prev ("%h.previous")))
110 friend class symbol_table
;
113 const char *name () const;
115 /* Return dump name. */
116 const char *dump_name () const;
118 /* Return asm name. */
119 const char *asm_name () const;
121 /* Return dump name with assembler name. */
122 const char *dump_asm_name () const;
124 /* Return visibility name. */
125 const char *get_visibility_string () const;
127 /* Return type_name name. */
128 const char *get_symtab_type_string () const;
130 /* Add node into symbol table. This function is not used directly, but via
131 cgraph/varpool node creation routines. */
132 void register_symbol (void);
134 /* Remove symbol from symbol table. */
137 /* Dump symtab node to F. */
140 /* Dump symtab callgraph in graphviz format. */
141 void dump_graphviz (FILE *f
);
143 /* Dump symtab node to stderr. */
144 void DEBUG_FUNCTION
debug (void);
146 /* Verify consistency of node. */
147 void DEBUG_FUNCTION
verify (void);
149 /* Return ipa reference from this symtab_node to
150 REFERRED_NODE or REFERRED_VARPOOL_NODE. USE_TYPE specify type
151 of the use and STMT the statement (if it exists). */
152 ipa_ref
*create_reference (symtab_node
*referred_node
,
153 enum ipa_ref_use use_type
);
155 /* Return ipa reference from this symtab_node to
156 REFERRED_NODE or REFERRED_VARPOOL_NODE. USE_TYPE specify type
157 of the use and STMT the statement (if it exists). */
158 ipa_ref
*create_reference (symtab_node
*referred_node
,
159 enum ipa_ref_use use_type
, gimple
*stmt
);
161 /* If VAL is a reference to a function or a variable, add a reference from
162 this symtab_node to the corresponding symbol table node. Return the new
163 reference or NULL if none was created. */
164 ipa_ref
*maybe_create_reference (tree val
, gimple
*stmt
);
166 /* Clone all references from symtab NODE to this symtab_node. */
167 void clone_references (symtab_node
*node
);
169 /* Remove all stmt references in non-speculative references.
170 Those are not maintained during inlining & clonning.
171 The exception are speculative references that are updated along
172 with callgraph edges associated with them. */
173 void clone_referring (symtab_node
*node
);
175 /* Clone reference REF to this symtab_node and set its stmt to STMT. */
176 ipa_ref
*clone_reference (ipa_ref
*ref
, gimple
*stmt
);
178 /* Find the structure describing a reference to REFERRED_NODE
179 and associated with statement STMT. */
180 ipa_ref
*find_reference (symtab_node
*referred_node
, gimple
*stmt
,
181 unsigned int lto_stmt_uid
);
183 /* Remove all references that are associated with statement STMT. */
184 void remove_stmt_references (gimple
*stmt
);
186 /* Remove all stmt references in non-speculative references.
187 Those are not maintained during inlining & clonning.
188 The exception are speculative references that are updated along
189 with callgraph edges associated with them. */
190 void clear_stmts_in_references (void);
192 /* Remove all references in ref list. */
193 void remove_all_references (void);
195 /* Remove all referring items in ref list. */
196 void remove_all_referring (void);
198 /* Dump references in ref list to FILE. */
199 void dump_references (FILE *file
);
201 /* Dump referring in list to FILE. */
202 void dump_referring (FILE *);
204 /* Get number of references for this node. */
205 inline unsigned num_references (void)
207 return ref_list
.references
? ref_list
.references
->length () : 0;
210 /* Iterates I-th reference in the list, REF is also set. */
211 ipa_ref
*iterate_reference (unsigned i
, ipa_ref
*&ref
);
213 /* Iterates I-th referring item in the list, REF is also set. */
214 ipa_ref
*iterate_referring (unsigned i
, ipa_ref
*&ref
);
216 /* Iterates I-th referring alias item in the list, REF is also set. */
217 ipa_ref
*iterate_direct_aliases (unsigned i
, ipa_ref
*&ref
);
219 /* Return true if symtab node and TARGET represents
220 semantically equivalent symbols. */
221 bool semantically_equivalent_p (symtab_node
*target
);
223 /* Classify symbol symtab node for partitioning. */
224 enum symbol_partitioning_class
get_partitioning_class (void);
226 /* Return comdat group. */
227 tree
get_comdat_group ()
229 return x_comdat_group
;
232 /* Return comdat group as identifier_node. */
233 tree
get_comdat_group_id ()
235 if (x_comdat_group
&& TREE_CODE (x_comdat_group
) != IDENTIFIER_NODE
)
236 x_comdat_group
= DECL_ASSEMBLER_NAME (x_comdat_group
);
237 return x_comdat_group
;
240 /* Set comdat group. */
241 void set_comdat_group (tree group
)
243 gcc_checking_assert (!group
|| TREE_CODE (group
) == IDENTIFIER_NODE
245 x_comdat_group
= group
;
248 /* Return section as string. */
249 const char * get_section ()
253 return x_section
->name
;
256 /* Remove node from same comdat group. */
257 void remove_from_same_comdat_group (void);
259 /* Add this symtab_node to the same comdat group that OLD is in. */
260 void add_to_same_comdat_group (symtab_node
*old_node
);
262 /* Dissolve the same_comdat_group list in which NODE resides. */
263 void dissolve_same_comdat_group_list (void);
265 /* Return true when symtab_node is known to be used from other (non-LTO)
266 object file. Known only when doing LTO via linker plugin. */
267 bool used_from_object_file_p (void);
269 /* Walk the alias chain to return the symbol NODE is alias of.
270 If NODE is not an alias, return NODE.
271 When AVAILABILITY is non-NULL, get minimal availability in the chain.
272 When REF is non-NULL, assume that reference happens in symbol REF
273 when determining the availability. */
274 symtab_node
*ultimate_alias_target (enum availability
*avail
= NULL
,
275 struct symtab_node
*ref
= NULL
);
277 /* Return next reachable static symbol with initializer after NODE. */
278 inline symtab_node
*next_defined_symbol (void);
280 /* Add reference recording that symtab node is alias of TARGET.
281 If TRANSPARENT is true make the alias to be transparent alias.
282 The function can fail in the case of aliasing cycles; in this case
284 bool resolve_alias (symtab_node
*target
, bool transparent
= false);
286 /* C++ FE sometimes change linkage flags after producing same
288 void fixup_same_cpp_alias_visibility (symtab_node
*target
);
290 /* Call callback on symtab node and aliases associated to this node.
291 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
293 bool call_for_symbol_and_aliases (bool (*callback
) (symtab_node
*, void *),
295 bool include_overwrite
);
297 /* If node cannot be interposable by static or dynamic linker to point to
298 different definition, return this symbol. Otherwise look for alias with
299 such property and if none exists, introduce new one. */
300 symtab_node
*noninterposable_alias (void);
302 /* Return node that alias is aliasing. */
303 inline symtab_node
*get_alias_target (void);
305 /* Set section for symbol and its aliases. */
306 void set_section (const char *section
);
308 /* Set section, do not recurse into aliases.
309 When one wants to change section of symbol and its aliases,
311 void set_section_for_node (const char *section
);
313 /* Set initialization priority to PRIORITY. */
314 void set_init_priority (priority_type priority
);
316 /* Return the initialization priority. */
317 priority_type
get_init_priority ();
319 /* Return availability of NODE when referenced from REF. */
320 enum availability
get_availability (symtab_node
*ref
= NULL
);
322 /* During LTO stream-in this predicate can be used to check whether node
323 in question prevails in the linking to save some memory usage. */
324 bool prevailing_p (void);
326 /* Return true if NODE binds to current definition in final executable
327 when referenced from REF. If REF is NULL return conservative value
328 for any reference. */
329 bool binds_to_current_def_p (symtab_node
*ref
= NULL
);
331 /* Make DECL local. */
332 void make_decl_local (void);
334 /* Copy visibility from N. */
335 void copy_visibility_from (symtab_node
*n
);
337 /* Return desired alignment of the definition. This is NOT alignment useful
338 to access THIS, because THIS may be interposable and DECL_ALIGN should
339 be used instead. It however must be guaranteed when output definition
341 unsigned int definition_alignment ();
343 /* Return true if alignment can be increased. */
344 bool can_increase_alignment_p ();
346 /* Increase alignment of symbol to ALIGN. */
347 void increase_alignment (unsigned int align
);
349 /* Return true if list contains an alias. */
350 bool has_aliases_p (void);
352 /* Return true when the symbol is real symbol, i.e. it is not inline clone
353 or abstract function kept for debug info purposes only. */
354 bool real_symbol_p (void);
356 /* Return true when the symbol needs to be output to the LTO symbol table. */
357 bool output_to_lto_symbol_table_p (void);
359 /* Determine if symbol declaration is needed. That is, visible to something
360 either outside this translation unit, something magic in the system
361 configury. This function is used just during symbol creation. */
362 bool needed_p (void);
364 /* Return true if this symbol is a function from the C frontend specified
365 directly in RTL form (with "__RTL"). */
366 bool native_rtl_p () const;
368 /* Return true when there are references to the node. */
369 bool referred_to_p (bool include_self
= true);
371 /* Return true if symbol can be discarded by linker from the binary.
372 Assume that symbol is used (so there is no need to take into account
373 garbage collecting linkers)
375 This can happen for comdats, commons and weaks when they are prevailed
376 by other definition at static linking time. */
378 can_be_discarded_p (void)
380 return (DECL_EXTERNAL (decl
)
381 || ((get_comdat_group ()
382 || DECL_COMMON (decl
)
383 || (DECL_SECTION_NAME (decl
) && DECL_WEAK (decl
)))
384 && ((resolution
!= LDPR_PREVAILING_DEF
385 && resolution
!= LDPR_PREVAILING_DEF_IRONLY_EXP
)
386 || flag_incremental_link
)
387 && resolution
!= LDPR_PREVAILING_DEF_IRONLY
));
390 /* Return true if NODE is local to a particular COMDAT group, and must not
391 be named from outside the COMDAT. This is used for C++ decloned
393 inline bool comdat_local_p (void)
395 return (same_comdat_group
&& !TREE_PUBLIC (decl
));
398 /* Return true if ONE and TWO are part of the same COMDAT group. */
399 inline bool in_same_comdat_group_p (symtab_node
*target
);
401 /* Return true if symbol is known to be nonzero. */
402 bool nonzero_address ();
404 /* Return 0 if symbol is known to have different address than S2,
405 Return 1 if symbol is known to have same address as S2,
408 If MEMORY_ACCESSED is true, assume that both memory pointer to THIS
409 and S2 is going to be accessed. This eliminates the situations when
410 either THIS or S2 is NULL and is useful for comparing bases when deciding
411 about memory aliasing. */
412 int equal_address_to (symtab_node
*s2
, bool memory_accessed
= false);
414 /* Return true if symbol's address may possibly be compared to other
416 bool address_matters_p ();
418 /* Return true if NODE's address can be compared. This use properties
419 of NODE only and does not look if the address is actually taken in
420 interesting way. For that use ADDRESS_MATTERS_P instead. */
421 bool address_can_be_compared_p (void);
423 /* Return symbol table node associated with DECL, if any,
424 and NULL otherwise. */
425 static inline symtab_node
*get (const_tree decl
)
427 /* Check that we are called for sane type of object - functions
428 and static or external variables. */
429 gcc_checking_assert (TREE_CODE (decl
) == FUNCTION_DECL
430 || (TREE_CODE (decl
) == VAR_DECL
431 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)
433 /* Check that the mapping is sane - perhaps this check can go away,
434 but at the moment frontends tends to corrupt the mapping by calling
435 memcpy/memset on the tree nodes. */
436 gcc_checking_assert (!decl
->decl_with_vis
.symtab_node
437 || decl
->decl_with_vis
.symtab_node
->decl
== decl
);
438 return decl
->decl_with_vis
.symtab_node
;
441 /* Try to find a symtab node for declaration DECL and if it does not
442 exist or if it corresponds to an inline clone, create a new one. */
443 static inline symtab_node
* get_create (tree node
);
445 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
446 Return NULL if there's no such node. */
447 static symtab_node
*get_for_asmname (const_tree asmname
);
449 /* Verify symbol table for internal consistency. */
450 static DEBUG_FUNCTION
void verify_symtab_nodes (void);
452 /* Perform internal consistency checks, if they are enabled. */
453 static inline void checking_verify_symtab_nodes (void);
455 /* Type of the symbol. */
456 ENUM_BITFIELD (symtab_type
) type
: 8;
458 /* The symbols resolution. */
459 ENUM_BITFIELD (ld_plugin_symbol_resolution
) resolution
: 8;
461 /*** Flags representing the symbol type. ***/
463 /* True when symbol corresponds to a definition in current unit.
464 set via finalize_function or finalize_decl */
465 unsigned definition
: 1;
466 /* True when symbol is an alias.
467 Set by assemble_alias. */
469 /* When true the alias is translated into its target symbol either by GCC
470 or assembler (it also may just be a duplicate declaration of the same
473 Currently transparent aliases come in three different flavors
474 - aliases having the same assembler name as their target (aka duplicated
475 declarations). In this case the assembler names compare via
476 assembler_names_equal_p and weakref is false
477 - aliases that are renamed at a time being output to final file
478 by varasm.c. For those DECL_ASSEMBLER_NAME have
479 IDENTIFIER_TRANSPARENT_ALIAS set and thus also their assembler
481 Weakrefs belong to this category when we target assembler without
483 - weakrefs that are renamed by assembler via .weakref directive.
484 In this case the alias may or may not be definition (depending if
485 target declaration was seen by the compiler), weakref is set.
486 Unless we are before renaming statics, assembler names are different.
488 Given that we now support duplicate declarations, the second option is
489 redundant and will be removed. */
490 unsigned transparent_alias
: 1;
491 /* True when alias is a weakref. */
492 unsigned weakref
: 1;
493 /* C++ frontend produce same body aliases and extra name aliases for
494 virtual functions and vtables that are obviously equivalent.
495 Those aliases are bit special, especially because C++ frontend
496 visibility code is so ugly it cannot get them right at first time
497 and their visibility needs to be copied from their "masters" at
498 the end of parsing. */
499 unsigned cpp_implicit_alias
: 1;
500 /* The alias is a symbol version. */
502 /* Set once the definition was analyzed. The list of references and
503 other properties are built during analysis. */
504 unsigned analyzed
: 1;
505 /* Set for write-only variables. */
506 unsigned writeonly
: 1;
507 /* Visibility of symbol was used for further optimization; do not
508 permit further changes. */
509 unsigned refuse_visibility_changes
: 1;
511 /*** Visibility and linkage flags. ***/
513 /* Set when function is visible by other units. */
514 unsigned externally_visible
: 1;
515 /* Don't reorder to other symbols having this set. */
516 unsigned no_reorder
: 1;
517 /* The symbol will be assumed to be used in an invisible way (like
518 by an toplevel asm statement). */
519 unsigned force_output
: 1;
520 /* Like FORCE_OUTPUT, but in the case it is ABI requiring the symbol to be
521 exported. Unlike FORCE_OUTPUT this flag gets cleared to symbols promoted
522 to static and it does not inhibit optimization. */
523 unsigned forced_by_abi
: 1;
524 /* True when the name is known to be unique and thus it does not need mangling. */
525 unsigned unique_name
: 1;
526 /* Specify whether the section was set by user or by
527 compiler via -ffunction-sections. */
528 unsigned implicit_section
: 1;
529 /* True when body and other characteristics have been removed by
530 symtab_remove_unreachable_nodes. */
531 unsigned body_removed
: 1;
533 /*** WHOPR Partitioning flags.
534 These flags are used at ltrans stage when only part of the callgraph is
537 /* Set when variable is used from other LTRANS partition. */
538 unsigned used_from_other_partition
: 1;
539 /* Set when function is available in the other LTRANS partition.
540 During WPA output it is used to mark nodes that are present in
541 multiple partitions. */
542 unsigned in_other_partition
: 1;
546 /*** other flags. ***/
548 /* Set when symbol has address taken. */
549 unsigned address_taken
: 1;
550 /* Set when init priority is set. */
551 unsigned in_init_priority_hash
: 1;
553 /* Set when symbol needs to be streamed into LTO bytecode for LTO, or in case
554 of offloading, for separate compilation for a different target. */
555 unsigned need_lto_streaming
: 1;
557 /* Set when symbol can be streamed into bytecode for offloading. */
558 unsigned offloadable
: 1;
560 /* Set when symbol is an IFUNC resolver. */
561 unsigned ifunc_resolver
: 1;
564 /* Ordering of all symtab entries. */
567 /* Declaration representing the symbol. */
570 /* Linked list of symbol table entries starting with symtab_nodes. */
572 symtab_node
*previous
;
574 /* Linked list of symbols with the same asm name. There may be multiple
575 entries for single symbol name during LTO, because symbols are renamed
576 only after partitioning.
578 Because inline clones are kept in the assembler name has, they also produce
581 There are also several long standing bugs where frontends and builtin
582 code produce duplicated decls. */
583 symtab_node
*next_sharing_asm_name
;
584 symtab_node
*previous_sharing_asm_name
;
586 /* Circular list of nodes in the same comdat group if non-NULL. */
587 symtab_node
*same_comdat_group
;
589 /* Vectors of referring and referenced entities. */
590 ipa_ref_list ref_list
;
592 /* Alias target. May be either DECL pointer or ASSEMBLER_NAME pointer
593 depending to what was known to frontend on the creation time.
594 Once alias is resolved, this pointer become NULL. */
597 /* File stream where this node is being written to. */
598 struct lto_file_decl_data
* lto_file_data
;
600 PTR
GTY ((skip
)) aux
;
602 /* Comdat group the symbol is in. Can be private if GGC allowed that. */
605 /* Section name. Again can be private, if allowed. */
606 section_hash_entry
*x_section
;
609 /* Dump base fields of symtab nodes to F. Not to be used directly. */
610 void dump_base (FILE *);
612 /* Verify common part of symtab node. */
613 bool DEBUG_FUNCTION
verify_base (void);
615 /* Remove node from symbol table. This function is not used directly, but via
616 cgraph/varpool node removal routines. */
617 void unregister (void);
619 /* Return the initialization and finalization priority information for
620 DECL. If there is no previous priority information, a freshly
621 allocated structure is returned. */
622 struct symbol_priority_map
*priority_info (void);
624 /* Worker for call_for_symbol_and_aliases_1. */
625 bool call_for_symbol_and_aliases_1 (bool (*callback
) (symtab_node
*, void *),
627 bool include_overwrite
);
629 /* Worker for set_section. */
630 static bool set_section (symtab_node
*n
, void *s
);
632 /* Worker for symtab_resolve_alias. */
633 static bool set_implicit_section (symtab_node
*n
, void *);
635 /* Worker searching noninterposable alias. */
636 static bool noninterposable_alias (symtab_node
*node
, void *data
);
638 /* Worker for ultimate_alias_target. */
639 symtab_node
*ultimate_alias_target_1 (enum availability
*avail
= NULL
,
640 symtab_node
*ref
= NULL
);
642 /* Get dump name with normal or assembly name. */
643 const char *get_dump_name (bool asm_name_p
) const;
647 symtab_node::checking_verify_symtab_nodes (void)
650 symtab_node::verify_symtab_nodes ();
653 /* Walk all aliases for NODE. */
654 #define FOR_EACH_ALIAS(NODE, ALIAS) \
655 for (unsigned ALIAS##_iter_ = 0; \
656 (NODE)->iterate_direct_aliases (ALIAS##_iter_, ALIAS); \
659 /* This is the information that is put into the cgraph local structure
660 to recover a function. */
661 struct lto_file_decl_data
;
663 extern const char * const cgraph_availability_names
[];
664 extern const char * const ld_plugin_symbol_resolution_names
[];
665 extern const char * const tls_model_names
[];
667 /* Sub-structure of cgraph_node. Holds information about thunk, used only for
670 Thunks are basically wrappers around methods which are introduced in case
671 of multiple inheritance in order to adjust the value of the "this" pointer
672 or of the returned value.
674 In the case of this-adjusting thunks, each back-end can override the
675 can_output_mi_thunk/output_mi_thunk target hooks to generate a minimal thunk
676 (with a tail call for instance) directly as assembly. For the default hook
677 or for the case where the can_output_mi_thunk hooks return false, the thunk
678 is gimplified and lowered using the regular machinery. */
680 struct GTY(()) cgraph_thunk_info
{
681 /* Offset used to adjust "this". */
682 HOST_WIDE_INT fixed_offset
;
684 /* Offset in the virtual table to get the offset to adjust "this". Valid iff
685 VIRTUAL_OFFSET_P is true. */
686 HOST_WIDE_INT virtual_value
;
688 /* Offset from "this" to get the offset to adjust "this". Zero means: this
689 offset is to be ignored. */
690 HOST_WIDE_INT indirect_offset
;
692 /* Thunk target, i.e. the method that this thunk wraps. Depending on the
693 TARGET_USE_LOCAL_THUNK_ALIAS_P macro, this may have to be a new alias. */
696 /* Nonzero for a "this" adjusting thunk and zero for a result adjusting
700 /* If true, this thunk is what we call a virtual thunk. In this case:
701 * for this-adjusting thunks, after the FIXED_OFFSET based adjustment is
702 done, add to the result the offset found in the vtable at:
704 * for result-adjusting thunks, the FIXED_OFFSET adjustment is done after
706 bool virtual_offset_p
;
708 /* Set to true when alias node (the cgraph_node to which this struct belong)
709 is a thunk. Access to any other fields is invalid if this is false. */
713 /* Represent which DECL tree (or reference to such tree)
714 will be replaced by another tree while versioning. */
715 struct GTY(()) ipa_replace_map
717 /* The new (replacing) tree. */
719 /* Parameter number to replace, when old_tree is NULL. */
723 struct GTY(()) cgraph_clone_info
725 /* Constants discovered by IPA-CP, i.e. which parameter should be replaced
727 vec
<ipa_replace_map
*, va_gc
> *tree_map
;
728 /* Parameter modification that IPA-SRA decided to perform. */
729 ipa_param_adjustments
*param_adjustments
;
730 /* Lists of dummy-decl and offset pairs representing split formal parameters
731 in the caller. Offsets of all new replacements are enumerated, those
732 coming from the same original parameter have the same dummy decl stored
735 Dummy decls sit in call statement arguments followed by new parameter
736 decls (or their SSA names) in between (caller) clone materialization and
737 call redirection. Redirection then recognizes the dummy variable and
738 together with the stored offsets can reconstruct what exactly the new
739 parameter decls represent and can leave in place only those that the
741 vec
<ipa_param_performed_split
, va_gc
> *performed_splits
;
744 enum cgraph_simd_clone_arg_type
746 SIMD_CLONE_ARG_TYPE_VECTOR
,
747 SIMD_CLONE_ARG_TYPE_UNIFORM
,
748 /* These are only for integer/pointer arguments passed by value. */
749 SIMD_CLONE_ARG_TYPE_LINEAR_CONSTANT_STEP
,
750 SIMD_CLONE_ARG_TYPE_LINEAR_VARIABLE_STEP
,
751 /* These 6 are only for reference type arguments or arguments passed
753 SIMD_CLONE_ARG_TYPE_LINEAR_REF_CONSTANT_STEP
,
754 SIMD_CLONE_ARG_TYPE_LINEAR_REF_VARIABLE_STEP
,
755 SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_CONSTANT_STEP
,
756 SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_VARIABLE_STEP
,
757 SIMD_CLONE_ARG_TYPE_LINEAR_VAL_CONSTANT_STEP
,
758 SIMD_CLONE_ARG_TYPE_LINEAR_VAL_VARIABLE_STEP
,
759 SIMD_CLONE_ARG_TYPE_MASK
762 /* Function arguments in the original function of a SIMD clone.
763 Supplementary data for `struct simd_clone'. */
765 struct GTY(()) cgraph_simd_clone_arg
{
766 /* Original function argument as it originally existed in
770 /* orig_arg's function (or for extern functions type from
774 /* If argument is a vector, this holds the vector version of
775 orig_arg that after adjusting the argument types will live in
776 DECL_ARGUMENTS. Otherwise, this is NULL.
778 This basically holds:
779 vector(simdlen) __typeof__(orig_arg) new_arg. */
782 /* vector_arg's type (or for extern functions new vector type. */
785 /* If argument is a vector, this holds the array where the simd
786 argument is held while executing the simd clone function. This
787 is a local variable in the cloned function. Its content is
788 copied from vector_arg upon entry to the clone.
790 This basically holds:
791 __typeof__(orig_arg) simd_array[simdlen]. */
794 /* A SIMD clone's argument can be either linear (constant or
795 variable), uniform, or vector. */
796 enum cgraph_simd_clone_arg_type arg_type
;
798 /* For arg_type SIMD_CLONE_ARG_TYPE_LINEAR_*CONSTANT_STEP this is
799 the constant linear step, if arg_type is
800 SIMD_CLONE_ARG_TYPE_LINEAR_*VARIABLE_STEP, this is index of
801 the uniform argument holding the step, otherwise 0. */
802 HOST_WIDE_INT linear_step
;
804 /* Variable alignment if available, otherwise 0. */
805 unsigned int alignment
;
808 /* Specific data for a SIMD function clone. */
810 struct GTY(()) cgraph_simd_clone
{
811 /* Number of words in the SIMD lane associated with this clone. */
812 unsigned int simdlen
;
814 /* Number of annotated function arguments in `args'. This is
815 usually the number of named arguments in FNDECL. */
818 /* Max hardware vector size in bits for integral vectors. */
819 unsigned int vecsize_int
;
821 /* Max hardware vector size in bits for floating point vectors. */
822 unsigned int vecsize_float
;
824 /* Machine mode of the mask argument(s), if they are to be passed
825 as bitmasks in integer argument(s). VOIDmode if masks are passed
826 as vectors of characteristic type. */
827 machine_mode mask_mode
;
829 /* The mangling character for a given vector size. This is used
830 to determine the ISA mangling bit as specified in the Intel
832 unsigned char vecsize_mangle
;
834 /* True if this is the masked, in-branch version of the clone,
836 unsigned int inbranch
: 1;
838 /* Doubly linked list of SIMD clones. */
839 cgraph_node
*prev_clone
, *next_clone
;
841 /* Original cgraph node the SIMD clones were created for. */
844 /* Annotated function arguments for the original function. */
845 cgraph_simd_clone_arg
GTY((length ("%h.nargs"))) args
[1];
848 /* Function Multiversioning info. */
849 struct GTY((for_user
)) cgraph_function_version_info
{
850 /* The cgraph_node for which the function version info is stored. */
851 cgraph_node
*this_node
;
852 /* Chains all the semantically identical function versions. The
853 first function in this chain is the version_info node of the
855 cgraph_function_version_info
*prev
;
856 /* If this version node corresponds to a dispatcher for function
857 versions, this points to the version info node of the default
858 function, the first node in the chain. */
859 cgraph_function_version_info
*next
;
860 /* If this node corresponds to a function version, this points
861 to the dispatcher function decl, which is the function that must
862 be called to execute the right function version at run-time.
864 If this cgraph node is a dispatcher (if dispatcher_function is
865 true, in the cgraph_node struct) for function versions, this
866 points to resolver function, which holds the function body of the
867 dispatcher. The dispatcher decl is an alias to the resolver
869 tree dispatcher_resolver
;
872 #define DEFCIFCODE(code, type, string) CIF_ ## code,
873 /* Reasons for inlining failures. */
875 enum cgraph_inline_failed_t
{
876 #include "cif-code.def"
880 enum cgraph_inline_failed_type_t
882 CIF_FINAL_NORMAL
= 0,
888 struct cgraph_edge_hasher
: ggc_ptr_hash
<cgraph_edge
>
890 typedef gimple
*compare_type
;
892 static hashval_t
hash (cgraph_edge
*);
893 static hashval_t
hash (gimple
*);
894 static bool equal (cgraph_edge
*, gimple
*);
897 /* The cgraph data structure.
898 Each function decl has assigned cgraph_node listing callees and callers. */
900 struct GTY((tag ("SYMTAB_FUNCTION"))) cgraph_node
: public symtab_node
902 friend class symbol_table
;
904 /* Remove the node from cgraph and all inline clones inlined into it.
905 Skip however removal of FORBIDDEN_NODE and return true if it needs to be
906 removed. This allows to call the function from outer loop walking clone
908 bool remove_symbol_and_inline_clones (cgraph_node
*forbidden_node
= NULL
);
910 /* Record all references from cgraph_node that are taken
911 in statement STMT. */
912 void record_stmt_references (gimple
*stmt
);
914 /* Like cgraph_set_call_stmt but walk the clone tree and update all
915 clones sharing the same function body.
916 When WHOLE_SPECULATIVE_EDGES is true, all three components of
917 speculative edge gets updated. Otherwise we update only direct
919 void set_call_stmt_including_clones (gimple
*old_stmt
, gcall
*new_stmt
,
920 bool update_speculative
= true);
922 /* Walk the alias chain to return the function cgraph_node is alias of.
923 Walk through thunk, too.
924 When AVAILABILITY is non-NULL, get minimal availability in the chain.
925 When REF is non-NULL, assume that reference happens in symbol REF
926 when determining the availability. */
927 cgraph_node
*function_symbol (enum availability
*avail
= NULL
,
928 struct symtab_node
*ref
= NULL
);
930 /* Walk the alias chain to return the function cgraph_node is alias of.
931 Walk through non virtual thunks, too. Thus we return either a function
932 or a virtual thunk node.
933 When AVAILABILITY is non-NULL, get minimal availability in the chain.
934 When REF is non-NULL, assume that reference happens in symbol REF
935 when determining the availability. */
936 cgraph_node
*function_or_virtual_thunk_symbol
937 (enum availability
*avail
= NULL
,
938 struct symtab_node
*ref
= NULL
);
940 /* Create node representing clone of N executed COUNT times. Decrease
941 the execution counts from original node too.
942 The new clone will have decl set to DECL that may or may not be the same
945 When UPDATE_ORIGINAL is true, the counts are subtracted from the original
946 function's profile to reflect the fact that part of execution is handled
948 When CALL_DUPLICATION_HOOK is true, the ipa passes are acknowledged about
949 the new clone. Otherwise the caller is responsible for doing so later.
951 If the new node is being inlined into another one, NEW_INLINED_TO should be
952 the outline function the new one is (even indirectly) inlined to.
953 All hooks will see this in node's inlined_to, when invoked.
954 Can be NULL if the node is not inlined. SUFFIX is string that is appended
955 to the original name. */
956 cgraph_node
*create_clone (tree decl
, profile_count count
,
957 bool update_original
,
958 vec
<cgraph_edge
*> redirect_callers
,
959 bool call_duplication_hook
,
960 cgraph_node
*new_inlined_to
,
961 ipa_param_adjustments
*param_adjustments
,
962 const char *suffix
= NULL
);
964 /* Create callgraph node clone with new declaration. The actual body will be
965 copied later at compilation stage. The name of the new clone will be
966 constructed from the name of the original node, SUFFIX and NUM_SUFFIX. */
967 cgraph_node
*create_virtual_clone (vec
<cgraph_edge
*> redirect_callers
,
968 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
969 ipa_param_adjustments
*param_adjustments
,
970 const char * suffix
, unsigned num_suffix
);
972 /* Remove the node from the tree of virtual and inline clones and make it a
973 standalone node - not a clone any more. */
974 void remove_from_clone_tree ();
976 /* cgraph node being removed from symbol table; see if its entry can be
977 replaced by other inline clone. */
978 cgraph_node
*find_replacement (void);
980 /* Create a new cgraph node which is the new version of
981 callgraph node. REDIRECT_CALLERS holds the callers
982 edges which should be redirected to point to
983 NEW_VERSION. ALL the callees edges of the node
984 are cloned to the new version node. Return the new
987 If non-NULL BLOCK_TO_COPY determine what basic blocks
988 was copied to prevent duplications of calls that are dead
991 SUFFIX is string that is appended to the original name. */
993 cgraph_node
*create_version_clone (tree new_decl
,
994 vec
<cgraph_edge
*> redirect_callers
,
996 const char *suffix
= NULL
);
998 /* Perform function versioning.
999 Function versioning includes copying of the tree and
1000 a callgraph update (creating a new cgraph node and updating
1001 its callees and callers).
1003 REDIRECT_CALLERS varray includes the edges to be redirected
1006 TREE_MAP is a mapping of tree nodes we want to replace with
1007 new ones (according to results of prior analysis).
1009 If non-NULL ARGS_TO_SKIP determine function parameters to remove
1011 If SKIP_RETURN is true, the new version will return void.
1012 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
1013 If non_NULL NEW_ENTRY determine new entry BB of the clone.
1015 If TARGET_ATTRIBUTES is non-null, when creating a new declaration,
1016 add the attributes to DECL_ATTRIBUTES. And call valid_attribute_p
1017 that will promote value of the attribute DECL_FUNCTION_SPECIFIC_TARGET
1020 Return the new version's cgraph node. */
1021 cgraph_node
*create_version_clone_with_body
1022 (vec
<cgraph_edge
*> redirect_callers
,
1023 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
1024 ipa_param_adjustments
*param_adjustments
,
1025 bitmap bbs_to_copy
, basic_block new_entry_block
, const char *clone_name
,
1026 tree target_attributes
= NULL_TREE
);
1028 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
1029 corresponding to cgraph_node. */
1030 cgraph_function_version_info
*insert_new_function_version (void);
1032 /* Get the cgraph_function_version_info node corresponding to node. */
1033 cgraph_function_version_info
*function_version (void);
1035 /* Discover all functions and variables that are trivially needed, analyze
1036 them as well as all functions and variables referred by them */
1037 void analyze (void);
1039 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
1040 aliases DECL with an adjustments made into the first parameter.
1041 See comments in struct cgraph_thunk_info for detail on the parameters. */
1042 cgraph_node
* create_thunk (tree alias
, tree
, bool this_adjusting
,
1043 HOST_WIDE_INT fixed_offset
,
1044 HOST_WIDE_INT virtual_value
,
1045 HOST_WIDE_INT indirect_offset
,
1046 tree virtual_offset
,
1050 /* Return node that alias is aliasing. */
1051 inline cgraph_node
*get_alias_target (void);
1053 /* Given function symbol, walk the alias chain to return the function node
1054 is alias of. Do not walk through thunks.
1055 When AVAILABILITY is non-NULL, get minimal availability in the chain.
1056 When REF is non-NULL, assume that reference happens in symbol REF
1057 when determining the availability. */
1059 cgraph_node
*ultimate_alias_target (availability
*availability
= NULL
,
1060 symtab_node
*ref
= NULL
);
1062 /* Expand thunk NODE to gimple if possible.
1063 When FORCE_GIMPLE_THUNK is true, gimple thunk is created and
1064 no assembler is produced.
1065 When OUTPUT_ASM_THUNK is true, also produce assembler for
1066 thunks that are not lowered. */
1067 bool expand_thunk (bool output_asm_thunks
, bool force_gimple_thunk
);
1069 /* Call expand_thunk on all callers that are thunks and analyze those
1070 nodes that were expanded. */
1071 void expand_all_artificial_thunks ();
1073 /* Assemble thunks and aliases associated to node. */
1074 void assemble_thunks_and_aliases (void);
1076 /* Expand function specified by node. */
1079 /* As an GCC extension we allow redefinition of the function. The
1080 semantics when both copies of bodies differ is not well defined.
1081 We replace the old body with new body so in unit at a time mode
1082 we always use new body, while in normal mode we may end up with
1083 old body inlined into some functions and new body expanded and
1084 inlined in others. */
1087 /* Creates a wrapper from cgraph_node to TARGET node. Thunk is used for this
1088 kind of wrapper method. */
1089 void create_wrapper (cgraph_node
*target
);
1091 /* Verify cgraph nodes of the cgraph node. */
1092 void DEBUG_FUNCTION
verify_node (void);
1094 /* Remove function from symbol table. */
1097 /* Dump call graph node to file F. */
1098 void dump (FILE *f
);
1100 /* Dump call graph node to file F. */
1101 void dump_graphviz (FILE *f
);
1103 /* Dump call graph node to stderr. */
1104 void DEBUG_FUNCTION
debug (void);
1106 /* When doing LTO, read cgraph_node's body from disk if it is not already
1108 bool get_untransformed_body (void);
1110 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
1111 if it is not already present. When some IPA transformations are scheduled,
1113 bool get_body (void);
1115 /* Release memory used to represent body of function.
1116 Use this only for functions that are released before being translated to
1117 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1118 are free'd in final.c via free_after_compilation(). */
1119 void release_body (bool keep_arguments
= false);
1121 /* Return the DECL_STRUCT_FUNCTION of the function. */
1122 struct function
*get_fun () const;
1124 /* cgraph_node is no longer nested function; update cgraph accordingly. */
1127 /* Bring cgraph node local. */
1128 void make_local (void);
1130 /* Likewise indicate that a node is having address taken. */
1131 void mark_address_taken (void);
1133 /* Set finalization priority to PRIORITY. */
1134 void set_fini_priority (priority_type priority
);
1136 /* Return the finalization priority. */
1137 priority_type
get_fini_priority (void);
1139 /* Create edge from a given function to CALLEE in the cgraph. */
1140 cgraph_edge
*create_edge (cgraph_node
*callee
,
1141 gcall
*call_stmt
, profile_count count
,
1142 bool cloning_p
= false);
1144 /* Create an indirect edge with a yet-undetermined callee where the call
1145 statement destination is a formal parameter of the caller with index
1147 cgraph_edge
*create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
1148 profile_count count
,
1149 bool cloning_p
= false);
1151 /* Like cgraph_create_edge walk the clone tree and update all clones sharing
1152 same function body. If clones already have edge for OLD_STMT; only
1153 update the edge same way as cgraph_set_call_stmt_including_clones does. */
1154 void create_edge_including_clones (cgraph_node
*callee
,
1155 gimple
*old_stmt
, gcall
*stmt
,
1156 profile_count count
,
1157 cgraph_inline_failed_t reason
);
1159 /* Return the callgraph edge representing the GIMPLE_CALL statement
1161 cgraph_edge
*get_edge (gimple
*call_stmt
);
1163 /* Collect all callers of cgraph_node and its aliases that are known to lead
1164 to NODE (i.e. are not overwritable) and that are not thunks. */
1165 vec
<cgraph_edge
*> collect_callers (void);
1167 /* Remove all callers from the node. */
1168 void remove_callers (void);
1170 /* Remove all callees from the node. */
1171 void remove_callees (void);
1173 /* Return function availability. See cgraph.h for description of individual
1175 enum availability
get_availability (symtab_node
*ref
= NULL
);
1177 /* Set TREE_NOTHROW on cgraph_node's decl and on aliases of the node
1178 if any to NOTHROW. */
1179 bool set_nothrow_flag (bool nothrow
);
1181 /* SET DECL_IS_MALLOC on cgraph_node's decl and on aliases of the node
1183 bool set_malloc_flag (bool malloc_p
);
1185 /* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
1186 If SET_CONST if false, clear the flag.
1188 When setting the flag be careful about possible interposition and
1189 do not set the flag for functions that can be interposed and set pure
1190 flag for functions that can bind to other definition.
1192 Return true if any change was done. */
1194 bool set_const_flag (bool set_const
, bool looping
);
1196 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
1199 When setting the flag, be careful about possible interposition.
1200 Return true if any change was done. */
1202 bool set_pure_flag (bool pure
, bool looping
);
1204 /* Call callback on function and aliases associated to the function.
1205 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
1208 bool call_for_symbol_and_aliases (bool (*callback
) (cgraph_node
*,
1210 void *data
, bool include_overwritable
);
1212 /* Call callback on cgraph_node, thunks and aliases associated to NODE.
1213 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
1214 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
1216 bool call_for_symbol_thunks_and_aliases (bool (*callback
) (cgraph_node
*node
,
1219 bool include_overwritable
,
1220 bool exclude_virtual_thunks
= false);
1222 /* Likewise indicate that a node is needed, i.e. reachable via some
1224 inline void mark_force_output (void);
1226 /* Return true when function can be marked local. */
1227 bool local_p (void);
1229 /* Return true if cgraph_node can be made local for API change.
1230 Extern inline functions and C++ COMDAT functions can be made local
1231 at the expense of possible code size growth if function is used in multiple
1232 compilation units. */
1233 bool can_be_local_p (void);
1235 /* Return true when cgraph_node cannot return or throw and thus
1236 it is safe to ignore its side effects for IPA analysis. */
1237 bool cannot_return_p (void);
1239 /* Return true when function cgraph_node and all its aliases are only called
1241 i.e. it is not externally visible, address was not taken and
1242 it is not used in any other non-standard way. */
1243 bool only_called_directly_p (void);
1245 /* Return true when function is only called directly or it has alias.
1246 i.e. it is not externally visible, address was not taken and
1247 it is not used in any other non-standard way. */
1248 inline bool only_called_directly_or_aliased_p (void);
1250 /* Return true when function cgraph_node can be expected to be removed
1251 from program when direct calls in this compilation unit are removed.
1253 As a special case COMDAT functions are
1254 cgraph_can_remove_if_no_direct_calls_p while the are not
1255 cgraph_only_called_directly_p (it is possible they are called from other
1258 This function behaves as cgraph_only_called_directly_p because eliminating
1259 all uses of COMDAT function does not make it necessarily disappear from
1260 the program unless we are compiling whole program or we do LTO. In this
1261 case we know we win since dynamic linking will not really discard the
1264 If WILL_INLINE is true, assume that function will be inlined into all the
1266 bool will_be_removed_from_program_if_no_direct_calls_p
1267 (bool will_inline
= false);
1269 /* Return true when function can be removed from callgraph
1270 if all direct calls and references are eliminated. The function does
1271 not take into account comdat groups. */
1272 bool can_remove_if_no_direct_calls_and_refs_p (void);
1274 /* Return true when function cgraph_node and its aliases can be removed from
1275 callgraph if all direct calls are eliminated.
1276 If WILL_INLINE is true, assume that function will be inlined into all the
1278 bool can_remove_if_no_direct_calls_p (bool will_inline
= false);
1280 /* Return true when callgraph node is a function with Gimple body defined
1281 in current unit. Functions can also be define externally or they
1282 can be thunks with no Gimple representation.
1284 Note that at WPA stage, the function body may not be present in memory. */
1285 inline bool has_gimple_body_p (void);
1287 /* Return true if this node represents a former, i.e. an expanded, thunk. */
1288 inline bool former_thunk_p (void);
1290 /* Return true if function should be optimized for size. */
1291 bool optimize_for_size_p (void);
1293 /* Dump the callgraph to file F. */
1294 static void dump_cgraph (FILE *f
);
1296 /* Dump the call graph to stderr. */
1298 void debug_cgraph (void)
1300 dump_cgraph (stderr
);
1303 /* Get unique identifier of the node. */
1304 inline int get_uid ()
1309 /* Get summary id of the node. */
1310 inline int get_summary_id ()
1312 return m_summary_id
;
1315 /* Record that DECL1 and DECL2 are semantically identical function
1317 static void record_function_versions (tree decl1
, tree decl2
);
1319 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
1320 DECL is a duplicate declaration. */
1321 static void delete_function_version_by_decl (tree decl
);
1323 /* Add the function FNDECL to the call graph.
1324 Unlike finalize_function, this function is intended to be used
1325 by middle end and allows insertion of new function at arbitrary point
1326 of compilation. The function can be either in high, low or SSA form
1329 The function is assumed to be reachable and have address taken (so no
1330 API breaking optimizations are performed on it).
1332 Main work done by this function is to enqueue the function for later
1333 processing to avoid need the passes to be re-entrant. */
1334 static void add_new_function (tree fndecl
, bool lowered
);
1336 /* Return callgraph node for given symbol and check it is a function. */
1337 static inline cgraph_node
*get (const_tree decl
)
1339 gcc_checking_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1340 return dyn_cast
<cgraph_node
*> (symtab_node::get (decl
));
1343 /* DECL has been parsed. Take it, queue it, compile it at the whim of the
1344 logic in effect. If NO_COLLECT is true, then our caller cannot stand to
1345 have the garbage collector run at the moment. We would need to either
1346 create a new GC context, or just not compile right now. */
1347 static void finalize_function (tree
, bool);
1349 /* Return cgraph node assigned to DECL. Create new one when needed. */
1350 static cgraph_node
* create (tree decl
);
1352 /* Try to find a call graph node for declaration DECL and if it does not
1353 exist or if it corresponds to an inline clone, create a new one. */
1354 static cgraph_node
* get_create (tree
);
1356 /* Return local info for the compiled function. */
1357 static cgraph_node
*local_info_node (tree decl
);
1359 /* Return RTL info for the compiled function. */
1360 static struct cgraph_rtl_info
*rtl_info (const_tree
);
1362 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
1363 Return NULL if there's no such node. */
1364 static cgraph_node
*get_for_asmname (tree asmname
);
1366 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if
1367 successful and NULL otherwise.
1368 Same body aliases are output whenever the body of DECL is output,
1369 and cgraph_node::get (ALIAS) transparently
1370 returns cgraph_node::get (DECL). */
1371 static cgraph_node
* create_same_body_alias (tree alias
, tree decl
);
1373 /* Verify whole cgraph structure. */
1374 static void DEBUG_FUNCTION
verify_cgraph_nodes (void);
1376 /* Verify cgraph, if consistency checking is enabled. */
1377 static inline void checking_verify_cgraph_nodes (void);
1379 /* Worker to bring NODE local. */
1380 static bool make_local (cgraph_node
*node
, void *);
1382 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
1383 the function body is associated
1384 with (not necessarily cgraph_node (DECL). */
1385 static cgraph_node
*create_alias (tree alias
, tree target
);
1387 /* Return true if NODE has thunk. */
1388 static bool has_thunk_p (cgraph_node
*node
, void *);
1390 cgraph_edge
*callees
;
1391 cgraph_edge
*callers
;
1392 /* List of edges representing indirect calls with a yet undetermined
1394 cgraph_edge
*indirect_calls
;
1395 /* For nested functions points to function the node is nested in. */
1396 cgraph_node
*origin
;
1397 /* Points to first nested function, if any. */
1398 cgraph_node
*nested
;
1399 /* Pointer to the next function with same origin, if any. */
1400 cgraph_node
*next_nested
;
1401 /* Pointer to the next clone. */
1402 cgraph_node
*next_sibling_clone
;
1403 cgraph_node
*prev_sibling_clone
;
1404 cgraph_node
*clones
;
1405 cgraph_node
*clone_of
;
1406 /* For functions with many calls sites it holds map from call expression
1407 to the edge to speed up cgraph_edge function. */
1408 hash_table
<cgraph_edge_hasher
> *GTY(()) call_site_hash
;
1409 /* Declaration node used to be clone of. */
1410 tree former_clone_of
;
1412 /* If this is a SIMD clone, this points to the SIMD specific
1413 information for it. */
1414 cgraph_simd_clone
*simdclone
;
1415 /* If this function has SIMD clones, this points to the first clone. */
1416 cgraph_node
*simd_clones
;
1418 /* Interprocedural passes scheduled to have their transform functions
1419 applied next time we execute local pass on them. We maintain it
1420 per-function in order to allow IPA passes to introduce new functions. */
1421 vec
<ipa_opt_pass
> GTY((skip
)) ipa_transforms_to_apply
;
1423 /* For inline clones this points to the function they will be
1425 cgraph_node
*inlined_to
;
1427 struct cgraph_rtl_info
*rtl
;
1428 cgraph_clone_info clone
;
1429 cgraph_thunk_info thunk
;
1431 /* Expected number of executions: calculated in profile.c. */
1432 profile_count count
;
1433 /* Time profiler: first run of function. */
1434 gcov_type tp_first_run
;
1435 /* How to scale counts at materialization time; used to merge
1436 LTO units with different number of profile runs. */
1437 int count_materialization_scale
;
1438 /* ID assigned by the profiling. */
1439 unsigned int profile_id
;
1440 /* ID of the translation unit. */
1443 /* Set when decl is an abstract function pointed to by the
1444 ABSTRACT_DECL_ORIGIN of a reachable function. */
1445 unsigned used_as_abstract_origin
: 1;
1446 /* Set once the function is lowered (i.e. its CFG is built). */
1447 unsigned lowered
: 1;
1448 /* Set once the function has been instantiated and its callee
1450 unsigned process
: 1;
1451 /* How commonly executed the node is. Initialized during branch
1452 probabilities pass. */
1453 ENUM_BITFIELD (node_frequency
) frequency
: 2;
1454 /* True when function can only be called at startup (from static ctor). */
1455 unsigned only_called_at_startup
: 1;
1456 /* True when function can only be called at startup (from static dtor). */
1457 unsigned only_called_at_exit
: 1;
1458 /* True when function is the transactional clone of a function which
1459 is called only from inside transactions. */
1460 /* ?? We should be able to remove this. We have enough bits in
1461 cgraph to calculate it. */
1462 unsigned tm_clone
: 1;
1463 /* True if this decl is a dispatcher for function versions. */
1464 unsigned dispatcher_function
: 1;
1465 /* True if this decl calls a COMDAT-local function. This is set up in
1466 compute_fn_summary and inline_call. */
1467 unsigned calls_comdat_local
: 1;
1468 /* True if node has been created by merge operation in IPA-ICF. */
1469 unsigned icf_merged
: 1;
1470 /* True if call to node can't result in a call to free, munmap or
1471 other operation that could make previously non-trapping memory
1472 accesses trapping. */
1473 unsigned nonfreeing_fn
: 1;
1474 /* True if there was multiple COMDAT bodies merged by lto-symtab. */
1475 unsigned merged_comdat
: 1;
1476 /* True if this def was merged with extern inlines. */
1477 unsigned merged_extern_inline
: 1;
1478 /* True if function was created to be executed in parallel. */
1479 unsigned parallelized_function
: 1;
1480 /* True if function is part split out by ipa-split. */
1481 unsigned split_part
: 1;
1482 /* True if the function appears as possible target of indirect call. */
1483 unsigned indirect_call_target
: 1;
1484 /* Set when function is visible in current compilation unit only and
1485 its address is never taken. */
1487 /* False when there is something makes versioning impossible. */
1488 unsigned versionable
: 1;
1489 /* False when function calling convention and signature cannot be changed.
1490 This is the case when __builtin_apply_args is used. */
1491 unsigned can_change_signature
: 1;
1492 /* True when the function has been originally extern inline, but it is
1494 unsigned redefined_extern_inline
: 1;
1495 /* True if the function may enter serial irrevocable mode. */
1496 unsigned tm_may_enter_irr
: 1;
1497 /* True if this was a clone created by ipa-cp. */
1498 unsigned ipcp_clone
: 1;
1501 /* Unique id of the node. */
1504 /* Summary id that is recycled. */
1507 /* Worker for call_for_symbol_and_aliases. */
1508 bool call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
1510 void *data
, bool include_overwritable
);
1513 /* A cgraph node set is a collection of cgraph nodes. A cgraph node
1514 can appear in multiple sets. */
1515 struct cgraph_node_set_def
1517 hash_map
<cgraph_node
*, size_t> *map
;
1518 vec
<cgraph_node
*> nodes
;
1521 typedef cgraph_node_set_def
*cgraph_node_set
;
1522 typedef struct varpool_node_set_def
*varpool_node_set
;
1524 struct varpool_node
;
1526 /* A varpool node set is a collection of varpool nodes. A varpool node
1527 can appear in multiple sets. */
1528 struct varpool_node_set_def
1530 hash_map
<varpool_node
*, size_t> * map
;
1531 vec
<varpool_node
*> nodes
;
1534 /* Iterator structure for cgraph node sets. */
1535 struct cgraph_node_set_iterator
1537 cgraph_node_set set
;
1541 /* Iterator structure for varpool node sets. */
1542 struct varpool_node_set_iterator
1544 varpool_node_set set
;
1548 /* Context of polymorphic call. It represent information about the type of
1549 instance that may reach the call. This is used by ipa-devirt walkers of the
1550 type inheritance graph. */
1552 class GTY(()) ipa_polymorphic_call_context
{
1554 /* The called object appears in an object of type OUTER_TYPE
1555 at offset OFFSET. When information is not 100% reliable, we
1556 use SPECULATIVE_OUTER_TYPE and SPECULATIVE_OFFSET. */
1557 HOST_WIDE_INT offset
;
1558 HOST_WIDE_INT speculative_offset
;
1560 tree speculative_outer_type
;
1561 /* True if outer object may be in construction or destruction. */
1562 unsigned maybe_in_construction
: 1;
1563 /* True if outer object may be of derived type. */
1564 unsigned maybe_derived_type
: 1;
1565 /* True if speculative outer object may be of derived type. We always
1566 speculate that construction does not happen. */
1567 unsigned speculative_maybe_derived_type
: 1;
1568 /* True if the context is invalid and all calls should be redirected
1569 to BUILTIN_UNREACHABLE. */
1570 unsigned invalid
: 1;
1571 /* True if the outer type is dynamic. */
1572 unsigned dynamic
: 1;
1574 /* Build empty "I know nothing" context. */
1575 ipa_polymorphic_call_context ();
1576 /* Build polymorphic call context for indirect call E. */
1577 ipa_polymorphic_call_context (cgraph_edge
*e
);
1578 /* Build polymorphic call context for IP invariant CST.
1579 If specified, OTR_TYPE specify the type of polymorphic call
1580 that takes CST+OFFSET as a parameter. */
1581 ipa_polymorphic_call_context (tree cst
, tree otr_type
= NULL
,
1582 HOST_WIDE_INT offset
= 0);
1583 /* Build context for pointer REF contained in FNDECL at statement STMT.
1584 if INSTANCE is non-NULL, return pointer to the object described by
1586 ipa_polymorphic_call_context (tree fndecl
, tree ref
, gimple
*stmt
,
1587 tree
*instance
= NULL
);
1589 /* Look for vtable stores or constructor calls to work out dynamic type
1590 of memory location. */
1591 bool get_dynamic_type (tree
, tree
, tree
, gimple
*, unsigned *);
1593 /* Make context non-speculative. */
1594 void clear_speculation ();
1596 /* Produce context specifying all derived types of OTR_TYPE. If OTR_TYPE is
1597 NULL, the context is set to dummy "I know nothing" setting. */
1598 void clear_outer_type (tree otr_type
= NULL
);
1600 /* Walk container types and modify context to point to actual class
1601 containing OTR_TYPE (if non-NULL) as base class.
1602 Return true if resulting context is valid.
1604 When CONSIDER_PLACEMENT_NEW is false, reject contexts that may be made
1605 valid only via allocation of new polymorphic type inside by means
1608 When CONSIDER_BASES is false, only look for actual fields, not base types
1610 bool restrict_to_inner_class (tree otr_type
,
1611 bool consider_placement_new
= true,
1612 bool consider_bases
= true);
1614 /* Adjust all offsets in contexts by given number of bits. */
1615 void offset_by (HOST_WIDE_INT
);
1616 /* Use when we cannot track dynamic type change. This speculatively assume
1617 type change is not happening. */
1618 void possible_dynamic_type_change (bool, tree otr_type
= NULL
);
1619 /* Assume that both THIS and a given context is valid and strengthen THIS
1620 if possible. Return true if any strengthening was made.
1621 If actual type the context is being used in is known, OTR_TYPE should be
1622 set accordingly. This improves quality of combined result. */
1623 bool combine_with (ipa_polymorphic_call_context
, tree otr_type
= NULL
);
1624 bool meet_with (ipa_polymorphic_call_context
, tree otr_type
= NULL
);
1626 /* Return TRUE if context is fully useless. */
1627 bool useless_p () const;
1628 /* Return TRUE if this context conveys the same information as X. */
1629 bool equal_to (const ipa_polymorphic_call_context
&x
) const;
1631 /* Dump human readable context to F. If NEWLINE is true, it will be
1632 terminated by a newline. */
1633 void dump (FILE *f
, bool newline
= true) const;
1634 void DEBUG_FUNCTION
debug () const;
1636 /* LTO streaming. */
1637 void stream_out (struct output_block
*) const;
1638 void stream_in (class lto_input_block
*, class data_in
*data_in
);
1641 bool combine_speculation_with (tree
, HOST_WIDE_INT
, bool, tree
);
1642 bool meet_speculation_with (tree
, HOST_WIDE_INT
, bool, tree
);
1643 void set_by_decl (tree
, HOST_WIDE_INT
);
1644 bool set_by_invariant (tree
, tree
, HOST_WIDE_INT
);
1645 bool speculation_consistent_p (tree
, HOST_WIDE_INT
, bool, tree
) const;
1646 void make_speculative (tree otr_type
= NULL
);
1649 /* Structure containing additional information about an indirect call. */
1651 class GTY(()) cgraph_indirect_call_info
1654 /* When agg_content is set, an offset where the call pointer is located
1655 within the aggregate. */
1656 HOST_WIDE_INT offset
;
1657 /* Context of the polymorphic call; use only when POLYMORPHIC flag is set. */
1658 ipa_polymorphic_call_context context
;
1659 /* OBJ_TYPE_REF_TOKEN of a polymorphic call (if polymorphic is set). */
1660 HOST_WIDE_INT otr_token
;
1661 /* Type of the object from OBJ_TYPE_REF_OBJECT. */
1663 /* Index of the parameter that is called. */
1665 /* ECF flags determined from the caller. */
1667 /* Profile_id of common target obtained from profile. */
1668 int common_target_id
;
1669 /* Probability that call will land in function with COMMON_TARGET_ID. */
1670 int common_target_probability
;
1672 /* Set when the call is a virtual call with the parameter being the
1673 associated object pointer rather than a simple direct call. */
1674 unsigned polymorphic
: 1;
1675 /* Set when the call is a call of a pointer loaded from contents of an
1676 aggregate at offset. */
1677 unsigned agg_contents
: 1;
1678 /* Set when this is a call through a member pointer. */
1679 unsigned member_ptr
: 1;
1680 /* When the agg_contents bit is set, this one determines whether the
1681 destination is loaded from a parameter passed by reference. */
1682 unsigned by_ref
: 1;
1683 /* When the agg_contents bit is set, this one determines whether we can
1684 deduce from the function body that the loaded value from the reference is
1685 never modified between the invocation of the function and the load
1687 unsigned guaranteed_unmodified
: 1;
1688 /* For polymorphic calls this specify whether the virtual table pointer
1689 may have changed in between function entry and the call. */
1690 unsigned vptr_changed
: 1;
1693 class GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"),
1694 for_user
)) cgraph_edge
1697 friend struct cgraph_node
;
1698 friend class symbol_table
;
1700 /* Remove the edge in the cgraph. */
1703 /* Change field call_stmt of edge to NEW_STMT.
1704 If UPDATE_SPECULATIVE and E is any component of speculative
1705 edge, then update all components. */
1706 void set_call_stmt (gcall
*new_stmt
, bool update_speculative
= true);
1708 /* Redirect callee of the edge to N. The function does not update underlying
1710 void redirect_callee (cgraph_node
*n
);
1712 /* If the edge does not lead to a thunk, simply redirect it to N. Otherwise
1713 create one or more equivalent thunks for N and redirect E to the first in
1714 the chain. Note that it is then necessary to call
1715 n->expand_all_artificial_thunks once all callers are redirected. */
1716 void redirect_callee_duplicating_thunks (cgraph_node
*n
);
1718 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1719 CALLEE. DELTA is an integer constant that is to be added to the this
1720 pointer (first parameter) to compensate for skipping
1721 a thunk adjustment. */
1722 cgraph_edge
*make_direct (cgraph_node
*callee
);
1724 /* Turn edge into speculative call calling N2. Update
1725 the profile so the direct call is taken COUNT times
1727 cgraph_edge
*make_speculative (cgraph_node
*n2
, profile_count direct_count
);
1729 /* Given speculative call edge, return all three components. */
1730 void speculative_call_info (cgraph_edge
*&direct
, cgraph_edge
*&indirect
,
1731 ipa_ref
*&reference
);
1733 /* Speculative call edge turned out to be direct call to CALLEE_DECL.
1734 Remove the speculative call sequence and return edge representing the call.
1735 It is up to caller to redirect the call as appropriate. */
1736 cgraph_edge
*resolve_speculation (tree callee_decl
= NULL
);
1738 /* If necessary, change the function declaration in the call statement
1739 associated with the edge so that it corresponds to the edge callee. */
1740 gimple
*redirect_call_stmt_to_callee (void);
1742 /* Create clone of edge in the node N represented
1743 by CALL_EXPR the callgraph. */
1744 cgraph_edge
* clone (cgraph_node
*n
, gcall
*call_stmt
, unsigned stmt_uid
,
1745 profile_count num
, profile_count den
,
1746 bool update_original
);
1748 /* Verify edge count and frequency. */
1749 bool verify_count ();
1751 /* Return true when call of edge cannot lead to return from caller
1752 and thus it is safe to ignore its side effects for IPA analysis
1753 when computing side effects of the caller. */
1754 bool cannot_lead_to_return_p (void);
1756 /* Return true when the edge represents a direct recursion. */
1757 bool recursive_p (void);
1759 /* Return true if the edge may be considered hot. */
1760 bool maybe_hot_p (void);
1762 /* Get unique identifier of the edge. */
1763 inline int get_uid ()
1768 /* Get summary id of the edge. */
1769 inline int get_summary_id ()
1771 return m_summary_id
;
1774 /* Rebuild cgraph edges for current function node. This needs to be run after
1775 passes that don't update the cgraph. */
1776 static unsigned int rebuild_edges (void);
1778 /* Rebuild cgraph references for current function node. This needs to be run
1779 after passes that don't update the cgraph. */
1780 static void rebuild_references (void);
1782 /* During LTO stream in this can be used to check whether call can possibly
1783 be internal to the current translation unit. */
1784 bool possibly_call_in_translation_unit_p (void);
1786 /* Expected number of executions: calculated in profile.c. */
1787 profile_count count
;
1788 cgraph_node
*caller
;
1789 cgraph_node
*callee
;
1790 cgraph_edge
*prev_caller
;
1791 cgraph_edge
*next_caller
;
1792 cgraph_edge
*prev_callee
;
1793 cgraph_edge
*next_callee
;
1795 /* Additional information about an indirect call. Not cleared when an edge
1797 cgraph_indirect_call_info
*indirect_info
;
1798 PTR
GTY ((skip (""))) aux
;
1799 /* When equal to CIF_OK, inline this call. Otherwise, points to the
1800 explanation why function was not inlined. */
1801 enum cgraph_inline_failed_t inline_failed
;
1802 /* The stmt_uid of call_stmt. This is used by LTO to recover the call_stmt
1803 when the function is serialized in. */
1804 unsigned int lto_stmt_uid
;
1805 /* Whether this edge was made direct by indirect inlining. */
1806 unsigned int indirect_inlining_edge
: 1;
1807 /* Whether this edge describes an indirect call with an undetermined
1809 unsigned int indirect_unknown_callee
: 1;
1810 /* Whether this edge is still a dangling */
1811 /* True if the corresponding CALL stmt cannot be inlined. */
1812 unsigned int call_stmt_cannot_inline_p
: 1;
1813 /* Can this call throw externally? */
1814 unsigned int can_throw_external
: 1;
1815 /* Edges with SPECULATIVE flag represents indirect calls that was
1816 speculatively turned into direct (i.e. by profile feedback).
1817 The final code sequence will have form:
1819 if (call_target == expected_fn)
1824 Every speculative call is represented by three components attached
1825 to a same call statement:
1826 1) a direct call (to expected_fn)
1827 2) an indirect call (to call_target)
1828 3) a IPA_REF_ADDR reference to expected_fn.
1830 Optimizers may later redirect direct call to clone, so 1) and 3)
1831 do not need to necessarily agree with destination. */
1832 unsigned int speculative
: 1;
1833 /* Set to true when caller is a constructor or destructor of polymorphic
1835 unsigned in_polymorphic_cdtor
: 1;
1837 /* Return true if call must bind to current definition. */
1838 bool binds_to_current_def_p ();
1840 /* Expected frequency of executions within the function.
1841 When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
1842 per function call. The range is 0 to CGRAPH_FREQ_MAX. */
1845 /* Expected frequency of executions within the function. */
1846 sreal
sreal_frequency ();
1848 /* Unique id of the edge. */
1851 /* Summary id that is recycled. */
1854 /* Remove the edge from the list of the callers of the callee. */
1855 void remove_caller (void);
1857 /* Remove the edge from the list of the callees of the caller. */
1858 void remove_callee (void);
1860 /* Set callee N of call graph edge and add it to the corresponding set of
1862 void set_callee (cgraph_node
*n
);
1864 /* Output flags of edge to a file F. */
1865 void dump_edge_flags (FILE *f
);
1867 /* Verify that call graph edge corresponds to DECL from the associated
1868 statement. Return true if the verification should fail. */
1869 bool verify_corresponds_to_fndecl (tree decl
);
1872 #define CGRAPH_FREQ_BASE 1000
1873 #define CGRAPH_FREQ_MAX 100000
1875 /* The varpool data structure.
1876 Each static variable decl has assigned varpool_node. */
1878 struct GTY((tag ("SYMTAB_VARIABLE"))) varpool_node
: public symtab_node
1880 /* Dump given varpool node to F. */
1881 void dump (FILE *f
);
1883 /* Dump given varpool node to stderr. */
1884 void DEBUG_FUNCTION
debug (void);
1886 /* Remove variable from symbol table. */
1889 /* Remove node initializer when it is no longer needed. */
1890 void remove_initializer (void);
1892 void analyze (void);
1894 /* Return variable availability. */
1895 availability
get_availability (symtab_node
*ref
= NULL
);
1897 /* When doing LTO, read variable's constructor from disk if
1898 it is not already present. */
1899 tree
get_constructor (void);
1901 /* Return true if variable has constructor that can be used for folding. */
1902 bool ctor_useable_for_folding_p (void);
1904 /* For given variable pool node, walk the alias chain to return the function
1905 the variable is alias of. Do not walk through thunks.
1906 When AVAILABILITY is non-NULL, get minimal availability in the chain.
1907 When REF is non-NULL, assume that reference happens in symbol REF
1908 when determining the availability. */
1909 inline varpool_node
*ultimate_alias_target
1910 (availability
*availability
= NULL
, symtab_node
*ref
= NULL
);
1912 /* Return node that alias is aliasing. */
1913 inline varpool_node
*get_alias_target (void);
1915 /* Output one variable, if necessary. Return whether we output it. */
1916 bool assemble_decl (void);
1918 /* For variables in named sections make sure get_variable_section
1919 is called before we switch to those sections. Then section
1920 conflicts between read-only and read-only requiring relocations
1921 sections can be resolved. */
1922 void finalize_named_section_flags (void);
1924 /* Call callback on varpool symbol and aliases associated to varpool symbol.
1925 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
1927 bool call_for_symbol_and_aliases (bool (*callback
) (varpool_node
*, void *),
1929 bool include_overwritable
);
1931 /* Return true when variable should be considered externally visible. */
1932 bool externally_visible_p (void);
1934 /* Return true when all references to variable must be visible
1936 i.e. if the variable is not externally visible or not used in some magic
1937 way (asm statement or such).
1938 The magic uses are all summarized in force_output flag. */
1939 inline bool all_refs_explicit_p ();
1941 /* Return true when variable can be removed from variable pool
1942 if all direct calls are eliminated. */
1943 inline bool can_remove_if_no_refs_p (void);
1945 /* Add the variable DECL to the varpool.
1946 Unlike finalize_decl function is intended to be used
1947 by middle end and allows insertion of new variable at arbitrary point
1949 static void add (tree decl
);
1951 /* Return varpool node for given symbol and check it is a function. */
1952 static inline varpool_node
*get (const_tree decl
);
1954 /* Mark DECL as finalized. By finalizing the declaration, frontend instruct
1955 the middle end to output the variable to asm file, if needed or externally
1957 static void finalize_decl (tree decl
);
1959 /* Attempt to mark ALIAS as an alias to DECL. Return TRUE if successful.
1960 Extra name aliases are output whenever DECL is output. */
1961 static varpool_node
* create_extra_name_alias (tree alias
, tree decl
);
1963 /* Attempt to mark ALIAS as an alias to DECL. Return TRUE if successful.
1964 Extra name aliases are output whenever DECL is output. */
1965 static varpool_node
* create_alias (tree
, tree
);
1967 /* Dump the variable pool to F. */
1968 static void dump_varpool (FILE *f
);
1970 /* Dump the variable pool to stderr. */
1971 static void DEBUG_FUNCTION
debug_varpool (void);
1973 /* Allocate new callgraph node and insert it into basic data structures. */
1974 static varpool_node
*create_empty (void);
1976 /* Return varpool node assigned to DECL. Create new one when needed. */
1977 static varpool_node
*get_create (tree decl
);
1979 /* Given an assembler name, lookup node. */
1980 static varpool_node
*get_for_asmname (tree asmname
);
1982 /* Set when variable is scheduled to be assembled. */
1983 unsigned output
: 1;
1985 /* Set if the variable is dynamically initialized, except for
1986 function local statics. */
1987 unsigned dynamically_initialized
: 1;
1989 ENUM_BITFIELD(tls_model
) tls_model
: 3;
1991 /* Set if the variable is known to be used by single function only.
1992 This is computed by ipa_single_use pass and used by late optimizations
1993 in places where optimization would be valid for local static variable
1994 if we did not do any inter-procedural code movement. */
1995 unsigned used_by_single_function
: 1;
1998 /* Assemble thunks and aliases associated to varpool node. */
1999 void assemble_aliases (void);
2001 /* Worker for call_for_node_and_aliases. */
2002 bool call_for_symbol_and_aliases_1 (bool (*callback
) (varpool_node
*, void *),
2004 bool include_overwritable
);
2007 /* Every top level asm statement is put into a asm_node. */
2009 struct GTY(()) asm_node
{
2012 /* Next asm node. */
2014 /* String for this asm node. */
2016 /* Ordering of all cgraph nodes. */
2020 /* Report whether or not THIS symtab node is a function, aka cgraph_node. */
2025 is_a_helper
<cgraph_node
*>::test (symtab_node
*p
)
2027 return p
&& p
->type
== SYMTAB_FUNCTION
;
2030 /* Report whether or not THIS symtab node is a variable, aka varpool_node. */
2035 is_a_helper
<varpool_node
*>::test (symtab_node
*p
)
2037 return p
&& p
->type
== SYMTAB_VARIABLE
;
2040 typedef void (*cgraph_edge_hook
)(cgraph_edge
*, void *);
2041 typedef void (*cgraph_node_hook
)(cgraph_node
*, void *);
2042 typedef void (*varpool_node_hook
)(varpool_node
*, void *);
2043 typedef void (*cgraph_2edge_hook
)(cgraph_edge
*, cgraph_edge
*, void *);
2044 typedef void (*cgraph_2node_hook
)(cgraph_node
*, cgraph_node
*, void *);
2046 struct cgraph_edge_hook_list
;
2047 struct cgraph_node_hook_list
;
2048 struct varpool_node_hook_list
;
2049 struct cgraph_2edge_hook_list
;
2050 struct cgraph_2node_hook_list
;
2052 /* Map from a symbol to initialization/finalization priorities. */
2053 struct GTY(()) symbol_priority_map
{
2060 /* Frontend is parsing and finalizing functions. */
2062 /* Callgraph is being constructed. It is safe to add new functions. */
2064 /* Callgraph is being streamed-in at LTO time. */
2066 /* Callgraph is built and early IPA passes are being run. */
2068 /* Callgraph is built and all functions are transformed to SSA form. */
2070 /* All inline decisions are done; it is now possible to remove extern inline
2071 functions and virtual call targets. */
2072 IPA_SSA_AFTER_INLINING
,
2073 /* Functions are now ordered and being passed to RTL expanders. */
2075 /* All cgraph expansion is done. */
2079 struct asmname_hasher
: ggc_ptr_hash
<symtab_node
>
2081 typedef const_tree compare_type
;
2083 static hashval_t
hash (symtab_node
*n
);
2084 static bool equal (symtab_node
*n
, const_tree t
);
2087 class GTY((tag ("SYMTAB"))) symbol_table
2090 friend struct symtab_node
;
2091 friend struct cgraph_node
;
2092 friend struct cgraph_edge
;
2095 cgraph_count (0), cgraph_max_uid (1), cgraph_max_summary_id (0),
2096 edges_count (0), edges_max_uid (1), edges_max_summary_id (0),
2097 cgraph_released_summary_ids (), edge_released_summary_ids (),
2098 nodes (NULL
), asmnodes (NULL
), asm_last_node (NULL
),
2099 order (0), max_unit (0), global_info_ready (false), state (PARSING
),
2100 function_flags_ready (false), cpp_implicit_aliases_done (false),
2101 section_hash (NULL
), assembler_name_hash (NULL
), init_priority_hash (NULL
),
2102 dump_file (NULL
), ipa_clones_dump_file (NULL
), cloned_nodes (),
2103 m_first_edge_removal_hook (NULL
), m_first_cgraph_removal_hook (NULL
),
2104 m_first_edge_duplicated_hook (NULL
), m_first_cgraph_duplicated_hook (NULL
),
2105 m_first_cgraph_insertion_hook (NULL
), m_first_varpool_insertion_hook (NULL
),
2106 m_first_varpool_removal_hook (NULL
)
2110 /* Initialize callgraph dump file. */
2111 void initialize (void);
2113 /* Register a top-level asm statement ASM_STR. */
2114 inline asm_node
*finalize_toplevel_asm (tree asm_str
);
2116 /* Analyze the whole compilation unit once it is parsed completely. */
2117 void finalize_compilation_unit (void);
2119 /* C++ frontend produce same body aliases all over the place, even before PCH
2120 gets streamed out. It relies on us linking the aliases with their function
2121 in order to do the fixups, but ipa-ref is not PCH safe. Consequently we
2122 first produce aliases without links, but once C++ FE is sure it won't
2123 stream PCH we build the links via this function. */
2124 void process_same_body_aliases (void);
2126 /* Perform simple optimizations based on callgraph. */
2127 void compile (void);
2129 /* Process CGRAPH_NEW_FUNCTIONS and perform actions necessary to add these
2130 functions into callgraph in a way so they look like ordinary reachable
2131 functions inserted into callgraph already at construction time. */
2132 void process_new_functions (void);
2134 /* Once all functions from compilation unit are in memory, produce all clones
2135 and update all calls. We might also do this on demand if we don't want to
2136 bring all functions to memory prior compilation, but current WHOPR
2137 implementation does that and it is bit easier to keep everything right
2139 void materialize_all_clones (void);
2141 /* Register a symbol NODE. */
2142 inline void register_symbol (symtab_node
*node
);
2145 clear_asm_symbols (void)
2148 asm_last_node
= NULL
;
2151 /* Perform reachability analysis and reclaim all unreachable nodes. */
2152 bool remove_unreachable_nodes (FILE *file
);
2154 /* Optimization of function bodies might've rendered some variables as
2155 unnecessary so we want to avoid these from being compiled. Re-do
2156 reachability starting from variables that are either externally visible
2157 or was referred from the asm output routines. */
2158 void remove_unreferenced_decls (void);
2160 /* Unregister a symbol NODE. */
2161 inline void unregister (symtab_node
*node
);
2163 /* Allocate new callgraph node and insert it into basic data structures. */
2164 cgraph_node
*create_empty (void);
2166 /* Release a callgraph NODE. */
2167 void release_symbol (cgraph_node
*node
);
2169 /* Output all variables enqueued to be assembled. */
2170 bool output_variables (void);
2172 /* Weakrefs may be associated to external decls and thus not output
2173 at expansion time. Emit all necessary aliases. */
2174 void output_weakrefs (void);
2176 /* Return first static symbol with definition. */
2177 inline symtab_node
*first_symbol (void);
2179 /* Return first assembler symbol. */
2181 first_asm_symbol (void)
2186 /* Return first static symbol with definition. */
2187 inline symtab_node
*first_defined_symbol (void);
2189 /* Return first variable. */
2190 inline varpool_node
*first_variable (void);
2192 /* Return next variable after NODE. */
2193 inline varpool_node
*next_variable (varpool_node
*node
);
2195 /* Return first static variable with initializer. */
2196 inline varpool_node
*first_static_initializer (void);
2198 /* Return next static variable with initializer after NODE. */
2199 inline varpool_node
*next_static_initializer (varpool_node
*node
);
2201 /* Return first static variable with definition. */
2202 inline varpool_node
*first_defined_variable (void);
2204 /* Return next static variable with definition after NODE. */
2205 inline varpool_node
*next_defined_variable (varpool_node
*node
);
2207 /* Return first function with body defined. */
2208 inline cgraph_node
*first_defined_function (void);
2210 /* Return next function with body defined after NODE. */
2211 inline cgraph_node
*next_defined_function (cgraph_node
*node
);
2213 /* Return first function. */
2214 inline cgraph_node
*first_function (void);
2216 /* Return next function. */
2217 inline cgraph_node
*next_function (cgraph_node
*node
);
2219 /* Return first function with body defined. */
2220 cgraph_node
*first_function_with_gimple_body (void);
2222 /* Return next reachable static variable with initializer after NODE. */
2223 inline cgraph_node
*next_function_with_gimple_body (cgraph_node
*node
);
2225 /* Register HOOK to be called with DATA on each removed edge. */
2226 cgraph_edge_hook_list
*add_edge_removal_hook (cgraph_edge_hook hook
,
2229 /* Remove ENTRY from the list of hooks called on removing edges. */
2230 void remove_edge_removal_hook (cgraph_edge_hook_list
*entry
);
2232 /* Register HOOK to be called with DATA on each removed node. */
2233 cgraph_node_hook_list
*add_cgraph_removal_hook (cgraph_node_hook hook
,
2236 /* Remove ENTRY from the list of hooks called on removing nodes. */
2237 void remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
);
2239 /* Register HOOK to be called with DATA on each removed node. */
2240 varpool_node_hook_list
*add_varpool_removal_hook (varpool_node_hook hook
,
2243 /* Remove ENTRY from the list of hooks called on removing nodes. */
2244 void remove_varpool_removal_hook (varpool_node_hook_list
*entry
);
2246 /* Register HOOK to be called with DATA on each inserted node. */
2247 cgraph_node_hook_list
*add_cgraph_insertion_hook (cgraph_node_hook hook
,
2250 /* Remove ENTRY from the list of hooks called on inserted nodes. */
2251 void remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
);
2253 /* Register HOOK to be called with DATA on each inserted node. */
2254 varpool_node_hook_list
*add_varpool_insertion_hook (varpool_node_hook hook
,
2257 /* Remove ENTRY from the list of hooks called on inserted nodes. */
2258 void remove_varpool_insertion_hook (varpool_node_hook_list
*entry
);
2260 /* Register HOOK to be called with DATA on each duplicated edge. */
2261 cgraph_2edge_hook_list
*add_edge_duplication_hook (cgraph_2edge_hook hook
,
2263 /* Remove ENTRY from the list of hooks called on duplicating edges. */
2264 void remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
);
2266 /* Register HOOK to be called with DATA on each duplicated node. */
2267 cgraph_2node_hook_list
*add_cgraph_duplication_hook (cgraph_2node_hook hook
,
2270 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
2271 void remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
);
2273 /* Call all edge removal hooks. */
2274 void call_edge_removal_hooks (cgraph_edge
*e
);
2276 /* Call all node insertion hooks. */
2277 void call_cgraph_insertion_hooks (cgraph_node
*node
);
2279 /* Call all node removal hooks. */
2280 void call_cgraph_removal_hooks (cgraph_node
*node
);
2282 /* Call all node duplication hooks. */
2283 void call_cgraph_duplication_hooks (cgraph_node
*node
, cgraph_node
*node2
);
2285 /* Call all edge duplication hooks. */
2286 void call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
);
2288 /* Call all node removal hooks. */
2289 void call_varpool_removal_hooks (varpool_node
*node
);
2291 /* Call all node insertion hooks. */
2292 void call_varpool_insertion_hooks (varpool_node
*node
);
2294 /* Arrange node to be first in its entry of assembler_name_hash. */
2295 void symtab_prevail_in_asm_name_hash (symtab_node
*node
);
2297 /* Initialize asm name hash unless. */
2298 void symtab_initialize_asm_name_hash (void);
2300 /* Set the DECL_ASSEMBLER_NAME and update symtab hashtables. */
2301 void change_decl_assembler_name (tree decl
, tree name
);
2303 /* Dump symbol table to F. */
2304 void dump (FILE *f
);
2306 /* Dump symbol table to F in graphviz format. */
2307 void dump_graphviz (FILE *f
);
2309 /* Dump symbol table to stderr. */
2310 void DEBUG_FUNCTION
debug (void);
2312 /* Assign a new summary ID for the callgraph NODE. */
2313 inline int assign_summary_id (cgraph_node
*node
)
2315 if (!cgraph_released_summary_ids
.is_empty ())
2316 node
->m_summary_id
= cgraph_released_summary_ids
.pop ();
2318 node
->m_summary_id
= cgraph_max_summary_id
++;
2320 return node
->m_summary_id
;
2323 /* Assign a new summary ID for the callgraph EDGE. */
2324 inline int assign_summary_id (cgraph_edge
*edge
)
2326 if (!edge_released_summary_ids
.is_empty ())
2327 edge
->m_summary_id
= edge_released_summary_ids
.pop ();
2329 edge
->m_summary_id
= edges_max_summary_id
++;
2331 return edge
->m_summary_id
;
2334 /* Return true if assembler names NAME1 and NAME2 leads to the same symbol
2336 static bool assembler_names_equal_p (const char *name1
, const char *name2
);
2340 int cgraph_max_summary_id
;
2344 int edges_max_summary_id
;
2346 /* Vector of released summary IDS for cgraph nodes. */
2347 vec
<int> GTY ((skip
)) cgraph_released_summary_ids
;
2349 /* Vector of released summary IDS for cgraph nodes. */
2350 vec
<int> GTY ((skip
)) edge_released_summary_ids
;
2352 /* Return symbol used to separate symbol name from suffix. */
2353 static char symbol_suffix_separator ();
2355 symtab_node
* GTY(()) nodes
;
2356 asm_node
* GTY(()) asmnodes
;
2357 asm_node
* GTY(()) asm_last_node
;
2359 /* The order index of the next symtab node to be created. This is
2360 used so that we can sort the cgraph nodes in order by when we saw
2361 them, to support -fno-toplevel-reorder. */
2364 /* Maximal unit ID used. */
2367 /* Set when whole unit has been analyzed so we can access global info. */
2368 bool global_info_ready
;
2369 /* What state callgraph is in right now. */
2370 enum symtab_state state
;
2371 /* Set when the cgraph is fully build and the basic flags are computed. */
2372 bool function_flags_ready
;
2374 bool cpp_implicit_aliases_done
;
2376 /* Hash table used to hold sections. */
2377 hash_table
<section_name_hasher
> *GTY(()) section_hash
;
2379 /* Hash table used to convert assembler names into nodes. */
2380 hash_table
<asmname_hasher
> *assembler_name_hash
;
2382 /* Hash table used to hold init priorities. */
2383 hash_map
<symtab_node
*, symbol_priority_map
> *init_priority_hash
;
2385 FILE* GTY ((skip
)) dump_file
;
2387 FILE* GTY ((skip
)) ipa_clones_dump_file
;
2389 hash_set
<const cgraph_node
*> GTY ((skip
)) cloned_nodes
;
2392 /* Allocate new callgraph node. */
2393 inline cgraph_node
* allocate_cgraph_symbol (void);
2395 /* Allocate a cgraph_edge structure and fill it with data according to the
2396 parameters of which only CALLEE can be NULL (when creating an indirect
2397 call edge). CLONING_P should be set if properties that are copied from an
2398 original edge should not be calculated. */
2399 cgraph_edge
*create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
2400 gcall
*call_stmt
, profile_count count
,
2401 bool indir_unknown_callee
, bool cloning_p
);
2403 /* Put the edge onto the free list. */
2404 void free_edge (cgraph_edge
*e
);
2406 /* Insert NODE to assembler name hash. */
2407 void insert_to_assembler_name_hash (symtab_node
*node
, bool with_clones
);
2409 /* Remove NODE from assembler name hash. */
2410 void unlink_from_assembler_name_hash (symtab_node
*node
, bool with_clones
);
2412 /* Hash asmnames ignoring the user specified marks. */
2413 static hashval_t
decl_assembler_name_hash (const_tree asmname
);
2415 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
2416 static bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
2418 friend struct asmname_hasher
;
2420 /* List of hooks triggered when an edge is removed. */
2421 cgraph_edge_hook_list
* GTY((skip
)) m_first_edge_removal_hook
;
2422 /* List of hooks trigger_red when a cgraph node is removed. */
2423 cgraph_node_hook_list
* GTY((skip
)) m_first_cgraph_removal_hook
;
2424 /* List of hooks triggered when an edge is duplicated. */
2425 cgraph_2edge_hook_list
* GTY((skip
)) m_first_edge_duplicated_hook
;
2426 /* List of hooks triggered when a node is duplicated. */
2427 cgraph_2node_hook_list
* GTY((skip
)) m_first_cgraph_duplicated_hook
;
2428 /* List of hooks triggered when an function is inserted. */
2429 cgraph_node_hook_list
* GTY((skip
)) m_first_cgraph_insertion_hook
;
2430 /* List of hooks triggered when an variable is inserted. */
2431 varpool_node_hook_list
* GTY((skip
)) m_first_varpool_insertion_hook
;
2432 /* List of hooks triggered when a node is removed. */
2433 varpool_node_hook_list
* GTY((skip
)) m_first_varpool_removal_hook
;
2436 extern GTY(()) symbol_table
*symtab
;
2438 extern vec
<cgraph_node
*> cgraph_new_nodes
;
2441 asmname_hasher::hash (symtab_node
*n
)
2443 return symbol_table::decl_assembler_name_hash
2444 (DECL_ASSEMBLER_NAME (n
->decl
));
2448 asmname_hasher::equal (symtab_node
*n
, const_tree t
)
2450 return symbol_table::decl_assembler_name_equal (n
->decl
, t
);
2454 void cgraph_c_finalize (void);
2455 void release_function_body (tree
);
2456 cgraph_indirect_call_info
*cgraph_allocate_init_indirect_info (void);
2458 void cgraph_update_edges_for_call_stmt (gimple
*, tree
, gimple
*);
2459 bool cgraph_function_possibly_inlined_p (tree
);
2461 const char* cgraph_inline_failed_string (cgraph_inline_failed_t
);
2462 cgraph_inline_failed_type_t
cgraph_inline_failed_type (cgraph_inline_failed_t
);
2464 /* In cgraphunit.c */
2465 void cgraphunit_c_finalize (void);
2466 int tp_first_run_node_cmp (const void *pa
, const void *pb
);
2468 /* Initialize datastructures so DECL is a function in lowered gimple form.
2469 IN_SSA is true if the gimple is in SSA. */
2470 basic_block
init_lowered_empty_function (tree
, bool, profile_count
);
2472 tree
thunk_adjust (gimple_stmt_iterator
*, tree
, bool, HOST_WIDE_INT
, tree
,
2474 /* In cgraphclones.c */
2476 tree
clone_function_name_numbered (const char *name
, const char *suffix
);
2477 tree
clone_function_name_numbered (tree decl
, const char *suffix
);
2478 tree
clone_function_name (const char *name
, const char *suffix
,
2479 unsigned long number
);
2480 tree
clone_function_name (tree decl
, const char *suffix
,
2481 unsigned long number
);
2482 tree
clone_function_name (tree decl
, const char *suffix
);
2484 void tree_function_versioning (tree
, tree
, vec
<ipa_replace_map
*, va_gc
> *,
2485 ipa_param_adjustments
*,
2486 bool, bitmap
, basic_block
);
2488 void dump_callgraph_transformation (const cgraph_node
*original
,
2489 const cgraph_node
*clone
,
2490 const char *suffix
);
2491 /* In cgraphbuild.c */
2492 int compute_call_stmt_bb_frequency (tree
, basic_block bb
);
2493 void record_references_in_initializer (tree
, bool);
2496 void cgraph_build_static_cdtor (char which
, tree body
, int priority
);
2497 bool ipa_discover_variable_flags (void);
2500 tree
ctor_for_folding (tree
);
2502 /* In ipa-inline-analysis.c */
2503 void initialize_inline_failed (struct cgraph_edge
*);
2504 bool speculation_useful_p (struct cgraph_edge
*e
, bool anticipate_inlining
);
2506 /* Return true when the symbol is real symbol, i.e. it is not inline clone
2507 or abstract function kept for debug info purposes only. */
2509 symtab_node::real_symbol_p (void)
2513 if (DECL_ABSTRACT_P (decl
))
2515 if (transparent_alias
&& definition
)
2517 if (!is_a
<cgraph_node
*> (this))
2519 cnode
= dyn_cast
<cgraph_node
*> (this);
2520 if (cnode
->inlined_to
)
2525 /* Return true if DECL should have entry in symbol table if used.
2526 Those are functions and static & external variables. */
2529 decl_in_symtab_p (const_tree decl
)
2531 return (TREE_CODE (decl
) == FUNCTION_DECL
2532 || (TREE_CODE (decl
) == VAR_DECL
2533 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
))));
2537 symtab_node::in_same_comdat_group_p (symtab_node
*target
)
2539 symtab_node
*source
= this;
2541 if (cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (target
))
2544 source
= cn
->inlined_to
;
2546 if (cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (target
))
2549 target
= cn
->inlined_to
;
2552 return source
->get_comdat_group () == target
->get_comdat_group ();
2555 /* Return node that alias is aliasing. */
2557 inline symtab_node
*
2558 symtab_node::get_alias_target (void)
2560 ipa_ref
*ref
= NULL
;
2561 iterate_reference (0, ref
);
2562 gcc_checking_assert (ref
->use
== IPA_REF_ALIAS
);
2563 return ref
->referred
;
2566 /* Return next reachable static symbol with initializer after the node. */
2568 inline symtab_node
*
2569 symtab_node::next_defined_symbol (void)
2571 symtab_node
*node1
= next
;
2573 for (; node1
; node1
= node1
->next
)
2574 if (node1
->definition
)
2580 /* Iterates I-th reference in the list, REF is also set. */
2583 symtab_node::iterate_reference (unsigned i
, ipa_ref
*&ref
)
2585 vec_safe_iterate (ref_list
.references
, i
, &ref
);
2590 /* Iterates I-th referring item in the list, REF is also set. */
2593 symtab_node::iterate_referring (unsigned i
, ipa_ref
*&ref
)
2595 ref_list
.referring
.iterate (i
, &ref
);
2600 /* Iterates I-th referring alias item in the list, REF is also set. */
2603 symtab_node::iterate_direct_aliases (unsigned i
, ipa_ref
*&ref
)
2605 ref_list
.referring
.iterate (i
, &ref
);
2607 if (ref
&& ref
->use
!= IPA_REF_ALIAS
)
2613 /* Return true if list contains an alias. */
2616 symtab_node::has_aliases_p (void)
2618 ipa_ref
*ref
= NULL
;
2620 return (iterate_direct_aliases (0, ref
) != NULL
);
2623 /* Return true when RESOLUTION indicate that linker will use
2624 the symbol from non-LTO object files. */
2627 resolution_used_from_other_file_p (enum ld_plugin_symbol_resolution resolution
)
2629 return (resolution
== LDPR_PREVAILING_DEF
2630 || resolution
== LDPR_PREEMPTED_REG
2631 || resolution
== LDPR_RESOLVED_EXEC
2632 || resolution
== LDPR_RESOLVED_DYN
);
2635 /* Return true when symtab_node is known to be used from other (non-LTO)
2636 object file. Known only when doing LTO via linker plugin. */
2639 symtab_node::used_from_object_file_p (void)
2641 if (!TREE_PUBLIC (decl
) || DECL_EXTERNAL (decl
))
2643 if (resolution_used_from_other_file_p (resolution
))
2648 /* Return varpool node for given symbol and check it is a function. */
2650 inline varpool_node
*
2651 varpool_node::get (const_tree decl
)
2653 gcc_checking_assert (TREE_CODE (decl
) == VAR_DECL
);
2654 return dyn_cast
<varpool_node
*> (symtab_node::get (decl
));
2657 /* Register a symbol NODE. */
2660 symbol_table::register_symbol (symtab_node
*node
)
2663 node
->previous
= NULL
;
2666 nodes
->previous
= node
;
2669 node
->order
= order
++;
2672 /* Register a top-level asm statement ASM_STR. */
2675 symbol_table::finalize_toplevel_asm (tree asm_str
)
2679 node
= ggc_cleared_alloc
<asm_node
> ();
2680 node
->asm_str
= asm_str
;
2681 node
->order
= order
++;
2684 if (asmnodes
== NULL
)
2687 asm_last_node
->next
= node
;
2689 asm_last_node
= node
;
2693 /* Unregister a symbol NODE. */
2695 symbol_table::unregister (symtab_node
*node
)
2698 node
->previous
->next
= node
->next
;
2703 node
->next
->previous
= node
->previous
;
2706 node
->previous
= NULL
;
2709 /* Release a callgraph NODE with UID and put in to the list of free nodes. */
2712 symbol_table::release_symbol (cgraph_node
*node
)
2715 if (node
->m_summary_id
!= -1)
2716 cgraph_released_summary_ids
.safe_push (node
->m_summary_id
);
2720 /* Allocate new callgraph node. */
2722 inline cgraph_node
*
2723 symbol_table::allocate_cgraph_symbol (void)
2727 node
= ggc_cleared_alloc
<cgraph_node
> ();
2728 node
->type
= SYMTAB_FUNCTION
;
2729 node
->m_summary_id
= -1;
2730 node
->m_uid
= cgraph_max_uid
++;
2735 /* Return first static symbol with definition. */
2736 inline symtab_node
*
2737 symbol_table::first_symbol (void)
2742 /* Walk all symbols. */
2743 #define FOR_EACH_SYMBOL(node) \
2744 for ((node) = symtab->first_symbol (); (node); (node) = (node)->next)
2746 /* Return first static symbol with definition. */
2747 inline symtab_node
*
2748 symbol_table::first_defined_symbol (void)
2752 for (node
= nodes
; node
; node
= node
->next
)
2753 if (node
->definition
)
2759 /* Walk all symbols with definitions in current unit. */
2760 #define FOR_EACH_DEFINED_SYMBOL(node) \
2761 for ((node) = symtab->first_defined_symbol (); (node); \
2762 (node) = node->next_defined_symbol ())
2764 /* Return first variable. */
2765 inline varpool_node
*
2766 symbol_table::first_variable (void)
2769 for (node
= nodes
; node
; node
= node
->next
)
2770 if (varpool_node
*vnode
= dyn_cast
<varpool_node
*> (node
))
2775 /* Return next variable after NODE. */
2776 inline varpool_node
*
2777 symbol_table::next_variable (varpool_node
*node
)
2779 symtab_node
*node1
= node
->next
;
2780 for (; node1
; node1
= node1
->next
)
2781 if (varpool_node
*vnode1
= dyn_cast
<varpool_node
*> (node1
))
2785 /* Walk all variables. */
2786 #define FOR_EACH_VARIABLE(node) \
2787 for ((node) = symtab->first_variable (); \
2789 (node) = symtab->next_variable ((node)))
2791 /* Return first static variable with initializer. */
2792 inline varpool_node
*
2793 symbol_table::first_static_initializer (void)
2796 for (node
= nodes
; node
; node
= node
->next
)
2798 varpool_node
*vnode
= dyn_cast
<varpool_node
*> (node
);
2799 if (vnode
&& DECL_INITIAL (node
->decl
))
2805 /* Return next static variable with initializer after NODE. */
2806 inline varpool_node
*
2807 symbol_table::next_static_initializer (varpool_node
*node
)
2809 symtab_node
*node1
= node
->next
;
2810 for (; node1
; node1
= node1
->next
)
2812 varpool_node
*vnode1
= dyn_cast
<varpool_node
*> (node1
);
2813 if (vnode1
&& DECL_INITIAL (node1
->decl
))
2819 /* Walk all static variables with initializer set. */
2820 #define FOR_EACH_STATIC_INITIALIZER(node) \
2821 for ((node) = symtab->first_static_initializer (); (node); \
2822 (node) = symtab->next_static_initializer (node))
2824 /* Return first static variable with definition. */
2825 inline varpool_node
*
2826 symbol_table::first_defined_variable (void)
2829 for (node
= nodes
; node
; node
= node
->next
)
2831 varpool_node
*vnode
= dyn_cast
<varpool_node
*> (node
);
2832 if (vnode
&& vnode
->definition
)
2838 /* Return next static variable with definition after NODE. */
2839 inline varpool_node
*
2840 symbol_table::next_defined_variable (varpool_node
*node
)
2842 symtab_node
*node1
= node
->next
;
2843 for (; node1
; node1
= node1
->next
)
2845 varpool_node
*vnode1
= dyn_cast
<varpool_node
*> (node1
);
2846 if (vnode1
&& vnode1
->definition
)
2851 /* Walk all variables with definitions in current unit. */
2852 #define FOR_EACH_DEFINED_VARIABLE(node) \
2853 for ((node) = symtab->first_defined_variable (); (node); \
2854 (node) = symtab->next_defined_variable (node))
2856 /* Return first function with body defined. */
2857 inline cgraph_node
*
2858 symbol_table::first_defined_function (void)
2861 for (node
= nodes
; node
; node
= node
->next
)
2863 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
2864 if (cn
&& cn
->definition
)
2870 /* Return next function with body defined after NODE. */
2871 inline cgraph_node
*
2872 symbol_table::next_defined_function (cgraph_node
*node
)
2874 symtab_node
*node1
= node
->next
;
2875 for (; node1
; node1
= node1
->next
)
2877 cgraph_node
*cn1
= dyn_cast
<cgraph_node
*> (node1
);
2878 if (cn1
&& cn1
->definition
)
2884 /* Walk all functions with body defined. */
2885 #define FOR_EACH_DEFINED_FUNCTION(node) \
2886 for ((node) = symtab->first_defined_function (); (node); \
2887 (node) = symtab->next_defined_function ((node)))
2889 /* Return first function. */
2890 inline cgraph_node
*
2891 symbol_table::first_function (void)
2894 for (node
= nodes
; node
; node
= node
->next
)
2895 if (cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
))
2900 /* Return next function. */
2901 inline cgraph_node
*
2902 symbol_table::next_function (cgraph_node
*node
)
2904 symtab_node
*node1
= node
->next
;
2905 for (; node1
; node1
= node1
->next
)
2906 if (cgraph_node
*cn1
= dyn_cast
<cgraph_node
*> (node1
))
2911 /* Return first function with body defined. */
2912 inline cgraph_node
*
2913 symbol_table::first_function_with_gimple_body (void)
2916 for (node
= nodes
; node
; node
= node
->next
)
2918 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
2919 if (cn
&& cn
->has_gimple_body_p ())
2925 /* Return next reachable static variable with initializer after NODE. */
2926 inline cgraph_node
*
2927 symbol_table::next_function_with_gimple_body (cgraph_node
*node
)
2929 symtab_node
*node1
= node
->next
;
2930 for (; node1
; node1
= node1
->next
)
2932 cgraph_node
*cn1
= dyn_cast
<cgraph_node
*> (node1
);
2933 if (cn1
&& cn1
->has_gimple_body_p ())
2939 /* Walk all functions. */
2940 #define FOR_EACH_FUNCTION(node) \
2941 for ((node) = symtab->first_function (); (node); \
2942 (node) = symtab->next_function ((node)))
2944 /* Return true when callgraph node is a function with Gimple body defined
2945 in current unit. Functions can also be define externally or they
2946 can be thunks with no Gimple representation.
2948 Note that at WPA stage, the function body may not be present in memory. */
2951 cgraph_node::has_gimple_body_p (void)
2953 return definition
&& !thunk
.thunk_p
&& !alias
;
2956 /* Return true if this node represents a former, i.e. an expanded, thunk. */
2959 cgraph_node::former_thunk_p (void)
2961 return (!thunk
.thunk_p
2962 && (thunk
.fixed_offset
2963 || thunk
.virtual_offset_p
2964 || thunk
.indirect_offset
));
2967 /* Walk all functions with body defined. */
2968 #define FOR_EACH_FUNCTION_WITH_GIMPLE_BODY(node) \
2969 for ((node) = symtab->first_function_with_gimple_body (); (node); \
2970 (node) = symtab->next_function_with_gimple_body (node))
2972 /* Uniquize all constants that appear in memory.
2973 Each constant in memory thus far output is recorded
2974 in `const_desc_table'. */
2976 struct GTY((for_user
)) constant_descriptor_tree
{
2977 /* A MEM for the constant. */
2980 /* The value of the constant. */
2983 /* Hash of value. Computing the hash from value each time
2984 hashfn is called can't work properly, as that means recursive
2985 use of the hash table during hash table expansion. */
2989 /* Return true when function is only called directly or it has alias.
2990 i.e. it is not externally visible, address was not taken and
2991 it is not used in any other non-standard way. */
2994 cgraph_node::only_called_directly_or_aliased_p (void)
2996 gcc_assert (!inlined_to
);
2997 return (!force_output
&& !address_taken
2999 && !used_from_other_partition
3000 && !DECL_VIRTUAL_P (decl
)
3001 && !DECL_STATIC_CONSTRUCTOR (decl
)
3002 && !DECL_STATIC_DESTRUCTOR (decl
)
3003 && !used_from_object_file_p ()
3004 && !externally_visible
);
3007 /* Return true when function can be removed from callgraph
3008 if all direct calls are eliminated. */
3011 cgraph_node::can_remove_if_no_direct_calls_and_refs_p (void)
3013 gcc_checking_assert (!inlined_to
);
3014 /* Extern inlines can always go, we will use the external definition. */
3015 if (DECL_EXTERNAL (decl
))
3017 /* When function is needed, we cannot remove it. */
3018 if (force_output
|| used_from_other_partition
)
3020 if (DECL_STATIC_CONSTRUCTOR (decl
)
3021 || DECL_STATIC_DESTRUCTOR (decl
))
3023 /* Only COMDAT functions can be removed if externally visible. */
3024 if (externally_visible
3025 && (!DECL_COMDAT (decl
)
3027 || used_from_object_file_p ()))
3032 /* Verify cgraph, if consistency checking is enabled. */
3035 cgraph_node::checking_verify_cgraph_nodes (void)
3038 cgraph_node::verify_cgraph_nodes ();
3041 /* Return true when variable can be removed from variable pool
3042 if all direct calls are eliminated. */
3045 varpool_node::can_remove_if_no_refs_p (void)
3047 if (DECL_EXTERNAL (decl
))
3049 return (!force_output
&& !used_from_other_partition
3050 && ((DECL_COMDAT (decl
)
3052 && !used_from_object_file_p ())
3053 || !externally_visible
3054 || DECL_HAS_VALUE_EXPR_P (decl
)));
3057 /* Return true when all references to variable must be visible in ipa_ref_list.
3058 i.e. if the variable is not externally visible or not used in some magic
3059 way (asm statement or such).
3060 The magic uses are all summarized in force_output flag. */
3063 varpool_node::all_refs_explicit_p ()
3066 && !externally_visible
3067 && !used_from_other_partition
3071 struct tree_descriptor_hasher
: ggc_ptr_hash
<constant_descriptor_tree
>
3073 static hashval_t
hash (constant_descriptor_tree
*);
3074 static bool equal (constant_descriptor_tree
*, constant_descriptor_tree
*);
3077 /* Constant pool accessor function. */
3078 hash_table
<tree_descriptor_hasher
> *constant_pool_htab (void);
3080 /* Return node that alias is aliasing. */
3082 inline cgraph_node
*
3083 cgraph_node::get_alias_target (void)
3085 return dyn_cast
<cgraph_node
*> (symtab_node::get_alias_target ());
3088 /* Return node that alias is aliasing. */
3090 inline varpool_node
*
3091 varpool_node::get_alias_target (void)
3093 return dyn_cast
<varpool_node
*> (symtab_node::get_alias_target ());
3096 /* Walk the alias chain to return the symbol NODE is alias of.
3097 If NODE is not an alias, return NODE.
3098 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3099 When REF is non-NULL, assume that reference happens in symbol REF
3100 when determining the availability. */
3102 inline symtab_node
*
3103 symtab_node::ultimate_alias_target (enum availability
*availability
,
3109 *availability
= get_availability (ref
);
3113 return ultimate_alias_target_1 (availability
, ref
);
3116 /* Given function symbol, walk the alias chain to return the function node
3117 is alias of. Do not walk through thunks.
3118 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3119 When REF is non-NULL, assume that reference happens in symbol REF
3120 when determining the availability. */
3122 inline cgraph_node
*
3123 cgraph_node::ultimate_alias_target (enum availability
*availability
,
3126 cgraph_node
*n
= dyn_cast
<cgraph_node
*>
3127 (symtab_node::ultimate_alias_target (availability
, ref
));
3128 if (!n
&& availability
)
3129 *availability
= AVAIL_NOT_AVAILABLE
;
3133 /* For given variable pool node, walk the alias chain to return the function
3134 the variable is alias of. Do not walk through thunks.
3135 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3136 When REF is non-NULL, assume that reference happens in symbol REF
3137 when determining the availability. */
3139 inline varpool_node
*
3140 varpool_node::ultimate_alias_target (availability
*availability
,
3143 varpool_node
*n
= dyn_cast
<varpool_node
*>
3144 (symtab_node::ultimate_alias_target (availability
, ref
));
3146 if (!n
&& availability
)
3147 *availability
= AVAIL_NOT_AVAILABLE
;
3151 /* Set callee N of call graph edge and add it to the corresponding set of
3155 cgraph_edge::set_callee (cgraph_node
*n
)
3159 n
->callers
->prev_caller
= this;
3160 next_caller
= n
->callers
;
3165 /* Redirect callee of the edge to N. The function does not update underlying
3169 cgraph_edge::redirect_callee (cgraph_node
*n
)
3171 /* Remove from callers list of the current callee. */
3174 /* Insert to callers list of the new callee. */
3178 /* Return true when the edge represents a direct recursion. */
3181 cgraph_edge::recursive_p (void)
3183 cgraph_node
*c
= callee
->ultimate_alias_target ();
3184 if (caller
->inlined_to
)
3185 return caller
->inlined_to
->decl
== c
->decl
;
3187 return caller
->decl
== c
->decl
;
3190 /* Remove the edge from the list of the callers of the callee. */
3193 cgraph_edge::remove_callee (void)
3195 gcc_assert (!indirect_unknown_callee
);
3197 prev_caller
->next_caller
= next_caller
;
3199 next_caller
->prev_caller
= prev_caller
;
3201 callee
->callers
= next_caller
;
3204 /* Return true if call must bind to current definition. */
3207 cgraph_edge::binds_to_current_def_p ()
3210 return callee
->binds_to_current_def_p (caller
);
3215 /* Expected frequency of executions within the function.
3216 When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
3217 per function call. The range is 0 to CGRAPH_FREQ_MAX. */
3220 cgraph_edge::frequency ()
3222 return count
.to_cgraph_frequency (caller
->inlined_to
3223 ? caller
->inlined_to
->count
3228 /* Return true if the TM_CLONE bit is set for a given FNDECL. */
3230 decl_is_tm_clone (const_tree fndecl
)
3232 cgraph_node
*n
= cgraph_node::get (fndecl
);
3238 /* Likewise indicate that a node is needed, i.e. reachable via some
3242 cgraph_node::mark_force_output (void)
3245 gcc_checking_assert (!inlined_to
);
3248 /* Return true if function should be optimized for size. */
3251 cgraph_node::optimize_for_size_p (void)
3253 if (opt_for_fn (decl
, optimize_size
))
3255 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
3261 /* Return symtab_node for NODE or create one if it is not present
3264 inline symtab_node
*
3265 symtab_node::get_create (tree node
)
3267 if (TREE_CODE (node
) == VAR_DECL
)
3268 return varpool_node::get_create (node
);
3270 return cgraph_node::get_create (node
);
3273 /* Return availability of NODE when referenced from REF. */
3275 inline enum availability
3276 symtab_node::get_availability (symtab_node
*ref
)
3278 if (is_a
<cgraph_node
*> (this))
3279 return dyn_cast
<cgraph_node
*> (this)->get_availability (ref
);
3281 return dyn_cast
<varpool_node
*> (this)->get_availability (ref
);
3284 /* Call callback on symtab node and aliases associated to this node.
3285 When INCLUDE_OVERWRITABLE is false, overwritable symbols are skipped. */
3288 symtab_node::call_for_symbol_and_aliases (bool (*callback
) (symtab_node
*,
3291 bool include_overwritable
)
3293 if (include_overwritable
3294 || get_availability () > AVAIL_INTERPOSABLE
)
3296 if (callback (this, data
))
3299 if (has_aliases_p ())
3300 return call_for_symbol_and_aliases_1 (callback
, data
, include_overwritable
);
3304 /* Call callback on function and aliases associated to the function.
3305 When INCLUDE_OVERWRITABLE is false, overwritable symbols are
3309 cgraph_node::call_for_symbol_and_aliases (bool (*callback
) (cgraph_node
*,
3312 bool include_overwritable
)
3314 if (include_overwritable
3315 || get_availability () > AVAIL_INTERPOSABLE
)
3317 if (callback (this, data
))
3320 if (has_aliases_p ())
3321 return call_for_symbol_and_aliases_1 (callback
, data
, include_overwritable
);
3325 /* Call callback on varpool symbol and aliases associated to varpool symbol.
3326 When INCLUDE_OVERWRITABLE is false, overwritable symbols are
3330 varpool_node::call_for_symbol_and_aliases (bool (*callback
) (varpool_node
*,
3333 bool include_overwritable
)
3335 if (include_overwritable
3336 || get_availability () > AVAIL_INTERPOSABLE
)
3338 if (callback (this, data
))
3341 if (has_aliases_p ())
3342 return call_for_symbol_and_aliases_1 (callback
, data
, include_overwritable
);
3346 /* Return true if reference may be used in address compare. */
3349 ipa_ref::address_matters_p ()
3351 if (use
!= IPA_REF_ADDR
)
3353 /* Addresses taken from virtual tables are never compared. */
3354 if (is_a
<varpool_node
*> (referring
)
3355 && DECL_VIRTUAL_P (referring
->decl
))
3357 return referred
->address_can_be_compared_p ();
3360 /* Build polymorphic call context for indirect call E. */
3363 ipa_polymorphic_call_context::ipa_polymorphic_call_context (cgraph_edge
*e
)
3365 gcc_checking_assert (e
->indirect_info
->polymorphic
);
3366 *this = e
->indirect_info
->context
;
3369 /* Build empty "I know nothing" context. */
3372 ipa_polymorphic_call_context::ipa_polymorphic_call_context ()
3374 clear_speculation ();
3375 clear_outer_type ();
3379 /* Make context non-speculative. */
3382 ipa_polymorphic_call_context::clear_speculation ()
3384 speculative_outer_type
= NULL
;
3385 speculative_offset
= 0;
3386 speculative_maybe_derived_type
= false;
3389 /* Produce context specifying all derived types of OTR_TYPE. If OTR_TYPE is
3390 NULL, the context is set to dummy "I know nothing" setting. */
3393 ipa_polymorphic_call_context::clear_outer_type (tree otr_type
)
3395 outer_type
= otr_type
? TYPE_MAIN_VARIANT (otr_type
) : NULL
;
3397 maybe_derived_type
= true;
3398 maybe_in_construction
= true;
3402 /* Adjust all offsets in contexts by OFF bits. */
3405 ipa_polymorphic_call_context::offset_by (HOST_WIDE_INT off
)
3409 if (speculative_outer_type
)
3410 speculative_offset
+= off
;
3413 /* Return TRUE if context is fully useless. */
3416 ipa_polymorphic_call_context::useless_p () const
3418 return (!outer_type
&& !speculative_outer_type
);
3421 /* When using fprintf (or similar), problems can arise with
3422 transient generated strings. Many string-generation APIs
3423 only support one result being alive at once (e.g. by
3424 returning a pointer to a statically-allocated buffer).
3426 If there is more than one generated string within one
3427 fprintf call: the first string gets evicted or overwritten
3428 by the second, before fprintf is fully evaluated.
3431 This function provides a workaround for this, by providing
3432 a simple way to create copies of these transient strings,
3433 without the need to have explicit cleanup:
3435 fprintf (dumpfile, "string 1: %s string 2:%s\n",
3436 xstrdup_for_dump (EXPR_1),
3437 xstrdup_for_dump (EXPR_2));
3439 This is actually a simple wrapper around ggc_strdup, but
3440 the name documents the intent. We require that no GC can occur
3441 within the fprintf call. */
3443 static inline const char *
3444 xstrdup_for_dump (const char *transient_str
)
3446 return ggc_strdup (transient_str
);
3449 /* During LTO stream-in this predicate can be used to check whether node
3450 in question prevails in the linking to save some memory usage. */
3452 symtab_node::prevailing_p (void)
3454 return definition
&& ((!TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
3455 || previous_sharing_asm_name
== NULL
);
3458 extern GTY(()) symbol_table
*saved_symtab
;
3462 namespace selftest
{
3464 /* An RAII-style class for use in selftests for temporarily using a different
3465 symbol_table, so that such tests can be isolated from each other. */
3467 class symbol_table_test
3470 /* Constructor. Override "symtab". */
3471 symbol_table_test ();
3473 /* Destructor. Restore the saved_symtab. */
3474 ~symbol_table_test ();
3477 } // namespace selftest
3479 #endif /* CHECKING_P */
3481 #endif /* GCC_CGRAPH_H */