]>
Commit | Line | Data |
---|---|---|
1431bff6 | 1 | /* Tree inlining hooks and declarations. |
f1717362 | 2 | Copyright (C) 2001-2016 Free Software Foundation, Inc. |
1431bff6 | 3 | Contributed by Alexandre Oliva <aoliva@redhat.com> |
4 | ||
4642865b | 5 | This file is part of GCC. |
1431bff6 | 6 | |
4642865b | 7 | GCC is free software; you can redistribute it and/or modify |
1431bff6 | 8 | it under the terms of the GNU General Public License as published by |
8c4c00c1 | 9 | the Free Software Foundation; either version 3, or (at your option) |
1431bff6 | 10 | any later version. |
11 | ||
4642865b | 12 | GCC is distributed in the hope that it will be useful, |
1431bff6 | 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
1431bff6 | 20 | |
21 | #ifndef GCC_TREE_INLINE_H | |
22 | #define GCC_TREE_INLINE_H | |
23 | ||
431205b7 | 24 | |
19bcf521 | 25 | struct cgraph_edge; |
51a48c27 | 26 | |
0b09525f | 27 | /* Indicate the desired behavior wrt call graph edges. We can either |
28 | duplicate the edge (inlining, cloning), move the edge (versioning, | |
29 | parallelization), or move the edges of the clones (saving). */ | |
30 | ||
31 | enum copy_body_cge_which | |
32 | { | |
33 | CB_CGE_DUPLICATE, | |
34 | CB_CGE_MOVE, | |
35 | CB_CGE_MOVE_CLONES | |
36 | }; | |
37 | ||
613732c1 | 38 | typedef int_hash <unsigned short, 0> dependence_hash; |
62b0a610 | 39 | |
51a48c27 | 40 | /* Data required for function body duplication. */ |
41 | ||
b3e7c666 | 42 | struct copy_body_data |
51a48c27 | 43 | { |
44 | /* FUNCTION_DECL for function being inlined, or in general the | |
45 | source function providing the original trees. */ | |
46 | tree src_fn; | |
75a70cf9 | 47 | |
51a48c27 | 48 | /* FUNCTION_DECL for function being inlined into, or in general |
49 | the destination function receiving the new trees. */ | |
50 | tree dst_fn; | |
75a70cf9 | 51 | |
51a48c27 | 52 | /* Callgraph node of the source function. */ |
53 | struct cgraph_node *src_node; | |
75a70cf9 | 54 | |
51a48c27 | 55 | /* Callgraph node of the destination function. */ |
56 | struct cgraph_node *dst_node; | |
75a70cf9 | 57 | |
51a48c27 | 58 | /* struct function for function being inlined. Usually this is the same |
59 | as DECL_STRUCT_FUNCTION (src_fn), but can be different if saved_cfg | |
60 | and saved_eh are in use. */ | |
61 | struct function *src_cfun; | |
62 | ||
63 | /* The VAR_DECL for the return value. */ | |
64 | tree retvar; | |
75a70cf9 | 65 | |
058a1b7a | 66 | /* The VAR_DECL for the return bounds. */ |
67 | tree retbnd; | |
68 | ||
69 | /* Assign statements that need bounds copy. */ | |
42acab1c | 70 | vec<gimple *> assign_stmts; |
058a1b7a | 71 | |
51a48c27 | 72 | /* The map from local declarations in the inlined function to |
73 | equivalents in the function into which it is being inlined. */ | |
06ecf488 | 74 | hash_map<tree, tree> *decl_map; |
51a48c27 | 75 | |
76 | /* Create a new decl to replace DECL in the destination function. */ | |
77 | tree (*copy_decl) (tree, struct copy_body_data *); | |
78 | ||
79 | /* Current BLOCK. */ | |
80 | tree block; | |
81 | ||
75a70cf9 | 82 | /* GIMPLE_CALL if va arg parameter packs should be expanded or NULL |
48dc2227 | 83 | is not. */ |
42acab1c | 84 | gimple *call_stmt; |
48dc2227 | 85 | |
e38def9c | 86 | /* Exception landing pad the inlined call lies in. */ |
87 | int eh_lp_nr; | |
75a70cf9 | 88 | |
e38def9c | 89 | /* Maps region and landing pad structures from the function being copied |
90 | to duplicates created within the function we inline into. */ | |
06ecf488 | 91 | hash_map<void *, void *> *eh_map; |
51a48c27 | 92 | |
93 | /* We use the same mechanism do all sorts of different things. Rather | |
9ca2c29a | 94 | than enumerating the different cases, we categorize the behavior |
51a48c27 | 95 | in the various situations. */ |
96 | ||
0b09525f | 97 | /* What to do with call graph edges. */ |
98 | enum copy_body_cge_which transform_call_graph_edges; | |
51a48c27 | 99 | |
100 | /* True if a new CFG should be created. False for inlining, true for | |
101 | everything else. */ | |
102 | bool transform_new_cfg; | |
103 | ||
104 | /* True if RETURN_EXPRs should be transformed to just the contained | |
105 | MODIFY_EXPR. The branch semantics of the return will be handled | |
106 | by manipulating the CFG rather than a statement. */ | |
107 | bool transform_return_to_modify; | |
108 | ||
6b99cb5e | 109 | /* True if the parameters of the source function are transformed. |
110 | Only true for inlining. */ | |
111 | bool transform_parameter; | |
112 | ||
3d053ea5 | 113 | /* True if this statement will need to be regimplified. */ |
114 | bool regimplify; | |
115 | ||
4189e677 | 116 | /* True if trees should not be unshared. */ |
117 | bool do_not_unshare; | |
118 | ||
ed6049c8 | 119 | /* > 0 if we are remapping a type currently. */ |
120 | int remapping_type_depth; | |
121 | ||
32020b10 | 122 | /* A function to be called when duplicating BLOCK nodes. */ |
123 | void (*transform_lang_insert_block) (tree); | |
124 | ||
3e9045dd | 125 | /* Statements that might be possibly folded. */ |
42acab1c | 126 | hash_set<gimple *> *statements_to_fold; |
186f5fff | 127 | |
128 | /* Entry basic block to currently copied body. */ | |
161dfa6e | 129 | basic_block entry_bb; |
9845d120 | 130 | |
da51794e | 131 | /* For partial function versioning, bitmap of bbs to be copied, |
132 | otherwise NULL. */ | |
133 | bitmap blocks_to_copy; | |
134 | ||
9845d120 | 135 | /* Debug statements that need processing. */ |
1a91d914 | 136 | vec<gdebug *> debug_stmts; |
9845d120 | 137 | |
138 | /* A map from local declarations in the inlined function to | |
139 | equivalents in the function into which it is being inlined, where | |
140 | the originals have been mapped to a value rather than to a | |
141 | variable. */ | |
06ecf488 | 142 | hash_map<tree, tree> *debug_map; |
d037099f | 143 | |
144 | /* Cilk keywords currently need to replace some variables that | |
145 | ordinary nested functions do not. */ | |
146 | bool remap_var_for_cilk; | |
62b0a610 | 147 | |
148 | /* A map from the inlined functions dependence info cliques to | |
149 | equivalents in the function into which it is being inlined. */ | |
ee34b0e4 | 150 | hash_map<dependence_hash, unsigned short> *dependence_map; |
b3e7c666 | 151 | }; |
51a48c27 | 152 | |
bc8bb825 | 153 | /* Weights of constructions for estimate_num_insns. */ |
154 | ||
6dc50383 | 155 | struct eni_weights |
bc8bb825 | 156 | { |
157 | /* Cost per call. */ | |
158 | unsigned call_cost; | |
159 | ||
20da2013 | 160 | /* Cost per indirect call. */ |
161 | unsigned indirect_call_cost; | |
162 | ||
4a5b1b7c | 163 | /* Cost per call to a target specific builtin */ |
164 | unsigned target_builtin_call_cost; | |
165 | ||
bc8bb825 | 166 | /* Cost of "expensive" div and mod operations. */ |
167 | unsigned div_mod_cost; | |
168 | ||
bc8bb825 | 169 | /* Cost for omp construct. */ |
170 | unsigned omp_cost; | |
94e6e359 | 171 | |
4c0315d0 | 172 | /* Cost for tm transaction. */ |
173 | unsigned tm_cost; | |
174 | ||
958b3c8a | 175 | /* Cost of return. */ |
176 | unsigned return_cost; | |
177 | ||
10260337 | 178 | /* True when time of statement should be estimated. Thus, the |
179 | cost of a switch statement is logarithmic rather than linear in number | |
94e6e359 | 180 | of cases. */ |
181 | bool time_based; | |
6dc50383 | 182 | }; |
bc8bb825 | 183 | |
184 | /* Weights that estimate_num_insns uses for heuristics in inlining. */ | |
185 | ||
186 | extern eni_weights eni_inlining_weights; | |
187 | ||
188 | /* Weights that estimate_num_insns uses to estimate the size of the | |
189 | produced code. */ | |
190 | ||
191 | extern eni_weights eni_size_weights; | |
192 | ||
193 | /* Weights that estimate_num_insns uses to estimate the time necessary | |
194 | to execute the produced code. */ | |
195 | ||
196 | extern eni_weights eni_time_weights; | |
197 | ||
1431bff6 | 198 | /* Function prototypes. */ |
9ed99284 | 199 | void init_inline_once (void); |
75a70cf9 | 200 | extern tree copy_tree_body_r (tree *, int *, void *); |
51a48c27 | 201 | extern void insert_decl_map (copy_body_data *, tree, tree); |
09a2e412 | 202 | unsigned int optimize_inline_calls (tree); |
4189e677 | 203 | tree maybe_inline_call_in_expr (tree); |
746149b7 | 204 | bool tree_inlinable_function_p (tree); |
ff6fba0d | 205 | tree copy_tree_r (tree *, int *, void *); |
32020b10 | 206 | tree copy_decl_no_change (tree decl, copy_body_data *id); |
96c7c99c | 207 | int estimate_move_cost (tree type, bool); |
42acab1c | 208 | int estimate_num_insns (gimple *, eni_weights *); |
75a70cf9 | 209 | int estimate_num_insns_fn (tree, eni_weights *); |
100f989e | 210 | int estimate_num_insns_seq (gimple_seq, eni_weights *); |
c5235c0b | 211 | bool tree_versionable_function_p (tree); |
51a48c27 | 212 | extern tree remap_decl (tree decl, copy_body_data *id); |
213 | extern tree remap_type (tree type, copy_body_data *id); | |
75a70cf9 | 214 | extern gimple_seq copy_gimple_seq_and_replace_locals (gimple_seq seq); |
9ed99284 | 215 | extern bool debug_find_tree (tree, tree); |
9c96033c | 216 | extern tree copy_fn (tree, tree&, tree&); |
66124ce7 | 217 | extern const char *copy_forbidden (struct function *fun, tree fndecl); |
9ed99284 | 218 | |
219 | /* This is in tree-inline.c since the routine uses | |
220 | data structures from the inliner. */ | |
221 | extern tree build_duplicate_type (tree); | |
1431bff6 | 222 | |
1431bff6 | 223 | #endif /* GCC_TREE_INLINE_H */ |