]>
Commit | Line | Data |
---|---|---|
ac534736 | 1 | /* Tree inlining. |
082ab5ff | 2 | Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 |
ebb07520 | 3 | Free Software Foundation, Inc. |
588d3ade AO |
4 | Contributed by Alexandre Oliva <aoliva@redhat.com> |
5 | ||
54a7b573 | 6 | This file is part of GCC. |
588d3ade | 7 | |
54a7b573 | 8 | GCC is free software; you can redistribute it and/or modify |
588d3ade | 9 | it under the terms of the GNU General Public License as published by |
9dcd6f09 | 10 | the Free Software Foundation; either version 3, or (at your option) |
588d3ade AO |
11 | any later version. |
12 | ||
54a7b573 | 13 | GCC is distributed in the hope that it will be useful, |
588d3ade AO |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
588d3ade AO |
21 | |
22 | #include "config.h" | |
23 | #include "system.h" | |
4977bab6 ZW |
24 | #include "coretypes.h" |
25 | #include "tm.h" | |
718f9c0f MLI |
26 | #include "toplev.h" /* floor_log2 */ |
27 | #include "diagnostic-core.h" | |
588d3ade AO |
28 | #include "tree.h" |
29 | #include "tree-inline.h" | |
d4e4baa9 AO |
30 | #include "flags.h" |
31 | #include "params.h" | |
32 | #include "input.h" | |
33 | #include "insn-config.h" | |
d4e4baa9 | 34 | #include "hashtab.h" |
d23c55c2 | 35 | #include "langhooks.h" |
e21aff8a SB |
36 | #include "basic-block.h" |
37 | #include "tree-iterator.h" | |
1c4a429a | 38 | #include "cgraph.h" |
ddd2d57e | 39 | #include "intl.h" |
6de9cd9a | 40 | #include "tree-mudflap.h" |
089efaa4 | 41 | #include "tree-flow.h" |
18c6ada9 | 42 | #include "function.h" |
e21aff8a | 43 | #include "tree-flow.h" |
cf835838 | 44 | #include "tree-pretty-print.h" |
e21aff8a | 45 | #include "except.h" |
1eb3331e | 46 | #include "debug.h" |
e21aff8a | 47 | #include "pointer-set.h" |
19734dd8 | 48 | #include "ipa-prop.h" |
6946b3f7 | 49 | #include "value-prof.h" |
110cfe1c | 50 | #include "tree-pass.h" |
18177c7e RG |
51 | #include "target.h" |
52 | #include "integrate.h" | |
d4e4baa9 | 53 | |
2eb79bbb SB |
54 | #include "rtl.h" /* FIXME: For asm_str_count. */ |
55 | ||
6de9cd9a DN |
56 | /* I'm not real happy about this, but we need to handle gimple and |
57 | non-gimple trees. */ | |
726a989a | 58 | #include "gimple.h" |
588d3ade | 59 | |
1b369fae | 60 | /* Inlining, Cloning, Versioning, Parallelization |
e21aff8a SB |
61 | |
62 | Inlining: a function body is duplicated, but the PARM_DECLs are | |
63 | remapped into VAR_DECLs, and non-void RETURN_EXPRs become | |
726a989a | 64 | MODIFY_EXPRs that store to a dedicated returned-value variable. |
e21aff8a SB |
65 | The duplicated eh_region info of the copy will later be appended |
66 | to the info for the caller; the eh_region info in copied throwing | |
1d65f45c | 67 | statements and RESX statements are adjusted accordingly. |
e21aff8a | 68 | |
e21aff8a SB |
69 | Cloning: (only in C++) We have one body for a con/de/structor, and |
70 | multiple function decls, each with a unique parameter list. | |
71 | Duplicate the body, using the given splay tree; some parameters | |
72 | will become constants (like 0 or 1). | |
73 | ||
1b369fae RH |
74 | Versioning: a function body is duplicated and the result is a new |
75 | function rather than into blocks of an existing function as with | |
76 | inlining. Some parameters will become constants. | |
77 | ||
78 | Parallelization: a region of a function is duplicated resulting in | |
79 | a new function. Variables may be replaced with complex expressions | |
80 | to enable shared variable semantics. | |
81 | ||
e21aff8a SB |
82 | All of these will simultaneously lookup any callgraph edges. If |
83 | we're going to inline the duplicated function body, and the given | |
84 | function has some cloned callgraph nodes (one for each place this | |
85 | function will be inlined) those callgraph edges will be duplicated. | |
1b369fae | 86 | If we're cloning the body, those callgraph edges will be |
e21aff8a SB |
87 | updated to point into the new body. (Note that the original |
88 | callgraph node and edge list will not be altered.) | |
89 | ||
726a989a | 90 | See the CALL_EXPR handling case in copy_tree_body_r (). */ |
e21aff8a | 91 | |
d4e4baa9 AO |
92 | /* To Do: |
93 | ||
94 | o In order to make inlining-on-trees work, we pessimized | |
95 | function-local static constants. In particular, they are now | |
96 | always output, even when not addressed. Fix this by treating | |
97 | function-local static constants just like global static | |
98 | constants; the back-end already knows not to output them if they | |
99 | are not needed. | |
100 | ||
101 | o Provide heuristics to clamp inlining of recursive template | |
102 | calls? */ | |
103 | ||
7f9bc51b | 104 | |
7f9bc51b ZD |
105 | /* Weights that estimate_num_insns uses to estimate the size of the |
106 | produced code. */ | |
107 | ||
108 | eni_weights eni_size_weights; | |
109 | ||
110 | /* Weights that estimate_num_insns uses to estimate the time necessary | |
111 | to execute the produced code. */ | |
112 | ||
113 | eni_weights eni_time_weights; | |
114 | ||
d4e4baa9 AO |
115 | /* Prototypes. */ |
116 | ||
6938f93f | 117 | static tree declare_return_variable (copy_body_data *, tree, tree, basic_block); |
1b369fae | 118 | static void remap_block (tree *, copy_body_data *); |
1b369fae | 119 | static void copy_bind_expr (tree *, int *, copy_body_data *); |
6de9cd9a | 120 | static tree mark_local_for_remap_r (tree *, int *, void *); |
19114537 | 121 | static void unsave_expr_1 (tree); |
6de9cd9a | 122 | static tree unsave_r (tree *, int *, void *); |
e21aff8a | 123 | static void declare_inline_vars (tree, tree); |
892c7e1e | 124 | static void remap_save_expr (tree *, void *, int *); |
4a283090 | 125 | static void prepend_lexical_block (tree current_block, tree new_block); |
1b369fae | 126 | static tree copy_decl_to_var (tree, copy_body_data *); |
c08cd4c1 | 127 | static tree copy_result_decl_to_var (tree, copy_body_data *); |
1b369fae | 128 | static tree copy_decl_maybe_to_var (tree, copy_body_data *); |
726a989a | 129 | static gimple remap_gimple_stmt (gimple, copy_body_data *); |
078c3644 | 130 | static bool delete_unreachable_blocks_update_callgraph (copy_body_data *id); |
e21aff8a | 131 | |
5e20bdd7 JZ |
132 | /* Insert a tree->tree mapping for ID. Despite the name suggests |
133 | that the trees should be variables, it is used for more than that. */ | |
134 | ||
1b369fae RH |
135 | void |
136 | insert_decl_map (copy_body_data *id, tree key, tree value) | |
5e20bdd7 | 137 | { |
6be42dd4 | 138 | *pointer_map_insert (id->decl_map, key) = value; |
5e20bdd7 JZ |
139 | |
140 | /* Always insert an identity map as well. If we see this same new | |
141 | node again, we won't want to duplicate it a second time. */ | |
142 | if (key != value) | |
6be42dd4 | 143 | *pointer_map_insert (id->decl_map, value) = value; |
5e20bdd7 JZ |
144 | } |
145 | ||
b5b8b0ac AO |
146 | /* Insert a tree->tree mapping for ID. This is only used for |
147 | variables. */ | |
148 | ||
149 | static void | |
150 | insert_debug_decl_map (copy_body_data *id, tree key, tree value) | |
151 | { | |
152 | if (!gimple_in_ssa_p (id->src_cfun)) | |
153 | return; | |
154 | ||
155 | if (!MAY_HAVE_DEBUG_STMTS) | |
156 | return; | |
157 | ||
158 | if (!target_for_debug_bind (key)) | |
159 | return; | |
160 | ||
161 | gcc_assert (TREE_CODE (key) == PARM_DECL); | |
162 | gcc_assert (TREE_CODE (value) == VAR_DECL); | |
163 | ||
164 | if (!id->debug_map) | |
165 | id->debug_map = pointer_map_create (); | |
166 | ||
167 | *pointer_map_insert (id->debug_map, key) = value; | |
168 | } | |
169 | ||
082ab5ff JJ |
170 | /* If nonzero, we're remapping the contents of inlined debug |
171 | statements. If negative, an error has occurred, such as a | |
172 | reference to a variable that isn't available in the inlined | |
173 | context. */ | |
174 | static int processing_debug_stmt = 0; | |
175 | ||
110cfe1c JH |
176 | /* Construct new SSA name for old NAME. ID is the inline context. */ |
177 | ||
178 | static tree | |
179 | remap_ssa_name (tree name, copy_body_data *id) | |
180 | { | |
82d6e6fc | 181 | tree new_tree; |
6be42dd4 | 182 | tree *n; |
110cfe1c JH |
183 | |
184 | gcc_assert (TREE_CODE (name) == SSA_NAME); | |
185 | ||
6be42dd4 | 186 | n = (tree *) pointer_map_contains (id->decl_map, name); |
110cfe1c | 187 | if (n) |
129a37fc | 188 | return unshare_expr (*n); |
110cfe1c | 189 | |
082ab5ff JJ |
190 | if (processing_debug_stmt) |
191 | { | |
192 | processing_debug_stmt = -1; | |
193 | return name; | |
194 | } | |
195 | ||
110cfe1c JH |
196 | /* Do not set DEF_STMT yet as statement is not copied yet. We do that |
197 | in copy_bb. */ | |
82d6e6fc | 198 | new_tree = remap_decl (SSA_NAME_VAR (name), id); |
726a989a | 199 | |
110cfe1c | 200 | /* We might've substituted constant or another SSA_NAME for |
b8698a0f | 201 | the variable. |
110cfe1c JH |
202 | |
203 | Replace the SSA name representing RESULT_DECL by variable during | |
204 | inlining: this saves us from need to introduce PHI node in a case | |
205 | return value is just partly initialized. */ | |
82d6e6fc | 206 | if ((TREE_CODE (new_tree) == VAR_DECL || TREE_CODE (new_tree) == PARM_DECL) |
110cfe1c JH |
207 | && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL |
208 | || !id->transform_return_to_modify)) | |
209 | { | |
25a6a873 | 210 | struct ptr_info_def *pi; |
82d6e6fc KG |
211 | new_tree = make_ssa_name (new_tree, NULL); |
212 | insert_decl_map (id, name, new_tree); | |
213 | SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree) | |
110cfe1c | 214 | = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name); |
82d6e6fc | 215 | TREE_TYPE (new_tree) = TREE_TYPE (SSA_NAME_VAR (new_tree)); |
25a6a873 RG |
216 | /* At least IPA points-to info can be directly transferred. */ |
217 | if (id->src_cfun->gimple_df | |
218 | && id->src_cfun->gimple_df->ipa_pta | |
219 | && (pi = SSA_NAME_PTR_INFO (name)) | |
220 | && !pi->pt.anything) | |
221 | { | |
222 | struct ptr_info_def *new_pi = get_ptr_info (new_tree); | |
223 | new_pi->pt = pi->pt; | |
224 | } | |
726a989a | 225 | if (gimple_nop_p (SSA_NAME_DEF_STMT (name))) |
045685a9 JH |
226 | { |
227 | /* By inlining function having uninitialized variable, we might | |
228 | extend the lifetime (variable might get reused). This cause | |
229 | ICE in the case we end up extending lifetime of SSA name across | |
fa10beec | 230 | abnormal edge, but also increase register pressure. |
045685a9 | 231 | |
726a989a RB |
232 | We simply initialize all uninitialized vars by 0 except |
233 | for case we are inlining to very first BB. We can avoid | |
234 | this for all BBs that are not inside strongly connected | |
235 | regions of the CFG, but this is expensive to test. */ | |
236 | if (id->entry_bb | |
237 | && is_gimple_reg (SSA_NAME_VAR (name)) | |
dcad005d | 238 | && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name) |
045685a9 | 239 | && TREE_CODE (SSA_NAME_VAR (name)) != PARM_DECL |
0723b99a | 240 | && (id->entry_bb != EDGE_SUCC (ENTRY_BLOCK_PTR, 0)->dest |
045685a9 JH |
241 | || EDGE_COUNT (id->entry_bb->preds) != 1)) |
242 | { | |
726a989a RB |
243 | gimple_stmt_iterator gsi = gsi_last_bb (id->entry_bb); |
244 | gimple init_stmt; | |
b8698a0f | 245 | |
82d6e6fc KG |
246 | init_stmt = gimple_build_assign (new_tree, |
247 | fold_convert (TREE_TYPE (new_tree), | |
045685a9 | 248 | integer_zero_node)); |
726a989a | 249 | gsi_insert_after (&gsi, init_stmt, GSI_NEW_STMT); |
82d6e6fc | 250 | SSA_NAME_IS_DEFAULT_DEF (new_tree) = 0; |
045685a9 JH |
251 | } |
252 | else | |
253 | { | |
82d6e6fc | 254 | SSA_NAME_DEF_STMT (new_tree) = gimple_build_nop (); |
726a989a RB |
255 | if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name)) |
256 | == name) | |
82d6e6fc | 257 | set_default_def (SSA_NAME_VAR (new_tree), new_tree); |
045685a9 JH |
258 | } |
259 | } | |
110cfe1c JH |
260 | } |
261 | else | |
82d6e6fc KG |
262 | insert_decl_map (id, name, new_tree); |
263 | return new_tree; | |
110cfe1c JH |
264 | } |
265 | ||
e21aff8a | 266 | /* Remap DECL during the copying of the BLOCK tree for the function. */ |
d4e4baa9 | 267 | |
1b369fae RH |
268 | tree |
269 | remap_decl (tree decl, copy_body_data *id) | |
d4e4baa9 | 270 | { |
6be42dd4 | 271 | tree *n; |
e21aff8a SB |
272 | |
273 | /* We only remap local variables in the current function. */ | |
3c2a7a6a | 274 | |
e21aff8a SB |
275 | /* See if we have remapped this declaration. */ |
276 | ||
6be42dd4 | 277 | n = (tree *) pointer_map_contains (id->decl_map, decl); |
e21aff8a | 278 | |
b5b8b0ac AO |
279 | if (!n && processing_debug_stmt) |
280 | { | |
281 | processing_debug_stmt = -1; | |
282 | return decl; | |
283 | } | |
284 | ||
e21aff8a SB |
285 | /* If we didn't already have an equivalent for this declaration, |
286 | create one now. */ | |
d4e4baa9 AO |
287 | if (!n) |
288 | { | |
d4e4baa9 | 289 | /* Make a copy of the variable or label. */ |
1b369fae | 290 | tree t = id->copy_decl (decl, id); |
b8698a0f | 291 | |
596b98ce AO |
292 | /* Remember it, so that if we encounter this local entity again |
293 | we can reuse this copy. Do this early because remap_type may | |
294 | need this decl for TYPE_STUB_DECL. */ | |
295 | insert_decl_map (id, decl, t); | |
296 | ||
1b369fae RH |
297 | if (!DECL_P (t)) |
298 | return t; | |
299 | ||
3c2a7a6a RH |
300 | /* Remap types, if necessary. */ |
301 | TREE_TYPE (t) = remap_type (TREE_TYPE (t), id); | |
302 | if (TREE_CODE (t) == TYPE_DECL) | |
303 | DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id); | |
3c2a7a6a RH |
304 | |
305 | /* Remap sizes as necessary. */ | |
726a989a RB |
306 | walk_tree (&DECL_SIZE (t), copy_tree_body_r, id, NULL); |
307 | walk_tree (&DECL_SIZE_UNIT (t), copy_tree_body_r, id, NULL); | |
d4e4baa9 | 308 | |
8c27b7d4 | 309 | /* If fields, do likewise for offset and qualifier. */ |
5377d5ba RK |
310 | if (TREE_CODE (t) == FIELD_DECL) |
311 | { | |
726a989a | 312 | walk_tree (&DECL_FIELD_OFFSET (t), copy_tree_body_r, id, NULL); |
5377d5ba | 313 | if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE) |
726a989a | 314 | walk_tree (&DECL_QUALIFIER (t), copy_tree_body_r, id, NULL); |
5377d5ba RK |
315 | } |
316 | ||
110cfe1c JH |
317 | if (cfun && gimple_in_ssa_p (cfun) |
318 | && (TREE_CODE (t) == VAR_DECL | |
319 | || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL)) | |
320 | { | |
110cfe1c | 321 | get_var_ann (t); |
110cfe1c JH |
322 | add_referenced_var (t); |
323 | } | |
5e20bdd7 | 324 | return t; |
d4e4baa9 AO |
325 | } |
326 | ||
f82a627c EB |
327 | if (id->do_not_unshare) |
328 | return *n; | |
329 | else | |
330 | return unshare_expr (*n); | |
d4e4baa9 AO |
331 | } |
332 | ||
3c2a7a6a | 333 | static tree |
1b369fae | 334 | remap_type_1 (tree type, copy_body_data *id) |
3c2a7a6a | 335 | { |
82d6e6fc | 336 | tree new_tree, t; |
3c2a7a6a | 337 | |
ed397c43 RK |
338 | /* We do need a copy. build and register it now. If this is a pointer or |
339 | reference type, remap the designated type and make a new pointer or | |
340 | reference type. */ | |
341 | if (TREE_CODE (type) == POINTER_TYPE) | |
342 | { | |
82d6e6fc | 343 | new_tree = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id), |
ed397c43 RK |
344 | TYPE_MODE (type), |
345 | TYPE_REF_CAN_ALIAS_ALL (type)); | |
040c6d51 MM |
346 | if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type)) |
347 | new_tree = build_type_attribute_qual_variant (new_tree, | |
348 | TYPE_ATTRIBUTES (type), | |
349 | TYPE_QUALS (type)); | |
82d6e6fc KG |
350 | insert_decl_map (id, type, new_tree); |
351 | return new_tree; | |
ed397c43 RK |
352 | } |
353 | else if (TREE_CODE (type) == REFERENCE_TYPE) | |
354 | { | |
82d6e6fc | 355 | new_tree = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id), |
ed397c43 RK |
356 | TYPE_MODE (type), |
357 | TYPE_REF_CAN_ALIAS_ALL (type)); | |
040c6d51 MM |
358 | if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type)) |
359 | new_tree = build_type_attribute_qual_variant (new_tree, | |
360 | TYPE_ATTRIBUTES (type), | |
361 | TYPE_QUALS (type)); | |
82d6e6fc KG |
362 | insert_decl_map (id, type, new_tree); |
363 | return new_tree; | |
ed397c43 RK |
364 | } |
365 | else | |
82d6e6fc | 366 | new_tree = copy_node (type); |
ed397c43 | 367 | |
82d6e6fc | 368 | insert_decl_map (id, type, new_tree); |
3c2a7a6a RH |
369 | |
370 | /* This is a new type, not a copy of an old type. Need to reassociate | |
371 | variants. We can handle everything except the main variant lazily. */ | |
372 | t = TYPE_MAIN_VARIANT (type); | |
373 | if (type != t) | |
374 | { | |
375 | t = remap_type (t, id); | |
82d6e6fc KG |
376 | TYPE_MAIN_VARIANT (new_tree) = t; |
377 | TYPE_NEXT_VARIANT (new_tree) = TYPE_NEXT_VARIANT (t); | |
378 | TYPE_NEXT_VARIANT (t) = new_tree; | |
3c2a7a6a RH |
379 | } |
380 | else | |
381 | { | |
82d6e6fc KG |
382 | TYPE_MAIN_VARIANT (new_tree) = new_tree; |
383 | TYPE_NEXT_VARIANT (new_tree) = NULL; | |
3c2a7a6a RH |
384 | } |
385 | ||
596b98ce | 386 | if (TYPE_STUB_DECL (type)) |
82d6e6fc | 387 | TYPE_STUB_DECL (new_tree) = remap_decl (TYPE_STUB_DECL (type), id); |
596b98ce | 388 | |
3c2a7a6a | 389 | /* Lazily create pointer and reference types. */ |
82d6e6fc KG |
390 | TYPE_POINTER_TO (new_tree) = NULL; |
391 | TYPE_REFERENCE_TO (new_tree) = NULL; | |
3c2a7a6a | 392 | |
82d6e6fc | 393 | switch (TREE_CODE (new_tree)) |
3c2a7a6a RH |
394 | { |
395 | case INTEGER_TYPE: | |
396 | case REAL_TYPE: | |
325217ed | 397 | case FIXED_POINT_TYPE: |
3c2a7a6a RH |
398 | case ENUMERAL_TYPE: |
399 | case BOOLEAN_TYPE: | |
82d6e6fc | 400 | t = TYPE_MIN_VALUE (new_tree); |
3c2a7a6a | 401 | if (t && TREE_CODE (t) != INTEGER_CST) |
82d6e6fc | 402 | walk_tree (&TYPE_MIN_VALUE (new_tree), copy_tree_body_r, id, NULL); |
1c9766da | 403 | |
82d6e6fc | 404 | t = TYPE_MAX_VALUE (new_tree); |
3c2a7a6a | 405 | if (t && TREE_CODE (t) != INTEGER_CST) |
82d6e6fc KG |
406 | walk_tree (&TYPE_MAX_VALUE (new_tree), copy_tree_body_r, id, NULL); |
407 | return new_tree; | |
9f63daea | 408 | |
3c2a7a6a | 409 | case FUNCTION_TYPE: |
82d6e6fc KG |
410 | TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id); |
411 | walk_tree (&TYPE_ARG_TYPES (new_tree), copy_tree_body_r, id, NULL); | |
412 | return new_tree; | |
3c2a7a6a RH |
413 | |
414 | case ARRAY_TYPE: | |
82d6e6fc KG |
415 | TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id); |
416 | TYPE_DOMAIN (new_tree) = remap_type (TYPE_DOMAIN (new_tree), id); | |
3c2a7a6a RH |
417 | break; |
418 | ||
419 | case RECORD_TYPE: | |
420 | case UNION_TYPE: | |
421 | case QUAL_UNION_TYPE: | |
52dd234b RH |
422 | { |
423 | tree f, nf = NULL; | |
424 | ||
82d6e6fc | 425 | for (f = TYPE_FIELDS (new_tree); f ; f = TREE_CHAIN (f)) |
52dd234b RH |
426 | { |
427 | t = remap_decl (f, id); | |
82d6e6fc | 428 | DECL_CONTEXT (t) = new_tree; |
52dd234b RH |
429 | TREE_CHAIN (t) = nf; |
430 | nf = t; | |
431 | } | |
82d6e6fc | 432 | TYPE_FIELDS (new_tree) = nreverse (nf); |
52dd234b | 433 | } |
3c2a7a6a RH |
434 | break; |
435 | ||
3c2a7a6a RH |
436 | case OFFSET_TYPE: |
437 | default: | |
438 | /* Shouldn't have been thought variable sized. */ | |
1e128c5f | 439 | gcc_unreachable (); |
3c2a7a6a RH |
440 | } |
441 | ||
82d6e6fc KG |
442 | walk_tree (&TYPE_SIZE (new_tree), copy_tree_body_r, id, NULL); |
443 | walk_tree (&TYPE_SIZE_UNIT (new_tree), copy_tree_body_r, id, NULL); | |
3c2a7a6a | 444 | |
82d6e6fc | 445 | return new_tree; |
3c2a7a6a RH |
446 | } |
447 | ||
1b369fae RH |
448 | tree |
449 | remap_type (tree type, copy_body_data *id) | |
52dd234b | 450 | { |
6be42dd4 | 451 | tree *node; |
4f5c64b8 | 452 | tree tmp; |
52dd234b RH |
453 | |
454 | if (type == NULL) | |
455 | return type; | |
456 | ||
457 | /* See if we have remapped this type. */ | |
6be42dd4 | 458 | node = (tree *) pointer_map_contains (id->decl_map, type); |
52dd234b | 459 | if (node) |
6be42dd4 | 460 | return *node; |
52dd234b RH |
461 | |
462 | /* The type only needs remapping if it's variably modified. */ | |
1b369fae | 463 | if (! variably_modified_type_p (type, id->src_fn)) |
52dd234b RH |
464 | { |
465 | insert_decl_map (id, type, type); | |
466 | return type; | |
467 | } | |
468 | ||
4f5c64b8 RG |
469 | id->remapping_type_depth++; |
470 | tmp = remap_type_1 (type, id); | |
471 | id->remapping_type_depth--; | |
472 | ||
473 | return tmp; | |
52dd234b RH |
474 | } |
475 | ||
13e4e36e L |
476 | /* Return previously remapped type of TYPE in ID. Return NULL if TYPE |
477 | is NULL or TYPE has not been remapped before. */ | |
478 | ||
479 | static tree | |
480 | remapped_type (tree type, copy_body_data *id) | |
481 | { | |
482 | tree *node; | |
483 | ||
484 | if (type == NULL) | |
485 | return type; | |
486 | ||
487 | /* See if we have remapped this type. */ | |
488 | node = (tree *) pointer_map_contains (id->decl_map, type); | |
489 | if (node) | |
490 | return *node; | |
491 | else | |
492 | return NULL; | |
493 | } | |
494 | ||
495 | /* The type only needs remapping if it's variably modified. */ | |
526d73ab | 496 | /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */ |
b8698a0f | 497 | |
526d73ab JH |
498 | static bool |
499 | can_be_nonlocal (tree decl, copy_body_data *id) | |
500 | { | |
501 | /* We can not duplicate function decls. */ | |
502 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
503 | return true; | |
504 | ||
505 | /* Local static vars must be non-local or we get multiple declaration | |
506 | problems. */ | |
507 | if (TREE_CODE (decl) == VAR_DECL | |
508 | && !auto_var_in_fn_p (decl, id->src_fn)) | |
509 | return true; | |
510 | ||
511 | /* At the moment dwarf2out can handle only these types of nodes. We | |
512 | can support more later. */ | |
513 | if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != PARM_DECL) | |
514 | return false; | |
515 | ||
13e4e36e L |
516 | /* We must use global type. We call remapped_type instead of |
517 | remap_type since we don't want to remap this type here if it | |
518 | hasn't been remapped before. */ | |
519 | if (TREE_TYPE (decl) != remapped_type (TREE_TYPE (decl), id)) | |
526d73ab JH |
520 | return false; |
521 | ||
522 | /* Wihtout SSA we can't tell if variable is used. */ | |
523 | if (!gimple_in_ssa_p (cfun)) | |
524 | return false; | |
525 | ||
526 | /* Live variables must be copied so we can attach DECL_RTL. */ | |
527 | if (var_ann (decl)) | |
528 | return false; | |
529 | ||
530 | return true; | |
531 | } | |
532 | ||
6de9cd9a | 533 | static tree |
526d73ab | 534 | remap_decls (tree decls, VEC(tree,gc) **nonlocalized_list, copy_body_data *id) |
d4e4baa9 | 535 | { |
6de9cd9a DN |
536 | tree old_var; |
537 | tree new_decls = NULL_TREE; | |
d4e4baa9 | 538 | |
6de9cd9a DN |
539 | /* Remap its variables. */ |
540 | for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var)) | |
d4e4baa9 | 541 | { |
6de9cd9a DN |
542 | tree new_var; |
543 | ||
526d73ab | 544 | if (can_be_nonlocal (old_var, id)) |
30be951a | 545 | { |
526d73ab | 546 | if (TREE_CODE (old_var) == VAR_DECL |
5c3ec539 | 547 | && ! DECL_EXTERNAL (old_var) |
526d73ab | 548 | && (var_ann (old_var) || !gimple_in_ssa_p (cfun))) |
c021f10b | 549 | add_local_decl (cfun, old_var); |
9e6aced0 | 550 | if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE) |
526d73ab JH |
551 | && !DECL_IGNORED_P (old_var) |
552 | && nonlocalized_list) | |
70235ab9 | 553 | VEC_safe_push (tree, gc, *nonlocalized_list, old_var); |
30be951a JH |
554 | continue; |
555 | } | |
556 | ||
6de9cd9a DN |
557 | /* Remap the variable. */ |
558 | new_var = remap_decl (old_var, id); | |
559 | ||
726a989a | 560 | /* If we didn't remap this variable, we can't mess with its |
6de9cd9a DN |
561 | TREE_CHAIN. If we remapped this variable to the return slot, it's |
562 | already declared somewhere else, so don't declare it here. */ | |
b8698a0f | 563 | |
526d73ab | 564 | if (new_var == id->retvar) |
6de9cd9a | 565 | ; |
526d73ab JH |
566 | else if (!new_var) |
567 | { | |
9e6aced0 | 568 | if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE) |
526d73ab JH |
569 | && !DECL_IGNORED_P (old_var) |
570 | && nonlocalized_list) | |
70235ab9 | 571 | VEC_safe_push (tree, gc, *nonlocalized_list, old_var); |
526d73ab | 572 | } |
d4e4baa9 AO |
573 | else |
574 | { | |
1e128c5f | 575 | gcc_assert (DECL_P (new_var)); |
6de9cd9a DN |
576 | TREE_CHAIN (new_var) = new_decls; |
577 | new_decls = new_var; | |
60a5d78a JJ |
578 | |
579 | /* Also copy value-expressions. */ | |
580 | if (TREE_CODE (new_var) == VAR_DECL | |
581 | && DECL_HAS_VALUE_EXPR_P (new_var)) | |
582 | { | |
583 | tree tem = DECL_VALUE_EXPR (new_var); | |
584 | bool old_regimplify = id->regimplify; | |
585 | id->remapping_type_depth++; | |
586 | walk_tree (&tem, copy_tree_body_r, id, NULL); | |
587 | id->remapping_type_depth--; | |
588 | id->regimplify = old_regimplify; | |
589 | SET_DECL_VALUE_EXPR (new_var, tem); | |
590 | } | |
d4e4baa9 | 591 | } |
d4e4baa9 | 592 | } |
d4e4baa9 | 593 | |
6de9cd9a DN |
594 | return nreverse (new_decls); |
595 | } | |
596 | ||
597 | /* Copy the BLOCK to contain remapped versions of the variables | |
598 | therein. And hook the new block into the block-tree. */ | |
599 | ||
600 | static void | |
1b369fae | 601 | remap_block (tree *block, copy_body_data *id) |
6de9cd9a | 602 | { |
d436bff8 AH |
603 | tree old_block; |
604 | tree new_block; | |
d436bff8 AH |
605 | |
606 | /* Make the new block. */ | |
607 | old_block = *block; | |
608 | new_block = make_node (BLOCK); | |
609 | TREE_USED (new_block) = TREE_USED (old_block); | |
610 | BLOCK_ABSTRACT_ORIGIN (new_block) = old_block; | |
3e2844cb | 611 | BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block); |
526d73ab JH |
612 | BLOCK_NONLOCALIZED_VARS (new_block) |
613 | = VEC_copy (tree, gc, BLOCK_NONLOCALIZED_VARS (old_block)); | |
d436bff8 AH |
614 | *block = new_block; |
615 | ||
616 | /* Remap its variables. */ | |
526d73ab JH |
617 | BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block), |
618 | &BLOCK_NONLOCALIZED_VARS (new_block), | |
619 | id); | |
d436bff8 | 620 | |
1b369fae | 621 | if (id->transform_lang_insert_block) |
9ff420f1 | 622 | id->transform_lang_insert_block (new_block); |
1b369fae | 623 | |
d436bff8 | 624 | /* Remember the remapped block. */ |
6de9cd9a | 625 | insert_decl_map (id, old_block, new_block); |
d4e4baa9 AO |
626 | } |
627 | ||
acb8f212 JH |
628 | /* Copy the whole block tree and root it in id->block. */ |
629 | static tree | |
1b369fae | 630 | remap_blocks (tree block, copy_body_data *id) |
acb8f212 JH |
631 | { |
632 | tree t; | |
82d6e6fc | 633 | tree new_tree = block; |
acb8f212 JH |
634 | |
635 | if (!block) | |
636 | return NULL; | |
637 | ||
82d6e6fc KG |
638 | remap_block (&new_tree, id); |
639 | gcc_assert (new_tree != block); | |
acb8f212 | 640 | for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) |
4a283090 JH |
641 | prepend_lexical_block (new_tree, remap_blocks (t, id)); |
642 | /* Blocks are in arbitrary order, but make things slightly prettier and do | |
643 | not swap order when producing a copy. */ | |
644 | BLOCK_SUBBLOCKS (new_tree) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree)); | |
82d6e6fc | 645 | return new_tree; |
acb8f212 JH |
646 | } |
647 | ||
d4e4baa9 | 648 | static void |
6de9cd9a | 649 | copy_statement_list (tree *tp) |
d4e4baa9 | 650 | { |
6de9cd9a | 651 | tree_stmt_iterator oi, ni; |
82d6e6fc | 652 | tree new_tree; |
6de9cd9a | 653 | |
82d6e6fc KG |
654 | new_tree = alloc_stmt_list (); |
655 | ni = tsi_start (new_tree); | |
6de9cd9a | 656 | oi = tsi_start (*tp); |
b1d82db0 | 657 | TREE_TYPE (new_tree) = TREE_TYPE (*tp); |
82d6e6fc | 658 | *tp = new_tree; |
6de9cd9a DN |
659 | |
660 | for (; !tsi_end_p (oi); tsi_next (&oi)) | |
a406865a RG |
661 | { |
662 | tree stmt = tsi_stmt (oi); | |
663 | if (TREE_CODE (stmt) == STATEMENT_LIST) | |
664 | copy_statement_list (&stmt); | |
665 | tsi_link_after (&ni, stmt, TSI_CONTINUE_LINKING); | |
666 | } | |
6de9cd9a | 667 | } |
d4e4baa9 | 668 | |
6de9cd9a | 669 | static void |
1b369fae | 670 | copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id) |
6de9cd9a DN |
671 | { |
672 | tree block = BIND_EXPR_BLOCK (*tp); | |
d4e4baa9 AO |
673 | /* Copy (and replace) the statement. */ |
674 | copy_tree_r (tp, walk_subtrees, NULL); | |
6de9cd9a DN |
675 | if (block) |
676 | { | |
677 | remap_block (&block, id); | |
678 | BIND_EXPR_BLOCK (*tp) = block; | |
679 | } | |
d4e4baa9 | 680 | |
6de9cd9a | 681 | if (BIND_EXPR_VARS (*tp)) |
60a5d78a JJ |
682 | /* This will remap a lot of the same decls again, but this should be |
683 | harmless. */ | |
684 | BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), NULL, id); | |
d4e4baa9 AO |
685 | } |
686 | ||
726a989a RB |
687 | |
688 | /* Create a new gimple_seq by remapping all the statements in BODY | |
689 | using the inlining information in ID. */ | |
690 | ||
b34fd25c | 691 | static gimple_seq |
726a989a RB |
692 | remap_gimple_seq (gimple_seq body, copy_body_data *id) |
693 | { | |
694 | gimple_stmt_iterator si; | |
695 | gimple_seq new_body = NULL; | |
696 | ||
697 | for (si = gsi_start (body); !gsi_end_p (si); gsi_next (&si)) | |
698 | { | |
699 | gimple new_stmt = remap_gimple_stmt (gsi_stmt (si), id); | |
700 | gimple_seq_add_stmt (&new_body, new_stmt); | |
701 | } | |
702 | ||
703 | return new_body; | |
704 | } | |
705 | ||
706 | ||
707 | /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its | |
708 | block using the mapping information in ID. */ | |
709 | ||
710 | static gimple | |
711 | copy_gimple_bind (gimple stmt, copy_body_data *id) | |
712 | { | |
713 | gimple new_bind; | |
714 | tree new_block, new_vars; | |
715 | gimple_seq body, new_body; | |
716 | ||
717 | /* Copy the statement. Note that we purposely don't use copy_stmt | |
718 | here because we need to remap statements as we copy. */ | |
719 | body = gimple_bind_body (stmt); | |
720 | new_body = remap_gimple_seq (body, id); | |
721 | ||
722 | new_block = gimple_bind_block (stmt); | |
723 | if (new_block) | |
724 | remap_block (&new_block, id); | |
725 | ||
726 | /* This will remap a lot of the same decls again, but this should be | |
727 | harmless. */ | |
728 | new_vars = gimple_bind_vars (stmt); | |
729 | if (new_vars) | |
526d73ab | 730 | new_vars = remap_decls (new_vars, NULL, id); |
726a989a RB |
731 | |
732 | new_bind = gimple_build_bind (new_vars, new_body, new_block); | |
733 | ||
734 | return new_bind; | |
735 | } | |
736 | ||
737 | ||
738 | /* Remap the GIMPLE operand pointed to by *TP. DATA is really a | |
739 | 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'. | |
740 | WALK_SUBTREES is used to indicate walk_gimple_op whether to keep | |
741 | recursing into the children nodes of *TP. */ | |
742 | ||
743 | static tree | |
744 | remap_gimple_op_r (tree *tp, int *walk_subtrees, void *data) | |
745 | { | |
746 | struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data; | |
747 | copy_body_data *id = (copy_body_data *) wi_p->info; | |
748 | tree fn = id->src_fn; | |
749 | ||
750 | if (TREE_CODE (*tp) == SSA_NAME) | |
751 | { | |
752 | *tp = remap_ssa_name (*tp, id); | |
753 | *walk_subtrees = 0; | |
754 | return NULL; | |
755 | } | |
756 | else if (auto_var_in_fn_p (*tp, fn)) | |
757 | { | |
758 | /* Local variables and labels need to be replaced by equivalent | |
759 | variables. We don't want to copy static variables; there's | |
760 | only one of those, no matter how many times we inline the | |
761 | containing function. Similarly for globals from an outer | |
762 | function. */ | |
763 | tree new_decl; | |
764 | ||
765 | /* Remap the declaration. */ | |
766 | new_decl = remap_decl (*tp, id); | |
767 | gcc_assert (new_decl); | |
768 | /* Replace this variable with the copy. */ | |
769 | STRIP_TYPE_NOPS (new_decl); | |
211ca15c RG |
770 | /* ??? The C++ frontend uses void * pointer zero to initialize |
771 | any other type. This confuses the middle-end type verification. | |
772 | As cloned bodies do not go through gimplification again the fixup | |
773 | there doesn't trigger. */ | |
774 | if (TREE_CODE (new_decl) == INTEGER_CST | |
775 | && !useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (new_decl))) | |
776 | new_decl = fold_convert (TREE_TYPE (*tp), new_decl); | |
726a989a RB |
777 | *tp = new_decl; |
778 | *walk_subtrees = 0; | |
779 | } | |
780 | else if (TREE_CODE (*tp) == STATEMENT_LIST) | |
781 | gcc_unreachable (); | |
782 | else if (TREE_CODE (*tp) == SAVE_EXPR) | |
783 | gcc_unreachable (); | |
784 | else if (TREE_CODE (*tp) == LABEL_DECL | |
785 | && (!DECL_CONTEXT (*tp) | |
786 | || decl_function_context (*tp) == id->src_fn)) | |
787 | /* These may need to be remapped for EH handling. */ | |
788 | *tp = remap_decl (*tp, id); | |
789 | else if (TYPE_P (*tp)) | |
790 | /* Types may need remapping as well. */ | |
791 | *tp = remap_type (*tp, id); | |
792 | else if (CONSTANT_CLASS_P (*tp)) | |
793 | { | |
794 | /* If this is a constant, we have to copy the node iff the type | |
795 | will be remapped. copy_tree_r will not copy a constant. */ | |
796 | tree new_type = remap_type (TREE_TYPE (*tp), id); | |
797 | ||
798 | if (new_type == TREE_TYPE (*tp)) | |
799 | *walk_subtrees = 0; | |
800 | ||
801 | else if (TREE_CODE (*tp) == INTEGER_CST) | |
802 | *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp), | |
803 | TREE_INT_CST_HIGH (*tp)); | |
804 | else | |
805 | { | |
806 | *tp = copy_node (*tp); | |
807 | TREE_TYPE (*tp) = new_type; | |
808 | } | |
809 | } | |
810 | else | |
811 | { | |
812 | /* Otherwise, just copy the node. Note that copy_tree_r already | |
813 | knows not to copy VAR_DECLs, etc., so this is safe. */ | |
70f34814 | 814 | if (TREE_CODE (*tp) == MEM_REF) |
726a989a | 815 | { |
70f34814 RG |
816 | /* We need to re-canonicalize MEM_REFs from inline substitutions |
817 | that can happen when a pointer argument is an ADDR_EXPR. */ | |
726a989a RB |
818 | tree decl = TREE_OPERAND (*tp, 0); |
819 | tree *n; | |
820 | ||
6938f93f JH |
821 | /* See remap_ssa_name. */ |
822 | if (TREE_CODE (decl) == SSA_NAME | |
823 | && TREE_CODE (SSA_NAME_VAR (decl)) == RESULT_DECL | |
824 | && id->transform_return_to_modify) | |
825 | decl = SSA_NAME_VAR (decl); | |
826 | ||
726a989a RB |
827 | n = (tree *) pointer_map_contains (id->decl_map, decl); |
828 | if (n) | |
829 | { | |
70f34814 RG |
830 | tree old = *tp; |
831 | tree ptr = unshare_expr (*n); | |
832 | tree tem; | |
833 | if ((tem = maybe_fold_offset_to_reference (EXPR_LOCATION (*tp), | |
834 | ptr, | |
835 | TREE_OPERAND (*tp, 1), | |
836 | TREE_TYPE (*tp))) | |
837 | && TREE_THIS_VOLATILE (tem) == TREE_THIS_VOLATILE (old)) | |
838 | { | |
839 | tree *tem_basep = &tem; | |
840 | while (handled_component_p (*tem_basep)) | |
841 | tem_basep = &TREE_OPERAND (*tem_basep, 0); | |
842 | if (TREE_CODE (*tem_basep) == MEM_REF) | |
843 | *tem_basep | |
844 | = build2 (MEM_REF, TREE_TYPE (*tem_basep), | |
845 | TREE_OPERAND (*tem_basep, 0), | |
846 | fold_convert (TREE_TYPE (TREE_OPERAND (*tp, 1)), | |
847 | TREE_OPERAND (*tem_basep, 1))); | |
848 | else | |
849 | *tem_basep | |
850 | = build2 (MEM_REF, TREE_TYPE (*tem_basep), | |
851 | build_fold_addr_expr (*tem_basep), | |
852 | build_int_cst | |
853 | (TREE_TYPE (TREE_OPERAND (*tp, 1)), 0)); | |
854 | *tp = tem; | |
855 | } | |
856 | else | |
857 | { | |
858 | *tp = fold_build2 (MEM_REF, TREE_TYPE (*tp), | |
859 | ptr, TREE_OPERAND (*tp, 1)); | |
860 | TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old); | |
726a989a | 861 | } |
70f34814 | 862 | TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old); |
726a989a RB |
863 | *walk_subtrees = 0; |
864 | return NULL; | |
865 | } | |
866 | } | |
867 | ||
868 | /* Here is the "usual case". Copy this tree node, and then | |
869 | tweak some special cases. */ | |
870 | copy_tree_r (tp, walk_subtrees, NULL); | |
871 | ||
872 | /* Global variables we haven't seen yet need to go into referenced | |
873 | vars. If not referenced from types only. */ | |
874 | if (gimple_in_ssa_p (cfun) | |
875 | && TREE_CODE (*tp) == VAR_DECL | |
b5b8b0ac AO |
876 | && id->remapping_type_depth == 0 |
877 | && !processing_debug_stmt) | |
726a989a RB |
878 | add_referenced_var (*tp); |
879 | ||
880 | /* We should never have TREE_BLOCK set on non-statements. */ | |
881 | if (EXPR_P (*tp)) | |
882 | gcc_assert (!TREE_BLOCK (*tp)); | |
883 | ||
884 | if (TREE_CODE (*tp) != OMP_CLAUSE) | |
885 | TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id); | |
886 | ||
887 | if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3)) | |
888 | { | |
889 | /* The copied TARGET_EXPR has never been expanded, even if the | |
890 | original node was expanded already. */ | |
891 | TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3); | |
892 | TREE_OPERAND (*tp, 3) = NULL_TREE; | |
893 | } | |
894 | else if (TREE_CODE (*tp) == ADDR_EXPR) | |
895 | { | |
896 | /* Variable substitution need not be simple. In particular, | |
70f34814 | 897 | the MEM_REF substitution above. Make sure that |
726a989a RB |
898 | TREE_CONSTANT and friends are up-to-date. But make sure |
899 | to not improperly set TREE_BLOCK on some sub-expressions. */ | |
900 | int invariant = is_gimple_min_invariant (*tp); | |
901 | tree block = id->block; | |
902 | id->block = NULL_TREE; | |
f1071b12 | 903 | walk_tree (&TREE_OPERAND (*tp, 0), remap_gimple_op_r, data, NULL); |
726a989a | 904 | id->block = block; |
70f34814 | 905 | recompute_tree_invariant_for_addr_expr (*tp); |
726a989a RB |
906 | |
907 | /* If this used to be invariant, but is not any longer, | |
908 | then regimplification is probably needed. */ | |
909 | if (invariant && !is_gimple_min_invariant (*tp)) | |
910 | id->regimplify = true; | |
911 | ||
912 | *walk_subtrees = 0; | |
913 | } | |
914 | } | |
915 | ||
916 | /* Keep iterating. */ | |
917 | return NULL_TREE; | |
918 | } | |
919 | ||
920 | ||
921 | /* Called from copy_body_id via walk_tree. DATA is really a | |
1b369fae | 922 | `copy_body_data *'. */ |
aa4a53af | 923 | |
1b369fae | 924 | tree |
726a989a | 925 | copy_tree_body_r (tree *tp, int *walk_subtrees, void *data) |
d4e4baa9 | 926 | { |
1b369fae RH |
927 | copy_body_data *id = (copy_body_data *) data; |
928 | tree fn = id->src_fn; | |
acb8f212 | 929 | tree new_block; |
d4e4baa9 | 930 | |
e21aff8a SB |
931 | /* Begin by recognizing trees that we'll completely rewrite for the |
932 | inlining context. Our output for these trees is completely | |
933 | different from out input (e.g. RETURN_EXPR is deleted, and morphs | |
934 | into an edge). Further down, we'll handle trees that get | |
935 | duplicated and/or tweaked. */ | |
d4e4baa9 | 936 | |
1b369fae | 937 | /* When requested, RETURN_EXPRs should be transformed to just the |
726a989a | 938 | contained MODIFY_EXPR. The branch semantics of the return will |
1b369fae RH |
939 | be handled elsewhere by manipulating the CFG rather than a statement. */ |
940 | if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify) | |
d4e4baa9 | 941 | { |
e21aff8a | 942 | tree assignment = TREE_OPERAND (*tp, 0); |
d4e4baa9 AO |
943 | |
944 | /* If we're returning something, just turn that into an | |
e21aff8a SB |
945 | assignment into the equivalent of the original RESULT_DECL. |
946 | If the "assignment" is just the result decl, the result | |
947 | decl has already been set (e.g. a recent "foo (&result_decl, | |
948 | ...)"); just toss the entire RETURN_EXPR. */ | |
726a989a | 949 | if (assignment && TREE_CODE (assignment) == MODIFY_EXPR) |
e21aff8a SB |
950 | { |
951 | /* Replace the RETURN_EXPR with (a copy of) the | |
726a989a | 952 | MODIFY_EXPR hanging underneath. */ |
e21aff8a SB |
953 | *tp = copy_node (assignment); |
954 | } | |
955 | else /* Else the RETURN_EXPR returns no value. */ | |
956 | { | |
957 | *tp = NULL; | |
cceb1885 | 958 | return (tree) (void *)1; |
e21aff8a | 959 | } |
d4e4baa9 | 960 | } |
110cfe1c JH |
961 | else if (TREE_CODE (*tp) == SSA_NAME) |
962 | { | |
963 | *tp = remap_ssa_name (*tp, id); | |
964 | *walk_subtrees = 0; | |
965 | return NULL; | |
966 | } | |
e21aff8a | 967 | |
d4e4baa9 AO |
968 | /* Local variables and labels need to be replaced by equivalent |
969 | variables. We don't want to copy static variables; there's only | |
970 | one of those, no matter how many times we inline the containing | |
5377d5ba | 971 | function. Similarly for globals from an outer function. */ |
50886bf1 | 972 | else if (auto_var_in_fn_p (*tp, fn)) |
d4e4baa9 AO |
973 | { |
974 | tree new_decl; | |
975 | ||
976 | /* Remap the declaration. */ | |
977 | new_decl = remap_decl (*tp, id); | |
1e128c5f | 978 | gcc_assert (new_decl); |
d4e4baa9 AO |
979 | /* Replace this variable with the copy. */ |
980 | STRIP_TYPE_NOPS (new_decl); | |
981 | *tp = new_decl; | |
e4cf29ae | 982 | *walk_subtrees = 0; |
d4e4baa9 | 983 | } |
6de9cd9a DN |
984 | else if (TREE_CODE (*tp) == STATEMENT_LIST) |
985 | copy_statement_list (tp); | |
a406865a RG |
986 | else if (TREE_CODE (*tp) == SAVE_EXPR |
987 | || TREE_CODE (*tp) == TARGET_EXPR) | |
82c82743 | 988 | remap_save_expr (tp, id->decl_map, walk_subtrees); |
17acc01a JH |
989 | else if (TREE_CODE (*tp) == LABEL_DECL |
990 | && (! DECL_CONTEXT (*tp) | |
1b369fae | 991 | || decl_function_context (*tp) == id->src_fn)) |
e21aff8a | 992 | /* These may need to be remapped for EH handling. */ |
17acc01a | 993 | *tp = remap_decl (*tp, id); |
6de9cd9a DN |
994 | else if (TREE_CODE (*tp) == BIND_EXPR) |
995 | copy_bind_expr (tp, walk_subtrees, id); | |
3c2a7a6a RH |
996 | /* Types may need remapping as well. */ |
997 | else if (TYPE_P (*tp)) | |
998 | *tp = remap_type (*tp, id); | |
999 | ||
bb04998a RK |
1000 | /* If this is a constant, we have to copy the node iff the type will be |
1001 | remapped. copy_tree_r will not copy a constant. */ | |
3cf11075 | 1002 | else if (CONSTANT_CLASS_P (*tp)) |
bb04998a RK |
1003 | { |
1004 | tree new_type = remap_type (TREE_TYPE (*tp), id); | |
1005 | ||
1006 | if (new_type == TREE_TYPE (*tp)) | |
1007 | *walk_subtrees = 0; | |
1008 | ||
1009 | else if (TREE_CODE (*tp) == INTEGER_CST) | |
1010 | *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp), | |
1011 | TREE_INT_CST_HIGH (*tp)); | |
1012 | else | |
1013 | { | |
1014 | *tp = copy_node (*tp); | |
1015 | TREE_TYPE (*tp) = new_type; | |
1016 | } | |
1017 | } | |
1018 | ||
d4e4baa9 AO |
1019 | /* Otherwise, just copy the node. Note that copy_tree_r already |
1020 | knows not to copy VAR_DECLs, etc., so this is safe. */ | |
1021 | else | |
1022 | { | |
e21aff8a SB |
1023 | /* Here we handle trees that are not completely rewritten. |
1024 | First we detect some inlining-induced bogosities for | |
1025 | discarding. */ | |
726a989a RB |
1026 | if (TREE_CODE (*tp) == MODIFY_EXPR |
1027 | && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1) | |
1028 | && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn))) | |
d4e4baa9 AO |
1029 | { |
1030 | /* Some assignments VAR = VAR; don't generate any rtl code | |
1031 | and thus don't count as variable modification. Avoid | |
1032 | keeping bogosities like 0 = 0. */ | |
726a989a | 1033 | tree decl = TREE_OPERAND (*tp, 0), value; |
6be42dd4 | 1034 | tree *n; |
d4e4baa9 | 1035 | |
6be42dd4 | 1036 | n = (tree *) pointer_map_contains (id->decl_map, decl); |
d4e4baa9 AO |
1037 | if (n) |
1038 | { | |
6be42dd4 | 1039 | value = *n; |
d4e4baa9 | 1040 | STRIP_TYPE_NOPS (value); |
becfd6e5 | 1041 | if (TREE_CONSTANT (value) || TREE_READONLY (value)) |
68594ce7 | 1042 | { |
c2255bc4 | 1043 | *tp = build_empty_stmt (EXPR_LOCATION (*tp)); |
726a989a | 1044 | return copy_tree_body_r (tp, walk_subtrees, data); |
68594ce7 | 1045 | } |
d4e4baa9 AO |
1046 | } |
1047 | } | |
1b369fae | 1048 | else if (TREE_CODE (*tp) == INDIRECT_REF) |
6de9cd9a DN |
1049 | { |
1050 | /* Get rid of *& from inline substitutions that can happen when a | |
1051 | pointer argument is an ADDR_EXPR. */ | |
81cfbbc2 | 1052 | tree decl = TREE_OPERAND (*tp, 0); |
6be42dd4 | 1053 | tree *n; |
6de9cd9a | 1054 | |
6be42dd4 | 1055 | n = (tree *) pointer_map_contains (id->decl_map, decl); |
6de9cd9a DN |
1056 | if (n) |
1057 | { | |
82d6e6fc | 1058 | tree new_tree; |
d84b37b0 | 1059 | tree old; |
30d2e943 RG |
1060 | /* If we happen to get an ADDR_EXPR in n->value, strip |
1061 | it manually here as we'll eventually get ADDR_EXPRs | |
1062 | which lie about their types pointed to. In this case | |
1063 | build_fold_indirect_ref wouldn't strip the INDIRECT_REF, | |
095ecc24 RG |
1064 | but we absolutely rely on that. As fold_indirect_ref |
1065 | does other useful transformations, try that first, though. */ | |
6be42dd4 | 1066 | tree type = TREE_TYPE (TREE_TYPE (*n)); |
f82a627c EB |
1067 | if (id->do_not_unshare) |
1068 | new_tree = *n; | |
1069 | else | |
1070 | new_tree = unshare_expr (*n); | |
d84b37b0 | 1071 | old = *tp; |
82d6e6fc | 1072 | *tp = gimple_fold_indirect_ref (new_tree); |
095ecc24 RG |
1073 | if (! *tp) |
1074 | { | |
82d6e6fc | 1075 | if (TREE_CODE (new_tree) == ADDR_EXPR) |
de4af523 | 1076 | { |
db3927fb AH |
1077 | *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree), |
1078 | type, new_tree); | |
de4af523 JJ |
1079 | /* ??? We should either assert here or build |
1080 | a VIEW_CONVERT_EXPR instead of blindly leaking | |
1081 | incompatible types to our IL. */ | |
1082 | if (! *tp) | |
82d6e6fc | 1083 | *tp = TREE_OPERAND (new_tree, 0); |
de4af523 | 1084 | } |
095ecc24 | 1085 | else |
d84b37b0 | 1086 | { |
82d6e6fc | 1087 | *tp = build1 (INDIRECT_REF, type, new_tree); |
d84b37b0 | 1088 | TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old); |
955f6531 | 1089 | TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old); |
d84b37b0 | 1090 | } |
095ecc24 | 1091 | } |
81cfbbc2 JH |
1092 | *walk_subtrees = 0; |
1093 | return NULL; | |
68594ce7 JM |
1094 | } |
1095 | } | |
70f34814 RG |
1096 | else if (TREE_CODE (*tp) == MEM_REF) |
1097 | { | |
1098 | /* We need to re-canonicalize MEM_REFs from inline substitutions | |
1099 | that can happen when a pointer argument is an ADDR_EXPR. */ | |
1100 | tree decl = TREE_OPERAND (*tp, 0); | |
1101 | tree *n; | |
1102 | ||
1103 | n = (tree *) pointer_map_contains (id->decl_map, decl); | |
1104 | if (n) | |
1105 | { | |
1106 | tree old = *tp; | |
1107 | *tp = fold_build2 (MEM_REF, TREE_TYPE (*tp), | |
1108 | unshare_expr (*n), TREE_OPERAND (*tp, 1)); | |
1109 | TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old); | |
1110 | TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old); | |
1111 | *walk_subtrees = 0; | |
1112 | return NULL; | |
1113 | } | |
1114 | } | |
68594ce7 | 1115 | |
e21aff8a SB |
1116 | /* Here is the "usual case". Copy this tree node, and then |
1117 | tweak some special cases. */ | |
1b369fae | 1118 | copy_tree_r (tp, walk_subtrees, NULL); |
110cfe1c | 1119 | |
4f5c64b8 | 1120 | /* Global variables we haven't seen yet needs to go into referenced |
b5b8b0ac | 1121 | vars. If not referenced from types or debug stmts only. */ |
726a989a RB |
1122 | if (gimple_in_ssa_p (cfun) |
1123 | && TREE_CODE (*tp) == VAR_DECL | |
b5b8b0ac AO |
1124 | && id->remapping_type_depth == 0 |
1125 | && !processing_debug_stmt) | |
110cfe1c | 1126 | add_referenced_var (*tp); |
b8698a0f | 1127 | |
acb8f212 JH |
1128 | /* If EXPR has block defined, map it to newly constructed block. |
1129 | When inlining we want EXPRs without block appear in the block | |
ee0192a2 | 1130 | of function call if we are not remapping a type. */ |
726a989a | 1131 | if (EXPR_P (*tp)) |
acb8f212 | 1132 | { |
ee0192a2 | 1133 | new_block = id->remapping_type_depth == 0 ? id->block : NULL; |
acb8f212 JH |
1134 | if (TREE_BLOCK (*tp)) |
1135 | { | |
6be42dd4 RG |
1136 | tree *n; |
1137 | n = (tree *) pointer_map_contains (id->decl_map, | |
1138 | TREE_BLOCK (*tp)); | |
60a5d78a JJ |
1139 | gcc_assert (n || id->remapping_type_depth != 0); |
1140 | if (n) | |
1141 | new_block = *n; | |
acb8f212 JH |
1142 | } |
1143 | TREE_BLOCK (*tp) = new_block; | |
1144 | } | |
68594ce7 | 1145 | |
726a989a | 1146 | if (TREE_CODE (*tp) != OMP_CLAUSE) |
07beea0d | 1147 | TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id); |
3c2a7a6a | 1148 | |
68594ce7 JM |
1149 | /* The copied TARGET_EXPR has never been expanded, even if the |
1150 | original node was expanded already. */ | |
1151 | if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3)) | |
1152 | { | |
1153 | TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3); | |
1154 | TREE_OPERAND (*tp, 3) = NULL_TREE; | |
1155 | } | |
84cce55d RH |
1156 | |
1157 | /* Variable substitution need not be simple. In particular, the | |
1158 | INDIRECT_REF substitution above. Make sure that TREE_CONSTANT | |
1159 | and friends are up-to-date. */ | |
1160 | else if (TREE_CODE (*tp) == ADDR_EXPR) | |
1161 | { | |
ad6003f2 | 1162 | int invariant = is_gimple_min_invariant (*tp); |
726a989a RB |
1163 | walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL); |
1164 | ||
8e85fd14 RG |
1165 | /* Handle the case where we substituted an INDIRECT_REF |
1166 | into the operand of the ADDR_EXPR. */ | |
1167 | if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF) | |
1168 | *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0); | |
1169 | else | |
1170 | recompute_tree_invariant_for_addr_expr (*tp); | |
726a989a | 1171 | |
416c991f JJ |
1172 | /* If this used to be invariant, but is not any longer, |
1173 | then regimplification is probably needed. */ | |
ad6003f2 | 1174 | if (invariant && !is_gimple_min_invariant (*tp)) |
416c991f | 1175 | id->regimplify = true; |
726a989a | 1176 | |
84cce55d RH |
1177 | *walk_subtrees = 0; |
1178 | } | |
d4e4baa9 AO |
1179 | } |
1180 | ||
1181 | /* Keep iterating. */ | |
1182 | return NULL_TREE; | |
1183 | } | |
1184 | ||
1d65f45c RH |
1185 | /* Helper for remap_gimple_stmt. Given an EH region number for the |
1186 | source function, map that to the duplicate EH region number in | |
1187 | the destination function. */ | |
1188 | ||
1189 | static int | |
1190 | remap_eh_region_nr (int old_nr, copy_body_data *id) | |
1191 | { | |
1192 | eh_region old_r, new_r; | |
1193 | void **slot; | |
1194 | ||
1195 | old_r = get_eh_region_from_number_fn (id->src_cfun, old_nr); | |
1196 | slot = pointer_map_contains (id->eh_map, old_r); | |
1197 | new_r = (eh_region) *slot; | |
1198 | ||
1199 | return new_r->index; | |
1200 | } | |
1201 | ||
1202 | /* Similar, but operate on INTEGER_CSTs. */ | |
1203 | ||
1204 | static tree | |
1205 | remap_eh_region_tree_nr (tree old_t_nr, copy_body_data *id) | |
1206 | { | |
1207 | int old_nr, new_nr; | |
1208 | ||
1209 | old_nr = tree_low_cst (old_t_nr, 0); | |
1210 | new_nr = remap_eh_region_nr (old_nr, id); | |
1211 | ||
1212 | return build_int_cst (NULL, new_nr); | |
1213 | } | |
726a989a RB |
1214 | |
1215 | /* Helper for copy_bb. Remap statement STMT using the inlining | |
1216 | information in ID. Return the new statement copy. */ | |
1217 | ||
1218 | static gimple | |
1219 | remap_gimple_stmt (gimple stmt, copy_body_data *id) | |
1220 | { | |
1221 | gimple copy = NULL; | |
1222 | struct walk_stmt_info wi; | |
1223 | tree new_block; | |
5a6e26b7 | 1224 | bool skip_first = false; |
726a989a RB |
1225 | |
1226 | /* Begin by recognizing trees that we'll completely rewrite for the | |
1227 | inlining context. Our output for these trees is completely | |
1228 | different from out input (e.g. RETURN_EXPR is deleted, and morphs | |
1229 | into an edge). Further down, we'll handle trees that get | |
1230 | duplicated and/or tweaked. */ | |
1231 | ||
1232 | /* When requested, GIMPLE_RETURNs should be transformed to just the | |
1233 | contained GIMPLE_ASSIGN. The branch semantics of the return will | |
1234 | be handled elsewhere by manipulating the CFG rather than the | |
1235 | statement. */ | |
1236 | if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify) | |
1237 | { | |
1238 | tree retval = gimple_return_retval (stmt); | |
1239 | ||
1240 | /* If we're returning something, just turn that into an | |
1241 | assignment into the equivalent of the original RESULT_DECL. | |
1242 | If RETVAL is just the result decl, the result decl has | |
1243 | already been set (e.g. a recent "foo (&result_decl, ...)"); | |
1244 | just toss the entire GIMPLE_RETURN. */ | |
6938f93f JH |
1245 | if (retval |
1246 | && (TREE_CODE (retval) != RESULT_DECL | |
1247 | && (TREE_CODE (retval) != SSA_NAME | |
1248 | || TREE_CODE (SSA_NAME_VAR (retval)) != RESULT_DECL))) | |
5a6e26b7 JH |
1249 | { |
1250 | copy = gimple_build_assign (id->retvar, retval); | |
1251 | /* id->retvar is already substituted. Skip it on later remapping. */ | |
1252 | skip_first = true; | |
1253 | } | |
726a989a RB |
1254 | else |
1255 | return gimple_build_nop (); | |
1256 | } | |
1257 | else if (gimple_has_substatements (stmt)) | |
1258 | { | |
1259 | gimple_seq s1, s2; | |
1260 | ||
1261 | /* When cloning bodies from the C++ front end, we will be handed bodies | |
1262 | in High GIMPLE form. Handle here all the High GIMPLE statements that | |
1263 | have embedded statements. */ | |
1264 | switch (gimple_code (stmt)) | |
1265 | { | |
1266 | case GIMPLE_BIND: | |
1267 | copy = copy_gimple_bind (stmt, id); | |
1268 | break; | |
1269 | ||
1270 | case GIMPLE_CATCH: | |
1271 | s1 = remap_gimple_seq (gimple_catch_handler (stmt), id); | |
1272 | copy = gimple_build_catch (gimple_catch_types (stmt), s1); | |
1273 | break; | |
1274 | ||
1275 | case GIMPLE_EH_FILTER: | |
1276 | s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id); | |
1277 | copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1); | |
1278 | break; | |
1279 | ||
1280 | case GIMPLE_TRY: | |
1281 | s1 = remap_gimple_seq (gimple_try_eval (stmt), id); | |
1282 | s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id); | |
b8698a0f | 1283 | copy = gimple_build_try (s1, s2, gimple_try_kind (stmt)); |
726a989a RB |
1284 | break; |
1285 | ||
1286 | case GIMPLE_WITH_CLEANUP_EXPR: | |
1287 | s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id); | |
1288 | copy = gimple_build_wce (s1); | |
1289 | break; | |
1290 | ||
1291 | case GIMPLE_OMP_PARALLEL: | |
1292 | s1 = remap_gimple_seq (gimple_omp_body (stmt), id); | |
1293 | copy = gimple_build_omp_parallel | |
1294 | (s1, | |
1295 | gimple_omp_parallel_clauses (stmt), | |
1296 | gimple_omp_parallel_child_fn (stmt), | |
1297 | gimple_omp_parallel_data_arg (stmt)); | |
1298 | break; | |
1299 | ||
1300 | case GIMPLE_OMP_TASK: | |
1301 | s1 = remap_gimple_seq (gimple_omp_body (stmt), id); | |
1302 | copy = gimple_build_omp_task | |
1303 | (s1, | |
1304 | gimple_omp_task_clauses (stmt), | |
1305 | gimple_omp_task_child_fn (stmt), | |
1306 | gimple_omp_task_data_arg (stmt), | |
1307 | gimple_omp_task_copy_fn (stmt), | |
1308 | gimple_omp_task_arg_size (stmt), | |
1309 | gimple_omp_task_arg_align (stmt)); | |
1310 | break; | |
1311 | ||
1312 | case GIMPLE_OMP_FOR: | |
1313 | s1 = remap_gimple_seq (gimple_omp_body (stmt), id); | |
1314 | s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id); | |
1315 | copy = gimple_build_omp_for (s1, gimple_omp_for_clauses (stmt), | |
1316 | gimple_omp_for_collapse (stmt), s2); | |
1317 | { | |
1318 | size_t i; | |
1319 | for (i = 0; i < gimple_omp_for_collapse (stmt); i++) | |
1320 | { | |
1321 | gimple_omp_for_set_index (copy, i, | |
1322 | gimple_omp_for_index (stmt, i)); | |
1323 | gimple_omp_for_set_initial (copy, i, | |
1324 | gimple_omp_for_initial (stmt, i)); | |
1325 | gimple_omp_for_set_final (copy, i, | |
1326 | gimple_omp_for_final (stmt, i)); | |
1327 | gimple_omp_for_set_incr (copy, i, | |
1328 | gimple_omp_for_incr (stmt, i)); | |
1329 | gimple_omp_for_set_cond (copy, i, | |
1330 | gimple_omp_for_cond (stmt, i)); | |
1331 | } | |
1332 | } | |
1333 | break; | |
1334 | ||
1335 | case GIMPLE_OMP_MASTER: | |
1336 | s1 = remap_gimple_seq (gimple_omp_body (stmt), id); | |
1337 | copy = gimple_build_omp_master (s1); | |
1338 | break; | |
1339 | ||
1340 | case GIMPLE_OMP_ORDERED: | |
1341 | s1 = remap_gimple_seq (gimple_omp_body (stmt), id); | |
1342 | copy = gimple_build_omp_ordered (s1); | |
1343 | break; | |
1344 | ||
1345 | case GIMPLE_OMP_SECTION: | |
1346 | s1 = remap_gimple_seq (gimple_omp_body (stmt), id); | |
1347 | copy = gimple_build_omp_section (s1); | |
1348 | break; | |
1349 | ||
1350 | case GIMPLE_OMP_SECTIONS: | |
1351 | s1 = remap_gimple_seq (gimple_omp_body (stmt), id); | |
1352 | copy = gimple_build_omp_sections | |
1353 | (s1, gimple_omp_sections_clauses (stmt)); | |
1354 | break; | |
1355 | ||
1356 | case GIMPLE_OMP_SINGLE: | |
1357 | s1 = remap_gimple_seq (gimple_omp_body (stmt), id); | |
1358 | copy = gimple_build_omp_single | |
1359 | (s1, gimple_omp_single_clauses (stmt)); | |
1360 | break; | |
1361 | ||
05a26161 JJ |
1362 | case GIMPLE_OMP_CRITICAL: |
1363 | s1 = remap_gimple_seq (gimple_omp_body (stmt), id); | |
1364 | copy | |
1365 | = gimple_build_omp_critical (s1, gimple_omp_critical_name (stmt)); | |
1366 | break; | |
1367 | ||
726a989a RB |
1368 | default: |
1369 | gcc_unreachable (); | |
1370 | } | |
1371 | } | |
1372 | else | |
1373 | { | |
1374 | if (gimple_assign_copy_p (stmt) | |
1375 | && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt) | |
1376 | && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn)) | |
1377 | { | |
1378 | /* Here we handle statements that are not completely rewritten. | |
1379 | First we detect some inlining-induced bogosities for | |
1380 | discarding. */ | |
1381 | ||
1382 | /* Some assignments VAR = VAR; don't generate any rtl code | |
1383 | and thus don't count as variable modification. Avoid | |
1384 | keeping bogosities like 0 = 0. */ | |
1385 | tree decl = gimple_assign_lhs (stmt), value; | |
1386 | tree *n; | |
1387 | ||
1388 | n = (tree *) pointer_map_contains (id->decl_map, decl); | |
1389 | if (n) | |
1390 | { | |
1391 | value = *n; | |
1392 | STRIP_TYPE_NOPS (value); | |
1393 | if (TREE_CONSTANT (value) || TREE_READONLY (value)) | |
1394 | return gimple_build_nop (); | |
1395 | } | |
1396 | } | |
1397 | ||
b5b8b0ac AO |
1398 | if (gimple_debug_bind_p (stmt)) |
1399 | { | |
1400 | copy = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt), | |
1401 | gimple_debug_bind_get_value (stmt), | |
1402 | stmt); | |
1403 | VEC_safe_push (gimple, heap, id->debug_stmts, copy); | |
1404 | return copy; | |
1405 | } | |
1d65f45c RH |
1406 | |
1407 | /* Create a new deep copy of the statement. */ | |
1408 | copy = gimple_copy (stmt); | |
1409 | ||
1410 | /* Remap the region numbers for __builtin_eh_{pointer,filter}, | |
1411 | RESX and EH_DISPATCH. */ | |
1412 | if (id->eh_map) | |
1413 | switch (gimple_code (copy)) | |
1414 | { | |
1415 | case GIMPLE_CALL: | |
1416 | { | |
1417 | tree r, fndecl = gimple_call_fndecl (copy); | |
1418 | if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) | |
1419 | switch (DECL_FUNCTION_CODE (fndecl)) | |
1420 | { | |
1421 | case BUILT_IN_EH_COPY_VALUES: | |
1422 | r = gimple_call_arg (copy, 1); | |
1423 | r = remap_eh_region_tree_nr (r, id); | |
1424 | gimple_call_set_arg (copy, 1, r); | |
1425 | /* FALLTHRU */ | |
1426 | ||
1427 | case BUILT_IN_EH_POINTER: | |
1428 | case BUILT_IN_EH_FILTER: | |
1429 | r = gimple_call_arg (copy, 0); | |
1430 | r = remap_eh_region_tree_nr (r, id); | |
1431 | gimple_call_set_arg (copy, 0, r); | |
1432 | break; | |
1433 | ||
1434 | default: | |
1435 | break; | |
1436 | } | |
d086d311 | 1437 | |
25a6a873 RG |
1438 | /* Reset alias info if we didn't apply measures to |
1439 | keep it valid over inlining by setting DECL_PT_UID. */ | |
1440 | if (!id->src_cfun->gimple_df | |
1441 | || !id->src_cfun->gimple_df->ipa_pta) | |
1442 | gimple_call_reset_alias_info (copy); | |
1d65f45c RH |
1443 | } |
1444 | break; | |
1445 | ||
1446 | case GIMPLE_RESX: | |
1447 | { | |
1448 | int r = gimple_resx_region (copy); | |
1449 | r = remap_eh_region_nr (r, id); | |
1450 | gimple_resx_set_region (copy, r); | |
1451 | } | |
1452 | break; | |
1453 | ||
1454 | case GIMPLE_EH_DISPATCH: | |
1455 | { | |
1456 | int r = gimple_eh_dispatch_region (copy); | |
1457 | r = remap_eh_region_nr (r, id); | |
1458 | gimple_eh_dispatch_set_region (copy, r); | |
1459 | } | |
1460 | break; | |
1461 | ||
1462 | default: | |
1463 | break; | |
1464 | } | |
726a989a RB |
1465 | } |
1466 | ||
1467 | /* If STMT has a block defined, map it to the newly constructed | |
1468 | block. When inlining we want statements without a block to | |
1469 | appear in the block of the function call. */ | |
1470 | new_block = id->block; | |
1471 | if (gimple_block (copy)) | |
1472 | { | |
1473 | tree *n; | |
1474 | n = (tree *) pointer_map_contains (id->decl_map, gimple_block (copy)); | |
1475 | gcc_assert (n); | |
1476 | new_block = *n; | |
1477 | } | |
1478 | ||
1479 | gimple_set_block (copy, new_block); | |
1480 | ||
b5b8b0ac AO |
1481 | if (gimple_debug_bind_p (copy)) |
1482 | return copy; | |
1483 | ||
726a989a RB |
1484 | /* Remap all the operands in COPY. */ |
1485 | memset (&wi, 0, sizeof (wi)); | |
1486 | wi.info = id; | |
5a6e26b7 JH |
1487 | if (skip_first) |
1488 | walk_tree (gimple_op_ptr (copy, 1), remap_gimple_op_r, &wi, NULL); | |
1489 | else | |
b8698a0f | 1490 | walk_gimple_op (copy, remap_gimple_op_r, &wi); |
726a989a | 1491 | |
5006671f RG |
1492 | /* Clear the copied virtual operands. We are not remapping them here |
1493 | but are going to recreate them from scratch. */ | |
1494 | if (gimple_has_mem_ops (copy)) | |
1495 | { | |
1496 | gimple_set_vdef (copy, NULL_TREE); | |
1497 | gimple_set_vuse (copy, NULL_TREE); | |
1498 | } | |
1499 | ||
726a989a RB |
1500 | return copy; |
1501 | } | |
1502 | ||
1503 | ||
e21aff8a SB |
1504 | /* Copy basic block, scale profile accordingly. Edges will be taken care of |
1505 | later */ | |
1506 | ||
1507 | static basic_block | |
0178d644 VR |
1508 | copy_bb (copy_body_data *id, basic_block bb, int frequency_scale, |
1509 | gcov_type count_scale) | |
e21aff8a | 1510 | { |
c2a4718a | 1511 | gimple_stmt_iterator gsi, copy_gsi, seq_gsi; |
e21aff8a | 1512 | basic_block copy_basic_block; |
726a989a | 1513 | tree decl; |
0d63a740 | 1514 | gcov_type freq; |
91382288 JH |
1515 | basic_block prev; |
1516 | ||
1517 | /* Search for previous copied basic block. */ | |
1518 | prev = bb->prev_bb; | |
1519 | while (!prev->aux) | |
1520 | prev = prev->prev_bb; | |
e21aff8a SB |
1521 | |
1522 | /* create_basic_block() will append every new block to | |
1523 | basic_block_info automatically. */ | |
cceb1885 | 1524 | copy_basic_block = create_basic_block (NULL, (void *) 0, |
91382288 | 1525 | (basic_block) prev->aux); |
e21aff8a | 1526 | copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE; |
45a80bb9 | 1527 | |
726a989a RB |
1528 | /* We are going to rebuild frequencies from scratch. These values |
1529 | have just small importance to drive canonicalize_loop_headers. */ | |
0d63a740 | 1530 | freq = ((gcov_type)bb->frequency * frequency_scale / REG_BR_PROB_BASE); |
726a989a | 1531 | |
0d63a740 JH |
1532 | /* We recompute frequencies after inlining, so this is quite safe. */ |
1533 | if (freq > BB_FREQ_MAX) | |
1534 | freq = BB_FREQ_MAX; | |
1535 | copy_basic_block->frequency = freq; | |
e21aff8a | 1536 | |
726a989a RB |
1537 | copy_gsi = gsi_start_bb (copy_basic_block); |
1538 | ||
1539 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
e21aff8a | 1540 | { |
726a989a RB |
1541 | gimple stmt = gsi_stmt (gsi); |
1542 | gimple orig_stmt = stmt; | |
e21aff8a | 1543 | |
416c991f | 1544 | id->regimplify = false; |
726a989a RB |
1545 | stmt = remap_gimple_stmt (stmt, id); |
1546 | if (gimple_nop_p (stmt)) | |
1547 | continue; | |
1548 | ||
1549 | gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt); | |
c2a4718a | 1550 | seq_gsi = copy_gsi; |
726a989a RB |
1551 | |
1552 | /* With return slot optimization we can end up with | |
1553 | non-gimple (foo *)&this->m, fix that here. */ | |
4c29307d JJ |
1554 | if (is_gimple_assign (stmt) |
1555 | && gimple_assign_rhs_code (stmt) == NOP_EXPR | |
1556 | && !is_gimple_val (gimple_assign_rhs1 (stmt))) | |
e21aff8a | 1557 | { |
726a989a | 1558 | tree new_rhs; |
c2a4718a | 1559 | new_rhs = force_gimple_operand_gsi (&seq_gsi, |
4a2b7f24 JJ |
1560 | gimple_assign_rhs1 (stmt), |
1561 | true, NULL, false, GSI_NEW_STMT); | |
726a989a | 1562 | gimple_assign_set_rhs1 (stmt, new_rhs); |
c2a4718a | 1563 | id->regimplify = false; |
726a989a | 1564 | } |
2b65dae5 | 1565 | |
c2a4718a JJ |
1566 | gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT); |
1567 | ||
1568 | if (id->regimplify) | |
1569 | gimple_regimplify_operands (stmt, &seq_gsi); | |
1570 | ||
1571 | /* If copy_basic_block has been empty at the start of this iteration, | |
1572 | call gsi_start_bb again to get at the newly added statements. */ | |
1573 | if (gsi_end_p (copy_gsi)) | |
1574 | copy_gsi = gsi_start_bb (copy_basic_block); | |
1575 | else | |
1576 | gsi_next (©_gsi); | |
110cfe1c | 1577 | |
726a989a RB |
1578 | /* Process the new statement. The call to gimple_regimplify_operands |
1579 | possibly turned the statement into multiple statements, we | |
1580 | need to process all of them. */ | |
c2a4718a | 1581 | do |
726a989a | 1582 | { |
9187e02d JH |
1583 | tree fn; |
1584 | ||
c2a4718a | 1585 | stmt = gsi_stmt (copy_gsi); |
726a989a RB |
1586 | if (is_gimple_call (stmt) |
1587 | && gimple_call_va_arg_pack_p (stmt) | |
1588 | && id->gimple_call) | |
1589 | { | |
1590 | /* __builtin_va_arg_pack () should be replaced by | |
1591 | all arguments corresponding to ... in the caller. */ | |
1592 | tree p; | |
1593 | gimple new_call; | |
1594 | VEC(tree, heap) *argarray; | |
1595 | size_t nargs = gimple_call_num_args (id->gimple_call); | |
1596 | size_t n; | |
1597 | ||
1598 | for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p)) | |
1599 | nargs--; | |
1600 | ||
1601 | /* Create the new array of arguments. */ | |
1602 | n = nargs + gimple_call_num_args (stmt); | |
1603 | argarray = VEC_alloc (tree, heap, n); | |
1604 | VEC_safe_grow (tree, heap, argarray, n); | |
1605 | ||
1606 | /* Copy all the arguments before '...' */ | |
1607 | memcpy (VEC_address (tree, argarray), | |
1608 | gimple_call_arg_ptr (stmt, 0), | |
1609 | gimple_call_num_args (stmt) * sizeof (tree)); | |
1610 | ||
1611 | /* Append the arguments passed in '...' */ | |
1612 | memcpy (VEC_address(tree, argarray) + gimple_call_num_args (stmt), | |
1613 | gimple_call_arg_ptr (id->gimple_call, 0) | |
1614 | + (gimple_call_num_args (id->gimple_call) - nargs), | |
1615 | nargs * sizeof (tree)); | |
1616 | ||
1617 | new_call = gimple_build_call_vec (gimple_call_fn (stmt), | |
1618 | argarray); | |
1619 | ||
1620 | VEC_free (tree, heap, argarray); | |
1621 | ||
1622 | /* Copy all GIMPLE_CALL flags, location and block, except | |
1623 | GF_CALL_VA_ARG_PACK. */ | |
1624 | gimple_call_copy_flags (new_call, stmt); | |
1625 | gimple_call_set_va_arg_pack (new_call, false); | |
1626 | gimple_set_location (new_call, gimple_location (stmt)); | |
1627 | gimple_set_block (new_call, gimple_block (stmt)); | |
1628 | gimple_call_set_lhs (new_call, gimple_call_lhs (stmt)); | |
1629 | ||
1630 | gsi_replace (©_gsi, new_call, false); | |
1631 | stmt = new_call; | |
1632 | } | |
1633 | else if (is_gimple_call (stmt) | |
1634 | && id->gimple_call | |
1635 | && (decl = gimple_call_fndecl (stmt)) | |
1636 | && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL | |
1637 | && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN) | |
e0704a46 | 1638 | { |
726a989a RB |
1639 | /* __builtin_va_arg_pack_len () should be replaced by |
1640 | the number of anonymous arguments. */ | |
1641 | size_t nargs = gimple_call_num_args (id->gimple_call); | |
1642 | tree count, p; | |
1643 | gimple new_stmt; | |
1644 | ||
1645 | for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p)) | |
1646 | nargs--; | |
1647 | ||
1648 | count = build_int_cst (integer_type_node, nargs); | |
1649 | new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count); | |
1650 | gsi_replace (©_gsi, new_stmt, false); | |
1651 | stmt = new_stmt; | |
1652 | } | |
b8a00a4d | 1653 | |
726a989a RB |
1654 | /* Statements produced by inlining can be unfolded, especially |
1655 | when we constant propagated some operands. We can't fold | |
1656 | them right now for two reasons: | |
1657 | 1) folding require SSA_NAME_DEF_STMTs to be correct | |
1658 | 2) we can't change function calls to builtins. | |
1659 | So we just mark statement for later folding. We mark | |
1660 | all new statements, instead just statements that has changed | |
1661 | by some nontrivial substitution so even statements made | |
1662 | foldable indirectly are updated. If this turns out to be | |
1663 | expensive, copy_body can be told to watch for nontrivial | |
1664 | changes. */ | |
1665 | if (id->statements_to_fold) | |
1666 | pointer_set_insert (id->statements_to_fold, stmt); | |
1667 | ||
1668 | /* We're duplicating a CALL_EXPR. Find any corresponding | |
1669 | callgraph edges and update or duplicate them. */ | |
1670 | if (is_gimple_call (stmt)) | |
1671 | { | |
9b2a5ef7 | 1672 | struct cgraph_edge *edge; |
f618d33e | 1673 | int flags; |
6ef5231b | 1674 | |
726a989a | 1675 | switch (id->transform_call_graph_edges) |
e0704a46 | 1676 | { |
9b2a5ef7 RH |
1677 | case CB_CGE_DUPLICATE: |
1678 | edge = cgraph_edge (id->src_node, orig_stmt); | |
1679 | if (edge) | |
0d63a740 JH |
1680 | { |
1681 | int edge_freq = edge->frequency; | |
1682 | edge = cgraph_clone_edge (edge, id->dst_node, stmt, | |
1683 | gimple_uid (stmt), | |
1684 | REG_BR_PROB_BASE, CGRAPH_FREQ_BASE, | |
1685 | edge->frequency, true); | |
1686 | /* We could also just rescale the frequency, but | |
1687 | doing so would introduce roundoff errors and make | |
1688 | verifier unhappy. */ | |
b8698a0f | 1689 | edge->frequency |
0d63a740 JH |
1690 | = compute_call_stmt_bb_frequency (id->dst_node->decl, |
1691 | copy_basic_block); | |
1692 | if (dump_file | |
1693 | && profile_status_for_function (cfun) != PROFILE_ABSENT | |
1694 | && (edge_freq > edge->frequency + 10 | |
1695 | || edge_freq < edge->frequency - 10)) | |
1696 | { | |
1697 | fprintf (dump_file, "Edge frequency estimated by " | |
1698 | "cgraph %i diverge from inliner's estimate %i\n", | |
1699 | edge_freq, | |
1700 | edge->frequency); | |
1701 | fprintf (dump_file, | |
1702 | "Orig bb: %i, orig bb freq %i, new bb freq %i\n", | |
1703 | bb->index, | |
1704 | bb->frequency, | |
1705 | copy_basic_block->frequency); | |
1706 | } | |
8132a837 | 1707 | stmt = cgraph_redirect_edge_call_stmt_to_callee (edge); |
0d63a740 | 1708 | } |
9b2a5ef7 RH |
1709 | break; |
1710 | ||
1711 | case CB_CGE_MOVE_CLONES: | |
1712 | cgraph_set_call_stmt_including_clones (id->dst_node, | |
1713 | orig_stmt, stmt); | |
1714 | edge = cgraph_edge (id->dst_node, stmt); | |
1715 | break; | |
1716 | ||
1717 | case CB_CGE_MOVE: | |
1718 | edge = cgraph_edge (id->dst_node, orig_stmt); | |
1719 | if (edge) | |
1720 | cgraph_set_call_stmt (edge, stmt); | |
1721 | break; | |
1722 | ||
1723 | default: | |
1724 | gcc_unreachable (); | |
110cfe1c | 1725 | } |
f618d33e | 1726 | |
9b2a5ef7 RH |
1727 | /* Constant propagation on argument done during inlining |
1728 | may create new direct call. Produce an edge for it. */ | |
b8698a0f | 1729 | if ((!edge |
e33c6cd6 | 1730 | || (edge->indirect_inlining_edge |
9b2a5ef7 | 1731 | && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)) |
9b2a5ef7 RH |
1732 | && (fn = gimple_call_fndecl (stmt)) != NULL) |
1733 | { | |
1734 | struct cgraph_node *dest = cgraph_node (fn); | |
1735 | ||
1736 | /* We have missing edge in the callgraph. This can happen | |
1737 | when previous inlining turned an indirect call into a | |
0e3776db | 1738 | direct call by constant propagating arguments or we are |
20a6bb58 | 1739 | producing dead clone (for further cloning). In all |
9b2a5ef7 RH |
1740 | other cases we hit a bug (incorrect node sharing is the |
1741 | most common reason for missing edges). */ | |
0e3776db | 1742 | gcc_assert (dest->needed || !dest->analyzed |
bd3cdcc0 | 1743 | || dest->address_taken |
0e3776db | 1744 | || !id->src_node->analyzed); |
9b2a5ef7 RH |
1745 | if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES) |
1746 | cgraph_create_edge_including_clones | |
47cb0d7d | 1747 | (id->dst_node, dest, orig_stmt, stmt, bb->count, |
b8698a0f | 1748 | compute_call_stmt_bb_frequency (id->dst_node->decl, |
0d63a740 | 1749 | copy_basic_block), |
9b2a5ef7 RH |
1750 | bb->loop_depth, CIF_ORIGINALLY_INDIRECT_CALL); |
1751 | else | |
1752 | cgraph_create_edge (id->dst_node, dest, stmt, | |
47cb0d7d JH |
1753 | bb->count, |
1754 | compute_call_stmt_bb_frequency | |
1755 | (id->dst_node->decl, copy_basic_block), | |
9b2a5ef7 RH |
1756 | bb->loop_depth)->inline_failed |
1757 | = CIF_ORIGINALLY_INDIRECT_CALL; | |
1758 | if (dump_file) | |
1759 | { | |
91382288 | 1760 | fprintf (dump_file, "Created new direct edge to %s\n", |
9b2a5ef7 RH |
1761 | cgraph_node_name (dest)); |
1762 | } | |
1763 | } | |
9187e02d | 1764 | |
f618d33e | 1765 | flags = gimple_call_flags (stmt); |
f618d33e MJ |
1766 | if (flags & ECF_MAY_BE_ALLOCA) |
1767 | cfun->calls_alloca = true; | |
1768 | if (flags & ECF_RETURNS_TWICE) | |
1769 | cfun->calls_setjmp = true; | |
726a989a | 1770 | } |
e21aff8a | 1771 | |
1d65f45c RH |
1772 | maybe_duplicate_eh_stmt_fn (cfun, stmt, id->src_cfun, orig_stmt, |
1773 | id->eh_map, id->eh_lp_nr); | |
726a989a | 1774 | |
b5b8b0ac | 1775 | if (gimple_in_ssa_p (cfun) && !is_gimple_debug (stmt)) |
726a989a RB |
1776 | { |
1777 | ssa_op_iter i; | |
1778 | tree def; | |
1779 | ||
1780 | find_new_referenced_vars (gsi_stmt (copy_gsi)); | |
1781 | FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF) | |
1782 | if (TREE_CODE (def) == SSA_NAME) | |
1783 | SSA_NAME_DEF_STMT (def) = stmt; | |
1784 | } | |
1785 | ||
1786 | gsi_next (©_gsi); | |
e21aff8a | 1787 | } |
c2a4718a | 1788 | while (!gsi_end_p (copy_gsi)); |
726a989a RB |
1789 | |
1790 | copy_gsi = gsi_last_bb (copy_basic_block); | |
e21aff8a | 1791 | } |
726a989a | 1792 | |
e21aff8a SB |
1793 | return copy_basic_block; |
1794 | } | |
1795 | ||
110cfe1c JH |
1796 | /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA |
1797 | form is quite easy, since dominator relationship for old basic blocks does | |
1798 | not change. | |
1799 | ||
1800 | There is however exception where inlining might change dominator relation | |
1801 | across EH edges from basic block within inlined functions destinating | |
5305a4cb | 1802 | to landing pads in function we inline into. |
110cfe1c | 1803 | |
e9705dc5 AO |
1804 | The function fills in PHI_RESULTs of such PHI nodes if they refer |
1805 | to gimple regs. Otherwise, the function mark PHI_RESULT of such | |
1806 | PHI nodes for renaming. For non-gimple regs, renaming is safe: the | |
1807 | EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be | |
1808 | set, and this means that there will be no overlapping live ranges | |
110cfe1c JH |
1809 | for the underlying symbol. |
1810 | ||
1811 | This might change in future if we allow redirecting of EH edges and | |
1812 | we might want to change way build CFG pre-inlining to include | |
1813 | all the possible edges then. */ | |
1814 | static void | |
e9705dc5 AO |
1815 | update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb, |
1816 | bool can_throw, bool nonlocal_goto) | |
110cfe1c JH |
1817 | { |
1818 | edge e; | |
1819 | edge_iterator ei; | |
1820 | ||
1821 | FOR_EACH_EDGE (e, ei, bb->succs) | |
1822 | if (!e->dest->aux | |
1823 | || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK) | |
1824 | { | |
726a989a RB |
1825 | gimple phi; |
1826 | gimple_stmt_iterator si; | |
110cfe1c | 1827 | |
e9705dc5 AO |
1828 | if (!nonlocal_goto) |
1829 | gcc_assert (e->flags & EDGE_EH); | |
726a989a | 1830 | |
e9705dc5 AO |
1831 | if (!can_throw) |
1832 | gcc_assert (!(e->flags & EDGE_EH)); | |
726a989a RB |
1833 | |
1834 | for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si)) | |
110cfe1c | 1835 | { |
e9705dc5 AO |
1836 | edge re; |
1837 | ||
726a989a RB |
1838 | phi = gsi_stmt (si); |
1839 | ||
e9705dc5 AO |
1840 | /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */ |
1841 | gcc_assert (!e->dest->aux); | |
1842 | ||
496a4ef5 JH |
1843 | gcc_assert ((e->flags & EDGE_EH) |
1844 | || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi))); | |
e9705dc5 AO |
1845 | |
1846 | if (!is_gimple_reg (PHI_RESULT (phi))) | |
1847 | { | |
726a989a | 1848 | mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi))); |
e9705dc5 AO |
1849 | continue; |
1850 | } | |
1851 | ||
1852 | re = find_edge (ret_bb, e->dest); | |
1432b19f | 1853 | gcc_assert (re); |
e9705dc5 AO |
1854 | gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL)) |
1855 | == (e->flags & (EDGE_EH | EDGE_ABNORMAL))); | |
1856 | ||
1857 | SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e), | |
1858 | USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re))); | |
110cfe1c JH |
1859 | } |
1860 | } | |
1861 | } | |
1862 | ||
726a989a | 1863 | |
128a79fb KH |
1864 | /* Copy edges from BB into its copy constructed earlier, scale profile |
1865 | accordingly. Edges will be taken care of later. Assume aux | |
90a7788b JJ |
1866 | pointers to point to the copies of each BB. Return true if any |
1867 | debug stmts are left after a statement that must end the basic block. */ | |
726a989a | 1868 | |
90a7788b | 1869 | static bool |
0178d644 | 1870 | copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb) |
e21aff8a | 1871 | { |
cceb1885 | 1872 | basic_block new_bb = (basic_block) bb->aux; |
e21aff8a SB |
1873 | edge_iterator ei; |
1874 | edge old_edge; | |
726a989a | 1875 | gimple_stmt_iterator si; |
e21aff8a | 1876 | int flags; |
90a7788b | 1877 | bool need_debug_cleanup = false; |
e21aff8a SB |
1878 | |
1879 | /* Use the indices from the original blocks to create edges for the | |
1880 | new ones. */ | |
1881 | FOR_EACH_EDGE (old_edge, ei, bb->succs) | |
e0704a46 JH |
1882 | if (!(old_edge->flags & EDGE_EH)) |
1883 | { | |
82d6e6fc | 1884 | edge new_edge; |
e21aff8a | 1885 | |
e0704a46 | 1886 | flags = old_edge->flags; |
e21aff8a | 1887 | |
e0704a46 JH |
1888 | /* Return edges do get a FALLTHRU flag when the get inlined. */ |
1889 | if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags | |
1890 | && old_edge->dest->aux != EXIT_BLOCK_PTR) | |
1891 | flags |= EDGE_FALLTHRU; | |
82d6e6fc KG |
1892 | new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags); |
1893 | new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE; | |
1894 | new_edge->probability = old_edge->probability; | |
e0704a46 | 1895 | } |
e21aff8a SB |
1896 | |
1897 | if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK) | |
90a7788b | 1898 | return false; |
e21aff8a | 1899 | |
726a989a | 1900 | for (si = gsi_start_bb (new_bb); !gsi_end_p (si);) |
e21aff8a | 1901 | { |
726a989a | 1902 | gimple copy_stmt; |
e9705dc5 | 1903 | bool can_throw, nonlocal_goto; |
e21aff8a | 1904 | |
726a989a | 1905 | copy_stmt = gsi_stmt (si); |
b5b8b0ac AO |
1906 | if (!is_gimple_debug (copy_stmt)) |
1907 | { | |
1908 | update_stmt (copy_stmt); | |
1909 | if (gimple_in_ssa_p (cfun)) | |
1910 | mark_symbols_for_renaming (copy_stmt); | |
1911 | } | |
726a989a | 1912 | |
e21aff8a | 1913 | /* Do this before the possible split_block. */ |
726a989a | 1914 | gsi_next (&si); |
e21aff8a SB |
1915 | |
1916 | /* If this tree could throw an exception, there are two | |
1917 | cases where we need to add abnormal edge(s): the | |
1918 | tree wasn't in a region and there is a "current | |
1919 | region" in the caller; or the original tree had | |
1920 | EH edges. In both cases split the block after the tree, | |
1921 | and add abnormal edge(s) as needed; we need both | |
1922 | those from the callee and the caller. | |
1923 | We check whether the copy can throw, because the const | |
1924 | propagation can change an INDIRECT_REF which throws | |
1925 | into a COMPONENT_REF which doesn't. If the copy | |
1926 | can throw, the original could also throw. */ | |
726a989a RB |
1927 | can_throw = stmt_can_throw_internal (copy_stmt); |
1928 | nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt); | |
e9705dc5 AO |
1929 | |
1930 | if (can_throw || nonlocal_goto) | |
e21aff8a | 1931 | { |
90a7788b JJ |
1932 | if (!gsi_end_p (si)) |
1933 | { | |
1934 | while (!gsi_end_p (si) && is_gimple_debug (gsi_stmt (si))) | |
1935 | gsi_next (&si); | |
1936 | if (gsi_end_p (si)) | |
1937 | need_debug_cleanup = true; | |
1938 | } | |
726a989a | 1939 | if (!gsi_end_p (si)) |
e21aff8a SB |
1940 | /* Note that bb's predecessor edges aren't necessarily |
1941 | right at this point; split_block doesn't care. */ | |
1942 | { | |
1943 | edge e = split_block (new_bb, copy_stmt); | |
110cfe1c | 1944 | |
e21aff8a | 1945 | new_bb = e->dest; |
110cfe1c | 1946 | new_bb->aux = e->src->aux; |
726a989a | 1947 | si = gsi_start_bb (new_bb); |
e21aff8a | 1948 | } |
e9705dc5 | 1949 | } |
e21aff8a | 1950 | |
1d65f45c RH |
1951 | if (gimple_code (copy_stmt) == GIMPLE_EH_DISPATCH) |
1952 | make_eh_dispatch_edges (copy_stmt); | |
1953 | else if (can_throw) | |
e9705dc5 | 1954 | make_eh_edges (copy_stmt); |
110cfe1c | 1955 | |
e9705dc5 | 1956 | if (nonlocal_goto) |
726a989a | 1957 | make_abnormal_goto_edges (gimple_bb (copy_stmt), true); |
e9705dc5 AO |
1958 | |
1959 | if ((can_throw || nonlocal_goto) | |
1960 | && gimple_in_ssa_p (cfun)) | |
726a989a | 1961 | update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb, |
e9705dc5 | 1962 | can_throw, nonlocal_goto); |
110cfe1c | 1963 | } |
90a7788b | 1964 | return need_debug_cleanup; |
110cfe1c JH |
1965 | } |
1966 | ||
1967 | /* Copy the PHIs. All blocks and edges are copied, some blocks | |
1968 | was possibly split and new outgoing EH edges inserted. | |
1969 | BB points to the block of original function and AUX pointers links | |
1970 | the original and newly copied blocks. */ | |
1971 | ||
1972 | static void | |
1973 | copy_phis_for_bb (basic_block bb, copy_body_data *id) | |
1974 | { | |
3d9a9f94 | 1975 | basic_block const new_bb = (basic_block) bb->aux; |
110cfe1c | 1976 | edge_iterator ei; |
726a989a RB |
1977 | gimple phi; |
1978 | gimple_stmt_iterator si; | |
110cfe1c | 1979 | |
726a989a | 1980 | for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si)) |
110cfe1c | 1981 | { |
726a989a RB |
1982 | tree res, new_res; |
1983 | gimple new_phi; | |
110cfe1c JH |
1984 | edge new_edge; |
1985 | ||
726a989a RB |
1986 | phi = gsi_stmt (si); |
1987 | res = PHI_RESULT (phi); | |
1988 | new_res = res; | |
110cfe1c JH |
1989 | if (is_gimple_reg (res)) |
1990 | { | |
726a989a | 1991 | walk_tree (&new_res, copy_tree_body_r, id, NULL); |
110cfe1c JH |
1992 | SSA_NAME_DEF_STMT (new_res) |
1993 | = new_phi = create_phi_node (new_res, new_bb); | |
1994 | FOR_EACH_EDGE (new_edge, ei, new_bb->preds) | |
1995 | { | |
8b3057b3 JH |
1996 | edge old_edge = find_edge ((basic_block) new_edge->src->aux, bb); |
1997 | tree arg; | |
1998 | tree new_arg; | |
726a989a | 1999 | tree block = id->block; |
8b3057b3 JH |
2000 | edge_iterator ei2; |
2001 | ||
20a6bb58 | 2002 | /* When doing partial cloning, we allow PHIs on the entry block |
8b3057b3 JH |
2003 | as long as all the arguments are the same. Find any input |
2004 | edge to see argument to copy. */ | |
2005 | if (!old_edge) | |
2006 | FOR_EACH_EDGE (old_edge, ei2, bb->preds) | |
2007 | if (!old_edge->src->aux) | |
2008 | break; | |
2009 | ||
2010 | arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge); | |
2011 | new_arg = arg; | |
726a989a RB |
2012 | id->block = NULL_TREE; |
2013 | walk_tree (&new_arg, copy_tree_body_r, id, NULL); | |
2014 | id->block = block; | |
110cfe1c | 2015 | gcc_assert (new_arg); |
36b6e793 JJ |
2016 | /* With return slot optimization we can end up with |
2017 | non-gimple (foo *)&this->m, fix that here. */ | |
2018 | if (TREE_CODE (new_arg) != SSA_NAME | |
2019 | && TREE_CODE (new_arg) != FUNCTION_DECL | |
2020 | && !is_gimple_val (new_arg)) | |
2021 | { | |
726a989a RB |
2022 | gimple_seq stmts = NULL; |
2023 | new_arg = force_gimple_operand (new_arg, &stmts, true, NULL); | |
2024 | gsi_insert_seq_on_edge_immediate (new_edge, stmts); | |
36b6e793 | 2025 | } |
b8698a0f | 2026 | add_phi_arg (new_phi, new_arg, new_edge, |
f5045c96 | 2027 | gimple_phi_arg_location_from_edge (phi, old_edge)); |
110cfe1c | 2028 | } |
e21aff8a SB |
2029 | } |
2030 | } | |
2031 | } | |
2032 | ||
726a989a | 2033 | |
e21aff8a | 2034 | /* Wrapper for remap_decl so it can be used as a callback. */ |
726a989a | 2035 | |
e21aff8a SB |
2036 | static tree |
2037 | remap_decl_1 (tree decl, void *data) | |
2038 | { | |
1b369fae | 2039 | return remap_decl (decl, (copy_body_data *) data); |
e21aff8a SB |
2040 | } |
2041 | ||
110cfe1c JH |
2042 | /* Build struct function and associated datastructures for the new clone |
2043 | NEW_FNDECL to be build. CALLEE_FNDECL is the original */ | |
2044 | ||
2045 | static void | |
0d63a740 | 2046 | initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count) |
110cfe1c | 2047 | { |
110cfe1c | 2048 | struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl); |
0d63a740 | 2049 | gcov_type count_scale; |
110cfe1c JH |
2050 | |
2051 | if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count) | |
2052 | count_scale = (REG_BR_PROB_BASE * count | |
2053 | / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count); | |
2054 | else | |
0d63a740 | 2055 | count_scale = REG_BR_PROB_BASE; |
110cfe1c JH |
2056 | |
2057 | /* Register specific tree functions. */ | |
726a989a | 2058 | gimple_register_cfg_hooks (); |
39ecc018 JH |
2059 | |
2060 | /* Get clean struct function. */ | |
2061 | push_struct_function (new_fndecl); | |
2062 | ||
2063 | /* We will rebuild these, so just sanity check that they are empty. */ | |
2064 | gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL); | |
2065 | gcc_assert (cfun->local_decls == NULL); | |
2066 | gcc_assert (cfun->cfg == NULL); | |
2067 | gcc_assert (cfun->decl == new_fndecl); | |
2068 | ||
20a6bb58 | 2069 | /* Copy items we preserve during cloning. */ |
39ecc018 JH |
2070 | cfun->static_chain_decl = src_cfun->static_chain_decl; |
2071 | cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area; | |
2072 | cfun->function_end_locus = src_cfun->function_end_locus; | |
2073 | cfun->curr_properties = src_cfun->curr_properties; | |
2074 | cfun->last_verified = src_cfun->last_verified; | |
39ecc018 JH |
2075 | cfun->va_list_gpr_size = src_cfun->va_list_gpr_size; |
2076 | cfun->va_list_fpr_size = src_cfun->va_list_fpr_size; | |
39ecc018 JH |
2077 | cfun->has_nonlocal_label = src_cfun->has_nonlocal_label; |
2078 | cfun->stdarg = src_cfun->stdarg; | |
2079 | cfun->dont_save_pending_sizes_p = src_cfun->dont_save_pending_sizes_p; | |
2080 | cfun->after_inlining = src_cfun->after_inlining; | |
8f4f502f EB |
2081 | cfun->can_throw_non_call_exceptions |
2082 | = src_cfun->can_throw_non_call_exceptions; | |
39ecc018 JH |
2083 | cfun->returns_struct = src_cfun->returns_struct; |
2084 | cfun->returns_pcc_struct = src_cfun->returns_pcc_struct; | |
2085 | cfun->after_tree_profile = src_cfun->after_tree_profile; | |
2086 | ||
110cfe1c JH |
2087 | init_empty_tree_cfg (); |
2088 | ||
0d63a740 | 2089 | profile_status_for_function (cfun) = profile_status_for_function (src_cfun); |
110cfe1c JH |
2090 | ENTRY_BLOCK_PTR->count = |
2091 | (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale / | |
2092 | REG_BR_PROB_BASE); | |
0d63a740 JH |
2093 | ENTRY_BLOCK_PTR->frequency |
2094 | = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency; | |
110cfe1c JH |
2095 | EXIT_BLOCK_PTR->count = |
2096 | (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale / | |
2097 | REG_BR_PROB_BASE); | |
2098 | EXIT_BLOCK_PTR->frequency = | |
0d63a740 | 2099 | EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency; |
110cfe1c JH |
2100 | if (src_cfun->eh) |
2101 | init_eh_for_function (); | |
2102 | ||
2103 | if (src_cfun->gimple_df) | |
2104 | { | |
5db9ba0c | 2105 | init_tree_ssa (cfun); |
110cfe1c JH |
2106 | cfun->gimple_df->in_ssa_p = true; |
2107 | init_ssa_operands (); | |
2108 | } | |
2109 | pop_cfun (); | |
2110 | } | |
2111 | ||
90a7788b JJ |
2112 | /* Helper function for copy_cfg_body. Move debug stmts from the end |
2113 | of NEW_BB to the beginning of successor basic blocks when needed. If the | |
2114 | successor has multiple predecessors, reset them, otherwise keep | |
2115 | their value. */ | |
2116 | ||
2117 | static void | |
2118 | maybe_move_debug_stmts_to_successors (copy_body_data *id, basic_block new_bb) | |
2119 | { | |
2120 | edge e; | |
2121 | edge_iterator ei; | |
2122 | gimple_stmt_iterator si = gsi_last_nondebug_bb (new_bb); | |
2123 | ||
2124 | if (gsi_end_p (si) | |
2125 | || gsi_one_before_end_p (si) | |
2126 | || !(stmt_can_throw_internal (gsi_stmt (si)) | |
2127 | || stmt_can_make_abnormal_goto (gsi_stmt (si)))) | |
2128 | return; | |
2129 | ||
2130 | FOR_EACH_EDGE (e, ei, new_bb->succs) | |
2131 | { | |
2132 | gimple_stmt_iterator ssi = gsi_last_bb (new_bb); | |
2133 | gimple_stmt_iterator dsi = gsi_after_labels (e->dest); | |
2134 | while (is_gimple_debug (gsi_stmt (ssi))) | |
2135 | { | |
2136 | gimple stmt = gsi_stmt (ssi), new_stmt; | |
2137 | tree var; | |
2138 | tree value; | |
2139 | ||
2140 | /* For the last edge move the debug stmts instead of copying | |
2141 | them. */ | |
2142 | if (ei_one_before_end_p (ei)) | |
2143 | { | |
2144 | si = ssi; | |
2145 | gsi_prev (&ssi); | |
2146 | if (!single_pred_p (e->dest)) | |
2147 | gimple_debug_bind_reset_value (stmt); | |
2148 | gsi_remove (&si, false); | |
2149 | gsi_insert_before (&dsi, stmt, GSI_SAME_STMT); | |
2150 | continue; | |
2151 | } | |
2152 | ||
2153 | var = gimple_debug_bind_get_var (stmt); | |
2154 | if (single_pred_p (e->dest)) | |
2155 | { | |
2156 | value = gimple_debug_bind_get_value (stmt); | |
2157 | value = unshare_expr (value); | |
2158 | } | |
2159 | else | |
2160 | value = NULL_TREE; | |
2161 | new_stmt = gimple_build_debug_bind (var, value, stmt); | |
2162 | gsi_insert_before (&dsi, new_stmt, GSI_SAME_STMT); | |
2163 | VEC_safe_push (gimple, heap, id->debug_stmts, new_stmt); | |
2164 | gsi_prev (&ssi); | |
2165 | } | |
2166 | } | |
2167 | } | |
2168 | ||
e21aff8a SB |
2169 | /* Make a copy of the body of FN so that it can be inserted inline in |
2170 | another function. Walks FN via CFG, returns new fndecl. */ | |
2171 | ||
2172 | static tree | |
0d63a740 | 2173 | copy_cfg_body (copy_body_data * id, gcov_type count, int frequency_scale, |
91382288 JH |
2174 | basic_block entry_block_map, basic_block exit_block_map, |
2175 | bitmap blocks_to_copy, basic_block new_entry) | |
e21aff8a | 2176 | { |
1b369fae | 2177 | tree callee_fndecl = id->src_fn; |
e21aff8a | 2178 | /* Original cfun for the callee, doesn't change. */ |
1b369fae | 2179 | struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl); |
110cfe1c | 2180 | struct function *cfun_to_copy; |
e21aff8a SB |
2181 | basic_block bb; |
2182 | tree new_fndecl = NULL; | |
90a7788b | 2183 | bool need_debug_cleanup = false; |
0d63a740 | 2184 | gcov_type count_scale; |
110cfe1c | 2185 | int last; |
20a6bb58 JH |
2186 | int incoming_frequency = 0; |
2187 | gcov_type incoming_count = 0; | |
e21aff8a | 2188 | |
1b369fae | 2189 | if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count) |
e21aff8a | 2190 | count_scale = (REG_BR_PROB_BASE * count |
1b369fae | 2191 | / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count); |
e21aff8a | 2192 | else |
0d63a740 | 2193 | count_scale = REG_BR_PROB_BASE; |
e21aff8a SB |
2194 | |
2195 | /* Register specific tree functions. */ | |
726a989a | 2196 | gimple_register_cfg_hooks (); |
e21aff8a | 2197 | |
b35366ce JH |
2198 | /* If we are inlining just region of the function, make sure to connect new entry |
2199 | to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute | |
2200 | frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and | |
20a6bb58 | 2201 | probabilities of edges incoming from nonduplicated region. */ |
b35366ce JH |
2202 | if (new_entry) |
2203 | { | |
2204 | edge e; | |
2205 | edge_iterator ei; | |
2206 | ||
2207 | FOR_EACH_EDGE (e, ei, new_entry->preds) | |
2208 | if (!e->src->aux) | |
2209 | { | |
20a6bb58 JH |
2210 | incoming_frequency += EDGE_FREQUENCY (e); |
2211 | incoming_count += e->count; | |
b35366ce | 2212 | } |
20a6bb58 JH |
2213 | incoming_count = incoming_count * count_scale / REG_BR_PROB_BASE; |
2214 | incoming_frequency | |
2215 | = incoming_frequency * frequency_scale / REG_BR_PROB_BASE; | |
2216 | ENTRY_BLOCK_PTR->count = incoming_count; | |
2217 | ENTRY_BLOCK_PTR->frequency = incoming_frequency; | |
b35366ce JH |
2218 | } |
2219 | ||
e21aff8a SB |
2220 | /* Must have a CFG here at this point. */ |
2221 | gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION | |
2222 | (DECL_STRUCT_FUNCTION (callee_fndecl))); | |
2223 | ||
110cfe1c JH |
2224 | cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl); |
2225 | ||
e21aff8a SB |
2226 | ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map; |
2227 | EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map; | |
110cfe1c JH |
2228 | entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy); |
2229 | exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy); | |
e21aff8a | 2230 | |
e21aff8a SB |
2231 | /* Duplicate any exception-handling regions. */ |
2232 | if (cfun->eh) | |
1d65f45c RH |
2233 | id->eh_map = duplicate_eh_regions (cfun_to_copy, NULL, id->eh_lp_nr, |
2234 | remap_decl_1, id); | |
726a989a | 2235 | |
e21aff8a SB |
2236 | /* Use aux pointers to map the original blocks to copy. */ |
2237 | FOR_EACH_BB_FN (bb, cfun_to_copy) | |
91382288 JH |
2238 | if (!blocks_to_copy || bitmap_bit_p (blocks_to_copy, bb->index)) |
2239 | { | |
2240 | basic_block new_bb = copy_bb (id, bb, frequency_scale, count_scale); | |
2241 | bb->aux = new_bb; | |
2242 | new_bb->aux = bb; | |
2243 | } | |
110cfe1c | 2244 | |
7c57be85 | 2245 | last = last_basic_block; |
726a989a | 2246 | |
e21aff8a SB |
2247 | /* Now that we've duplicated the blocks, duplicate their edges. */ |
2248 | FOR_ALL_BB_FN (bb, cfun_to_copy) | |
91382288 JH |
2249 | if (!blocks_to_copy |
2250 | || (bb->index > 0 && bitmap_bit_p (blocks_to_copy, bb->index))) | |
2251 | need_debug_cleanup |= copy_edges_for_bb (bb, count_scale, exit_block_map); | |
726a989a | 2252 | |
91382288 | 2253 | if (new_entry) |
110cfe1c | 2254 | { |
b35366ce | 2255 | edge e = make_edge (entry_block_map, (basic_block)new_entry->aux, EDGE_FALLTHRU); |
91382288 | 2256 | e->probability = REG_BR_PROB_BASE; |
20a6bb58 | 2257 | e->count = incoming_count; |
110cfe1c | 2258 | } |
726a989a | 2259 | |
8b3057b3 JH |
2260 | if (gimple_in_ssa_p (cfun)) |
2261 | FOR_ALL_BB_FN (bb, cfun_to_copy) | |
2262 | if (!blocks_to_copy | |
2263 | || (bb->index > 0 && bitmap_bit_p (blocks_to_copy, bb->index))) | |
2264 | copy_phis_for_bb (bb, id); | |
2265 | ||
91382288 JH |
2266 | FOR_ALL_BB_FN (bb, cfun_to_copy) |
2267 | if (bb->aux) | |
2268 | { | |
2269 | if (need_debug_cleanup | |
2270 | && bb->index != ENTRY_BLOCK | |
2271 | && bb->index != EXIT_BLOCK) | |
2272 | maybe_move_debug_stmts_to_successors (id, (basic_block) bb->aux); | |
2273 | ((basic_block)bb->aux)->aux = NULL; | |
2274 | bb->aux = NULL; | |
2275 | } | |
2276 | ||
110cfe1c JH |
2277 | /* Zero out AUX fields of newly created block during EH edge |
2278 | insertion. */ | |
7c57be85 | 2279 | for (; last < last_basic_block; last++) |
90a7788b JJ |
2280 | { |
2281 | if (need_debug_cleanup) | |
2282 | maybe_move_debug_stmts_to_successors (id, BASIC_BLOCK (last)); | |
2283 | BASIC_BLOCK (last)->aux = NULL; | |
2284 | } | |
110cfe1c JH |
2285 | entry_block_map->aux = NULL; |
2286 | exit_block_map->aux = NULL; | |
e21aff8a | 2287 | |
1d65f45c RH |
2288 | if (id->eh_map) |
2289 | { | |
2290 | pointer_map_destroy (id->eh_map); | |
2291 | id->eh_map = NULL; | |
2292 | } | |
2293 | ||
e21aff8a SB |
2294 | return new_fndecl; |
2295 | } | |
2296 | ||
b5b8b0ac AO |
2297 | /* Copy the debug STMT using ID. We deal with these statements in a |
2298 | special way: if any variable in their VALUE expression wasn't | |
2299 | remapped yet, we won't remap it, because that would get decl uids | |
2300 | out of sync, causing codegen differences between -g and -g0. If | |
2301 | this arises, we drop the VALUE expression altogether. */ | |
2302 | ||
2303 | static void | |
2304 | copy_debug_stmt (gimple stmt, copy_body_data *id) | |
2305 | { | |
2306 | tree t, *n; | |
2307 | struct walk_stmt_info wi; | |
2308 | ||
2309 | t = id->block; | |
2310 | if (gimple_block (stmt)) | |
2311 | { | |
2312 | tree *n; | |
2313 | n = (tree *) pointer_map_contains (id->decl_map, gimple_block (stmt)); | |
2314 | if (n) | |
2315 | t = *n; | |
2316 | } | |
2317 | gimple_set_block (stmt, t); | |
2318 | ||
2319 | /* Remap all the operands in COPY. */ | |
2320 | memset (&wi, 0, sizeof (wi)); | |
2321 | wi.info = id; | |
2322 | ||
2323 | processing_debug_stmt = 1; | |
2324 | ||
2325 | t = gimple_debug_bind_get_var (stmt); | |
2326 | ||
2327 | if (TREE_CODE (t) == PARM_DECL && id->debug_map | |
2328 | && (n = (tree *) pointer_map_contains (id->debug_map, t))) | |
2329 | { | |
2330 | gcc_assert (TREE_CODE (*n) == VAR_DECL); | |
2331 | t = *n; | |
2332 | } | |
d17af147 JJ |
2333 | else if (TREE_CODE (t) == VAR_DECL |
2334 | && !TREE_STATIC (t) | |
2335 | && gimple_in_ssa_p (cfun) | |
2336 | && !pointer_map_contains (id->decl_map, t) | |
2337 | && !var_ann (t)) | |
2338 | /* T is a non-localized variable. */; | |
b5b8b0ac AO |
2339 | else |
2340 | walk_tree (&t, remap_gimple_op_r, &wi, NULL); | |
2341 | ||
2342 | gimple_debug_bind_set_var (stmt, t); | |
2343 | ||
2344 | if (gimple_debug_bind_has_value_p (stmt)) | |
2345 | walk_tree (gimple_debug_bind_get_value_ptr (stmt), | |
2346 | remap_gimple_op_r, &wi, NULL); | |
2347 | ||
2348 | /* Punt if any decl couldn't be remapped. */ | |
2349 | if (processing_debug_stmt < 0) | |
2350 | gimple_debug_bind_reset_value (stmt); | |
2351 | ||
2352 | processing_debug_stmt = 0; | |
2353 | ||
2354 | update_stmt (stmt); | |
2355 | if (gimple_in_ssa_p (cfun)) | |
2356 | mark_symbols_for_renaming (stmt); | |
2357 | } | |
2358 | ||
2359 | /* Process deferred debug stmts. In order to give values better odds | |
2360 | of being successfully remapped, we delay the processing of debug | |
2361 | stmts until all other stmts that might require remapping are | |
2362 | processed. */ | |
2363 | ||
2364 | static void | |
2365 | copy_debug_stmts (copy_body_data *id) | |
2366 | { | |
2367 | size_t i; | |
2368 | gimple stmt; | |
2369 | ||
2370 | if (!id->debug_stmts) | |
2371 | return; | |
2372 | ||
2373 | for (i = 0; VEC_iterate (gimple, id->debug_stmts, i, stmt); i++) | |
2374 | copy_debug_stmt (stmt, id); | |
2375 | ||
2376 | VEC_free (gimple, heap, id->debug_stmts); | |
2377 | } | |
2378 | ||
f82a627c EB |
2379 | /* Make a copy of the body of SRC_FN so that it can be inserted inline in |
2380 | another function. */ | |
2381 | ||
2382 | static tree | |
2383 | copy_tree_body (copy_body_data *id) | |
2384 | { | |
2385 | tree fndecl = id->src_fn; | |
2386 | tree body = DECL_SAVED_TREE (fndecl); | |
2387 | ||
2388 | walk_tree (&body, copy_tree_body_r, id, NULL); | |
2389 | ||
2390 | return body; | |
2391 | } | |
2392 | ||
b5b8b0ac AO |
2393 | /* Make a copy of the body of FN so that it can be inserted inline in |
2394 | another function. */ | |
2395 | ||
e21aff8a | 2396 | static tree |
0d63a740 | 2397 | copy_body (copy_body_data *id, gcov_type count, int frequency_scale, |
91382288 JH |
2398 | basic_block entry_block_map, basic_block exit_block_map, |
2399 | bitmap blocks_to_copy, basic_block new_entry) | |
e21aff8a | 2400 | { |
1b369fae | 2401 | tree fndecl = id->src_fn; |
e21aff8a SB |
2402 | tree body; |
2403 | ||
2404 | /* If this body has a CFG, walk CFG and copy. */ | |
2405 | gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl))); | |
91382288 JH |
2406 | body = copy_cfg_body (id, count, frequency_scale, entry_block_map, exit_block_map, |
2407 | blocks_to_copy, new_entry); | |
b5b8b0ac | 2408 | copy_debug_stmts (id); |
e21aff8a SB |
2409 | |
2410 | return body; | |
2411 | } | |
2412 | ||
04482133 AO |
2413 | /* Return true if VALUE is an ADDR_EXPR of an automatic variable |
2414 | defined in function FN, or of a data member thereof. */ | |
2415 | ||
2416 | static bool | |
2417 | self_inlining_addr_expr (tree value, tree fn) | |
2418 | { | |
2419 | tree var; | |
2420 | ||
2421 | if (TREE_CODE (value) != ADDR_EXPR) | |
2422 | return false; | |
2423 | ||
2424 | var = get_base_address (TREE_OPERAND (value, 0)); | |
e21aff8a | 2425 | |
50886bf1 | 2426 | return var && auto_var_in_fn_p (var, fn); |
04482133 AO |
2427 | } |
2428 | ||
b5b8b0ac AO |
2429 | /* Append to BB a debug annotation that binds VAR to VALUE, inheriting |
2430 | lexical block and line number information from base_stmt, if given, | |
2431 | or from the last stmt of the block otherwise. */ | |
2432 | ||
2433 | static gimple | |
2434 | insert_init_debug_bind (copy_body_data *id, | |
2435 | basic_block bb, tree var, tree value, | |
2436 | gimple base_stmt) | |
2437 | { | |
2438 | gimple note; | |
2439 | gimple_stmt_iterator gsi; | |
2440 | tree tracked_var; | |
2441 | ||
2442 | if (!gimple_in_ssa_p (id->src_cfun)) | |
2443 | return NULL; | |
2444 | ||
2445 | if (!MAY_HAVE_DEBUG_STMTS) | |
2446 | return NULL; | |
2447 | ||
2448 | tracked_var = target_for_debug_bind (var); | |
2449 | if (!tracked_var) | |
2450 | return NULL; | |
2451 | ||
2452 | if (bb) | |
2453 | { | |
2454 | gsi = gsi_last_bb (bb); | |
2455 | if (!base_stmt && !gsi_end_p (gsi)) | |
2456 | base_stmt = gsi_stmt (gsi); | |
2457 | } | |
2458 | ||
2459 | note = gimple_build_debug_bind (tracked_var, value, base_stmt); | |
2460 | ||
2461 | if (bb) | |
2462 | { | |
2463 | if (!gsi_end_p (gsi)) | |
2464 | gsi_insert_after (&gsi, note, GSI_SAME_STMT); | |
2465 | else | |
2466 | gsi_insert_before (&gsi, note, GSI_SAME_STMT); | |
2467 | } | |
2468 | ||
2469 | return note; | |
2470 | } | |
2471 | ||
6de9cd9a | 2472 | static void |
b5b8b0ac | 2473 | insert_init_stmt (copy_body_data *id, basic_block bb, gimple init_stmt) |
0f1961a2 | 2474 | { |
0f1961a2 JH |
2475 | /* If VAR represents a zero-sized variable, it's possible that the |
2476 | assignment statement may result in no gimple statements. */ | |
2477 | if (init_stmt) | |
c2a4718a JJ |
2478 | { |
2479 | gimple_stmt_iterator si = gsi_last_bb (bb); | |
0f1961a2 | 2480 | |
bfb0b886 RG |
2481 | /* We can end up with init statements that store to a non-register |
2482 | from a rhs with a conversion. Handle that here by forcing the | |
2483 | rhs into a temporary. gimple_regimplify_operands is not | |
2484 | prepared to do this for us. */ | |
b5b8b0ac AO |
2485 | if (!is_gimple_debug (init_stmt) |
2486 | && !is_gimple_reg (gimple_assign_lhs (init_stmt)) | |
bfb0b886 RG |
2487 | && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt))) |
2488 | && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS) | |
2489 | { | |
2490 | tree rhs = build1 (gimple_assign_rhs_code (init_stmt), | |
2491 | gimple_expr_type (init_stmt), | |
2492 | gimple_assign_rhs1 (init_stmt)); | |
2493 | rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false, | |
2494 | GSI_NEW_STMT); | |
2495 | gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs)); | |
2496 | gimple_assign_set_rhs1 (init_stmt, rhs); | |
2497 | } | |
c2a4718a JJ |
2498 | gsi_insert_after (&si, init_stmt, GSI_NEW_STMT); |
2499 | gimple_regimplify_operands (init_stmt, &si); | |
2500 | mark_symbols_for_renaming (init_stmt); | |
b5b8b0ac AO |
2501 | |
2502 | if (!is_gimple_debug (init_stmt) && MAY_HAVE_DEBUG_STMTS) | |
2503 | { | |
2504 | tree var, def = gimple_assign_lhs (init_stmt); | |
2505 | ||
2506 | if (TREE_CODE (def) == SSA_NAME) | |
2507 | var = SSA_NAME_VAR (def); | |
2508 | else | |
2509 | var = def; | |
2510 | ||
2511 | insert_init_debug_bind (id, bb, var, def, init_stmt); | |
2512 | } | |
c2a4718a | 2513 | } |
0f1961a2 JH |
2514 | } |
2515 | ||
2516 | /* Initialize parameter P with VALUE. If needed, produce init statement | |
2517 | at the end of BB. When BB is NULL, we return init statement to be | |
2518 | output later. */ | |
2519 | static gimple | |
1b369fae | 2520 | setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn, |
e21aff8a | 2521 | basic_block bb, tree *vars) |
6de9cd9a | 2522 | { |
0f1961a2 | 2523 | gimple init_stmt = NULL; |
6de9cd9a | 2524 | tree var; |
f4088621 | 2525 | tree rhs = value; |
110cfe1c JH |
2526 | tree def = (gimple_in_ssa_p (cfun) |
2527 | ? gimple_default_def (id->src_cfun, p) : NULL); | |
6de9cd9a | 2528 | |
f4088621 RG |
2529 | if (value |
2530 | && value != error_mark_node | |
2531 | && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value))) | |
c54e3854 RG |
2532 | { |
2533 | if (fold_convertible_p (TREE_TYPE (p), value)) | |
2534 | rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value); | |
2535 | else | |
2536 | /* ??? For valid (GIMPLE) programs we should not end up here. | |
2537 | Still if something has gone wrong and we end up with truly | |
2538 | mismatched types here, fall back to using a VIEW_CONVERT_EXPR | |
2539 | to not leak invalid GIMPLE to the following passes. */ | |
2540 | rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value); | |
2541 | } | |
f4088621 | 2542 | |
b5b8b0ac AO |
2543 | /* Make an equivalent VAR_DECL. Note that we must NOT remap the type |
2544 | here since the type of this decl must be visible to the calling | |
2545 | function. */ | |
2546 | var = copy_decl_to_var (p, id); | |
2547 | ||
2548 | /* We're actually using the newly-created var. */ | |
2549 | if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL) | |
2550 | { | |
2551 | get_var_ann (var); | |
2552 | add_referenced_var (var); | |
2553 | } | |
2554 | ||
2555 | /* Declare this new variable. */ | |
2556 | TREE_CHAIN (var) = *vars; | |
2557 | *vars = var; | |
2558 | ||
2559 | /* Make gimplifier happy about this variable. */ | |
2560 | DECL_SEEN_IN_BIND_EXPR_P (var) = 1; | |
2561 | ||
110cfe1c | 2562 | /* If the parameter is never assigned to, has no SSA_NAMEs created, |
b5b8b0ac AO |
2563 | we would not need to create a new variable here at all, if it |
2564 | weren't for debug info. Still, we can just use the argument | |
2565 | value. */ | |
6de9cd9a DN |
2566 | if (TREE_READONLY (p) |
2567 | && !TREE_ADDRESSABLE (p) | |
110cfe1c JH |
2568 | && value && !TREE_SIDE_EFFECTS (value) |
2569 | && !def) | |
6de9cd9a | 2570 | { |
84936f6f RH |
2571 | /* We may produce non-gimple trees by adding NOPs or introduce |
2572 | invalid sharing when operand is not really constant. | |
2573 | It is not big deal to prohibit constant propagation here as | |
2574 | we will constant propagate in DOM1 pass anyway. */ | |
2575 | if (is_gimple_min_invariant (value) | |
f4088621 RG |
2576 | && useless_type_conversion_p (TREE_TYPE (p), |
2577 | TREE_TYPE (value)) | |
04482133 AO |
2578 | /* We have to be very careful about ADDR_EXPR. Make sure |
2579 | the base variable isn't a local variable of the inlined | |
2580 | function, e.g., when doing recursive inlining, direct or | |
2581 | mutually-recursive or whatever, which is why we don't | |
2582 | just test whether fn == current_function_decl. */ | |
2583 | && ! self_inlining_addr_expr (value, fn)) | |
6de9cd9a | 2584 | { |
6de9cd9a | 2585 | insert_decl_map (id, p, value); |
b5b8b0ac AO |
2586 | insert_debug_decl_map (id, p, var); |
2587 | return insert_init_debug_bind (id, bb, var, value, NULL); | |
6de9cd9a DN |
2588 | } |
2589 | } | |
2590 | ||
6de9cd9a DN |
2591 | /* Register the VAR_DECL as the equivalent for the PARM_DECL; |
2592 | that way, when the PARM_DECL is encountered, it will be | |
2593 | automatically replaced by the VAR_DECL. */ | |
7c7d3047 | 2594 | insert_decl_map (id, p, var); |
6de9cd9a | 2595 | |
6de9cd9a DN |
2596 | /* Even if P was TREE_READONLY, the new VAR should not be. |
2597 | In the original code, we would have constructed a | |
2598 | temporary, and then the function body would have never | |
2599 | changed the value of P. However, now, we will be | |
2600 | constructing VAR directly. The constructor body may | |
2601 | change its value multiple times as it is being | |
2602 | constructed. Therefore, it must not be TREE_READONLY; | |
2603 | the back-end assumes that TREE_READONLY variable is | |
2604 | assigned to only once. */ | |
2605 | if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p))) | |
2606 | TREE_READONLY (var) = 0; | |
2607 | ||
110cfe1c JH |
2608 | /* If there is no setup required and we are in SSA, take the easy route |
2609 | replacing all SSA names representing the function parameter by the | |
2610 | SSA name passed to function. | |
2611 | ||
2612 | We need to construct map for the variable anyway as it might be used | |
2613 | in different SSA names when parameter is set in function. | |
2614 | ||
8454d27e JH |
2615 | Do replacement at -O0 for const arguments replaced by constant. |
2616 | This is important for builtin_constant_p and other construct requiring | |
b5b8b0ac | 2617 | constant argument to be visible in inlined function body. */ |
110cfe1c | 2618 | if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p) |
8454d27e JH |
2619 | && (optimize |
2620 | || (TREE_READONLY (p) | |
2621 | && is_gimple_min_invariant (rhs))) | |
110cfe1c | 2622 | && (TREE_CODE (rhs) == SSA_NAME |
9b718f81 JH |
2623 | || is_gimple_min_invariant (rhs)) |
2624 | && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def)) | |
110cfe1c JH |
2625 | { |
2626 | insert_decl_map (id, def, rhs); | |
b5b8b0ac | 2627 | return insert_init_debug_bind (id, bb, var, rhs, NULL); |
110cfe1c JH |
2628 | } |
2629 | ||
f6f2da7d JH |
2630 | /* If the value of argument is never used, don't care about initializing |
2631 | it. */ | |
1cf5abb3 | 2632 | if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p)) |
f6f2da7d JH |
2633 | { |
2634 | gcc_assert (!value || !TREE_SIDE_EFFECTS (value)); | |
b5b8b0ac | 2635 | return insert_init_debug_bind (id, bb, var, rhs, NULL); |
f6f2da7d JH |
2636 | } |
2637 | ||
6de9cd9a DN |
2638 | /* Initialize this VAR_DECL from the equivalent argument. Convert |
2639 | the argument to the proper type in case it was promoted. */ | |
2640 | if (value) | |
2641 | { | |
6de9cd9a | 2642 | if (rhs == error_mark_node) |
110cfe1c | 2643 | { |
7c7d3047 | 2644 | insert_decl_map (id, p, var); |
b5b8b0ac | 2645 | return insert_init_debug_bind (id, bb, var, rhs, NULL); |
110cfe1c | 2646 | } |
afe08db5 | 2647 | |
73dab33b | 2648 | STRIP_USELESS_TYPE_CONVERSION (rhs); |
6de9cd9a | 2649 | |
726a989a | 2650 | /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we |
6de9cd9a | 2651 | keep our trees in gimple form. */ |
110cfe1c JH |
2652 | if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p)) |
2653 | { | |
2654 | def = remap_ssa_name (def, id); | |
726a989a | 2655 | init_stmt = gimple_build_assign (def, rhs); |
110cfe1c JH |
2656 | SSA_NAME_IS_DEFAULT_DEF (def) = 0; |
2657 | set_default_def (var, NULL); | |
2658 | } | |
2659 | else | |
726a989a | 2660 | init_stmt = gimple_build_assign (var, rhs); |
6de9cd9a | 2661 | |
0f1961a2 | 2662 | if (bb && init_stmt) |
b5b8b0ac | 2663 | insert_init_stmt (id, bb, init_stmt); |
6de9cd9a | 2664 | } |
0f1961a2 | 2665 | return init_stmt; |
6de9cd9a DN |
2666 | } |
2667 | ||
d4e4baa9 | 2668 | /* Generate code to initialize the parameters of the function at the |
726a989a | 2669 | top of the stack in ID from the GIMPLE_CALL STMT. */ |
d4e4baa9 | 2670 | |
e21aff8a | 2671 | static void |
726a989a | 2672 | initialize_inlined_parameters (copy_body_data *id, gimple stmt, |
e21aff8a | 2673 | tree fn, basic_block bb) |
d4e4baa9 | 2674 | { |
d4e4baa9 | 2675 | tree parms; |
726a989a | 2676 | size_t i; |
d4e4baa9 | 2677 | tree p; |
d436bff8 | 2678 | tree vars = NULL_TREE; |
726a989a | 2679 | tree static_chain = gimple_call_chain (stmt); |
d4e4baa9 AO |
2680 | |
2681 | /* Figure out what the parameters are. */ | |
18c6ada9 | 2682 | parms = DECL_ARGUMENTS (fn); |
d4e4baa9 | 2683 | |
d4e4baa9 AO |
2684 | /* Loop through the parameter declarations, replacing each with an |
2685 | equivalent VAR_DECL, appropriately initialized. */ | |
726a989a RB |
2686 | for (p = parms, i = 0; p; p = TREE_CHAIN (p), i++) |
2687 | { | |
2688 | tree val; | |
2689 | val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL; | |
2690 | setup_one_parameter (id, p, val, fn, bb, &vars); | |
2691 | } | |
ea184343 RG |
2692 | /* After remapping parameters remap their types. This has to be done |
2693 | in a second loop over all parameters to appropriately remap | |
2694 | variable sized arrays when the size is specified in a | |
2695 | parameter following the array. */ | |
2696 | for (p = parms, i = 0; p; p = TREE_CHAIN (p), i++) | |
2697 | { | |
2698 | tree *varp = (tree *) pointer_map_contains (id->decl_map, p); | |
2699 | if (varp | |
2700 | && TREE_CODE (*varp) == VAR_DECL) | |
2701 | { | |
72aa3dca | 2702 | tree def = (gimple_in_ssa_p (cfun) && is_gimple_reg (p) |
ea184343 | 2703 | ? gimple_default_def (id->src_cfun, p) : NULL); |
72aa3dca RG |
2704 | tree var = *varp; |
2705 | TREE_TYPE (var) = remap_type (TREE_TYPE (var), id); | |
ea184343 RG |
2706 | /* Also remap the default definition if it was remapped |
2707 | to the default definition of the parameter replacement | |
2708 | by the parameter setup. */ | |
72aa3dca | 2709 | if (def) |
ea184343 RG |
2710 | { |
2711 | tree *defp = (tree *) pointer_map_contains (id->decl_map, def); | |
2712 | if (defp | |
2713 | && TREE_CODE (*defp) == SSA_NAME | |
72aa3dca RG |
2714 | && SSA_NAME_VAR (*defp) == var) |
2715 | TREE_TYPE (*defp) = TREE_TYPE (var); | |
ea184343 RG |
2716 | } |
2717 | } | |
2718 | } | |
4838c5ee | 2719 | |
6de9cd9a DN |
2720 | /* Initialize the static chain. */ |
2721 | p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl; | |
ea99e0be | 2722 | gcc_assert (fn != current_function_decl); |
6de9cd9a DN |
2723 | if (p) |
2724 | { | |
2725 | /* No static chain? Seems like a bug in tree-nested.c. */ | |
1e128c5f | 2726 | gcc_assert (static_chain); |
4838c5ee | 2727 | |
e21aff8a | 2728 | setup_one_parameter (id, p, static_chain, fn, bb, &vars); |
4838c5ee AO |
2729 | } |
2730 | ||
e21aff8a | 2731 | declare_inline_vars (id->block, vars); |
d4e4baa9 AO |
2732 | } |
2733 | ||
726a989a | 2734 | |
e21aff8a SB |
2735 | /* Declare a return variable to replace the RESULT_DECL for the |
2736 | function we are calling. An appropriate DECL_STMT is returned. | |
2737 | The USE_STMT is filled to contain a use of the declaration to | |
2738 | indicate the return value of the function. | |
2739 | ||
110cfe1c JH |
2740 | RETURN_SLOT, if non-null is place where to store the result. It |
2741 | is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null, | |
726a989a | 2742 | was the LHS of the MODIFY_EXPR to which this call is the RHS. |
7740f00d | 2743 | |
0f900dfa JJ |
2744 | The return value is a (possibly null) value that holds the result |
2745 | as seen by the caller. */ | |
d4e4baa9 | 2746 | |
d436bff8 | 2747 | static tree |
6938f93f JH |
2748 | declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest, |
2749 | basic_block entry_bb) | |
d4e4baa9 | 2750 | { |
1b369fae RH |
2751 | tree callee = id->src_fn; |
2752 | tree caller = id->dst_fn; | |
7740f00d RH |
2753 | tree result = DECL_RESULT (callee); |
2754 | tree callee_type = TREE_TYPE (result); | |
ea2edf88 | 2755 | tree caller_type; |
7740f00d | 2756 | tree var, use; |
d4e4baa9 | 2757 | |
ea2edf88 RG |
2758 | /* Handle type-mismatches in the function declaration return type |
2759 | vs. the call expression. */ | |
2760 | if (modify_dest) | |
2761 | caller_type = TREE_TYPE (modify_dest); | |
2762 | else | |
2763 | caller_type = TREE_TYPE (TREE_TYPE (callee)); | |
2764 | ||
d4e4baa9 AO |
2765 | /* We don't need to do anything for functions that don't return |
2766 | anything. */ | |
7740f00d | 2767 | if (!result || VOID_TYPE_P (callee_type)) |
0f900dfa | 2768 | return NULL_TREE; |
d4e4baa9 | 2769 | |
cc77ae10 | 2770 | /* If there was a return slot, then the return value is the |
7740f00d | 2771 | dereferenced address of that object. */ |
110cfe1c | 2772 | if (return_slot) |
7740f00d | 2773 | { |
110cfe1c | 2774 | /* The front end shouldn't have used both return_slot and |
7740f00d | 2775 | a modify expression. */ |
1e128c5f | 2776 | gcc_assert (!modify_dest); |
cc77ae10 | 2777 | if (DECL_BY_REFERENCE (result)) |
110cfe1c JH |
2778 | { |
2779 | tree return_slot_addr = build_fold_addr_expr (return_slot); | |
2780 | STRIP_USELESS_TYPE_CONVERSION (return_slot_addr); | |
2781 | ||
2782 | /* We are going to construct *&return_slot and we can't do that | |
b8698a0f | 2783 | for variables believed to be not addressable. |
110cfe1c JH |
2784 | |
2785 | FIXME: This check possibly can match, because values returned | |
2786 | via return slot optimization are not believed to have address | |
2787 | taken by alias analysis. */ | |
2788 | gcc_assert (TREE_CODE (return_slot) != SSA_NAME); | |
110cfe1c JH |
2789 | var = return_slot_addr; |
2790 | } | |
cc77ae10 | 2791 | else |
110cfe1c JH |
2792 | { |
2793 | var = return_slot; | |
2794 | gcc_assert (TREE_CODE (var) != SSA_NAME); | |
b5ca517c | 2795 | TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result); |
110cfe1c | 2796 | } |
0890b981 AP |
2797 | if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE |
2798 | || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE) | |
2799 | && !DECL_GIMPLE_REG_P (result) | |
22918034 | 2800 | && DECL_P (var)) |
0890b981 | 2801 | DECL_GIMPLE_REG_P (var) = 0; |
7740f00d RH |
2802 | use = NULL; |
2803 | goto done; | |
2804 | } | |
2805 | ||
2806 | /* All types requiring non-trivial constructors should have been handled. */ | |
1e128c5f | 2807 | gcc_assert (!TREE_ADDRESSABLE (callee_type)); |
7740f00d RH |
2808 | |
2809 | /* Attempt to avoid creating a new temporary variable. */ | |
110cfe1c JH |
2810 | if (modify_dest |
2811 | && TREE_CODE (modify_dest) != SSA_NAME) | |
7740f00d RH |
2812 | { |
2813 | bool use_it = false; | |
2814 | ||
2815 | /* We can't use MODIFY_DEST if there's type promotion involved. */ | |
f4088621 | 2816 | if (!useless_type_conversion_p (callee_type, caller_type)) |
7740f00d RH |
2817 | use_it = false; |
2818 | ||
2819 | /* ??? If we're assigning to a variable sized type, then we must | |
2820 | reuse the destination variable, because we've no good way to | |
2821 | create variable sized temporaries at this point. */ | |
2822 | else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST) | |
2823 | use_it = true; | |
2824 | ||
2825 | /* If the callee cannot possibly modify MODIFY_DEST, then we can | |
2826 | reuse it as the result of the call directly. Don't do this if | |
2827 | it would promote MODIFY_DEST to addressable. */ | |
e2f9fe42 RH |
2828 | else if (TREE_ADDRESSABLE (result)) |
2829 | use_it = false; | |
2830 | else | |
2831 | { | |
2832 | tree base_m = get_base_address (modify_dest); | |
2833 | ||
2834 | /* If the base isn't a decl, then it's a pointer, and we don't | |
2835 | know where that's going to go. */ | |
2836 | if (!DECL_P (base_m)) | |
2837 | use_it = false; | |
2838 | else if (is_global_var (base_m)) | |
2839 | use_it = false; | |
0890b981 AP |
2840 | else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE |
2841 | || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE) | |
2842 | && !DECL_GIMPLE_REG_P (result) | |
2843 | && DECL_GIMPLE_REG_P (base_m)) | |
1d327c16 | 2844 | use_it = false; |
e2f9fe42 RH |
2845 | else if (!TREE_ADDRESSABLE (base_m)) |
2846 | use_it = true; | |
2847 | } | |
7740f00d RH |
2848 | |
2849 | if (use_it) | |
2850 | { | |
2851 | var = modify_dest; | |
2852 | use = NULL; | |
2853 | goto done; | |
2854 | } | |
2855 | } | |
2856 | ||
1e128c5f | 2857 | gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST); |
7740f00d | 2858 | |
c08cd4c1 | 2859 | var = copy_result_decl_to_var (result, id); |
110cfe1c JH |
2860 | if (gimple_in_ssa_p (cfun)) |
2861 | { | |
2862 | get_var_ann (var); | |
2863 | add_referenced_var (var); | |
2864 | } | |
e21aff8a | 2865 | |
7740f00d | 2866 | DECL_SEEN_IN_BIND_EXPR_P (var) = 1; |
c021f10b | 2867 | add_local_decl (DECL_STRUCT_FUNCTION (caller), var); |
7740f00d | 2868 | |
6de9cd9a | 2869 | /* Do not have the rest of GCC warn about this variable as it should |
471854f8 | 2870 | not be visible to the user. */ |
6de9cd9a | 2871 | TREE_NO_WARNING (var) = 1; |
d4e4baa9 | 2872 | |
c08cd4c1 JM |
2873 | declare_inline_vars (id->block, var); |
2874 | ||
7740f00d RH |
2875 | /* Build the use expr. If the return type of the function was |
2876 | promoted, convert it back to the expected type. */ | |
2877 | use = var; | |
f4088621 | 2878 | if (!useless_type_conversion_p (caller_type, TREE_TYPE (var))) |
7740f00d | 2879 | use = fold_convert (caller_type, var); |
b8698a0f | 2880 | |
73dab33b | 2881 | STRIP_USELESS_TYPE_CONVERSION (use); |
7740f00d | 2882 | |
c08cd4c1 | 2883 | if (DECL_BY_REFERENCE (result)) |
32848948 RG |
2884 | { |
2885 | TREE_ADDRESSABLE (var) = 1; | |
2886 | var = build_fold_addr_expr (var); | |
2887 | } | |
c08cd4c1 | 2888 | |
7740f00d | 2889 | done: |
d4e4baa9 AO |
2890 | /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that |
2891 | way, when the RESULT_DECL is encountered, it will be | |
6938f93f JH |
2892 | automatically replaced by the VAR_DECL. |
2893 | ||
2894 | When returning by reference, ensure that RESULT_DECL remaps to | |
2895 | gimple_val. */ | |
2896 | if (DECL_BY_REFERENCE (result) | |
2897 | && !is_gimple_val (var)) | |
2898 | { | |
2899 | tree temp = create_tmp_var (TREE_TYPE (result), "retvalptr"); | |
72109b25 JH |
2900 | if (gimple_in_ssa_p (id->src_cfun)) |
2901 | { | |
2902 | get_var_ann (temp); | |
2903 | add_referenced_var (temp); | |
2904 | } | |
6938f93f JH |
2905 | insert_decl_map (id, result, temp); |
2906 | temp = remap_ssa_name (gimple_default_def (id->src_cfun, result), id); | |
2907 | insert_init_stmt (id, entry_bb, gimple_build_assign (temp, var)); | |
2908 | } | |
2909 | else | |
2910 | insert_decl_map (id, result, var); | |
d4e4baa9 | 2911 | |
6de9cd9a DN |
2912 | /* Remember this so we can ignore it in remap_decls. */ |
2913 | id->retvar = var; | |
2914 | ||
0f900dfa | 2915 | return use; |
d4e4baa9 AO |
2916 | } |
2917 | ||
27dbd3ac RH |
2918 | /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference |
2919 | to a local label. */ | |
4838c5ee | 2920 | |
27dbd3ac RH |
2921 | static tree |
2922 | has_label_address_in_static_1 (tree *nodep, int *walk_subtrees, void *fnp) | |
4838c5ee | 2923 | { |
27dbd3ac RH |
2924 | tree node = *nodep; |
2925 | tree fn = (tree) fnp; | |
726a989a | 2926 | |
27dbd3ac RH |
2927 | if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn) |
2928 | return node; | |
2929 | ||
2930 | if (TYPE_P (node)) | |
2931 | *walk_subtrees = 0; | |
2932 | ||
2933 | return NULL_TREE; | |
2934 | } | |
726a989a | 2935 | |
27dbd3ac RH |
2936 | /* Determine if the function can be copied. If so return NULL. If |
2937 | not return a string describng the reason for failure. */ | |
2938 | ||
2939 | static const char * | |
2940 | copy_forbidden (struct function *fun, tree fndecl) | |
2941 | { | |
2942 | const char *reason = fun->cannot_be_copied_reason; | |
c021f10b NF |
2943 | tree decl; |
2944 | unsigned ix; | |
27dbd3ac RH |
2945 | |
2946 | /* Only examine the function once. */ | |
2947 | if (fun->cannot_be_copied_set) | |
2948 | return reason; | |
2949 | ||
2950 | /* We cannot copy a function that receives a non-local goto | |
2951 | because we cannot remap the destination label used in the | |
2952 | function that is performing the non-local goto. */ | |
2953 | /* ??? Actually, this should be possible, if we work at it. | |
2954 | No doubt there's just a handful of places that simply | |
2955 | assume it doesn't happen and don't substitute properly. */ | |
2956 | if (fun->has_nonlocal_label) | |
2957 | { | |
2958 | reason = G_("function %q+F can never be copied " | |
2959 | "because it receives a non-local goto"); | |
2960 | goto fail; | |
2961 | } | |
2962 | ||
c021f10b NF |
2963 | FOR_EACH_LOCAL_DECL (fun, ix, decl) |
2964 | if (TREE_CODE (decl) == VAR_DECL | |
2965 | && TREE_STATIC (decl) | |
2966 | && !DECL_EXTERNAL (decl) | |
2967 | && DECL_INITIAL (decl) | |
2968 | && walk_tree_without_duplicates (&DECL_INITIAL (decl), | |
2969 | has_label_address_in_static_1, | |
2970 | fndecl)) | |
2971 | { | |
2972 | reason = G_("function %q+F can never be copied because it saves " | |
2973 | "address of local label in a static variable"); | |
2974 | goto fail; | |
2975 | } | |
27dbd3ac RH |
2976 | |
2977 | fail: | |
2978 | fun->cannot_be_copied_reason = reason; | |
2979 | fun->cannot_be_copied_set = true; | |
2980 | return reason; | |
2981 | } | |
2982 | ||
2983 | ||
2984 | static const char *inline_forbidden_reason; | |
2985 | ||
2986 | /* A callback for walk_gimple_seq to handle statements. Returns non-null | |
2987 | iff a function can not be inlined. Also sets the reason why. */ | |
c986baf6 | 2988 | |
c986baf6 | 2989 | static tree |
726a989a RB |
2990 | inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p, |
2991 | struct walk_stmt_info *wip) | |
c986baf6 | 2992 | { |
726a989a | 2993 | tree fn = (tree) wip->info; |
f08545a8 | 2994 | tree t; |
726a989a | 2995 | gimple stmt = gsi_stmt (*gsi); |
c986baf6 | 2996 | |
726a989a | 2997 | switch (gimple_code (stmt)) |
f08545a8 | 2998 | { |
726a989a | 2999 | case GIMPLE_CALL: |
3197c4fd AS |
3000 | /* Refuse to inline alloca call unless user explicitly forced so as |
3001 | this may change program's memory overhead drastically when the | |
3002 | function using alloca is called in loop. In GCC present in | |
3003 | SPEC2000 inlining into schedule_block cause it to require 2GB of | |
3004 | RAM instead of 256MB. */ | |
726a989a | 3005 | if (gimple_alloca_call_p (stmt) |
f08545a8 JH |
3006 | && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))) |
3007 | { | |
ddd2d57e | 3008 | inline_forbidden_reason |
dee15844 | 3009 | = G_("function %q+F can never be inlined because it uses " |
ddd2d57e | 3010 | "alloca (override using the always_inline attribute)"); |
726a989a RB |
3011 | *handled_ops_p = true; |
3012 | return fn; | |
f08545a8 | 3013 | } |
726a989a RB |
3014 | |
3015 | t = gimple_call_fndecl (stmt); | |
3016 | if (t == NULL_TREE) | |
f08545a8 | 3017 | break; |
84f5e1b1 | 3018 | |
f08545a8 JH |
3019 | /* We cannot inline functions that call setjmp. */ |
3020 | if (setjmp_call_p (t)) | |
3021 | { | |
ddd2d57e | 3022 | inline_forbidden_reason |
dee15844 | 3023 | = G_("function %q+F can never be inlined because it uses setjmp"); |
726a989a RB |
3024 | *handled_ops_p = true; |
3025 | return t; | |
f08545a8 JH |
3026 | } |
3027 | ||
6de9cd9a | 3028 | if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL) |
3197c4fd | 3029 | switch (DECL_FUNCTION_CODE (t)) |
f08545a8 | 3030 | { |
3197c4fd AS |
3031 | /* We cannot inline functions that take a variable number of |
3032 | arguments. */ | |
3033 | case BUILT_IN_VA_START: | |
3197c4fd AS |
3034 | case BUILT_IN_NEXT_ARG: |
3035 | case BUILT_IN_VA_END: | |
6de9cd9a | 3036 | inline_forbidden_reason |
dee15844 | 3037 | = G_("function %q+F can never be inlined because it " |
6de9cd9a | 3038 | "uses variable argument lists"); |
726a989a RB |
3039 | *handled_ops_p = true; |
3040 | return t; | |
6de9cd9a | 3041 | |
3197c4fd | 3042 | case BUILT_IN_LONGJMP: |
6de9cd9a DN |
3043 | /* We can't inline functions that call __builtin_longjmp at |
3044 | all. The non-local goto machinery really requires the | |
3045 | destination be in a different function. If we allow the | |
3046 | function calling __builtin_longjmp to be inlined into the | |
3047 | function calling __builtin_setjmp, Things will Go Awry. */ | |
3048 | inline_forbidden_reason | |
dee15844 | 3049 | = G_("function %q+F can never be inlined because " |
6de9cd9a | 3050 | "it uses setjmp-longjmp exception handling"); |
726a989a RB |
3051 | *handled_ops_p = true; |
3052 | return t; | |
6de9cd9a DN |
3053 | |
3054 | case BUILT_IN_NONLOCAL_GOTO: | |
3055 | /* Similarly. */ | |
3056 | inline_forbidden_reason | |
dee15844 | 3057 | = G_("function %q+F can never be inlined because " |
6de9cd9a | 3058 | "it uses non-local goto"); |
726a989a RB |
3059 | *handled_ops_p = true; |
3060 | return t; | |
f08545a8 | 3061 | |
4b284111 JJ |
3062 | case BUILT_IN_RETURN: |
3063 | case BUILT_IN_APPLY_ARGS: | |
3064 | /* If a __builtin_apply_args caller would be inlined, | |
3065 | it would be saving arguments of the function it has | |
3066 | been inlined into. Similarly __builtin_return would | |
3067 | return from the function the inline has been inlined into. */ | |
3068 | inline_forbidden_reason | |
dee15844 | 3069 | = G_("function %q+F can never be inlined because " |
4b284111 | 3070 | "it uses __builtin_return or __builtin_apply_args"); |
726a989a RB |
3071 | *handled_ops_p = true; |
3072 | return t; | |
4b284111 | 3073 | |
3197c4fd AS |
3074 | default: |
3075 | break; | |
3076 | } | |
f08545a8 JH |
3077 | break; |
3078 | ||
726a989a RB |
3079 | case GIMPLE_GOTO: |
3080 | t = gimple_goto_dest (stmt); | |
f08545a8 JH |
3081 | |
3082 | /* We will not inline a function which uses computed goto. The | |
3083 | addresses of its local labels, which may be tucked into | |
3084 | global storage, are of course not constant across | |
3085 | instantiations, which causes unexpected behavior. */ | |
3086 | if (TREE_CODE (t) != LABEL_DECL) | |
3087 | { | |
ddd2d57e | 3088 | inline_forbidden_reason |
dee15844 | 3089 | = G_("function %q+F can never be inlined " |
ddd2d57e | 3090 | "because it contains a computed goto"); |
726a989a RB |
3091 | *handled_ops_p = true; |
3092 | return t; | |
f08545a8 | 3093 | } |
6de9cd9a | 3094 | break; |
f08545a8 | 3095 | |
f08545a8 JH |
3096 | default: |
3097 | break; | |
3098 | } | |
3099 | ||
726a989a | 3100 | *handled_ops_p = false; |
f08545a8 | 3101 | return NULL_TREE; |
84f5e1b1 RH |
3102 | } |
3103 | ||
726a989a RB |
3104 | /* Return true if FNDECL is a function that cannot be inlined into |
3105 | another one. */ | |
3106 | ||
3107 | static bool | |
f08545a8 | 3108 | inline_forbidden_p (tree fndecl) |
84f5e1b1 | 3109 | { |
2092ee7d | 3110 | struct function *fun = DECL_STRUCT_FUNCTION (fndecl); |
726a989a RB |
3111 | struct walk_stmt_info wi; |
3112 | struct pointer_set_t *visited_nodes; | |
3113 | basic_block bb; | |
3114 | bool forbidden_p = false; | |
3115 | ||
27dbd3ac RH |
3116 | /* First check for shared reasons not to copy the code. */ |
3117 | inline_forbidden_reason = copy_forbidden (fun, fndecl); | |
3118 | if (inline_forbidden_reason != NULL) | |
3119 | return true; | |
3120 | ||
3121 | /* Next, walk the statements of the function looking for | |
3122 | constraucts we can't handle, or are non-optimal for inlining. */ | |
726a989a RB |
3123 | visited_nodes = pointer_set_create (); |
3124 | memset (&wi, 0, sizeof (wi)); | |
3125 | wi.info = (void *) fndecl; | |
3126 | wi.pset = visited_nodes; | |
e21aff8a | 3127 | |
2092ee7d | 3128 | FOR_EACH_BB_FN (bb, fun) |
726a989a RB |
3129 | { |
3130 | gimple ret; | |
3131 | gimple_seq seq = bb_seq (bb); | |
27dbd3ac | 3132 | ret = walk_gimple_seq (seq, inline_forbidden_p_stmt, NULL, &wi); |
726a989a RB |
3133 | forbidden_p = (ret != NULL); |
3134 | if (forbidden_p) | |
27dbd3ac | 3135 | break; |
2092ee7d JJ |
3136 | } |
3137 | ||
726a989a | 3138 | pointer_set_destroy (visited_nodes); |
726a989a | 3139 | return forbidden_p; |
84f5e1b1 RH |
3140 | } |
3141 | ||
8f4f502f EB |
3142 | /* Return true if CALLEE cannot be inlined into CALLER. */ |
3143 | ||
3144 | static bool | |
3145 | inline_forbidden_into_p (tree caller, tree callee) | |
3146 | { | |
3147 | /* Don't inline if the functions have different EH personalities. */ | |
3148 | if (DECL_FUNCTION_PERSONALITY (caller) | |
3149 | && DECL_FUNCTION_PERSONALITY (callee) | |
3150 | && (DECL_FUNCTION_PERSONALITY (caller) | |
3151 | != DECL_FUNCTION_PERSONALITY (callee))) | |
3152 | return true; | |
3153 | ||
3154 | /* Don't inline if the callee can throw non-call exceptions but the | |
3155 | caller cannot. */ | |
3156 | if (DECL_STRUCT_FUNCTION (callee) | |
3157 | && DECL_STRUCT_FUNCTION (callee)->can_throw_non_call_exceptions | |
3158 | && !(DECL_STRUCT_FUNCTION (caller) | |
3159 | && DECL_STRUCT_FUNCTION (caller)->can_throw_non_call_exceptions)) | |
3160 | return true; | |
3161 | ||
3162 | return false; | |
3163 | } | |
3164 | ||
b3c3af2f SB |
3165 | /* Returns nonzero if FN is a function that does not have any |
3166 | fundamental inline blocking properties. */ | |
d4e4baa9 | 3167 | |
27dbd3ac RH |
3168 | bool |
3169 | tree_inlinable_function_p (tree fn) | |
d4e4baa9 | 3170 | { |
b3c3af2f | 3171 | bool inlinable = true; |
18177c7e RG |
3172 | bool do_warning; |
3173 | tree always_inline; | |
d4e4baa9 AO |
3174 | |
3175 | /* If we've already decided this function shouldn't be inlined, | |
3176 | there's no need to check again. */ | |
3177 | if (DECL_UNINLINABLE (fn)) | |
b3c3af2f | 3178 | return false; |
d4e4baa9 | 3179 | |
18177c7e RG |
3180 | /* We only warn for functions declared `inline' by the user. */ |
3181 | do_warning = (warn_inline | |
18177c7e | 3182 | && DECL_DECLARED_INLINE_P (fn) |
0494626a | 3183 | && !DECL_NO_INLINE_WARNING_P (fn) |
18177c7e RG |
3184 | && !DECL_IN_SYSTEM_HEADER (fn)); |
3185 | ||
3186 | always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)); | |
3187 | ||
e90acd93 | 3188 | if (flag_no_inline |
18177c7e RG |
3189 | && always_inline == NULL) |
3190 | { | |
3191 | if (do_warning) | |
3192 | warning (OPT_Winline, "function %q+F can never be inlined because it " | |
3193 | "is suppressed using -fno-inline", fn); | |
3194 | inlinable = false; | |
3195 | } | |
3196 | ||
3197 | /* Don't auto-inline anything that might not be bound within | |
3198 | this unit of translation. */ | |
3199 | else if (!DECL_DECLARED_INLINE_P (fn) | |
3200 | && DECL_REPLACEABLE_P (fn)) | |
3201 | inlinable = false; | |
3202 | ||
3203 | else if (!function_attribute_inlinable_p (fn)) | |
3204 | { | |
3205 | if (do_warning) | |
3206 | warning (OPT_Winline, "function %q+F can never be inlined because it " | |
3207 | "uses attributes conflicting with inlining", fn); | |
3208 | inlinable = false; | |
3209 | } | |
46c5ad27 | 3210 | |
f08545a8 | 3211 | else if (inline_forbidden_p (fn)) |
b3c3af2f SB |
3212 | { |
3213 | /* See if we should warn about uninlinable functions. Previously, | |
3214 | some of these warnings would be issued while trying to expand | |
3215 | the function inline, but that would cause multiple warnings | |
3216 | about functions that would for example call alloca. But since | |
3217 | this a property of the function, just one warning is enough. | |
3218 | As a bonus we can now give more details about the reason why a | |
18177c7e RG |
3219 | function is not inlinable. */ |
3220 | if (always_inline) | |
dee15844 | 3221 | sorry (inline_forbidden_reason, fn); |
2d327012 | 3222 | else if (do_warning) |
d2fcbf6f | 3223 | warning (OPT_Winline, inline_forbidden_reason, fn); |
b3c3af2f SB |
3224 | |
3225 | inlinable = false; | |
3226 | } | |
d4e4baa9 AO |
3227 | |
3228 | /* Squirrel away the result so that we don't have to check again. */ | |
b3c3af2f | 3229 | DECL_UNINLINABLE (fn) = !inlinable; |
d4e4baa9 | 3230 | |
b3c3af2f SB |
3231 | return inlinable; |
3232 | } | |
3233 | ||
e5c4f28a RG |
3234 | /* Estimate the cost of a memory move. Use machine dependent |
3235 | word size and take possible memcpy call into account. */ | |
3236 | ||
3237 | int | |
3238 | estimate_move_cost (tree type) | |
3239 | { | |
3240 | HOST_WIDE_INT size; | |
3241 | ||
078c3644 JH |
3242 | gcc_assert (!VOID_TYPE_P (type)); |
3243 | ||
e5c4f28a RG |
3244 | size = int_size_in_bytes (type); |
3245 | ||
e04ad03d | 3246 | if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size)) |
e5c4f28a RG |
3247 | /* Cost of a memcpy call, 3 arguments and the call. */ |
3248 | return 4; | |
3249 | else | |
3250 | return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES); | |
3251 | } | |
3252 | ||
726a989a | 3253 | /* Returns cost of operation CODE, according to WEIGHTS */ |
7f9bc51b | 3254 | |
726a989a | 3255 | static int |
02f0b13a JH |
3256 | estimate_operator_cost (enum tree_code code, eni_weights *weights, |
3257 | tree op1 ATTRIBUTE_UNUSED, tree op2) | |
6de9cd9a | 3258 | { |
726a989a | 3259 | switch (code) |
6de9cd9a | 3260 | { |
726a989a RB |
3261 | /* These are "free" conversions, or their presumed cost |
3262 | is folded into other operations. */ | |
61fcaeec | 3263 | case RANGE_EXPR: |
1a87cf0c | 3264 | CASE_CONVERT: |
726a989a RB |
3265 | case COMPLEX_EXPR: |
3266 | case PAREN_EXPR: | |
726a989a | 3267 | return 0; |
6de9cd9a | 3268 | |
e5c4f28a RG |
3269 | /* Assign cost of 1 to usual operations. |
3270 | ??? We may consider mapping RTL costs to this. */ | |
6de9cd9a | 3271 | case COND_EXPR: |
4151978d | 3272 | case VEC_COND_EXPR: |
6de9cd9a DN |
3273 | |
3274 | case PLUS_EXPR: | |
5be014d5 | 3275 | case POINTER_PLUS_EXPR: |
6de9cd9a DN |
3276 | case MINUS_EXPR: |
3277 | case MULT_EXPR: | |
3278 | ||
09e881c9 | 3279 | case ADDR_SPACE_CONVERT_EXPR: |
325217ed | 3280 | case FIXED_CONVERT_EXPR: |
6de9cd9a | 3281 | case FIX_TRUNC_EXPR: |
6de9cd9a DN |
3282 | |
3283 | case NEGATE_EXPR: | |
3284 | case FLOAT_EXPR: | |
3285 | case MIN_EXPR: | |
3286 | case MAX_EXPR: | |
3287 | case ABS_EXPR: | |
3288 | ||
3289 | case LSHIFT_EXPR: | |
3290 | case RSHIFT_EXPR: | |
3291 | case LROTATE_EXPR: | |
3292 | case RROTATE_EXPR: | |
a6b46ba2 DN |
3293 | case VEC_LSHIFT_EXPR: |
3294 | case VEC_RSHIFT_EXPR: | |
6de9cd9a DN |
3295 | |
3296 | case BIT_IOR_EXPR: | |
3297 | case BIT_XOR_EXPR: | |
3298 | case BIT_AND_EXPR: | |
3299 | case BIT_NOT_EXPR: | |
3300 | ||
3301 | case TRUTH_ANDIF_EXPR: | |
3302 | case TRUTH_ORIF_EXPR: | |
3303 | case TRUTH_AND_EXPR: | |
3304 | case TRUTH_OR_EXPR: | |
3305 | case TRUTH_XOR_EXPR: | |
3306 | case TRUTH_NOT_EXPR: | |
3307 | ||
3308 | case LT_EXPR: | |
3309 | case LE_EXPR: | |
3310 | case GT_EXPR: | |
3311 | case GE_EXPR: | |
3312 | case EQ_EXPR: | |
3313 | case NE_EXPR: | |
3314 | case ORDERED_EXPR: | |
3315 | case UNORDERED_EXPR: | |
3316 | ||
3317 | case UNLT_EXPR: | |
3318 | case UNLE_EXPR: | |
3319 | case UNGT_EXPR: | |
3320 | case UNGE_EXPR: | |
3321 | case UNEQ_EXPR: | |
d1a7edaf | 3322 | case LTGT_EXPR: |
6de9cd9a | 3323 | |
6de9cd9a DN |
3324 | case CONJ_EXPR: |
3325 | ||
3326 | case PREDECREMENT_EXPR: | |
3327 | case PREINCREMENT_EXPR: | |
3328 | case POSTDECREMENT_EXPR: | |
3329 | case POSTINCREMENT_EXPR: | |
3330 | ||
16630a2c DN |
3331 | case REALIGN_LOAD_EXPR: |
3332 | ||
61d3cdbb DN |
3333 | case REDUC_MAX_EXPR: |
3334 | case REDUC_MIN_EXPR: | |
3335 | case REDUC_PLUS_EXPR: | |
20f06221 | 3336 | case WIDEN_SUM_EXPR: |
726a989a RB |
3337 | case WIDEN_MULT_EXPR: |
3338 | case DOT_PROD_EXPR: | |
0354c0c7 BS |
3339 | case WIDEN_MULT_PLUS_EXPR: |
3340 | case WIDEN_MULT_MINUS_EXPR: | |
726a989a | 3341 | |
89d67cca DN |
3342 | case VEC_WIDEN_MULT_HI_EXPR: |
3343 | case VEC_WIDEN_MULT_LO_EXPR: | |
3344 | case VEC_UNPACK_HI_EXPR: | |
3345 | case VEC_UNPACK_LO_EXPR: | |
d9987fb4 UB |
3346 | case VEC_UNPACK_FLOAT_HI_EXPR: |
3347 | case VEC_UNPACK_FLOAT_LO_EXPR: | |
8115817b | 3348 | case VEC_PACK_TRUNC_EXPR: |
89d67cca | 3349 | case VEC_PACK_SAT_EXPR: |
d9987fb4 | 3350 | case VEC_PACK_FIX_TRUNC_EXPR: |
98b44b0e IR |
3351 | case VEC_EXTRACT_EVEN_EXPR: |
3352 | case VEC_EXTRACT_ODD_EXPR: | |
3353 | case VEC_INTERLEAVE_HIGH_EXPR: | |
3354 | case VEC_INTERLEAVE_LOW_EXPR: | |
3355 | ||
726a989a | 3356 | return 1; |
6de9cd9a | 3357 | |
1ea7e6ad | 3358 | /* Few special cases of expensive operations. This is useful |
6de9cd9a DN |
3359 | to avoid inlining on functions having too many of these. */ |
3360 | case TRUNC_DIV_EXPR: | |
3361 | case CEIL_DIV_EXPR: | |
3362 | case FLOOR_DIV_EXPR: | |
3363 | case ROUND_DIV_EXPR: | |
3364 | case EXACT_DIV_EXPR: | |
3365 | case TRUNC_MOD_EXPR: | |
3366 | case CEIL_MOD_EXPR: | |
3367 | case FLOOR_MOD_EXPR: | |
3368 | case ROUND_MOD_EXPR: | |
3369 | case RDIV_EXPR: | |
02f0b13a JH |
3370 | if (TREE_CODE (op2) != INTEGER_CST) |
3371 | return weights->div_mod_cost; | |
3372 | return 1; | |
726a989a RB |
3373 | |
3374 | default: | |
3375 | /* We expect a copy assignment with no operator. */ | |
3376 | gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS); | |
3377 | return 0; | |
3378 | } | |
3379 | } | |
3380 | ||
3381 | ||
3382 | /* Estimate number of instructions that will be created by expanding | |
3383 | the statements in the statement sequence STMTS. | |
3384 | WEIGHTS contains weights attributed to various constructs. */ | |
3385 | ||
3386 | static | |
3387 | int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights) | |
3388 | { | |
3389 | int cost; | |
3390 | gimple_stmt_iterator gsi; | |
3391 | ||
3392 | cost = 0; | |
3393 | for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi)) | |
3394 | cost += estimate_num_insns (gsi_stmt (gsi), weights); | |
3395 | ||
3396 | return cost; | |
3397 | } | |
3398 | ||
3399 | ||
3400 | /* Estimate number of instructions that will be created by expanding STMT. | |
3401 | WEIGHTS contains weights attributed to various constructs. */ | |
3402 | ||
3403 | int | |
3404 | estimate_num_insns (gimple stmt, eni_weights *weights) | |
3405 | { | |
3406 | unsigned cost, i; | |
3407 | enum gimple_code code = gimple_code (stmt); | |
3408 | tree lhs; | |
02f0b13a | 3409 | tree rhs; |
726a989a RB |
3410 | |
3411 | switch (code) | |
3412 | { | |
3413 | case GIMPLE_ASSIGN: | |
3414 | /* Try to estimate the cost of assignments. We have three cases to | |
3415 | deal with: | |
3416 | 1) Simple assignments to registers; | |
3417 | 2) Stores to things that must live in memory. This includes | |
3418 | "normal" stores to scalars, but also assignments of large | |
3419 | structures, or constructors of big arrays; | |
3420 | ||
3421 | Let us look at the first two cases, assuming we have "a = b + C": | |
3422 | <GIMPLE_ASSIGN <var_decl "a"> | |
3423 | <plus_expr <var_decl "b"> <constant C>> | |
3424 | If "a" is a GIMPLE register, the assignment to it is free on almost | |
3425 | any target, because "a" usually ends up in a real register. Hence | |
3426 | the only cost of this expression comes from the PLUS_EXPR, and we | |
3427 | can ignore the GIMPLE_ASSIGN. | |
3428 | If "a" is not a GIMPLE register, the assignment to "a" will most | |
3429 | likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost | |
3430 | of moving something into "a", which we compute using the function | |
3431 | estimate_move_cost. */ | |
3432 | lhs = gimple_assign_lhs (stmt); | |
02f0b13a JH |
3433 | rhs = gimple_assign_rhs1 (stmt); |
3434 | ||
726a989a RB |
3435 | if (is_gimple_reg (lhs)) |
3436 | cost = 0; | |
3437 | else | |
3438 | cost = estimate_move_cost (TREE_TYPE (lhs)); | |
3439 | ||
02f0b13a JH |
3440 | if (!is_gimple_reg (rhs) && !is_gimple_min_invariant (rhs)) |
3441 | cost += estimate_move_cost (TREE_TYPE (rhs)); | |
3442 | ||
3443 | cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights, | |
3444 | gimple_assign_rhs1 (stmt), | |
3445 | get_gimple_rhs_class (gimple_assign_rhs_code (stmt)) | |
3446 | == GIMPLE_BINARY_RHS | |
3447 | ? gimple_assign_rhs2 (stmt) : NULL); | |
726a989a RB |
3448 | break; |
3449 | ||
3450 | case GIMPLE_COND: | |
02f0b13a JH |
3451 | cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights, |
3452 | gimple_op (stmt, 0), | |
3453 | gimple_op (stmt, 1)); | |
726a989a RB |
3454 | break; |
3455 | ||
3456 | case GIMPLE_SWITCH: | |
3457 | /* Take into account cost of the switch + guess 2 conditional jumps for | |
b8698a0f | 3458 | each case label. |
726a989a RB |
3459 | |
3460 | TODO: once the switch expansion logic is sufficiently separated, we can | |
3461 | do better job on estimating cost of the switch. */ | |
02f0b13a JH |
3462 | if (weights->time_based) |
3463 | cost = floor_log2 (gimple_switch_num_labels (stmt)) * 2; | |
3464 | else | |
3465 | cost = gimple_switch_num_labels (stmt) * 2; | |
6de9cd9a | 3466 | break; |
726a989a RB |
3467 | |
3468 | case GIMPLE_CALL: | |
6de9cd9a | 3469 | { |
726a989a RB |
3470 | tree decl = gimple_call_fndecl (stmt); |
3471 | tree addr = gimple_call_fn (stmt); | |
8723e2fe | 3472 | tree funtype = TREE_TYPE (addr); |
613f61fc | 3473 | bool stdarg = false; |
8723e2fe | 3474 | |
726a989a RB |
3475 | if (POINTER_TYPE_P (funtype)) |
3476 | funtype = TREE_TYPE (funtype); | |
6de9cd9a | 3477 | |
625a2efb | 3478 | if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD) |
726a989a | 3479 | cost = weights->target_builtin_call_cost; |
625a2efb | 3480 | else |
726a989a | 3481 | cost = weights->call_cost; |
b8698a0f | 3482 | |
8c96cd51 | 3483 | if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL) |
6de9cd9a DN |
3484 | switch (DECL_FUNCTION_CODE (decl)) |
3485 | { | |
d89488ec | 3486 | /* Builtins that expand to constants. */ |
6de9cd9a | 3487 | case BUILT_IN_CONSTANT_P: |
6de9cd9a | 3488 | case BUILT_IN_EXPECT: |
d89488ec JH |
3489 | case BUILT_IN_OBJECT_SIZE: |
3490 | case BUILT_IN_UNREACHABLE: | |
3491 | /* Simple register moves or loads from stack. */ | |
3492 | case BUILT_IN_RETURN_ADDRESS: | |
3493 | case BUILT_IN_EXTRACT_RETURN_ADDR: | |
3494 | case BUILT_IN_FROB_RETURN_ADDR: | |
3495 | case BUILT_IN_RETURN: | |
3496 | case BUILT_IN_AGGREGATE_INCOMING_ADDRESS: | |
3497 | case BUILT_IN_FRAME_ADDRESS: | |
3498 | case BUILT_IN_VA_END: | |
3499 | case BUILT_IN_STACK_SAVE: | |
3500 | case BUILT_IN_STACK_RESTORE: | |
be2fd187 RG |
3501 | /* Exception state returns or moves registers around. */ |
3502 | case BUILT_IN_EH_FILTER: | |
3503 | case BUILT_IN_EH_POINTER: | |
3504 | case BUILT_IN_EH_COPY_VALUES: | |
3505 | return 0; | |
d89488ec JH |
3506 | |
3507 | /* builtins that are not expensive (that is they are most probably | |
3508 | expanded inline into resonably simple code). */ | |
3509 | case BUILT_IN_ABS: | |
3510 | case BUILT_IN_ALLOCA: | |
3511 | case BUILT_IN_BSWAP32: | |
3512 | case BUILT_IN_BSWAP64: | |
3513 | case BUILT_IN_CLZ: | |
3514 | case BUILT_IN_CLZIMAX: | |
3515 | case BUILT_IN_CLZL: | |
3516 | case BUILT_IN_CLZLL: | |
3517 | case BUILT_IN_CTZ: | |
3518 | case BUILT_IN_CTZIMAX: | |
3519 | case BUILT_IN_CTZL: | |
3520 | case BUILT_IN_CTZLL: | |
3521 | case BUILT_IN_FFS: | |
3522 | case BUILT_IN_FFSIMAX: | |
3523 | case BUILT_IN_FFSL: | |
3524 | case BUILT_IN_FFSLL: | |
3525 | case BUILT_IN_IMAXABS: | |
3526 | case BUILT_IN_FINITE: | |
3527 | case BUILT_IN_FINITEF: | |
3528 | case BUILT_IN_FINITEL: | |
3529 | case BUILT_IN_FINITED32: | |
3530 | case BUILT_IN_FINITED64: | |
3531 | case BUILT_IN_FINITED128: | |
3532 | case BUILT_IN_FPCLASSIFY: | |
3533 | case BUILT_IN_ISFINITE: | |
3534 | case BUILT_IN_ISINF_SIGN: | |
3535 | case BUILT_IN_ISINF: | |
3536 | case BUILT_IN_ISINFF: | |
3537 | case BUILT_IN_ISINFL: | |
3538 | case BUILT_IN_ISINFD32: | |
3539 | case BUILT_IN_ISINFD64: | |
3540 | case BUILT_IN_ISINFD128: | |
3541 | case BUILT_IN_ISNAN: | |
3542 | case BUILT_IN_ISNANF: | |
3543 | case BUILT_IN_ISNANL: | |
3544 | case BUILT_IN_ISNAND32: | |
3545 | case BUILT_IN_ISNAND64: | |
3546 | case BUILT_IN_ISNAND128: | |
3547 | case BUILT_IN_ISNORMAL: | |
3548 | case BUILT_IN_ISGREATER: | |
3549 | case BUILT_IN_ISGREATEREQUAL: | |
3550 | case BUILT_IN_ISLESS: | |
3551 | case BUILT_IN_ISLESSEQUAL: | |
3552 | case BUILT_IN_ISLESSGREATER: | |
3553 | case BUILT_IN_ISUNORDERED: | |
3554 | case BUILT_IN_VA_ARG_PACK: | |
3555 | case BUILT_IN_VA_ARG_PACK_LEN: | |
3556 | case BUILT_IN_VA_COPY: | |
3557 | case BUILT_IN_TRAP: | |
3558 | case BUILT_IN_SAVEREGS: | |
3559 | case BUILT_IN_POPCOUNTL: | |
3560 | case BUILT_IN_POPCOUNTLL: | |
3561 | case BUILT_IN_POPCOUNTIMAX: | |
3562 | case BUILT_IN_POPCOUNT: | |
3563 | case BUILT_IN_PARITYL: | |
3564 | case BUILT_IN_PARITYLL: | |
3565 | case BUILT_IN_PARITYIMAX: | |
3566 | case BUILT_IN_PARITY: | |
3567 | case BUILT_IN_LABS: | |
3568 | case BUILT_IN_LLABS: | |
3569 | case BUILT_IN_PREFETCH: | |
3570 | cost = weights->target_builtin_call_cost; | |
3571 | break; | |
be2fd187 | 3572 | |
6de9cd9a DN |
3573 | default: |
3574 | break; | |
3575 | } | |
e5c4f28a | 3576 | |
8723e2fe JH |
3577 | if (decl) |
3578 | funtype = TREE_TYPE (decl); | |
3579 | ||
02f0b13a JH |
3580 | if (!VOID_TYPE_P (TREE_TYPE (funtype))) |
3581 | cost += estimate_move_cost (TREE_TYPE (funtype)); | |
613f61fc JH |
3582 | |
3583 | if (funtype) | |
3584 | stdarg = stdarg_p (funtype); | |
3585 | ||
726a989a RB |
3586 | /* Our cost must be kept in sync with |
3587 | cgraph_estimate_size_after_inlining that does use function | |
613f61fc JH |
3588 | declaration to figure out the arguments. |
3589 | ||
3590 | For functions taking variable list of arguments we must | |
3591 | look into call statement intself. This is safe because | |
3592 | we will get only higher costs and in most cases we will | |
3593 | not inline these anyway. */ | |
3594 | if (decl && DECL_ARGUMENTS (decl) && !stdarg) | |
8723e2fe JH |
3595 | { |
3596 | tree arg; | |
3597 | for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg)) | |
078c3644 JH |
3598 | if (!VOID_TYPE_P (TREE_TYPE (arg))) |
3599 | cost += estimate_move_cost (TREE_TYPE (arg)); | |
8723e2fe | 3600 | } |
613f61fc | 3601 | else if (funtype && prototype_p (funtype) && !stdarg) |
8723e2fe JH |
3602 | { |
3603 | tree t; | |
078c3644 JH |
3604 | for (t = TYPE_ARG_TYPES (funtype); t && t != void_list_node; |
3605 | t = TREE_CHAIN (t)) | |
3606 | if (!VOID_TYPE_P (TREE_VALUE (t))) | |
3607 | cost += estimate_move_cost (TREE_VALUE (t)); | |
8723e2fe JH |
3608 | } |
3609 | else | |
c7f599d0 | 3610 | { |
726a989a RB |
3611 | for (i = 0; i < gimple_call_num_args (stmt); i++) |
3612 | { | |
3613 | tree arg = gimple_call_arg (stmt, i); | |
078c3644 JH |
3614 | if (!VOID_TYPE_P (TREE_TYPE (arg))) |
3615 | cost += estimate_move_cost (TREE_TYPE (arg)); | |
726a989a | 3616 | } |
c7f599d0 | 3617 | } |
e5c4f28a | 3618 | |
6de9cd9a DN |
3619 | break; |
3620 | } | |
88f4034b | 3621 | |
726a989a RB |
3622 | case GIMPLE_GOTO: |
3623 | case GIMPLE_LABEL: | |
3624 | case GIMPLE_NOP: | |
3625 | case GIMPLE_PHI: | |
3626 | case GIMPLE_RETURN: | |
726a989a | 3627 | case GIMPLE_PREDICT: |
b5b8b0ac | 3628 | case GIMPLE_DEBUG: |
726a989a RB |
3629 | return 0; |
3630 | ||
3631 | case GIMPLE_ASM: | |
2bd1d2c8 | 3632 | return asm_str_count (gimple_asm_string (stmt)); |
726a989a | 3633 | |
1d65f45c RH |
3634 | case GIMPLE_RESX: |
3635 | /* This is either going to be an external function call with one | |
3636 | argument, or two register copy statements plus a goto. */ | |
3637 | return 2; | |
3638 | ||
3639 | case GIMPLE_EH_DISPATCH: | |
3640 | /* ??? This is going to turn into a switch statement. Ideally | |
3641 | we'd have a look at the eh region and estimate the number of | |
3642 | edges involved. */ | |
3643 | return 10; | |
3644 | ||
726a989a RB |
3645 | case GIMPLE_BIND: |
3646 | return estimate_num_insns_seq (gimple_bind_body (stmt), weights); | |
3647 | ||
3648 | case GIMPLE_EH_FILTER: | |
3649 | return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights); | |
3650 | ||
3651 | case GIMPLE_CATCH: | |
3652 | return estimate_num_insns_seq (gimple_catch_handler (stmt), weights); | |
3653 | ||
3654 | case GIMPLE_TRY: | |
3655 | return (estimate_num_insns_seq (gimple_try_eval (stmt), weights) | |
3656 | + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights)); | |
3657 | ||
3658 | /* OpenMP directives are generally very expensive. */ | |
3659 | ||
3660 | case GIMPLE_OMP_RETURN: | |
3661 | case GIMPLE_OMP_SECTIONS_SWITCH: | |
3662 | case GIMPLE_OMP_ATOMIC_STORE: | |
3663 | case GIMPLE_OMP_CONTINUE: | |
3664 | /* ...except these, which are cheap. */ | |
3665 | return 0; | |
3666 | ||
3667 | case GIMPLE_OMP_ATOMIC_LOAD: | |
3668 | return weights->omp_cost; | |
3669 | ||
3670 | case GIMPLE_OMP_FOR: | |
3671 | return (weights->omp_cost | |
3672 | + estimate_num_insns_seq (gimple_omp_body (stmt), weights) | |
3673 | + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights)); | |
3674 | ||
3675 | case GIMPLE_OMP_PARALLEL: | |
3676 | case GIMPLE_OMP_TASK: | |
3677 | case GIMPLE_OMP_CRITICAL: | |
3678 | case GIMPLE_OMP_MASTER: | |
3679 | case GIMPLE_OMP_ORDERED: | |
3680 | case GIMPLE_OMP_SECTION: | |
3681 | case GIMPLE_OMP_SECTIONS: | |
3682 | case GIMPLE_OMP_SINGLE: | |
3683 | return (weights->omp_cost | |
3684 | + estimate_num_insns_seq (gimple_omp_body (stmt), weights)); | |
88f4034b | 3685 | |
6de9cd9a | 3686 | default: |
1e128c5f | 3687 | gcc_unreachable (); |
6de9cd9a | 3688 | } |
726a989a RB |
3689 | |
3690 | return cost; | |
6de9cd9a DN |
3691 | } |
3692 | ||
726a989a RB |
3693 | /* Estimate number of instructions that will be created by expanding |
3694 | function FNDECL. WEIGHTS contains weights attributed to various | |
3695 | constructs. */ | |
aa4a53af | 3696 | |
6de9cd9a | 3697 | int |
726a989a | 3698 | estimate_num_insns_fn (tree fndecl, eni_weights *weights) |
6de9cd9a | 3699 | { |
726a989a RB |
3700 | struct function *my_function = DECL_STRUCT_FUNCTION (fndecl); |
3701 | gimple_stmt_iterator bsi; | |
e21aff8a | 3702 | basic_block bb; |
726a989a | 3703 | int n = 0; |
e21aff8a | 3704 | |
726a989a RB |
3705 | gcc_assert (my_function && my_function->cfg); |
3706 | FOR_EACH_BB_FN (bb, my_function) | |
e21aff8a | 3707 | { |
726a989a RB |
3708 | for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi)) |
3709 | n += estimate_num_insns (gsi_stmt (bsi), weights); | |
e21aff8a | 3710 | } |
e21aff8a | 3711 | |
726a989a | 3712 | return n; |
7f9bc51b ZD |
3713 | } |
3714 | ||
726a989a | 3715 | |
7f9bc51b ZD |
3716 | /* Initializes weights used by estimate_num_insns. */ |
3717 | ||
3718 | void | |
3719 | init_inline_once (void) | |
3720 | { | |
7f9bc51b | 3721 | eni_size_weights.call_cost = 1; |
625a2efb | 3722 | eni_size_weights.target_builtin_call_cost = 1; |
7f9bc51b | 3723 | eni_size_weights.div_mod_cost = 1; |
7f9bc51b | 3724 | eni_size_weights.omp_cost = 40; |
02f0b13a | 3725 | eni_size_weights.time_based = false; |
7f9bc51b ZD |
3726 | |
3727 | /* Estimating time for call is difficult, since we have no idea what the | |
3728 | called function does. In the current uses of eni_time_weights, | |
3729 | underestimating the cost does less harm than overestimating it, so | |
ea2c620c | 3730 | we choose a rather small value here. */ |
7f9bc51b | 3731 | eni_time_weights.call_cost = 10; |
625a2efb | 3732 | eni_time_weights.target_builtin_call_cost = 10; |
7f9bc51b | 3733 | eni_time_weights.div_mod_cost = 10; |
7f9bc51b | 3734 | eni_time_weights.omp_cost = 40; |
02f0b13a | 3735 | eni_time_weights.time_based = true; |
6de9cd9a DN |
3736 | } |
3737 | ||
726a989a RB |
3738 | /* Estimate the number of instructions in a gimple_seq. */ |
3739 | ||
3740 | int | |
3741 | count_insns_seq (gimple_seq seq, eni_weights *weights) | |
3742 | { | |
3743 | gimple_stmt_iterator gsi; | |
3744 | int n = 0; | |
3745 | for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi)) | |
3746 | n += estimate_num_insns (gsi_stmt (gsi), weights); | |
3747 | ||
3748 | return n; | |
3749 | } | |
3750 | ||
3751 | ||
e21aff8a | 3752 | /* Install new lexical TREE_BLOCK underneath 'current_block'. */ |
726a989a | 3753 | |
e21aff8a | 3754 | static void |
4a283090 | 3755 | prepend_lexical_block (tree current_block, tree new_block) |
e21aff8a | 3756 | { |
4a283090 JH |
3757 | BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block); |
3758 | BLOCK_SUBBLOCKS (current_block) = new_block; | |
e21aff8a | 3759 | BLOCK_SUPERCONTEXT (new_block) = current_block; |
e21aff8a SB |
3760 | } |
3761 | ||
c021f10b NF |
3762 | /* Add local variables from CALLEE to CALLER. */ |
3763 | ||
3764 | static inline void | |
3765 | add_local_variables (struct function *callee, struct function *caller, | |
3766 | copy_body_data *id, bool check_var_ann) | |
3767 | { | |
3768 | tree var; | |
3769 | unsigned ix; | |
3770 | ||
3771 | FOR_EACH_LOCAL_DECL (callee, ix, var) | |
3772 | if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var)) | |
3773 | { | |
3774 | if (!check_var_ann | |
3775 | || (var_ann (var) && add_referenced_var (var))) | |
3776 | add_local_decl (caller, var); | |
3777 | } | |
3778 | else if (!can_be_nonlocal (var, id)) | |
3779 | add_local_decl (caller, remap_decl (var, id)); | |
3780 | } | |
3781 | ||
3e293154 MJ |
3782 | /* Fetch callee declaration from the call graph edge going from NODE and |
3783 | associated with STMR call statement. Return NULL_TREE if not found. */ | |
3784 | static tree | |
726a989a | 3785 | get_indirect_callee_fndecl (struct cgraph_node *node, gimple stmt) |
3e293154 MJ |
3786 | { |
3787 | struct cgraph_edge *cs; | |
3788 | ||
3789 | cs = cgraph_edge (node, stmt); | |
e33c6cd6 | 3790 | if (cs && !cs->indirect_unknown_callee) |
3e293154 MJ |
3791 | return cs->callee->decl; |
3792 | ||
3793 | return NULL_TREE; | |
3794 | } | |
3795 | ||
726a989a | 3796 | /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */ |
d4e4baa9 | 3797 | |
e21aff8a | 3798 | static bool |
726a989a | 3799 | expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id) |
d4e4baa9 | 3800 | { |
0f900dfa | 3801 | tree use_retvar; |
d436bff8 | 3802 | tree fn; |
b5b8b0ac | 3803 | struct pointer_map_t *st, *dst; |
110cfe1c | 3804 | tree return_slot; |
7740f00d | 3805 | tree modify_dest; |
6de9cd9a | 3806 | location_t saved_location; |
e21aff8a | 3807 | struct cgraph_edge *cg_edge; |
61a05df1 | 3808 | cgraph_inline_failed_t reason; |
e21aff8a SB |
3809 | basic_block return_block; |
3810 | edge e; | |
726a989a | 3811 | gimple_stmt_iterator gsi, stmt_gsi; |
e21aff8a | 3812 | bool successfully_inlined = FALSE; |
4f6c2131 | 3813 | bool purge_dead_abnormal_edges; |
d4e4baa9 | 3814 | |
6de9cd9a DN |
3815 | /* Set input_location here so we get the right instantiation context |
3816 | if we call instantiate_decl from inlinable_function_p. */ | |
3817 | saved_location = input_location; | |
726a989a RB |
3818 | if (gimple_has_location (stmt)) |
3819 | input_location = gimple_location (stmt); | |
6de9cd9a | 3820 | |
d4e4baa9 | 3821 | /* From here on, we're only interested in CALL_EXPRs. */ |
726a989a | 3822 | if (gimple_code (stmt) != GIMPLE_CALL) |
6de9cd9a | 3823 | goto egress; |
d4e4baa9 AO |
3824 | |
3825 | /* First, see if we can figure out what function is being called. | |
3826 | If we cannot, then there is no hope of inlining the function. */ | |
726a989a | 3827 | fn = gimple_call_fndecl (stmt); |
d4e4baa9 | 3828 | if (!fn) |
3e293154 MJ |
3829 | { |
3830 | fn = get_indirect_callee_fndecl (id->dst_node, stmt); | |
3831 | if (!fn) | |
3832 | goto egress; | |
3833 | } | |
d4e4baa9 | 3834 | |
b58b1157 | 3835 | /* Turn forward declarations into real ones. */ |
d4d1ebc1 | 3836 | fn = cgraph_node (fn)->decl; |
b58b1157 | 3837 | |
726a989a | 3838 | /* If FN is a declaration of a function in a nested scope that was |
a1a0fd4e AO |
3839 | globally declared inline, we don't set its DECL_INITIAL. |
3840 | However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the | |
3841 | C++ front-end uses it for cdtors to refer to their internal | |
3842 | declarations, that are not real functions. Fortunately those | |
3843 | don't have trees to be saved, so we can tell by checking their | |
726a989a RB |
3844 | gimple_body. */ |
3845 | if (!DECL_INITIAL (fn) | |
a1a0fd4e | 3846 | && DECL_ABSTRACT_ORIGIN (fn) |
39ecc018 | 3847 | && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn))) |
a1a0fd4e AO |
3848 | fn = DECL_ABSTRACT_ORIGIN (fn); |
3849 | ||
18c6ada9 JH |
3850 | /* Objective C and fortran still calls tree_rest_of_compilation directly. |
3851 | Kill this check once this is fixed. */ | |
1b369fae | 3852 | if (!id->dst_node->analyzed) |
6de9cd9a | 3853 | goto egress; |
18c6ada9 | 3854 | |
1b369fae | 3855 | cg_edge = cgraph_edge (id->dst_node, stmt); |
18c6ada9 | 3856 | |
8f4f502f EB |
3857 | /* First check that inlining isn't simply forbidden in this case. */ |
3858 | if (inline_forbidden_into_p (cg_edge->caller->decl, cg_edge->callee->decl)) | |
f9417da1 RG |
3859 | goto egress; |
3860 | ||
8f4f502f | 3861 | /* Don't try to inline functions that are not well-suited to inlining. */ |
e21aff8a | 3862 | if (!cgraph_inline_p (cg_edge, &reason)) |
a833faa5 | 3863 | { |
3e293154 MJ |
3864 | /* If this call was originally indirect, we do not want to emit any |
3865 | inlining related warnings or sorry messages because there are no | |
3866 | guarantees regarding those. */ | |
e33c6cd6 | 3867 | if (cg_edge->indirect_inlining_edge) |
3e293154 MJ |
3868 | goto egress; |
3869 | ||
7fac66d4 JH |
3870 | if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)) |
3871 | /* Avoid warnings during early inline pass. */ | |
7e8b322a | 3872 | && cgraph_global_info_ready) |
2d327012 | 3873 | { |
61a05df1 | 3874 | sorry ("inlining failed in call to %q+F: %s", fn, |
49c8958b | 3875 | _(cgraph_inline_failed_string (reason))); |
2d327012 JH |
3876 | sorry ("called from here"); |
3877 | } | |
3878 | else if (warn_inline && DECL_DECLARED_INLINE_P (fn) | |
3879 | && !DECL_IN_SYSTEM_HEADER (fn) | |
61a05df1 | 3880 | && reason != CIF_UNSPECIFIED |
d63db217 JH |
3881 | && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn)) |
3882 | /* Avoid warnings during early inline pass. */ | |
7e8b322a | 3883 | && cgraph_global_info_ready) |
a833faa5 | 3884 | { |
dee15844 | 3885 | warning (OPT_Winline, "inlining failed in call to %q+F: %s", |
49c8958b | 3886 | fn, _(cgraph_inline_failed_string (reason))); |
3176a0c2 | 3887 | warning (OPT_Winline, "called from here"); |
a833faa5 | 3888 | } |
6de9cd9a | 3889 | goto egress; |
a833faa5 | 3890 | } |
ea99e0be | 3891 | fn = cg_edge->callee->decl; |
d4e4baa9 | 3892 | |
18c6ada9 | 3893 | #ifdef ENABLE_CHECKING |
1b369fae | 3894 | if (cg_edge->callee->decl != id->dst_node->decl) |
e21aff8a | 3895 | verify_cgraph_node (cg_edge->callee); |
18c6ada9 JH |
3896 | #endif |
3897 | ||
e21aff8a | 3898 | /* We will be inlining this callee. */ |
1d65f45c | 3899 | id->eh_lp_nr = lookup_stmt_eh_lp (stmt); |
e21aff8a | 3900 | |
f9417da1 RG |
3901 | /* Update the callers EH personality. */ |
3902 | if (DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl)) | |
3903 | DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl) | |
3904 | = DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl); | |
3905 | ||
726a989a | 3906 | /* Split the block holding the GIMPLE_CALL. */ |
e21aff8a SB |
3907 | e = split_block (bb, stmt); |
3908 | bb = e->src; | |
3909 | return_block = e->dest; | |
3910 | remove_edge (e); | |
3911 | ||
4f6c2131 EB |
3912 | /* split_block splits after the statement; work around this by |
3913 | moving the call into the second block manually. Not pretty, | |
3914 | but seems easier than doing the CFG manipulation by hand | |
726a989a RB |
3915 | when the GIMPLE_CALL is in the last statement of BB. */ |
3916 | stmt_gsi = gsi_last_bb (bb); | |
3917 | gsi_remove (&stmt_gsi, false); | |
4f6c2131 | 3918 | |
726a989a | 3919 | /* If the GIMPLE_CALL was in the last statement of BB, it may have |
4f6c2131 EB |
3920 | been the source of abnormal edges. In this case, schedule |
3921 | the removal of dead abnormal edges. */ | |
726a989a RB |
3922 | gsi = gsi_start_bb (return_block); |
3923 | if (gsi_end_p (gsi)) | |
e21aff8a | 3924 | { |
726a989a | 3925 | gsi_insert_after (&gsi, stmt, GSI_NEW_STMT); |
4f6c2131 | 3926 | purge_dead_abnormal_edges = true; |
e21aff8a | 3927 | } |
4f6c2131 EB |
3928 | else |
3929 | { | |
726a989a | 3930 | gsi_insert_before (&gsi, stmt, GSI_NEW_STMT); |
4f6c2131 EB |
3931 | purge_dead_abnormal_edges = false; |
3932 | } | |
3933 | ||
726a989a | 3934 | stmt_gsi = gsi_start_bb (return_block); |
742a37d5 | 3935 | |
d436bff8 AH |
3936 | /* Build a block containing code to initialize the arguments, the |
3937 | actual inline expansion of the body, and a label for the return | |
3938 | statements within the function to jump to. The type of the | |
3939 | statement expression is the return type of the function call. */ | |
e21aff8a SB |
3940 | id->block = make_node (BLOCK); |
3941 | BLOCK_ABSTRACT_ORIGIN (id->block) = fn; | |
3e2844cb | 3942 | BLOCK_SOURCE_LOCATION (id->block) = input_location; |
4a283090 | 3943 | prepend_lexical_block (gimple_block (stmt), id->block); |
e21aff8a | 3944 | |
d4e4baa9 AO |
3945 | /* Local declarations will be replaced by their equivalents in this |
3946 | map. */ | |
3947 | st = id->decl_map; | |
6be42dd4 | 3948 | id->decl_map = pointer_map_create (); |
b5b8b0ac AO |
3949 | dst = id->debug_map; |
3950 | id->debug_map = NULL; | |
d4e4baa9 | 3951 | |
e21aff8a | 3952 | /* Record the function we are about to inline. */ |
1b369fae RH |
3953 | id->src_fn = fn; |
3954 | id->src_node = cg_edge->callee; | |
110cfe1c | 3955 | id->src_cfun = DECL_STRUCT_FUNCTION (fn); |
726a989a | 3956 | id->gimple_call = stmt; |
1b369fae | 3957 | |
3c8da8a5 AO |
3958 | gcc_assert (!id->src_cfun->after_inlining); |
3959 | ||
045685a9 | 3960 | id->entry_bb = bb; |
7299cb99 JH |
3961 | if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn))) |
3962 | { | |
3963 | gimple_stmt_iterator si = gsi_last_bb (bb); | |
3964 | gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION, | |
3965 | NOT_TAKEN), | |
3966 | GSI_NEW_STMT); | |
3967 | } | |
726a989a | 3968 | initialize_inlined_parameters (id, stmt, fn, bb); |
d4e4baa9 | 3969 | |
ea99e0be | 3970 | if (DECL_INITIAL (fn)) |
4a283090 | 3971 | prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id)); |
acb8f212 | 3972 | |
d4e4baa9 AO |
3973 | /* Return statements in the function body will be replaced by jumps |
3974 | to the RET_LABEL. */ | |
1e128c5f GB |
3975 | gcc_assert (DECL_INITIAL (fn)); |
3976 | gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK); | |
23700f65 | 3977 | |
726a989a | 3978 | /* Find the LHS to which the result of this call is assigned. */ |
110cfe1c | 3979 | return_slot = NULL; |
726a989a | 3980 | if (gimple_call_lhs (stmt)) |
81bafd36 | 3981 | { |
726a989a | 3982 | modify_dest = gimple_call_lhs (stmt); |
81bafd36 ILT |
3983 | |
3984 | /* The function which we are inlining might not return a value, | |
3985 | in which case we should issue a warning that the function | |
3986 | does not return a value. In that case the optimizers will | |
3987 | see that the variable to which the value is assigned was not | |
3988 | initialized. We do not want to issue a warning about that | |
3989 | uninitialized variable. */ | |
3990 | if (DECL_P (modify_dest)) | |
3991 | TREE_NO_WARNING (modify_dest) = 1; | |
726a989a RB |
3992 | |
3993 | if (gimple_call_return_slot_opt_p (stmt)) | |
fa47911c | 3994 | { |
110cfe1c | 3995 | return_slot = modify_dest; |
fa47911c JM |
3996 | modify_dest = NULL; |
3997 | } | |
81bafd36 | 3998 | } |
7740f00d RH |
3999 | else |
4000 | modify_dest = NULL; | |
4001 | ||
1ea193c2 ILT |
4002 | /* If we are inlining a call to the C++ operator new, we don't want |
4003 | to use type based alias analysis on the return value. Otherwise | |
4004 | we may get confused if the compiler sees that the inlined new | |
4005 | function returns a pointer which was just deleted. See bug | |
4006 | 33407. */ | |
4007 | if (DECL_IS_OPERATOR_NEW (fn)) | |
4008 | { | |
4009 | return_slot = NULL; | |
4010 | modify_dest = NULL; | |
4011 | } | |
4012 | ||
d4e4baa9 | 4013 | /* Declare the return variable for the function. */ |
6938f93f | 4014 | use_retvar = declare_return_variable (id, return_slot, modify_dest, bb); |
1ea193c2 | 4015 | |
acb8f212 | 4016 | /* Add local vars in this inlined callee to caller. */ |
c021f10b | 4017 | add_local_variables (id->src_cfun, cfun, id, true); |
acb8f212 | 4018 | |
0d63a740 JH |
4019 | if (dump_file && (dump_flags & TDF_DETAILS)) |
4020 | { | |
4021 | fprintf (dump_file, "Inlining "); | |
b8698a0f | 4022 | print_generic_expr (dump_file, id->src_fn, 0); |
0d63a740 | 4023 | fprintf (dump_file, " to "); |
b8698a0f | 4024 | print_generic_expr (dump_file, id->dst_fn, 0); |
0d63a740 JH |
4025 | fprintf (dump_file, " with frequency %i\n", cg_edge->frequency); |
4026 | } | |
4027 | ||
eb50f5f4 JH |
4028 | /* This is it. Duplicate the callee body. Assume callee is |
4029 | pre-gimplified. Note that we must not alter the caller | |
4030 | function in any way before this point, as this CALL_EXPR may be | |
4031 | a self-referential call; if we're calling ourselves, we need to | |
4032 | duplicate our body before altering anything. */ | |
0d63a740 JH |
4033 | copy_body (id, bb->count, |
4034 | cg_edge->frequency * REG_BR_PROB_BASE / CGRAPH_FREQ_BASE, | |
91382288 | 4035 | bb, return_block, NULL, NULL); |
eb50f5f4 | 4036 | |
d086d311 | 4037 | /* Reset the escaped solution. */ |
6b8ed145 | 4038 | if (cfun->gimple_df) |
d086d311 | 4039 | pt_solution_reset (&cfun->gimple_df->escaped); |
6b8ed145 | 4040 | |
d4e4baa9 | 4041 | /* Clean up. */ |
b5b8b0ac AO |
4042 | if (id->debug_map) |
4043 | { | |
4044 | pointer_map_destroy (id->debug_map); | |
4045 | id->debug_map = dst; | |
4046 | } | |
6be42dd4 | 4047 | pointer_map_destroy (id->decl_map); |
d4e4baa9 AO |
4048 | id->decl_map = st; |
4049 | ||
5006671f RG |
4050 | /* Unlink the calls virtual operands before replacing it. */ |
4051 | unlink_stmt_vdef (stmt); | |
4052 | ||
84936f6f | 4053 | /* If the inlined function returns a result that we care about, |
726a989a RB |
4054 | substitute the GIMPLE_CALL with an assignment of the return |
4055 | variable to the LHS of the call. That is, if STMT was | |
4056 | 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */ | |
4057 | if (use_retvar && gimple_call_lhs (stmt)) | |
e21aff8a | 4058 | { |
726a989a RB |
4059 | gimple old_stmt = stmt; |
4060 | stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar); | |
4061 | gsi_replace (&stmt_gsi, stmt, false); | |
110cfe1c | 4062 | if (gimple_in_ssa_p (cfun)) |
5006671f | 4063 | mark_symbols_for_renaming (stmt); |
726a989a | 4064 | maybe_clean_or_replace_eh_stmt (old_stmt, stmt); |
e21aff8a | 4065 | } |
6de9cd9a | 4066 | else |
110cfe1c | 4067 | { |
726a989a RB |
4068 | /* Handle the case of inlining a function with no return |
4069 | statement, which causes the return value to become undefined. */ | |
4070 | if (gimple_call_lhs (stmt) | |
4071 | && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME) | |
110cfe1c | 4072 | { |
726a989a RB |
4073 | tree name = gimple_call_lhs (stmt); |
4074 | tree var = SSA_NAME_VAR (name); | |
110cfe1c JH |
4075 | tree def = gimple_default_def (cfun, var); |
4076 | ||
110cfe1c JH |
4077 | if (def) |
4078 | { | |
726a989a RB |
4079 | /* If the variable is used undefined, make this name |
4080 | undefined via a move. */ | |
4081 | stmt = gimple_build_assign (gimple_call_lhs (stmt), def); | |
4082 | gsi_replace (&stmt_gsi, stmt, true); | |
110cfe1c | 4083 | } |
110cfe1c JH |
4084 | else |
4085 | { | |
726a989a RB |
4086 | /* Otherwise make this variable undefined. */ |
4087 | gsi_remove (&stmt_gsi, true); | |
110cfe1c | 4088 | set_default_def (var, name); |
726a989a | 4089 | SSA_NAME_DEF_STMT (name) = gimple_build_nop (); |
110cfe1c JH |
4090 | } |
4091 | } | |
4092 | else | |
726a989a | 4093 | gsi_remove (&stmt_gsi, true); |
110cfe1c | 4094 | } |
d4e4baa9 | 4095 | |
4f6c2131 | 4096 | if (purge_dead_abnormal_edges) |
726a989a | 4097 | gimple_purge_dead_abnormal_call_edges (return_block); |
84936f6f | 4098 | |
e21aff8a SB |
4099 | /* If the value of the new expression is ignored, that's OK. We |
4100 | don't warn about this for CALL_EXPRs, so we shouldn't warn about | |
4101 | the equivalent inlined version either. */ | |
726a989a RB |
4102 | if (is_gimple_assign (stmt)) |
4103 | { | |
4104 | gcc_assert (gimple_assign_single_p (stmt) | |
1a87cf0c | 4105 | || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt))); |
726a989a RB |
4106 | TREE_USED (gimple_assign_rhs1 (stmt)) = 1; |
4107 | } | |
84936f6f | 4108 | |
1eb3331e DB |
4109 | /* Output the inlining info for this abstract function, since it has been |
4110 | inlined. If we don't do this now, we can lose the information about the | |
4111 | variables in the function when the blocks get blown away as soon as we | |
4112 | remove the cgraph node. */ | |
e21aff8a | 4113 | (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl); |
84936f6f | 4114 | |
e72fcfe8 | 4115 | /* Update callgraph if needed. */ |
e21aff8a | 4116 | cgraph_remove_node (cg_edge->callee); |
e72fcfe8 | 4117 | |
e21aff8a | 4118 | id->block = NULL_TREE; |
e21aff8a | 4119 | successfully_inlined = TRUE; |
742a37d5 | 4120 | |
6de9cd9a DN |
4121 | egress: |
4122 | input_location = saved_location; | |
e21aff8a | 4123 | return successfully_inlined; |
d4e4baa9 | 4124 | } |
6de9cd9a | 4125 | |
e21aff8a SB |
4126 | /* Expand call statements reachable from STMT_P. |
4127 | We can only have CALL_EXPRs as the "toplevel" tree code or nested | |
12947319 | 4128 | in a MODIFY_EXPR. See gimple.c:get_call_expr_in(). We can |
e21aff8a SB |
4129 | unfortunately not use that function here because we need a pointer |
4130 | to the CALL_EXPR, not the tree itself. */ | |
4131 | ||
4132 | static bool | |
1b369fae | 4133 | gimple_expand_calls_inline (basic_block bb, copy_body_data *id) |
6de9cd9a | 4134 | { |
726a989a | 4135 | gimple_stmt_iterator gsi; |
6de9cd9a | 4136 | |
726a989a | 4137 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
6de9cd9a | 4138 | { |
726a989a | 4139 | gimple stmt = gsi_stmt (gsi); |
e21aff8a | 4140 | |
726a989a RB |
4141 | if (is_gimple_call (stmt) |
4142 | && expand_call_inline (bb, stmt, id)) | |
4143 | return true; | |
6de9cd9a | 4144 | } |
726a989a | 4145 | |
e21aff8a | 4146 | return false; |
6de9cd9a DN |
4147 | } |
4148 | ||
726a989a | 4149 | |
b8a00a4d JH |
4150 | /* Walk all basic blocks created after FIRST and try to fold every statement |
4151 | in the STATEMENTS pointer set. */ | |
726a989a | 4152 | |
b8a00a4d JH |
4153 | static void |
4154 | fold_marked_statements (int first, struct pointer_set_t *statements) | |
4155 | { | |
726a989a | 4156 | for (; first < n_basic_blocks; first++) |
b8a00a4d JH |
4157 | if (BASIC_BLOCK (first)) |
4158 | { | |
726a989a RB |
4159 | gimple_stmt_iterator gsi; |
4160 | ||
4161 | for (gsi = gsi_start_bb (BASIC_BLOCK (first)); | |
4162 | !gsi_end_p (gsi); | |
4163 | gsi_next (&gsi)) | |
4164 | if (pointer_set_contains (statements, gsi_stmt (gsi))) | |
9477eb38 | 4165 | { |
726a989a | 4166 | gimple old_stmt = gsi_stmt (gsi); |
4b685e14 | 4167 | tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0; |
2bafad93 | 4168 | |
44e10129 MM |
4169 | if (old_decl && DECL_BUILT_IN (old_decl)) |
4170 | { | |
4171 | /* Folding builtins can create multiple instructions, | |
4172 | we need to look at all of them. */ | |
4173 | gimple_stmt_iterator i2 = gsi; | |
4174 | gsi_prev (&i2); | |
4175 | if (fold_stmt (&gsi)) | |
4176 | { | |
4177 | gimple new_stmt; | |
4178 | if (gsi_end_p (i2)) | |
4179 | i2 = gsi_start_bb (BASIC_BLOCK (first)); | |
4180 | else | |
4181 | gsi_next (&i2); | |
4182 | while (1) | |
4183 | { | |
4184 | new_stmt = gsi_stmt (i2); | |
4185 | update_stmt (new_stmt); | |
4186 | cgraph_update_edges_for_call_stmt (old_stmt, old_decl, | |
4187 | new_stmt); | |
4188 | ||
4189 | if (new_stmt == gsi_stmt (gsi)) | |
4190 | { | |
4191 | /* It is okay to check only for the very last | |
4192 | of these statements. If it is a throwing | |
4193 | statement nothing will change. If it isn't | |
4194 | this can remove EH edges. If that weren't | |
4195 | correct then because some intermediate stmts | |
4196 | throw, but not the last one. That would mean | |
4197 | we'd have to split the block, which we can't | |
4198 | here and we'd loose anyway. And as builtins | |
4199 | probably never throw, this all | |
4200 | is mood anyway. */ | |
4201 | if (maybe_clean_or_replace_eh_stmt (old_stmt, | |
4202 | new_stmt)) | |
4203 | gimple_purge_dead_eh_edges (BASIC_BLOCK (first)); | |
4204 | break; | |
4205 | } | |
4206 | gsi_next (&i2); | |
4207 | } | |
4208 | } | |
4209 | } | |
4210 | else if (fold_stmt (&gsi)) | |
9477eb38 | 4211 | { |
726a989a RB |
4212 | /* Re-read the statement from GSI as fold_stmt() may |
4213 | have changed it. */ | |
4214 | gimple new_stmt = gsi_stmt (gsi); | |
4215 | update_stmt (new_stmt); | |
4216 | ||
4b685e14 JH |
4217 | if (is_gimple_call (old_stmt) |
4218 | || is_gimple_call (new_stmt)) | |
44e10129 MM |
4219 | cgraph_update_edges_for_call_stmt (old_stmt, old_decl, |
4220 | new_stmt); | |
726a989a RB |
4221 | |
4222 | if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt)) | |
4223 | gimple_purge_dead_eh_edges (BASIC_BLOCK (first)); | |
9477eb38 JH |
4224 | } |
4225 | } | |
b8a00a4d JH |
4226 | } |
4227 | } | |
4228 | ||
1084e689 JH |
4229 | /* Return true if BB has at least one abnormal outgoing edge. */ |
4230 | ||
4231 | static inline bool | |
4232 | has_abnormal_outgoing_edge_p (basic_block bb) | |
4233 | { | |
4234 | edge e; | |
4235 | edge_iterator ei; | |
4236 | ||
4237 | FOR_EACH_EDGE (e, ei, bb->succs) | |
4238 | if (e->flags & EDGE_ABNORMAL) | |
4239 | return true; | |
4240 | ||
4241 | return false; | |
4242 | } | |
4243 | ||
d4e4baa9 AO |
4244 | /* Expand calls to inline functions in the body of FN. */ |
4245 | ||
873aa8f5 | 4246 | unsigned int |
46c5ad27 | 4247 | optimize_inline_calls (tree fn) |
d4e4baa9 | 4248 | { |
1b369fae | 4249 | copy_body_data id; |
e21aff8a | 4250 | basic_block bb; |
b8a00a4d | 4251 | int last = n_basic_blocks; |
d406b663 JJ |
4252 | struct gimplify_ctx gctx; |
4253 | ||
c5b6f18e MM |
4254 | /* There is no point in performing inlining if errors have already |
4255 | occurred -- and we might crash if we try to inline invalid | |
4256 | code. */ | |
1da2ed5f | 4257 | if (seen_error ()) |
873aa8f5 | 4258 | return 0; |
c5b6f18e | 4259 | |
d4e4baa9 AO |
4260 | /* Clear out ID. */ |
4261 | memset (&id, 0, sizeof (id)); | |
4262 | ||
1b369fae RH |
4263 | id.src_node = id.dst_node = cgraph_node (fn); |
4264 | id.dst_fn = fn; | |
d4e4baa9 | 4265 | /* Or any functions that aren't finished yet. */ |
d4e4baa9 | 4266 | if (current_function_decl) |
0f900dfa | 4267 | id.dst_fn = current_function_decl; |
1b369fae RH |
4268 | |
4269 | id.copy_decl = copy_decl_maybe_to_var; | |
4270 | id.transform_call_graph_edges = CB_CGE_DUPLICATE; | |
4271 | id.transform_new_cfg = false; | |
4272 | id.transform_return_to_modify = true; | |
9ff420f1 | 4273 | id.transform_lang_insert_block = NULL; |
b8a00a4d | 4274 | id.statements_to_fold = pointer_set_create (); |
1b369fae | 4275 | |
d406b663 | 4276 | push_gimplify_context (&gctx); |
d4e4baa9 | 4277 | |
672987e8 ZD |
4278 | /* We make no attempts to keep dominance info up-to-date. */ |
4279 | free_dominance_info (CDI_DOMINATORS); | |
4280 | free_dominance_info (CDI_POST_DOMINATORS); | |
4281 | ||
726a989a RB |
4282 | /* Register specific gimple functions. */ |
4283 | gimple_register_cfg_hooks (); | |
4284 | ||
e21aff8a SB |
4285 | /* Reach the trees by walking over the CFG, and note the |
4286 | enclosing basic-blocks in the call edges. */ | |
4287 | /* We walk the blocks going forward, because inlined function bodies | |
4288 | will split id->current_basic_block, and the new blocks will | |
4289 | follow it; we'll trudge through them, processing their CALL_EXPRs | |
4290 | along the way. */ | |
4291 | FOR_EACH_BB (bb) | |
4292 | gimple_expand_calls_inline (bb, &id); | |
d4e4baa9 | 4293 | |
e21aff8a | 4294 | pop_gimplify_context (NULL); |
6de9cd9a | 4295 | |
18c6ada9 JH |
4296 | #ifdef ENABLE_CHECKING |
4297 | { | |
4298 | struct cgraph_edge *e; | |
4299 | ||
1b369fae | 4300 | verify_cgraph_node (id.dst_node); |
18c6ada9 JH |
4301 | |
4302 | /* Double check that we inlined everything we are supposed to inline. */ | |
1b369fae | 4303 | for (e = id.dst_node->callees; e; e = e->next_callee) |
1e128c5f | 4304 | gcc_assert (e->inline_failed); |
18c6ada9 JH |
4305 | } |
4306 | #endif | |
b8698a0f | 4307 | |
a9eafe81 AP |
4308 | /* Fold the statements before compacting/renumbering the basic blocks. */ |
4309 | fold_marked_statements (last, id.statements_to_fold); | |
4310 | pointer_set_destroy (id.statements_to_fold); | |
b8698a0f | 4311 | |
b5b8b0ac AO |
4312 | gcc_assert (!id.debug_stmts); |
4313 | ||
a9eafe81 AP |
4314 | /* Renumber the (code) basic_blocks consecutively. */ |
4315 | compact_blocks (); | |
4316 | /* Renumber the lexical scoping (non-code) blocks consecutively. */ | |
4317 | number_blocks (fn); | |
b8a00a4d | 4318 | |
873aa8f5 | 4319 | fold_cond_expr_cond (); |
078c3644 JH |
4320 | delete_unreachable_blocks_update_callgraph (&id); |
4321 | #ifdef ENABLE_CHECKING | |
4322 | verify_cgraph_node (id.dst_node); | |
4323 | #endif | |
726a989a | 4324 | |
110cfe1c JH |
4325 | /* It would be nice to check SSA/CFG/statement consistency here, but it is |
4326 | not possible yet - the IPA passes might make various functions to not | |
4327 | throw and they don't care to proactively update local EH info. This is | |
4328 | done later in fixup_cfg pass that also execute the verification. */ | |
726a989a RB |
4329 | return (TODO_update_ssa |
4330 | | TODO_cleanup_cfg | |
45a80bb9 JH |
4331 | | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0) |
4332 | | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0)); | |
d4e4baa9 AO |
4333 | } |
4334 | ||
d4e4baa9 AO |
4335 | /* Passed to walk_tree. Copies the node pointed to, if appropriate. */ |
4336 | ||
4337 | tree | |
46c5ad27 | 4338 | copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED) |
d4e4baa9 AO |
4339 | { |
4340 | enum tree_code code = TREE_CODE (*tp); | |
07beea0d | 4341 | enum tree_code_class cl = TREE_CODE_CLASS (code); |
d4e4baa9 AO |
4342 | |
4343 | /* We make copies of most nodes. */ | |
07beea0d | 4344 | if (IS_EXPR_CODE_CLASS (cl) |
d4e4baa9 AO |
4345 | || code == TREE_LIST |
4346 | || code == TREE_VEC | |
8843c120 DN |
4347 | || code == TYPE_DECL |
4348 | || code == OMP_CLAUSE) | |
d4e4baa9 AO |
4349 | { |
4350 | /* Because the chain gets clobbered when we make a copy, we save it | |
4351 | here. */ | |
82d6e6fc | 4352 | tree chain = NULL_TREE, new_tree; |
07beea0d | 4353 | |
726a989a | 4354 | chain = TREE_CHAIN (*tp); |
d4e4baa9 AO |
4355 | |
4356 | /* Copy the node. */ | |
82d6e6fc | 4357 | new_tree = copy_node (*tp); |
6de9cd9a DN |
4358 | |
4359 | /* Propagate mudflap marked-ness. */ | |
4360 | if (flag_mudflap && mf_marked_p (*tp)) | |
82d6e6fc | 4361 | mf_mark (new_tree); |
6de9cd9a | 4362 | |
82d6e6fc | 4363 | *tp = new_tree; |
d4e4baa9 AO |
4364 | |
4365 | /* Now, restore the chain, if appropriate. That will cause | |
4366 | walk_tree to walk into the chain as well. */ | |
50674e96 DN |
4367 | if (code == PARM_DECL |
4368 | || code == TREE_LIST | |
aaf46ef9 | 4369 | || code == OMP_CLAUSE) |
d4e4baa9 AO |
4370 | TREE_CHAIN (*tp) = chain; |
4371 | ||
4372 | /* For now, we don't update BLOCKs when we make copies. So, we | |
6de9cd9a DN |
4373 | have to nullify all BIND_EXPRs. */ |
4374 | if (TREE_CODE (*tp) == BIND_EXPR) | |
4375 | BIND_EXPR_BLOCK (*tp) = NULL_TREE; | |
d4e4baa9 | 4376 | } |
4038c495 GB |
4377 | else if (code == CONSTRUCTOR) |
4378 | { | |
4379 | /* CONSTRUCTOR nodes need special handling because | |
4380 | we need to duplicate the vector of elements. */ | |
82d6e6fc | 4381 | tree new_tree; |
4038c495 | 4382 | |
82d6e6fc | 4383 | new_tree = copy_node (*tp); |
4038c495 GB |
4384 | |
4385 | /* Propagate mudflap marked-ness. */ | |
4386 | if (flag_mudflap && mf_marked_p (*tp)) | |
82d6e6fc | 4387 | mf_mark (new_tree); |
9f63daea | 4388 | |
82d6e6fc | 4389 | CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc, |
4038c495 | 4390 | CONSTRUCTOR_ELTS (*tp)); |
82d6e6fc | 4391 | *tp = new_tree; |
4038c495 | 4392 | } |
6615c446 | 4393 | else if (TREE_CODE_CLASS (code) == tcc_type) |
d4e4baa9 | 4394 | *walk_subtrees = 0; |
6615c446 | 4395 | else if (TREE_CODE_CLASS (code) == tcc_declaration) |
6de9cd9a | 4396 | *walk_subtrees = 0; |
a396f8ae GK |
4397 | else if (TREE_CODE_CLASS (code) == tcc_constant) |
4398 | *walk_subtrees = 0; | |
1e128c5f GB |
4399 | else |
4400 | gcc_assert (code != STATEMENT_LIST); | |
d4e4baa9 AO |
4401 | return NULL_TREE; |
4402 | } | |
4403 | ||
4404 | /* The SAVE_EXPR pointed to by TP is being copied. If ST contains | |
aa4a53af | 4405 | information indicating to what new SAVE_EXPR this one should be mapped, |
e21aff8a SB |
4406 | use that one. Otherwise, create a new node and enter it in ST. FN is |
4407 | the function into which the copy will be placed. */ | |
d4e4baa9 | 4408 | |
892c7e1e | 4409 | static void |
82c82743 | 4410 | remap_save_expr (tree *tp, void *st_, int *walk_subtrees) |
d4e4baa9 | 4411 | { |
6be42dd4 RG |
4412 | struct pointer_map_t *st = (struct pointer_map_t *) st_; |
4413 | tree *n; | |
5e20bdd7 | 4414 | tree t; |
d4e4baa9 AO |
4415 | |
4416 | /* See if we already encountered this SAVE_EXPR. */ | |
6be42dd4 | 4417 | n = (tree *) pointer_map_contains (st, *tp); |
d92b4486 | 4418 | |
d4e4baa9 AO |
4419 | /* If we didn't already remap this SAVE_EXPR, do so now. */ |
4420 | if (!n) | |
4421 | { | |
5e20bdd7 | 4422 | t = copy_node (*tp); |
d4e4baa9 | 4423 | |
d4e4baa9 | 4424 | /* Remember this SAVE_EXPR. */ |
6be42dd4 | 4425 | *pointer_map_insert (st, *tp) = t; |
350ebd54 | 4426 | /* Make sure we don't remap an already-remapped SAVE_EXPR. */ |
6be42dd4 | 4427 | *pointer_map_insert (st, t) = t; |
d4e4baa9 AO |
4428 | } |
4429 | else | |
5e20bdd7 JZ |
4430 | { |
4431 | /* We've already walked into this SAVE_EXPR; don't do it again. */ | |
4432 | *walk_subtrees = 0; | |
6be42dd4 | 4433 | t = *n; |
5e20bdd7 | 4434 | } |
d4e4baa9 AO |
4435 | |
4436 | /* Replace this SAVE_EXPR with the copy. */ | |
5e20bdd7 | 4437 | *tp = t; |
d4e4baa9 | 4438 | } |
d436bff8 | 4439 | |
aa4a53af RK |
4440 | /* Called via walk_tree. If *TP points to a DECL_STMT for a local label, |
4441 | copies the declaration and enters it in the splay_tree in DATA (which is | |
1b369fae | 4442 | really an `copy_body_data *'). */ |
6de9cd9a DN |
4443 | |
4444 | static tree | |
4445 | mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, | |
4446 | void *data) | |
4447 | { | |
1b369fae | 4448 | copy_body_data *id = (copy_body_data *) data; |
6de9cd9a DN |
4449 | |
4450 | /* Don't walk into types. */ | |
350fae66 RK |
4451 | if (TYPE_P (*tp)) |
4452 | *walk_subtrees = 0; | |
6de9cd9a | 4453 | |
350fae66 | 4454 | else if (TREE_CODE (*tp) == LABEL_EXPR) |
6de9cd9a | 4455 | { |
350fae66 | 4456 | tree decl = TREE_OPERAND (*tp, 0); |
6de9cd9a | 4457 | |
350fae66 | 4458 | /* Copy the decl and remember the copy. */ |
1b369fae | 4459 | insert_decl_map (id, decl, id->copy_decl (decl, id)); |
6de9cd9a DN |
4460 | } |
4461 | ||
4462 | return NULL_TREE; | |
4463 | } | |
4464 | ||
19114537 EC |
4465 | /* Perform any modifications to EXPR required when it is unsaved. Does |
4466 | not recurse into EXPR's subtrees. */ | |
4467 | ||
4468 | static void | |
4469 | unsave_expr_1 (tree expr) | |
4470 | { | |
4471 | switch (TREE_CODE (expr)) | |
4472 | { | |
4473 | case TARGET_EXPR: | |
4474 | /* Don't mess with a TARGET_EXPR that hasn't been expanded. | |
4475 | It's OK for this to happen if it was part of a subtree that | |
4476 | isn't immediately expanded, such as operand 2 of another | |
4477 | TARGET_EXPR. */ | |
4478 | if (TREE_OPERAND (expr, 1)) | |
4479 | break; | |
4480 | ||
4481 | TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3); | |
4482 | TREE_OPERAND (expr, 3) = NULL_TREE; | |
4483 | break; | |
4484 | ||
4485 | default: | |
4486 | break; | |
4487 | } | |
4488 | } | |
4489 | ||
6de9cd9a DN |
4490 | /* Called via walk_tree when an expression is unsaved. Using the |
4491 | splay_tree pointed to by ST (which is really a `splay_tree'), | |
4492 | remaps all local declarations to appropriate replacements. */ | |
d436bff8 AH |
4493 | |
4494 | static tree | |
6de9cd9a | 4495 | unsave_r (tree *tp, int *walk_subtrees, void *data) |
d436bff8 | 4496 | { |
1b369fae | 4497 | copy_body_data *id = (copy_body_data *) data; |
6be42dd4 RG |
4498 | struct pointer_map_t *st = id->decl_map; |
4499 | tree *n; | |
6de9cd9a DN |
4500 | |
4501 | /* Only a local declaration (variable or label). */ | |
4502 | if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp)) | |
4503 | || TREE_CODE (*tp) == LABEL_DECL) | |
4504 | { | |
4505 | /* Lookup the declaration. */ | |
6be42dd4 | 4506 | n = (tree *) pointer_map_contains (st, *tp); |
9f63daea | 4507 | |
6de9cd9a DN |
4508 | /* If it's there, remap it. */ |
4509 | if (n) | |
6be42dd4 | 4510 | *tp = *n; |
6de9cd9a | 4511 | } |
aa4a53af | 4512 | |
6de9cd9a | 4513 | else if (TREE_CODE (*tp) == STATEMENT_LIST) |
726a989a | 4514 | gcc_unreachable (); |
6de9cd9a DN |
4515 | else if (TREE_CODE (*tp) == BIND_EXPR) |
4516 | copy_bind_expr (tp, walk_subtrees, id); | |
a406865a RG |
4517 | else if (TREE_CODE (*tp) == SAVE_EXPR |
4518 | || TREE_CODE (*tp) == TARGET_EXPR) | |
82c82743 | 4519 | remap_save_expr (tp, st, walk_subtrees); |
d436bff8 | 4520 | else |
6de9cd9a DN |
4521 | { |
4522 | copy_tree_r (tp, walk_subtrees, NULL); | |
4523 | ||
4524 | /* Do whatever unsaving is required. */ | |
4525 | unsave_expr_1 (*tp); | |
4526 | } | |
4527 | ||
4528 | /* Keep iterating. */ | |
4529 | return NULL_TREE; | |
d436bff8 AH |
4530 | } |
4531 | ||
19114537 EC |
4532 | /* Copies everything in EXPR and replaces variables, labels |
4533 | and SAVE_EXPRs local to EXPR. */ | |
6de9cd9a DN |
4534 | |
4535 | tree | |
19114537 | 4536 | unsave_expr_now (tree expr) |
6de9cd9a | 4537 | { |
1b369fae | 4538 | copy_body_data id; |
6de9cd9a DN |
4539 | |
4540 | /* There's nothing to do for NULL_TREE. */ | |
4541 | if (expr == 0) | |
4542 | return expr; | |
4543 | ||
4544 | /* Set up ID. */ | |
4545 | memset (&id, 0, sizeof (id)); | |
1b369fae RH |
4546 | id.src_fn = current_function_decl; |
4547 | id.dst_fn = current_function_decl; | |
6be42dd4 | 4548 | id.decl_map = pointer_map_create (); |
b5b8b0ac | 4549 | id.debug_map = NULL; |
6de9cd9a | 4550 | |
1b369fae RH |
4551 | id.copy_decl = copy_decl_no_change; |
4552 | id.transform_call_graph_edges = CB_CGE_DUPLICATE; | |
4553 | id.transform_new_cfg = false; | |
4554 | id.transform_return_to_modify = false; | |
9ff420f1 | 4555 | id.transform_lang_insert_block = NULL; |
1b369fae | 4556 | |
6de9cd9a DN |
4557 | /* Walk the tree once to find local labels. */ |
4558 | walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id); | |
4559 | ||
4560 | /* Walk the tree again, copying, remapping, and unsaving. */ | |
4561 | walk_tree (&expr, unsave_r, &id, NULL); | |
4562 | ||
4563 | /* Clean up. */ | |
6be42dd4 | 4564 | pointer_map_destroy (id.decl_map); |
b5b8b0ac AO |
4565 | if (id.debug_map) |
4566 | pointer_map_destroy (id.debug_map); | |
6de9cd9a DN |
4567 | |
4568 | return expr; | |
4569 | } | |
4570 | ||
726a989a RB |
4571 | /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local |
4572 | label, copies the declaration and enters it in the splay_tree in DATA (which | |
4573 | is really a 'copy_body_data *'. */ | |
4574 | ||
4575 | static tree | |
4576 | mark_local_labels_stmt (gimple_stmt_iterator *gsip, | |
4577 | bool *handled_ops_p ATTRIBUTE_UNUSED, | |
4578 | struct walk_stmt_info *wi) | |
4579 | { | |
4580 | copy_body_data *id = (copy_body_data *) wi->info; | |
4581 | gimple stmt = gsi_stmt (*gsip); | |
4582 | ||
4583 | if (gimple_code (stmt) == GIMPLE_LABEL) | |
4584 | { | |
4585 | tree decl = gimple_label_label (stmt); | |
4586 | ||
4587 | /* Copy the decl and remember the copy. */ | |
4588 | insert_decl_map (id, decl, id->copy_decl (decl, id)); | |
4589 | } | |
4590 | ||
4591 | return NULL_TREE; | |
4592 | } | |
4593 | ||
4594 | ||
4595 | /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local. | |
4596 | Using the splay_tree pointed to by ST (which is really a `splay_tree'), | |
4597 | remaps all local declarations to appropriate replacements in gimple | |
4598 | operands. */ | |
4599 | ||
4600 | static tree | |
4601 | replace_locals_op (tree *tp, int *walk_subtrees, void *data) | |
4602 | { | |
4603 | struct walk_stmt_info *wi = (struct walk_stmt_info*) data; | |
4604 | copy_body_data *id = (copy_body_data *) wi->info; | |
4605 | struct pointer_map_t *st = id->decl_map; | |
4606 | tree *n; | |
4607 | tree expr = *tp; | |
4608 | ||
4609 | /* Only a local declaration (variable or label). */ | |
4610 | if ((TREE_CODE (expr) == VAR_DECL | |
4611 | && !TREE_STATIC (expr)) | |
4612 | || TREE_CODE (expr) == LABEL_DECL) | |
4613 | { | |
4614 | /* Lookup the declaration. */ | |
4615 | n = (tree *) pointer_map_contains (st, expr); | |
4616 | ||
4617 | /* If it's there, remap it. */ | |
4618 | if (n) | |
4619 | *tp = *n; | |
4620 | *walk_subtrees = 0; | |
4621 | } | |
4622 | else if (TREE_CODE (expr) == STATEMENT_LIST | |
4623 | || TREE_CODE (expr) == BIND_EXPR | |
4624 | || TREE_CODE (expr) == SAVE_EXPR) | |
4625 | gcc_unreachable (); | |
4626 | else if (TREE_CODE (expr) == TARGET_EXPR) | |
4627 | { | |
4628 | /* Don't mess with a TARGET_EXPR that hasn't been expanded. | |
4629 | It's OK for this to happen if it was part of a subtree that | |
4630 | isn't immediately expanded, such as operand 2 of another | |
4631 | TARGET_EXPR. */ | |
4632 | if (!TREE_OPERAND (expr, 1)) | |
4633 | { | |
4634 | TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3); | |
4635 | TREE_OPERAND (expr, 3) = NULL_TREE; | |
4636 | } | |
4637 | } | |
4638 | ||
4639 | /* Keep iterating. */ | |
4640 | return NULL_TREE; | |
4641 | } | |
4642 | ||
4643 | ||
4644 | /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local. | |
4645 | Using the splay_tree pointed to by ST (which is really a `splay_tree'), | |
4646 | remaps all local declarations to appropriate replacements in gimple | |
4647 | statements. */ | |
4648 | ||
4649 | static tree | |
4650 | replace_locals_stmt (gimple_stmt_iterator *gsip, | |
4651 | bool *handled_ops_p ATTRIBUTE_UNUSED, | |
4652 | struct walk_stmt_info *wi) | |
4653 | { | |
4654 | copy_body_data *id = (copy_body_data *) wi->info; | |
4655 | gimple stmt = gsi_stmt (*gsip); | |
4656 | ||
4657 | if (gimple_code (stmt) == GIMPLE_BIND) | |
4658 | { | |
4659 | tree block = gimple_bind_block (stmt); | |
4660 | ||
4661 | if (block) | |
4662 | { | |
4663 | remap_block (&block, id); | |
4664 | gimple_bind_set_block (stmt, block); | |
4665 | } | |
4666 | ||
4667 | /* This will remap a lot of the same decls again, but this should be | |
4668 | harmless. */ | |
4669 | if (gimple_bind_vars (stmt)) | |
526d73ab | 4670 | gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id)); |
726a989a RB |
4671 | } |
4672 | ||
4673 | /* Keep iterating. */ | |
4674 | return NULL_TREE; | |
4675 | } | |
4676 | ||
4677 | ||
4678 | /* Copies everything in SEQ and replaces variables and labels local to | |
4679 | current_function_decl. */ | |
4680 | ||
4681 | gimple_seq | |
4682 | copy_gimple_seq_and_replace_locals (gimple_seq seq) | |
4683 | { | |
4684 | copy_body_data id; | |
4685 | struct walk_stmt_info wi; | |
4686 | struct pointer_set_t *visited; | |
4687 | gimple_seq copy; | |
4688 | ||
4689 | /* There's nothing to do for NULL_TREE. */ | |
4690 | if (seq == NULL) | |
4691 | return seq; | |
4692 | ||
4693 | /* Set up ID. */ | |
4694 | memset (&id, 0, sizeof (id)); | |
4695 | id.src_fn = current_function_decl; | |
4696 | id.dst_fn = current_function_decl; | |
4697 | id.decl_map = pointer_map_create (); | |
b5b8b0ac | 4698 | id.debug_map = NULL; |
726a989a RB |
4699 | |
4700 | id.copy_decl = copy_decl_no_change; | |
4701 | id.transform_call_graph_edges = CB_CGE_DUPLICATE; | |
4702 | id.transform_new_cfg = false; | |
4703 | id.transform_return_to_modify = false; | |
4704 | id.transform_lang_insert_block = NULL; | |
4705 | ||
4706 | /* Walk the tree once to find local labels. */ | |
4707 | memset (&wi, 0, sizeof (wi)); | |
4708 | visited = pointer_set_create (); | |
4709 | wi.info = &id; | |
4710 | wi.pset = visited; | |
4711 | walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi); | |
4712 | pointer_set_destroy (visited); | |
4713 | ||
4714 | copy = gimple_seq_copy (seq); | |
4715 | ||
4716 | /* Walk the copy, remapping decls. */ | |
4717 | memset (&wi, 0, sizeof (wi)); | |
4718 | wi.info = &id; | |
4719 | walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi); | |
4720 | ||
4721 | /* Clean up. */ | |
4722 | pointer_map_destroy (id.decl_map); | |
b5b8b0ac AO |
4723 | if (id.debug_map) |
4724 | pointer_map_destroy (id.debug_map); | |
726a989a RB |
4725 | |
4726 | return copy; | |
4727 | } | |
4728 | ||
4729 | ||
6de9cd9a | 4730 | /* Allow someone to determine if SEARCH is a child of TOP from gdb. */ |
aa4a53af | 4731 | |
6de9cd9a DN |
4732 | static tree |
4733 | debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data) | |
4734 | { | |
4735 | if (*tp == data) | |
4736 | return (tree) data; | |
4737 | else | |
4738 | return NULL; | |
4739 | } | |
4740 | ||
24e47c76 | 4741 | DEBUG_FUNCTION bool |
6de9cd9a DN |
4742 | debug_find_tree (tree top, tree search) |
4743 | { | |
4744 | return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0; | |
4745 | } | |
4746 | ||
e21aff8a | 4747 | |
6de9cd9a DN |
4748 | /* Declare the variables created by the inliner. Add all the variables in |
4749 | VARS to BIND_EXPR. */ | |
4750 | ||
4751 | static void | |
e21aff8a | 4752 | declare_inline_vars (tree block, tree vars) |
6de9cd9a | 4753 | { |
84936f6f RH |
4754 | tree t; |
4755 | for (t = vars; t; t = TREE_CHAIN (t)) | |
9659ce8b JH |
4756 | { |
4757 | DECL_SEEN_IN_BIND_EXPR_P (t) = 1; | |
4758 | gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t)); | |
c021f10b | 4759 | add_local_decl (cfun, t); |
9659ce8b | 4760 | } |
6de9cd9a | 4761 | |
e21aff8a SB |
4762 | if (block) |
4763 | BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars); | |
4764 | } | |
4765 | ||
19734dd8 | 4766 | /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN, |
1b369fae RH |
4767 | but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to |
4768 | VAR_DECL translation. */ | |
19734dd8 | 4769 | |
1b369fae RH |
4770 | static tree |
4771 | copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy) | |
19734dd8 | 4772 | { |
19734dd8 RL |
4773 | /* Don't generate debug information for the copy if we wouldn't have |
4774 | generated it for the copy either. */ | |
4775 | DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl); | |
4776 | DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl); | |
4777 | ||
4778 | /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what | |
b8698a0f | 4779 | declaration inspired this copy. */ |
19734dd8 RL |
4780 | DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl); |
4781 | ||
4782 | /* The new variable/label has no RTL, yet. */ | |
68a976f2 RL |
4783 | if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL) |
4784 | && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy)) | |
2eb79bbb | 4785 | SET_DECL_RTL (copy, 0); |
b8698a0f | 4786 | |
19734dd8 RL |
4787 | /* These args would always appear unused, if not for this. */ |
4788 | TREE_USED (copy) = 1; | |
4789 | ||
4790 | /* Set the context for the new declaration. */ | |
4791 | if (!DECL_CONTEXT (decl)) | |
4792 | /* Globals stay global. */ | |
4793 | ; | |
1b369fae | 4794 | else if (DECL_CONTEXT (decl) != id->src_fn) |
19734dd8 RL |
4795 | /* Things that weren't in the scope of the function we're inlining |
4796 | from aren't in the scope we're inlining to, either. */ | |
4797 | ; | |
4798 | else if (TREE_STATIC (decl)) | |
4799 | /* Function-scoped static variables should stay in the original | |
4800 | function. */ | |
4801 | ; | |
4802 | else | |
4803 | /* Ordinary automatic local variables are now in the scope of the | |
4804 | new function. */ | |
1b369fae | 4805 | DECL_CONTEXT (copy) = id->dst_fn; |
19734dd8 RL |
4806 | |
4807 | return copy; | |
4808 | } | |
4809 | ||
1b369fae RH |
4810 | static tree |
4811 | copy_decl_to_var (tree decl, copy_body_data *id) | |
4812 | { | |
4813 | tree copy, type; | |
4814 | ||
4815 | gcc_assert (TREE_CODE (decl) == PARM_DECL | |
4816 | || TREE_CODE (decl) == RESULT_DECL); | |
4817 | ||
4818 | type = TREE_TYPE (decl); | |
4819 | ||
c2255bc4 AH |
4820 | copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn), |
4821 | VAR_DECL, DECL_NAME (decl), type); | |
25a6a873 RG |
4822 | if (DECL_PT_UID_SET_P (decl)) |
4823 | SET_DECL_PT_UID (copy, DECL_PT_UID (decl)); | |
1b369fae RH |
4824 | TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl); |
4825 | TREE_READONLY (copy) = TREE_READONLY (decl); | |
4826 | TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl); | |
0890b981 | 4827 | DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl); |
1b369fae RH |
4828 | |
4829 | return copy_decl_for_dup_finish (id, decl, copy); | |
4830 | } | |
4831 | ||
c08cd4c1 JM |
4832 | /* Like copy_decl_to_var, but create a return slot object instead of a |
4833 | pointer variable for return by invisible reference. */ | |
4834 | ||
4835 | static tree | |
4836 | copy_result_decl_to_var (tree decl, copy_body_data *id) | |
4837 | { | |
4838 | tree copy, type; | |
4839 | ||
4840 | gcc_assert (TREE_CODE (decl) == PARM_DECL | |
4841 | || TREE_CODE (decl) == RESULT_DECL); | |
4842 | ||
4843 | type = TREE_TYPE (decl); | |
4844 | if (DECL_BY_REFERENCE (decl)) | |
4845 | type = TREE_TYPE (type); | |
4846 | ||
c2255bc4 AH |
4847 | copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn), |
4848 | VAR_DECL, DECL_NAME (decl), type); | |
25a6a873 RG |
4849 | if (DECL_PT_UID_SET_P (decl)) |
4850 | SET_DECL_PT_UID (copy, DECL_PT_UID (decl)); | |
c08cd4c1 JM |
4851 | TREE_READONLY (copy) = TREE_READONLY (decl); |
4852 | TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl); | |
4853 | if (!DECL_BY_REFERENCE (decl)) | |
4854 | { | |
4855 | TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl); | |
0890b981 | 4856 | DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl); |
c08cd4c1 JM |
4857 | } |
4858 | ||
4859 | return copy_decl_for_dup_finish (id, decl, copy); | |
4860 | } | |
4861 | ||
9ff420f1 | 4862 | tree |
1b369fae RH |
4863 | copy_decl_no_change (tree decl, copy_body_data *id) |
4864 | { | |
4865 | tree copy; | |
4866 | ||
4867 | copy = copy_node (decl); | |
4868 | ||
4869 | /* The COPY is not abstract; it will be generated in DST_FN. */ | |
4870 | DECL_ABSTRACT (copy) = 0; | |
4871 | lang_hooks.dup_lang_specific_decl (copy); | |
4872 | ||
4873 | /* TREE_ADDRESSABLE isn't used to indicate that a label's address has | |
4874 | been taken; it's for internal bookkeeping in expand_goto_internal. */ | |
4875 | if (TREE_CODE (copy) == LABEL_DECL) | |
4876 | { | |
4877 | TREE_ADDRESSABLE (copy) = 0; | |
4878 | LABEL_DECL_UID (copy) = -1; | |
4879 | } | |
4880 | ||
4881 | return copy_decl_for_dup_finish (id, decl, copy); | |
4882 | } | |
4883 | ||
4884 | static tree | |
4885 | copy_decl_maybe_to_var (tree decl, copy_body_data *id) | |
4886 | { | |
4887 | if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL) | |
4888 | return copy_decl_to_var (decl, id); | |
4889 | else | |
4890 | return copy_decl_no_change (decl, id); | |
4891 | } | |
4892 | ||
19734dd8 RL |
4893 | /* Return a copy of the function's argument tree. */ |
4894 | static tree | |
c6f7cfc1 JH |
4895 | copy_arguments_for_versioning (tree orig_parm, copy_body_data * id, |
4896 | bitmap args_to_skip, tree *vars) | |
19734dd8 | 4897 | { |
c6f7cfc1 JH |
4898 | tree arg, *parg; |
4899 | tree new_parm = NULL; | |
4900 | int i = 0; | |
19734dd8 | 4901 | |
c6f7cfc1 JH |
4902 | parg = &new_parm; |
4903 | ||
4904 | for (arg = orig_parm; arg; arg = TREE_CHAIN (arg), i++) | |
4905 | if (!args_to_skip || !bitmap_bit_p (args_to_skip, i)) | |
4906 | { | |
4907 | tree new_tree = remap_decl (arg, id); | |
4908 | lang_hooks.dup_lang_specific_decl (new_tree); | |
4909 | *parg = new_tree; | |
4910 | parg = &TREE_CHAIN (new_tree); | |
4911 | } | |
eb50f5f4 | 4912 | else if (!pointer_map_contains (id->decl_map, arg)) |
c6f7cfc1 JH |
4913 | { |
4914 | /* Make an equivalent VAR_DECL. If the argument was used | |
4915 | as temporary variable later in function, the uses will be | |
4916 | replaced by local variable. */ | |
4917 | tree var = copy_decl_to_var (arg, id); | |
4918 | get_var_ann (var); | |
4919 | add_referenced_var (var); | |
4920 | insert_decl_map (id, arg, var); | |
4921 | /* Declare this new variable. */ | |
4922 | TREE_CHAIN (var) = *vars; | |
4923 | *vars = var; | |
4924 | } | |
4925 | return new_parm; | |
19734dd8 RL |
4926 | } |
4927 | ||
4928 | /* Return a copy of the function's static chain. */ | |
4929 | static tree | |
1b369fae | 4930 | copy_static_chain (tree static_chain, copy_body_data * id) |
19734dd8 RL |
4931 | { |
4932 | tree *chain_copy, *pvar; | |
4933 | ||
4934 | chain_copy = &static_chain; | |
4935 | for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar)) | |
4936 | { | |
82d6e6fc KG |
4937 | tree new_tree = remap_decl (*pvar, id); |
4938 | lang_hooks.dup_lang_specific_decl (new_tree); | |
4939 | TREE_CHAIN (new_tree) = TREE_CHAIN (*pvar); | |
4940 | *pvar = new_tree; | |
19734dd8 RL |
4941 | } |
4942 | return static_chain; | |
4943 | } | |
4944 | ||
4945 | /* Return true if the function is allowed to be versioned. | |
4946 | This is a guard for the versioning functionality. */ | |
27dbd3ac | 4947 | |
19734dd8 RL |
4948 | bool |
4949 | tree_versionable_function_p (tree fndecl) | |
4950 | { | |
86631ea3 MJ |
4951 | return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl)) |
4952 | && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl), fndecl) == NULL); | |
19734dd8 RL |
4953 | } |
4954 | ||
9187e02d JH |
4955 | /* Delete all unreachable basic blocks and update callgraph. |
4956 | Doing so is somewhat nontrivial because we need to update all clones and | |
4957 | remove inline function that become unreachable. */ | |
9f5e9983 | 4958 | |
9187e02d JH |
4959 | static bool |
4960 | delete_unreachable_blocks_update_callgraph (copy_body_data *id) | |
9f5e9983 | 4961 | { |
9187e02d JH |
4962 | bool changed = false; |
4963 | basic_block b, next_bb; | |
4964 | ||
4965 | find_unreachable_blocks (); | |
4966 | ||
4967 | /* Delete all unreachable basic blocks. */ | |
4968 | ||
4969 | for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR; b = next_bb) | |
4970 | { | |
4971 | next_bb = b->next_bb; | |
4972 | ||
4973 | if (!(b->flags & BB_REACHABLE)) | |
4974 | { | |
4975 | gimple_stmt_iterator bsi; | |
4976 | ||
4977 | for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi)) | |
4978 | if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL) | |
4979 | { | |
4980 | struct cgraph_edge *e; | |
4981 | struct cgraph_node *node; | |
4982 | ||
4983 | if ((e = cgraph_edge (id->dst_node, gsi_stmt (bsi))) != NULL) | |
4984 | { | |
4985 | if (!e->inline_failed) | |
4986 | cgraph_remove_node_and_inline_clones (e->callee); | |
4987 | else | |
4988 | cgraph_remove_edge (e); | |
4989 | } | |
4990 | if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES | |
4991 | && id->dst_node->clones) | |
4992 | for (node = id->dst_node->clones; node != id->dst_node;) | |
4993 | { | |
4994 | if ((e = cgraph_edge (node, gsi_stmt (bsi))) != NULL) | |
4995 | { | |
4996 | if (!e->inline_failed) | |
4997 | cgraph_remove_node_and_inline_clones (e->callee); | |
4998 | else | |
4999 | cgraph_remove_edge (e); | |
5000 | } | |
b8698a0f | 5001 | |
9187e02d JH |
5002 | if (node->clones) |
5003 | node = node->clones; | |
5004 | else if (node->next_sibling_clone) | |
5005 | node = node->next_sibling_clone; | |
5006 | else | |
5007 | { | |
5008 | while (node != id->dst_node && !node->next_sibling_clone) | |
5009 | node = node->clone_of; | |
5010 | if (node != id->dst_node) | |
5011 | node = node->next_sibling_clone; | |
5012 | } | |
5013 | } | |
5014 | } | |
5015 | delete_basic_block (b); | |
5016 | changed = true; | |
5017 | } | |
5018 | } | |
5019 | ||
5020 | if (changed) | |
5021 | tidy_fallthru_edges (); | |
9187e02d | 5022 | return changed; |
9f5e9983 JJ |
5023 | } |
5024 | ||
08ad1d6d JH |
5025 | /* Update clone info after duplication. */ |
5026 | ||
5027 | static void | |
5028 | update_clone_info (copy_body_data * id) | |
5029 | { | |
5030 | struct cgraph_node *node; | |
5031 | if (!id->dst_node->clones) | |
5032 | return; | |
5033 | for (node = id->dst_node->clones; node != id->dst_node;) | |
5034 | { | |
5035 | /* First update replace maps to match the new body. */ | |
5036 | if (node->clone.tree_map) | |
5037 | { | |
5038 | unsigned int i; | |
5039 | for (i = 0; i < VEC_length (ipa_replace_map_p, node->clone.tree_map); i++) | |
5040 | { | |
5041 | struct ipa_replace_map *replace_info; | |
5042 | replace_info = VEC_index (ipa_replace_map_p, node->clone.tree_map, i); | |
5043 | walk_tree (&replace_info->old_tree, copy_tree_body_r, id, NULL); | |
5044 | walk_tree (&replace_info->new_tree, copy_tree_body_r, id, NULL); | |
5045 | } | |
5046 | } | |
5047 | if (node->clones) | |
5048 | node = node->clones; | |
5049 | else if (node->next_sibling_clone) | |
5050 | node = node->next_sibling_clone; | |
5051 | else | |
5052 | { | |
5053 | while (node != id->dst_node && !node->next_sibling_clone) | |
5054 | node = node->clone_of; | |
5055 | if (node != id->dst_node) | |
5056 | node = node->next_sibling_clone; | |
5057 | } | |
5058 | } | |
5059 | } | |
5060 | ||
19734dd8 RL |
5061 | /* Create a copy of a function's tree. |
5062 | OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes | |
5063 | of the original function and the new copied function | |
b8698a0f L |
5064 | respectively. In case we want to replace a DECL |
5065 | tree with another tree while duplicating the function's | |
5066 | body, TREE_MAP represents the mapping between these | |
ea99e0be | 5067 | trees. If UPDATE_CLONES is set, the call_stmt fields |
91382288 JH |
5068 | of edges of clones of the function will be updated. |
5069 | ||
5070 | If non-NULL ARGS_TO_SKIP determine function parameters to remove | |
5071 | from new version. | |
5072 | If non-NULL BLOCK_TO_COPY determine what basic blocks to copy. | |
5073 | If non_NULL NEW_ENTRY determine new entry BB of the clone. | |
5074 | */ | |
19734dd8 | 5075 | void |
27dbd3ac RH |
5076 | tree_function_versioning (tree old_decl, tree new_decl, |
5077 | VEC(ipa_replace_map_p,gc)* tree_map, | |
91382288 JH |
5078 | bool update_clones, bitmap args_to_skip, |
5079 | bitmap blocks_to_copy, basic_block new_entry) | |
19734dd8 RL |
5080 | { |
5081 | struct cgraph_node *old_version_node; | |
5082 | struct cgraph_node *new_version_node; | |
1b369fae | 5083 | copy_body_data id; |
110cfe1c | 5084 | tree p; |
19734dd8 RL |
5085 | unsigned i; |
5086 | struct ipa_replace_map *replace_info; | |
b5b8b0ac | 5087 | basic_block old_entry_block, bb; |
0f1961a2 JH |
5088 | VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10); |
5089 | ||
873aa8f5 | 5090 | tree old_current_function_decl = current_function_decl; |
0f1961a2 | 5091 | tree vars = NULL_TREE; |
19734dd8 RL |
5092 | |
5093 | gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL | |
5094 | && TREE_CODE (new_decl) == FUNCTION_DECL); | |
5095 | DECL_POSSIBLY_INLINED (old_decl) = 1; | |
5096 | ||
5097 | old_version_node = cgraph_node (old_decl); | |
5098 | new_version_node = cgraph_node (new_decl); | |
5099 | ||
a3aadcc5 JH |
5100 | /* Output the inlining info for this abstract function, since it has been |
5101 | inlined. If we don't do this now, we can lose the information about the | |
5102 | variables in the function when the blocks get blown away as soon as we | |
5103 | remove the cgraph node. */ | |
5104 | (*debug_hooks->outlining_inline_function) (old_decl); | |
5105 | ||
19734dd8 RL |
5106 | DECL_ARTIFICIAL (new_decl) = 1; |
5107 | DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl); | |
f9417da1 | 5108 | DECL_FUNCTION_PERSONALITY (new_decl) = DECL_FUNCTION_PERSONALITY (old_decl); |
19734dd8 | 5109 | |
3d283195 JH |
5110 | /* Prepare the data structures for the tree copy. */ |
5111 | memset (&id, 0, sizeof (id)); | |
5112 | ||
19734dd8 | 5113 | /* Generate a new name for the new version. */ |
9187e02d | 5114 | id.statements_to_fold = pointer_set_create (); |
b5b8b0ac | 5115 | |
6be42dd4 | 5116 | id.decl_map = pointer_map_create (); |
b5b8b0ac | 5117 | id.debug_map = NULL; |
1b369fae RH |
5118 | id.src_fn = old_decl; |
5119 | id.dst_fn = new_decl; | |
5120 | id.src_node = old_version_node; | |
5121 | id.dst_node = new_version_node; | |
5122 | id.src_cfun = DECL_STRUCT_FUNCTION (old_decl); | |
0e3776db JH |
5123 | if (id.src_node->ipa_transforms_to_apply) |
5124 | { | |
5125 | VEC(ipa_opt_pass,heap) * old_transforms_to_apply = id.dst_node->ipa_transforms_to_apply; | |
5126 | unsigned int i; | |
5127 | ||
5128 | id.dst_node->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap, | |
5129 | id.src_node->ipa_transforms_to_apply); | |
5130 | for (i = 0; i < VEC_length (ipa_opt_pass, old_transforms_to_apply); i++) | |
5131 | VEC_safe_push (ipa_opt_pass, heap, id.dst_node->ipa_transforms_to_apply, | |
5132 | VEC_index (ipa_opt_pass, | |
5133 | old_transforms_to_apply, | |
5134 | i)); | |
5135 | } | |
b8698a0f | 5136 | |
1b369fae RH |
5137 | id.copy_decl = copy_decl_no_change; |
5138 | id.transform_call_graph_edges | |
5139 | = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE; | |
5140 | id.transform_new_cfg = true; | |
5141 | id.transform_return_to_modify = false; | |
9ff420f1 | 5142 | id.transform_lang_insert_block = NULL; |
1b369fae | 5143 | |
19734dd8 | 5144 | current_function_decl = new_decl; |
110cfe1c JH |
5145 | old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION |
5146 | (DECL_STRUCT_FUNCTION (old_decl)); | |
5147 | initialize_cfun (new_decl, old_decl, | |
0d63a740 | 5148 | old_entry_block->count); |
1755aad0 RG |
5149 | DECL_STRUCT_FUNCTION (new_decl)->gimple_df->ipa_pta |
5150 | = id.src_cfun->gimple_df->ipa_pta; | |
110cfe1c | 5151 | push_cfun (DECL_STRUCT_FUNCTION (new_decl)); |
b8698a0f | 5152 | |
19734dd8 RL |
5153 | /* Copy the function's static chain. */ |
5154 | p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl; | |
5155 | if (p) | |
5156 | DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl = | |
5157 | copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl, | |
5158 | &id); | |
b8698a0f | 5159 | |
19734dd8 RL |
5160 | /* If there's a tree_map, prepare for substitution. */ |
5161 | if (tree_map) | |
9187e02d | 5162 | for (i = 0; i < VEC_length (ipa_replace_map_p, tree_map); i++) |
19734dd8 | 5163 | { |
0f1961a2 | 5164 | gimple init; |
9187e02d | 5165 | replace_info = VEC_index (ipa_replace_map_p, tree_map, i); |
1b369fae | 5166 | if (replace_info->replace_p) |
00fc2333 | 5167 | { |
657c0925 | 5168 | tree op = replace_info->new_tree; |
922f15c2 JH |
5169 | if (!replace_info->old_tree) |
5170 | { | |
5171 | int i = replace_info->parm_num; | |
5172 | tree parm; | |
5173 | for (parm = DECL_ARGUMENTS (old_decl); i; parm = TREE_CHAIN (parm)) | |
5174 | i --; | |
5175 | replace_info->old_tree = parm; | |
5176 | } | |
5177 | ||
657c0925 JH |
5178 | |
5179 | STRIP_NOPS (op); | |
5180 | ||
5181 | if (TREE_CODE (op) == VIEW_CONVERT_EXPR) | |
5182 | op = TREE_OPERAND (op, 0); | |
b8698a0f | 5183 | |
657c0925 | 5184 | if (TREE_CODE (op) == ADDR_EXPR) |
00fc2333 | 5185 | { |
657c0925 | 5186 | op = TREE_OPERAND (op, 0); |
00fc2333 JH |
5187 | while (handled_component_p (op)) |
5188 | op = TREE_OPERAND (op, 0); | |
5189 | if (TREE_CODE (op) == VAR_DECL) | |
5190 | add_referenced_var (op); | |
5191 | } | |
0f1961a2 JH |
5192 | gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL); |
5193 | init = setup_one_parameter (&id, replace_info->old_tree, | |
5194 | replace_info->new_tree, id.src_fn, | |
5195 | NULL, | |
5196 | &vars); | |
5197 | if (init) | |
5198 | VEC_safe_push (gimple, heap, init_stmts, init); | |
00fc2333 | 5199 | } |
19734dd8 | 5200 | } |
eb50f5f4 JH |
5201 | /* Copy the function's arguments. */ |
5202 | if (DECL_ARGUMENTS (old_decl) != NULL_TREE) | |
5203 | DECL_ARGUMENTS (new_decl) = | |
5204 | copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id, | |
5205 | args_to_skip, &vars); | |
b8698a0f | 5206 | |
eb50f5f4 | 5207 | DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id); |
b8698a0f | 5208 | |
eb50f5f4 JH |
5209 | /* Renumber the lexical scoping (non-code) blocks consecutively. */ |
5210 | number_blocks (id.dst_fn); | |
b8698a0f | 5211 | |
0f1961a2 | 5212 | declare_inline_vars (DECL_INITIAL (new_decl), vars); |
9187e02d | 5213 | |
c021f10b | 5214 | if (!VEC_empty (tree, DECL_STRUCT_FUNCTION (old_decl)->local_decls)) |
19734dd8 | 5215 | /* Add local vars. */ |
c021f10b | 5216 | add_local_variables (DECL_STRUCT_FUNCTION (old_decl), cfun, &id, false); |
b8698a0f | 5217 | |
19734dd8 | 5218 | /* Copy the Function's body. */ |
0d63a740 | 5219 | copy_body (&id, old_entry_block->count, REG_BR_PROB_BASE, |
91382288 | 5220 | ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, blocks_to_copy, new_entry); |
b8698a0f | 5221 | |
19734dd8 RL |
5222 | if (DECL_RESULT (old_decl) != NULL_TREE) |
5223 | { | |
5224 | tree *res_decl = &DECL_RESULT (old_decl); | |
5225 | DECL_RESULT (new_decl) = remap_decl (*res_decl, &id); | |
5226 | lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl)); | |
5227 | } | |
b8698a0f | 5228 | |
19734dd8 RL |
5229 | /* Renumber the lexical scoping (non-code) blocks consecutively. */ |
5230 | number_blocks (new_decl); | |
5231 | ||
b5b8b0ac AO |
5232 | /* We want to create the BB unconditionally, so that the addition of |
5233 | debug stmts doesn't affect BB count, which may in the end cause | |
5234 | codegen differences. */ | |
5235 | bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR)); | |
5236 | while (VEC_length (gimple, init_stmts)) | |
5237 | insert_init_stmt (&id, bb, VEC_pop (gimple, init_stmts)); | |
08ad1d6d | 5238 | update_clone_info (&id); |
0f1961a2 | 5239 | |
27dbd3ac RH |
5240 | /* Remap the nonlocal_goto_save_area, if any. */ |
5241 | if (cfun->nonlocal_goto_save_area) | |
5242 | { | |
5243 | struct walk_stmt_info wi; | |
5244 | ||
5245 | memset (&wi, 0, sizeof (wi)); | |
5246 | wi.info = &id; | |
5247 | walk_tree (&cfun->nonlocal_goto_save_area, remap_gimple_op_r, &wi, NULL); | |
5248 | } | |
5249 | ||
19734dd8 | 5250 | /* Clean up. */ |
6be42dd4 | 5251 | pointer_map_destroy (id.decl_map); |
b5b8b0ac AO |
5252 | if (id.debug_map) |
5253 | pointer_map_destroy (id.debug_map); | |
5006671f RG |
5254 | free_dominance_info (CDI_DOMINATORS); |
5255 | free_dominance_info (CDI_POST_DOMINATORS); | |
9187e02d JH |
5256 | |
5257 | fold_marked_statements (0, id.statements_to_fold); | |
5258 | pointer_set_destroy (id.statements_to_fold); | |
5259 | fold_cond_expr_cond (); | |
5260 | delete_unreachable_blocks_update_callgraph (&id); | |
99b766fc JH |
5261 | if (id.dst_node->analyzed) |
5262 | cgraph_rebuild_references (); | |
9187e02d | 5263 | update_ssa (TODO_update_ssa); |
b35366ce JH |
5264 | |
5265 | /* After partial cloning we need to rescale frequencies, so they are | |
5266 | within proper range in the cloned function. */ | |
5267 | if (new_entry) | |
5268 | { | |
5269 | struct cgraph_edge *e; | |
5270 | rebuild_frequencies (); | |
5271 | ||
5272 | new_version_node->count = ENTRY_BLOCK_PTR->count; | |
5273 | for (e = new_version_node->callees; e; e = e->next_callee) | |
5274 | { | |
5275 | basic_block bb = gimple_bb (e->call_stmt); | |
5276 | e->frequency = compute_call_stmt_bb_frequency (current_function_decl, bb); | |
5277 | e->count = bb->count; | |
5278 | } | |
5279 | } | |
5280 | ||
9187e02d JH |
5281 | free_dominance_info (CDI_DOMINATORS); |
5282 | free_dominance_info (CDI_POST_DOMINATORS); | |
5283 | ||
b5b8b0ac | 5284 | gcc_assert (!id.debug_stmts); |
0f1961a2 | 5285 | VEC_free (gimple, heap, init_stmts); |
110cfe1c | 5286 | pop_cfun (); |
873aa8f5 JH |
5287 | current_function_decl = old_current_function_decl; |
5288 | gcc_assert (!current_function_decl | |
5289 | || DECL_STRUCT_FUNCTION (current_function_decl) == cfun); | |
19734dd8 RL |
5290 | return; |
5291 | } | |
5292 | ||
f82a627c EB |
5293 | /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate |
5294 | the callee and return the inlined body on success. */ | |
5295 | ||
5296 | tree | |
5297 | maybe_inline_call_in_expr (tree exp) | |
5298 | { | |
5299 | tree fn = get_callee_fndecl (exp); | |
5300 | ||
5301 | /* We can only try to inline "const" functions. */ | |
5302 | if (fn && TREE_READONLY (fn) && DECL_SAVED_TREE (fn)) | |
5303 | { | |
5304 | struct pointer_map_t *decl_map = pointer_map_create (); | |
5305 | call_expr_arg_iterator iter; | |
5306 | copy_body_data id; | |
5307 | tree param, arg, t; | |
5308 | ||
5309 | /* Remap the parameters. */ | |
5310 | for (param = DECL_ARGUMENTS (fn), arg = first_call_expr_arg (exp, &iter); | |
5311 | param; | |
5312 | param = TREE_CHAIN (param), arg = next_call_expr_arg (&iter)) | |
5313 | *pointer_map_insert (decl_map, param) = arg; | |
5314 | ||
5315 | memset (&id, 0, sizeof (id)); | |
5316 | id.src_fn = fn; | |
5317 | id.dst_fn = current_function_decl; | |
5318 | id.src_cfun = DECL_STRUCT_FUNCTION (fn); | |
5319 | id.decl_map = decl_map; | |
5320 | ||
5321 | id.copy_decl = copy_decl_no_change; | |
5322 | id.transform_call_graph_edges = CB_CGE_DUPLICATE; | |
5323 | id.transform_new_cfg = false; | |
5324 | id.transform_return_to_modify = true; | |
5325 | id.transform_lang_insert_block = false; | |
5326 | ||
5327 | /* Make sure not to unshare trees behind the front-end's back | |
5328 | since front-end specific mechanisms may rely on sharing. */ | |
5329 | id.regimplify = false; | |
5330 | id.do_not_unshare = true; | |
5331 | ||
5332 | /* We're not inside any EH region. */ | |
1d65f45c | 5333 | id.eh_lp_nr = 0; |
f82a627c EB |
5334 | |
5335 | t = copy_tree_body (&id); | |
5336 | pointer_map_destroy (decl_map); | |
5337 | ||
5338 | /* We can only return something suitable for use in a GENERIC | |
5339 | expression tree. */ | |
5340 | if (TREE_CODE (t) == MODIFY_EXPR) | |
5341 | return TREE_OPERAND (t, 1); | |
5342 | } | |
5343 | ||
5344 | return NULL_TREE; | |
5345 | } | |
5346 | ||
52dd234b RH |
5347 | /* Duplicate a type, fields and all. */ |
5348 | ||
5349 | tree | |
5350 | build_duplicate_type (tree type) | |
5351 | { | |
1b369fae | 5352 | struct copy_body_data id; |
52dd234b RH |
5353 | |
5354 | memset (&id, 0, sizeof (id)); | |
1b369fae RH |
5355 | id.src_fn = current_function_decl; |
5356 | id.dst_fn = current_function_decl; | |
5357 | id.src_cfun = cfun; | |
6be42dd4 | 5358 | id.decl_map = pointer_map_create (); |
b5b8b0ac | 5359 | id.debug_map = NULL; |
4009f2e7 | 5360 | id.copy_decl = copy_decl_no_change; |
52dd234b RH |
5361 | |
5362 | type = remap_type_1 (type, &id); | |
5363 | ||
6be42dd4 | 5364 | pointer_map_destroy (id.decl_map); |
b5b8b0ac AO |
5365 | if (id.debug_map) |
5366 | pointer_map_destroy (id.debug_map); | |
52dd234b | 5367 | |
f31c9f09 DG |
5368 | TYPE_CANONICAL (type) = type; |
5369 | ||
52dd234b RH |
5370 | return type; |
5371 | } | |
ab442df7 MM |
5372 | |
5373 | /* Return whether it is safe to inline a function because it used different | |
6eb29714 XDL |
5374 | target specific options or call site actual types mismatch parameter types. |
5375 | E is the call edge to be checked. */ | |
ab442df7 | 5376 | bool |
6eb29714 | 5377 | tree_can_inline_p (struct cgraph_edge *e) |
ab442df7 | 5378 | { |
5779e713 MM |
5379 | #if 0 |
5380 | /* This causes a regression in SPEC in that it prevents a cold function from | |
5381 | inlining a hot function. Perhaps this should only apply to functions | |
5382 | that the user declares hot/cold/optimize explicitly. */ | |
5383 | ||
ab442df7 MM |
5384 | /* Don't inline a function with a higher optimization level than the |
5385 | caller, or with different space constraints (hot/cold functions). */ | |
5386 | tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller); | |
5387 | tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee); | |
5388 | ||
5389 | if (caller_tree != callee_tree) | |
5390 | { | |
5391 | struct cl_optimization *caller_opt | |
5392 | = TREE_OPTIMIZATION ((caller_tree) | |
5393 | ? caller_tree | |
5394 | : optimization_default_node); | |
5395 | ||
5396 | struct cl_optimization *callee_opt | |
5397 | = TREE_OPTIMIZATION ((callee_tree) | |
5398 | ? callee_tree | |
5399 | : optimization_default_node); | |
5400 | ||
5401 | if ((caller_opt->optimize > callee_opt->optimize) | |
5402 | || (caller_opt->optimize_size != callee_opt->optimize_size)) | |
5403 | return false; | |
5404 | } | |
5779e713 | 5405 | #endif |
8fd8a06f | 5406 | tree caller, callee, lhs; |
6eb29714 XDL |
5407 | |
5408 | caller = e->caller->decl; | |
5409 | callee = e->callee->decl; | |
ab442df7 | 5410 | |
8f4f502f EB |
5411 | /* First check that inlining isn't simply forbidden in this case. */ |
5412 | if (inline_forbidden_into_p (caller, callee)) | |
f9417da1 RG |
5413 | { |
5414 | e->inline_failed = CIF_UNSPECIFIED; | |
5415 | gimple_call_set_cannot_inline (e->call_stmt, true); | |
5416 | return false; | |
5417 | } | |
5418 | ||
ab442df7 | 5419 | /* Allow the backend to decide if inlining is ok. */ |
6eb29714 XDL |
5420 | if (!targetm.target_option.can_inline_p (caller, callee)) |
5421 | { | |
5422 | e->inline_failed = CIF_TARGET_OPTION_MISMATCH; | |
5423 | gimple_call_set_cannot_inline (e->call_stmt, true); | |
d7f09764 | 5424 | e->call_stmt_cannot_inline_p = true; |
6eb29714 XDL |
5425 | return false; |
5426 | } | |
5427 | ||
8fd8a06f RG |
5428 | /* Do not inline calls where we cannot triviall work around mismatches |
5429 | in argument or return types. */ | |
d7f09764 | 5430 | if (e->call_stmt |
8fd8a06f RG |
5431 | && ((DECL_RESULT (callee) |
5432 | && !DECL_BY_REFERENCE (DECL_RESULT (callee)) | |
5433 | && (lhs = gimple_call_lhs (e->call_stmt)) != NULL_TREE | |
5434 | && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee)), | |
5435 | TREE_TYPE (lhs)) | |
5436 | && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee)), lhs)) | |
5437 | || !gimple_check_call_args (e->call_stmt))) | |
6eb29714 XDL |
5438 | { |
5439 | e->inline_failed = CIF_MISMATCHED_ARGUMENTS; | |
5440 | gimple_call_set_cannot_inline (e->call_stmt, true); | |
d7f09764 | 5441 | e->call_stmt_cannot_inline_p = true; |
6eb29714 XDL |
5442 | return false; |
5443 | } | |
5444 | ||
5445 | return true; | |
ab442df7 | 5446 | } |