2 Copyright (C) 2001-2016 Free Software Foundation, Inc.
3 Contributed by Alexandre Oliva <aoliva@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
30 #include "tree-pass.h"
33 #include "tree-pretty-print.h"
34 #include "diagnostic-core.h"
35 #include "gimple-predict.h"
36 #include "fold-const.h"
37 #include "stor-layout.h"
39 #include "tree-inline.h"
40 #include "langhooks.h"
42 #include "tree-iterator.h"
44 #include "gimple-fold.h"
47 #include "gimple-iterator.h"
48 #include "gimplify-me.h"
49 #include "gimple-walk.h"
51 #include "tree-into-ssa.h"
56 #include "value-prof.h"
59 #include "tree-chkp.h"
62 /* I'm not real happy about this, but we need to handle gimple and
65 /* Inlining, Cloning, Versioning, Parallelization
67 Inlining: a function body is duplicated, but the PARM_DECLs are
68 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
69 MODIFY_EXPRs that store to a dedicated returned-value variable.
70 The duplicated eh_region info of the copy will later be appended
71 to the info for the caller; the eh_region info in copied throwing
72 statements and RESX statements are adjusted accordingly.
74 Cloning: (only in C++) We have one body for a con/de/structor, and
75 multiple function decls, each with a unique parameter list.
76 Duplicate the body, using the given splay tree; some parameters
77 will become constants (like 0 or 1).
79 Versioning: a function body is duplicated and the result is a new
80 function rather than into blocks of an existing function as with
81 inlining. Some parameters will become constants.
83 Parallelization: a region of a function is duplicated resulting in
84 a new function. Variables may be replaced with complex expressions
85 to enable shared variable semantics.
87 All of these will simultaneously lookup any callgraph edges. If
88 we're going to inline the duplicated function body, and the given
89 function has some cloned callgraph nodes (one for each place this
90 function will be inlined) those callgraph edges will be duplicated.
91 If we're cloning the body, those callgraph edges will be
92 updated to point into the new body. (Note that the original
93 callgraph node and edge list will not be altered.)
95 See the CALL_EXPR handling case in copy_tree_body_r (). */
99 o In order to make inlining-on-trees work, we pessimized
100 function-local static constants. In particular, they are now
101 always output, even when not addressed. Fix this by treating
102 function-local static constants just like global static
103 constants; the back-end already knows not to output them if they
106 o Provide heuristics to clamp inlining of recursive template
110 /* Weights that estimate_num_insns uses to estimate the size of the
113 eni_weights eni_size_weights
;
115 /* Weights that estimate_num_insns uses to estimate the time necessary
116 to execute the produced code. */
118 eni_weights eni_time_weights
;
122 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, tree
,
124 static void remap_block (tree
*, copy_body_data
*);
125 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
126 static void declare_inline_vars (tree
, tree
);
127 static void remap_save_expr (tree
*, hash_map
<tree
, tree
> *, int *);
128 static void prepend_lexical_block (tree current_block
, tree new_block
);
129 static tree
copy_decl_to_var (tree
, copy_body_data
*);
130 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
131 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
132 static gimple_seq
remap_gimple_stmt (gimple
*, copy_body_data
*);
133 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
134 static void insert_init_stmt (copy_body_data
*, basic_block
, gimple
*);
136 /* Insert a tree->tree mapping for ID. Despite the name suggests
137 that the trees should be variables, it is used for more than that. */
140 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
142 id
->decl_map
->put (key
, value
);
144 /* Always insert an identity map as well. If we see this same new
145 node again, we won't want to duplicate it a second time. */
147 id
->decl_map
->put (value
, value
);
150 /* Insert a tree->tree mapping for ID. This is only used for
154 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
156 if (!gimple_in_ssa_p (id
->src_cfun
))
159 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
162 if (!target_for_debug_bind (key
))
165 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
166 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
169 id
->debug_map
= new hash_map
<tree
, tree
>;
171 id
->debug_map
->put (key
, value
);
174 /* If nonzero, we're remapping the contents of inlined debug
175 statements. If negative, an error has occurred, such as a
176 reference to a variable that isn't available in the inlined
178 static int processing_debug_stmt
= 0;
180 /* Construct new SSA name for old NAME. ID is the inline context. */
183 remap_ssa_name (tree name
, copy_body_data
*id
)
188 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
190 n
= id
->decl_map
->get (name
);
192 return unshare_expr (*n
);
194 if (processing_debug_stmt
)
196 if (SSA_NAME_IS_DEFAULT_DEF (name
)
197 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
198 && id
->entry_bb
== NULL
199 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
201 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
203 gimple_stmt_iterator gsi
;
204 tree val
= SSA_NAME_VAR (name
);
206 n
= id
->decl_map
->get (val
);
209 if (TREE_CODE (val
) != PARM_DECL
)
211 processing_debug_stmt
= -1;
214 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
215 DECL_ARTIFICIAL (vexpr
) = 1;
216 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
217 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
218 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
219 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
223 processing_debug_stmt
= -1;
227 /* Remap anonymous SSA names or SSA names of anonymous decls. */
228 var
= SSA_NAME_VAR (name
);
230 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
231 && TREE_CODE (var
) == VAR_DECL
232 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
233 && DECL_ARTIFICIAL (var
)
234 && DECL_IGNORED_P (var
)
235 && !DECL_NAME (var
)))
237 struct ptr_info_def
*pi
;
238 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
));
239 if (!var
&& SSA_NAME_IDENTIFIER (name
))
240 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
241 insert_decl_map (id
, name
, new_tree
);
242 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
243 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
244 /* At least IPA points-to info can be directly transferred. */
245 if (id
->src_cfun
->gimple_df
246 && id
->src_cfun
->gimple_df
->ipa_pta
247 && (pi
= SSA_NAME_PTR_INFO (name
))
250 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
256 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
258 new_tree
= remap_decl (var
, id
);
260 /* We might've substituted constant or another SSA_NAME for
263 Replace the SSA name representing RESULT_DECL by variable during
264 inlining: this saves us from need to introduce PHI node in a case
265 return value is just partly initialized. */
266 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
267 && (!SSA_NAME_VAR (name
)
268 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
269 || !id
->transform_return_to_modify
))
271 struct ptr_info_def
*pi
;
272 new_tree
= make_ssa_name (new_tree
);
273 insert_decl_map (id
, name
, new_tree
);
274 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
275 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
276 /* At least IPA points-to info can be directly transferred. */
277 if (id
->src_cfun
->gimple_df
278 && id
->src_cfun
->gimple_df
->ipa_pta
279 && (pi
= SSA_NAME_PTR_INFO (name
))
282 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
285 if (SSA_NAME_IS_DEFAULT_DEF (name
))
287 /* By inlining function having uninitialized variable, we might
288 extend the lifetime (variable might get reused). This cause
289 ICE in the case we end up extending lifetime of SSA name across
290 abnormal edge, but also increase register pressure.
292 We simply initialize all uninitialized vars by 0 except
293 for case we are inlining to very first BB. We can avoid
294 this for all BBs that are not inside strongly connected
295 regions of the CFG, but this is expensive to test. */
297 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
298 && (!SSA_NAME_VAR (name
)
299 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
300 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
302 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
304 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
306 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
308 init_stmt
= gimple_build_assign (new_tree
, zero
);
309 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
310 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
314 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
315 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
320 insert_decl_map (id
, name
, new_tree
);
324 /* Remap DECL during the copying of the BLOCK tree for the function. */
327 remap_decl (tree decl
, copy_body_data
*id
)
331 /* We only remap local variables in the current function. */
333 /* See if we have remapped this declaration. */
335 n
= id
->decl_map
->get (decl
);
337 if (!n
&& processing_debug_stmt
)
339 processing_debug_stmt
= -1;
343 /* When remapping a type within copy_gimple_seq_and_replace_locals, all
344 necessary DECLs have already been remapped and we do not want to duplicate
345 a decl coming from outside of the sequence we are copying. */
347 && id
->prevent_decl_creation_for_types
348 && id
->remapping_type_depth
> 0
349 && (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
))
352 /* If we didn't already have an equivalent for this declaration, create one
356 /* Make a copy of the variable or label. */
357 tree t
= id
->copy_decl (decl
, id
);
359 /* Remember it, so that if we encounter this local entity again
360 we can reuse this copy. Do this early because remap_type may
361 need this decl for TYPE_STUB_DECL. */
362 insert_decl_map (id
, decl
, t
);
367 /* Remap types, if necessary. */
368 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
369 if (TREE_CODE (t
) == TYPE_DECL
)
370 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
372 /* Remap sizes as necessary. */
373 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
374 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
376 /* If fields, do likewise for offset and qualifier. */
377 if (TREE_CODE (t
) == FIELD_DECL
)
379 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
380 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
381 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
387 if (id
->do_not_unshare
)
390 return unshare_expr (*n
);
394 remap_type_1 (tree type
, copy_body_data
*id
)
398 /* We do need a copy. build and register it now. If this is a pointer or
399 reference type, remap the designated type and make a new pointer or
401 if (TREE_CODE (type
) == POINTER_TYPE
)
403 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
405 TYPE_REF_CAN_ALIAS_ALL (type
));
406 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
407 new_tree
= build_type_attribute_qual_variant (new_tree
,
408 TYPE_ATTRIBUTES (type
),
410 insert_decl_map (id
, type
, new_tree
);
413 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
415 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
417 TYPE_REF_CAN_ALIAS_ALL (type
));
418 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
419 new_tree
= build_type_attribute_qual_variant (new_tree
,
420 TYPE_ATTRIBUTES (type
),
422 insert_decl_map (id
, type
, new_tree
);
426 new_tree
= copy_node (type
);
428 insert_decl_map (id
, type
, new_tree
);
430 /* This is a new type, not a copy of an old type. Need to reassociate
431 variants. We can handle everything except the main variant lazily. */
432 t
= TYPE_MAIN_VARIANT (type
);
435 t
= remap_type (t
, id
);
436 TYPE_MAIN_VARIANT (new_tree
) = t
;
437 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
438 TYPE_NEXT_VARIANT (t
) = new_tree
;
442 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
443 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
446 if (TYPE_STUB_DECL (type
))
447 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
449 /* Lazily create pointer and reference types. */
450 TYPE_POINTER_TO (new_tree
) = NULL
;
451 TYPE_REFERENCE_TO (new_tree
) = NULL
;
453 /* Copy all types that may contain references to local variables; be sure to
454 preserve sharing in between type and its main variant when possible. */
455 switch (TREE_CODE (new_tree
))
459 case FIXED_POINT_TYPE
:
462 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
464 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
465 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
467 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
468 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
472 t
= TYPE_MIN_VALUE (new_tree
);
473 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
474 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
476 t
= TYPE_MAX_VALUE (new_tree
);
477 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
478 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
483 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
484 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
485 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
487 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
488 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
489 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
490 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
492 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
496 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
497 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
498 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
500 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
502 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
504 gcc_checking_assert (TYPE_DOMAIN (type
) == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
505 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
508 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
513 case QUAL_UNION_TYPE
:
514 if (TYPE_MAIN_VARIANT (type
) != type
515 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
516 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
521 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
523 t
= remap_decl (f
, id
);
524 DECL_CONTEXT (t
) = new_tree
;
528 TYPE_FIELDS (new_tree
) = nreverse (nf
);
534 /* Shouldn't have been thought variable sized. */
538 /* All variants of type share the same size, so use the already remaped data. */
539 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
541 gcc_checking_assert (TYPE_SIZE (type
) == TYPE_SIZE (TYPE_MAIN_VARIANT (type
)));
542 gcc_checking_assert (TYPE_SIZE_UNIT (type
) == TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
)));
544 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
545 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
549 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
550 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
557 remap_type (tree type
, copy_body_data
*id
)
565 /* See if we have remapped this type. */
566 node
= id
->decl_map
->get (type
);
570 /* The type only needs remapping if it's variably modified. */
571 if (! variably_modified_type_p (type
, id
->src_fn
))
573 insert_decl_map (id
, type
, type
);
577 id
->remapping_type_depth
++;
578 tmp
= remap_type_1 (type
, id
);
579 id
->remapping_type_depth
--;
584 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
587 can_be_nonlocal (tree decl
, copy_body_data
*id
)
589 /* We can not duplicate function decls. */
590 if (TREE_CODE (decl
) == FUNCTION_DECL
)
593 /* Local static vars must be non-local or we get multiple declaration
595 if (TREE_CODE (decl
) == VAR_DECL
596 && !auto_var_in_fn_p (decl
, id
->src_fn
))
603 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
607 tree new_decls
= NULL_TREE
;
609 /* Remap its variables. */
610 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
614 if (can_be_nonlocal (old_var
, id
))
616 /* We need to add this variable to the local decls as otherwise
617 nothing else will do so. */
618 if (TREE_CODE (old_var
) == VAR_DECL
619 && ! DECL_EXTERNAL (old_var
))
620 add_local_decl (cfun
, old_var
);
621 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
622 && !DECL_IGNORED_P (old_var
)
623 && nonlocalized_list
)
624 vec_safe_push (*nonlocalized_list
, old_var
);
628 /* Remap the variable. */
629 new_var
= remap_decl (old_var
, id
);
631 /* If we didn't remap this variable, we can't mess with its
632 TREE_CHAIN. If we remapped this variable to the return slot, it's
633 already declared somewhere else, so don't declare it here. */
635 if (new_var
== id
->retvar
)
639 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
640 && !DECL_IGNORED_P (old_var
)
641 && nonlocalized_list
)
642 vec_safe_push (*nonlocalized_list
, old_var
);
646 gcc_assert (DECL_P (new_var
));
647 DECL_CHAIN (new_var
) = new_decls
;
650 /* Also copy value-expressions. */
651 if (TREE_CODE (new_var
) == VAR_DECL
652 && DECL_HAS_VALUE_EXPR_P (new_var
))
654 tree tem
= DECL_VALUE_EXPR (new_var
);
655 bool old_regimplify
= id
->regimplify
;
656 id
->remapping_type_depth
++;
657 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
658 id
->remapping_type_depth
--;
659 id
->regimplify
= old_regimplify
;
660 SET_DECL_VALUE_EXPR (new_var
, tem
);
665 return nreverse (new_decls
);
668 /* Copy the BLOCK to contain remapped versions of the variables
669 therein. And hook the new block into the block-tree. */
672 remap_block (tree
*block
, copy_body_data
*id
)
677 /* Make the new block. */
679 new_block
= make_node (BLOCK
);
680 TREE_USED (new_block
) = TREE_USED (old_block
);
681 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
682 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
683 BLOCK_NONLOCALIZED_VARS (new_block
)
684 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
687 /* Remap its variables. */
688 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
689 &BLOCK_NONLOCALIZED_VARS (new_block
),
692 if (id
->transform_lang_insert_block
)
693 id
->transform_lang_insert_block (new_block
);
695 /* Remember the remapped block. */
696 insert_decl_map (id
, old_block
, new_block
);
699 /* Copy the whole block tree and root it in id->block. */
701 remap_blocks (tree block
, copy_body_data
*id
)
704 tree new_tree
= block
;
709 remap_block (&new_tree
, id
);
710 gcc_assert (new_tree
!= block
);
711 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
712 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
713 /* Blocks are in arbitrary order, but make things slightly prettier and do
714 not swap order when producing a copy. */
715 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
719 /* Remap the block tree rooted at BLOCK to nothing. */
721 remap_blocks_to_null (tree block
, copy_body_data
*id
)
724 insert_decl_map (id
, block
, NULL_TREE
);
725 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
726 remap_blocks_to_null (t
, id
);
730 copy_statement_list (tree
*tp
)
732 tree_stmt_iterator oi
, ni
;
735 new_tree
= alloc_stmt_list ();
736 ni
= tsi_start (new_tree
);
737 oi
= tsi_start (*tp
);
738 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
741 for (; !tsi_end_p (oi
); tsi_next (&oi
))
743 tree stmt
= tsi_stmt (oi
);
744 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
745 /* This copy is not redundant; tsi_link_after will smash this
746 STATEMENT_LIST into the end of the one we're building, and we
747 don't want to do that with the original. */
748 copy_statement_list (&stmt
);
749 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
754 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
756 tree block
= BIND_EXPR_BLOCK (*tp
);
757 /* Copy (and replace) the statement. */
758 copy_tree_r (tp
, walk_subtrees
, NULL
);
761 remap_block (&block
, id
);
762 BIND_EXPR_BLOCK (*tp
) = block
;
765 if (BIND_EXPR_VARS (*tp
))
766 /* This will remap a lot of the same decls again, but this should be
768 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
772 /* Create a new gimple_seq by remapping all the statements in BODY
773 using the inlining information in ID. */
776 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
778 gimple_stmt_iterator si
;
779 gimple_seq new_body
= NULL
;
781 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
783 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
784 gimple_seq_add_seq (&new_body
, new_stmts
);
791 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
792 block using the mapping information in ID. */
795 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
798 tree new_block
, new_vars
;
799 gimple_seq body
, new_body
;
801 /* Copy the statement. Note that we purposely don't use copy_stmt
802 here because we need to remap statements as we copy. */
803 body
= gimple_bind_body (stmt
);
804 new_body
= remap_gimple_seq (body
, id
);
806 new_block
= gimple_bind_block (stmt
);
808 remap_block (&new_block
, id
);
810 /* This will remap a lot of the same decls again, but this should be
812 new_vars
= gimple_bind_vars (stmt
);
814 new_vars
= remap_decls (new_vars
, NULL
, id
);
816 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
821 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
826 if (TREE_CODE (decl
) == SSA_NAME
)
828 decl
= SSA_NAME_VAR (decl
);
833 return (TREE_CODE (decl
) == PARM_DECL
);
836 /* Remap the dependence CLIQUE from the source to the destination function
837 as specified in ID. */
839 static unsigned short
840 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
844 if (!id
->dependence_map
)
845 id
->dependence_map
= new hash_map
<dependence_hash
, unsigned short>;
847 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
849 newc
= ++cfun
->last_clique
;
853 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
854 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
855 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
856 recursing into the children nodes of *TP. */
859 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
861 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
862 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
863 tree fn
= id
->src_fn
;
865 if (TREE_CODE (*tp
) == SSA_NAME
)
867 *tp
= remap_ssa_name (*tp
, id
);
871 else if (auto_var_in_fn_p (*tp
, fn
))
873 /* Local variables and labels need to be replaced by equivalent
874 variables. We don't want to copy static variables; there's
875 only one of those, no matter how many times we inline the
876 containing function. Similarly for globals from an outer
880 /* Remap the declaration. */
881 new_decl
= remap_decl (*tp
, id
);
882 gcc_assert (new_decl
);
883 /* Replace this variable with the copy. */
884 STRIP_TYPE_NOPS (new_decl
);
885 /* ??? The C++ frontend uses void * pointer zero to initialize
886 any other type. This confuses the middle-end type verification.
887 As cloned bodies do not go through gimplification again the fixup
888 there doesn't trigger. */
889 if (TREE_CODE (new_decl
) == INTEGER_CST
890 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
891 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
895 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
897 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
899 else if (TREE_CODE (*tp
) == LABEL_DECL
900 && (!DECL_CONTEXT (*tp
)
901 || decl_function_context (*tp
) == id
->src_fn
))
902 /* These may need to be remapped for EH handling. */
903 *tp
= remap_decl (*tp
, id
);
904 else if (TREE_CODE (*tp
) == FIELD_DECL
)
906 /* If the enclosing record type is variably_modified_type_p, the field
907 has already been remapped. Otherwise, it need not be. */
908 tree
*n
= id
->decl_map
->get (*tp
);
913 else if (TYPE_P (*tp
))
914 /* Types may need remapping as well. */
915 *tp
= remap_type (*tp
, id
);
916 else if (CONSTANT_CLASS_P (*tp
))
918 /* If this is a constant, we have to copy the node iff the type
919 will be remapped. copy_tree_r will not copy a constant. */
920 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
922 if (new_type
== TREE_TYPE (*tp
))
925 else if (TREE_CODE (*tp
) == INTEGER_CST
)
926 *tp
= wide_int_to_tree (new_type
, *tp
);
929 *tp
= copy_node (*tp
);
930 TREE_TYPE (*tp
) = new_type
;
935 /* Otherwise, just copy the node. Note that copy_tree_r already
936 knows not to copy VAR_DECLs, etc., so this is safe. */
938 if (TREE_CODE (*tp
) == MEM_REF
)
940 /* We need to re-canonicalize MEM_REFs from inline substitutions
941 that can happen when a pointer argument is an ADDR_EXPR.
942 Recurse here manually to allow that. */
943 tree ptr
= TREE_OPERAND (*tp
, 0);
944 tree type
= remap_type (TREE_TYPE (*tp
), id
);
946 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
947 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
948 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
949 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
950 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
951 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
953 MR_DEPENDENCE_CLIQUE (*tp
)
954 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
955 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
957 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
958 remapped a parameter as the property might be valid only
959 for the parameter itself. */
960 if (TREE_THIS_NOTRAP (old
)
961 && (!is_parm (TREE_OPERAND (old
, 0))
962 || (!id
->transform_parameter
&& is_parm (ptr
))))
963 TREE_THIS_NOTRAP (*tp
) = 1;
964 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
969 /* Here is the "usual case". Copy this tree node, and then
970 tweak some special cases. */
971 copy_tree_r (tp
, walk_subtrees
, NULL
);
973 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
974 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
976 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
978 /* The copied TARGET_EXPR has never been expanded, even if the
979 original node was expanded already. */
980 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
981 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
983 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
985 /* Variable substitution need not be simple. In particular,
986 the MEM_REF substitution above. Make sure that
987 TREE_CONSTANT and friends are up-to-date. */
988 int invariant
= is_gimple_min_invariant (*tp
);
989 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
990 recompute_tree_invariant_for_addr_expr (*tp
);
992 /* If this used to be invariant, but is not any longer,
993 then regimplification is probably needed. */
994 if (invariant
&& !is_gimple_min_invariant (*tp
))
995 id
->regimplify
= true;
1001 /* Update the TREE_BLOCK for the cloned expr. */
1004 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1005 tree old_block
= TREE_BLOCK (*tp
);
1009 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1013 TREE_SET_BLOCK (*tp
, new_block
);
1016 /* Keep iterating. */
1021 /* Called from copy_body_id via walk_tree. DATA is really a
1022 `copy_body_data *'. */
1025 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1027 copy_body_data
*id
= (copy_body_data
*) data
;
1028 tree fn
= id
->src_fn
;
1031 /* Begin by recognizing trees that we'll completely rewrite for the
1032 inlining context. Our output for these trees is completely
1033 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1034 into an edge). Further down, we'll handle trees that get
1035 duplicated and/or tweaked. */
1037 /* When requested, RETURN_EXPRs should be transformed to just the
1038 contained MODIFY_EXPR. The branch semantics of the return will
1039 be handled elsewhere by manipulating the CFG rather than a statement. */
1040 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1042 tree assignment
= TREE_OPERAND (*tp
, 0);
1044 /* If we're returning something, just turn that into an
1045 assignment into the equivalent of the original RESULT_DECL.
1046 If the "assignment" is just the result decl, the result
1047 decl has already been set (e.g. a recent "foo (&result_decl,
1048 ...)"); just toss the entire RETURN_EXPR. */
1049 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1051 /* Replace the RETURN_EXPR with (a copy of) the
1052 MODIFY_EXPR hanging underneath. */
1053 *tp
= copy_node (assignment
);
1055 else /* Else the RETURN_EXPR returns no value. */
1058 return (tree
) (void *)1;
1061 else if (TREE_CODE (*tp
) == SSA_NAME
)
1063 *tp
= remap_ssa_name (*tp
, id
);
1068 /* Local variables and labels need to be replaced by equivalent
1069 variables. We don't want to copy static variables; there's only
1070 one of those, no matter how many times we inline the containing
1071 function. Similarly for globals from an outer function. */
1072 else if (auto_var_in_fn_p (*tp
, fn
))
1076 /* Remap the declaration. */
1077 new_decl
= remap_decl (*tp
, id
);
1078 gcc_assert (new_decl
);
1079 /* Replace this variable with the copy. */
1080 STRIP_TYPE_NOPS (new_decl
);
1084 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1085 copy_statement_list (tp
);
1086 else if (TREE_CODE (*tp
) == SAVE_EXPR
1087 || TREE_CODE (*tp
) == TARGET_EXPR
)
1088 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1089 else if (TREE_CODE (*tp
) == LABEL_DECL
1090 && (! DECL_CONTEXT (*tp
)
1091 || decl_function_context (*tp
) == id
->src_fn
))
1092 /* These may need to be remapped for EH handling. */
1093 *tp
= remap_decl (*tp
, id
);
1094 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1095 copy_bind_expr (tp
, walk_subtrees
, id
);
1096 /* Types may need remapping as well. */
1097 else if (TYPE_P (*tp
))
1098 *tp
= remap_type (*tp
, id
);
1100 /* If this is a constant, we have to copy the node iff the type will be
1101 remapped. copy_tree_r will not copy a constant. */
1102 else if (CONSTANT_CLASS_P (*tp
))
1104 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1106 if (new_type
== TREE_TYPE (*tp
))
1109 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1110 *tp
= wide_int_to_tree (new_type
, *tp
);
1113 *tp
= copy_node (*tp
);
1114 TREE_TYPE (*tp
) = new_type
;
1118 /* Otherwise, just copy the node. Note that copy_tree_r already
1119 knows not to copy VAR_DECLs, etc., so this is safe. */
1122 /* Here we handle trees that are not completely rewritten.
1123 First we detect some inlining-induced bogosities for
1125 if (TREE_CODE (*tp
) == MODIFY_EXPR
1126 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1127 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1129 /* Some assignments VAR = VAR; don't generate any rtl code
1130 and thus don't count as variable modification. Avoid
1131 keeping bogosities like 0 = 0. */
1132 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1135 n
= id
->decl_map
->get (decl
);
1139 STRIP_TYPE_NOPS (value
);
1140 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1142 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1143 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1147 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1149 /* Get rid of *& from inline substitutions that can happen when a
1150 pointer argument is an ADDR_EXPR. */
1151 tree decl
= TREE_OPERAND (*tp
, 0);
1152 tree
*n
= id
->decl_map
->get (decl
);
1155 /* If we happen to get an ADDR_EXPR in n->value, strip
1156 it manually here as we'll eventually get ADDR_EXPRs
1157 which lie about their types pointed to. In this case
1158 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1159 but we absolutely rely on that. As fold_indirect_ref
1160 does other useful transformations, try that first, though. */
1161 tree type
= TREE_TYPE (*tp
);
1162 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1164 *tp
= gimple_fold_indirect_ref (ptr
);
1167 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1170 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1171 /* ??? We should either assert here or build
1172 a VIEW_CONVERT_EXPR instead of blindly leaking
1173 incompatible types to our IL. */
1175 *tp
= TREE_OPERAND (ptr
, 0);
1179 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1180 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1181 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1182 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1183 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1184 have remapped a parameter as the property might be
1185 valid only for the parameter itself. */
1186 if (TREE_THIS_NOTRAP (old
)
1187 && (!is_parm (TREE_OPERAND (old
, 0))
1188 || (!id
->transform_parameter
&& is_parm (ptr
))))
1189 TREE_THIS_NOTRAP (*tp
) = 1;
1196 else if (TREE_CODE (*tp
) == MEM_REF
)
1198 /* We need to re-canonicalize MEM_REFs from inline substitutions
1199 that can happen when a pointer argument is an ADDR_EXPR.
1200 Recurse here manually to allow that. */
1201 tree ptr
= TREE_OPERAND (*tp
, 0);
1202 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1204 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1205 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1206 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1207 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1208 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1209 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1211 MR_DEPENDENCE_CLIQUE (*tp
)
1212 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1213 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1215 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1216 remapped a parameter as the property might be valid only
1217 for the parameter itself. */
1218 if (TREE_THIS_NOTRAP (old
)
1219 && (!is_parm (TREE_OPERAND (old
, 0))
1220 || (!id
->transform_parameter
&& is_parm (ptr
))))
1221 TREE_THIS_NOTRAP (*tp
) = 1;
1222 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1227 /* Here is the "usual case". Copy this tree node, and then
1228 tweak some special cases. */
1229 copy_tree_r (tp
, walk_subtrees
, NULL
);
1231 /* If EXPR has block defined, map it to newly constructed block.
1232 When inlining we want EXPRs without block appear in the block
1233 of function call if we are not remapping a type. */
1236 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1237 if (TREE_BLOCK (*tp
))
1240 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1244 TREE_SET_BLOCK (*tp
, new_block
);
1247 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1248 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1250 /* The copied TARGET_EXPR has never been expanded, even if the
1251 original node was expanded already. */
1252 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1254 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1255 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1258 /* Variable substitution need not be simple. In particular, the
1259 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1260 and friends are up-to-date. */
1261 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1263 int invariant
= is_gimple_min_invariant (*tp
);
1264 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1266 /* Handle the case where we substituted an INDIRECT_REF
1267 into the operand of the ADDR_EXPR. */
1268 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1269 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1271 recompute_tree_invariant_for_addr_expr (*tp
);
1273 /* If this used to be invariant, but is not any longer,
1274 then regimplification is probably needed. */
1275 if (invariant
&& !is_gimple_min_invariant (*tp
))
1276 id
->regimplify
= true;
1282 /* Keep iterating. */
1286 /* Helper for remap_gimple_stmt. Given an EH region number for the
1287 source function, map that to the duplicate EH region number in
1288 the destination function. */
1291 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1293 eh_region old_r
, new_r
;
1295 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1296 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1298 return new_r
->index
;
1301 /* Similar, but operate on INTEGER_CSTs. */
1304 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1308 old_nr
= tree_to_shwi (old_t_nr
);
1309 new_nr
= remap_eh_region_nr (old_nr
, id
);
1311 return build_int_cst (integer_type_node
, new_nr
);
1314 /* Helper for copy_bb. Remap statement STMT using the inlining
1315 information in ID. Return the new statement copy. */
1318 remap_gimple_stmt (gimple
*stmt
, copy_body_data
*id
)
1320 gimple
*copy
= NULL
;
1321 struct walk_stmt_info wi
;
1322 bool skip_first
= false;
1323 gimple_seq stmts
= NULL
;
1325 if (is_gimple_debug (stmt
)
1326 && !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
1329 /* Begin by recognizing trees that we'll completely rewrite for the
1330 inlining context. Our output for these trees is completely
1331 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1332 into an edge). Further down, we'll handle trees that get
1333 duplicated and/or tweaked. */
1335 /* When requested, GIMPLE_RETURNs should be transformed to just the
1336 contained GIMPLE_ASSIGN. The branch semantics of the return will
1337 be handled elsewhere by manipulating the CFG rather than the
1339 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1341 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1342 tree retbnd
= gimple_return_retbnd (stmt
);
1343 tree bndslot
= id
->retbnd
;
1345 if (retbnd
&& bndslot
)
1347 gimple
*bndcopy
= gimple_build_assign (bndslot
, retbnd
);
1348 memset (&wi
, 0, sizeof (wi
));
1350 walk_gimple_op (bndcopy
, remap_gimple_op_r
, &wi
);
1351 gimple_seq_add_stmt (&stmts
, bndcopy
);
1354 /* If we're returning something, just turn that into an
1355 assignment into the equivalent of the original RESULT_DECL.
1356 If RETVAL is just the result decl, the result decl has
1357 already been set (e.g. a recent "foo (&result_decl, ...)");
1358 just toss the entire GIMPLE_RETURN. */
1360 && (TREE_CODE (retval
) != RESULT_DECL
1361 && (TREE_CODE (retval
) != SSA_NAME
1362 || ! SSA_NAME_VAR (retval
)
1363 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1365 copy
= gimple_build_assign (id
->do_not_unshare
1366 ? id
->retvar
: unshare_expr (id
->retvar
),
1368 /* id->retvar is already substituted. Skip it on later remapping. */
1371 /* We need to copy bounds if return structure with pointers into
1372 instrumented function. */
1373 if (chkp_function_instrumented_p (id
->dst_fn
)
1375 && !BOUNDED_P (id
->retvar
)
1376 && chkp_type_has_pointer (TREE_TYPE (id
->retvar
)))
1377 id
->assign_stmts
.safe_push (copy
);
1383 else if (gimple_has_substatements (stmt
))
1387 /* When cloning bodies from the C++ front end, we will be handed bodies
1388 in High GIMPLE form. Handle here all the High GIMPLE statements that
1389 have embedded statements. */
1390 switch (gimple_code (stmt
))
1393 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1398 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1399 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1400 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1404 case GIMPLE_EH_FILTER
:
1405 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1406 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1410 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1411 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1412 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1415 case GIMPLE_WITH_CLEANUP_EXPR
:
1416 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1417 copy
= gimple_build_wce (s1
);
1420 case GIMPLE_OMP_PARALLEL
:
1422 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1423 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1424 copy
= gimple_build_omp_parallel
1426 gimple_omp_parallel_clauses (omp_par_stmt
),
1427 gimple_omp_parallel_child_fn (omp_par_stmt
),
1428 gimple_omp_parallel_data_arg (omp_par_stmt
));
1432 case GIMPLE_OMP_TASK
:
1433 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1434 copy
= gimple_build_omp_task
1436 gimple_omp_task_clauses (stmt
),
1437 gimple_omp_task_child_fn (stmt
),
1438 gimple_omp_task_data_arg (stmt
),
1439 gimple_omp_task_copy_fn (stmt
),
1440 gimple_omp_task_arg_size (stmt
),
1441 gimple_omp_task_arg_align (stmt
));
1444 case GIMPLE_OMP_FOR
:
1445 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1446 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1447 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1448 gimple_omp_for_clauses (stmt
),
1449 gimple_omp_for_collapse (stmt
), s2
);
1452 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1454 gimple_omp_for_set_index (copy
, i
,
1455 gimple_omp_for_index (stmt
, i
));
1456 gimple_omp_for_set_initial (copy
, i
,
1457 gimple_omp_for_initial (stmt
, i
));
1458 gimple_omp_for_set_final (copy
, i
,
1459 gimple_omp_for_final (stmt
, i
));
1460 gimple_omp_for_set_incr (copy
, i
,
1461 gimple_omp_for_incr (stmt
, i
));
1462 gimple_omp_for_set_cond (copy
, i
,
1463 gimple_omp_for_cond (stmt
, i
));
1468 case GIMPLE_OMP_MASTER
:
1469 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1470 copy
= gimple_build_omp_master (s1
);
1473 case GIMPLE_OMP_TASKGROUP
:
1474 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1475 copy
= gimple_build_omp_taskgroup (s1
);
1478 case GIMPLE_OMP_ORDERED
:
1479 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1480 copy
= gimple_build_omp_ordered
1482 gimple_omp_ordered_clauses (as_a
<gomp_ordered
*> (stmt
)));
1485 case GIMPLE_OMP_SECTION
:
1486 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1487 copy
= gimple_build_omp_section (s1
);
1490 case GIMPLE_OMP_SECTIONS
:
1491 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1492 copy
= gimple_build_omp_sections
1493 (s1
, gimple_omp_sections_clauses (stmt
));
1496 case GIMPLE_OMP_SINGLE
:
1497 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1498 copy
= gimple_build_omp_single
1499 (s1
, gimple_omp_single_clauses (stmt
));
1502 case GIMPLE_OMP_TARGET
:
1503 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1504 copy
= gimple_build_omp_target
1505 (s1
, gimple_omp_target_kind (stmt
),
1506 gimple_omp_target_clauses (stmt
));
1509 case GIMPLE_OMP_TEAMS
:
1510 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1511 copy
= gimple_build_omp_teams
1512 (s1
, gimple_omp_teams_clauses (stmt
));
1515 case GIMPLE_OMP_CRITICAL
:
1516 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1517 copy
= gimple_build_omp_critical (s1
,
1518 gimple_omp_critical_name
1519 (as_a
<gomp_critical
*> (stmt
)),
1520 gimple_omp_critical_clauses
1521 (as_a
<gomp_critical
*> (stmt
)));
1524 case GIMPLE_TRANSACTION
:
1526 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1527 gtransaction
*new_trans_stmt
;
1528 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1530 copy
= new_trans_stmt
= gimple_build_transaction (s1
);
1531 gimple_transaction_set_subcode (new_trans_stmt
,
1532 gimple_transaction_subcode (old_trans_stmt
));
1533 gimple_transaction_set_label_norm (new_trans_stmt
,
1534 gimple_transaction_label_norm (old_trans_stmt
));
1535 gimple_transaction_set_label_uninst (new_trans_stmt
,
1536 gimple_transaction_label_uninst (old_trans_stmt
));
1537 gimple_transaction_set_label_over (new_trans_stmt
,
1538 gimple_transaction_label_over (old_trans_stmt
));
1548 if (gimple_assign_copy_p (stmt
)
1549 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1550 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1552 /* Here we handle statements that are not completely rewritten.
1553 First we detect some inlining-induced bogosities for
1556 /* Some assignments VAR = VAR; don't generate any rtl code
1557 and thus don't count as variable modification. Avoid
1558 keeping bogosities like 0 = 0. */
1559 tree decl
= gimple_assign_lhs (stmt
), value
;
1562 n
= id
->decl_map
->get (decl
);
1566 STRIP_TYPE_NOPS (value
);
1567 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1572 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1573 in a block that we aren't copying during tree_function_versioning,
1574 just drop the clobber stmt. */
1575 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1577 tree lhs
= gimple_assign_lhs (stmt
);
1578 if (TREE_CODE (lhs
) == MEM_REF
1579 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1581 gimple
*def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1582 if (gimple_bb (def_stmt
)
1583 && !bitmap_bit_p (id
->blocks_to_copy
,
1584 gimple_bb (def_stmt
)->index
))
1589 if (gimple_debug_bind_p (stmt
))
1592 = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1593 gimple_debug_bind_get_value (stmt
),
1595 id
->debug_stmts
.safe_push (copy
);
1596 gimple_seq_add_stmt (&stmts
, copy
);
1599 if (gimple_debug_source_bind_p (stmt
))
1601 gdebug
*copy
= gimple_build_debug_source_bind
1602 (gimple_debug_source_bind_get_var (stmt
),
1603 gimple_debug_source_bind_get_value (stmt
),
1605 id
->debug_stmts
.safe_push (copy
);
1606 gimple_seq_add_stmt (&stmts
, copy
);
1610 /* Create a new deep copy of the statement. */
1611 copy
= gimple_copy (stmt
);
1613 /* Clear flags that need revisiting. */
1614 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1616 if (gimple_call_tail_p (call_stmt
))
1617 gimple_call_set_tail (call_stmt
, false);
1618 if (gimple_call_from_thunk_p (call_stmt
))
1619 gimple_call_set_from_thunk (call_stmt
, false);
1620 if (gimple_call_internal_p (call_stmt
)
1621 && IN_RANGE (gimple_call_internal_fn (call_stmt
),
1622 IFN_GOMP_SIMD_ORDERED_START
,
1623 IFN_GOMP_SIMD_ORDERED_END
))
1624 DECL_STRUCT_FUNCTION (id
->dst_fn
)->has_simduid_loops
= true;
1627 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1628 RESX and EH_DISPATCH. */
1630 switch (gimple_code (copy
))
1634 tree r
, fndecl
= gimple_call_fndecl (copy
);
1635 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1636 switch (DECL_FUNCTION_CODE (fndecl
))
1638 case BUILT_IN_EH_COPY_VALUES
:
1639 r
= gimple_call_arg (copy
, 1);
1640 r
= remap_eh_region_tree_nr (r
, id
);
1641 gimple_call_set_arg (copy
, 1, r
);
1644 case BUILT_IN_EH_POINTER
:
1645 case BUILT_IN_EH_FILTER
:
1646 r
= gimple_call_arg (copy
, 0);
1647 r
= remap_eh_region_tree_nr (r
, id
);
1648 gimple_call_set_arg (copy
, 0, r
);
1655 /* Reset alias info if we didn't apply measures to
1656 keep it valid over inlining by setting DECL_PT_UID. */
1657 if (!id
->src_cfun
->gimple_df
1658 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1659 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1665 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1666 int r
= gimple_resx_region (resx_stmt
);
1667 r
= remap_eh_region_nr (r
, id
);
1668 gimple_resx_set_region (resx_stmt
, r
);
1672 case GIMPLE_EH_DISPATCH
:
1674 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1675 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1676 r
= remap_eh_region_nr (r
, id
);
1677 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1686 /* If STMT has a block defined, map it to the newly constructed
1688 if (gimple_block (copy
))
1691 n
= id
->decl_map
->get (gimple_block (copy
));
1693 gimple_set_block (copy
, *n
);
1696 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1698 gimple_seq_add_stmt (&stmts
, copy
);
1702 /* Remap all the operands in COPY. */
1703 memset (&wi
, 0, sizeof (wi
));
1706 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1708 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1710 /* Clear the copied virtual operands. We are not remapping them here
1711 but are going to recreate them from scratch. */
1712 if (gimple_has_mem_ops (copy
))
1714 gimple_set_vdef (copy
, NULL_TREE
);
1715 gimple_set_vuse (copy
, NULL_TREE
);
1718 gimple_seq_add_stmt (&stmts
, copy
);
1723 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1727 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1728 gcov_type count_scale
)
1730 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1731 basic_block copy_basic_block
;
1736 /* Search for previous copied basic block. */
1739 prev
= prev
->prev_bb
;
1741 /* create_basic_block() will append every new block to
1742 basic_block_info automatically. */
1743 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
1744 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1746 /* We are going to rebuild frequencies from scratch. These values
1747 have just small importance to drive canonicalize_loop_headers. */
1748 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1750 /* We recompute frequencies after inlining, so this is quite safe. */
1751 if (freq
> BB_FREQ_MAX
)
1753 copy_basic_block
->frequency
= freq
;
1755 copy_gsi
= gsi_start_bb (copy_basic_block
);
1757 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1760 gimple
*stmt
= gsi_stmt (gsi
);
1761 gimple
*orig_stmt
= stmt
;
1762 gimple_stmt_iterator stmts_gsi
;
1763 bool stmt_added
= false;
1765 id
->regimplify
= false;
1766 stmts
= remap_gimple_stmt (stmt
, id
);
1768 if (gimple_seq_empty_p (stmts
))
1773 for (stmts_gsi
= gsi_start (stmts
);
1774 !gsi_end_p (stmts_gsi
); )
1776 stmt
= gsi_stmt (stmts_gsi
);
1778 /* Advance iterator now before stmt is moved to seq_gsi. */
1779 gsi_next (&stmts_gsi
);
1781 if (gimple_nop_p (stmt
))
1784 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
1787 /* With return slot optimization we can end up with
1788 non-gimple (foo *)&this->m, fix that here. */
1789 if (is_gimple_assign (stmt
)
1790 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
1791 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1794 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1795 gimple_assign_rhs1 (stmt
),
1797 GSI_CONTINUE_LINKING
);
1798 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1799 id
->regimplify
= false;
1802 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1805 gimple_regimplify_operands (stmt
, &seq_gsi
);
1813 /* If copy_basic_block has been empty at the start of this iteration,
1814 call gsi_start_bb again to get at the newly added statements. */
1815 if (gsi_end_p (copy_gsi
))
1816 copy_gsi
= gsi_start_bb (copy_basic_block
);
1818 gsi_next (©_gsi
);
1820 /* Process the new statement. The call to gimple_regimplify_operands
1821 possibly turned the statement into multiple statements, we
1822 need to process all of them. */
1828 stmt
= gsi_stmt (copy_gsi
);
1829 call_stmt
= dyn_cast
<gcall
*> (stmt
);
1831 && gimple_call_va_arg_pack_p (call_stmt
)
1834 /* __builtin_va_arg_pack () should be replaced by
1835 all arguments corresponding to ... in the caller. */
1839 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
1840 size_t n
, i
, nargs_to_copy
;
1841 bool remove_bounds
= false;
1843 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1846 /* Bounds should be removed from arg pack in case
1847 we handle not instrumented call in instrumented
1849 nargs_to_copy
= nargs
;
1850 if (gimple_call_with_bounds_p (id
->call_stmt
)
1851 && !gimple_call_with_bounds_p (stmt
))
1853 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1854 i
< gimple_call_num_args (id
->call_stmt
);
1856 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1858 remove_bounds
= true;
1861 /* Create the new array of arguments. */
1862 n
= nargs_to_copy
+ gimple_call_num_args (call_stmt
);
1863 argarray
.create (n
);
1864 argarray
.safe_grow_cleared (n
);
1866 /* Copy all the arguments before '...' */
1867 memcpy (argarray
.address (),
1868 gimple_call_arg_ptr (call_stmt
, 0),
1869 gimple_call_num_args (call_stmt
) * sizeof (tree
));
1873 /* Append the rest of arguments removing bounds. */
1874 unsigned cur
= gimple_call_num_args (call_stmt
);
1875 i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1876 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1877 i
< gimple_call_num_args (id
->call_stmt
);
1879 if (!POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1880 argarray
[cur
++] = gimple_call_arg (id
->call_stmt
, i
);
1881 gcc_assert (cur
== n
);
1885 /* Append the arguments passed in '...' */
1886 memcpy (argarray
.address () + gimple_call_num_args (call_stmt
),
1887 gimple_call_arg_ptr (id
->call_stmt
, 0)
1888 + (gimple_call_num_args (id
->call_stmt
) - nargs
),
1889 nargs
* sizeof (tree
));
1892 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
1895 argarray
.release ();
1897 /* Copy all GIMPLE_CALL flags, location and block, except
1898 GF_CALL_VA_ARG_PACK. */
1899 gimple_call_copy_flags (new_call
, call_stmt
);
1900 gimple_call_set_va_arg_pack (new_call
, false);
1901 gimple_set_location (new_call
, gimple_location (stmt
));
1902 gimple_set_block (new_call
, gimple_block (stmt
));
1903 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
1905 gsi_replace (©_gsi
, new_call
, false);
1910 && (decl
= gimple_call_fndecl (stmt
))
1911 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1912 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1914 /* __builtin_va_arg_pack_len () should be replaced by
1915 the number of anonymous arguments. */
1916 size_t nargs
= gimple_call_num_args (id
->call_stmt
), i
;
1920 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1923 /* For instrumented calls we should ignore bounds. */
1924 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1925 i
< gimple_call_num_args (id
->call_stmt
);
1927 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1930 count
= build_int_cst (integer_type_node
, nargs
);
1931 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1932 gsi_replace (©_gsi
, new_stmt
, false);
1937 && gimple_call_internal_p (stmt
)
1938 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
1940 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
1941 gsi_remove (©_gsi
, false);
1945 /* Statements produced by inlining can be unfolded, especially
1946 when we constant propagated some operands. We can't fold
1947 them right now for two reasons:
1948 1) folding require SSA_NAME_DEF_STMTs to be correct
1949 2) we can't change function calls to builtins.
1950 So we just mark statement for later folding. We mark
1951 all new statements, instead just statements that has changed
1952 by some nontrivial substitution so even statements made
1953 foldable indirectly are updated. If this turns out to be
1954 expensive, copy_body can be told to watch for nontrivial
1956 if (id
->statements_to_fold
)
1957 id
->statements_to_fold
->add (stmt
);
1959 /* We're duplicating a CALL_EXPR. Find any corresponding
1960 callgraph edges and update or duplicate them. */
1961 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
1963 struct cgraph_edge
*edge
;
1965 switch (id
->transform_call_graph_edges
)
1967 case CB_CGE_DUPLICATE
:
1968 edge
= id
->src_node
->get_edge (orig_stmt
);
1971 int edge_freq
= edge
->frequency
;
1973 struct cgraph_edge
*old_edge
= edge
;
1974 edge
= edge
->clone (id
->dst_node
, call_stmt
,
1976 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1978 /* We could also just rescale the frequency, but
1979 doing so would introduce roundoff errors and make
1980 verifier unhappy. */
1981 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1984 /* Speculative calls consist of two edges - direct and indirect.
1985 Duplicate the whole thing and distribute frequencies accordingly. */
1986 if (edge
->speculative
)
1988 struct cgraph_edge
*direct
, *indirect
;
1989 struct ipa_ref
*ref
;
1991 gcc_assert (!edge
->indirect_unknown_callee
);
1992 old_edge
->speculative_call_info (direct
, indirect
, ref
);
1993 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
1995 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1997 if (old_edge
->frequency
+ indirect
->frequency
)
1999 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
2000 (old_edge
->frequency
+ indirect
->frequency
)),
2002 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
2003 (old_edge
->frequency
+ indirect
->frequency
)),
2006 id
->dst_node
->clone_reference (ref
, stmt
);
2010 edge
->frequency
= new_freq
;
2012 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
2013 && (edge_freq
> edge
->frequency
+ 10
2014 || edge_freq
< edge
->frequency
- 10))
2016 fprintf (dump_file
, "Edge frequency estimated by "
2017 "cgraph %i diverge from inliner's estimate %i\n",
2021 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
2024 copy_basic_block
->frequency
);
2030 case CB_CGE_MOVE_CLONES
:
2031 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2033 edge
= id
->dst_node
->get_edge (stmt
);
2037 edge
= id
->dst_node
->get_edge (orig_stmt
);
2039 edge
->set_call_stmt (call_stmt
);
2046 /* Constant propagation on argument done during inlining
2047 may create new direct call. Produce an edge for it. */
2049 || (edge
->indirect_inlining_edge
2050 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2051 && id
->dst_node
->definition
2052 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2054 struct cgraph_node
*dest
= cgraph_node::get (fn
);
2056 /* We have missing edge in the callgraph. This can happen
2057 when previous inlining turned an indirect call into a
2058 direct call by constant propagating arguments or we are
2059 producing dead clone (for further cloning). In all
2060 other cases we hit a bug (incorrect node sharing is the
2061 most common reason for missing edges). */
2062 gcc_assert (!dest
->definition
2063 || dest
->address_taken
2064 || !id
->src_node
->definition
2065 || !id
->dst_node
->definition
);
2066 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2067 id
->dst_node
->create_edge_including_clones
2068 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2069 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
2071 CIF_ORIGINALLY_INDIRECT_CALL
);
2073 id
->dst_node
->create_edge (dest
, call_stmt
,
2075 compute_call_stmt_bb_frequency
2076 (id
->dst_node
->decl
,
2077 copy_basic_block
))->inline_failed
2078 = CIF_ORIGINALLY_INDIRECT_CALL
;
2081 fprintf (dump_file
, "Created new direct edge to %s\n",
2086 notice_special_calls (as_a
<gcall
*> (stmt
));
2089 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2090 id
->eh_map
, id
->eh_lp_nr
);
2092 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
2097 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
2098 if (TREE_CODE (def
) == SSA_NAME
)
2099 SSA_NAME_DEF_STMT (def
) = stmt
;
2102 gsi_next (©_gsi
);
2104 while (!gsi_end_p (copy_gsi
));
2106 copy_gsi
= gsi_last_bb (copy_basic_block
);
2109 return copy_basic_block
;
2112 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2113 form is quite easy, since dominator relationship for old basic blocks does
2116 There is however exception where inlining might change dominator relation
2117 across EH edges from basic block within inlined functions destinating
2118 to landing pads in function we inline into.
2120 The function fills in PHI_RESULTs of such PHI nodes if they refer
2121 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2122 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2123 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2124 set, and this means that there will be no overlapping live ranges
2125 for the underlying symbol.
2127 This might change in future if we allow redirecting of EH edges and
2128 we might want to change way build CFG pre-inlining to include
2129 all the possible edges then. */
2131 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2132 bool can_throw
, bool nonlocal_goto
)
2137 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2139 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2145 gcc_assert (e
->flags
& EDGE_EH
);
2148 gcc_assert (!(e
->flags
& EDGE_EH
));
2150 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2156 /* For abnormal goto/call edges the receiver can be the
2157 ENTRY_BLOCK. Do not assert this cannot happen. */
2159 gcc_assert ((e
->flags
& EDGE_EH
)
2160 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2162 re
= find_edge (ret_bb
, e
->dest
);
2163 gcc_checking_assert (re
);
2164 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2165 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2167 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2168 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2174 /* Copy edges from BB into its copy constructed earlier, scale profile
2175 accordingly. Edges will be taken care of later. Assume aux
2176 pointers to point to the copies of each BB. Return true if any
2177 debug stmts are left after a statement that must end the basic block. */
2180 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
2181 basic_block abnormal_goto_dest
)
2183 basic_block new_bb
= (basic_block
) bb
->aux
;
2186 gimple_stmt_iterator si
;
2188 bool need_debug_cleanup
= false;
2190 /* Use the indices from the original blocks to create edges for the
2192 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2193 if (!(old_edge
->flags
& EDGE_EH
))
2197 flags
= old_edge
->flags
;
2199 /* Return edges do get a FALLTHRU flag when the get inlined. */
2200 if (old_edge
->dest
->index
== EXIT_BLOCK
2201 && !(old_edge
->flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2202 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2203 flags
|= EDGE_FALLTHRU
;
2204 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2205 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
2206 new_edge
->probability
= old_edge
->probability
;
2209 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2212 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2215 bool can_throw
, nonlocal_goto
;
2217 copy_stmt
= gsi_stmt (si
);
2218 if (!is_gimple_debug (copy_stmt
))
2219 update_stmt (copy_stmt
);
2221 /* Do this before the possible split_block. */
2224 /* If this tree could throw an exception, there are two
2225 cases where we need to add abnormal edge(s): the
2226 tree wasn't in a region and there is a "current
2227 region" in the caller; or the original tree had
2228 EH edges. In both cases split the block after the tree,
2229 and add abnormal edge(s) as needed; we need both
2230 those from the callee and the caller.
2231 We check whether the copy can throw, because the const
2232 propagation can change an INDIRECT_REF which throws
2233 into a COMPONENT_REF which doesn't. If the copy
2234 can throw, the original could also throw. */
2235 can_throw
= stmt_can_throw_internal (copy_stmt
);
2237 = (stmt_can_make_abnormal_goto (copy_stmt
)
2238 && !computed_goto_p (copy_stmt
));
2240 if (can_throw
|| nonlocal_goto
)
2242 if (!gsi_end_p (si
))
2244 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2247 need_debug_cleanup
= true;
2249 if (!gsi_end_p (si
))
2250 /* Note that bb's predecessor edges aren't necessarily
2251 right at this point; split_block doesn't care. */
2253 edge e
= split_block (new_bb
, copy_stmt
);
2256 new_bb
->aux
= e
->src
->aux
;
2257 si
= gsi_start_bb (new_bb
);
2261 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2262 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2264 make_eh_edges (copy_stmt
);
2266 /* If the call we inline cannot make abnormal goto do not add
2267 additional abnormal edges but only retain those already present
2268 in the original function body. */
2269 if (abnormal_goto_dest
== NULL
)
2270 nonlocal_goto
= false;
2273 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2275 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2276 nonlocal_goto
= false;
2277 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2278 in OpenMP regions which aren't allowed to be left abnormally.
2279 So, no need to add abnormal edge in that case. */
2280 else if (is_gimple_call (copy_stmt
)
2281 && gimple_call_internal_p (copy_stmt
)
2282 && (gimple_call_internal_fn (copy_stmt
)
2283 == IFN_ABNORMAL_DISPATCHER
)
2284 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2285 nonlocal_goto
= false;
2287 make_edge (copy_stmt_bb
, abnormal_goto_dest
, EDGE_ABNORMAL
);
2290 if ((can_throw
|| nonlocal_goto
)
2291 && gimple_in_ssa_p (cfun
))
2292 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2293 can_throw
, nonlocal_goto
);
2295 return need_debug_cleanup
;
2298 /* Copy the PHIs. All blocks and edges are copied, some blocks
2299 was possibly split and new outgoing EH edges inserted.
2300 BB points to the block of original function and AUX pointers links
2301 the original and newly copied blocks. */
2304 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2306 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2311 bool inserted
= false;
2313 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2319 res
= PHI_RESULT (phi
);
2321 if (!virtual_operand_p (res
))
2323 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2324 new_phi
= create_phi_node (new_res
, new_bb
);
2325 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2327 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2333 /* When doing partial cloning, we allow PHIs on the entry block
2334 as long as all the arguments are the same. Find any input
2335 edge to see argument to copy. */
2337 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2338 if (!old_edge
->src
->aux
)
2341 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2343 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2344 gcc_assert (new_arg
);
2345 /* With return slot optimization we can end up with
2346 non-gimple (foo *)&this->m, fix that here. */
2347 if (TREE_CODE (new_arg
) != SSA_NAME
2348 && TREE_CODE (new_arg
) != FUNCTION_DECL
2349 && !is_gimple_val (new_arg
))
2351 gimple_seq stmts
= NULL
;
2352 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2353 gsi_insert_seq_on_edge (new_edge
, stmts
);
2356 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2357 if (LOCATION_BLOCK (locus
))
2360 n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
2362 locus
= set_block (locus
, *n
);
2365 locus
= LOCATION_LOCUS (locus
);
2367 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2372 /* Commit the delayed edge insertions. */
2374 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2375 gsi_commit_one_edge_insert (new_edge
, NULL
);
2379 /* Wrapper for remap_decl so it can be used as a callback. */
2382 remap_decl_1 (tree decl
, void *data
)
2384 return remap_decl (decl
, (copy_body_data
*) data
);
2387 /* Build struct function and associated datastructures for the new clone
2388 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2389 the cfun to the function of new_fndecl (and current_function_decl too). */
2392 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2394 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2395 gcov_type count_scale
;
2397 if (!DECL_ARGUMENTS (new_fndecl
))
2398 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2399 if (!DECL_RESULT (new_fndecl
))
2400 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2402 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2404 = GCOV_COMPUTE_SCALE (count
,
2405 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2407 count_scale
= REG_BR_PROB_BASE
;
2409 /* Register specific tree functions. */
2410 gimple_register_cfg_hooks ();
2412 /* Get clean struct function. */
2413 push_struct_function (new_fndecl
);
2415 /* We will rebuild these, so just sanity check that they are empty. */
2416 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2417 gcc_assert (cfun
->local_decls
== NULL
);
2418 gcc_assert (cfun
->cfg
== NULL
);
2419 gcc_assert (cfun
->decl
== new_fndecl
);
2421 /* Copy items we preserve during cloning. */
2422 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2423 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2424 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2425 cfun
->curr_properties
= src_cfun
->curr_properties
;
2426 cfun
->last_verified
= src_cfun
->last_verified
;
2427 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2428 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2429 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2430 cfun
->stdarg
= src_cfun
->stdarg
;
2431 cfun
->after_inlining
= src_cfun
->after_inlining
;
2432 cfun
->can_throw_non_call_exceptions
2433 = src_cfun
->can_throw_non_call_exceptions
;
2434 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2435 cfun
->returns_struct
= src_cfun
->returns_struct
;
2436 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2438 init_empty_tree_cfg ();
2440 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2441 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2442 (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2444 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2445 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2446 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2447 (EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2449 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2450 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2452 init_eh_for_function ();
2454 if (src_cfun
->gimple_df
)
2456 init_tree_ssa (cfun
);
2457 cfun
->gimple_df
->in_ssa_p
= true;
2458 init_ssa_operands (cfun
);
2462 /* Helper function for copy_cfg_body. Move debug stmts from the end
2463 of NEW_BB to the beginning of successor basic blocks when needed. If the
2464 successor has multiple predecessors, reset them, otherwise keep
2468 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2472 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2475 || gsi_one_before_end_p (si
)
2476 || !(stmt_can_throw_internal (gsi_stmt (si
))
2477 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2480 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2482 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2483 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2484 while (is_gimple_debug (gsi_stmt (ssi
)))
2486 gimple
*stmt
= gsi_stmt (ssi
);
2491 /* For the last edge move the debug stmts instead of copying
2493 if (ei_one_before_end_p (ei
))
2497 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2498 gimple_debug_bind_reset_value (stmt
);
2499 gsi_remove (&si
, false);
2500 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2504 if (gimple_debug_bind_p (stmt
))
2506 var
= gimple_debug_bind_get_var (stmt
);
2507 if (single_pred_p (e
->dest
))
2509 value
= gimple_debug_bind_get_value (stmt
);
2510 value
= unshare_expr (value
);
2514 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2516 else if (gimple_debug_source_bind_p (stmt
))
2518 var
= gimple_debug_source_bind_get_var (stmt
);
2519 value
= gimple_debug_source_bind_get_value (stmt
);
2520 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2524 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2525 id
->debug_stmts
.safe_push (new_stmt
);
2531 /* Make a copy of the sub-loops of SRC_PARENT and place them
2532 as siblings of DEST_PARENT. */
2535 copy_loops (copy_body_data
*id
,
2536 struct loop
*dest_parent
, struct loop
*src_parent
)
2538 struct loop
*src_loop
= src_parent
->inner
;
2541 if (!id
->blocks_to_copy
2542 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2544 struct loop
*dest_loop
= alloc_loop ();
2546 /* Assign the new loop its header and latch and associate
2547 those with the new loop. */
2548 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2549 dest_loop
->header
->loop_father
= dest_loop
;
2550 if (src_loop
->latch
!= NULL
)
2552 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2553 dest_loop
->latch
->loop_father
= dest_loop
;
2556 /* Copy loop meta-data. */
2557 copy_loop_info (src_loop
, dest_loop
);
2559 /* Finally place it into the loop array and the loop tree. */
2560 place_new_loop (cfun
, dest_loop
);
2561 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2563 dest_loop
->safelen
= src_loop
->safelen
;
2564 dest_loop
->dont_vectorize
= src_loop
->dont_vectorize
;
2565 if (src_loop
->force_vectorize
)
2567 dest_loop
->force_vectorize
= true;
2568 cfun
->has_force_vectorize_loops
= true;
2570 if (src_loop
->simduid
)
2572 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2573 cfun
->has_simduid_loops
= true;
2577 copy_loops (id
, dest_loop
, src_loop
);
2579 src_loop
= src_loop
->next
;
2583 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2586 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2588 gimple_stmt_iterator si
;
2589 gimple
*last
= last_stmt (bb
);
2590 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2592 gimple
*stmt
= gsi_stmt (si
);
2593 if (is_gimple_call (stmt
))
2595 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2598 edge
->redirect_call_stmt_to_callee ();
2599 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
2600 gimple_purge_dead_eh_edges (bb
);
2606 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2607 with each bb's frequency. Used when NODE has a 0-weight entry
2608 but we are about to inline it into a non-zero count call bb.
2609 See the comments for handle_missing_profiles() in predict.c for
2610 when this can happen for COMDATs. */
2613 freqs_to_counts (struct cgraph_node
*node
, gcov_type count
)
2618 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2620 FOR_ALL_BB_FN(bb
, fn
)
2622 bb
->count
= apply_scale (count
,
2623 GCOV_COMPUTE_SCALE (bb
->frequency
, BB_FREQ_MAX
));
2624 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2625 e
->count
= apply_probability (e
->src
->count
, e
->probability
);
2629 /* Make a copy of the body of FN so that it can be inserted inline in
2630 another function. Walks FN via CFG, returns new fndecl. */
2633 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2634 basic_block entry_block_map
, basic_block exit_block_map
,
2635 basic_block new_entry
)
2637 tree callee_fndecl
= id
->src_fn
;
2638 /* Original cfun for the callee, doesn't change. */
2639 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2640 struct function
*cfun_to_copy
;
2642 tree new_fndecl
= NULL
;
2643 bool need_debug_cleanup
= false;
2644 gcov_type count_scale
;
2646 int incoming_frequency
= 0;
2647 gcov_type incoming_count
= 0;
2649 /* This can happen for COMDAT routines that end up with 0 counts
2650 despite being called (see the comments for handle_missing_profiles()
2651 in predict.c as to why). Apply counts to the blocks in the callee
2652 before inlining, using the guessed edge frequencies, so that we don't
2653 end up with a 0-count inline body which can confuse downstream
2654 optimizations such as function splitting. */
2655 if (!ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
&& count
)
2657 /* Apply the larger of the call bb count and the total incoming
2658 call edge count to the callee. */
2659 gcov_type in_count
= 0;
2660 struct cgraph_edge
*in_edge
;
2661 for (in_edge
= id
->src_node
->callers
; in_edge
;
2662 in_edge
= in_edge
->next_caller
)
2663 in_count
+= in_edge
->count
;
2664 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2667 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2669 = GCOV_COMPUTE_SCALE (count
,
2670 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2672 count_scale
= REG_BR_PROB_BASE
;
2674 /* Register specific tree functions. */
2675 gimple_register_cfg_hooks ();
2677 /* If we are inlining just region of the function, make sure to connect
2678 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2679 part of loop, we must compute frequency and probability of
2680 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2681 probabilities of edges incoming from nonduplicated region. */
2687 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2690 incoming_frequency
+= EDGE_FREQUENCY (e
);
2691 incoming_count
+= e
->count
;
2693 incoming_count
= apply_scale (incoming_count
, count_scale
);
2695 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2696 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2697 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2700 /* Must have a CFG here at this point. */
2701 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2702 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2704 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2706 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2707 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2708 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2709 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2711 /* Duplicate any exception-handling regions. */
2713 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2716 /* Use aux pointers to map the original blocks to copy. */
2717 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2718 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2720 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2723 new_bb
->loop_father
= entry_block_map
->loop_father
;
2726 last
= last_basic_block_for_fn (cfun
);
2728 /* Now that we've duplicated the blocks, duplicate their edges. */
2729 basic_block abnormal_goto_dest
= NULL
;
2731 && stmt_can_make_abnormal_goto (id
->call_stmt
))
2733 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
2735 bb
= gimple_bb (id
->call_stmt
);
2737 if (gsi_end_p (gsi
))
2738 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2740 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2741 if (!id
->blocks_to_copy
2742 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2743 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2744 abnormal_goto_dest
);
2748 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2749 e
->probability
= REG_BR_PROB_BASE
;
2750 e
->count
= incoming_count
;
2753 /* Duplicate the loop tree, if available and wanted. */
2754 if (loops_for_fn (src_cfun
) != NULL
2755 && current_loops
!= NULL
)
2757 copy_loops (id
, entry_block_map
->loop_father
,
2758 get_loop (src_cfun
, 0));
2759 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2760 loops_state_set (LOOPS_NEED_FIXUP
);
2763 /* If the loop tree in the source function needed fixup, mark the
2764 destination loop tree for fixup, too. */
2765 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2766 loops_state_set (LOOPS_NEED_FIXUP
);
2768 if (gimple_in_ssa_p (cfun
))
2769 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2770 if (!id
->blocks_to_copy
2771 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2772 copy_phis_for_bb (bb
, id
);
2774 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2777 if (need_debug_cleanup
2778 && bb
->index
!= ENTRY_BLOCK
2779 && bb
->index
!= EXIT_BLOCK
)
2780 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2781 /* Update call edge destinations. This can not be done before loop
2782 info is updated, because we may split basic blocks. */
2783 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
2784 && bb
->index
!= ENTRY_BLOCK
2785 && bb
->index
!= EXIT_BLOCK
)
2786 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2787 ((basic_block
)bb
->aux
)->aux
= NULL
;
2791 /* Zero out AUX fields of newly created block during EH edge
2793 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2795 if (need_debug_cleanup
)
2796 maybe_move_debug_stmts_to_successors (id
,
2797 BASIC_BLOCK_FOR_FN (cfun
, last
));
2798 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2799 /* Update call edge destinations. This can not be done before loop
2800 info is updated, because we may split basic blocks. */
2801 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2802 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2804 entry_block_map
->aux
= NULL
;
2805 exit_block_map
->aux
= NULL
;
2812 if (id
->dependence_map
)
2814 delete id
->dependence_map
;
2815 id
->dependence_map
= NULL
;
2821 /* Copy the debug STMT using ID. We deal with these statements in a
2822 special way: if any variable in their VALUE expression wasn't
2823 remapped yet, we won't remap it, because that would get decl uids
2824 out of sync, causing codegen differences between -g and -g0. If
2825 this arises, we drop the VALUE expression altogether. */
2828 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
2831 struct walk_stmt_info wi
;
2833 if (gimple_block (stmt
))
2835 n
= id
->decl_map
->get (gimple_block (stmt
));
2836 gimple_set_block (stmt
, n
? *n
: id
->block
);
2839 /* Remap all the operands in COPY. */
2840 memset (&wi
, 0, sizeof (wi
));
2843 processing_debug_stmt
= 1;
2845 if (gimple_debug_source_bind_p (stmt
))
2846 t
= gimple_debug_source_bind_get_var (stmt
);
2848 t
= gimple_debug_bind_get_var (stmt
);
2850 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2851 && (n
= id
->debug_map
->get (t
)))
2853 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2856 else if (TREE_CODE (t
) == VAR_DECL
2857 && !is_global_var (t
)
2858 && !id
->decl_map
->get (t
))
2859 /* T is a non-localized variable. */;
2861 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2863 if (gimple_debug_bind_p (stmt
))
2865 gimple_debug_bind_set_var (stmt
, t
);
2867 if (gimple_debug_bind_has_value_p (stmt
))
2868 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2869 remap_gimple_op_r
, &wi
, NULL
);
2871 /* Punt if any decl couldn't be remapped. */
2872 if (processing_debug_stmt
< 0)
2873 gimple_debug_bind_reset_value (stmt
);
2875 else if (gimple_debug_source_bind_p (stmt
))
2877 gimple_debug_source_bind_set_var (stmt
, t
);
2878 /* When inlining and source bind refers to one of the optimized
2879 away parameters, change the source bind into normal debug bind
2880 referring to the corresponding DEBUG_EXPR_DECL that should have
2881 been bound before the call stmt. */
2882 t
= gimple_debug_source_bind_get_value (stmt
);
2884 && TREE_CODE (t
) == PARM_DECL
2887 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2889 if (debug_args
!= NULL
)
2891 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2892 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2893 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2895 t
= (**debug_args
)[i
+ 1];
2896 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2897 gimple_debug_bind_set_value (stmt
, t
);
2902 if (gimple_debug_source_bind_p (stmt
))
2903 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2904 remap_gimple_op_r
, &wi
, NULL
);
2907 processing_debug_stmt
= 0;
2912 /* Process deferred debug stmts. In order to give values better odds
2913 of being successfully remapped, we delay the processing of debug
2914 stmts until all other stmts that might require remapping are
2918 copy_debug_stmts (copy_body_data
*id
)
2923 if (!id
->debug_stmts
.exists ())
2926 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2927 copy_debug_stmt (stmt
, id
);
2929 id
->debug_stmts
.release ();
2932 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2933 another function. */
2936 copy_tree_body (copy_body_data
*id
)
2938 tree fndecl
= id
->src_fn
;
2939 tree body
= DECL_SAVED_TREE (fndecl
);
2941 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2946 /* Make a copy of the body of FN so that it can be inserted inline in
2947 another function. */
2950 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2951 basic_block entry_block_map
, basic_block exit_block_map
,
2952 basic_block new_entry
)
2954 tree fndecl
= id
->src_fn
;
2957 /* If this body has a CFG, walk CFG and copy. */
2958 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2959 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2961 copy_debug_stmts (id
);
2966 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2967 defined in function FN, or of a data member thereof. */
2970 self_inlining_addr_expr (tree value
, tree fn
)
2974 if (TREE_CODE (value
) != ADDR_EXPR
)
2977 var
= get_base_address (TREE_OPERAND (value
, 0));
2979 return var
&& auto_var_in_fn_p (var
, fn
);
2982 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2983 lexical block and line number information from base_stmt, if given,
2984 or from the last stmt of the block otherwise. */
2987 insert_init_debug_bind (copy_body_data
*id
,
2988 basic_block bb
, tree var
, tree value
,
2992 gimple_stmt_iterator gsi
;
2995 if (!gimple_in_ssa_p (id
->src_cfun
))
2998 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
3001 tracked_var
= target_for_debug_bind (var
);
3007 gsi
= gsi_last_bb (bb
);
3008 if (!base_stmt
&& !gsi_end_p (gsi
))
3009 base_stmt
= gsi_stmt (gsi
);
3012 note
= gimple_build_debug_bind (tracked_var
, unshare_expr (value
), base_stmt
);
3016 if (!gsi_end_p (gsi
))
3017 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
3019 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3026 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple
*init_stmt
)
3028 /* If VAR represents a zero-sized variable, it's possible that the
3029 assignment statement may result in no gimple statements. */
3032 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3034 /* We can end up with init statements that store to a non-register
3035 from a rhs with a conversion. Handle that here by forcing the
3036 rhs into a temporary. gimple_regimplify_operands is not
3037 prepared to do this for us. */
3038 if (!is_gimple_debug (init_stmt
)
3039 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3040 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3041 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3043 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3044 gimple_expr_type (init_stmt
),
3045 gimple_assign_rhs1 (init_stmt
));
3046 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3048 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3049 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3051 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3052 gimple_regimplify_operands (init_stmt
, &si
);
3054 if (!is_gimple_debug (init_stmt
))
3056 tree def
= gimple_assign_lhs (init_stmt
);
3057 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3062 /* Initialize parameter P with VALUE. If needed, produce init statement
3063 at the end of BB. When BB is NULL, we return init statement to be
3066 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3067 basic_block bb
, tree
*vars
)
3069 gimple
*init_stmt
= NULL
;
3072 tree def
= (gimple_in_ssa_p (cfun
)
3073 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3076 && value
!= error_mark_node
3077 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3079 /* If we can match up types by promotion/demotion do so. */
3080 if (fold_convertible_p (TREE_TYPE (p
), value
))
3081 rhs
= fold_convert (TREE_TYPE (p
), value
);
3084 /* ??? For valid programs we should not end up here.
3085 Still if we end up with truly mismatched types here, fall back
3086 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3087 GIMPLE to the following passes. */
3088 if (!is_gimple_reg_type (TREE_TYPE (value
))
3089 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
3090 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
3092 rhs
= build_zero_cst (TREE_TYPE (p
));
3096 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3097 here since the type of this decl must be visible to the calling
3099 var
= copy_decl_to_var (p
, id
);
3101 /* Declare this new variable. */
3102 DECL_CHAIN (var
) = *vars
;
3105 /* Make gimplifier happy about this variable. */
3106 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3108 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3109 we would not need to create a new variable here at all, if it
3110 weren't for debug info. Still, we can just use the argument
3112 if (TREE_READONLY (p
)
3113 && !TREE_ADDRESSABLE (p
)
3114 && value
&& !TREE_SIDE_EFFECTS (value
)
3117 /* We may produce non-gimple trees by adding NOPs or introduce
3118 invalid sharing when operand is not really constant.
3119 It is not big deal to prohibit constant propagation here as
3120 we will constant propagate in DOM1 pass anyway. */
3121 if (is_gimple_min_invariant (value
)
3122 && useless_type_conversion_p (TREE_TYPE (p
),
3124 /* We have to be very careful about ADDR_EXPR. Make sure
3125 the base variable isn't a local variable of the inlined
3126 function, e.g., when doing recursive inlining, direct or
3127 mutually-recursive or whatever, which is why we don't
3128 just test whether fn == current_function_decl. */
3129 && ! self_inlining_addr_expr (value
, fn
))
3131 insert_decl_map (id
, p
, value
);
3132 insert_debug_decl_map (id
, p
, var
);
3133 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3137 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3138 that way, when the PARM_DECL is encountered, it will be
3139 automatically replaced by the VAR_DECL. */
3140 insert_decl_map (id
, p
, var
);
3142 /* Even if P was TREE_READONLY, the new VAR should not be.
3143 In the original code, we would have constructed a
3144 temporary, and then the function body would have never
3145 changed the value of P. However, now, we will be
3146 constructing VAR directly. The constructor body may
3147 change its value multiple times as it is being
3148 constructed. Therefore, it must not be TREE_READONLY;
3149 the back-end assumes that TREE_READONLY variable is
3150 assigned to only once. */
3151 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
3152 TREE_READONLY (var
) = 0;
3154 /* If there is no setup required and we are in SSA, take the easy route
3155 replacing all SSA names representing the function parameter by the
3156 SSA name passed to function.
3158 We need to construct map for the variable anyway as it might be used
3159 in different SSA names when parameter is set in function.
3161 Do replacement at -O0 for const arguments replaced by constant.
3162 This is important for builtin_constant_p and other construct requiring
3163 constant argument to be visible in inlined function body. */
3164 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3166 || (TREE_READONLY (p
)
3167 && is_gimple_min_invariant (rhs
)))
3168 && (TREE_CODE (rhs
) == SSA_NAME
3169 || is_gimple_min_invariant (rhs
))
3170 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3172 insert_decl_map (id
, def
, rhs
);
3173 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3176 /* If the value of argument is never used, don't care about initializing
3178 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3180 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3181 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3184 /* Initialize this VAR_DECL from the equivalent argument. Convert
3185 the argument to the proper type in case it was promoted. */
3188 if (rhs
== error_mark_node
)
3190 insert_decl_map (id
, p
, var
);
3191 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3194 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3196 /* If we are in SSA form properly remap the default definition
3197 or assign to a dummy SSA name if the parameter is unused and
3198 we are not optimizing. */
3199 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3203 def
= remap_ssa_name (def
, id
);
3204 init_stmt
= gimple_build_assign (def
, rhs
);
3205 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3206 set_ssa_default_def (cfun
, var
, NULL
);
3210 def
= make_ssa_name (var
);
3211 init_stmt
= gimple_build_assign (def
, rhs
);
3215 init_stmt
= gimple_build_assign (var
, rhs
);
3217 if (bb
&& init_stmt
)
3218 insert_init_stmt (id
, bb
, init_stmt
);
3223 /* Generate code to initialize the parameters of the function at the
3224 top of the stack in ID from the GIMPLE_CALL STMT. */
3227 initialize_inlined_parameters (copy_body_data
*id
, gimple
*stmt
,
3228 tree fn
, basic_block bb
)
3233 tree vars
= NULL_TREE
;
3234 tree static_chain
= gimple_call_chain (stmt
);
3236 /* Figure out what the parameters are. */
3237 parms
= DECL_ARGUMENTS (fn
);
3239 /* Loop through the parameter declarations, replacing each with an
3240 equivalent VAR_DECL, appropriately initialized. */
3241 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3244 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3245 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3247 /* After remapping parameters remap their types. This has to be done
3248 in a second loop over all parameters to appropriately remap
3249 variable sized arrays when the size is specified in a
3250 parameter following the array. */
3251 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3253 tree
*varp
= id
->decl_map
->get (p
);
3255 && TREE_CODE (*varp
) == VAR_DECL
)
3257 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3258 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3260 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3261 /* Also remap the default definition if it was remapped
3262 to the default definition of the parameter replacement
3263 by the parameter setup. */
3266 tree
*defp
= id
->decl_map
->get (def
);
3268 && TREE_CODE (*defp
) == SSA_NAME
3269 && SSA_NAME_VAR (*defp
) == var
)
3270 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3275 /* Initialize the static chain. */
3276 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3277 gcc_assert (fn
!= current_function_decl
);
3280 /* No static chain? Seems like a bug in tree-nested.c. */
3281 gcc_assert (static_chain
);
3283 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3286 declare_inline_vars (id
->block
, vars
);
3290 /* Declare a return variable to replace the RESULT_DECL for the
3291 function we are calling. An appropriate DECL_STMT is returned.
3292 The USE_STMT is filled to contain a use of the declaration to
3293 indicate the return value of the function.
3295 RETURN_SLOT, if non-null is place where to store the result. It
3296 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3297 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3299 RETURN_BOUNDS holds a destination for returned bounds.
3301 The return value is a (possibly null) value that holds the result
3302 as seen by the caller. */
3305 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3306 tree return_bounds
, basic_block entry_bb
)
3308 tree callee
= id
->src_fn
;
3309 tree result
= DECL_RESULT (callee
);
3310 tree callee_type
= TREE_TYPE (result
);
3314 /* Handle type-mismatches in the function declaration return type
3315 vs. the call expression. */
3317 caller_type
= TREE_TYPE (modify_dest
);
3319 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3321 /* We don't need to do anything for functions that don't return anything. */
3322 if (VOID_TYPE_P (callee_type
))
3325 /* If there was a return slot, then the return value is the
3326 dereferenced address of that object. */
3329 /* The front end shouldn't have used both return_slot and
3330 a modify expression. */
3331 gcc_assert (!modify_dest
);
3332 if (DECL_BY_REFERENCE (result
))
3334 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3335 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3337 /* We are going to construct *&return_slot and we can't do that
3338 for variables believed to be not addressable.
3340 FIXME: This check possibly can match, because values returned
3341 via return slot optimization are not believed to have address
3342 taken by alias analysis. */
3343 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3344 var
= return_slot_addr
;
3349 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3350 if (TREE_ADDRESSABLE (result
))
3351 mark_addressable (var
);
3353 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3354 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3355 && !DECL_GIMPLE_REG_P (result
)
3357 DECL_GIMPLE_REG_P (var
) = 0;
3362 /* All types requiring non-trivial constructors should have been handled. */
3363 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3365 /* Attempt to avoid creating a new temporary variable. */
3367 && TREE_CODE (modify_dest
) != SSA_NAME
)
3369 bool use_it
= false;
3371 /* We can't use MODIFY_DEST if there's type promotion involved. */
3372 if (!useless_type_conversion_p (callee_type
, caller_type
))
3375 /* ??? If we're assigning to a variable sized type, then we must
3376 reuse the destination variable, because we've no good way to
3377 create variable sized temporaries at this point. */
3378 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3381 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3382 reuse it as the result of the call directly. Don't do this if
3383 it would promote MODIFY_DEST to addressable. */
3384 else if (TREE_ADDRESSABLE (result
))
3388 tree base_m
= get_base_address (modify_dest
);
3390 /* If the base isn't a decl, then it's a pointer, and we don't
3391 know where that's going to go. */
3392 if (!DECL_P (base_m
))
3394 else if (is_global_var (base_m
))
3396 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3397 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3398 && !DECL_GIMPLE_REG_P (result
)
3399 && DECL_GIMPLE_REG_P (base_m
))
3401 else if (!TREE_ADDRESSABLE (base_m
))
3413 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3415 var
= copy_result_decl_to_var (result
, id
);
3416 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3418 /* Do not have the rest of GCC warn about this variable as it should
3419 not be visible to the user. */
3420 TREE_NO_WARNING (var
) = 1;
3422 declare_inline_vars (id
->block
, var
);
3424 /* Build the use expr. If the return type of the function was
3425 promoted, convert it back to the expected type. */
3427 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3429 /* If we can match up types by promotion/demotion do so. */
3430 if (fold_convertible_p (caller_type
, var
))
3431 use
= fold_convert (caller_type
, var
);
3434 /* ??? For valid programs we should not end up here.
3435 Still if we end up with truly mismatched types here, fall back
3436 to using a MEM_REF to not leak invalid GIMPLE to the following
3438 /* Prevent var from being written into SSA form. */
3439 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3440 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3441 DECL_GIMPLE_REG_P (var
) = false;
3442 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3443 TREE_ADDRESSABLE (var
) = true;
3444 use
= fold_build2 (MEM_REF
, caller_type
,
3445 build_fold_addr_expr (var
),
3446 build_int_cst (ptr_type_node
, 0));
3450 STRIP_USELESS_TYPE_CONVERSION (use
);
3452 if (DECL_BY_REFERENCE (result
))
3454 TREE_ADDRESSABLE (var
) = 1;
3455 var
= build_fold_addr_expr (var
);
3459 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3460 way, when the RESULT_DECL is encountered, it will be
3461 automatically replaced by the VAR_DECL.
3463 When returning by reference, ensure that RESULT_DECL remaps to
3465 if (DECL_BY_REFERENCE (result
)
3466 && !is_gimple_val (var
))
3468 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3469 insert_decl_map (id
, result
, temp
);
3470 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3471 it's default_def SSA_NAME. */
3472 if (gimple_in_ssa_p (id
->src_cfun
)
3473 && is_gimple_reg (result
))
3475 temp
= make_ssa_name (temp
);
3476 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3478 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3481 insert_decl_map (id
, result
, var
);
3483 /* Remember this so we can ignore it in remap_decls. */
3486 /* If returned bounds are used, then make var for them. */
3489 tree bndtemp
= create_tmp_var (pointer_bounds_type_node
, "retbnd");
3490 DECL_SEEN_IN_BIND_EXPR_P (bndtemp
) = 1;
3491 TREE_NO_WARNING (bndtemp
) = 1;
3492 declare_inline_vars (id
->block
, bndtemp
);
3494 id
->retbnd
= bndtemp
;
3495 insert_init_stmt (id
, entry_bb
,
3496 gimple_build_assign (bndtemp
, chkp_get_zero_bounds_var ()));
3502 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3503 to a local label. */
3506 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3509 tree fn
= (tree
) fnp
;
3511 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3520 /* Determine if the function can be copied. If so return NULL. If
3521 not return a string describng the reason for failure. */
3524 copy_forbidden (struct function
*fun
, tree fndecl
)
3526 const char *reason
= fun
->cannot_be_copied_reason
;
3530 /* Only examine the function once. */
3531 if (fun
->cannot_be_copied_set
)
3534 /* We cannot copy a function that receives a non-local goto
3535 because we cannot remap the destination label used in the
3536 function that is performing the non-local goto. */
3537 /* ??? Actually, this should be possible, if we work at it.
3538 No doubt there's just a handful of places that simply
3539 assume it doesn't happen and don't substitute properly. */
3540 if (fun
->has_nonlocal_label
)
3542 reason
= G_("function %q+F can never be copied "
3543 "because it receives a non-local goto");
3547 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3548 if (TREE_CODE (decl
) == VAR_DECL
3549 && TREE_STATIC (decl
)
3550 && !DECL_EXTERNAL (decl
)
3551 && DECL_INITIAL (decl
)
3552 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3553 has_label_address_in_static_1
,
3556 reason
= G_("function %q+F can never be copied because it saves "
3557 "address of local label in a static variable");
3562 fun
->cannot_be_copied_reason
= reason
;
3563 fun
->cannot_be_copied_set
= true;
3568 static const char *inline_forbidden_reason
;
3570 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3571 iff a function can not be inlined. Also sets the reason why. */
3574 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3575 struct walk_stmt_info
*wip
)
3577 tree fn
= (tree
) wip
->info
;
3579 gimple
*stmt
= gsi_stmt (*gsi
);
3581 switch (gimple_code (stmt
))
3584 /* Refuse to inline alloca call unless user explicitly forced so as
3585 this may change program's memory overhead drastically when the
3586 function using alloca is called in loop. In GCC present in
3587 SPEC2000 inlining into schedule_block cause it to require 2GB of
3588 RAM instead of 256MB. Don't do so for alloca calls emitted for
3589 VLA objects as those can't cause unbounded growth (they're always
3590 wrapped inside stack_save/stack_restore regions. */
3591 if (gimple_alloca_call_p (stmt
)
3592 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3593 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3595 inline_forbidden_reason
3596 = G_("function %q+F can never be inlined because it uses "
3597 "alloca (override using the always_inline attribute)");
3598 *handled_ops_p
= true;
3602 t
= gimple_call_fndecl (stmt
);
3606 /* We cannot inline functions that call setjmp. */
3607 if (setjmp_call_p (t
))
3609 inline_forbidden_reason
3610 = G_("function %q+F can never be inlined because it uses setjmp");
3611 *handled_ops_p
= true;
3615 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3616 switch (DECL_FUNCTION_CODE (t
))
3618 /* We cannot inline functions that take a variable number of
3620 case BUILT_IN_VA_START
:
3621 case BUILT_IN_NEXT_ARG
:
3622 case BUILT_IN_VA_END
:
3623 inline_forbidden_reason
3624 = G_("function %q+F can never be inlined because it "
3625 "uses variable argument lists");
3626 *handled_ops_p
= true;
3629 case BUILT_IN_LONGJMP
:
3630 /* We can't inline functions that call __builtin_longjmp at
3631 all. The non-local goto machinery really requires the
3632 destination be in a different function. If we allow the
3633 function calling __builtin_longjmp to be inlined into the
3634 function calling __builtin_setjmp, Things will Go Awry. */
3635 inline_forbidden_reason
3636 = G_("function %q+F can never be inlined because "
3637 "it uses setjmp-longjmp exception handling");
3638 *handled_ops_p
= true;
3641 case BUILT_IN_NONLOCAL_GOTO
:
3643 inline_forbidden_reason
3644 = G_("function %q+F can never be inlined because "
3645 "it uses non-local goto");
3646 *handled_ops_p
= true;
3649 case BUILT_IN_RETURN
:
3650 case BUILT_IN_APPLY_ARGS
:
3651 /* If a __builtin_apply_args caller would be inlined,
3652 it would be saving arguments of the function it has
3653 been inlined into. Similarly __builtin_return would
3654 return from the function the inline has been inlined into. */
3655 inline_forbidden_reason
3656 = G_("function %q+F can never be inlined because "
3657 "it uses __builtin_return or __builtin_apply_args");
3658 *handled_ops_p
= true;
3667 t
= gimple_goto_dest (stmt
);
3669 /* We will not inline a function which uses computed goto. The
3670 addresses of its local labels, which may be tucked into
3671 global storage, are of course not constant across
3672 instantiations, which causes unexpected behavior. */
3673 if (TREE_CODE (t
) != LABEL_DECL
)
3675 inline_forbidden_reason
3676 = G_("function %q+F can never be inlined "
3677 "because it contains a computed goto");
3678 *handled_ops_p
= true;
3687 *handled_ops_p
= false;
3691 /* Return true if FNDECL is a function that cannot be inlined into
3695 inline_forbidden_p (tree fndecl
)
3697 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3698 struct walk_stmt_info wi
;
3700 bool forbidden_p
= false;
3702 /* First check for shared reasons not to copy the code. */
3703 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3704 if (inline_forbidden_reason
!= NULL
)
3707 /* Next, walk the statements of the function looking for
3708 constraucts we can't handle, or are non-optimal for inlining. */
3709 hash_set
<tree
> visited_nodes
;
3710 memset (&wi
, 0, sizeof (wi
));
3711 wi
.info
= (void *) fndecl
;
3712 wi
.pset
= &visited_nodes
;
3714 FOR_EACH_BB_FN (bb
, fun
)
3717 gimple_seq seq
= bb_seq (bb
);
3718 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3719 forbidden_p
= (ret
!= NULL
);
3727 /* Return false if the function FNDECL cannot be inlined on account of its
3728 attributes, true otherwise. */
3730 function_attribute_inlinable_p (const_tree fndecl
)
3732 if (targetm
.attribute_table
)
3736 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3738 const_tree name
= TREE_PURPOSE (a
);
3741 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3742 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3743 return targetm
.function_attribute_inlinable_p (fndecl
);
3750 /* Returns nonzero if FN is a function that does not have any
3751 fundamental inline blocking properties. */
3754 tree_inlinable_function_p (tree fn
)
3756 bool inlinable
= true;
3760 /* If we've already decided this function shouldn't be inlined,
3761 there's no need to check again. */
3762 if (DECL_UNINLINABLE (fn
))
3765 /* We only warn for functions declared `inline' by the user. */
3766 do_warning
= (warn_inline
3767 && DECL_DECLARED_INLINE_P (fn
)
3768 && !DECL_NO_INLINE_WARNING_P (fn
)
3769 && !DECL_IN_SYSTEM_HEADER (fn
));
3771 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3774 && always_inline
== NULL
)
3777 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3778 "is suppressed using -fno-inline", fn
);
3782 else if (!function_attribute_inlinable_p (fn
))
3785 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3786 "uses attributes conflicting with inlining", fn
);
3790 else if (inline_forbidden_p (fn
))
3792 /* See if we should warn about uninlinable functions. Previously,
3793 some of these warnings would be issued while trying to expand
3794 the function inline, but that would cause multiple warnings
3795 about functions that would for example call alloca. But since
3796 this a property of the function, just one warning is enough.
3797 As a bonus we can now give more details about the reason why a
3798 function is not inlinable. */
3800 error (inline_forbidden_reason
, fn
);
3801 else if (do_warning
)
3802 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3807 /* Squirrel away the result so that we don't have to check again. */
3808 DECL_UNINLINABLE (fn
) = !inlinable
;
3813 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
3814 word size and take possible memcpy call into account and return
3815 cost based on whether optimizing for size or speed according to SPEED_P. */
3818 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
3822 gcc_assert (!VOID_TYPE_P (type
));
3824 if (TREE_CODE (type
) == VECTOR_TYPE
)
3826 machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3828 = targetm
.vectorize
.preferred_simd_mode (inner
);
3829 int simd_mode_size
= GET_MODE_SIZE (simd
);
3830 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3834 size
= int_size_in_bytes (type
);
3836 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
3837 /* Cost of a memcpy call, 3 arguments and the call. */
3840 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3843 /* Returns cost of operation CODE, according to WEIGHTS */
3846 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3847 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3851 /* These are "free" conversions, or their presumed cost
3852 is folded into other operations. */
3857 case VIEW_CONVERT_EXPR
:
3860 /* Assign cost of 1 to usual operations.
3861 ??? We may consider mapping RTL costs to this. */
3867 case POINTER_PLUS_EXPR
:
3870 case MULT_HIGHPART_EXPR
:
3873 case ADDR_SPACE_CONVERT_EXPR
:
3874 case FIXED_CONVERT_EXPR
:
3875 case FIX_TRUNC_EXPR
:
3893 case TRUTH_ANDIF_EXPR
:
3894 case TRUTH_ORIF_EXPR
:
3895 case TRUTH_AND_EXPR
:
3897 case TRUTH_XOR_EXPR
:
3898 case TRUTH_NOT_EXPR
:
3907 case UNORDERED_EXPR
:
3918 case PREDECREMENT_EXPR
:
3919 case PREINCREMENT_EXPR
:
3920 case POSTDECREMENT_EXPR
:
3921 case POSTINCREMENT_EXPR
:
3923 case REALIGN_LOAD_EXPR
:
3925 case REDUC_MAX_EXPR
:
3926 case REDUC_MIN_EXPR
:
3927 case REDUC_PLUS_EXPR
:
3928 case WIDEN_SUM_EXPR
:
3929 case WIDEN_MULT_EXPR
:
3932 case WIDEN_MULT_PLUS_EXPR
:
3933 case WIDEN_MULT_MINUS_EXPR
:
3934 case WIDEN_LSHIFT_EXPR
:
3936 case VEC_WIDEN_MULT_HI_EXPR
:
3937 case VEC_WIDEN_MULT_LO_EXPR
:
3938 case VEC_WIDEN_MULT_EVEN_EXPR
:
3939 case VEC_WIDEN_MULT_ODD_EXPR
:
3940 case VEC_UNPACK_HI_EXPR
:
3941 case VEC_UNPACK_LO_EXPR
:
3942 case VEC_UNPACK_FLOAT_HI_EXPR
:
3943 case VEC_UNPACK_FLOAT_LO_EXPR
:
3944 case VEC_PACK_TRUNC_EXPR
:
3945 case VEC_PACK_SAT_EXPR
:
3946 case VEC_PACK_FIX_TRUNC_EXPR
:
3947 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3948 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3952 /* Few special cases of expensive operations. This is useful
3953 to avoid inlining on functions having too many of these. */
3954 case TRUNC_DIV_EXPR
:
3956 case FLOOR_DIV_EXPR
:
3957 case ROUND_DIV_EXPR
:
3958 case EXACT_DIV_EXPR
:
3959 case TRUNC_MOD_EXPR
:
3961 case FLOOR_MOD_EXPR
:
3962 case ROUND_MOD_EXPR
:
3964 if (TREE_CODE (op2
) != INTEGER_CST
)
3965 return weights
->div_mod_cost
;
3969 /* We expect a copy assignment with no operator. */
3970 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3976 /* Estimate number of instructions that will be created by expanding
3977 the statements in the statement sequence STMTS.
3978 WEIGHTS contains weights attributed to various constructs. */
3981 estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3984 gimple_stmt_iterator gsi
;
3987 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3988 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3994 /* Estimate number of instructions that will be created by expanding STMT.
3995 WEIGHTS contains weights attributed to various constructs. */
3998 estimate_num_insns (gimple
*stmt
, eni_weights
*weights
)
4001 enum gimple_code code
= gimple_code (stmt
);
4008 /* Try to estimate the cost of assignments. We have three cases to
4010 1) Simple assignments to registers;
4011 2) Stores to things that must live in memory. This includes
4012 "normal" stores to scalars, but also assignments of large
4013 structures, or constructors of big arrays;
4015 Let us look at the first two cases, assuming we have "a = b + C":
4016 <GIMPLE_ASSIGN <var_decl "a">
4017 <plus_expr <var_decl "b"> <constant C>>
4018 If "a" is a GIMPLE register, the assignment to it is free on almost
4019 any target, because "a" usually ends up in a real register. Hence
4020 the only cost of this expression comes from the PLUS_EXPR, and we
4021 can ignore the GIMPLE_ASSIGN.
4022 If "a" is not a GIMPLE register, the assignment to "a" will most
4023 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4024 of moving something into "a", which we compute using the function
4025 estimate_move_cost. */
4026 if (gimple_clobber_p (stmt
))
4027 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4029 lhs
= gimple_assign_lhs (stmt
);
4030 rhs
= gimple_assign_rhs1 (stmt
);
4034 /* Account for the cost of moving to / from memory. */
4035 if (gimple_store_p (stmt
))
4036 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
4037 if (gimple_assign_load_p (stmt
))
4038 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
4040 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
4041 gimple_assign_rhs1 (stmt
),
4042 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
4043 == GIMPLE_BINARY_RHS
4044 ? gimple_assign_rhs2 (stmt
) : NULL
);
4048 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4049 gimple_op (stmt
, 0),
4050 gimple_op (stmt
, 1));
4055 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4056 /* Take into account cost of the switch + guess 2 conditional jumps for
4059 TODO: once the switch expansion logic is sufficiently separated, we can
4060 do better job on estimating cost of the switch. */
4061 if (weights
->time_based
)
4062 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4064 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4072 if (gimple_call_internal_p (stmt
))
4074 else if ((decl
= gimple_call_fndecl (stmt
))
4075 && DECL_BUILT_IN (decl
))
4077 /* Do not special case builtins where we see the body.
4078 This just confuse inliner. */
4079 struct cgraph_node
*node
;
4080 if (!(node
= cgraph_node::get (decl
))
4081 || node
->definition
)
4083 /* For buitins that are likely expanded to nothing or
4084 inlined do not account operand costs. */
4085 else if (is_simple_builtin (decl
))
4087 else if (is_inexpensive_builtin (decl
))
4088 return weights
->target_builtin_call_cost
;
4089 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
4091 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4092 specialize the cheap expansion we do here.
4093 ??? This asks for a more general solution. */
4094 switch (DECL_FUNCTION_CODE (decl
))
4099 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4101 (&TREE_REAL_CST (gimple_call_arg (stmt
, 1)),
4103 return estimate_operator_cost
4104 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4105 gimple_call_arg (stmt
, 0));
4114 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4115 if (gimple_call_lhs (stmt
))
4116 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4117 weights
->time_based
);
4118 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4120 tree arg
= gimple_call_arg (stmt
, i
);
4121 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4122 weights
->time_based
);
4128 return weights
->return_cost
;
4134 case GIMPLE_PREDICT
:
4140 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4141 /* 1000 means infinity. This avoids overflows later
4142 with very long asm statements. */
4149 /* This is either going to be an external function call with one
4150 argument, or two register copy statements plus a goto. */
4153 case GIMPLE_EH_DISPATCH
:
4154 /* ??? This is going to turn into a switch statement. Ideally
4155 we'd have a look at the eh region and estimate the number of
4160 return estimate_num_insns_seq (
4161 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4164 case GIMPLE_EH_FILTER
:
4165 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4168 return estimate_num_insns_seq (gimple_catch_handler (
4169 as_a
<gcatch
*> (stmt
)),
4173 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4174 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4176 /* OMP directives are generally very expensive. */
4178 case GIMPLE_OMP_RETURN
:
4179 case GIMPLE_OMP_SECTIONS_SWITCH
:
4180 case GIMPLE_OMP_ATOMIC_STORE
:
4181 case GIMPLE_OMP_CONTINUE
:
4182 /* ...except these, which are cheap. */
4185 case GIMPLE_OMP_ATOMIC_LOAD
:
4186 return weights
->omp_cost
;
4188 case GIMPLE_OMP_FOR
:
4189 return (weights
->omp_cost
4190 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4191 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4193 case GIMPLE_OMP_PARALLEL
:
4194 case GIMPLE_OMP_TASK
:
4195 case GIMPLE_OMP_CRITICAL
:
4196 case GIMPLE_OMP_MASTER
:
4197 case GIMPLE_OMP_TASKGROUP
:
4198 case GIMPLE_OMP_ORDERED
:
4199 case GIMPLE_OMP_SECTION
:
4200 case GIMPLE_OMP_SECTIONS
:
4201 case GIMPLE_OMP_SINGLE
:
4202 case GIMPLE_OMP_TARGET
:
4203 case GIMPLE_OMP_TEAMS
:
4204 return (weights
->omp_cost
4205 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4207 case GIMPLE_TRANSACTION
:
4208 return (weights
->tm_cost
4209 + estimate_num_insns_seq (gimple_transaction_body (
4210 as_a
<gtransaction
*> (stmt
)),
4220 /* Estimate number of instructions that will be created by expanding
4221 function FNDECL. WEIGHTS contains weights attributed to various
4225 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4227 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4228 gimple_stmt_iterator bsi
;
4232 gcc_assert (my_function
&& my_function
->cfg
);
4233 FOR_EACH_BB_FN (bb
, my_function
)
4235 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4236 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4243 /* Initializes weights used by estimate_num_insns. */
4246 init_inline_once (void)
4248 eni_size_weights
.call_cost
= 1;
4249 eni_size_weights
.indirect_call_cost
= 3;
4250 eni_size_weights
.target_builtin_call_cost
= 1;
4251 eni_size_weights
.div_mod_cost
= 1;
4252 eni_size_weights
.omp_cost
= 40;
4253 eni_size_weights
.tm_cost
= 10;
4254 eni_size_weights
.time_based
= false;
4255 eni_size_weights
.return_cost
= 1;
4257 /* Estimating time for call is difficult, since we have no idea what the
4258 called function does. In the current uses of eni_time_weights,
4259 underestimating the cost does less harm than overestimating it, so
4260 we choose a rather small value here. */
4261 eni_time_weights
.call_cost
= 10;
4262 eni_time_weights
.indirect_call_cost
= 15;
4263 eni_time_weights
.target_builtin_call_cost
= 1;
4264 eni_time_weights
.div_mod_cost
= 10;
4265 eni_time_weights
.omp_cost
= 40;
4266 eni_time_weights
.tm_cost
= 40;
4267 eni_time_weights
.time_based
= true;
4268 eni_time_weights
.return_cost
= 2;
4272 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4275 prepend_lexical_block (tree current_block
, tree new_block
)
4277 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4278 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4279 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4282 /* Add local variables from CALLEE to CALLER. */
4285 add_local_variables (struct function
*callee
, struct function
*caller
,
4291 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4292 if (!can_be_nonlocal (var
, id
))
4294 tree new_var
= remap_decl (var
, id
);
4296 /* Remap debug-expressions. */
4297 if (TREE_CODE (new_var
) == VAR_DECL
4298 && DECL_HAS_DEBUG_EXPR_P (var
)
4301 tree tem
= DECL_DEBUG_EXPR (var
);
4302 bool old_regimplify
= id
->regimplify
;
4303 id
->remapping_type_depth
++;
4304 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4305 id
->remapping_type_depth
--;
4306 id
->regimplify
= old_regimplify
;
4307 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4308 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4310 add_local_decl (caller
, new_var
);
4314 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4315 have brought in or introduced any debug stmts for SRCVAR. */
4318 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4320 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4325 if (TREE_CODE (*remappedvarp
) != VAR_DECL
)
4328 if (*remappedvarp
== id
->retvar
|| *remappedvarp
== id
->retbnd
)
4331 tree tvar
= target_for_debug_bind (*remappedvarp
);
4335 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4337 gimple_seq_add_stmt (bindings
, stmt
);
4340 /* For each inlined variable for which we may have debug bind stmts,
4341 add before GSI a final debug stmt resetting it, marking the end of
4342 its life, so that var-tracking knows it doesn't have to compute
4343 further locations for it. */
4346 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4350 gimple_seq bindings
= NULL
;
4352 if (!gimple_in_ssa_p (id
->src_cfun
))
4355 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4358 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4359 var
; var
= DECL_CHAIN (var
))
4360 reset_debug_binding (id
, var
, &bindings
);
4362 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4363 reset_debug_binding (id
, var
, &bindings
);
4365 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4368 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4371 expand_call_inline (basic_block bb
, gimple
*stmt
, copy_body_data
*id
)
4375 hash_map
<tree
, tree
> *dst
;
4376 hash_map
<tree
, tree
> *st
= NULL
;
4379 tree return_bounds
= NULL
;
4380 struct cgraph_edge
*cg_edge
;
4381 cgraph_inline_failed_t reason
;
4382 basic_block return_block
;
4384 gimple_stmt_iterator gsi
, stmt_gsi
;
4385 bool successfully_inlined
= false;
4386 bool purge_dead_abnormal_edges
;
4390 /* The gimplifier uses input_location in too many places, such as
4391 internal_get_tmp_var (). */
4392 location_t saved_location
= input_location
;
4393 input_location
= gimple_location (stmt
);
4395 /* From here on, we're only interested in CALL_EXPRs. */
4396 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4400 cg_edge
= id
->dst_node
->get_edge (stmt
);
4401 gcc_checking_assert (cg_edge
);
4402 /* First, see if we can figure out what function is being called.
4403 If we cannot, then there is no hope of inlining the function. */
4404 if (cg_edge
->indirect_unknown_callee
)
4406 fn
= cg_edge
->callee
->decl
;
4407 gcc_checking_assert (fn
);
4409 /* If FN is a declaration of a function in a nested scope that was
4410 globally declared inline, we don't set its DECL_INITIAL.
4411 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4412 C++ front-end uses it for cdtors to refer to their internal
4413 declarations, that are not real functions. Fortunately those
4414 don't have trees to be saved, so we can tell by checking their
4416 if (!DECL_INITIAL (fn
)
4417 && DECL_ABSTRACT_ORIGIN (fn
)
4418 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4419 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4421 /* Don't try to inline functions that are not well-suited to inlining. */
4422 if (cg_edge
->inline_failed
)
4424 reason
= cg_edge
->inline_failed
;
4425 /* If this call was originally indirect, we do not want to emit any
4426 inlining related warnings or sorry messages because there are no
4427 guarantees regarding those. */
4428 if (cg_edge
->indirect_inlining_edge
)
4431 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4432 /* For extern inline functions that get redefined we always
4433 silently ignored always_inline flag. Better behavior would
4434 be to be able to keep both bodies and use extern inline body
4435 for inlining, but we can't do that because frontends overwrite
4437 && !cg_edge
->callee
->local
.redefined_extern_inline
4438 /* During early inline pass, report only when optimization is
4440 && (symtab
->global_info_ready
4442 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4443 /* PR 20090218-1_0.c. Body can be provided by another module. */
4444 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4446 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4447 cgraph_inline_failed_string (reason
));
4448 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4449 inform (gimple_location (stmt
), "called from here");
4450 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4451 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4452 "called from this function");
4454 else if (warn_inline
4455 && DECL_DECLARED_INLINE_P (fn
)
4456 && !DECL_NO_INLINE_WARNING_P (fn
)
4457 && !DECL_IN_SYSTEM_HEADER (fn
)
4458 && reason
!= CIF_UNSPECIFIED
4459 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4460 /* Do not warn about not inlined recursive calls. */
4461 && !cg_edge
->recursive_p ()
4462 /* Avoid warnings during early inline pass. */
4463 && symtab
->global_info_ready
)
4465 if (warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4466 fn
, _(cgraph_inline_failed_string (reason
))))
4468 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4469 inform (gimple_location (stmt
), "called from here");
4470 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4471 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4472 "called from this function");
4477 fn
= cg_edge
->callee
->decl
;
4478 cg_edge
->callee
->get_untransformed_body ();
4480 if (flag_checking
&& cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4481 cg_edge
->callee
->verify ();
4483 /* We will be inlining this callee. */
4484 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4485 id
->assign_stmts
.create (0);
4487 /* Update the callers EH personality. */
4488 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4489 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4490 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4492 /* Split the block holding the GIMPLE_CALL. */
4493 e
= split_block (bb
, stmt
);
4495 return_block
= e
->dest
;
4498 /* split_block splits after the statement; work around this by
4499 moving the call into the second block manually. Not pretty,
4500 but seems easier than doing the CFG manipulation by hand
4501 when the GIMPLE_CALL is in the last statement of BB. */
4502 stmt_gsi
= gsi_last_bb (bb
);
4503 gsi_remove (&stmt_gsi
, false);
4505 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4506 been the source of abnormal edges. In this case, schedule
4507 the removal of dead abnormal edges. */
4508 gsi
= gsi_start_bb (return_block
);
4509 if (gsi_end_p (gsi
))
4511 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4512 purge_dead_abnormal_edges
= true;
4516 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4517 purge_dead_abnormal_edges
= false;
4520 stmt_gsi
= gsi_start_bb (return_block
);
4522 /* Build a block containing code to initialize the arguments, the
4523 actual inline expansion of the body, and a label for the return
4524 statements within the function to jump to. The type of the
4525 statement expression is the return type of the function call.
4526 ??? If the call does not have an associated block then we will
4527 remap all callee blocks to NULL, effectively dropping most of
4528 its debug information. This should only happen for calls to
4529 artificial decls inserted by the compiler itself. We need to
4530 either link the inlined blocks into the caller block tree or
4531 not refer to them in any way to not break GC for locations. */
4532 if (gimple_block (stmt
))
4534 id
->block
= make_node (BLOCK
);
4535 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4536 BLOCK_SOURCE_LOCATION (id
->block
)
4537 = LOCATION_LOCUS (gimple_location (stmt
));
4538 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4541 /* Local declarations will be replaced by their equivalents in this
4544 id
->decl_map
= new hash_map
<tree
, tree
>;
4545 dst
= id
->debug_map
;
4546 id
->debug_map
= NULL
;
4548 /* Record the function we are about to inline. */
4550 id
->src_node
= cg_edge
->callee
;
4551 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4552 id
->call_stmt
= stmt
;
4554 /* If the src function contains an IFN_VA_ARG, then so will the dst
4555 function after inlining. */
4556 if ((id
->src_cfun
->curr_properties
& PROP_gimple_lva
) == 0)
4558 struct function
*dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4559 dst_cfun
->curr_properties
&= ~PROP_gimple_lva
;
4562 gcc_assert (!id
->src_cfun
->after_inlining
);
4565 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4567 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4568 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4572 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4574 if (DECL_INITIAL (fn
))
4576 if (gimple_block (stmt
))
4580 prepend_lexical_block (id
->block
,
4581 remap_blocks (DECL_INITIAL (fn
), id
));
4582 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4583 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4585 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4586 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4587 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4588 under it. The parameters can be then evaluated in the debugger,
4589 but don't show in backtraces. */
4590 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4591 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4594 *var
= TREE_CHAIN (v
);
4595 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4596 BLOCK_VARS (id
->block
) = v
;
4599 var
= &TREE_CHAIN (*var
);
4602 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4605 /* Return statements in the function body will be replaced by jumps
4606 to the RET_LABEL. */
4607 gcc_assert (DECL_INITIAL (fn
));
4608 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4610 /* Find the LHS to which the result of this call is assigned. */
4612 if (gimple_call_lhs (stmt
))
4614 modify_dest
= gimple_call_lhs (stmt
);
4616 /* Remember where to copy returned bounds. */
4617 if (gimple_call_with_bounds_p (stmt
)
4618 && TREE_CODE (modify_dest
) == SSA_NAME
)
4620 gcall
*retbnd
= chkp_retbnd_call_by_val (modify_dest
);
4623 return_bounds
= gimple_call_lhs (retbnd
);
4624 /* If returned bounds are not used then just
4625 remove unused call. */
4628 gimple_stmt_iterator iter
= gsi_for_stmt (retbnd
);
4629 gsi_remove (&iter
, true);
4634 /* The function which we are inlining might not return a value,
4635 in which case we should issue a warning that the function
4636 does not return a value. In that case the optimizers will
4637 see that the variable to which the value is assigned was not
4638 initialized. We do not want to issue a warning about that
4639 uninitialized variable. */
4640 if (DECL_P (modify_dest
))
4641 TREE_NO_WARNING (modify_dest
) = 1;
4643 if (gimple_call_return_slot_opt_p (call_stmt
))
4645 return_slot
= modify_dest
;
4652 /* If we are inlining a call to the C++ operator new, we don't want
4653 to use type based alias analysis on the return value. Otherwise
4654 we may get confused if the compiler sees that the inlined new
4655 function returns a pointer which was just deleted. See bug
4657 if (DECL_IS_OPERATOR_NEW (fn
))
4663 /* Declare the return variable for the function. */
4664 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
,
4667 /* Add local vars in this inlined callee to caller. */
4668 add_local_variables (id
->src_cfun
, cfun
, id
);
4670 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4672 fprintf (dump_file
, "Inlining ");
4673 print_generic_expr (dump_file
, id
->src_fn
, 0);
4674 fprintf (dump_file
, " to ");
4675 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4676 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4679 /* This is it. Duplicate the callee body. Assume callee is
4680 pre-gimplified. Note that we must not alter the caller
4681 function in any way before this point, as this CALL_EXPR may be
4682 a self-referential call; if we're calling ourselves, we need to
4683 duplicate our body before altering anything. */
4684 copy_body (id
, cg_edge
->callee
->count
,
4685 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4686 bb
, return_block
, NULL
);
4688 reset_debug_bindings (id
, stmt_gsi
);
4690 /* Reset the escaped solution. */
4691 if (cfun
->gimple_df
)
4692 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4697 delete id
->debug_map
;
4698 id
->debug_map
= dst
;
4700 delete id
->decl_map
;
4703 /* Unlink the calls virtual operands before replacing it. */
4704 unlink_stmt_vdef (stmt
);
4705 if (gimple_vdef (stmt
)
4706 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4707 release_ssa_name (gimple_vdef (stmt
));
4709 /* If the inlined function returns a result that we care about,
4710 substitute the GIMPLE_CALL with an assignment of the return
4711 variable to the LHS of the call. That is, if STMT was
4712 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4713 if (use_retvar
&& gimple_call_lhs (stmt
))
4715 gimple
*old_stmt
= stmt
;
4716 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4717 gsi_replace (&stmt_gsi
, stmt
, false);
4718 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4720 /* Copy bounds if we copy structure with bounds. */
4721 if (chkp_function_instrumented_p (id
->dst_fn
)
4722 && !BOUNDED_P (use_retvar
)
4723 && chkp_type_has_pointer (TREE_TYPE (use_retvar
)))
4724 id
->assign_stmts
.safe_push (stmt
);
4728 /* Handle the case of inlining a function with no return
4729 statement, which causes the return value to become undefined. */
4730 if (gimple_call_lhs (stmt
)
4731 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4733 tree name
= gimple_call_lhs (stmt
);
4734 tree var
= SSA_NAME_VAR (name
);
4735 tree def
= ssa_default_def (cfun
, var
);
4739 /* If the variable is used undefined, make this name
4740 undefined via a move. */
4741 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4742 gsi_replace (&stmt_gsi
, stmt
, true);
4746 /* Otherwise make this variable undefined. */
4747 gsi_remove (&stmt_gsi
, true);
4748 set_ssa_default_def (cfun
, var
, name
);
4749 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4753 gsi_remove (&stmt_gsi
, true);
4756 /* Put returned bounds into the correct place if required. */
4759 gimple
*old_stmt
= SSA_NAME_DEF_STMT (return_bounds
);
4760 gimple
*new_stmt
= gimple_build_assign (return_bounds
, id
->retbnd
);
4761 gimple_stmt_iterator bnd_gsi
= gsi_for_stmt (old_stmt
);
4762 unlink_stmt_vdef (old_stmt
);
4763 gsi_replace (&bnd_gsi
, new_stmt
, false);
4764 maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
);
4765 cgraph_update_edges_for_call_stmt (old_stmt
,
4766 gimple_call_fndecl (old_stmt
),
4770 if (purge_dead_abnormal_edges
)
4772 gimple_purge_dead_eh_edges (return_block
);
4773 gimple_purge_dead_abnormal_call_edges (return_block
);
4776 /* If the value of the new expression is ignored, that's OK. We
4777 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4778 the equivalent inlined version either. */
4779 if (is_gimple_assign (stmt
))
4781 gcc_assert (gimple_assign_single_p (stmt
)
4782 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4783 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4786 /* Copy bounds for all generated assigns that need it. */
4787 for (i
= 0; i
< id
->assign_stmts
.length (); i
++)
4788 chkp_copy_bounds_for_assign (id
->assign_stmts
[i
], cg_edge
);
4789 id
->assign_stmts
.release ();
4791 /* Output the inlining info for this abstract function, since it has been
4792 inlined. If we don't do this now, we can lose the information about the
4793 variables in the function when the blocks get blown away as soon as we
4794 remove the cgraph node. */
4795 if (gimple_block (stmt
))
4796 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4798 /* Update callgraph if needed. */
4799 cg_edge
->callee
->remove ();
4801 id
->block
= NULL_TREE
;
4802 successfully_inlined
= true;
4805 input_location
= saved_location
;
4806 return successfully_inlined
;
4809 /* Expand call statements reachable from STMT_P.
4810 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4811 in a MODIFY_EXPR. */
4814 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4816 gimple_stmt_iterator gsi
;
4817 bool inlined
= false;
4819 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
4821 gimple
*stmt
= gsi_stmt (gsi
);
4824 if (is_gimple_call (stmt
)
4825 && !gimple_call_internal_p (stmt
))
4826 inlined
|= expand_call_inline (bb
, stmt
, id
);
4833 /* Walk all basic blocks created after FIRST and try to fold every statement
4834 in the STATEMENTS pointer set. */
4837 fold_marked_statements (int first
, hash_set
<gimple
*> *statements
)
4839 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4840 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4842 gimple_stmt_iterator gsi
;
4844 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4847 if (statements
->contains (gsi_stmt (gsi
)))
4849 gimple
*old_stmt
= gsi_stmt (gsi
);
4850 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4852 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4854 /* Folding builtins can create multiple instructions,
4855 we need to look at all of them. */
4856 gimple_stmt_iterator i2
= gsi
;
4858 if (fold_stmt (&gsi
))
4861 /* If a builtin at the end of a bb folded into nothing,
4862 the following loop won't work. */
4863 if (gsi_end_p (gsi
))
4865 cgraph_update_edges_for_call_stmt (old_stmt
,
4870 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4875 new_stmt
= gsi_stmt (i2
);
4876 update_stmt (new_stmt
);
4877 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4880 if (new_stmt
== gsi_stmt (gsi
))
4882 /* It is okay to check only for the very last
4883 of these statements. If it is a throwing
4884 statement nothing will change. If it isn't
4885 this can remove EH edges. If that weren't
4886 correct then because some intermediate stmts
4887 throw, but not the last one. That would mean
4888 we'd have to split the block, which we can't
4889 here and we'd loose anyway. And as builtins
4890 probably never throw, this all
4892 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4894 gimple_purge_dead_eh_edges (
4895 BASIC_BLOCK_FOR_FN (cfun
, first
));
4902 else if (fold_stmt (&gsi
))
4904 /* Re-read the statement from GSI as fold_stmt() may
4906 gimple
*new_stmt
= gsi_stmt (gsi
);
4907 update_stmt (new_stmt
);
4909 if (is_gimple_call (old_stmt
)
4910 || is_gimple_call (new_stmt
))
4911 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4914 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4915 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
4922 /* Expand calls to inline functions in the body of FN. */
4925 optimize_inline_calls (tree fn
)
4929 int last
= n_basic_blocks_for_fn (cfun
);
4930 bool inlined_p
= false;
4933 memset (&id
, 0, sizeof (id
));
4935 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
4936 gcc_assert (id
.dst_node
->definition
);
4938 /* Or any functions that aren't finished yet. */
4939 if (current_function_decl
)
4940 id
.dst_fn
= current_function_decl
;
4942 id
.copy_decl
= copy_decl_maybe_to_var
;
4943 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4944 id
.transform_new_cfg
= false;
4945 id
.transform_return_to_modify
= true;
4946 id
.transform_parameter
= true;
4947 id
.transform_lang_insert_block
= NULL
;
4948 id
.statements_to_fold
= new hash_set
<gimple
*>;
4950 push_gimplify_context ();
4952 /* We make no attempts to keep dominance info up-to-date. */
4953 free_dominance_info (CDI_DOMINATORS
);
4954 free_dominance_info (CDI_POST_DOMINATORS
);
4956 /* Register specific gimple functions. */
4957 gimple_register_cfg_hooks ();
4959 /* Reach the trees by walking over the CFG, and note the
4960 enclosing basic-blocks in the call edges. */
4961 /* We walk the blocks going forward, because inlined function bodies
4962 will split id->current_basic_block, and the new blocks will
4963 follow it; we'll trudge through them, processing their CALL_EXPRs
4965 FOR_EACH_BB_FN (bb
, cfun
)
4966 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4968 pop_gimplify_context (NULL
);
4972 struct cgraph_edge
*e
;
4974 id
.dst_node
->verify ();
4976 /* Double check that we inlined everything we are supposed to inline. */
4977 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4978 gcc_assert (e
->inline_failed
);
4981 /* Fold queued statements. */
4982 fold_marked_statements (last
, id
.statements_to_fold
);
4983 delete id
.statements_to_fold
;
4985 gcc_assert (!id
.debug_stmts
.exists ());
4987 /* If we didn't inline into the function there is nothing to do. */
4991 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4994 delete_unreachable_blocks_update_callgraph (&id
);
4996 id
.dst_node
->verify ();
4998 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4999 not possible yet - the IPA passes might make various functions to not
5000 throw and they don't care to proactively update local EH info. This is
5001 done later in fixup_cfg pass that also execute the verification. */
5002 return (TODO_update_ssa
5004 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5005 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
5006 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
5007 ? TODO_rebuild_frequencies
: 0));
5010 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5013 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5015 enum tree_code code
= TREE_CODE (*tp
);
5016 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5018 /* We make copies of most nodes. */
5019 if (IS_EXPR_CODE_CLASS (cl
)
5020 || code
== TREE_LIST
5022 || code
== TYPE_DECL
5023 || code
== OMP_CLAUSE
)
5025 /* Because the chain gets clobbered when we make a copy, we save it
5027 tree chain
= NULL_TREE
, new_tree
;
5029 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5030 chain
= TREE_CHAIN (*tp
);
5032 /* Copy the node. */
5033 new_tree
= copy_node (*tp
);
5037 /* Now, restore the chain, if appropriate. That will cause
5038 walk_tree to walk into the chain as well. */
5039 if (code
== PARM_DECL
5040 || code
== TREE_LIST
5041 || code
== OMP_CLAUSE
)
5042 TREE_CHAIN (*tp
) = chain
;
5044 /* For now, we don't update BLOCKs when we make copies. So, we
5045 have to nullify all BIND_EXPRs. */
5046 if (TREE_CODE (*tp
) == BIND_EXPR
)
5047 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5049 else if (code
== CONSTRUCTOR
)
5051 /* CONSTRUCTOR nodes need special handling because
5052 we need to duplicate the vector of elements. */
5055 new_tree
= copy_node (*tp
);
5056 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5059 else if (code
== STATEMENT_LIST
)
5060 /* We used to just abort on STATEMENT_LIST, but we can run into them
5061 with statement-expressions (c++/40975). */
5062 copy_statement_list (tp
);
5063 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5065 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5067 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5072 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5073 information indicating to what new SAVE_EXPR this one should be mapped,
5074 use that one. Otherwise, create a new node and enter it in ST. FN is
5075 the function into which the copy will be placed. */
5078 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5083 /* See if we already encountered this SAVE_EXPR. */
5086 /* If we didn't already remap this SAVE_EXPR, do so now. */
5089 t
= copy_node (*tp
);
5091 /* Remember this SAVE_EXPR. */
5093 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5098 /* We've already walked into this SAVE_EXPR; don't do it again. */
5103 /* Replace this SAVE_EXPR with the copy. */
5107 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5108 label, copies the declaration and enters it in the splay_tree in DATA (which
5109 is really a 'copy_body_data *'. */
5112 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5113 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5114 struct walk_stmt_info
*wi
)
5116 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5117 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5121 tree decl
= gimple_label_label (stmt
);
5123 /* Copy the decl and remember the copy. */
5124 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5130 static gimple_seq
duplicate_remap_omp_clause_seq (gimple_seq seq
,
5131 struct walk_stmt_info
*wi
);
5133 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5134 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5135 remaps all local declarations to appropriate replacements in gimple
5139 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5141 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5142 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5143 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5147 /* Only a local declaration (variable or label). */
5148 if ((TREE_CODE (expr
) == VAR_DECL
5149 && !TREE_STATIC (expr
))
5150 || TREE_CODE (expr
) == LABEL_DECL
)
5152 /* Lookup the declaration. */
5155 /* If it's there, remap it. */
5160 else if (TREE_CODE (expr
) == STATEMENT_LIST
5161 || TREE_CODE (expr
) == BIND_EXPR
5162 || TREE_CODE (expr
) == SAVE_EXPR
)
5164 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5166 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5167 It's OK for this to happen if it was part of a subtree that
5168 isn't immediately expanded, such as operand 2 of another
5170 if (!TREE_OPERAND (expr
, 1))
5172 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5173 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5176 else if (TREE_CODE (expr
) == OMP_CLAUSE
)
5178 /* Before the omplower pass completes, some OMP clauses can contain
5179 sequences that are neither copied by gimple_seq_copy nor walked by
5180 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5181 in those situations, we have to copy and process them explicitely. */
5183 if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LASTPRIVATE
)
5185 gimple_seq seq
= OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
);
5186 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5187 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
) = seq
;
5189 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LINEAR
)
5191 gimple_seq seq
= OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
);
5192 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5193 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
) = seq
;
5195 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_REDUCTION
)
5197 gimple_seq seq
= OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
);
5198 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5199 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
) = seq
;
5200 seq
= OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
);
5201 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5202 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
) = seq
;
5206 /* Keep iterating. */
5211 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5212 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5213 remaps all local declarations to appropriate replacements in gimple
5217 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5218 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5219 struct walk_stmt_info
*wi
)
5221 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5222 gimple
*gs
= gsi_stmt (*gsip
);
5224 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5226 tree block
= gimple_bind_block (stmt
);
5230 remap_block (&block
, id
);
5231 gimple_bind_set_block (stmt
, block
);
5234 /* This will remap a lot of the same decls again, but this should be
5236 if (gimple_bind_vars (stmt
))
5238 tree old_var
, decls
= gimple_bind_vars (stmt
);
5240 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
5241 if (!can_be_nonlocal (old_var
, id
)
5242 && ! variably_modified_type_p (TREE_TYPE (old_var
), id
->src_fn
))
5243 remap_decl (old_var
, id
);
5245 gcc_checking_assert (!id
->prevent_decl_creation_for_types
);
5246 id
->prevent_decl_creation_for_types
= true;
5247 gimple_bind_set_vars (stmt
, remap_decls (decls
, NULL
, id
));
5248 id
->prevent_decl_creation_for_types
= false;
5252 /* Keep iterating. */
5256 /* Create a copy of SEQ and remap all decls in it. */
5259 duplicate_remap_omp_clause_seq (gimple_seq seq
, struct walk_stmt_info
*wi
)
5264 /* If there are any labels in OMP sequences, they can be only referred to in
5265 the sequence itself and therefore we can do both here. */
5266 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, wi
);
5267 gimple_seq copy
= gimple_seq_copy (seq
);
5268 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, wi
);
5272 /* Copies everything in SEQ and replaces variables and labels local to
5273 current_function_decl. */
5276 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5279 struct walk_stmt_info wi
;
5282 /* There's nothing to do for NULL_TREE. */
5287 memset (&id
, 0, sizeof (id
));
5288 id
.src_fn
= current_function_decl
;
5289 id
.dst_fn
= current_function_decl
;
5290 id
.decl_map
= new hash_map
<tree
, tree
>;
5291 id
.debug_map
= NULL
;
5293 id
.copy_decl
= copy_decl_no_change
;
5294 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5295 id
.transform_new_cfg
= false;
5296 id
.transform_return_to_modify
= false;
5297 id
.transform_parameter
= false;
5298 id
.transform_lang_insert_block
= NULL
;
5300 /* Walk the tree once to find local labels. */
5301 memset (&wi
, 0, sizeof (wi
));
5302 hash_set
<tree
> visited
;
5305 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5307 copy
= gimple_seq_copy (seq
);
5309 /* Walk the copy, remapping decls. */
5310 memset (&wi
, 0, sizeof (wi
));
5312 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5317 delete id
.debug_map
;
5318 if (id
.dependence_map
)
5320 delete id
.dependence_map
;
5321 id
.dependence_map
= NULL
;
5328 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5331 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5340 debug_find_tree (tree top
, tree search
)
5342 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5346 /* Declare the variables created by the inliner. Add all the variables in
5347 VARS to BIND_EXPR. */
5350 declare_inline_vars (tree block
, tree vars
)
5353 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5355 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5356 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5357 add_local_decl (cfun
, t
);
5361 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5364 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5365 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5366 VAR_DECL translation. */
5369 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5371 /* Don't generate debug information for the copy if we wouldn't have
5372 generated it for the copy either. */
5373 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5374 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5376 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5377 declaration inspired this copy. */
5378 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5380 /* The new variable/label has no RTL, yet. */
5381 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5382 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5383 SET_DECL_RTL (copy
, 0);
5385 /* These args would always appear unused, if not for this. */
5386 TREE_USED (copy
) = 1;
5388 /* Set the context for the new declaration. */
5389 if (!DECL_CONTEXT (decl
))
5390 /* Globals stay global. */
5392 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5393 /* Things that weren't in the scope of the function we're inlining
5394 from aren't in the scope we're inlining to, either. */
5396 else if (TREE_STATIC (decl
))
5397 /* Function-scoped static variables should stay in the original
5401 /* Ordinary automatic local variables are now in the scope of the
5403 DECL_CONTEXT (copy
) = id
->dst_fn
;
5409 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5413 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5414 || TREE_CODE (decl
) == RESULT_DECL
);
5416 type
= TREE_TYPE (decl
);
5418 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5419 VAR_DECL
, DECL_NAME (decl
), type
);
5420 if (DECL_PT_UID_SET_P (decl
))
5421 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5422 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5423 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5424 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5425 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5427 return copy_decl_for_dup_finish (id
, decl
, copy
);
5430 /* Like copy_decl_to_var, but create a return slot object instead of a
5431 pointer variable for return by invisible reference. */
5434 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5438 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5439 || TREE_CODE (decl
) == RESULT_DECL
);
5441 type
= TREE_TYPE (decl
);
5442 if (DECL_BY_REFERENCE (decl
))
5443 type
= TREE_TYPE (type
);
5445 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5446 VAR_DECL
, DECL_NAME (decl
), type
);
5447 if (DECL_PT_UID_SET_P (decl
))
5448 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5449 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5450 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5451 if (!DECL_BY_REFERENCE (decl
))
5453 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5454 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5457 return copy_decl_for_dup_finish (id
, decl
, copy
);
5461 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5465 copy
= copy_node (decl
);
5467 /* The COPY is not abstract; it will be generated in DST_FN. */
5468 DECL_ABSTRACT_P (copy
) = false;
5469 lang_hooks
.dup_lang_specific_decl (copy
);
5471 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5472 been taken; it's for internal bookkeeping in expand_goto_internal. */
5473 if (TREE_CODE (copy
) == LABEL_DECL
)
5475 TREE_ADDRESSABLE (copy
) = 0;
5476 LABEL_DECL_UID (copy
) = -1;
5479 return copy_decl_for_dup_finish (id
, decl
, copy
);
5483 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5485 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5486 return copy_decl_to_var (decl
, id
);
5488 return copy_decl_no_change (decl
, id
);
5491 /* Return a copy of the function's argument tree. */
5493 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5494 bitmap args_to_skip
, tree
*vars
)
5497 tree new_parm
= NULL
;
5502 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5503 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5505 tree new_tree
= remap_decl (arg
, id
);
5506 if (TREE_CODE (new_tree
) != PARM_DECL
)
5507 new_tree
= id
->copy_decl (arg
, id
);
5508 lang_hooks
.dup_lang_specific_decl (new_tree
);
5510 parg
= &DECL_CHAIN (new_tree
);
5512 else if (!id
->decl_map
->get (arg
))
5514 /* Make an equivalent VAR_DECL. If the argument was used
5515 as temporary variable later in function, the uses will be
5516 replaced by local variable. */
5517 tree var
= copy_decl_to_var (arg
, id
);
5518 insert_decl_map (id
, arg
, var
);
5519 /* Declare this new variable. */
5520 DECL_CHAIN (var
) = *vars
;
5526 /* Return a copy of the function's static chain. */
5528 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5530 tree
*chain_copy
, *pvar
;
5532 chain_copy
= &static_chain
;
5533 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5535 tree new_tree
= remap_decl (*pvar
, id
);
5536 lang_hooks
.dup_lang_specific_decl (new_tree
);
5537 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5540 return static_chain
;
5543 /* Return true if the function is allowed to be versioned.
5544 This is a guard for the versioning functionality. */
5547 tree_versionable_function_p (tree fndecl
)
5549 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5550 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
5553 /* Delete all unreachable basic blocks and update callgraph.
5554 Doing so is somewhat nontrivial because we need to update all clones and
5555 remove inline function that become unreachable. */
5558 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5560 bool changed
= false;
5561 basic_block b
, next_bb
;
5563 find_unreachable_blocks ();
5565 /* Delete all unreachable basic blocks. */
5567 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5568 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5570 next_bb
= b
->next_bb
;
5572 if (!(b
->flags
& BB_REACHABLE
))
5574 gimple_stmt_iterator bsi
;
5576 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5578 struct cgraph_edge
*e
;
5579 struct cgraph_node
*node
;
5581 id
->dst_node
->remove_stmt_references (gsi_stmt (bsi
));
5583 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5584 &&(e
= id
->dst_node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5586 if (!e
->inline_failed
)
5587 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5591 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5592 && id
->dst_node
->clones
)
5593 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5595 node
->remove_stmt_references (gsi_stmt (bsi
));
5596 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5597 && (e
= node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5599 if (!e
->inline_failed
)
5600 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5606 node
= node
->clones
;
5607 else if (node
->next_sibling_clone
)
5608 node
= node
->next_sibling_clone
;
5611 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5612 node
= node
->clone_of
;
5613 if (node
!= id
->dst_node
)
5614 node
= node
->next_sibling_clone
;
5618 delete_basic_block (b
);
5626 /* Update clone info after duplication. */
5629 update_clone_info (copy_body_data
* id
)
5631 struct cgraph_node
*node
;
5632 if (!id
->dst_node
->clones
)
5634 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5636 /* First update replace maps to match the new body. */
5637 if (node
->clone
.tree_map
)
5640 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5642 struct ipa_replace_map
*replace_info
;
5643 replace_info
= (*node
->clone
.tree_map
)[i
];
5644 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5645 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5649 node
= node
->clones
;
5650 else if (node
->next_sibling_clone
)
5651 node
= node
->next_sibling_clone
;
5654 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5655 node
= node
->clone_of
;
5656 if (node
!= id
->dst_node
)
5657 node
= node
->next_sibling_clone
;
5662 /* Create a copy of a function's tree.
5663 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5664 of the original function and the new copied function
5665 respectively. In case we want to replace a DECL
5666 tree with another tree while duplicating the function's
5667 body, TREE_MAP represents the mapping between these
5668 trees. If UPDATE_CLONES is set, the call_stmt fields
5669 of edges of clones of the function will be updated.
5671 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5673 If SKIP_RETURN is true, the new version will return void.
5674 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5675 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5678 tree_function_versioning (tree old_decl
, tree new_decl
,
5679 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
5680 bool update_clones
, bitmap args_to_skip
,
5681 bool skip_return
, bitmap blocks_to_copy
,
5682 basic_block new_entry
)
5684 struct cgraph_node
*old_version_node
;
5685 struct cgraph_node
*new_version_node
;
5689 struct ipa_replace_map
*replace_info
;
5690 basic_block old_entry_block
, bb
;
5691 auto_vec
<gimple
*, 10> init_stmts
;
5692 tree vars
= NULL_TREE
;
5693 bitmap debug_args_to_skip
= args_to_skip
;
5695 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5696 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5697 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5699 old_version_node
= cgraph_node::get (old_decl
);
5700 gcc_checking_assert (old_version_node
);
5701 new_version_node
= cgraph_node::get (new_decl
);
5702 gcc_checking_assert (new_version_node
);
5704 /* Copy over debug args. */
5705 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5707 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5708 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5709 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5710 old_debug_args
= decl_debug_args_lookup (old_decl
);
5713 new_debug_args
= decl_debug_args_insert (new_decl
);
5714 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5718 /* Output the inlining info for this abstract function, since it has been
5719 inlined. If we don't do this now, we can lose the information about the
5720 variables in the function when the blocks get blown away as soon as we
5721 remove the cgraph node. */
5722 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5724 DECL_ARTIFICIAL (new_decl
) = 1;
5725 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5726 if (DECL_ORIGIN (old_decl
) == old_decl
)
5727 old_version_node
->used_as_abstract_origin
= true;
5728 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5730 /* Prepare the data structures for the tree copy. */
5731 memset (&id
, 0, sizeof (id
));
5733 /* Generate a new name for the new version. */
5734 id
.statements_to_fold
= new hash_set
<gimple
*>;
5736 id
.decl_map
= new hash_map
<tree
, tree
>;
5737 id
.debug_map
= NULL
;
5738 id
.src_fn
= old_decl
;
5739 id
.dst_fn
= new_decl
;
5740 id
.src_node
= old_version_node
;
5741 id
.dst_node
= new_version_node
;
5742 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5743 id
.blocks_to_copy
= blocks_to_copy
;
5745 id
.copy_decl
= copy_decl_no_change
;
5746 id
.transform_call_graph_edges
5747 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5748 id
.transform_new_cfg
= true;
5749 id
.transform_return_to_modify
= false;
5750 id
.transform_parameter
= false;
5751 id
.transform_lang_insert_block
= NULL
;
5753 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5754 (DECL_STRUCT_FUNCTION (old_decl
));
5755 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5756 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5757 initialize_cfun (new_decl
, old_decl
,
5758 old_entry_block
->count
);
5759 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
5760 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5761 = id
.src_cfun
->gimple_df
->ipa_pta
;
5763 /* Copy the function's static chain. */
5764 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5766 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
5767 = copy_static_chain (p
, &id
);
5769 /* If there's a tree_map, prepare for substitution. */
5771 for (i
= 0; i
< tree_map
->length (); i
++)
5774 replace_info
= (*tree_map
)[i
];
5775 if (replace_info
->replace_p
)
5778 if (!replace_info
->old_tree
)
5780 int p
= replace_info
->parm_num
;
5782 tree req_type
, new_type
;
5784 for (parm
= DECL_ARGUMENTS (old_decl
); p
;
5785 parm
= DECL_CHAIN (parm
))
5787 replace_info
->old_tree
= parm
;
5788 parm_num
= replace_info
->parm_num
;
5789 req_type
= TREE_TYPE (parm
);
5790 new_type
= TREE_TYPE (replace_info
->new_tree
);
5791 if (!useless_type_conversion_p (req_type
, new_type
))
5793 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5794 replace_info
->new_tree
5795 = fold_build1 (NOP_EXPR
, req_type
,
5796 replace_info
->new_tree
);
5797 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (new_type
))
5798 replace_info
->new_tree
5799 = fold_build1 (VIEW_CONVERT_EXPR
, req_type
,
5800 replace_info
->new_tree
);
5805 fprintf (dump_file
, " const ");
5806 print_generic_expr (dump_file
,
5807 replace_info
->new_tree
, 0);
5809 " can't be converted to param ");
5810 print_generic_expr (dump_file
, parm
, 0);
5811 fprintf (dump_file
, "\n");
5813 replace_info
->old_tree
= NULL
;
5818 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5819 if (replace_info
->old_tree
)
5821 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5822 replace_info
->new_tree
, id
.src_fn
,
5826 init_stmts
.safe_push (init
);
5827 if (MAY_HAVE_DEBUG_STMTS
&& args_to_skip
)
5833 for (parm
= DECL_ARGUMENTS (old_decl
), p
= 0; parm
;
5834 parm
= DECL_CHAIN (parm
), p
++)
5835 if (parm
== replace_info
->old_tree
)
5843 if (debug_args_to_skip
== args_to_skip
)
5845 debug_args_to_skip
= BITMAP_ALLOC (NULL
);
5846 bitmap_copy (debug_args_to_skip
, args_to_skip
);
5848 bitmap_clear_bit (debug_args_to_skip
, parm_num
);
5854 /* Copy the function's arguments. */
5855 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5856 DECL_ARGUMENTS (new_decl
)
5857 = copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5858 args_to_skip
, &vars
);
5860 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5861 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5863 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5865 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5866 /* Add local vars. */
5867 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5869 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5871 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5873 DECL_RESULT (new_decl
)
5874 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5875 RESULT_DECL
, NULL_TREE
, void_type_node
);
5876 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5877 cfun
->returns_struct
= 0;
5878 cfun
->returns_pcc_struct
= 0;
5883 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5884 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5885 if (gimple_in_ssa_p (id
.src_cfun
)
5886 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5887 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5889 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
5890 insert_decl_map (&id
, old_name
, new_name
);
5891 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5892 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5896 /* Set up the destination functions loop tree. */
5897 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5899 cfun
->curr_properties
&= ~PROP_loops
;
5900 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5901 cfun
->curr_properties
|= PROP_loops
;
5904 /* Copy the Function's body. */
5905 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5906 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
5909 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5910 number_blocks (new_decl
);
5912 /* We want to create the BB unconditionally, so that the addition of
5913 debug stmts doesn't affect BB count, which may in the end cause
5914 codegen differences. */
5915 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5916 while (init_stmts
.length ())
5917 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5918 update_clone_info (&id
);
5920 /* Remap the nonlocal_goto_save_area, if any. */
5921 if (cfun
->nonlocal_goto_save_area
)
5923 struct walk_stmt_info wi
;
5925 memset (&wi
, 0, sizeof (wi
));
5927 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5933 delete id
.debug_map
;
5934 free_dominance_info (CDI_DOMINATORS
);
5935 free_dominance_info (CDI_POST_DOMINATORS
);
5937 fold_marked_statements (0, id
.statements_to_fold
);
5938 delete id
.statements_to_fold
;
5939 delete_unreachable_blocks_update_callgraph (&id
);
5940 if (id
.dst_node
->definition
)
5941 cgraph_edge::rebuild_references ();
5942 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
5944 calculate_dominance_info (CDI_DOMINATORS
);
5945 fix_loop_structure (NULL
);
5947 update_ssa (TODO_update_ssa
);
5949 /* After partial cloning we need to rescale frequencies, so they are
5950 within proper range in the cloned function. */
5953 struct cgraph_edge
*e
;
5954 rebuild_frequencies ();
5956 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5957 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5959 basic_block bb
= gimple_bb (e
->call_stmt
);
5960 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5962 e
->count
= bb
->count
;
5964 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5966 basic_block bb
= gimple_bb (e
->call_stmt
);
5967 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5969 e
->count
= bb
->count
;
5973 if (debug_args_to_skip
&& MAY_HAVE_DEBUG_STMTS
)
5976 vec
<tree
, va_gc
> **debug_args
= NULL
;
5977 unsigned int len
= 0;
5978 for (parm
= DECL_ARGUMENTS (old_decl
), i
= 0;
5979 parm
; parm
= DECL_CHAIN (parm
), i
++)
5980 if (bitmap_bit_p (debug_args_to_skip
, i
) && is_gimple_reg (parm
))
5984 if (debug_args
== NULL
)
5986 debug_args
= decl_debug_args_insert (new_decl
);
5987 len
= vec_safe_length (*debug_args
);
5989 ddecl
= make_node (DEBUG_EXPR_DECL
);
5990 DECL_ARTIFICIAL (ddecl
) = 1;
5991 TREE_TYPE (ddecl
) = TREE_TYPE (parm
);
5992 DECL_MODE (ddecl
) = DECL_MODE (parm
);
5993 vec_safe_push (*debug_args
, DECL_ORIGIN (parm
));
5994 vec_safe_push (*debug_args
, ddecl
);
5996 if (debug_args
!= NULL
)
5998 /* On the callee side, add
6001 stmts to the first bb where var is a VAR_DECL created for the
6002 optimized away parameter in DECL_INITIAL block. This hints
6003 in the debug info that var (whole DECL_ORIGIN is the parm
6004 PARM_DECL) is optimized away, but could be looked up at the
6005 call site as value of D#X there. */
6006 tree var
= vars
, vexpr
;
6007 gimple_stmt_iterator cgsi
6008 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6011 i
= vec_safe_length (*debug_args
);
6015 while (var
!= NULL_TREE
6016 && DECL_ABSTRACT_ORIGIN (var
) != (**debug_args
)[i
])
6017 var
= TREE_CHAIN (var
);
6018 if (var
== NULL_TREE
)
6020 vexpr
= make_node (DEBUG_EXPR_DECL
);
6021 parm
= (**debug_args
)[i
];
6022 DECL_ARTIFICIAL (vexpr
) = 1;
6023 TREE_TYPE (vexpr
) = TREE_TYPE (parm
);
6024 DECL_MODE (vexpr
) = DECL_MODE (parm
);
6025 def_temp
= gimple_build_debug_bind (var
, vexpr
, NULL
);
6026 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6027 def_temp
= gimple_build_debug_source_bind (vexpr
, parm
, NULL
);
6028 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6034 if (debug_args_to_skip
&& debug_args_to_skip
!= args_to_skip
)
6035 BITMAP_FREE (debug_args_to_skip
);
6036 free_dominance_info (CDI_DOMINATORS
);
6037 free_dominance_info (CDI_POST_DOMINATORS
);
6039 gcc_assert (!id
.debug_stmts
.exists ());
6044 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6045 the callee and return the inlined body on success. */
6048 maybe_inline_call_in_expr (tree exp
)
6050 tree fn
= get_callee_fndecl (exp
);
6052 /* We can only try to inline "const" functions. */
6053 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
6055 call_expr_arg_iterator iter
;
6058 hash_map
<tree
, tree
> decl_map
;
6060 /* Remap the parameters. */
6061 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
6063 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
6064 decl_map
.put (param
, arg
);
6066 memset (&id
, 0, sizeof (id
));
6068 id
.dst_fn
= current_function_decl
;
6069 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6070 id
.decl_map
= &decl_map
;
6072 id
.copy_decl
= copy_decl_no_change
;
6073 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6074 id
.transform_new_cfg
= false;
6075 id
.transform_return_to_modify
= true;
6076 id
.transform_parameter
= true;
6077 id
.transform_lang_insert_block
= NULL
;
6079 /* Make sure not to unshare trees behind the front-end's back
6080 since front-end specific mechanisms may rely on sharing. */
6081 id
.regimplify
= false;
6082 id
.do_not_unshare
= true;
6084 /* We're not inside any EH region. */
6087 t
= copy_tree_body (&id
);
6089 /* We can only return something suitable for use in a GENERIC
6091 if (TREE_CODE (t
) == MODIFY_EXPR
)
6092 return TREE_OPERAND (t
, 1);
6098 /* Duplicate a type, fields and all. */
6101 build_duplicate_type (tree type
)
6103 struct copy_body_data id
;
6105 memset (&id
, 0, sizeof (id
));
6106 id
.src_fn
= current_function_decl
;
6107 id
.dst_fn
= current_function_decl
;
6109 id
.decl_map
= new hash_map
<tree
, tree
>;
6110 id
.debug_map
= NULL
;
6111 id
.copy_decl
= copy_decl_no_change
;
6113 type
= remap_type_1 (type
, &id
);
6117 delete id
.debug_map
;
6119 TYPE_CANONICAL (type
) = type
;
6124 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6125 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6129 copy_fn (tree fn
, tree
& parms
, tree
& result
)
6133 hash_map
<tree
, tree
> decl_map
;
6138 memset (&id
, 0, sizeof (id
));
6140 id
.dst_fn
= current_function_decl
;
6141 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6142 id
.decl_map
= &decl_map
;
6144 id
.copy_decl
= copy_decl_no_change
;
6145 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6146 id
.transform_new_cfg
= false;
6147 id
.transform_return_to_modify
= false;
6148 id
.transform_parameter
= true;
6149 id
.transform_lang_insert_block
= NULL
;
6151 /* Make sure not to unshare trees behind the front-end's back
6152 since front-end specific mechanisms may rely on sharing. */
6153 id
.regimplify
= false;
6154 id
.do_not_unshare
= true;
6156 /* We're not inside any EH region. */
6159 /* Remap the parameters and result and return them to the caller. */
6160 for (param
= DECL_ARGUMENTS (fn
);
6162 param
= DECL_CHAIN (param
))
6164 *p
= remap_decl (param
, &id
);
6165 p
= &DECL_CHAIN (*p
);
6168 if (DECL_RESULT (fn
))
6169 result
= remap_decl (DECL_RESULT (fn
), &id
);
6173 return copy_tree_body (&id
);