2 Copyright (C) 2001-2017 Free Software Foundation, Inc.
3 Contributed by Alexandre Oliva <aoliva@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
30 #include "tree-pass.h"
33 #include "tree-pretty-print.h"
34 #include "diagnostic-core.h"
35 #include "gimple-predict.h"
36 #include "fold-const.h"
37 #include "stor-layout.h"
39 #include "tree-inline.h"
40 #include "langhooks.h"
42 #include "tree-iterator.h"
44 #include "gimple-fold.h"
47 #include "gimple-iterator.h"
48 #include "gimplify-me.h"
49 #include "gimple-walk.h"
51 #include "tree-into-ssa.h"
56 #include "value-prof.h"
59 #include "tree-chkp.h"
60 #include "stringpool.h"
63 /* I'm not real happy about this, but we need to handle gimple and
66 /* Inlining, Cloning, Versioning, Parallelization
68 Inlining: a function body is duplicated, but the PARM_DECLs are
69 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
70 MODIFY_EXPRs that store to a dedicated returned-value variable.
71 The duplicated eh_region info of the copy will later be appended
72 to the info for the caller; the eh_region info in copied throwing
73 statements and RESX statements are adjusted accordingly.
75 Cloning: (only in C++) We have one body for a con/de/structor, and
76 multiple function decls, each with a unique parameter list.
77 Duplicate the body, using the given splay tree; some parameters
78 will become constants (like 0 or 1).
80 Versioning: a function body is duplicated and the result is a new
81 function rather than into blocks of an existing function as with
82 inlining. Some parameters will become constants.
84 Parallelization: a region of a function is duplicated resulting in
85 a new function. Variables may be replaced with complex expressions
86 to enable shared variable semantics.
88 All of these will simultaneously lookup any callgraph edges. If
89 we're going to inline the duplicated function body, and the given
90 function has some cloned callgraph nodes (one for each place this
91 function will be inlined) those callgraph edges will be duplicated.
92 If we're cloning the body, those callgraph edges will be
93 updated to point into the new body. (Note that the original
94 callgraph node and edge list will not be altered.)
96 See the CALL_EXPR handling case in copy_tree_body_r (). */
100 o In order to make inlining-on-trees work, we pessimized
101 function-local static constants. In particular, they are now
102 always output, even when not addressed. Fix this by treating
103 function-local static constants just like global static
104 constants; the back-end already knows not to output them if they
107 o Provide heuristics to clamp inlining of recursive template
111 /* Weights that estimate_num_insns uses to estimate the size of the
114 eni_weights eni_size_weights
;
116 /* Weights that estimate_num_insns uses to estimate the time necessary
117 to execute the produced code. */
119 eni_weights eni_time_weights
;
123 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, tree
,
125 static void remap_block (tree
*, copy_body_data
*);
126 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
127 static void declare_inline_vars (tree
, tree
);
128 static void remap_save_expr (tree
*, hash_map
<tree
, tree
> *, int *);
129 static void prepend_lexical_block (tree current_block
, tree new_block
);
130 static tree
copy_decl_to_var (tree
, copy_body_data
*);
131 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
132 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
133 static gimple_seq
remap_gimple_stmt (gimple
*, copy_body_data
*);
134 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
135 static void insert_init_stmt (copy_body_data
*, basic_block
, gimple
*);
137 /* Insert a tree->tree mapping for ID. Despite the name suggests
138 that the trees should be variables, it is used for more than that. */
141 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
143 id
->decl_map
->put (key
, value
);
145 /* Always insert an identity map as well. If we see this same new
146 node again, we won't want to duplicate it a second time. */
148 id
->decl_map
->put (value
, value
);
151 /* Insert a tree->tree mapping for ID. This is only used for
155 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
157 if (!gimple_in_ssa_p (id
->src_cfun
))
160 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
163 if (!target_for_debug_bind (key
))
166 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
167 gcc_assert (VAR_P (value
));
170 id
->debug_map
= new hash_map
<tree
, tree
>;
172 id
->debug_map
->put (key
, value
);
175 /* If nonzero, we're remapping the contents of inlined debug
176 statements. If negative, an error has occurred, such as a
177 reference to a variable that isn't available in the inlined
179 static int processing_debug_stmt
= 0;
181 /* Construct new SSA name for old NAME. ID is the inline context. */
184 remap_ssa_name (tree name
, copy_body_data
*id
)
189 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
191 n
= id
->decl_map
->get (name
);
193 return unshare_expr (*n
);
195 if (processing_debug_stmt
)
197 if (SSA_NAME_IS_DEFAULT_DEF (name
)
198 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
199 && id
->entry_bb
== NULL
200 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
202 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
204 gimple_stmt_iterator gsi
;
205 tree val
= SSA_NAME_VAR (name
);
207 n
= id
->decl_map
->get (val
);
210 if (TREE_CODE (val
) != PARM_DECL
)
212 processing_debug_stmt
= -1;
215 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
216 DECL_ARTIFICIAL (vexpr
) = 1;
217 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
218 SET_DECL_MODE (vexpr
, DECL_MODE (SSA_NAME_VAR (name
)));
219 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
220 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
224 processing_debug_stmt
= -1;
228 /* Remap anonymous SSA names or SSA names of anonymous decls. */
229 var
= SSA_NAME_VAR (name
);
231 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
233 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
234 && DECL_ARTIFICIAL (var
)
235 && DECL_IGNORED_P (var
)
236 && !DECL_NAME (var
)))
238 struct ptr_info_def
*pi
;
239 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
));
240 if (!var
&& SSA_NAME_IDENTIFIER (name
))
241 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
242 insert_decl_map (id
, name
, new_tree
);
243 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
244 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
245 /* At least IPA points-to info can be directly transferred. */
246 if (id
->src_cfun
->gimple_df
247 && id
->src_cfun
->gimple_df
->ipa_pta
248 && POINTER_TYPE_P (TREE_TYPE (name
))
249 && (pi
= SSA_NAME_PTR_INFO (name
))
252 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
258 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
260 new_tree
= remap_decl (var
, id
);
262 /* We might've substituted constant or another SSA_NAME for
265 Replace the SSA name representing RESULT_DECL by variable during
266 inlining: this saves us from need to introduce PHI node in a case
267 return value is just partly initialized. */
268 if ((VAR_P (new_tree
) || TREE_CODE (new_tree
) == PARM_DECL
)
269 && (!SSA_NAME_VAR (name
)
270 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
271 || !id
->transform_return_to_modify
))
273 struct ptr_info_def
*pi
;
274 new_tree
= make_ssa_name (new_tree
);
275 insert_decl_map (id
, name
, new_tree
);
276 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
277 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
278 /* At least IPA points-to info can be directly transferred. */
279 if (id
->src_cfun
->gimple_df
280 && id
->src_cfun
->gimple_df
->ipa_pta
281 && POINTER_TYPE_P (TREE_TYPE (name
))
282 && (pi
= SSA_NAME_PTR_INFO (name
))
285 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
288 if (SSA_NAME_IS_DEFAULT_DEF (name
))
290 /* By inlining function having uninitialized variable, we might
291 extend the lifetime (variable might get reused). This cause
292 ICE in the case we end up extending lifetime of SSA name across
293 abnormal edge, but also increase register pressure.
295 We simply initialize all uninitialized vars by 0 except
296 for case we are inlining to very first BB. We can avoid
297 this for all BBs that are not inside strongly connected
298 regions of the CFG, but this is expensive to test. */
300 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
301 && (!SSA_NAME_VAR (name
)
302 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
303 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
305 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
307 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
309 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
311 init_stmt
= gimple_build_assign (new_tree
, zero
);
312 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
313 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
317 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
318 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
323 insert_decl_map (id
, name
, new_tree
);
327 /* Remap DECL during the copying of the BLOCK tree for the function. */
330 remap_decl (tree decl
, copy_body_data
*id
)
334 /* We only remap local variables in the current function. */
336 /* See if we have remapped this declaration. */
338 n
= id
->decl_map
->get (decl
);
340 if (!n
&& processing_debug_stmt
)
342 processing_debug_stmt
= -1;
346 /* When remapping a type within copy_gimple_seq_and_replace_locals, all
347 necessary DECLs have already been remapped and we do not want to duplicate
348 a decl coming from outside of the sequence we are copying. */
350 && id
->prevent_decl_creation_for_types
351 && id
->remapping_type_depth
> 0
352 && (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
))
355 /* If we didn't already have an equivalent for this declaration, create one
359 /* Make a copy of the variable or label. */
360 tree t
= id
->copy_decl (decl
, id
);
362 /* Remember it, so that if we encounter this local entity again
363 we can reuse this copy. Do this early because remap_type may
364 need this decl for TYPE_STUB_DECL. */
365 insert_decl_map (id
, decl
, t
);
370 /* Remap types, if necessary. */
371 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
372 if (TREE_CODE (t
) == TYPE_DECL
)
374 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
376 /* Preserve the invariant that DECL_ORIGINAL_TYPE != TREE_TYPE,
377 which is enforced in gen_typedef_die when DECL_ABSTRACT_ORIGIN
378 is not set on the TYPE_DECL, for example in LTO mode. */
379 if (DECL_ORIGINAL_TYPE (t
) == TREE_TYPE (t
))
381 tree x
= build_variant_type_copy (TREE_TYPE (t
));
382 TYPE_STUB_DECL (x
) = TYPE_STUB_DECL (TREE_TYPE (t
));
383 TYPE_NAME (x
) = TYPE_NAME (TREE_TYPE (t
));
384 DECL_ORIGINAL_TYPE (t
) = x
;
388 /* Remap sizes as necessary. */
389 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
390 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
392 /* If fields, do likewise for offset and qualifier. */
393 if (TREE_CODE (t
) == FIELD_DECL
)
395 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
396 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
397 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
403 if (id
->do_not_unshare
)
406 return unshare_expr (*n
);
410 remap_type_1 (tree type
, copy_body_data
*id
)
414 /* We do need a copy. build and register it now. If this is a pointer or
415 reference type, remap the designated type and make a new pointer or
417 if (TREE_CODE (type
) == POINTER_TYPE
)
419 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
421 TYPE_REF_CAN_ALIAS_ALL (type
));
422 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
423 new_tree
= build_type_attribute_qual_variant (new_tree
,
424 TYPE_ATTRIBUTES (type
),
426 insert_decl_map (id
, type
, new_tree
);
429 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
431 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
433 TYPE_REF_CAN_ALIAS_ALL (type
));
434 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
435 new_tree
= build_type_attribute_qual_variant (new_tree
,
436 TYPE_ATTRIBUTES (type
),
438 insert_decl_map (id
, type
, new_tree
);
442 new_tree
= copy_node (type
);
444 insert_decl_map (id
, type
, new_tree
);
446 /* This is a new type, not a copy of an old type. Need to reassociate
447 variants. We can handle everything except the main variant lazily. */
448 t
= TYPE_MAIN_VARIANT (type
);
451 t
= remap_type (t
, id
);
452 TYPE_MAIN_VARIANT (new_tree
) = t
;
453 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
454 TYPE_NEXT_VARIANT (t
) = new_tree
;
458 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
459 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
462 if (TYPE_STUB_DECL (type
))
463 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
465 /* Lazily create pointer and reference types. */
466 TYPE_POINTER_TO (new_tree
) = NULL
;
467 TYPE_REFERENCE_TO (new_tree
) = NULL
;
469 /* Copy all types that may contain references to local variables; be sure to
470 preserve sharing in between type and its main variant when possible. */
471 switch (TREE_CODE (new_tree
))
475 case FIXED_POINT_TYPE
:
478 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
480 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
481 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
483 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
484 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
488 t
= TYPE_MIN_VALUE (new_tree
);
489 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
490 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
492 t
= TYPE_MAX_VALUE (new_tree
);
493 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
494 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
499 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
500 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
501 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
503 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
504 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
505 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
506 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
508 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
512 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
513 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
514 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
516 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
518 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
520 gcc_checking_assert (TYPE_DOMAIN (type
) == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
521 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
524 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
529 case QUAL_UNION_TYPE
:
530 if (TYPE_MAIN_VARIANT (type
) != type
531 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
532 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
537 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
539 t
= remap_decl (f
, id
);
540 DECL_CONTEXT (t
) = new_tree
;
544 TYPE_FIELDS (new_tree
) = nreverse (nf
);
550 /* Shouldn't have been thought variable sized. */
554 /* All variants of type share the same size, so use the already remaped data. */
555 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
557 tree s
= TYPE_SIZE (type
);
558 tree mvs
= TYPE_SIZE (TYPE_MAIN_VARIANT (type
));
559 tree su
= TYPE_SIZE_UNIT (type
);
560 tree mvsu
= TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
));
561 gcc_checking_assert ((TREE_CODE (s
) == PLACEHOLDER_EXPR
562 && (TREE_CODE (mvs
) == PLACEHOLDER_EXPR
))
564 gcc_checking_assert ((TREE_CODE (su
) == PLACEHOLDER_EXPR
565 && (TREE_CODE (mvsu
) == PLACEHOLDER_EXPR
))
567 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
568 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
572 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
573 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
580 remap_type (tree type
, copy_body_data
*id
)
588 /* See if we have remapped this type. */
589 node
= id
->decl_map
->get (type
);
593 /* The type only needs remapping if it's variably modified. */
594 if (! variably_modified_type_p (type
, id
->src_fn
))
596 insert_decl_map (id
, type
, type
);
600 id
->remapping_type_depth
++;
601 tmp
= remap_type_1 (type
, id
);
602 id
->remapping_type_depth
--;
607 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
610 can_be_nonlocal (tree decl
, copy_body_data
*id
)
612 /* We can not duplicate function decls. */
613 if (TREE_CODE (decl
) == FUNCTION_DECL
)
616 /* Local static vars must be non-local or we get multiple declaration
618 if (VAR_P (decl
) && !auto_var_in_fn_p (decl
, id
->src_fn
))
625 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
629 tree new_decls
= NULL_TREE
;
631 /* Remap its variables. */
632 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
636 if (can_be_nonlocal (old_var
, id
))
638 /* We need to add this variable to the local decls as otherwise
639 nothing else will do so. */
640 if (VAR_P (old_var
) && ! DECL_EXTERNAL (old_var
) && cfun
)
641 add_local_decl (cfun
, old_var
);
642 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
643 && !DECL_IGNORED_P (old_var
)
644 && nonlocalized_list
)
645 vec_safe_push (*nonlocalized_list
, old_var
);
649 /* Remap the variable. */
650 new_var
= remap_decl (old_var
, id
);
652 /* If we didn't remap this variable, we can't mess with its
653 TREE_CHAIN. If we remapped this variable to the return slot, it's
654 already declared somewhere else, so don't declare it here. */
656 if (new_var
== id
->retvar
)
660 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
661 && !DECL_IGNORED_P (old_var
)
662 && nonlocalized_list
)
663 vec_safe_push (*nonlocalized_list
, old_var
);
667 gcc_assert (DECL_P (new_var
));
668 DECL_CHAIN (new_var
) = new_decls
;
671 /* Also copy value-expressions. */
672 if (VAR_P (new_var
) && DECL_HAS_VALUE_EXPR_P (new_var
))
674 tree tem
= DECL_VALUE_EXPR (new_var
);
675 bool old_regimplify
= id
->regimplify
;
676 id
->remapping_type_depth
++;
677 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
678 id
->remapping_type_depth
--;
679 id
->regimplify
= old_regimplify
;
680 SET_DECL_VALUE_EXPR (new_var
, tem
);
685 return nreverse (new_decls
);
688 /* Copy the BLOCK to contain remapped versions of the variables
689 therein. And hook the new block into the block-tree. */
692 remap_block (tree
*block
, copy_body_data
*id
)
697 /* Make the new block. */
699 new_block
= make_node (BLOCK
);
700 TREE_USED (new_block
) = TREE_USED (old_block
);
701 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
702 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
703 BLOCK_NONLOCALIZED_VARS (new_block
)
704 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
707 /* Remap its variables. */
708 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
709 &BLOCK_NONLOCALIZED_VARS (new_block
),
712 if (id
->transform_lang_insert_block
)
713 id
->transform_lang_insert_block (new_block
);
715 /* Remember the remapped block. */
716 insert_decl_map (id
, old_block
, new_block
);
719 /* Copy the whole block tree and root it in id->block. */
721 remap_blocks (tree block
, copy_body_data
*id
)
724 tree new_tree
= block
;
729 remap_block (&new_tree
, id
);
730 gcc_assert (new_tree
!= block
);
731 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
732 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
733 /* Blocks are in arbitrary order, but make things slightly prettier and do
734 not swap order when producing a copy. */
735 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
739 /* Remap the block tree rooted at BLOCK to nothing. */
741 remap_blocks_to_null (tree block
, copy_body_data
*id
)
744 insert_decl_map (id
, block
, NULL_TREE
);
745 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
746 remap_blocks_to_null (t
, id
);
750 copy_statement_list (tree
*tp
)
752 tree_stmt_iterator oi
, ni
;
755 new_tree
= alloc_stmt_list ();
756 ni
= tsi_start (new_tree
);
757 oi
= tsi_start (*tp
);
758 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
761 for (; !tsi_end_p (oi
); tsi_next (&oi
))
763 tree stmt
= tsi_stmt (oi
);
764 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
765 /* This copy is not redundant; tsi_link_after will smash this
766 STATEMENT_LIST into the end of the one we're building, and we
767 don't want to do that with the original. */
768 copy_statement_list (&stmt
);
769 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
774 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
776 tree block
= BIND_EXPR_BLOCK (*tp
);
777 /* Copy (and replace) the statement. */
778 copy_tree_r (tp
, walk_subtrees
, NULL
);
781 remap_block (&block
, id
);
782 BIND_EXPR_BLOCK (*tp
) = block
;
785 if (BIND_EXPR_VARS (*tp
))
786 /* This will remap a lot of the same decls again, but this should be
788 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
792 /* Create a new gimple_seq by remapping all the statements in BODY
793 using the inlining information in ID. */
796 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
798 gimple_stmt_iterator si
;
799 gimple_seq new_body
= NULL
;
801 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
803 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
804 gimple_seq_add_seq (&new_body
, new_stmts
);
811 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
812 block using the mapping information in ID. */
815 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
818 tree new_block
, new_vars
;
819 gimple_seq body
, new_body
;
821 /* Copy the statement. Note that we purposely don't use copy_stmt
822 here because we need to remap statements as we copy. */
823 body
= gimple_bind_body (stmt
);
824 new_body
= remap_gimple_seq (body
, id
);
826 new_block
= gimple_bind_block (stmt
);
828 remap_block (&new_block
, id
);
830 /* This will remap a lot of the same decls again, but this should be
832 new_vars
= gimple_bind_vars (stmt
);
834 new_vars
= remap_decls (new_vars
, NULL
, id
);
836 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
841 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
846 if (TREE_CODE (decl
) == SSA_NAME
)
848 decl
= SSA_NAME_VAR (decl
);
853 return (TREE_CODE (decl
) == PARM_DECL
);
856 /* Remap the dependence CLIQUE from the source to the destination function
857 as specified in ID. */
859 static unsigned short
860 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
862 if (clique
== 0 || processing_debug_stmt
)
864 if (!id
->dependence_map
)
865 id
->dependence_map
= new hash_map
<dependence_hash
, unsigned short>;
867 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
869 newc
= ++cfun
->last_clique
;
873 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
874 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
875 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
876 recursing into the children nodes of *TP. */
879 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
881 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
882 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
883 tree fn
= id
->src_fn
;
885 /* For recursive invocations this is no longer the LHS itself. */
886 bool is_lhs
= wi_p
->is_lhs
;
887 wi_p
->is_lhs
= false;
889 if (TREE_CODE (*tp
) == SSA_NAME
)
891 *tp
= remap_ssa_name (*tp
, id
);
894 SSA_NAME_DEF_STMT (*tp
) = wi_p
->stmt
;
897 else if (auto_var_in_fn_p (*tp
, fn
))
899 /* Local variables and labels need to be replaced by equivalent
900 variables. We don't want to copy static variables; there's
901 only one of those, no matter how many times we inline the
902 containing function. Similarly for globals from an outer
906 /* Remap the declaration. */
907 new_decl
= remap_decl (*tp
, id
);
908 gcc_assert (new_decl
);
909 /* Replace this variable with the copy. */
910 STRIP_TYPE_NOPS (new_decl
);
911 /* ??? The C++ frontend uses void * pointer zero to initialize
912 any other type. This confuses the middle-end type verification.
913 As cloned bodies do not go through gimplification again the fixup
914 there doesn't trigger. */
915 if (TREE_CODE (new_decl
) == INTEGER_CST
916 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
917 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
921 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
923 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
925 else if (TREE_CODE (*tp
) == LABEL_DECL
926 && (!DECL_CONTEXT (*tp
)
927 || decl_function_context (*tp
) == id
->src_fn
))
928 /* These may need to be remapped for EH handling. */
929 *tp
= remap_decl (*tp
, id
);
930 else if (TREE_CODE (*tp
) == FIELD_DECL
)
932 /* If the enclosing record type is variably_modified_type_p, the field
933 has already been remapped. Otherwise, it need not be. */
934 tree
*n
= id
->decl_map
->get (*tp
);
939 else if (TYPE_P (*tp
))
940 /* Types may need remapping as well. */
941 *tp
= remap_type (*tp
, id
);
942 else if (CONSTANT_CLASS_P (*tp
))
944 /* If this is a constant, we have to copy the node iff the type
945 will be remapped. copy_tree_r will not copy a constant. */
946 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
948 if (new_type
== TREE_TYPE (*tp
))
951 else if (TREE_CODE (*tp
) == INTEGER_CST
)
952 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
955 *tp
= copy_node (*tp
);
956 TREE_TYPE (*tp
) = new_type
;
961 /* Otherwise, just copy the node. Note that copy_tree_r already
962 knows not to copy VAR_DECLs, etc., so this is safe. */
964 if (TREE_CODE (*tp
) == MEM_REF
)
966 /* We need to re-canonicalize MEM_REFs from inline substitutions
967 that can happen when a pointer argument is an ADDR_EXPR.
968 Recurse here manually to allow that. */
969 tree ptr
= TREE_OPERAND (*tp
, 0);
970 tree type
= remap_type (TREE_TYPE (*tp
), id
);
972 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
973 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
974 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
975 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
976 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
977 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
979 MR_DEPENDENCE_CLIQUE (*tp
)
980 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
981 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
983 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
984 remapped a parameter as the property might be valid only
985 for the parameter itself. */
986 if (TREE_THIS_NOTRAP (old
)
987 && (!is_parm (TREE_OPERAND (old
, 0))
988 || (!id
->transform_parameter
&& is_parm (ptr
))))
989 TREE_THIS_NOTRAP (*tp
) = 1;
990 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
995 /* Here is the "usual case". Copy this tree node, and then
996 tweak some special cases. */
997 copy_tree_r (tp
, walk_subtrees
, NULL
);
999 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1000 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1002 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1004 /* The copied TARGET_EXPR has never been expanded, even if the
1005 original node was expanded already. */
1006 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1007 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1009 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1011 /* Variable substitution need not be simple. In particular,
1012 the MEM_REF substitution above. Make sure that
1013 TREE_CONSTANT and friends are up-to-date. */
1014 int invariant
= is_gimple_min_invariant (*tp
);
1015 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
1016 recompute_tree_invariant_for_addr_expr (*tp
);
1018 /* If this used to be invariant, but is not any longer,
1019 then regimplification is probably needed. */
1020 if (invariant
&& !is_gimple_min_invariant (*tp
))
1021 id
->regimplify
= true;
1027 /* Update the TREE_BLOCK for the cloned expr. */
1030 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1031 tree old_block
= TREE_BLOCK (*tp
);
1035 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1039 TREE_SET_BLOCK (*tp
, new_block
);
1042 /* Keep iterating. */
1047 /* Called from copy_body_id via walk_tree. DATA is really a
1048 `copy_body_data *'. */
1051 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1053 copy_body_data
*id
= (copy_body_data
*) data
;
1054 tree fn
= id
->src_fn
;
1057 /* Begin by recognizing trees that we'll completely rewrite for the
1058 inlining context. Our output for these trees is completely
1059 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1060 into an edge). Further down, we'll handle trees that get
1061 duplicated and/or tweaked. */
1063 /* When requested, RETURN_EXPRs should be transformed to just the
1064 contained MODIFY_EXPR. The branch semantics of the return will
1065 be handled elsewhere by manipulating the CFG rather than a statement. */
1066 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1068 tree assignment
= TREE_OPERAND (*tp
, 0);
1070 /* If we're returning something, just turn that into an
1071 assignment into the equivalent of the original RESULT_DECL.
1072 If the "assignment" is just the result decl, the result
1073 decl has already been set (e.g. a recent "foo (&result_decl,
1074 ...)"); just toss the entire RETURN_EXPR. */
1075 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1077 /* Replace the RETURN_EXPR with (a copy of) the
1078 MODIFY_EXPR hanging underneath. */
1079 *tp
= copy_node (assignment
);
1081 else /* Else the RETURN_EXPR returns no value. */
1084 return (tree
) (void *)1;
1087 else if (TREE_CODE (*tp
) == SSA_NAME
)
1089 *tp
= remap_ssa_name (*tp
, id
);
1094 /* Local variables and labels need to be replaced by equivalent
1095 variables. We don't want to copy static variables; there's only
1096 one of those, no matter how many times we inline the containing
1097 function. Similarly for globals from an outer function. */
1098 else if (auto_var_in_fn_p (*tp
, fn
))
1102 /* Remap the declaration. */
1103 new_decl
= remap_decl (*tp
, id
);
1104 gcc_assert (new_decl
);
1105 /* Replace this variable with the copy. */
1106 STRIP_TYPE_NOPS (new_decl
);
1110 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1111 copy_statement_list (tp
);
1112 else if (TREE_CODE (*tp
) == SAVE_EXPR
1113 || TREE_CODE (*tp
) == TARGET_EXPR
)
1114 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1115 else if (TREE_CODE (*tp
) == LABEL_DECL
1116 && (! DECL_CONTEXT (*tp
)
1117 || decl_function_context (*tp
) == id
->src_fn
))
1118 /* These may need to be remapped for EH handling. */
1119 *tp
= remap_decl (*tp
, id
);
1120 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1121 copy_bind_expr (tp
, walk_subtrees
, id
);
1122 /* Types may need remapping as well. */
1123 else if (TYPE_P (*tp
))
1124 *tp
= remap_type (*tp
, id
);
1126 /* If this is a constant, we have to copy the node iff the type will be
1127 remapped. copy_tree_r will not copy a constant. */
1128 else if (CONSTANT_CLASS_P (*tp
))
1130 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1132 if (new_type
== TREE_TYPE (*tp
))
1135 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1136 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1139 *tp
= copy_node (*tp
);
1140 TREE_TYPE (*tp
) = new_type
;
1144 /* Otherwise, just copy the node. Note that copy_tree_r already
1145 knows not to copy VAR_DECLs, etc., so this is safe. */
1148 /* Here we handle trees that are not completely rewritten.
1149 First we detect some inlining-induced bogosities for
1151 if (TREE_CODE (*tp
) == MODIFY_EXPR
1152 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1153 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1155 /* Some assignments VAR = VAR; don't generate any rtl code
1156 and thus don't count as variable modification. Avoid
1157 keeping bogosities like 0 = 0. */
1158 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1161 n
= id
->decl_map
->get (decl
);
1165 STRIP_TYPE_NOPS (value
);
1166 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1168 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1169 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1173 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1175 /* Get rid of *& from inline substitutions that can happen when a
1176 pointer argument is an ADDR_EXPR. */
1177 tree decl
= TREE_OPERAND (*tp
, 0);
1178 tree
*n
= id
->decl_map
->get (decl
);
1181 /* If we happen to get an ADDR_EXPR in n->value, strip
1182 it manually here as we'll eventually get ADDR_EXPRs
1183 which lie about their types pointed to. In this case
1184 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1185 but we absolutely rely on that. As fold_indirect_ref
1186 does other useful transformations, try that first, though. */
1187 tree type
= TREE_TYPE (*tp
);
1188 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1190 *tp
= gimple_fold_indirect_ref (ptr
);
1193 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1196 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1197 /* ??? We should either assert here or build
1198 a VIEW_CONVERT_EXPR instead of blindly leaking
1199 incompatible types to our IL. */
1201 *tp
= TREE_OPERAND (ptr
, 0);
1205 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1206 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1207 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1208 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1209 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1210 have remapped a parameter as the property might be
1211 valid only for the parameter itself. */
1212 if (TREE_THIS_NOTRAP (old
)
1213 && (!is_parm (TREE_OPERAND (old
, 0))
1214 || (!id
->transform_parameter
&& is_parm (ptr
))))
1215 TREE_THIS_NOTRAP (*tp
) = 1;
1222 else if (TREE_CODE (*tp
) == MEM_REF
)
1224 /* We need to re-canonicalize MEM_REFs from inline substitutions
1225 that can happen when a pointer argument is an ADDR_EXPR.
1226 Recurse here manually to allow that. */
1227 tree ptr
= TREE_OPERAND (*tp
, 0);
1228 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1230 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1231 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1232 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1233 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1234 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1235 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1237 MR_DEPENDENCE_CLIQUE (*tp
)
1238 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1239 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1241 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1242 remapped a parameter as the property might be valid only
1243 for the parameter itself. */
1244 if (TREE_THIS_NOTRAP (old
)
1245 && (!is_parm (TREE_OPERAND (old
, 0))
1246 || (!id
->transform_parameter
&& is_parm (ptr
))))
1247 TREE_THIS_NOTRAP (*tp
) = 1;
1248 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1253 /* Here is the "usual case". Copy this tree node, and then
1254 tweak some special cases. */
1255 copy_tree_r (tp
, walk_subtrees
, NULL
);
1257 /* If EXPR has block defined, map it to newly constructed block.
1258 When inlining we want EXPRs without block appear in the block
1259 of function call if we are not remapping a type. */
1262 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1263 if (TREE_BLOCK (*tp
))
1266 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1270 TREE_SET_BLOCK (*tp
, new_block
);
1273 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1274 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1276 /* The copied TARGET_EXPR has never been expanded, even if the
1277 original node was expanded already. */
1278 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1280 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1281 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1284 /* Variable substitution need not be simple. In particular, the
1285 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1286 and friends are up-to-date. */
1287 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1289 int invariant
= is_gimple_min_invariant (*tp
);
1290 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1292 /* Handle the case where we substituted an INDIRECT_REF
1293 into the operand of the ADDR_EXPR. */
1294 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1296 tree t
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1297 if (TREE_TYPE (t
) != TREE_TYPE (*tp
))
1298 t
= fold_convert (remap_type (TREE_TYPE (*tp
), id
), t
);
1302 recompute_tree_invariant_for_addr_expr (*tp
);
1304 /* If this used to be invariant, but is not any longer,
1305 then regimplification is probably needed. */
1306 if (invariant
&& !is_gimple_min_invariant (*tp
))
1307 id
->regimplify
= true;
1313 /* Keep iterating. */
1317 /* Helper for remap_gimple_stmt. Given an EH region number for the
1318 source function, map that to the duplicate EH region number in
1319 the destination function. */
1322 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1324 eh_region old_r
, new_r
;
1326 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1327 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1329 return new_r
->index
;
1332 /* Similar, but operate on INTEGER_CSTs. */
1335 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1339 old_nr
= tree_to_shwi (old_t_nr
);
1340 new_nr
= remap_eh_region_nr (old_nr
, id
);
1342 return build_int_cst (integer_type_node
, new_nr
);
1345 /* Helper for copy_bb. Remap statement STMT using the inlining
1346 information in ID. Return the new statement copy. */
1349 remap_gimple_stmt (gimple
*stmt
, copy_body_data
*id
)
1351 gimple
*copy
= NULL
;
1352 struct walk_stmt_info wi
;
1353 bool skip_first
= false;
1354 gimple_seq stmts
= NULL
;
1356 if (is_gimple_debug (stmt
)
1357 && !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
1360 /* Begin by recognizing trees that we'll completely rewrite for the
1361 inlining context. Our output for these trees is completely
1362 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1363 into an edge). Further down, we'll handle trees that get
1364 duplicated and/or tweaked. */
1366 /* When requested, GIMPLE_RETURNs should be transformed to just the
1367 contained GIMPLE_ASSIGN. The branch semantics of the return will
1368 be handled elsewhere by manipulating the CFG rather than the
1370 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1372 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1373 tree retbnd
= gimple_return_retbnd (stmt
);
1374 tree bndslot
= id
->retbnd
;
1376 if (retbnd
&& bndslot
)
1378 gimple
*bndcopy
= gimple_build_assign (bndslot
, retbnd
);
1379 memset (&wi
, 0, sizeof (wi
));
1381 walk_gimple_op (bndcopy
, remap_gimple_op_r
, &wi
);
1382 gimple_seq_add_stmt (&stmts
, bndcopy
);
1385 /* If we're returning something, just turn that into an
1386 assignment into the equivalent of the original RESULT_DECL.
1387 If RETVAL is just the result decl, the result decl has
1388 already been set (e.g. a recent "foo (&result_decl, ...)");
1389 just toss the entire GIMPLE_RETURN. */
1391 && (TREE_CODE (retval
) != RESULT_DECL
1392 && (TREE_CODE (retval
) != SSA_NAME
1393 || ! SSA_NAME_VAR (retval
)
1394 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1396 copy
= gimple_build_assign (id
->do_not_unshare
1397 ? id
->retvar
: unshare_expr (id
->retvar
),
1399 /* id->retvar is already substituted. Skip it on later remapping. */
1402 /* We need to copy bounds if return structure with pointers into
1403 instrumented function. */
1404 if (chkp_function_instrumented_p (id
->dst_fn
)
1406 && !BOUNDED_P (id
->retvar
)
1407 && chkp_type_has_pointer (TREE_TYPE (id
->retvar
)))
1408 id
->assign_stmts
.safe_push (copy
);
1414 else if (gimple_has_substatements (stmt
))
1418 /* When cloning bodies from the C++ front end, we will be handed bodies
1419 in High GIMPLE form. Handle here all the High GIMPLE statements that
1420 have embedded statements. */
1421 switch (gimple_code (stmt
))
1424 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1429 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1430 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1431 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1435 case GIMPLE_EH_FILTER
:
1436 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1437 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1441 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1442 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1443 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1446 case GIMPLE_WITH_CLEANUP_EXPR
:
1447 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1448 copy
= gimple_build_wce (s1
);
1451 case GIMPLE_OMP_PARALLEL
:
1453 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1454 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1455 copy
= gimple_build_omp_parallel
1457 gimple_omp_parallel_clauses (omp_par_stmt
),
1458 gimple_omp_parallel_child_fn (omp_par_stmt
),
1459 gimple_omp_parallel_data_arg (omp_par_stmt
));
1463 case GIMPLE_OMP_TASK
:
1464 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1465 copy
= gimple_build_omp_task
1467 gimple_omp_task_clauses (stmt
),
1468 gimple_omp_task_child_fn (stmt
),
1469 gimple_omp_task_data_arg (stmt
),
1470 gimple_omp_task_copy_fn (stmt
),
1471 gimple_omp_task_arg_size (stmt
),
1472 gimple_omp_task_arg_align (stmt
));
1475 case GIMPLE_OMP_FOR
:
1476 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1477 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1478 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1479 gimple_omp_for_clauses (stmt
),
1480 gimple_omp_for_collapse (stmt
), s2
);
1483 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1485 gimple_omp_for_set_index (copy
, i
,
1486 gimple_omp_for_index (stmt
, i
));
1487 gimple_omp_for_set_initial (copy
, i
,
1488 gimple_omp_for_initial (stmt
, i
));
1489 gimple_omp_for_set_final (copy
, i
,
1490 gimple_omp_for_final (stmt
, i
));
1491 gimple_omp_for_set_incr (copy
, i
,
1492 gimple_omp_for_incr (stmt
, i
));
1493 gimple_omp_for_set_cond (copy
, i
,
1494 gimple_omp_for_cond (stmt
, i
));
1499 case GIMPLE_OMP_MASTER
:
1500 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1501 copy
= gimple_build_omp_master (s1
);
1504 case GIMPLE_OMP_TASKGROUP
:
1505 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1506 copy
= gimple_build_omp_taskgroup (s1
);
1509 case GIMPLE_OMP_ORDERED
:
1510 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1511 copy
= gimple_build_omp_ordered
1513 gimple_omp_ordered_clauses (as_a
<gomp_ordered
*> (stmt
)));
1516 case GIMPLE_OMP_SECTION
:
1517 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1518 copy
= gimple_build_omp_section (s1
);
1521 case GIMPLE_OMP_SECTIONS
:
1522 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1523 copy
= gimple_build_omp_sections
1524 (s1
, gimple_omp_sections_clauses (stmt
));
1527 case GIMPLE_OMP_SINGLE
:
1528 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1529 copy
= gimple_build_omp_single
1530 (s1
, gimple_omp_single_clauses (stmt
));
1533 case GIMPLE_OMP_TARGET
:
1534 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1535 copy
= gimple_build_omp_target
1536 (s1
, gimple_omp_target_kind (stmt
),
1537 gimple_omp_target_clauses (stmt
));
1540 case GIMPLE_OMP_TEAMS
:
1541 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1542 copy
= gimple_build_omp_teams
1543 (s1
, gimple_omp_teams_clauses (stmt
));
1546 case GIMPLE_OMP_CRITICAL
:
1547 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1548 copy
= gimple_build_omp_critical (s1
,
1549 gimple_omp_critical_name
1550 (as_a
<gomp_critical
*> (stmt
)),
1551 gimple_omp_critical_clauses
1552 (as_a
<gomp_critical
*> (stmt
)));
1555 case GIMPLE_TRANSACTION
:
1557 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1558 gtransaction
*new_trans_stmt
;
1559 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1561 copy
= new_trans_stmt
= gimple_build_transaction (s1
);
1562 gimple_transaction_set_subcode (new_trans_stmt
,
1563 gimple_transaction_subcode (old_trans_stmt
));
1564 gimple_transaction_set_label_norm (new_trans_stmt
,
1565 gimple_transaction_label_norm (old_trans_stmt
));
1566 gimple_transaction_set_label_uninst (new_trans_stmt
,
1567 gimple_transaction_label_uninst (old_trans_stmt
));
1568 gimple_transaction_set_label_over (new_trans_stmt
,
1569 gimple_transaction_label_over (old_trans_stmt
));
1579 if (gimple_assign_copy_p (stmt
)
1580 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1581 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1583 /* Here we handle statements that are not completely rewritten.
1584 First we detect some inlining-induced bogosities for
1587 /* Some assignments VAR = VAR; don't generate any rtl code
1588 and thus don't count as variable modification. Avoid
1589 keeping bogosities like 0 = 0. */
1590 tree decl
= gimple_assign_lhs (stmt
), value
;
1593 n
= id
->decl_map
->get (decl
);
1597 STRIP_TYPE_NOPS (value
);
1598 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1603 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1604 in a block that we aren't copying during tree_function_versioning,
1605 just drop the clobber stmt. */
1606 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1608 tree lhs
= gimple_assign_lhs (stmt
);
1609 if (TREE_CODE (lhs
) == MEM_REF
1610 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1612 gimple
*def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1613 if (gimple_bb (def_stmt
)
1614 && !bitmap_bit_p (id
->blocks_to_copy
,
1615 gimple_bb (def_stmt
)->index
))
1620 if (gimple_debug_bind_p (stmt
))
1623 = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1624 gimple_debug_bind_get_value (stmt
),
1626 id
->debug_stmts
.safe_push (copy
);
1627 gimple_seq_add_stmt (&stmts
, copy
);
1630 if (gimple_debug_source_bind_p (stmt
))
1632 gdebug
*copy
= gimple_build_debug_source_bind
1633 (gimple_debug_source_bind_get_var (stmt
),
1634 gimple_debug_source_bind_get_value (stmt
),
1636 id
->debug_stmts
.safe_push (copy
);
1637 gimple_seq_add_stmt (&stmts
, copy
);
1641 /* Create a new deep copy of the statement. */
1642 copy
= gimple_copy (stmt
);
1644 /* Clear flags that need revisiting. */
1645 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1647 if (gimple_call_tail_p (call_stmt
))
1648 gimple_call_set_tail (call_stmt
, false);
1649 if (gimple_call_from_thunk_p (call_stmt
))
1650 gimple_call_set_from_thunk (call_stmt
, false);
1651 if (gimple_call_internal_p (call_stmt
))
1652 switch (gimple_call_internal_fn (call_stmt
))
1654 case IFN_GOMP_SIMD_LANE
:
1655 case IFN_GOMP_SIMD_VF
:
1656 case IFN_GOMP_SIMD_LAST_LANE
:
1657 case IFN_GOMP_SIMD_ORDERED_START
:
1658 case IFN_GOMP_SIMD_ORDERED_END
:
1659 DECL_STRUCT_FUNCTION (id
->dst_fn
)->has_simduid_loops
= true;
1666 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1667 RESX and EH_DISPATCH. */
1669 switch (gimple_code (copy
))
1673 tree r
, fndecl
= gimple_call_fndecl (copy
);
1674 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1675 switch (DECL_FUNCTION_CODE (fndecl
))
1677 case BUILT_IN_EH_COPY_VALUES
:
1678 r
= gimple_call_arg (copy
, 1);
1679 r
= remap_eh_region_tree_nr (r
, id
);
1680 gimple_call_set_arg (copy
, 1, r
);
1683 case BUILT_IN_EH_POINTER
:
1684 case BUILT_IN_EH_FILTER
:
1685 r
= gimple_call_arg (copy
, 0);
1686 r
= remap_eh_region_tree_nr (r
, id
);
1687 gimple_call_set_arg (copy
, 0, r
);
1694 /* Reset alias info if we didn't apply measures to
1695 keep it valid over inlining by setting DECL_PT_UID. */
1696 if (!id
->src_cfun
->gimple_df
1697 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1698 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1704 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1705 int r
= gimple_resx_region (resx_stmt
);
1706 r
= remap_eh_region_nr (r
, id
);
1707 gimple_resx_set_region (resx_stmt
, r
);
1711 case GIMPLE_EH_DISPATCH
:
1713 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1714 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1715 r
= remap_eh_region_nr (r
, id
);
1716 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1725 /* If STMT has a block defined, map it to the newly constructed
1727 if (gimple_block (copy
))
1730 n
= id
->decl_map
->get (gimple_block (copy
));
1732 gimple_set_block (copy
, *n
);
1735 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1737 gimple_seq_add_stmt (&stmts
, copy
);
1741 /* Remap all the operands in COPY. */
1742 memset (&wi
, 0, sizeof (wi
));
1745 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1747 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1749 /* Clear the copied virtual operands. We are not remapping them here
1750 but are going to recreate them from scratch. */
1751 if (gimple_has_mem_ops (copy
))
1753 gimple_set_vdef (copy
, NULL_TREE
);
1754 gimple_set_vuse (copy
, NULL_TREE
);
1757 gimple_seq_add_stmt (&stmts
, copy
);
1762 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1766 copy_bb (copy_body_data
*id
, basic_block bb
,
1767 profile_count num
, profile_count den
)
1769 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1770 basic_block copy_basic_block
;
1774 profile_count::adjust_for_ipa_scaling (&num
, &den
);
1776 /* Search for previous copied basic block. */
1779 prev
= prev
->prev_bb
;
1781 /* create_basic_block() will append every new block to
1782 basic_block_info automatically. */
1783 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
1784 copy_basic_block
->count
= bb
->count
.apply_scale (num
, den
);
1786 copy_gsi
= gsi_start_bb (copy_basic_block
);
1788 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1791 gimple
*stmt
= gsi_stmt (gsi
);
1792 gimple
*orig_stmt
= stmt
;
1793 gimple_stmt_iterator stmts_gsi
;
1794 bool stmt_added
= false;
1796 id
->regimplify
= false;
1797 stmts
= remap_gimple_stmt (stmt
, id
);
1799 if (gimple_seq_empty_p (stmts
))
1804 for (stmts_gsi
= gsi_start (stmts
);
1805 !gsi_end_p (stmts_gsi
); )
1807 stmt
= gsi_stmt (stmts_gsi
);
1809 /* Advance iterator now before stmt is moved to seq_gsi. */
1810 gsi_next (&stmts_gsi
);
1812 if (gimple_nop_p (stmt
))
1815 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
1818 /* With return slot optimization we can end up with
1819 non-gimple (foo *)&this->m, fix that here. */
1820 if (is_gimple_assign (stmt
)
1821 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
1822 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1825 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1826 gimple_assign_rhs1 (stmt
),
1828 GSI_CONTINUE_LINKING
);
1829 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1830 id
->regimplify
= false;
1833 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1836 gimple_regimplify_operands (stmt
, &seq_gsi
);
1844 /* If copy_basic_block has been empty at the start of this iteration,
1845 call gsi_start_bb again to get at the newly added statements. */
1846 if (gsi_end_p (copy_gsi
))
1847 copy_gsi
= gsi_start_bb (copy_basic_block
);
1849 gsi_next (©_gsi
);
1851 /* Process the new statement. The call to gimple_regimplify_operands
1852 possibly turned the statement into multiple statements, we
1853 need to process all of them. */
1859 stmt
= gsi_stmt (copy_gsi
);
1860 call_stmt
= dyn_cast
<gcall
*> (stmt
);
1862 && gimple_call_va_arg_pack_p (call_stmt
)
1864 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
1866 /* __builtin_va_arg_pack () should be replaced by
1867 all arguments corresponding to ... in the caller. */
1871 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
1872 size_t n
, i
, nargs_to_copy
;
1873 bool remove_bounds
= false;
1875 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1878 /* Bounds should be removed from arg pack in case
1879 we handle not instrumented call in instrumented
1881 nargs_to_copy
= nargs
;
1882 if (gimple_call_with_bounds_p (id
->call_stmt
)
1883 && !gimple_call_with_bounds_p (stmt
))
1885 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1886 i
< gimple_call_num_args (id
->call_stmt
);
1888 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1890 remove_bounds
= true;
1893 /* Create the new array of arguments. */
1894 n
= nargs_to_copy
+ 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
));
1905 /* Append the rest of arguments removing bounds. */
1906 unsigned cur
= gimple_call_num_args (call_stmt
);
1907 i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1908 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1909 i
< gimple_call_num_args (id
->call_stmt
);
1911 if (!POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1912 argarray
[cur
++] = gimple_call_arg (id
->call_stmt
, i
);
1913 gcc_assert (cur
== n
);
1917 /* Append the arguments passed in '...' */
1918 memcpy (argarray
.address () + gimple_call_num_args (call_stmt
),
1919 gimple_call_arg_ptr (id
->call_stmt
, 0)
1920 + (gimple_call_num_args (id
->call_stmt
) - nargs
),
1921 nargs
* sizeof (tree
));
1924 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
1927 argarray
.release ();
1929 /* Copy all GIMPLE_CALL flags, location and block, except
1930 GF_CALL_VA_ARG_PACK. */
1931 gimple_call_copy_flags (new_call
, call_stmt
);
1932 gimple_call_set_va_arg_pack (new_call
, false);
1933 gimple_set_location (new_call
, gimple_location (stmt
));
1934 gimple_set_block (new_call
, gimple_block (stmt
));
1935 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
1937 gsi_replace (©_gsi
, new_call
, false);
1942 && (decl
= gimple_call_fndecl (stmt
))
1943 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1944 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
1945 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
1947 /* __builtin_va_arg_pack_len () should be replaced by
1948 the number of anonymous arguments. */
1949 size_t nargs
= gimple_call_num_args (id
->call_stmt
), i
;
1953 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1956 /* For instrumented calls we should ignore bounds. */
1957 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1958 i
< gimple_call_num_args (id
->call_stmt
);
1960 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1963 count
= build_int_cst (integer_type_node
, nargs
);
1964 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1965 gsi_replace (©_gsi
, new_stmt
, false);
1970 && gimple_call_internal_p (stmt
)
1971 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
1973 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
1974 gsi_remove (©_gsi
, false);
1978 /* Statements produced by inlining can be unfolded, especially
1979 when we constant propagated some operands. We can't fold
1980 them right now for two reasons:
1981 1) folding require SSA_NAME_DEF_STMTs to be correct
1982 2) we can't change function calls to builtins.
1983 So we just mark statement for later folding. We mark
1984 all new statements, instead just statements that has changed
1985 by some nontrivial substitution so even statements made
1986 foldable indirectly are updated. If this turns out to be
1987 expensive, copy_body can be told to watch for nontrivial
1989 if (id
->statements_to_fold
)
1990 id
->statements_to_fold
->add (stmt
);
1992 /* We're duplicating a CALL_EXPR. Find any corresponding
1993 callgraph edges and update or duplicate them. */
1994 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
1996 struct cgraph_edge
*edge
;
1998 switch (id
->transform_call_graph_edges
)
2000 case CB_CGE_DUPLICATE
:
2001 edge
= id
->src_node
->get_edge (orig_stmt
);
2004 struct cgraph_edge
*old_edge
= edge
;
2005 profile_count old_cnt
= edge
->count
;
2006 edge
= edge
->clone (id
->dst_node
, call_stmt
,
2011 /* Speculative calls consist of two edges - direct and
2012 indirect. Duplicate the whole thing and distribute
2013 frequencies accordingly. */
2014 if (edge
->speculative
)
2016 struct cgraph_edge
*direct
, *indirect
;
2017 struct ipa_ref
*ref
;
2019 gcc_assert (!edge
->indirect_unknown_callee
);
2020 old_edge
->speculative_call_info (direct
, indirect
, ref
);
2022 profile_count indir_cnt
= indirect
->count
;
2023 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2028 profile_probability prob
2029 = indir_cnt
.probability_in (old_cnt
+ indir_cnt
);
2031 = copy_basic_block
->count
.apply_probability (prob
);
2032 edge
->count
= copy_basic_block
->count
- indirect
->count
;
2033 id
->dst_node
->clone_reference (ref
, stmt
);
2036 edge
->count
= copy_basic_block
->count
;
2040 case CB_CGE_MOVE_CLONES
:
2041 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2043 edge
= id
->dst_node
->get_edge (stmt
);
2047 edge
= id
->dst_node
->get_edge (orig_stmt
);
2049 edge
->set_call_stmt (call_stmt
);
2056 /* Constant propagation on argument done during inlining
2057 may create new direct call. Produce an edge for it. */
2059 || (edge
->indirect_inlining_edge
2060 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2061 && id
->dst_node
->definition
2062 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2064 struct cgraph_node
*dest
= cgraph_node::get_create (fn
);
2066 /* We have missing edge in the callgraph. This can happen
2067 when previous inlining turned an indirect call into a
2068 direct call by constant propagating arguments or we are
2069 producing dead clone (for further cloning). In all
2070 other cases we hit a bug (incorrect node sharing is the
2071 most common reason for missing edges). */
2072 gcc_assert (!dest
->definition
2073 || dest
->address_taken
2074 || !id
->src_node
->definition
2075 || !id
->dst_node
->definition
);
2076 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2077 id
->dst_node
->create_edge_including_clones
2078 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2079 CIF_ORIGINALLY_INDIRECT_CALL
);
2081 id
->dst_node
->create_edge (dest
, call_stmt
,
2082 bb
->count
)->inline_failed
2083 = CIF_ORIGINALLY_INDIRECT_CALL
;
2086 fprintf (dump_file
, "Created new direct edge to %s\n",
2091 notice_special_calls (as_a
<gcall
*> (stmt
));
2094 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2095 id
->eh_map
, id
->eh_lp_nr
);
2097 gsi_next (©_gsi
);
2099 while (!gsi_end_p (copy_gsi
));
2101 copy_gsi
= gsi_last_bb (copy_basic_block
);
2104 return copy_basic_block
;
2107 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2108 form is quite easy, since dominator relationship for old basic blocks does
2111 There is however exception where inlining might change dominator relation
2112 across EH edges from basic block within inlined functions destinating
2113 to landing pads in function we inline into.
2115 The function fills in PHI_RESULTs of such PHI nodes if they refer
2116 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2117 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2118 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2119 set, and this means that there will be no overlapping live ranges
2120 for the underlying symbol.
2122 This might change in future if we allow redirecting of EH edges and
2123 we might want to change way build CFG pre-inlining to include
2124 all the possible edges then. */
2126 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2127 bool can_throw
, bool nonlocal_goto
)
2132 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2134 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2140 gcc_assert (e
->flags
& EDGE_EH
);
2143 gcc_assert (!(e
->flags
& EDGE_EH
));
2145 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2151 /* For abnormal goto/call edges the receiver can be the
2152 ENTRY_BLOCK. Do not assert this cannot happen. */
2154 gcc_assert ((e
->flags
& EDGE_EH
)
2155 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2157 re
= find_edge (ret_bb
, e
->dest
);
2158 gcc_checking_assert (re
);
2159 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2160 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2162 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2163 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2169 /* Copy edges from BB into its copy constructed earlier, scale profile
2170 accordingly. Edges will be taken care of later. Assume aux
2171 pointers to point to the copies of each BB. Return true if any
2172 debug stmts are left after a statement that must end the basic block. */
2175 copy_edges_for_bb (basic_block bb
,
2176 basic_block ret_bb
, basic_block abnormal_goto_dest
)
2178 basic_block new_bb
= (basic_block
) bb
->aux
;
2181 gimple_stmt_iterator si
;
2183 bool need_debug_cleanup
= false;
2185 /* Use the indices from the original blocks to create edges for the
2187 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2188 if (!(old_edge
->flags
& EDGE_EH
))
2192 flags
= old_edge
->flags
;
2194 /* Return edges do get a FALLTHRU flag when the get inlined. */
2195 if (old_edge
->dest
->index
== EXIT_BLOCK
2196 && !(old_edge
->flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2197 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2198 flags
|= EDGE_FALLTHRU
;
2199 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2200 new_edge
->probability
= old_edge
->probability
;
2203 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2206 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2209 bool can_throw
, nonlocal_goto
;
2211 copy_stmt
= gsi_stmt (si
);
2212 if (!is_gimple_debug (copy_stmt
))
2213 update_stmt (copy_stmt
);
2215 /* Do this before the possible split_block. */
2218 /* If this tree could throw an exception, there are two
2219 cases where we need to add abnormal edge(s): the
2220 tree wasn't in a region and there is a "current
2221 region" in the caller; or the original tree had
2222 EH edges. In both cases split the block after the tree,
2223 and add abnormal edge(s) as needed; we need both
2224 those from the callee and the caller.
2225 We check whether the copy can throw, because the const
2226 propagation can change an INDIRECT_REF which throws
2227 into a COMPONENT_REF which doesn't. If the copy
2228 can throw, the original could also throw. */
2229 can_throw
= stmt_can_throw_internal (copy_stmt
);
2231 = (stmt_can_make_abnormal_goto (copy_stmt
)
2232 && !computed_goto_p (copy_stmt
));
2234 if (can_throw
|| nonlocal_goto
)
2236 if (!gsi_end_p (si
))
2238 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2241 need_debug_cleanup
= true;
2243 if (!gsi_end_p (si
))
2244 /* Note that bb's predecessor edges aren't necessarily
2245 right at this point; split_block doesn't care. */
2247 edge e
= split_block (new_bb
, copy_stmt
);
2250 new_bb
->aux
= e
->src
->aux
;
2251 si
= gsi_start_bb (new_bb
);
2255 bool update_probs
= false;
2257 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2259 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2260 update_probs
= true;
2264 make_eh_edges (copy_stmt
);
2265 update_probs
= true;
2268 /* EH edges may not match old edges. Copy as much as possible. */
2273 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2275 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2276 if ((old_edge
->flags
& EDGE_EH
)
2277 && (e
= find_edge (copy_stmt_bb
,
2278 (basic_block
) old_edge
->dest
->aux
))
2279 && (e
->flags
& EDGE_EH
))
2280 e
->probability
= old_edge
->probability
;
2282 FOR_EACH_EDGE (e
, ei
, copy_stmt_bb
->succs
)
2283 if ((e
->flags
& EDGE_EH
) && !e
->probability
.initialized_p ())
2284 e
->probability
= profile_probability::never ();
2288 /* If the call we inline cannot make abnormal goto do not add
2289 additional abnormal edges but only retain those already present
2290 in the original function body. */
2291 if (abnormal_goto_dest
== NULL
)
2292 nonlocal_goto
= false;
2295 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2297 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2298 nonlocal_goto
= false;
2299 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2300 in OpenMP regions which aren't allowed to be left abnormally.
2301 So, no need to add abnormal edge in that case. */
2302 else if (is_gimple_call (copy_stmt
)
2303 && gimple_call_internal_p (copy_stmt
)
2304 && (gimple_call_internal_fn (copy_stmt
)
2305 == IFN_ABNORMAL_DISPATCHER
)
2306 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2307 nonlocal_goto
= false;
2309 make_single_succ_edge (copy_stmt_bb
, abnormal_goto_dest
,
2313 if ((can_throw
|| nonlocal_goto
)
2314 && gimple_in_ssa_p (cfun
))
2315 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2316 can_throw
, nonlocal_goto
);
2318 return need_debug_cleanup
;
2321 /* Copy the PHIs. All blocks and edges are copied, some blocks
2322 was possibly split and new outgoing EH edges inserted.
2323 BB points to the block of original function and AUX pointers links
2324 the original and newly copied blocks. */
2327 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2329 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2334 bool inserted
= false;
2336 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2342 res
= PHI_RESULT (phi
);
2344 if (!virtual_operand_p (res
))
2346 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2347 if (EDGE_COUNT (new_bb
->preds
) == 0)
2349 /* Technically we'd want a SSA_DEFAULT_DEF here... */
2350 SSA_NAME_DEF_STMT (new_res
) = gimple_build_nop ();
2354 new_phi
= create_phi_node (new_res
, new_bb
);
2355 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2357 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
,
2364 /* When doing partial cloning, we allow PHIs on the entry
2365 block as long as all the arguments are the same.
2366 Find any input edge to see argument to copy. */
2368 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2369 if (!old_edge
->src
->aux
)
2372 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2374 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2375 gcc_assert (new_arg
);
2376 /* With return slot optimization we can end up with
2377 non-gimple (foo *)&this->m, fix that here. */
2378 if (TREE_CODE (new_arg
) != SSA_NAME
2379 && TREE_CODE (new_arg
) != FUNCTION_DECL
2380 && !is_gimple_val (new_arg
))
2382 gimple_seq stmts
= NULL
;
2383 new_arg
= force_gimple_operand (new_arg
, &stmts
, true,
2385 gsi_insert_seq_on_edge (new_edge
, stmts
);
2388 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2389 if (LOCATION_BLOCK (locus
))
2392 n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
2394 locus
= set_block (locus
, *n
);
2397 locus
= LOCATION_LOCUS (locus
);
2399 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2405 /* Commit the delayed edge insertions. */
2407 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2408 gsi_commit_one_edge_insert (new_edge
, NULL
);
2412 /* Wrapper for remap_decl so it can be used as a callback. */
2415 remap_decl_1 (tree decl
, void *data
)
2417 return remap_decl (decl
, (copy_body_data
*) data
);
2420 /* Build struct function and associated datastructures for the new clone
2421 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2422 the cfun to the function of new_fndecl (and current_function_decl too). */
2425 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, profile_count count
)
2427 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2429 if (!DECL_ARGUMENTS (new_fndecl
))
2430 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2431 if (!DECL_RESULT (new_fndecl
))
2432 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2434 /* Register specific tree functions. */
2435 gimple_register_cfg_hooks ();
2437 /* Get clean struct function. */
2438 push_struct_function (new_fndecl
);
2440 /* We will rebuild these, so just sanity check that they are empty. */
2441 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2442 gcc_assert (cfun
->local_decls
== NULL
);
2443 gcc_assert (cfun
->cfg
== NULL
);
2444 gcc_assert (cfun
->decl
== new_fndecl
);
2446 /* Copy items we preserve during cloning. */
2447 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2448 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2449 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2450 cfun
->curr_properties
= src_cfun
->curr_properties
;
2451 cfun
->last_verified
= src_cfun
->last_verified
;
2452 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2453 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2454 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2455 cfun
->stdarg
= src_cfun
->stdarg
;
2456 cfun
->after_inlining
= src_cfun
->after_inlining
;
2457 cfun
->can_throw_non_call_exceptions
2458 = src_cfun
->can_throw_non_call_exceptions
;
2459 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2460 cfun
->returns_struct
= src_cfun
->returns_struct
;
2461 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2463 init_empty_tree_cfg ();
2465 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2467 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.initialized_p ()
2468 && count
.ipa ().initialized_p ())
2470 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2471 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2472 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2473 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2474 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2475 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2479 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
2480 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2481 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
2482 = EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2485 init_eh_for_function ();
2487 if (src_cfun
->gimple_df
)
2489 init_tree_ssa (cfun
);
2490 cfun
->gimple_df
->in_ssa_p
= src_cfun
->gimple_df
->in_ssa_p
;
2491 if (cfun
->gimple_df
->in_ssa_p
)
2492 init_ssa_operands (cfun
);
2496 /* Helper function for copy_cfg_body. Move debug stmts from the end
2497 of NEW_BB to the beginning of successor basic blocks when needed. If the
2498 successor has multiple predecessors, reset them, otherwise keep
2502 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2506 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2509 || gsi_one_before_end_p (si
)
2510 || !(stmt_can_throw_internal (gsi_stmt (si
))
2511 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2514 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2516 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2517 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2518 while (is_gimple_debug (gsi_stmt (ssi
)))
2520 gimple
*stmt
= gsi_stmt (ssi
);
2525 /* For the last edge move the debug stmts instead of copying
2527 if (ei_one_before_end_p (ei
))
2531 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2532 gimple_debug_bind_reset_value (stmt
);
2533 gsi_remove (&si
, false);
2534 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2538 if (gimple_debug_bind_p (stmt
))
2540 var
= gimple_debug_bind_get_var (stmt
);
2541 if (single_pred_p (e
->dest
))
2543 value
= gimple_debug_bind_get_value (stmt
);
2544 value
= unshare_expr (value
);
2548 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2550 else if (gimple_debug_source_bind_p (stmt
))
2552 var
= gimple_debug_source_bind_get_var (stmt
);
2553 value
= gimple_debug_source_bind_get_value (stmt
);
2554 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2558 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2559 id
->debug_stmts
.safe_push (new_stmt
);
2565 /* Make a copy of the sub-loops of SRC_PARENT and place them
2566 as siblings of DEST_PARENT. */
2569 copy_loops (copy_body_data
*id
,
2570 struct loop
*dest_parent
, struct loop
*src_parent
)
2572 struct loop
*src_loop
= src_parent
->inner
;
2575 if (!id
->blocks_to_copy
2576 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2578 struct loop
*dest_loop
= alloc_loop ();
2580 /* Assign the new loop its header and latch and associate
2581 those with the new loop. */
2582 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2583 dest_loop
->header
->loop_father
= dest_loop
;
2584 if (src_loop
->latch
!= NULL
)
2586 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2587 dest_loop
->latch
->loop_father
= dest_loop
;
2590 /* Copy loop meta-data. */
2591 copy_loop_info (src_loop
, dest_loop
);
2593 /* Finally place it into the loop array and the loop tree. */
2594 place_new_loop (cfun
, dest_loop
);
2595 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2597 dest_loop
->safelen
= src_loop
->safelen
;
2598 dest_loop
->dont_vectorize
= src_loop
->dont_vectorize
;
2599 if (src_loop
->force_vectorize
)
2601 dest_loop
->force_vectorize
= true;
2602 cfun
->has_force_vectorize_loops
= true;
2604 if (src_loop
->simduid
)
2606 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2607 cfun
->has_simduid_loops
= true;
2611 copy_loops (id
, dest_loop
, src_loop
);
2613 src_loop
= src_loop
->next
;
2617 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2620 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2622 gimple_stmt_iterator si
;
2623 gimple
*last
= last_stmt (bb
);
2624 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2626 gimple
*stmt
= gsi_stmt (si
);
2627 if (is_gimple_call (stmt
))
2629 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2632 edge
->redirect_call_stmt_to_callee ();
2633 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
2634 gimple_purge_dead_eh_edges (bb
);
2640 /* Make a copy of the body of FN so that it can be inserted inline in
2641 another function. Walks FN via CFG, returns new fndecl. */
2644 copy_cfg_body (copy_body_data
* id
, profile_count
,
2645 basic_block entry_block_map
, basic_block exit_block_map
,
2646 basic_block new_entry
)
2648 tree callee_fndecl
= id
->src_fn
;
2649 /* Original cfun for the callee, doesn't change. */
2650 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2651 struct function
*cfun_to_copy
;
2653 tree new_fndecl
= NULL
;
2654 bool need_debug_cleanup
= false;
2656 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2657 profile_count num
= entry_block_map
->count
;
2659 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2661 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2663 /* Register specific tree functions. */
2664 gimple_register_cfg_hooks ();
2666 /* If we are inlining just region of the function, make sure to connect
2667 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2668 part of loop, we must compute frequency and probability of
2669 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2670 probabilities of edges incoming from nonduplicated region. */
2675 den
= profile_count::zero ();
2677 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2680 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= den
;
2683 /* Must have a CFG here at this point. */
2684 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2685 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2688 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2689 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2690 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2691 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2693 /* Duplicate any exception-handling regions. */
2695 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2698 /* Use aux pointers to map the original blocks to copy. */
2699 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2700 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2702 basic_block new_bb
= copy_bb (id
, bb
, num
, den
);
2705 new_bb
->loop_father
= entry_block_map
->loop_father
;
2708 last
= last_basic_block_for_fn (cfun
);
2710 /* Now that we've duplicated the blocks, duplicate their edges. */
2711 basic_block abnormal_goto_dest
= NULL
;
2713 && stmt_can_make_abnormal_goto (id
->call_stmt
))
2715 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
2717 bb
= gimple_bb (id
->call_stmt
);
2719 if (gsi_end_p (gsi
))
2720 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2722 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2723 if (!id
->blocks_to_copy
2724 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2725 need_debug_cleanup
|= copy_edges_for_bb (bb
, exit_block_map
,
2726 abnormal_goto_dest
);
2730 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2731 e
->probability
= profile_probability::always ();
2734 /* Duplicate the loop tree, if available and wanted. */
2735 if (loops_for_fn (src_cfun
) != NULL
2736 && current_loops
!= NULL
)
2738 copy_loops (id
, entry_block_map
->loop_father
,
2739 get_loop (src_cfun
, 0));
2740 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2741 loops_state_set (LOOPS_NEED_FIXUP
);
2744 /* If the loop tree in the source function needed fixup, mark the
2745 destination loop tree for fixup, too. */
2746 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2747 loops_state_set (LOOPS_NEED_FIXUP
);
2749 if (gimple_in_ssa_p (cfun
))
2750 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2751 if (!id
->blocks_to_copy
2752 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2753 copy_phis_for_bb (bb
, id
);
2755 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2758 if (need_debug_cleanup
2759 && bb
->index
!= ENTRY_BLOCK
2760 && bb
->index
!= EXIT_BLOCK
)
2761 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2762 /* Update call edge destinations. This can not be done before loop
2763 info is updated, because we may split basic blocks. */
2764 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
2765 && bb
->index
!= ENTRY_BLOCK
2766 && bb
->index
!= EXIT_BLOCK
)
2767 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2768 ((basic_block
)bb
->aux
)->aux
= NULL
;
2772 /* Zero out AUX fields of newly created block during EH edge
2774 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2776 if (need_debug_cleanup
)
2777 maybe_move_debug_stmts_to_successors (id
,
2778 BASIC_BLOCK_FOR_FN (cfun
, last
));
2779 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2780 /* Update call edge destinations. This can not be done before loop
2781 info is updated, because we may split basic blocks. */
2782 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2783 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2785 entry_block_map
->aux
= NULL
;
2786 exit_block_map
->aux
= NULL
;
2793 if (id
->dependence_map
)
2795 delete id
->dependence_map
;
2796 id
->dependence_map
= NULL
;
2802 /* Copy the debug STMT using ID. We deal with these statements in a
2803 special way: if any variable in their VALUE expression wasn't
2804 remapped yet, we won't remap it, because that would get decl uids
2805 out of sync, causing codegen differences between -g and -g0. If
2806 this arises, we drop the VALUE expression altogether. */
2809 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
2812 struct walk_stmt_info wi
;
2814 if (gimple_block (stmt
))
2816 n
= id
->decl_map
->get (gimple_block (stmt
));
2817 gimple_set_block (stmt
, n
? *n
: id
->block
);
2820 /* Remap all the operands in COPY. */
2821 memset (&wi
, 0, sizeof (wi
));
2824 processing_debug_stmt
= 1;
2826 if (gimple_debug_source_bind_p (stmt
))
2827 t
= gimple_debug_source_bind_get_var (stmt
);
2829 t
= gimple_debug_bind_get_var (stmt
);
2831 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2832 && (n
= id
->debug_map
->get (t
)))
2834 gcc_assert (VAR_P (*n
));
2837 else if (VAR_P (t
) && !is_global_var (t
) && !id
->decl_map
->get (t
))
2838 /* T is a non-localized variable. */;
2840 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2842 if (gimple_debug_bind_p (stmt
))
2844 gimple_debug_bind_set_var (stmt
, t
);
2846 if (gimple_debug_bind_has_value_p (stmt
))
2847 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2848 remap_gimple_op_r
, &wi
, NULL
);
2850 /* Punt if any decl couldn't be remapped. */
2851 if (processing_debug_stmt
< 0)
2852 gimple_debug_bind_reset_value (stmt
);
2854 else if (gimple_debug_source_bind_p (stmt
))
2856 gimple_debug_source_bind_set_var (stmt
, t
);
2857 /* When inlining and source bind refers to one of the optimized
2858 away parameters, change the source bind into normal debug bind
2859 referring to the corresponding DEBUG_EXPR_DECL that should have
2860 been bound before the call stmt. */
2861 t
= gimple_debug_source_bind_get_value (stmt
);
2863 && TREE_CODE (t
) == PARM_DECL
2866 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2868 if (debug_args
!= NULL
)
2870 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2871 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2872 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2874 t
= (**debug_args
)[i
+ 1];
2875 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2876 gimple_debug_bind_set_value (stmt
, t
);
2881 if (gimple_debug_source_bind_p (stmt
))
2882 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2883 remap_gimple_op_r
, &wi
, NULL
);
2886 processing_debug_stmt
= 0;
2891 /* Process deferred debug stmts. In order to give values better odds
2892 of being successfully remapped, we delay the processing of debug
2893 stmts until all other stmts that might require remapping are
2897 copy_debug_stmts (copy_body_data
*id
)
2902 if (!id
->debug_stmts
.exists ())
2905 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2906 copy_debug_stmt (stmt
, id
);
2908 id
->debug_stmts
.release ();
2911 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2912 another function. */
2915 copy_tree_body (copy_body_data
*id
)
2917 tree fndecl
= id
->src_fn
;
2918 tree body
= DECL_SAVED_TREE (fndecl
);
2920 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2925 /* Make a copy of the body of FN so that it can be inserted inline in
2926 another function. */
2929 copy_body (copy_body_data
*id
, profile_count count
,
2930 basic_block entry_block_map
, basic_block exit_block_map
,
2931 basic_block new_entry
)
2933 tree fndecl
= id
->src_fn
;
2936 /* If this body has a CFG, walk CFG and copy. */
2937 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2938 body
= copy_cfg_body (id
, count
, entry_block_map
, exit_block_map
,
2940 copy_debug_stmts (id
);
2945 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2946 defined in function FN, or of a data member thereof. */
2949 self_inlining_addr_expr (tree value
, tree fn
)
2953 if (TREE_CODE (value
) != ADDR_EXPR
)
2956 var
= get_base_address (TREE_OPERAND (value
, 0));
2958 return var
&& auto_var_in_fn_p (var
, fn
);
2961 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2962 lexical block and line number information from base_stmt, if given,
2963 or from the last stmt of the block otherwise. */
2966 insert_init_debug_bind (copy_body_data
*id
,
2967 basic_block bb
, tree var
, tree value
,
2971 gimple_stmt_iterator gsi
;
2974 if (!gimple_in_ssa_p (id
->src_cfun
))
2977 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
2980 tracked_var
= target_for_debug_bind (var
);
2986 gsi
= gsi_last_bb (bb
);
2987 if (!base_stmt
&& !gsi_end_p (gsi
))
2988 base_stmt
= gsi_stmt (gsi
);
2991 note
= gimple_build_debug_bind (tracked_var
, unshare_expr (value
), base_stmt
);
2995 if (!gsi_end_p (gsi
))
2996 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2998 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3005 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple
*init_stmt
)
3007 /* If VAR represents a zero-sized variable, it's possible that the
3008 assignment statement may result in no gimple statements. */
3011 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3013 /* We can end up with init statements that store to a non-register
3014 from a rhs with a conversion. Handle that here by forcing the
3015 rhs into a temporary. gimple_regimplify_operands is not
3016 prepared to do this for us. */
3017 if (!is_gimple_debug (init_stmt
)
3018 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3019 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3020 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3022 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3023 gimple_expr_type (init_stmt
),
3024 gimple_assign_rhs1 (init_stmt
));
3025 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3027 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3028 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3030 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3031 gimple_regimplify_operands (init_stmt
, &si
);
3033 if (!is_gimple_debug (init_stmt
))
3035 tree def
= gimple_assign_lhs (init_stmt
);
3036 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3041 /* Initialize parameter P with VALUE. If needed, produce init statement
3042 at the end of BB. When BB is NULL, we return init statement to be
3045 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3046 basic_block bb
, tree
*vars
)
3048 gimple
*init_stmt
= NULL
;
3051 tree def
= (gimple_in_ssa_p (cfun
)
3052 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3055 && value
!= error_mark_node
3056 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3058 /* If we can match up types by promotion/demotion do so. */
3059 if (fold_convertible_p (TREE_TYPE (p
), value
))
3060 rhs
= fold_convert (TREE_TYPE (p
), value
);
3063 /* ??? For valid programs we should not end up here.
3064 Still if we end up with truly mismatched types here, fall back
3065 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3066 GIMPLE to the following passes. */
3067 if (!is_gimple_reg_type (TREE_TYPE (value
))
3068 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
3069 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
3071 rhs
= build_zero_cst (TREE_TYPE (p
));
3075 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3076 here since the type of this decl must be visible to the calling
3078 var
= copy_decl_to_var (p
, id
);
3080 /* Declare this new variable. */
3081 DECL_CHAIN (var
) = *vars
;
3084 /* Make gimplifier happy about this variable. */
3085 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3087 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3088 we would not need to create a new variable here at all, if it
3089 weren't for debug info. Still, we can just use the argument
3091 if (TREE_READONLY (p
)
3092 && !TREE_ADDRESSABLE (p
)
3093 && value
&& !TREE_SIDE_EFFECTS (value
)
3096 /* We may produce non-gimple trees by adding NOPs or introduce
3097 invalid sharing when operand is not really constant.
3098 It is not big deal to prohibit constant propagation here as
3099 we will constant propagate in DOM1 pass anyway. */
3100 if (is_gimple_min_invariant (value
)
3101 && useless_type_conversion_p (TREE_TYPE (p
),
3103 /* We have to be very careful about ADDR_EXPR. Make sure
3104 the base variable isn't a local variable of the inlined
3105 function, e.g., when doing recursive inlining, direct or
3106 mutually-recursive or whatever, which is why we don't
3107 just test whether fn == current_function_decl. */
3108 && ! self_inlining_addr_expr (value
, fn
))
3110 insert_decl_map (id
, p
, value
);
3111 insert_debug_decl_map (id
, p
, var
);
3112 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3116 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3117 that way, when the PARM_DECL is encountered, it will be
3118 automatically replaced by the VAR_DECL. */
3119 insert_decl_map (id
, p
, var
);
3121 /* Even if P was TREE_READONLY, the new VAR should not be.
3122 In the original code, we would have constructed a
3123 temporary, and then the function body would have never
3124 changed the value of P. However, now, we will be
3125 constructing VAR directly. The constructor body may
3126 change its value multiple times as it is being
3127 constructed. Therefore, it must not be TREE_READONLY;
3128 the back-end assumes that TREE_READONLY variable is
3129 assigned to only once. */
3130 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
3131 TREE_READONLY (var
) = 0;
3133 /* If there is no setup required and we are in SSA, take the easy route
3134 replacing all SSA names representing the function parameter by the
3135 SSA name passed to function.
3137 We need to construct map for the variable anyway as it might be used
3138 in different SSA names when parameter is set in function.
3140 Do replacement at -O0 for const arguments replaced by constant.
3141 This is important for builtin_constant_p and other construct requiring
3142 constant argument to be visible in inlined function body. */
3143 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3145 || (TREE_READONLY (p
)
3146 && is_gimple_min_invariant (rhs
)))
3147 && (TREE_CODE (rhs
) == SSA_NAME
3148 || is_gimple_min_invariant (rhs
))
3149 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3151 insert_decl_map (id
, def
, rhs
);
3152 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3155 /* If the value of argument is never used, don't care about initializing
3157 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3159 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3160 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3163 /* Initialize this VAR_DECL from the equivalent argument. Convert
3164 the argument to the proper type in case it was promoted. */
3167 if (rhs
== error_mark_node
)
3169 insert_decl_map (id
, p
, var
);
3170 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3173 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3175 /* If we are in SSA form properly remap the default definition
3176 or assign to a dummy SSA name if the parameter is unused and
3177 we are not optimizing. */
3178 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3182 def
= remap_ssa_name (def
, id
);
3183 init_stmt
= gimple_build_assign (def
, rhs
);
3184 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3185 set_ssa_default_def (cfun
, var
, NULL
);
3189 def
= make_ssa_name (var
);
3190 init_stmt
= gimple_build_assign (def
, rhs
);
3194 init_stmt
= gimple_build_assign (var
, rhs
);
3196 if (bb
&& init_stmt
)
3197 insert_init_stmt (id
, bb
, init_stmt
);
3202 /* Generate code to initialize the parameters of the function at the
3203 top of the stack in ID from the GIMPLE_CALL STMT. */
3206 initialize_inlined_parameters (copy_body_data
*id
, gimple
*stmt
,
3207 tree fn
, basic_block bb
)
3212 tree vars
= NULL_TREE
;
3213 tree static_chain
= gimple_call_chain (stmt
);
3215 /* Figure out what the parameters are. */
3216 parms
= DECL_ARGUMENTS (fn
);
3218 /* Loop through the parameter declarations, replacing each with an
3219 equivalent VAR_DECL, appropriately initialized. */
3220 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3223 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3224 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3226 /* After remapping parameters remap their types. This has to be done
3227 in a second loop over all parameters to appropriately remap
3228 variable sized arrays when the size is specified in a
3229 parameter following the array. */
3230 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3232 tree
*varp
= id
->decl_map
->get (p
);
3233 if (varp
&& VAR_P (*varp
))
3235 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3236 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3238 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3239 /* Also remap the default definition if it was remapped
3240 to the default definition of the parameter replacement
3241 by the parameter setup. */
3244 tree
*defp
= id
->decl_map
->get (def
);
3246 && TREE_CODE (*defp
) == SSA_NAME
3247 && SSA_NAME_VAR (*defp
) == var
)
3248 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3253 /* Initialize the static chain. */
3254 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3255 gcc_assert (fn
!= current_function_decl
);
3258 /* No static chain? Seems like a bug in tree-nested.c. */
3259 gcc_assert (static_chain
);
3261 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3264 declare_inline_vars (id
->block
, vars
);
3268 /* Declare a return variable to replace the RESULT_DECL for the
3269 function we are calling. An appropriate DECL_STMT is returned.
3270 The USE_STMT is filled to contain a use of the declaration to
3271 indicate the return value of the function.
3273 RETURN_SLOT, if non-null is place where to store the result. It
3274 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3275 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3277 RETURN_BOUNDS holds a destination for returned bounds.
3279 The return value is a (possibly null) value that holds the result
3280 as seen by the caller. */
3283 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3284 tree return_bounds
, basic_block entry_bb
)
3286 tree callee
= id
->src_fn
;
3287 tree result
= DECL_RESULT (callee
);
3288 tree callee_type
= TREE_TYPE (result
);
3292 /* Handle type-mismatches in the function declaration return type
3293 vs. the call expression. */
3295 caller_type
= TREE_TYPE (modify_dest
);
3297 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3299 /* We don't need to do anything for functions that don't return anything. */
3300 if (VOID_TYPE_P (callee_type
))
3303 /* If there was a return slot, then the return value is the
3304 dereferenced address of that object. */
3307 /* The front end shouldn't have used both return_slot and
3308 a modify expression. */
3309 gcc_assert (!modify_dest
);
3310 if (DECL_BY_REFERENCE (result
))
3312 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3313 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3315 /* We are going to construct *&return_slot and we can't do that
3316 for variables believed to be not addressable.
3318 FIXME: This check possibly can match, because values returned
3319 via return slot optimization are not believed to have address
3320 taken by alias analysis. */
3321 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3322 var
= return_slot_addr
;
3327 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3328 if (TREE_ADDRESSABLE (result
))
3329 mark_addressable (var
);
3331 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3332 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3333 && !DECL_GIMPLE_REG_P (result
)
3335 DECL_GIMPLE_REG_P (var
) = 0;
3340 /* All types requiring non-trivial constructors should have been handled. */
3341 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3343 /* Attempt to avoid creating a new temporary variable. */
3345 && TREE_CODE (modify_dest
) != SSA_NAME
)
3347 bool use_it
= false;
3349 /* We can't use MODIFY_DEST if there's type promotion involved. */
3350 if (!useless_type_conversion_p (callee_type
, caller_type
))
3353 /* ??? If we're assigning to a variable sized type, then we must
3354 reuse the destination variable, because we've no good way to
3355 create variable sized temporaries at this point. */
3356 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3359 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3360 reuse it as the result of the call directly. Don't do this if
3361 it would promote MODIFY_DEST to addressable. */
3362 else if (TREE_ADDRESSABLE (result
))
3366 tree base_m
= get_base_address (modify_dest
);
3368 /* If the base isn't a decl, then it's a pointer, and we don't
3369 know where that's going to go. */
3370 if (!DECL_P (base_m
))
3372 else if (is_global_var (base_m
))
3374 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3375 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3376 && !DECL_GIMPLE_REG_P (result
)
3377 && DECL_GIMPLE_REG_P (base_m
))
3379 else if (!TREE_ADDRESSABLE (base_m
))
3391 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3393 var
= copy_result_decl_to_var (result
, id
);
3394 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3396 /* Do not have the rest of GCC warn about this variable as it should
3397 not be visible to the user. */
3398 TREE_NO_WARNING (var
) = 1;
3400 declare_inline_vars (id
->block
, var
);
3402 /* Build the use expr. If the return type of the function was
3403 promoted, convert it back to the expected type. */
3405 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3407 /* If we can match up types by promotion/demotion do so. */
3408 if (fold_convertible_p (caller_type
, var
))
3409 use
= fold_convert (caller_type
, var
);
3412 /* ??? For valid programs we should not end up here.
3413 Still if we end up with truly mismatched types here, fall back
3414 to using a MEM_REF to not leak invalid GIMPLE to the following
3416 /* Prevent var from being written into SSA form. */
3417 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3418 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3419 DECL_GIMPLE_REG_P (var
) = false;
3420 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3421 TREE_ADDRESSABLE (var
) = true;
3422 use
= fold_build2 (MEM_REF
, caller_type
,
3423 build_fold_addr_expr (var
),
3424 build_int_cst (ptr_type_node
, 0));
3428 STRIP_USELESS_TYPE_CONVERSION (use
);
3430 if (DECL_BY_REFERENCE (result
))
3432 TREE_ADDRESSABLE (var
) = 1;
3433 var
= build_fold_addr_expr (var
);
3437 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3438 way, when the RESULT_DECL is encountered, it will be
3439 automatically replaced by the VAR_DECL.
3441 When returning by reference, ensure that RESULT_DECL remaps to
3443 if (DECL_BY_REFERENCE (result
)
3444 && !is_gimple_val (var
))
3446 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3447 insert_decl_map (id
, result
, temp
);
3448 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3449 it's default_def SSA_NAME. */
3450 if (gimple_in_ssa_p (id
->src_cfun
)
3451 && is_gimple_reg (result
))
3453 temp
= make_ssa_name (temp
);
3454 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3456 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3459 insert_decl_map (id
, result
, var
);
3461 /* Remember this so we can ignore it in remap_decls. */
3464 /* If returned bounds are used, then make var for them. */
3467 tree bndtemp
= create_tmp_var (pointer_bounds_type_node
, "retbnd");
3468 DECL_SEEN_IN_BIND_EXPR_P (bndtemp
) = 1;
3469 TREE_NO_WARNING (bndtemp
) = 1;
3470 declare_inline_vars (id
->block
, bndtemp
);
3472 id
->retbnd
= bndtemp
;
3473 insert_init_stmt (id
, entry_bb
,
3474 gimple_build_assign (bndtemp
, chkp_get_zero_bounds_var ()));
3480 /* Determine if the function can be copied. If so return NULL. If
3481 not return a string describng the reason for failure. */
3484 copy_forbidden (struct function
*fun
)
3486 const char *reason
= fun
->cannot_be_copied_reason
;
3488 /* Only examine the function once. */
3489 if (fun
->cannot_be_copied_set
)
3492 /* We cannot copy a function that receives a non-local goto
3493 because we cannot remap the destination label used in the
3494 function that is performing the non-local goto. */
3495 /* ??? Actually, this should be possible, if we work at it.
3496 No doubt there's just a handful of places that simply
3497 assume it doesn't happen and don't substitute properly. */
3498 if (fun
->has_nonlocal_label
)
3500 reason
= G_("function %q+F can never be copied "
3501 "because it receives a non-local goto");
3505 if (fun
->has_forced_label_in_static
)
3507 reason
= G_("function %q+F can never be copied because it saves "
3508 "address of local label in a static variable");
3513 fun
->cannot_be_copied_reason
= reason
;
3514 fun
->cannot_be_copied_set
= true;
3519 static const char *inline_forbidden_reason
;
3521 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3522 iff a function can not be inlined. Also sets the reason why. */
3525 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3526 struct walk_stmt_info
*wip
)
3528 tree fn
= (tree
) wip
->info
;
3530 gimple
*stmt
= gsi_stmt (*gsi
);
3532 switch (gimple_code (stmt
))
3535 /* Refuse to inline alloca call unless user explicitly forced so as
3536 this may change program's memory overhead drastically when the
3537 function using alloca is called in loop. In GCC present in
3538 SPEC2000 inlining into schedule_block cause it to require 2GB of
3539 RAM instead of 256MB. Don't do so for alloca calls emitted for
3540 VLA objects as those can't cause unbounded growth (they're always
3541 wrapped inside stack_save/stack_restore regions. */
3542 if (gimple_maybe_alloca_call_p (stmt
)
3543 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3544 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3546 inline_forbidden_reason
3547 = G_("function %q+F can never be inlined because it uses "
3548 "alloca (override using the always_inline attribute)");
3549 *handled_ops_p
= true;
3553 t
= gimple_call_fndecl (stmt
);
3557 /* We cannot inline functions that call setjmp. */
3558 if (setjmp_call_p (t
))
3560 inline_forbidden_reason
3561 = G_("function %q+F can never be inlined because it uses setjmp");
3562 *handled_ops_p
= true;
3566 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3567 switch (DECL_FUNCTION_CODE (t
))
3569 /* We cannot inline functions that take a variable number of
3571 case BUILT_IN_VA_START
:
3572 case BUILT_IN_NEXT_ARG
:
3573 case BUILT_IN_VA_END
:
3574 inline_forbidden_reason
3575 = G_("function %q+F can never be inlined because it "
3576 "uses variable argument lists");
3577 *handled_ops_p
= true;
3580 case BUILT_IN_LONGJMP
:
3581 /* We can't inline functions that call __builtin_longjmp at
3582 all. The non-local goto machinery really requires the
3583 destination be in a different function. If we allow the
3584 function calling __builtin_longjmp to be inlined into the
3585 function calling __builtin_setjmp, Things will Go Awry. */
3586 inline_forbidden_reason
3587 = G_("function %q+F can never be inlined because "
3588 "it uses setjmp-longjmp exception handling");
3589 *handled_ops_p
= true;
3592 case BUILT_IN_NONLOCAL_GOTO
:
3594 inline_forbidden_reason
3595 = G_("function %q+F can never be inlined because "
3596 "it uses non-local goto");
3597 *handled_ops_p
= true;
3600 case BUILT_IN_RETURN
:
3601 case BUILT_IN_APPLY_ARGS
:
3602 /* If a __builtin_apply_args caller would be inlined,
3603 it would be saving arguments of the function it has
3604 been inlined into. Similarly __builtin_return would
3605 return from the function the inline has been inlined into. */
3606 inline_forbidden_reason
3607 = G_("function %q+F can never be inlined because "
3608 "it uses __builtin_return or __builtin_apply_args");
3609 *handled_ops_p
= true;
3618 t
= gimple_goto_dest (stmt
);
3620 /* We will not inline a function which uses computed goto. The
3621 addresses of its local labels, which may be tucked into
3622 global storage, are of course not constant across
3623 instantiations, which causes unexpected behavior. */
3624 if (TREE_CODE (t
) != LABEL_DECL
)
3626 inline_forbidden_reason
3627 = G_("function %q+F can never be inlined "
3628 "because it contains a computed goto");
3629 *handled_ops_p
= true;
3638 *handled_ops_p
= false;
3642 /* Return true if FNDECL is a function that cannot be inlined into
3646 inline_forbidden_p (tree fndecl
)
3648 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3649 struct walk_stmt_info wi
;
3651 bool forbidden_p
= false;
3653 /* First check for shared reasons not to copy the code. */
3654 inline_forbidden_reason
= copy_forbidden (fun
);
3655 if (inline_forbidden_reason
!= NULL
)
3658 /* Next, walk the statements of the function looking for
3659 constraucts we can't handle, or are non-optimal for inlining. */
3660 hash_set
<tree
> visited_nodes
;
3661 memset (&wi
, 0, sizeof (wi
));
3662 wi
.info
= (void *) fndecl
;
3663 wi
.pset
= &visited_nodes
;
3665 FOR_EACH_BB_FN (bb
, fun
)
3668 gimple_seq seq
= bb_seq (bb
);
3669 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3670 forbidden_p
= (ret
!= NULL
);
3678 /* Return false if the function FNDECL cannot be inlined on account of its
3679 attributes, true otherwise. */
3681 function_attribute_inlinable_p (const_tree fndecl
)
3683 if (targetm
.attribute_table
)
3687 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3689 const_tree name
= TREE_PURPOSE (a
);
3692 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3693 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3694 return targetm
.function_attribute_inlinable_p (fndecl
);
3701 /* Returns nonzero if FN is a function that does not have any
3702 fundamental inline blocking properties. */
3705 tree_inlinable_function_p (tree fn
)
3707 bool inlinable
= true;
3711 /* If we've already decided this function shouldn't be inlined,
3712 there's no need to check again. */
3713 if (DECL_UNINLINABLE (fn
))
3716 /* We only warn for functions declared `inline' by the user. */
3717 do_warning
= (warn_inline
3718 && DECL_DECLARED_INLINE_P (fn
)
3719 && !DECL_NO_INLINE_WARNING_P (fn
)
3720 && !DECL_IN_SYSTEM_HEADER (fn
));
3722 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3725 && always_inline
== NULL
)
3728 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3729 "is suppressed using -fno-inline", fn
);
3733 else if (!function_attribute_inlinable_p (fn
))
3736 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3737 "uses attributes conflicting with inlining", fn
);
3741 else if (inline_forbidden_p (fn
))
3743 /* See if we should warn about uninlinable functions. Previously,
3744 some of these warnings would be issued while trying to expand
3745 the function inline, but that would cause multiple warnings
3746 about functions that would for example call alloca. But since
3747 this a property of the function, just one warning is enough.
3748 As a bonus we can now give more details about the reason why a
3749 function is not inlinable. */
3751 error (inline_forbidden_reason
, fn
);
3752 else if (do_warning
)
3753 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3758 /* Squirrel away the result so that we don't have to check again. */
3759 DECL_UNINLINABLE (fn
) = !inlinable
;
3764 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
3765 word size and take possible memcpy call into account and return
3766 cost based on whether optimizing for size or speed according to SPEED_P. */
3769 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
3773 gcc_assert (!VOID_TYPE_P (type
));
3775 if (TREE_CODE (type
) == VECTOR_TYPE
)
3777 scalar_mode inner
= SCALAR_TYPE_MODE (TREE_TYPE (type
));
3779 = targetm
.vectorize
.preferred_simd_mode (inner
);
3780 int simd_mode_size
= GET_MODE_SIZE (simd
);
3781 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3785 size
= int_size_in_bytes (type
);
3787 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
3788 /* Cost of a memcpy call, 3 arguments and the call. */
3791 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3794 /* Returns cost of operation CODE, according to WEIGHTS */
3797 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3798 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3802 /* These are "free" conversions, or their presumed cost
3803 is folded into other operations. */
3808 case VIEW_CONVERT_EXPR
:
3811 /* Assign cost of 1 to usual operations.
3812 ??? We may consider mapping RTL costs to this. */
3818 case POINTER_PLUS_EXPR
:
3821 case MULT_HIGHPART_EXPR
:
3824 case ADDR_SPACE_CONVERT_EXPR
:
3825 case FIXED_CONVERT_EXPR
:
3826 case FIX_TRUNC_EXPR
:
3844 case TRUTH_ANDIF_EXPR
:
3845 case TRUTH_ORIF_EXPR
:
3846 case TRUTH_AND_EXPR
:
3848 case TRUTH_XOR_EXPR
:
3849 case TRUTH_NOT_EXPR
:
3858 case UNORDERED_EXPR
:
3869 case PREDECREMENT_EXPR
:
3870 case PREINCREMENT_EXPR
:
3871 case POSTDECREMENT_EXPR
:
3872 case POSTINCREMENT_EXPR
:
3874 case REALIGN_LOAD_EXPR
:
3876 case REDUC_MAX_EXPR
:
3877 case REDUC_MIN_EXPR
:
3878 case REDUC_PLUS_EXPR
:
3879 case WIDEN_SUM_EXPR
:
3880 case WIDEN_MULT_EXPR
:
3883 case WIDEN_MULT_PLUS_EXPR
:
3884 case WIDEN_MULT_MINUS_EXPR
:
3885 case WIDEN_LSHIFT_EXPR
:
3887 case VEC_WIDEN_MULT_HI_EXPR
:
3888 case VEC_WIDEN_MULT_LO_EXPR
:
3889 case VEC_WIDEN_MULT_EVEN_EXPR
:
3890 case VEC_WIDEN_MULT_ODD_EXPR
:
3891 case VEC_UNPACK_HI_EXPR
:
3892 case VEC_UNPACK_LO_EXPR
:
3893 case VEC_UNPACK_FLOAT_HI_EXPR
:
3894 case VEC_UNPACK_FLOAT_LO_EXPR
:
3895 case VEC_PACK_TRUNC_EXPR
:
3896 case VEC_PACK_SAT_EXPR
:
3897 case VEC_PACK_FIX_TRUNC_EXPR
:
3898 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3899 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3903 /* Few special cases of expensive operations. This is useful
3904 to avoid inlining on functions having too many of these. */
3905 case TRUNC_DIV_EXPR
:
3907 case FLOOR_DIV_EXPR
:
3908 case ROUND_DIV_EXPR
:
3909 case EXACT_DIV_EXPR
:
3910 case TRUNC_MOD_EXPR
:
3912 case FLOOR_MOD_EXPR
:
3913 case ROUND_MOD_EXPR
:
3915 if (TREE_CODE (op2
) != INTEGER_CST
)
3916 return weights
->div_mod_cost
;
3919 /* Bit-field insertion needs several shift and mask operations. */
3920 case BIT_INSERT_EXPR
:
3924 /* We expect a copy assignment with no operator. */
3925 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3931 /* Estimate number of instructions that will be created by expanding
3932 the statements in the statement sequence STMTS.
3933 WEIGHTS contains weights attributed to various constructs. */
3936 estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3939 gimple_stmt_iterator gsi
;
3942 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3943 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3949 /* Estimate number of instructions that will be created by expanding STMT.
3950 WEIGHTS contains weights attributed to various constructs. */
3953 estimate_num_insns (gimple
*stmt
, eni_weights
*weights
)
3956 enum gimple_code code
= gimple_code (stmt
);
3963 /* Try to estimate the cost of assignments. We have three cases to
3965 1) Simple assignments to registers;
3966 2) Stores to things that must live in memory. This includes
3967 "normal" stores to scalars, but also assignments of large
3968 structures, or constructors of big arrays;
3970 Let us look at the first two cases, assuming we have "a = b + C":
3971 <GIMPLE_ASSIGN <var_decl "a">
3972 <plus_expr <var_decl "b"> <constant C>>
3973 If "a" is a GIMPLE register, the assignment to it is free on almost
3974 any target, because "a" usually ends up in a real register. Hence
3975 the only cost of this expression comes from the PLUS_EXPR, and we
3976 can ignore the GIMPLE_ASSIGN.
3977 If "a" is not a GIMPLE register, the assignment to "a" will most
3978 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3979 of moving something into "a", which we compute using the function
3980 estimate_move_cost. */
3981 if (gimple_clobber_p (stmt
))
3982 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3984 lhs
= gimple_assign_lhs (stmt
);
3985 rhs
= gimple_assign_rhs1 (stmt
);
3989 /* Account for the cost of moving to / from memory. */
3990 if (gimple_store_p (stmt
))
3991 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
3992 if (gimple_assign_load_p (stmt
))
3993 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
3995 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3996 gimple_assign_rhs1 (stmt
),
3997 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3998 == GIMPLE_BINARY_RHS
3999 ? gimple_assign_rhs2 (stmt
) : NULL
);
4003 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4004 gimple_op (stmt
, 0),
4005 gimple_op (stmt
, 1));
4010 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4011 /* Take into account cost of the switch + guess 2 conditional jumps for
4014 TODO: once the switch expansion logic is sufficiently separated, we can
4015 do better job on estimating cost of the switch. */
4016 if (weights
->time_based
)
4017 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4019 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4027 if (gimple_call_internal_p (stmt
))
4029 else if ((decl
= gimple_call_fndecl (stmt
))
4030 && DECL_BUILT_IN (decl
))
4032 /* Do not special case builtins where we see the body.
4033 This just confuse inliner. */
4034 struct cgraph_node
*node
;
4035 if (!(node
= cgraph_node::get (decl
))
4036 || node
->definition
)
4038 /* For buitins that are likely expanded to nothing or
4039 inlined do not account operand costs. */
4040 else if (is_simple_builtin (decl
))
4042 else if (is_inexpensive_builtin (decl
))
4043 return weights
->target_builtin_call_cost
;
4044 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
4046 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4047 specialize the cheap expansion we do here.
4048 ??? This asks for a more general solution. */
4049 switch (DECL_FUNCTION_CODE (decl
))
4054 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4056 (&TREE_REAL_CST (gimple_call_arg (stmt
, 1)),
4058 return estimate_operator_cost
4059 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4060 gimple_call_arg (stmt
, 0));
4069 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4070 if (gimple_call_lhs (stmt
))
4071 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4072 weights
->time_based
);
4073 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4075 tree arg
= gimple_call_arg (stmt
, i
);
4076 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4077 weights
->time_based
);
4083 return weights
->return_cost
;
4089 case GIMPLE_PREDICT
:
4095 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4096 /* 1000 means infinity. This avoids overflows later
4097 with very long asm statements. */
4104 /* This is either going to be an external function call with one
4105 argument, or two register copy statements plus a goto. */
4108 case GIMPLE_EH_DISPATCH
:
4109 /* ??? This is going to turn into a switch statement. Ideally
4110 we'd have a look at the eh region and estimate the number of
4115 return estimate_num_insns_seq (
4116 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4119 case GIMPLE_EH_FILTER
:
4120 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4123 return estimate_num_insns_seq (gimple_catch_handler (
4124 as_a
<gcatch
*> (stmt
)),
4128 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4129 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4131 /* OMP directives are generally very expensive. */
4133 case GIMPLE_OMP_RETURN
:
4134 case GIMPLE_OMP_SECTIONS_SWITCH
:
4135 case GIMPLE_OMP_ATOMIC_STORE
:
4136 case GIMPLE_OMP_CONTINUE
:
4137 /* ...except these, which are cheap. */
4140 case GIMPLE_OMP_ATOMIC_LOAD
:
4141 return weights
->omp_cost
;
4143 case GIMPLE_OMP_FOR
:
4144 return (weights
->omp_cost
4145 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4146 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4148 case GIMPLE_OMP_PARALLEL
:
4149 case GIMPLE_OMP_TASK
:
4150 case GIMPLE_OMP_CRITICAL
:
4151 case GIMPLE_OMP_MASTER
:
4152 case GIMPLE_OMP_TASKGROUP
:
4153 case GIMPLE_OMP_ORDERED
:
4154 case GIMPLE_OMP_SECTION
:
4155 case GIMPLE_OMP_SECTIONS
:
4156 case GIMPLE_OMP_SINGLE
:
4157 case GIMPLE_OMP_TARGET
:
4158 case GIMPLE_OMP_TEAMS
:
4159 return (weights
->omp_cost
4160 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4162 case GIMPLE_TRANSACTION
:
4163 return (weights
->tm_cost
4164 + estimate_num_insns_seq (gimple_transaction_body (
4165 as_a
<gtransaction
*> (stmt
)),
4175 /* Estimate number of instructions that will be created by expanding
4176 function FNDECL. WEIGHTS contains weights attributed to various
4180 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4182 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4183 gimple_stmt_iterator bsi
;
4187 gcc_assert (my_function
&& my_function
->cfg
);
4188 FOR_EACH_BB_FN (bb
, my_function
)
4190 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4191 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4198 /* Initializes weights used by estimate_num_insns. */
4201 init_inline_once (void)
4203 eni_size_weights
.call_cost
= 1;
4204 eni_size_weights
.indirect_call_cost
= 3;
4205 eni_size_weights
.target_builtin_call_cost
= 1;
4206 eni_size_weights
.div_mod_cost
= 1;
4207 eni_size_weights
.omp_cost
= 40;
4208 eni_size_weights
.tm_cost
= 10;
4209 eni_size_weights
.time_based
= false;
4210 eni_size_weights
.return_cost
= 1;
4212 /* Estimating time for call is difficult, since we have no idea what the
4213 called function does. In the current uses of eni_time_weights,
4214 underestimating the cost does less harm than overestimating it, so
4215 we choose a rather small value here. */
4216 eni_time_weights
.call_cost
= 10;
4217 eni_time_weights
.indirect_call_cost
= 15;
4218 eni_time_weights
.target_builtin_call_cost
= 1;
4219 eni_time_weights
.div_mod_cost
= 10;
4220 eni_time_weights
.omp_cost
= 40;
4221 eni_time_weights
.tm_cost
= 40;
4222 eni_time_weights
.time_based
= true;
4223 eni_time_weights
.return_cost
= 2;
4227 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4230 prepend_lexical_block (tree current_block
, tree new_block
)
4232 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4233 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4234 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4237 /* Add local variables from CALLEE to CALLER. */
4240 add_local_variables (struct function
*callee
, struct function
*caller
,
4246 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4247 if (!can_be_nonlocal (var
, id
))
4249 tree new_var
= remap_decl (var
, id
);
4251 /* Remap debug-expressions. */
4253 && DECL_HAS_DEBUG_EXPR_P (var
)
4256 tree tem
= DECL_DEBUG_EXPR (var
);
4257 bool old_regimplify
= id
->regimplify
;
4258 id
->remapping_type_depth
++;
4259 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4260 id
->remapping_type_depth
--;
4261 id
->regimplify
= old_regimplify
;
4262 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4263 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4265 add_local_decl (caller
, new_var
);
4269 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4270 have brought in or introduced any debug stmts for SRCVAR. */
4273 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4275 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4280 if (!VAR_P (*remappedvarp
))
4283 if (*remappedvarp
== id
->retvar
|| *remappedvarp
== id
->retbnd
)
4286 tree tvar
= target_for_debug_bind (*remappedvarp
);
4290 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4292 gimple_seq_add_stmt (bindings
, stmt
);
4295 /* For each inlined variable for which we may have debug bind stmts,
4296 add before GSI a final debug stmt resetting it, marking the end of
4297 its life, so that var-tracking knows it doesn't have to compute
4298 further locations for it. */
4301 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4305 gimple_seq bindings
= NULL
;
4307 if (!gimple_in_ssa_p (id
->src_cfun
))
4310 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4313 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4314 var
; var
= DECL_CHAIN (var
))
4315 reset_debug_binding (id
, var
, &bindings
);
4317 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4318 reset_debug_binding (id
, var
, &bindings
);
4320 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4323 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4326 expand_call_inline (basic_block bb
, gimple
*stmt
, copy_body_data
*id
)
4330 hash_map
<tree
, tree
> *dst
;
4331 hash_map
<tree
, tree
> *st
= NULL
;
4334 tree return_bounds
= NULL
;
4335 struct cgraph_edge
*cg_edge
;
4336 cgraph_inline_failed_t reason
;
4337 basic_block return_block
;
4339 gimple_stmt_iterator gsi
, stmt_gsi
;
4340 bool successfully_inlined
= false;
4341 bool purge_dead_abnormal_edges
;
4344 unsigned int prop_mask
, src_properties
;
4345 struct function
*dst_cfun
;
4348 gimple
*simtenter_stmt
= NULL
;
4349 vec
<tree
> *simtvars_save
;
4351 /* The gimplifier uses input_location in too many places, such as
4352 internal_get_tmp_var (). */
4353 location_t saved_location
= input_location
;
4354 input_location
= gimple_location (stmt
);
4356 /* From here on, we're only interested in CALL_EXPRs. */
4357 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4361 cg_edge
= id
->dst_node
->get_edge (stmt
);
4362 gcc_checking_assert (cg_edge
);
4363 /* First, see if we can figure out what function is being called.
4364 If we cannot, then there is no hope of inlining the function. */
4365 if (cg_edge
->indirect_unknown_callee
)
4367 fn
= cg_edge
->callee
->decl
;
4368 gcc_checking_assert (fn
);
4370 /* If FN is a declaration of a function in a nested scope that was
4371 globally declared inline, we don't set its DECL_INITIAL.
4372 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4373 C++ front-end uses it for cdtors to refer to their internal
4374 declarations, that are not real functions. Fortunately those
4375 don't have trees to be saved, so we can tell by checking their
4377 if (!DECL_INITIAL (fn
)
4378 && DECL_ABSTRACT_ORIGIN (fn
)
4379 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4380 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4382 /* Don't try to inline functions that are not well-suited to inlining. */
4383 if (cg_edge
->inline_failed
)
4385 reason
= cg_edge
->inline_failed
;
4386 /* If this call was originally indirect, we do not want to emit any
4387 inlining related warnings or sorry messages because there are no
4388 guarantees regarding those. */
4389 if (cg_edge
->indirect_inlining_edge
)
4392 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4393 /* For extern inline functions that get redefined we always
4394 silently ignored always_inline flag. Better behavior would
4395 be to be able to keep both bodies and use extern inline body
4396 for inlining, but we can't do that because frontends overwrite
4398 && !cg_edge
->callee
->local
.redefined_extern_inline
4399 /* During early inline pass, report only when optimization is
4401 && (symtab
->global_info_ready
4403 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4404 /* PR 20090218-1_0.c. Body can be provided by another module. */
4405 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4407 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4408 cgraph_inline_failed_string (reason
));
4409 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4410 inform (gimple_location (stmt
), "called from here");
4411 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4412 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4413 "called from this function");
4415 else if (warn_inline
4416 && DECL_DECLARED_INLINE_P (fn
)
4417 && !DECL_NO_INLINE_WARNING_P (fn
)
4418 && !DECL_IN_SYSTEM_HEADER (fn
)
4419 && reason
!= CIF_UNSPECIFIED
4420 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4421 /* Do not warn about not inlined recursive calls. */
4422 && !cg_edge
->recursive_p ()
4423 /* Avoid warnings during early inline pass. */
4424 && symtab
->global_info_ready
)
4426 if (warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4427 fn
, _(cgraph_inline_failed_string (reason
))))
4429 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4430 inform (gimple_location (stmt
), "called from here");
4431 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4432 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4433 "called from this function");
4438 id
->src_node
= cg_edge
->callee
;
4440 /* If callee is thunk, all we need is to adjust the THIS pointer
4441 and redirect to function being thunked. */
4442 if (id
->src_node
->thunk
.thunk_p
)
4445 tree virtual_offset
= NULL
;
4446 profile_count count
= cg_edge
->count
;
4448 gimple_stmt_iterator iter
= gsi_for_stmt (stmt
);
4451 edge
= id
->src_node
->callees
->clone (id
->dst_node
, call_stmt
,
4453 profile_count::one (),
4454 profile_count::one (),
4456 edge
->count
= count
;
4457 if (id
->src_node
->thunk
.virtual_offset_p
)
4458 virtual_offset
= size_int (id
->src_node
->thunk
.virtual_value
);
4459 op
= create_tmp_reg_fn (cfun
, TREE_TYPE (gimple_call_arg (stmt
, 0)),
4461 gsi_insert_before (&iter
, gimple_build_assign (op
,
4462 gimple_call_arg (stmt
, 0)),
4464 gcc_assert (id
->src_node
->thunk
.this_adjusting
);
4465 op
= thunk_adjust (&iter
, op
, 1, id
->src_node
->thunk
.fixed_offset
,
4468 gimple_call_set_arg (stmt
, 0, op
);
4469 gimple_call_set_fndecl (stmt
, edge
->callee
->decl
);
4471 id
->src_node
->remove ();
4472 expand_call_inline (bb
, stmt
, id
);
4473 maybe_remove_unused_call_args (cfun
, stmt
);
4476 fn
= cg_edge
->callee
->decl
;
4477 cg_edge
->callee
->get_untransformed_body ();
4479 if (flag_checking
&& cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4480 cg_edge
->callee
->verify ();
4482 /* We will be inlining this callee. */
4483 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4484 id
->assign_stmts
.create (0);
4486 /* Update the callers EH personality. */
4487 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4488 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4489 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4491 /* Split the block before the GIMPLE_CALL. */
4492 stmt_gsi
= gsi_for_stmt (stmt
);
4493 gsi_prev (&stmt_gsi
);
4494 e
= split_block (bb
, gsi_end_p (stmt_gsi
) ? NULL
: gsi_stmt (stmt_gsi
));
4496 return_block
= e
->dest
;
4499 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4500 been the source of abnormal edges. In this case, schedule
4501 the removal of dead abnormal edges. */
4502 gsi
= gsi_start_bb (return_block
);
4504 purge_dead_abnormal_edges
= gsi_end_p (gsi
);
4506 stmt_gsi
= gsi_start_bb (return_block
);
4508 /* Build a block containing code to initialize the arguments, the
4509 actual inline expansion of the body, and a label for the return
4510 statements within the function to jump to. The type of the
4511 statement expression is the return type of the function call.
4512 ??? If the call does not have an associated block then we will
4513 remap all callee blocks to NULL, effectively dropping most of
4514 its debug information. This should only happen for calls to
4515 artificial decls inserted by the compiler itself. We need to
4516 either link the inlined blocks into the caller block tree or
4517 not refer to them in any way to not break GC for locations. */
4518 if (gimple_block (stmt
))
4520 id
->block
= make_node (BLOCK
);
4521 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4522 BLOCK_SOURCE_LOCATION (id
->block
)
4523 = LOCATION_LOCUS (gimple_location (stmt
));
4524 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4527 /* Local declarations will be replaced by their equivalents in this
4530 id
->decl_map
= new hash_map
<tree
, tree
>;
4531 dst
= id
->debug_map
;
4532 id
->debug_map
= NULL
;
4534 /* Record the function we are about to inline. */
4536 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4537 id
->call_stmt
= call_stmt
;
4539 /* When inlining into an OpenMP SIMD-on-SIMT loop, arrange for new automatic
4540 variables to be added to IFN_GOMP_SIMT_ENTER argument list. */
4541 dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4542 simtvars_save
= id
->dst_simt_vars
;
4543 if (!(dst_cfun
->curr_properties
& PROP_gimple_lomp_dev
)
4544 && (simduid
= bb
->loop_father
->simduid
) != NULL_TREE
4545 && (simduid
= ssa_default_def (dst_cfun
, simduid
)) != NULL_TREE
4546 && single_imm_use (simduid
, &use
, &simtenter_stmt
)
4547 && is_gimple_call (simtenter_stmt
)
4548 && gimple_call_internal_p (simtenter_stmt
, IFN_GOMP_SIMT_ENTER
))
4549 vec_alloc (id
->dst_simt_vars
, 0);
4551 id
->dst_simt_vars
= NULL
;
4553 if (profile_status_for_fn (id
->src_cfun
) == PROFILE_ABSENT
)
4554 profile_status_for_fn (dst_cfun
) = PROFILE_ABSENT
;
4556 /* If the src function contains an IFN_VA_ARG, then so will the dst
4557 function after inlining. Likewise for IFN_GOMP_USE_SIMT. */
4558 prop_mask
= PROP_gimple_lva
| PROP_gimple_lomp_dev
;
4559 src_properties
= id
->src_cfun
->curr_properties
& prop_mask
;
4560 if (src_properties
!= prop_mask
)
4561 dst_cfun
->curr_properties
&= src_properties
| ~prop_mask
;
4563 gcc_assert (!id
->src_cfun
->after_inlining
);
4566 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4568 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4569 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4573 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4575 if (DECL_INITIAL (fn
))
4577 if (gimple_block (stmt
))
4581 prepend_lexical_block (id
->block
,
4582 remap_blocks (DECL_INITIAL (fn
), id
));
4583 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4584 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4586 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4587 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4588 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4589 under it. The parameters can be then evaluated in the debugger,
4590 but don't show in backtraces. */
4591 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4592 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4595 *var
= TREE_CHAIN (v
);
4596 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4597 BLOCK_VARS (id
->block
) = v
;
4600 var
= &TREE_CHAIN (*var
);
4603 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4606 /* Return statements in the function body will be replaced by jumps
4607 to the RET_LABEL. */
4608 gcc_assert (DECL_INITIAL (fn
));
4609 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4611 /* Find the LHS to which the result of this call is assigned. */
4613 if (gimple_call_lhs (stmt
))
4615 modify_dest
= gimple_call_lhs (stmt
);
4617 /* Remember where to copy returned bounds. */
4618 if (gimple_call_with_bounds_p (stmt
)
4619 && TREE_CODE (modify_dest
) == SSA_NAME
)
4621 gcall
*retbnd
= chkp_retbnd_call_by_val (modify_dest
);
4624 return_bounds
= gimple_call_lhs (retbnd
);
4625 /* If returned bounds are not used then just
4626 remove unused call. */
4629 gimple_stmt_iterator iter
= gsi_for_stmt (retbnd
);
4630 gsi_remove (&iter
, true);
4635 /* The function which we are inlining might not return a value,
4636 in which case we should issue a warning that the function
4637 does not return a value. In that case the optimizers will
4638 see that the variable to which the value is assigned was not
4639 initialized. We do not want to issue a warning about that
4640 uninitialized variable. */
4641 if (DECL_P (modify_dest
))
4642 TREE_NO_WARNING (modify_dest
) = 1;
4644 if (gimple_call_return_slot_opt_p (call_stmt
))
4646 return_slot
= modify_dest
;
4653 /* If we are inlining a call to the C++ operator new, we don't want
4654 to use type based alias analysis on the return value. Otherwise
4655 we may get confused if the compiler sees that the inlined new
4656 function returns a pointer which was just deleted. See bug
4658 if (DECL_IS_OPERATOR_NEW (fn
))
4664 /* Declare the return variable for the function. */
4665 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
,
4668 /* Add local vars in this inlined callee to caller. */
4669 add_local_variables (id
->src_cfun
, cfun
, id
);
4671 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4673 fprintf (dump_file
, "Inlining ");
4674 print_generic_expr (dump_file
, id
->src_fn
);
4675 fprintf (dump_file
, " to ");
4676 print_generic_expr (dump_file
, id
->dst_fn
);
4677 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency ());
4680 /* This is it. Duplicate the callee body. Assume callee is
4681 pre-gimplified. Note that we must not alter the caller
4682 function in any way before this point, as this CALL_EXPR may be
4683 a self-referential call; if we're calling ourselves, we need to
4684 duplicate our body before altering anything. */
4685 copy_body (id
, cg_edge
->callee
->count
,
4686 bb
, return_block
, NULL
);
4688 reset_debug_bindings (id
, stmt_gsi
);
4690 if (flag_stack_reuse
!= SR_NONE
)
4691 for (tree p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
4692 if (!TREE_THIS_VOLATILE (p
))
4694 tree
*varp
= id
->decl_map
->get (p
);
4695 if (varp
&& VAR_P (*varp
) && !is_gimple_reg (*varp
))
4697 tree clobber
= build_constructor (TREE_TYPE (*varp
), NULL
);
4698 gimple
*clobber_stmt
;
4699 TREE_THIS_VOLATILE (clobber
) = 1;
4700 clobber_stmt
= gimple_build_assign (*varp
, clobber
);
4701 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
4702 gsi_insert_before (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
4706 /* Reset the escaped solution. */
4707 if (cfun
->gimple_df
)
4708 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4710 /* Add new automatic variables to IFN_GOMP_SIMT_ENTER arguments. */
4711 if (id
->dst_simt_vars
&& id
->dst_simt_vars
->length () > 0)
4713 size_t nargs
= gimple_call_num_args (simtenter_stmt
);
4714 vec
<tree
> *vars
= id
->dst_simt_vars
;
4715 auto_vec
<tree
> newargs (nargs
+ vars
->length ());
4716 for (size_t i
= 0; i
< nargs
; i
++)
4717 newargs
.quick_push (gimple_call_arg (simtenter_stmt
, i
));
4718 for (tree
*pvar
= vars
->begin (); pvar
!= vars
->end (); pvar
++)
4720 tree ptrtype
= build_pointer_type (TREE_TYPE (*pvar
));
4721 newargs
.quick_push (build1 (ADDR_EXPR
, ptrtype
, *pvar
));
4723 gcall
*g
= gimple_build_call_internal_vec (IFN_GOMP_SIMT_ENTER
, newargs
);
4724 gimple_call_set_lhs (g
, gimple_call_lhs (simtenter_stmt
));
4725 gimple_stmt_iterator gsi
= gsi_for_stmt (simtenter_stmt
);
4726 gsi_replace (&gsi
, g
, false);
4728 vec_free (id
->dst_simt_vars
);
4729 id
->dst_simt_vars
= simtvars_save
;
4734 delete id
->debug_map
;
4735 id
->debug_map
= dst
;
4737 delete id
->decl_map
;
4740 /* Unlink the calls virtual operands before replacing it. */
4741 unlink_stmt_vdef (stmt
);
4742 if (gimple_vdef (stmt
)
4743 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4744 release_ssa_name (gimple_vdef (stmt
));
4746 /* If the inlined function returns a result that we care about,
4747 substitute the GIMPLE_CALL with an assignment of the return
4748 variable to the LHS of the call. That is, if STMT was
4749 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4750 if (use_retvar
&& gimple_call_lhs (stmt
))
4752 gimple
*old_stmt
= stmt
;
4753 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4754 gsi_replace (&stmt_gsi
, stmt
, false);
4755 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4756 /* Append a clobber for id->retvar if easily possible. */
4757 if (flag_stack_reuse
!= SR_NONE
4759 && VAR_P (id
->retvar
)
4760 && id
->retvar
!= return_slot
4761 && id
->retvar
!= modify_dest
4762 && !TREE_THIS_VOLATILE (id
->retvar
)
4763 && !is_gimple_reg (id
->retvar
)
4764 && !stmt_ends_bb_p (stmt
))
4766 tree clobber
= build_constructor (TREE_TYPE (id
->retvar
), NULL
);
4767 gimple
*clobber_stmt
;
4768 TREE_THIS_VOLATILE (clobber
) = 1;
4769 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
4770 gimple_set_location (clobber_stmt
, gimple_location (old_stmt
));
4771 gsi_insert_after (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
4774 /* Copy bounds if we copy structure with bounds. */
4775 if (chkp_function_instrumented_p (id
->dst_fn
)
4776 && !BOUNDED_P (use_retvar
)
4777 && chkp_type_has_pointer (TREE_TYPE (use_retvar
)))
4778 id
->assign_stmts
.safe_push (stmt
);
4782 /* Handle the case of inlining a function with no return
4783 statement, which causes the return value to become undefined. */
4784 if (gimple_call_lhs (stmt
)
4785 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4787 tree name
= gimple_call_lhs (stmt
);
4788 tree var
= SSA_NAME_VAR (name
);
4789 tree def
= var
? ssa_default_def (cfun
, var
) : NULL
;
4793 /* If the variable is used undefined, make this name
4794 undefined via a move. */
4795 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4796 gsi_replace (&stmt_gsi
, stmt
, true);
4802 var
= create_tmp_reg_fn (cfun
, TREE_TYPE (name
), NULL
);
4803 SET_SSA_NAME_VAR_OR_IDENTIFIER (name
, var
);
4805 /* Otherwise make this variable undefined. */
4806 gsi_remove (&stmt_gsi
, true);
4807 set_ssa_default_def (cfun
, var
, name
);
4808 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4811 /* Replace with a clobber for id->retvar. */
4812 else if (flag_stack_reuse
!= SR_NONE
4814 && VAR_P (id
->retvar
)
4815 && id
->retvar
!= return_slot
4816 && id
->retvar
!= modify_dest
4817 && !TREE_THIS_VOLATILE (id
->retvar
)
4818 && !is_gimple_reg (id
->retvar
))
4820 tree clobber
= build_constructor (TREE_TYPE (id
->retvar
), NULL
);
4821 gimple
*clobber_stmt
;
4822 TREE_THIS_VOLATILE (clobber
) = 1;
4823 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
4824 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
4825 gsi_replace (&stmt_gsi
, clobber_stmt
, false);
4826 maybe_clean_or_replace_eh_stmt (stmt
, clobber_stmt
);
4829 gsi_remove (&stmt_gsi
, true);
4832 /* Put returned bounds into the correct place if required. */
4835 gimple
*old_stmt
= SSA_NAME_DEF_STMT (return_bounds
);
4836 gimple
*new_stmt
= gimple_build_assign (return_bounds
, id
->retbnd
);
4837 gimple_stmt_iterator bnd_gsi
= gsi_for_stmt (old_stmt
);
4838 unlink_stmt_vdef (old_stmt
);
4839 gsi_replace (&bnd_gsi
, new_stmt
, false);
4840 maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
);
4841 cgraph_update_edges_for_call_stmt (old_stmt
,
4842 gimple_call_fndecl (old_stmt
),
4846 if (purge_dead_abnormal_edges
)
4848 gimple_purge_dead_eh_edges (return_block
);
4849 gimple_purge_dead_abnormal_call_edges (return_block
);
4852 /* If the value of the new expression is ignored, that's OK. We
4853 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4854 the equivalent inlined version either. */
4855 if (is_gimple_assign (stmt
))
4857 gcc_assert (gimple_assign_single_p (stmt
)
4858 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4859 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4862 /* Copy bounds for all generated assigns that need it. */
4863 for (i
= 0; i
< id
->assign_stmts
.length (); i
++)
4864 chkp_copy_bounds_for_assign (id
->assign_stmts
[i
], cg_edge
);
4865 id
->assign_stmts
.release ();
4867 /* Output the inlining info for this abstract function, since it has been
4868 inlined. If we don't do this now, we can lose the information about the
4869 variables in the function when the blocks get blown away as soon as we
4870 remove the cgraph node. */
4871 if (gimple_block (stmt
))
4872 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4874 /* Update callgraph if needed. */
4875 cg_edge
->callee
->remove ();
4877 id
->block
= NULL_TREE
;
4878 id
->retvar
= NULL_TREE
;
4879 id
->retbnd
= NULL_TREE
;
4880 successfully_inlined
= true;
4883 input_location
= saved_location
;
4884 return successfully_inlined
;
4887 /* Expand call statements reachable from STMT_P.
4888 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4889 in a MODIFY_EXPR. */
4892 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4894 gimple_stmt_iterator gsi
;
4895 bool inlined
= false;
4897 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
4899 gimple
*stmt
= gsi_stmt (gsi
);
4902 if (is_gimple_call (stmt
)
4903 && !gimple_call_internal_p (stmt
))
4904 inlined
|= expand_call_inline (bb
, stmt
, id
);
4911 /* Walk all basic blocks created after FIRST and try to fold every statement
4912 in the STATEMENTS pointer set. */
4915 fold_marked_statements (int first
, hash_set
<gimple
*> *statements
)
4917 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4918 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4920 gimple_stmt_iterator gsi
;
4922 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4925 if (statements
->contains (gsi_stmt (gsi
)))
4927 gimple
*old_stmt
= gsi_stmt (gsi
);
4928 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4930 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4932 /* Folding builtins can create multiple instructions,
4933 we need to look at all of them. */
4934 gimple_stmt_iterator i2
= gsi
;
4936 if (fold_stmt (&gsi
))
4939 /* If a builtin at the end of a bb folded into nothing,
4940 the following loop won't work. */
4941 if (gsi_end_p (gsi
))
4943 cgraph_update_edges_for_call_stmt (old_stmt
,
4948 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4953 new_stmt
= gsi_stmt (i2
);
4954 update_stmt (new_stmt
);
4955 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4958 if (new_stmt
== gsi_stmt (gsi
))
4960 /* It is okay to check only for the very last
4961 of these statements. If it is a throwing
4962 statement nothing will change. If it isn't
4963 this can remove EH edges. If that weren't
4964 correct then because some intermediate stmts
4965 throw, but not the last one. That would mean
4966 we'd have to split the block, which we can't
4967 here and we'd loose anyway. And as builtins
4968 probably never throw, this all
4970 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4972 gimple_purge_dead_eh_edges (
4973 BASIC_BLOCK_FOR_FN (cfun
, first
));
4980 else if (fold_stmt (&gsi
))
4982 /* Re-read the statement from GSI as fold_stmt() may
4984 gimple
*new_stmt
= gsi_stmt (gsi
);
4985 update_stmt (new_stmt
);
4987 if (is_gimple_call (old_stmt
)
4988 || is_gimple_call (new_stmt
))
4989 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4992 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4993 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
5000 /* Expand calls to inline functions in the body of FN. */
5003 optimize_inline_calls (tree fn
)
5007 int last
= n_basic_blocks_for_fn (cfun
);
5008 bool inlined_p
= false;
5011 memset (&id
, 0, sizeof (id
));
5013 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
5014 gcc_assert (id
.dst_node
->definition
);
5016 /* Or any functions that aren't finished yet. */
5017 if (current_function_decl
)
5018 id
.dst_fn
= current_function_decl
;
5020 id
.copy_decl
= copy_decl_maybe_to_var
;
5021 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5022 id
.transform_new_cfg
= false;
5023 id
.transform_return_to_modify
= true;
5024 id
.transform_parameter
= true;
5025 id
.transform_lang_insert_block
= NULL
;
5026 id
.statements_to_fold
= new hash_set
<gimple
*>;
5028 push_gimplify_context ();
5030 /* We make no attempts to keep dominance info up-to-date. */
5031 free_dominance_info (CDI_DOMINATORS
);
5032 free_dominance_info (CDI_POST_DOMINATORS
);
5034 /* Register specific gimple functions. */
5035 gimple_register_cfg_hooks ();
5037 /* Reach the trees by walking over the CFG, and note the
5038 enclosing basic-blocks in the call edges. */
5039 /* We walk the blocks going forward, because inlined function bodies
5040 will split id->current_basic_block, and the new blocks will
5041 follow it; we'll trudge through them, processing their CALL_EXPRs
5043 FOR_EACH_BB_FN (bb
, cfun
)
5044 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
5046 pop_gimplify_context (NULL
);
5050 struct cgraph_edge
*e
;
5052 id
.dst_node
->verify ();
5054 /* Double check that we inlined everything we are supposed to inline. */
5055 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
5056 gcc_assert (e
->inline_failed
);
5059 /* Fold queued statements. */
5061 fold_marked_statements (last
, id
.statements_to_fold
);
5062 delete id
.statements_to_fold
;
5064 gcc_assert (!id
.debug_stmts
.exists ());
5066 /* If we didn't inline into the function there is nothing to do. */
5070 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5073 delete_unreachable_blocks_update_callgraph (&id
);
5075 id
.dst_node
->verify ();
5077 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5078 not possible yet - the IPA passes might make various functions to not
5079 throw and they don't care to proactively update local EH info. This is
5080 done later in fixup_cfg pass that also execute the verification. */
5081 return (TODO_update_ssa
5083 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5084 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
5085 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
5086 ? TODO_rebuild_frequencies
: 0));
5089 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5092 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5094 enum tree_code code
= TREE_CODE (*tp
);
5095 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5097 /* We make copies of most nodes. */
5098 if (IS_EXPR_CODE_CLASS (cl
)
5099 || code
== TREE_LIST
5101 || code
== TYPE_DECL
5102 || code
== OMP_CLAUSE
)
5104 /* Because the chain gets clobbered when we make a copy, we save it
5106 tree chain
= NULL_TREE
, new_tree
;
5108 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5109 chain
= TREE_CHAIN (*tp
);
5111 /* Copy the node. */
5112 new_tree
= copy_node (*tp
);
5116 /* Now, restore the chain, if appropriate. That will cause
5117 walk_tree to walk into the chain as well. */
5118 if (code
== PARM_DECL
5119 || code
== TREE_LIST
5120 || code
== OMP_CLAUSE
)
5121 TREE_CHAIN (*tp
) = chain
;
5123 /* For now, we don't update BLOCKs when we make copies. So, we
5124 have to nullify all BIND_EXPRs. */
5125 if (TREE_CODE (*tp
) == BIND_EXPR
)
5126 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5128 else if (code
== CONSTRUCTOR
)
5130 /* CONSTRUCTOR nodes need special handling because
5131 we need to duplicate the vector of elements. */
5134 new_tree
= copy_node (*tp
);
5135 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5138 else if (code
== STATEMENT_LIST
)
5139 /* We used to just abort on STATEMENT_LIST, but we can run into them
5140 with statement-expressions (c++/40975). */
5141 copy_statement_list (tp
);
5142 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5144 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5146 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5151 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5152 information indicating to what new SAVE_EXPR this one should be mapped,
5153 use that one. Otherwise, create a new node and enter it in ST. FN is
5154 the function into which the copy will be placed. */
5157 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5162 /* See if we already encountered this SAVE_EXPR. */
5165 /* If we didn't already remap this SAVE_EXPR, do so now. */
5168 t
= copy_node (*tp
);
5170 /* Remember this SAVE_EXPR. */
5172 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5177 /* We've already walked into this SAVE_EXPR; don't do it again. */
5182 /* Replace this SAVE_EXPR with the copy. */
5186 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5187 label, copies the declaration and enters it in the splay_tree in DATA (which
5188 is really a 'copy_body_data *'. */
5191 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5192 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5193 struct walk_stmt_info
*wi
)
5195 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5196 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5200 tree decl
= gimple_label_label (stmt
);
5202 /* Copy the decl and remember the copy. */
5203 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5209 static gimple_seq
duplicate_remap_omp_clause_seq (gimple_seq seq
,
5210 struct walk_stmt_info
*wi
);
5212 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5213 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5214 remaps all local declarations to appropriate replacements in gimple
5218 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5220 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5221 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5222 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5226 /* For recursive invocations this is no longer the LHS itself. */
5227 bool is_lhs
= wi
->is_lhs
;
5230 if (TREE_CODE (expr
) == SSA_NAME
)
5232 *tp
= remap_ssa_name (*tp
, id
);
5235 SSA_NAME_DEF_STMT (*tp
) = gsi_stmt (wi
->gsi
);
5237 /* Only a local declaration (variable or label). */
5238 else if ((VAR_P (expr
) && !TREE_STATIC (expr
))
5239 || TREE_CODE (expr
) == LABEL_DECL
)
5241 /* Lookup the declaration. */
5244 /* If it's there, remap it. */
5249 else if (TREE_CODE (expr
) == STATEMENT_LIST
5250 || TREE_CODE (expr
) == BIND_EXPR
5251 || TREE_CODE (expr
) == SAVE_EXPR
)
5253 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5255 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5256 It's OK for this to happen if it was part of a subtree that
5257 isn't immediately expanded, such as operand 2 of another
5259 if (!TREE_OPERAND (expr
, 1))
5261 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5262 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5265 else if (TREE_CODE (expr
) == OMP_CLAUSE
)
5267 /* Before the omplower pass completes, some OMP clauses can contain
5268 sequences that are neither copied by gimple_seq_copy nor walked by
5269 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5270 in those situations, we have to copy and process them explicitely. */
5272 if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LASTPRIVATE
)
5274 gimple_seq seq
= OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
);
5275 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5276 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
) = seq
;
5278 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LINEAR
)
5280 gimple_seq seq
= OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
);
5281 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5282 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
) = seq
;
5284 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_REDUCTION
)
5286 gimple_seq seq
= OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
);
5287 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5288 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
) = seq
;
5289 seq
= OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
);
5290 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5291 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
) = seq
;
5295 /* Keep iterating. */
5300 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5301 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5302 remaps all local declarations to appropriate replacements in gimple
5306 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5307 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5308 struct walk_stmt_info
*wi
)
5310 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5311 gimple
*gs
= gsi_stmt (*gsip
);
5313 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5315 tree block
= gimple_bind_block (stmt
);
5319 remap_block (&block
, id
);
5320 gimple_bind_set_block (stmt
, block
);
5323 /* This will remap a lot of the same decls again, but this should be
5325 if (gimple_bind_vars (stmt
))
5327 tree old_var
, decls
= gimple_bind_vars (stmt
);
5329 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
5330 if (!can_be_nonlocal (old_var
, id
)
5331 && ! variably_modified_type_p (TREE_TYPE (old_var
), id
->src_fn
))
5332 remap_decl (old_var
, id
);
5334 gcc_checking_assert (!id
->prevent_decl_creation_for_types
);
5335 id
->prevent_decl_creation_for_types
= true;
5336 gimple_bind_set_vars (stmt
, remap_decls (decls
, NULL
, id
));
5337 id
->prevent_decl_creation_for_types
= false;
5341 /* Keep iterating. */
5345 /* Create a copy of SEQ and remap all decls in it. */
5348 duplicate_remap_omp_clause_seq (gimple_seq seq
, struct walk_stmt_info
*wi
)
5353 /* If there are any labels in OMP sequences, they can be only referred to in
5354 the sequence itself and therefore we can do both here. */
5355 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, wi
);
5356 gimple_seq copy
= gimple_seq_copy (seq
);
5357 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, wi
);
5361 /* Copies everything in SEQ and replaces variables and labels local to
5362 current_function_decl. */
5365 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5368 struct walk_stmt_info wi
;
5371 /* There's nothing to do for NULL_TREE. */
5376 memset (&id
, 0, sizeof (id
));
5377 id
.src_fn
= current_function_decl
;
5378 id
.dst_fn
= current_function_decl
;
5380 id
.decl_map
= new hash_map
<tree
, tree
>;
5381 id
.debug_map
= NULL
;
5383 id
.copy_decl
= copy_decl_no_change
;
5384 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5385 id
.transform_new_cfg
= false;
5386 id
.transform_return_to_modify
= false;
5387 id
.transform_parameter
= false;
5388 id
.transform_lang_insert_block
= NULL
;
5390 /* Walk the tree once to find local labels. */
5391 memset (&wi
, 0, sizeof (wi
));
5392 hash_set
<tree
> visited
;
5395 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5397 copy
= gimple_seq_copy (seq
);
5399 /* Walk the copy, remapping decls. */
5400 memset (&wi
, 0, sizeof (wi
));
5402 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5407 delete id
.debug_map
;
5408 if (id
.dependence_map
)
5410 delete id
.dependence_map
;
5411 id
.dependence_map
= NULL
;
5418 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5421 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5430 debug_find_tree (tree top
, tree search
)
5432 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5436 /* Declare the variables created by the inliner. Add all the variables in
5437 VARS to BIND_EXPR. */
5440 declare_inline_vars (tree block
, tree vars
)
5443 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5445 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5446 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5447 add_local_decl (cfun
, t
);
5451 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5454 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5455 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5456 VAR_DECL translation. */
5459 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5461 /* Don't generate debug information for the copy if we wouldn't have
5462 generated it for the copy either. */
5463 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5464 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5466 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5467 declaration inspired this copy. */
5468 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5470 /* The new variable/label has no RTL, yet. */
5471 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5472 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5473 SET_DECL_RTL (copy
, 0);
5475 /* These args would always appear unused, if not for this. */
5476 TREE_USED (copy
) = 1;
5478 /* Set the context for the new declaration. */
5479 if (!DECL_CONTEXT (decl
))
5480 /* Globals stay global. */
5482 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5483 /* Things that weren't in the scope of the function we're inlining
5484 from aren't in the scope we're inlining to, either. */
5486 else if (TREE_STATIC (decl
))
5487 /* Function-scoped static variables should stay in the original
5492 /* Ordinary automatic local variables are now in the scope of the
5494 DECL_CONTEXT (copy
) = id
->dst_fn
;
5495 if (VAR_P (copy
) && id
->dst_simt_vars
&& !is_gimple_reg (copy
))
5497 if (!lookup_attribute ("omp simt private", DECL_ATTRIBUTES (copy
)))
5498 DECL_ATTRIBUTES (copy
)
5499 = tree_cons (get_identifier ("omp simt private"), NULL
,
5500 DECL_ATTRIBUTES (copy
));
5501 id
->dst_simt_vars
->safe_push (copy
);
5509 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5513 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5514 || TREE_CODE (decl
) == RESULT_DECL
);
5516 type
= TREE_TYPE (decl
);
5518 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5519 VAR_DECL
, DECL_NAME (decl
), type
);
5520 if (DECL_PT_UID_SET_P (decl
))
5521 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5522 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5523 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5524 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5525 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5527 return copy_decl_for_dup_finish (id
, decl
, copy
);
5530 /* Like copy_decl_to_var, but create a return slot object instead of a
5531 pointer variable for return by invisible reference. */
5534 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5538 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5539 || TREE_CODE (decl
) == RESULT_DECL
);
5541 type
= TREE_TYPE (decl
);
5542 if (DECL_BY_REFERENCE (decl
))
5543 type
= TREE_TYPE (type
);
5545 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5546 VAR_DECL
, DECL_NAME (decl
), type
);
5547 if (DECL_PT_UID_SET_P (decl
))
5548 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5549 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5550 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5551 if (!DECL_BY_REFERENCE (decl
))
5553 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5554 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5557 return copy_decl_for_dup_finish (id
, decl
, copy
);
5561 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5565 copy
= copy_node (decl
);
5567 /* The COPY is not abstract; it will be generated in DST_FN. */
5568 DECL_ABSTRACT_P (copy
) = false;
5569 lang_hooks
.dup_lang_specific_decl (copy
);
5571 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5572 been taken; it's for internal bookkeeping in expand_goto_internal. */
5573 if (TREE_CODE (copy
) == LABEL_DECL
)
5575 TREE_ADDRESSABLE (copy
) = 0;
5576 LABEL_DECL_UID (copy
) = -1;
5579 return copy_decl_for_dup_finish (id
, decl
, copy
);
5583 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5585 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5586 return copy_decl_to_var (decl
, id
);
5588 return copy_decl_no_change (decl
, id
);
5591 /* Return a copy of the function's argument tree. */
5593 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5594 bitmap args_to_skip
, tree
*vars
)
5597 tree new_parm
= NULL
;
5602 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5603 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5605 tree new_tree
= remap_decl (arg
, id
);
5606 if (TREE_CODE (new_tree
) != PARM_DECL
)
5607 new_tree
= id
->copy_decl (arg
, id
);
5608 lang_hooks
.dup_lang_specific_decl (new_tree
);
5610 parg
= &DECL_CHAIN (new_tree
);
5612 else if (!id
->decl_map
->get (arg
))
5614 /* Make an equivalent VAR_DECL. If the argument was used
5615 as temporary variable later in function, the uses will be
5616 replaced by local variable. */
5617 tree var
= copy_decl_to_var (arg
, id
);
5618 insert_decl_map (id
, arg
, var
);
5619 /* Declare this new variable. */
5620 DECL_CHAIN (var
) = *vars
;
5626 /* Return a copy of the function's static chain. */
5628 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5630 tree
*chain_copy
, *pvar
;
5632 chain_copy
= &static_chain
;
5633 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5635 tree new_tree
= remap_decl (*pvar
, id
);
5636 lang_hooks
.dup_lang_specific_decl (new_tree
);
5637 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5640 return static_chain
;
5643 /* Return true if the function is allowed to be versioned.
5644 This is a guard for the versioning functionality. */
5647 tree_versionable_function_p (tree fndecl
)
5649 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5650 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
)) == NULL
);
5653 /* Delete all unreachable basic blocks and update callgraph.
5654 Doing so is somewhat nontrivial because we need to update all clones and
5655 remove inline function that become unreachable. */
5658 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5660 bool changed
= false;
5661 basic_block b
, next_bb
;
5663 find_unreachable_blocks ();
5665 /* Delete all unreachable basic blocks. */
5667 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5668 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5670 next_bb
= b
->next_bb
;
5672 if (!(b
->flags
& BB_REACHABLE
))
5674 gimple_stmt_iterator bsi
;
5676 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5678 struct cgraph_edge
*e
;
5679 struct cgraph_node
*node
;
5681 id
->dst_node
->remove_stmt_references (gsi_stmt (bsi
));
5683 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5684 &&(e
= id
->dst_node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5686 if (!e
->inline_failed
)
5687 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5691 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5692 && id
->dst_node
->clones
)
5693 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5695 node
->remove_stmt_references (gsi_stmt (bsi
));
5696 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5697 && (e
= node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5699 if (!e
->inline_failed
)
5700 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5706 node
= node
->clones
;
5707 else if (node
->next_sibling_clone
)
5708 node
= node
->next_sibling_clone
;
5711 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5712 node
= node
->clone_of
;
5713 if (node
!= id
->dst_node
)
5714 node
= node
->next_sibling_clone
;
5718 delete_basic_block (b
);
5726 /* Update clone info after duplication. */
5729 update_clone_info (copy_body_data
* id
)
5731 struct cgraph_node
*node
;
5732 if (!id
->dst_node
->clones
)
5734 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5736 /* First update replace maps to match the new body. */
5737 if (node
->clone
.tree_map
)
5740 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5742 struct ipa_replace_map
*replace_info
;
5743 replace_info
= (*node
->clone
.tree_map
)[i
];
5744 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5745 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5749 node
= node
->clones
;
5750 else if (node
->next_sibling_clone
)
5751 node
= node
->next_sibling_clone
;
5754 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5755 node
= node
->clone_of
;
5756 if (node
!= id
->dst_node
)
5757 node
= node
->next_sibling_clone
;
5762 /* Create a copy of a function's tree.
5763 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5764 of the original function and the new copied function
5765 respectively. In case we want to replace a DECL
5766 tree with another tree while duplicating the function's
5767 body, TREE_MAP represents the mapping between these
5768 trees. If UPDATE_CLONES is set, the call_stmt fields
5769 of edges of clones of the function will be updated.
5771 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5773 If SKIP_RETURN is true, the new version will return void.
5774 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5775 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5778 tree_function_versioning (tree old_decl
, tree new_decl
,
5779 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
5780 bool update_clones
, bitmap args_to_skip
,
5781 bool skip_return
, bitmap blocks_to_copy
,
5782 basic_block new_entry
)
5784 struct cgraph_node
*old_version_node
;
5785 struct cgraph_node
*new_version_node
;
5789 struct ipa_replace_map
*replace_info
;
5790 basic_block old_entry_block
, bb
;
5791 auto_vec
<gimple
*, 10> init_stmts
;
5792 tree vars
= NULL_TREE
;
5793 bitmap debug_args_to_skip
= args_to_skip
;
5795 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5796 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5797 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5799 old_version_node
= cgraph_node::get (old_decl
);
5800 gcc_checking_assert (old_version_node
);
5801 new_version_node
= cgraph_node::get (new_decl
);
5802 gcc_checking_assert (new_version_node
);
5804 /* Copy over debug args. */
5805 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5807 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5808 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5809 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5810 old_debug_args
= decl_debug_args_lookup (old_decl
);
5813 new_debug_args
= decl_debug_args_insert (new_decl
);
5814 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5818 /* Output the inlining info for this abstract function, since it has been
5819 inlined. If we don't do this now, we can lose the information about the
5820 variables in the function when the blocks get blown away as soon as we
5821 remove the cgraph node. */
5822 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5824 DECL_ARTIFICIAL (new_decl
) = 1;
5825 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5826 if (DECL_ORIGIN (old_decl
) == old_decl
)
5827 old_version_node
->used_as_abstract_origin
= true;
5828 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5830 /* Prepare the data structures for the tree copy. */
5831 memset (&id
, 0, sizeof (id
));
5833 /* Generate a new name for the new version. */
5834 id
.statements_to_fold
= new hash_set
<gimple
*>;
5836 id
.decl_map
= new hash_map
<tree
, tree
>;
5837 id
.debug_map
= NULL
;
5838 id
.src_fn
= old_decl
;
5839 id
.dst_fn
= new_decl
;
5840 id
.src_node
= old_version_node
;
5841 id
.dst_node
= new_version_node
;
5842 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5843 id
.blocks_to_copy
= blocks_to_copy
;
5845 id
.copy_decl
= copy_decl_no_change
;
5846 id
.transform_call_graph_edges
5847 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5848 id
.transform_new_cfg
= true;
5849 id
.transform_return_to_modify
= false;
5850 id
.transform_parameter
= false;
5851 id
.transform_lang_insert_block
= NULL
;
5853 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5854 (DECL_STRUCT_FUNCTION (old_decl
));
5855 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5856 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5857 initialize_cfun (new_decl
, old_decl
,
5858 old_entry_block
->count
);
5859 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
5860 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5861 = id
.src_cfun
->gimple_df
->ipa_pta
;
5863 /* Copy the function's static chain. */
5864 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5866 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
5867 = copy_static_chain (p
, &id
);
5869 /* If there's a tree_map, prepare for substitution. */
5871 for (i
= 0; i
< tree_map
->length (); i
++)
5874 replace_info
= (*tree_map
)[i
];
5875 if (replace_info
->replace_p
)
5878 if (!replace_info
->old_tree
)
5880 int p
= replace_info
->parm_num
;
5882 tree req_type
, new_type
;
5884 for (parm
= DECL_ARGUMENTS (old_decl
); p
;
5885 parm
= DECL_CHAIN (parm
))
5887 replace_info
->old_tree
= parm
;
5888 parm_num
= replace_info
->parm_num
;
5889 req_type
= TREE_TYPE (parm
);
5890 new_type
= TREE_TYPE (replace_info
->new_tree
);
5891 if (!useless_type_conversion_p (req_type
, new_type
))
5893 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5894 replace_info
->new_tree
5895 = fold_build1 (NOP_EXPR
, req_type
,
5896 replace_info
->new_tree
);
5897 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (new_type
))
5898 replace_info
->new_tree
5899 = fold_build1 (VIEW_CONVERT_EXPR
, req_type
,
5900 replace_info
->new_tree
);
5905 fprintf (dump_file
, " const ");
5906 print_generic_expr (dump_file
,
5907 replace_info
->new_tree
);
5909 " can't be converted to param ");
5910 print_generic_expr (dump_file
, parm
);
5911 fprintf (dump_file
, "\n");
5913 replace_info
->old_tree
= NULL
;
5918 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5919 if (replace_info
->old_tree
)
5921 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5922 replace_info
->new_tree
, id
.src_fn
,
5926 init_stmts
.safe_push (init
);
5927 if (MAY_HAVE_DEBUG_STMTS
&& args_to_skip
)
5933 for (parm
= DECL_ARGUMENTS (old_decl
), p
= 0; parm
;
5934 parm
= DECL_CHAIN (parm
), p
++)
5935 if (parm
== replace_info
->old_tree
)
5943 if (debug_args_to_skip
== args_to_skip
)
5945 debug_args_to_skip
= BITMAP_ALLOC (NULL
);
5946 bitmap_copy (debug_args_to_skip
, args_to_skip
);
5948 bitmap_clear_bit (debug_args_to_skip
, parm_num
);
5954 /* Copy the function's arguments. */
5955 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5956 DECL_ARGUMENTS (new_decl
)
5957 = copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5958 args_to_skip
, &vars
);
5960 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5961 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5963 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5965 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5966 /* Add local vars. */
5967 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5969 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5971 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5973 DECL_RESULT (new_decl
)
5974 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5975 RESULT_DECL
, NULL_TREE
, void_type_node
);
5976 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5977 cfun
->returns_struct
= 0;
5978 cfun
->returns_pcc_struct
= 0;
5983 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5984 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5985 if (gimple_in_ssa_p (id
.src_cfun
)
5986 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5987 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5989 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
5990 insert_decl_map (&id
, old_name
, new_name
);
5991 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5992 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5996 /* Set up the destination functions loop tree. */
5997 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5999 cfun
->curr_properties
&= ~PROP_loops
;
6000 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
6001 cfun
->curr_properties
|= PROP_loops
;
6004 /* Copy the Function's body. */
6005 copy_body (&id
, old_entry_block
->count
,
6006 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
6009 /* Renumber the lexical scoping (non-code) blocks consecutively. */
6010 number_blocks (new_decl
);
6012 /* We want to create the BB unconditionally, so that the addition of
6013 debug stmts doesn't affect BB count, which may in the end cause
6014 codegen differences. */
6015 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6016 while (init_stmts
.length ())
6017 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
6018 update_clone_info (&id
);
6020 /* Remap the nonlocal_goto_save_area, if any. */
6021 if (cfun
->nonlocal_goto_save_area
)
6023 struct walk_stmt_info wi
;
6025 memset (&wi
, 0, sizeof (wi
));
6027 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
6033 delete id
.debug_map
;
6034 free_dominance_info (CDI_DOMINATORS
);
6035 free_dominance_info (CDI_POST_DOMINATORS
);
6038 fold_marked_statements (0, id
.statements_to_fold
);
6039 delete id
.statements_to_fold
;
6040 delete_unreachable_blocks_update_callgraph (&id
);
6041 if (id
.dst_node
->definition
)
6042 cgraph_edge::rebuild_references ();
6043 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
6045 calculate_dominance_info (CDI_DOMINATORS
);
6046 fix_loop_structure (NULL
);
6048 update_ssa (TODO_update_ssa
);
6050 /* After partial cloning we need to rescale frequencies, so they are
6051 within proper range in the cloned function. */
6054 struct cgraph_edge
*e
;
6055 rebuild_frequencies ();
6057 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
6058 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
6060 basic_block bb
= gimple_bb (e
->call_stmt
);
6061 e
->count
= bb
->count
;
6063 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
6065 basic_block bb
= gimple_bb (e
->call_stmt
);
6066 e
->count
= bb
->count
;
6070 if (debug_args_to_skip
&& MAY_HAVE_DEBUG_STMTS
)
6073 vec
<tree
, va_gc
> **debug_args
= NULL
;
6074 unsigned int len
= 0;
6075 for (parm
= DECL_ARGUMENTS (old_decl
), i
= 0;
6076 parm
; parm
= DECL_CHAIN (parm
), i
++)
6077 if (bitmap_bit_p (debug_args_to_skip
, i
) && is_gimple_reg (parm
))
6081 if (debug_args
== NULL
)
6083 debug_args
= decl_debug_args_insert (new_decl
);
6084 len
= vec_safe_length (*debug_args
);
6086 ddecl
= make_node (DEBUG_EXPR_DECL
);
6087 DECL_ARTIFICIAL (ddecl
) = 1;
6088 TREE_TYPE (ddecl
) = TREE_TYPE (parm
);
6089 SET_DECL_MODE (ddecl
, DECL_MODE (parm
));
6090 vec_safe_push (*debug_args
, DECL_ORIGIN (parm
));
6091 vec_safe_push (*debug_args
, ddecl
);
6093 if (debug_args
!= NULL
)
6095 /* On the callee side, add
6098 stmts to the first bb where var is a VAR_DECL created for the
6099 optimized away parameter in DECL_INITIAL block. This hints
6100 in the debug info that var (whole DECL_ORIGIN is the parm
6101 PARM_DECL) is optimized away, but could be looked up at the
6102 call site as value of D#X there. */
6103 tree var
= vars
, vexpr
;
6104 gimple_stmt_iterator cgsi
6105 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6108 i
= vec_safe_length (*debug_args
);
6112 while (var
!= NULL_TREE
6113 && DECL_ABSTRACT_ORIGIN (var
) != (**debug_args
)[i
])
6114 var
= TREE_CHAIN (var
);
6115 if (var
== NULL_TREE
)
6117 vexpr
= make_node (DEBUG_EXPR_DECL
);
6118 parm
= (**debug_args
)[i
];
6119 DECL_ARTIFICIAL (vexpr
) = 1;
6120 TREE_TYPE (vexpr
) = TREE_TYPE (parm
);
6121 SET_DECL_MODE (vexpr
, DECL_MODE (parm
));
6122 def_temp
= gimple_build_debug_bind (var
, vexpr
, NULL
);
6123 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6124 def_temp
= gimple_build_debug_source_bind (vexpr
, parm
, NULL
);
6125 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6131 if (debug_args_to_skip
&& debug_args_to_skip
!= args_to_skip
)
6132 BITMAP_FREE (debug_args_to_skip
);
6133 free_dominance_info (CDI_DOMINATORS
);
6134 free_dominance_info (CDI_POST_DOMINATORS
);
6136 gcc_assert (!id
.debug_stmts
.exists ());
6141 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6142 the callee and return the inlined body on success. */
6145 maybe_inline_call_in_expr (tree exp
)
6147 tree fn
= get_callee_fndecl (exp
);
6149 /* We can only try to inline "const" functions. */
6150 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
6152 call_expr_arg_iterator iter
;
6155 hash_map
<tree
, tree
> decl_map
;
6157 /* Remap the parameters. */
6158 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
6160 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
6161 decl_map
.put (param
, arg
);
6163 memset (&id
, 0, sizeof (id
));
6165 id
.dst_fn
= current_function_decl
;
6166 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6167 id
.decl_map
= &decl_map
;
6169 id
.copy_decl
= copy_decl_no_change
;
6170 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6171 id
.transform_new_cfg
= false;
6172 id
.transform_return_to_modify
= true;
6173 id
.transform_parameter
= true;
6174 id
.transform_lang_insert_block
= NULL
;
6176 /* Make sure not to unshare trees behind the front-end's back
6177 since front-end specific mechanisms may rely on sharing. */
6178 id
.regimplify
= false;
6179 id
.do_not_unshare
= true;
6181 /* We're not inside any EH region. */
6184 t
= copy_tree_body (&id
);
6186 /* We can only return something suitable for use in a GENERIC
6188 if (TREE_CODE (t
) == MODIFY_EXPR
)
6189 return TREE_OPERAND (t
, 1);
6195 /* Duplicate a type, fields and all. */
6198 build_duplicate_type (tree type
)
6200 struct copy_body_data id
;
6202 memset (&id
, 0, sizeof (id
));
6203 id
.src_fn
= current_function_decl
;
6204 id
.dst_fn
= current_function_decl
;
6206 id
.decl_map
= new hash_map
<tree
, tree
>;
6207 id
.debug_map
= NULL
;
6208 id
.copy_decl
= copy_decl_no_change
;
6210 type
= remap_type_1 (type
, &id
);
6214 delete id
.debug_map
;
6216 TYPE_CANONICAL (type
) = type
;
6221 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6222 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6226 copy_fn (tree fn
, tree
& parms
, tree
& result
)
6230 hash_map
<tree
, tree
> decl_map
;
6235 memset (&id
, 0, sizeof (id
));
6237 id
.dst_fn
= current_function_decl
;
6238 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6239 id
.decl_map
= &decl_map
;
6241 id
.copy_decl
= copy_decl_no_change
;
6242 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6243 id
.transform_new_cfg
= false;
6244 id
.transform_return_to_modify
= false;
6245 id
.transform_parameter
= true;
6246 id
.transform_lang_insert_block
= NULL
;
6248 /* Make sure not to unshare trees behind the front-end's back
6249 since front-end specific mechanisms may rely on sharing. */
6250 id
.regimplify
= false;
6251 id
.do_not_unshare
= true;
6253 /* We're not inside any EH region. */
6256 /* Remap the parameters and result and return them to the caller. */
6257 for (param
= DECL_ARGUMENTS (fn
);
6259 param
= DECL_CHAIN (param
))
6261 *p
= remap_decl (param
, &id
);
6262 p
= &DECL_CHAIN (*p
);
6265 if (DECL_RESULT (fn
))
6266 result
= remap_decl (DECL_RESULT (fn
), &id
);
6270 return copy_tree_body (&id
);