gcc/ipa-inline.h

   1 /* Inlining decision heuristics.
   2    Copyright (C) 2003, 2004, 2007, 2008, 2009, 2010, 2011
   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 /* Representation of inline parameters that do depend on context function is
  23    inlined into (i.e. known constant values of function parameters.
  24
  25    Conditions that are interesting for function body are collected into CONDS
  26    vector.  They are of simple for  function_param OP VAL, where VAL is
  27    IPA invariant.  The conditions are then refered by predicates.  */
  28
  29 typedef struct GTY(()) condition
  30   {
  31     tree val;
  32     int operand_num;
  33     enum tree_code code;
  34   } condition;
  35
  36 DEF_VEC_O (condition);
  37 DEF_VEC_ALLOC_O (condition, gc);
  38
  39 typedef VEC(condition,gc) *conditions;
  40
  41 /* Representation of predicates i.e. formulas using conditions defined
  42    above.  Predicates are simple logical formulas in conjunctive-disjunctive
  43    form.
  44
  45    Predicate is array of clauses terminated by 0.  Every clause must be true
  46    in order to make predicate true.
  47    Clauses are represented as bitmaps of conditions. One of conditions
  48    must be true in order for clause to be true.  */
  49
  50 #define MAX_CLAUSES 8
  51 typedef unsigned int clause_t;
  52 struct GTY(()) predicate
  53 {
  54   clause_t clause[MAX_CLAUSES + 1];
  55 };
  56
  57 /* Represnetation of function body size and time depending on the inline
  58    context.  We keep simple array of record, every containing of predicate
  59    and time/size to account.
  60
  61    We keep values scaled up, so fractional sizes and times can be
  62    accounted.  */
  63 #define INLINE_SIZE_SCALE 2
  64 #define INLINE_TIME_SCALE (CGRAPH_FREQ_BASE * 2)
  65 typedef struct GTY(()) size_time_entry
  66 {
  67   struct predicate predicate;
  68   int size;
  69   int time;
  70 } size_time_entry;
  71 DEF_VEC_O (size_time_entry);
  72 DEF_VEC_ALLOC_O (size_time_entry, gc);
  73
  74 /* Function inlining information.  */
  75 struct GTY(()) inline_summary
  76 {
  77   /* Information about the function body itself.  */
  78
  79   /* Estimated stack frame consumption by the function.  */
  80   HOST_WIDE_INT estimated_self_stack_size;
  81   /* Size of the function body.  */
  82   int self_size;
  83   /* Time of the function body.  */
  84   int self_time;
  85
  86   /* False when there something makes inlining impossible (such as va_arg).  */
  87   unsigned inlinable : 1;
  88   /* False when there something makes versioning impossible.
  89      Currently computed and used only by ipa-cp.  */
  90   unsigned versionable : 1;
  91
  92   /* Information about function that will result after applying all the
  93      inline decisions present in the callgraph.  Generally kept up to
  94      date only for functions that are not inline clones. */
  95
  96   /* Estimated stack frame consumption by the function.  */
  97   HOST_WIDE_INT estimated_stack_size;
  98   /* Expected offset of the stack frame of inlined function.  */
  99   HOST_WIDE_INT stack_frame_offset;
 100   /* Estimated size of the function after inlining.  */
 101   int time;
 102   int size;
 103
 104   /* Conditional size/time information.  The summaries are being
 105      merged during inlining.  */
 106   conditions conds;
 107   VEC(size_time_entry,gc) *entry;
 108 };
 109
 110 typedef struct inline_summary inline_summary_t;
 111 DEF_VEC_O(inline_summary_t);
 112 DEF_VEC_ALLOC_O(inline_summary_t,gc);
 113 extern GTY(()) VEC(inline_summary_t,gc) *inline_summary_vec;
 114
 115 /* Information kept about callgraph edges.  */
 116 struct inline_edge_summary
 117 {
 118   /* Estimated size and time of the call statement.  */
 119   int call_stmt_size;
 120   int call_stmt_time;
 121   /* Depth of loop nest, 0 means no nesting.  */
 122   unsigned short int loop_depth;
 123   struct predicate *predicate;
 124 };
 125
 126 typedef struct inline_edge_summary inline_edge_summary_t;
 127 DEF_VEC_O(inline_edge_summary_t);
 128 DEF_VEC_ALLOC_O(inline_edge_summary_t,heap);
 129 extern VEC(inline_edge_summary_t,heap) *inline_edge_summary_vec;
 130
 131 typedef struct edge_growth_cache_entry
 132 {
 133   int time, size;
 134 } edge_growth_cache_entry;
 135 DEF_VEC_O(edge_growth_cache_entry);
 136 DEF_VEC_ALLOC_O(edge_growth_cache_entry,heap);
 137
 138 extern VEC(int,heap) *node_growth_cache;
 139 extern VEC(edge_growth_cache_entry,heap) *edge_growth_cache;
 140
 141 /* In ipa-inline-analysis.c  */
 142 void debug_inline_summary (struct cgraph_node *);
 143 void dump_inline_summaries (FILE *f);
 144 void dump_inline_summary (FILE * f, struct cgraph_node *node);
 145 void inline_generate_summary (void);
 146 void inline_read_summary (void);
 147 void inline_write_summary (cgraph_node_set, varpool_node_set);
 148 void inline_free_summary (void);
 149 void initialize_inline_failed (struct cgraph_edge *);
 150 int estimate_time_after_inlining (struct cgraph_node *, struct cgraph_edge *);
 151 int estimate_size_after_inlining (struct cgraph_node *, struct cgraph_edge *);
 152 void estimate_ipcp_clone_size_and_time (struct cgraph_node *,
 153                                         VEC (tree, heap) *known_vals,
 154                                         int *, int *);
 155 int do_estimate_growth (struct cgraph_node *);
 156 void inline_merge_summary (struct cgraph_edge *edge);
 157 int do_estimate_edge_growth (struct cgraph_edge *edge);
 158 int do_estimate_edge_time (struct cgraph_edge *edge);
 159 void initialize_growth_caches (void);
 160 void free_growth_caches (void);
 161 void compute_inline_parameters (struct cgraph_node *, bool);
 162
 163 /* In ipa-inline-transform.c  */
 164 bool inline_call (struct cgraph_edge *, bool, VEC (cgraph_edge_p, heap) **, int *);
 165 unsigned int inline_transform (struct cgraph_node *);
 166 void clone_inlined_nodes (struct cgraph_edge *e, bool, bool, int *);
 167
 168 extern int ncalls_inlined;
 169 extern int nfunctions_inlined;
 170
 171 static inline struct inline_summary *
 172 inline_summary (struct cgraph_node *node)
 173 {
 174   return VEC_index (inline_summary_t, inline_summary_vec, node->uid);
 175 }
 176
 177 static inline struct inline_edge_summary *
 178 inline_edge_summary (struct cgraph_edge *edge)
 179 {
 180   return VEC_index (inline_edge_summary_t,
 181                     inline_edge_summary_vec, edge->uid);
 182 }
 183
 184 /* Return estimated unit growth after inlning all calls to NODE.
 185    Quick accesors to the inline growth caches.
 186    For convenience we keep zero 0 as unknown.  Because growth
 187    can be both positive and negative, we simply increase positive
 188    growths by 1. */
 189 static inline int
 190 estimate_growth (struct cgraph_node *node)
 191 {
 192   int ret;
 193   if ((int)VEC_length (int, node_growth_cache) <= node->uid
 194       || !(ret = VEC_index (int, node_growth_cache, node->uid)))
 195     return do_estimate_growth (node);
 196   return ret - (ret > 0);
 197 }
 198
 199
 200 /* Return estimated callee growth after inlining EDGE.  */
 201
 202 static inline int
 203 estimate_edge_growth (struct cgraph_edge *edge)
 204 {
 205   int ret;
 206   if ((int)VEC_length (edge_growth_cache_entry, edge_growth_cache) <= edge->uid
 207       || !(ret = VEC_index (edge_growth_cache_entry,
 208                             edge_growth_cache,
 209                             edge->uid)->size))
 210     return do_estimate_edge_growth (edge);
 211   return ret - (ret > 0);
 212 }
 213
 214
 215 /* Return estimated callee runtime increase after inlning
 216    EDGE.  */
 217
 218 static inline int
 219 estimate_edge_time (struct cgraph_edge *edge)
 220 {
 221   int ret;
 222   if ((int)VEC_length (edge_growth_cache_entry, edge_growth_cache) <= edge->uid
 223       || !(ret = VEC_index (edge_growth_cache_entry,
 224                             edge_growth_cache,
 225                             edge->uid)->size))
 226     return do_estimate_edge_time (edge);
 227   return ret - (ret > 0);
 228 }
 229
 230
 231 /* Reset cached value for NODE.  */
 232
 233 static inline void
 234 reset_node_growth_cache (struct cgraph_node *node)
 235 {
 236   if ((int)VEC_length (int, node_growth_cache) > node->uid)
 237     VEC_replace (int, node_growth_cache, node->uid, 0);
 238 }
 239
 240 /* Reset cached value for EDGE.  */
 241
 242 static inline void
 243 reset_edge_growth_cache (struct cgraph_edge *edge)
 244 {
 245   if ((int)VEC_length (edge_growth_cache_entry, edge_growth_cache) > edge->uid)
 246     {
 247       struct edge_growth_cache_entry zero = {0, 0};
 248       VEC_replace (edge_growth_cache_entry, edge_growth_cache, edge->uid, &zero);
 249     }
 250 }