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