gcc/cgraph.h

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