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