]>
Commit | Line | Data |
---|---|---|
03dfc36d | 1 | /* Inlining decision heuristics. |
a5544970 | 2 | Copyright (C) 2003-2019 Free Software Foundation, Inc. |
03dfc36d JH |
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 | ||
f1717f8d KC |
21 | #ifndef GCC_IPA_INLINE_H |
22 | #define GCC_IPA_INLINE_H | |
23 | ||
4adaad64 JH |
24 | /* Data we cache about callgraph edges during inlining to avoid expensive |
25 | re-computations during the greedy algorithm. */ | |
84562394 | 26 | struct edge_growth_cache_entry |
632b4f8e | 27 | { |
4adaad64 | 28 | sreal time, nonspec_time; |
ab38481c | 29 | int size; |
0bceb671 | 30 | ipa_hints hints; |
c8fb20d8 YG |
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) {} | |
84562394 | 39 | }; |
632b4f8e | 40 | |
9fb50ad8 | 41 | extern call_summary<edge_growth_cache_entry *> *edge_growth_cache; |
10a5dd5d | 42 | |
fee8b6da | 43 | /* In ipa-inline-analysis.c */ |
03dfc36d | 44 | int estimate_size_after_inlining (struct cgraph_node *, struct cgraph_edge *); |
0d92b555 | 45 | int estimate_growth (struct cgraph_node *); |
4cd8957f | 46 | bool growth_likely_positive (struct cgraph_node *, int); |
ed901e4c | 47 | int do_estimate_edge_size (struct cgraph_edge *edge); |
ab38481c | 48 | sreal do_estimate_edge_time (struct cgraph_edge *edge); |
0bceb671 | 49 | ipa_hints do_estimate_edge_hints (struct cgraph_edge *edge); |
632b4f8e | 50 | void free_growth_caches (void); |
27d020cf JH |
51 | |
52 | /* In ipa-inline.c */ | |
be3c16c4 | 53 | unsigned int early_inliner (function *fun); |
bb1e543c JH |
54 | bool inline_account_function_p (struct cgraph_node *node); |
55 | ||
03dfc36d | 56 | |
fee8b6da | 57 | /* In ipa-inline-transform.c */ |
d52f5295 | 58 | bool inline_call (struct cgraph_edge *, bool, vec<cgraph_edge *> *, int *, bool, |
1bbb87c4 | 59 | bool *callee_removed = NULL); |
fee8b6da | 60 | unsigned int inline_transform (struct cgraph_node *); |
1bad9c18 | 61 | void clone_inlined_nodes (struct cgraph_edge *e, bool, bool, int *); |
fee8b6da JH |
62 | |
63 | extern int ncalls_inlined; | |
64 | extern int nfunctions_inlined; | |
65 | ||
ed901e4c | 66 | /* Return estimated size of the inline sequence of EDGE. */ |
03dfc36d JH |
67 | |
68 | static inline int | |
ed901e4c | 69 | estimate_edge_size (struct cgraph_edge *edge) |
03dfc36d | 70 | { |
9fb50ad8 ML |
71 | edge_growth_cache_entry *entry; |
72 | if (edge_growth_cache == NULL | |
73 | || (entry = edge_growth_cache->get (edge)) == NULL | |
74 | || entry->size == 0) | |
ed901e4c | 75 | return do_estimate_edge_size (edge); |
9fb50ad8 | 76 | return entry->size - (entry->size > 0); |
632b4f8e JH |
77 | } |
78 | ||
ed901e4c JH |
79 | /* Return estimated callee growth after inlining EDGE. */ |
80 | ||
81 | static inline int | |
82 | estimate_edge_growth (struct cgraph_edge *edge) | |
83 | { | |
6f86434f | 84 | ipa_call_summary *s = ipa_call_summaries->get (edge); |
cf9b0b5f ML |
85 | gcc_checking_assert (s->call_stmt_size || !edge->callee->analyzed); |
86 | return (estimate_edge_size (edge) - s->call_stmt_size); | |
ed901e4c | 87 | } |
632b4f8e | 88 | |
5764ee3c | 89 | /* Return estimated callee runtime increase after inlining |
632b4f8e JH |
90 | EDGE. */ |
91 | ||
ab38481c | 92 | static inline sreal |
4adaad64 | 93 | estimate_edge_time (struct cgraph_edge *edge, sreal *nonspec_time = NULL) |
632b4f8e | 94 | { |
9fb50ad8 ML |
95 | edge_growth_cache_entry *entry; |
96 | if (edge_growth_cache == NULL | |
97 | || (entry = edge_growth_cache->get (edge)) == NULL | |
98 | || entry->time == 0) | |
632b4f8e | 99 | return do_estimate_edge_time (edge); |
4adaad64 | 100 | if (nonspec_time) |
9fb50ad8 ML |
101 | *nonspec_time = edge_growth_cache->get (edge)->nonspec_time; |
102 | return entry->time; | |
632b4f8e JH |
103 | } |
104 | ||
105 | ||
5764ee3c | 106 | /* Return estimated callee runtime increase after inlining |
37678631 JH |
107 | EDGE. */ |
108 | ||
0bceb671 | 109 | static inline ipa_hints |
37678631 JH |
110 | estimate_edge_hints (struct cgraph_edge *edge) |
111 | { | |
9fb50ad8 ML |
112 | edge_growth_cache_entry *entry; |
113 | if (edge_growth_cache == NULL | |
114 | || (entry = edge_growth_cache->get (edge)) == NULL | |
115 | || entry->hints == 0) | |
de99ac70 | 116 | return do_estimate_edge_hints (edge); |
9fb50ad8 | 117 | return entry->hints - 1; |
03dfc36d | 118 | } |
f1717f8d KC |
119 | |
120 | #endif /* GCC_IPA_INLINE_H */ |