1 /* Callgraph handling code.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
3 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"
30 #include "ipa-ref.h" /* FIXME: inappropriate dependency of cgraph on IPA. */
34 /* Not yet set by cgraph_function_body_availability. */
36 /* Function body/variable initializer is unknown. */
38 /* Function body/variable initializer is known but might be replaced
39 by a different one from other compilation unit and thus needs to
40 be dealt with a care. Like AVAIL_NOT_AVAILABLE it can have
41 arbitrary side effects on escaping variables and functions, while
42 like AVAILABLE it might access static variables. */
44 /* Function body/variable initializer is known and will be used in final
47 /* Function body/variable initializer is known and all it's uses are explicitly
48 visible within current unit (ie it's address is never taken and it is not
49 exported to other units).
50 Currently used only for functions. */
54 /* This is the information that is put into the cgraph local structure
55 to recover a function. */
56 struct lto_file_decl_data;
58 extern const char * const cgraph_availability_names[];
59 extern const char * const ld_plugin_symbol_resolution_names[];
61 /* Information about thunk, used only for same body aliases. */
63 struct GTY(()) cgraph_thunk_info {
64 /* Information about the thunk. */
65 HOST_WIDE_INT fixed_offset;
66 HOST_WIDE_INT virtual_value;
69 bool virtual_offset_p;
70 /* Set to true when alias node is thunk. */
74 /* Information about the function collected locally.
75 Available after function is analyzed. */
77 struct GTY(()) cgraph_local_info {
78 /* File stream where this node is being written to. */
79 struct lto_file_decl_data * lto_file_data;
81 /* Set when function function is visible in current compilation unit only
82 and its address is never taken. */
85 /* Set when function is visible by other units. */
86 unsigned externally_visible : 1;
88 /* Set once it has been finalized so we consider it to be output. */
89 unsigned finalized : 1;
91 /* False when function calling convention and signature can not be changed.
92 This is the case when __builtin_apply_args is used. */
93 unsigned can_change_signature : 1;
95 /* True when the function has been originally extern inline, but it is
97 unsigned redefined_extern_inline : 1;
100 /* Information about the function that needs to be computed globally
101 once compilation is finished. Available only with -funit-at-a-time. */
103 struct GTY(()) cgraph_global_info {
104 /* For inline clones this points to the function they will be
106 struct cgraph_node *inlined_to;
109 /* Information about the function that is propagated by the RTL backend.
110 Available only for functions that has been already assembled. */
112 struct GTY(()) cgraph_rtl_info {
113 unsigned int preferred_incoming_stack_boundary;
116 /* Represent which DECL tree (or reference to such tree)
117 will be replaced by another tree while versioning. */
118 struct GTY(()) ipa_replace_map
120 /* The tree that will be replaced. */
122 /* The new (replacing) tree. */
124 /* Parameter number to replace, when old_tree is NULL. */
126 /* True when a substitution should be done, false otherwise. */
128 /* True when we replace a reference to old_tree. */
131 typedef struct ipa_replace_map *ipa_replace_map_p;
132 DEF_VEC_P(ipa_replace_map_p);
133 DEF_VEC_ALLOC_P(ipa_replace_map_p,gc);
135 struct GTY(()) cgraph_clone_info
137 VEC(ipa_replace_map_p,gc)* tree_map;
139 bitmap combined_args_to_skip;
143 /* The cgraph data structure.
144 Each function decl has assigned cgraph_node listing callees and callers. */
146 struct GTY((chain_next ("%h.next"), chain_prev ("%h.previous"))) cgraph_node {
148 struct cgraph_edge *callees;
149 struct cgraph_edge *callers;
150 struct cgraph_node *next;
151 struct cgraph_node *previous;
152 /* List of edges representing indirect calls with a yet undetermined
154 struct cgraph_edge *indirect_calls;
155 /* For nested functions points to function the node is nested in. */
156 struct cgraph_node *origin;
157 /* Points to first nested function, if any. */
158 struct cgraph_node *nested;
159 /* Pointer to the next function with same origin, if any. */
160 struct cgraph_node *next_nested;
161 /* Pointer to the next function in cgraph_nodes_queue. */
162 struct cgraph_node *next_needed;
163 /* Pointer to the next clone. */
164 struct cgraph_node *next_sibling_clone;
165 struct cgraph_node *prev_sibling_clone;
166 struct cgraph_node *clones;
167 struct cgraph_node *clone_of;
168 /* Circular list of nodes in the same comdat group if non-NULL. */
169 struct cgraph_node *same_comdat_group;
170 /* For functions with many calls sites it holds map from call expression
171 to the edge to speed up cgraph_edge function. */
172 htab_t GTY((param_is (struct cgraph_edge))) call_site_hash;
173 /* Declaration node used to be clone of. */
174 tree former_clone_of;
176 PTR GTY ((skip)) aux;
178 /* Interprocedural passes scheduled to have their transform functions
179 applied next time we execute local pass on them. We maintain it
180 per-function in order to allow IPA passes to introduce new functions. */
181 VEC(ipa_opt_pass,heap) * GTY((skip)) ipa_transforms_to_apply;
183 struct ipa_ref_list ref_list;
184 struct cgraph_local_info local;
185 struct cgraph_global_info global;
186 struct cgraph_rtl_info rtl;
187 struct cgraph_clone_info clone;
188 struct cgraph_thunk_info thunk;
190 /* Expected number of executions: calculated in profile.c. */
192 /* How to scale counts at materialization time; used to merge
193 LTO units with different number of profile runs. */
194 int count_materialization_scale;
195 /* Unique id of the node. */
197 /* Ordering of all cgraph nodes. */
200 enum ld_plugin_symbol_resolution resolution;
202 /* Set when function must be output for some reason. The primary
203 use of this flag is to mark functions needed to be output for
204 non-standard reason. Functions that are externally visible
205 or reachable from functions needed to be output are marked
206 by specialized flags. */
208 /* Set when function has address taken.
209 In current implementation it imply needed flag. */
210 unsigned address_taken : 1;
211 /* Set when decl is an abstract function pointed to by the
212 ABSTRACT_DECL_ORIGIN of a reachable function. */
213 unsigned abstract_and_needed : 1;
214 /* Set when function is reachable by call from other function
215 that is either reachable or needed.
216 This flag is computed at original cgraph construction and then
217 updated in cgraph_remove_unreachable_nodes. Note that after
218 cgraph_remove_unreachable_nodes cgraph still can contain unreachable
219 nodes when they are needed for virtual clone instantiation. */
220 unsigned reachable : 1;
221 /* Set when function is reachable by call from other LTRANS partition. */
222 unsigned reachable_from_other_partition : 1;
223 /* Set once the function is lowered (i.e. its CFG is built). */
224 unsigned lowered : 1;
225 /* Set once the function has been instantiated and its callee
227 unsigned analyzed : 1;
228 /* Set when function is available in the other LTRANS partition.
229 During WPA output it is used to mark nodes that are present in
230 multiple partitions. */
231 unsigned in_other_partition : 1;
232 /* Set when function is scheduled to be processed by local passes. */
233 unsigned process : 1;
234 /* Set for aliases once they got through assemble_alias. */
236 /* Set for aliases created as C++ same body aliases. */
237 unsigned same_body_alias : 1;
238 /* How commonly executed the node is. Initialized during branch
239 probabilities pass. */
240 ENUM_BITFIELD (node_frequency) frequency : 2;
241 /* True when function can only be called at startup (from static ctor). */
242 unsigned only_called_at_startup : 1;
243 /* True when function can only be called at startup (from static dtor). */
244 unsigned only_called_at_exit : 1;
247 typedef struct cgraph_node *cgraph_node_ptr;
249 DEF_VEC_P(cgraph_node_ptr);
250 DEF_VEC_ALLOC_P(cgraph_node_ptr,heap);
251 DEF_VEC_ALLOC_P(cgraph_node_ptr,gc);
253 /* A cgraph node set is a collection of cgraph nodes. A cgraph node
254 can appear in multiple sets. */
255 struct cgraph_node_set_def
257 struct pointer_map_t *map;
258 VEC(cgraph_node_ptr, heap) *nodes;
261 typedef struct varpool_node *varpool_node_ptr;
263 DEF_VEC_P(varpool_node_ptr);
264 DEF_VEC_ALLOC_P(varpool_node_ptr,heap);
265 DEF_VEC_ALLOC_P(varpool_node_ptr,gc);
267 /* A varpool node set is a collection of varpool nodes. A varpool node
268 can appear in multiple sets. */
269 struct varpool_node_set_def
271 struct pointer_map_t * map;
272 VEC(varpool_node_ptr, heap) *nodes;
275 typedef struct cgraph_node_set_def *cgraph_node_set;
277 DEF_VEC_P(cgraph_node_set);
278 DEF_VEC_ALLOC_P(cgraph_node_set,gc);
279 DEF_VEC_ALLOC_P(cgraph_node_set,heap);
281 typedef struct varpool_node_set_def *varpool_node_set;
283 DEF_VEC_P(varpool_node_set);
284 DEF_VEC_ALLOC_P(varpool_node_set,gc);
285 DEF_VEC_ALLOC_P(varpool_node_set,heap);
287 /* Iterator structure for cgraph node sets. */
292 } cgraph_node_set_iterator;
294 /* Iterator structure for varpool node sets. */
297 varpool_node_set set;
299 } varpool_node_set_iterator;
301 #define DEFCIFCODE(code, string) CIF_ ## code,
302 /* Reasons for inlining failures. */
303 typedef enum cgraph_inline_failed_enum {
304 #include "cif-code.def"
306 } cgraph_inline_failed_t;
308 /* Structure containing additional information about an indirect call. */
310 struct GTY(()) cgraph_indirect_call_info
312 /* Offset accumulated from ancestor jump functions of inlined call graph
314 HOST_WIDE_INT anc_offset;
315 /* OBJ_TYPE_REF_TOKEN of a polymorphic call (if polymorphic is set). */
316 HOST_WIDE_INT otr_token;
317 /* Delta by which must be added to this parameter to compensate for a skipped
318 this adjusting thunk. */
319 HOST_WIDE_INT thunk_delta;
320 /* Type of the object from OBJ_TYPE_REF_OBJECT. */
322 /* Index of the parameter that is called. */
324 /* ECF flags determined from the caller. */
327 /* Set when the call is a virtual call with the parameter being the
328 associated object pointer rather than a simple direct call. */
329 unsigned polymorphic : 1;
332 struct GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"))) cgraph_edge {
333 /* Expected number of executions: calculated in profile.c. */
335 struct cgraph_node *caller;
336 struct cgraph_node *callee;
337 struct cgraph_edge *prev_caller;
338 struct cgraph_edge *next_caller;
339 struct cgraph_edge *prev_callee;
340 struct cgraph_edge *next_callee;
342 /* Additional information about an indirect call. Not cleared when an edge
344 struct cgraph_indirect_call_info *indirect_info;
345 PTR GTY ((skip (""))) aux;
346 /* When equal to CIF_OK, inline this call. Otherwise, points to the
347 explanation why function was not inlined. */
348 cgraph_inline_failed_t inline_failed;
349 /* The stmt_uid of call_stmt. This is used by LTO to recover the call_stmt
350 when the function is serialized in. */
351 unsigned int lto_stmt_uid;
352 /* Expected frequency of executions within the function.
353 When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
354 per function call. The range is 0 to CGRAPH_FREQ_MAX. */
356 /* Unique id of the edge. */
358 /* Whether this edge was made direct by indirect inlining. */
359 unsigned int indirect_inlining_edge : 1;
360 /* Whether this edge describes an indirect call with an undetermined
362 unsigned int indirect_unknown_callee : 1;
363 /* Whether this edge is still a dangling */
364 /* True if the corresponding CALL stmt cannot be inlined. */
365 unsigned int call_stmt_cannot_inline_p : 1;
366 /* Can this call throw externally? */
367 unsigned int can_throw_external : 1;
370 #define CGRAPH_FREQ_BASE 1000
371 #define CGRAPH_FREQ_MAX 100000
373 typedef struct cgraph_edge *cgraph_edge_p;
375 DEF_VEC_P(cgraph_edge_p);
376 DEF_VEC_ALLOC_P(cgraph_edge_p,heap);
378 /* The varpool data structure.
379 Each static variable decl has assigned varpool_node. */
381 struct GTY((chain_next ("%h.next"), chain_prev ("%h.prev"))) varpool_node {
383 /* For aliases points to declaration DECL is alias of. */
385 /* Pointer to the next function in varpool_nodes. */
386 struct varpool_node *next, *prev;
387 /* Pointer to the next function in varpool_nodes_queue. */
388 struct varpool_node *next_needed, *prev_needed;
389 /* Circular list of nodes in the same comdat group if non-NULL. */
390 struct varpool_node *same_comdat_group;
391 struct ipa_ref_list ref_list;
392 /* File stream where this node is being written to. */
393 struct lto_file_decl_data * lto_file_data;
394 PTR GTY ((skip)) aux;
395 /* Ordering of all cgraph nodes. */
397 enum ld_plugin_symbol_resolution resolution;
399 /* Set when function must be output - it is externally visible
400 or its address is taken. */
402 /* Needed variables might become dead by optimization. This flag
403 forces the variable to be output even if it appears dead otherwise. */
404 unsigned force_output : 1;
405 /* Set once the variable has been instantiated and its callee
407 unsigned analyzed : 1;
408 /* Set once it has been finalized so we consider it to be output. */
409 unsigned finalized : 1;
410 /* Set when variable is scheduled to be assembled. */
412 /* Set when function is visible by other units. */
413 unsigned externally_visible : 1;
414 /* Set for aliases once they got through assemble_alias. Also set for
415 extra name aliases in varpool_extra_name_alias. */
417 unsigned extra_name_alias : 1;
418 /* Set when variable is used from other LTRANS partition. */
419 unsigned used_from_other_partition : 1;
420 /* Set when variable is available in the other LTRANS partition.
421 During WPA output it is used to mark nodes that are present in
422 multiple partitions. */
423 unsigned in_other_partition : 1;
426 /* Every top level asm statement is put into a cgraph_asm_node. */
428 struct GTY(()) cgraph_asm_node {
430 struct cgraph_asm_node *next;
431 /* String for this asm node. */
433 /* Ordering of all cgraph nodes. */
437 extern GTY(()) struct cgraph_node *cgraph_nodes;
438 extern GTY(()) int cgraph_n_nodes;
439 extern GTY(()) int cgraph_max_uid;
440 extern GTY(()) int cgraph_edge_max_uid;
441 extern bool cgraph_global_info_ready;
444 /* Callgraph is being constructed. It is safe to add new functions. */
445 CGRAPH_STATE_CONSTRUCTION,
446 /* Callgraph is built and IPA passes are being run. */
448 /* Callgraph is built and all functions are transformed to SSA form. */
449 CGRAPH_STATE_IPA_SSA,
450 /* Functions are now ordered and being passed to RTL expanders. */
451 CGRAPH_STATE_EXPANSION,
452 /* All cgraph expansion is done. */
453 CGRAPH_STATE_FINISHED
455 extern enum cgraph_state cgraph_state;
456 extern bool cgraph_function_flags_ready;
457 extern GTY(()) struct cgraph_node *cgraph_nodes_queue;
458 extern GTY(()) struct cgraph_node *cgraph_new_nodes;
460 extern GTY(()) struct cgraph_asm_node *cgraph_asm_nodes;
461 extern GTY(()) int cgraph_order;
462 extern bool same_body_aliases_done;
465 void dump_cgraph (FILE *);
466 void debug_cgraph (void);
467 void dump_cgraph_node (FILE *, struct cgraph_node *);
468 void debug_cgraph_node (struct cgraph_node *);
469 void cgraph_insert_node_to_hashtable (struct cgraph_node *node);
470 void cgraph_remove_edge (struct cgraph_edge *);
471 void cgraph_remove_node (struct cgraph_node *);
472 void cgraph_add_to_same_comdat_group (struct cgraph_node *, struct cgraph_node *);
473 void cgraph_remove_node_and_inline_clones (struct cgraph_node *);
474 void cgraph_release_function_body (struct cgraph_node *);
475 void cgraph_node_remove_callees (struct cgraph_node *node);
476 struct cgraph_edge *cgraph_create_edge (struct cgraph_node *,
477 struct cgraph_node *,
478 gimple, gcov_type, int);
479 struct cgraph_edge *cgraph_create_indirect_edge (struct cgraph_node *, gimple,
480 int, gcov_type, int);
481 struct cgraph_indirect_call_info *cgraph_allocate_init_indirect_info (void);
482 struct cgraph_node * cgraph_get_node (const_tree);
483 struct cgraph_node * cgraph_get_node_or_alias (const_tree);
484 struct cgraph_node * cgraph_create_node (tree);
485 struct cgraph_node * cgraph_get_create_node (tree);
486 struct cgraph_node * cgraph_same_body_alias (struct cgraph_node *, tree, tree);
487 struct cgraph_node * cgraph_add_thunk (struct cgraph_node *, tree, tree, bool, HOST_WIDE_INT,
488 HOST_WIDE_INT, tree, tree);
489 struct cgraph_node *cgraph_node_for_asm (tree);
490 struct cgraph_edge *cgraph_edge (struct cgraph_node *, gimple);
491 void cgraph_set_call_stmt (struct cgraph_edge *, gimple);
492 void cgraph_set_call_stmt_including_clones (struct cgraph_node *, gimple, gimple);
493 void cgraph_create_edge_including_clones (struct cgraph_node *,
494 struct cgraph_node *,
495 gimple, gimple, gcov_type, int,
496 cgraph_inline_failed_t);
497 void cgraph_update_edges_for_call_stmt (gimple, tree, gimple);
498 struct cgraph_local_info *cgraph_local_info (tree);
499 struct cgraph_global_info *cgraph_global_info (tree);
500 struct cgraph_rtl_info *cgraph_rtl_info (tree);
501 const char * cgraph_node_name (struct cgraph_node *);
502 struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *,
503 struct cgraph_node *, gimple,
504 unsigned, gcov_type, int, bool);
505 struct cgraph_node * cgraph_clone_node (struct cgraph_node *, tree, gcov_type,
506 int, bool, VEC(cgraph_edge_p,heap) *,
508 struct cgraph_node *cgraph_create_function_alias (tree, tree);
510 void cgraph_redirect_edge_callee (struct cgraph_edge *, struct cgraph_node *);
511 void cgraph_make_edge_direct (struct cgraph_edge *, struct cgraph_node *,
513 bool cgraph_only_called_directly_p (struct cgraph_node *);
515 struct cgraph_asm_node *cgraph_add_asm_node (tree);
517 bool cgraph_function_possibly_inlined_p (tree);
518 void cgraph_unnest_node (struct cgraph_node *);
520 enum availability cgraph_function_body_availability (struct cgraph_node *);
521 void cgraph_add_new_function (tree, bool);
522 const char* cgraph_inline_failed_string (cgraph_inline_failed_t);
523 struct cgraph_node * cgraph_create_virtual_clone (struct cgraph_node *old_node,
524 VEC(cgraph_edge_p,heap)*,
525 VEC(ipa_replace_map_p,gc)* tree_map,
527 const char *clone_name);
529 void cgraph_set_nothrow_flag (struct cgraph_node *, bool);
530 void cgraph_set_const_flag (struct cgraph_node *, bool, bool);
531 void cgraph_set_pure_flag (struct cgraph_node *, bool, bool);
532 tree clone_function_name (tree decl, const char *);
533 bool cgraph_node_cannot_return (struct cgraph_node *);
534 bool cgraph_edge_cannot_lead_to_return (struct cgraph_edge *);
535 bool cgraph_will_be_removed_from_program_if_no_direct_calls
536 (struct cgraph_node *node);
537 bool cgraph_can_remove_if_no_direct_calls_and_refs_p
538 (struct cgraph_node *node);
539 bool cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node *node);
540 bool resolution_used_from_other_file_p (enum ld_plugin_symbol_resolution);
541 bool cgraph_used_from_object_file_p (struct cgraph_node *);
542 bool varpool_used_from_object_file_p (struct varpool_node *);
543 bool cgraph_for_node_thunks_and_aliases (struct cgraph_node *,
544 bool (*) (struct cgraph_node *, void *),
547 bool cgraph_for_node_and_aliases (struct cgraph_node *,
548 bool (*) (struct cgraph_node *, void *),
550 VEC (cgraph_edge_p, heap) * collect_callers_of_node (struct cgraph_node *node);
553 /* In cgraphunit.c */
554 extern FILE *cgraph_dump_file;
555 void cgraph_finalize_function (tree, bool);
556 void cgraph_mark_if_needed (tree);
557 void cgraph_analyze_function (struct cgraph_node *);
558 void cgraph_finalize_compilation_unit (void);
559 void cgraph_optimize (void);
560 void cgraph_mark_needed_node (struct cgraph_node *);
561 void cgraph_mark_address_taken_node (struct cgraph_node *);
562 void cgraph_mark_reachable_node (struct cgraph_node *);
563 bool cgraph_inline_p (struct cgraph_edge *, cgraph_inline_failed_t *reason);
564 bool cgraph_preserve_function_body_p (struct cgraph_node *);
565 void verify_cgraph (void);
566 void verify_cgraph_node (struct cgraph_node *);
567 void cgraph_build_static_cdtor (char which, tree body, int priority);
568 void cgraph_reset_static_var_maps (void);
569 void init_cgraph (void);
570 struct cgraph_node *cgraph_function_versioning (struct cgraph_node *,
571 VEC(cgraph_edge_p,heap)*,
572 VEC(ipa_replace_map_p,gc)*,
573 bitmap, bitmap, basic_block,
575 void tree_function_versioning (tree, tree, VEC (ipa_replace_map_p,gc)*, bool, bitmap,
576 bitmap, basic_block);
577 void record_references_in_initializer (tree, bool);
578 bool cgraph_process_new_functions (void);
579 void cgraph_process_same_body_aliases (void);
581 bool cgraph_decide_is_function_needed (struct cgraph_node *, tree);
583 typedef void (*cgraph_edge_hook)(struct cgraph_edge *, void *);
584 typedef void (*cgraph_node_hook)(struct cgraph_node *, void *);
585 typedef void (*cgraph_2edge_hook)(struct cgraph_edge *, struct cgraph_edge *,
587 typedef void (*cgraph_2node_hook)(struct cgraph_node *, struct cgraph_node *,
589 struct cgraph_edge_hook_list;
590 struct cgraph_node_hook_list;
591 struct cgraph_2edge_hook_list;
592 struct cgraph_2node_hook_list;
593 struct cgraph_edge_hook_list *cgraph_add_edge_removal_hook (cgraph_edge_hook, void *);
594 void cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *);
595 struct cgraph_node_hook_list *cgraph_add_node_removal_hook (cgraph_node_hook,
597 void cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *);
598 struct cgraph_node_hook_list *cgraph_add_function_insertion_hook (cgraph_node_hook,
600 void cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *);
601 void cgraph_call_function_insertion_hooks (struct cgraph_node *node);
602 struct cgraph_2edge_hook_list *cgraph_add_edge_duplication_hook (cgraph_2edge_hook, void *);
603 void cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *);
604 struct cgraph_2node_hook_list *cgraph_add_node_duplication_hook (cgraph_2node_hook, void *);
605 void cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *);
606 void cgraph_materialize_all_clones (void);
607 gimple cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge *);
608 bool cgraph_propagate_frequency (struct cgraph_node *node);
609 /* In cgraphbuild.c */
610 unsigned int rebuild_cgraph_edges (void);
611 void cgraph_rebuild_references (void);
612 void reset_inline_failed (struct cgraph_node *);
613 int compute_call_stmt_bb_frequency (tree, basic_block bb);
616 bool cgraph_remove_unreachable_nodes (bool, FILE *);
617 cgraph_node_set cgraph_node_set_new (void);
618 cgraph_node_set_iterator cgraph_node_set_find (cgraph_node_set,
619 struct cgraph_node *);
620 void cgraph_node_set_add (cgraph_node_set, struct cgraph_node *);
621 void cgraph_node_set_remove (cgraph_node_set, struct cgraph_node *);
622 void dump_cgraph_node_set (FILE *, cgraph_node_set);
623 void debug_cgraph_node_set (cgraph_node_set);
624 void free_cgraph_node_set (cgraph_node_set);
626 varpool_node_set varpool_node_set_new (void);
627 varpool_node_set_iterator varpool_node_set_find (varpool_node_set,
628 struct varpool_node *);
629 void varpool_node_set_add (varpool_node_set, struct varpool_node *);
630 void varpool_node_set_remove (varpool_node_set, struct varpool_node *);
631 void dump_varpool_node_set (FILE *, varpool_node_set);
632 void debug_varpool_node_set (varpool_node_set);
633 void free_varpool_node_set (varpool_node_set);
634 void ipa_discover_readonly_nonaddressable_vars (void);
635 bool cgraph_comdat_can_be_unshared_p (struct cgraph_node *);
638 bool cgraph_maybe_hot_edge_p (struct cgraph_edge *e);
639 bool cgraph_optimize_for_size_p (struct cgraph_node *);
642 extern GTY(()) struct varpool_node *varpool_nodes_queue;
643 extern GTY(()) struct varpool_node *varpool_nodes;
645 struct varpool_node *varpool_node (tree);
646 struct varpool_node *varpool_node_for_asm (tree asmname);
647 void varpool_mark_needed_node (struct varpool_node *);
648 void debug_varpool (void);
649 void dump_varpool (FILE *);
650 void dump_varpool_node (FILE *, struct varpool_node *);
652 void varpool_finalize_decl (tree);
653 bool decide_is_variable_needed (struct varpool_node *, tree);
654 enum availability cgraph_variable_initializer_availability (struct varpool_node *);
655 void cgraph_make_decl_local (tree);
656 void cgraph_make_node_local (struct cgraph_node *);
657 bool cgraph_node_can_be_local_p (struct cgraph_node *);
660 struct varpool_node * varpool_get_node (const_tree decl);
661 void varpool_remove_node (struct varpool_node *node);
662 void varpool_finalize_named_section_flags (struct varpool_node *node);
663 bool varpool_assemble_pending_decls (void);
664 bool varpool_assemble_decl (struct varpool_node *node);
665 bool varpool_analyze_pending_decls (void);
666 void varpool_remove_unreferenced_decls (void);
667 void varpool_empty_needed_queue (void);
668 struct varpool_node * varpool_extra_name_alias (tree, tree);
669 struct varpool_node * varpool_create_variable_alias (tree, tree);
670 const char * varpool_node_name (struct varpool_node *node);
671 void varpool_reset_queue (void);
672 bool const_value_known_p (tree);
673 bool varpool_for_node_and_aliases (struct varpool_node *,
674 bool (*) (struct varpool_node *, void *),
677 /* Walk all reachable static variables. */
678 #define FOR_EACH_STATIC_VARIABLE(node) \
679 for ((node) = varpool_nodes_queue; (node); (node) = (node)->next_needed)
681 /* Return first reachable static variable with initializer. */
682 static inline struct varpool_node *
683 varpool_first_static_initializer (void)
685 struct varpool_node *node;
686 for (node = varpool_nodes_queue; node; node = node->next_needed)
688 gcc_checking_assert (TREE_CODE (node->decl) == VAR_DECL);
689 if (DECL_INITIAL (node->decl))
695 /* Return next reachable static variable with initializer after NODE. */
696 static inline struct varpool_node *
697 varpool_next_static_initializer (struct varpool_node *node)
699 for (node = node->next_needed; node; node = node->next_needed)
701 gcc_checking_assert (TREE_CODE (node->decl) == VAR_DECL);
702 if (DECL_INITIAL (node->decl))
708 /* Walk all static variables with initializer set. */
709 #define FOR_EACH_STATIC_INITIALIZER(node) \
710 for ((node) = varpool_first_static_initializer (); (node); \
711 (node) = varpool_next_static_initializer (node))
713 /* Return first function with body defined. */
714 static inline struct cgraph_node *
715 cgraph_first_defined_function (void)
717 struct cgraph_node *node;
718 for (node = cgraph_nodes; node; node = node->next)
726 /* Return next reachable static variable with initializer after NODE. */
727 static inline struct cgraph_node *
728 cgraph_next_defined_function (struct cgraph_node *node)
730 for (node = node->next; node; node = node->next)
738 /* Walk all functions with body defined. */
739 #define FOR_EACH_DEFINED_FUNCTION(node) \
740 for ((node) = cgraph_first_defined_function (); (node); \
741 (node) = cgraph_next_defined_function (node))
744 /* Return true when NODE is a function with Gimple body defined
745 in current unit. Functions can also be define externally or they
746 can be thunks with no Gimple representation.
748 Note that at WPA stage, the function body may not be present in memory. */
751 cgraph_function_with_gimple_body_p (struct cgraph_node *node)
753 return node->analyzed && !node->thunk.thunk_p && !node->alias;
756 /* Return first function with body defined. */
757 static inline struct cgraph_node *
758 cgraph_first_function_with_gimple_body (void)
760 struct cgraph_node *node;
761 for (node = cgraph_nodes; node; node = node->next)
763 if (cgraph_function_with_gimple_body_p (node))
769 /* Return next reachable static variable with initializer after NODE. */
770 static inline struct cgraph_node *
771 cgraph_next_function_with_gimple_body (struct cgraph_node *node)
773 for (node = node->next; node; node = node->next)
775 if (cgraph_function_with_gimple_body_p (node))
781 /* Walk all functions with body defined. */
782 #define FOR_EACH_FUNCTION_WITH_GIMPLE_BODY(node) \
783 for ((node) = cgraph_first_function_with_gimple_body (); (node); \
784 (node) = cgraph_next_function_with_gimple_body (node))
786 /* Create a new static variable of type TYPE. */
787 tree add_new_static_var (tree type);
789 /* Return true if iterator CSI points to nothing. */
791 csi_end_p (cgraph_node_set_iterator csi)
793 return csi.index >= VEC_length (cgraph_node_ptr, csi.set->nodes);
796 /* Advance iterator CSI. */
798 csi_next (cgraph_node_set_iterator *csi)
803 /* Return the node pointed to by CSI. */
804 static inline struct cgraph_node *
805 csi_node (cgraph_node_set_iterator csi)
807 return VEC_index (cgraph_node_ptr, csi.set->nodes, csi.index);
810 /* Return an iterator to the first node in SET. */
811 static inline cgraph_node_set_iterator
812 csi_start (cgraph_node_set set)
814 cgraph_node_set_iterator csi;
821 /* Return true if SET contains NODE. */
823 cgraph_node_in_set_p (struct cgraph_node *node, cgraph_node_set set)
825 cgraph_node_set_iterator csi;
826 csi = cgraph_node_set_find (set, node);
827 return !csi_end_p (csi);
830 /* Return number of nodes in SET. */
832 cgraph_node_set_size (cgraph_node_set set)
834 return VEC_length (cgraph_node_ptr, set->nodes);
837 /* Return true if iterator VSI points to nothing. */
839 vsi_end_p (varpool_node_set_iterator vsi)
841 return vsi.index >= VEC_length (varpool_node_ptr, vsi.set->nodes);
844 /* Advance iterator VSI. */
846 vsi_next (varpool_node_set_iterator *vsi)
851 /* Return the node pointed to by VSI. */
852 static inline struct varpool_node *
853 vsi_node (varpool_node_set_iterator vsi)
855 return VEC_index (varpool_node_ptr, vsi.set->nodes, vsi.index);
858 /* Return an iterator to the first node in SET. */
859 static inline varpool_node_set_iterator
860 vsi_start (varpool_node_set set)
862 varpool_node_set_iterator vsi;
869 /* Return true if SET contains NODE. */
871 varpool_node_in_set_p (struct varpool_node *node, varpool_node_set set)
873 varpool_node_set_iterator vsi;
874 vsi = varpool_node_set_find (set, node);
875 return !vsi_end_p (vsi);
878 /* Return number of nodes in SET. */
880 varpool_node_set_size (varpool_node_set set)
882 return VEC_length (varpool_node_ptr, set->nodes);
885 /* Uniquize all constants that appear in memory.
886 Each constant in memory thus far output is recorded
887 in `const_desc_table'. */
889 struct GTY(()) constant_descriptor_tree {
890 /* A MEM for the constant. */
893 /* The value of the constant. */
896 /* Hash of value. Computing the hash from value each time
897 hashfn is called can't work properly, as that means recursive
898 use of the hash table during hash table expansion. */
902 /* Return true if set is nonempty. */
904 cgraph_node_set_nonempty_p (cgraph_node_set set)
906 return !VEC_empty (cgraph_node_ptr, set->nodes);
909 /* Return true if set is nonempty. */
911 varpool_node_set_nonempty_p (varpool_node_set set)
913 return !VEC_empty (varpool_node_ptr, set->nodes);
916 /* Return true when function NODE is only called directly or it has alias.
917 i.e. it is not externally visible, address was not taken and
918 it is not used in any other non-standard way. */
921 cgraph_only_called_directly_or_aliased_p (struct cgraph_node *node)
923 gcc_assert (!node->global.inlined_to);
924 return (!node->needed && !node->address_taken
925 && !node->reachable_from_other_partition
926 && !DECL_STATIC_CONSTRUCTOR (node->decl)
927 && !DECL_STATIC_DESTRUCTOR (node->decl)
928 && !node->local.externally_visible);
931 /* Return true when function NODE can be removed from callgraph
932 if all direct calls are eliminated. */
935 varpool_can_remove_if_no_refs (struct varpool_node *node)
937 return (!node->force_output && !node->used_from_other_partition
938 && (flag_toplevel_reorder || DECL_COMDAT (node->decl)
939 || DECL_ARTIFICIAL (node->decl))
940 && (DECL_COMDAT (node->decl) || !node->externally_visible));
943 /* Return true when all references to VNODE must be visible in ipa_ref_list.
944 i.e. if the variable is not externally visible or not used in some magic
945 way (asm statement or such).
946 The magic uses are all summarized in force_output flag. */
949 varpool_all_refs_explicit_p (struct varpool_node *vnode)
951 return (vnode->analyzed
952 && !vnode->externally_visible
953 && !vnode->used_from_other_partition
954 && !vnode->force_output);
957 /* Constant pool accessor function. */
958 htab_t constant_pool_htab (void);
960 /* FIXME: inappropriate dependency of cgraph on IPA. */
961 #include "ipa-ref-inline.h"
963 /* Return node that alias N is aliasing. */
965 static inline struct cgraph_node *
966 cgraph_alias_aliased_node (struct cgraph_node *n)
970 ipa_ref_list_reference_iterate (&n->ref_list, 0, ref);
971 gcc_checking_assert (ref->use == IPA_REF_ALIAS);
972 if (ref->refered_type == IPA_REF_CGRAPH)
973 return ipa_ref_node (ref);
977 /* Return node that alias N is aliasing. */
979 static inline struct varpool_node *
980 varpool_alias_aliased_node (struct varpool_node *n)
984 ipa_ref_list_reference_iterate (&n->ref_list, 0, ref);
985 gcc_checking_assert (ref->use == IPA_REF_ALIAS);
986 if (ref->refered_type == IPA_REF_VARPOOL)
987 return ipa_ref_varpool_node (ref);
991 /* Given NODE, walk the alias chain to return the function NODE is alias of.
992 Walk through thunk, too.
993 When AVAILABILITY is non-NULL, get minimal availablity in the chain. */
995 static inline struct cgraph_node *
996 cgraph_function_node (struct cgraph_node *node, enum availability *availability)
999 *availability = cgraph_function_body_availability (node);
1002 if (node->alias && node->analyzed)
1003 node = cgraph_alias_aliased_node (node);
1004 else if (node->thunk.thunk_p)
1005 node = node->callees->callee;
1008 if (node && availability)
1010 enum availability a;
1011 a = cgraph_function_body_availability (node);
1012 if (a < *availability)
1017 *availability = AVAIL_NOT_AVAILABLE;
1021 /* Given NODE, walk the alias chain to return the function NODE is alias of.
1022 Do not walk through thunks.
1023 When AVAILABILITY is non-NULL, get minimal availablity in the chain. */
1025 static inline struct cgraph_node *
1026 cgraph_function_or_thunk_node (struct cgraph_node *node, enum availability *availability)
1029 *availability = cgraph_function_body_availability (node);
1032 if (node->alias && node->analyzed)
1033 node = cgraph_alias_aliased_node (node);
1036 if (node && availability)
1038 enum availability a;
1039 a = cgraph_function_body_availability (node);
1040 if (a < *availability)
1045 *availability = AVAIL_NOT_AVAILABLE;
1049 /* Given NODE, walk the alias chain to return the function NODE is alias of.
1050 Do not walk through thunks.
1051 When AVAILABILITY is non-NULL, get minimal availablity in the chain. */
1053 static inline struct varpool_node *
1054 varpool_variable_node (struct varpool_node *node, enum availability *availability)
1057 *availability = cgraph_variable_initializer_availability (node);
1060 if (node->alias && node->analyzed)
1061 node = varpool_alias_aliased_node (node);
1064 if (node && availability)
1066 enum availability a;
1067 a = cgraph_variable_initializer_availability (node);
1068 if (a < *availability)
1073 *availability = AVAIL_NOT_AVAILABLE;
1077 /* Return true when the edge E represents a direct recursion. */
1079 cgraph_edge_recursive_p (struct cgraph_edge *e)
1081 struct cgraph_node *callee = cgraph_function_or_thunk_node (e->callee, NULL);
1082 if (e->caller->global.inlined_to)
1083 return e->caller->global.inlined_to->decl == callee->decl;
1085 return e->caller->decl == callee->decl;
1087 #endif /* GCC_CGRAPH_H */