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 };
 156
 157 /* The cgraph data structure.
 158    Each function decl has assigned cgraph_node listing callees and callers.  */
 159
 160 struct GTY((chain_next ("%h.next"), chain_prev ("%h.previous"))) cgraph_node {
 161   tree decl;
 162   struct cgraph_edge *callees;
 163   struct cgraph_edge *callers;
 164   struct cgraph_node *next;
 165   struct cgraph_node *previous;
 166   /* For nested functions points to function the node is nested in.  */
 167   struct cgraph_node *origin;
 168   /* Points to first nested function, if any.  */
 169   struct cgraph_node *nested;
 170   /* Pointer to the next function with same origin, if any.  */
 171   struct cgraph_node *next_nested;
 172   /* Pointer to the next function in cgraph_nodes_queue.  */
 173   struct cgraph_node *next_needed;
 174   /* Pointer to the next clone.  */
 175   struct cgraph_node *next_sibling_clone;
 176   struct cgraph_node *prev_sibling_clone;
 177   struct cgraph_node *clones;
 178   struct cgraph_node *clone_of;
 179   /* For functions with many calls sites it holds map from call expression
 180      to the edge to speed up cgraph_edge function.  */
 181   htab_t GTY((param_is (struct cgraph_edge))) call_site_hash;
 182
 183   PTR GTY ((skip)) aux;
 184
 185   struct cgraph_local_info local;
 186   struct cgraph_global_info global;
 187   struct cgraph_rtl_info rtl;
 188   struct cgraph_clone_info clone;
 189
 190   /* Expected number of executions: calculated in profile.c.  */
 191   gcov_type count;
 192   /* Unique id of the node.  */
 193   int uid;
 194   /* Ordering of all cgraph nodes.  */
 195   int order;
 196
 197   /* unique id for profiling. pid is not suitable because of different
 198      number of cfg nodes with -fprofile-generate and -fprofile-use */
 199   int pid;
 200
 201   /* Set when function must be output - it is externally visible
 202      or its address is taken.  */
 203   unsigned needed : 1;
 204   /* Set when function has address taken.  */
 205   unsigned address_taken : 1;
 206   /* Set when decl is an abstract function pointed to by the
 207      ABSTRACT_DECL_ORIGIN of a reachable function.  */
 208   unsigned abstract_and_needed : 1;
 209   /* Set when function is reachable by call from other function
 210      that is either reachable or needed.  */
 211   unsigned reachable : 1;
 212   /* Set once the function is lowered (i.e. its CFG is built).  */
 213   unsigned lowered : 1;
 214   /* Set once the function has been instantiated and its callee
 215      lists created.  */
 216   unsigned analyzed : 1;
 217   /* Set when function is scheduled to be processed by local passes.  */
 218   unsigned process : 1;
 219   /* Set for aliases once they got through assemble_alias.  */
 220   unsigned alias : 1;
 221
 222   /* In non-unit-at-a-time mode the function body of inline candidates is saved
 223      into clone before compiling so the function in original form can be
 224      inlined later.  This pointer points to the clone.  */
 225   tree inline_decl;
 226 };
 227
 228 typedef struct cgraph_node *cgraph_node_ptr;
 229
 230 DEF_VEC_P(cgraph_node_ptr);
 231 DEF_VEC_ALLOC_P(cgraph_node_ptr,heap);
 232 DEF_VEC_ALLOC_P(cgraph_node_ptr,gc);
 233
 234 /* A cgraph node set is a collection of cgraph nodes.  A cgraph node
 235    can appear in multiple sets.  */
 236 struct GTY(()) cgraph_node_set_def
 237 {
 238   htab_t GTY((param_is (struct cgraph_node_set_element_def))) hashtab;
 239   VEC(cgraph_node_ptr, gc) *nodes;
 240   PTR GTY ((skip)) aux;
 241 };
 242
 243 typedef struct cgraph_node_set_def *cgraph_node_set;
 244
 245 DEF_VEC_P(cgraph_node_set);
 246 DEF_VEC_ALLOC_P(cgraph_node_set,gc);
 247 DEF_VEC_ALLOC_P(cgraph_node_set,heap);
 248
 249 /* A cgraph node set element contains an index in the vector of nodes in
 250    the set.  */
 251 struct GTY(()) cgraph_node_set_element_def
 252 {
 253   struct cgraph_node *node;
 254   HOST_WIDE_INT index;
 255 };
 256
 257 typedef struct cgraph_node_set_element_def *cgraph_node_set_element;
 258 typedef const struct cgraph_node_set_element_def *const_cgraph_node_set_element;
 259
 260 /* Iterator structure for cgraph node sets.  */
 261 typedef struct
 262 {
 263   cgraph_node_set set;
 264   unsigned index;
 265 } cgraph_node_set_iterator;
 266
 267 #define DEFCIFCODE(code, string)        CIF_ ## code,
 268 /* Reasons for inlining failures.  */
 269 typedef enum {
 270 #include "cif-code.def"
 271   CIF_N_REASONS
 272 } cgraph_inline_failed_t;
 273
 274 struct GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"))) cgraph_edge {
 275   struct cgraph_node *caller;
 276   struct cgraph_node *callee;
 277   struct cgraph_edge *prev_caller;
 278   struct cgraph_edge *next_caller;
 279   struct cgraph_edge *prev_callee;
 280   struct cgraph_edge *next_callee;
 281   gimple call_stmt;
 282   PTR GTY ((skip (""))) aux;
 283   /* When equal to CIF_OK, inline this call.  Otherwise, points to the
 284      explanation why function was not inlined.  */
 285   cgraph_inline_failed_t inline_failed;
 286   /* Expected number of executions: calculated in profile.c.  */
 287   gcov_type count;
 288   /* Expected frequency of executions within the function.
 289      When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
 290      per function call.  The range is 0 to CGRAPH_FREQ_MAX.  */
 291   int frequency;
 292   /* Depth of loop nest, 1 means no loop nest.  */
 293   unsigned int loop_nest : 30;
 294   /* Whether this edge describes a call that was originally indirect.  */
 295   unsigned int indirect_call : 1;
 296   /* Can this call throw externally?  */
 297   unsigned int can_throw_external : 1;
 298   /* Unique id of the edge.  */
 299   int uid;
 300 };
 301
 302 #define CGRAPH_FREQ_BASE 1000
 303 #define CGRAPH_FREQ_MAX 100000
 304
 305 typedef struct cgraph_edge *cgraph_edge_p;
 306
 307 DEF_VEC_P(cgraph_edge_p);
 308 DEF_VEC_ALLOC_P(cgraph_edge_p,heap);
 309
 310 /* The varpool data structure.
 311    Each static variable decl has assigned varpool_node.  */
 312
 313 struct GTY((chain_next ("%h.next"))) varpool_node {
 314   tree decl;
 315   /* Pointer to the next function in varpool_nodes.  */
 316   struct varpool_node *next;
 317   /* Pointer to the next function in varpool_nodes_queue.  */
 318   struct varpool_node *next_needed;
 319   /* Ordering of all cgraph nodes.  */
 320   int order;
 321
 322   /* Set when function must be output - it is externally visible
 323      or its address is taken.  */
 324   unsigned needed : 1;
 325   /* Needed variables might become dead by optimization.  This flag
 326      forces the variable to be output even if it appears dead otherwise.  */
 327   unsigned force_output : 1;
 328   /* Set once the variable has been instantiated and its callee
 329      lists created.  */
 330   unsigned analyzed : 1;
 331   /* Set once it has been finalized so we consider it to be output.  */
 332   unsigned finalized : 1;
 333   /* Set when variable is scheduled to be assembled.  */
 334   unsigned output : 1;
 335   /* Set when function is visible by other units.  */
 336   unsigned externally_visible : 1;
 337   /* Set for aliases once they got through assemble_alias.  */
 338   unsigned alias : 1;
 339 };
 340
 341 /* Every top level asm statement is put into a cgraph_asm_node.  */
 342
 343 struct GTY(()) cgraph_asm_node {
 344   /* Next asm node.  */
 345   struct cgraph_asm_node *next;
 346   /* String for this asm node.  */
 347   tree asm_str;
 348   /* Ordering of all cgraph nodes.  */
 349   int order;
 350 };
 351
 352 extern GTY(()) struct cgraph_node *cgraph_nodes;
 353 extern GTY(()) int cgraph_n_nodes;
 354 extern GTY(()) int cgraph_max_uid;
 355 extern GTY(()) int cgraph_edge_max_uid;
 356 extern GTY(()) int cgraph_max_pid;
 357 extern bool cgraph_global_info_ready;
 358 enum cgraph_state
 359 {
 360   /* Callgraph is being constructed.  It is safe to add new functions.  */
 361   CGRAPH_STATE_CONSTRUCTION,
 362   /* Callgraph is built and IPA passes are being run.  */
 363   CGRAPH_STATE_IPA,
 364   /* Callgraph is built and all functions are transformed to SSA form.  */
 365   CGRAPH_STATE_IPA_SSA,
 366   /* Functions are now ordered and being passed to RTL expanders.  */
 367   CGRAPH_STATE_EXPANSION,
 368   /* All cgraph expansion is done.  */
 369   CGRAPH_STATE_FINISHED
 370 };
 371 extern enum cgraph_state cgraph_state;
 372 extern bool cgraph_function_flags_ready;
 373 extern GTY(()) struct cgraph_node *cgraph_nodes_queue;
 374 extern GTY(()) struct cgraph_node *cgraph_new_nodes;
 375
 376 extern GTY(()) struct cgraph_asm_node *cgraph_asm_nodes;
 377 extern GTY(()) int cgraph_order;
 378
 379 /* In cgraph.c  */
 380 void dump_cgraph (FILE *);
 381 void debug_cgraph (void);
 382 void dump_cgraph_node (FILE *, struct cgraph_node *);
 383 void debug_cgraph_node (struct cgraph_node *);
 384 void cgraph_insert_node_to_hashtable (struct cgraph_node *node);
 385 void cgraph_remove_edge (struct cgraph_edge *);
 386 void cgraph_remove_node (struct cgraph_node *);
 387 void cgraph_remove_node_and_inline_clones (struct cgraph_node *);
 388 void cgraph_release_function_body (struct cgraph_node *);
 389 void cgraph_node_remove_callees (struct cgraph_node *node);
 390 struct cgraph_edge *cgraph_create_edge (struct cgraph_node *,
 391                                         struct cgraph_node *,
 392                                         gimple, gcov_type, int, int);
 393 struct cgraph_node *cgraph_node (tree);
 394 struct cgraph_node *cgraph_node_for_asm (tree asmname);
 395 struct cgraph_edge *cgraph_edge (struct cgraph_node *, gimple);
 396 void cgraph_set_call_stmt (struct cgraph_edge *, gimple);
 397 void cgraph_set_call_stmt_including_clones (struct cgraph_node *, gimple, gimple);
 398 void cgraph_create_edge_including_clones (struct cgraph_node *,
 399                                           struct cgraph_node *,
 400                                           gimple, gcov_type, int, int,
 401                                           cgraph_inline_failed_t);
 402 void cgraph_update_edges_for_call_stmt (gimple, tree, gimple);
 403 struct cgraph_local_info *cgraph_local_info (tree);
 404 struct cgraph_global_info *cgraph_global_info (tree);
 405 struct cgraph_rtl_info *cgraph_rtl_info (tree);
 406 const char * cgraph_node_name (struct cgraph_node *);
 407 struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *,
 408                                         struct cgraph_node *,
 409                                         gimple, gcov_type, int, int, bool);
 410 struct cgraph_node * cgraph_clone_node (struct cgraph_node *, gcov_type, int,
 411                                         int, bool);
 412
 413 void cgraph_redirect_edge_callee (struct cgraph_edge *, struct cgraph_node *);
 414
 415 struct cgraph_asm_node *cgraph_add_asm_node (tree);
 416
 417 bool cgraph_function_possibly_inlined_p (tree);
 418 void cgraph_unnest_node (struct cgraph_node *);
 419
 420 enum availability cgraph_function_body_availability (struct cgraph_node *);
 421 void cgraph_add_new_function (tree, bool);
 422 const char* cgraph_inline_failed_string (cgraph_inline_failed_t);
 423 struct cgraph_node * cgraph_create_virtual_clone (struct cgraph_node *old_node,
 424                                                   VEC(cgraph_edge_p,heap)*,
 425                                                   VEC(ipa_replace_map_p,gc)* tree_map,
 426                                                   bitmap args_to_skip);
 427
 428 /* In cgraphunit.c  */
 429 void cgraph_finalize_function (tree, bool);
 430 void cgraph_mark_if_needed (tree);
 431 void cgraph_finalize_compilation_unit (void);
 432 void cgraph_optimize (void);
 433 void cgraph_mark_needed_node (struct cgraph_node *);
 434 void cgraph_mark_address_taken_node (struct cgraph_node *);
 435 void cgraph_mark_reachable_node (struct cgraph_node *);
 436 bool cgraph_inline_p (struct cgraph_edge *, cgraph_inline_failed_t *reason);
 437 bool cgraph_preserve_function_body_p (tree);
 438 void verify_cgraph (void);
 439 void verify_cgraph_node (struct cgraph_node *);
 440 void cgraph_build_static_cdtor (char which, tree body, int priority);
 441 void cgraph_reset_static_var_maps (void);
 442 void init_cgraph (void);
 443 struct cgraph_node *cgraph_function_versioning (struct cgraph_node *,
 444                                                 VEC(cgraph_edge_p,heap)*,
 445                                                 VEC(ipa_replace_map_p,gc)*,
 446                                                 bitmap);
 447 void tree_function_versioning (tree, tree, VEC (ipa_replace_map_p,gc)*, bool, bitmap);
 448 void cgraph_analyze_function (struct cgraph_node *);
 449 struct cgraph_node *save_inline_function_body (struct cgraph_node *);
 450 void record_references_in_initializer (tree);
 451 bool cgraph_process_new_functions (void);
 452
 453 typedef void (*cgraph_edge_hook)(struct cgraph_edge *, void *);
 454 typedef void (*cgraph_node_hook)(struct cgraph_node *, void *);
 455 typedef void (*cgraph_2edge_hook)(struct cgraph_edge *, struct cgraph_edge *,
 456                                   void *);
 457 typedef void (*cgraph_2node_hook)(struct cgraph_node *, struct cgraph_node *,
 458                                   void *);
 459 struct cgraph_edge_hook_list;
 460 struct cgraph_node_hook_list;
 461 struct cgraph_2edge_hook_list;
 462 struct cgraph_2node_hook_list;
 463 struct cgraph_edge_hook_list *cgraph_add_edge_removal_hook (cgraph_edge_hook, void *);
 464 void cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *);
 465 struct cgraph_node_hook_list *cgraph_add_node_removal_hook (cgraph_node_hook,
 466                                                             void *);
 467 void cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *);
 468 struct cgraph_node_hook_list *cgraph_add_function_insertion_hook (cgraph_node_hook,
 469                                                                   void *);
 470 void cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *);
 471 void cgraph_call_function_insertion_hooks (struct cgraph_node *node);
 472 struct cgraph_2edge_hook_list *cgraph_add_edge_duplication_hook (cgraph_2edge_hook, void *);
 473 void cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *);
 474 struct cgraph_2node_hook_list *cgraph_add_node_duplication_hook (cgraph_2node_hook, void *);
 475 void cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *);
 476 void cgraph_materialize_all_clones (void);
 477
 478 /* In cgraphbuild.c  */
 479 unsigned int rebuild_cgraph_edges (void);
 480 int compute_call_stmt_bb_frequency (tree, basic_block bb);
 481
 482 /* In ipa.c  */
 483 bool cgraph_remove_unreachable_nodes (bool, FILE *);
 484 int cgraph_postorder (struct cgraph_node **);
 485 cgraph_node_set cgraph_node_set_new (void);
 486 cgraph_node_set_iterator cgraph_node_set_find (cgraph_node_set,
 487                                                struct cgraph_node *);
 488 void cgraph_node_set_add (cgraph_node_set, struct cgraph_node *);
 489 void cgraph_node_set_remove (cgraph_node_set, struct cgraph_node *);
 490 void dump_cgraph_node_set (FILE *, cgraph_node_set);
 491 void debug_cgraph_node_set (cgraph_node_set);
 492
 493
 494 /* In predict.c  */
 495 bool cgraph_maybe_hot_edge_p (struct cgraph_edge *e);
 496
 497 /* In varpool.c  */
 498 extern GTY(()) struct varpool_node *varpool_nodes_queue;
 499 extern GTY(()) struct varpool_node *varpool_nodes;
 500
 501 struct varpool_node *varpool_node (tree);
 502 struct varpool_node *varpool_node_for_asm (tree asmname);
 503 void varpool_mark_needed_node (struct varpool_node *);
 504 void debug_varpool (void);
 505 void dump_varpool (FILE *);
 506 void dump_varpool_node (FILE *, struct varpool_node *);
 507
 508 void varpool_finalize_decl (tree);
 509 bool decide_is_variable_needed (struct varpool_node *, tree);
 510 enum availability cgraph_variable_initializer_availability (struct varpool_node *);
 511
 512 bool varpool_assemble_pending_decls (void);
 513 bool varpool_assemble_decl (struct varpool_node *node);
 514 bool varpool_analyze_pending_decls (void);
 515 void varpool_remove_unreferenced_decls (void);
 516 void varpool_empty_needed_queue (void);
 517
 518 /* Walk all reachable static variables.  */
 519 #define FOR_EACH_STATIC_VARIABLE(node) \
 520    for ((node) = varpool_nodes_queue; (node); (node) = (node)->next_needed)
 521
 522 /* Return first reachable static variable with initializer.  */
 523 static inline struct varpool_node *
 524 varpool_first_static_initializer (void)
 525 {
 526   struct varpool_node *node;
 527   for (node = varpool_nodes_queue; node; node = node->next_needed)
 528     {
 529       gcc_assert (TREE_CODE (node->decl) == VAR_DECL);
 530       if (DECL_INITIAL (node->decl))
 531         return node;
 532     }
 533   return NULL;
 534 }
 535
 536 /* Return next reachable static variable with initializer after NODE.  */
 537 static inline struct varpool_node *
 538 varpool_next_static_initializer (struct varpool_node *node)
 539 {
 540   for (node = node->next_needed; node; node = node->next_needed)
 541     {
 542       gcc_assert (TREE_CODE (node->decl) == VAR_DECL);
 543       if (DECL_INITIAL (node->decl))
 544         return node;
 545     }
 546   return NULL;
 547 }
 548
 549 /* Walk all static variables with initializer set.  */
 550 #define FOR_EACH_STATIC_INITIALIZER(node) \
 551    for ((node) = varpool_first_static_initializer (); (node); \
 552         (node) = varpool_next_static_initializer (node))
 553
 554 /* In ipa-inline.c  */
 555 void cgraph_clone_inlined_nodes (struct cgraph_edge *, bool, bool);
 556 unsigned int compute_inline_parameters (struct cgraph_node *);
 557
 558
 559 /* Create a new static variable of type TYPE.  */
 560 tree add_new_static_var (tree type);
 561
 562
 563 /* Return true if iterator CSI points to nothing.  */
 564 static inline bool
 565 csi_end_p (cgraph_node_set_iterator csi)
 566 {
 567   return csi.index >= VEC_length (cgraph_node_ptr, csi.set->nodes);
 568 }
 569
 570 /* Advance iterator CSI.  */
 571 static inline void
 572 csi_next (cgraph_node_set_iterator *csi)
 573 {
 574   csi->index++;
 575 }
 576
 577 /* Return the node pointed to by CSI.  */
 578 static inline struct cgraph_node *
 579 csi_node (cgraph_node_set_iterator csi)
 580 {
 581   return VEC_index (cgraph_node_ptr, csi.set->nodes, csi.index);
 582 }
 583
 584 /* Return an iterator to the first node in SET.  */
 585 static inline cgraph_node_set_iterator
 586 csi_start (cgraph_node_set set)
 587 {
 588   cgraph_node_set_iterator csi;
 589
 590   csi.set = set;
 591   csi.index = 0;
 592   return csi;
 593 }
 594
 595 /* Return true if SET contains NODE.  */
 596 static inline bool
 597 cgraph_node_in_set_p (struct cgraph_node *node, cgraph_node_set set)
 598 {
 599   cgraph_node_set_iterator csi;
 600   csi = cgraph_node_set_find (set, node);
 601   return !csi_end_p (csi);
 602 }
 603
 604 /* Return number of nodes in SET.  */
 605 static inline size_t
 606 cgraph_node_set_size (cgraph_node_set set)
 607 {
 608   return htab_elements (set->hashtab);
 609 }
 610
 611
 612 #endif  /* GCC_CGRAPH_H  */