gcc/cgraph.h

   1 /* Callgraph handling code.
   2    Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009
   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 #include "tree.h"
  25 #include "basic-block.h"
  26
  27 enum availability
  28 {
  29   /* Not yet set by cgraph_function_body_availability.  */
  30   AVAIL_UNSET,
  31   /* Function body/variable initializer is unknown.  */
  32   AVAIL_NOT_AVAILABLE,
  33   /* Function body/variable initializer is known but might be replaced
  34      by a different one from other compilation unit and thus needs to
  35      be dealt with a care.  Like AVAIL_NOT_AVAILABLE it can have
  36      arbitrary side effects on escaping variables and functions, while
  37      like AVAILABLE it might access static variables.  */
  38   AVAIL_OVERWRITABLE,
  39   /* Function body/variable initializer is known and will be used in final
  40      program.  */
  41   AVAIL_AVAILABLE,
  42   /* Function body/variable initializer is known and all it's uses are explicitly
  43      visible within current unit (ie it's address is never taken and it is not
  44      exported to other units).
  45      Currently used only for functions.  */
  46   AVAIL_LOCAL
  47 };
  48
  49 /* This is the information that is put into the cgraph local structure
  50    to recover a function.  */
  51 struct lto_file_decl_data;
  52
  53 extern const char * const cgraph_availability_names[];
  54
  55 /* Function inlining information.  */
  56
  57 struct GTY(()) inline_summary
  58 {
  59   /* Estimated stack frame consumption by the function.  */
  60   HOST_WIDE_INT estimated_self_stack_size;
  61
  62   /* Size of the function body.  */
  63   int self_size;
  64   /* How many instructions are likely going to disappear after inlining.  */
  65   int size_inlining_benefit;
  66   /* Estimated time spent executing the function body.  */
  67   int self_time;
  68   /* How much time is going to be saved by inlining.  */
  69   int time_inlining_benefit;
  70 };
  71
  72 /* Information about thunk, used only for same body aliases.  */
  73
  74 struct GTY(()) cgraph_thunk_info {
  75   /* Information about the thunk.  */
  76   HOST_WIDE_INT fixed_offset;
  77   HOST_WIDE_INT virtual_value;
  78   tree alias;
  79   bool this_adjusting;
  80   bool virtual_offset_p;
  81   /* Set to true when alias node is thunk.  */
  82   bool thunk_p;
  83 };
  84
  85 /* Information about the function collected locally.
  86    Available after function is analyzed.  */
  87
  88 struct GTY(()) cgraph_local_info {
  89   /* File stream where this node is being written to.  */
  90   struct lto_file_decl_data * GTY ((skip)) lto_file_data;
  91
  92   struct inline_summary inline_summary;
  93
  94   /* Set when function function is visible in current compilation unit only
  95      and its address is never taken.  */
  96   unsigned local : 1;
  97
  98   /* Set when function is visible by other units.  */
  99   unsigned externally_visible : 1;
 100
 101   /* Set once it has been finalized so we consider it to be output.  */
 102   unsigned finalized : 1;
 103
 104   /* False when there something makes inlining impossible (such as va_arg).  */
 105   unsigned inlinable : 1;
 106
 107   /* True when function should be inlined independently on its size.  */
 108   unsigned disregard_inline_limits : 1;
 109
 110   /* True when the function has been originally extern inline, but it is
 111      redefined now.  */
 112   unsigned redefined_extern_inline : 1;
 113
 114   /* True if statics_read_for_function and
 115      statics_written_for_function contain valid data.  */
 116   unsigned for_functions_valid : 1;
 117
 118   /* True if the function is going to be emitted in some other translation
 119      unit, referenced from vtable.  */
 120   unsigned vtable_method : 1;
 121 };
 122
 123 /* Information about the function that needs to be computed globally
 124    once compilation is finished.  Available only with -funit-at-a-time.  */
 125
 126 struct GTY(()) cgraph_global_info {
 127   /* Estimated stack frame consumption by the function.  */
 128   HOST_WIDE_INT estimated_stack_size;
 129   /* Expected offset of the stack frame of inlined function.  */
 130   HOST_WIDE_INT stack_frame_offset;
 131
 132   /* For inline clones this points to the function they will be
 133      inlined into.  */
 134   struct cgraph_node *inlined_to;
 135
 136   /* Estimated size of the function after inlining.  */
 137   int time;
 138   int size;
 139
 140   /* Estimated growth after inlining.  INT_MIN if not computed.  */
 141   int estimated_growth;
 142
 143   /* Set iff the function has been inlined at least once.  */
 144   bool inlined;
 145 };
 146
 147 /* Information about the function that is propagated by the RTL backend.
 148    Available only for functions that has been already assembled.  */
 149
 150 struct GTY(()) cgraph_rtl_info {
 151    unsigned int preferred_incoming_stack_boundary;
 152 };
 153
 154 /* Represent which DECL tree (or reference to such tree)
 155    will be replaced by another tree while versioning.  */
 156 struct GTY(()) ipa_replace_map
 157 {
 158   /* The tree that will be replaced.  */
 159   tree old_tree;
 160   /* The new (replacing) tree.  */
 161   tree new_tree;
 162   /* True when a substitution should be done, false otherwise.  */
 163   bool replace_p;
 164   /* True when we replace a reference to old_tree.  */
 165   bool ref_p;
 166 };
 167 typedef struct ipa_replace_map *ipa_replace_map_p;
 168 DEF_VEC_P(ipa_replace_map_p);
 169 DEF_VEC_ALLOC_P(ipa_replace_map_p,gc);
 170
 171 struct GTY(()) cgraph_clone_info
 172 {
 173   VEC(ipa_replace_map_p,gc)* tree_map;
 174   bitmap args_to_skip;
 175   bitmap combined_args_to_skip;
 176 };
 177
 178 /* The cgraph data structure.
 179    Each function decl has assigned cgraph_node listing callees and callers.  */
 180
 181 struct GTY((chain_next ("%h.next"), chain_prev ("%h.previous"))) cgraph_node {
 182   tree decl;
 183   struct cgraph_edge *callees;
 184   struct cgraph_edge *callers;
 185   struct cgraph_node *next;
 186   struct cgraph_node *previous;
 187   /* For nested functions points to function the node is nested in.  */
 188   struct cgraph_node *origin;
 189   /* Points to first nested function, if any.  */
 190   struct cgraph_node *nested;
 191   /* Pointer to the next function with same origin, if any.  */
 192   struct cgraph_node *next_nested;
 193   /* Pointer to the next function in cgraph_nodes_queue.  */
 194   struct cgraph_node *next_needed;
 195   /* Pointer to the next clone.  */
 196   struct cgraph_node *next_sibling_clone;
 197   struct cgraph_node *prev_sibling_clone;
 198   struct cgraph_node *clones;
 199   struct cgraph_node *clone_of;
 200   /* For normal nodes pointer to the list of alias and thunk nodes,
 201      in alias/thunk nodes pointer to the normal node.  */
 202   struct cgraph_node *same_body;
 203   /* For functions with many calls sites it holds map from call expression
 204      to the edge to speed up cgraph_edge function.  */
 205   htab_t GTY((param_is (struct cgraph_edge))) call_site_hash;
 206
 207   PTR GTY ((skip)) aux;
 208
 209   /* Interprocedural passes scheduled to have their transform functions
 210      applied next time we execute local pass on them.  We maintain it
 211      per-function in order to allow IPA passes to introduce new functions.  */
 212   VEC(ipa_opt_pass,heap) * GTY((skip)) ipa_transforms_to_apply;
 213
 214   struct cgraph_local_info local;
 215   struct cgraph_global_info global;
 216   struct cgraph_rtl_info rtl;
 217   struct cgraph_clone_info clone;
 218   struct cgraph_thunk_info thunk;
 219
 220   /* Expected number of executions: calculated in profile.c.  */
 221   gcov_type count;
 222   /* Unique id of the node.  */
 223   int uid;
 224   /* Ordering of all cgraph nodes.  */
 225   int order;
 226
 227   /* unique id for profiling. pid is not suitable because of different
 228      number of cfg nodes with -fprofile-generate and -fprofile-use */
 229   int pid;
 230
 231   /* Set when function must be output for some reason.  The primary
 232      use of this flag is to mark functions needed to be output for
 233      non-standard reason.  Functions that are externally visible
 234      or reachable from functions needed to be output are marked
 235      by specialized flags.  */
 236   unsigned needed : 1;
 237   /* Set when function has address taken.
 238      In current implementation it imply needed flag. */
 239   unsigned address_taken : 1;
 240   /* Set when decl is an abstract function pointed to by the
 241      ABSTRACT_DECL_ORIGIN of a reachable function.  */
 242   unsigned abstract_and_needed : 1;
 243   /* Set when function is reachable by call from other function
 244      that is either reachable or needed.
 245      This flag is computed at original cgraph construction and then
 246      updated in cgraph_remove_unreachable_nodes.  Note that after
 247      cgraph_remove_unreachable_nodes cgraph still can contain unreachable
 248      nodes when they are needed for virtual clone instantiation.  */
 249   unsigned reachable : 1;
 250   /* Set once the function is lowered (i.e. its CFG is built).  */
 251   unsigned lowered : 1;
 252   /* Set once the function has been instantiated and its callee
 253      lists created.  */
 254   unsigned analyzed : 1;
 255   /* Set when function is scheduled to be processed by local passes.  */
 256   unsigned process : 1;
 257   /* Set for aliases once they got through assemble_alias.  */
 258   unsigned alias : 1;
 259   /* Set for nodes that was constructed and finalized by frontend.  */
 260   unsigned finalized_by_frontend : 1;
 261   /* Set for alias and thunk nodes, same_body points to the node they are alias
 262      of and they are linked through the next/previous pointers.  */
 263   unsigned same_body_alias : 1;
 264 };
 265
 266 typedef struct cgraph_node *cgraph_node_ptr;
 267
 268 DEF_VEC_P(cgraph_node_ptr);
 269 DEF_VEC_ALLOC_P(cgraph_node_ptr,heap);
 270 DEF_VEC_ALLOC_P(cgraph_node_ptr,gc);
 271
 272 /* A cgraph node set is a collection of cgraph nodes.  A cgraph node
 273    can appear in multiple sets.  */
 274 struct GTY(()) cgraph_node_set_def
 275 {
 276   htab_t GTY((param_is (struct cgraph_node_set_element_def))) hashtab;
 277   VEC(cgraph_node_ptr, gc) *nodes;
 278   PTR GTY ((skip)) aux;
 279 };
 280
 281 typedef struct cgraph_node_set_def *cgraph_node_set;
 282
 283 DEF_VEC_P(cgraph_node_set);
 284 DEF_VEC_ALLOC_P(cgraph_node_set,gc);
 285 DEF_VEC_ALLOC_P(cgraph_node_set,heap);
 286
 287 /* A cgraph node set element contains an index in the vector of nodes in
 288    the set.  */
 289 struct GTY(()) cgraph_node_set_element_def
 290 {
 291   struct cgraph_node *node;
 292   HOST_WIDE_INT index;
 293 };
 294
 295 typedef struct cgraph_node_set_element_def *cgraph_node_set_element;
 296 typedef const struct cgraph_node_set_element_def *const_cgraph_node_set_element;
 297
 298 /* Iterator structure for cgraph node sets.  */
 299 typedef struct
 300 {
 301   cgraph_node_set set;
 302   unsigned index;
 303 } cgraph_node_set_iterator;
 304
 305 #define DEFCIFCODE(code, string)        CIF_ ## code,
 306 /* Reasons for inlining failures.  */
 307 typedef enum {
 308 #include "cif-code.def"
 309   CIF_N_REASONS
 310 } cgraph_inline_failed_t;
 311
 312 struct GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"))) cgraph_edge {
 313   /* Expected number of executions: calculated in profile.c.  */
 314   gcov_type count;
 315   struct cgraph_node *caller;
 316   struct cgraph_node *callee;
 317   struct cgraph_edge *prev_caller;
 318   struct cgraph_edge *next_caller;
 319   struct cgraph_edge *prev_callee;
 320   struct cgraph_edge *next_callee;
 321   gimple call_stmt;
 322   PTR GTY ((skip (""))) aux;
 323   /* When equal to CIF_OK, inline this call.  Otherwise, points to the
 324      explanation why function was not inlined.  */
 325   cgraph_inline_failed_t inline_failed;
 326   /* The stmt_uid of call_stmt.  This is used by LTO to recover the call_stmt
 327      when the function is serialized in.  */
 328   unsigned int lto_stmt_uid;
 329   /* Expected frequency of executions within the function.
 330      When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
 331      per function call.  The range is 0 to CGRAPH_FREQ_MAX.  */
 332   int frequency;
 333   /* Unique id of the edge.  */
 334   int uid;
 335   /* Depth of loop nest, 1 means no loop nest.  */
 336   unsigned short int loop_nest;
 337   /* Whether this edge describes a call that was originally indirect.  */
 338   unsigned int indirect_call : 1;
 339   /* True if the corresponding CALL stmt cannot be inlined.  */
 340   unsigned int call_stmt_cannot_inline_p : 1;
 341   /* Can this call throw externally?  */
 342   unsigned int can_throw_external : 1;
 343 };
 344
 345 #define CGRAPH_FREQ_BASE 1000
 346 #define CGRAPH_FREQ_MAX 100000
 347
 348 typedef struct cgraph_edge *cgraph_edge_p;
 349
 350 DEF_VEC_P(cgraph_edge_p);
 351 DEF_VEC_ALLOC_P(cgraph_edge_p,heap);
 352
 353 /* The varpool data structure.
 354    Each static variable decl has assigned varpool_node.  */
 355
 356 struct GTY((chain_next ("%h.next"))) varpool_node {
 357   tree decl;
 358   /* Pointer to the next function in varpool_nodes.  */
 359   struct varpool_node *next;
 360   /* Pointer to the next function in varpool_nodes_queue.  */
 361   struct varpool_node *next_needed;
 362   /* Ordering of all cgraph nodes.  */
 363   int order;
 364
 365   /* Set when function must be output - it is externally visible
 366      or its address is taken.  */
 367   unsigned needed : 1;
 368   /* Needed variables might become dead by optimization.  This flag
 369      forces the variable to be output even if it appears dead otherwise.  */
 370   unsigned force_output : 1;
 371   /* Set once the variable has been instantiated and its callee
 372      lists created.  */
 373   unsigned analyzed : 1;
 374   /* Set once it has been finalized so we consider it to be output.  */
 375   unsigned finalized : 1;
 376   /* Set when variable is scheduled to be assembled.  */
 377   unsigned output : 1;
 378   /* Set when function is visible by other units.  */
 379   unsigned externally_visible : 1;
 380   /* Set for aliases once they got through assemble_alias.  */
 381   unsigned alias : 1;
 382 };
 383
 384 /* Every top level asm statement is put into a cgraph_asm_node.  */
 385
 386 struct GTY(()) cgraph_asm_node {
 387   /* Next asm node.  */
 388   struct cgraph_asm_node *next;
 389   /* String for this asm node.  */
 390   tree asm_str;
 391   /* Ordering of all cgraph nodes.  */
 392   int order;
 393 };
 394
 395 extern GTY(()) struct cgraph_node *cgraph_nodes;
 396 extern GTY(()) int cgraph_n_nodes;
 397 extern GTY(()) int cgraph_max_uid;
 398 extern GTY(()) int cgraph_edge_max_uid;
 399 extern GTY(()) int cgraph_max_pid;
 400 extern bool cgraph_global_info_ready;
 401 enum cgraph_state
 402 {
 403   /* Callgraph is being constructed.  It is safe to add new functions.  */
 404   CGRAPH_STATE_CONSTRUCTION,
 405   /* Callgraph is built and IPA passes are being run.  */
 406   CGRAPH_STATE_IPA,
 407   /* Callgraph is built and all functions are transformed to SSA form.  */
 408   CGRAPH_STATE_IPA_SSA,
 409   /* Functions are now ordered and being passed to RTL expanders.  */
 410   CGRAPH_STATE_EXPANSION,
 411   /* All cgraph expansion is done.  */
 412   CGRAPH_STATE_FINISHED
 413 };
 414 extern enum cgraph_state cgraph_state;
 415 extern bool cgraph_function_flags_ready;
 416 extern GTY(()) struct cgraph_node *cgraph_nodes_queue;
 417 extern GTY(()) struct cgraph_node *cgraph_new_nodes;
 418
 419 extern GTY(()) struct cgraph_asm_node *cgraph_asm_nodes;
 420 extern GTY(()) int cgraph_order;
 421
 422 /* In cgraph.c  */
 423 void dump_cgraph (FILE *);
 424 void debug_cgraph (void);
 425 void dump_cgraph_node (FILE *, struct cgraph_node *);
 426 void debug_cgraph_node (struct cgraph_node *);
 427 void cgraph_insert_node_to_hashtable (struct cgraph_node *node);
 428 void cgraph_remove_edge (struct cgraph_edge *);
 429 void cgraph_remove_node (struct cgraph_node *);
 430 void cgraph_remove_node_and_inline_clones (struct cgraph_node *);
 431 void cgraph_release_function_body (struct cgraph_node *);
 432 void cgraph_node_remove_callees (struct cgraph_node *node);
 433 struct cgraph_edge *cgraph_create_edge (struct cgraph_node *,
 434                                         struct cgraph_node *,
 435                                         gimple, gcov_type, int, int);
 436
 437 struct cgraph_node * cgraph_get_node (tree);
 438 struct cgraph_node *cgraph_node (tree);
 439 bool cgraph_same_body_alias (tree, tree);
 440 void cgraph_add_thunk (tree, tree, bool, HOST_WIDE_INT, HOST_WIDE_INT, tree, tree);
 441 void cgraph_remove_same_body_alias (struct cgraph_node *);
 442 struct cgraph_node *cgraph_node_for_asm (tree);
 443 struct cgraph_edge *cgraph_edge (struct cgraph_node *, gimple);
 444 void cgraph_set_call_stmt (struct cgraph_edge *, gimple);
 445 void cgraph_set_call_stmt_including_clones (struct cgraph_node *, gimple, gimple);
 446 void cgraph_create_edge_including_clones (struct cgraph_node *,
 447                                           struct cgraph_node *,
 448                                           gimple, gimple, gcov_type, int, int,
 449                                           cgraph_inline_failed_t);
 450 void cgraph_update_edges_for_call_stmt (gimple, tree, gimple);
 451 struct cgraph_local_info *cgraph_local_info (tree);
 452 struct cgraph_global_info *cgraph_global_info (tree);
 453 struct cgraph_rtl_info *cgraph_rtl_info (tree);
 454 const char * cgraph_node_name (struct cgraph_node *);
 455 struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *,
 456                                         struct cgraph_node *, gimple,
 457                                         unsigned, gcov_type, int, int, bool);
 458 struct cgraph_node * cgraph_clone_node (struct cgraph_node *, gcov_type, int,
 459                                         int, bool, VEC(cgraph_edge_p,heap) *);
 460
 461 void cgraph_redirect_edge_callee (struct cgraph_edge *, struct cgraph_node *);
 462
 463 struct cgraph_asm_node *cgraph_add_asm_node (tree);
 464
 465 bool cgraph_function_possibly_inlined_p (tree);
 466 void cgraph_unnest_node (struct cgraph_node *);
 467
 468 enum availability cgraph_function_body_availability (struct cgraph_node *);
 469 void cgraph_add_new_function (tree, bool);
 470 const char* cgraph_inline_failed_string (cgraph_inline_failed_t);
 471 struct cgraph_node * cgraph_create_virtual_clone (struct cgraph_node *old_node,
 472                                                   VEC(cgraph_edge_p,heap)*,
 473                                                   VEC(ipa_replace_map_p,gc)* tree_map,
 474                                                   bitmap args_to_skip);
 475
 476 /* In cgraphunit.c  */
 477 void cgraph_finalize_function (tree, bool);
 478 void cgraph_mark_if_needed (tree);
 479 void cgraph_finalize_compilation_unit (void);
 480 void cgraph_optimize (void);
 481 void cgraph_mark_needed_node (struct cgraph_node *);
 482 void cgraph_mark_address_taken_node (struct cgraph_node *);
 483 void cgraph_mark_reachable_node (struct cgraph_node *);
 484 bool cgraph_inline_p (struct cgraph_edge *, cgraph_inline_failed_t *reason);
 485 bool cgraph_preserve_function_body_p (tree);
 486 void verify_cgraph (void);
 487 void verify_cgraph_node (struct cgraph_node *);
 488 void cgraph_build_static_cdtor (char which, tree body, int priority);
 489 void cgraph_reset_static_var_maps (void);
 490 void init_cgraph (void);
 491 struct cgraph_node *cgraph_function_versioning (struct cgraph_node *,
 492                                                 VEC(cgraph_edge_p,heap)*,
 493                                                 VEC(ipa_replace_map_p,gc)*,
 494                                                 bitmap);
 495 void tree_function_versioning (tree, tree, VEC (ipa_replace_map_p,gc)*, bool, bitmap);
 496 struct cgraph_node *save_inline_function_body (struct cgraph_node *);
 497 void record_references_in_initializer (tree, bool);
 498 bool cgraph_process_new_functions (void);
 499
 500 bool cgraph_decide_is_function_needed (struct cgraph_node *, tree);
 501
 502 typedef void (*cgraph_edge_hook)(struct cgraph_edge *, void *);
 503 typedef void (*cgraph_node_hook)(struct cgraph_node *, void *);
 504 typedef void (*cgraph_2edge_hook)(struct cgraph_edge *, struct cgraph_edge *,
 505                                   void *);
 506 typedef void (*cgraph_2node_hook)(struct cgraph_node *, struct cgraph_node *,
 507                                   void *);
 508 struct cgraph_edge_hook_list;
 509 struct cgraph_node_hook_list;
 510 struct cgraph_2edge_hook_list;
 511 struct cgraph_2node_hook_list;
 512 struct cgraph_edge_hook_list *cgraph_add_edge_removal_hook (cgraph_edge_hook, void *);
 513 void cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *);
 514 struct cgraph_node_hook_list *cgraph_add_node_removal_hook (cgraph_node_hook,
 515                                                             void *);
 516 void cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *);
 517 struct cgraph_node_hook_list *cgraph_add_function_insertion_hook (cgraph_node_hook,
 518                                                                   void *);
 519 void cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *);
 520 void cgraph_call_function_insertion_hooks (struct cgraph_node *node);
 521 struct cgraph_2edge_hook_list *cgraph_add_edge_duplication_hook (cgraph_2edge_hook, void *);
 522 void cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *);
 523 struct cgraph_2node_hook_list *cgraph_add_node_duplication_hook (cgraph_2node_hook, void *);
 524 void cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *);
 525 void cgraph_materialize_all_clones (void);
 526
 527 /* In cgraphbuild.c  */
 528 unsigned int rebuild_cgraph_edges (void);
 529 void reset_inline_failed (struct cgraph_node *);
 530 int compute_call_stmt_bb_frequency (tree, basic_block bb);
 531
 532 /* In ipa.c  */
 533 bool cgraph_remove_unreachable_nodes (bool, FILE *);
 534 int cgraph_postorder (struct cgraph_node **);
 535 cgraph_node_set cgraph_node_set_new (void);
 536 cgraph_node_set_iterator cgraph_node_set_find (cgraph_node_set,
 537                                                struct cgraph_node *);
 538 void cgraph_node_set_add (cgraph_node_set, struct cgraph_node *);
 539 void cgraph_node_set_remove (cgraph_node_set, struct cgraph_node *);
 540 void dump_cgraph_node_set (FILE *, cgraph_node_set);
 541 void debug_cgraph_node_set (cgraph_node_set);
 542
 543
 544 /* In predict.c  */
 545 bool cgraph_maybe_hot_edge_p (struct cgraph_edge *e);
 546
 547 /* In varpool.c  */
 548 extern GTY(()) struct varpool_node *varpool_nodes_queue;
 549 extern GTY(()) struct varpool_node *varpool_nodes;
 550
 551 struct varpool_node *varpool_node (tree);
 552 struct varpool_node *varpool_node_for_asm (tree asmname);
 553 void varpool_mark_needed_node (struct varpool_node *);
 554 void debug_varpool (void);
 555 void dump_varpool (FILE *);
 556 void dump_varpool_node (FILE *, struct varpool_node *);
 557
 558 void varpool_finalize_decl (tree);
 559 bool decide_is_variable_needed (struct varpool_node *, tree);
 560 enum availability cgraph_variable_initializer_availability (struct varpool_node *);
 561 void cgraph_make_node_local (struct cgraph_node *);
 562 bool cgraph_node_can_be_local_p (struct cgraph_node *);
 563
 564 bool varpool_assemble_pending_decls (void);
 565 bool varpool_assemble_decl (struct varpool_node *node);
 566 bool varpool_analyze_pending_decls (void);
 567 void varpool_remove_unreferenced_decls (void);
 568 void varpool_empty_needed_queue (void);
 569 const char * varpool_node_name (struct varpool_node *node);
 570
 571 /* Walk all reachable static variables.  */
 572 #define FOR_EACH_STATIC_VARIABLE(node) \
 573    for ((node) = varpool_nodes_queue; (node); (node) = (node)->next_needed)
 574
 575 /* Return first reachable static variable with initializer.  */
 576 static inline struct varpool_node *
 577 varpool_first_static_initializer (void)
 578 {
 579   struct varpool_node *node;
 580   for (node = varpool_nodes_queue; node; node = node->next_needed)
 581     {
 582       gcc_assert (TREE_CODE (node->decl) == VAR_DECL);
 583       if (DECL_INITIAL (node->decl))
 584         return node;
 585     }
 586   return NULL;
 587 }
 588
 589 /* Return next reachable static variable with initializer after NODE.  */
 590 static inline struct varpool_node *
 591 varpool_next_static_initializer (struct varpool_node *node)
 592 {
 593   for (node = node->next_needed; node; node = node->next_needed)
 594     {
 595       gcc_assert (TREE_CODE (node->decl) == VAR_DECL);
 596       if (DECL_INITIAL (node->decl))
 597         return node;
 598     }
 599   return NULL;
 600 }
 601
 602 /* Walk all static variables with initializer set.  */
 603 #define FOR_EACH_STATIC_INITIALIZER(node) \
 604    for ((node) = varpool_first_static_initializer (); (node); \
 605         (node) = varpool_next_static_initializer (node))
 606
 607 /* In ipa-inline.c  */
 608 void cgraph_clone_inlined_nodes (struct cgraph_edge *, bool, bool);
 609 unsigned int compute_inline_parameters (struct cgraph_node *);
 610
 611
 612 /* Create a new static variable of type TYPE.  */
 613 tree add_new_static_var (tree type);
 614
 615 /* lto-cgraph.c */
 616
 617 enum LTO_cgraph_tags
 618 {
 619   /* Must leave 0 for the stopper.  */
 620   LTO_cgraph_avail_node = 1,
 621   LTO_cgraph_overwritable_node,
 622   LTO_cgraph_unavail_node,
 623   LTO_cgraph_edge,
 624   LTO_cgraph_last_tag
 625 };
 626
 627 extern const char * LTO_cgraph_tag_names[LTO_cgraph_last_tag];
 628
 629 #define LCC_NOT_FOUND   (-1)
 630
 631
 632 /* Return true if iterator CSI points to nothing.  */
 633 static inline bool
 634 csi_end_p (cgraph_node_set_iterator csi)
 635 {
 636   return csi.index >= VEC_length (cgraph_node_ptr, csi.set->nodes);
 637 }
 638
 639 /* Advance iterator CSI.  */
 640 static inline void
 641 csi_next (cgraph_node_set_iterator *csi)
 642 {
 643   csi->index++;
 644 }
 645
 646 /* Return the node pointed to by CSI.  */
 647 static inline struct cgraph_node *
 648 csi_node (cgraph_node_set_iterator csi)
 649 {
 650   return VEC_index (cgraph_node_ptr, csi.set->nodes, csi.index);
 651 }
 652
 653 /* Return an iterator to the first node in SET.  */
 654 static inline cgraph_node_set_iterator
 655 csi_start (cgraph_node_set set)
 656 {
 657   cgraph_node_set_iterator csi;
 658
 659   csi.set = set;
 660   csi.index = 0;
 661   return csi;
 662 }
 663
 664 /* Return true if SET contains NODE.  */
 665 static inline bool
 666 cgraph_node_in_set_p (struct cgraph_node *node, cgraph_node_set set)
 667 {
 668   cgraph_node_set_iterator csi;
 669   csi = cgraph_node_set_find (set, node);
 670   return !csi_end_p (csi);
 671 }
 672
 673 /* Return number of nodes in SET.  */
 674 static inline size_t
 675 cgraph_node_set_size (cgraph_node_set set)
 676 {
 677   return htab_elements (set->hashtab);
 678 }
 679
 680 /* Uniquize all constants that appear in memory.
 681    Each constant in memory thus far output is recorded
 682    in `const_desc_table'.  */
 683
 684 struct GTY(()) constant_descriptor_tree {
 685   /* A MEM for the constant.  */
 686   rtx rtl;
 687
 688   /* The value of the constant.  */
 689   tree value;
 690
 691   /* Hash of value.  Computing the hash from value each time
 692      hashfn is called can't work properly, as that means recursive
 693      use of the hash table during hash table expansion.  */
 694   hashval_t hash;
 695 };
 696
 697 /* Return true when function NODE is only called directly.
 698    i.e. it is not externally visible, address was not taken and
 699    it is not used in any other non-standard way.  */
 700
 701 static inline bool
 702 cgraph_only_called_directly_p (struct cgraph_node *node)
 703 {
 704   return !node->needed && !node->local.externally_visible;
 705 }
 706
 707 /* Return true when function NODE can be removed from callgraph
 708    if all direct calls are eliminated.  */
 709
 710 static inline bool
 711 cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node *node)
 712 {
 713   return (!node->needed
 714           && (DECL_COMDAT (node->decl) || !node->local.externally_visible));
 715 }
 716
 717 /* Constant pool accessor function.  */
 718 htab_t constant_pool_htab (void);
 719
 720 #endif  /* GCC_CGRAPH_H  */