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   /* Estimated size and time of the call statement.  */
 385   int call_stmt_size;
 386   int call_stmt_time;
 387   /* Depth of loop nest, 1 means no loop nest.  */
 388   unsigned short int loop_nest;
 389   /* Whether this edge was made direct by indirect inlining.  */
 390   unsigned int indirect_inlining_edge : 1;
 391   /* Whether this edge describes an indirect call with an undetermined
 392      callee.  */
 393   unsigned int indirect_unknown_callee : 1;
 394   /* Whether this edge is still a dangling  */
 395   /* True if the corresponding CALL stmt cannot be inlined.  */
 396   unsigned int call_stmt_cannot_inline_p : 1;
 397   /* Can this call throw externally?  */
 398   unsigned int can_throw_external : 1;
 399 };
 400
 401 #define CGRAPH_FREQ_BASE 1000
 402 #define CGRAPH_FREQ_MAX 100000
 403
 404 typedef struct cgraph_edge *cgraph_edge_p;
 405
 406 DEF_VEC_P(cgraph_edge_p);
 407 DEF_VEC_ALLOC_P(cgraph_edge_p,heap);
 408
 409 /* The varpool data structure.
 410    Each static variable decl has assigned varpool_node.  */
 411
 412 struct GTY((chain_next ("%h.next"), chain_prev ("%h.prev"))) varpool_node {
 413   tree decl;
 414   /* Pointer to the next function in varpool_nodes.  */
 415   struct varpool_node *next, *prev;
 416   /* Pointer to the next function in varpool_nodes_queue.  */
 417   struct varpool_node *next_needed, *prev_needed;
 418   /* For normal nodes a pointer to the first extra name alias.  For alias
 419      nodes a pointer to the normal node.  */
 420   struct varpool_node *extra_name;
 421   /* Circular list of nodes in the same comdat group if non-NULL.  */
 422   struct varpool_node *same_comdat_group;
 423   struct ipa_ref_list ref_list;
 424   /* File stream where this node is being written to.  */
 425   struct lto_file_decl_data * lto_file_data;
 426   PTR GTY ((skip)) aux;
 427   /* Ordering of all cgraph nodes.  */
 428   int order;
 429   enum ld_plugin_symbol_resolution resolution;
 430
 431   /* Set when function must be output - it is externally visible
 432      or its address is taken.  */
 433   unsigned needed : 1;
 434   /* Needed variables might become dead by optimization.  This flag
 435      forces the variable to be output even if it appears dead otherwise.  */
 436   unsigned force_output : 1;
 437   /* Set once the variable has been instantiated and its callee
 438      lists created.  */
 439   unsigned analyzed : 1;
 440   /* Set once it has been finalized so we consider it to be output.  */
 441   unsigned finalized : 1;
 442   /* Set when variable is scheduled to be assembled.  */
 443   unsigned output : 1;
 444   /* Set when function is visible by other units.  */
 445   unsigned externally_visible : 1;
 446   /* Set for aliases once they got through assemble_alias.  Also set for
 447      extra name aliases in varpool_extra_name_alias.  */
 448   unsigned alias : 1;
 449   /* Set when variable is used from other LTRANS partition.  */
 450   unsigned used_from_other_partition : 1;
 451   /* Set when variable is available in the other LTRANS partition.
 452      During WPA output it is used to mark nodes that are present in
 453      multiple partitions.  */
 454   unsigned in_other_partition : 1;
 455 };
 456
 457 /* Every top level asm statement is put into a cgraph_asm_node.  */
 458
 459 struct GTY(()) cgraph_asm_node {
 460   /* Next asm node.  */
 461   struct cgraph_asm_node *next;
 462   /* String for this asm node.  */
 463   tree asm_str;
 464   /* Ordering of all cgraph nodes.  */
 465   int order;
 466 };
 467
 468 extern GTY(()) struct cgraph_node *cgraph_nodes;
 469 extern GTY(()) int cgraph_n_nodes;
 470 extern GTY(()) int cgraph_max_uid;
 471 extern GTY(()) int cgraph_edge_max_uid;
 472 extern bool cgraph_global_info_ready;
 473 enum cgraph_state
 474 {
 475   /* Callgraph is being constructed.  It is safe to add new functions.  */
 476   CGRAPH_STATE_CONSTRUCTION,
 477   /* Callgraph is built and IPA passes are being run.  */
 478   CGRAPH_STATE_IPA,
 479   /* Callgraph is built and all functions are transformed to SSA form.  */
 480   CGRAPH_STATE_IPA_SSA,
 481   /* Functions are now ordered and being passed to RTL expanders.  */
 482   CGRAPH_STATE_EXPANSION,
 483   /* All cgraph expansion is done.  */
 484   CGRAPH_STATE_FINISHED
 485 };
 486 extern enum cgraph_state cgraph_state;
 487 extern bool cgraph_function_flags_ready;
 488 extern GTY(()) struct cgraph_node *cgraph_nodes_queue;
 489 extern GTY(()) struct cgraph_node *cgraph_new_nodes;
 490
 491 extern GTY(()) struct cgraph_asm_node *cgraph_asm_nodes;
 492 extern GTY(()) int cgraph_order;
 493
 494 /* In cgraph.c  */
 495 void dump_cgraph (FILE *);
 496 void debug_cgraph (void);
 497 void dump_cgraph_node (FILE *, struct cgraph_node *);
 498 void debug_cgraph_node (struct cgraph_node *);
 499 void cgraph_insert_node_to_hashtable (struct cgraph_node *node);
 500 void cgraph_remove_edge (struct cgraph_edge *);
 501 void cgraph_remove_node (struct cgraph_node *);
 502 void cgraph_remove_node_and_inline_clones (struct cgraph_node *);
 503 void cgraph_release_function_body (struct cgraph_node *);
 504 void cgraph_node_remove_callees (struct cgraph_node *node);
 505 struct cgraph_edge *cgraph_create_edge (struct cgraph_node *,
 506                                         struct cgraph_node *,
 507                                         gimple, gcov_type, int, int);
 508 struct cgraph_edge *cgraph_create_indirect_edge (struct cgraph_node *, gimple,
 509                                                  int, gcov_type, int, int);
 510 struct cgraph_indirect_call_info *cgraph_allocate_init_indirect_info (void);
 511 struct cgraph_node * cgraph_get_node (const_tree);
 512 struct cgraph_node * cgraph_get_node_or_alias (const_tree);
 513 struct cgraph_node * cgraph_create_node (tree);
 514 struct cgraph_node * cgraph_get_create_node (tree);
 515 struct cgraph_node * cgraph_same_body_alias (struct cgraph_node *, tree, tree);
 516 struct cgraph_node * cgraph_add_thunk (struct cgraph_node *, tree, tree, bool, HOST_WIDE_INT,
 517                                        HOST_WIDE_INT, tree, tree);
 518 void cgraph_remove_same_body_alias (struct cgraph_node *);
 519 struct cgraph_node *cgraph_node_for_asm (tree);
 520 struct cgraph_edge *cgraph_edge (struct cgraph_node *, gimple);
 521 void cgraph_set_call_stmt (struct cgraph_edge *, gimple);
 522 void cgraph_set_call_stmt_including_clones (struct cgraph_node *, gimple, gimple);
 523 void cgraph_create_edge_including_clones (struct cgraph_node *,
 524                                           struct cgraph_node *,
 525                                           gimple, gimple, gcov_type, int, int,
 526                                           cgraph_inline_failed_t);
 527 void cgraph_update_edges_for_call_stmt (gimple, tree, gimple);
 528 struct cgraph_local_info *cgraph_local_info (tree);
 529 struct cgraph_global_info *cgraph_global_info (tree);
 530 struct cgraph_rtl_info *cgraph_rtl_info (tree);
 531 const char * cgraph_node_name (struct cgraph_node *);
 532 struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *,
 533                                         struct cgraph_node *, gimple,
 534                                         unsigned, gcov_type, int, int, bool);
 535 struct cgraph_node * cgraph_clone_node (struct cgraph_node *, tree, gcov_type, int,
 536                                         int, bool, VEC(cgraph_edge_p,heap) *);
 537
 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                               HOST_WIDE_INT);
 541
 542 struct cgraph_asm_node *cgraph_add_asm_node (tree);
 543
 544 bool cgraph_function_possibly_inlined_p (tree);
 545 void cgraph_unnest_node (struct cgraph_node *);
 546
 547 enum availability cgraph_function_body_availability (struct cgraph_node *);
 548 void cgraph_add_new_function (tree, bool);
 549 const char* cgraph_inline_failed_string (cgraph_inline_failed_t);
 550 struct cgraph_node * cgraph_create_virtual_clone (struct cgraph_node *old_node,
 551                                                   VEC(cgraph_edge_p,heap)*,
 552                                                   VEC(ipa_replace_map_p,gc)* tree_map,
 553                                                   bitmap args_to_skip,
 554                                                   const char *clone_name);
 555
 556 void cgraph_set_nothrow_flag (struct cgraph_node *, bool);
 557 void cgraph_set_const_flag (struct cgraph_node *, bool, bool);
 558 void cgraph_set_pure_flag (struct cgraph_node *, bool, bool);
 559 tree clone_function_name (tree decl, const char *);
 560 bool cgraph_node_cannot_return (struct cgraph_node *);
 561 bool cgraph_edge_cannot_lead_to_return (struct cgraph_edge *);
 562 bool cgraph_will_be_removed_from_program_if_no_direct_calls
 563   (struct cgraph_node *node);
 564 bool cgraph_can_remove_if_no_direct_calls_and_refs_p
 565   (struct cgraph_node *node);
 566 bool resolution_used_from_other_file_p (enum ld_plugin_symbol_resolution resolution);
 567 bool cgraph_used_from_object_file_p (struct cgraph_node *node);
 568 bool varpool_used_from_object_file_p (struct varpool_node *node);
 569
 570 /* In cgraphunit.c  */
 571 extern FILE *cgraph_dump_file;
 572 void cgraph_finalize_function (tree, bool);
 573 void cgraph_mark_if_needed (tree);
 574 void cgraph_analyze_function (struct cgraph_node *);
 575 void cgraph_finalize_compilation_unit (void);
 576 void cgraph_optimize (void);
 577 void cgraph_mark_needed_node (struct cgraph_node *);
 578 void cgraph_mark_address_taken_node (struct cgraph_node *);
 579 void cgraph_mark_reachable_node (struct cgraph_node *);
 580 bool cgraph_inline_p (struct cgraph_edge *, cgraph_inline_failed_t *reason);
 581 bool cgraph_preserve_function_body_p (tree);
 582 void verify_cgraph (void);
 583 void verify_cgraph_node (struct cgraph_node *);
 584 void cgraph_build_static_cdtor (char which, tree body, int priority);
 585 void cgraph_reset_static_var_maps (void);
 586 void init_cgraph (void);
 587 struct cgraph_node *cgraph_function_versioning (struct cgraph_node *,
 588                                                 VEC(cgraph_edge_p,heap)*,
 589                                                 VEC(ipa_replace_map_p,gc)*,
 590                                                 bitmap, bitmap, basic_block,
 591                                                 const char *);
 592 void tree_function_versioning (tree, tree, VEC (ipa_replace_map_p,gc)*, bool, bitmap,
 593                                bitmap, basic_block);
 594 void record_references_in_initializer (tree, bool);
 595 bool cgraph_process_new_functions (void);
 596
 597 bool cgraph_decide_is_function_needed (struct cgraph_node *, tree);
 598
 599 typedef void (*cgraph_edge_hook)(struct cgraph_edge *, void *);
 600 typedef void (*cgraph_node_hook)(struct cgraph_node *, void *);
 601 typedef void (*cgraph_2edge_hook)(struct cgraph_edge *, struct cgraph_edge *,
 602                                   void *);
 603 typedef void (*cgraph_2node_hook)(struct cgraph_node *, struct cgraph_node *,
 604                                   void *);
 605 struct cgraph_edge_hook_list;
 606 struct cgraph_node_hook_list;
 607 struct cgraph_2edge_hook_list;
 608 struct cgraph_2node_hook_list;
 609 struct cgraph_edge_hook_list *cgraph_add_edge_removal_hook (cgraph_edge_hook, void *);
 610 void cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *);
 611 struct cgraph_node_hook_list *cgraph_add_node_removal_hook (cgraph_node_hook,
 612                                                             void *);
 613 void cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *);
 614 struct cgraph_node_hook_list *cgraph_add_function_insertion_hook (cgraph_node_hook,
 615                                                                   void *);
 616 void cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *);
 617 void cgraph_call_function_insertion_hooks (struct cgraph_node *node);
 618 struct cgraph_2edge_hook_list *cgraph_add_edge_duplication_hook (cgraph_2edge_hook, void *);
 619 void cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *);
 620 struct cgraph_2node_hook_list *cgraph_add_node_duplication_hook (cgraph_2node_hook, void *);
 621 void cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *);
 622 void cgraph_materialize_all_clones (void);
 623 gimple cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge *);
 624 bool cgraph_propagate_frequency (struct cgraph_node *node);
 625 /* In cgraphbuild.c  */
 626 unsigned int rebuild_cgraph_edges (void);
 627 void cgraph_rebuild_references (void);
 628 void reset_inline_failed (struct cgraph_node *);
 629 int compute_call_stmt_bb_frequency (tree, basic_block bb);
 630
 631 /* In ipa.c  */
 632 bool cgraph_remove_unreachable_nodes (bool, FILE *);
 633 int cgraph_postorder (struct cgraph_node **);
 634 cgraph_node_set cgraph_node_set_new (void);
 635 cgraph_node_set_iterator cgraph_node_set_find (cgraph_node_set,
 636                                                struct cgraph_node *);
 637 void cgraph_node_set_add (cgraph_node_set, struct cgraph_node *);
 638 void cgraph_node_set_remove (cgraph_node_set, struct cgraph_node *);
 639 void dump_cgraph_node_set (FILE *, cgraph_node_set);
 640 void debug_cgraph_node_set (cgraph_node_set);
 641
 642 varpool_node_set varpool_node_set_new (void);
 643 varpool_node_set_iterator varpool_node_set_find (varpool_node_set,
 644                                                struct varpool_node *);
 645 void varpool_node_set_add (varpool_node_set, struct varpool_node *);
 646 void varpool_node_set_remove (varpool_node_set, struct varpool_node *);
 647 void dump_varpool_node_set (FILE *, varpool_node_set);
 648 void debug_varpool_node_set (varpool_node_set);
 649 void ipa_discover_readonly_nonaddressable_vars (void);
 650 bool cgraph_comdat_can_be_unshared_p (struct cgraph_node *);
 651
 652 /* In predict.c  */
 653 bool cgraph_maybe_hot_edge_p (struct cgraph_edge *e);
 654 bool cgraph_optimize_for_size_p (struct cgraph_node *);
 655
 656 /* In varpool.c  */
 657 extern GTY(()) struct varpool_node *varpool_nodes_queue;
 658 extern GTY(()) struct varpool_node *varpool_nodes;
 659
 660 struct varpool_node *varpool_node (tree);
 661 struct varpool_node *varpool_node_for_asm (tree asmname);
 662 void varpool_mark_needed_node (struct varpool_node *);
 663 void debug_varpool (void);
 664 void dump_varpool (FILE *);
 665 void dump_varpool_node (FILE *, struct varpool_node *);
 666
 667 void varpool_finalize_decl (tree);
 668 bool decide_is_variable_needed (struct varpool_node *, tree);
 669 enum availability cgraph_variable_initializer_availability (struct varpool_node *);
 670 void cgraph_make_decl_local (tree);
 671 void cgraph_make_node_local (struct cgraph_node *);
 672 bool cgraph_node_can_be_local_p (struct cgraph_node *);
 673
 674
 675 struct varpool_node * varpool_get_node (const_tree decl);
 676 void varpool_remove_node (struct varpool_node *node);
 677 void varpool_finalize_named_section_flags (struct varpool_node *node);
 678 bool varpool_assemble_pending_decls (void);
 679 bool varpool_assemble_decl (struct varpool_node *node);
 680 bool varpool_analyze_pending_decls (void);
 681 void varpool_remove_unreferenced_decls (void);
 682 void varpool_empty_needed_queue (void);
 683 struct varpool_node * varpool_extra_name_alias (tree, tree);
 684 const char * varpool_node_name (struct varpool_node *node);
 685 void varpool_reset_queue (void);
 686 bool const_value_known_p (tree);
 687
 688 /* Walk all reachable static variables.  */
 689 #define FOR_EACH_STATIC_VARIABLE(node) \
 690    for ((node) = varpool_nodes_queue; (node); (node) = (node)->next_needed)
 691
 692 /* Return first reachable static variable with initializer.  */
 693 static inline struct varpool_node *
 694 varpool_first_static_initializer (void)
 695 {
 696   struct varpool_node *node;
 697   for (node = varpool_nodes_queue; node; node = node->next_needed)
 698     {
 699       gcc_checking_assert (TREE_CODE (node->decl) == VAR_DECL);
 700       if (DECL_INITIAL (node->decl))
 701         return node;
 702     }
 703   return NULL;
 704 }
 705
 706 /* Return next reachable static variable with initializer after NODE.  */
 707 static inline struct varpool_node *
 708 varpool_next_static_initializer (struct varpool_node *node)
 709 {
 710   for (node = node->next_needed; node; node = node->next_needed)
 711     {
 712       gcc_checking_assert (TREE_CODE (node->decl) == VAR_DECL);
 713       if (DECL_INITIAL (node->decl))
 714         return node;
 715     }
 716   return NULL;
 717 }
 718
 719 /* Walk all static variables with initializer set.  */
 720 #define FOR_EACH_STATIC_INITIALIZER(node) \
 721    for ((node) = varpool_first_static_initializer (); (node); \
 722         (node) = varpool_next_static_initializer (node))
 723
 724 /* In ipa-inline.c  */
 725 void cgraph_clone_inlined_nodes (struct cgraph_edge *, bool, bool);
 726 void compute_inline_parameters (struct cgraph_node *);
 727 cgraph_inline_failed_t cgraph_edge_inlinable_p (struct cgraph_edge *);
 728
 729 /* Create a new static variable of type TYPE.  */
 730 tree add_new_static_var (tree type);
 731
 732 /* Return true if iterator CSI points to nothing.  */
 733 static inline bool
 734 csi_end_p (cgraph_node_set_iterator csi)
 735 {
 736   return csi.index >= VEC_length (cgraph_node_ptr, csi.set->nodes);
 737 }
 738
 739 /* Advance iterator CSI.  */
 740 static inline void
 741 csi_next (cgraph_node_set_iterator *csi)
 742 {
 743   csi->index++;
 744 }
 745
 746 /* Return the node pointed to by CSI.  */
 747 static inline struct cgraph_node *
 748 csi_node (cgraph_node_set_iterator csi)
 749 {
 750   return VEC_index (cgraph_node_ptr, csi.set->nodes, csi.index);
 751 }
 752
 753 /* Return an iterator to the first node in SET.  */
 754 static inline cgraph_node_set_iterator
 755 csi_start (cgraph_node_set set)
 756 {
 757   cgraph_node_set_iterator csi;
 758
 759   csi.set = set;
 760   csi.index = 0;
 761   return csi;
 762 }
 763
 764 /* Return true if SET contains NODE.  */
 765 static inline bool
 766 cgraph_node_in_set_p (struct cgraph_node *node, cgraph_node_set set)
 767 {
 768   cgraph_node_set_iterator csi;
 769   csi = cgraph_node_set_find (set, node);
 770   return !csi_end_p (csi);
 771 }
 772
 773 /* Return number of nodes in SET.  */
 774 static inline size_t
 775 cgraph_node_set_size (cgraph_node_set set)
 776 {
 777   return htab_elements (set->hashtab);
 778 }
 779
 780 /* Return true if iterator VSI points to nothing.  */
 781 static inline bool
 782 vsi_end_p (varpool_node_set_iterator vsi)
 783 {
 784   return vsi.index >= VEC_length (varpool_node_ptr, vsi.set->nodes);
 785 }
 786
 787 /* Advance iterator VSI.  */
 788 static inline void
 789 vsi_next (varpool_node_set_iterator *vsi)
 790 {
 791   vsi->index++;
 792 }
 793
 794 /* Return the node pointed to by VSI.  */
 795 static inline struct varpool_node *
 796 vsi_node (varpool_node_set_iterator vsi)
 797 {
 798   return VEC_index (varpool_node_ptr, vsi.set->nodes, vsi.index);
 799 }
 800
 801 /* Return an iterator to the first node in SET.  */
 802 static inline varpool_node_set_iterator
 803 vsi_start (varpool_node_set set)
 804 {
 805   varpool_node_set_iterator vsi;
 806
 807   vsi.set = set;
 808   vsi.index = 0;
 809   return vsi;
 810 }
 811
 812 /* Return true if SET contains NODE.  */
 813 static inline bool
 814 varpool_node_in_set_p (struct varpool_node *node, varpool_node_set set)
 815 {
 816   varpool_node_set_iterator vsi;
 817   vsi = varpool_node_set_find (set, node);
 818   return !vsi_end_p (vsi);
 819 }
 820
 821 /* Return number of nodes in SET.  */
 822 static inline size_t
 823 varpool_node_set_size (varpool_node_set set)
 824 {
 825   return htab_elements (set->hashtab);
 826 }
 827
 828 /* Uniquize all constants that appear in memory.
 829    Each constant in memory thus far output is recorded
 830    in `const_desc_table'.  */
 831
 832 struct GTY(()) constant_descriptor_tree {
 833   /* A MEM for the constant.  */
 834   rtx rtl;
 835
 836   /* The value of the constant.  */
 837   tree value;
 838
 839   /* Hash of value.  Computing the hash from value each time
 840      hashfn is called can't work properly, as that means recursive
 841      use of the hash table during hash table expansion.  */
 842   hashval_t hash;
 843 };
 844
 845 /* Return true if set is nonempty.  */
 846 static inline bool
 847 cgraph_node_set_nonempty_p (cgraph_node_set set)
 848 {
 849   return !VEC_empty (cgraph_node_ptr, set->nodes);
 850 }
 851
 852 /* Return true if set is nonempty.  */
 853 static inline bool
 854 varpool_node_set_nonempty_p (varpool_node_set set)
 855 {
 856   return !VEC_empty (varpool_node_ptr, set->nodes);
 857 }
 858
 859 /* Return true when function NODE is only called directly.
 860    i.e. it is not externally visible, address was not taken and
 861    it is not used in any other non-standard way.  */
 862
 863 static inline bool
 864 cgraph_only_called_directly_p (struct cgraph_node *node)
 865 {
 866   gcc_assert (!node->global.inlined_to);
 867   return (!node->needed && !node->address_taken
 868           && !node->reachable_from_other_partition
 869           && !DECL_STATIC_CONSTRUCTOR (node->decl)
 870           && !DECL_STATIC_DESTRUCTOR (node->decl)
 871           && !node->local.externally_visible);
 872 }
 873
 874 /* Return true when function NODE can be removed from callgraph
 875    if all direct calls are eliminated.  */
 876
 877 static inline bool
 878 cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node *node)
 879 {
 880   /* Extern inlines can always go, we will use the external definition.  */
 881   if (DECL_EXTERNAL (node->decl))
 882     return true;
 883   return !node->address_taken && cgraph_can_remove_if_no_direct_calls_and_refs_p (node);
 884 }
 885
 886 /* Return true when function NODE can be removed from callgraph
 887    if all direct calls are eliminated.  */
 888
 889 static inline bool
 890 varpool_can_remove_if_no_refs (struct varpool_node *node)
 891 {
 892   return (!node->force_output && !node->used_from_other_partition
 893           && (flag_toplevel_reorder || DECL_COMDAT (node->decl)
 894               || DECL_ARTIFICIAL (node->decl))
 895           && (DECL_COMDAT (node->decl) || !node->externally_visible));
 896 }
 897
 898 /* Return true when all references to VNODE must be visible in ipa_ref_list.
 899    i.e. if the variable is not externally visible or not used in some magic
 900    way (asm statement or such).
 901    The magic uses are all summarized in force_output flag.  */
 902
 903 static inline bool
 904 varpool_all_refs_explicit_p (struct varpool_node *vnode)
 905 {
 906   return (!vnode->externally_visible
 907           && !vnode->used_from_other_partition
 908           && !vnode->force_output);
 909 }
 910
 911 /* Constant pool accessor function.  */
 912 htab_t constant_pool_htab (void);
 913
 914 /* Return true when the edge E represents a direct recursion.  */
 915 static inline bool
 916 cgraph_edge_recursive_p (struct cgraph_edge *e)
 917 {
 918   if (e->caller->global.inlined_to)
 919     return e->caller->global.inlined_to->decl == e->callee->decl;
 920   else
 921     return e->caller->decl == e->callee->decl;
 922 }
 923
 924 /* FIXME: inappropriate dependency of cgraph on IPA.  */
 925 #include "ipa-ref-inline.h"
 926
 927 #endif  /* GCC_CGRAPH_H  */