gcc/ipa-inline.h

   1 /* Inlining decision heuristics.
   2    Copyright (C) 2003-2019 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 3, 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 COPYING3.  If not see
  19 <http://www.gnu.org/licenses/>.  */
  20
  21 #ifndef GCC_IPA_INLINE_H
  22 #define GCC_IPA_INLINE_H
  23
  24 /* Data we cache about callgraph edges during inlining to avoid expensive
  25    re-computations during the greedy algorithm.  */
  26 class edge_growth_cache_entry
  27 {
  28 public:
  29   sreal time, nonspec_time;
  30   int size;
  31   ipa_hints hints;
  32
  33   edge_growth_cache_entry()
  34     : size (0), hints (0) {}
  35
  36   edge_growth_cache_entry(int64_t time, int64_t nonspec_time,
  37                           int size, ipa_hints hints)
  38     : time (time), nonspec_time (nonspec_time), size (size),
  39       hints (hints) {}
  40 };
  41
  42 extern call_summary<edge_growth_cache_entry *> *edge_growth_cache;
  43
  44 /* In ipa-inline-analysis.c  */
  45 int estimate_size_after_inlining (struct cgraph_node *, struct cgraph_edge *);
  46 int estimate_growth (struct cgraph_node *);
  47 bool growth_likely_positive (struct cgraph_node *, int);
  48 int do_estimate_edge_size (struct cgraph_edge *edge);
  49 sreal do_estimate_edge_time (struct cgraph_edge *edge);
  50 ipa_hints do_estimate_edge_hints (struct cgraph_edge *edge);
  51 void free_growth_caches (void);
  52
  53 /* In ipa-inline.c  */
  54 unsigned int early_inliner (function *fun);
  55 bool inline_account_function_p (struct cgraph_node *node);
  56
  57
  58 /* In ipa-inline-transform.c  */
  59 bool inline_call (struct cgraph_edge *, bool, vec<cgraph_edge *> *, int *, bool,
  60                   bool *callee_removed = NULL);
  61 unsigned int inline_transform (struct cgraph_node *);
  62 void clone_inlined_nodes (struct cgraph_edge *e, bool, bool, int *);
  63
  64 extern int ncalls_inlined;
  65 extern int nfunctions_inlined;
  66
  67 /* Return estimated size of the inline sequence of EDGE.  */
  68
  69 static inline int
  70 estimate_edge_size (struct cgraph_edge *edge)
  71 {
  72   edge_growth_cache_entry *entry;
  73   if (edge_growth_cache == NULL
  74       || (entry = edge_growth_cache->get (edge)) == NULL
  75       || entry->size == 0)
  76     return do_estimate_edge_size (edge);
  77   return entry->size - (entry->size > 0);
  78 }
  79
  80 /* Return estimated callee growth after inlining EDGE.  */
  81
  82 static inline int
  83 estimate_edge_growth (struct cgraph_edge *edge)
  84 {
  85   ipa_call_summary *s = ipa_call_summaries->get (edge);
  86   gcc_checking_assert (s->call_stmt_size || !edge->callee->analyzed);
  87   return (estimate_edge_size (edge) - s->call_stmt_size);
  88 }
  89
  90 /* Return estimated callee runtime increase after inlining
  91    EDGE.  */
  92
  93 static inline sreal
  94 estimate_edge_time (struct cgraph_edge *edge, sreal *nonspec_time = NULL)
  95 {
  96   edge_growth_cache_entry *entry;
  97   if (edge_growth_cache == NULL
  98       || (entry = edge_growth_cache->get (edge)) == NULL
  99       || entry->time == 0)
 100     return do_estimate_edge_time (edge);
 101   if (nonspec_time)
 102     *nonspec_time = edge_growth_cache->get (edge)->nonspec_time;
 103   return entry->time;
 104 }
 105
 106
 107 /* Return estimated callee runtime increase after inlining
 108    EDGE.  */
 109
 110 static inline ipa_hints
 111 estimate_edge_hints (struct cgraph_edge *edge)
 112 {
 113   edge_growth_cache_entry *entry;
 114   if (edge_growth_cache == NULL
 115       || (entry = edge_growth_cache->get (edge)) == NULL
 116       || entry->hints == 0)
 117     return do_estimate_edge_hints (edge);
 118   return entry->hints - 1;
 119 }
 120
 121 #endif /* GCC_IPA_INLINE_H */