|
111
|
1 /* Inlining decision heuristics.
|
|
|
2 Copyright (C) 2003-2017 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 struct edge_growth_cache_entry
|
|
|
27 {
|
|
|
28 sreal time, nonspec_time;
|
|
|
29 int size;
|
|
|
30 ipa_hints hints;
|
|
|
31
|
|
|
32 edge_growth_cache_entry()
|
|
|
33 : size (0), hints (0) {}
|
|
|
34
|
|
|
35 edge_growth_cache_entry(int64_t time, int64_t nonspec_time,
|
|
|
36 int size, ipa_hints hints)
|
|
|
37 : time (time), nonspec_time (nonspec_time), size (size),
|
|
|
38 hints (hints) {}
|
|
|
39 };
|
|
|
40
|
|
|
41 extern vec<edge_growth_cache_entry> edge_growth_cache;
|
|
|
42
|
|
|
43 /* In ipa-inline-analysis.c */
|
|
|
44 int estimate_size_after_inlining (struct cgraph_node *, struct cgraph_edge *);
|
|
|
45 int estimate_growth (struct cgraph_node *);
|
|
|
46 bool growth_likely_positive (struct cgraph_node *, int);
|
|
|
47 int do_estimate_edge_size (struct cgraph_edge *edge);
|
|
|
48 sreal do_estimate_edge_time (struct cgraph_edge *edge);
|
|
|
49 ipa_hints do_estimate_edge_hints (struct cgraph_edge *edge);
|
|
|
50 void initialize_growth_caches (void);
|
|
|
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 int freq_scale);
|
|
|
64
|
|
|
65 extern int ncalls_inlined;
|
|
|
66 extern int nfunctions_inlined;
|
|
|
67
|
|
|
68 /* Return estimated size of the inline sequence of EDGE. */
|
|
|
69
|
|
|
70 static inline int
|
|
|
71 estimate_edge_size (struct cgraph_edge *edge)
|
|
|
72 {
|
|
|
73 int ret;
|
|
|
74 if ((int)edge_growth_cache.length () <= edge->uid
|
|
|
75 || !(ret = edge_growth_cache[edge->uid].size))
|
|
|
76 return do_estimate_edge_size (edge);
|
|
|
77 return ret - (ret > 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 gcc_checking_assert (ipa_call_summaries->get (edge)->call_stmt_size
|
|
|
86 || !edge->callee->analyzed);
|
|
|
87 return (estimate_edge_size (edge)
|
|
|
88 - ipa_call_summaries->get (edge)->call_stmt_size);
|
|
|
89 }
|
|
|
90
|
|
|
91 /* Return estimated callee runtime increase after inlining
|
|
|
92 EDGE. */
|
|
|
93
|
|
|
94 static inline sreal
|
|
|
95 estimate_edge_time (struct cgraph_edge *edge, sreal *nonspec_time = NULL)
|
|
|
96 {
|
|
|
97 sreal ret;
|
|
|
98 if ((int)edge_growth_cache.length () <= edge->uid
|
|
|
99 || !edge_growth_cache[edge->uid].size)
|
|
|
100 return do_estimate_edge_time (edge);
|
|
|
101 if (nonspec_time)
|
|
|
102 *nonspec_time = edge_growth_cache[edge->uid].nonspec_time;
|
|
|
103 return edge_growth_cache[edge->uid].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 ipa_hints ret;
|
|
|
114 if ((int)edge_growth_cache.length () <= edge->uid
|
|
|
115 || !(ret = edge_growth_cache[edge->uid].hints))
|
|
|
116 return do_estimate_edge_hints (edge);
|
|
|
117 return ret - 1;
|
|
|
118 }
|
|
|
119
|
|
|
120 /* Reset cached value for EDGE. */
|
|
|
121
|
|
|
122 static inline void
|
|
|
123 reset_edge_growth_cache (struct cgraph_edge *edge)
|
|
|
124 {
|
|
|
125 if ((int)edge_growth_cache.length () > edge->uid)
|
|
|
126 {
|
|
|
127 struct edge_growth_cache_entry zero (0, 0, 0, 0);
|
|
|
128 edge_growth_cache[edge->uid] = zero;
|
|
|
129 }
|
|
|
130 }
|
|
|
131
|
|
|
132 #endif /* GCC_IPA_INLINE_H */
|
