gcc/cgraph.h

   1 /* Callgraph handling code.
   2    Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
   3    Contributed by Jan Hubicka
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify it under
   8 the terms of the GNU General Public License as published by the Free
   9 Software Foundation; either version 2, or (at your option) any later
  10 version.
  11
  12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  14 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  15 for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING.  If not, write to the Free
  19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
  20 02110-1301, USA.  */
  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 /* Information about the function collected locally.
  50    Available after function is analyzed.  */
  51
  52 struct cgraph_local_info GTY(())
  53 {
  54   /* Size of the function before inlining.  */
  55   int self_insns;
  56
  57   /* Set when function function is visible in current compilation unit only
  58      and its address is never taken.  */
  59   bool local;
  60
  61   /* Set when function is visible by other units.  */
  62   bool externally_visible;
  63
  64   /* Set once it has been finalized so we consider it to be output.  */
  65   bool finalized;
  66
  67   /* False when there something makes inlining impossible (such as va_arg).  */
  68   bool inlinable;
  69
  70   /* True when function should be inlined independently on its size.  */
  71   bool disregard_inline_limits;
  72
  73   /* True when the function has been originally extern inline, but it is
  74      redefined now.  */
  75   bool redefined_extern_inline;
  76
  77   /* True if statics_read_for_function and
  78      statics_written_for_function contain valid data.  */
  79   bool for_functions_valid;
  80
  81   /* True if the function is going to be emitted in some other translation
  82      unit, referenced from vtable.  */
  83   bool vtable_method;
  84 };
  85
  86 /* Information about the function that needs to be computed globally
  87    once compilation is finished.  Available only with -funit-at-time.  */
  88
  89 struct cgraph_global_info GTY(())
  90 {
  91   /* For inline clones this points to the function they will be inlined into.  */
  92   struct cgraph_node *inlined_to;
  93
  94   /* Estimated size of the function after inlining.  */
  95   int insns;
  96
  97   /* Estimated growth after inlining.  INT_MIN if not computed.  */
  98   int estimated_growth;
  99
 100   /* Set iff the function has been inlined at least once.  */
 101   bool inlined;
 102 };
 103
 104 /* Information about the function that is propagated by the RTL backend.
 105    Available only for functions that has been already assembled.  */
 106
 107 struct cgraph_rtl_info GTY(())
 108 {
 109    int preferred_incoming_stack_boundary;
 110 };
 111
 112 /* The cgraph data structure.
 113    Each function decl has assigned cgraph_node listing callees and callers.  */
 114
 115 struct cgraph_node GTY((chain_next ("%h.next"), chain_prev ("%h.previous")))
 116 {
 117   tree decl;
 118   struct cgraph_edge *callees;
 119   struct cgraph_edge *callers;
 120   struct cgraph_node *next;
 121   struct cgraph_node *previous;
 122   /* For nested functions points to function the node is nested in.  */
 123   struct cgraph_node *origin;
 124   /* Points to first nested function, if any.  */
 125   struct cgraph_node *nested;
 126   /* Pointer to the next function with same origin, if any.  */
 127   struct cgraph_node *next_nested;
 128   /* Pointer to the next function in cgraph_nodes_queue.  */
 129   struct cgraph_node *next_needed;
 130   /* Pointer to the next clone.  */
 131   struct cgraph_node *next_clone;
 132   struct cgraph_node *prev_clone;
 133   /* Pointer to a single unique cgraph node for this function.  If the
 134      function is to be output, this is the copy that will survive.  */
 135   struct cgraph_node *master_clone;
 136
 137   PTR GTY ((skip)) aux;
 138
 139   struct cgraph_local_info local;
 140   struct cgraph_global_info global;
 141   struct cgraph_rtl_info rtl;
 142
 143   /* Expected number of executions: calculated in profile.c.  */
 144   gcov_type count;
 145   /* Unique id of the node.  */
 146   int uid;
 147   /* Ordering of all cgraph nodes.  */
 148   int order;
 149   /* Set when function must be output - it is externally visible
 150      or its address is taken.  */
 151   bool needed;
 152   /* Set when function is reachable by call from other function
 153      that is either reachable or needed.  */
 154   bool reachable;
 155   /* Set once the function is lowered (i.e. its CFG is built).  */
 156   bool lowered;
 157   /* Set once the function has been instantiated and its callee
 158      lists created.  */
 159   bool analyzed;
 160   /* Set when function is scheduled to be assembled.  */
 161   bool output;
 162   /* Set when function is visible by other units.  */
 163   bool externally_visible;
 164   /* Set for aliases once they got through assemble_alias.  */
 165   bool alias;
 166
 167   /* In non-unit-at-a-time mode the function body of inline candidates is saved
 168      into clone before compiling so the function in original form can be
 169      inlined later.  This pointer points to the clone.  */
 170   tree inline_decl;
 171 };
 172
 173 struct cgraph_edge GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller")))
 174 {
 175   struct cgraph_node *caller;
 176   struct cgraph_node *callee;
 177   struct cgraph_edge *prev_caller;
 178   struct cgraph_edge *next_caller;
 179   struct cgraph_edge *prev_callee;
 180   struct cgraph_edge *next_callee;
 181   tree call_stmt;
 182   PTR GTY ((skip (""))) aux;
 183   /* When NULL, inline this call.  When non-NULL, points to the explanation
 184      why function was not inlined.  */
 185   const char *inline_failed;
 186   /* Expected number of executions: calculated in profile.c.  */
 187   gcov_type count;
 188   /* Depth of loop nest, 1 means no loop nest.  */
 189   int loop_nest;
 190 };
 191
 192 /* The cgraph_varpool data structure.
 193    Each static variable decl has assigned cgraph_varpool_node.  */
 194
 195 struct cgraph_varpool_node GTY(())
 196 {
 197   tree decl;
 198   /* Pointer to the next function in cgraph_varpool_nodes.  */
 199   struct cgraph_varpool_node *next;
 200   /* Pointer to the next function in cgraph_varpool_nodes_queue.  */
 201   struct cgraph_varpool_node *next_needed;
 202   /* Ordering of all cgraph nodes.  */
 203   int order;
 204
 205   /* Set when function must be output - it is externally visible
 206      or its address is taken.  */
 207   bool needed;
 208   /* Needed variables might become dead by optimization.  This flag
 209      forces the variable to be output even if it appears dead otherwise.  */
 210   bool force_output;
 211   /* Set once the variable has been instantiated and its callee
 212      lists created.  */
 213   bool analyzed;
 214   /* Set once it has been finalized so we consider it to be output.  */
 215   bool finalized;
 216   /* Set when variable is scheduled to be assembled.  */
 217   bool output;
 218   /* Set when function is visible by other units.  */
 219   bool externally_visible;
 220   /* Set for aliases once they got through assemble_alias.  */
 221   bool alias;
 222 };
 223
 224 /* Every top level asm statement is put into a cgraph_asm_node.  */
 225
 226 struct cgraph_asm_node GTY(())
 227 {
 228   /* Next asm node.  */
 229   struct cgraph_asm_node *next;
 230   /* String for this asm node.  */
 231   tree asm_str;
 232   /* Ordering of all cgraph nodes.  */
 233   int order;
 234 };
 235
 236 extern GTY(()) struct cgraph_node *cgraph_nodes;
 237 extern GTY(()) int cgraph_n_nodes;
 238 extern GTY(()) int cgraph_max_uid;
 239 extern bool cgraph_global_info_ready;
 240 extern bool cgraph_function_flags_ready;
 241 extern GTY(()) struct cgraph_node *cgraph_nodes_queue;
 242 extern GTY(()) struct cgraph_node *cgraph_expand_queue;
 243
 244 extern GTY(()) struct cgraph_varpool_node *cgraph_varpool_first_unanalyzed_node;
 245 extern GTY(()) struct cgraph_varpool_node *cgraph_varpool_nodes_queue;
 246 extern GTY(()) struct cgraph_asm_node *cgraph_asm_nodes;
 247 extern GTY(()) int cgraph_order;
 248
 249 /* In cgraph.c  */
 250 void dump_cgraph (FILE *);
 251 void dump_cgraph_node (FILE *, struct cgraph_node *);
 252 void cgraph_insert_node_to_hashtable (struct cgraph_node *node);
 253 void dump_varpool (FILE *);
 254 void dump_cgraph_varpool_node (FILE *, struct cgraph_varpool_node *);
 255 void cgraph_remove_edge (struct cgraph_edge *);
 256 void cgraph_remove_node (struct cgraph_node *);
 257 void cgraph_node_remove_callees (struct cgraph_node *node);
 258 struct cgraph_edge *cgraph_create_edge (struct cgraph_node *,
 259                                         struct cgraph_node *,
 260                                         tree, gcov_type, int);
 261 struct cgraph_node *cgraph_node (tree);
 262 struct cgraph_node *cgraph_node_for_asm (tree asmname);
 263 struct cgraph_edge *cgraph_edge (struct cgraph_node *, tree);
 264 struct cgraph_local_info *cgraph_local_info (tree);
 265 struct cgraph_global_info *cgraph_global_info (tree);
 266 struct cgraph_rtl_info *cgraph_rtl_info (tree);
 267 const char * cgraph_node_name (struct cgraph_node *);
 268 struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *,
 269                                         struct cgraph_node *,
 270                                         tree, gcov_type, int, bool);
 271 struct cgraph_node * cgraph_clone_node (struct cgraph_node *, gcov_type,
 272                                         int, bool);
 273
 274 struct cgraph_varpool_node *cgraph_varpool_node (tree);
 275 struct cgraph_varpool_node *cgraph_varpool_node_for_asm (tree asmname);
 276 void cgraph_varpool_mark_needed_node (struct cgraph_varpool_node *);
 277 void cgraph_varpool_finalize_decl (tree);
 278 void cgraph_redirect_edge_callee (struct cgraph_edge *, struct cgraph_node *);
 279
 280 struct cgraph_asm_node *cgraph_add_asm_node (tree);
 281
 282 bool cgraph_function_possibly_inlined_p (tree);
 283 void cgraph_unnest_node (struct cgraph_node *);
 284 void cgraph_varpool_enqueue_needed_node (struct cgraph_varpool_node *);
 285 void cgraph_varpool_reset_queue (void);
 286 bool decide_is_variable_needed (struct cgraph_varpool_node *, tree);
 287
 288 enum availability cgraph_function_body_availability (struct cgraph_node *);
 289 enum availability cgraph_variable_initializer_availability (struct cgraph_varpool_node *);
 290 bool cgraph_is_master_clone (struct cgraph_node *);
 291 struct cgraph_node *cgraph_master_clone (struct cgraph_node *);
 292 struct cgraph_node *cgraph_node_by_uid (int uid);
 293 void cgraph_add_new_function (tree);
 294
 295 /* In cgraphunit.c  */
 296 bool cgraph_assemble_pending_functions (void);
 297 bool cgraph_varpool_assemble_pending_decls (void);
 298 void cgraph_finalize_function (tree, bool);
 299 void cgraph_finalize_compilation_unit (void);
 300 void cgraph_optimize (void);
 301 void cgraph_mark_needed_node (struct cgraph_node *);
 302 void cgraph_mark_reachable_node (struct cgraph_node *);
 303 bool cgraph_inline_p (struct cgraph_edge *, const char **reason);
 304 bool cgraph_preserve_function_body_p (tree);
 305 void verify_cgraph (void);
 306 void verify_cgraph_node (struct cgraph_node *);
 307 void cgraph_build_static_cdtor (char which, tree body, int priority);
 308 void cgraph_reset_static_var_maps (void);
 309 void init_cgraph (void);
 310 struct cgraph_node *cgraph_function_versioning (struct cgraph_node *,
 311                                                 varray_type, varray_type);
 312 void cgraph_analyze_function (struct cgraph_node *);
 313 struct cgraph_node *save_inline_function_body (struct cgraph_node *);
 314
 315 /* In ipa.c  */
 316 bool cgraph_remove_unreachable_nodes (bool, FILE *);
 317 int cgraph_postorder (struct cgraph_node **);
 318
 319 /* In ipa-inline.c  */
 320 bool cgraph_decide_inlining_incrementally (struct cgraph_node *, bool);
 321 void cgraph_clone_inlined_nodes (struct cgraph_edge *, bool, bool);
 322 void cgraph_mark_inline_edge (struct cgraph_edge *, bool);
 323 bool cgraph_default_inline_p (struct cgraph_node *, const char **);
 324 #endif  /* GCC_CGRAPH_H  */