2 Copyright (C) 2001-2018 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"
57 #include "value-prof.h"
60 #include "stringpool.h"
64 /* I'm not real happy about this, but we need to handle gimple and
67 /* Inlining, Cloning, Versioning, Parallelization
69 Inlining: a function body is duplicated, but the PARM_DECLs are
70 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
71 MODIFY_EXPRs that store to a dedicated returned-value variable.
72 The duplicated eh_region info of the copy will later be appended
73 to the info for the caller; the eh_region info in copied throwing
74 statements and RESX statements are adjusted accordingly.
76 Cloning: (only in C++) We have one body for a con/de/structor, and
77 multiple function decls, each with a unique parameter list.
78 Duplicate the body, using the given splay tree; some parameters
79 will become constants (like 0 or 1).
81 Versioning: a function body is duplicated and the result is a new
82 function rather than into blocks of an existing function as with
83 inlining. Some parameters will become constants.
85 Parallelization: a region of a function is duplicated resulting in
86 a new function. Variables may be replaced with complex expressions
87 to enable shared variable semantics.
89 All of these will simultaneously lookup any callgraph edges. If
90 we're going to inline the duplicated function body, and the given
91 function has some cloned callgraph nodes (one for each place this
92 function will be inlined) those callgraph edges will be duplicated.
93 If we're cloning the body, those callgraph edges will be
94 updated to point into the new body. (Note that the original
95 callgraph node and edge list will not be altered.)
97 See the CALL_EXPR handling case in copy_tree_body_r (). */
101 o In order to make inlining-on-trees work, we pessimized
102 function-local static constants. In particular, they are now
103 always output, even when not addressed. Fix this by treating
104 function-local static constants just like global static
105 constants; the back-end already knows not to output them if they
108 o Provide heuristics to clamp inlining of recursive template
112 /* Weights that estimate_num_insns uses to estimate the size of the
115 eni_weights eni_size_weights
;
117 /* Weights that estimate_num_insns uses to estimate the time necessary
118 to execute the produced code. */
120 eni_weights eni_time_weights
;
124 static tree
declare_return_variable (copy_body_data
*, tree
, tree
,
126 static void remap_block (tree
*, copy_body_data
*);
127 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
128 static void declare_inline_vars (tree
, tree
);
129 static void remap_save_expr (tree
*, hash_map
<tree
, tree
> *, int *);
130 static void prepend_lexical_block (tree current_block
, tree new_block
);
131 static tree
copy_decl_to_var (tree
, copy_body_data
*);
132 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
133 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
134 static gimple_seq
remap_gimple_stmt (gimple
*, copy_body_data
*);
135 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
136 static void insert_init_stmt (copy_body_data
*, basic_block
, gimple
*);
138 /* Insert a tree->tree mapping for ID. Despite the name suggests
139 that the trees should be variables, it is used for more than that. */
142 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
144 id
->decl_map
->put (key
, value
);
146 /* Always insert an identity map as well. If we see this same new
147 node again, we won't want to duplicate it a second time. */
149 id
->decl_map
->put (value
, value
);
152 /* Insert a tree->tree mapping for ID. This is only used for
156 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
158 if (!gimple_in_ssa_p (id
->src_cfun
))
161 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
164 if (!target_for_debug_bind (key
))
167 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
168 gcc_assert (VAR_P (value
));
171 id
->debug_map
= new hash_map
<tree
, tree
>;
173 id
->debug_map
->put (key
, value
);
176 /* If nonzero, we're remapping the contents of inlined debug
177 statements. If negative, an error has occurred, such as a
178 reference to a variable that isn't available in the inlined
180 static int processing_debug_stmt
= 0;
182 /* Construct new SSA name for old NAME. ID is the inline context. */
185 remap_ssa_name (tree name
, copy_body_data
*id
)
190 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
192 n
= id
->decl_map
->get (name
);
194 return unshare_expr (*n
);
196 if (processing_debug_stmt
)
198 if (SSA_NAME_IS_DEFAULT_DEF (name
)
199 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
200 && id
->entry_bb
== NULL
201 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
203 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
205 gimple_stmt_iterator gsi
;
206 tree val
= SSA_NAME_VAR (name
);
208 n
= id
->decl_map
->get (val
);
211 if (TREE_CODE (val
) != PARM_DECL
)
213 processing_debug_stmt
= -1;
216 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
217 DECL_ARTIFICIAL (vexpr
) = 1;
218 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
219 SET_DECL_MODE (vexpr
, DECL_MODE (SSA_NAME_VAR (name
)));
220 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
221 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
225 processing_debug_stmt
= -1;
229 /* Remap anonymous SSA names or SSA names of anonymous decls. */
230 var
= SSA_NAME_VAR (name
);
232 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
234 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
235 && DECL_ARTIFICIAL (var
)
236 && DECL_IGNORED_P (var
)
237 && !DECL_NAME (var
)))
239 struct ptr_info_def
*pi
;
240 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
));
241 if (!var
&& SSA_NAME_IDENTIFIER (name
))
242 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
243 insert_decl_map (id
, name
, new_tree
);
244 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
245 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
246 /* At least IPA points-to info can be directly transferred. */
247 if (id
->src_cfun
->gimple_df
248 && id
->src_cfun
->gimple_df
->ipa_pta
249 && POINTER_TYPE_P (TREE_TYPE (name
))
250 && (pi
= SSA_NAME_PTR_INFO (name
))
253 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
259 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
261 new_tree
= remap_decl (var
, id
);
263 /* We might've substituted constant or another SSA_NAME for
266 Replace the SSA name representing RESULT_DECL by variable during
267 inlining: this saves us from need to introduce PHI node in a case
268 return value is just partly initialized. */
269 if ((VAR_P (new_tree
) || TREE_CODE (new_tree
) == PARM_DECL
)
270 && (!SSA_NAME_VAR (name
)
271 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
272 || !id
->transform_return_to_modify
))
274 struct ptr_info_def
*pi
;
275 new_tree
= make_ssa_name (new_tree
);
276 insert_decl_map (id
, name
, new_tree
);
277 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
278 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
279 /* At least IPA points-to info can be directly transferred. */
280 if (id
->src_cfun
->gimple_df
281 && id
->src_cfun
->gimple_df
->ipa_pta
282 && POINTER_TYPE_P (TREE_TYPE (name
))
283 && (pi
= SSA_NAME_PTR_INFO (name
))
286 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
289 if (SSA_NAME_IS_DEFAULT_DEF (name
))
291 /* By inlining function having uninitialized variable, we might
292 extend the lifetime (variable might get reused). This cause
293 ICE in the case we end up extending lifetime of SSA name across
294 abnormal edge, but also increase register pressure.
296 We simply initialize all uninitialized vars by 0 except
297 for case we are inlining to very first BB. We can avoid
298 this for all BBs that are not inside strongly connected
299 regions of the CFG, but this is expensive to test. */
301 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
302 && (!SSA_NAME_VAR (name
)
303 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
304 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
306 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
308 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
310 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
312 init_stmt
= gimple_build_assign (new_tree
, zero
);
313 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
314 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
318 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
319 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
324 insert_decl_map (id
, name
, new_tree
);
328 /* Remap DECL during the copying of the BLOCK tree for the function. */
331 remap_decl (tree decl
, copy_body_data
*id
)
335 /* We only remap local variables in the current function. */
337 /* See if we have remapped this declaration. */
339 n
= id
->decl_map
->get (decl
);
341 if (!n
&& processing_debug_stmt
)
343 processing_debug_stmt
= -1;
347 /* When remapping a type within copy_gimple_seq_and_replace_locals, all
348 necessary DECLs have already been remapped and we do not want to duplicate
349 a decl coming from outside of the sequence we are copying. */
351 && id
->prevent_decl_creation_for_types
352 && id
->remapping_type_depth
> 0
353 && (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
))
356 /* If we didn't already have an equivalent for this declaration, create one
360 /* Make a copy of the variable or label. */
361 tree t
= id
->copy_decl (decl
, id
);
363 /* Remember it, so that if we encounter this local entity again
364 we can reuse this copy. Do this early because remap_type may
365 need this decl for TYPE_STUB_DECL. */
366 insert_decl_map (id
, decl
, t
);
371 /* Remap types, if necessary. */
372 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
373 if (TREE_CODE (t
) == TYPE_DECL
)
375 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
377 /* Preserve the invariant that DECL_ORIGINAL_TYPE != TREE_TYPE,
378 which is enforced in gen_typedef_die when DECL_ABSTRACT_ORIGIN
379 is not set on the TYPE_DECL, for example in LTO mode. */
380 if (DECL_ORIGINAL_TYPE (t
) == TREE_TYPE (t
))
382 tree x
= build_variant_type_copy (TREE_TYPE (t
));
383 TYPE_STUB_DECL (x
) = TYPE_STUB_DECL (TREE_TYPE (t
));
384 TYPE_NAME (x
) = TYPE_NAME (TREE_TYPE (t
));
385 DECL_ORIGINAL_TYPE (t
) = x
;
389 /* Remap sizes as necessary. */
390 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
391 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
393 /* If fields, do likewise for offset and qualifier. */
394 if (TREE_CODE (t
) == FIELD_DECL
)
396 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
397 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
398 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
404 if (id
->do_not_unshare
)
407 return unshare_expr (*n
);
411 remap_type_1 (tree type
, copy_body_data
*id
)
415 /* We do need a copy. build and register it now. If this is a pointer or
416 reference type, remap the designated type and make a new pointer or
418 if (TREE_CODE (type
) == POINTER_TYPE
)
420 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
422 TYPE_REF_CAN_ALIAS_ALL (type
));
423 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
424 new_tree
= build_type_attribute_qual_variant (new_tree
,
425 TYPE_ATTRIBUTES (type
),
427 insert_decl_map (id
, type
, new_tree
);
430 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
432 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
434 TYPE_REF_CAN_ALIAS_ALL (type
));
435 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
436 new_tree
= build_type_attribute_qual_variant (new_tree
,
437 TYPE_ATTRIBUTES (type
),
439 insert_decl_map (id
, type
, new_tree
);
443 new_tree
= copy_node (type
);
445 insert_decl_map (id
, type
, new_tree
);
447 /* This is a new type, not a copy of an old type. Need to reassociate
448 variants. We can handle everything except the main variant lazily. */
449 t
= TYPE_MAIN_VARIANT (type
);
452 t
= remap_type (t
, id
);
453 TYPE_MAIN_VARIANT (new_tree
) = t
;
454 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
455 TYPE_NEXT_VARIANT (t
) = new_tree
;
459 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
460 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
463 if (TYPE_STUB_DECL (type
))
464 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
466 /* Lazily create pointer and reference types. */
467 TYPE_POINTER_TO (new_tree
) = NULL
;
468 TYPE_REFERENCE_TO (new_tree
) = NULL
;
470 /* Copy all types that may contain references to local variables; be sure to
471 preserve sharing in between type and its main variant when possible. */
472 switch (TREE_CODE (new_tree
))
476 case FIXED_POINT_TYPE
:
479 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
481 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
482 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
484 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
485 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
489 t
= TYPE_MIN_VALUE (new_tree
);
490 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
491 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
493 t
= TYPE_MAX_VALUE (new_tree
);
494 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
495 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
500 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
501 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
502 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
504 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
505 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
506 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
507 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
509 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
513 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
514 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
515 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
517 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
519 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
521 gcc_checking_assert (TYPE_DOMAIN (type
) == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
522 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
525 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
530 case QUAL_UNION_TYPE
:
531 if (TYPE_MAIN_VARIANT (type
) != type
532 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
533 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
538 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
540 t
= remap_decl (f
, id
);
541 DECL_CONTEXT (t
) = new_tree
;
545 TYPE_FIELDS (new_tree
) = nreverse (nf
);
551 /* Shouldn't have been thought variable sized. */
555 /* All variants of type share the same size, so use the already remaped data. */
556 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
558 tree s
= TYPE_SIZE (type
);
559 tree mvs
= TYPE_SIZE (TYPE_MAIN_VARIANT (type
));
560 tree su
= TYPE_SIZE_UNIT (type
);
561 tree mvsu
= TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
));
562 gcc_checking_assert ((TREE_CODE (s
) == PLACEHOLDER_EXPR
563 && (TREE_CODE (mvs
) == PLACEHOLDER_EXPR
))
565 gcc_checking_assert ((TREE_CODE (su
) == PLACEHOLDER_EXPR
566 && (TREE_CODE (mvsu
) == PLACEHOLDER_EXPR
))
568 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
569 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
573 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
574 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
581 remap_type (tree type
, copy_body_data
*id
)
589 /* See if we have remapped this type. */
590 node
= id
->decl_map
->get (type
);
594 /* The type only needs remapping if it's variably modified. */
595 if (! variably_modified_type_p (type
, id
->src_fn
))
597 insert_decl_map (id
, type
, type
);
601 id
->remapping_type_depth
++;
602 tmp
= remap_type_1 (type
, id
);
603 id
->remapping_type_depth
--;
608 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
611 can_be_nonlocal (tree decl
, copy_body_data
*id
)
613 /* We can not duplicate function decls. */
614 if (TREE_CODE (decl
) == FUNCTION_DECL
)
617 /* Local static vars must be non-local or we get multiple declaration
619 if (VAR_P (decl
) && !auto_var_in_fn_p (decl
, id
->src_fn
))
626 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
630 tree new_decls
= NULL_TREE
;
632 /* Remap its variables. */
633 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
637 if (can_be_nonlocal (old_var
, id
))
639 /* We need to add this variable to the local decls as otherwise
640 nothing else will do so. */
641 if (VAR_P (old_var
) && ! DECL_EXTERNAL (old_var
) && cfun
)
642 add_local_decl (cfun
, old_var
);
643 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
644 && !DECL_IGNORED_P (old_var
)
645 && nonlocalized_list
)
646 vec_safe_push (*nonlocalized_list
, old_var
);
650 /* Remap the variable. */
651 new_var
= remap_decl (old_var
, id
);
653 /* If we didn't remap this variable, we can't mess with its
654 TREE_CHAIN. If we remapped this variable to the return slot, it's
655 already declared somewhere else, so don't declare it here. */
657 if (new_var
== id
->retvar
)
661 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
662 && !DECL_IGNORED_P (old_var
)
663 && nonlocalized_list
)
664 vec_safe_push (*nonlocalized_list
, old_var
);
668 gcc_assert (DECL_P (new_var
));
669 DECL_CHAIN (new_var
) = new_decls
;
672 /* Also copy value-expressions. */
673 if (VAR_P (new_var
) && DECL_HAS_VALUE_EXPR_P (new_var
))
675 tree tem
= DECL_VALUE_EXPR (new_var
);
676 bool old_regimplify
= id
->regimplify
;
677 id
->remapping_type_depth
++;
678 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
679 id
->remapping_type_depth
--;
680 id
->regimplify
= old_regimplify
;
681 SET_DECL_VALUE_EXPR (new_var
, tem
);
686 return nreverse (new_decls
);
689 /* Copy the BLOCK to contain remapped versions of the variables
690 therein. And hook the new block into the block-tree. */
693 remap_block (tree
*block
, copy_body_data
*id
)
698 /* Make the new block. */
700 new_block
= make_node (BLOCK
);
701 TREE_USED (new_block
) = TREE_USED (old_block
);
702 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
703 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
704 BLOCK_NONLOCALIZED_VARS (new_block
)
705 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
708 /* Remap its variables. */
709 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
710 &BLOCK_NONLOCALIZED_VARS (new_block
),
713 if (id
->transform_lang_insert_block
)
714 id
->transform_lang_insert_block (new_block
);
716 /* Remember the remapped block. */
717 insert_decl_map (id
, old_block
, new_block
);
720 /* Copy the whole block tree and root it in id->block. */
723 remap_blocks (tree block
, copy_body_data
*id
)
726 tree new_tree
= block
;
731 remap_block (&new_tree
, id
);
732 gcc_assert (new_tree
!= block
);
733 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
734 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
735 /* Blocks are in arbitrary order, but make things slightly prettier and do
736 not swap order when producing a copy. */
737 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
741 /* Remap the block tree rooted at BLOCK to nothing. */
744 remap_blocks_to_null (tree block
, copy_body_data
*id
)
747 insert_decl_map (id
, block
, NULL_TREE
);
748 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
749 remap_blocks_to_null (t
, id
);
752 /* Remap the location info pointed to by LOCUS. */
755 remap_location (location_t locus
, copy_body_data
*id
)
757 if (LOCATION_BLOCK (locus
))
759 tree
*n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
762 return set_block (locus
, *n
);
765 locus
= LOCATION_LOCUS (locus
);
767 if (locus
!= UNKNOWN_LOCATION
&& id
->block
)
768 return set_block (locus
, id
->block
);
774 copy_statement_list (tree
*tp
)
776 tree_stmt_iterator oi
, ni
;
779 new_tree
= alloc_stmt_list ();
780 ni
= tsi_start (new_tree
);
781 oi
= tsi_start (*tp
);
782 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
785 for (; !tsi_end_p (oi
); tsi_next (&oi
))
787 tree stmt
= tsi_stmt (oi
);
788 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
789 /* This copy is not redundant; tsi_link_after will smash this
790 STATEMENT_LIST into the end of the one we're building, and we
791 don't want to do that with the original. */
792 copy_statement_list (&stmt
);
793 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
798 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
800 tree block
= BIND_EXPR_BLOCK (*tp
);
801 /* Copy (and replace) the statement. */
802 copy_tree_r (tp
, walk_subtrees
, NULL
);
805 remap_block (&block
, id
);
806 BIND_EXPR_BLOCK (*tp
) = block
;
809 if (BIND_EXPR_VARS (*tp
))
810 /* This will remap a lot of the same decls again, but this should be
812 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
816 /* Create a new gimple_seq by remapping all the statements in BODY
817 using the inlining information in ID. */
820 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
822 gimple_stmt_iterator si
;
823 gimple_seq new_body
= NULL
;
825 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
827 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
828 gimple_seq_add_seq (&new_body
, new_stmts
);
835 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
836 block using the mapping information in ID. */
839 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
842 tree new_block
, new_vars
;
843 gimple_seq body
, new_body
;
845 /* Copy the statement. Note that we purposely don't use copy_stmt
846 here because we need to remap statements as we copy. */
847 body
= gimple_bind_body (stmt
);
848 new_body
= remap_gimple_seq (body
, id
);
850 new_block
= gimple_bind_block (stmt
);
852 remap_block (&new_block
, id
);
854 /* This will remap a lot of the same decls again, but this should be
856 new_vars
= gimple_bind_vars (stmt
);
858 new_vars
= remap_decls (new_vars
, NULL
, id
);
860 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
865 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
870 if (TREE_CODE (decl
) == SSA_NAME
)
872 decl
= SSA_NAME_VAR (decl
);
877 return (TREE_CODE (decl
) == PARM_DECL
);
880 /* Remap the dependence CLIQUE from the source to the destination function
881 as specified in ID. */
883 static unsigned short
884 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
886 if (clique
== 0 || processing_debug_stmt
)
888 if (!id
->dependence_map
)
889 id
->dependence_map
= new hash_map
<dependence_hash
, unsigned short>;
891 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
893 newc
= ++cfun
->last_clique
;
897 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
898 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
899 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
900 recursing into the children nodes of *TP. */
903 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
905 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
906 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
907 tree fn
= id
->src_fn
;
909 /* For recursive invocations this is no longer the LHS itself. */
910 bool is_lhs
= wi_p
->is_lhs
;
911 wi_p
->is_lhs
= false;
913 if (TREE_CODE (*tp
) == SSA_NAME
)
915 *tp
= remap_ssa_name (*tp
, id
);
918 SSA_NAME_DEF_STMT (*tp
) = wi_p
->stmt
;
921 else if (auto_var_in_fn_p (*tp
, fn
))
923 /* Local variables and labels need to be replaced by equivalent
924 variables. We don't want to copy static variables; there's
925 only one of those, no matter how many times we inline the
926 containing function. Similarly for globals from an outer
930 /* Remap the declaration. */
931 new_decl
= remap_decl (*tp
, id
);
932 gcc_assert (new_decl
);
933 /* Replace this variable with the copy. */
934 STRIP_TYPE_NOPS (new_decl
);
935 /* ??? The C++ frontend uses void * pointer zero to initialize
936 any other type. This confuses the middle-end type verification.
937 As cloned bodies do not go through gimplification again the fixup
938 there doesn't trigger. */
939 if (TREE_CODE (new_decl
) == INTEGER_CST
940 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
941 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
945 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
947 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
949 else if (TREE_CODE (*tp
) == LABEL_DECL
950 && (!DECL_CONTEXT (*tp
)
951 || decl_function_context (*tp
) == id
->src_fn
))
952 /* These may need to be remapped for EH handling. */
953 *tp
= remap_decl (*tp
, id
);
954 else if (TREE_CODE (*tp
) == FIELD_DECL
)
956 /* If the enclosing record type is variably_modified_type_p, the field
957 has already been remapped. Otherwise, it need not be. */
958 tree
*n
= id
->decl_map
->get (*tp
);
963 else if (TYPE_P (*tp
))
964 /* Types may need remapping as well. */
965 *tp
= remap_type (*tp
, id
);
966 else if (CONSTANT_CLASS_P (*tp
))
968 /* If this is a constant, we have to copy the node iff the type
969 will be remapped. copy_tree_r will not copy a constant. */
970 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
972 if (new_type
== TREE_TYPE (*tp
))
975 else if (TREE_CODE (*tp
) == INTEGER_CST
)
976 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
979 *tp
= copy_node (*tp
);
980 TREE_TYPE (*tp
) = new_type
;
985 /* Otherwise, just copy the node. Note that copy_tree_r already
986 knows not to copy VAR_DECLs, etc., so this is safe. */
988 if (TREE_CODE (*tp
) == MEM_REF
)
990 /* We need to re-canonicalize MEM_REFs from inline substitutions
991 that can happen when a pointer argument is an ADDR_EXPR.
992 Recurse here manually to allow that. */
993 tree ptr
= TREE_OPERAND (*tp
, 0);
994 tree type
= remap_type (TREE_TYPE (*tp
), id
);
996 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
997 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
998 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
999 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1000 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1001 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1003 MR_DEPENDENCE_CLIQUE (*tp
)
1004 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1005 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1007 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1008 remapped a parameter as the property might be valid only
1009 for the parameter itself. */
1010 if (TREE_THIS_NOTRAP (old
)
1011 && (!is_parm (TREE_OPERAND (old
, 0))
1012 || (!id
->transform_parameter
&& is_parm (ptr
))))
1013 TREE_THIS_NOTRAP (*tp
) = 1;
1014 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1019 /* Here is the "usual case". Copy this tree node, and then
1020 tweak some special cases. */
1021 copy_tree_r (tp
, walk_subtrees
, NULL
);
1023 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1024 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1026 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1028 /* The copied TARGET_EXPR has never been expanded, even if the
1029 original node was expanded already. */
1030 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1031 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1033 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1035 /* Variable substitution need not be simple. In particular,
1036 the MEM_REF substitution above. Make sure that
1037 TREE_CONSTANT and friends are up-to-date. */
1038 int invariant
= is_gimple_min_invariant (*tp
);
1039 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
1040 recompute_tree_invariant_for_addr_expr (*tp
);
1042 /* If this used to be invariant, but is not any longer,
1043 then regimplification is probably needed. */
1044 if (invariant
&& !is_gimple_min_invariant (*tp
))
1045 id
->regimplify
= true;
1051 /* Update the TREE_BLOCK for the cloned expr. */
1054 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1055 tree old_block
= TREE_BLOCK (*tp
);
1059 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1063 TREE_SET_BLOCK (*tp
, new_block
);
1066 /* Keep iterating. */
1071 /* Called from copy_body_id via walk_tree. DATA is really a
1072 `copy_body_data *'. */
1075 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1077 copy_body_data
*id
= (copy_body_data
*) data
;
1078 tree fn
= id
->src_fn
;
1081 /* Begin by recognizing trees that we'll completely rewrite for the
1082 inlining context. Our output for these trees is completely
1083 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1084 into an edge). Further down, we'll handle trees that get
1085 duplicated and/or tweaked. */
1087 /* When requested, RETURN_EXPRs should be transformed to just the
1088 contained MODIFY_EXPR. The branch semantics of the return will
1089 be handled elsewhere by manipulating the CFG rather than a statement. */
1090 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1092 tree assignment
= TREE_OPERAND (*tp
, 0);
1094 /* If we're returning something, just turn that into an
1095 assignment into the equivalent of the original RESULT_DECL.
1096 If the "assignment" is just the result decl, the result
1097 decl has already been set (e.g. a recent "foo (&result_decl,
1098 ...)"); just toss the entire RETURN_EXPR. */
1099 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1101 /* Replace the RETURN_EXPR with (a copy of) the
1102 MODIFY_EXPR hanging underneath. */
1103 *tp
= copy_node (assignment
);
1105 else /* Else the RETURN_EXPR returns no value. */
1108 return (tree
) (void *)1;
1111 else if (TREE_CODE (*tp
) == SSA_NAME
)
1113 *tp
= remap_ssa_name (*tp
, id
);
1118 /* Local variables and labels need to be replaced by equivalent
1119 variables. We don't want to copy static variables; there's only
1120 one of those, no matter how many times we inline the containing
1121 function. Similarly for globals from an outer function. */
1122 else if (auto_var_in_fn_p (*tp
, fn
))
1126 /* Remap the declaration. */
1127 new_decl
= remap_decl (*tp
, id
);
1128 gcc_assert (new_decl
);
1129 /* Replace this variable with the copy. */
1130 STRIP_TYPE_NOPS (new_decl
);
1134 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1135 copy_statement_list (tp
);
1136 else if (TREE_CODE (*tp
) == SAVE_EXPR
1137 || TREE_CODE (*tp
) == TARGET_EXPR
)
1138 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1139 else if (TREE_CODE (*tp
) == LABEL_DECL
1140 && (! DECL_CONTEXT (*tp
)
1141 || decl_function_context (*tp
) == id
->src_fn
))
1142 /* These may need to be remapped for EH handling. */
1143 *tp
= remap_decl (*tp
, id
);
1144 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1145 copy_bind_expr (tp
, walk_subtrees
, id
);
1146 /* Types may need remapping as well. */
1147 else if (TYPE_P (*tp
))
1148 *tp
= remap_type (*tp
, id
);
1150 /* If this is a constant, we have to copy the node iff the type will be
1151 remapped. copy_tree_r will not copy a constant. */
1152 else if (CONSTANT_CLASS_P (*tp
))
1154 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1156 if (new_type
== TREE_TYPE (*tp
))
1159 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1160 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1163 *tp
= copy_node (*tp
);
1164 TREE_TYPE (*tp
) = new_type
;
1168 /* Otherwise, just copy the node. Note that copy_tree_r already
1169 knows not to copy VAR_DECLs, etc., so this is safe. */
1172 /* Here we handle trees that are not completely rewritten.
1173 First we detect some inlining-induced bogosities for
1175 if (TREE_CODE (*tp
) == MODIFY_EXPR
1176 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1177 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1179 /* Some assignments VAR = VAR; don't generate any rtl code
1180 and thus don't count as variable modification. Avoid
1181 keeping bogosities like 0 = 0. */
1182 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1185 n
= id
->decl_map
->get (decl
);
1189 STRIP_TYPE_NOPS (value
);
1190 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1192 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1193 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1197 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1199 /* Get rid of *& from inline substitutions that can happen when a
1200 pointer argument is an ADDR_EXPR. */
1201 tree decl
= TREE_OPERAND (*tp
, 0);
1202 tree
*n
= id
->decl_map
->get (decl
);
1205 /* If we happen to get an ADDR_EXPR in n->value, strip
1206 it manually here as we'll eventually get ADDR_EXPRs
1207 which lie about their types pointed to. In this case
1208 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1209 but we absolutely rely on that. As fold_indirect_ref
1210 does other useful transformations, try that first, though. */
1211 tree type
= TREE_TYPE (*tp
);
1212 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1214 *tp
= gimple_fold_indirect_ref (ptr
);
1217 type
= remap_type (type
, id
);
1218 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1221 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1222 /* ??? We should either assert here or build
1223 a VIEW_CONVERT_EXPR instead of blindly leaking
1224 incompatible types to our IL. */
1226 *tp
= TREE_OPERAND (ptr
, 0);
1230 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1231 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1232 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1233 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1234 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1235 have remapped a parameter as the property might be
1236 valid only for the parameter itself. */
1237 if (TREE_THIS_NOTRAP (old
)
1238 && (!is_parm (TREE_OPERAND (old
, 0))
1239 || (!id
->transform_parameter
&& is_parm (ptr
))))
1240 TREE_THIS_NOTRAP (*tp
) = 1;
1247 else if (TREE_CODE (*tp
) == MEM_REF
)
1249 /* We need to re-canonicalize MEM_REFs from inline substitutions
1250 that can happen when a pointer argument is an ADDR_EXPR.
1251 Recurse here manually to allow that. */
1252 tree ptr
= TREE_OPERAND (*tp
, 0);
1253 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1255 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1256 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1257 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1258 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1259 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1260 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1262 MR_DEPENDENCE_CLIQUE (*tp
)
1263 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1264 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1266 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1267 remapped a parameter as the property might be valid only
1268 for the parameter itself. */
1269 if (TREE_THIS_NOTRAP (old
)
1270 && (!is_parm (TREE_OPERAND (old
, 0))
1271 || (!id
->transform_parameter
&& is_parm (ptr
))))
1272 TREE_THIS_NOTRAP (*tp
) = 1;
1273 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1278 /* Here is the "usual case". Copy this tree node, and then
1279 tweak some special cases. */
1280 copy_tree_r (tp
, walk_subtrees
, NULL
);
1282 /* If EXPR has block defined, map it to newly constructed block.
1283 When inlining we want EXPRs without block appear in the block
1284 of function call if we are not remapping a type. */
1287 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1288 if (TREE_BLOCK (*tp
))
1291 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1295 TREE_SET_BLOCK (*tp
, new_block
);
1298 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1299 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1301 /* The copied TARGET_EXPR has never been expanded, even if the
1302 original node was expanded already. */
1303 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1305 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1306 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1309 /* Variable substitution need not be simple. In particular, the
1310 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1311 and friends are up-to-date. */
1312 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1314 int invariant
= is_gimple_min_invariant (*tp
);
1315 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1317 /* Handle the case where we substituted an INDIRECT_REF
1318 into the operand of the ADDR_EXPR. */
1319 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1321 tree t
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1322 if (TREE_TYPE (t
) != TREE_TYPE (*tp
))
1323 t
= fold_convert (remap_type (TREE_TYPE (*tp
), id
), t
);
1327 recompute_tree_invariant_for_addr_expr (*tp
);
1329 /* If this used to be invariant, but is not any longer,
1330 then regimplification is probably needed. */
1331 if (invariant
&& !is_gimple_min_invariant (*tp
))
1332 id
->regimplify
= true;
1338 /* Keep iterating. */
1342 /* Helper for remap_gimple_stmt. Given an EH region number for the
1343 source function, map that to the duplicate EH region number in
1344 the destination function. */
1347 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1349 eh_region old_r
, new_r
;
1351 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1352 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1354 return new_r
->index
;
1357 /* Similar, but operate on INTEGER_CSTs. */
1360 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1364 old_nr
= tree_to_shwi (old_t_nr
);
1365 new_nr
= remap_eh_region_nr (old_nr
, id
);
1367 return build_int_cst (integer_type_node
, new_nr
);
1370 /* Helper for copy_bb. Remap statement STMT using the inlining
1371 information in ID. Return the new statement copy. */
1374 remap_gimple_stmt (gimple
*stmt
, copy_body_data
*id
)
1376 gimple
*copy
= NULL
;
1377 struct walk_stmt_info wi
;
1378 bool skip_first
= false;
1379 gimple_seq stmts
= NULL
;
1381 if (is_gimple_debug (stmt
)
1382 && (gimple_debug_nonbind_marker_p (stmt
)
1383 ? !DECL_STRUCT_FUNCTION (id
->dst_fn
)->debug_nonbind_markers
1384 : !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
)))
1387 /* Begin by recognizing trees that we'll completely rewrite for the
1388 inlining context. Our output for these trees is completely
1389 different from our input (e.g. RETURN_EXPR is deleted and morphs
1390 into an edge). Further down, we'll handle trees that get
1391 duplicated and/or tweaked. */
1393 /* When requested, GIMPLE_RETURN should be transformed to just the
1394 contained GIMPLE_ASSIGN. The branch semantics of the return will
1395 be handled elsewhere by manipulating the CFG rather than the
1397 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1399 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1401 /* If we're returning something, just turn that into an
1402 assignment to the equivalent of the original RESULT_DECL.
1403 If RETVAL is just the result decl, the result decl has
1404 already been set (e.g. a recent "foo (&result_decl, ...)");
1405 just toss the entire GIMPLE_RETURN. */
1407 && (TREE_CODE (retval
) != RESULT_DECL
1408 && (TREE_CODE (retval
) != SSA_NAME
1409 || ! SSA_NAME_VAR (retval
)
1410 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1412 copy
= gimple_build_assign (id
->do_not_unshare
1413 ? id
->retvar
: unshare_expr (id
->retvar
),
1415 /* id->retvar is already substituted. Skip it on later remapping. */
1421 else if (gimple_has_substatements (stmt
))
1425 /* When cloning bodies from the C++ front end, we will be handed bodies
1426 in High GIMPLE form. Handle here all the High GIMPLE statements that
1427 have embedded statements. */
1428 switch (gimple_code (stmt
))
1431 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1436 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1437 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1438 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1442 case GIMPLE_EH_FILTER
:
1443 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1444 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1448 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1449 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1450 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1453 case GIMPLE_WITH_CLEANUP_EXPR
:
1454 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1455 copy
= gimple_build_wce (s1
);
1458 case GIMPLE_OMP_PARALLEL
:
1460 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1461 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1462 copy
= gimple_build_omp_parallel
1464 gimple_omp_parallel_clauses (omp_par_stmt
),
1465 gimple_omp_parallel_child_fn (omp_par_stmt
),
1466 gimple_omp_parallel_data_arg (omp_par_stmt
));
1470 case GIMPLE_OMP_TASK
:
1471 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1472 copy
= gimple_build_omp_task
1474 gimple_omp_task_clauses (stmt
),
1475 gimple_omp_task_child_fn (stmt
),
1476 gimple_omp_task_data_arg (stmt
),
1477 gimple_omp_task_copy_fn (stmt
),
1478 gimple_omp_task_arg_size (stmt
),
1479 gimple_omp_task_arg_align (stmt
));
1482 case GIMPLE_OMP_FOR
:
1483 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1484 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1485 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1486 gimple_omp_for_clauses (stmt
),
1487 gimple_omp_for_collapse (stmt
), s2
);
1490 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1492 gimple_omp_for_set_index (copy
, i
,
1493 gimple_omp_for_index (stmt
, i
));
1494 gimple_omp_for_set_initial (copy
, i
,
1495 gimple_omp_for_initial (stmt
, i
));
1496 gimple_omp_for_set_final (copy
, i
,
1497 gimple_omp_for_final (stmt
, i
));
1498 gimple_omp_for_set_incr (copy
, i
,
1499 gimple_omp_for_incr (stmt
, i
));
1500 gimple_omp_for_set_cond (copy
, i
,
1501 gimple_omp_for_cond (stmt
, i
));
1506 case GIMPLE_OMP_MASTER
:
1507 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1508 copy
= gimple_build_omp_master (s1
);
1511 case GIMPLE_OMP_TASKGROUP
:
1512 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1513 copy
= gimple_build_omp_taskgroup (s1
);
1516 case GIMPLE_OMP_ORDERED
:
1517 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1518 copy
= gimple_build_omp_ordered
1520 gimple_omp_ordered_clauses (as_a
<gomp_ordered
*> (stmt
)));
1523 case GIMPLE_OMP_SECTION
:
1524 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1525 copy
= gimple_build_omp_section (s1
);
1528 case GIMPLE_OMP_SECTIONS
:
1529 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1530 copy
= gimple_build_omp_sections
1531 (s1
, gimple_omp_sections_clauses (stmt
));
1534 case GIMPLE_OMP_SINGLE
:
1535 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1536 copy
= gimple_build_omp_single
1537 (s1
, gimple_omp_single_clauses (stmt
));
1540 case GIMPLE_OMP_TARGET
:
1541 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1542 copy
= gimple_build_omp_target
1543 (s1
, gimple_omp_target_kind (stmt
),
1544 gimple_omp_target_clauses (stmt
));
1547 case GIMPLE_OMP_TEAMS
:
1548 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1549 copy
= gimple_build_omp_teams
1550 (s1
, gimple_omp_teams_clauses (stmt
));
1553 case GIMPLE_OMP_CRITICAL
:
1554 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1555 copy
= gimple_build_omp_critical (s1
,
1556 gimple_omp_critical_name
1557 (as_a
<gomp_critical
*> (stmt
)),
1558 gimple_omp_critical_clauses
1559 (as_a
<gomp_critical
*> (stmt
)));
1562 case GIMPLE_TRANSACTION
:
1564 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1565 gtransaction
*new_trans_stmt
;
1566 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1568 copy
= new_trans_stmt
= gimple_build_transaction (s1
);
1569 gimple_transaction_set_subcode (new_trans_stmt
,
1570 gimple_transaction_subcode (old_trans_stmt
));
1571 gimple_transaction_set_label_norm (new_trans_stmt
,
1572 gimple_transaction_label_norm (old_trans_stmt
));
1573 gimple_transaction_set_label_uninst (new_trans_stmt
,
1574 gimple_transaction_label_uninst (old_trans_stmt
));
1575 gimple_transaction_set_label_over (new_trans_stmt
,
1576 gimple_transaction_label_over (old_trans_stmt
));
1586 if (gimple_assign_copy_p (stmt
)
1587 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1588 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1590 /* Here we handle statements that are not completely rewritten.
1591 First we detect some inlining-induced bogosities for
1594 /* Some assignments VAR = VAR; don't generate any rtl code
1595 and thus don't count as variable modification. Avoid
1596 keeping bogosities like 0 = 0. */
1597 tree decl
= gimple_assign_lhs (stmt
), value
;
1600 n
= id
->decl_map
->get (decl
);
1604 STRIP_TYPE_NOPS (value
);
1605 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1610 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1611 in a block that we aren't copying during tree_function_versioning,
1612 just drop the clobber stmt. */
1613 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1615 tree lhs
= gimple_assign_lhs (stmt
);
1616 if (TREE_CODE (lhs
) == MEM_REF
1617 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1619 gimple
*def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1620 if (gimple_bb (def_stmt
)
1621 && !bitmap_bit_p (id
->blocks_to_copy
,
1622 gimple_bb (def_stmt
)->index
))
1627 if (gimple_debug_bind_p (stmt
))
1630 = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1631 gimple_debug_bind_get_value (stmt
),
1633 id
->debug_stmts
.safe_push (copy
);
1634 gimple_seq_add_stmt (&stmts
, copy
);
1637 if (gimple_debug_source_bind_p (stmt
))
1639 gdebug
*copy
= gimple_build_debug_source_bind
1640 (gimple_debug_source_bind_get_var (stmt
),
1641 gimple_debug_source_bind_get_value (stmt
),
1643 id
->debug_stmts
.safe_push (copy
);
1644 gimple_seq_add_stmt (&stmts
, copy
);
1647 if (gimple_debug_nonbind_marker_p (stmt
))
1649 /* If the inlined function has too many debug markers,
1651 if (id
->src_cfun
->debug_marker_count
1652 > PARAM_VALUE (PARAM_MAX_DEBUG_MARKER_COUNT
))
1655 gdebug
*copy
= as_a
<gdebug
*> (gimple_copy (stmt
));
1656 id
->debug_stmts
.safe_push (copy
);
1657 gimple_seq_add_stmt (&stmts
, copy
);
1661 /* Create a new deep copy of the statement. */
1662 copy
= gimple_copy (stmt
);
1664 /* Clear flags that need revisiting. */
1665 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1667 if (gimple_call_tail_p (call_stmt
))
1668 gimple_call_set_tail (call_stmt
, false);
1669 if (gimple_call_from_thunk_p (call_stmt
))
1670 gimple_call_set_from_thunk (call_stmt
, false);
1671 if (gimple_call_internal_p (call_stmt
))
1672 switch (gimple_call_internal_fn (call_stmt
))
1674 case IFN_GOMP_SIMD_LANE
:
1675 case IFN_GOMP_SIMD_VF
:
1676 case IFN_GOMP_SIMD_LAST_LANE
:
1677 case IFN_GOMP_SIMD_ORDERED_START
:
1678 case IFN_GOMP_SIMD_ORDERED_END
:
1679 DECL_STRUCT_FUNCTION (id
->dst_fn
)->has_simduid_loops
= true;
1686 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1687 RESX and EH_DISPATCH. */
1689 switch (gimple_code (copy
))
1693 tree r
, fndecl
= gimple_call_fndecl (copy
);
1694 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1695 switch (DECL_FUNCTION_CODE (fndecl
))
1697 case BUILT_IN_EH_COPY_VALUES
:
1698 r
= gimple_call_arg (copy
, 1);
1699 r
= remap_eh_region_tree_nr (r
, id
);
1700 gimple_call_set_arg (copy
, 1, r
);
1703 case BUILT_IN_EH_POINTER
:
1704 case BUILT_IN_EH_FILTER
:
1705 r
= gimple_call_arg (copy
, 0);
1706 r
= remap_eh_region_tree_nr (r
, id
);
1707 gimple_call_set_arg (copy
, 0, r
);
1714 /* Reset alias info if we didn't apply measures to
1715 keep it valid over inlining by setting DECL_PT_UID. */
1716 if (!id
->src_cfun
->gimple_df
1717 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1718 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1724 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1725 int r
= gimple_resx_region (resx_stmt
);
1726 r
= remap_eh_region_nr (r
, id
);
1727 gimple_resx_set_region (resx_stmt
, r
);
1731 case GIMPLE_EH_DISPATCH
:
1733 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1734 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1735 r
= remap_eh_region_nr (r
, id
);
1736 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1745 /* If STMT has a block defined, map it to the newly constructed block. */
1746 if (gimple_block (copy
))
1749 n
= id
->decl_map
->get (gimple_block (copy
));
1751 gimple_set_block (copy
, *n
);
1754 /* Debug statements ought to be rebuilt and not copied. */
1755 gcc_checking_assert (!is_gimple_debug (copy
));
1757 /* Remap all the operands in COPY. */
1758 memset (&wi
, 0, sizeof (wi
));
1761 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1763 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1765 /* Clear the copied virtual operands. We are not remapping them here
1766 but are going to recreate them from scratch. */
1767 if (gimple_has_mem_ops (copy
))
1769 gimple_set_vdef (copy
, NULL_TREE
);
1770 gimple_set_vuse (copy
, NULL_TREE
);
1773 gimple_seq_add_stmt (&stmts
, copy
);
1778 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1782 copy_bb (copy_body_data
*id
, basic_block bb
,
1783 profile_count num
, profile_count den
)
1785 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1786 basic_block copy_basic_block
;
1790 profile_count::adjust_for_ipa_scaling (&num
, &den
);
1792 /* Search for previous copied basic block. */
1795 prev
= prev
->prev_bb
;
1797 /* create_basic_block() will append every new block to
1798 basic_block_info automatically. */
1799 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
1800 copy_basic_block
->count
= bb
->count
.apply_scale (num
, den
);
1802 copy_gsi
= gsi_start_bb (copy_basic_block
);
1804 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1807 gimple
*stmt
= gsi_stmt (gsi
);
1808 gimple
*orig_stmt
= stmt
;
1809 gimple_stmt_iterator stmts_gsi
;
1810 bool stmt_added
= false;
1812 id
->regimplify
= false;
1813 stmts
= remap_gimple_stmt (stmt
, id
);
1815 if (gimple_seq_empty_p (stmts
))
1820 for (stmts_gsi
= gsi_start (stmts
);
1821 !gsi_end_p (stmts_gsi
); )
1823 stmt
= gsi_stmt (stmts_gsi
);
1825 /* Advance iterator now before stmt is moved to seq_gsi. */
1826 gsi_next (&stmts_gsi
);
1828 if (gimple_nop_p (stmt
))
1831 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
1834 /* With return slot optimization we can end up with
1835 non-gimple (foo *)&this->m, fix that here. */
1836 if (is_gimple_assign (stmt
)
1837 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
1838 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1841 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1842 gimple_assign_rhs1 (stmt
),
1844 GSI_CONTINUE_LINKING
);
1845 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1846 id
->regimplify
= false;
1849 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1852 gimple_regimplify_operands (stmt
, &seq_gsi
);
1860 /* If copy_basic_block has been empty at the start of this iteration,
1861 call gsi_start_bb again to get at the newly added statements. */
1862 if (gsi_end_p (copy_gsi
))
1863 copy_gsi
= gsi_start_bb (copy_basic_block
);
1865 gsi_next (©_gsi
);
1867 /* Process the new statement. The call to gimple_regimplify_operands
1868 possibly turned the statement into multiple statements, we
1869 need to process all of them. */
1875 stmt
= gsi_stmt (copy_gsi
);
1876 call_stmt
= dyn_cast
<gcall
*> (stmt
);
1878 && gimple_call_va_arg_pack_p (call_stmt
)
1880 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
1882 /* __builtin_va_arg_pack () should be replaced by
1883 all arguments corresponding to ... in the caller. */
1887 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
1890 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1893 /* Create the new array of arguments. */
1894 n
= nargs
+ gimple_call_num_args (call_stmt
);
1895 argarray
.create (n
);
1896 argarray
.safe_grow_cleared (n
);
1898 /* Copy all the arguments before '...' */
1899 memcpy (argarray
.address (),
1900 gimple_call_arg_ptr (call_stmt
, 0),
1901 gimple_call_num_args (call_stmt
) * sizeof (tree
));
1903 /* Append the arguments passed in '...' */
1904 memcpy (argarray
.address () + gimple_call_num_args (call_stmt
),
1905 gimple_call_arg_ptr (id
->call_stmt
, 0)
1906 + (gimple_call_num_args (id
->call_stmt
) - nargs
),
1907 nargs
* sizeof (tree
));
1909 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
1912 argarray
.release ();
1914 /* Copy all GIMPLE_CALL flags, location and block, except
1915 GF_CALL_VA_ARG_PACK. */
1916 gimple_call_copy_flags (new_call
, call_stmt
);
1917 gimple_call_set_va_arg_pack (new_call
, false);
1918 gimple_set_location (new_call
, gimple_location (stmt
));
1919 gimple_set_block (new_call
, gimple_block (stmt
));
1920 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
1922 gsi_replace (©_gsi
, new_call
, false);
1927 && (decl
= gimple_call_fndecl (stmt
))
1928 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1929 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
1930 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
1932 /* __builtin_va_arg_pack_len () should be replaced by
1933 the number of anonymous arguments. */
1934 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
1938 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1941 count
= build_int_cst (integer_type_node
, nargs
);
1942 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1943 gsi_replace (©_gsi
, new_stmt
, false);
1948 && gimple_call_internal_p (stmt
)
1949 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
1951 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
1952 gsi_remove (©_gsi
, false);
1956 /* Statements produced by inlining can be unfolded, especially
1957 when we constant propagated some operands. We can't fold
1958 them right now for two reasons:
1959 1) folding require SSA_NAME_DEF_STMTs to be correct
1960 2) we can't change function calls to builtins.
1961 So we just mark statement for later folding. We mark
1962 all new statements, instead just statements that has changed
1963 by some nontrivial substitution so even statements made
1964 foldable indirectly are updated. If this turns out to be
1965 expensive, copy_body can be told to watch for nontrivial
1967 if (id
->statements_to_fold
)
1968 id
->statements_to_fold
->add (stmt
);
1970 /* We're duplicating a CALL_EXPR. Find any corresponding
1971 callgraph edges and update or duplicate them. */
1972 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
1974 struct cgraph_edge
*edge
;
1976 switch (id
->transform_call_graph_edges
)
1978 case CB_CGE_DUPLICATE
:
1979 edge
= id
->src_node
->get_edge (orig_stmt
);
1982 struct cgraph_edge
*old_edge
= edge
;
1983 profile_count old_cnt
= edge
->count
;
1984 edge
= edge
->clone (id
->dst_node
, call_stmt
,
1989 /* Speculative calls consist of two edges - direct and
1990 indirect. Duplicate the whole thing and distribute
1991 frequencies accordingly. */
1992 if (edge
->speculative
)
1994 struct cgraph_edge
*direct
, *indirect
;
1995 struct ipa_ref
*ref
;
1997 gcc_assert (!edge
->indirect_unknown_callee
);
1998 old_edge
->speculative_call_info (direct
, indirect
, ref
);
2000 profile_count indir_cnt
= indirect
->count
;
2001 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2006 profile_probability prob
2007 = indir_cnt
.probability_in (old_cnt
+ indir_cnt
);
2009 = copy_basic_block
->count
.apply_probability (prob
);
2010 edge
->count
= copy_basic_block
->count
- indirect
->count
;
2011 id
->dst_node
->clone_reference (ref
, stmt
);
2014 edge
->count
= copy_basic_block
->count
;
2018 case CB_CGE_MOVE_CLONES
:
2019 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2021 edge
= id
->dst_node
->get_edge (stmt
);
2025 edge
= id
->dst_node
->get_edge (orig_stmt
);
2027 edge
->set_call_stmt (call_stmt
);
2034 /* Constant propagation on argument done during inlining
2035 may create new direct call. Produce an edge for it. */
2037 || (edge
->indirect_inlining_edge
2038 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2039 && id
->dst_node
->definition
2040 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2042 struct cgraph_node
*dest
= cgraph_node::get_create (fn
);
2044 /* We have missing edge in the callgraph. This can happen
2045 when previous inlining turned an indirect call into a
2046 direct call by constant propagating arguments or we are
2047 producing dead clone (for further cloning). In all
2048 other cases we hit a bug (incorrect node sharing is the
2049 most common reason for missing edges). */
2050 gcc_assert (!dest
->definition
2051 || dest
->address_taken
2052 || !id
->src_node
->definition
2053 || !id
->dst_node
->definition
);
2054 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2055 id
->dst_node
->create_edge_including_clones
2056 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2057 CIF_ORIGINALLY_INDIRECT_CALL
);
2059 id
->dst_node
->create_edge (dest
, call_stmt
,
2060 bb
->count
)->inline_failed
2061 = CIF_ORIGINALLY_INDIRECT_CALL
;
2064 fprintf (dump_file
, "Created new direct edge to %s\n",
2069 notice_special_calls (as_a
<gcall
*> (stmt
));
2072 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2073 id
->eh_map
, id
->eh_lp_nr
);
2075 gsi_next (©_gsi
);
2077 while (!gsi_end_p (copy_gsi
));
2079 copy_gsi
= gsi_last_bb (copy_basic_block
);
2082 return copy_basic_block
;
2085 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2086 form is quite easy, since dominator relationship for old basic blocks does
2089 There is however exception where inlining might change dominator relation
2090 across EH edges from basic block within inlined functions destinating
2091 to landing pads in function we inline into.
2093 The function fills in PHI_RESULTs of such PHI nodes if they refer
2094 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2095 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2096 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2097 set, and this means that there will be no overlapping live ranges
2098 for the underlying symbol.
2100 This might change in future if we allow redirecting of EH edges and
2101 we might want to change way build CFG pre-inlining to include
2102 all the possible edges then. */
2104 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2105 bool can_throw
, bool nonlocal_goto
)
2110 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2112 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2118 gcc_assert (e
->flags
& EDGE_EH
);
2121 gcc_assert (!(e
->flags
& EDGE_EH
));
2123 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2129 /* For abnormal goto/call edges the receiver can be the
2130 ENTRY_BLOCK. Do not assert this cannot happen. */
2132 gcc_assert ((e
->flags
& EDGE_EH
)
2133 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2135 re
= find_edge (ret_bb
, e
->dest
);
2136 gcc_checking_assert (re
);
2137 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2138 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2140 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2141 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2147 /* Copy edges from BB into its copy constructed earlier, scale profile
2148 accordingly. Edges will be taken care of later. Assume aux
2149 pointers to point to the copies of each BB. Return true if any
2150 debug stmts are left after a statement that must end the basic block. */
2153 copy_edges_for_bb (basic_block bb
, profile_count num
, profile_count den
,
2154 basic_block ret_bb
, basic_block abnormal_goto_dest
,
2157 basic_block new_bb
= (basic_block
) bb
->aux
;
2160 gimple_stmt_iterator si
;
2161 bool need_debug_cleanup
= false;
2163 /* Use the indices from the original blocks to create edges for the
2165 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2166 if (!(old_edge
->flags
& EDGE_EH
))
2169 int flags
= old_edge
->flags
;
2170 location_t locus
= old_edge
->goto_locus
;
2172 /* Return edges do get a FALLTHRU flag when they get inlined. */
2173 if (old_edge
->dest
->index
== EXIT_BLOCK
2174 && !(flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2175 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2176 flags
|= EDGE_FALLTHRU
;
2179 = make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2180 new_edge
->probability
= old_edge
->probability
;
2181 new_edge
->goto_locus
= remap_location (locus
, id
);
2184 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2187 /* When doing function splitting, we must decreate count of the return block
2188 which was previously reachable by block we did not copy. */
2189 if (single_succ_p (bb
) && single_succ_edge (bb
)->dest
->index
== EXIT_BLOCK
)
2190 FOR_EACH_EDGE (old_edge
, ei
, bb
->preds
)
2191 if (old_edge
->src
->index
!= ENTRY_BLOCK
2192 && !old_edge
->src
->aux
)
2193 new_bb
->count
-= old_edge
->count ().apply_scale (num
, den
);
2195 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2198 bool can_throw
, nonlocal_goto
;
2200 copy_stmt
= gsi_stmt (si
);
2201 if (!is_gimple_debug (copy_stmt
))
2202 update_stmt (copy_stmt
);
2204 /* Do this before the possible split_block. */
2207 /* If this tree could throw an exception, there are two
2208 cases where we need to add abnormal edge(s): the
2209 tree wasn't in a region and there is a "current
2210 region" in the caller; or the original tree had
2211 EH edges. In both cases split the block after the tree,
2212 and add abnormal edge(s) as needed; we need both
2213 those from the callee and the caller.
2214 We check whether the copy can throw, because the const
2215 propagation can change an INDIRECT_REF which throws
2216 into a COMPONENT_REF which doesn't. If the copy
2217 can throw, the original could also throw. */
2218 can_throw
= stmt_can_throw_internal (copy_stmt
);
2220 = (stmt_can_make_abnormal_goto (copy_stmt
)
2221 && !computed_goto_p (copy_stmt
));
2223 if (can_throw
|| nonlocal_goto
)
2225 if (!gsi_end_p (si
))
2227 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2230 need_debug_cleanup
= true;
2232 if (!gsi_end_p (si
))
2233 /* Note that bb's predecessor edges aren't necessarily
2234 right at this point; split_block doesn't care. */
2236 edge e
= split_block (new_bb
, copy_stmt
);
2239 new_bb
->aux
= e
->src
->aux
;
2240 si
= gsi_start_bb (new_bb
);
2244 bool update_probs
= false;
2246 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2248 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2249 update_probs
= true;
2253 make_eh_edges (copy_stmt
);
2254 update_probs
= true;
2257 /* EH edges may not match old edges. Copy as much as possible. */
2262 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2264 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2265 if ((old_edge
->flags
& EDGE_EH
)
2266 && (e
= find_edge (copy_stmt_bb
,
2267 (basic_block
) old_edge
->dest
->aux
))
2268 && (e
->flags
& EDGE_EH
))
2269 e
->probability
= old_edge
->probability
;
2271 FOR_EACH_EDGE (e
, ei
, copy_stmt_bb
->succs
)
2272 if ((e
->flags
& EDGE_EH
) && !e
->probability
.initialized_p ())
2273 e
->probability
= profile_probability::never ();
2277 /* If the call we inline cannot make abnormal goto do not add
2278 additional abnormal edges but only retain those already present
2279 in the original function body. */
2280 if (abnormal_goto_dest
== NULL
)
2281 nonlocal_goto
= false;
2284 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2286 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2287 nonlocal_goto
= false;
2288 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2289 in OpenMP regions which aren't allowed to be left abnormally.
2290 So, no need to add abnormal edge in that case. */
2291 else if (is_gimple_call (copy_stmt
)
2292 && gimple_call_internal_p (copy_stmt
)
2293 && (gimple_call_internal_fn (copy_stmt
)
2294 == IFN_ABNORMAL_DISPATCHER
)
2295 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2296 nonlocal_goto
= false;
2298 make_single_succ_edge (copy_stmt_bb
, abnormal_goto_dest
,
2302 if ((can_throw
|| nonlocal_goto
)
2303 && gimple_in_ssa_p (cfun
))
2304 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2305 can_throw
, nonlocal_goto
);
2307 return need_debug_cleanup
;
2310 /* Copy the PHIs. All blocks and edges are copied, some blocks
2311 was possibly split and new outgoing EH edges inserted.
2312 BB points to the block of original function and AUX pointers links
2313 the original and newly copied blocks. */
2316 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2318 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2323 bool inserted
= false;
2325 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2331 res
= PHI_RESULT (phi
);
2333 if (!virtual_operand_p (res
))
2335 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2336 if (EDGE_COUNT (new_bb
->preds
) == 0)
2338 /* Technically we'd want a SSA_DEFAULT_DEF here... */
2339 SSA_NAME_DEF_STMT (new_res
) = gimple_build_nop ();
2343 new_phi
= create_phi_node (new_res
, new_bb
);
2344 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2346 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
,
2353 /* When doing partial cloning, we allow PHIs on the entry
2354 block as long as all the arguments are the same.
2355 Find any input edge to see argument to copy. */
2357 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2358 if (!old_edge
->src
->aux
)
2361 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2363 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2364 gcc_assert (new_arg
);
2365 /* With return slot optimization we can end up with
2366 non-gimple (foo *)&this->m, fix that here. */
2367 if (TREE_CODE (new_arg
) != SSA_NAME
2368 && TREE_CODE (new_arg
) != FUNCTION_DECL
2369 && !is_gimple_val (new_arg
))
2371 gimple_seq stmts
= NULL
;
2372 new_arg
= force_gimple_operand (new_arg
, &stmts
, true,
2374 gsi_insert_seq_on_edge (new_edge
, stmts
);
2377 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2378 locus
= remap_location (locus
, id
);
2379 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2385 /* Commit the delayed edge insertions. */
2387 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2388 gsi_commit_one_edge_insert (new_edge
, NULL
);
2392 /* Wrapper for remap_decl so it can be used as a callback. */
2395 remap_decl_1 (tree decl
, void *data
)
2397 return remap_decl (decl
, (copy_body_data
*) data
);
2400 /* Build struct function and associated datastructures for the new clone
2401 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2402 the cfun to the function of new_fndecl (and current_function_decl too). */
2405 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, profile_count count
)
2407 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2409 if (!DECL_ARGUMENTS (new_fndecl
))
2410 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2411 if (!DECL_RESULT (new_fndecl
))
2412 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2414 /* Register specific tree functions. */
2415 gimple_register_cfg_hooks ();
2417 /* Get clean struct function. */
2418 push_struct_function (new_fndecl
);
2420 /* We will rebuild these, so just sanity check that they are empty. */
2421 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2422 gcc_assert (cfun
->local_decls
== NULL
);
2423 gcc_assert (cfun
->cfg
== NULL
);
2424 gcc_assert (cfun
->decl
== new_fndecl
);
2426 /* Copy items we preserve during cloning. */
2427 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2428 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2429 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2430 cfun
->curr_properties
= src_cfun
->curr_properties
;
2431 cfun
->last_verified
= src_cfun
->last_verified
;
2432 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2433 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2434 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2435 cfun
->stdarg
= src_cfun
->stdarg
;
2436 cfun
->after_inlining
= src_cfun
->after_inlining
;
2437 cfun
->can_throw_non_call_exceptions
2438 = src_cfun
->can_throw_non_call_exceptions
;
2439 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2440 cfun
->returns_struct
= src_cfun
->returns_struct
;
2441 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2443 init_empty_tree_cfg ();
2445 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2447 profile_count num
= count
;
2448 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2449 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2451 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2452 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2453 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2454 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2455 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2456 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2458 init_eh_for_function ();
2460 if (src_cfun
->gimple_df
)
2462 init_tree_ssa (cfun
);
2463 cfun
->gimple_df
->in_ssa_p
= src_cfun
->gimple_df
->in_ssa_p
;
2464 if (cfun
->gimple_df
->in_ssa_p
)
2465 init_ssa_operands (cfun
);
2469 /* Helper function for copy_cfg_body. Move debug stmts from the end
2470 of NEW_BB to the beginning of successor basic blocks when needed. If the
2471 successor has multiple predecessors, reset them, otherwise keep
2475 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2479 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2482 || gsi_one_before_end_p (si
)
2483 || !(stmt_can_throw_internal (gsi_stmt (si
))
2484 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2487 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2489 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2490 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2491 while (is_gimple_debug (gsi_stmt (ssi
)))
2493 gimple
*stmt
= gsi_stmt (ssi
);
2498 /* For the last edge move the debug stmts instead of copying
2500 if (ei_one_before_end_p (ei
))
2504 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2506 gimple_debug_bind_reset_value (stmt
);
2507 gimple_set_location (stmt
, UNKNOWN_LOCATION
);
2509 gsi_remove (&si
, false);
2510 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2514 if (gimple_debug_bind_p (stmt
))
2516 var
= gimple_debug_bind_get_var (stmt
);
2517 if (single_pred_p (e
->dest
))
2519 value
= gimple_debug_bind_get_value (stmt
);
2520 value
= unshare_expr (value
);
2521 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2524 new_stmt
= gimple_build_debug_bind (var
, NULL_TREE
, NULL
);
2526 else if (gimple_debug_source_bind_p (stmt
))
2528 var
= gimple_debug_source_bind_get_var (stmt
);
2529 value
= gimple_debug_source_bind_get_value (stmt
);
2530 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2532 else if (gimple_debug_nonbind_marker_p (stmt
))
2533 new_stmt
= as_a
<gdebug
*> (gimple_copy (stmt
));
2536 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2537 id
->debug_stmts
.safe_push (new_stmt
);
2543 /* Make a copy of the sub-loops of SRC_PARENT and place them
2544 as siblings of DEST_PARENT. */
2547 copy_loops (copy_body_data
*id
,
2548 struct loop
*dest_parent
, struct loop
*src_parent
)
2550 struct loop
*src_loop
= src_parent
->inner
;
2553 if (!id
->blocks_to_copy
2554 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2556 struct loop
*dest_loop
= alloc_loop ();
2558 /* Assign the new loop its header and latch and associate
2559 those with the new loop. */
2560 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2561 dest_loop
->header
->loop_father
= dest_loop
;
2562 if (src_loop
->latch
!= NULL
)
2564 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2565 dest_loop
->latch
->loop_father
= dest_loop
;
2568 /* Copy loop meta-data. */
2569 copy_loop_info (src_loop
, dest_loop
);
2571 /* Finally place it into the loop array and the loop tree. */
2572 place_new_loop (cfun
, dest_loop
);
2573 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2575 dest_loop
->safelen
= src_loop
->safelen
;
2576 if (src_loop
->unroll
)
2578 dest_loop
->unroll
= src_loop
->unroll
;
2579 cfun
->has_unroll
= true;
2581 dest_loop
->dont_vectorize
= src_loop
->dont_vectorize
;
2582 if (src_loop
->force_vectorize
)
2584 dest_loop
->force_vectorize
= true;
2585 cfun
->has_force_vectorize_loops
= true;
2587 if (src_loop
->simduid
)
2589 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2590 cfun
->has_simduid_loops
= true;
2594 copy_loops (id
, dest_loop
, src_loop
);
2596 src_loop
= src_loop
->next
;
2600 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2603 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2605 gimple_stmt_iterator si
;
2606 gimple
*last
= last_stmt (bb
);
2607 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2609 gimple
*stmt
= gsi_stmt (si
);
2610 if (is_gimple_call (stmt
))
2612 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2615 edge
->redirect_call_stmt_to_callee ();
2616 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
2617 gimple_purge_dead_eh_edges (bb
);
2623 /* Make a copy of the body of FN so that it can be inserted inline in
2624 another function. Walks FN via CFG, returns new fndecl. */
2627 copy_cfg_body (copy_body_data
* id
,
2628 basic_block entry_block_map
, basic_block exit_block_map
,
2629 basic_block new_entry
)
2631 tree callee_fndecl
= id
->src_fn
;
2632 /* Original cfun for the callee, doesn't change. */
2633 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2634 struct function
*cfun_to_copy
;
2636 tree new_fndecl
= NULL
;
2637 bool need_debug_cleanup
= false;
2639 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2640 profile_count num
= entry_block_map
->count
;
2642 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2644 /* Register specific tree functions. */
2645 gimple_register_cfg_hooks ();
2647 /* If we are inlining just region of the function, make sure to connect
2648 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2649 part of loop, we must compute frequency and probability of
2650 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2651 probabilities of edges incoming from nonduplicated region. */
2656 den
= profile_count::zero ();
2658 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2661 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= den
;
2664 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2666 /* Must have a CFG here at this point. */
2667 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2668 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2671 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2672 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2673 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2674 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2676 /* Duplicate any exception-handling regions. */
2678 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2681 /* Use aux pointers to map the original blocks to copy. */
2682 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2683 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2685 basic_block new_bb
= copy_bb (id
, bb
, num
, den
);
2688 new_bb
->loop_father
= entry_block_map
->loop_father
;
2691 last
= last_basic_block_for_fn (cfun
);
2693 /* Now that we've duplicated the blocks, duplicate their edges. */
2694 basic_block abnormal_goto_dest
= NULL
;
2696 && stmt_can_make_abnormal_goto (id
->call_stmt
))
2698 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
2700 bb
= gimple_bb (id
->call_stmt
);
2702 if (gsi_end_p (gsi
))
2703 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2705 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2706 if (!id
->blocks_to_copy
2707 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2708 need_debug_cleanup
|= copy_edges_for_bb (bb
, num
, den
, exit_block_map
,
2709 abnormal_goto_dest
, id
);
2713 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
,
2715 e
->probability
= profile_probability::always ();
2718 /* Duplicate the loop tree, if available and wanted. */
2719 if (loops_for_fn (src_cfun
) != NULL
2720 && current_loops
!= NULL
)
2722 copy_loops (id
, entry_block_map
->loop_father
,
2723 get_loop (src_cfun
, 0));
2724 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2725 loops_state_set (LOOPS_NEED_FIXUP
);
2728 /* If the loop tree in the source function needed fixup, mark the
2729 destination loop tree for fixup, too. */
2730 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2731 loops_state_set (LOOPS_NEED_FIXUP
);
2733 if (gimple_in_ssa_p (cfun
))
2734 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2735 if (!id
->blocks_to_copy
2736 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2737 copy_phis_for_bb (bb
, id
);
2739 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2742 if (need_debug_cleanup
2743 && bb
->index
!= ENTRY_BLOCK
2744 && bb
->index
!= EXIT_BLOCK
)
2745 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2746 /* Update call edge destinations. This can not be done before loop
2747 info is updated, because we may split basic blocks. */
2748 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
2749 && bb
->index
!= ENTRY_BLOCK
2750 && bb
->index
!= EXIT_BLOCK
)
2751 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2752 ((basic_block
)bb
->aux
)->aux
= NULL
;
2756 /* Zero out AUX fields of newly created block during EH edge
2758 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2760 if (need_debug_cleanup
)
2761 maybe_move_debug_stmts_to_successors (id
,
2762 BASIC_BLOCK_FOR_FN (cfun
, last
));
2763 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2764 /* Update call edge destinations. This can not be done before loop
2765 info is updated, because we may split basic blocks. */
2766 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2767 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2769 entry_block_map
->aux
= NULL
;
2770 exit_block_map
->aux
= NULL
;
2777 if (id
->dependence_map
)
2779 delete id
->dependence_map
;
2780 id
->dependence_map
= NULL
;
2786 /* Copy the debug STMT using ID. We deal with these statements in a
2787 special way: if any variable in their VALUE expression wasn't
2788 remapped yet, we won't remap it, because that would get decl uids
2789 out of sync, causing codegen differences between -g and -g0. If
2790 this arises, we drop the VALUE expression altogether. */
2793 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
2796 struct walk_stmt_info wi
;
2798 if (gimple_block (stmt
))
2800 n
= id
->decl_map
->get (gimple_block (stmt
));
2801 gimple_set_block (stmt
, n
? *n
: id
->block
);
2804 if (gimple_debug_nonbind_marker_p (stmt
))
2807 /* Remap all the operands in COPY. */
2808 memset (&wi
, 0, sizeof (wi
));
2811 processing_debug_stmt
= 1;
2813 if (gimple_debug_source_bind_p (stmt
))
2814 t
= gimple_debug_source_bind_get_var (stmt
);
2815 else if (gimple_debug_bind_p (stmt
))
2816 t
= gimple_debug_bind_get_var (stmt
);
2820 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2821 && (n
= id
->debug_map
->get (t
)))
2823 gcc_assert (VAR_P (*n
));
2826 else if (VAR_P (t
) && !is_global_var (t
) && !id
->decl_map
->get (t
))
2827 /* T is a non-localized variable. */;
2829 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2831 if (gimple_debug_bind_p (stmt
))
2833 gimple_debug_bind_set_var (stmt
, t
);
2835 if (gimple_debug_bind_has_value_p (stmt
))
2836 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2837 remap_gimple_op_r
, &wi
, NULL
);
2839 /* Punt if any decl couldn't be remapped. */
2840 if (processing_debug_stmt
< 0)
2841 gimple_debug_bind_reset_value (stmt
);
2843 else if (gimple_debug_source_bind_p (stmt
))
2845 gimple_debug_source_bind_set_var (stmt
, t
);
2846 /* When inlining and source bind refers to one of the optimized
2847 away parameters, change the source bind into normal debug bind
2848 referring to the corresponding DEBUG_EXPR_DECL that should have
2849 been bound before the call stmt. */
2850 t
= gimple_debug_source_bind_get_value (stmt
);
2852 && TREE_CODE (t
) == PARM_DECL
2855 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2857 if (debug_args
!= NULL
)
2859 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2860 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2861 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2863 t
= (**debug_args
)[i
+ 1];
2864 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2865 gimple_debug_bind_set_value (stmt
, t
);
2870 if (gimple_debug_source_bind_p (stmt
))
2871 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2872 remap_gimple_op_r
, &wi
, NULL
);
2875 processing_debug_stmt
= 0;
2880 /* Process deferred debug stmts. In order to give values better odds
2881 of being successfully remapped, we delay the processing of debug
2882 stmts until all other stmts that might require remapping are
2886 copy_debug_stmts (copy_body_data
*id
)
2891 if (!id
->debug_stmts
.exists ())
2894 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2895 copy_debug_stmt (stmt
, id
);
2897 id
->debug_stmts
.release ();
2900 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2901 another function. */
2904 copy_tree_body (copy_body_data
*id
)
2906 tree fndecl
= id
->src_fn
;
2907 tree body
= DECL_SAVED_TREE (fndecl
);
2909 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2914 /* Make a copy of the body of FN so that it can be inserted inline in
2915 another function. */
2918 copy_body (copy_body_data
*id
,
2919 basic_block entry_block_map
, basic_block exit_block_map
,
2920 basic_block new_entry
)
2922 tree fndecl
= id
->src_fn
;
2925 /* If this body has a CFG, walk CFG and copy. */
2926 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2927 body
= copy_cfg_body (id
, entry_block_map
, exit_block_map
,
2929 copy_debug_stmts (id
);
2934 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2935 defined in function FN, or of a data member thereof. */
2938 self_inlining_addr_expr (tree value
, tree fn
)
2942 if (TREE_CODE (value
) != ADDR_EXPR
)
2945 var
= get_base_address (TREE_OPERAND (value
, 0));
2947 return var
&& auto_var_in_fn_p (var
, fn
);
2950 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2951 lexical block and line number information from base_stmt, if given,
2952 or from the last stmt of the block otherwise. */
2955 insert_init_debug_bind (copy_body_data
*id
,
2956 basic_block bb
, tree var
, tree value
,
2960 gimple_stmt_iterator gsi
;
2963 if (!gimple_in_ssa_p (id
->src_cfun
))
2966 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
2969 tracked_var
= target_for_debug_bind (var
);
2975 gsi
= gsi_last_bb (bb
);
2976 if (!base_stmt
&& !gsi_end_p (gsi
))
2977 base_stmt
= gsi_stmt (gsi
);
2980 note
= gimple_build_debug_bind (tracked_var
, unshare_expr (value
), base_stmt
);
2984 if (!gsi_end_p (gsi
))
2985 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2987 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2994 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple
*init_stmt
)
2996 /* If VAR represents a zero-sized variable, it's possible that the
2997 assignment statement may result in no gimple statements. */
3000 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3002 /* We can end up with init statements that store to a non-register
3003 from a rhs with a conversion. Handle that here by forcing the
3004 rhs into a temporary. gimple_regimplify_operands is not
3005 prepared to do this for us. */
3006 if (!is_gimple_debug (init_stmt
)
3007 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3008 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3009 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3011 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3012 gimple_expr_type (init_stmt
),
3013 gimple_assign_rhs1 (init_stmt
));
3014 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3016 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3017 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3019 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3020 gimple_regimplify_operands (init_stmt
, &si
);
3022 if (!is_gimple_debug (init_stmt
))
3024 tree def
= gimple_assign_lhs (init_stmt
);
3025 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3030 /* Initialize parameter P with VALUE. If needed, produce init statement
3031 at the end of BB. When BB is NULL, we return init statement to be
3034 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3035 basic_block bb
, tree
*vars
)
3037 gimple
*init_stmt
= NULL
;
3040 tree def
= (gimple_in_ssa_p (cfun
)
3041 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3044 && value
!= error_mark_node
3045 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3047 /* If we can match up types by promotion/demotion do so. */
3048 if (fold_convertible_p (TREE_TYPE (p
), value
))
3049 rhs
= fold_convert (TREE_TYPE (p
), value
);
3052 /* ??? For valid programs we should not end up here.
3053 Still if we end up with truly mismatched types here, fall back
3054 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3055 GIMPLE to the following passes. */
3056 if (!is_gimple_reg_type (TREE_TYPE (value
))
3057 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
3058 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
3060 rhs
= build_zero_cst (TREE_TYPE (p
));
3064 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3065 here since the type of this decl must be visible to the calling
3067 var
= copy_decl_to_var (p
, id
);
3069 /* Declare this new variable. */
3070 DECL_CHAIN (var
) = *vars
;
3073 /* Make gimplifier happy about this variable. */
3074 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3076 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3077 we would not need to create a new variable here at all, if it
3078 weren't for debug info. Still, we can just use the argument
3080 if (TREE_READONLY (p
)
3081 && !TREE_ADDRESSABLE (p
)
3082 && value
&& !TREE_SIDE_EFFECTS (value
)
3085 /* We may produce non-gimple trees by adding NOPs or introduce
3086 invalid sharing when operand is not really constant.
3087 It is not big deal to prohibit constant propagation here as
3088 we will constant propagate in DOM1 pass anyway. */
3089 if (is_gimple_min_invariant (value
)
3090 && useless_type_conversion_p (TREE_TYPE (p
),
3092 /* We have to be very careful about ADDR_EXPR. Make sure
3093 the base variable isn't a local variable of the inlined
3094 function, e.g., when doing recursive inlining, direct or
3095 mutually-recursive or whatever, which is why we don't
3096 just test whether fn == current_function_decl. */
3097 && ! self_inlining_addr_expr (value
, fn
))
3099 insert_decl_map (id
, p
, value
);
3100 insert_debug_decl_map (id
, p
, var
);
3101 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3105 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3106 that way, when the PARM_DECL is encountered, it will be
3107 automatically replaced by the VAR_DECL. */
3108 insert_decl_map (id
, p
, var
);
3110 /* Even if P was TREE_READONLY, the new VAR should not be.
3111 In the original code, we would have constructed a
3112 temporary, and then the function body would have never
3113 changed the value of P. However, now, we will be
3114 constructing VAR directly. The constructor body may
3115 change its value multiple times as it is being
3116 constructed. Therefore, it must not be TREE_READONLY;
3117 the back-end assumes that TREE_READONLY variable is
3118 assigned to only once. */
3119 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
3120 TREE_READONLY (var
) = 0;
3122 /* If there is no setup required and we are in SSA, take the easy route
3123 replacing all SSA names representing the function parameter by the
3124 SSA name passed to function.
3126 We need to construct map for the variable anyway as it might be used
3127 in different SSA names when parameter is set in function.
3129 Do replacement at -O0 for const arguments replaced by constant.
3130 This is important for builtin_constant_p and other construct requiring
3131 constant argument to be visible in inlined function body. */
3132 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3134 || (TREE_READONLY (p
)
3135 && is_gimple_min_invariant (rhs
)))
3136 && (TREE_CODE (rhs
) == SSA_NAME
3137 || is_gimple_min_invariant (rhs
))
3138 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3140 insert_decl_map (id
, def
, rhs
);
3141 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3144 /* If the value of argument is never used, don't care about initializing
3146 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3148 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3149 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3152 /* Initialize this VAR_DECL from the equivalent argument. Convert
3153 the argument to the proper type in case it was promoted. */
3156 if (rhs
== error_mark_node
)
3158 insert_decl_map (id
, p
, var
);
3159 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3162 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3164 /* If we are in SSA form properly remap the default definition
3165 or assign to a dummy SSA name if the parameter is unused and
3166 we are not optimizing. */
3167 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3171 def
= remap_ssa_name (def
, id
);
3172 init_stmt
= gimple_build_assign (def
, rhs
);
3173 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3174 set_ssa_default_def (cfun
, var
, NULL
);
3178 def
= make_ssa_name (var
);
3179 init_stmt
= gimple_build_assign (def
, rhs
);
3183 init_stmt
= gimple_build_assign (var
, rhs
);
3185 if (bb
&& init_stmt
)
3186 insert_init_stmt (id
, bb
, init_stmt
);
3191 /* Generate code to initialize the parameters of the function at the
3192 top of the stack in ID from the GIMPLE_CALL STMT. */
3195 initialize_inlined_parameters (copy_body_data
*id
, gimple
*stmt
,
3196 tree fn
, basic_block bb
)
3201 tree vars
= NULL_TREE
;
3202 tree static_chain
= gimple_call_chain (stmt
);
3204 /* Figure out what the parameters are. */
3205 parms
= DECL_ARGUMENTS (fn
);
3207 /* Loop through the parameter declarations, replacing each with an
3208 equivalent VAR_DECL, appropriately initialized. */
3209 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3212 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3213 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3215 /* After remapping parameters remap their types. This has to be done
3216 in a second loop over all parameters to appropriately remap
3217 variable sized arrays when the size is specified in a
3218 parameter following the array. */
3219 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3221 tree
*varp
= id
->decl_map
->get (p
);
3222 if (varp
&& VAR_P (*varp
))
3224 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3225 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3227 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3228 /* Also remap the default definition if it was remapped
3229 to the default definition of the parameter replacement
3230 by the parameter setup. */
3233 tree
*defp
= id
->decl_map
->get (def
);
3235 && TREE_CODE (*defp
) == SSA_NAME
3236 && SSA_NAME_VAR (*defp
) == var
)
3237 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3242 /* Initialize the static chain. */
3243 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3244 gcc_assert (fn
!= current_function_decl
);
3247 /* No static chain? Seems like a bug in tree-nested.c. */
3248 gcc_assert (static_chain
);
3250 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3253 declare_inline_vars (id
->block
, vars
);
3257 /* Declare a return variable to replace the RESULT_DECL for the
3258 function we are calling. An appropriate DECL_STMT is returned.
3259 The USE_STMT is filled to contain a use of the declaration to
3260 indicate the return value of the function.
3262 RETURN_SLOT, if non-null is place where to store the result. It
3263 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3264 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3266 The return value is a (possibly null) value that holds the result
3267 as seen by the caller. */
3270 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3271 basic_block entry_bb
)
3273 tree callee
= id
->src_fn
;
3274 tree result
= DECL_RESULT (callee
);
3275 tree callee_type
= TREE_TYPE (result
);
3279 /* Handle type-mismatches in the function declaration return type
3280 vs. the call expression. */
3282 caller_type
= TREE_TYPE (modify_dest
);
3284 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3286 /* We don't need to do anything for functions that don't return anything. */
3287 if (VOID_TYPE_P (callee_type
))
3290 /* If there was a return slot, then the return value is the
3291 dereferenced address of that object. */
3294 /* The front end shouldn't have used both return_slot and
3295 a modify expression. */
3296 gcc_assert (!modify_dest
);
3297 if (DECL_BY_REFERENCE (result
))
3299 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3300 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3302 /* We are going to construct *&return_slot and we can't do that
3303 for variables believed to be not addressable.
3305 FIXME: This check possibly can match, because values returned
3306 via return slot optimization are not believed to have address
3307 taken by alias analysis. */
3308 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3309 var
= return_slot_addr
;
3314 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3315 if (TREE_ADDRESSABLE (result
))
3316 mark_addressable (var
);
3318 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3319 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3320 && !DECL_GIMPLE_REG_P (result
)
3322 DECL_GIMPLE_REG_P (var
) = 0;
3327 /* All types requiring non-trivial constructors should have been handled. */
3328 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3330 /* Attempt to avoid creating a new temporary variable. */
3332 && TREE_CODE (modify_dest
) != SSA_NAME
)
3334 bool use_it
= false;
3336 /* We can't use MODIFY_DEST if there's type promotion involved. */
3337 if (!useless_type_conversion_p (callee_type
, caller_type
))
3340 /* ??? If we're assigning to a variable sized type, then we must
3341 reuse the destination variable, because we've no good way to
3342 create variable sized temporaries at this point. */
3343 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3346 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3347 reuse it as the result of the call directly. Don't do this if
3348 it would promote MODIFY_DEST to addressable. */
3349 else if (TREE_ADDRESSABLE (result
))
3353 tree base_m
= get_base_address (modify_dest
);
3355 /* If the base isn't a decl, then it's a pointer, and we don't
3356 know where that's going to go. */
3357 if (!DECL_P (base_m
))
3359 else if (is_global_var (base_m
))
3361 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3362 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3363 && !DECL_GIMPLE_REG_P (result
)
3364 && DECL_GIMPLE_REG_P (base_m
))
3366 else if (!TREE_ADDRESSABLE (base_m
))
3378 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3380 var
= copy_result_decl_to_var (result
, id
);
3381 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3383 /* Do not have the rest of GCC warn about this variable as it should
3384 not be visible to the user. */
3385 TREE_NO_WARNING (var
) = 1;
3387 declare_inline_vars (id
->block
, var
);
3389 /* Build the use expr. If the return type of the function was
3390 promoted, convert it back to the expected type. */
3392 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3394 /* If we can match up types by promotion/demotion do so. */
3395 if (fold_convertible_p (caller_type
, var
))
3396 use
= fold_convert (caller_type
, var
);
3399 /* ??? For valid programs we should not end up here.
3400 Still if we end up with truly mismatched types here, fall back
3401 to using a MEM_REF to not leak invalid GIMPLE to the following
3403 /* Prevent var from being written into SSA form. */
3404 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3405 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3406 DECL_GIMPLE_REG_P (var
) = false;
3407 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3408 TREE_ADDRESSABLE (var
) = true;
3409 use
= fold_build2 (MEM_REF
, caller_type
,
3410 build_fold_addr_expr (var
),
3411 build_int_cst (ptr_type_node
, 0));
3415 STRIP_USELESS_TYPE_CONVERSION (use
);
3417 if (DECL_BY_REFERENCE (result
))
3419 TREE_ADDRESSABLE (var
) = 1;
3420 var
= build_fold_addr_expr (var
);
3424 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3425 way, when the RESULT_DECL is encountered, it will be
3426 automatically replaced by the VAR_DECL.
3428 When returning by reference, ensure that RESULT_DECL remaps to
3430 if (DECL_BY_REFERENCE (result
)
3431 && !is_gimple_val (var
))
3433 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3434 insert_decl_map (id
, result
, temp
);
3435 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3436 it's default_def SSA_NAME. */
3437 if (gimple_in_ssa_p (id
->src_cfun
)
3438 && is_gimple_reg (result
))
3440 temp
= make_ssa_name (temp
);
3441 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3443 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3446 insert_decl_map (id
, result
, var
);
3448 /* Remember this so we can ignore it in remap_decls. */
3453 /* Determine if the function can be copied. If so return NULL. If
3454 not return a string describng the reason for failure. */
3457 copy_forbidden (struct function
*fun
)
3459 const char *reason
= fun
->cannot_be_copied_reason
;
3461 /* Only examine the function once. */
3462 if (fun
->cannot_be_copied_set
)
3465 /* We cannot copy a function that receives a non-local goto
3466 because we cannot remap the destination label used in the
3467 function that is performing the non-local goto. */
3468 /* ??? Actually, this should be possible, if we work at it.
3469 No doubt there's just a handful of places that simply
3470 assume it doesn't happen and don't substitute properly. */
3471 if (fun
->has_nonlocal_label
)
3473 reason
= G_("function %q+F can never be copied "
3474 "because it receives a non-local goto");
3478 if (fun
->has_forced_label_in_static
)
3480 reason
= G_("function %q+F can never be copied because it saves "
3481 "address of local label in a static variable");
3486 fun
->cannot_be_copied_reason
= reason
;
3487 fun
->cannot_be_copied_set
= true;
3492 static const char *inline_forbidden_reason
;
3494 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3495 iff a function can not be inlined. Also sets the reason why. */
3498 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3499 struct walk_stmt_info
*wip
)
3501 tree fn
= (tree
) wip
->info
;
3503 gimple
*stmt
= gsi_stmt (*gsi
);
3505 switch (gimple_code (stmt
))
3508 /* Refuse to inline alloca call unless user explicitly forced so as
3509 this may change program's memory overhead drastically when the
3510 function using alloca is called in loop. In GCC present in
3511 SPEC2000 inlining into schedule_block cause it to require 2GB of
3512 RAM instead of 256MB. Don't do so for alloca calls emitted for
3513 VLA objects as those can't cause unbounded growth (they're always
3514 wrapped inside stack_save/stack_restore regions. */
3515 if (gimple_maybe_alloca_call_p (stmt
)
3516 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3517 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3519 inline_forbidden_reason
3520 = G_("function %q+F can never be inlined because it uses "
3521 "alloca (override using the always_inline attribute)");
3522 *handled_ops_p
= true;
3526 t
= gimple_call_fndecl (stmt
);
3530 /* We cannot inline functions that call setjmp. */
3531 if (setjmp_call_p (t
))
3533 inline_forbidden_reason
3534 = G_("function %q+F can never be inlined because it uses setjmp");
3535 *handled_ops_p
= true;
3539 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3540 switch (DECL_FUNCTION_CODE (t
))
3542 /* We cannot inline functions that take a variable number of
3544 case BUILT_IN_VA_START
:
3545 case BUILT_IN_NEXT_ARG
:
3546 case BUILT_IN_VA_END
:
3547 inline_forbidden_reason
3548 = G_("function %q+F can never be inlined because it "
3549 "uses variable argument lists");
3550 *handled_ops_p
= true;
3553 case BUILT_IN_LONGJMP
:
3554 /* We can't inline functions that call __builtin_longjmp at
3555 all. The non-local goto machinery really requires the
3556 destination be in a different function. If we allow the
3557 function calling __builtin_longjmp to be inlined into the
3558 function calling __builtin_setjmp, Things will Go Awry. */
3559 inline_forbidden_reason
3560 = G_("function %q+F can never be inlined because "
3561 "it uses setjmp-longjmp exception handling");
3562 *handled_ops_p
= true;
3565 case BUILT_IN_NONLOCAL_GOTO
:
3567 inline_forbidden_reason
3568 = G_("function %q+F can never be inlined because "
3569 "it uses non-local goto");
3570 *handled_ops_p
= true;
3573 case BUILT_IN_RETURN
:
3574 case BUILT_IN_APPLY_ARGS
:
3575 /* If a __builtin_apply_args caller would be inlined,
3576 it would be saving arguments of the function it has
3577 been inlined into. Similarly __builtin_return would
3578 return from the function the inline has been inlined into. */
3579 inline_forbidden_reason
3580 = G_("function %q+F can never be inlined because "
3581 "it uses __builtin_return or __builtin_apply_args");
3582 *handled_ops_p
= true;
3591 t
= gimple_goto_dest (stmt
);
3593 /* We will not inline a function which uses computed goto. The
3594 addresses of its local labels, which may be tucked into
3595 global storage, are of course not constant across
3596 instantiations, which causes unexpected behavior. */
3597 if (TREE_CODE (t
) != LABEL_DECL
)
3599 inline_forbidden_reason
3600 = G_("function %q+F can never be inlined "
3601 "because it contains a computed goto");
3602 *handled_ops_p
= true;
3611 *handled_ops_p
= false;
3615 /* Return true if FNDECL is a function that cannot be inlined into
3619 inline_forbidden_p (tree fndecl
)
3621 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3622 struct walk_stmt_info wi
;
3624 bool forbidden_p
= false;
3626 /* First check for shared reasons not to copy the code. */
3627 inline_forbidden_reason
= copy_forbidden (fun
);
3628 if (inline_forbidden_reason
!= NULL
)
3631 /* Next, walk the statements of the function looking for
3632 constraucts we can't handle, or are non-optimal for inlining. */
3633 hash_set
<tree
> visited_nodes
;
3634 memset (&wi
, 0, sizeof (wi
));
3635 wi
.info
= (void *) fndecl
;
3636 wi
.pset
= &visited_nodes
;
3638 FOR_EACH_BB_FN (bb
, fun
)
3641 gimple_seq seq
= bb_seq (bb
);
3642 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3643 forbidden_p
= (ret
!= NULL
);
3651 /* Return false if the function FNDECL cannot be inlined on account of its
3652 attributes, true otherwise. */
3654 function_attribute_inlinable_p (const_tree fndecl
)
3656 if (targetm
.attribute_table
)
3660 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3662 const_tree name
= TREE_PURPOSE (a
);
3665 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3666 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3667 return targetm
.function_attribute_inlinable_p (fndecl
);
3674 /* Returns nonzero if FN is a function that does not have any
3675 fundamental inline blocking properties. */
3678 tree_inlinable_function_p (tree fn
)
3680 bool inlinable
= true;
3684 /* If we've already decided this function shouldn't be inlined,
3685 there's no need to check again. */
3686 if (DECL_UNINLINABLE (fn
))
3689 /* We only warn for functions declared `inline' by the user. */
3690 do_warning
= (warn_inline
3691 && DECL_DECLARED_INLINE_P (fn
)
3692 && !DECL_NO_INLINE_WARNING_P (fn
)
3693 && !DECL_IN_SYSTEM_HEADER (fn
));
3695 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3698 && always_inline
== NULL
)
3701 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3702 "is suppressed using -fno-inline", fn
);
3706 else if (!function_attribute_inlinable_p (fn
))
3709 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3710 "uses attributes conflicting with inlining", fn
);
3714 else if (inline_forbidden_p (fn
))
3716 /* See if we should warn about uninlinable functions. Previously,
3717 some of these warnings would be issued while trying to expand
3718 the function inline, but that would cause multiple warnings
3719 about functions that would for example call alloca. But since
3720 this a property of the function, just one warning is enough.
3721 As a bonus we can now give more details about the reason why a
3722 function is not inlinable. */
3724 error (inline_forbidden_reason
, fn
);
3725 else if (do_warning
)
3726 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3731 /* Squirrel away the result so that we don't have to check again. */
3732 DECL_UNINLINABLE (fn
) = !inlinable
;
3737 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
3738 word size and take possible memcpy call into account and return
3739 cost based on whether optimizing for size or speed according to SPEED_P. */
3742 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
3746 gcc_assert (!VOID_TYPE_P (type
));
3748 if (TREE_CODE (type
) == VECTOR_TYPE
)
3750 scalar_mode inner
= SCALAR_TYPE_MODE (TREE_TYPE (type
));
3751 machine_mode simd
= targetm
.vectorize
.preferred_simd_mode (inner
);
3753 = estimated_poly_value (GET_MODE_SIZE (TYPE_MODE (type
)));
3754 int simd_mode_size
= estimated_poly_value (GET_MODE_SIZE (simd
));
3755 return ((orig_mode_size
+ simd_mode_size
- 1)
3759 size
= int_size_in_bytes (type
);
3761 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
3762 /* Cost of a memcpy call, 3 arguments and the call. */
3765 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3768 /* Returns cost of operation CODE, according to WEIGHTS */
3771 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3772 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3776 /* These are "free" conversions, or their presumed cost
3777 is folded into other operations. */
3782 case VIEW_CONVERT_EXPR
:
3785 /* Assign cost of 1 to usual operations.
3786 ??? We may consider mapping RTL costs to this. */
3792 case POINTER_PLUS_EXPR
:
3793 case POINTER_DIFF_EXPR
:
3796 case MULT_HIGHPART_EXPR
:
3798 case ADDR_SPACE_CONVERT_EXPR
:
3799 case FIXED_CONVERT_EXPR
:
3800 case FIX_TRUNC_EXPR
:
3819 case TRUTH_ANDIF_EXPR
:
3820 case TRUTH_ORIF_EXPR
:
3821 case TRUTH_AND_EXPR
:
3823 case TRUTH_XOR_EXPR
:
3824 case TRUTH_NOT_EXPR
:
3833 case UNORDERED_EXPR
:
3844 case PREDECREMENT_EXPR
:
3845 case PREINCREMENT_EXPR
:
3846 case POSTDECREMENT_EXPR
:
3847 case POSTINCREMENT_EXPR
:
3849 case REALIGN_LOAD_EXPR
:
3851 case WIDEN_SUM_EXPR
:
3852 case WIDEN_MULT_EXPR
:
3855 case WIDEN_MULT_PLUS_EXPR
:
3856 case WIDEN_MULT_MINUS_EXPR
:
3857 case WIDEN_LSHIFT_EXPR
:
3859 case VEC_WIDEN_MULT_HI_EXPR
:
3860 case VEC_WIDEN_MULT_LO_EXPR
:
3861 case VEC_WIDEN_MULT_EVEN_EXPR
:
3862 case VEC_WIDEN_MULT_ODD_EXPR
:
3863 case VEC_UNPACK_HI_EXPR
:
3864 case VEC_UNPACK_LO_EXPR
:
3865 case VEC_UNPACK_FLOAT_HI_EXPR
:
3866 case VEC_UNPACK_FLOAT_LO_EXPR
:
3867 case VEC_UNPACK_FIX_TRUNC_HI_EXPR
:
3868 case VEC_UNPACK_FIX_TRUNC_LO_EXPR
:
3869 case VEC_PACK_TRUNC_EXPR
:
3870 case VEC_PACK_SAT_EXPR
:
3871 case VEC_PACK_FIX_TRUNC_EXPR
:
3872 case VEC_PACK_FLOAT_EXPR
:
3873 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3874 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3875 case VEC_DUPLICATE_EXPR
:
3876 case VEC_SERIES_EXPR
:
3880 /* Few special cases of expensive operations. This is useful
3881 to avoid inlining on functions having too many of these. */
3882 case TRUNC_DIV_EXPR
:
3884 case FLOOR_DIV_EXPR
:
3885 case ROUND_DIV_EXPR
:
3886 case EXACT_DIV_EXPR
:
3887 case TRUNC_MOD_EXPR
:
3889 case FLOOR_MOD_EXPR
:
3890 case ROUND_MOD_EXPR
:
3892 if (TREE_CODE (op2
) != INTEGER_CST
)
3893 return weights
->div_mod_cost
;
3896 /* Bit-field insertion needs several shift and mask operations. */
3897 case BIT_INSERT_EXPR
:
3901 /* We expect a copy assignment with no operator. */
3902 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3908 /* Estimate number of instructions that will be created by expanding
3909 the statements in the statement sequence STMTS.
3910 WEIGHTS contains weights attributed to various constructs. */
3913 estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3916 gimple_stmt_iterator gsi
;
3919 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3920 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3926 /* Estimate number of instructions that will be created by expanding STMT.
3927 WEIGHTS contains weights attributed to various constructs. */
3930 estimate_num_insns (gimple
*stmt
, eni_weights
*weights
)
3933 enum gimple_code code
= gimple_code (stmt
);
3940 /* Try to estimate the cost of assignments. We have three cases to
3942 1) Simple assignments to registers;
3943 2) Stores to things that must live in memory. This includes
3944 "normal" stores to scalars, but also assignments of large
3945 structures, or constructors of big arrays;
3947 Let us look at the first two cases, assuming we have "a = b + C":
3948 <GIMPLE_ASSIGN <var_decl "a">
3949 <plus_expr <var_decl "b"> <constant C>>
3950 If "a" is a GIMPLE register, the assignment to it is free on almost
3951 any target, because "a" usually ends up in a real register. Hence
3952 the only cost of this expression comes from the PLUS_EXPR, and we
3953 can ignore the GIMPLE_ASSIGN.
3954 If "a" is not a GIMPLE register, the assignment to "a" will most
3955 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3956 of moving something into "a", which we compute using the function
3957 estimate_move_cost. */
3958 if (gimple_clobber_p (stmt
))
3959 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3961 lhs
= gimple_assign_lhs (stmt
);
3962 rhs
= gimple_assign_rhs1 (stmt
);
3966 /* Account for the cost of moving to / from memory. */
3967 if (gimple_store_p (stmt
))
3968 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
3969 if (gimple_assign_load_p (stmt
))
3970 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
3972 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3973 gimple_assign_rhs1 (stmt
),
3974 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3975 == GIMPLE_BINARY_RHS
3976 ? gimple_assign_rhs2 (stmt
) : NULL
);
3980 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3981 gimple_op (stmt
, 0),
3982 gimple_op (stmt
, 1));
3987 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
3988 /* Take into account cost of the switch + guess 2 conditional jumps for
3991 TODO: once the switch expansion logic is sufficiently separated, we can
3992 do better job on estimating cost of the switch. */
3993 if (weights
->time_based
)
3994 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
3996 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4004 if (gimple_call_internal_p (stmt
))
4006 else if ((decl
= gimple_call_fndecl (stmt
))
4007 && DECL_BUILT_IN (decl
))
4009 /* Do not special case builtins where we see the body.
4010 This just confuse inliner. */
4011 struct cgraph_node
*node
;
4012 if (!(node
= cgraph_node::get (decl
))
4013 || node
->definition
)
4015 /* For buitins that are likely expanded to nothing or
4016 inlined do not account operand costs. */
4017 else if (is_simple_builtin (decl
))
4019 else if (is_inexpensive_builtin (decl
))
4020 return weights
->target_builtin_call_cost
;
4021 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
4023 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4024 specialize the cheap expansion we do here.
4025 ??? This asks for a more general solution. */
4026 switch (DECL_FUNCTION_CODE (decl
))
4031 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4033 (&TREE_REAL_CST (gimple_call_arg (stmt
, 1)),
4035 return estimate_operator_cost
4036 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4037 gimple_call_arg (stmt
, 0));
4046 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4047 if (gimple_call_lhs (stmt
))
4048 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4049 weights
->time_based
);
4050 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4052 tree arg
= gimple_call_arg (stmt
, i
);
4053 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4054 weights
->time_based
);
4060 return weights
->return_cost
;
4066 case GIMPLE_PREDICT
:
4072 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4073 /* 1000 means infinity. This avoids overflows later
4074 with very long asm statements. */
4077 return MAX (1, count
);
4081 /* This is either going to be an external function call with one
4082 argument, or two register copy statements plus a goto. */
4085 case GIMPLE_EH_DISPATCH
:
4086 /* ??? This is going to turn into a switch statement. Ideally
4087 we'd have a look at the eh region and estimate the number of
4092 return estimate_num_insns_seq (
4093 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4096 case GIMPLE_EH_FILTER
:
4097 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4100 return estimate_num_insns_seq (gimple_catch_handler (
4101 as_a
<gcatch
*> (stmt
)),
4105 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4106 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4108 /* OMP directives are generally very expensive. */
4110 case GIMPLE_OMP_RETURN
:
4111 case GIMPLE_OMP_SECTIONS_SWITCH
:
4112 case GIMPLE_OMP_ATOMIC_STORE
:
4113 case GIMPLE_OMP_CONTINUE
:
4114 /* ...except these, which are cheap. */
4117 case GIMPLE_OMP_ATOMIC_LOAD
:
4118 return weights
->omp_cost
;
4120 case GIMPLE_OMP_FOR
:
4121 return (weights
->omp_cost
4122 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4123 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4125 case GIMPLE_OMP_PARALLEL
:
4126 case GIMPLE_OMP_TASK
:
4127 case GIMPLE_OMP_CRITICAL
:
4128 case GIMPLE_OMP_MASTER
:
4129 case GIMPLE_OMP_TASKGROUP
:
4130 case GIMPLE_OMP_ORDERED
:
4131 case GIMPLE_OMP_SECTION
:
4132 case GIMPLE_OMP_SECTIONS
:
4133 case GIMPLE_OMP_SINGLE
:
4134 case GIMPLE_OMP_TARGET
:
4135 case GIMPLE_OMP_TEAMS
:
4136 return (weights
->omp_cost
4137 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4139 case GIMPLE_TRANSACTION
:
4140 return (weights
->tm_cost
4141 + estimate_num_insns_seq (gimple_transaction_body (
4142 as_a
<gtransaction
*> (stmt
)),
4152 /* Estimate number of instructions that will be created by expanding
4153 function FNDECL. WEIGHTS contains weights attributed to various
4157 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4159 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4160 gimple_stmt_iterator bsi
;
4164 gcc_assert (my_function
&& my_function
->cfg
);
4165 FOR_EACH_BB_FN (bb
, my_function
)
4167 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4168 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4175 /* Initializes weights used by estimate_num_insns. */
4178 init_inline_once (void)
4180 eni_size_weights
.call_cost
= 1;
4181 eni_size_weights
.indirect_call_cost
= 3;
4182 eni_size_weights
.target_builtin_call_cost
= 1;
4183 eni_size_weights
.div_mod_cost
= 1;
4184 eni_size_weights
.omp_cost
= 40;
4185 eni_size_weights
.tm_cost
= 10;
4186 eni_size_weights
.time_based
= false;
4187 eni_size_weights
.return_cost
= 1;
4189 /* Estimating time for call is difficult, since we have no idea what the
4190 called function does. In the current uses of eni_time_weights,
4191 underestimating the cost does less harm than overestimating it, so
4192 we choose a rather small value here. */
4193 eni_time_weights
.call_cost
= 10;
4194 eni_time_weights
.indirect_call_cost
= 15;
4195 eni_time_weights
.target_builtin_call_cost
= 1;
4196 eni_time_weights
.div_mod_cost
= 10;
4197 eni_time_weights
.omp_cost
= 40;
4198 eni_time_weights
.tm_cost
= 40;
4199 eni_time_weights
.time_based
= true;
4200 eni_time_weights
.return_cost
= 2;
4204 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4207 prepend_lexical_block (tree current_block
, tree new_block
)
4209 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4210 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4211 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4214 /* Add local variables from CALLEE to CALLER. */
4217 add_local_variables (struct function
*callee
, struct function
*caller
,
4223 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4224 if (!can_be_nonlocal (var
, id
))
4226 tree new_var
= remap_decl (var
, id
);
4228 /* Remap debug-expressions. */
4230 && DECL_HAS_DEBUG_EXPR_P (var
)
4233 tree tem
= DECL_DEBUG_EXPR (var
);
4234 bool old_regimplify
= id
->regimplify
;
4235 id
->remapping_type_depth
++;
4236 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4237 id
->remapping_type_depth
--;
4238 id
->regimplify
= old_regimplify
;
4239 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4240 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4242 add_local_decl (caller
, new_var
);
4246 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4247 have brought in or introduced any debug stmts for SRCVAR. */
4250 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4252 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4257 if (!VAR_P (*remappedvarp
))
4260 if (*remappedvarp
== id
->retvar
)
4263 tree tvar
= target_for_debug_bind (*remappedvarp
);
4267 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4269 gimple_seq_add_stmt (bindings
, stmt
);
4272 /* For each inlined variable for which we may have debug bind stmts,
4273 add before GSI a final debug stmt resetting it, marking the end of
4274 its life, so that var-tracking knows it doesn't have to compute
4275 further locations for it. */
4278 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4282 gimple_seq bindings
= NULL
;
4284 if (!gimple_in_ssa_p (id
->src_cfun
))
4287 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4290 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4291 var
; var
= DECL_CHAIN (var
))
4292 reset_debug_binding (id
, var
, &bindings
);
4294 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4295 reset_debug_binding (id
, var
, &bindings
);
4297 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4300 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4303 expand_call_inline (basic_block bb
, gimple
*stmt
, copy_body_data
*id
)
4307 hash_map
<tree
, tree
> *dst
;
4308 hash_map
<tree
, tree
> *st
= NULL
;
4311 struct cgraph_edge
*cg_edge
;
4312 cgraph_inline_failed_t reason
;
4313 basic_block return_block
;
4315 gimple_stmt_iterator gsi
, stmt_gsi
;
4316 bool successfully_inlined
= false;
4317 bool purge_dead_abnormal_edges
;
4319 unsigned int prop_mask
, src_properties
;
4320 struct function
*dst_cfun
;
4323 gimple
*simtenter_stmt
= NULL
;
4324 vec
<tree
> *simtvars_save
;
4326 /* The gimplifier uses input_location in too many places, such as
4327 internal_get_tmp_var (). */
4328 location_t saved_location
= input_location
;
4329 input_location
= gimple_location (stmt
);
4331 /* From here on, we're only interested in CALL_EXPRs. */
4332 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4336 cg_edge
= id
->dst_node
->get_edge (stmt
);
4337 gcc_checking_assert (cg_edge
);
4338 /* First, see if we can figure out what function is being called.
4339 If we cannot, then there is no hope of inlining the function. */
4340 if (cg_edge
->indirect_unknown_callee
)
4342 fn
= cg_edge
->callee
->decl
;
4343 gcc_checking_assert (fn
);
4345 /* If FN is a declaration of a function in a nested scope that was
4346 globally declared inline, we don't set its DECL_INITIAL.
4347 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4348 C++ front-end uses it for cdtors to refer to their internal
4349 declarations, that are not real functions. Fortunately those
4350 don't have trees to be saved, so we can tell by checking their
4352 if (!DECL_INITIAL (fn
)
4353 && DECL_ABSTRACT_ORIGIN (fn
)
4354 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4355 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4357 /* Don't try to inline functions that are not well-suited to inlining. */
4358 if (cg_edge
->inline_failed
)
4360 reason
= cg_edge
->inline_failed
;
4361 /* If this call was originally indirect, we do not want to emit any
4362 inlining related warnings or sorry messages because there are no
4363 guarantees regarding those. */
4364 if (cg_edge
->indirect_inlining_edge
)
4367 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4368 /* For extern inline functions that get redefined we always
4369 silently ignored always_inline flag. Better behavior would
4370 be to be able to keep both bodies and use extern inline body
4371 for inlining, but we can't do that because frontends overwrite
4373 && !cg_edge
->callee
->local
.redefined_extern_inline
4374 /* During early inline pass, report only when optimization is
4376 && (symtab
->global_info_ready
4378 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4379 /* PR 20090218-1_0.c. Body can be provided by another module. */
4380 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4382 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4383 cgraph_inline_failed_string (reason
));
4384 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4385 inform (gimple_location (stmt
), "called from here");
4386 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4387 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4388 "called from this function");
4390 else if (warn_inline
4391 && DECL_DECLARED_INLINE_P (fn
)
4392 && !DECL_NO_INLINE_WARNING_P (fn
)
4393 && !DECL_IN_SYSTEM_HEADER (fn
)
4394 && reason
!= CIF_UNSPECIFIED
4395 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4396 /* Do not warn about not inlined recursive calls. */
4397 && !cg_edge
->recursive_p ()
4398 /* Avoid warnings during early inline pass. */
4399 && symtab
->global_info_ready
)
4401 if (warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4402 fn
, _(cgraph_inline_failed_string (reason
))))
4404 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4405 inform (gimple_location (stmt
), "called from here");
4406 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4407 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4408 "called from this function");
4413 id
->src_node
= cg_edge
->callee
;
4415 /* If callee is thunk, all we need is to adjust the THIS pointer
4416 and redirect to function being thunked. */
4417 if (id
->src_node
->thunk
.thunk_p
)
4420 tree virtual_offset
= NULL
;
4421 profile_count count
= cg_edge
->count
;
4423 gimple_stmt_iterator iter
= gsi_for_stmt (stmt
);
4426 edge
= id
->src_node
->callees
->clone (id
->dst_node
, call_stmt
,
4428 profile_count::one (),
4429 profile_count::one (),
4431 edge
->count
= count
;
4432 if (id
->src_node
->thunk
.virtual_offset_p
)
4433 virtual_offset
= size_int (id
->src_node
->thunk
.virtual_value
);
4434 op
= create_tmp_reg_fn (cfun
, TREE_TYPE (gimple_call_arg (stmt
, 0)),
4436 gsi_insert_before (&iter
, gimple_build_assign (op
,
4437 gimple_call_arg (stmt
, 0)),
4439 gcc_assert (id
->src_node
->thunk
.this_adjusting
);
4440 op
= thunk_adjust (&iter
, op
, 1, id
->src_node
->thunk
.fixed_offset
,
4443 gimple_call_set_arg (stmt
, 0, op
);
4444 gimple_call_set_fndecl (stmt
, edge
->callee
->decl
);
4446 id
->src_node
->remove ();
4447 expand_call_inline (bb
, stmt
, id
);
4448 maybe_remove_unused_call_args (cfun
, stmt
);
4451 fn
= cg_edge
->callee
->decl
;
4452 cg_edge
->callee
->get_untransformed_body ();
4454 if (flag_checking
&& cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4455 cg_edge
->callee
->verify ();
4457 /* We will be inlining this callee. */
4458 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4459 id
->assign_stmts
.create (0);
4461 /* Update the callers EH personality. */
4462 if (DECL_FUNCTION_PERSONALITY (fn
))
4463 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4464 = DECL_FUNCTION_PERSONALITY (fn
);
4466 /* Split the block before the GIMPLE_CALL. */
4467 stmt_gsi
= gsi_for_stmt (stmt
);
4468 gsi_prev (&stmt_gsi
);
4469 e
= split_block (bb
, gsi_end_p (stmt_gsi
) ? NULL
: gsi_stmt (stmt_gsi
));
4471 return_block
= e
->dest
;
4474 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4475 been the source of abnormal edges. In this case, schedule
4476 the removal of dead abnormal edges. */
4477 gsi
= gsi_start_bb (return_block
);
4479 purge_dead_abnormal_edges
= gsi_end_p (gsi
);
4481 stmt_gsi
= gsi_start_bb (return_block
);
4483 /* Build a block containing code to initialize the arguments, the
4484 actual inline expansion of the body, and a label for the return
4485 statements within the function to jump to. The type of the
4486 statement expression is the return type of the function call.
4487 ??? If the call does not have an associated block then we will
4488 remap all callee blocks to NULL, effectively dropping most of
4489 its debug information. This should only happen for calls to
4490 artificial decls inserted by the compiler itself. We need to
4491 either link the inlined blocks into the caller block tree or
4492 not refer to them in any way to not break GC for locations. */
4493 if (gimple_block (stmt
))
4495 id
->block
= make_node (BLOCK
);
4496 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4497 BLOCK_SOURCE_LOCATION (id
->block
)
4498 = LOCATION_LOCUS (gimple_location (stmt
));
4499 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4502 /* Local declarations will be replaced by their equivalents in this
4505 id
->decl_map
= new hash_map
<tree
, tree
>;
4506 dst
= id
->debug_map
;
4507 id
->debug_map
= NULL
;
4509 /* Record the function we are about to inline. */
4511 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4512 id
->call_stmt
= call_stmt
;
4514 /* When inlining into an OpenMP SIMD-on-SIMT loop, arrange for new automatic
4515 variables to be added to IFN_GOMP_SIMT_ENTER argument list. */
4516 dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4517 simtvars_save
= id
->dst_simt_vars
;
4518 if (!(dst_cfun
->curr_properties
& PROP_gimple_lomp_dev
)
4519 && (simduid
= bb
->loop_father
->simduid
) != NULL_TREE
4520 && (simduid
= ssa_default_def (dst_cfun
, simduid
)) != NULL_TREE
4521 && single_imm_use (simduid
, &use
, &simtenter_stmt
)
4522 && is_gimple_call (simtenter_stmt
)
4523 && gimple_call_internal_p (simtenter_stmt
, IFN_GOMP_SIMT_ENTER
))
4524 vec_alloc (id
->dst_simt_vars
, 0);
4526 id
->dst_simt_vars
= NULL
;
4528 if (profile_status_for_fn (id
->src_cfun
) == PROFILE_ABSENT
)
4529 profile_status_for_fn (dst_cfun
) = PROFILE_ABSENT
;
4531 /* If the src function contains an IFN_VA_ARG, then so will the dst
4532 function after inlining. Likewise for IFN_GOMP_USE_SIMT. */
4533 prop_mask
= PROP_gimple_lva
| PROP_gimple_lomp_dev
;
4534 src_properties
= id
->src_cfun
->curr_properties
& prop_mask
;
4535 if (src_properties
!= prop_mask
)
4536 dst_cfun
->curr_properties
&= src_properties
| ~prop_mask
;
4538 gcc_assert (!id
->src_cfun
->after_inlining
);
4541 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4543 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4544 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4548 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4549 if (debug_nonbind_markers_p
&& debug_inline_points
&& id
->block
4550 && inlined_function_outer_scope_p (id
->block
))
4552 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4553 gsi_insert_after (&si
, gimple_build_debug_inline_entry
4554 (id
->block
, input_location
), GSI_NEW_STMT
);
4557 if (DECL_INITIAL (fn
))
4559 if (gimple_block (stmt
))
4563 prepend_lexical_block (id
->block
,
4564 remap_blocks (DECL_INITIAL (fn
), id
));
4565 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4566 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4568 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4569 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4570 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4571 under it. The parameters can be then evaluated in the debugger,
4572 but don't show in backtraces. */
4573 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4574 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4577 *var
= TREE_CHAIN (v
);
4578 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4579 BLOCK_VARS (id
->block
) = v
;
4582 var
= &TREE_CHAIN (*var
);
4585 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4588 /* Return statements in the function body will be replaced by jumps
4589 to the RET_LABEL. */
4590 gcc_assert (DECL_INITIAL (fn
));
4591 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4593 /* Find the LHS to which the result of this call is assigned. */
4595 if (gimple_call_lhs (stmt
))
4597 modify_dest
= gimple_call_lhs (stmt
);
4599 /* The function which we are inlining might not return a value,
4600 in which case we should issue a warning that the function
4601 does not return a value. In that case the optimizers will
4602 see that the variable to which the value is assigned was not
4603 initialized. We do not want to issue a warning about that
4604 uninitialized variable. */
4605 if (DECL_P (modify_dest
))
4606 TREE_NO_WARNING (modify_dest
) = 1;
4608 if (gimple_call_return_slot_opt_p (call_stmt
))
4610 return_slot
= modify_dest
;
4617 /* If we are inlining a call to the C++ operator new, we don't want
4618 to use type based alias analysis on the return value. Otherwise
4619 we may get confused if the compiler sees that the inlined new
4620 function returns a pointer which was just deleted. See bug
4622 if (DECL_IS_OPERATOR_NEW (fn
))
4628 /* Declare the return variable for the function. */
4629 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4631 /* Add local vars in this inlined callee to caller. */
4632 add_local_variables (id
->src_cfun
, cfun
, id
);
4634 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4636 fprintf (dump_file
, "Inlining %s to %s with frequency %4.2f\n",
4637 id
->src_node
->dump_name (),
4638 id
->dst_node
->dump_name (),
4639 cg_edge
->sreal_frequency ().to_double ());
4640 id
->src_node
->dump (dump_file
);
4641 id
->dst_node
->dump (dump_file
);
4644 /* This is it. Duplicate the callee body. Assume callee is
4645 pre-gimplified. Note that we must not alter the caller
4646 function in any way before this point, as this CALL_EXPR may be
4647 a self-referential call; if we're calling ourselves, we need to
4648 duplicate our body before altering anything. */
4649 copy_body (id
, bb
, return_block
, NULL
);
4651 reset_debug_bindings (id
, stmt_gsi
);
4653 if (flag_stack_reuse
!= SR_NONE
)
4654 for (tree p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
4655 if (!TREE_THIS_VOLATILE (p
))
4657 tree
*varp
= id
->decl_map
->get (p
);
4658 if (varp
&& VAR_P (*varp
) && !is_gimple_reg (*varp
))
4660 tree clobber
= build_constructor (TREE_TYPE (*varp
), NULL
);
4661 gimple
*clobber_stmt
;
4662 TREE_THIS_VOLATILE (clobber
) = 1;
4663 clobber_stmt
= gimple_build_assign (*varp
, clobber
);
4664 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
4665 gsi_insert_before (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
4669 /* Reset the escaped solution. */
4670 if (cfun
->gimple_df
)
4671 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4673 /* Add new automatic variables to IFN_GOMP_SIMT_ENTER arguments. */
4674 if (id
->dst_simt_vars
&& id
->dst_simt_vars
->length () > 0)
4676 size_t nargs
= gimple_call_num_args (simtenter_stmt
);
4677 vec
<tree
> *vars
= id
->dst_simt_vars
;
4678 auto_vec
<tree
> newargs (nargs
+ vars
->length ());
4679 for (size_t i
= 0; i
< nargs
; i
++)
4680 newargs
.quick_push (gimple_call_arg (simtenter_stmt
, i
));
4681 for (tree
*pvar
= vars
->begin (); pvar
!= vars
->end (); pvar
++)
4683 tree ptrtype
= build_pointer_type (TREE_TYPE (*pvar
));
4684 newargs
.quick_push (build1 (ADDR_EXPR
, ptrtype
, *pvar
));
4686 gcall
*g
= gimple_build_call_internal_vec (IFN_GOMP_SIMT_ENTER
, newargs
);
4687 gimple_call_set_lhs (g
, gimple_call_lhs (simtenter_stmt
));
4688 gimple_stmt_iterator gsi
= gsi_for_stmt (simtenter_stmt
);
4689 gsi_replace (&gsi
, g
, false);
4691 vec_free (id
->dst_simt_vars
);
4692 id
->dst_simt_vars
= simtvars_save
;
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 gimple_set_location (stmt
, gimple_location (old_stmt
));
4718 gsi_replace (&stmt_gsi
, stmt
, false);
4719 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4720 /* Append a clobber for id->retvar if easily possible. */
4721 if (flag_stack_reuse
!= SR_NONE
4723 && VAR_P (id
->retvar
)
4724 && id
->retvar
!= return_slot
4725 && id
->retvar
!= modify_dest
4726 && !TREE_THIS_VOLATILE (id
->retvar
)
4727 && !is_gimple_reg (id
->retvar
)
4728 && !stmt_ends_bb_p (stmt
))
4730 tree clobber
= build_constructor (TREE_TYPE (id
->retvar
), NULL
);
4731 gimple
*clobber_stmt
;
4732 TREE_THIS_VOLATILE (clobber
) = 1;
4733 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
4734 gimple_set_location (clobber_stmt
, gimple_location (old_stmt
));
4735 gsi_insert_after (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
4740 /* Handle the case of inlining a function with no return
4741 statement, which causes the return value to become undefined. */
4742 if (gimple_call_lhs (stmt
)
4743 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4745 tree name
= gimple_call_lhs (stmt
);
4746 tree var
= SSA_NAME_VAR (name
);
4747 tree def
= var
? ssa_default_def (cfun
, var
) : NULL
;
4751 /* If the variable is used undefined, make this name
4752 undefined via a move. */
4753 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4754 gsi_replace (&stmt_gsi
, stmt
, true);
4760 var
= create_tmp_reg_fn (cfun
, TREE_TYPE (name
), NULL
);
4761 SET_SSA_NAME_VAR_OR_IDENTIFIER (name
, var
);
4763 /* Otherwise make this variable undefined. */
4764 gsi_remove (&stmt_gsi
, true);
4765 set_ssa_default_def (cfun
, var
, name
);
4766 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4769 /* Replace with a clobber for id->retvar. */
4770 else if (flag_stack_reuse
!= SR_NONE
4772 && VAR_P (id
->retvar
)
4773 && id
->retvar
!= return_slot
4774 && id
->retvar
!= modify_dest
4775 && !TREE_THIS_VOLATILE (id
->retvar
)
4776 && !is_gimple_reg (id
->retvar
))
4778 tree clobber
= build_constructor (TREE_TYPE (id
->retvar
), NULL
);
4779 gimple
*clobber_stmt
;
4780 TREE_THIS_VOLATILE (clobber
) = 1;
4781 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
4782 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
4783 gsi_replace (&stmt_gsi
, clobber_stmt
, false);
4784 maybe_clean_or_replace_eh_stmt (stmt
, clobber_stmt
);
4787 gsi_remove (&stmt_gsi
, true);
4790 if (purge_dead_abnormal_edges
)
4792 gimple_purge_dead_eh_edges (return_block
);
4793 gimple_purge_dead_abnormal_call_edges (return_block
);
4796 /* If the value of the new expression is ignored, that's OK. We
4797 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4798 the equivalent inlined version either. */
4799 if (is_gimple_assign (stmt
))
4801 gcc_assert (gimple_assign_single_p (stmt
)
4802 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4803 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4806 id
->assign_stmts
.release ();
4808 /* Output the inlining info for this abstract function, since it has been
4809 inlined. If we don't do this now, we can lose the information about the
4810 variables in the function when the blocks get blown away as soon as we
4811 remove the cgraph node. */
4812 if (gimple_block (stmt
))
4813 (*debug_hooks
->outlining_inline_function
) (fn
);
4815 /* Update callgraph if needed. */
4816 cg_edge
->callee
->remove ();
4818 id
->block
= NULL_TREE
;
4819 id
->retvar
= NULL_TREE
;
4820 successfully_inlined
= true;
4823 input_location
= saved_location
;
4824 return successfully_inlined
;
4827 /* Expand call statements reachable from STMT_P.
4828 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4829 in a MODIFY_EXPR. */
4832 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4834 gimple_stmt_iterator gsi
;
4835 bool inlined
= false;
4837 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
4839 gimple
*stmt
= gsi_stmt (gsi
);
4842 if (is_gimple_call (stmt
)
4843 && !gimple_call_internal_p (stmt
))
4844 inlined
|= expand_call_inline (bb
, stmt
, id
);
4851 /* Walk all basic blocks created after FIRST and try to fold every statement
4852 in the STATEMENTS pointer set. */
4855 fold_marked_statements (int first
, hash_set
<gimple
*> *statements
)
4857 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4858 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4860 gimple_stmt_iterator gsi
;
4862 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4865 if (statements
->contains (gsi_stmt (gsi
)))
4867 gimple
*old_stmt
= gsi_stmt (gsi
);
4868 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4870 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4872 /* Folding builtins can create multiple instructions,
4873 we need to look at all of them. */
4874 gimple_stmt_iterator i2
= gsi
;
4876 if (fold_stmt (&gsi
))
4879 /* If a builtin at the end of a bb folded into nothing,
4880 the following loop won't work. */
4881 if (gsi_end_p (gsi
))
4883 cgraph_update_edges_for_call_stmt (old_stmt
,
4888 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4893 new_stmt
= gsi_stmt (i2
);
4894 update_stmt (new_stmt
);
4895 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4898 if (new_stmt
== gsi_stmt (gsi
))
4900 /* It is okay to check only for the very last
4901 of these statements. If it is a throwing
4902 statement nothing will change. If it isn't
4903 this can remove EH edges. If that weren't
4904 correct then because some intermediate stmts
4905 throw, but not the last one. That would mean
4906 we'd have to split the block, which we can't
4907 here and we'd loose anyway. And as builtins
4908 probably never throw, this all
4910 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4912 gimple_purge_dead_eh_edges (
4913 BASIC_BLOCK_FOR_FN (cfun
, first
));
4920 else if (fold_stmt (&gsi
))
4922 /* Re-read the statement from GSI as fold_stmt() may
4924 gimple
*new_stmt
= gsi_stmt (gsi
);
4925 update_stmt (new_stmt
);
4927 if (is_gimple_call (old_stmt
)
4928 || is_gimple_call (new_stmt
))
4929 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4932 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4933 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
4940 /* Expand calls to inline functions in the body of FN. */
4943 optimize_inline_calls (tree fn
)
4947 int last
= n_basic_blocks_for_fn (cfun
);
4948 bool inlined_p
= false;
4951 memset (&id
, 0, sizeof (id
));
4953 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
4954 gcc_assert (id
.dst_node
->definition
);
4956 /* Or any functions that aren't finished yet. */
4957 if (current_function_decl
)
4958 id
.dst_fn
= current_function_decl
;
4960 id
.copy_decl
= copy_decl_maybe_to_var
;
4961 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4962 id
.transform_new_cfg
= false;
4963 id
.transform_return_to_modify
= true;
4964 id
.transform_parameter
= true;
4965 id
.transform_lang_insert_block
= NULL
;
4966 id
.statements_to_fold
= new hash_set
<gimple
*>;
4968 push_gimplify_context ();
4970 /* We make no attempts to keep dominance info up-to-date. */
4971 free_dominance_info (CDI_DOMINATORS
);
4972 free_dominance_info (CDI_POST_DOMINATORS
);
4974 /* Register specific gimple functions. */
4975 gimple_register_cfg_hooks ();
4977 /* Reach the trees by walking over the CFG, and note the
4978 enclosing basic-blocks in the call edges. */
4979 /* We walk the blocks going forward, because inlined function bodies
4980 will split id->current_basic_block, and the new blocks will
4981 follow it; we'll trudge through them, processing their CALL_EXPRs
4983 FOR_EACH_BB_FN (bb
, cfun
)
4984 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4986 pop_gimplify_context (NULL
);
4990 struct cgraph_edge
*e
;
4992 id
.dst_node
->verify ();
4994 /* Double check that we inlined everything we are supposed to inline. */
4995 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4996 gcc_assert (e
->inline_failed
);
4999 /* Fold queued statements. */
5000 update_max_bb_count ();
5001 fold_marked_statements (last
, id
.statements_to_fold
);
5002 delete id
.statements_to_fold
;
5004 gcc_assert (!id
.debug_stmts
.exists ());
5006 /* If we didn't inline into the function there is nothing to do. */
5010 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5013 delete_unreachable_blocks_update_callgraph (&id
);
5015 id
.dst_node
->verify ();
5017 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5018 not possible yet - the IPA passes might make various functions to not
5019 throw and they don't care to proactively update local EH info. This is
5020 done later in fixup_cfg pass that also execute the verification. */
5021 return (TODO_update_ssa
5023 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5024 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
5025 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
5026 ? TODO_rebuild_frequencies
: 0));
5029 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5032 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5034 enum tree_code code
= TREE_CODE (*tp
);
5035 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5037 /* We make copies of most nodes. */
5038 if (IS_EXPR_CODE_CLASS (cl
)
5039 || code
== TREE_LIST
5041 || code
== TYPE_DECL
5042 || code
== OMP_CLAUSE
)
5044 /* Because the chain gets clobbered when we make a copy, we save it
5046 tree chain
= NULL_TREE
, new_tree
;
5048 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5049 chain
= TREE_CHAIN (*tp
);
5051 /* Copy the node. */
5052 new_tree
= copy_node (*tp
);
5056 /* Now, restore the chain, if appropriate. That will cause
5057 walk_tree to walk into the chain as well. */
5058 if (code
== PARM_DECL
5059 || code
== TREE_LIST
5060 || code
== OMP_CLAUSE
)
5061 TREE_CHAIN (*tp
) = chain
;
5063 /* For now, we don't update BLOCKs when we make copies. So, we
5064 have to nullify all BIND_EXPRs. */
5065 if (TREE_CODE (*tp
) == BIND_EXPR
)
5066 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5068 else if (code
== CONSTRUCTOR
)
5070 /* CONSTRUCTOR nodes need special handling because
5071 we need to duplicate the vector of elements. */
5074 new_tree
= copy_node (*tp
);
5075 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5078 else if (code
== STATEMENT_LIST
)
5079 /* We used to just abort on STATEMENT_LIST, but we can run into them
5080 with statement-expressions (c++/40975). */
5081 copy_statement_list (tp
);
5082 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5084 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5086 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5091 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5092 information indicating to what new SAVE_EXPR this one should be mapped,
5093 use that one. Otherwise, create a new node and enter it in ST. FN is
5094 the function into which the copy will be placed. */
5097 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5102 /* See if we already encountered this SAVE_EXPR. */
5105 /* If we didn't already remap this SAVE_EXPR, do so now. */
5108 t
= copy_node (*tp
);
5110 /* Remember this SAVE_EXPR. */
5112 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5117 /* We've already walked into this SAVE_EXPR; don't do it again. */
5122 /* Replace this SAVE_EXPR with the copy. */
5126 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5127 label, copies the declaration and enters it in the splay_tree in DATA (which
5128 is really a 'copy_body_data *'. */
5131 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5132 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5133 struct walk_stmt_info
*wi
)
5135 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5136 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5140 tree decl
= gimple_label_label (stmt
);
5142 /* Copy the decl and remember the copy. */
5143 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5149 static gimple_seq
duplicate_remap_omp_clause_seq (gimple_seq seq
,
5150 struct walk_stmt_info
*wi
);
5152 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5153 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5154 remaps all local declarations to appropriate replacements in gimple
5158 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5160 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5161 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5162 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5166 /* For recursive invocations this is no longer the LHS itself. */
5167 bool is_lhs
= wi
->is_lhs
;
5170 if (TREE_CODE (expr
) == SSA_NAME
)
5172 *tp
= remap_ssa_name (*tp
, id
);
5175 SSA_NAME_DEF_STMT (*tp
) = gsi_stmt (wi
->gsi
);
5177 /* Only a local declaration (variable or label). */
5178 else if ((VAR_P (expr
) && !TREE_STATIC (expr
))
5179 || TREE_CODE (expr
) == LABEL_DECL
)
5181 /* Lookup the declaration. */
5184 /* If it's there, remap it. */
5189 else if (TREE_CODE (expr
) == STATEMENT_LIST
5190 || TREE_CODE (expr
) == BIND_EXPR
5191 || TREE_CODE (expr
) == SAVE_EXPR
)
5193 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5195 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5196 It's OK for this to happen if it was part of a subtree that
5197 isn't immediately expanded, such as operand 2 of another
5199 if (!TREE_OPERAND (expr
, 1))
5201 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5202 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5205 else if (TREE_CODE (expr
) == OMP_CLAUSE
)
5207 /* Before the omplower pass completes, some OMP clauses can contain
5208 sequences that are neither copied by gimple_seq_copy nor walked by
5209 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5210 in those situations, we have to copy and process them explicitely. */
5212 if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LASTPRIVATE
)
5214 gimple_seq seq
= OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
);
5215 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5216 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
) = seq
;
5218 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LINEAR
)
5220 gimple_seq seq
= OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
);
5221 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5222 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
) = seq
;
5224 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_REDUCTION
)
5226 gimple_seq seq
= OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
);
5227 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5228 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
) = seq
;
5229 seq
= OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
);
5230 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5231 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
) = seq
;
5235 /* Keep iterating. */
5240 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5241 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5242 remaps all local declarations to appropriate replacements in gimple
5246 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5247 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5248 struct walk_stmt_info
*wi
)
5250 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5251 gimple
*gs
= gsi_stmt (*gsip
);
5253 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5255 tree block
= gimple_bind_block (stmt
);
5259 remap_block (&block
, id
);
5260 gimple_bind_set_block (stmt
, block
);
5263 /* This will remap a lot of the same decls again, but this should be
5265 if (gimple_bind_vars (stmt
))
5267 tree old_var
, decls
= gimple_bind_vars (stmt
);
5269 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
5270 if (!can_be_nonlocal (old_var
, id
)
5271 && ! variably_modified_type_p (TREE_TYPE (old_var
), id
->src_fn
))
5272 remap_decl (old_var
, id
);
5274 gcc_checking_assert (!id
->prevent_decl_creation_for_types
);
5275 id
->prevent_decl_creation_for_types
= true;
5276 gimple_bind_set_vars (stmt
, remap_decls (decls
, NULL
, id
));
5277 id
->prevent_decl_creation_for_types
= false;
5281 /* Keep iterating. */
5285 /* Create a copy of SEQ and remap all decls in it. */
5288 duplicate_remap_omp_clause_seq (gimple_seq seq
, struct walk_stmt_info
*wi
)
5293 /* If there are any labels in OMP sequences, they can be only referred to in
5294 the sequence itself and therefore we can do both here. */
5295 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, wi
);
5296 gimple_seq copy
= gimple_seq_copy (seq
);
5297 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, wi
);
5301 /* Copies everything in SEQ and replaces variables and labels local to
5302 current_function_decl. */
5305 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5308 struct walk_stmt_info wi
;
5311 /* There's nothing to do for NULL_TREE. */
5316 memset (&id
, 0, sizeof (id
));
5317 id
.src_fn
= current_function_decl
;
5318 id
.dst_fn
= current_function_decl
;
5320 id
.decl_map
= new hash_map
<tree
, tree
>;
5321 id
.debug_map
= NULL
;
5323 id
.copy_decl
= copy_decl_no_change
;
5324 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5325 id
.transform_new_cfg
= false;
5326 id
.transform_return_to_modify
= false;
5327 id
.transform_parameter
= false;
5328 id
.transform_lang_insert_block
= NULL
;
5330 /* Walk the tree once to find local labels. */
5331 memset (&wi
, 0, sizeof (wi
));
5332 hash_set
<tree
> visited
;
5335 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5337 copy
= gimple_seq_copy (seq
);
5339 /* Walk the copy, remapping decls. */
5340 memset (&wi
, 0, sizeof (wi
));
5342 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5347 delete id
.debug_map
;
5348 if (id
.dependence_map
)
5350 delete id
.dependence_map
;
5351 id
.dependence_map
= NULL
;
5358 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5361 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5370 debug_find_tree (tree top
, tree search
)
5372 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5376 /* Declare the variables created by the inliner. Add all the variables in
5377 VARS to BIND_EXPR. */
5380 declare_inline_vars (tree block
, tree vars
)
5383 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5385 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5386 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5387 add_local_decl (cfun
, t
);
5391 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5394 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5395 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5396 VAR_DECL translation. */
5399 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5401 /* Don't generate debug information for the copy if we wouldn't have
5402 generated it for the copy either. */
5403 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5404 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5406 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5407 declaration inspired this copy. */
5408 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5410 /* The new variable/label has no RTL, yet. */
5411 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5412 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5413 SET_DECL_RTL (copy
, 0);
5415 /* These args would always appear unused, if not for this. */
5416 TREE_USED (copy
) = 1;
5418 /* Set the context for the new declaration. */
5419 if (!DECL_CONTEXT (decl
))
5420 /* Globals stay global. */
5422 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5423 /* Things that weren't in the scope of the function we're inlining
5424 from aren't in the scope we're inlining to, either. */
5426 else if (TREE_STATIC (decl
))
5427 /* Function-scoped static variables should stay in the original
5432 /* Ordinary automatic local variables are now in the scope of the
5434 DECL_CONTEXT (copy
) = id
->dst_fn
;
5435 if (VAR_P (copy
) && id
->dst_simt_vars
&& !is_gimple_reg (copy
))
5437 if (!lookup_attribute ("omp simt private", DECL_ATTRIBUTES (copy
)))
5438 DECL_ATTRIBUTES (copy
)
5439 = tree_cons (get_identifier ("omp simt private"), NULL
,
5440 DECL_ATTRIBUTES (copy
));
5441 id
->dst_simt_vars
->safe_push (copy
);
5449 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5453 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5454 || TREE_CODE (decl
) == RESULT_DECL
);
5456 type
= TREE_TYPE (decl
);
5458 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5459 VAR_DECL
, DECL_NAME (decl
), type
);
5460 if (DECL_PT_UID_SET_P (decl
))
5461 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5462 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5463 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5464 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5465 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5467 return copy_decl_for_dup_finish (id
, decl
, copy
);
5470 /* Like copy_decl_to_var, but create a return slot object instead of a
5471 pointer variable for return by invisible reference. */
5474 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5478 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5479 || TREE_CODE (decl
) == RESULT_DECL
);
5481 type
= TREE_TYPE (decl
);
5482 if (DECL_BY_REFERENCE (decl
))
5483 type
= TREE_TYPE (type
);
5485 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5486 VAR_DECL
, DECL_NAME (decl
), type
);
5487 if (DECL_PT_UID_SET_P (decl
))
5488 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5489 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5490 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5491 if (!DECL_BY_REFERENCE (decl
))
5493 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5494 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5497 return copy_decl_for_dup_finish (id
, decl
, copy
);
5501 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5505 copy
= copy_node (decl
);
5507 /* The COPY is not abstract; it will be generated in DST_FN. */
5508 DECL_ABSTRACT_P (copy
) = false;
5509 lang_hooks
.dup_lang_specific_decl (copy
);
5511 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5512 been taken; it's for internal bookkeeping in expand_goto_internal. */
5513 if (TREE_CODE (copy
) == LABEL_DECL
)
5515 TREE_ADDRESSABLE (copy
) = 0;
5516 LABEL_DECL_UID (copy
) = -1;
5519 return copy_decl_for_dup_finish (id
, decl
, copy
);
5523 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5525 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5526 return copy_decl_to_var (decl
, id
);
5528 return copy_decl_no_change (decl
, id
);
5531 /* Return a copy of the function's argument tree. */
5533 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5534 bitmap args_to_skip
, tree
*vars
)
5537 tree new_parm
= NULL
;
5542 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5543 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5545 tree new_tree
= remap_decl (arg
, id
);
5546 if (TREE_CODE (new_tree
) != PARM_DECL
)
5547 new_tree
= id
->copy_decl (arg
, id
);
5548 lang_hooks
.dup_lang_specific_decl (new_tree
);
5550 parg
= &DECL_CHAIN (new_tree
);
5552 else if (!id
->decl_map
->get (arg
))
5554 /* Make an equivalent VAR_DECL. If the argument was used
5555 as temporary variable later in function, the uses will be
5556 replaced by local variable. */
5557 tree var
= copy_decl_to_var (arg
, id
);
5558 insert_decl_map (id
, arg
, var
);
5559 /* Declare this new variable. */
5560 DECL_CHAIN (var
) = *vars
;
5566 /* Return a copy of the function's static chain. */
5568 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5570 tree
*chain_copy
, *pvar
;
5572 chain_copy
= &static_chain
;
5573 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5575 tree new_tree
= remap_decl (*pvar
, id
);
5576 lang_hooks
.dup_lang_specific_decl (new_tree
);
5577 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5580 return static_chain
;
5583 /* Return true if the function is allowed to be versioned.
5584 This is a guard for the versioning functionality. */
5587 tree_versionable_function_p (tree fndecl
)
5589 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5590 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
)) == NULL
);
5593 /* Delete all unreachable basic blocks and update callgraph.
5594 Doing so is somewhat nontrivial because we need to update all clones and
5595 remove inline function that become unreachable. */
5598 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5600 bool changed
= false;
5601 basic_block b
, next_bb
;
5603 find_unreachable_blocks ();
5605 /* Delete all unreachable basic blocks. */
5607 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5608 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5610 next_bb
= b
->next_bb
;
5612 if (!(b
->flags
& BB_REACHABLE
))
5614 gimple_stmt_iterator bsi
;
5616 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5618 struct cgraph_edge
*e
;
5619 struct cgraph_node
*node
;
5621 id
->dst_node
->remove_stmt_references (gsi_stmt (bsi
));
5623 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5624 &&(e
= id
->dst_node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5626 if (!e
->inline_failed
)
5627 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5631 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5632 && id
->dst_node
->clones
)
5633 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5635 node
->remove_stmt_references (gsi_stmt (bsi
));
5636 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5637 && (e
= node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5639 if (!e
->inline_failed
)
5640 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5646 node
= node
->clones
;
5647 else if (node
->next_sibling_clone
)
5648 node
= node
->next_sibling_clone
;
5651 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5652 node
= node
->clone_of
;
5653 if (node
!= id
->dst_node
)
5654 node
= node
->next_sibling_clone
;
5658 delete_basic_block (b
);
5666 /* Update clone info after duplication. */
5669 update_clone_info (copy_body_data
* id
)
5671 struct cgraph_node
*node
;
5672 if (!id
->dst_node
->clones
)
5674 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5676 /* First update replace maps to match the new body. */
5677 if (node
->clone
.tree_map
)
5680 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5682 struct ipa_replace_map
*replace_info
;
5683 replace_info
= (*node
->clone
.tree_map
)[i
];
5684 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5685 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5689 node
= node
->clones
;
5690 else if (node
->next_sibling_clone
)
5691 node
= node
->next_sibling_clone
;
5694 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5695 node
= node
->clone_of
;
5696 if (node
!= id
->dst_node
)
5697 node
= node
->next_sibling_clone
;
5702 /* Create a copy of a function's tree.
5703 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5704 of the original function and the new copied function
5705 respectively. In case we want to replace a DECL
5706 tree with another tree while duplicating the function's
5707 body, TREE_MAP represents the mapping between these
5708 trees. If UPDATE_CLONES is set, the call_stmt fields
5709 of edges of clones of the function will be updated.
5711 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5713 If SKIP_RETURN is true, the new version will return void.
5714 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5715 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5718 tree_function_versioning (tree old_decl
, tree new_decl
,
5719 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
5720 bool update_clones
, bitmap args_to_skip
,
5721 bool skip_return
, bitmap blocks_to_copy
,
5722 basic_block new_entry
)
5724 struct cgraph_node
*old_version_node
;
5725 struct cgraph_node
*new_version_node
;
5729 struct ipa_replace_map
*replace_info
;
5730 basic_block old_entry_block
, bb
;
5731 auto_vec
<gimple
*, 10> init_stmts
;
5732 tree vars
= NULL_TREE
;
5733 bitmap debug_args_to_skip
= args_to_skip
;
5735 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5736 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5737 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5739 old_version_node
= cgraph_node::get (old_decl
);
5740 gcc_checking_assert (old_version_node
);
5741 new_version_node
= cgraph_node::get (new_decl
);
5742 gcc_checking_assert (new_version_node
);
5744 /* Copy over debug args. */
5745 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5747 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5748 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5749 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5750 old_debug_args
= decl_debug_args_lookup (old_decl
);
5753 new_debug_args
= decl_debug_args_insert (new_decl
);
5754 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5758 /* Output the inlining info for this abstract function, since it has been
5759 inlined. If we don't do this now, we can lose the information about the
5760 variables in the function when the blocks get blown away as soon as we
5761 remove the cgraph node. */
5762 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5764 DECL_ARTIFICIAL (new_decl
) = 1;
5765 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5766 if (DECL_ORIGIN (old_decl
) == old_decl
)
5767 old_version_node
->used_as_abstract_origin
= true;
5768 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5770 /* Prepare the data structures for the tree copy. */
5771 memset (&id
, 0, sizeof (id
));
5773 /* Generate a new name for the new version. */
5774 id
.statements_to_fold
= new hash_set
<gimple
*>;
5776 id
.decl_map
= new hash_map
<tree
, tree
>;
5777 id
.debug_map
= NULL
;
5778 id
.src_fn
= old_decl
;
5779 id
.dst_fn
= new_decl
;
5780 id
.src_node
= old_version_node
;
5781 id
.dst_node
= new_version_node
;
5782 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5783 id
.blocks_to_copy
= blocks_to_copy
;
5785 id
.copy_decl
= copy_decl_no_change
;
5786 id
.transform_call_graph_edges
5787 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5788 id
.transform_new_cfg
= true;
5789 id
.transform_return_to_modify
= false;
5790 id
.transform_parameter
= false;
5791 id
.transform_lang_insert_block
= NULL
;
5793 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5794 (DECL_STRUCT_FUNCTION (old_decl
));
5795 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5796 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5797 initialize_cfun (new_decl
, old_decl
,
5798 new_entry
? new_entry
->count
: old_entry_block
->count
);
5799 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
5800 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5801 = id
.src_cfun
->gimple_df
->ipa_pta
;
5803 /* Copy the function's static chain. */
5804 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5806 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
5807 = copy_static_chain (p
, &id
);
5809 /* If there's a tree_map, prepare for substitution. */
5811 for (i
= 0; i
< tree_map
->length (); i
++)
5814 replace_info
= (*tree_map
)[i
];
5815 if (replace_info
->replace_p
)
5818 if (!replace_info
->old_tree
)
5820 int p
= replace_info
->parm_num
;
5822 tree req_type
, new_type
;
5824 for (parm
= DECL_ARGUMENTS (old_decl
); p
;
5825 parm
= DECL_CHAIN (parm
))
5827 replace_info
->old_tree
= parm
;
5828 parm_num
= replace_info
->parm_num
;
5829 req_type
= TREE_TYPE (parm
);
5830 new_type
= TREE_TYPE (replace_info
->new_tree
);
5831 if (!useless_type_conversion_p (req_type
, new_type
))
5833 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5834 replace_info
->new_tree
5835 = fold_build1 (NOP_EXPR
, req_type
,
5836 replace_info
->new_tree
);
5837 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (new_type
))
5838 replace_info
->new_tree
5839 = fold_build1 (VIEW_CONVERT_EXPR
, req_type
,
5840 replace_info
->new_tree
);
5845 fprintf (dump_file
, " const ");
5846 print_generic_expr (dump_file
,
5847 replace_info
->new_tree
);
5849 " can't be converted to param ");
5850 print_generic_expr (dump_file
, parm
);
5851 fprintf (dump_file
, "\n");
5853 replace_info
->old_tree
= NULL
;
5858 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5859 if (replace_info
->old_tree
)
5861 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5862 replace_info
->new_tree
, id
.src_fn
,
5866 init_stmts
.safe_push (init
);
5867 if (MAY_HAVE_DEBUG_BIND_STMTS
&& args_to_skip
)
5873 for (parm
= DECL_ARGUMENTS (old_decl
), p
= 0; parm
;
5874 parm
= DECL_CHAIN (parm
), p
++)
5875 if (parm
== replace_info
->old_tree
)
5883 if (debug_args_to_skip
== args_to_skip
)
5885 debug_args_to_skip
= BITMAP_ALLOC (NULL
);
5886 bitmap_copy (debug_args_to_skip
, args_to_skip
);
5888 bitmap_clear_bit (debug_args_to_skip
, parm_num
);
5894 /* Copy the function's arguments. */
5895 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5896 DECL_ARGUMENTS (new_decl
)
5897 = copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5898 args_to_skip
, &vars
);
5900 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5901 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5903 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5905 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5906 /* Add local vars. */
5907 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5909 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5911 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5913 DECL_RESULT (new_decl
)
5914 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5915 RESULT_DECL
, NULL_TREE
, void_type_node
);
5916 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5917 cfun
->returns_struct
= 0;
5918 cfun
->returns_pcc_struct
= 0;
5923 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5924 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5925 if (gimple_in_ssa_p (id
.src_cfun
)
5926 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5927 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5929 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
5930 insert_decl_map (&id
, old_name
, new_name
);
5931 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5932 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5936 /* Set up the destination functions loop tree. */
5937 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5939 cfun
->curr_properties
&= ~PROP_loops
;
5940 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5941 cfun
->curr_properties
|= PROP_loops
;
5944 /* Copy the Function's body. */
5945 copy_body (&id
, ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
5948 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5949 number_blocks (new_decl
);
5951 /* We want to create the BB unconditionally, so that the addition of
5952 debug stmts doesn't affect BB count, which may in the end cause
5953 codegen differences. */
5954 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5955 while (init_stmts
.length ())
5956 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5957 update_clone_info (&id
);
5959 /* Remap the nonlocal_goto_save_area, if any. */
5960 if (cfun
->nonlocal_goto_save_area
)
5962 struct walk_stmt_info wi
;
5964 memset (&wi
, 0, sizeof (wi
));
5966 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5972 delete id
.debug_map
;
5973 free_dominance_info (CDI_DOMINATORS
);
5974 free_dominance_info (CDI_POST_DOMINATORS
);
5976 update_max_bb_count ();
5977 fold_marked_statements (0, id
.statements_to_fold
);
5978 delete id
.statements_to_fold
;
5979 delete_unreachable_blocks_update_callgraph (&id
);
5980 if (id
.dst_node
->definition
)
5981 cgraph_edge::rebuild_references ();
5982 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
5984 calculate_dominance_info (CDI_DOMINATORS
);
5985 fix_loop_structure (NULL
);
5987 update_ssa (TODO_update_ssa
);
5989 /* After partial cloning we need to rescale frequencies, so they are
5990 within proper range in the cloned function. */
5993 struct cgraph_edge
*e
;
5994 rebuild_frequencies ();
5996 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5997 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5999 basic_block bb
= gimple_bb (e
->call_stmt
);
6000 e
->count
= bb
->count
;
6002 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
6004 basic_block bb
= gimple_bb (e
->call_stmt
);
6005 e
->count
= bb
->count
;
6009 if (debug_args_to_skip
&& MAY_HAVE_DEBUG_BIND_STMTS
)
6012 vec
<tree
, va_gc
> **debug_args
= NULL
;
6013 unsigned int len
= 0;
6014 for (parm
= DECL_ARGUMENTS (old_decl
), i
= 0;
6015 parm
; parm
= DECL_CHAIN (parm
), i
++)
6016 if (bitmap_bit_p (debug_args_to_skip
, i
) && is_gimple_reg (parm
))
6020 if (debug_args
== NULL
)
6022 debug_args
= decl_debug_args_insert (new_decl
);
6023 len
= vec_safe_length (*debug_args
);
6025 ddecl
= make_node (DEBUG_EXPR_DECL
);
6026 DECL_ARTIFICIAL (ddecl
) = 1;
6027 TREE_TYPE (ddecl
) = TREE_TYPE (parm
);
6028 SET_DECL_MODE (ddecl
, DECL_MODE (parm
));
6029 vec_safe_push (*debug_args
, DECL_ORIGIN (parm
));
6030 vec_safe_push (*debug_args
, ddecl
);
6032 if (debug_args
!= NULL
)
6034 /* On the callee side, add
6037 stmts to the first bb where var is a VAR_DECL created for the
6038 optimized away parameter in DECL_INITIAL block. This hints
6039 in the debug info that var (whole DECL_ORIGIN is the parm
6040 PARM_DECL) is optimized away, but could be looked up at the
6041 call site as value of D#X there. */
6042 tree var
= vars
, vexpr
;
6043 gimple_stmt_iterator cgsi
6044 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6047 i
= vec_safe_length (*debug_args
);
6051 while (var
!= NULL_TREE
6052 && DECL_ABSTRACT_ORIGIN (var
) != (**debug_args
)[i
])
6053 var
= TREE_CHAIN (var
);
6054 if (var
== NULL_TREE
)
6056 vexpr
= make_node (DEBUG_EXPR_DECL
);
6057 parm
= (**debug_args
)[i
];
6058 DECL_ARTIFICIAL (vexpr
) = 1;
6059 TREE_TYPE (vexpr
) = TREE_TYPE (parm
);
6060 SET_DECL_MODE (vexpr
, DECL_MODE (parm
));
6061 def_temp
= gimple_build_debug_bind (var
, vexpr
, NULL
);
6062 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6063 def_temp
= gimple_build_debug_source_bind (vexpr
, parm
, NULL
);
6064 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6070 if (debug_args_to_skip
&& debug_args_to_skip
!= args_to_skip
)
6071 BITMAP_FREE (debug_args_to_skip
);
6072 free_dominance_info (CDI_DOMINATORS
);
6073 free_dominance_info (CDI_POST_DOMINATORS
);
6075 gcc_assert (!id
.debug_stmts
.exists ());
6080 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6081 the callee and return the inlined body on success. */
6084 maybe_inline_call_in_expr (tree exp
)
6086 tree fn
= get_callee_fndecl (exp
);
6088 /* We can only try to inline "const" functions. */
6089 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
6091 call_expr_arg_iterator iter
;
6094 hash_map
<tree
, tree
> decl_map
;
6096 /* Remap the parameters. */
6097 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
6099 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
6100 decl_map
.put (param
, arg
);
6102 memset (&id
, 0, sizeof (id
));
6104 id
.dst_fn
= current_function_decl
;
6105 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6106 id
.decl_map
= &decl_map
;
6108 id
.copy_decl
= copy_decl_no_change
;
6109 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6110 id
.transform_new_cfg
= false;
6111 id
.transform_return_to_modify
= true;
6112 id
.transform_parameter
= true;
6113 id
.transform_lang_insert_block
= NULL
;
6115 /* Make sure not to unshare trees behind the front-end's back
6116 since front-end specific mechanisms may rely on sharing. */
6117 id
.regimplify
= false;
6118 id
.do_not_unshare
= true;
6120 /* We're not inside any EH region. */
6123 t
= copy_tree_body (&id
);
6125 /* We can only return something suitable for use in a GENERIC
6127 if (TREE_CODE (t
) == MODIFY_EXPR
)
6128 return TREE_OPERAND (t
, 1);
6134 /* Duplicate a type, fields and all. */
6137 build_duplicate_type (tree type
)
6139 struct copy_body_data id
;
6141 memset (&id
, 0, sizeof (id
));
6142 id
.src_fn
= current_function_decl
;
6143 id
.dst_fn
= current_function_decl
;
6145 id
.decl_map
= new hash_map
<tree
, tree
>;
6146 id
.debug_map
= NULL
;
6147 id
.copy_decl
= copy_decl_no_change
;
6149 type
= remap_type_1 (type
, &id
);
6153 delete id
.debug_map
;
6155 TYPE_CANONICAL (type
) = type
;
6160 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6161 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6165 copy_fn (tree fn
, tree
& parms
, tree
& result
)
6169 hash_map
<tree
, tree
> decl_map
;
6174 memset (&id
, 0, sizeof (id
));
6176 id
.dst_fn
= current_function_decl
;
6177 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6178 id
.decl_map
= &decl_map
;
6180 id
.copy_decl
= copy_decl_no_change
;
6181 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6182 id
.transform_new_cfg
= false;
6183 id
.transform_return_to_modify
= false;
6184 id
.transform_parameter
= true;
6185 id
.transform_lang_insert_block
= NULL
;
6187 /* Make sure not to unshare trees behind the front-end's back
6188 since front-end specific mechanisms may rely on sharing. */
6189 id
.regimplify
= false;
6190 id
.do_not_unshare
= true;
6192 /* We're not inside any EH region. */
6195 /* Remap the parameters and result and return them to the caller. */
6196 for (param
= DECL_ARGUMENTS (fn
);
6198 param
= DECL_CHAIN (param
))
6200 *p
= remap_decl (param
, &id
);
6201 p
= &DECL_CHAIN (*p
);
6204 if (DECL_RESULT (fn
))
6205 result
= remap_decl (DECL_RESULT (fn
), &id
);
6209 return copy_tree_body (&id
);