1 /* Callgraph handling code.
2 Copyright (C) 2003-2013 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
25 #include "plugin-api.h"
28 #include "basic-block.h"
32 /* Symbol table consists of functions and variables.
33 TODO: add labels and CONST_DECLs. */
41 /* Base of all entries in the symbol table.
42 The symtab_node is inherited by cgraph and varpol nodes. */
43 struct GTY(()) symtab_node_base
45 /* Type of the symbol. */
46 ENUM_BITFIELD (symtab_type
) type
: 8;
48 /* The symbols resolution. */
49 ENUM_BITFIELD (ld_plugin_symbol_resolution
) resolution
: 8;
51 /*** Flags representing the symbol type. ***/
53 /* True when symbol corresponds to a definition in current unit.
54 set via cgraph_finalize_function or varpool_finalize_decl */
55 unsigned definition
: 1;
56 /* True when symbol is an alias.
57 Set by assemble_alias. */
59 /* True when alias is a weakref. */
61 /* C++ frontend produce same body aliases and extra name aliases for
62 virtual functions and vtables that are obviously equivalent.
63 Those aliases are bit special, especially because C++ frontend
64 visibility code is so ugly it can not get them right at first time
65 and their visibility needs to be copied from their "masters" at
66 the end of parsing. */
67 unsigned cpp_implicit_alias
: 1;
68 /* Set once the definition was analyzed. The list of references and
69 other properties are built during analysis. */
70 unsigned analyzed
: 1;
73 /*** Visibility and linkage flags. ***/
75 /* Set when function is visible by other units. */
76 unsigned externally_visible
: 1;
77 /* The symbol will be assumed to be used in an invisiable way (like
78 by an toplevel asm statement). */
79 unsigned force_output
: 1;
80 /* Like FORCE_OUTPUT, but in the case it is ABI requiring the symbol to be
81 exported. Unlike FORCE_OUTPUT this flag gets cleared to symbols promoted
82 to static and it does not inhibit optimization. */
83 unsigned forced_by_abi
: 1;
84 /* True when the name is known to be unique and thus it does not need mangling. */
85 unsigned unique_name
: 1;
88 /*** WHOPR Partitioning flags.
89 These flags are used at ltrans stage when only part of the callgraph is
92 /* Set when variable is used from other LTRANS partition. */
93 unsigned used_from_other_partition
: 1;
94 /* Set when function is available in the other LTRANS partition.
95 During WPA output it is used to mark nodes that are present in
96 multiple partitions. */
97 unsigned in_other_partition
: 1;
101 /*** other flags. ***/
103 /* Set when symbol has address taken. */
104 unsigned address_taken
: 1;
107 /* Ordering of all symtab entries. */
110 /* Declaration representing the symbol. */
113 /* Linked list of symbol table entries starting with symtab_nodes. */
115 symtab_node previous
;
117 /* Linked list of symbols with the same asm name. There may be multiple
118 entries for single symbol name during LTO, because symbols are renamed
119 only after partitioning.
121 Because inline clones are kept in the assembler name has, they also produce
124 There are also several long standing bugs where frontends and builtin
125 code produce duplicated decls. */
126 symtab_node next_sharing_asm_name
;
127 symtab_node previous_sharing_asm_name
;
129 /* Circular list of nodes in the same comdat group if non-NULL. */
130 symtab_node same_comdat_group
;
132 /* Vectors of referring and referenced entities. */
133 struct ipa_ref_list ref_list
;
135 /* Alias target. May be either DECL pointer or ASSEMBLER_NAME pointer
136 depending to what was known to frontend on the creation time.
137 Once alias is resolved, this pointer become NULL. */
140 /* File stream where this node is being written to. */
141 struct lto_file_decl_data
* lto_file_data
;
143 PTR
GTY ((skip
)) aux
;
148 /* Not yet set by cgraph_function_body_availability. */
150 /* Function body/variable initializer is unknown. */
152 /* Function body/variable initializer is known but might be replaced
153 by a different one from other compilation unit and thus needs to
154 be dealt with a care. Like AVAIL_NOT_AVAILABLE it can have
155 arbitrary side effects on escaping variables and functions, while
156 like AVAILABLE it might access static variables. */
158 /* Function body/variable initializer is known and will be used in final
161 /* Function body/variable initializer is known and all it's uses are explicitly
162 visible within current unit (ie it's address is never taken and it is not
163 exported to other units).
164 Currently used only for functions. */
168 /* This is the information that is put into the cgraph local structure
169 to recover a function. */
170 struct lto_file_decl_data
;
172 extern const char * const cgraph_availability_names
[];
173 extern const char * const ld_plugin_symbol_resolution_names
[];
175 /* Information about thunk, used only for same body aliases. */
177 struct GTY(()) cgraph_thunk_info
{
178 /* Information about the thunk. */
179 HOST_WIDE_INT fixed_offset
;
180 HOST_WIDE_INT virtual_value
;
183 bool virtual_offset_p
;
184 /* Set to true when alias node is thunk. */
188 /* Information about the function collected locally.
189 Available after function is analyzed. */
191 struct GTY(()) cgraph_local_info
{
192 /* Set when function function is visible in current compilation unit only
193 and its address is never taken. */
196 /* False when there is something makes versioning impossible. */
197 unsigned versionable
: 1;
199 /* False when function calling convention and signature can not be changed.
200 This is the case when __builtin_apply_args is used. */
201 unsigned can_change_signature
: 1;
203 /* True when the function has been originally extern inline, but it is
205 unsigned redefined_extern_inline
: 1;
207 /* True if the function may enter serial irrevocable mode. */
208 unsigned tm_may_enter_irr
: 1;
211 /* Information about the function that needs to be computed globally
212 once compilation is finished. Available only with -funit-at-a-time. */
214 struct GTY(()) cgraph_global_info
{
215 /* For inline clones this points to the function they will be
217 struct cgraph_node
*inlined_to
;
220 /* Information about the function that is propagated by the RTL backend.
221 Available only for functions that has been already assembled. */
223 struct GTY(()) cgraph_rtl_info
{
224 unsigned int preferred_incoming_stack_boundary
;
227 /* Represent which DECL tree (or reference to such tree)
228 will be replaced by another tree while versioning. */
229 struct GTY(()) ipa_replace_map
231 /* The tree that will be replaced. */
233 /* The new (replacing) tree. */
235 /* Parameter number to replace, when old_tree is NULL. */
237 /* True when a substitution should be done, false otherwise. */
239 /* True when we replace a reference to old_tree. */
242 typedef struct ipa_replace_map
*ipa_replace_map_p
;
244 struct GTY(()) cgraph_clone_info
246 vec
<ipa_replace_map_p
, va_gc
> *tree_map
;
248 bitmap combined_args_to_skip
;
252 /* The cgraph data structure.
253 Each function decl has assigned cgraph_node listing callees and callers. */
255 struct GTY(()) cgraph_node
{
256 struct symtab_node_base symbol
;
257 struct cgraph_edge
*callees
;
258 struct cgraph_edge
*callers
;
259 /* List of edges representing indirect calls with a yet undetermined
261 struct cgraph_edge
*indirect_calls
;
262 /* For nested functions points to function the node is nested in. */
264 GTY ((nested_ptr (union symtab_node_def
, "(struct cgraph_node *)(%h)", "(symtab_node)%h")))
266 /* Points to first nested function, if any. */
268 GTY ((nested_ptr (union symtab_node_def
, "(struct cgraph_node *)(%h)", "(symtab_node)%h")))
270 /* Pointer to the next function with same origin, if any. */
272 GTY ((nested_ptr (union symtab_node_def
, "(struct cgraph_node *)(%h)", "(symtab_node)%h")))
274 /* Pointer to the next clone. */
275 struct cgraph_node
*next_sibling_clone
;
276 struct cgraph_node
*prev_sibling_clone
;
277 struct cgraph_node
*clones
;
278 struct cgraph_node
*clone_of
;
279 /* For functions with many calls sites it holds map from call expression
280 to the edge to speed up cgraph_edge function. */
281 htab_t
GTY((param_is (struct cgraph_edge
))) call_site_hash
;
282 /* Declaration node used to be clone of. */
283 tree former_clone_of
;
285 /* Interprocedural passes scheduled to have their transform functions
286 applied next time we execute local pass on them. We maintain it
287 per-function in order to allow IPA passes to introduce new functions. */
288 vec
<ipa_opt_pass
> GTY((skip
)) ipa_transforms_to_apply
;
290 struct cgraph_local_info local
;
291 struct cgraph_global_info global
;
292 struct cgraph_rtl_info rtl
;
293 struct cgraph_clone_info clone
;
294 struct cgraph_thunk_info thunk
;
296 /* Expected number of executions: calculated in profile.c. */
298 /* How to scale counts at materialization time; used to merge
299 LTO units with different number of profile runs. */
300 int count_materialization_scale
;
301 /* Unique id of the node. */
304 /* Set when decl is an abstract function pointed to by the
305 ABSTRACT_DECL_ORIGIN of a reachable function. */
306 unsigned used_as_abstract_origin
: 1;
307 /* Set once the function is lowered (i.e. its CFG is built). */
308 unsigned lowered
: 1;
309 /* Set once the function has been instantiated and its callee
311 unsigned process
: 1;
312 /* How commonly executed the node is. Initialized during branch
313 probabilities pass. */
314 ENUM_BITFIELD (node_frequency
) frequency
: 2;
315 /* True when function can only be called at startup (from static ctor). */
316 unsigned only_called_at_startup
: 1;
317 /* True when function can only be called at startup (from static dtor). */
318 unsigned only_called_at_exit
: 1;
319 /* True when function is the transactional clone of a function which
320 is called only from inside transactions. */
321 /* ?? We should be able to remove this. We have enough bits in
322 cgraph to calculate it. */
323 unsigned tm_clone
: 1;
324 /* True if this decl is a dispatcher for function versions. */
325 unsigned dispatcher_function
: 1;
329 typedef struct cgraph_node
*cgraph_node_ptr
;
332 /* Function Multiversioning info. */
333 struct GTY(()) cgraph_function_version_info
{
334 /* The cgraph_node for which the function version info is stored. */
335 struct cgraph_node
*this_node
;
336 /* Chains all the semantically identical function versions. The
337 first function in this chain is the version_info node of the
339 struct cgraph_function_version_info
*prev
;
340 /* If this version node corresponds to a dispatcher for function
341 versions, this points to the version info node of the default
342 function, the first node in the chain. */
343 struct cgraph_function_version_info
*next
;
344 /* If this node corresponds to a function version, this points
345 to the dispatcher function decl, which is the function that must
346 be called to execute the right function version at run-time.
348 If this cgraph node is a dispatcher (if dispatcher_function is
349 true, in the cgraph_node struct) for function versions, this
350 points to resolver function, which holds the function body of the
351 dispatcher. The dispatcher decl is an alias to the resolver
353 tree dispatcher_resolver
;
356 /* Get the cgraph_function_version_info node corresponding to node. */
357 struct cgraph_function_version_info
*
358 get_cgraph_node_version (struct cgraph_node
*node
);
360 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
361 corresponding to cgraph_node NODE. */
362 struct cgraph_function_version_info
*
363 insert_new_cgraph_node_version (struct cgraph_node
*node
);
365 /* Record that DECL1 and DECL2 are semantically identical function
367 void record_function_versions (tree decl1
, tree decl2
);
369 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
370 DECL is a duplicate declaration. */
371 void delete_function_version (tree decl
);
373 /* A cgraph node set is a collection of cgraph nodes. A cgraph node
374 can appear in multiple sets. */
375 struct cgraph_node_set_def
377 struct pointer_map_t
*map
;
378 vec
<cgraph_node_ptr
> nodes
;
381 typedef struct varpool_node
*varpool_node_ptr
;
384 /* A varpool node set is a collection of varpool nodes. A varpool node
385 can appear in multiple sets. */
386 struct varpool_node_set_def
388 struct pointer_map_t
* map
;
389 vec
<varpool_node_ptr
> nodes
;
392 typedef struct cgraph_node_set_def
*cgraph_node_set
;
395 typedef struct varpool_node_set_def
*varpool_node_set
;
398 /* Iterator structure for cgraph node sets. */
403 } cgraph_node_set_iterator
;
405 /* Iterator structure for varpool node sets. */
408 varpool_node_set set
;
410 } varpool_node_set_iterator
;
412 #define DEFCIFCODE(code, string) CIF_ ## code,
413 /* Reasons for inlining failures. */
414 typedef enum cgraph_inline_failed_enum
{
415 #include "cif-code.def"
417 } cgraph_inline_failed_t
;
419 /* Structure containing additional information about an indirect call. */
421 struct GTY(()) cgraph_indirect_call_info
423 /* When polymorphic is set, this field contains offset where the object which
424 was actually used in the polymorphic resides within a larger structure.
425 If agg_contents is set, the field contains the offset within the aggregate
426 from which the address to call was loaded. */
427 HOST_WIDE_INT offset
;
428 /* OBJ_TYPE_REF_TOKEN of a polymorphic call (if polymorphic is set). */
429 HOST_WIDE_INT otr_token
;
430 /* Type of the object from OBJ_TYPE_REF_OBJECT. */
432 /* Index of the parameter that is called. */
434 /* ECF flags determined from the caller. */
437 /* Set when the call is a virtual call with the parameter being the
438 associated object pointer rather than a simple direct call. */
439 unsigned polymorphic
: 1;
440 /* Set when the call is a call of a pointer loaded from contents of an
441 aggregate at offset. */
442 unsigned agg_contents
: 1;
443 /* Set when this is a call through a member pointer. */
444 unsigned member_ptr
: 1;
445 /* When the previous bit is set, this one determines whether the destination
446 is loaded from a parameter passed by reference. */
450 struct GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"))) cgraph_edge
{
451 /* Expected number of executions: calculated in profile.c. */
453 struct cgraph_node
*caller
;
454 struct cgraph_node
*callee
;
455 struct cgraph_edge
*prev_caller
;
456 struct cgraph_edge
*next_caller
;
457 struct cgraph_edge
*prev_callee
;
458 struct cgraph_edge
*next_callee
;
460 /* Additional information about an indirect call. Not cleared when an edge
462 struct cgraph_indirect_call_info
*indirect_info
;
463 PTR
GTY ((skip (""))) aux
;
464 /* When equal to CIF_OK, inline this call. Otherwise, points to the
465 explanation why function was not inlined. */
466 cgraph_inline_failed_t inline_failed
;
467 /* The stmt_uid of call_stmt. This is used by LTO to recover the call_stmt
468 when the function is serialized in. */
469 unsigned int lto_stmt_uid
;
470 /* Expected frequency of executions within the function.
471 When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
472 per function call. The range is 0 to CGRAPH_FREQ_MAX. */
474 /* Unique id of the edge. */
476 /* Whether this edge was made direct by indirect inlining. */
477 unsigned int indirect_inlining_edge
: 1;
478 /* Whether this edge describes an indirect call with an undetermined
480 unsigned int indirect_unknown_callee
: 1;
481 /* Whether this edge is still a dangling */
482 /* True if the corresponding CALL stmt cannot be inlined. */
483 unsigned int call_stmt_cannot_inline_p
: 1;
484 /* Can this call throw externally? */
485 unsigned int can_throw_external
: 1;
488 #define CGRAPH_FREQ_BASE 1000
489 #define CGRAPH_FREQ_MAX 100000
491 typedef struct cgraph_edge
*cgraph_edge_p
;
494 /* The varpool data structure.
495 Each static variable decl has assigned varpool_node. */
497 struct GTY(()) varpool_node
{
498 struct symtab_node_base symbol
;
500 /* Set when variable is scheduled to be assembled. */
504 /* Every top level asm statement is put into a asm_node. */
506 struct GTY(()) asm_node
{
508 struct asm_node
*next
;
509 /* String for this asm node. */
511 /* Ordering of all cgraph nodes. */
515 /* Symbol table entry. */
516 union GTY((desc ("%h.symbol.type"), chain_next ("%h.symbol.next"),
517 chain_prev ("%h.symbol.previous"))) symtab_node_def
{
518 struct symtab_node_base
GTY ((tag ("SYMTAB_SYMBOL"))) symbol
;
519 /* To access the following fields,
520 use the use dyn_cast or as_a to obtain the concrete type. */
521 struct cgraph_node
GTY ((tag ("SYMTAB_FUNCTION"))) x_function
;
522 struct varpool_node
GTY ((tag ("SYMTAB_VARIABLE"))) x_variable
;
525 /* Report whether or not THIS symtab node is a function, aka cgraph_node. */
530 is_a_helper
<cgraph_node
>::test (symtab_node_def
*p
)
532 return p
->symbol
.type
== SYMTAB_FUNCTION
;
535 /* Report whether or not THIS symtab node is a vriable, aka varpool_node. */
540 is_a_helper
<varpool_node
>::test (symtab_node_def
*p
)
542 return p
->symbol
.type
== SYMTAB_VARIABLE
;
545 extern GTY(()) symtab_node symtab_nodes
;
546 extern GTY(()) int cgraph_n_nodes
;
547 extern GTY(()) int cgraph_max_uid
;
548 extern GTY(()) int cgraph_edge_max_uid
;
549 extern bool cgraph_global_info_ready
;
552 /* Frontend is parsing and finalizing functions. */
553 CGRAPH_STATE_PARSING
,
554 /* Callgraph is being constructed. It is safe to add new functions. */
555 CGRAPH_STATE_CONSTRUCTION
,
556 /* Callgraph is being at LTO time. */
557 CGRAPH_LTO_STREAMING
,
558 /* Callgraph is built and IPA passes are being run. */
560 /* Callgraph is built and all functions are transformed to SSA form. */
561 CGRAPH_STATE_IPA_SSA
,
562 /* Functions are now ordered and being passed to RTL expanders. */
563 CGRAPH_STATE_EXPANSION
,
564 /* All cgraph expansion is done. */
565 CGRAPH_STATE_FINISHED
567 extern enum cgraph_state cgraph_state
;
568 extern bool cgraph_function_flags_ready
;
569 extern cgraph_node_set cgraph_new_nodes
;
571 extern GTY(()) struct asm_node
*asm_nodes
;
572 extern GTY(()) int symtab_order
;
573 extern bool cpp_implicit_aliases_done
;
576 void symtab_register_node (symtab_node
);
577 void symtab_unregister_node (symtab_node
);
578 void symtab_remove_node (symtab_node
);
579 symtab_node
symtab_get_node (const_tree
);
580 symtab_node
symtab_node_for_asm (const_tree asmname
);
581 const char * symtab_node_asm_name (symtab_node
);
582 const char * symtab_node_name (symtab_node
);
583 void symtab_insert_node_to_hashtable (symtab_node
);
584 void symtab_add_to_same_comdat_group (symtab_node
, symtab_node
);
585 void symtab_dissolve_same_comdat_group_list (symtab_node node
);
586 void dump_symtab (FILE *);
587 void debug_symtab (void);
588 void dump_symtab_node (FILE *, symtab_node
);
589 void debug_symtab_node (symtab_node
);
590 void dump_symtab_base (FILE *, symtab_node
);
591 void verify_symtab (void);
592 void verify_symtab_node (symtab_node
);
593 bool verify_symtab_base (symtab_node
);
594 bool symtab_used_from_object_file_p (symtab_node
);
595 void symtab_make_decl_local (tree
);
596 symtab_node
symtab_alias_ultimate_target (symtab_node
,
597 enum availability
*avail
= NULL
);
598 bool symtab_resolve_alias (symtab_node node
, symtab_node target
);
599 void fixup_same_cpp_alias_visibility (symtab_node node
, symtab_node target
);
600 bool symtab_for_node_and_aliases (symtab_node
,
601 bool (*) (symtab_node
, void *),
604 symtab_node
symtab_nonoverwritable_alias (symtab_node
);
605 enum availability
symtab_node_availability (symtab_node
);
608 void dump_cgraph (FILE *);
609 void debug_cgraph (void);
610 void dump_cgraph_node (FILE *, struct cgraph_node
*);
611 void debug_cgraph_node (struct cgraph_node
*);
612 void cgraph_remove_edge (struct cgraph_edge
*);
613 void cgraph_remove_node (struct cgraph_node
*);
614 void cgraph_release_function_body (struct cgraph_node
*);
615 void release_function_body (tree
);
616 void cgraph_node_remove_callees (struct cgraph_node
*node
);
617 struct cgraph_edge
*cgraph_create_edge (struct cgraph_node
*,
618 struct cgraph_node
*,
619 gimple
, gcov_type
, int);
620 struct cgraph_edge
*cgraph_create_indirect_edge (struct cgraph_node
*, gimple
,
621 int, gcov_type
, int);
622 struct cgraph_indirect_call_info
*cgraph_allocate_init_indirect_info (void);
623 struct cgraph_node
* cgraph_create_node (tree
);
624 struct cgraph_node
* cgraph_create_empty_node (void);
625 struct cgraph_node
* cgraph_get_create_node (tree
);
626 struct cgraph_node
* cgraph_get_create_real_symbol_node (tree
);
627 struct cgraph_node
* cgraph_same_body_alias (struct cgraph_node
*, tree
, tree
);
628 struct cgraph_node
* cgraph_add_thunk (struct cgraph_node
*, tree
, tree
, bool, HOST_WIDE_INT
,
629 HOST_WIDE_INT
, tree
, tree
);
630 struct cgraph_node
*cgraph_node_for_asm (tree
);
631 struct cgraph_edge
*cgraph_edge (struct cgraph_node
*, gimple
);
632 void cgraph_set_call_stmt (struct cgraph_edge
*, gimple
);
633 void cgraph_update_edges_for_call_stmt (gimple
, tree
, gimple
);
634 struct cgraph_local_info
*cgraph_local_info (tree
);
635 struct cgraph_global_info
*cgraph_global_info (tree
);
636 struct cgraph_rtl_info
*cgraph_rtl_info (tree
);
637 struct cgraph_node
*cgraph_create_function_alias (tree
, tree
);
638 void cgraph_call_node_duplication_hooks (struct cgraph_node
*,
639 struct cgraph_node
*);
640 void cgraph_call_edge_duplication_hooks (struct cgraph_edge
*,
641 struct cgraph_edge
*);
643 void cgraph_redirect_edge_callee (struct cgraph_edge
*, struct cgraph_node
*);
644 void cgraph_make_edge_direct (struct cgraph_edge
*, struct cgraph_node
*);
645 bool cgraph_only_called_directly_p (struct cgraph_node
*);
647 bool cgraph_function_possibly_inlined_p (tree
);
648 void cgraph_unnest_node (struct cgraph_node
*);
650 enum availability
cgraph_function_body_availability (struct cgraph_node
*);
651 void cgraph_add_new_function (tree
, bool);
652 const char* cgraph_inline_failed_string (cgraph_inline_failed_t
);
654 void cgraph_set_nothrow_flag (struct cgraph_node
*, bool);
655 void cgraph_set_const_flag (struct cgraph_node
*, bool, bool);
656 void cgraph_set_pure_flag (struct cgraph_node
*, bool, bool);
657 bool cgraph_node_cannot_return (struct cgraph_node
*);
658 bool cgraph_edge_cannot_lead_to_return (struct cgraph_edge
*);
659 bool cgraph_will_be_removed_from_program_if_no_direct_calls
660 (struct cgraph_node
*node
);
661 bool cgraph_can_remove_if_no_direct_calls_and_refs_p
662 (struct cgraph_node
*node
);
663 bool cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node
*node
);
664 bool resolution_used_from_other_file_p (enum ld_plugin_symbol_resolution
);
665 bool cgraph_for_node_thunks_and_aliases (struct cgraph_node
*,
666 bool (*) (struct cgraph_node
*, void *),
669 bool cgraph_for_node_and_aliases (struct cgraph_node
*,
670 bool (*) (struct cgraph_node
*, void *),
672 vec
<cgraph_edge_p
> collect_callers_of_node (struct cgraph_node
*node
);
673 void verify_cgraph (void);
674 void verify_cgraph_node (struct cgraph_node
*);
675 void cgraph_mark_address_taken_node (struct cgraph_node
*);
677 typedef void (*cgraph_edge_hook
)(struct cgraph_edge
*, void *);
678 typedef void (*cgraph_node_hook
)(struct cgraph_node
*, void *);
679 typedef void (*cgraph_2edge_hook
)(struct cgraph_edge
*, struct cgraph_edge
*,
681 typedef void (*cgraph_2node_hook
)(struct cgraph_node
*, struct cgraph_node
*,
683 struct cgraph_edge_hook_list
;
684 struct cgraph_node_hook_list
;
685 struct cgraph_2edge_hook_list
;
686 struct cgraph_2node_hook_list
;
687 struct cgraph_edge_hook_list
*cgraph_add_edge_removal_hook (cgraph_edge_hook
, void *);
688 void cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list
*);
689 struct cgraph_node_hook_list
*cgraph_add_node_removal_hook (cgraph_node_hook
,
691 void cgraph_remove_node_removal_hook (struct cgraph_node_hook_list
*);
692 struct cgraph_node_hook_list
*cgraph_add_function_insertion_hook (cgraph_node_hook
,
694 void cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list
*);
695 void cgraph_call_function_insertion_hooks (struct cgraph_node
*node
);
696 struct cgraph_2edge_hook_list
*cgraph_add_edge_duplication_hook (cgraph_2edge_hook
, void *);
697 void cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list
*);
698 struct cgraph_2node_hook_list
*cgraph_add_node_duplication_hook (cgraph_2node_hook
, void *);
699 void cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list
*);
700 gimple
cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge
*);
701 bool cgraph_propagate_frequency (struct cgraph_node
*node
);
702 struct cgraph_node
* cgraph_function_node (struct cgraph_node
*,
703 enum availability
*avail
= NULL
);
705 /* In cgraphunit.c */
706 struct asm_node
*add_asm_node (tree
);
707 extern FILE *cgraph_dump_file
;
708 void cgraph_finalize_function (tree
, bool);
709 void finalize_compilation_unit (void);
711 void init_cgraph (void);
712 bool cgraph_process_new_functions (void);
713 void cgraph_process_same_body_aliases (void);
714 void fixup_same_cpp_alias_visibility (symtab_node
, symtab_node target
, tree
);
715 /* Initialize datastructures so DECL is a function in lowered gimple form.
716 IN_SSA is true if the gimple is in SSA. */
717 basic_block
init_lowered_empty_function (tree
, bool);
718 void cgraph_reset_node (struct cgraph_node
*);
719 void expand_thunk (struct cgraph_node
*);
721 /* In cgraphclones.c */
723 struct cgraph_edge
* cgraph_clone_edge (struct cgraph_edge
*,
724 struct cgraph_node
*, gimple
,
725 unsigned, gcov_type
, int, bool);
726 struct cgraph_node
* cgraph_clone_node (struct cgraph_node
*, tree
, gcov_type
,
727 int, bool, vec
<cgraph_edge_p
>,
728 bool, struct cgraph_node
*);
729 tree
clone_function_name (tree decl
, const char *);
730 struct cgraph_node
* cgraph_create_virtual_clone (struct cgraph_node
*old_node
,
732 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
734 const char *clone_name
);
735 struct cgraph_node
*cgraph_find_replacement_node (struct cgraph_node
*);
736 bool cgraph_remove_node_and_inline_clones (struct cgraph_node
*, struct cgraph_node
*);
737 void cgraph_set_call_stmt_including_clones (struct cgraph_node
*, gimple
, gimple
);
738 void cgraph_create_edge_including_clones (struct cgraph_node
*,
739 struct cgraph_node
*,
740 gimple
, gimple
, gcov_type
, int,
741 cgraph_inline_failed_t
);
742 void cgraph_materialize_all_clones (void);
743 struct cgraph_node
* cgraph_copy_node_for_versioning (struct cgraph_node
*,
744 tree
, vec
<cgraph_edge_p
>, bitmap
);
745 struct cgraph_node
*cgraph_function_versioning (struct cgraph_node
*,
747 vec
<ipa_replace_map_p
, va_gc
> *,
748 bitmap
, bool, bitmap
,
749 basic_block
, const char *);
750 void tree_function_versioning (tree
, tree
, vec
<ipa_replace_map_p
, va_gc
> *,
751 bool, bitmap
, bool, bitmap
, basic_block
);
753 /* In cgraphbuild.c */
754 unsigned int rebuild_cgraph_edges (void);
755 void cgraph_rebuild_references (void);
756 int compute_call_stmt_bb_frequency (tree
, basic_block bb
);
757 void record_references_in_initializer (tree
, bool);
758 void ipa_record_stmt_references (struct cgraph_node
*, gimple
);
761 bool symtab_remove_unreachable_nodes (bool, FILE *);
762 cgraph_node_set
cgraph_node_set_new (void);
763 cgraph_node_set_iterator
cgraph_node_set_find (cgraph_node_set
,
764 struct cgraph_node
*);
765 void cgraph_node_set_add (cgraph_node_set
, struct cgraph_node
*);
766 void cgraph_node_set_remove (cgraph_node_set
, struct cgraph_node
*);
767 void dump_cgraph_node_set (FILE *, cgraph_node_set
);
768 void debug_cgraph_node_set (cgraph_node_set
);
769 void free_cgraph_node_set (cgraph_node_set
);
770 void cgraph_build_static_cdtor (char which
, tree body
, int priority
);
772 varpool_node_set
varpool_node_set_new (void);
773 varpool_node_set_iterator
varpool_node_set_find (varpool_node_set
,
774 struct varpool_node
*);
775 void varpool_node_set_add (varpool_node_set
, struct varpool_node
*);
776 void varpool_node_set_remove (varpool_node_set
, struct varpool_node
*);
777 void dump_varpool_node_set (FILE *, varpool_node_set
);
778 void debug_varpool_node_set (varpool_node_set
);
779 void free_varpool_node_set (varpool_node_set
);
780 void ipa_discover_readonly_nonaddressable_vars (void);
781 bool varpool_externally_visible_p (struct varpool_node
*);
784 bool cgraph_maybe_hot_edge_p (struct cgraph_edge
*e
);
785 bool cgraph_optimize_for_size_p (struct cgraph_node
*);
788 struct varpool_node
*varpool_create_empty_node (void);
789 struct varpool_node
*varpool_node_for_decl (tree
);
790 struct varpool_node
*varpool_node_for_asm (tree asmname
);
791 void varpool_mark_needed_node (struct varpool_node
*);
792 void debug_varpool (void);
793 void dump_varpool (FILE *);
794 void dump_varpool_node (FILE *, struct varpool_node
*);
796 void varpool_finalize_decl (tree
);
797 enum availability
cgraph_variable_initializer_availability (struct varpool_node
*);
798 void cgraph_make_node_local (struct cgraph_node
*);
799 bool cgraph_node_can_be_local_p (struct cgraph_node
*);
802 void varpool_remove_node (struct varpool_node
*node
);
803 void varpool_finalize_named_section_flags (struct varpool_node
*node
);
804 bool varpool_output_variables (void);
805 bool varpool_assemble_decl (struct varpool_node
*node
);
806 void varpool_analyze_node (struct varpool_node
*);
807 struct varpool_node
* varpool_extra_name_alias (tree
, tree
);
808 struct varpool_node
* varpool_create_variable_alias (tree
, tree
);
809 void varpool_reset_queue (void);
810 tree
ctor_for_folding (tree
);
811 bool varpool_for_node_and_aliases (struct varpool_node
*,
812 bool (*) (struct varpool_node
*, void *),
814 void varpool_add_new_variable (tree
);
815 void symtab_initialize_asm_name_hash (void);
816 void symtab_prevail_in_asm_name_hash (symtab_node node
);
817 void varpool_remove_initializer (struct varpool_node
*);
820 /* Return callgraph node for given symbol and check it is a function. */
821 static inline struct cgraph_node
*
822 cgraph (symtab_node node
)
824 gcc_checking_assert (!node
|| node
->symbol
.type
== SYMTAB_FUNCTION
);
825 return (struct cgraph_node
*)node
;
828 /* Return varpool node for given symbol and check it is a variable. */
829 static inline struct varpool_node
*
830 varpool (symtab_node node
)
832 gcc_checking_assert (!node
|| node
->symbol
.type
== SYMTAB_VARIABLE
);
833 return (struct varpool_node
*)node
;
836 /* Return callgraph node for given symbol and check it is a function. */
837 static inline struct cgraph_node
*
838 cgraph_get_node (const_tree decl
)
840 gcc_checking_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
841 return cgraph (symtab_get_node (decl
));
844 /* Return varpool node for given symbol and check it is a function. */
845 static inline struct varpool_node
*
846 varpool_get_node (const_tree decl
)
848 gcc_checking_assert (TREE_CODE (decl
) == VAR_DECL
);
849 return varpool (symtab_get_node (decl
));
852 /* Return asm name of cgraph node. */
853 static inline const char *
854 cgraph_node_asm_name (struct cgraph_node
*node
)
856 return symtab_node_asm_name ((symtab_node
)node
);
859 /* Return asm name of varpool node. */
860 static inline const char *
861 varpool_node_asm_name(struct varpool_node
*node
)
863 return symtab_node_asm_name ((symtab_node
)node
);
866 /* Return name of cgraph node. */
867 static inline const char *
868 cgraph_node_name(struct cgraph_node
*node
)
870 return symtab_node_name ((symtab_node
)node
);
873 /* Return name of varpool node. */
874 static inline const char *
875 varpool_node_name(struct varpool_node
*node
)
877 return symtab_node_name ((symtab_node
)node
);
880 /* Walk all symbols. */
881 #define FOR_EACH_SYMBOL(node) \
882 for ((node) = symtab_nodes; (node); (node) = (node)->symbol.next)
885 /* Return first variable. */
886 static inline struct varpool_node
*
887 varpool_first_variable (void)
890 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
891 if (varpool_node
*vnode
= dyn_cast
<varpool_node
> (node
))
896 /* Return next variable after NODE. */
897 static inline struct varpool_node
*
898 varpool_next_variable (struct varpool_node
*node
)
900 symtab_node node1
= (symtab_node
) node
->symbol
.next
;
901 for (; node1
; node1
= node1
->symbol
.next
)
902 if (varpool_node
*vnode1
= dyn_cast
<varpool_node
> (node1
))
906 /* Walk all variables. */
907 #define FOR_EACH_VARIABLE(node) \
908 for ((node) = varpool_first_variable (); \
910 (node) = varpool_next_variable ((node)))
912 /* Return first reachable static variable with initializer. */
913 static inline struct varpool_node
*
914 varpool_first_static_initializer (void)
917 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
919 varpool_node
*vnode
= dyn_cast
<varpool_node
> (node
);
920 if (vnode
&& DECL_INITIAL (node
->symbol
.decl
))
926 /* Return next reachable static variable with initializer after NODE. */
927 static inline struct varpool_node
*
928 varpool_next_static_initializer (struct varpool_node
*node
)
930 symtab_node node1
= (symtab_node
) node
->symbol
.next
;
931 for (; node1
; node1
= node1
->symbol
.next
)
933 varpool_node
*vnode1
= dyn_cast
<varpool_node
> (node1
);
934 if (vnode1
&& DECL_INITIAL (node1
->symbol
.decl
))
940 /* Walk all static variables with initializer set. */
941 #define FOR_EACH_STATIC_INITIALIZER(node) \
942 for ((node) = varpool_first_static_initializer (); (node); \
943 (node) = varpool_next_static_initializer (node))
945 /* Return first reachable static variable with initializer. */
946 static inline struct varpool_node
*
947 varpool_first_defined_variable (void)
950 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
952 varpool_node
*vnode
= dyn_cast
<varpool_node
> (node
);
953 if (vnode
&& vnode
->symbol
.definition
)
959 /* Return next reachable static variable with initializer after NODE. */
960 static inline struct varpool_node
*
961 varpool_next_defined_variable (struct varpool_node
*node
)
963 symtab_node node1
= (symtab_node
) node
->symbol
.next
;
964 for (; node1
; node1
= node1
->symbol
.next
)
966 varpool_node
*vnode1
= dyn_cast
<varpool_node
> (node1
);
967 if (vnode1
&& vnode1
->symbol
.definition
)
972 /* Walk all variables with definitions in current unit. */
973 #define FOR_EACH_DEFINED_VARIABLE(node) \
974 for ((node) = varpool_first_defined_variable (); (node); \
975 (node) = varpool_next_defined_variable (node))
977 /* Return first function with body defined. */
978 static inline struct cgraph_node
*
979 cgraph_first_defined_function (void)
982 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
984 cgraph_node
*cn
= dyn_cast
<cgraph_node
> (node
);
985 if (cn
&& cn
->symbol
.definition
)
991 /* Return next function with body defined after NODE. */
992 static inline struct cgraph_node
*
993 cgraph_next_defined_function (struct cgraph_node
*node
)
995 symtab_node node1
= (symtab_node
) node
->symbol
.next
;
996 for (; node1
; node1
= node1
->symbol
.next
)
998 cgraph_node
*cn1
= dyn_cast
<cgraph_node
> (node1
);
999 if (cn1
&& cn1
->symbol
.definition
)
1005 /* Walk all functions with body defined. */
1006 #define FOR_EACH_DEFINED_FUNCTION(node) \
1007 for ((node) = cgraph_first_defined_function (); (node); \
1008 (node) = cgraph_next_defined_function ((node)))
1010 /* Return first function. */
1011 static inline struct cgraph_node
*
1012 cgraph_first_function (void)
1015 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
1016 if (cgraph_node
*cn
= dyn_cast
<cgraph_node
> (node
))
1021 /* Return next function. */
1022 static inline struct cgraph_node
*
1023 cgraph_next_function (struct cgraph_node
*node
)
1025 symtab_node node1
= (symtab_node
) node
->symbol
.next
;
1026 for (; node1
; node1
= node1
->symbol
.next
)
1027 if (cgraph_node
*cn1
= dyn_cast
<cgraph_node
> (node1
))
1031 /* Walk all functions. */
1032 #define FOR_EACH_FUNCTION(node) \
1033 for ((node) = cgraph_first_function (); (node); \
1034 (node) = cgraph_next_function ((node)))
1036 /* Return true when NODE is a function with Gimple body defined
1037 in current unit. Functions can also be define externally or they
1038 can be thunks with no Gimple representation.
1040 Note that at WPA stage, the function body may not be present in memory. */
1043 cgraph_function_with_gimple_body_p (struct cgraph_node
*node
)
1045 return node
->symbol
.definition
&& !node
->thunk
.thunk_p
&& !node
->symbol
.alias
;
1048 /* Return first function with body defined. */
1049 static inline struct cgraph_node
*
1050 cgraph_first_function_with_gimple_body (void)
1053 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
1055 cgraph_node
*cn
= dyn_cast
<cgraph_node
> (node
);
1056 if (cn
&& cgraph_function_with_gimple_body_p (cn
))
1062 /* Return next reachable static variable with initializer after NODE. */
1063 static inline struct cgraph_node
*
1064 cgraph_next_function_with_gimple_body (struct cgraph_node
*node
)
1066 symtab_node node1
= node
->symbol
.next
;
1067 for (; node1
; node1
= node1
->symbol
.next
)
1069 cgraph_node
*cn1
= dyn_cast
<cgraph_node
> (node1
);
1070 if (cn1
&& cgraph_function_with_gimple_body_p (cn1
))
1076 /* Walk all functions with body defined. */
1077 #define FOR_EACH_FUNCTION_WITH_GIMPLE_BODY(node) \
1078 for ((node) = cgraph_first_function_with_gimple_body (); (node); \
1079 (node) = cgraph_next_function_with_gimple_body (node))
1081 /* Create a new static variable of type TYPE. */
1082 tree
add_new_static_var (tree type
);
1084 /* Return true if iterator CSI points to nothing. */
1086 csi_end_p (cgraph_node_set_iterator csi
)
1088 return csi
.index
>= csi
.set
->nodes
.length ();
1091 /* Advance iterator CSI. */
1093 csi_next (cgraph_node_set_iterator
*csi
)
1098 /* Return the node pointed to by CSI. */
1099 static inline struct cgraph_node
*
1100 csi_node (cgraph_node_set_iterator csi
)
1102 return csi
.set
->nodes
[csi
.index
];
1105 /* Return an iterator to the first node in SET. */
1106 static inline cgraph_node_set_iterator
1107 csi_start (cgraph_node_set set
)
1109 cgraph_node_set_iterator csi
;
1116 /* Return true if SET contains NODE. */
1118 cgraph_node_in_set_p (struct cgraph_node
*node
, cgraph_node_set set
)
1120 cgraph_node_set_iterator csi
;
1121 csi
= cgraph_node_set_find (set
, node
);
1122 return !csi_end_p (csi
);
1125 /* Return number of nodes in SET. */
1126 static inline size_t
1127 cgraph_node_set_size (cgraph_node_set set
)
1129 return set
->nodes
.length ();
1132 /* Return true if iterator VSI points to nothing. */
1134 vsi_end_p (varpool_node_set_iterator vsi
)
1136 return vsi
.index
>= vsi
.set
->nodes
.length ();
1139 /* Advance iterator VSI. */
1141 vsi_next (varpool_node_set_iterator
*vsi
)
1146 /* Return the node pointed to by VSI. */
1147 static inline struct varpool_node
*
1148 vsi_node (varpool_node_set_iterator vsi
)
1150 return vsi
.set
->nodes
[vsi
.index
];
1153 /* Return an iterator to the first node in SET. */
1154 static inline varpool_node_set_iterator
1155 vsi_start (varpool_node_set set
)
1157 varpool_node_set_iterator vsi
;
1164 /* Return true if SET contains NODE. */
1166 varpool_node_in_set_p (struct varpool_node
*node
, varpool_node_set set
)
1168 varpool_node_set_iterator vsi
;
1169 vsi
= varpool_node_set_find (set
, node
);
1170 return !vsi_end_p (vsi
);
1173 /* Return number of nodes in SET. */
1174 static inline size_t
1175 varpool_node_set_size (varpool_node_set set
)
1177 return set
->nodes
.length ();
1180 /* Uniquize all constants that appear in memory.
1181 Each constant in memory thus far output is recorded
1182 in `const_desc_table'. */
1184 struct GTY(()) constant_descriptor_tree
{
1185 /* A MEM for the constant. */
1188 /* The value of the constant. */
1191 /* Hash of value. Computing the hash from value each time
1192 hashfn is called can't work properly, as that means recursive
1193 use of the hash table during hash table expansion. */
1197 /* Return true if set is nonempty. */
1199 cgraph_node_set_nonempty_p (cgraph_node_set set
)
1201 return !set
->nodes
.is_empty ();
1204 /* Return true if set is nonempty. */
1206 varpool_node_set_nonempty_p (varpool_node_set set
)
1208 return !set
->nodes
.is_empty ();
1211 /* Return true when function NODE is only called directly or it has alias.
1212 i.e. it is not externally visible, address was not taken and
1213 it is not used in any other non-standard way. */
1216 cgraph_only_called_directly_or_aliased_p (struct cgraph_node
*node
)
1218 gcc_assert (!node
->global
.inlined_to
);
1219 return (!node
->symbol
.force_output
&& !node
->symbol
.address_taken
1220 && !node
->symbol
.used_from_other_partition
1221 && !DECL_VIRTUAL_P (node
->symbol
.decl
)
1222 && !DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
)
1223 && !DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
)
1224 && !node
->symbol
.externally_visible
);
1227 /* Return true when function NODE can be removed from callgraph
1228 if all direct calls are eliminated. */
1231 varpool_can_remove_if_no_refs (struct varpool_node
*node
)
1233 if (DECL_EXTERNAL (node
->symbol
.decl
))
1235 return (!node
->symbol
.force_output
&& !node
->symbol
.used_from_other_partition
1236 && ((DECL_COMDAT (node
->symbol
.decl
)
1237 && !node
->symbol
.forced_by_abi
1238 && !symtab_used_from_object_file_p ((symtab_node
) node
))
1239 || !node
->symbol
.externally_visible
1240 || DECL_HAS_VALUE_EXPR_P (node
->symbol
.decl
)));
1243 /* Return true when all references to VNODE must be visible in ipa_ref_list.
1244 i.e. if the variable is not externally visible or not used in some magic
1245 way (asm statement or such).
1246 The magic uses are all summarized in force_output flag. */
1249 varpool_all_refs_explicit_p (struct varpool_node
*vnode
)
1251 return (vnode
->symbol
.definition
1252 && !vnode
->symbol
.externally_visible
1253 && !vnode
->symbol
.used_from_other_partition
1254 && !vnode
->symbol
.force_output
);
1257 /* Constant pool accessor function. */
1258 htab_t
constant_pool_htab (void);
1260 /* FIXME: inappropriate dependency of cgraph on IPA. */
1261 #include "ipa-ref-inline.h"
1263 /* Return node that alias N is aliasing. */
1265 static inline symtab_node
1266 symtab_alias_target (symtab_node n
)
1268 struct ipa_ref
*ref
;
1269 ipa_ref_list_reference_iterate (&n
->symbol
.ref_list
, 0, ref
);
1270 gcc_checking_assert (ref
->use
== IPA_REF_ALIAS
);
1271 return ref
->referred
;
1274 static inline struct cgraph_node
*
1275 cgraph_alias_target (struct cgraph_node
*n
)
1277 return dyn_cast
<cgraph_node
> (symtab_alias_target ((symtab_node
) n
));
1280 static inline struct varpool_node
*
1281 varpool_alias_target (struct varpool_node
*n
)
1283 return dyn_cast
<varpool_node
> (symtab_alias_target ((symtab_node
) n
));
1286 /* Given NODE, walk the alias chain to return the function NODE is alias of.
1287 Do not walk through thunks.
1288 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
1290 static inline struct cgraph_node
*
1291 cgraph_function_or_thunk_node (struct cgraph_node
*node
,
1292 enum availability
*availability
= NULL
)
1294 struct cgraph_node
*n
;
1296 n
= dyn_cast
<cgraph_node
> (symtab_alias_ultimate_target ((symtab_node
)node
,
1298 if (!n
&& availability
)
1299 *availability
= AVAIL_NOT_AVAILABLE
;
1302 /* Given NODE, walk the alias chain to return the function NODE is alias of.
1303 Do not walk through thunks.
1304 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
1306 static inline struct varpool_node
*
1307 varpool_variable_node (struct varpool_node
*node
,
1308 enum availability
*availability
= NULL
)
1310 struct varpool_node
*n
;
1312 n
= dyn_cast
<varpool_node
> (symtab_alias_ultimate_target ((symtab_node
)node
,
1314 if (!n
&& availability
)
1315 *availability
= AVAIL_NOT_AVAILABLE
;
1319 /* Return true when the edge E represents a direct recursion. */
1321 cgraph_edge_recursive_p (struct cgraph_edge
*e
)
1323 struct cgraph_node
*callee
= cgraph_function_or_thunk_node (e
->callee
, NULL
);
1324 if (e
->caller
->global
.inlined_to
)
1325 return e
->caller
->global
.inlined_to
->symbol
.decl
== callee
->symbol
.decl
;
1327 return e
->caller
->symbol
.decl
== callee
->symbol
.decl
;
1330 /* Return true if the TM_CLONE bit is set for a given FNDECL. */
1332 decl_is_tm_clone (const_tree fndecl
)
1334 struct cgraph_node
*n
= cgraph_get_node (fndecl
);
1340 /* Likewise indicate that a node is needed, i.e. reachable via some
1344 cgraph_mark_force_output_node (struct cgraph_node
*node
)
1346 node
->symbol
.force_output
= 1;
1347 gcc_checking_assert (!node
->global
.inlined_to
);
1350 /* Return true when the symbol is real symbol, i.e. it is not inline clone
1351 or abstract function kept for debug info purposes only. */
1354 symtab_real_symbol_p (symtab_node node
)
1356 struct cgraph_node
*cnode
;
1358 if (DECL_ABSTRACT (node
->symbol
.decl
))
1360 if (!is_a
<cgraph_node
> (node
))
1362 cnode
= cgraph (node
);
1363 if (cnode
->global
.inlined_to
)
1367 #endif /* GCC_CGRAPH_H */