Branch data Line data Source code
1 : : /* Callgraph handling code.
2 : : Copyright (C) 2003-2025 Free Software Foundation, Inc.
3 : : Contributed by Jan Hubicka
4 : :
5 : : This file is part of GCC.
6 : :
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
10 : : version.
11 : :
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
15 : : for more details.
16 : :
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/>. */
20 : :
21 : : #ifndef GCC_CGRAPH_H
22 : : #define GCC_CGRAPH_H
23 : :
24 : : #include "profile-count.h"
25 : : #include "ipa-ref.h"
26 : : #include "plugin-api.h"
27 : : #include "ipa-param-manipulation.h"
28 : :
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);
36 : :
37 : : class ipa_opt_pass_d;
38 : : typedef ipa_opt_pass_d *ipa_opt_pass;
39 : :
40 : : /* Symbol table consists of functions and variables.
41 : : TODO: add labels and CONST_DECLs. */
42 : : enum symtab_type
43 : : {
44 : : SYMTAB_SYMBOL,
45 : : SYMTAB_FUNCTION,
46 : : SYMTAB_VARIABLE
47 : : };
48 : :
49 : : /* Section names are stored as reference counted strings in GGC safe hashtable
50 : : (to make them survive through PCH). */
51 : :
52 : : struct GTY((for_user)) section_hash_entry
53 : : {
54 : : int ref_count;
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
57 : : way */
58 : : };
59 : :
60 : : struct section_name_hasher : ggc_ptr_hash<section_hash_entry>
61 : : {
62 : : typedef const char *compare_type;
63 : :
64 : : static hashval_t hash (section_hash_entry *);
65 : : static bool equal (section_hash_entry *, const char *);
66 : : };
67 : :
68 : : enum availability
69 : : {
70 : : /* Not yet set by cgraph_function_body_availability. */
71 : : AVAIL_UNSET,
72 : : /* Function body/variable initializer is unknown. */
73 : : AVAIL_NOT_AVAILABLE,
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. */
79 : : AVAIL_INTERPOSABLE,
80 : : /* Function body/variable initializer is known and will be used in final
81 : : program. */
82 : : AVAIL_AVAILABLE,
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
86 : : functions. */
87 : : AVAIL_LOCAL
88 : : };
89 : :
90 : : /* Classification of symbols WRT partitioning. */
91 : : enum symbol_partitioning_class
92 : : {
93 : : /* External declarations are ignored by partitioning algorithms and they are
94 : : added into the boundary later via compute_ltrans_boundary. */
95 : : SYMBOL_EXTERNAL,
96 : : /* Partitioned symbols are put into one of partitions. */
97 : : SYMBOL_PARTITION,
98 : : /* Duplicated symbols (such as comdat or constant pool references) are
99 : : copied into every node needing them via add_symbol_to_partition. */
100 : : SYMBOL_DUPLICATE
101 : : };
102 : :
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")))
107 : : symtab_node
108 : : {
109 : : public:
110 : : friend class symbol_table;
111 : :
112 : : /* Constructor. */
113 : 115501854 : explicit symtab_node (symtab_type t)
114 : 115501854 : : type (t), resolution (LDPR_UNKNOWN), definition (false), alias (false),
115 : 115501854 : transparent_alias (false), weakref (false), cpp_implicit_alias (false),
116 : 115501854 : symver (false), analyzed (false), writeonly (false),
117 : 115501854 : refuse_visibility_changes (false), externally_visible (false),
118 : 115501854 : no_reorder (false), force_output (false), forced_by_abi (false),
119 : 115501854 : unique_name (false), implicit_section (false), body_removed (false),
120 : 115501854 : semantic_interposition (flag_semantic_interposition),
121 : 115501854 : used_from_other_partition (false), in_other_partition (false),
122 : 115501854 : address_taken (false), in_init_priority_hash (false),
123 : 115501854 : need_lto_streaming (false), offloadable (false), ifunc_resolver (false),
124 : 115501854 : order (-1), next_sharing_asm_name (NULL),
125 : 115501854 : previous_sharing_asm_name (NULL), same_comdat_group (NULL), ref_list (),
126 : 115501854 : alias_target (NULL), lto_file_data (NULL), aux (NULL),
127 : 115501854 : x_comdat_group (NULL_TREE), x_section (NULL), m_uid (-1)
128 : 115501854 : {}
129 : :
130 : : /* Return name. */
131 : : const char *name () const;
132 : :
133 : : /* Return dump name. */
134 : : const char *dump_name () const;
135 : :
136 : : /* Return asm name. */
137 : : const char *asm_name () const;
138 : :
139 : : /* Return dump name with assembler name. */
140 : : const char *dump_asm_name () const;
141 : :
142 : : /* Return visibility name. */
143 : : const char *get_visibility_string () const;
144 : :
145 : : /* Return type_name name. */
146 : : const char *get_symtab_type_string () const;
147 : :
148 : : /* Add node into symbol table. This function is not used directly, but via
149 : : cgraph/varpool node creation routines. */
150 : : void register_symbol (void);
151 : :
152 : : /* Remove symbol from symbol table. */
153 : : void remove (void);
154 : :
155 : : /* Undo any definition or use of the symbol. */
156 : : void reset (bool preserve_comdat_group = false);
157 : :
158 : : /* Dump symtab node to F. */
159 : : void dump (FILE *f);
160 : :
161 : : /* Dump symtab callgraph in graphviz format. */
162 : : void dump_graphviz (FILE *f);
163 : :
164 : : /* Dump symtab node to stderr. */
165 : : void DEBUG_FUNCTION debug (void);
166 : :
167 : : /* Verify consistency of node. */
168 : : void DEBUG_FUNCTION verify (void);
169 : :
170 : : /* Return ipa reference from this symtab_node to
171 : : REFERRED_NODE or REFERRED_VARPOOL_NODE. USE_TYPE specify type
172 : : of the use and STMT the statement (if it exists). */
173 : : ipa_ref *create_reference (symtab_node *referred_node,
174 : : enum ipa_ref_use use_type);
175 : :
176 : : /* Return ipa reference from this symtab_node to
177 : : REFERRED_NODE or REFERRED_VARPOOL_NODE. USE_TYPE specify type
178 : : of the use and STMT the statement (if it exists). */
179 : : ipa_ref *create_reference (symtab_node *referred_node,
180 : : enum ipa_ref_use use_type, gimple *stmt);
181 : :
182 : : /* If VAL is a reference to a function or a variable, add a reference from
183 : : this symtab_node to the corresponding symbol table node. Return the new
184 : : reference or NULL if none was created. */
185 : : ipa_ref *maybe_create_reference (tree val, gimple *stmt);
186 : :
187 : : /* Clone all references from symtab NODE to this symtab_node. */
188 : : void clone_references (symtab_node *node);
189 : :
190 : : /* Remove all stmt references in non-speculative references.
191 : : Those are not maintained during inlining & clonning.
192 : : The exception are speculative references that are updated along
193 : : with callgraph edges associated with them. */
194 : : void clone_referring (symtab_node *node);
195 : :
196 : : /* Clone reference REF to this symtab_node and set its stmt to STMT. */
197 : : ipa_ref *clone_reference (ipa_ref *ref, gimple *stmt);
198 : :
199 : : /* Find the structure describing a reference to REFERRED_NODE of USE_TYPE and
200 : : associated with statement STMT or LTO_STMT_UID. */
201 : : ipa_ref *find_reference (symtab_node *referred_node, gimple *stmt,
202 : : unsigned int lto_stmt_uid,
203 : : enum ipa_ref_use use_type);
204 : :
205 : : /* Remove all references that are associated with statement STMT. */
206 : : void remove_stmt_references (gimple *stmt);
207 : :
208 : : /* Remove all stmt references in non-speculative references.
209 : : Those are not maintained during inlining & clonning.
210 : : The exception are speculative references that are updated along
211 : : with callgraph edges associated with them. */
212 : : void clear_stmts_in_references (void);
213 : :
214 : : /* Remove all references in ref list. */
215 : : void remove_all_references (void);
216 : :
217 : : /* Remove all referring items in ref list. */
218 : : void remove_all_referring (void);
219 : :
220 : : /* Dump references in ref list to FILE. */
221 : : void dump_references (FILE *file);
222 : :
223 : : /* Dump referring in list to FILE. */
224 : : void dump_referring (FILE *);
225 : :
226 : : /* Get number of references for this node. */
227 : 765563 : inline unsigned num_references (void)
228 : : {
229 : 978955 : return ref_list.references.length ();
230 : : }
231 : :
232 : : /* Iterates I-th reference in the list, REF is also set. */
233 : : ipa_ref *iterate_reference (unsigned i, ipa_ref *&ref);
234 : :
235 : : /* Iterates I-th referring item in the list, REF is also set. */
236 : : ipa_ref *iterate_referring (unsigned i, ipa_ref *&ref);
237 : :
238 : : /* Iterates I-th referring alias item in the list, REF is also set. */
239 : : ipa_ref *iterate_direct_aliases (unsigned i, ipa_ref *&ref);
240 : :
241 : : /* Return true if symtab node and TARGET represents
242 : : semantically equivalent symbols. */
243 : : bool semantically_equivalent_p (symtab_node *target);
244 : :
245 : : /* Classify symbol symtab node for partitioning. */
246 : : enum symbol_partitioning_class get_partitioning_class (void);
247 : :
248 : : /* Return comdat group. */
249 : 825313924 : tree get_comdat_group ()
250 : : {
251 : 462371873 : return x_comdat_group;
252 : : }
253 : :
254 : : /* Return comdat group as identifier_node. */
255 : 111993265 : tree get_comdat_group_id ()
256 : : {
257 : 111993265 : if (x_comdat_group && TREE_CODE (x_comdat_group) != IDENTIFIER_NODE)
258 : 50787741 : x_comdat_group = DECL_ASSEMBLER_NAME (x_comdat_group);
259 : 111993265 : return x_comdat_group;
260 : : }
261 : :
262 : : /* Set comdat group. */
263 : 119417808 : void set_comdat_group (tree group)
264 : : {
265 : 100045328 : gcc_checking_assert (!group || TREE_CODE (group) == IDENTIFIER_NODE
266 : : || DECL_P (group));
267 : 86928261 : x_comdat_group = group;
268 : 93025167 : }
269 : :
270 : : /* Return section as string. */
271 : 731170474 : const char * get_section () const
272 : : {
273 : 724509624 : if (!x_section)
274 : : return NULL;
275 : 231226533 : return x_section->name;
276 : : }
277 : :
278 : : /* Remove node from same comdat group. */
279 : : void remove_from_same_comdat_group (void);
280 : :
281 : : /* Add this symtab_node to the same comdat group that OLD is in. */
282 : : void add_to_same_comdat_group (symtab_node *old_node);
283 : :
284 : : /* Dissolve the same_comdat_group list in which NODE resides. */
285 : : void dissolve_same_comdat_group_list (void);
286 : :
287 : : /* Return true when symtab_node is known to be used from other (non-LTO)
288 : : object file. Known only when doing LTO via linker plugin. */
289 : : bool used_from_object_file_p (void);
290 : :
291 : : /* Walk the alias chain to return the symbol NODE is alias of.
292 : : If NODE is not an alias, return NODE.
293 : : When AVAILABILITY is non-NULL, get minimal availability in the chain.
294 : : When REF is non-NULL, assume that reference happens in symbol REF
295 : : when determining the availability. */
296 : : symtab_node *ultimate_alias_target (enum availability *avail = NULL,
297 : : struct symtab_node *ref = NULL);
298 : :
299 : : /* Return next reachable static symbol with initializer after NODE. */
300 : : inline symtab_node *next_defined_symbol (void);
301 : :
302 : : /* Add reference recording that symtab node is alias of TARGET.
303 : : If TRANSPARENT is true make the alias to be transparent alias.
304 : : The function can fail in the case of aliasing cycles; in this case
305 : : it returns false. */
306 : : bool resolve_alias (symtab_node *target, bool transparent = false);
307 : :
308 : : /* C++ FE sometimes change linkage flags after producing same
309 : : body aliases. */
310 : : void fixup_same_cpp_alias_visibility (symtab_node *target);
311 : :
312 : : /* Call callback on symtab node and aliases associated to this node.
313 : : When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
314 : : skipped. */
315 : : bool call_for_symbol_and_aliases (bool (*callback) (symtab_node *, void *),
316 : : void *data,
317 : : bool include_overwrite);
318 : :
319 : : /* If node cannot be interposable by static or dynamic linker to point to
320 : : different definition, return this symbol. Otherwise look for alias with
321 : : such property and if none exists, introduce new one. */
322 : : symtab_node *noninterposable_alias (void);
323 : :
324 : : /* Return node that alias is aliasing. */
325 : : inline symtab_node *get_alias_target (void);
326 : :
327 : : /* Return DECL that alias is aliasing. */
328 : : inline tree get_alias_target_tree ();
329 : :
330 : : /* Set section for symbol and its aliases. */
331 : : void set_section (const char *section);
332 : :
333 : : /* Like set_section, but copying the section name from another node. */
334 : : void set_section (const symtab_node &other);
335 : :
336 : : /* Set section, do not recurse into aliases.
337 : : When one wants to change section of symbol and its aliases,
338 : : use set_section. */
339 : : void set_section_for_node (const char *section);
340 : :
341 : : /* Like set_section_for_node, but copying the section name from another
342 : : node. */
343 : : void set_section_for_node (const symtab_node &other);
344 : :
345 : : /* Set initialization priority to PRIORITY. */
346 : : void set_init_priority (priority_type priority);
347 : :
348 : : /* Return the initialization priority. */
349 : : priority_type get_init_priority ();
350 : :
351 : : /* Return availability of NODE when referenced from REF. */
352 : : enum availability get_availability (symtab_node *ref = NULL);
353 : :
354 : : /* During LTO stream-in this predicate can be used to check whether node
355 : : in question prevails in the linking to save some memory usage. */
356 : : bool prevailing_p (void);
357 : :
358 : : /* Return true if NODE binds to current definition in final executable
359 : : when referenced from REF. If REF is NULL return conservative value
360 : : for any reference. */
361 : : bool binds_to_current_def_p (symtab_node *ref = NULL);
362 : :
363 : : /* Make DECL local. */
364 : : void make_decl_local (void);
365 : :
366 : : /* Copy visibility from N. */
367 : : void copy_visibility_from (symtab_node *n);
368 : :
369 : : /* Return desired alignment of the definition. This is NOT alignment useful
370 : : to access THIS, because THIS may be interposable and DECL_ALIGN should
371 : : be used instead. It however must be guaranteed when output definition
372 : : of THIS. */
373 : : unsigned int definition_alignment ();
374 : :
375 : : /* Return true if alignment can be increased. */
376 : : bool can_increase_alignment_p ();
377 : :
378 : : /* Increase alignment of symbol to ALIGN. */
379 : : void increase_alignment (unsigned int align);
380 : :
381 : : /* Return true if list contains an alias. */
382 : : bool has_aliases_p (void);
383 : :
384 : : /* Return true when the symbol is real symbol, i.e. it is not inline clone
385 : : or abstract function kept for debug info purposes only. */
386 : : bool real_symbol_p (void);
387 : :
388 : : /* Return true when the symbol needs to be output to the LTO symbol table. */
389 : : bool output_to_lto_symbol_table_p (void);
390 : :
391 : : /* Determine if symbol declaration is needed. That is, visible to something
392 : : either outside this translation unit, something magic in the system
393 : : configury. This function is used just during symbol creation. */
394 : : bool needed_p (void);
395 : :
396 : : /* Return true if this symbol is a function from the C frontend specified
397 : : directly in RTL form (with "__RTL"). */
398 : : bool native_rtl_p () const;
399 : :
400 : : /* Return true when there are references to the node. */
401 : : bool referred_to_p (bool include_self = true);
402 : :
403 : : /* Return true if symbol can be discarded by linker from the binary.
404 : : Assume that symbol is used (so there is no need to take into account
405 : : garbage collecting linkers)
406 : :
407 : : This can happen for comdats, commons and weaks when they are prevailed
408 : : by other definition at static linking time. */
409 : : inline bool
410 : 563179740 : can_be_discarded_p (void)
411 : : {
412 : 563179740 : return ((DECL_EXTERNAL (decl)
413 : 206116146 : && !in_other_partition)
414 : 563184739 : || ((get_comdat_group ()
415 : 277143835 : || DECL_COMMON (decl)
416 : 276313366 : || (DECL_SECTION_NAME (decl) && DECL_WEAK (decl)))
417 : 80755231 : && ((resolution != LDPR_PREVAILING_DEF
418 : 80755231 : && resolution != LDPR_PREVAILING_DEF_IRONLY_EXP)
419 : 834 : || flag_incremental_link)
420 : 80755226 : && resolution != LDPR_PREVAILING_DEF_IRONLY));
421 : : }
422 : :
423 : : /* Return true if NODE is local to a particular COMDAT group, and must not
424 : : be named from outside the COMDAT. This is used for C++ decloned
425 : : constructors. */
426 : 212955191 : inline bool comdat_local_p (void)
427 : : {
428 : 212955191 : return (same_comdat_group && !TREE_PUBLIC (decl));
429 : : }
430 : :
431 : : /* Return true if ONE and TWO are part of the same COMDAT group. */
432 : : inline bool in_same_comdat_group_p (symtab_node *target);
433 : :
434 : : /* Return true if symbol is known to be nonzero, assume that
435 : : flag_delete_null_pointer_checks is equal to delete_null_pointer_checks. */
436 : : bool nonzero_address (bool delete_null_pointer_checks);
437 : :
438 : : /* Return true if symbol is known to be nonzero. */
439 : : bool nonzero_address ();
440 : :
441 : : /* Return 0 if symbol is known to have different address than S2,
442 : : Return 1 if symbol is known to have same address as S2,
443 : : return 2 otherwise.
444 : :
445 : : If MEMORY_ACCESSED is true, assume that both memory pointer to THIS
446 : : and S2 is going to be accessed. This eliminates the situations when
447 : : either THIS or S2 is NULL and is useful for comparing bases when deciding
448 : : about memory aliasing. */
449 : : int equal_address_to (symtab_node *s2, bool memory_accessed = false);
450 : :
451 : : /* Return true if symbol's address may possibly be compared to other
452 : : symbol's address. */
453 : : bool address_matters_p ();
454 : :
455 : : /* Return true if NODE's address can be compared. This use properties
456 : : of NODE only and does not look if the address is actually taken in
457 : : interesting way. For that use ADDRESS_MATTERS_P instead. */
458 : : bool address_can_be_compared_p (void);
459 : :
460 : : /* Return symbol table node associated with DECL, if any,
461 : : and NULL otherwise. */
462 : 7735023076 : static inline symtab_node *get (const_tree decl)
463 : : {
464 : : /* Check that we are called for sane type of object - functions
465 : : and static or external variables. */
466 : 7735023076 : gcc_checking_assert (TREE_CODE (decl) == FUNCTION_DECL
467 : : || (TREE_CODE (decl) == VAR_DECL
468 : : && (TREE_STATIC (decl) || DECL_EXTERNAL (decl)
469 : : || in_lto_p)));
470 : : /* Check that the mapping is sane - perhaps this check can go away,
471 : : but at the moment frontends tends to corrupt the mapping by calling
472 : : memcpy/memset on the tree nodes. */
473 : 7735023076 : gcc_checking_assert (!decl->decl_with_vis.symtab_node
474 : : || decl->decl_with_vis.symtab_node->decl == decl);
475 : 7735023076 : return decl->decl_with_vis.symtab_node;
476 : : }
477 : :
478 : : /* Try to find a symtab node for declaration DECL and if it does not
479 : : exist or if it corresponds to an inline clone, create a new one. */
480 : : static inline symtab_node * get_create (tree node);
481 : :
482 : : /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
483 : : Return NULL if there's no such node. */
484 : : static symtab_node *get_for_asmname (const_tree asmname);
485 : :
486 : : /* Check symbol table for callees of IFUNC resolvers. */
487 : : static void check_ifunc_callee_symtab_nodes (void);
488 : :
489 : : /* Verify symbol table for internal consistency. */
490 : : static DEBUG_FUNCTION void verify_symtab_nodes (void);
491 : :
492 : : /* Perform internal consistency checks, if they are enabled. */
493 : : static inline void checking_verify_symtab_nodes (void);
494 : :
495 : : /* Get unique identifier of the node. */
496 : 191462376 : inline int get_uid ()
497 : : {
498 : 190971007 : return m_uid;
499 : : }
500 : :
501 : : /* Type of the symbol. */
502 : : ENUM_BITFIELD (symtab_type) type : 8;
503 : :
504 : : /* The symbols resolution. */
505 : : ENUM_BITFIELD (ld_plugin_symbol_resolution) resolution : 8;
506 : :
507 : : /*** Flags representing the symbol type. ***/
508 : :
509 : : /* True when symbol corresponds to a definition in current unit.
510 : : set via finalize_function or finalize_decl */
511 : : unsigned definition : 1;
512 : : /* True when symbol is an alias.
513 : : Set by assemble_alias. */
514 : : unsigned alias : 1;
515 : : /* When true the alias is translated into its target symbol either by GCC
516 : : or assembler (it also may just be a duplicate declaration of the same
517 : : linker name).
518 : :
519 : : Currently transparent aliases come in three different flavors
520 : : - aliases having the same assembler name as their target (aka duplicated
521 : : declarations). In this case the assembler names compare via
522 : : assembler_names_equal_p and weakref is false
523 : : - aliases that are renamed at a time being output to final file
524 : : by varasm.cc. For those DECL_ASSEMBLER_NAME have
525 : : IDENTIFIER_TRANSPARENT_ALIAS set and thus also their assembler
526 : : name must be unique.
527 : : Weakrefs belong to this category when we target assembler without
528 : : .weakref directive.
529 : : - weakrefs that are renamed by assembler via .weakref directive.
530 : : In this case the alias may or may not be definition (depending if
531 : : target declaration was seen by the compiler), weakref is set.
532 : : Unless we are before renaming statics, assembler names are different.
533 : :
534 : : Given that we now support duplicate declarations, the second option is
535 : : redundant and will be removed. */
536 : : unsigned transparent_alias : 1;
537 : : /* True when alias is a weakref. */
538 : : unsigned weakref : 1;
539 : : /* C++ frontend produce same body aliases and extra name aliases for
540 : : virtual functions and vtables that are obviously equivalent.
541 : : Those aliases are bit special, especially because C++ frontend
542 : : visibility code is so ugly it cannot get them right at first time
543 : : and their visibility needs to be copied from their "masters" at
544 : : the end of parsing. */
545 : : unsigned cpp_implicit_alias : 1;
546 : : /* The alias is a symbol version. */
547 : : unsigned symver : 1;
548 : : /* Set once the definition was analyzed. The list of references and
549 : : other properties are built during analysis. */
550 : : unsigned analyzed : 1;
551 : : /* Set for write-only variables. */
552 : : unsigned writeonly : 1;
553 : : /* Visibility of symbol was used for further optimization; do not
554 : : permit further changes. */
555 : : unsigned refuse_visibility_changes : 1;
556 : :
557 : : /*** Visibility and linkage flags. ***/
558 : :
559 : : /* Set when function is visible by other units. */
560 : : unsigned externally_visible : 1;
561 : : /* Don't reorder to other symbols having this set. */
562 : : unsigned no_reorder : 1;
563 : : /* The symbol will be assumed to be used in an invisible way (like
564 : : by an toplevel asm statement). */
565 : : unsigned force_output : 1;
566 : : /* Like FORCE_OUTPUT, but in the case it is ABI requiring the symbol to be
567 : : exported. Unlike FORCE_OUTPUT this flag gets cleared to symbols promoted
568 : : to static and it does not inhibit optimization. */
569 : : unsigned forced_by_abi : 1;
570 : : /* True when the name is known to be unique and thus it does not need mangling. */
571 : : unsigned unique_name : 1;
572 : : /* Specify whether the section was set by user or by
573 : : compiler via -ffunction-sections. */
574 : : unsigned implicit_section : 1;
575 : : /* True when body and other characteristics have been removed by
576 : : symtab_remove_unreachable_nodes. */
577 : : unsigned body_removed : 1;
578 : : /* True when symbol should comply to -fsemantic-interposition flag. */
579 : : unsigned semantic_interposition : 1;
580 : :
581 : : /*** WHOPR Partitioning flags.
582 : : These flags are used at ltrans stage when only part of the callgraph is
583 : : available. ***/
584 : :
585 : : /* Set when variable is used from other LTRANS partition. */
586 : : unsigned used_from_other_partition : 1;
587 : : /* Set when function is available in the other LTRANS partition.
588 : : During WPA output it is used to mark nodes that are present in
589 : : multiple partitions. */
590 : : unsigned in_other_partition : 1;
591 : :
592 : :
593 : :
594 : : /*** other flags. ***/
595 : :
596 : : /* Set when symbol has address taken. */
597 : : unsigned address_taken : 1;
598 : : /* Set when init priority is set. */
599 : : unsigned in_init_priority_hash : 1;
600 : :
601 : : /* Set when symbol needs to be streamed into LTO bytecode for LTO, or in case
602 : : of offloading, for separate compilation for a different target. */
603 : : unsigned need_lto_streaming : 1;
604 : :
605 : : /* Set when symbol can be streamed into bytecode for offloading. */
606 : : unsigned offloadable : 1;
607 : :
608 : : /* Set when symbol is an IFUNC resolver. */
609 : : unsigned ifunc_resolver : 1;
610 : :
611 : :
612 : : /* Ordering of all symtab entries. */
613 : : int order;
614 : :
615 : : /* Declaration representing the symbol. */
616 : : tree decl;
617 : :
618 : : /* Linked list of symbol table entries starting with symtab_nodes. */
619 : : symtab_node *next;
620 : : symtab_node *previous;
621 : :
622 : : /* Linked list of symbols with the same asm name. There may be multiple
623 : : entries for single symbol name during LTO, because symbols are renamed
624 : : only after partitioning.
625 : :
626 : : Because inline clones are kept in the assembler name has, they also produce
627 : : duplicate entries.
628 : :
629 : : There are also several long standing bugs where frontends and builtin
630 : : code produce duplicated decls. */
631 : : symtab_node *next_sharing_asm_name;
632 : : symtab_node *previous_sharing_asm_name;
633 : :
634 : : /* Circular list of nodes in the same comdat group if non-NULL. */
635 : : symtab_node *same_comdat_group;
636 : :
637 : : /* Vectors of referring and referenced entities. */
638 : : ipa_ref_list GTY((skip)) ref_list;
639 : :
640 : : /* Alias target. May be either DECL pointer or ASSEMBLER_NAME pointer
641 : : depending to what was known to frontend on the creation time.
642 : : Once alias is resolved, this pointer become NULL. */
643 : : tree alias_target;
644 : :
645 : : /* File stream where this node is being written to. */
646 : : struct lto_file_decl_data * lto_file_data;
647 : :
648 : : void *GTY ((skip)) aux;
649 : :
650 : : /* Comdat group the symbol is in. Can be private if GGC allowed that. */
651 : : tree x_comdat_group;
652 : :
653 : : /* Section name. Again can be private, if allowed. */
654 : : section_hash_entry *x_section;
655 : :
656 : : protected:
657 : : /* Dump base fields of symtab nodes to F. Not to be used directly. */
658 : : void dump_base (FILE *);
659 : :
660 : : /* Verify common part of symtab node. */
661 : : bool DEBUG_FUNCTION verify_base (void);
662 : :
663 : : /* Remove node from symbol table. This function is not used directly, but via
664 : : cgraph/varpool node removal routines. */
665 : : void unregister (struct clone_info *);
666 : :
667 : : /* Return the initialization and finalization priority information for
668 : : DECL. If there is no previous priority information, a freshly
669 : : allocated structure is returned. */
670 : : struct symbol_priority_map *priority_info (void);
671 : :
672 : : /* Worker for call_for_symbol_and_aliases_1. */
673 : : bool call_for_symbol_and_aliases_1 (bool (*callback) (symtab_node *, void *),
674 : : void *data,
675 : : bool include_overwrite);
676 : : private:
677 : : /* Unique id of the node. */
678 : : int m_uid;
679 : :
680 : : /* Workers for set_section. */
681 : : static bool set_section_from_string (symtab_node *n, void *s);
682 : : static bool set_section_from_node (symtab_node *n, void *o);
683 : :
684 : : /* Worker for symtab_resolve_alias. */
685 : : static bool set_implicit_section (symtab_node *n, void *);
686 : :
687 : : /* Worker searching noninterposable alias. */
688 : : static bool noninterposable_alias (symtab_node *node, void *data);
689 : :
690 : : /* Worker for ultimate_alias_target. */
691 : : symtab_node *ultimate_alias_target_1 (enum availability *avail = NULL,
692 : : symtab_node *ref = NULL);
693 : :
694 : : /* Get dump name with normal or assembly name. */
695 : : const char *get_dump_name (bool asm_name_p) const;
696 : : };
697 : :
698 : : inline void
699 : 1915558 : symtab_node::checking_verify_symtab_nodes (void)
700 : : {
701 : 1915558 : if (flag_checking)
702 : 1915424 : symtab_node::verify_symtab_nodes ();
703 : : }
704 : :
705 : : /* Walk all aliases for NODE. */
706 : : #define FOR_EACH_ALIAS(NODE, ALIAS) \
707 : : for (unsigned ALIAS##_iter_ = 0; \
708 : : (NODE)->iterate_direct_aliases (ALIAS##_iter_, ALIAS); \
709 : : ALIAS##_iter_++)
710 : :
711 : : /* This is the information that is put into the cgraph local structure
712 : : to recover a function. */
713 : : struct lto_file_decl_data;
714 : :
715 : : extern const char * const cgraph_availability_names[];
716 : : extern const char * const ld_plugin_symbol_resolution_names[];
717 : : extern const char * const tls_model_names[];
718 : :
719 : : /* Represent which DECL tree (or reference to such tree)
720 : : will be replaced by another tree while versioning. */
721 : : struct GTY(()) ipa_replace_map
722 : : {
723 : : /* The new (replacing) tree. */
724 : : tree new_tree;
725 : : /* Parameter number to replace, when old_tree is NULL. */
726 : : int parm_num;
727 : : /* Set if the newly added reference should not be an address one, but a load
728 : : one from the operand of the ADDR_EXPR in NEW_TREE. This is for cases when
729 : : the corresponding parameter p is used only as *p. */
730 : : unsigned force_load_ref : 1;
731 : : };
732 : :
733 : : enum cgraph_simd_clone_arg_type
734 : : {
735 : : SIMD_CLONE_ARG_TYPE_VECTOR,
736 : : SIMD_CLONE_ARG_TYPE_UNIFORM,
737 : : /* These are only for integer/pointer arguments passed by value. */
738 : : SIMD_CLONE_ARG_TYPE_LINEAR_CONSTANT_STEP,
739 : : SIMD_CLONE_ARG_TYPE_LINEAR_VARIABLE_STEP,
740 : : /* These 6 are only for reference type arguments or arguments passed
741 : : by reference. */
742 : : SIMD_CLONE_ARG_TYPE_LINEAR_REF_CONSTANT_STEP,
743 : : SIMD_CLONE_ARG_TYPE_LINEAR_REF_VARIABLE_STEP,
744 : : SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_CONSTANT_STEP,
745 : : SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_VARIABLE_STEP,
746 : : SIMD_CLONE_ARG_TYPE_LINEAR_VAL_CONSTANT_STEP,
747 : : SIMD_CLONE_ARG_TYPE_LINEAR_VAL_VARIABLE_STEP,
748 : : SIMD_CLONE_ARG_TYPE_MASK
749 : : };
750 : :
751 : : /* Function arguments in the original function of a SIMD clone.
752 : : Supplementary data for `struct simd_clone'. */
753 : :
754 : : struct GTY(()) cgraph_simd_clone_arg {
755 : : /* Original function argument as it originally existed in
756 : : DECL_ARGUMENTS. */
757 : : tree orig_arg;
758 : :
759 : : /* orig_arg's function (or for extern functions type from
760 : : TYPE_ARG_TYPES). */
761 : : tree orig_type;
762 : :
763 : : /* If argument is a vector, this holds the vector version of
764 : : orig_arg that after adjusting the argument types will live in
765 : : DECL_ARGUMENTS. Otherwise, this is NULL.
766 : :
767 : : This basically holds:
768 : : vector(simdlen) __typeof__(orig_arg) new_arg. */
769 : : tree vector_arg;
770 : :
771 : : /* vector_arg's type (or for extern functions new vector type. */
772 : : tree vector_type;
773 : :
774 : : /* If argument is a vector, this holds the array where the simd
775 : : argument is held while executing the simd clone function. This
776 : : is a local variable in the cloned function. Its content is
777 : : copied from vector_arg upon entry to the clone.
778 : :
779 : : This basically holds:
780 : : __typeof__(orig_arg) simd_array[simdlen]. */
781 : : tree simd_array;
782 : :
783 : : /* A SIMD clone's argument can be either linear (constant or
784 : : variable), uniform, or vector. */
785 : : enum cgraph_simd_clone_arg_type arg_type;
786 : :
787 : : /* Variable alignment if available, otherwise 0. */
788 : : unsigned int alignment;
789 : :
790 : : /* For arg_type SIMD_CLONE_ARG_TYPE_LINEAR_*CONSTANT_STEP this is
791 : : the constant linear step, if arg_type is
792 : : SIMD_CLONE_ARG_TYPE_LINEAR_*VARIABLE_STEP, this is index of
793 : : the uniform argument holding the step, otherwise 0. */
794 : : HOST_WIDE_INT linear_step;
795 : : };
796 : :
797 : : /* Specific data for a SIMD function clone. */
798 : :
799 : : struct GTY(()) cgraph_simd_clone {
800 : : /* Number of words in the SIMD lane associated with this clone. */
801 : : poly_uint64 simdlen;
802 : :
803 : : /* Number of annotated function arguments in `args'. This is
804 : : usually the number of named arguments in FNDECL. */
805 : : unsigned int nargs;
806 : :
807 : : /* Max hardware vector size in bits for integral vectors. */
808 : : poly_uint64 vecsize_int;
809 : :
810 : : /* Max hardware vector size in bits for floating point vectors. */
811 : : poly_uint64 vecsize_float;
812 : :
813 : : /* Machine mode of the mask argument(s), if they are to be passed
814 : : as bitmasks in integer argument(s). VOIDmode if masks are passed
815 : : as vectors of characteristic type. */
816 : : machine_mode mask_mode;
817 : :
818 : : /* The mangling character for a given vector size. This is used
819 : : to determine the ISA mangling bit as specified in the Intel
820 : : Vector ABI. */
821 : : unsigned char vecsize_mangle;
822 : :
823 : : /* True if this is the masked, in-branch version of the clone,
824 : : otherwise false. */
825 : : unsigned int inbranch : 1;
826 : :
827 : : /* Doubly linked list of SIMD clones. */
828 : : cgraph_node *prev_clone, *next_clone;
829 : :
830 : : /* Original cgraph node the SIMD clones were created for. */
831 : : cgraph_node *origin;
832 : :
833 : : /* Annotated function arguments for the original function. */
834 : : cgraph_simd_clone_arg GTY((length ("%h.nargs"))) args[1];
835 : : };
836 : :
837 : : /* Function Multiversioning info. */
838 : : struct GTY((for_user)) cgraph_function_version_info {
839 : : /* The cgraph_node for which the function version info is stored. */
840 : : cgraph_node *this_node;
841 : : /* Chains all the semantically identical function versions. The
842 : : first function in this chain is the version_info node of the
843 : : default function. */
844 : : cgraph_function_version_info *prev;
845 : : /* If this version node corresponds to a dispatcher for function
846 : : versions, this points to the version info node of the default
847 : : function, the first node in the chain. */
848 : : cgraph_function_version_info *next;
849 : : /* If this node corresponds to a function version, this points
850 : : to the dispatcher function decl, which is the function that must
851 : : be called to execute the right function version at run-time.
852 : :
853 : : If this cgraph node is a dispatcher (if dispatcher_function is
854 : : true, in the cgraph_node struct) for function versions, this
855 : : points to resolver function, which holds the function body of the
856 : : dispatcher. The dispatcher decl is an alias to the resolver
857 : : function decl. */
858 : : tree dispatcher_resolver;
859 : : };
860 : :
861 : : #define DEFCIFCODE(code, type, string) CIF_ ## code,
862 : : /* Reasons for inlining failures. */
863 : :
864 : : enum cgraph_inline_failed_t {
865 : : #include "cif-code.def"
866 : : CIF_N_REASONS
867 : : };
868 : :
869 : : enum cgraph_inline_failed_type_t
870 : : {
871 : : CIF_FINAL_NORMAL = 0,
872 : : CIF_FINAL_ERROR
873 : : };
874 : :
875 : : struct cgraph_edge;
876 : :
877 : : struct cgraph_edge_hasher : ggc_ptr_hash<cgraph_edge>
878 : : {
879 : : typedef gimple *compare_type;
880 : :
881 : : static hashval_t hash (cgraph_edge *);
882 : : static hashval_t hash (gimple *);
883 : : static bool equal (cgraph_edge *, gimple *);
884 : : };
885 : :
886 : : /* The cgraph data structure.
887 : : Each function decl has assigned cgraph_node listing callees and callers. */
888 : :
889 : : struct GTY((tag ("SYMTAB_FUNCTION"))) cgraph_node : public symtab_node
890 : : {
891 : : friend class symbol_table;
892 : :
893 : : /* Constructor. */
894 : 94905074 : explicit cgraph_node ()
895 : 189810148 : : symtab_node (SYMTAB_FUNCTION), callees (NULL), callers (NULL),
896 : 94905074 : indirect_calls (NULL),
897 : 94905074 : next_sibling_clone (NULL), prev_sibling_clone (NULL), clones (NULL),
898 : 94905074 : clone_of (NULL), call_site_hash (NULL), former_clone_of (NULL),
899 : 94905074 : simdclone (NULL), simd_clones (NULL), ipa_transforms_to_apply (vNULL),
900 : 94905074 : inlined_to (NULL), rtl (NULL),
901 : 94905074 : count (profile_count::uninitialized ()),
902 : 94905074 : count_materialization_scale (REG_BR_PROB_BASE), profile_id (0),
903 : 94905074 : unit_id (0), tp_first_run (0), thunk (false),
904 : 94905074 : used_as_abstract_origin (false),
905 : 94905074 : lowered (false), process (false), frequency (NODE_FREQUENCY_NORMAL),
906 : 94905074 : only_called_at_startup (false), only_called_at_exit (false),
907 : 94905074 : tm_clone (false), dispatcher_function (false), calls_comdat_local (false),
908 : 94905074 : icf_merged (false), nonfreeing_fn (false), merged_comdat (false),
909 : 94905074 : merged_extern_inline (false), parallelized_function (false),
910 : 94905074 : split_part (false), indirect_call_target (false), local (false),
911 : 94905074 : versionable (false), can_change_signature (false),
912 : 94905074 : redefined_extern_inline (false), tm_may_enter_irr (false),
913 : 94905074 : ipcp_clone (false), gc_candidate (false),
914 : 94905074 : called_by_ifunc_resolver (false), has_omp_variant_constructs (false),
915 : 94905074 : m_summary_id (-1)
916 : 94905074 : {}
917 : :
918 : : /* Remove the node from cgraph and all inline clones inlined into it.
919 : : Skip however removal of FORBIDDEN_NODE and return true if it needs to be
920 : : removed. This allows to call the function from outer loop walking clone
921 : : tree. */
922 : : bool remove_symbol_and_inline_clones (cgraph_node *forbidden_node = NULL);
923 : :
924 : : /* Record all references from cgraph_node that are taken
925 : : in statement STMT. */
926 : : void record_stmt_references (gimple *stmt);
927 : :
928 : : /* Like cgraph_set_call_stmt but walk the clone tree and update all
929 : : clones sharing the same function body.
930 : : When WHOLE_SPECULATIVE_EDGES is true, all three components of
931 : : speculative edge gets updated. Otherwise we update only direct
932 : : call. */
933 : : void set_call_stmt_including_clones (gimple *old_stmt, gcall *new_stmt,
934 : : bool update_speculative = true);
935 : :
936 : : /* Walk the alias chain to return the function cgraph_node is alias of.
937 : : Walk through thunk, too.
938 : : When AVAILABILITY is non-NULL, get minimal availability in the chain.
939 : : When REF is non-NULL, assume that reference happens in symbol REF
940 : : when determining the availability. */
941 : : cgraph_node *function_symbol (enum availability *avail = NULL,
942 : : struct symtab_node *ref = NULL);
943 : :
944 : : /* Walk the alias chain to return the function cgraph_node is alias of.
945 : : Walk through non virtual thunks, too. Thus we return either a function
946 : : or a virtual thunk node.
947 : : When AVAILABILITY is non-NULL, get minimal availability in the chain.
948 : : When REF is non-NULL, assume that reference happens in symbol REF
949 : : when determining the availability. */
950 : : cgraph_node *function_or_virtual_thunk_symbol
951 : : (enum availability *avail = NULL,
952 : : struct symtab_node *ref = NULL);
953 : :
954 : : /* Create node representing clone of N executed COUNT times. Decrease
955 : : the execution counts from original node too.
956 : : The new clone will have decl set to DECL that may or may not be the same
957 : : as decl of N.
958 : :
959 : : When UPDATE_ORIGINAL is true, the counts are subtracted from the original
960 : : function's profile to reflect the fact that part of execution is handled
961 : : by node.
962 : : When CALL_DUPLICATION_HOOK is true, the ipa passes are acknowledged about
963 : : the new clone. Otherwise the caller is responsible for doing so later.
964 : :
965 : : If the new node is being inlined into another one, NEW_INLINED_TO should be
966 : : the outline function the new one is (even indirectly) inlined to.
967 : : All hooks will see this in node's inlined_to, when invoked.
968 : : Can be NULL if the node is not inlined. SUFFIX is string that is appended
969 : : to the original name. */
970 : : cgraph_node *create_clone (tree decl, profile_count count,
971 : : bool update_original,
972 : : vec<cgraph_edge *> redirect_callers,
973 : : bool call_duplication_hook,
974 : : cgraph_node *new_inlined_to,
975 : : ipa_param_adjustments *param_adjustments,
976 : : const char *suffix = NULL);
977 : :
978 : : /* Create callgraph node clone with new declaration. The actual body will be
979 : : copied later at compilation stage. The name of the new clone will be
980 : : constructed from the name of the original node, SUFFIX and NUM_SUFFIX. */
981 : : cgraph_node *create_virtual_clone (const vec<cgraph_edge *> &redirect_callers,
982 : : vec<ipa_replace_map *, va_gc> *tree_map,
983 : : ipa_param_adjustments *param_adjustments,
984 : : const char * suffix, unsigned num_suffix);
985 : :
986 : : /* Remove the node from the tree of virtual and inline clones and make it a
987 : : standalone node - not a clone any more. */
988 : : void remove_from_clone_tree ();
989 : :
990 : : /* cgraph node being removed from symbol table; see if its entry can be
991 : : replaced by other inline clone. */
992 : : cgraph_node *find_replacement (struct clone_info *);
993 : :
994 : : /* Create a new cgraph node which is the new version of
995 : : callgraph node. REDIRECT_CALLERS holds the callers
996 : : edges which should be redirected to point to
997 : : NEW_VERSION. ALL the callees edges of the node
998 : : are cloned to the new version node. Return the new
999 : : version node.
1000 : :
1001 : : If non-NULL BLOCK_TO_COPY determine what basic blocks
1002 : : was copied to prevent duplications of calls that are dead
1003 : : in the clone.
1004 : :
1005 : : SUFFIX is string that is appended to the original name. */
1006 : :
1007 : : cgraph_node *create_version_clone (tree new_decl,
1008 : : vec<cgraph_edge *> redirect_callers,
1009 : : bitmap bbs_to_copy,
1010 : : const char *suffix = NULL);
1011 : :
1012 : : /* Perform function versioning.
1013 : : Function versioning includes copying of the tree and
1014 : : a callgraph update (creating a new cgraph node and updating
1015 : : its callees and callers).
1016 : :
1017 : : REDIRECT_CALLERS varray includes the edges to be redirected
1018 : : to the new version.
1019 : :
1020 : : TREE_MAP is a mapping of tree nodes we want to replace with
1021 : : new ones (according to results of prior analysis).
1022 : :
1023 : : If non-NULL ARGS_TO_SKIP determine function parameters to remove
1024 : : from new version.
1025 : : If SKIP_RETURN is true, the new version will return void.
1026 : : If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
1027 : : If non_NULL NEW_ENTRY determine new entry BB of the clone.
1028 : :
1029 : : If TARGET_ATTRIBUTES is non-null, when creating a new declaration,
1030 : : add the attributes to DECL_ATTRIBUTES. And call valid_attribute_p
1031 : : that will promote value of the attribute DECL_FUNCTION_SPECIFIC_TARGET
1032 : : of the declaration.
1033 : :
1034 : : If VERSION_DECL is set true, use clone_function_name_numbered for the
1035 : : function clone. Otherwise, use clone_function_name.
1036 : :
1037 : : Return the new version's cgraph node. */
1038 : : cgraph_node *create_version_clone_with_body
1039 : : (vec<cgraph_edge *> redirect_callers,
1040 : : vec<ipa_replace_map *, va_gc> *tree_map,
1041 : : ipa_param_adjustments *param_adjustments,
1042 : : bitmap bbs_to_copy, basic_block new_entry_block, const char *clone_name,
1043 : : tree target_attributes = NULL_TREE, bool version_decl = true);
1044 : :
1045 : : /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
1046 : : corresponding to cgraph_node. */
1047 : : cgraph_function_version_info *insert_new_function_version (void);
1048 : :
1049 : : /* Get the cgraph_function_version_info node corresponding to node. */
1050 : : cgraph_function_version_info *function_version (void);
1051 : :
1052 : : /* Discover all functions and variables that are trivially needed, analyze
1053 : : them as well as all functions and variables referred by them */
1054 : : void analyze (void);
1055 : :
1056 : : /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
1057 : : aliases DECL with an adjustments made into the first parameter.
1058 : : See comments in struct symtab-thunks.h for detail on the parameters. */
1059 : : cgraph_node * create_thunk (tree alias, tree, bool this_adjusting,
1060 : : HOST_WIDE_INT fixed_offset,
1061 : : HOST_WIDE_INT virtual_value,
1062 : : HOST_WIDE_INT indirect_offset,
1063 : : tree virtual_offset,
1064 : : tree real_alias);
1065 : :
1066 : :
1067 : : /* Return node that alias is aliasing. */
1068 : : inline cgraph_node *get_alias_target (void);
1069 : :
1070 : : /* Given function symbol, walk the alias chain to return the function node
1071 : : is alias of. Do not walk through thunks.
1072 : : When AVAILABILITY is non-NULL, get minimal availability in the chain.
1073 : : When REF is non-NULL, assume that reference happens in symbol REF
1074 : : when determining the availability. */
1075 : :
1076 : : cgraph_node *ultimate_alias_target (availability *availability = NULL,
1077 : : symtab_node *ref = NULL);
1078 : :
1079 : : /* Call expand_thunk on all callers that are thunks and analyze those
1080 : : nodes that were expanded. */
1081 : : void expand_all_artificial_thunks ();
1082 : :
1083 : : /* Assemble thunks and aliases associated to node. */
1084 : : void assemble_thunks_and_aliases (void);
1085 : :
1086 : : /* Expand function specified by node. */
1087 : : void expand (void);
1088 : :
1089 : : /* Creates a wrapper from cgraph_node to TARGET node. Thunk is used for this
1090 : : kind of wrapper method. */
1091 : : void create_wrapper (cgraph_node *target);
1092 : :
1093 : : /* Verify cgraph nodes of the cgraph node. */
1094 : : void DEBUG_FUNCTION verify_node (void);
1095 : :
1096 : : /* Remove function from symbol table. */
1097 : : void remove (void);
1098 : :
1099 : : /* Dump call graph node to file F. */
1100 : : void dump (FILE *f);
1101 : :
1102 : : /* Dump call graph node to file F. */
1103 : : void dump_graphviz (FILE *f);
1104 : :
1105 : : /* Dump call graph node to stderr. */
1106 : : void DEBUG_FUNCTION debug (void);
1107 : :
1108 : : /* When doing LTO, read cgraph_node's body from disk if it is not already
1109 : : present. */
1110 : : bool get_untransformed_body ();
1111 : :
1112 : : /* Prepare function body. When doing LTO, read cgraph_node's body from disk
1113 : : if it is not already present. When some IPA transformations are scheduled,
1114 : : apply them. */
1115 : : bool get_body ();
1116 : :
1117 : : void materialize_clone (void);
1118 : :
1119 : : /* Release memory used to represent body of function.
1120 : : Use this only for functions that are released before being translated to
1121 : : target code (i.e. RTL). Functions that are compiled to RTL and beyond
1122 : : are free'd in final.cc via free_after_compilation(). */
1123 : : void release_body (bool keep_arguments = false);
1124 : :
1125 : : /* Return the DECL_STRUCT_FUNCTION of the function. */
1126 : : struct function *get_fun () const;
1127 : :
1128 : : /* Bring cgraph node local. */
1129 : : void make_local (void);
1130 : :
1131 : : /* Likewise indicate that a node is having address taken. */
1132 : : void mark_address_taken (void);
1133 : :
1134 : : /* Set finalization priority to PRIORITY. */
1135 : : void set_fini_priority (priority_type priority);
1136 : :
1137 : : /* Return the finalization priority. */
1138 : : priority_type get_fini_priority (void);
1139 : :
1140 : : /* Create edge from a given function to CALLEE in the cgraph. */
1141 : : cgraph_edge *create_edge (cgraph_node *callee,
1142 : : gcall *call_stmt, profile_count count,
1143 : : bool cloning_p = false);
1144 : :
1145 : : /* Create an indirect edge with a yet-undetermined callee where the call
1146 : : statement destination is a formal parameter of the caller with index
1147 : : PARAM_INDEX. */
1148 : : cgraph_edge *create_indirect_edge (gcall *call_stmt, int ecf_flags,
1149 : : profile_count count,
1150 : : bool cloning_p = false);
1151 : :
1152 : : /* Like cgraph_create_edge walk the clone tree and update all clones sharing
1153 : : same function body. If clones already have edge for OLD_STMT; only
1154 : : update the edge same way as cgraph_set_call_stmt_including_clones does. */
1155 : : void create_edge_including_clones (cgraph_node *callee,
1156 : : gimple *old_stmt, gcall *stmt,
1157 : : profile_count count,
1158 : : cgraph_inline_failed_t reason);
1159 : :
1160 : : /* Return the callgraph edge representing the GIMPLE_CALL statement
1161 : : CALL_STMT. */
1162 : : cgraph_edge *get_edge (gimple *call_stmt);
1163 : :
1164 : : /* Collect all callers of cgraph_node and its aliases that are known to lead
1165 : : to NODE (i.e. are not overwritable) and that are not thunks. */
1166 : : auto_vec<cgraph_edge *> collect_callers (void);
1167 : :
1168 : : /* Remove all callers from the node. */
1169 : : void remove_callers (void);
1170 : :
1171 : : /* Remove all callees from the node. */
1172 : : void remove_callees (void);
1173 : :
1174 : : /* Return function availability. See cgraph.h for description of individual
1175 : : return values. */
1176 : : enum availability get_availability (symtab_node *ref = NULL);
1177 : :
1178 : : /* Set TREE_NOTHROW on cgraph_node's decl and on aliases of the node
1179 : : if any to NOTHROW. */
1180 : : bool set_nothrow_flag (bool nothrow);
1181 : :
1182 : : /* SET DECL_IS_MALLOC on cgraph_node's decl and on aliases of the node
1183 : : if any. */
1184 : : bool set_malloc_flag (bool malloc_p);
1185 : :
1186 : : /* SET TREE_THIS_VOLATILE on cgraph_node's decl and on aliases of the node
1187 : : if any. */
1188 : : bool set_noreturn_flag (bool noreturn_p);
1189 : :
1190 : : /* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
1191 : : If SET_CONST if false, clear the flag.
1192 : :
1193 : : When setting the flag be careful about possible interposition and
1194 : : do not set the flag for functions that can be interposed and set pure
1195 : : flag for functions that can bind to other definition.
1196 : :
1197 : : Return true if any change was done. */
1198 : :
1199 : : bool set_const_flag (bool set_const, bool looping);
1200 : :
1201 : : /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
1202 : : if any to PURE.
1203 : :
1204 : : When setting the flag, be careful about possible interposition.
1205 : : Return true if any change was done. */
1206 : :
1207 : : bool set_pure_flag (bool pure, bool looping);
1208 : :
1209 : : /* Add attribute ATTR to cgraph_node's decl and on aliases of the node
1210 : : if any. */
1211 : : bool add_detected_attribute (const char *attr);
1212 : :
1213 : : /* Call callback on function and aliases associated to the function.
1214 : : When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
1215 : : skipped. */
1216 : :
1217 : : bool call_for_symbol_and_aliases (bool (*callback) (cgraph_node *,
1218 : : void *),
1219 : : void *data, bool include_overwritable);
1220 : :
1221 : : /* Call callback on cgraph_node, thunks and aliases associated to NODE.
1222 : : When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
1223 : : skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
1224 : : skipped. */
1225 : : bool call_for_symbol_thunks_and_aliases (bool (*callback) (cgraph_node *node,
1226 : : void *data),
1227 : : void *data,
1228 : : bool include_overwritable,
1229 : : bool exclude_virtual_thunks = false);
1230 : :
1231 : : /* Likewise indicate that a node is needed, i.e. reachable via some
1232 : : external means. */
1233 : : inline void mark_force_output (void);
1234 : :
1235 : : /* Return true when function can be marked local. */
1236 : : bool local_p (void);
1237 : :
1238 : : /* Return true if cgraph_node can be made local for API change.
1239 : : Extern inline functions and C++ COMDAT functions can be made local
1240 : : at the expense of possible code size growth if function is used in multiple
1241 : : compilation units. */
1242 : : bool can_be_local_p (void);
1243 : :
1244 : : /* Return true when cgraph_node cannot return or throw and thus
1245 : : it is safe to ignore its side effects for IPA analysis. */
1246 : : bool cannot_return_p (void);
1247 : :
1248 : : /* Return true when function cgraph_node and all its aliases are only called
1249 : : directly.
1250 : : i.e. it is not externally visible, address was not taken and
1251 : : it is not used in any other non-standard way. */
1252 : : bool only_called_directly_p (void);
1253 : :
1254 : : /* Return true when function is only called directly or it has alias.
1255 : : i.e. it is not externally visible, address was not taken and
1256 : : it is not used in any other non-standard way. */
1257 : : inline bool only_called_directly_or_aliased_p (void);
1258 : :
1259 : : /* Return true when function cgraph_node can be expected to be removed
1260 : : from program when direct calls in this compilation unit are removed.
1261 : :
1262 : : As a special case COMDAT functions are
1263 : : cgraph_can_remove_if_no_direct_calls_p while the are not
1264 : : cgraph_only_called_directly_p (it is possible they are called from other
1265 : : unit)
1266 : :
1267 : : This function behaves as cgraph_only_called_directly_p because eliminating
1268 : : all uses of COMDAT function does not make it necessarily disappear from
1269 : : the program unless we are compiling whole program or we do LTO. In this
1270 : : case we know we win since dynamic linking will not really discard the
1271 : : linkonce section.
1272 : :
1273 : : If WILL_INLINE is true, assume that function will be inlined into all the
1274 : : direct calls. */
1275 : : bool will_be_removed_from_program_if_no_direct_calls_p
1276 : : (bool will_inline = false);
1277 : :
1278 : : /* Return true when function can be removed from callgraph
1279 : : if all direct calls and references are eliminated. The function does
1280 : : not take into account comdat groups. */
1281 : : bool can_remove_if_no_direct_calls_and_refs_p (void);
1282 : :
1283 : : /* Return true when function cgraph_node and its aliases can be removed from
1284 : : callgraph if all direct calls are eliminated.
1285 : : If WILL_INLINE is true, assume that function will be inlined into all the
1286 : : direct calls. */
1287 : : bool can_remove_if_no_direct_calls_p (bool will_inline = false);
1288 : :
1289 : : /* Return true when callgraph node is a function with Gimple body defined
1290 : : in current unit. Functions can also be define externally or they
1291 : : can be thunks with no Gimple representation.
1292 : :
1293 : : Note that at WPA stage, the function body may not be present in memory. */
1294 : : inline bool has_gimple_body_p (void);
1295 : :
1296 : : /* Return true if this node represents a former, i.e. an expanded, thunk. */
1297 : : bool former_thunk_p (void);
1298 : :
1299 : : /* Check if function calls comdat local. This is used to recompute
1300 : : calls_comdat_local flag after function transformations. */
1301 : : bool check_calls_comdat_local_p ();
1302 : :
1303 : : /* Return true if function should be optimized for size. */
1304 : : enum optimize_size_level optimize_for_size_p (void);
1305 : :
1306 : : /* Dump the callgraph to file F. */
1307 : : static void dump_cgraph (FILE *f);
1308 : :
1309 : : /* Dump the call graph to stderr. */
1310 : : static inline
1311 : : void debug_cgraph (void)
1312 : : {
1313 : : dump_cgraph (stderr);
1314 : : }
1315 : :
1316 : : /* Get summary id of the node. */
1317 : 866256708 : inline int get_summary_id ()
1318 : : {
1319 : 866256708 : return m_summary_id;
1320 : : }
1321 : :
1322 : : /* Record that DECL1 and DECL2 are semantically identical function
1323 : : versions. */
1324 : : static void record_function_versions (tree decl1, tree decl2);
1325 : :
1326 : : /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
1327 : : DECL is a duplicate declaration. */
1328 : : static void delete_function_version_by_decl (tree decl);
1329 : :
1330 : : /* Add the function FNDECL to the call graph.
1331 : : Unlike finalize_function, this function is intended to be used
1332 : : by middle end and allows insertion of new function at arbitrary point
1333 : : of compilation. The function can be either in high, low or SSA form
1334 : : GIMPLE.
1335 : :
1336 : : The function is assumed to be reachable and have address taken (so no
1337 : : API breaking optimizations are performed on it).
1338 : :
1339 : : Main work done by this function is to enqueue the function for later
1340 : : processing to avoid need the passes to be re-entrant. */
1341 : : static void add_new_function (tree fndecl, bool lowered);
1342 : :
1343 : : /* Return callgraph node for given symbol and check it is a function. */
1344 : 5048220915 : static inline cgraph_node *get (const_tree decl)
1345 : : {
1346 : 5048220915 : gcc_checking_assert (TREE_CODE (decl) == FUNCTION_DECL);
1347 : 5048220915 : return dyn_cast <cgraph_node *> (symtab_node::get (decl));
1348 : : }
1349 : :
1350 : : /* DECL has been parsed. Take it, queue it, compile it at the whim of the
1351 : : logic in effect. If NO_COLLECT is true, then our caller cannot stand to
1352 : : have the garbage collector run at the moment. We would need to either
1353 : : create a new GC context, or just not compile right now. */
1354 : : static void finalize_function (tree, bool);
1355 : :
1356 : : /* Return cgraph node assigned to DECL. Create new one when needed. */
1357 : : static cgraph_node * create (tree decl);
1358 : :
1359 : : /* Try to find a call graph node for declaration DECL and if it does not
1360 : : exist or if it corresponds to an inline clone, create a new one. */
1361 : : static cgraph_node * get_create (tree);
1362 : :
1363 : : /* Return local info for the compiled function. */
1364 : : static cgraph_node *local_info_node (tree decl);
1365 : :
1366 : : /* Return RTL info for the compiled function. */
1367 : : static struct cgraph_rtl_info *rtl_info (const_tree);
1368 : :
1369 : : /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
1370 : : Return NULL if there's no such node. */
1371 : : static cgraph_node *get_for_asmname (tree asmname);
1372 : :
1373 : : /* Attempt to mark ALIAS as an alias to DECL. Return alias node if
1374 : : successful and NULL otherwise.
1375 : : Same body aliases are output whenever the body of DECL is output,
1376 : : and cgraph_node::get (ALIAS) transparently
1377 : : returns cgraph_node::get (DECL). */
1378 : : static cgraph_node * create_same_body_alias (tree alias, tree decl);
1379 : :
1380 : : /* Verify whole cgraph structure. */
1381 : : static void DEBUG_FUNCTION verify_cgraph_nodes (void);
1382 : :
1383 : : /* Verify cgraph, if consistency checking is enabled. */
1384 : : static inline void checking_verify_cgraph_nodes (void);
1385 : :
1386 : : /* Worker to bring NODE local. */
1387 : : static bool make_local (cgraph_node *node, void *);
1388 : :
1389 : : /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
1390 : : the function body is associated
1391 : : with (not necessarily cgraph_node (DECL). */
1392 : : static cgraph_node *create_alias (tree alias, tree target);
1393 : :
1394 : : /* Return true if NODE has thunk. */
1395 : : static bool has_thunk_p (cgraph_node *node, void *);
1396 : :
1397 : : cgraph_edge *callees;
1398 : : cgraph_edge *callers;
1399 : : /* List of edges representing indirect calls with a yet undetermined
1400 : : callee. */
1401 : : cgraph_edge *indirect_calls;
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;
1411 : :
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;
1417 : :
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, va_heap, vl_ptr> GTY((skip)) ipa_transforms_to_apply;
1422 : :
1423 : : /* For inline clones this points to the function they will be
1424 : : inlined into. */
1425 : : cgraph_node *inlined_to;
1426 : :
1427 : : struct cgraph_rtl_info *rtl;
1428 : :
1429 : : /* Expected number of executions: calculated in profile.cc. */
1430 : : profile_count count;
1431 : : /* How to scale counts at materialization time; used to merge
1432 : : LTO units with different number of profile runs. */
1433 : : int count_materialization_scale;
1434 : : /* ID assigned by the profiling. */
1435 : : unsigned int profile_id;
1436 : : /* ID of the translation unit. */
1437 : : int unit_id;
1438 : : /* Time profiler: first run of function. */
1439 : : int tp_first_run;
1440 : :
1441 : : /* True when symbol is a thunk. */
1442 : : unsigned thunk : 1;
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
1449 : : lists created. */
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. */
1486 : : unsigned local : 1;
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
1493 : : redefined now. */
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;
1499 : : /* True if the function should only be emitted if it is used. This flag
1500 : : is set for local SIMD clones when they are created and cleared if the
1501 : : vectorizer uses them. */
1502 : : unsigned gc_candidate : 1;
1503 : : /* Set if the function is called by an IFUNC resolver. */
1504 : : unsigned called_by_ifunc_resolver : 1;
1505 : : /* True if the function contains unresolved OpenMP metadirectives. */
1506 : : unsigned has_omp_variant_constructs : 1;
1507 : :
1508 : : private:
1509 : :
1510 : : /* Summary id that is recycled. */
1511 : : int m_summary_id;
1512 : :
1513 : : /* Worker for call_for_symbol_and_aliases. */
1514 : : bool call_for_symbol_and_aliases_1 (bool (*callback) (cgraph_node *,
1515 : : void *),
1516 : : void *data, bool include_overwritable);
1517 : : };
1518 : :
1519 : : /* A cgraph node set is a collection of cgraph nodes. A cgraph node
1520 : : can appear in multiple sets. */
1521 : : struct cgraph_node_set_def
1522 : : {
1523 : : hash_map<cgraph_node *, size_t> *map;
1524 : : vec<cgraph_node *> nodes;
1525 : : };
1526 : :
1527 : : typedef cgraph_node_set_def *cgraph_node_set;
1528 : : typedef struct varpool_node_set_def *varpool_node_set;
1529 : :
1530 : : struct varpool_node;
1531 : :
1532 : : /* A varpool node set is a collection of varpool nodes. A varpool node
1533 : : can appear in multiple sets. */
1534 : : struct varpool_node_set_def
1535 : : {
1536 : : hash_map<varpool_node *, size_t> * map;
1537 : : vec<varpool_node *> nodes;
1538 : : };
1539 : :
1540 : : /* Iterator structure for cgraph node sets. */
1541 : : struct cgraph_node_set_iterator
1542 : : {
1543 : : cgraph_node_set set;
1544 : : unsigned index;
1545 : : };
1546 : :
1547 : : /* Iterator structure for varpool node sets. */
1548 : : struct varpool_node_set_iterator
1549 : : {
1550 : : varpool_node_set set;
1551 : : unsigned index;
1552 : : };
1553 : :
1554 : : /* Context of polymorphic call. It represent information about the type of
1555 : : instance that may reach the call. This is used by ipa-devirt walkers of the
1556 : : type inheritance graph. */
1557 : :
1558 : : class GTY(()) ipa_polymorphic_call_context {
1559 : : public:
1560 : : /* The called object appears in an object of type OUTER_TYPE
1561 : : at offset OFFSET. When information is not 100% reliable, we
1562 : : use SPECULATIVE_OUTER_TYPE and SPECULATIVE_OFFSET. */
1563 : : HOST_WIDE_INT offset;
1564 : : HOST_WIDE_INT speculative_offset;
1565 : : tree outer_type;
1566 : : tree speculative_outer_type;
1567 : : /* True if outer object may be in construction or destruction. */
1568 : : unsigned maybe_in_construction : 1;
1569 : : /* True if outer object may be of derived type. */
1570 : : unsigned maybe_derived_type : 1;
1571 : : /* True if speculative outer object may be of derived type. We always
1572 : : speculate that construction does not happen. */
1573 : : unsigned speculative_maybe_derived_type : 1;
1574 : : /* True if the context is invalid and all calls should be redirected
1575 : : to BUILTIN_UNREACHABLE. */
1576 : : unsigned invalid : 1;
1577 : : /* True if the outer type is dynamic. */
1578 : : unsigned dynamic : 1;
1579 : :
1580 : : /* Build empty "I know nothing" context. */
1581 : : ipa_polymorphic_call_context ();
1582 : : /* Build polymorphic call context for indirect call E. */
1583 : : ipa_polymorphic_call_context (cgraph_edge *e);
1584 : : /* Build polymorphic call context for IP invariant CST.
1585 : : If specified, OTR_TYPE specify the type of polymorphic call
1586 : : that takes CST+OFFSET as a parameter. */
1587 : : ipa_polymorphic_call_context (tree cst, tree otr_type = NULL,
1588 : : HOST_WIDE_INT offset = 0);
1589 : : /* Build context for pointer REF contained in FNDECL at statement STMT.
1590 : : if INSTANCE is non-NULL, return pointer to the object described by
1591 : : the context. */
1592 : : ipa_polymorphic_call_context (tree fndecl, tree ref, gimple *stmt,
1593 : : tree *instance = NULL);
1594 : :
1595 : : /* Look for vtable stores or constructor calls to work out dynamic type
1596 : : of memory location. */
1597 : : bool get_dynamic_type (tree, tree, tree, gimple *, unsigned *);
1598 : :
1599 : : /* Make context non-speculative. */
1600 : : void clear_speculation ();
1601 : :
1602 : : /* Produce context specifying all derived types of OTR_TYPE. If OTR_TYPE is
1603 : : NULL, the context is set to dummy "I know nothing" setting. */
1604 : : void clear_outer_type (tree otr_type = NULL);
1605 : :
1606 : : /* Walk container types and modify context to point to actual class
1607 : : containing OTR_TYPE (if non-NULL) as base class.
1608 : : Return true if resulting context is valid.
1609 : :
1610 : : When CONSIDER_PLACEMENT_NEW is false, reject contexts that may be made
1611 : : valid only via allocation of new polymorphic type inside by means
1612 : : of placement new.
1613 : :
1614 : : When CONSIDER_BASES is false, only look for actual fields, not base types
1615 : : of TYPE. */
1616 : : bool restrict_to_inner_class (tree otr_type,
1617 : : bool consider_placement_new = true,
1618 : : bool consider_bases = true);
1619 : :
1620 : : /* Adjust all offsets in contexts by given number of bits. */
1621 : : void offset_by (HOST_WIDE_INT);
1622 : : /* Use when we cannot track dynamic type change. This speculatively assume
1623 : : type change is not happening. */
1624 : : void possible_dynamic_type_change (bool, tree otr_type = NULL);
1625 : : /* Assume that both THIS and a given context is valid and strengthen THIS
1626 : : if possible. Return true if any strengthening was made.
1627 : : If actual type the context is being used in is known, OTR_TYPE should be
1628 : : set accordingly. This improves quality of combined result. */
1629 : : bool combine_with (ipa_polymorphic_call_context, tree otr_type = NULL);
1630 : : bool meet_with (ipa_polymorphic_call_context, tree otr_type = NULL);
1631 : :
1632 : : /* Return TRUE if context is fully useless. */
1633 : : bool useless_p () const;
1634 : : /* Return TRUE if this context conveys the same information as X. */
1635 : : bool equal_to (const ipa_polymorphic_call_context &x) const;
1636 : :
1637 : : /* Dump human readable context to F. If NEWLINE is true, it will be
1638 : : terminated by a newline. */
1639 : : void dump (FILE *f, bool newline = true) const;
1640 : : void DEBUG_FUNCTION debug () const;
1641 : :
1642 : : /* LTO streaming. */
1643 : : void stream_out (struct output_block *) const;
1644 : : void stream_in (class lto_input_block *, class data_in *data_in);
1645 : :
1646 : : private:
1647 : : bool combine_speculation_with (tree, HOST_WIDE_INT, bool, tree);
1648 : : bool meet_speculation_with (tree, HOST_WIDE_INT, bool, tree);
1649 : : void set_by_decl (tree, HOST_WIDE_INT);
1650 : : bool set_by_invariant (tree, tree, HOST_WIDE_INT);
1651 : : bool speculation_consistent_p (tree, HOST_WIDE_INT, bool, tree) const;
1652 : : void make_speculative (tree otr_type = NULL);
1653 : : };
1654 : :
1655 : : /* Structure containing additional information about an indirect call. */
1656 : :
1657 : : class GTY(()) cgraph_indirect_call_info
1658 : : {
1659 : : public:
1660 : : /* When agg_content is set, an offset where the call pointer is located
1661 : : within the aggregate. */
1662 : : HOST_WIDE_INT offset;
1663 : : /* Context of the polymorphic call; use only when POLYMORPHIC flag is set. */
1664 : : ipa_polymorphic_call_context context;
1665 : : /* OBJ_TYPE_REF_TOKEN of a polymorphic call (if polymorphic is set). */
1666 : : HOST_WIDE_INT otr_token;
1667 : : /* Type of the object from OBJ_TYPE_REF_OBJECT. */
1668 : : tree otr_type;
1669 : : /* Index of the parameter that is called. */
1670 : : int param_index;
1671 : : /* ECF flags determined from the caller. */
1672 : : int ecf_flags;
1673 : :
1674 : : /* Number of speculative call targets, it's less than GCOV_TOPN_VALUES. */
1675 : : unsigned num_speculative_call_targets : 16;
1676 : :
1677 : : /* Set when the call is a virtual call with the parameter being the
1678 : : associated object pointer rather than a simple direct call. */
1679 : : unsigned polymorphic : 1;
1680 : : /* Set when the call is a call of a pointer loaded from contents of an
1681 : : aggregate at offset. */
1682 : : unsigned agg_contents : 1;
1683 : : /* Set when this is a call through a member pointer. */
1684 : : unsigned member_ptr : 1;
1685 : : /* When the agg_contents bit is set, this one determines whether the
1686 : : destination is loaded from a parameter passed by reference. */
1687 : : unsigned by_ref : 1;
1688 : : /* When the agg_contents bit is set, this one determines whether we can
1689 : : deduce from the function body that the loaded value from the reference is
1690 : : never modified between the invocation of the function and the load
1691 : : point. */
1692 : : unsigned guaranteed_unmodified : 1;
1693 : : /* For polymorphic calls this specify whether the virtual table pointer
1694 : : may have changed in between function entry and the call. */
1695 : : unsigned vptr_changed : 1;
1696 : : };
1697 : :
1698 : : class GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"),
1699 : : for_user)) cgraph_edge
1700 : : {
1701 : : public:
1702 : : friend struct cgraph_node;
1703 : : friend class symbol_table;
1704 : :
1705 : : /* Remove EDGE from the cgraph. */
1706 : : static void remove (cgraph_edge *edge);
1707 : :
1708 : : /* Change field call_stmt of edge E to NEW_STMT. If UPDATE_SPECULATIVE and E
1709 : : is any component of speculative edge, then update all components.
1710 : : Speculations can be resolved in the process and EDGE can be removed and
1711 : : deallocated. Return the edge that now represents the call. */
1712 : : static cgraph_edge *set_call_stmt (cgraph_edge *e, gcall *new_stmt,
1713 : : bool update_speculative = true);
1714 : :
1715 : : /* Redirect callee of the edge to N. The function does not update underlying
1716 : : call expression. */
1717 : : void redirect_callee (cgraph_node *n);
1718 : :
1719 : : /* If the edge does not lead to a thunk, simply redirect it to N. Otherwise
1720 : : create one or more equivalent thunks for N and redirect E to the first in
1721 : : the chain. Note that it is then necessary to call
1722 : : n->expand_all_artificial_thunks once all callers are redirected. */
1723 : : void redirect_callee_duplicating_thunks (cgraph_node *n);
1724 : :
1725 : : /* Make an indirect edge with an unknown callee an ordinary edge leading to
1726 : : CALLEE. Speculations can be resolved in the process and EDGE can be
1727 : : removed and deallocated. Return the edge that now represents the
1728 : : call. */
1729 : : static cgraph_edge *make_direct (cgraph_edge *edge, cgraph_node *callee);
1730 : :
1731 : : /* Turn edge into speculative call calling N2. Update
1732 : : the profile so the direct call is taken COUNT times
1733 : : with FREQUENCY. speculative_id is used to link direct calls with their
1734 : : corresponding IPA_REF_ADDR references when representing speculative calls.
1735 : : */
1736 : : cgraph_edge *make_speculative (cgraph_node *n2, profile_count direct_count,
1737 : : unsigned int speculative_id = 0);
1738 : :
1739 : : /* Speculative call consists of an indirect edge and one or more
1740 : : direct edge+ref pairs. Speculative will expand to the following sequence:
1741 : :
1742 : : if (call_dest == target1) // reference to target1
1743 : : target1 (); // direct call to target1
1744 : : else if (call_dest == target2) // reference to targt2
1745 : : target2 (); // direct call to target2
1746 : : else
1747 : : call_dest (); // indirect call
1748 : :
1749 : : Before the expansion we will have indirect call and the direct call+ref
1750 : : pairs all linked to single statement.
1751 : :
1752 : : Note that ref may point to different symbol than the corresponding call
1753 : : becuase the speculated edge may have been optimized (redirected to
1754 : : a clone) or inlined.
1755 : :
1756 : : Given an edge which is part of speculative call, return the first
1757 : : direct call edge in the speculative call sequence.
1758 : :
1759 : : In the example above called on any cgraph edge in the sequence it will
1760 : : return direct call to target1. */
1761 : : cgraph_edge *first_speculative_call_target ();
1762 : :
1763 : : /* Return next speculative call target or NULL if there is none.
1764 : : All targets are required to form an interval in the callee list.
1765 : :
1766 : : In example above, if called on call to target1 it will return call to
1767 : : target2. */
1768 : 37112 : cgraph_edge *next_speculative_call_target ()
1769 : : {
1770 : 37112 : cgraph_edge *e = this;
1771 : 37112 : gcc_checking_assert (speculative && callee);
1772 : :
1773 : 37112 : if (e->next_callee && e->next_callee->speculative
1774 : 980 : && e->next_callee->call_stmt == e->call_stmt
1775 : 11 : && e->next_callee->lto_stmt_uid == e->lto_stmt_uid)
1776 : 11 : return e->next_callee;
1777 : : return NULL;
1778 : : }
1779 : :
1780 : : /* When called on any edge in the speculative call return the (unique)
1781 : : indirect call edge in the speculative call sequence. */
1782 : 26167 : cgraph_edge *speculative_call_indirect_edge ()
1783 : : {
1784 : 26167 : gcc_checking_assert (speculative);
1785 : 26167 : if (!callee)
1786 : : return this;
1787 : 25854 : for (cgraph_edge *e2 = caller->indirect_calls;
1788 : 4381 : true; e2 = e2->next_callee)
1789 : 30235 : if (e2->speculative
1790 : 28422 : && call_stmt == e2->call_stmt
1791 : 25854 : && lto_stmt_uid == e2->lto_stmt_uid)
1792 : : return e2;
1793 : : }
1794 : :
1795 : : /* When called on any edge in speculative call and when given any target
1796 : : of ref which is speculated to it returns the corresponding direct call.
1797 : :
1798 : : In example above if called on function target2 it will return call to
1799 : : target2. */
1800 : : cgraph_edge *speculative_call_for_target (cgraph_node *);
1801 : :
1802 : : /* Return REF corresponding to direct call in the specualtive call
1803 : : sequence. */
1804 : 22634 : ipa_ref *speculative_call_target_ref ()
1805 : : {
1806 : 22634 : ipa_ref *ref;
1807 : :
1808 : 22634 : gcc_checking_assert (speculative);
1809 : 48522 : for (unsigned int i = 0; caller->iterate_reference (i, ref); i++)
1810 : 24754 : if (ref->speculative && ref->speculative_id == speculative_id
1811 : 24745 : && ref->stmt == (gimple *)call_stmt
1812 : 22640 : && ref->lto_stmt_uid == lto_stmt_uid)
1813 : 22634 : return ref;
1814 : 0 : gcc_unreachable ();
1815 : : }
1816 : :
1817 : : /* Speculative call edge turned out to be direct call to CALLEE_DECL. Remove
1818 : : the speculative call sequence and return edge representing the call, the
1819 : : original EDGE can be removed and deallocated. It is up to caller to
1820 : : redirect the call as appropriate. Return the edge that now represents the
1821 : : call.
1822 : :
1823 : : For "speculative" indirect call that contains multiple "speculative"
1824 : : targets (i.e. edge->indirect_info->num_speculative_call_targets > 1),
1825 : : decrease the count and only remove current direct edge.
1826 : :
1827 : : If no speculative direct call left to the speculative indirect call, remove
1828 : : the speculative of both the indirect call and corresponding direct edge.
1829 : :
1830 : : It is up to caller to iteratively resolve each "speculative" direct call
1831 : : and redirect the call as appropriate. */
1832 : : static cgraph_edge *resolve_speculation (cgraph_edge *edge,
1833 : : tree callee_decl = NULL);
1834 : :
1835 : : /* If necessary, change the function declaration in the call statement
1836 : : associated with edge E so that it corresponds to the edge callee.
1837 : : Speculations can be resolved in the process and EDGE can be removed and
1838 : : deallocated.
1839 : :
1840 : : The edge could be one of speculative direct call generated from speculative
1841 : : indirect call. In this circumstance, decrease the speculative targets
1842 : : count (i.e. num_speculative_call_targets) and redirect call stmt to the
1843 : : corresponding i-th target. If no speculative direct call left to the
1844 : : speculative indirect call, remove "speculative" of the indirect call and
1845 : : also redirect stmt to it's final direct target.
1846 : :
1847 : : When called from within tree-inline, KILLED_SSAs has to contain the
1848 : : pointer to killed_new_ssa_names within the copy_body_data structure and
1849 : : SSAs discovered to be useless (if LHS is removed) will be added to it,
1850 : : otherwise it needs to be NULL.
1851 : :
1852 : : It is up to caller to iteratively transform each "speculative"
1853 : : direct call as appropriate. */
1854 : : static gimple *redirect_call_stmt_to_callee (cgraph_edge *e,
1855 : : hash_set <tree>
1856 : : *killed_ssas = nullptr);
1857 : :
1858 : : /* Create clone of edge in the node N represented
1859 : : by CALL_EXPR the callgraph. */
1860 : : cgraph_edge * clone (cgraph_node *n, gcall *call_stmt, unsigned stmt_uid,
1861 : : profile_count num, profile_count den,
1862 : : bool update_original);
1863 : :
1864 : : /* Verify edge count and frequency. */
1865 : : bool verify_count ();
1866 : :
1867 : : /* Return true when call of edge cannot lead to return from caller
1868 : : and thus it is safe to ignore its side effects for IPA analysis
1869 : : when computing side effects of the caller. */
1870 : : bool cannot_lead_to_return_p (void);
1871 : :
1872 : : /* Return true when the edge represents a direct recursion. */
1873 : : bool recursive_p (void);
1874 : :
1875 : : /* Return true if the edge may be considered hot. */
1876 : : bool maybe_hot_p (void);
1877 : :
1878 : : /* Get unique identifier of the edge. */
1879 : 74930271 : inline int get_uid ()
1880 : : {
1881 : 74930271 : return m_uid;
1882 : : }
1883 : :
1884 : : /* Get summary id of the edge. */
1885 : 1216854939 : inline int get_summary_id ()
1886 : : {
1887 : 1216854939 : return m_summary_id;
1888 : : }
1889 : :
1890 : : /* Rebuild cgraph edges for current function node. This needs to be run after
1891 : : passes that don't update the cgraph. */
1892 : : static unsigned int rebuild_edges (void);
1893 : :
1894 : : /* Rebuild cgraph references for current function node. This needs to be run
1895 : : after passes that don't update the cgraph. */
1896 : : static void rebuild_references (void);
1897 : :
1898 : : /* During LTO stream in this can be used to check whether call can possibly
1899 : : be internal to the current translation unit. */
1900 : : bool possibly_call_in_translation_unit_p (void);
1901 : :
1902 : : /* Return num_speculative_targets of this edge. */
1903 : : int num_speculative_call_targets_p (void);
1904 : :
1905 : : /* Expected number of executions: calculated in profile.cc. */
1906 : : profile_count count;
1907 : : cgraph_node *caller;
1908 : : cgraph_node *callee;
1909 : : cgraph_edge *prev_caller;
1910 : : cgraph_edge *next_caller;
1911 : : cgraph_edge *prev_callee;
1912 : : cgraph_edge *next_callee;
1913 : : gcall *call_stmt;
1914 : : /* Additional information about an indirect call. Not cleared when an edge
1915 : : becomes direct. */
1916 : : cgraph_indirect_call_info *indirect_info;
1917 : : void *GTY ((skip (""))) aux;
1918 : : /* When equal to CIF_OK, inline this call. Otherwise, points to the
1919 : : explanation why function was not inlined. */
1920 : : enum cgraph_inline_failed_t inline_failed;
1921 : : /* The stmt_uid of call_stmt. This is used by LTO to recover the call_stmt
1922 : : when the function is serialized in. */
1923 : : unsigned int lto_stmt_uid;
1924 : : /* speculative id is used to link direct calls with their corresponding
1925 : : IPA_REF_ADDR references when representing speculative calls. */
1926 : : unsigned int speculative_id : 16;
1927 : : /* Whether this edge was made direct by indirect inlining. */
1928 : : unsigned int indirect_inlining_edge : 1;
1929 : : /* Whether this edge describes an indirect call with an undetermined
1930 : : callee. */
1931 : : unsigned int indirect_unknown_callee : 1;
1932 : : /* Whether this edge is still a dangling */
1933 : : /* True if the corresponding CALL stmt cannot be inlined. */
1934 : : unsigned int call_stmt_cannot_inline_p : 1;
1935 : : /* Can this call throw externally? */
1936 : : unsigned int can_throw_external : 1;
1937 : : /* Edges with SPECULATIVE flag represents indirect calls that was
1938 : : speculatively turned into direct (i.e. by profile feedback).
1939 : : The final code sequence will have form:
1940 : :
1941 : : if (call_target == expected_fn)
1942 : : expected_fn ();
1943 : : else
1944 : : call_target ();
1945 : :
1946 : : Every speculative call is represented by three components attached
1947 : : to a same call statement:
1948 : : 1) a direct call (to expected_fn)
1949 : : 2) an indirect call (to call_target)
1950 : : 3) a IPA_REF_ADDR reference to expected_fn.
1951 : :
1952 : : Optimizers may later redirect direct call to clone, so 1) and 3)
1953 : : do not need to necessarily agree with destination. */
1954 : : unsigned int speculative : 1;
1955 : : /* Set to true when caller is a constructor or destructor of polymorphic
1956 : : type. */
1957 : : unsigned in_polymorphic_cdtor : 1;
1958 : :
1959 : : /* Return true if call must bind to current definition. */
1960 : : bool binds_to_current_def_p ();
1961 : :
1962 : : /* Expected frequency of executions within the function.
1963 : : When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
1964 : : per function call. The range is 0 to CGRAPH_FREQ_MAX. */
1965 : : int frequency ();
1966 : :
1967 : : /* Expected frequency of executions within the function. */
1968 : : sreal sreal_frequency ();
1969 : : private:
1970 : : /* Unique id of the edge. */
1971 : : int m_uid;
1972 : :
1973 : : /* Summary id that is recycled. */
1974 : : int m_summary_id;
1975 : :
1976 : : /* Remove the edge from the list of the callers of the callee. */
1977 : : void remove_caller (void);
1978 : :
1979 : : /* Remove the edge from the list of the callees of the caller. */
1980 : : void remove_callee (void);
1981 : :
1982 : : /* Set callee N of call graph edge and add it to the corresponding set of
1983 : : callers. */
1984 : : void set_callee (cgraph_node *n);
1985 : :
1986 : : /* Output flags of edge to a file F. */
1987 : : void dump_edge_flags (FILE *f);
1988 : :
1989 : : /* Dump edge to stderr. */
1990 : : void DEBUG_FUNCTION debug (void);
1991 : :
1992 : : /* Verify that call graph edge corresponds to DECL from the associated
1993 : : statement. Return true if the verification should fail. */
1994 : : bool verify_corresponds_to_fndecl (tree decl);
1995 : : };
1996 : :
1997 : : #define CGRAPH_FREQ_BASE 1000
1998 : : #define CGRAPH_FREQ_MAX 100000
1999 : :
2000 : : /* The varpool data structure.
2001 : : Each static variable decl has assigned varpool_node. */
2002 : :
2003 : : struct GTY((tag ("SYMTAB_VARIABLE"))) varpool_node : public symtab_node
2004 : : {
2005 : : /* Constructor. */
2006 : 20314975 : explicit varpool_node ()
2007 : 40629950 : : symtab_node (SYMTAB_VARIABLE), output (0), dynamically_initialized (0),
2008 : 20314975 : tls_model (TLS_MODEL_NONE), used_by_single_function (0)
2009 : : {}
2010 : :
2011 : : /* Dump given varpool node to F. */
2012 : : void dump (FILE *f);
2013 : :
2014 : : /* Dump given varpool node to stderr. */
2015 : : void DEBUG_FUNCTION debug (void);
2016 : :
2017 : : /* Remove variable from symbol table. */
2018 : : void remove (void);
2019 : :
2020 : : /* Remove node initializer when it is no longer needed. */
2021 : : void remove_initializer (void);
2022 : :
2023 : : void analyze (void);
2024 : :
2025 : : /* Return variable availability. */
2026 : : availability get_availability (symtab_node *ref = NULL);
2027 : :
2028 : : /* When doing LTO, read variable's constructor from disk if
2029 : : it is not already present. */
2030 : : tree get_constructor (void);
2031 : :
2032 : : /* Return true if variable has constructor that can be used for folding. */
2033 : : bool ctor_useable_for_folding_p (void);
2034 : :
2035 : : /* For given variable pool node, walk the alias chain to return the function
2036 : : the variable is alias of. Do not walk through thunks.
2037 : : When AVAILABILITY is non-NULL, get minimal availability in the chain.
2038 : : When REF is non-NULL, assume that reference happens in symbol REF
2039 : : when determining the availability. */
2040 : : inline varpool_node *ultimate_alias_target
2041 : : (availability *availability = NULL, symtab_node *ref = NULL);
2042 : :
2043 : : /* Return node that alias is aliasing. */
2044 : : inline varpool_node *get_alias_target (void);
2045 : :
2046 : : /* Output one variable, if necessary. Return whether we output it. */
2047 : : bool assemble_decl (void);
2048 : :
2049 : : /* For variables in named sections make sure get_variable_section
2050 : : is called before we switch to those sections. Then section
2051 : : conflicts between read-only and read-only requiring relocations
2052 : : sections can be resolved. */
2053 : : void finalize_named_section_flags (void);
2054 : :
2055 : : /* Call callback on varpool symbol and aliases associated to varpool symbol.
2056 : : When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2057 : : skipped. */
2058 : : bool call_for_symbol_and_aliases (bool (*callback) (varpool_node *, void *),
2059 : : void *data,
2060 : : bool include_overwritable);
2061 : :
2062 : : /* Return true when variable should be considered externally visible. */
2063 : : bool externally_visible_p (void);
2064 : :
2065 : : /* Return true when all references to variable must be visible
2066 : : in ipa_ref_list.
2067 : : i.e. if the variable is not externally visible or not used in some magic
2068 : : way (asm statement or such).
2069 : : The magic uses are all summarized in force_output flag. */
2070 : : inline bool all_refs_explicit_p ();
2071 : :
2072 : : /* Return true when variable can be removed from variable pool
2073 : : if all direct calls are eliminated. */
2074 : : inline bool can_remove_if_no_refs_p (void);
2075 : :
2076 : : /* Add the variable DECL to the varpool.
2077 : : Unlike finalize_decl function is intended to be used
2078 : : by middle end and allows insertion of new variable at arbitrary point
2079 : : of compilation. */
2080 : : static void add (tree decl);
2081 : :
2082 : : /* Return varpool node for given symbol and check it is a function. */
2083 : : static inline varpool_node *get (const_tree decl);
2084 : :
2085 : : /* Mark DECL as finalized. By finalizing the declaration, frontend instruct
2086 : : the middle end to output the variable to asm file, if needed or externally
2087 : : visible. */
2088 : : static void finalize_decl (tree decl);
2089 : :
2090 : : /* Attempt to mark ALIAS as an alias to DECL. Return TRUE if successful.
2091 : : Extra name aliases are output whenever DECL is output. */
2092 : : static varpool_node * create_extra_name_alias (tree alias, tree decl);
2093 : :
2094 : : /* Attempt to mark ALIAS as an alias to DECL. Return TRUE if successful.
2095 : : Extra name aliases are output whenever DECL is output. */
2096 : : static varpool_node * create_alias (tree, tree);
2097 : :
2098 : : /* Dump the variable pool to F. */
2099 : : static void dump_varpool (FILE *f);
2100 : :
2101 : : /* Dump the variable pool to stderr. */
2102 : : static void DEBUG_FUNCTION debug_varpool (void);
2103 : :
2104 : : /* Allocate new callgraph node and insert it into basic data structures. */
2105 : : static varpool_node *create_empty (void);
2106 : :
2107 : : /* Return varpool node assigned to DECL. Create new one when needed. */
2108 : : static varpool_node *get_create (tree decl);
2109 : :
2110 : : /* Given an assembler name, lookup node. */
2111 : : static varpool_node *get_for_asmname (tree asmname);
2112 : :
2113 : : /* Set when variable is scheduled to be assembled. */
2114 : : unsigned output : 1;
2115 : :
2116 : : /* Set if the variable is dynamically initialized, except for
2117 : : function local statics. */
2118 : : unsigned dynamically_initialized : 1;
2119 : :
2120 : : ENUM_BITFIELD(tls_model) tls_model : 3;
2121 : :
2122 : : /* Set if the variable is known to be used by single function only.
2123 : : This is computed by ipa_single_use pass and used by late optimizations
2124 : : in places where optimization would be valid for local static variable
2125 : : if we did not do any inter-procedural code movement. */
2126 : : unsigned used_by_single_function : 1;
2127 : :
2128 : : private:
2129 : : /* Assemble thunks and aliases associated to varpool node. */
2130 : : void assemble_aliases (void);
2131 : :
2132 : : /* Worker for call_for_node_and_aliases. */
2133 : : bool call_for_symbol_and_aliases_1 (bool (*callback) (varpool_node *, void *),
2134 : : void *data,
2135 : : bool include_overwritable);
2136 : : };
2137 : :
2138 : : /* Every top level asm statement is put into a asm_node. */
2139 : :
2140 : : struct GTY(()) asm_node {
2141 : : /* Next asm node. */
2142 : : asm_node *next;
2143 : : /* String for this asm node. */
2144 : : tree asm_str;
2145 : : /* Ordering of all cgraph nodes. */
2146 : : int order;
2147 : : };
2148 : :
2149 : : /* Report whether or not THIS symtab node is a function, aka cgraph_node. */
2150 : :
2151 : : template <>
2152 : : template <>
2153 : : inline bool
2154 : 10269382317 : is_a_helper <cgraph_node *>::test (symtab_node *p)
2155 : : {
2156 : 10281500236 : return p && p->type == SYMTAB_FUNCTION;
2157 : : }
2158 : :
2159 : : /* Report whether or not THIS symtab node is a variable, aka varpool_node. */
2160 : :
2161 : : template <>
2162 : : template <>
2163 : : inline bool
2164 : 1695628591 : is_a_helper <varpool_node *>::test (symtab_node *p)
2165 : : {
2166 : 1696864798 : return p && p->type == SYMTAB_VARIABLE;
2167 : : }
2168 : :
2169 : : typedef void (*cgraph_edge_hook)(cgraph_edge *, void *);
2170 : : typedef void (*cgraph_node_hook)(cgraph_node *, void *);
2171 : : typedef void (*varpool_node_hook)(varpool_node *, void *);
2172 : : typedef void (*cgraph_2edge_hook)(cgraph_edge *, cgraph_edge *, void *);
2173 : : typedef void (*cgraph_2node_hook)(cgraph_node *, cgraph_node *, void *);
2174 : :
2175 : : struct cgraph_edge_hook_list;
2176 : : struct cgraph_node_hook_list;
2177 : : struct varpool_node_hook_list;
2178 : : struct cgraph_2edge_hook_list;
2179 : : struct cgraph_2node_hook_list;
2180 : :
2181 : : /* Map from a symbol to initialization/finalization priorities. */
2182 : : struct GTY(()) symbol_priority_map {
2183 : : priority_type init;
2184 : : priority_type fini;
2185 : : };
2186 : :
2187 : : enum symtab_state
2188 : : {
2189 : : /* Frontend is parsing and finalizing functions. */
2190 : : PARSING,
2191 : : /* Callgraph is being constructed. It is safe to add new functions. */
2192 : : CONSTRUCTION,
2193 : : /* Callgraph is being streamed-in at LTO time. */
2194 : : LTO_STREAMING,
2195 : : /* Callgraph is built and early IPA passes are being run. */
2196 : : IPA,
2197 : : /* Callgraph is built and all functions are transformed to SSA form. */
2198 : : IPA_SSA,
2199 : : /* All inline decisions are done; it is now possible to remove extern inline
2200 : : functions and virtual call targets. */
2201 : : IPA_SSA_AFTER_INLINING,
2202 : : /* Functions are now ordered and being passed to RTL expanders. */
2203 : : EXPANSION,
2204 : : /* All cgraph expansion is done. */
2205 : : FINISHED
2206 : : };
2207 : :
2208 : : struct asmname_hasher : ggc_ptr_hash <symtab_node>
2209 : : {
2210 : : typedef const_tree compare_type;
2211 : :
2212 : : static hashval_t hash (symtab_node *n);
2213 : : static bool equal (symtab_node *n, const_tree t);
2214 : : };
2215 : :
2216 : : /* Core summaries maintained about symbols. */
2217 : :
2218 : : struct thunk_info;
2219 : : template <class T> class function_summary;
2220 : : typedef function_summary <thunk_info *> thunk_summary;
2221 : :
2222 : : struct clone_info;
2223 : : template <class T> class function_summary;
2224 : : typedef function_summary <clone_info *> clone_summary;
2225 : :
2226 : 1187 : class GTY((tag ("SYMTAB"))) symbol_table
2227 : : {
2228 : : public:
2229 : : friend struct symtab_node;
2230 : : friend struct cgraph_node;
2231 : : friend struct cgraph_edge;
2232 : :
2233 : 282930 : symbol_table ():
2234 : 282930 : cgraph_count (0), cgraph_max_uid (1), cgraph_max_summary_id (0),
2235 : 282930 : edges_count (0), edges_max_uid (1), edges_max_summary_id (0),
2236 : 282930 : cgraph_released_summary_ids (), edge_released_summary_ids (),
2237 : 282930 : nodes (NULL), asmnodes (NULL), asm_last_node (NULL),
2238 : 282930 : order (0), max_unit (0), global_info_ready (false), state (PARSING),
2239 : 282930 : function_flags_ready (false), cpp_implicit_aliases_done (false),
2240 : 282930 : section_hash (NULL), assembler_name_hash (NULL), init_priority_hash (NULL),
2241 : 282930 : dump_file (NULL), ipa_clones_dump_file (NULL), cloned_nodes (),
2242 : 282930 : m_thunks (NULL), m_clones (NULL),
2243 : 282930 : m_first_edge_removal_hook (NULL), m_first_cgraph_removal_hook (NULL),
2244 : 282930 : m_first_edge_duplicated_hook (NULL), m_first_cgraph_duplicated_hook (NULL),
2245 : 282930 : m_first_cgraph_insertion_hook (NULL), m_first_varpool_insertion_hook (NULL),
2246 : 282930 : m_first_varpool_removal_hook (NULL)
2247 : : {
2248 : 282930 : }
2249 : :
2250 : : /* Initialize callgraph dump file. */
2251 : : void initialize (void);
2252 : :
2253 : : /* Register a top-level asm statement ASM_STR. */
2254 : : inline asm_node *finalize_toplevel_asm (tree asm_str);
2255 : :
2256 : : /* Analyze the whole compilation unit once it is parsed completely. */
2257 : : void finalize_compilation_unit (void);
2258 : :
2259 : : /* C++ frontend produce same body aliases all over the place, even before PCH
2260 : : gets streamed out. It relies on us linking the aliases with their function
2261 : : in order to do the fixups, but ipa-ref is not PCH safe. Consequently we
2262 : : first produce aliases without links, but once C++ FE is sure it won't
2263 : : stream PCH we build the links via this function. */
2264 : : void process_same_body_aliases (void);
2265 : :
2266 : : /* Perform simple optimizations based on callgraph. */
2267 : : void compile (void);
2268 : :
2269 : : /* Process CGRAPH_NEW_FUNCTIONS and perform actions necessary to add these
2270 : : functions into callgraph in a way so they look like ordinary reachable
2271 : : functions inserted into callgraph already at construction time. */
2272 : : void process_new_functions (void);
2273 : :
2274 : : /* Register a symbol NODE. */
2275 : : inline void register_symbol (symtab_node *node);
2276 : :
2277 : : inline void
2278 : 227030 : clear_asm_symbols (void)
2279 : : {
2280 : 227030 : asmnodes = NULL;
2281 : 227030 : asm_last_node = NULL;
2282 : : }
2283 : :
2284 : : /* Perform reachability analysis and reclaim all unreachable nodes. */
2285 : : bool remove_unreachable_nodes (FILE *file);
2286 : :
2287 : : /* Optimization of function bodies might've rendered some variables as
2288 : : unnecessary so we want to avoid these from being compiled. Re-do
2289 : : reachability starting from variables that are either externally visible
2290 : : or was referred from the asm output routines. */
2291 : : void remove_unreferenced_decls (void);
2292 : :
2293 : : /* Unregister a symbol NODE. */
2294 : : inline void unregister (symtab_node *node);
2295 : :
2296 : : /* Allocate new callgraph node and insert it into basic data structures. */
2297 : : cgraph_node *create_empty (void);
2298 : :
2299 : : /* Release a callgraph NODE. */
2300 : : void release_symbol (cgraph_node *node);
2301 : :
2302 : : /* Output all variables enqueued to be assembled. */
2303 : : bool output_variables (void);
2304 : :
2305 : : /* Weakrefs may be associated to external decls and thus not output
2306 : : at expansion time. Emit all necessary aliases. */
2307 : : void output_weakrefs (void);
2308 : :
2309 : : /* Return first static symbol with definition. */
2310 : : inline symtab_node *first_symbol (void);
2311 : :
2312 : : /* Return first assembler symbol. */
2313 : : inline asm_node *
2314 : 2467651 : first_asm_symbol (void)
2315 : : {
2316 : 2467651 : return asmnodes;
2317 : : }
2318 : :
2319 : : /* Return first static symbol with definition. */
2320 : : inline symtab_node *first_defined_symbol (void);
2321 : :
2322 : : /* Return first variable. */
2323 : : inline varpool_node *first_variable (void);
2324 : :
2325 : : /* Return next variable after NODE. */
2326 : : inline varpool_node *next_variable (varpool_node *node);
2327 : :
2328 : : /* Return first static variable with initializer. */
2329 : : inline varpool_node *first_static_initializer (void);
2330 : :
2331 : : /* Return next static variable with initializer after NODE. */
2332 : : inline varpool_node *next_static_initializer (varpool_node *node);
2333 : :
2334 : : /* Return first static variable with definition. */
2335 : : inline varpool_node *first_defined_variable (void);
2336 : :
2337 : : /* Return next static variable with definition after NODE. */
2338 : : inline varpool_node *next_defined_variable (varpool_node *node);
2339 : :
2340 : : /* Return first function with body defined. */
2341 : : inline cgraph_node *first_defined_function (void);
2342 : :
2343 : : /* Return next function with body defined after NODE. */
2344 : : inline cgraph_node *next_defined_function (cgraph_node *node);
2345 : :
2346 : : /* Return first function. */
2347 : : inline cgraph_node *first_function (void);
2348 : :
2349 : : /* Return next function. */
2350 : : inline cgraph_node *next_function (cgraph_node *node);
2351 : :
2352 : : /* Return first function with body defined. */
2353 : : cgraph_node *first_function_with_gimple_body (void);
2354 : :
2355 : : /* Return next reachable static variable with initializer after NODE. */
2356 : : inline cgraph_node *next_function_with_gimple_body (cgraph_node *node);
2357 : :
2358 : : /* Register HOOK to be called with DATA on each removed edge. */
2359 : : cgraph_edge_hook_list *add_edge_removal_hook (cgraph_edge_hook hook,
2360 : : void *data);
2361 : :
2362 : : /* Remove ENTRY from the list of hooks called on removing edges. */
2363 : : void remove_edge_removal_hook (cgraph_edge_hook_list *entry);
2364 : :
2365 : : /* Register HOOK to be called with DATA on each removed node. */
2366 : : cgraph_node_hook_list *add_cgraph_removal_hook (cgraph_node_hook hook,
2367 : : void *data);
2368 : :
2369 : : /* Remove ENTRY from the list of hooks called on removing nodes. */
2370 : : void remove_cgraph_removal_hook (cgraph_node_hook_list *entry);
2371 : :
2372 : : /* Register HOOK to be called with DATA on each removed node. */
2373 : : varpool_node_hook_list *add_varpool_removal_hook (varpool_node_hook hook,
2374 : : void *data);
2375 : :
2376 : : /* Remove ENTRY from the list of hooks called on removing nodes. */
2377 : : void remove_varpool_removal_hook (varpool_node_hook_list *entry);
2378 : :
2379 : : /* Register HOOK to be called with DATA on each inserted node. */
2380 : : cgraph_node_hook_list *add_cgraph_insertion_hook (cgraph_node_hook hook,
2381 : : void *data);
2382 : :
2383 : : /* Remove ENTRY from the list of hooks called on inserted nodes. */
2384 : : void remove_cgraph_insertion_hook (cgraph_node_hook_list *entry);
2385 : :
2386 : : /* Register HOOK to be called with DATA on each inserted node. */
2387 : : varpool_node_hook_list *add_varpool_insertion_hook (varpool_node_hook hook,
2388 : : void *data);
2389 : :
2390 : : /* Remove ENTRY from the list of hooks called on inserted nodes. */
2391 : : void remove_varpool_insertion_hook (varpool_node_hook_list *entry);
2392 : :
2393 : : /* Register HOOK to be called with DATA on each duplicated edge. */
2394 : : cgraph_2edge_hook_list *add_edge_duplication_hook (cgraph_2edge_hook hook,
2395 : : void *data);
2396 : : /* Remove ENTRY from the list of hooks called on duplicating edges. */
2397 : : void remove_edge_duplication_hook (cgraph_2edge_hook_list *entry);
2398 : :
2399 : : /* Register HOOK to be called with DATA on each duplicated node. */
2400 : : cgraph_2node_hook_list *add_cgraph_duplication_hook (cgraph_2node_hook hook,
2401 : : void *data);
2402 : :
2403 : : /* Remove ENTRY from the list of hooks called on duplicating nodes. */
2404 : : void remove_cgraph_duplication_hook (cgraph_2node_hook_list *entry);
2405 : :
2406 : : /* Call all edge removal hooks. */
2407 : : void call_edge_removal_hooks (cgraph_edge *e);
2408 : :
2409 : : /* Call all node insertion hooks. */
2410 : : void call_cgraph_insertion_hooks (cgraph_node *node);
2411 : :
2412 : : /* Call all node removal hooks. */
2413 : : void call_cgraph_removal_hooks (cgraph_node *node);
2414 : :
2415 : : /* Call all node duplication hooks. */
2416 : : void call_cgraph_duplication_hooks (cgraph_node *node, cgraph_node *node2);
2417 : :
2418 : : /* Call all edge duplication hooks. */
2419 : : void call_edge_duplication_hooks (cgraph_edge *cs1, cgraph_edge *cs2);
2420 : :
2421 : : /* Call all node removal hooks. */
2422 : : void call_varpool_removal_hooks (varpool_node *node);
2423 : :
2424 : : /* Call all node insertion hooks. */
2425 : : void call_varpool_insertion_hooks (varpool_node *node);
2426 : :
2427 : : /* Arrange node to be first in its entry of assembler_name_hash. */
2428 : : void symtab_prevail_in_asm_name_hash (symtab_node *node);
2429 : :
2430 : : /* Initialize asm name hash unless. */
2431 : : void symtab_initialize_asm_name_hash (void);
2432 : :
2433 : : /* Set the DECL_ASSEMBLER_NAME and update symtab hashtables. */
2434 : : void change_decl_assembler_name (tree decl, tree name);
2435 : :
2436 : : /* Dump symbol table to F. */
2437 : : void dump (FILE *f);
2438 : :
2439 : : /* Dump symbol table to F in graphviz format. */
2440 : : void dump_graphviz (FILE *f);
2441 : :
2442 : : /* Dump symbol table to stderr. */
2443 : : void DEBUG_FUNCTION debug (void);
2444 : :
2445 : : /* Assign a new summary ID for the callgraph NODE. */
2446 : 5565771 : inline int assign_summary_id (cgraph_node *node)
2447 : : {
2448 : 5565771 : if (!cgraph_released_summary_ids.is_empty ())
2449 : 2541407 : node->m_summary_id = cgraph_released_summary_ids.pop ();
2450 : : else
2451 : 3024364 : node->m_summary_id = cgraph_max_summary_id++;
2452 : :
2453 : 5565771 : return node->m_summary_id;
2454 : : }
2455 : :
2456 : : /* Assign a new summary ID for the callgraph EDGE. */
2457 : 19625388 : inline int assign_summary_id (cgraph_edge *edge)
2458 : : {
2459 : 19625388 : if (!edge_released_summary_ids.is_empty ())
2460 : 11063632 : edge->m_summary_id = edge_released_summary_ids.pop ();
2461 : : else
2462 : 8561756 : edge->m_summary_id = edges_max_summary_id++;
2463 : :
2464 : 19625388 : return edge->m_summary_id;
2465 : : }
2466 : :
2467 : : /* Return true if assembler names NAME1 and NAME2 leads to the same symbol
2468 : : name. */
2469 : : static bool assembler_names_equal_p (const char *name1, const char *name2);
2470 : :
2471 : : int cgraph_count;
2472 : : int cgraph_max_uid;
2473 : : int cgraph_max_summary_id;
2474 : :
2475 : : int edges_count;
2476 : : int edges_max_uid;
2477 : : int edges_max_summary_id;
2478 : :
2479 : : /* Vector of released summary IDS for cgraph nodes. */
2480 : : vec<int> GTY ((skip)) cgraph_released_summary_ids;
2481 : :
2482 : : /* Vector of released summary IDS for cgraph nodes. */
2483 : : vec<int> GTY ((skip)) edge_released_summary_ids;
2484 : :
2485 : : /* Return symbol used to separate symbol name from suffix. */
2486 : : static char symbol_suffix_separator ();
2487 : :
2488 : : symtab_node* GTY(()) nodes;
2489 : : asm_node* GTY(()) asmnodes;
2490 : : asm_node* GTY(()) asm_last_node;
2491 : :
2492 : : /* The order index of the next symtab node to be created. This is
2493 : : used so that we can sort the cgraph nodes in order by when we saw
2494 : : them, to support -fno-toplevel-reorder. */
2495 : : int order;
2496 : :
2497 : : /* Maximal unit ID used. */
2498 : : int max_unit;
2499 : :
2500 : : /* Set when whole unit has been analyzed so we can access global info. */
2501 : : bool global_info_ready;
2502 : : /* What state callgraph is in right now. */
2503 : : enum symtab_state state;
2504 : : /* Set when the cgraph is fully build and the basic flags are computed. */
2505 : : bool function_flags_ready;
2506 : :
2507 : : bool cpp_implicit_aliases_done;
2508 : :
2509 : : /* Hash table used to hold sections. */
2510 : : hash_table<section_name_hasher> *GTY(()) section_hash;
2511 : :
2512 : : /* Hash table used to convert assembler names into nodes. */
2513 : : hash_table<asmname_hasher> *assembler_name_hash;
2514 : :
2515 : : /* Hash table used to hold init priorities. */
2516 : : hash_map<symtab_node *, symbol_priority_map> *init_priority_hash;
2517 : :
2518 : : FILE* GTY ((skip)) dump_file;
2519 : :
2520 : : FILE* GTY ((skip)) ipa_clones_dump_file;
2521 : :
2522 : : hash_set <const cgraph_node *> GTY ((skip)) cloned_nodes;
2523 : :
2524 : : /* Thunk annotations. */
2525 : : thunk_summary *m_thunks;
2526 : :
2527 : : /* Virtual clone annotations. */
2528 : : clone_summary *m_clones;
2529 : :
2530 : : private:
2531 : : /* Allocate a cgraph_edge structure and fill it with data according to the
2532 : : parameters of which only CALLEE can be NULL (when creating an indirect
2533 : : call edge). CLONING_P should be set if properties that are copied from an
2534 : : original edge should not be calculated. */
2535 : : cgraph_edge *create_edge (cgraph_node *caller, cgraph_node *callee,
2536 : : gcall *call_stmt, profile_count count,
2537 : : bool indir_unknown_callee, bool cloning_p);
2538 : :
2539 : : /* Put the edge onto the free list. */
2540 : : void free_edge (cgraph_edge *e);
2541 : :
2542 : : /* Insert NODE to assembler name hash. */
2543 : : void insert_to_assembler_name_hash (symtab_node *node, bool with_clones);
2544 : :
2545 : : /* Remove NODE from assembler name hash. */
2546 : : void unlink_from_assembler_name_hash (symtab_node *node, bool with_clones);
2547 : :
2548 : : /* Hash asmnames ignoring the user specified marks. */
2549 : : static hashval_t decl_assembler_name_hash (const_tree asmname);
2550 : :
2551 : : /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
2552 : : static bool decl_assembler_name_equal (tree decl, const_tree asmname);
2553 : :
2554 : : friend struct asmname_hasher;
2555 : :
2556 : : /* List of hooks triggered when an edge is removed. */
2557 : : cgraph_edge_hook_list * GTY((skip)) m_first_edge_removal_hook;
2558 : : /* List of hooks trigger_red when a cgraph node is removed. */
2559 : : cgraph_node_hook_list * GTY((skip)) m_first_cgraph_removal_hook;
2560 : : /* List of hooks triggered when an edge is duplicated. */
2561 : : cgraph_2edge_hook_list * GTY((skip)) m_first_edge_duplicated_hook;
2562 : : /* List of hooks triggered when a node is duplicated. */
2563 : : cgraph_2node_hook_list * GTY((skip)) m_first_cgraph_duplicated_hook;
2564 : : /* List of hooks triggered when an function is inserted. */
2565 : : cgraph_node_hook_list * GTY((skip)) m_first_cgraph_insertion_hook;
2566 : : /* List of hooks triggered when an variable is inserted. */
2567 : : varpool_node_hook_list * GTY((skip)) m_first_varpool_insertion_hook;
2568 : : /* List of hooks triggered when a node is removed. */
2569 : : varpool_node_hook_list * GTY((skip)) m_first_varpool_removal_hook;
2570 : : };
2571 : :
2572 : : extern GTY(()) symbol_table *symtab;
2573 : :
2574 : : extern vec<cgraph_node *> cgraph_new_nodes;
2575 : :
2576 : : inline hashval_t
2577 : 442171496 : asmname_hasher::hash (symtab_node *n)
2578 : : {
2579 : 442171496 : return symbol_table::decl_assembler_name_hash
2580 : 442171496 : (DECL_ASSEMBLER_NAME (n->decl));
2581 : : }
2582 : :
2583 : : inline bool
2584 : 556704720 : asmname_hasher::equal (symtab_node *n, const_tree t)
2585 : : {
2586 : 556704720 : return symbol_table::decl_assembler_name_equal (n->decl, t);
2587 : : }
2588 : :
2589 : : /* In cgraph.cc */
2590 : : void cgraph_cc_finalize (void);
2591 : : void release_function_body (tree);
2592 : : cgraph_indirect_call_info *cgraph_allocate_init_indirect_info (void);
2593 : :
2594 : : void cgraph_update_edges_for_call_stmt (gimple *, tree, gimple *);
2595 : : bool cgraph_function_possibly_inlined_p (tree);
2596 : :
2597 : : const char* cgraph_inline_failed_string (cgraph_inline_failed_t);
2598 : : cgraph_inline_failed_type_t cgraph_inline_failed_type (cgraph_inline_failed_t);
2599 : :
2600 : : /* In cgraphunit.cc */
2601 : : void cgraphunit_cc_finalize (void);
2602 : : int tp_first_run_node_cmp (const void *pa, const void *pb);
2603 : :
2604 : : /* In symtab-thunks.cc */
2605 : : void symtab_thunks_cc_finalize (void);
2606 : :
2607 : : /* Initialize datastructures so DECL is a function in lowered gimple form.
2608 : : IN_SSA is true if the gimple is in SSA. */
2609 : : basic_block init_lowered_empty_function (tree, bool, profile_count);
2610 : :
2611 : : tree thunk_adjust (gimple_stmt_iterator *, tree, bool, HOST_WIDE_INT, tree,
2612 : : HOST_WIDE_INT);
2613 : : /* In cgraphclones.cc */
2614 : :
2615 : : tree clone_function_name_numbered (const char *name, const char *suffix);
2616 : : tree clone_function_name_numbered (tree decl, const char *suffix);
2617 : : tree clone_function_name (const char *name, const char *suffix,
2618 : : unsigned long number);
2619 : : tree clone_function_name (tree decl, const char *suffix,
2620 : : unsigned long number);
2621 : : tree clone_function_name (tree decl, const char *suffix);
2622 : :
2623 : : void tree_function_versioning (tree, tree, vec<ipa_replace_map *, va_gc> *,
2624 : : ipa_param_adjustments *,
2625 : : bool, bitmap, basic_block);
2626 : :
2627 : : void dump_callgraph_transformation (const cgraph_node *original,
2628 : : const cgraph_node *clone,
2629 : : const char *suffix);
2630 : : /* In cgraphbuild.cc */
2631 : : int compute_call_stmt_bb_frequency (tree, basic_block bb);
2632 : : void record_references_in_initializer (tree, bool);
2633 : :
2634 : : /* In ipa.cc */
2635 : : void cgraph_build_static_cdtor (char which, tree body, int priority);
2636 : : bool ipa_discover_variable_flags (void);
2637 : :
2638 : : /* In varpool.cc */
2639 : : tree ctor_for_folding (tree);
2640 : :
2641 : : /* In ipa-inline-analysis.cc */
2642 : : void initialize_inline_failed (struct cgraph_edge *);
2643 : : bool speculation_useful_p (struct cgraph_edge *e, bool anticipate_inlining);
2644 : :
2645 : : /* Return true when the symbol is real symbol, i.e. it is not inline clone
2646 : : or abstract function kept for debug info purposes only. */
2647 : : inline bool
2648 : 11375180 : symtab_node::real_symbol_p (void)
2649 : : {
2650 : 11375180 : cgraph_node *cnode;
2651 : :
2652 : 11375180 : if (DECL_ABSTRACT_P (decl))
2653 : : return false;
2654 : 10873444 : if (transparent_alias && definition)
2655 : : return false;
2656 : 10873395 : if (!is_a <cgraph_node *> (this))
2657 : : return true;
2658 : 6217386 : cnode = dyn_cast <cgraph_node *> (this);
2659 : 6217386 : if (cnode->inlined_to)
2660 : 2033789 : return false;
2661 : : return true;
2662 : : }
2663 : :
2664 : : /* Return true if DECL should have entry in symbol table if used.
2665 : : Those are functions and static & external variables. */
2666 : :
2667 : : inline bool
2668 : 1331042350 : decl_in_symtab_p (const_tree decl)
2669 : : {
2670 : 1331042350 : return (TREE_CODE (decl) == FUNCTION_DECL
2671 : 1331042350 : || (VAR_P (decl)
2672 : 1283187392 : && (TREE_STATIC (decl) || DECL_EXTERNAL (decl))));
2673 : : }
2674 : :
2675 : : inline bool
2676 : 141861 : symtab_node::in_same_comdat_group_p (symtab_node *target)
2677 : : {
2678 : 141861 : symtab_node *source = this;
2679 : :
2680 : 141861 : if (cgraph_node *cn = dyn_cast <cgraph_node *> (target))
2681 : : {
2682 : 141849 : if (cn->inlined_to)
2683 : 141861 : source = cn->inlined_to;
2684 : : }
2685 : 141861 : if (cgraph_node *cn = dyn_cast <cgraph_node *> (target))
2686 : : {
2687 : 141849 : if (cn->inlined_to)
2688 : 141861 : target = cn->inlined_to;
2689 : : }
2690 : :
2691 : 141861 : return source->get_comdat_group () == target->get_comdat_group ();
2692 : : }
2693 : :
2694 : : /* Return node that alias is aliasing. */
2695 : :
2696 : : inline symtab_node *
2697 : 49000806 : symtab_node::get_alias_target (void)
2698 : : {
2699 : 49000806 : ipa_ref *ref = NULL;
2700 : 98001612 : iterate_reference (0, ref);
2701 : 0 : gcc_checking_assert (ref->use == IPA_REF_ALIAS);
2702 : 49000806 : return ref->referred;
2703 : : }
2704 : :
2705 : : /* Return the DECL (or identifier) that alias is aliasing. Unlike the above,
2706 : : this works whether or not the alias has been analyzed already. */
2707 : :
2708 : : inline tree
2709 : 8 : symtab_node::get_alias_target_tree ()
2710 : : {
2711 : 8 : if (alias_target)
2712 : : return alias_target;
2713 : 6 : return get_alias_target ()->decl;
2714 : : }
2715 : :
2716 : : /* Return next reachable static symbol with initializer after the node. */
2717 : :
2718 : : inline symtab_node *
2719 : 10929808 : symtab_node::next_defined_symbol (void)
2720 : : {
2721 : 10929808 : symtab_node *node1 = next;
2722 : :
2723 : 12524718 : for (; node1; node1 = node1->next)
2724 : 12097422 : if (node1->definition)
2725 : : return node1;
2726 : :
2727 : : return NULL;
2728 : : }
2729 : :
2730 : : /* Iterates I-th reference in the list, REF is also set. */
2731 : :
2732 : : inline ipa_ref *
2733 : 477470429 : symtab_node::iterate_reference (unsigned i, ipa_ref *&ref)
2734 : : {
2735 : 550029787 : ref_list.references.iterate (i, &ref);
2736 : :
2737 : 321287491 : return ref;
2738 : : }
2739 : :
2740 : : /* Iterates I-th referring item in the list, REF is also set. */
2741 : :
2742 : : inline ipa_ref *
2743 : 210701446 : symtab_node::iterate_referring (unsigned i, ipa_ref *&ref)
2744 : : {
2745 : 210701446 : ref_list.referring.iterate (i, &ref);
2746 : :
2747 : 210701446 : return ref;
2748 : : }
2749 : :
2750 : : /* Iterates I-th referring alias item in the list, REF is also set. */
2751 : :
2752 : : inline ipa_ref *
2753 : 200781306 : symtab_node::iterate_direct_aliases (unsigned i, ipa_ref *&ref)
2754 : : {
2755 : 200781306 : ref_list.referring.iterate (i, &ref);
2756 : :
2757 : 200781306 : if (ref && ref->use != IPA_REF_ALIAS)
2758 : 10169001 : return NULL;
2759 : :
2760 : : return ref;
2761 : : }
2762 : :
2763 : : /* Return true if list contains an alias. */
2764 : :
2765 : : inline bool
2766 : 49110242 : symtab_node::has_aliases_p (void)
2767 : : {
2768 : 49110242 : ipa_ref *ref = NULL;
2769 : :
2770 : 49110242 : return (iterate_direct_aliases (0, ref) != NULL);
2771 : : }
2772 : :
2773 : : /* Return true when RESOLUTION indicate that linker will use
2774 : : the symbol from non-LTO object files. */
2775 : :
2776 : : inline bool
2777 : 22985235 : resolution_used_from_other_file_p (enum ld_plugin_symbol_resolution resolution)
2778 : : {
2779 : 22985235 : return (resolution == LDPR_PREVAILING_DEF
2780 : 22985235 : || resolution == LDPR_PREEMPTED_REG
2781 : : || resolution == LDPR_RESOLVED_EXEC
2782 : 22985235 : || resolution == LDPR_RESOLVED_DYN);
2783 : : }
2784 : :
2785 : : /* Return true when symtab_node is known to be used from other (non-LTO)
2786 : : object file. Known only when doing LTO via linker plugin. */
2787 : :
2788 : : inline bool
2789 : 30721160 : symtab_node::used_from_object_file_p (void)
2790 : : {
2791 : 30721160 : if (!TREE_PUBLIC (decl) || DECL_EXTERNAL (decl))
2792 : : return false;
2793 : 22985235 : if (resolution_used_from_other_file_p (resolution))
2794 : : return true;
2795 : : return false;
2796 : : }
2797 : :
2798 : : /* Return varpool node for given symbol and check it is a function. */
2799 : :
2800 : : inline varpool_node *
2801 : 510249292 : varpool_node::get (const_tree decl)
2802 : : {
2803 : 510249292 : gcc_checking_assert (TREE_CODE (decl) == VAR_DECL);
2804 : 510249292 : return dyn_cast<varpool_node *> (symtab_node::get (decl));
2805 : : }
2806 : :
2807 : : /* Register a symbol NODE. */
2808 : :
2809 : : inline void
2810 : 115220049 : symbol_table::register_symbol (symtab_node *node)
2811 : : {
2812 : 115220049 : node->next = nodes;
2813 : 115220049 : node->previous = NULL;
2814 : :
2815 : 115220049 : if (nodes)
2816 : 114959013 : nodes->previous = node;
2817 : 115220049 : nodes = node;
2818 : :
2819 : 115220049 : nodes->m_uid = cgraph_max_uid++;
2820 : :
2821 : 115220049 : if (node->order == -1)
2822 : 112563660 : node->order = order++;
2823 : 115220049 : }
2824 : :
2825 : : /* Register a top-level asm statement ASM_STR. */
2826 : :
2827 : : asm_node *
2828 : 12987 : symbol_table::finalize_toplevel_asm (tree asm_str)
2829 : : {
2830 : 12987 : asm_node *node;
2831 : :
2832 : 12987 : node = ggc_cleared_alloc<asm_node> ();
2833 : 12987 : node->asm_str = asm_str;
2834 : 12987 : node->order = order++;
2835 : 12987 : node->next = NULL;
2836 : :
2837 : 12987 : if (asmnodes == NULL)
2838 : 10442 : asmnodes = node;
2839 : : else
2840 : 2545 : asm_last_node->next = node;
2841 : :
2842 : 12987 : asm_last_node = node;
2843 : 12987 : return node;
2844 : : }
2845 : :
2846 : : /* Unregister a symbol NODE. */
2847 : : inline void
2848 : 108295757 : symbol_table::unregister (symtab_node *node)
2849 : : {
2850 : 108295757 : if (node->previous)
2851 : 93970591 : node->previous->next = node->next;
2852 : : else
2853 : 14325166 : nodes = node->next;
2854 : :
2855 : 108295757 : if (node->next)
2856 : 108179007 : node->next->previous = node->previous;
2857 : :
2858 : 108295757 : node->next = NULL;
2859 : 108295757 : node->previous = NULL;
2860 : 108295757 : }
2861 : :
2862 : : /* Release a callgraph NODE with UID and put in to the list of free nodes. */
2863 : :
2864 : : inline void
2865 : 91291787 : symbol_table::release_symbol (cgraph_node *node)
2866 : : {
2867 : 91291787 : cgraph_count--;
2868 : 91291787 : if (node->m_summary_id != -1)
2869 : 3864454 : cgraph_released_summary_ids.safe_push (node->m_summary_id);
2870 : 91291787 : ggc_free (node);
2871 : 91291787 : }
2872 : :
2873 : : /* Return first static symbol with definition. */
2874 : : inline symtab_node *
2875 : 5231329 : symbol_table::first_symbol (void)
2876 : : {
2877 : 5231329 : return nodes;
2878 : : }
2879 : :
2880 : : /* Walk all symbols. */
2881 : : #define FOR_EACH_SYMBOL(node) \
2882 : : for ((node) = symtab->first_symbol (); (node); (node) = (node)->next)
2883 : :
2884 : : /* Return first static symbol with definition. */
2885 : : inline symtab_node *
2886 : 453376 : symbol_table::first_defined_symbol (void)
2887 : : {
2888 : 453376 : symtab_node *node;
2889 : :
2890 : 2899542 : for (node = nodes; node; node = node->next)
2891 : 2873462 : if (node->definition)
2892 : : return node;
2893 : :
2894 : : return NULL;
2895 : : }
2896 : :
2897 : : /* Walk all symbols with definitions in current unit. */
2898 : : #define FOR_EACH_DEFINED_SYMBOL(node) \
2899 : : for ((node) = symtab->first_defined_symbol (); (node); \
2900 : : (node) = node->next_defined_symbol ())
2901 : :
2902 : : /* Return first variable. */
2903 : : inline varpool_node *
2904 : 5062199 : symbol_table::first_variable (void)
2905 : : {
2906 : 5062199 : symtab_node *node;
2907 : 108527590 : for (node = nodes; node; node = node->next)
2908 : 216194519 : if (varpool_node *vnode = dyn_cast <varpool_node *> (node))
2909 : : return vnode;
2910 : : return NULL;
2911 : : }
2912 : :
2913 : : /* Return next variable after NODE. */
2914 : : inline varpool_node *
2915 : 104966193 : symbol_table::next_variable (varpool_node *node)
2916 : : {
2917 : 104966193 : symtab_node *node1 = node->next;
2918 : 277126623 : for (; node1; node1 = node1->next)
2919 : 361886327 : if (varpool_node *vnode1 = dyn_cast <varpool_node *> (node1))
2920 : : return vnode1;
2921 : : return NULL;
2922 : : }
2923 : : /* Walk all variables. */
2924 : : #define FOR_EACH_VARIABLE(node) \
2925 : : for ((node) = symtab->first_variable (); \
2926 : : (node); \
2927 : : (node) = symtab->next_variable ((node)))
2928 : :
2929 : : /* Return first static variable with initializer. */
2930 : : inline varpool_node *
2931 : : symbol_table::first_static_initializer (void)
2932 : : {
2933 : : symtab_node *node;
2934 : : for (node = nodes; node; node = node->next)
2935 : : {
2936 : : varpool_node *vnode = dyn_cast <varpool_node *> (node);
2937 : : if (vnode && DECL_INITIAL (node->decl))
2938 : : return vnode;
2939 : : }
2940 : : return NULL;
2941 : : }
2942 : :
2943 : : /* Return next static variable with initializer after NODE. */
2944 : : inline varpool_node *
2945 : : symbol_table::next_static_initializer (varpool_node *node)
2946 : : {
2947 : : symtab_node *node1 = node->next;
2948 : : for (; node1; node1 = node1->next)
2949 : : {
2950 : : varpool_node *vnode1 = dyn_cast <varpool_node *> (node1);
2951 : : if (vnode1 && DECL_INITIAL (node1->decl))
2952 : : return vnode1;
2953 : : }
2954 : : return NULL;
2955 : : }
2956 : :
2957 : : /* Walk all static variables with initializer set. */
2958 : : #define FOR_EACH_STATIC_INITIALIZER(node) \
2959 : : for ((node) = symtab->first_static_initializer (); (node); \
2960 : : (node) = symtab->next_static_initializer (node))
2961 : :
2962 : : /* Return first static variable with definition. */
2963 : : inline varpool_node *
2964 : 3175277 : symbol_table::first_defined_variable (void)
2965 : : {
2966 : 3175277 : symtab_node *node;
2967 : 44104706 : for (node = nodes; node; node = node->next)
2968 : : {
2969 : 46197597 : varpool_node *vnode = dyn_cast <varpool_node *> (node);
2970 : 5268168 : if (vnode && vnode->definition)
2971 : : return vnode;
2972 : : }
2973 : : return NULL;
2974 : : }
2975 : :
2976 : : /* Return next static variable with definition after NODE. */
2977 : : inline varpool_node *
2978 : 42624213 : symbol_table::next_defined_variable (varpool_node *node)
2979 : : {
2980 : 42624213 : symtab_node *node1 = node->next;
2981 : 62645374 : for (; node1; node1 = node1->next)
2982 : : {
2983 : 61724995 : varpool_node *vnode1 = dyn_cast <varpool_node *> (node1);
2984 : 41703834 : if (vnode1 && vnode1->definition)
2985 : : return vnode1;
2986 : : }
2987 : : return NULL;
2988 : : }
2989 : : /* Walk all variables with definitions in current unit. */
2990 : : #define FOR_EACH_DEFINED_VARIABLE(node) \
2991 : : for ((node) = symtab->first_defined_variable (); (node); \
2992 : : (node) = symtab->next_defined_variable (node))
2993 : :
2994 : : /* Return first function with body defined. */
2995 : : inline cgraph_node *
2996 : 29484694 : symbol_table::first_defined_function (void)
2997 : : {
2998 : 29484694 : symtab_node *node;
2999 : 375927261 : for (node = nodes; node; node = node->next)
3000 : : {
3001 : 560707081 : cgraph_node *cn = dyn_cast <cgraph_node *> (node);
3002 : 214264514 : if (cn && cn->definition)
3003 : : return cn;
3004 : : }
3005 : : return NULL;
3006 : : }
3007 : :
3008 : : /* Return next function with body defined after NODE. */
3009 : : inline cgraph_node *
3010 : 325430411 : symbol_table::next_defined_function (cgraph_node *node)
3011 : : {
3012 : 325430411 : symtab_node *node1 = node->next;
3013 : 664573258 : for (; node1; node1 = node1->next)
3014 : : {
3015 : 685408108 : cgraph_node *cn1 = dyn_cast <cgraph_node *> (node1);
3016 : 346265261 : if (cn1 && cn1->definition)
3017 : : return cn1;
3018 : : }
3019 : : return NULL;
3020 : : }
3021 : :
3022 : : /* Walk all functions with body defined. */
3023 : : #define FOR_EACH_DEFINED_FUNCTION(node) \
3024 : : for ((node) = symtab->first_defined_function (); (node); \
3025 : : (node) = symtab->next_defined_function ((node)))
3026 : :
3027 : : /* Return first function. */
3028 : : inline cgraph_node *
3029 : 15722402 : symbol_table::first_function (void)
3030 : : {
3031 : 15722402 : symtab_node *node;
3032 : 74442980 : for (node = nodes; node; node = node->next)
3033 : 553772433 : if (cgraph_node *cn = dyn_cast <cgraph_node *> (node))
3034 : : return cn;
3035 : : return NULL;
3036 : : }
3037 : :
3038 : : /* Return next function. */
3039 : : inline cgraph_node *
3040 : 477178699 : symbol_table::next_function (cgraph_node *node)
3041 : : {
3042 : 477178699 : symtab_node *node1 = node->next;
3043 : 666477380 : for (; node1; node1 = node1->next)
3044 : 1107409098 : if (cgraph_node *cn1 = dyn_cast <cgraph_node *> (node1))
3045 : : return cn1;
3046 : : return NULL;
3047 : : }
3048 : :
3049 : : /* Return first function with body defined. */
3050 : : inline cgraph_node *
3051 : 1408551 : symbol_table::first_function_with_gimple_body (void)
3052 : : {
3053 : 1408551 : symtab_node *node;
3054 : 19947895 : for (node = nodes; node; node = node->next)
3055 : : {
3056 : 29840295 : cgraph_node *cn = dyn_cast <cgraph_node *> (node);
3057 : 11300951 : if (cn && cn->has_gimple_body_p ())
3058 : : return cn;
3059 : : }
3060 : : return NULL;
3061 : : }
3062 : :
3063 : : /* Return next reachable static variable with initializer after NODE. */
3064 : : inline cgraph_node *
3065 : 13320798 : symbol_table::next_function_with_gimple_body (cgraph_node *node)
3066 : : {
3067 : 13320798 : symtab_node *node1 = node->next;
3068 : 33568190 : for (; node1; node1 = node1->next)
3069 : : {
3070 : 35009587 : cgraph_node *cn1 = dyn_cast <cgraph_node *> (node1);
3071 : 14762195 : if (cn1 && cn1->has_gimple_body_p ())
3072 : : return cn1;
3073 : : }
3074 : : return NULL;
3075 : : }
3076 : :
3077 : : /* Walk all functions. */
3078 : : #define FOR_EACH_FUNCTION(node) \
3079 : : for ((node) = symtab->first_function (); (node); \
3080 : : (node) = symtab->next_function ((node)))
3081 : :
3082 : : /* Return true when callgraph node is a function with Gimple body defined
3083 : : in current unit. Functions can also be define externally or they
3084 : : can be thunks with no Gimple representation.
3085 : :
3086 : : Note that at WPA stage, the function body may not be present in memory. */
3087 : :
3088 : : inline bool
3089 : 71950761 : cgraph_node::has_gimple_body_p (void)
3090 : : {
3091 : 71950761 : return definition && !thunk && !alias;
3092 : : }
3093 : :
3094 : : /* Walk all functions with body defined. */
3095 : : #define FOR_EACH_FUNCTION_WITH_GIMPLE_BODY(node) \
3096 : : for ((node) = symtab->first_function_with_gimple_body (); (node); \
3097 : : (node) = symtab->next_function_with_gimple_body (node))
3098 : :
3099 : : /* Uniquize all constants that appear in memory.
3100 : : Each constant in memory thus far output is recorded
3101 : : in `const_desc_table'. */
3102 : :
3103 : : struct GTY((for_user)) constant_descriptor_tree {
3104 : : /* A MEM for the constant. */
3105 : : rtx rtl;
3106 : :
3107 : : /* The value of the constant. */
3108 : : tree value;
3109 : :
3110 : : /* Hash of value. Computing the hash from value each time
3111 : : hashfn is called can't work properly, as that means recursive
3112 : : use of the hash table during hash table expansion. */
3113 : : hashval_t hash;
3114 : : };
3115 : :
3116 : : /* Return true when function is only called directly or it has alias.
3117 : : i.e. it is not externally visible, address was not taken and
3118 : : it is not used in any other non-standard way. */
3119 : :
3120 : : inline bool
3121 : 20129104 : cgraph_node::only_called_directly_or_aliased_p (void)
3122 : : {
3123 : 20129104 : gcc_assert (!inlined_to);
3124 : 20129104 : return (!force_output && !address_taken
3125 : : && !ifunc_resolver
3126 : 20129104 : && !used_from_other_partition
3127 : 17001073 : && !DECL_VIRTUAL_P (decl)
3128 : 16928069 : && !DECL_STATIC_CONSTRUCTOR (decl)
3129 : 16843264 : && !DECL_STATIC_DESTRUCTOR (decl)
3130 : 16842746 : && !used_from_object_file_p ()
3131 : 36944095 : && !externally_visible);
3132 : : }
3133 : :
3134 : : /* Return true when function can be removed from callgraph
3135 : : if all direct calls are eliminated. */
3136 : :
3137 : : inline bool
3138 : 16821016 : cgraph_node::can_remove_if_no_direct_calls_and_refs_p (void)
3139 : : {
3140 : 16821016 : gcc_checking_assert (!inlined_to);
3141 : : /* Extern inlines can always go, we will use the external definition. */
3142 : 16821016 : if (DECL_EXTERNAL (decl))
3143 : : return true;
3144 : : /* When function is needed, we cannot remove it. */
3145 : 16216040 : if (force_output || used_from_other_partition)
3146 : : return false;
3147 : 13908922 : if (DECL_STATIC_CONSTRUCTOR (decl)
3148 : 13908922 : || DECL_STATIC_DESTRUCTOR (decl))
3149 : : return false;
3150 : : /* Only COMDAT functions can be removed if externally visible. */
3151 : 13843817 : if (externally_visible
3152 : 13843817 : && ((!DECL_COMDAT (decl) || ifunc_resolver)
3153 : 6336313 : || forced_by_abi
3154 : 6104818 : || used_from_object_file_p ()))
3155 : 5434959 : return false;
3156 : : return true;
3157 : : }
3158 : :
3159 : : /* Verify cgraph, if consistency checking is enabled. */
3160 : :
3161 : : inline void
3162 : 890 : cgraph_node::checking_verify_cgraph_nodes (void)
3163 : : {
3164 : 890 : if (flag_checking)
3165 : 890 : cgraph_node::verify_cgraph_nodes ();
3166 : : }
3167 : :
3168 : : /* Return true when variable can be removed from variable pool
3169 : : if all direct calls are eliminated. */
3170 : :
3171 : : inline bool
3172 : 22892432 : varpool_node::can_remove_if_no_refs_p (void)
3173 : : {
3174 : 22892432 : if (DECL_EXTERNAL (decl))
3175 : : return true;
3176 : 22876491 : return (!force_output && !used_from_other_partition
3177 : 22876491 : && ((DECL_COMDAT (decl)
3178 : 623516 : && !forced_by_abi
3179 : 567816 : && !used_from_object_file_p ())
3180 : 19705711 : || !externally_visible
3181 : 8952630 : || DECL_HAS_VALUE_EXPR_P (decl)));
3182 : : }
3183 : :
3184 : : /* Return true when all references to variable must be visible in ipa_ref_list.
3185 : : i.e. if the variable is not externally visible or not used in some magic
3186 : : way (asm statement or such).
3187 : : The magic uses are all summarized in force_output flag. */
3188 : :
3189 : : inline bool
3190 : 8235719 : varpool_node::all_refs_explicit_p ()
3191 : : {
3192 : 8235719 : return (definition
3193 : : && !externally_visible
3194 : : && !used_from_other_partition
3195 : 8235719 : && !force_output);
3196 : : }
3197 : :
3198 : : struct tree_descriptor_hasher : ggc_ptr_hash<constant_descriptor_tree>
3199 : : {
3200 : : static hashval_t hash (constant_descriptor_tree *);
3201 : : static bool equal (constant_descriptor_tree *, constant_descriptor_tree *);
3202 : : };
3203 : :
3204 : : /* Constant pool accessor function. */
3205 : : hash_table<tree_descriptor_hasher> *constant_pool_htab (void);
3206 : :
3207 : : /* Return node that alias is aliasing. */
3208 : :
3209 : : inline cgraph_node *
3210 : 7514508 : cgraph_node::get_alias_target (void)
3211 : : {
3212 : 7514508 : return dyn_cast <cgraph_node *> (symtab_node::get_alias_target ());
3213 : : }
3214 : :
3215 : : /* Return node that alias is aliasing. */
3216 : :
3217 : : inline varpool_node *
3218 : 16095 : varpool_node::get_alias_target (void)
3219 : : {
3220 : 16095 : return dyn_cast <varpool_node *> (symtab_node::get_alias_target ());
3221 : : }
3222 : :
3223 : : /* Walk the alias chain to return the symbol NODE is alias of.
3224 : : If NODE is not an alias, return NODE.
3225 : : When AVAILABILITY is non-NULL, get minimal availability in the chain.
3226 : : When REF is non-NULL, assume that reference happens in symbol REF
3227 : : when determining the availability. */
3228 : :
3229 : : inline symtab_node *
3230 : 1418688920 : symtab_node::ultimate_alias_target (enum availability *availability,
3231 : : symtab_node *ref)
3232 : : {
3233 : 1418688920 : if (!alias)
3234 : : {
3235 : 1387040460 : if (availability)
3236 : 860480818 : *availability = get_availability (ref);
3237 : 1387040460 : return this;
3238 : : }
3239 : :
3240 : 31648460 : return ultimate_alias_target_1 (availability, ref);
3241 : : }
3242 : :
3243 : : /* Given function symbol, walk the alias chain to return the function node
3244 : : is alias of. Do not walk through thunks.
3245 : : When AVAILABILITY is non-NULL, get minimal availability in the chain.
3246 : : When REF is non-NULL, assume that reference happens in symbol REF
3247 : : when determining the availability. */
3248 : :
3249 : : inline cgraph_node *
3250 : 1118069431 : cgraph_node::ultimate_alias_target (enum availability *availability,
3251 : : symtab_node *ref)
3252 : : {
3253 : 1118069431 : cgraph_node *n = dyn_cast <cgraph_node *>
3254 : 1118069431 : (symtab_node::ultimate_alias_target (availability, ref));
3255 : 1118069431 : if (!n && availability)
3256 : 0 : *availability = AVAIL_NOT_AVAILABLE;
3257 : 1118069431 : return n;
3258 : : }
3259 : :
3260 : : /* For given variable pool node, walk the alias chain to return the function
3261 : : the variable is alias of. Do not walk through thunks.
3262 : : When AVAILABILITY is non-NULL, get minimal availability in the chain.
3263 : : When REF is non-NULL, assume that reference happens in symbol REF
3264 : : when determining the availability. */
3265 : :
3266 : : inline varpool_node *
3267 : 40649964 : varpool_node::ultimate_alias_target (availability *availability,
3268 : : symtab_node *ref)
3269 : : {
3270 : 40649964 : varpool_node *n = dyn_cast <varpool_node *>
3271 : 40649964 : (symtab_node::ultimate_alias_target (availability, ref));
3272 : :
3273 : 40649964 : if (!n && availability)
3274 : 0 : *availability = AVAIL_NOT_AVAILABLE;
3275 : 40649964 : return n;
3276 : : }
3277 : :
3278 : : /* Set callee N of call graph edge and add it to the corresponding set of
3279 : : callers. */
3280 : :
3281 : : inline void
3282 : 3635294 : cgraph_edge::set_callee (cgraph_node *n)
3283 : : {
3284 : 3635294 : prev_caller = NULL;
3285 : 3635294 : if (n->callers)
3286 : 351027 : n->callers->prev_caller = this;
3287 : 3635294 : next_caller = n->callers;
3288 : 3635294 : n->callers = this;
3289 : 3635294 : callee = n;
3290 : : }
3291 : :
3292 : : /* Return true when the edge represents a direct recursion. */
3293 : :
3294 : : inline bool
3295 : 17012312 : cgraph_edge::recursive_p (void)
3296 : : {
3297 : 17012312 : cgraph_node *c = callee->ultimate_alias_target ();
3298 : 17012312 : if (caller->inlined_to)
3299 : 3059962 : return caller->inlined_to->decl == c->decl;
3300 : : else
3301 : 13952350 : return caller->decl == c->decl;
3302 : : }
3303 : :
3304 : : /* Remove the edge from the list of the callers of the callee. */
3305 : :
3306 : : inline void
3307 : 40112520 : cgraph_edge::remove_callee (void)
3308 : : {
3309 : 40112520 : gcc_assert (!indirect_unknown_callee);
3310 : 40112520 : if (prev_caller)
3311 : 17784684 : prev_caller->next_caller = next_caller;
3312 : 40112520 : if (next_caller)
3313 : 24280687 : next_caller->prev_caller = prev_caller;
3314 : 40112520 : if (!prev_caller)
3315 : 22327836 : callee->callers = next_caller;
3316 : 40112520 : }
3317 : :
3318 : : /* Return true if call must bind to current definition. */
3319 : :
3320 : : inline bool
3321 : 734129 : cgraph_edge::binds_to_current_def_p ()
3322 : : {
3323 : 734129 : if (callee)
3324 : 734129 : return callee->binds_to_current_def_p (caller);
3325 : : else
3326 : : return false;
3327 : : }
3328 : :
3329 : : /* Expected frequency of executions within the function.
3330 : : When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
3331 : : per function call. The range is 0 to CGRAPH_FREQ_MAX. */
3332 : :
3333 : : inline int
3334 : 192524 : cgraph_edge::frequency ()
3335 : : {
3336 : 192524 : return count.to_cgraph_frequency (caller->inlined_to
3337 : 192524 : ? caller->inlined_to->count
3338 : 192524 : : caller->count);
3339 : : }
3340 : :
3341 : :
3342 : : /* Return true if the TM_CLONE bit is set for a given FNDECL. */
3343 : : inline bool
3344 : 1046635 : decl_is_tm_clone (const_tree fndecl)
3345 : : {
3346 : 1046635 : cgraph_node *n = cgraph_node::get (fndecl);
3347 : 1046635 : if (n)
3348 : 931451 : return n->tm_clone;
3349 : : return false;
3350 : : }
3351 : :
3352 : : /* Likewise indicate that a node is needed, i.e. reachable via some
3353 : : external means. */
3354 : :
3355 : : inline void
3356 : 4351 : cgraph_node::mark_force_output (void)
3357 : : {
3358 : 4351 : force_output = 1;
3359 : 4351 : gcc_checking_assert (!inlined_to);
3360 : 4351 : }
3361 : :
3362 : : /* Return true if function should be optimized for size. */
3363 : :
3364 : : inline enum optimize_size_level
3365 : 2142873005 : cgraph_node::optimize_for_size_p (void)
3366 : : {
3367 : 2142873005 : if (opt_for_fn (decl, optimize_size))
3368 : : return OPTIMIZE_SIZE_MAX;
3369 : 2080398802 : if (count == profile_count::zero ())
3370 : 2079590 : return OPTIMIZE_SIZE_MAX;
3371 : 2078319212 : if (frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED)
3372 : : return OPTIMIZE_SIZE_BALANCED;
3373 : : else
3374 : 2077346832 : return OPTIMIZE_SIZE_NO;
3375 : : }
3376 : :
3377 : : /* Return symtab_node for NODE or create one if it is not present
3378 : : in symtab. */
3379 : :
3380 : : inline symtab_node *
3381 : 321020 : symtab_node::get_create (tree node)
3382 : : {
3383 : 321020 : if (VAR_P (node))
3384 : 320575 : return varpool_node::get_create (node);
3385 : : else
3386 : 445 : return cgraph_node::get_create (node);
3387 : : }
3388 : :
3389 : : /* Return availability of NODE when referenced from REF. */
3390 : :
3391 : : inline enum availability
3392 : 874007863 : symtab_node::get_availability (symtab_node *ref)
3393 : : {
3394 : 874007863 : if (is_a <cgraph_node *> (this))
3395 : 705306513 : return dyn_cast <cgraph_node *> (this)->get_availability (ref);
3396 : : else
3397 : 168701350 : return dyn_cast <varpool_node *> (this)->get_availability (ref);
3398 : : }
3399 : :
3400 : : /* Call callback on symtab node and aliases associated to this node.
3401 : : When INCLUDE_OVERWRITABLE is false, overwritable symbols are skipped. */
3402 : :
3403 : : inline bool
3404 : 29282384 : symtab_node::call_for_symbol_and_aliases (bool (*callback) (symtab_node *,
3405 : : void *),
3406 : : void *data,
3407 : : bool include_overwritable)
3408 : : {
3409 : 29282384 : if (include_overwritable
3410 : 29282384 : || get_availability () > AVAIL_INTERPOSABLE)
3411 : : {
3412 : 29282384 : if (callback (this, data))
3413 : : return true;
3414 : : }
3415 : 25551225 : if (has_aliases_p ())
3416 : 144730 : return call_for_symbol_and_aliases_1 (callback, data, include_overwritable);
3417 : : return false;
3418 : : }
3419 : :
3420 : : /* Call callback on function and aliases associated to the function.
3421 : : When INCLUDE_OVERWRITABLE is false, overwritable symbols are
3422 : : skipped. */
3423 : :
3424 : : inline bool
3425 : 34932394 : cgraph_node::call_for_symbol_and_aliases (bool (*callback) (cgraph_node *,
3426 : : void *),
3427 : : void *data,
3428 : : bool include_overwritable)
3429 : : {
3430 : 34932394 : if (include_overwritable
3431 : 34932394 : || get_availability () > AVAIL_INTERPOSABLE)
3432 : : {
3433 : 34932394 : if (callback (this, data))
3434 : : return true;
3435 : : }
3436 : 22500320 : if (has_aliases_p ())
3437 : 702030 : return call_for_symbol_and_aliases_1 (callback, data, include_overwritable);
3438 : : return false;
3439 : : }
3440 : :
3441 : : /* Call callback on varpool symbol and aliases associated to varpool symbol.
3442 : : When INCLUDE_OVERWRITABLE is false, overwritable symbols are
3443 : : skipped. */
3444 : :
3445 : : inline bool
3446 : 308351 : varpool_node::call_for_symbol_and_aliases (bool (*callback) (varpool_node *,
3447 : : void *),
3448 : : void *data,
3449 : : bool include_overwritable)
3450 : : {
3451 : 308351 : if (include_overwritable
3452 : 308351 : || get_availability () > AVAIL_INTERPOSABLE)
3453 : : {
3454 : 308351 : if (callback (this, data))
3455 : : return true;
3456 : : }
3457 : 308351 : if (has_aliases_p ())
3458 : 6503 : return call_for_symbol_and_aliases_1 (callback, data, include_overwritable);
3459 : : return false;
3460 : : }
3461 : :
3462 : : /* Return true if reference may be used in address compare. */
3463 : :
3464 : : inline bool
3465 : 5551886 : ipa_ref::address_matters_p ()
3466 : : {
3467 : 5551886 : if (use != IPA_REF_ADDR)
3468 : : return false;
3469 : : /* Addresses taken from virtual tables are never compared. */
3470 : 4449429 : if (is_a <varpool_node *> (referring)
3471 : 3685184 : && DECL_VIRTUAL_P (referring->decl))
3472 : : return false;
3473 : 4370637 : return referred->address_can_be_compared_p ();
3474 : : }
3475 : :
3476 : : /* Build polymorphic call context for indirect call E. */
3477 : :
3478 : : inline
3479 : 260687 : ipa_polymorphic_call_context::ipa_polymorphic_call_context (cgraph_edge *e)
3480 : : {
3481 : 260687 : gcc_checking_assert (e->indirect_info->polymorphic);
3482 : 260687 : *this = e->indirect_info->context;
3483 : 260687 : }
3484 : :
3485 : : /* Build empty "I know nothing" context. */
3486 : :
3487 : : inline
3488 : 12736930 : ipa_polymorphic_call_context::ipa_polymorphic_call_context ()
3489 : : {
3490 : 12736930 : clear_speculation ();
3491 : 12736930 : clear_outer_type ();
3492 : 12736930 : invalid = false;
3493 : : }
3494 : :
3495 : : /* Make context non-speculative. */
3496 : :
3497 : : inline void
3498 : 20599640 : ipa_polymorphic_call_context::clear_speculation ()
3499 : : {
3500 : 20599640 : speculative_outer_type = NULL;
3501 : 20599640 : speculative_offset = 0;
3502 : 19710348 : speculative_maybe_derived_type = false;
3503 : 1174402 : }
3504 : :
3505 : : /* Produce context specifying all derived types of OTR_TYPE. If OTR_TYPE is
3506 : : NULL, the context is set to dummy "I know nothing" setting. */
3507 : :
3508 : : inline void
3509 : 18266620 : ipa_polymorphic_call_context::clear_outer_type (tree otr_type)
3510 : : {
3511 : 15265413 : outer_type = otr_type ? TYPE_MAIN_VARIANT (otr_type) : NULL;
3512 : 18266620 : offset = 0;
3513 : 18266620 : maybe_derived_type = true;
3514 : 18266620 : maybe_in_construction = true;
3515 : 13825218 : dynamic = true;
3516 : 4441402 : }
3517 : :
3518 : : /* Adjust all offsets in contexts by OFF bits. */
3519 : :
3520 : : inline void
3521 : 165477 : ipa_polymorphic_call_context::offset_by (HOST_WIDE_INT off)
3522 : : {
3523 : 165477 : if (outer_type)
3524 : 58492 : offset += off;
3525 : 165477 : if (speculative_outer_type)
3526 : 103894 : speculative_offset += off;
3527 : : }
3528 : :
3529 : : /* Return TRUE if context is fully useless. */
3530 : :
3531 : : inline bool
3532 : 5060831 : ipa_polymorphic_call_context::useless_p () const
3533 : : {
3534 : 5060671 : return (!outer_type && !speculative_outer_type);
3535 : : }
3536 : :
3537 : : /* When using fprintf (or similar), problems can arise with
3538 : : transient generated strings. Many string-generation APIs
3539 : : only support one result being alive at once (e.g. by
3540 : : returning a pointer to a statically-allocated buffer).
3541 : :
3542 : : If there is more than one generated string within one
3543 : : fprintf call: the first string gets evicted or overwritten
3544 : : by the second, before fprintf is fully evaluated.
3545 : : See e.g. PR/53136.
3546 : :
3547 : : This function provides a workaround for this, by providing
3548 : : a simple way to create copies of these transient strings,
3549 : : without the need to have explicit cleanup:
3550 : :
3551 : : fprintf (dumpfile, "string 1: %s string 2:%s\n",
3552 : : xstrdup_for_dump (EXPR_1),
3553 : : xstrdup_for_dump (EXPR_2));
3554 : :
3555 : : This is actually a simple wrapper around ggc_strdup, but
3556 : : the name documents the intent. We require that no GC can occur
3557 : : within the fprintf call. */
3558 : :
3559 : : inline const char *
3560 : 449875 : xstrdup_for_dump (const char *transient_str)
3561 : : {
3562 : 449875 : return ggc_strdup (transient_str);
3563 : : }
3564 : :
3565 : : /* During LTO stream-in this predicate can be used to check whether node
3566 : : in question prevails in the linking to save some memory usage. */
3567 : : inline bool
3568 : 719976 : symtab_node::prevailing_p (void)
3569 : : {
3570 : 719976 : return definition && ((!TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
3571 : 562280 : || previous_sharing_asm_name == NULL);
3572 : : }
3573 : :
3574 : : extern GTY(()) symbol_table *saved_symtab;
3575 : :
3576 : : #if CHECKING_P
3577 : :
3578 : : namespace selftest {
3579 : :
3580 : : /* An RAII-style class for use in selftests for temporarily using a different
3581 : : symbol_table, so that such tests can be isolated from each other. */
3582 : :
3583 : : class symbol_table_test
3584 : : {
3585 : : public:
3586 : : /* Constructor. Override "symtab". */
3587 : : symbol_table_test ();
3588 : :
3589 : : /* Destructor. Restore the saved_symtab. */
3590 : : ~symbol_table_test ();
3591 : : };
3592 : :
3593 : : } // namespace selftest
3594 : :
3595 : : #endif /* CHECKING_P */
3596 : :
3597 : : #endif /* GCC_CGRAPH_H */
|
