1 /* Callgraph handling code.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011,
3 2012 Free Software Foundation, Inc.
4 Contributed by Jan Hubicka
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
25 #include "plugin-api.h"
28 #include "basic-block.h"
32 /* Symbol table consists of functions and variables.
33 TODO: add labels, constant pool and aliases. */
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 symtab_type type
;
48 struct ipa_ref_list ref_list
;
49 /* Circular list of nodes in the same comdat group if non-NULL. */
50 symtab_node same_comdat_group
;
51 /* Ordering of all symtab entries. */
53 enum ld_plugin_symbol_resolution resolution
;
54 /* File stream where this node is being written to. */
55 struct lto_file_decl_data
* lto_file_data
;
57 /* Linked list of symbol table entries starting with symtab_nodes. */
60 /* Linked list of symbols with the same asm name. There may be multiple
61 entries for single symbol name in the case of LTO resolutions,
62 existence of inline clones, or duplicated declaration. The last case
63 is a long standing bug frontends and builtin handling. */
64 symtab_node next_sharing_asm_name
;
65 symtab_node previous_sharing_asm_name
;
69 /* Set when function has address taken.
70 In current implementation it imply needed flag. */
71 unsigned address_taken
: 1;
72 /* Set when variable is used from other LTRANS partition. */
73 unsigned used_from_other_partition
: 1;
74 /* Set when function is available in the other LTRANS partition.
75 During WPA output it is used to mark nodes that are present in
76 multiple partitions. */
77 unsigned in_other_partition
: 1;
78 /* Set when function is visible by other units. */
79 unsigned externally_visible
: 1;
80 /* Needed variables might become dead by optimization. This flag
81 forces the variable to be output even if it appears dead otherwise. */
82 unsigned force_output
: 1;
87 /* Not yet set by cgraph_function_body_availability. */
89 /* Function body/variable initializer is unknown. */
91 /* Function body/variable initializer is known but might be replaced
92 by a different one from other compilation unit and thus needs to
93 be dealt with a care. Like AVAIL_NOT_AVAILABLE it can have
94 arbitrary side effects on escaping variables and functions, while
95 like AVAILABLE it might access static variables. */
97 /* Function body/variable initializer is known and will be used in final
100 /* Function body/variable initializer is known and all it's uses are explicitly
101 visible within current unit (ie it's address is never taken and it is not
102 exported to other units).
103 Currently used only for functions. */
107 /* This is the information that is put into the cgraph local structure
108 to recover a function. */
109 struct lto_file_decl_data
;
111 extern const char * const cgraph_availability_names
[];
112 extern const char * const ld_plugin_symbol_resolution_names
[];
114 /* Information about thunk, used only for same body aliases. */
116 struct GTY(()) cgraph_thunk_info
{
117 /* Information about the thunk. */
118 HOST_WIDE_INT fixed_offset
;
119 HOST_WIDE_INT virtual_value
;
122 bool virtual_offset_p
;
123 /* Set to true when alias node is thunk. */
127 /* Information about the function collected locally.
128 Available after function is analyzed. */
130 struct GTY(()) cgraph_local_info
{
131 /* Set when function function is visible in current compilation unit only
132 and its address is never taken. */
135 /* Set once it has been finalized so we consider it to be output. */
136 unsigned finalized
: 1;
138 /* False when there is something makes versioning impossible. */
139 unsigned versionable
: 1;
141 /* False when function calling convention and signature can not be changed.
142 This is the case when __builtin_apply_args is used. */
143 unsigned can_change_signature
: 1;
145 /* True when the function has been originally extern inline, but it is
147 unsigned redefined_extern_inline
: 1;
149 /* True if the function may enter serial irrevocable mode. */
150 unsigned tm_may_enter_irr
: 1;
153 /* Information about the function that needs to be computed globally
154 once compilation is finished. Available only with -funit-at-a-time. */
156 struct GTY(()) cgraph_global_info
{
157 /* For inline clones this points to the function they will be
159 struct cgraph_node
*inlined_to
;
162 /* Information about the function that is propagated by the RTL backend.
163 Available only for functions that has been already assembled. */
165 struct GTY(()) cgraph_rtl_info
{
166 unsigned int preferred_incoming_stack_boundary
;
169 /* Represent which DECL tree (or reference to such tree)
170 will be replaced by another tree while versioning. */
171 struct GTY(()) ipa_replace_map
173 /* The tree that will be replaced. */
175 /* The new (replacing) tree. */
177 /* Parameter number to replace, when old_tree is NULL. */
179 /* True when a substitution should be done, false otherwise. */
181 /* True when we replace a reference to old_tree. */
184 typedef struct ipa_replace_map
*ipa_replace_map_p
;
185 DEF_VEC_P(ipa_replace_map_p
);
186 DEF_VEC_ALLOC_P(ipa_replace_map_p
,gc
);
188 struct GTY(()) cgraph_clone_info
190 VEC(ipa_replace_map_p
,gc
)* tree_map
;
192 bitmap combined_args_to_skip
;
196 /* The cgraph data structure.
197 Each function decl has assigned cgraph_node listing callees and callers. */
199 struct GTY(()) cgraph_node
{
200 struct symtab_node_base symbol
;
201 struct cgraph_edge
*callees
;
202 struct cgraph_edge
*callers
;
203 /* List of edges representing indirect calls with a yet undetermined
205 struct cgraph_edge
*indirect_calls
;
206 /* For nested functions points to function the node is nested in. */
208 GTY ((nested_ptr (union symtab_node_def
, "(struct cgraph_node *)(%h)", "(symtab_node)%h")))
210 /* Points to first nested function, if any. */
212 GTY ((nested_ptr (union symtab_node_def
, "(struct cgraph_node *)(%h)", "(symtab_node)%h")))
214 /* Pointer to the next function with same origin, if any. */
216 GTY ((nested_ptr (union symtab_node_def
, "(struct cgraph_node *)(%h)", "(symtab_node)%h")))
218 /* Pointer to the next clone. */
219 struct cgraph_node
*next_sibling_clone
;
220 struct cgraph_node
*prev_sibling_clone
;
221 struct cgraph_node
*clones
;
222 struct cgraph_node
*clone_of
;
223 /* For functions with many calls sites it holds map from call expression
224 to the edge to speed up cgraph_edge function. */
225 htab_t
GTY((param_is (struct cgraph_edge
))) call_site_hash
;
226 /* Declaration node used to be clone of. */
227 tree former_clone_of
;
229 /* Interprocedural passes scheduled to have their transform functions
230 applied next time we execute local pass on them. We maintain it
231 per-function in order to allow IPA passes to introduce new functions. */
232 VEC(ipa_opt_pass
,heap
) * GTY((skip
)) ipa_transforms_to_apply
;
234 struct cgraph_local_info local
;
235 struct cgraph_global_info global
;
236 struct cgraph_rtl_info rtl
;
237 struct cgraph_clone_info clone
;
238 struct cgraph_thunk_info thunk
;
240 /* Expected number of executions: calculated in profile.c. */
242 /* How to scale counts at materialization time; used to merge
243 LTO units with different number of profile runs. */
244 int count_materialization_scale
;
245 /* Unique id of the node. */
248 /* Set when decl is an abstract function pointed to by the
249 ABSTRACT_DECL_ORIGIN of a reachable function. */
250 unsigned abstract_and_needed
: 1;
251 /* Set once the function is lowered (i.e. its CFG is built). */
252 unsigned lowered
: 1;
253 /* Set once the function has been instantiated and its callee
255 unsigned analyzed
: 1;
256 /* Set when function is scheduled to be processed by local passes. */
257 unsigned process
: 1;
258 /* Set for aliases once they got through assemble_alias. */
260 /* Set for aliases created as C++ same body aliases. */
261 unsigned same_body_alias
: 1;
262 /* How commonly executed the node is. Initialized during branch
263 probabilities pass. */
264 ENUM_BITFIELD (node_frequency
) frequency
: 2;
265 /* True when function can only be called at startup (from static ctor). */
266 unsigned only_called_at_startup
: 1;
267 /* True when function can only be called at startup (from static dtor). */
268 unsigned only_called_at_exit
: 1;
269 /* True when function is the transactional clone of a function which
270 is called only from inside transactions. */
271 /* ?? We should be able to remove this. We have enough bits in
272 cgraph to calculate it. */
273 unsigned tm_clone
: 1;
276 typedef struct cgraph_node
*cgraph_node_ptr
;
278 DEF_VEC_P(cgraph_node_ptr
);
279 DEF_VEC_ALLOC_P(cgraph_node_ptr
,heap
);
280 DEF_VEC_ALLOC_P(cgraph_node_ptr
,gc
);
282 /* A cgraph node set is a collection of cgraph nodes. A cgraph node
283 can appear in multiple sets. */
284 struct cgraph_node_set_def
286 struct pointer_map_t
*map
;
287 VEC(cgraph_node_ptr
, heap
) *nodes
;
290 typedef struct varpool_node
*varpool_node_ptr
;
292 DEF_VEC_P(varpool_node_ptr
);
293 DEF_VEC_ALLOC_P(varpool_node_ptr
,heap
);
294 DEF_VEC_ALLOC_P(varpool_node_ptr
,gc
);
296 /* A varpool node set is a collection of varpool nodes. A varpool node
297 can appear in multiple sets. */
298 struct varpool_node_set_def
300 struct pointer_map_t
* map
;
301 VEC(varpool_node_ptr
, heap
) *nodes
;
304 typedef struct cgraph_node_set_def
*cgraph_node_set
;
306 DEF_VEC_P(cgraph_node_set
);
307 DEF_VEC_ALLOC_P(cgraph_node_set
,gc
);
308 DEF_VEC_ALLOC_P(cgraph_node_set
,heap
);
310 typedef struct varpool_node_set_def
*varpool_node_set
;
312 DEF_VEC_P(varpool_node_set
);
313 DEF_VEC_ALLOC_P(varpool_node_set
,gc
);
314 DEF_VEC_ALLOC_P(varpool_node_set
,heap
);
316 /* Iterator structure for cgraph node sets. */
321 } cgraph_node_set_iterator
;
323 /* Iterator structure for varpool node sets. */
326 varpool_node_set set
;
328 } varpool_node_set_iterator
;
330 #define DEFCIFCODE(code, string) CIF_ ## code,
331 /* Reasons for inlining failures. */
332 typedef enum cgraph_inline_failed_enum
{
333 #include "cif-code.def"
335 } cgraph_inline_failed_t
;
337 /* Structure containing additional information about an indirect call. */
339 struct GTY(()) cgraph_indirect_call_info
341 /* When polymorphic is set, this field contains offset where the object which
342 was actually used in the polymorphic resides within a larger structure.
343 If agg_contents is set, the field contains the offset within the aggregate
344 from which the address to call was loaded. */
345 HOST_WIDE_INT offset
;
346 /* OBJ_TYPE_REF_TOKEN of a polymorphic call (if polymorphic is set). */
347 HOST_WIDE_INT otr_token
;
348 /* Type of the object from OBJ_TYPE_REF_OBJECT. */
350 /* Index of the parameter that is called. */
352 /* ECF flags determined from the caller. */
355 /* Set when the call is a virtual call with the parameter being the
356 associated object pointer rather than a simple direct call. */
357 unsigned polymorphic
: 1;
358 /* Set when the call is a call of a pointer loaded from contents of an
359 aggregate at offset. */
360 unsigned agg_contents
: 1;
361 /* When the previous bit is set, this one determines whether the destination
362 is loaded from a parameter passed by reference. */
366 struct GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"))) cgraph_edge
{
367 /* Expected number of executions: calculated in profile.c. */
369 struct cgraph_node
*caller
;
370 struct cgraph_node
*callee
;
371 struct cgraph_edge
*prev_caller
;
372 struct cgraph_edge
*next_caller
;
373 struct cgraph_edge
*prev_callee
;
374 struct cgraph_edge
*next_callee
;
376 /* Additional information about an indirect call. Not cleared when an edge
378 struct cgraph_indirect_call_info
*indirect_info
;
379 PTR
GTY ((skip (""))) aux
;
380 /* When equal to CIF_OK, inline this call. Otherwise, points to the
381 explanation why function was not inlined. */
382 cgraph_inline_failed_t inline_failed
;
383 /* The stmt_uid of call_stmt. This is used by LTO to recover the call_stmt
384 when the function is serialized in. */
385 unsigned int lto_stmt_uid
;
386 /* Expected frequency of executions within the function.
387 When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
388 per function call. The range is 0 to CGRAPH_FREQ_MAX. */
390 /* Unique id of the edge. */
392 /* Whether this edge was made direct by indirect inlining. */
393 unsigned int indirect_inlining_edge
: 1;
394 /* Whether this edge describes an indirect call with an undetermined
396 unsigned int indirect_unknown_callee
: 1;
397 /* Whether this edge is still a dangling */
398 /* True if the corresponding CALL stmt cannot be inlined. */
399 unsigned int call_stmt_cannot_inline_p
: 1;
400 /* Can this call throw externally? */
401 unsigned int can_throw_external
: 1;
404 #define CGRAPH_FREQ_BASE 1000
405 #define CGRAPH_FREQ_MAX 100000
407 typedef struct cgraph_edge
*cgraph_edge_p
;
409 DEF_VEC_P(cgraph_edge_p
);
410 DEF_VEC_ALLOC_P(cgraph_edge_p
,heap
);
412 /* The varpool data structure.
413 Each static variable decl has assigned varpool_node. */
415 struct GTY(()) varpool_node
{
416 struct symtab_node_base symbol
;
417 /* For aliases points to declaration DECL is alias of. */
420 /* Set once the variable has been instantiated and its callee
422 unsigned analyzed
: 1;
423 /* Set once it has been finalized so we consider it to be output. */
424 unsigned finalized
: 1;
425 /* Set when variable is scheduled to be assembled. */
427 /* Set for aliases once they got through assemble_alias. Also set for
428 extra name aliases in varpool_extra_name_alias. */
430 unsigned extra_name_alias
: 1;
433 /* Every top level asm statement is put into a asm_node. */
435 struct GTY(()) asm_node
{
437 struct asm_node
*next
;
438 /* String for this asm node. */
440 /* Ordering of all cgraph nodes. */
444 /* Symbol table entry. */
445 union GTY((desc ("%h.symbol.type"), chain_next ("%h.symbol.next"),
446 chain_prev ("%h.symbol.previous"))) symtab_node_def
{
447 struct symtab_node_base
GTY ((tag ("SYMTAB_SYMBOL"))) symbol
;
448 /* Use cgraph (symbol) accessor to get cgraph_node. */
449 struct cgraph_node
GTY ((tag ("SYMTAB_FUNCTION"))) x_function
;
450 /* Use varpool (symbol) accessor to get varpool_node. */
451 struct varpool_node
GTY ((tag ("SYMTAB_VARIABLE"))) x_variable
;
454 extern GTY(()) symtab_node symtab_nodes
;
455 extern GTY(()) int cgraph_n_nodes
;
456 extern GTY(()) int cgraph_max_uid
;
457 extern GTY(()) int cgraph_edge_max_uid
;
458 extern bool cgraph_global_info_ready
;
461 /* Frontend is parsing and finalizing functions. */
462 CGRAPH_STATE_PARSING
,
463 /* Callgraph is being constructed. It is safe to add new functions. */
464 CGRAPH_STATE_CONSTRUCTION
,
465 /* Callgraph is built and IPA passes are being run. */
467 /* Callgraph is built and all functions are transformed to SSA form. */
468 CGRAPH_STATE_IPA_SSA
,
469 /* Functions are now ordered and being passed to RTL expanders. */
470 CGRAPH_STATE_EXPANSION
,
471 /* All cgraph expansion is done. */
472 CGRAPH_STATE_FINISHED
474 extern enum cgraph_state cgraph_state
;
475 extern bool cgraph_function_flags_ready
;
476 extern cgraph_node_set cgraph_new_nodes
;
478 extern GTY(()) struct asm_node
*asm_nodes
;
479 extern GTY(()) int symtab_order
;
480 extern bool same_body_aliases_done
;
483 void symtab_register_node (symtab_node
);
484 void symtab_unregister_node (symtab_node
);
485 void symtab_remove_node (symtab_node
);
486 symtab_node
symtab_get_node (const_tree
);
487 symtab_node
symtab_node_for_asm (const_tree asmname
);
488 const char * symtab_node_asm_name (symtab_node
);
489 const char * symtab_node_name (symtab_node
);
490 void symtab_insert_node_to_hashtable (symtab_node
);
491 void symtab_add_to_same_comdat_group (symtab_node
, symtab_node
);
492 void symtab_dissolve_same_comdat_group_list (symtab_node node
);
493 void dump_symtab (FILE *);
494 void debug_symtab (void);
495 void dump_symtab_node (FILE *, symtab_node
);
496 void debug_symtab_node (symtab_node
);
497 void dump_symtab_base (FILE *, symtab_node
);
498 void verify_symtab (void);
499 void verify_symtab_node (symtab_node
);
500 bool verify_symtab_base (symtab_node
);
501 bool symtab_used_from_object_file_p (symtab_node
);
502 void symtab_make_decl_local (tree
);
505 void dump_cgraph (FILE *);
506 void debug_cgraph (void);
507 void dump_cgraph_node (FILE *, struct cgraph_node
*);
508 void debug_cgraph_node (struct cgraph_node
*);
509 void cgraph_remove_edge (struct cgraph_edge
*);
510 void cgraph_remove_node (struct cgraph_node
*);
511 void cgraph_release_function_body (struct cgraph_node
*);
512 void cgraph_node_remove_callees (struct cgraph_node
*node
);
513 struct cgraph_edge
*cgraph_create_edge (struct cgraph_node
*,
514 struct cgraph_node
*,
515 gimple
, gcov_type
, int);
516 struct cgraph_edge
*cgraph_create_indirect_edge (struct cgraph_node
*, gimple
,
517 int, gcov_type
, int);
518 struct cgraph_indirect_call_info
*cgraph_allocate_init_indirect_info (void);
519 struct cgraph_node
* cgraph_create_node (tree
);
520 struct cgraph_node
* cgraph_create_empty_node (void);
521 struct cgraph_node
* cgraph_get_create_node (tree
);
522 struct cgraph_node
* cgraph_same_body_alias (struct cgraph_node
*, tree
, tree
);
523 struct cgraph_node
* cgraph_add_thunk (struct cgraph_node
*, tree
, tree
, bool, HOST_WIDE_INT
,
524 HOST_WIDE_INT
, tree
, tree
);
525 struct cgraph_node
*cgraph_node_for_asm (tree
);
526 struct cgraph_edge
*cgraph_edge (struct cgraph_node
*, gimple
);
527 void cgraph_set_call_stmt (struct cgraph_edge
*, gimple
);
528 void cgraph_update_edges_for_call_stmt (gimple
, tree
, gimple
);
529 struct cgraph_local_info
*cgraph_local_info (tree
);
530 struct cgraph_global_info
*cgraph_global_info (tree
);
531 struct cgraph_rtl_info
*cgraph_rtl_info (tree
);
532 struct cgraph_node
*cgraph_create_function_alias (tree
, tree
);
533 void cgraph_call_node_duplication_hooks (struct cgraph_node
*,
534 struct cgraph_node
*);
535 void cgraph_call_edge_duplication_hooks (struct cgraph_edge
*,
536 struct cgraph_edge
*);
538 void cgraph_redirect_edge_callee (struct cgraph_edge
*, struct cgraph_node
*);
539 void cgraph_make_edge_direct (struct cgraph_edge
*, struct cgraph_node
*);
540 bool cgraph_only_called_directly_p (struct cgraph_node
*);
542 bool cgraph_function_possibly_inlined_p (tree
);
543 void cgraph_unnest_node (struct cgraph_node
*);
545 enum availability
cgraph_function_body_availability (struct cgraph_node
*);
546 void cgraph_add_new_function (tree
, bool);
547 const char* cgraph_inline_failed_string (cgraph_inline_failed_t
);
549 void cgraph_set_nothrow_flag (struct cgraph_node
*, bool);
550 void cgraph_set_const_flag (struct cgraph_node
*, bool, bool);
551 void cgraph_set_pure_flag (struct cgraph_node
*, bool, bool);
552 bool cgraph_node_cannot_return (struct cgraph_node
*);
553 bool cgraph_edge_cannot_lead_to_return (struct cgraph_edge
*);
554 bool cgraph_will_be_removed_from_program_if_no_direct_calls
555 (struct cgraph_node
*node
);
556 bool cgraph_can_remove_if_no_direct_calls_and_refs_p
557 (struct cgraph_node
*node
);
558 bool cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node
*node
);
559 bool resolution_used_from_other_file_p (enum ld_plugin_symbol_resolution
);
560 bool cgraph_for_node_thunks_and_aliases (struct cgraph_node
*,
561 bool (*) (struct cgraph_node
*, void *),
564 bool cgraph_for_node_and_aliases (struct cgraph_node
*,
565 bool (*) (struct cgraph_node
*, void *),
567 VEC (cgraph_edge_p
, heap
) * collect_callers_of_node (struct cgraph_node
*node
);
568 void verify_cgraph (void);
569 void verify_cgraph_node (struct cgraph_node
*);
570 void cgraph_mark_address_taken_node (struct cgraph_node
*);
572 typedef void (*cgraph_edge_hook
)(struct cgraph_edge
*, void *);
573 typedef void (*cgraph_node_hook
)(struct cgraph_node
*, void *);
574 typedef void (*cgraph_2edge_hook
)(struct cgraph_edge
*, struct cgraph_edge
*,
576 typedef void (*cgraph_2node_hook
)(struct cgraph_node
*, struct cgraph_node
*,
578 struct cgraph_edge_hook_list
;
579 struct cgraph_node_hook_list
;
580 struct cgraph_2edge_hook_list
;
581 struct cgraph_2node_hook_list
;
582 struct cgraph_edge_hook_list
*cgraph_add_edge_removal_hook (cgraph_edge_hook
, void *);
583 void cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list
*);
584 struct cgraph_node_hook_list
*cgraph_add_node_removal_hook (cgraph_node_hook
,
586 void cgraph_remove_node_removal_hook (struct cgraph_node_hook_list
*);
587 struct cgraph_node_hook_list
*cgraph_add_function_insertion_hook (cgraph_node_hook
,
589 void cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list
*);
590 void cgraph_call_function_insertion_hooks (struct cgraph_node
*node
);
591 struct cgraph_2edge_hook_list
*cgraph_add_edge_duplication_hook (cgraph_2edge_hook
, void *);
592 void cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list
*);
593 struct cgraph_2node_hook_list
*cgraph_add_node_duplication_hook (cgraph_2node_hook
, void *);
594 void cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list
*);
595 gimple
cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge
*);
596 bool cgraph_propagate_frequency (struct cgraph_node
*node
);
598 /* In cgraphunit.c */
599 struct asm_node
*add_asm_node (tree
);
600 extern FILE *cgraph_dump_file
;
601 void cgraph_finalize_function (tree
, bool);
602 void finalize_compilation_unit (void);
604 void init_cgraph (void);
605 bool cgraph_process_new_functions (void);
606 void cgraph_process_same_body_aliases (void);
607 void fixup_same_cpp_alias_visibility (symtab_node node
, symtab_node target
, tree alias
);
609 /* In cgraphclones.c */
611 struct cgraph_edge
* cgraph_clone_edge (struct cgraph_edge
*,
612 struct cgraph_node
*, gimple
,
613 unsigned, gcov_type
, int, bool);
614 struct cgraph_node
* cgraph_clone_node (struct cgraph_node
*, tree
, gcov_type
,
615 int, bool, VEC(cgraph_edge_p
,heap
) *,
617 tree
clone_function_name (tree decl
, const char *);
618 struct cgraph_node
* cgraph_create_virtual_clone (struct cgraph_node
*old_node
,
619 VEC(cgraph_edge_p
,heap
)*,
620 VEC(ipa_replace_map_p
,gc
)* tree_map
,
622 const char *clone_name
);
623 struct cgraph_node
*cgraph_find_replacement_node (struct cgraph_node
*);
624 bool cgraph_remove_node_and_inline_clones (struct cgraph_node
*, struct cgraph_node
*);
625 void cgraph_set_call_stmt_including_clones (struct cgraph_node
*, gimple
, gimple
);
626 void cgraph_create_edge_including_clones (struct cgraph_node
*,
627 struct cgraph_node
*,
628 gimple
, gimple
, gcov_type
, int,
629 cgraph_inline_failed_t
);
630 void cgraph_materialize_all_clones (void);
631 struct cgraph_node
* cgraph_copy_node_for_versioning (struct cgraph_node
*,
632 tree
, VEC(cgraph_edge_p
,heap
)*, bitmap
);
633 struct cgraph_node
*cgraph_function_versioning (struct cgraph_node
*,
634 VEC(cgraph_edge_p
,heap
)*,
635 VEC(ipa_replace_map_p
,gc
)*,
636 bitmap
, bool, bitmap
,
637 basic_block
, const char *);
638 void tree_function_versioning (tree
, tree
, VEC (ipa_replace_map_p
,gc
)*,
639 bool, bitmap
, bool, bitmap
, basic_block
);
641 /* In cgraphbuild.c */
642 unsigned int rebuild_cgraph_edges (void);
643 void cgraph_rebuild_references (void);
644 int compute_call_stmt_bb_frequency (tree
, basic_block bb
);
645 void record_references_in_initializer (tree
, bool);
648 bool symtab_remove_unreachable_nodes (bool, FILE *);
649 cgraph_node_set
cgraph_node_set_new (void);
650 cgraph_node_set_iterator
cgraph_node_set_find (cgraph_node_set
,
651 struct cgraph_node
*);
652 void cgraph_node_set_add (cgraph_node_set
, struct cgraph_node
*);
653 void cgraph_node_set_remove (cgraph_node_set
, struct cgraph_node
*);
654 void dump_cgraph_node_set (FILE *, cgraph_node_set
);
655 void debug_cgraph_node_set (cgraph_node_set
);
656 void free_cgraph_node_set (cgraph_node_set
);
657 void cgraph_build_static_cdtor (char which
, tree body
, int priority
);
659 varpool_node_set
varpool_node_set_new (void);
660 varpool_node_set_iterator
varpool_node_set_find (varpool_node_set
,
661 struct varpool_node
*);
662 void varpool_node_set_add (varpool_node_set
, struct varpool_node
*);
663 void varpool_node_set_remove (varpool_node_set
, struct varpool_node
*);
664 void dump_varpool_node_set (FILE *, varpool_node_set
);
665 void debug_varpool_node_set (varpool_node_set
);
666 void free_varpool_node_set (varpool_node_set
);
667 void ipa_discover_readonly_nonaddressable_vars (void);
668 bool cgraph_comdat_can_be_unshared_p (struct cgraph_node
*);
669 bool varpool_externally_visible_p (struct varpool_node
*, bool);
672 bool cgraph_maybe_hot_edge_p (struct cgraph_edge
*e
);
673 bool cgraph_optimize_for_size_p (struct cgraph_node
*);
676 struct varpool_node
*varpool_node (tree
);
677 struct varpool_node
*varpool_node_for_asm (tree asmname
);
678 void varpool_mark_needed_node (struct varpool_node
*);
679 void debug_varpool (void);
680 void dump_varpool (FILE *);
681 void dump_varpool_node (FILE *, struct varpool_node
*);
683 void varpool_finalize_decl (tree
);
684 bool decide_is_variable_needed (struct varpool_node
*, tree
);
685 enum availability
cgraph_variable_initializer_availability (struct varpool_node
*);
686 void cgraph_make_node_local (struct cgraph_node
*);
687 bool cgraph_node_can_be_local_p (struct cgraph_node
*);
690 void varpool_remove_node (struct varpool_node
*node
);
691 void varpool_finalize_named_section_flags (struct varpool_node
*node
);
692 bool varpool_output_variables (void);
693 bool varpool_assemble_decl (struct varpool_node
*node
);
694 void varpool_analyze_node (struct varpool_node
*);
695 struct varpool_node
* varpool_extra_name_alias (tree
, tree
);
696 struct varpool_node
* varpool_create_variable_alias (tree
, tree
);
697 void varpool_reset_queue (void);
698 bool const_value_known_p (tree
);
699 bool varpool_for_node_and_aliases (struct varpool_node
*,
700 bool (*) (struct varpool_node
*, void *),
702 void varpool_add_new_variable (tree
);
704 /* Return true when NODE is function. */
706 symtab_function_p (symtab_node node
)
708 return node
->symbol
.type
== SYMTAB_FUNCTION
;
711 /* Return true when NODE is variable. */
713 symtab_variable_p (symtab_node node
)
715 return node
->symbol
.type
== SYMTAB_VARIABLE
;
718 /* Return callgraph node for given symbol and check it is a function. */
719 static inline struct cgraph_node
*
720 cgraph (symtab_node node
)
722 gcc_checking_assert (!node
|| node
->symbol
.type
== SYMTAB_FUNCTION
);
723 return (struct cgraph_node
*)node
;
726 /* Return varpool node for given symbol and check it is a variable. */
727 static inline struct varpool_node
*
728 varpool (symtab_node node
)
730 gcc_checking_assert (!node
|| node
->symbol
.type
== SYMTAB_VARIABLE
);
731 return (struct varpool_node
*)node
;
734 /* Return callgraph node for given symbol and check it is a function. */
735 static inline struct cgraph_node
*
736 cgraph_get_node (const_tree decl
)
738 gcc_checking_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
739 return cgraph (symtab_get_node (decl
));
742 /* Return varpool node for given symbol and check it is a function. */
743 static inline struct varpool_node
*
744 varpool_get_node (const_tree decl
)
746 gcc_checking_assert (TREE_CODE (decl
) == VAR_DECL
);
747 return varpool (symtab_get_node (decl
));
750 /* Return asm name of cgraph node. */
751 static inline const char *
752 cgraph_node_asm_name(struct cgraph_node
*node
)
754 return symtab_node_asm_name ((symtab_node
)node
);
757 /* Return asm name of varpool node. */
758 static inline const char *
759 varpool_node_asm_name(struct varpool_node
*node
)
761 return symtab_node_asm_name ((symtab_node
)node
);
764 /* Return name of cgraph node. */
765 static inline const char *
766 cgraph_node_name(struct cgraph_node
*node
)
768 return symtab_node_name ((symtab_node
)node
);
771 /* Return name of varpool node. */
772 static inline const char *
773 varpool_node_name(struct varpool_node
*node
)
775 return symtab_node_name ((symtab_node
)node
);
778 /* Walk all symbols. */
779 #define FOR_EACH_SYMBOL(node) \
780 for ((node) = symtab_nodes; (node); (node) = (node)->symbol.next)
783 /* Return first variable. */
784 static inline struct varpool_node
*
785 varpool_first_variable (void)
788 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
790 if (symtab_variable_p (node
))
791 return varpool (node
);
796 /* Return next variable after NODE. */
797 static inline struct varpool_node
*
798 varpool_next_variable (struct varpool_node
*node
)
800 symtab_node node1
= (symtab_node
) node
->symbol
.next
;
801 for (; node1
; node1
= node1
->symbol
.next
)
803 if (symtab_variable_p (node1
))
804 return varpool (node1
);
808 /* Walk all variables. */
809 #define FOR_EACH_VARIABLE(node) \
810 for ((node) = varpool_first_variable (); \
812 (node) = varpool_next_variable ((node)))
814 /* Return first reachable static variable with initializer. */
815 static inline struct varpool_node
*
816 varpool_first_static_initializer (void)
819 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
821 if (symtab_variable_p (node
)
822 && DECL_INITIAL (node
->symbol
.decl
))
823 return varpool (node
);
828 /* Return next reachable static variable with initializer after NODE. */
829 static inline struct varpool_node
*
830 varpool_next_static_initializer (struct varpool_node
*node
)
832 symtab_node node1
= (symtab_node
) node
->symbol
.next
;
833 for (; node1
; node1
= node1
->symbol
.next
)
835 if (symtab_variable_p (node1
)
836 && DECL_INITIAL (node1
->symbol
.decl
))
837 return varpool (node1
);
842 /* Walk all static variables with initializer set. */
843 #define FOR_EACH_STATIC_INITIALIZER(node) \
844 for ((node) = varpool_first_static_initializer (); (node); \
845 (node) = varpool_next_static_initializer (node))
847 /* Return first reachable static variable with initializer. */
848 static inline struct varpool_node
*
849 varpool_first_defined_variable (void)
852 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
854 if (symtab_variable_p (node
) && varpool (node
)->analyzed
)
855 return varpool (node
);
860 /* Return next reachable static variable with initializer after NODE. */
861 static inline struct varpool_node
*
862 varpool_next_defined_variable (struct varpool_node
*node
)
864 symtab_node node1
= (symtab_node
) node
->symbol
.next
;
865 for (; node1
; node1
= node1
->symbol
.next
)
867 if (symtab_variable_p (node1
) && varpool (node1
)->analyzed
)
868 return varpool (node1
);
872 /* Walk all variables with definitions in current unit. */
873 #define FOR_EACH_DEFINED_VARIABLE(node) \
874 for ((node) = varpool_first_defined_variable (); (node); \
875 (node) = varpool_next_defined_variable (node))
877 /* Return first function with body defined. */
878 static inline struct cgraph_node
*
879 cgraph_first_defined_function (void)
882 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
884 if (symtab_function_p (node
) && cgraph (node
)->analyzed
)
885 return cgraph (node
);
890 /* Return next function with body defined after NODE. */
891 static inline struct cgraph_node
*
892 cgraph_next_defined_function (struct cgraph_node
*node
)
894 symtab_node node1
= (symtab_node
) node
->symbol
.next
;
895 for (; node1
; node1
= node1
->symbol
.next
)
897 if (symtab_function_p (node1
) && cgraph (node1
)->analyzed
)
898 return cgraph (node1
);
903 /* Walk all functions with body defined. */
904 #define FOR_EACH_DEFINED_FUNCTION(node) \
905 for ((node) = cgraph_first_defined_function (); (node); \
906 (node) = cgraph_next_defined_function ((node)))
908 /* Return first function. */
909 static inline struct cgraph_node
*
910 cgraph_first_function (void)
913 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
915 if (symtab_function_p (node
))
916 return cgraph (node
);
921 /* Return next function. */
922 static inline struct cgraph_node
*
923 cgraph_next_function (struct cgraph_node
*node
)
925 symtab_node node1
= (symtab_node
) node
->symbol
.next
;
926 for (; node1
; node1
= node1
->symbol
.next
)
928 if (symtab_function_p (node1
))
929 return cgraph (node1
);
933 /* Walk all functions. */
934 #define FOR_EACH_FUNCTION(node) \
935 for ((node) = cgraph_first_function (); (node); \
936 (node) = cgraph_next_function ((node)))
938 /* Return true when NODE is a function with Gimple body defined
939 in current unit. Functions can also be define externally or they
940 can be thunks with no Gimple representation.
942 Note that at WPA stage, the function body may not be present in memory. */
945 cgraph_function_with_gimple_body_p (struct cgraph_node
*node
)
947 return node
->analyzed
&& !node
->thunk
.thunk_p
&& !node
->alias
;
950 /* Return first function with body defined. */
951 static inline struct cgraph_node
*
952 cgraph_first_function_with_gimple_body (void)
955 for (node
= symtab_nodes
; node
; node
= node
->symbol
.next
)
957 if (symtab_function_p (node
)
958 && cgraph_function_with_gimple_body_p (cgraph (node
)))
959 return cgraph (node
);
964 /* Return next reachable static variable with initializer after NODE. */
965 static inline struct cgraph_node
*
966 cgraph_next_function_with_gimple_body (struct cgraph_node
*node
)
968 symtab_node node1
= node
->symbol
.next
;
969 for (; node1
; node1
= node1
->symbol
.next
)
971 if (symtab_function_p (node1
)
972 && cgraph_function_with_gimple_body_p (cgraph (node1
)))
973 return cgraph (node1
);
978 /* Walk all functions with body defined. */
979 #define FOR_EACH_FUNCTION_WITH_GIMPLE_BODY(node) \
980 for ((node) = cgraph_first_function_with_gimple_body (); (node); \
981 (node) = cgraph_next_function_with_gimple_body (node))
983 /* Create a new static variable of type TYPE. */
984 tree
add_new_static_var (tree type
);
986 /* Return true if iterator CSI points to nothing. */
988 csi_end_p (cgraph_node_set_iterator csi
)
990 return csi
.index
>= VEC_length (cgraph_node_ptr
, csi
.set
->nodes
);
993 /* Advance iterator CSI. */
995 csi_next (cgraph_node_set_iterator
*csi
)
1000 /* Return the node pointed to by CSI. */
1001 static inline struct cgraph_node
*
1002 csi_node (cgraph_node_set_iterator csi
)
1004 return VEC_index (cgraph_node_ptr
, csi
.set
->nodes
, csi
.index
);
1007 /* Return an iterator to the first node in SET. */
1008 static inline cgraph_node_set_iterator
1009 csi_start (cgraph_node_set set
)
1011 cgraph_node_set_iterator csi
;
1018 /* Return true if SET contains NODE. */
1020 cgraph_node_in_set_p (struct cgraph_node
*node
, cgraph_node_set set
)
1022 cgraph_node_set_iterator csi
;
1023 csi
= cgraph_node_set_find (set
, node
);
1024 return !csi_end_p (csi
);
1027 /* Return number of nodes in SET. */
1028 static inline size_t
1029 cgraph_node_set_size (cgraph_node_set set
)
1031 return VEC_length (cgraph_node_ptr
, set
->nodes
);
1034 /* Return true if iterator VSI points to nothing. */
1036 vsi_end_p (varpool_node_set_iterator vsi
)
1038 return vsi
.index
>= VEC_length (varpool_node_ptr
, vsi
.set
->nodes
);
1041 /* Advance iterator VSI. */
1043 vsi_next (varpool_node_set_iterator
*vsi
)
1048 /* Return the node pointed to by VSI. */
1049 static inline struct varpool_node
*
1050 vsi_node (varpool_node_set_iterator vsi
)
1052 return VEC_index (varpool_node_ptr
, vsi
.set
->nodes
, vsi
.index
);
1055 /* Return an iterator to the first node in SET. */
1056 static inline varpool_node_set_iterator
1057 vsi_start (varpool_node_set set
)
1059 varpool_node_set_iterator vsi
;
1066 /* Return true if SET contains NODE. */
1068 varpool_node_in_set_p (struct varpool_node
*node
, varpool_node_set set
)
1070 varpool_node_set_iterator vsi
;
1071 vsi
= varpool_node_set_find (set
, node
);
1072 return !vsi_end_p (vsi
);
1075 /* Return number of nodes in SET. */
1076 static inline size_t
1077 varpool_node_set_size (varpool_node_set set
)
1079 return VEC_length (varpool_node_ptr
, set
->nodes
);
1082 /* Uniquize all constants that appear in memory.
1083 Each constant in memory thus far output is recorded
1084 in `const_desc_table'. */
1086 struct GTY(()) constant_descriptor_tree
{
1087 /* A MEM for the constant. */
1090 /* The value of the constant. */
1093 /* Hash of value. Computing the hash from value each time
1094 hashfn is called can't work properly, as that means recursive
1095 use of the hash table during hash table expansion. */
1099 /* Return true if set is nonempty. */
1101 cgraph_node_set_nonempty_p (cgraph_node_set set
)
1103 return !VEC_empty (cgraph_node_ptr
, set
->nodes
);
1106 /* Return true if set is nonempty. */
1108 varpool_node_set_nonempty_p (varpool_node_set set
)
1110 return !VEC_empty (varpool_node_ptr
, set
->nodes
);
1113 /* Return true when function NODE is only called directly or it has alias.
1114 i.e. it is not externally visible, address was not taken and
1115 it is not used in any other non-standard way. */
1118 cgraph_only_called_directly_or_aliased_p (struct cgraph_node
*node
)
1120 gcc_assert (!node
->global
.inlined_to
);
1121 return (!node
->symbol
.force_output
&& !node
->symbol
.address_taken
1122 && !node
->symbol
.used_from_other_partition
1123 && !DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
)
1124 && !DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
)
1125 && !node
->symbol
.externally_visible
);
1128 /* Return true when function NODE can be removed from callgraph
1129 if all direct calls are eliminated. */
1132 varpool_can_remove_if_no_refs (struct varpool_node
*node
)
1134 if (DECL_EXTERNAL (node
->symbol
.decl
))
1136 return (!node
->symbol
.force_output
&& !node
->symbol
.used_from_other_partition
1137 && ((DECL_COMDAT (node
->symbol
.decl
)
1138 && !symtab_used_from_object_file_p ((symtab_node
) node
))
1139 || !node
->symbol
.externally_visible
1140 || DECL_HAS_VALUE_EXPR_P (node
->symbol
.decl
)));
1143 /* Return true when all references to VNODE must be visible in ipa_ref_list.
1144 i.e. if the variable is not externally visible or not used in some magic
1145 way (asm statement or such).
1146 The magic uses are all summarized in force_output flag. */
1149 varpool_all_refs_explicit_p (struct varpool_node
*vnode
)
1151 return (vnode
->analyzed
1152 && !vnode
->symbol
.externally_visible
1153 && !vnode
->symbol
.used_from_other_partition
1154 && !vnode
->symbol
.force_output
);
1157 /* Constant pool accessor function. */
1158 htab_t
constant_pool_htab (void);
1160 /* FIXME: inappropriate dependency of cgraph on IPA. */
1161 #include "ipa-ref-inline.h"
1163 /* Return node that alias N is aliasing. */
1165 static inline struct cgraph_node
*
1166 cgraph_alias_aliased_node (struct cgraph_node
*n
)
1168 struct ipa_ref
*ref
;
1170 ipa_ref_list_reference_iterate (&n
->symbol
.ref_list
, 0, ref
);
1171 gcc_checking_assert (ref
->use
== IPA_REF_ALIAS
);
1172 if (symtab_function_p (ref
->referred
))
1173 return ipa_ref_node (ref
);
1177 /* Return node that alias N is aliasing. */
1179 static inline struct varpool_node
*
1180 varpool_alias_aliased_node (struct varpool_node
*n
)
1182 struct ipa_ref
*ref
;
1184 ipa_ref_list_reference_iterate (&n
->symbol
.ref_list
, 0, ref
);
1185 gcc_checking_assert (ref
->use
== IPA_REF_ALIAS
);
1186 if (symtab_variable_p (ref
->referred
))
1187 return ipa_ref_varpool_node (ref
);
1191 /* Given NODE, walk the alias chain to return the function NODE is alias of.
1192 Walk through thunk, too.
1193 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
1195 static inline struct cgraph_node
*
1196 cgraph_function_node (struct cgraph_node
*node
, enum availability
*availability
)
1199 *availability
= cgraph_function_body_availability (node
);
1202 if (node
->alias
&& node
->analyzed
)
1203 node
= cgraph_alias_aliased_node (node
);
1204 else if (node
->thunk
.thunk_p
)
1205 node
= node
->callees
->callee
;
1208 if (node
&& availability
)
1210 enum availability a
;
1211 a
= cgraph_function_body_availability (node
);
1212 if (a
< *availability
)
1217 *availability
= AVAIL_NOT_AVAILABLE
;
1221 /* Given NODE, walk the alias chain to return the function NODE is alias of.
1222 Do not walk through thunks.
1223 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
1225 static inline struct cgraph_node
*
1226 cgraph_function_or_thunk_node (struct cgraph_node
*node
, enum availability
*availability
)
1229 *availability
= cgraph_function_body_availability (node
);
1232 if (node
->alias
&& node
->analyzed
)
1233 node
= cgraph_alias_aliased_node (node
);
1236 if (node
&& availability
)
1238 enum availability a
;
1239 a
= cgraph_function_body_availability (node
);
1240 if (a
< *availability
)
1245 *availability
= AVAIL_NOT_AVAILABLE
;
1249 /* Given NODE, walk the alias chain to return the function NODE is alias of.
1250 Do not walk through thunks.
1251 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
1253 static inline struct varpool_node
*
1254 varpool_variable_node (struct varpool_node
*node
, enum availability
*availability
)
1257 *availability
= cgraph_variable_initializer_availability (node
);
1260 if (node
->alias
&& node
->analyzed
)
1261 node
= varpool_alias_aliased_node (node
);
1264 if (node
&& availability
)
1266 enum availability a
;
1267 a
= cgraph_variable_initializer_availability (node
);
1268 if (a
< *availability
)
1273 *availability
= AVAIL_NOT_AVAILABLE
;
1277 /* Return true when the edge E represents a direct recursion. */
1279 cgraph_edge_recursive_p (struct cgraph_edge
*e
)
1281 struct cgraph_node
*callee
= cgraph_function_or_thunk_node (e
->callee
, NULL
);
1282 if (e
->caller
->global
.inlined_to
)
1283 return e
->caller
->global
.inlined_to
->symbol
.decl
== callee
->symbol
.decl
;
1285 return e
->caller
->symbol
.decl
== callee
->symbol
.decl
;
1288 /* Return true if the TM_CLONE bit is set for a given FNDECL. */
1290 decl_is_tm_clone (const_tree fndecl
)
1292 struct cgraph_node
*n
= cgraph_get_node (fndecl
);
1298 /* Likewise indicate that a node is needed, i.e. reachable via some
1302 cgraph_mark_force_output_node (struct cgraph_node
*node
)
1304 node
->symbol
.force_output
= 1;
1305 gcc_checking_assert (!node
->global
.inlined_to
);
1308 #endif /* GCC_CGRAPH_H */