gcc/cgraph.h

   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
   5
   6 This file is part of GCC.
   7
   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
  11 version.
  12
  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
  16 for more details.
  17
  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/>.  */
  21
  22 #ifndef GCC_CGRAPH_H
  23 #define GCC_CGRAPH_H
  24
  25 #include "plugin-api.h"
  26 #include "vec.h"
  27 #include "tree.h"
  28 #include "basic-block.h"
  29 #include "function.h"
  30 #include "ipa-ref.h"    /* FIXME: inappropriate dependency of cgraph on IPA.  */
  31
  32 enum availability
  33 {
  34   /* Not yet set by cgraph_function_body_availability.  */
  35   AVAIL_UNSET,
  36   /* Function body/variable initializer is unknown.  */
  37   AVAIL_NOT_AVAILABLE,
  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.  */
  43   AVAIL_OVERWRITABLE,
  44   /* Function body/variable initializer is known and will be used in final
  45      program.  */
  46   AVAIL_AVAILABLE,
  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.  */
  51   AVAIL_LOCAL
  52 };
  53
  54 /* This is the information that is put into the cgraph local structure
  55    to recover a function.  */
  56 struct lto_file_decl_data;
  57
  58 extern const char * const cgraph_availability_names[];
  59 extern const char * const ld_plugin_symbol_resolution_names[];
  60
  61 /* Information about thunk, used only for same body aliases.  */
  62
  63 struct GTY(()) cgraph_thunk_info {
  64   /* Information about the thunk.  */
  65   HOST_WIDE_INT fixed_offset;
  66   HOST_WIDE_INT virtual_value;
  67   tree alias;
  68   bool this_adjusting;
  69   bool virtual_offset_p;
  70   /* Set to true when alias node is thunk.  */
  71   bool thunk_p;
  72 };
  73
  74 /* Information about the function collected locally.
  75    Available after function is analyzed.  */
  76
  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;
  80
  81   /* Set when function function is visible in current compilation unit only
  82      and its address is never taken.  */
  83   unsigned local : 1;
  84
  85   /* Set when function is visible by other units.  */
  86   unsigned externally_visible : 1;
  87
  88   /* Set once it has been finalized so we consider it to be output.  */
  89   unsigned finalized : 1;
  90
  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;
  94
  95   /* True when the function has been originally extern inline, but it is
  96      redefined now.  */
  97   unsigned redefined_extern_inline : 1;
  98 };
  99
 100 /* Information about the function that needs to be computed globally
 101    once compilation is finished.  Available only with -funit-at-a-time.  */
 102
 103 struct GTY(()) cgraph_global_info {
 104   /* For inline clones this points to the function they will be
 105      inlined into.  */
 106   struct cgraph_node *inlined_to;
 107 };
 108
 109 /* Information about the function that is propagated by the RTL backend.
 110    Available only for functions that has been already assembled.  */
 111
 112 struct GTY(()) cgraph_rtl_info {
 113    unsigned int preferred_incoming_stack_boundary;
 114 };
 115
 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
 119 {
 120   /* The tree that will be replaced.  */
 121   tree old_tree;
 122   /* The new (replacing) tree.  */
 123   tree new_tree;
 124   /* Parameter number to replace, when old_tree is NULL.  */
 125   int parm_num;
 126   /* True when a substitution should be done, false otherwise.  */
 127   bool replace_p;
 128   /* True when we replace a reference to old_tree.  */
 129   bool ref_p;
 130 };
 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);
 134
 135 struct GTY(()) cgraph_clone_info
 136 {
 137   VEC(ipa_replace_map_p,gc)* tree_map;
 138   bitmap args_to_skip;
 139   bitmap combined_args_to_skip;
 140 };
 141
 142
 143 /* The cgraph data structure.
 144    Each function decl has assigned cgraph_node listing callees and callers.  */
 145
 146 struct GTY((chain_next ("%h.next"), chain_prev ("%h.previous"))) cgraph_node {
 147   tree decl;
 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
 153      callee.  */
 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   /* For normal nodes pointer to the list of alias and thunk nodes,
 169      in alias/thunk nodes pointer to the normal node.  */
 170   struct cgraph_node *same_body;
 171   /* Circular list of nodes in the same comdat group if non-NULL.  */
 172   struct cgraph_node *same_comdat_group;
 173   /* For functions with many calls sites it holds map from call expression
 174      to the edge to speed up cgraph_edge function.  */
 175   htab_t GTY((param_is (struct cgraph_edge))) call_site_hash;
 176   /* Declaration node used to be clone of. */
 177   tree former_clone_of;
 178
 179   PTR GTY ((skip)) aux;
 180
 181   /* Interprocedural passes scheduled to have their transform functions
 182      applied next time we execute local pass on them.  We maintain it
 183      per-function in order to allow IPA passes to introduce new functions.  */
 184   VEC(ipa_opt_pass,heap) * GTY((skip)) ipa_transforms_to_apply;
 185
 186   struct ipa_ref_list ref_list;
 187   struct cgraph_local_info local;
 188   struct cgraph_global_info global;
 189   struct cgraph_rtl_info rtl;
 190   struct cgraph_clone_info clone;
 191   struct cgraph_thunk_info thunk;
 192
 193   /* Expected number of executions: calculated in profile.c.  */
 194   gcov_type count;
 195   /* How to scale counts at materialization time; used to merge
 196      LTO units with different number of profile runs.  */
 197   int count_materialization_scale;
 198   /* Unique id of the node.  */
 199   int uid;
 200   /* Ordering of all cgraph nodes.  */
 201   int order;
 202
 203   enum ld_plugin_symbol_resolution resolution;
 204
 205   /* Set when function must be output for some reason.  The primary
 206      use of this flag is to mark functions needed to be output for
 207      non-standard reason.  Functions that are externally visible
 208      or reachable from functions needed to be output are marked
 209      by specialized flags.  */
 210   unsigned needed : 1;
 211   /* Set when function has address taken.
 212      In current implementation it imply needed flag. */
 213   unsigned address_taken : 1;
 214   /* Set when decl is an abstract function pointed to by the
 215      ABSTRACT_DECL_ORIGIN of a reachable function.  */
 216   unsigned abstract_and_needed : 1;
 217   /* Set when function is reachable by call from other function
 218      that is either reachable or needed.
 219      This flag is computed at original cgraph construction and then
 220      updated in cgraph_remove_unreachable_nodes.  Note that after
 221      cgraph_remove_unreachable_nodes cgraph still can contain unreachable
 222      nodes when they are needed for virtual clone instantiation.  */
 223   unsigned reachable : 1;
 224   /* Set when function is reachable by call from other LTRANS partition.  */
 225   unsigned reachable_from_other_partition : 1;
 226   /* Set once the function is lowered (i.e. its CFG is built).  */
 227   unsigned lowered : 1;
 228   /* Set once the function has been instantiated and its callee
 229      lists created.  */
 230   unsigned analyzed : 1;
 231   /* Set when function is available in the other LTRANS partition.
 232      During WPA output it is used to mark nodes that are present in
 233      multiple partitions.  */
 234   unsigned in_other_partition : 1;
 235   /* Set when function is scheduled to be processed by local passes.  */
 236   unsigned process : 1;
 237   /* Set for aliases once they got through assemble_alias.  */
 238   unsigned alias : 1;
 239   /* Set for alias and thunk nodes, same_body points to the node they are alias
 240      of and they are linked through the next/previous pointers.  */
 241   unsigned same_body_alias : 1;
 242   /* How commonly executed the node is.  Initialized during branch
 243      probabilities pass.  */
 244   ENUM_BITFIELD (node_frequency) frequency : 2;
 245   /* True when function can only be called at startup (from static ctor).  */
 246   unsigned only_called_at_startup : 1;
 247   /* True when function can only be called at startup (from static dtor).  */
 248   unsigned only_called_at_exit : 1;
 249 };
 250
 251 typedef struct cgraph_node *cgraph_node_ptr;
 252
 253 DEF_VEC_P(cgraph_node_ptr);
 254 DEF_VEC_ALLOC_P(cgraph_node_ptr,heap);
 255 DEF_VEC_ALLOC_P(cgraph_node_ptr,gc);
 256
 257 /* A cgraph node set is a collection of cgraph nodes.  A cgraph node
 258    can appear in multiple sets.  */
 259 struct GTY(()) cgraph_node_set_def
 260 {
 261   htab_t GTY((param_is (struct cgraph_node_set_element_def))) hashtab;
 262   VEC(cgraph_node_ptr, gc) *nodes;
 263 };
 264
 265 typedef struct varpool_node *varpool_node_ptr;
 266
 267 DEF_VEC_P(varpool_node_ptr);
 268 DEF_VEC_ALLOC_P(varpool_node_ptr,heap);
 269 DEF_VEC_ALLOC_P(varpool_node_ptr,gc);
 270
 271 /* A varpool node set is a collection of varpool nodes.  A varpool node
 272    can appear in multiple sets.  */
 273 struct GTY(()) varpool_node_set_def
 274 {
 275   htab_t GTY((param_is (struct varpool_node_set_element_def))) hashtab;
 276   VEC(varpool_node_ptr, gc) *nodes;
 277 };
 278
 279 typedef struct cgraph_node_set_def *cgraph_node_set;
 280
 281 DEF_VEC_P(cgraph_node_set);
 282 DEF_VEC_ALLOC_P(cgraph_node_set,gc);
 283 DEF_VEC_ALLOC_P(cgraph_node_set,heap);
 284
 285 typedef struct varpool_node_set_def *varpool_node_set;
 286
 287 DEF_VEC_P(varpool_node_set);
 288 DEF_VEC_ALLOC_P(varpool_node_set,gc);
 289 DEF_VEC_ALLOC_P(varpool_node_set,heap);
 290
 291 /* A cgraph node set element contains an index in the vector of nodes in
 292    the set.  */
 293 struct GTY(()) cgraph_node_set_element_def
 294 {
 295   struct cgraph_node *node;
 296   HOST_WIDE_INT index;
 297 };
 298
 299 typedef struct cgraph_node_set_element_def *cgraph_node_set_element;
 300 typedef const struct cgraph_node_set_element_def *const_cgraph_node_set_element;
 301
 302 /* Iterator structure for cgraph node sets.  */
 303 typedef struct
 304 {
 305   cgraph_node_set set;
 306   unsigned index;
 307 } cgraph_node_set_iterator;
 308
 309 /* A varpool node set element contains an index in the vector of nodes in
 310    the set.  */
 311 struct GTY(()) varpool_node_set_element_def
 312 {
 313   struct varpool_node *node;
 314   HOST_WIDE_INT index;
 315 };
 316
 317 typedef struct varpool_node_set_element_def *varpool_node_set_element;
 318 typedef const struct varpool_node_set_element_def *const_varpool_node_set_element;
 319
 320 /* Iterator structure for varpool node sets.  */
 321 typedef struct
 322 {
 323   varpool_node_set set;
 324   unsigned index;
 325 } varpool_node_set_iterator;
 326
 327 #define DEFCIFCODE(code, string)        CIF_ ## code,
 328 /* Reasons for inlining failures.  */
 329 typedef enum {
 330 #include "cif-code.def"
 331   CIF_N_REASONS
 332 } cgraph_inline_failed_t;
 333
 334 /* Structure containing additional information about an indirect call.  */
 335
 336 struct GTY(()) cgraph_indirect_call_info
 337 {
 338   /* Offset accumulated from ancestor jump functions of inlined call graph
 339      edges.  */
 340   HOST_WIDE_INT anc_offset;
 341   /* OBJ_TYPE_REF_TOKEN of a polymorphic call (if polymorphic is set).  */
 342   HOST_WIDE_INT otr_token;
 343   /* Delta by which must be added to this parameter to compensate for a skipped
 344      this adjusting thunk.  */
 345   HOST_WIDE_INT thunk_delta;
 346   /* Type of the object from OBJ_TYPE_REF_OBJECT. */
 347   tree otr_type;
 348   /* Index of the parameter that is called.  */
 349   int param_index;
 350   /* ECF flags determined from the caller.  */
 351   int ecf_flags;
 352
 353   /* Set when the call is a virtual call with the parameter being the
 354      associated object pointer rather than a simple direct call.  */
 355   unsigned polymorphic : 1;
 356 };
 357
 358 struct GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"))) cgraph_edge {
 359   /* Expected number of executions: calculated in profile.c.  */
 360   gcov_type count;
 361   struct cgraph_node *caller;
 362   struct cgraph_node *callee;
 363   struct cgraph_edge *prev_caller;
 364   struct cgraph_edge *next_caller;
 365   struct cgraph_edge *prev_callee;
 366   struct cgraph_edge *next_callee;
 367   gimple call_stmt;
 368   /* Additional information about an indirect call.  Not cleared when an edge
 369      becomes direct.  */
 370   struct cgraph_indirect_call_info *indirect_info;
 371   PTR GTY ((skip (""))) aux;
 372   /* When equal to CIF_OK, inline this call.  Otherwise, points to the
 373      explanation why function was not inlined.  */
 374   cgraph_inline_failed_t inline_failed;
 375   /* The stmt_uid of call_stmt.  This is used by LTO to recover the call_stmt
 376      when the function is serialized in.  */
 377   unsigned int lto_stmt_uid;
 378   /* Expected frequency of executions within the function.
 379      When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
 380      per function call.  The range is 0 to CGRAPH_FREQ_MAX.  */
 381   int frequency;
 382   /* Unique id of the edge.  */
 383   int uid;
 384   /* Whether this edge was made direct by indirect inlining.  */
 385   unsigned int indirect_inlining_edge : 1;
 386   /* Whether this edge describes an indirect call with an undetermined
 387      callee.  */
 388   unsigned int indirect_unknown_callee : 1;
 389   /* Whether this edge is still a dangling  */
 390   /* True if the corresponding CALL stmt cannot be inlined.  */
 391   unsigned int call_stmt_cannot_inline_p : 1;
 392   /* Can this call throw externally?  */
 393   unsigned int can_throw_external : 1;
 394 };
 395
 396 #define CGRAPH_FREQ_BASE 1000
 397 #define CGRAPH_FREQ_MAX 100000
 398
 399 typedef struct cgraph_edge *cgraph_edge_p;
 400
 401 DEF_VEC_P(cgraph_edge_p);
 402 DEF_VEC_ALLOC_P(cgraph_edge_p,heap);
 403
 404 /* The varpool data structure.
 405    Each static variable decl has assigned varpool_node.  */
 406
 407 struct GTY((chain_next ("%h.next"), chain_prev ("%h.prev"))) varpool_node {
 408   tree decl;
 409   /* Pointer to the next function in varpool_nodes.  */
 410   struct varpool_node *next, *prev;
 411   /* Pointer to the next function in varpool_nodes_queue.  */
 412   struct varpool_node *next_needed, *prev_needed;
 413   /* For normal nodes a pointer to the first extra name alias.  For alias
 414      nodes a pointer to the normal node.  */
 415   struct varpool_node *extra_name;
 416   /* Circular list of nodes in the same comdat group if non-NULL.  */
 417   struct varpool_node *same_comdat_group;
 418   struct ipa_ref_list ref_list;
 419   /* File stream where this node is being written to.  */
 420   struct lto_file_decl_data * lto_file_data;
 421   PTR GTY ((skip)) aux;
 422   /* Ordering of all cgraph nodes.  */
 423   int order;
 424   enum ld_plugin_symbol_resolution resolution;
 425
 426   /* Set when function must be output - it is externally visible
 427      or its address is taken.  */
 428   unsigned needed : 1;
 429   /* Needed variables might become dead by optimization.  This flag
 430      forces the variable to be output even if it appears dead otherwise.  */
 431   unsigned force_output : 1;
 432   /* Set once the variable has been instantiated and its callee
 433      lists created.  */
 434   unsigned analyzed : 1;
 435   /* Set once it has been finalized so we consider it to be output.  */
 436   unsigned finalized : 1;
 437   /* Set when variable is scheduled to be assembled.  */
 438   unsigned output : 1;
 439   /* Set when function is visible by other units.  */
 440   unsigned externally_visible : 1;
 441   /* Set for aliases once they got through assemble_alias.  Also set for
 442      extra name aliases in varpool_extra_name_alias.  */
 443   unsigned alias : 1;
 444   /* Set when variable is used from other LTRANS partition.  */
 445   unsigned used_from_other_partition : 1;
 446   /* Set when variable is available in the other LTRANS partition.
 447      During WPA output it is used to mark nodes that are present in
 448      multiple partitions.  */
 449   unsigned in_other_partition : 1;
 450 };
 451
 452 /* Every top level asm statement is put into a cgraph_asm_node.  */
 453
 454 struct GTY(()) cgraph_asm_node {
 455   /* Next asm node.  */
 456   struct cgraph_asm_node *next;
 457   /* String for this asm node.  */
 458   tree asm_str;
 459   /* Ordering of all cgraph nodes.  */
 460   int order;
 461 };
 462
 463 extern GTY(()) struct cgraph_node *cgraph_nodes;
 464 extern GTY(()) int cgraph_n_nodes;
 465 extern GTY(()) int cgraph_max_uid;
 466 extern GTY(()) int cgraph_edge_max_uid;
 467 extern bool cgraph_global_info_ready;
 468 enum cgraph_state
 469 {
 470   /* Callgraph is being constructed.  It is safe to add new functions.  */
 471   CGRAPH_STATE_CONSTRUCTION,
 472   /* Callgraph is built and IPA passes are being run.  */
 473   CGRAPH_STATE_IPA,
 474   /* Callgraph is built and all functions are transformed to SSA form.  */
 475   CGRAPH_STATE_IPA_SSA,
 476   /* Functions are now ordered and being passed to RTL expanders.  */
 477   CGRAPH_STATE_EXPANSION,
 478   /* All cgraph expansion is done.  */
 479   CGRAPH_STATE_FINISHED
 480 };
 481 extern enum cgraph_state cgraph_state;
 482 extern bool cgraph_function_flags_ready;
 483 extern GTY(()) struct cgraph_node *cgraph_nodes_queue;
 484 extern GTY(()) struct cgraph_node *cgraph_new_nodes;
 485
 486 extern GTY(()) struct cgraph_asm_node *cgraph_asm_nodes;
 487 extern GTY(()) int cgraph_order;
 488
 489 /* In cgraph.c  */
 490 void dump_cgraph (FILE *);
 491 void debug_cgraph (void);
 492 void dump_cgraph_node (FILE *, struct cgraph_node *);
 493 void debug_cgraph_node (struct cgraph_node *);
 494 void cgraph_insert_node_to_hashtable (struct cgraph_node *node);
 495 void cgraph_remove_edge (struct cgraph_edge *);
 496 void cgraph_remove_node (struct cgraph_node *);
 497 void cgraph_remove_node_and_inline_clones (struct cgraph_node *);
 498 void cgraph_release_function_body (struct cgraph_node *);
 499 void cgraph_node_remove_callees (struct cgraph_node *node);
 500 struct cgraph_edge *cgraph_create_edge (struct cgraph_node *,
 501                                         struct cgraph_node *,
 502                                         gimple, gcov_type, int);
 503 struct cgraph_edge *cgraph_create_indirect_edge (struct cgraph_node *, gimple,
 504                                                  int, gcov_type, int);
 505 struct cgraph_indirect_call_info *cgraph_allocate_init_indirect_info (void);
 506 struct cgraph_node * cgraph_get_node (const_tree);
 507 struct cgraph_node * cgraph_get_node_or_alias (const_tree);
 508 struct cgraph_node * cgraph_create_node (tree);
 509 struct cgraph_node * cgraph_get_create_node (tree);
 510 struct cgraph_node * cgraph_same_body_alias (struct cgraph_node *, tree, tree);
 511 struct cgraph_node * cgraph_add_thunk (struct cgraph_node *, tree, tree, bool, HOST_WIDE_INT,
 512                                        HOST_WIDE_INT, tree, tree);
 513 void cgraph_remove_same_body_alias (struct cgraph_node *);
 514 struct cgraph_node *cgraph_node_for_asm (tree);
 515 struct cgraph_edge *cgraph_edge (struct cgraph_node *, gimple);
 516 void cgraph_set_call_stmt (struct cgraph_edge *, gimple);
 517 void cgraph_set_call_stmt_including_clones (struct cgraph_node *, gimple, gimple);
 518 void cgraph_create_edge_including_clones (struct cgraph_node *,
 519                                           struct cgraph_node *,
 520                                           gimple, gimple, gcov_type, int,
 521                                           cgraph_inline_failed_t);
 522 void cgraph_update_edges_for_call_stmt (gimple, tree, gimple);
 523 struct cgraph_local_info *cgraph_local_info (tree);
 524 struct cgraph_global_info *cgraph_global_info (tree);
 525 struct cgraph_rtl_info *cgraph_rtl_info (tree);
 526 const char * cgraph_node_name (struct cgraph_node *);
 527 struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *,
 528                                         struct cgraph_node *, gimple,
 529                                         unsigned, gcov_type, int, bool);
 530 struct cgraph_node * cgraph_clone_node (struct cgraph_node *, tree, gcov_type,
 531                                         int, bool, VEC(cgraph_edge_p,heap) *);
 532
 533 void cgraph_redirect_edge_callee (struct cgraph_edge *, struct cgraph_node *);
 534 void cgraph_make_edge_direct (struct cgraph_edge *, struct cgraph_node *,
 535                               HOST_WIDE_INT);
 536
 537 struct cgraph_asm_node *cgraph_add_asm_node (tree);
 538
 539 bool cgraph_function_possibly_inlined_p (tree);
 540 void cgraph_unnest_node (struct cgraph_node *);
 541
 542 enum availability cgraph_function_body_availability (struct cgraph_node *);
 543 void cgraph_add_new_function (tree, bool);
 544 const char* cgraph_inline_failed_string (cgraph_inline_failed_t);
 545 struct cgraph_node * cgraph_create_virtual_clone (struct cgraph_node *old_node,
 546                                                   VEC(cgraph_edge_p,heap)*,
 547                                                   VEC(ipa_replace_map_p,gc)* tree_map,
 548                                                   bitmap args_to_skip,
 549                                                   const char *clone_name);
 550
 551 void cgraph_set_nothrow_flag (struct cgraph_node *, bool);
 552 void cgraph_set_const_flag (struct cgraph_node *, bool, bool);
 553 void cgraph_set_pure_flag (struct cgraph_node *, bool, bool);
 554 tree clone_function_name (tree decl, const char *);
 555 bool cgraph_node_cannot_return (struct cgraph_node *);
 556 bool cgraph_edge_cannot_lead_to_return (struct cgraph_edge *);
 557 bool cgraph_will_be_removed_from_program_if_no_direct_calls
 558   (struct cgraph_node *node);
 559 bool cgraph_can_remove_if_no_direct_calls_and_refs_p
 560   (struct cgraph_node *node);
 561 bool resolution_used_from_other_file_p (enum ld_plugin_symbol_resolution resolution);
 562 bool cgraph_used_from_object_file_p (struct cgraph_node *node);
 563 bool varpool_used_from_object_file_p (struct varpool_node *node);
 564
 565 /* In cgraphunit.c  */
 566 extern FILE *cgraph_dump_file;
 567 void cgraph_finalize_function (tree, bool);
 568 void cgraph_mark_if_needed (tree);
 569 void cgraph_analyze_function (struct cgraph_node *);
 570 void cgraph_finalize_compilation_unit (void);
 571 void cgraph_optimize (void);
 572 void cgraph_mark_needed_node (struct cgraph_node *);
 573 void cgraph_mark_address_taken_node (struct cgraph_node *);
 574 void cgraph_mark_reachable_node (struct cgraph_node *);
 575 bool cgraph_inline_p (struct cgraph_edge *, cgraph_inline_failed_t *reason);
 576 bool cgraph_preserve_function_body_p (tree);
 577 void verify_cgraph (void);
 578 void verify_cgraph_node (struct cgraph_node *);
 579 void cgraph_build_static_cdtor (char which, tree body, int priority);
 580 void cgraph_reset_static_var_maps (void);
 581 void init_cgraph (void);
 582 struct cgraph_node *cgraph_function_versioning (struct cgraph_node *,
 583                                                 VEC(cgraph_edge_p,heap)*,
 584                                                 VEC(ipa_replace_map_p,gc)*,
 585                                                 bitmap, bitmap, basic_block,
 586                                                 const char *);
 587 void tree_function_versioning (tree, tree, VEC (ipa_replace_map_p,gc)*, bool, bitmap,
 588                                bitmap, basic_block);
 589 void record_references_in_initializer (tree, bool);
 590 bool cgraph_process_new_functions (void);
 591
 592 bool cgraph_decide_is_function_needed (struct cgraph_node *, tree);
 593
 594 typedef void (*cgraph_edge_hook)(struct cgraph_edge *, void *);
 595 typedef void (*cgraph_node_hook)(struct cgraph_node *, void *);
 596 typedef void (*cgraph_2edge_hook)(struct cgraph_edge *, struct cgraph_edge *,
 597                                   void *);
 598 typedef void (*cgraph_2node_hook)(struct cgraph_node *, struct cgraph_node *,
 599                                   void *);
 600 struct cgraph_edge_hook_list;
 601 struct cgraph_node_hook_list;
 602 struct cgraph_2edge_hook_list;
 603 struct cgraph_2node_hook_list;
 604 struct cgraph_edge_hook_list *cgraph_add_edge_removal_hook (cgraph_edge_hook, void *);
 605 void cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *);
 606 struct cgraph_node_hook_list *cgraph_add_node_removal_hook (cgraph_node_hook,
 607                                                             void *);
 608 void cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *);
 609 struct cgraph_node_hook_list *cgraph_add_function_insertion_hook (cgraph_node_hook,
 610                                                                   void *);
 611 void cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *);
 612 void cgraph_call_function_insertion_hooks (struct cgraph_node *node);
 613 struct cgraph_2edge_hook_list *cgraph_add_edge_duplication_hook (cgraph_2edge_hook, void *);
 614 void cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *);
 615 struct cgraph_2node_hook_list *cgraph_add_node_duplication_hook (cgraph_2node_hook, void *);
 616 void cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *);
 617 void cgraph_materialize_all_clones (void);
 618 gimple cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge *);
 619 bool cgraph_propagate_frequency (struct cgraph_node *node);
 620 /* In cgraphbuild.c  */
 621 unsigned int rebuild_cgraph_edges (void);
 622 void cgraph_rebuild_references (void);
 623 void reset_inline_failed (struct cgraph_node *);
 624 int compute_call_stmt_bb_frequency (tree, basic_block bb);
 625
 626 /* In ipa.c  */
 627 bool cgraph_remove_unreachable_nodes (bool, FILE *);
 628 int cgraph_postorder (struct cgraph_node **);
 629 cgraph_node_set cgraph_node_set_new (void);
 630 cgraph_node_set_iterator cgraph_node_set_find (cgraph_node_set,
 631                                                struct cgraph_node *);
 632 void cgraph_node_set_add (cgraph_node_set, struct cgraph_node *);
 633 void cgraph_node_set_remove (cgraph_node_set, struct cgraph_node *);
 634 void dump_cgraph_node_set (FILE *, cgraph_node_set);
 635 void debug_cgraph_node_set (cgraph_node_set);
 636
 637 varpool_node_set varpool_node_set_new (void);
 638 varpool_node_set_iterator varpool_node_set_find (varpool_node_set,
 639                                                struct varpool_node *);
 640 void varpool_node_set_add (varpool_node_set, struct varpool_node *);
 641 void varpool_node_set_remove (varpool_node_set, struct varpool_node *);
 642 void dump_varpool_node_set (FILE *, varpool_node_set);
 643 void debug_varpool_node_set (varpool_node_set);
 644 void ipa_discover_readonly_nonaddressable_vars (void);
 645 bool cgraph_comdat_can_be_unshared_p (struct cgraph_node *);
 646
 647 /* In predict.c  */
 648 bool cgraph_maybe_hot_edge_p (struct cgraph_edge *e);
 649 bool cgraph_optimize_for_size_p (struct cgraph_node *);
 650
 651 /* In varpool.c  */
 652 extern GTY(()) struct varpool_node *varpool_nodes_queue;
 653 extern GTY(()) struct varpool_node *varpool_nodes;
 654
 655 struct varpool_node *varpool_node (tree);
 656 struct varpool_node *varpool_node_for_asm (tree asmname);
 657 void varpool_mark_needed_node (struct varpool_node *);
 658 void debug_varpool (void);
 659 void dump_varpool (FILE *);
 660 void dump_varpool_node (FILE *, struct varpool_node *);
 661
 662 void varpool_finalize_decl (tree);
 663 bool decide_is_variable_needed (struct varpool_node *, tree);
 664 enum availability cgraph_variable_initializer_availability (struct varpool_node *);
 665 void cgraph_make_decl_local (tree);
 666 void cgraph_make_node_local (struct cgraph_node *);
 667 bool cgraph_node_can_be_local_p (struct cgraph_node *);
 668
 669
 670 struct varpool_node * varpool_get_node (const_tree decl);
 671 void varpool_remove_node (struct varpool_node *node);
 672 void varpool_finalize_named_section_flags (struct varpool_node *node);
 673 bool varpool_assemble_pending_decls (void);
 674 bool varpool_assemble_decl (struct varpool_node *node);
 675 bool varpool_analyze_pending_decls (void);
 676 void varpool_remove_unreferenced_decls (void);
 677 void varpool_empty_needed_queue (void);
 678 struct varpool_node * varpool_extra_name_alias (tree, tree);
 679 const char * varpool_node_name (struct varpool_node *node);
 680 void varpool_reset_queue (void);
 681 bool const_value_known_p (tree);
 682
 683 /* Walk all reachable static variables.  */
 684 #define FOR_EACH_STATIC_VARIABLE(node) \
 685    for ((node) = varpool_nodes_queue; (node); (node) = (node)->next_needed)
 686
 687 /* Return first reachable static variable with initializer.  */
 688 static inline struct varpool_node *
 689 varpool_first_static_initializer (void)
 690 {
 691   struct varpool_node *node;
 692   for (node = varpool_nodes_queue; node; node = node->next_needed)
 693     {
 694       gcc_checking_assert (TREE_CODE (node->decl) == VAR_DECL);
 695       if (DECL_INITIAL (node->decl))
 696         return node;
 697     }
 698   return NULL;
 699 }
 700
 701 /* Return next reachable static variable with initializer after NODE.  */
 702 static inline struct varpool_node *
 703 varpool_next_static_initializer (struct varpool_node *node)
 704 {
 705   for (node = node->next_needed; node; node = node->next_needed)
 706     {
 707       gcc_checking_assert (TREE_CODE (node->decl) == VAR_DECL);
 708       if (DECL_INITIAL (node->decl))
 709         return node;
 710     }
 711   return NULL;
 712 }
 713
 714 /* Walk all static variables with initializer set.  */
 715 #define FOR_EACH_STATIC_INITIALIZER(node) \
 716    for ((node) = varpool_first_static_initializer (); (node); \
 717         (node) = varpool_next_static_initializer (node))
 718
 719 /* Create a new static variable of type TYPE.  */
 720 tree add_new_static_var (tree type);
 721
 722 /* Return true if iterator CSI points to nothing.  */
 723 static inline bool
 724 csi_end_p (cgraph_node_set_iterator csi)
 725 {
 726   return csi.index >= VEC_length (cgraph_node_ptr, csi.set->nodes);
 727 }
 728
 729 /* Advance iterator CSI.  */
 730 static inline void
 731 csi_next (cgraph_node_set_iterator *csi)
 732 {
 733   csi->index++;
 734 }
 735
 736 /* Return the node pointed to by CSI.  */
 737 static inline struct cgraph_node *
 738 csi_node (cgraph_node_set_iterator csi)
 739 {
 740   return VEC_index (cgraph_node_ptr, csi.set->nodes, csi.index);
 741 }
 742
 743 /* Return an iterator to the first node in SET.  */
 744 static inline cgraph_node_set_iterator
 745 csi_start (cgraph_node_set set)
 746 {
 747   cgraph_node_set_iterator csi;
 748
 749   csi.set = set;
 750   csi.index = 0;
 751   return csi;
 752 }
 753
 754 /* Return true if SET contains NODE.  */
 755 static inline bool
 756 cgraph_node_in_set_p (struct cgraph_node *node, cgraph_node_set set)
 757 {
 758   cgraph_node_set_iterator csi;
 759   csi = cgraph_node_set_find (set, node);
 760   return !csi_end_p (csi);
 761 }
 762
 763 /* Return number of nodes in SET.  */
 764 static inline size_t
 765 cgraph_node_set_size (cgraph_node_set set)
 766 {
 767   return htab_elements (set->hashtab);
 768 }
 769
 770 /* Return true if iterator VSI points to nothing.  */
 771 static inline bool
 772 vsi_end_p (varpool_node_set_iterator vsi)
 773 {
 774   return vsi.index >= VEC_length (varpool_node_ptr, vsi.set->nodes);
 775 }
 776
 777 /* Advance iterator VSI.  */
 778 static inline void
 779 vsi_next (varpool_node_set_iterator *vsi)
 780 {
 781   vsi->index++;
 782 }
 783
 784 /* Return the node pointed to by VSI.  */
 785 static inline struct varpool_node *
 786 vsi_node (varpool_node_set_iterator vsi)
 787 {
 788   return VEC_index (varpool_node_ptr, vsi.set->nodes, vsi.index);
 789 }
 790
 791 /* Return an iterator to the first node in SET.  */
 792 static inline varpool_node_set_iterator
 793 vsi_start (varpool_node_set set)
 794 {
 795   varpool_node_set_iterator vsi;
 796
 797   vsi.set = set;
 798   vsi.index = 0;
 799   return vsi;
 800 }
 801
 802 /* Return true if SET contains NODE.  */
 803 static inline bool
 804 varpool_node_in_set_p (struct varpool_node *node, varpool_node_set set)
 805 {
 806   varpool_node_set_iterator vsi;
 807   vsi = varpool_node_set_find (set, node);
 808   return !vsi_end_p (vsi);
 809 }
 810
 811 /* Return number of nodes in SET.  */
 812 static inline size_t
 813 varpool_node_set_size (varpool_node_set set)
 814 {
 815   return htab_elements (set->hashtab);
 816 }
 817
 818 /* Uniquize all constants that appear in memory.
 819    Each constant in memory thus far output is recorded
 820    in `const_desc_table'.  */
 821
 822 struct GTY(()) constant_descriptor_tree {
 823   /* A MEM for the constant.  */
 824   rtx rtl;
 825
 826   /* The value of the constant.  */
 827   tree value;
 828
 829   /* Hash of value.  Computing the hash from value each time
 830      hashfn is called can't work properly, as that means recursive
 831      use of the hash table during hash table expansion.  */
 832   hashval_t hash;
 833 };
 834
 835 /* Return true if set is nonempty.  */
 836 static inline bool
 837 cgraph_node_set_nonempty_p (cgraph_node_set set)
 838 {
 839   return !VEC_empty (cgraph_node_ptr, set->nodes);
 840 }
 841
 842 /* Return true if set is nonempty.  */
 843 static inline bool
 844 varpool_node_set_nonempty_p (varpool_node_set set)
 845 {
 846   return !VEC_empty (varpool_node_ptr, set->nodes);
 847 }
 848
 849 /* Return true when function NODE is only called directly.
 850    i.e. it is not externally visible, address was not taken and
 851    it is not used in any other non-standard way.  */
 852
 853 static inline bool
 854 cgraph_only_called_directly_p (struct cgraph_node *node)
 855 {
 856   gcc_assert (!node->global.inlined_to);
 857   return (!node->needed && !node->address_taken
 858           && !node->reachable_from_other_partition
 859           && !DECL_STATIC_CONSTRUCTOR (node->decl)
 860           && !DECL_STATIC_DESTRUCTOR (node->decl)
 861           && !node->local.externally_visible);
 862 }
 863
 864 /* Return true when function NODE can be removed from callgraph
 865    if all direct calls are eliminated.  */
 866
 867 static inline bool
 868 cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node *node)
 869 {
 870   /* Extern inlines can always go, we will use the external definition.  */
 871   if (DECL_EXTERNAL (node->decl))
 872     return true;
 873   return !node->address_taken && cgraph_can_remove_if_no_direct_calls_and_refs_p (node);
 874 }
 875
 876 /* Return true when function NODE can be removed from callgraph
 877    if all direct calls are eliminated.  */
 878
 879 static inline bool
 880 varpool_can_remove_if_no_refs (struct varpool_node *node)
 881 {
 882   return (!node->force_output && !node->used_from_other_partition
 883           && (flag_toplevel_reorder || DECL_COMDAT (node->decl)
 884               || DECL_ARTIFICIAL (node->decl))
 885           && (DECL_COMDAT (node->decl) || !node->externally_visible));
 886 }
 887
 888 /* Return true when all references to VNODE must be visible in ipa_ref_list.
 889    i.e. if the variable is not externally visible or not used in some magic
 890    way (asm statement or such).
 891    The magic uses are all summarized in force_output flag.  */
 892
 893 static inline bool
 894 varpool_all_refs_explicit_p (struct varpool_node *vnode)
 895 {
 896   return (!vnode->externally_visible
 897           && !vnode->used_from_other_partition
 898           && !vnode->force_output);
 899 }
 900
 901 /* Constant pool accessor function.  */
 902 htab_t constant_pool_htab (void);
 903
 904 /* Return true when the edge E represents a direct recursion.  */
 905 static inline bool
 906 cgraph_edge_recursive_p (struct cgraph_edge *e)
 907 {
 908   if (e->caller->global.inlined_to)
 909     return e->caller->global.inlined_to->decl == e->callee->decl;
 910   else
 911     return e->caller->decl == e->callee->decl;
 912 }
 913
 914 /* FIXME: inappropriate dependency of cgraph on IPA.  */
 915 #include "ipa-ref-inline.h"
 916
 917 #endif  /* GCC_CGRAPH_H  */