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 /* We always must scale to be sure counters end up compatible.
1775 If den is zero, just force it nonzero and hope for reasonable
1777 When num is forced nonzero, also update den, so we do not scale profile
1780 && !(den
.force_nonzero () == den
))
1782 den
= den
.force_nonzero ();
1783 num
= num
.force_nonzero ();
1786 /* Search for previous copied basic block. */
1789 prev
= prev
->prev_bb
;
1791 /* create_basic_block() will append every new block to
1792 basic_block_info automatically. */
1793 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
1794 copy_basic_block
->count
= bb
->count
.apply_scale (num
, den
);
1796 copy_gsi
= gsi_start_bb (copy_basic_block
);
1798 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1801 gimple
*stmt
= gsi_stmt (gsi
);
1802 gimple
*orig_stmt
= stmt
;
1803 gimple_stmt_iterator stmts_gsi
;
1804 bool stmt_added
= false;
1806 id
->regimplify
= false;
1807 stmts
= remap_gimple_stmt (stmt
, id
);
1809 if (gimple_seq_empty_p (stmts
))
1814 for (stmts_gsi
= gsi_start (stmts
);
1815 !gsi_end_p (stmts_gsi
); )
1817 stmt
= gsi_stmt (stmts_gsi
);
1819 /* Advance iterator now before stmt is moved to seq_gsi. */
1820 gsi_next (&stmts_gsi
);
1822 if (gimple_nop_p (stmt
))
1825 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
1828 /* With return slot optimization we can end up with
1829 non-gimple (foo *)&this->m, fix that here. */
1830 if (is_gimple_assign (stmt
)
1831 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
1832 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1835 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1836 gimple_assign_rhs1 (stmt
),
1838 GSI_CONTINUE_LINKING
);
1839 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1840 id
->regimplify
= false;
1843 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1846 gimple_regimplify_operands (stmt
, &seq_gsi
);
1854 /* If copy_basic_block has been empty at the start of this iteration,
1855 call gsi_start_bb again to get at the newly added statements. */
1856 if (gsi_end_p (copy_gsi
))
1857 copy_gsi
= gsi_start_bb (copy_basic_block
);
1859 gsi_next (©_gsi
);
1861 /* Process the new statement. The call to gimple_regimplify_operands
1862 possibly turned the statement into multiple statements, we
1863 need to process all of them. */
1869 stmt
= gsi_stmt (copy_gsi
);
1870 call_stmt
= dyn_cast
<gcall
*> (stmt
);
1872 && gimple_call_va_arg_pack_p (call_stmt
)
1874 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
1876 /* __builtin_va_arg_pack () should be replaced by
1877 all arguments corresponding to ... in the caller. */
1881 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
1882 size_t n
, i
, nargs_to_copy
;
1883 bool remove_bounds
= false;
1885 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1888 /* Bounds should be removed from arg pack in case
1889 we handle not instrumented call in instrumented
1891 nargs_to_copy
= nargs
;
1892 if (gimple_call_with_bounds_p (id
->call_stmt
)
1893 && !gimple_call_with_bounds_p (stmt
))
1895 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1896 i
< gimple_call_num_args (id
->call_stmt
);
1898 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1900 remove_bounds
= true;
1903 /* Create the new array of arguments. */
1904 n
= nargs_to_copy
+ gimple_call_num_args (call_stmt
);
1905 argarray
.create (n
);
1906 argarray
.safe_grow_cleared (n
);
1908 /* Copy all the arguments before '...' */
1909 memcpy (argarray
.address (),
1910 gimple_call_arg_ptr (call_stmt
, 0),
1911 gimple_call_num_args (call_stmt
) * sizeof (tree
));
1915 /* Append the rest of arguments removing bounds. */
1916 unsigned cur
= gimple_call_num_args (call_stmt
);
1917 i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1918 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1919 i
< gimple_call_num_args (id
->call_stmt
);
1921 if (!POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1922 argarray
[cur
++] = gimple_call_arg (id
->call_stmt
, i
);
1923 gcc_assert (cur
== n
);
1927 /* Append the arguments passed in '...' */
1928 memcpy (argarray
.address () + gimple_call_num_args (call_stmt
),
1929 gimple_call_arg_ptr (id
->call_stmt
, 0)
1930 + (gimple_call_num_args (id
->call_stmt
) - nargs
),
1931 nargs
* sizeof (tree
));
1934 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
1937 argarray
.release ();
1939 /* Copy all GIMPLE_CALL flags, location and block, except
1940 GF_CALL_VA_ARG_PACK. */
1941 gimple_call_copy_flags (new_call
, call_stmt
);
1942 gimple_call_set_va_arg_pack (new_call
, false);
1943 gimple_set_location (new_call
, gimple_location (stmt
));
1944 gimple_set_block (new_call
, gimple_block (stmt
));
1945 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
1947 gsi_replace (©_gsi
, new_call
, false);
1952 && (decl
= gimple_call_fndecl (stmt
))
1953 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1954 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
1955 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
1957 /* __builtin_va_arg_pack_len () should be replaced by
1958 the number of anonymous arguments. */
1959 size_t nargs
= gimple_call_num_args (id
->call_stmt
), i
;
1963 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1966 /* For instrumented calls we should ignore bounds. */
1967 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1968 i
< gimple_call_num_args (id
->call_stmt
);
1970 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1973 count
= build_int_cst (integer_type_node
, nargs
);
1974 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1975 gsi_replace (©_gsi
, new_stmt
, false);
1980 && gimple_call_internal_p (stmt
)
1981 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
1983 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
1984 gsi_remove (©_gsi
, false);
1988 /* Statements produced by inlining can be unfolded, especially
1989 when we constant propagated some operands. We can't fold
1990 them right now for two reasons:
1991 1) folding require SSA_NAME_DEF_STMTs to be correct
1992 2) we can't change function calls to builtins.
1993 So we just mark statement for later folding. We mark
1994 all new statements, instead just statements that has changed
1995 by some nontrivial substitution so even statements made
1996 foldable indirectly are updated. If this turns out to be
1997 expensive, copy_body can be told to watch for nontrivial
1999 if (id
->statements_to_fold
)
2000 id
->statements_to_fold
->add (stmt
);
2002 /* We're duplicating a CALL_EXPR. Find any corresponding
2003 callgraph edges and update or duplicate them. */
2004 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
2006 struct cgraph_edge
*edge
;
2008 switch (id
->transform_call_graph_edges
)
2010 case CB_CGE_DUPLICATE
:
2011 edge
= id
->src_node
->get_edge (orig_stmt
);
2014 int edge_freq
= edge
->frequency
;
2016 struct cgraph_edge
*old_edge
= edge
;
2017 edge
= edge
->clone (id
->dst_node
, call_stmt
,
2019 profile_count::one (),
2020 profile_count::one (),
2023 /* We could also just rescale the frequency, but
2024 doing so would introduce roundoff errors and make
2025 verifier unhappy. */
2026 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
2029 /* Speculative calls consist of two edges - direct and indirect.
2030 Duplicate the whole thing and distribute frequencies accordingly. */
2031 if (edge
->speculative
)
2033 struct cgraph_edge
*direct
, *indirect
;
2034 struct ipa_ref
*ref
;
2036 gcc_assert (!edge
->indirect_unknown_callee
);
2037 old_edge
->speculative_call_info (direct
, indirect
, ref
);
2038 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2040 profile_count::one (),
2041 profile_count::one (),
2044 if (old_edge
->frequency
+ indirect
->frequency
)
2046 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
2047 (old_edge
->frequency
+ indirect
->frequency
)),
2049 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
2050 (old_edge
->frequency
+ indirect
->frequency
)),
2053 id
->dst_node
->clone_reference (ref
, stmt
);
2057 edge
->frequency
= new_freq
;
2059 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
2060 && (edge_freq
> edge
->frequency
+ 10
2061 || edge_freq
< edge
->frequency
- 10))
2063 fprintf (dump_file
, "Edge frequency estimated by "
2064 "cgraph %i diverge from inliner's estimate %i\n",
2068 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
2070 bb
->count
.to_frequency (cfun
),
2071 copy_basic_block
->count
.to_frequency (cfun
));
2077 case CB_CGE_MOVE_CLONES
:
2078 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2080 edge
= id
->dst_node
->get_edge (stmt
);
2084 edge
= id
->dst_node
->get_edge (orig_stmt
);
2086 edge
->set_call_stmt (call_stmt
);
2093 /* Constant propagation on argument done during inlining
2094 may create new direct call. Produce an edge for it. */
2096 || (edge
->indirect_inlining_edge
2097 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2098 && id
->dst_node
->definition
2099 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2101 struct cgraph_node
*dest
= cgraph_node::get_create (fn
);
2103 /* We have missing edge in the callgraph. This can happen
2104 when previous inlining turned an indirect call into a
2105 direct call by constant propagating arguments or we are
2106 producing dead clone (for further cloning). In all
2107 other cases we hit a bug (incorrect node sharing is the
2108 most common reason for missing edges). */
2109 gcc_assert (!dest
->definition
2110 || dest
->address_taken
2111 || !id
->src_node
->definition
2112 || !id
->dst_node
->definition
);
2113 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2114 id
->dst_node
->create_edge_including_clones
2115 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2116 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
2118 CIF_ORIGINALLY_INDIRECT_CALL
);
2120 id
->dst_node
->create_edge (dest
, call_stmt
,
2122 compute_call_stmt_bb_frequency
2123 (id
->dst_node
->decl
,
2124 copy_basic_block
))->inline_failed
2125 = CIF_ORIGINALLY_INDIRECT_CALL
;
2128 fprintf (dump_file
, "Created new direct edge to %s\n",
2133 notice_special_calls (as_a
<gcall
*> (stmt
));
2136 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2137 id
->eh_map
, id
->eh_lp_nr
);
2139 gsi_next (©_gsi
);
2141 while (!gsi_end_p (copy_gsi
));
2143 copy_gsi
= gsi_last_bb (copy_basic_block
);
2146 return copy_basic_block
;
2149 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2150 form is quite easy, since dominator relationship for old basic blocks does
2153 There is however exception where inlining might change dominator relation
2154 across EH edges from basic block within inlined functions destinating
2155 to landing pads in function we inline into.
2157 The function fills in PHI_RESULTs of such PHI nodes if they refer
2158 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2159 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2160 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2161 set, and this means that there will be no overlapping live ranges
2162 for the underlying symbol.
2164 This might change in future if we allow redirecting of EH edges and
2165 we might want to change way build CFG pre-inlining to include
2166 all the possible edges then. */
2168 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2169 bool can_throw
, bool nonlocal_goto
)
2174 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2176 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2182 gcc_assert (e
->flags
& EDGE_EH
);
2185 gcc_assert (!(e
->flags
& EDGE_EH
));
2187 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2193 /* For abnormal goto/call edges the receiver can be the
2194 ENTRY_BLOCK. Do not assert this cannot happen. */
2196 gcc_assert ((e
->flags
& EDGE_EH
)
2197 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2199 re
= find_edge (ret_bb
, e
->dest
);
2200 gcc_checking_assert (re
);
2201 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2202 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2204 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2205 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2211 /* Copy edges from BB into its copy constructed earlier, scale profile
2212 accordingly. Edges will be taken care of later. Assume aux
2213 pointers to point to the copies of each BB. Return true if any
2214 debug stmts are left after a statement that must end the basic block. */
2217 copy_edges_for_bb (basic_block bb
,
2218 basic_block ret_bb
, basic_block abnormal_goto_dest
)
2220 basic_block new_bb
= (basic_block
) bb
->aux
;
2223 gimple_stmt_iterator si
;
2225 bool need_debug_cleanup
= false;
2227 /* Use the indices from the original blocks to create edges for the
2229 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2230 if (!(old_edge
->flags
& EDGE_EH
))
2234 flags
= old_edge
->flags
;
2236 /* Return edges do get a FALLTHRU flag when the get inlined. */
2237 if (old_edge
->dest
->index
== EXIT_BLOCK
2238 && !(old_edge
->flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2239 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2240 flags
|= EDGE_FALLTHRU
;
2241 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2242 new_edge
->probability
= old_edge
->probability
;
2245 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2248 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2251 bool can_throw
, nonlocal_goto
;
2253 copy_stmt
= gsi_stmt (si
);
2254 if (!is_gimple_debug (copy_stmt
))
2255 update_stmt (copy_stmt
);
2257 /* Do this before the possible split_block. */
2260 /* If this tree could throw an exception, there are two
2261 cases where we need to add abnormal edge(s): the
2262 tree wasn't in a region and there is a "current
2263 region" in the caller; or the original tree had
2264 EH edges. In both cases split the block after the tree,
2265 and add abnormal edge(s) as needed; we need both
2266 those from the callee and the caller.
2267 We check whether the copy can throw, because the const
2268 propagation can change an INDIRECT_REF which throws
2269 into a COMPONENT_REF which doesn't. If the copy
2270 can throw, the original could also throw. */
2271 can_throw
= stmt_can_throw_internal (copy_stmt
);
2273 = (stmt_can_make_abnormal_goto (copy_stmt
)
2274 && !computed_goto_p (copy_stmt
));
2276 if (can_throw
|| nonlocal_goto
)
2278 if (!gsi_end_p (si
))
2280 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2283 need_debug_cleanup
= true;
2285 if (!gsi_end_p (si
))
2286 /* Note that bb's predecessor edges aren't necessarily
2287 right at this point; split_block doesn't care. */
2289 edge e
= split_block (new_bb
, copy_stmt
);
2292 new_bb
->aux
= e
->src
->aux
;
2293 si
= gsi_start_bb (new_bb
);
2297 bool update_probs
= false;
2299 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2301 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2302 update_probs
= true;
2306 make_eh_edges (copy_stmt
);
2307 update_probs
= true;
2310 /* EH edges may not match old edges. Copy as much as possible. */
2315 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2317 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2318 if ((old_edge
->flags
& EDGE_EH
)
2319 && (e
= find_edge (copy_stmt_bb
,
2320 (basic_block
) old_edge
->dest
->aux
))
2321 && (e
->flags
& EDGE_EH
))
2322 e
->probability
= old_edge
->probability
;
2324 FOR_EACH_EDGE (e
, ei
, copy_stmt_bb
->succs
)
2325 if ((e
->flags
& EDGE_EH
) && !e
->probability
.initialized_p ())
2326 e
->probability
= profile_probability::never ();
2330 /* If the call we inline cannot make abnormal goto do not add
2331 additional abnormal edges but only retain those already present
2332 in the original function body. */
2333 if (abnormal_goto_dest
== NULL
)
2334 nonlocal_goto
= false;
2337 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2339 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2340 nonlocal_goto
= false;
2341 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2342 in OpenMP regions which aren't allowed to be left abnormally.
2343 So, no need to add abnormal edge in that case. */
2344 else if (is_gimple_call (copy_stmt
)
2345 && gimple_call_internal_p (copy_stmt
)
2346 && (gimple_call_internal_fn (copy_stmt
)
2347 == IFN_ABNORMAL_DISPATCHER
)
2348 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2349 nonlocal_goto
= false;
2351 make_single_succ_edge (copy_stmt_bb
, abnormal_goto_dest
,
2355 if ((can_throw
|| nonlocal_goto
)
2356 && gimple_in_ssa_p (cfun
))
2357 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2358 can_throw
, nonlocal_goto
);
2360 return need_debug_cleanup
;
2363 /* Copy the PHIs. All blocks and edges are copied, some blocks
2364 was possibly split and new outgoing EH edges inserted.
2365 BB points to the block of original function and AUX pointers links
2366 the original and newly copied blocks. */
2369 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2371 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2376 bool inserted
= false;
2378 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2384 res
= PHI_RESULT (phi
);
2386 if (!virtual_operand_p (res
))
2388 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2389 if (EDGE_COUNT (new_bb
->preds
) == 0)
2391 /* Technically we'd want a SSA_DEFAULT_DEF here... */
2392 SSA_NAME_DEF_STMT (new_res
) = gimple_build_nop ();
2396 new_phi
= create_phi_node (new_res
, new_bb
);
2397 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2399 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
,
2406 /* When doing partial cloning, we allow PHIs on the entry
2407 block as long as all the arguments are the same.
2408 Find any input edge to see argument to copy. */
2410 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2411 if (!old_edge
->src
->aux
)
2414 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2416 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2417 gcc_assert (new_arg
);
2418 /* With return slot optimization we can end up with
2419 non-gimple (foo *)&this->m, fix that here. */
2420 if (TREE_CODE (new_arg
) != SSA_NAME
2421 && TREE_CODE (new_arg
) != FUNCTION_DECL
2422 && !is_gimple_val (new_arg
))
2424 gimple_seq stmts
= NULL
;
2425 new_arg
= force_gimple_operand (new_arg
, &stmts
, true,
2427 gsi_insert_seq_on_edge (new_edge
, stmts
);
2430 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2431 if (LOCATION_BLOCK (locus
))
2434 n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
2436 locus
= set_block (locus
, *n
);
2439 locus
= LOCATION_LOCUS (locus
);
2441 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2447 /* Commit the delayed edge insertions. */
2449 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2450 gsi_commit_one_edge_insert (new_edge
, NULL
);
2454 /* Wrapper for remap_decl so it can be used as a callback. */
2457 remap_decl_1 (tree decl
, void *data
)
2459 return remap_decl (decl
, (copy_body_data
*) data
);
2462 /* Build struct function and associated datastructures for the new clone
2463 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2464 the cfun to the function of new_fndecl (and current_function_decl too). */
2467 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, profile_count count
)
2469 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2471 if (!DECL_ARGUMENTS (new_fndecl
))
2472 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2473 if (!DECL_RESULT (new_fndecl
))
2474 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2476 /* Register specific tree functions. */
2477 gimple_register_cfg_hooks ();
2479 /* Get clean struct function. */
2480 push_struct_function (new_fndecl
);
2482 /* We will rebuild these, so just sanity check that they are empty. */
2483 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2484 gcc_assert (cfun
->local_decls
== NULL
);
2485 gcc_assert (cfun
->cfg
== NULL
);
2486 gcc_assert (cfun
->decl
== new_fndecl
);
2488 /* Copy items we preserve during cloning. */
2489 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2490 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2491 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2492 cfun
->curr_properties
= src_cfun
->curr_properties
;
2493 cfun
->last_verified
= src_cfun
->last_verified
;
2494 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2495 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2496 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2497 cfun
->stdarg
= src_cfun
->stdarg
;
2498 cfun
->after_inlining
= src_cfun
->after_inlining
;
2499 cfun
->can_throw_non_call_exceptions
2500 = src_cfun
->can_throw_non_call_exceptions
;
2501 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2502 cfun
->returns_struct
= src_cfun
->returns_struct
;
2503 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2505 init_empty_tree_cfg ();
2507 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2509 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.initialized_p ()
2510 && count
.ipa ().initialized_p ())
2512 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2513 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2514 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2515 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2516 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2517 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2521 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
2522 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2523 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
2524 = EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2527 init_eh_for_function ();
2529 if (src_cfun
->gimple_df
)
2531 init_tree_ssa (cfun
);
2532 cfun
->gimple_df
->in_ssa_p
= src_cfun
->gimple_df
->in_ssa_p
;
2533 if (cfun
->gimple_df
->in_ssa_p
)
2534 init_ssa_operands (cfun
);
2538 /* Helper function for copy_cfg_body. Move debug stmts from the end
2539 of NEW_BB to the beginning of successor basic blocks when needed. If the
2540 successor has multiple predecessors, reset them, otherwise keep
2544 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2548 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2551 || gsi_one_before_end_p (si
)
2552 || !(stmt_can_throw_internal (gsi_stmt (si
))
2553 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2556 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2558 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2559 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2560 while (is_gimple_debug (gsi_stmt (ssi
)))
2562 gimple
*stmt
= gsi_stmt (ssi
);
2567 /* For the last edge move the debug stmts instead of copying
2569 if (ei_one_before_end_p (ei
))
2573 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2574 gimple_debug_bind_reset_value (stmt
);
2575 gsi_remove (&si
, false);
2576 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2580 if (gimple_debug_bind_p (stmt
))
2582 var
= gimple_debug_bind_get_var (stmt
);
2583 if (single_pred_p (e
->dest
))
2585 value
= gimple_debug_bind_get_value (stmt
);
2586 value
= unshare_expr (value
);
2590 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2592 else if (gimple_debug_source_bind_p (stmt
))
2594 var
= gimple_debug_source_bind_get_var (stmt
);
2595 value
= gimple_debug_source_bind_get_value (stmt
);
2596 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2600 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2601 id
->debug_stmts
.safe_push (new_stmt
);
2607 /* Make a copy of the sub-loops of SRC_PARENT and place them
2608 as siblings of DEST_PARENT. */
2611 copy_loops (copy_body_data
*id
,
2612 struct loop
*dest_parent
, struct loop
*src_parent
)
2614 struct loop
*src_loop
= src_parent
->inner
;
2617 if (!id
->blocks_to_copy
2618 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2620 struct loop
*dest_loop
= alloc_loop ();
2622 /* Assign the new loop its header and latch and associate
2623 those with the new loop. */
2624 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2625 dest_loop
->header
->loop_father
= dest_loop
;
2626 if (src_loop
->latch
!= NULL
)
2628 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2629 dest_loop
->latch
->loop_father
= dest_loop
;
2632 /* Copy loop meta-data. */
2633 copy_loop_info (src_loop
, dest_loop
);
2635 /* Finally place it into the loop array and the loop tree. */
2636 place_new_loop (cfun
, dest_loop
);
2637 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2639 dest_loop
->safelen
= src_loop
->safelen
;
2640 dest_loop
->dont_vectorize
= src_loop
->dont_vectorize
;
2641 if (src_loop
->force_vectorize
)
2643 dest_loop
->force_vectorize
= true;
2644 cfun
->has_force_vectorize_loops
= true;
2646 if (src_loop
->simduid
)
2648 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2649 cfun
->has_simduid_loops
= true;
2653 copy_loops (id
, dest_loop
, src_loop
);
2655 src_loop
= src_loop
->next
;
2659 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2662 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2664 gimple_stmt_iterator si
;
2665 gimple
*last
= last_stmt (bb
);
2666 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2668 gimple
*stmt
= gsi_stmt (si
);
2669 if (is_gimple_call (stmt
))
2671 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2674 edge
->redirect_call_stmt_to_callee ();
2675 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
2676 gimple_purge_dead_eh_edges (bb
);
2682 /* Make a copy of the body of FN so that it can be inserted inline in
2683 another function. Walks FN via CFG, returns new fndecl. */
2686 copy_cfg_body (copy_body_data
* id
, profile_count
,
2687 basic_block entry_block_map
, basic_block exit_block_map
,
2688 basic_block new_entry
)
2690 tree callee_fndecl
= id
->src_fn
;
2691 /* Original cfun for the callee, doesn't change. */
2692 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2693 struct function
*cfun_to_copy
;
2695 tree new_fndecl
= NULL
;
2696 bool need_debug_cleanup
= false;
2698 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2699 profile_count num
= entry_block_map
->count
;
2701 /* We always must scale to be sure counters end up compatible.
2702 If den is zero, just force it nonzero and hope for reasonable
2704 When num is forced nonzero, also update den, so we do not scale profile
2707 && !(den
.force_nonzero () == den
))
2709 den
= den
.force_nonzero ();
2710 num
= num
.force_nonzero ();
2713 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2715 /* Register specific tree functions. */
2716 gimple_register_cfg_hooks ();
2718 /* If we are inlining just region of the function, make sure to connect
2719 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2720 part of loop, we must compute frequency and probability of
2721 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2722 probabilities of edges incoming from nonduplicated region. */
2727 den
= profile_count::zero ();
2729 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2732 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= den
;
2735 /* Must have a CFG here at this point. */
2736 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2737 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2740 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2741 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2742 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2743 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2745 /* Duplicate any exception-handling regions. */
2747 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2750 /* Use aux pointers to map the original blocks to copy. */
2751 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2752 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2754 basic_block new_bb
= copy_bb (id
, bb
, num
, den
);
2757 new_bb
->loop_father
= entry_block_map
->loop_father
;
2760 last
= last_basic_block_for_fn (cfun
);
2762 /* Now that we've duplicated the blocks, duplicate their edges. */
2763 basic_block abnormal_goto_dest
= NULL
;
2765 && stmt_can_make_abnormal_goto (id
->call_stmt
))
2767 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
2769 bb
= gimple_bb (id
->call_stmt
);
2771 if (gsi_end_p (gsi
))
2772 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2774 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2775 if (!id
->blocks_to_copy
2776 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2777 need_debug_cleanup
|= copy_edges_for_bb (bb
, exit_block_map
,
2778 abnormal_goto_dest
);
2782 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2783 e
->probability
= profile_probability::always ();
2786 /* Duplicate the loop tree, if available and wanted. */
2787 if (loops_for_fn (src_cfun
) != NULL
2788 && current_loops
!= NULL
)
2790 copy_loops (id
, entry_block_map
->loop_father
,
2791 get_loop (src_cfun
, 0));
2792 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2793 loops_state_set (LOOPS_NEED_FIXUP
);
2796 /* If the loop tree in the source function needed fixup, mark the
2797 destination loop tree for fixup, too. */
2798 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2799 loops_state_set (LOOPS_NEED_FIXUP
);
2801 if (gimple_in_ssa_p (cfun
))
2802 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2803 if (!id
->blocks_to_copy
2804 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2805 copy_phis_for_bb (bb
, id
);
2807 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2810 if (need_debug_cleanup
2811 && bb
->index
!= ENTRY_BLOCK
2812 && bb
->index
!= EXIT_BLOCK
)
2813 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2814 /* Update call edge destinations. This can not be done before loop
2815 info is updated, because we may split basic blocks. */
2816 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
2817 && bb
->index
!= ENTRY_BLOCK
2818 && bb
->index
!= EXIT_BLOCK
)
2819 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2820 ((basic_block
)bb
->aux
)->aux
= NULL
;
2824 /* Zero out AUX fields of newly created block during EH edge
2826 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2828 if (need_debug_cleanup
)
2829 maybe_move_debug_stmts_to_successors (id
,
2830 BASIC_BLOCK_FOR_FN (cfun
, last
));
2831 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2832 /* Update call edge destinations. This can not be done before loop
2833 info is updated, because we may split basic blocks. */
2834 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2835 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2837 entry_block_map
->aux
= NULL
;
2838 exit_block_map
->aux
= NULL
;
2845 if (id
->dependence_map
)
2847 delete id
->dependence_map
;
2848 id
->dependence_map
= NULL
;
2854 /* Copy the debug STMT using ID. We deal with these statements in a
2855 special way: if any variable in their VALUE expression wasn't
2856 remapped yet, we won't remap it, because that would get decl uids
2857 out of sync, causing codegen differences between -g and -g0. If
2858 this arises, we drop the VALUE expression altogether. */
2861 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
2864 struct walk_stmt_info wi
;
2866 if (gimple_block (stmt
))
2868 n
= id
->decl_map
->get (gimple_block (stmt
));
2869 gimple_set_block (stmt
, n
? *n
: id
->block
);
2872 /* Remap all the operands in COPY. */
2873 memset (&wi
, 0, sizeof (wi
));
2876 processing_debug_stmt
= 1;
2878 if (gimple_debug_source_bind_p (stmt
))
2879 t
= gimple_debug_source_bind_get_var (stmt
);
2881 t
= gimple_debug_bind_get_var (stmt
);
2883 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2884 && (n
= id
->debug_map
->get (t
)))
2886 gcc_assert (VAR_P (*n
));
2889 else if (VAR_P (t
) && !is_global_var (t
) && !id
->decl_map
->get (t
))
2890 /* T is a non-localized variable. */;
2892 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2894 if (gimple_debug_bind_p (stmt
))
2896 gimple_debug_bind_set_var (stmt
, t
);
2898 if (gimple_debug_bind_has_value_p (stmt
))
2899 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2900 remap_gimple_op_r
, &wi
, NULL
);
2902 /* Punt if any decl couldn't be remapped. */
2903 if (processing_debug_stmt
< 0)
2904 gimple_debug_bind_reset_value (stmt
);
2906 else if (gimple_debug_source_bind_p (stmt
))
2908 gimple_debug_source_bind_set_var (stmt
, t
);
2909 /* When inlining and source bind refers to one of the optimized
2910 away parameters, change the source bind into normal debug bind
2911 referring to the corresponding DEBUG_EXPR_DECL that should have
2912 been bound before the call stmt. */
2913 t
= gimple_debug_source_bind_get_value (stmt
);
2915 && TREE_CODE (t
) == PARM_DECL
2918 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2920 if (debug_args
!= NULL
)
2922 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2923 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2924 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2926 t
= (**debug_args
)[i
+ 1];
2927 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2928 gimple_debug_bind_set_value (stmt
, t
);
2933 if (gimple_debug_source_bind_p (stmt
))
2934 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2935 remap_gimple_op_r
, &wi
, NULL
);
2938 processing_debug_stmt
= 0;
2943 /* Process deferred debug stmts. In order to give values better odds
2944 of being successfully remapped, we delay the processing of debug
2945 stmts until all other stmts that might require remapping are
2949 copy_debug_stmts (copy_body_data
*id
)
2954 if (!id
->debug_stmts
.exists ())
2957 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2958 copy_debug_stmt (stmt
, id
);
2960 id
->debug_stmts
.release ();
2963 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2964 another function. */
2967 copy_tree_body (copy_body_data
*id
)
2969 tree fndecl
= id
->src_fn
;
2970 tree body
= DECL_SAVED_TREE (fndecl
);
2972 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2977 /* Make a copy of the body of FN so that it can be inserted inline in
2978 another function. */
2981 copy_body (copy_body_data
*id
, profile_count count
,
2982 basic_block entry_block_map
, basic_block exit_block_map
,
2983 basic_block new_entry
)
2985 tree fndecl
= id
->src_fn
;
2988 /* If this body has a CFG, walk CFG and copy. */
2989 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2990 body
= copy_cfg_body (id
, count
, entry_block_map
, exit_block_map
,
2992 copy_debug_stmts (id
);
2997 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2998 defined in function FN, or of a data member thereof. */
3001 self_inlining_addr_expr (tree value
, tree fn
)
3005 if (TREE_CODE (value
) != ADDR_EXPR
)
3008 var
= get_base_address (TREE_OPERAND (value
, 0));
3010 return var
&& auto_var_in_fn_p (var
, fn
);
3013 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
3014 lexical block and line number information from base_stmt, if given,
3015 or from the last stmt of the block otherwise. */
3018 insert_init_debug_bind (copy_body_data
*id
,
3019 basic_block bb
, tree var
, tree value
,
3023 gimple_stmt_iterator gsi
;
3026 if (!gimple_in_ssa_p (id
->src_cfun
))
3029 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
3032 tracked_var
= target_for_debug_bind (var
);
3038 gsi
= gsi_last_bb (bb
);
3039 if (!base_stmt
&& !gsi_end_p (gsi
))
3040 base_stmt
= gsi_stmt (gsi
);
3043 note
= gimple_build_debug_bind (tracked_var
, unshare_expr (value
), base_stmt
);
3047 if (!gsi_end_p (gsi
))
3048 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
3050 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3057 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple
*init_stmt
)
3059 /* If VAR represents a zero-sized variable, it's possible that the
3060 assignment statement may result in no gimple statements. */
3063 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3065 /* We can end up with init statements that store to a non-register
3066 from a rhs with a conversion. Handle that here by forcing the
3067 rhs into a temporary. gimple_regimplify_operands is not
3068 prepared to do this for us. */
3069 if (!is_gimple_debug (init_stmt
)
3070 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3071 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3072 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3074 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3075 gimple_expr_type (init_stmt
),
3076 gimple_assign_rhs1 (init_stmt
));
3077 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3079 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3080 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3082 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3083 gimple_regimplify_operands (init_stmt
, &si
);
3085 if (!is_gimple_debug (init_stmt
))
3087 tree def
= gimple_assign_lhs (init_stmt
);
3088 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3093 /* Initialize parameter P with VALUE. If needed, produce init statement
3094 at the end of BB. When BB is NULL, we return init statement to be
3097 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3098 basic_block bb
, tree
*vars
)
3100 gimple
*init_stmt
= NULL
;
3103 tree def
= (gimple_in_ssa_p (cfun
)
3104 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3107 && value
!= error_mark_node
3108 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3110 /* If we can match up types by promotion/demotion do so. */
3111 if (fold_convertible_p (TREE_TYPE (p
), value
))
3112 rhs
= fold_convert (TREE_TYPE (p
), value
);
3115 /* ??? For valid programs we should not end up here.
3116 Still if we end up with truly mismatched types here, fall back
3117 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3118 GIMPLE to the following passes. */
3119 if (!is_gimple_reg_type (TREE_TYPE (value
))
3120 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
3121 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
3123 rhs
= build_zero_cst (TREE_TYPE (p
));
3127 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3128 here since the type of this decl must be visible to the calling
3130 var
= copy_decl_to_var (p
, id
);
3132 /* Declare this new variable. */
3133 DECL_CHAIN (var
) = *vars
;
3136 /* Make gimplifier happy about this variable. */
3137 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3139 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3140 we would not need to create a new variable here at all, if it
3141 weren't for debug info. Still, we can just use the argument
3143 if (TREE_READONLY (p
)
3144 && !TREE_ADDRESSABLE (p
)
3145 && value
&& !TREE_SIDE_EFFECTS (value
)
3148 /* We may produce non-gimple trees by adding NOPs or introduce
3149 invalid sharing when operand is not really constant.
3150 It is not big deal to prohibit constant propagation here as
3151 we will constant propagate in DOM1 pass anyway. */
3152 if (is_gimple_min_invariant (value
)
3153 && useless_type_conversion_p (TREE_TYPE (p
),
3155 /* We have to be very careful about ADDR_EXPR. Make sure
3156 the base variable isn't a local variable of the inlined
3157 function, e.g., when doing recursive inlining, direct or
3158 mutually-recursive or whatever, which is why we don't
3159 just test whether fn == current_function_decl. */
3160 && ! self_inlining_addr_expr (value
, fn
))
3162 insert_decl_map (id
, p
, value
);
3163 insert_debug_decl_map (id
, p
, var
);
3164 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3168 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3169 that way, when the PARM_DECL is encountered, it will be
3170 automatically replaced by the VAR_DECL. */
3171 insert_decl_map (id
, p
, var
);
3173 /* Even if P was TREE_READONLY, the new VAR should not be.
3174 In the original code, we would have constructed a
3175 temporary, and then the function body would have never
3176 changed the value of P. However, now, we will be
3177 constructing VAR directly. The constructor body may
3178 change its value multiple times as it is being
3179 constructed. Therefore, it must not be TREE_READONLY;
3180 the back-end assumes that TREE_READONLY variable is
3181 assigned to only once. */
3182 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
3183 TREE_READONLY (var
) = 0;
3185 /* If there is no setup required and we are in SSA, take the easy route
3186 replacing all SSA names representing the function parameter by the
3187 SSA name passed to function.
3189 We need to construct map for the variable anyway as it might be used
3190 in different SSA names when parameter is set in function.
3192 Do replacement at -O0 for const arguments replaced by constant.
3193 This is important for builtin_constant_p and other construct requiring
3194 constant argument to be visible in inlined function body. */
3195 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3197 || (TREE_READONLY (p
)
3198 && is_gimple_min_invariant (rhs
)))
3199 && (TREE_CODE (rhs
) == SSA_NAME
3200 || is_gimple_min_invariant (rhs
))
3201 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3203 insert_decl_map (id
, def
, rhs
);
3204 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3207 /* If the value of argument is never used, don't care about initializing
3209 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3211 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3212 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3215 /* Initialize this VAR_DECL from the equivalent argument. Convert
3216 the argument to the proper type in case it was promoted. */
3219 if (rhs
== error_mark_node
)
3221 insert_decl_map (id
, p
, var
);
3222 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3225 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3227 /* If we are in SSA form properly remap the default definition
3228 or assign to a dummy SSA name if the parameter is unused and
3229 we are not optimizing. */
3230 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3234 def
= remap_ssa_name (def
, id
);
3235 init_stmt
= gimple_build_assign (def
, rhs
);
3236 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3237 set_ssa_default_def (cfun
, var
, NULL
);
3241 def
= make_ssa_name (var
);
3242 init_stmt
= gimple_build_assign (def
, rhs
);
3246 init_stmt
= gimple_build_assign (var
, rhs
);
3248 if (bb
&& init_stmt
)
3249 insert_init_stmt (id
, bb
, init_stmt
);
3254 /* Generate code to initialize the parameters of the function at the
3255 top of the stack in ID from the GIMPLE_CALL STMT. */
3258 initialize_inlined_parameters (copy_body_data
*id
, gimple
*stmt
,
3259 tree fn
, basic_block bb
)
3264 tree vars
= NULL_TREE
;
3265 tree static_chain
= gimple_call_chain (stmt
);
3267 /* Figure out what the parameters are. */
3268 parms
= DECL_ARGUMENTS (fn
);
3270 /* Loop through the parameter declarations, replacing each with an
3271 equivalent VAR_DECL, appropriately initialized. */
3272 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3275 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3276 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3278 /* After remapping parameters remap their types. This has to be done
3279 in a second loop over all parameters to appropriately remap
3280 variable sized arrays when the size is specified in a
3281 parameter following the array. */
3282 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3284 tree
*varp
= id
->decl_map
->get (p
);
3285 if (varp
&& VAR_P (*varp
))
3287 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3288 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3290 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3291 /* Also remap the default definition if it was remapped
3292 to the default definition of the parameter replacement
3293 by the parameter setup. */
3296 tree
*defp
= id
->decl_map
->get (def
);
3298 && TREE_CODE (*defp
) == SSA_NAME
3299 && SSA_NAME_VAR (*defp
) == var
)
3300 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3305 /* Initialize the static chain. */
3306 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3307 gcc_assert (fn
!= current_function_decl
);
3310 /* No static chain? Seems like a bug in tree-nested.c. */
3311 gcc_assert (static_chain
);
3313 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3316 declare_inline_vars (id
->block
, vars
);
3320 /* Declare a return variable to replace the RESULT_DECL for the
3321 function we are calling. An appropriate DECL_STMT is returned.
3322 The USE_STMT is filled to contain a use of the declaration to
3323 indicate the return value of the function.
3325 RETURN_SLOT, if non-null is place where to store the result. It
3326 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3327 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3329 RETURN_BOUNDS holds a destination for returned bounds.
3331 The return value is a (possibly null) value that holds the result
3332 as seen by the caller. */
3335 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3336 tree return_bounds
, basic_block entry_bb
)
3338 tree callee
= id
->src_fn
;
3339 tree result
= DECL_RESULT (callee
);
3340 tree callee_type
= TREE_TYPE (result
);
3344 /* Handle type-mismatches in the function declaration return type
3345 vs. the call expression. */
3347 caller_type
= TREE_TYPE (modify_dest
);
3349 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3351 /* We don't need to do anything for functions that don't return anything. */
3352 if (VOID_TYPE_P (callee_type
))
3355 /* If there was a return slot, then the return value is the
3356 dereferenced address of that object. */
3359 /* The front end shouldn't have used both return_slot and
3360 a modify expression. */
3361 gcc_assert (!modify_dest
);
3362 if (DECL_BY_REFERENCE (result
))
3364 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3365 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3367 /* We are going to construct *&return_slot and we can't do that
3368 for variables believed to be not addressable.
3370 FIXME: This check possibly can match, because values returned
3371 via return slot optimization are not believed to have address
3372 taken by alias analysis. */
3373 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3374 var
= return_slot_addr
;
3379 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3380 if (TREE_ADDRESSABLE (result
))
3381 mark_addressable (var
);
3383 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3384 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3385 && !DECL_GIMPLE_REG_P (result
)
3387 DECL_GIMPLE_REG_P (var
) = 0;
3392 /* All types requiring non-trivial constructors should have been handled. */
3393 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3395 /* Attempt to avoid creating a new temporary variable. */
3397 && TREE_CODE (modify_dest
) != SSA_NAME
)
3399 bool use_it
= false;
3401 /* We can't use MODIFY_DEST if there's type promotion involved. */
3402 if (!useless_type_conversion_p (callee_type
, caller_type
))
3405 /* ??? If we're assigning to a variable sized type, then we must
3406 reuse the destination variable, because we've no good way to
3407 create variable sized temporaries at this point. */
3408 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3411 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3412 reuse it as the result of the call directly. Don't do this if
3413 it would promote MODIFY_DEST to addressable. */
3414 else if (TREE_ADDRESSABLE (result
))
3418 tree base_m
= get_base_address (modify_dest
);
3420 /* If the base isn't a decl, then it's a pointer, and we don't
3421 know where that's going to go. */
3422 if (!DECL_P (base_m
))
3424 else if (is_global_var (base_m
))
3426 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3427 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3428 && !DECL_GIMPLE_REG_P (result
)
3429 && DECL_GIMPLE_REG_P (base_m
))
3431 else if (!TREE_ADDRESSABLE (base_m
))
3443 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3445 var
= copy_result_decl_to_var (result
, id
);
3446 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3448 /* Do not have the rest of GCC warn about this variable as it should
3449 not be visible to the user. */
3450 TREE_NO_WARNING (var
) = 1;
3452 declare_inline_vars (id
->block
, var
);
3454 /* Build the use expr. If the return type of the function was
3455 promoted, convert it back to the expected type. */
3457 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3459 /* If we can match up types by promotion/demotion do so. */
3460 if (fold_convertible_p (caller_type
, var
))
3461 use
= fold_convert (caller_type
, var
);
3464 /* ??? For valid programs we should not end up here.
3465 Still if we end up with truly mismatched types here, fall back
3466 to using a MEM_REF to not leak invalid GIMPLE to the following
3468 /* Prevent var from being written into SSA form. */
3469 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3470 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3471 DECL_GIMPLE_REG_P (var
) = false;
3472 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3473 TREE_ADDRESSABLE (var
) = true;
3474 use
= fold_build2 (MEM_REF
, caller_type
,
3475 build_fold_addr_expr (var
),
3476 build_int_cst (ptr_type_node
, 0));
3480 STRIP_USELESS_TYPE_CONVERSION (use
);
3482 if (DECL_BY_REFERENCE (result
))
3484 TREE_ADDRESSABLE (var
) = 1;
3485 var
= build_fold_addr_expr (var
);
3489 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3490 way, when the RESULT_DECL is encountered, it will be
3491 automatically replaced by the VAR_DECL.
3493 When returning by reference, ensure that RESULT_DECL remaps to
3495 if (DECL_BY_REFERENCE (result
)
3496 && !is_gimple_val (var
))
3498 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3499 insert_decl_map (id
, result
, temp
);
3500 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3501 it's default_def SSA_NAME. */
3502 if (gimple_in_ssa_p (id
->src_cfun
)
3503 && is_gimple_reg (result
))
3505 temp
= make_ssa_name (temp
);
3506 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3508 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3511 insert_decl_map (id
, result
, var
);
3513 /* Remember this so we can ignore it in remap_decls. */
3516 /* If returned bounds are used, then make var for them. */
3519 tree bndtemp
= create_tmp_var (pointer_bounds_type_node
, "retbnd");
3520 DECL_SEEN_IN_BIND_EXPR_P (bndtemp
) = 1;
3521 TREE_NO_WARNING (bndtemp
) = 1;
3522 declare_inline_vars (id
->block
, bndtemp
);
3524 id
->retbnd
= bndtemp
;
3525 insert_init_stmt (id
, entry_bb
,
3526 gimple_build_assign (bndtemp
, chkp_get_zero_bounds_var ()));
3532 /* Determine if the function can be copied. If so return NULL. If
3533 not return a string describng the reason for failure. */
3536 copy_forbidden (struct function
*fun
)
3538 const char *reason
= fun
->cannot_be_copied_reason
;
3540 /* Only examine the function once. */
3541 if (fun
->cannot_be_copied_set
)
3544 /* We cannot copy a function that receives a non-local goto
3545 because we cannot remap the destination label used in the
3546 function that is performing the non-local goto. */
3547 /* ??? Actually, this should be possible, if we work at it.
3548 No doubt there's just a handful of places that simply
3549 assume it doesn't happen and don't substitute properly. */
3550 if (fun
->has_nonlocal_label
)
3552 reason
= G_("function %q+F can never be copied "
3553 "because it receives a non-local goto");
3557 if (fun
->has_forced_label_in_static
)
3559 reason
= G_("function %q+F can never be copied because it saves "
3560 "address of local label in a static variable");
3565 fun
->cannot_be_copied_reason
= reason
;
3566 fun
->cannot_be_copied_set
= true;
3571 static const char *inline_forbidden_reason
;
3573 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3574 iff a function can not be inlined. Also sets the reason why. */
3577 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3578 struct walk_stmt_info
*wip
)
3580 tree fn
= (tree
) wip
->info
;
3582 gimple
*stmt
= gsi_stmt (*gsi
);
3584 switch (gimple_code (stmt
))
3587 /* Refuse to inline alloca call unless user explicitly forced so as
3588 this may change program's memory overhead drastically when the
3589 function using alloca is called in loop. In GCC present in
3590 SPEC2000 inlining into schedule_block cause it to require 2GB of
3591 RAM instead of 256MB. Don't do so for alloca calls emitted for
3592 VLA objects as those can't cause unbounded growth (they're always
3593 wrapped inside stack_save/stack_restore regions. */
3594 if (gimple_maybe_alloca_call_p (stmt
)
3595 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3596 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3598 inline_forbidden_reason
3599 = G_("function %q+F can never be inlined because it uses "
3600 "alloca (override using the always_inline attribute)");
3601 *handled_ops_p
= true;
3605 t
= gimple_call_fndecl (stmt
);
3609 /* We cannot inline functions that call setjmp. */
3610 if (setjmp_call_p (t
))
3612 inline_forbidden_reason
3613 = G_("function %q+F can never be inlined because it uses setjmp");
3614 *handled_ops_p
= true;
3618 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3619 switch (DECL_FUNCTION_CODE (t
))
3621 /* We cannot inline functions that take a variable number of
3623 case BUILT_IN_VA_START
:
3624 case BUILT_IN_NEXT_ARG
:
3625 case BUILT_IN_VA_END
:
3626 inline_forbidden_reason
3627 = G_("function %q+F can never be inlined because it "
3628 "uses variable argument lists");
3629 *handled_ops_p
= true;
3632 case BUILT_IN_LONGJMP
:
3633 /* We can't inline functions that call __builtin_longjmp at
3634 all. The non-local goto machinery really requires the
3635 destination be in a different function. If we allow the
3636 function calling __builtin_longjmp to be inlined into the
3637 function calling __builtin_setjmp, Things will Go Awry. */
3638 inline_forbidden_reason
3639 = G_("function %q+F can never be inlined because "
3640 "it uses setjmp-longjmp exception handling");
3641 *handled_ops_p
= true;
3644 case BUILT_IN_NONLOCAL_GOTO
:
3646 inline_forbidden_reason
3647 = G_("function %q+F can never be inlined because "
3648 "it uses non-local goto");
3649 *handled_ops_p
= true;
3652 case BUILT_IN_RETURN
:
3653 case BUILT_IN_APPLY_ARGS
:
3654 /* If a __builtin_apply_args caller would be inlined,
3655 it would be saving arguments of the function it has
3656 been inlined into. Similarly __builtin_return would
3657 return from the function the inline has been inlined into. */
3658 inline_forbidden_reason
3659 = G_("function %q+F can never be inlined because "
3660 "it uses __builtin_return or __builtin_apply_args");
3661 *handled_ops_p
= true;
3670 t
= gimple_goto_dest (stmt
);
3672 /* We will not inline a function which uses computed goto. The
3673 addresses of its local labels, which may be tucked into
3674 global storage, are of course not constant across
3675 instantiations, which causes unexpected behavior. */
3676 if (TREE_CODE (t
) != LABEL_DECL
)
3678 inline_forbidden_reason
3679 = G_("function %q+F can never be inlined "
3680 "because it contains a computed goto");
3681 *handled_ops_p
= true;
3690 *handled_ops_p
= false;
3694 /* Return true if FNDECL is a function that cannot be inlined into
3698 inline_forbidden_p (tree fndecl
)
3700 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3701 struct walk_stmt_info wi
;
3703 bool forbidden_p
= false;
3705 /* First check for shared reasons not to copy the code. */
3706 inline_forbidden_reason
= copy_forbidden (fun
);
3707 if (inline_forbidden_reason
!= NULL
)
3710 /* Next, walk the statements of the function looking for
3711 constraucts we can't handle, or are non-optimal for inlining. */
3712 hash_set
<tree
> visited_nodes
;
3713 memset (&wi
, 0, sizeof (wi
));
3714 wi
.info
= (void *) fndecl
;
3715 wi
.pset
= &visited_nodes
;
3717 FOR_EACH_BB_FN (bb
, fun
)
3720 gimple_seq seq
= bb_seq (bb
);
3721 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3722 forbidden_p
= (ret
!= NULL
);
3730 /* Return false if the function FNDECL cannot be inlined on account of its
3731 attributes, true otherwise. */
3733 function_attribute_inlinable_p (const_tree fndecl
)
3735 if (targetm
.attribute_table
)
3739 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3741 const_tree name
= TREE_PURPOSE (a
);
3744 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3745 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3746 return targetm
.function_attribute_inlinable_p (fndecl
);
3753 /* Returns nonzero if FN is a function that does not have any
3754 fundamental inline blocking properties. */
3757 tree_inlinable_function_p (tree fn
)
3759 bool inlinable
= true;
3763 /* If we've already decided this function shouldn't be inlined,
3764 there's no need to check again. */
3765 if (DECL_UNINLINABLE (fn
))
3768 /* We only warn for functions declared `inline' by the user. */
3769 do_warning
= (warn_inline
3770 && DECL_DECLARED_INLINE_P (fn
)
3771 && !DECL_NO_INLINE_WARNING_P (fn
)
3772 && !DECL_IN_SYSTEM_HEADER (fn
));
3774 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3777 && always_inline
== NULL
)
3780 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3781 "is suppressed using -fno-inline", fn
);
3785 else if (!function_attribute_inlinable_p (fn
))
3788 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3789 "uses attributes conflicting with inlining", fn
);
3793 else if (inline_forbidden_p (fn
))
3795 /* See if we should warn about uninlinable functions. Previously,
3796 some of these warnings would be issued while trying to expand
3797 the function inline, but that would cause multiple warnings
3798 about functions that would for example call alloca. But since
3799 this a property of the function, just one warning is enough.
3800 As a bonus we can now give more details about the reason why a
3801 function is not inlinable. */
3803 error (inline_forbidden_reason
, fn
);
3804 else if (do_warning
)
3805 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3810 /* Squirrel away the result so that we don't have to check again. */
3811 DECL_UNINLINABLE (fn
) = !inlinable
;
3816 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
3817 word size and take possible memcpy call into account and return
3818 cost based on whether optimizing for size or speed according to SPEED_P. */
3821 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
3825 gcc_assert (!VOID_TYPE_P (type
));
3827 if (TREE_CODE (type
) == VECTOR_TYPE
)
3829 scalar_mode inner
= SCALAR_TYPE_MODE (TREE_TYPE (type
));
3831 = targetm
.vectorize
.preferred_simd_mode (inner
);
3832 int simd_mode_size
= GET_MODE_SIZE (simd
);
3833 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3837 size
= int_size_in_bytes (type
);
3839 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
3840 /* Cost of a memcpy call, 3 arguments and the call. */
3843 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3846 /* Returns cost of operation CODE, according to WEIGHTS */
3849 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3850 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3854 /* These are "free" conversions, or their presumed cost
3855 is folded into other operations. */
3860 case VIEW_CONVERT_EXPR
:
3863 /* Assign cost of 1 to usual operations.
3864 ??? We may consider mapping RTL costs to this. */
3870 case POINTER_PLUS_EXPR
:
3873 case MULT_HIGHPART_EXPR
:
3876 case ADDR_SPACE_CONVERT_EXPR
:
3877 case FIXED_CONVERT_EXPR
:
3878 case FIX_TRUNC_EXPR
:
3896 case TRUTH_ANDIF_EXPR
:
3897 case TRUTH_ORIF_EXPR
:
3898 case TRUTH_AND_EXPR
:
3900 case TRUTH_XOR_EXPR
:
3901 case TRUTH_NOT_EXPR
:
3910 case UNORDERED_EXPR
:
3921 case PREDECREMENT_EXPR
:
3922 case PREINCREMENT_EXPR
:
3923 case POSTDECREMENT_EXPR
:
3924 case POSTINCREMENT_EXPR
:
3926 case REALIGN_LOAD_EXPR
:
3928 case REDUC_MAX_EXPR
:
3929 case REDUC_MIN_EXPR
:
3930 case REDUC_PLUS_EXPR
:
3931 case WIDEN_SUM_EXPR
:
3932 case WIDEN_MULT_EXPR
:
3935 case WIDEN_MULT_PLUS_EXPR
:
3936 case WIDEN_MULT_MINUS_EXPR
:
3937 case WIDEN_LSHIFT_EXPR
:
3939 case VEC_WIDEN_MULT_HI_EXPR
:
3940 case VEC_WIDEN_MULT_LO_EXPR
:
3941 case VEC_WIDEN_MULT_EVEN_EXPR
:
3942 case VEC_WIDEN_MULT_ODD_EXPR
:
3943 case VEC_UNPACK_HI_EXPR
:
3944 case VEC_UNPACK_LO_EXPR
:
3945 case VEC_UNPACK_FLOAT_HI_EXPR
:
3946 case VEC_UNPACK_FLOAT_LO_EXPR
:
3947 case VEC_PACK_TRUNC_EXPR
:
3948 case VEC_PACK_SAT_EXPR
:
3949 case VEC_PACK_FIX_TRUNC_EXPR
:
3950 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3951 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3955 /* Few special cases of expensive operations. This is useful
3956 to avoid inlining on functions having too many of these. */
3957 case TRUNC_DIV_EXPR
:
3959 case FLOOR_DIV_EXPR
:
3960 case ROUND_DIV_EXPR
:
3961 case EXACT_DIV_EXPR
:
3962 case TRUNC_MOD_EXPR
:
3964 case FLOOR_MOD_EXPR
:
3965 case ROUND_MOD_EXPR
:
3967 if (TREE_CODE (op2
) != INTEGER_CST
)
3968 return weights
->div_mod_cost
;
3971 /* Bit-field insertion needs several shift and mask operations. */
3972 case BIT_INSERT_EXPR
:
3976 /* We expect a copy assignment with no operator. */
3977 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3983 /* Estimate number of instructions that will be created by expanding
3984 the statements in the statement sequence STMTS.
3985 WEIGHTS contains weights attributed to various constructs. */
3988 estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3991 gimple_stmt_iterator gsi
;
3994 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3995 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4001 /* Estimate number of instructions that will be created by expanding STMT.
4002 WEIGHTS contains weights attributed to various constructs. */
4005 estimate_num_insns (gimple
*stmt
, eni_weights
*weights
)
4008 enum gimple_code code
= gimple_code (stmt
);
4015 /* Try to estimate the cost of assignments. We have three cases to
4017 1) Simple assignments to registers;
4018 2) Stores to things that must live in memory. This includes
4019 "normal" stores to scalars, but also assignments of large
4020 structures, or constructors of big arrays;
4022 Let us look at the first two cases, assuming we have "a = b + C":
4023 <GIMPLE_ASSIGN <var_decl "a">
4024 <plus_expr <var_decl "b"> <constant C>>
4025 If "a" is a GIMPLE register, the assignment to it is free on almost
4026 any target, because "a" usually ends up in a real register. Hence
4027 the only cost of this expression comes from the PLUS_EXPR, and we
4028 can ignore the GIMPLE_ASSIGN.
4029 If "a" is not a GIMPLE register, the assignment to "a" will most
4030 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4031 of moving something into "a", which we compute using the function
4032 estimate_move_cost. */
4033 if (gimple_clobber_p (stmt
))
4034 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4036 lhs
= gimple_assign_lhs (stmt
);
4037 rhs
= gimple_assign_rhs1 (stmt
);
4041 /* Account for the cost of moving to / from memory. */
4042 if (gimple_store_p (stmt
))
4043 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
4044 if (gimple_assign_load_p (stmt
))
4045 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
4047 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
4048 gimple_assign_rhs1 (stmt
),
4049 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
4050 == GIMPLE_BINARY_RHS
4051 ? gimple_assign_rhs2 (stmt
) : NULL
);
4055 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4056 gimple_op (stmt
, 0),
4057 gimple_op (stmt
, 1));
4062 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4063 /* Take into account cost of the switch + guess 2 conditional jumps for
4066 TODO: once the switch expansion logic is sufficiently separated, we can
4067 do better job on estimating cost of the switch. */
4068 if (weights
->time_based
)
4069 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4071 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4079 if (gimple_call_internal_p (stmt
))
4081 else if ((decl
= gimple_call_fndecl (stmt
))
4082 && DECL_BUILT_IN (decl
))
4084 /* Do not special case builtins where we see the body.
4085 This just confuse inliner. */
4086 struct cgraph_node
*node
;
4087 if (!(node
= cgraph_node::get (decl
))
4088 || node
->definition
)
4090 /* For buitins that are likely expanded to nothing or
4091 inlined do not account operand costs. */
4092 else if (is_simple_builtin (decl
))
4094 else if (is_inexpensive_builtin (decl
))
4095 return weights
->target_builtin_call_cost
;
4096 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
4098 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4099 specialize the cheap expansion we do here.
4100 ??? This asks for a more general solution. */
4101 switch (DECL_FUNCTION_CODE (decl
))
4106 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4108 (&TREE_REAL_CST (gimple_call_arg (stmt
, 1)),
4110 return estimate_operator_cost
4111 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4112 gimple_call_arg (stmt
, 0));
4121 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4122 if (gimple_call_lhs (stmt
))
4123 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4124 weights
->time_based
);
4125 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4127 tree arg
= gimple_call_arg (stmt
, i
);
4128 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4129 weights
->time_based
);
4135 return weights
->return_cost
;
4141 case GIMPLE_PREDICT
:
4147 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4148 /* 1000 means infinity. This avoids overflows later
4149 with very long asm statements. */
4156 /* This is either going to be an external function call with one
4157 argument, or two register copy statements plus a goto. */
4160 case GIMPLE_EH_DISPATCH
:
4161 /* ??? This is going to turn into a switch statement. Ideally
4162 we'd have a look at the eh region and estimate the number of
4167 return estimate_num_insns_seq (
4168 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4171 case GIMPLE_EH_FILTER
:
4172 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4175 return estimate_num_insns_seq (gimple_catch_handler (
4176 as_a
<gcatch
*> (stmt
)),
4180 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4181 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4183 /* OMP directives are generally very expensive. */
4185 case GIMPLE_OMP_RETURN
:
4186 case GIMPLE_OMP_SECTIONS_SWITCH
:
4187 case GIMPLE_OMP_ATOMIC_STORE
:
4188 case GIMPLE_OMP_CONTINUE
:
4189 /* ...except these, which are cheap. */
4192 case GIMPLE_OMP_ATOMIC_LOAD
:
4193 return weights
->omp_cost
;
4195 case GIMPLE_OMP_FOR
:
4196 return (weights
->omp_cost
4197 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4198 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4200 case GIMPLE_OMP_PARALLEL
:
4201 case GIMPLE_OMP_TASK
:
4202 case GIMPLE_OMP_CRITICAL
:
4203 case GIMPLE_OMP_MASTER
:
4204 case GIMPLE_OMP_TASKGROUP
:
4205 case GIMPLE_OMP_ORDERED
:
4206 case GIMPLE_OMP_SECTION
:
4207 case GIMPLE_OMP_SECTIONS
:
4208 case GIMPLE_OMP_SINGLE
:
4209 case GIMPLE_OMP_TARGET
:
4210 case GIMPLE_OMP_TEAMS
:
4211 return (weights
->omp_cost
4212 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4214 case GIMPLE_TRANSACTION
:
4215 return (weights
->tm_cost
4216 + estimate_num_insns_seq (gimple_transaction_body (
4217 as_a
<gtransaction
*> (stmt
)),
4227 /* Estimate number of instructions that will be created by expanding
4228 function FNDECL. WEIGHTS contains weights attributed to various
4232 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4234 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4235 gimple_stmt_iterator bsi
;
4239 gcc_assert (my_function
&& my_function
->cfg
);
4240 FOR_EACH_BB_FN (bb
, my_function
)
4242 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4243 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4250 /* Initializes weights used by estimate_num_insns. */
4253 init_inline_once (void)
4255 eni_size_weights
.call_cost
= 1;
4256 eni_size_weights
.indirect_call_cost
= 3;
4257 eni_size_weights
.target_builtin_call_cost
= 1;
4258 eni_size_weights
.div_mod_cost
= 1;
4259 eni_size_weights
.omp_cost
= 40;
4260 eni_size_weights
.tm_cost
= 10;
4261 eni_size_weights
.time_based
= false;
4262 eni_size_weights
.return_cost
= 1;
4264 /* Estimating time for call is difficult, since we have no idea what the
4265 called function does. In the current uses of eni_time_weights,
4266 underestimating the cost does less harm than overestimating it, so
4267 we choose a rather small value here. */
4268 eni_time_weights
.call_cost
= 10;
4269 eni_time_weights
.indirect_call_cost
= 15;
4270 eni_time_weights
.target_builtin_call_cost
= 1;
4271 eni_time_weights
.div_mod_cost
= 10;
4272 eni_time_weights
.omp_cost
= 40;
4273 eni_time_weights
.tm_cost
= 40;
4274 eni_time_weights
.time_based
= true;
4275 eni_time_weights
.return_cost
= 2;
4279 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4282 prepend_lexical_block (tree current_block
, tree new_block
)
4284 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4285 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4286 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4289 /* Add local variables from CALLEE to CALLER. */
4292 add_local_variables (struct function
*callee
, struct function
*caller
,
4298 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4299 if (!can_be_nonlocal (var
, id
))
4301 tree new_var
= remap_decl (var
, id
);
4303 /* Remap debug-expressions. */
4305 && DECL_HAS_DEBUG_EXPR_P (var
)
4308 tree tem
= DECL_DEBUG_EXPR (var
);
4309 bool old_regimplify
= id
->regimplify
;
4310 id
->remapping_type_depth
++;
4311 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4312 id
->remapping_type_depth
--;
4313 id
->regimplify
= old_regimplify
;
4314 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4315 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4317 add_local_decl (caller
, new_var
);
4321 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4322 have brought in or introduced any debug stmts for SRCVAR. */
4325 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4327 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4332 if (!VAR_P (*remappedvarp
))
4335 if (*remappedvarp
== id
->retvar
|| *remappedvarp
== id
->retbnd
)
4338 tree tvar
= target_for_debug_bind (*remappedvarp
);
4342 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4344 gimple_seq_add_stmt (bindings
, stmt
);
4347 /* For each inlined variable for which we may have debug bind stmts,
4348 add before GSI a final debug stmt resetting it, marking the end of
4349 its life, so that var-tracking knows it doesn't have to compute
4350 further locations for it. */
4353 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4357 gimple_seq bindings
= NULL
;
4359 if (!gimple_in_ssa_p (id
->src_cfun
))
4362 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4365 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4366 var
; var
= DECL_CHAIN (var
))
4367 reset_debug_binding (id
, var
, &bindings
);
4369 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4370 reset_debug_binding (id
, var
, &bindings
);
4372 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4375 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4378 expand_call_inline (basic_block bb
, gimple
*stmt
, copy_body_data
*id
)
4382 hash_map
<tree
, tree
> *dst
;
4383 hash_map
<tree
, tree
> *st
= NULL
;
4386 tree return_bounds
= NULL
;
4387 struct cgraph_edge
*cg_edge
;
4388 cgraph_inline_failed_t reason
;
4389 basic_block return_block
;
4391 gimple_stmt_iterator gsi
, stmt_gsi
;
4392 bool successfully_inlined
= false;
4393 bool purge_dead_abnormal_edges
;
4396 unsigned int prop_mask
, src_properties
;
4397 struct function
*dst_cfun
;
4400 gimple
*simtenter_stmt
= NULL
;
4401 vec
<tree
> *simtvars_save
;
4403 /* The gimplifier uses input_location in too many places, such as
4404 internal_get_tmp_var (). */
4405 location_t saved_location
= input_location
;
4406 input_location
= gimple_location (stmt
);
4408 /* From here on, we're only interested in CALL_EXPRs. */
4409 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4413 cg_edge
= id
->dst_node
->get_edge (stmt
);
4414 gcc_checking_assert (cg_edge
);
4415 /* First, see if we can figure out what function is being called.
4416 If we cannot, then there is no hope of inlining the function. */
4417 if (cg_edge
->indirect_unknown_callee
)
4419 fn
= cg_edge
->callee
->decl
;
4420 gcc_checking_assert (fn
);
4422 /* If FN is a declaration of a function in a nested scope that was
4423 globally declared inline, we don't set its DECL_INITIAL.
4424 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4425 C++ front-end uses it for cdtors to refer to their internal
4426 declarations, that are not real functions. Fortunately those
4427 don't have trees to be saved, so we can tell by checking their
4429 if (!DECL_INITIAL (fn
)
4430 && DECL_ABSTRACT_ORIGIN (fn
)
4431 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4432 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4434 /* Don't try to inline functions that are not well-suited to inlining. */
4435 if (cg_edge
->inline_failed
)
4437 reason
= cg_edge
->inline_failed
;
4438 /* If this call was originally indirect, we do not want to emit any
4439 inlining related warnings or sorry messages because there are no
4440 guarantees regarding those. */
4441 if (cg_edge
->indirect_inlining_edge
)
4444 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4445 /* For extern inline functions that get redefined we always
4446 silently ignored always_inline flag. Better behavior would
4447 be to be able to keep both bodies and use extern inline body
4448 for inlining, but we can't do that because frontends overwrite
4450 && !cg_edge
->callee
->local
.redefined_extern_inline
4451 /* During early inline pass, report only when optimization is
4453 && (symtab
->global_info_ready
4455 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4456 /* PR 20090218-1_0.c. Body can be provided by another module. */
4457 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4459 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4460 cgraph_inline_failed_string (reason
));
4461 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4462 inform (gimple_location (stmt
), "called from here");
4463 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4464 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4465 "called from this function");
4467 else if (warn_inline
4468 && DECL_DECLARED_INLINE_P (fn
)
4469 && !DECL_NO_INLINE_WARNING_P (fn
)
4470 && !DECL_IN_SYSTEM_HEADER (fn
)
4471 && reason
!= CIF_UNSPECIFIED
4472 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4473 /* Do not warn about not inlined recursive calls. */
4474 && !cg_edge
->recursive_p ()
4475 /* Avoid warnings during early inline pass. */
4476 && symtab
->global_info_ready
)
4478 if (warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4479 fn
, _(cgraph_inline_failed_string (reason
))))
4481 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4482 inform (gimple_location (stmt
), "called from here");
4483 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4484 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4485 "called from this function");
4490 id
->src_node
= cg_edge
->callee
;
4492 /* If callee is thunk, all we need is to adjust the THIS pointer
4493 and redirect to function being thunked. */
4494 if (id
->src_node
->thunk
.thunk_p
)
4497 tree virtual_offset
= NULL
;
4498 int freq
= cg_edge
->frequency
;
4499 profile_count count
= cg_edge
->count
;
4501 gimple_stmt_iterator iter
= gsi_for_stmt (stmt
);
4504 edge
= id
->src_node
->callees
->clone (id
->dst_node
, call_stmt
,
4506 profile_count::one (),
4507 profile_count::one (),
4510 edge
->frequency
= freq
;
4511 edge
->count
= count
;
4512 if (id
->src_node
->thunk
.virtual_offset_p
)
4513 virtual_offset
= size_int (id
->src_node
->thunk
.virtual_value
);
4514 op
= create_tmp_reg_fn (cfun
, TREE_TYPE (gimple_call_arg (stmt
, 0)),
4516 gsi_insert_before (&iter
, gimple_build_assign (op
,
4517 gimple_call_arg (stmt
, 0)),
4519 gcc_assert (id
->src_node
->thunk
.this_adjusting
);
4520 op
= thunk_adjust (&iter
, op
, 1, id
->src_node
->thunk
.fixed_offset
,
4523 gimple_call_set_arg (stmt
, 0, op
);
4524 gimple_call_set_fndecl (stmt
, edge
->callee
->decl
);
4526 id
->src_node
->remove ();
4527 expand_call_inline (bb
, stmt
, id
);
4528 maybe_remove_unused_call_args (cfun
, stmt
);
4531 fn
= cg_edge
->callee
->decl
;
4532 cg_edge
->callee
->get_untransformed_body ();
4534 if (flag_checking
&& cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4535 cg_edge
->callee
->verify ();
4537 /* We will be inlining this callee. */
4538 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4539 id
->assign_stmts
.create (0);
4541 /* Update the callers EH personality. */
4542 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4543 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4544 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4546 /* Split the block before the GIMPLE_CALL. */
4547 stmt_gsi
= gsi_for_stmt (stmt
);
4548 gsi_prev (&stmt_gsi
);
4549 e
= split_block (bb
, gsi_end_p (stmt_gsi
) ? NULL
: gsi_stmt (stmt_gsi
));
4551 return_block
= e
->dest
;
4554 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4555 been the source of abnormal edges. In this case, schedule
4556 the removal of dead abnormal edges. */
4557 gsi
= gsi_start_bb (return_block
);
4559 purge_dead_abnormal_edges
= gsi_end_p (gsi
);
4561 stmt_gsi
= gsi_start_bb (return_block
);
4563 /* Build a block containing code to initialize the arguments, the
4564 actual inline expansion of the body, and a label for the return
4565 statements within the function to jump to. The type of the
4566 statement expression is the return type of the function call.
4567 ??? If the call does not have an associated block then we will
4568 remap all callee blocks to NULL, effectively dropping most of
4569 its debug information. This should only happen for calls to
4570 artificial decls inserted by the compiler itself. We need to
4571 either link the inlined blocks into the caller block tree or
4572 not refer to them in any way to not break GC for locations. */
4573 if (gimple_block (stmt
))
4575 id
->block
= make_node (BLOCK
);
4576 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4577 BLOCK_SOURCE_LOCATION (id
->block
)
4578 = LOCATION_LOCUS (gimple_location (stmt
));
4579 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4582 /* Local declarations will be replaced by their equivalents in this
4585 id
->decl_map
= new hash_map
<tree
, tree
>;
4586 dst
= id
->debug_map
;
4587 id
->debug_map
= NULL
;
4589 /* Record the function we are about to inline. */
4591 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4592 id
->call_stmt
= call_stmt
;
4594 /* When inlining into an OpenMP SIMD-on-SIMT loop, arrange for new automatic
4595 variables to be added to IFN_GOMP_SIMT_ENTER argument list. */
4596 dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4597 simtvars_save
= id
->dst_simt_vars
;
4598 if (!(dst_cfun
->curr_properties
& PROP_gimple_lomp_dev
)
4599 && (simduid
= bb
->loop_father
->simduid
) != NULL_TREE
4600 && (simduid
= ssa_default_def (dst_cfun
, simduid
)) != NULL_TREE
4601 && single_imm_use (simduid
, &use
, &simtenter_stmt
)
4602 && is_gimple_call (simtenter_stmt
)
4603 && gimple_call_internal_p (simtenter_stmt
, IFN_GOMP_SIMT_ENTER
))
4604 vec_alloc (id
->dst_simt_vars
, 0);
4606 id
->dst_simt_vars
= NULL
;
4608 if (profile_status_for_fn (id
->src_cfun
) == PROFILE_ABSENT
)
4609 profile_status_for_fn (dst_cfun
) = PROFILE_ABSENT
;
4611 /* If the src function contains an IFN_VA_ARG, then so will the dst
4612 function after inlining. Likewise for IFN_GOMP_USE_SIMT. */
4613 prop_mask
= PROP_gimple_lva
| PROP_gimple_lomp_dev
;
4614 src_properties
= id
->src_cfun
->curr_properties
& prop_mask
;
4615 if (src_properties
!= prop_mask
)
4616 dst_cfun
->curr_properties
&= src_properties
| ~prop_mask
;
4618 gcc_assert (!id
->src_cfun
->after_inlining
);
4621 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4623 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4624 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4628 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4630 if (DECL_INITIAL (fn
))
4632 if (gimple_block (stmt
))
4636 prepend_lexical_block (id
->block
,
4637 remap_blocks (DECL_INITIAL (fn
), id
));
4638 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4639 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4641 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4642 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4643 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4644 under it. The parameters can be then evaluated in the debugger,
4645 but don't show in backtraces. */
4646 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4647 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4650 *var
= TREE_CHAIN (v
);
4651 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4652 BLOCK_VARS (id
->block
) = v
;
4655 var
= &TREE_CHAIN (*var
);
4658 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4661 /* Return statements in the function body will be replaced by jumps
4662 to the RET_LABEL. */
4663 gcc_assert (DECL_INITIAL (fn
));
4664 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4666 /* Find the LHS to which the result of this call is assigned. */
4668 if (gimple_call_lhs (stmt
))
4670 modify_dest
= gimple_call_lhs (stmt
);
4672 /* Remember where to copy returned bounds. */
4673 if (gimple_call_with_bounds_p (stmt
)
4674 && TREE_CODE (modify_dest
) == SSA_NAME
)
4676 gcall
*retbnd
= chkp_retbnd_call_by_val (modify_dest
);
4679 return_bounds
= gimple_call_lhs (retbnd
);
4680 /* If returned bounds are not used then just
4681 remove unused call. */
4684 gimple_stmt_iterator iter
= gsi_for_stmt (retbnd
);
4685 gsi_remove (&iter
, true);
4690 /* The function which we are inlining might not return a value,
4691 in which case we should issue a warning that the function
4692 does not return a value. In that case the optimizers will
4693 see that the variable to which the value is assigned was not
4694 initialized. We do not want to issue a warning about that
4695 uninitialized variable. */
4696 if (DECL_P (modify_dest
))
4697 TREE_NO_WARNING (modify_dest
) = 1;
4699 if (gimple_call_return_slot_opt_p (call_stmt
))
4701 return_slot
= modify_dest
;
4708 /* If we are inlining a call to the C++ operator new, we don't want
4709 to use type based alias analysis on the return value. Otherwise
4710 we may get confused if the compiler sees that the inlined new
4711 function returns a pointer which was just deleted. See bug
4713 if (DECL_IS_OPERATOR_NEW (fn
))
4719 /* Declare the return variable for the function. */
4720 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
,
4723 /* Add local vars in this inlined callee to caller. */
4724 add_local_variables (id
->src_cfun
, cfun
, id
);
4726 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4728 fprintf (dump_file
, "Inlining ");
4729 print_generic_expr (dump_file
, id
->src_fn
);
4730 fprintf (dump_file
, " to ");
4731 print_generic_expr (dump_file
, id
->dst_fn
);
4732 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4735 /* This is it. Duplicate the callee body. Assume callee is
4736 pre-gimplified. Note that we must not alter the caller
4737 function in any way before this point, as this CALL_EXPR may be
4738 a self-referential call; if we're calling ourselves, we need to
4739 duplicate our body before altering anything. */
4740 copy_body (id
, cg_edge
->callee
->count
,
4741 bb
, return_block
, NULL
);
4743 reset_debug_bindings (id
, stmt_gsi
);
4745 if (flag_stack_reuse
!= SR_NONE
)
4746 for (tree p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
4747 if (!TREE_THIS_VOLATILE (p
))
4749 tree
*varp
= id
->decl_map
->get (p
);
4750 if (varp
&& VAR_P (*varp
) && !is_gimple_reg (*varp
))
4752 tree clobber
= build_constructor (TREE_TYPE (*varp
), NULL
);
4753 gimple
*clobber_stmt
;
4754 TREE_THIS_VOLATILE (clobber
) = 1;
4755 clobber_stmt
= gimple_build_assign (*varp
, clobber
);
4756 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
4757 gsi_insert_before (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
4761 /* Reset the escaped solution. */
4762 if (cfun
->gimple_df
)
4763 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4765 /* Add new automatic variables to IFN_GOMP_SIMT_ENTER arguments. */
4766 if (id
->dst_simt_vars
&& id
->dst_simt_vars
->length () > 0)
4768 size_t nargs
= gimple_call_num_args (simtenter_stmt
);
4769 vec
<tree
> *vars
= id
->dst_simt_vars
;
4770 auto_vec
<tree
> newargs (nargs
+ vars
->length ());
4771 for (size_t i
= 0; i
< nargs
; i
++)
4772 newargs
.quick_push (gimple_call_arg (simtenter_stmt
, i
));
4773 for (tree
*pvar
= vars
->begin (); pvar
!= vars
->end (); pvar
++)
4775 tree ptrtype
= build_pointer_type (TREE_TYPE (*pvar
));
4776 newargs
.quick_push (build1 (ADDR_EXPR
, ptrtype
, *pvar
));
4778 gcall
*g
= gimple_build_call_internal_vec (IFN_GOMP_SIMT_ENTER
, newargs
);
4779 gimple_call_set_lhs (g
, gimple_call_lhs (simtenter_stmt
));
4780 gimple_stmt_iterator gsi
= gsi_for_stmt (simtenter_stmt
);
4781 gsi_replace (&gsi
, g
, false);
4783 vec_free (id
->dst_simt_vars
);
4784 id
->dst_simt_vars
= simtvars_save
;
4789 delete id
->debug_map
;
4790 id
->debug_map
= dst
;
4792 delete id
->decl_map
;
4795 /* Unlink the calls virtual operands before replacing it. */
4796 unlink_stmt_vdef (stmt
);
4797 if (gimple_vdef (stmt
)
4798 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4799 release_ssa_name (gimple_vdef (stmt
));
4801 /* If the inlined function returns a result that we care about,
4802 substitute the GIMPLE_CALL with an assignment of the return
4803 variable to the LHS of the call. That is, if STMT was
4804 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4805 if (use_retvar
&& gimple_call_lhs (stmt
))
4807 gimple
*old_stmt
= stmt
;
4808 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4809 gsi_replace (&stmt_gsi
, stmt
, false);
4810 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4811 /* Append a clobber for id->retvar if easily possible. */
4812 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
)
4819 && !stmt_ends_bb_p (stmt
))
4821 tree clobber
= build_constructor (TREE_TYPE (id
->retvar
), NULL
);
4822 gimple
*clobber_stmt
;
4823 TREE_THIS_VOLATILE (clobber
) = 1;
4824 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
4825 gimple_set_location (clobber_stmt
, gimple_location (old_stmt
));
4826 gsi_insert_after (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
4829 /* Copy bounds if we copy structure with bounds. */
4830 if (chkp_function_instrumented_p (id
->dst_fn
)
4831 && !BOUNDED_P (use_retvar
)
4832 && chkp_type_has_pointer (TREE_TYPE (use_retvar
)))
4833 id
->assign_stmts
.safe_push (stmt
);
4837 /* Handle the case of inlining a function with no return
4838 statement, which causes the return value to become undefined. */
4839 if (gimple_call_lhs (stmt
)
4840 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4842 tree name
= gimple_call_lhs (stmt
);
4843 tree var
= SSA_NAME_VAR (name
);
4844 tree def
= var
? ssa_default_def (cfun
, var
) : NULL
;
4848 /* If the variable is used undefined, make this name
4849 undefined via a move. */
4850 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4851 gsi_replace (&stmt_gsi
, stmt
, true);
4857 var
= create_tmp_reg_fn (cfun
, TREE_TYPE (name
), NULL
);
4858 SET_SSA_NAME_VAR_OR_IDENTIFIER (name
, var
);
4860 /* Otherwise make this variable undefined. */
4861 gsi_remove (&stmt_gsi
, true);
4862 set_ssa_default_def (cfun
, var
, name
);
4863 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4866 /* Replace with a clobber for id->retvar. */
4867 else if (flag_stack_reuse
!= SR_NONE
4869 && VAR_P (id
->retvar
)
4870 && id
->retvar
!= return_slot
4871 && id
->retvar
!= modify_dest
4872 && !TREE_THIS_VOLATILE (id
->retvar
)
4873 && !is_gimple_reg (id
->retvar
))
4875 tree clobber
= build_constructor (TREE_TYPE (id
->retvar
), NULL
);
4876 gimple
*clobber_stmt
;
4877 TREE_THIS_VOLATILE (clobber
) = 1;
4878 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
4879 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
4880 gsi_replace (&stmt_gsi
, clobber_stmt
, false);
4881 maybe_clean_or_replace_eh_stmt (stmt
, clobber_stmt
);
4884 gsi_remove (&stmt_gsi
, true);
4887 /* Put returned bounds into the correct place if required. */
4890 gimple
*old_stmt
= SSA_NAME_DEF_STMT (return_bounds
);
4891 gimple
*new_stmt
= gimple_build_assign (return_bounds
, id
->retbnd
);
4892 gimple_stmt_iterator bnd_gsi
= gsi_for_stmt (old_stmt
);
4893 unlink_stmt_vdef (old_stmt
);
4894 gsi_replace (&bnd_gsi
, new_stmt
, false);
4895 maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
);
4896 cgraph_update_edges_for_call_stmt (old_stmt
,
4897 gimple_call_fndecl (old_stmt
),
4901 if (purge_dead_abnormal_edges
)
4903 gimple_purge_dead_eh_edges (return_block
);
4904 gimple_purge_dead_abnormal_call_edges (return_block
);
4907 /* If the value of the new expression is ignored, that's OK. We
4908 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4909 the equivalent inlined version either. */
4910 if (is_gimple_assign (stmt
))
4912 gcc_assert (gimple_assign_single_p (stmt
)
4913 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4914 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4917 /* Copy bounds for all generated assigns that need it. */
4918 for (i
= 0; i
< id
->assign_stmts
.length (); i
++)
4919 chkp_copy_bounds_for_assign (id
->assign_stmts
[i
], cg_edge
);
4920 id
->assign_stmts
.release ();
4922 /* Output the inlining info for this abstract function, since it has been
4923 inlined. If we don't do this now, we can lose the information about the
4924 variables in the function when the blocks get blown away as soon as we
4925 remove the cgraph node. */
4926 if (gimple_block (stmt
))
4927 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4929 /* Update callgraph if needed. */
4930 cg_edge
->callee
->remove ();
4932 id
->block
= NULL_TREE
;
4933 id
->retvar
= NULL_TREE
;
4934 id
->retbnd
= NULL_TREE
;
4935 successfully_inlined
= true;
4938 input_location
= saved_location
;
4939 return successfully_inlined
;
4942 /* Expand call statements reachable from STMT_P.
4943 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4944 in a MODIFY_EXPR. */
4947 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4949 gimple_stmt_iterator gsi
;
4950 bool inlined
= false;
4952 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
4954 gimple
*stmt
= gsi_stmt (gsi
);
4957 if (is_gimple_call (stmt
)
4958 && !gimple_call_internal_p (stmt
))
4959 inlined
|= expand_call_inline (bb
, stmt
, id
);
4966 /* Walk all basic blocks created after FIRST and try to fold every statement
4967 in the STATEMENTS pointer set. */
4970 fold_marked_statements (int first
, hash_set
<gimple
*> *statements
)
4972 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4973 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4975 gimple_stmt_iterator gsi
;
4977 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4980 if (statements
->contains (gsi_stmt (gsi
)))
4982 gimple
*old_stmt
= gsi_stmt (gsi
);
4983 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4985 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4987 /* Folding builtins can create multiple instructions,
4988 we need to look at all of them. */
4989 gimple_stmt_iterator i2
= gsi
;
4991 if (fold_stmt (&gsi
))
4994 /* If a builtin at the end of a bb folded into nothing,
4995 the following loop won't work. */
4996 if (gsi_end_p (gsi
))
4998 cgraph_update_edges_for_call_stmt (old_stmt
,
5003 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
5008 new_stmt
= gsi_stmt (i2
);
5009 update_stmt (new_stmt
);
5010 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5013 if (new_stmt
== gsi_stmt (gsi
))
5015 /* It is okay to check only for the very last
5016 of these statements. If it is a throwing
5017 statement nothing will change. If it isn't
5018 this can remove EH edges. If that weren't
5019 correct then because some intermediate stmts
5020 throw, but not the last one. That would mean
5021 we'd have to split the block, which we can't
5022 here and we'd loose anyway. And as builtins
5023 probably never throw, this all
5025 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
5027 gimple_purge_dead_eh_edges (
5028 BASIC_BLOCK_FOR_FN (cfun
, first
));
5035 else if (fold_stmt (&gsi
))
5037 /* Re-read the statement from GSI as fold_stmt() may
5039 gimple
*new_stmt
= gsi_stmt (gsi
);
5040 update_stmt (new_stmt
);
5042 if (is_gimple_call (old_stmt
)
5043 || is_gimple_call (new_stmt
))
5044 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5047 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
5048 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
5055 /* Expand calls to inline functions in the body of FN. */
5058 optimize_inline_calls (tree fn
)
5062 int last
= n_basic_blocks_for_fn (cfun
);
5063 bool inlined_p
= false;
5066 memset (&id
, 0, sizeof (id
));
5068 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
5069 gcc_assert (id
.dst_node
->definition
);
5071 /* Or any functions that aren't finished yet. */
5072 if (current_function_decl
)
5073 id
.dst_fn
= current_function_decl
;
5075 id
.copy_decl
= copy_decl_maybe_to_var
;
5076 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5077 id
.transform_new_cfg
= false;
5078 id
.transform_return_to_modify
= true;
5079 id
.transform_parameter
= true;
5080 id
.transform_lang_insert_block
= NULL
;
5081 id
.statements_to_fold
= new hash_set
<gimple
*>;
5083 push_gimplify_context ();
5085 /* We make no attempts to keep dominance info up-to-date. */
5086 free_dominance_info (CDI_DOMINATORS
);
5087 free_dominance_info (CDI_POST_DOMINATORS
);
5089 /* Register specific gimple functions. */
5090 gimple_register_cfg_hooks ();
5092 /* Reach the trees by walking over the CFG, and note the
5093 enclosing basic-blocks in the call edges. */
5094 /* We walk the blocks going forward, because inlined function bodies
5095 will split id->current_basic_block, and the new blocks will
5096 follow it; we'll trudge through them, processing their CALL_EXPRs
5098 FOR_EACH_BB_FN (bb
, cfun
)
5099 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
5101 pop_gimplify_context (NULL
);
5105 struct cgraph_edge
*e
;
5107 id
.dst_node
->verify ();
5109 /* Double check that we inlined everything we are supposed to inline. */
5110 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
5111 gcc_assert (e
->inline_failed
);
5114 /* Fold queued statements. */
5116 fold_marked_statements (last
, id
.statements_to_fold
);
5117 delete id
.statements_to_fold
;
5119 gcc_assert (!id
.debug_stmts
.exists ());
5121 /* If we didn't inline into the function there is nothing to do. */
5125 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5128 delete_unreachable_blocks_update_callgraph (&id
);
5130 id
.dst_node
->verify ();
5132 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5133 not possible yet - the IPA passes might make various functions to not
5134 throw and they don't care to proactively update local EH info. This is
5135 done later in fixup_cfg pass that also execute the verification. */
5136 return (TODO_update_ssa
5138 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5139 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
5140 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
5141 ? TODO_rebuild_frequencies
: 0));
5144 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5147 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5149 enum tree_code code
= TREE_CODE (*tp
);
5150 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5152 /* We make copies of most nodes. */
5153 if (IS_EXPR_CODE_CLASS (cl
)
5154 || code
== TREE_LIST
5156 || code
== TYPE_DECL
5157 || code
== OMP_CLAUSE
)
5159 /* Because the chain gets clobbered when we make a copy, we save it
5161 tree chain
= NULL_TREE
, new_tree
;
5163 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5164 chain
= TREE_CHAIN (*tp
);
5166 /* Copy the node. */
5167 new_tree
= copy_node (*tp
);
5171 /* Now, restore the chain, if appropriate. That will cause
5172 walk_tree to walk into the chain as well. */
5173 if (code
== PARM_DECL
5174 || code
== TREE_LIST
5175 || code
== OMP_CLAUSE
)
5176 TREE_CHAIN (*tp
) = chain
;
5178 /* For now, we don't update BLOCKs when we make copies. So, we
5179 have to nullify all BIND_EXPRs. */
5180 if (TREE_CODE (*tp
) == BIND_EXPR
)
5181 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5183 else if (code
== CONSTRUCTOR
)
5185 /* CONSTRUCTOR nodes need special handling because
5186 we need to duplicate the vector of elements. */
5189 new_tree
= copy_node (*tp
);
5190 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5193 else if (code
== STATEMENT_LIST
)
5194 /* We used to just abort on STATEMENT_LIST, but we can run into them
5195 with statement-expressions (c++/40975). */
5196 copy_statement_list (tp
);
5197 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5199 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5201 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5206 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5207 information indicating to what new SAVE_EXPR this one should be mapped,
5208 use that one. Otherwise, create a new node and enter it in ST. FN is
5209 the function into which the copy will be placed. */
5212 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5217 /* See if we already encountered this SAVE_EXPR. */
5220 /* If we didn't already remap this SAVE_EXPR, do so now. */
5223 t
= copy_node (*tp
);
5225 /* Remember this SAVE_EXPR. */
5227 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5232 /* We've already walked into this SAVE_EXPR; don't do it again. */
5237 /* Replace this SAVE_EXPR with the copy. */
5241 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5242 label, copies the declaration and enters it in the splay_tree in DATA (which
5243 is really a 'copy_body_data *'. */
5246 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5247 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5248 struct walk_stmt_info
*wi
)
5250 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5251 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5255 tree decl
= gimple_label_label (stmt
);
5257 /* Copy the decl and remember the copy. */
5258 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5264 static gimple_seq
duplicate_remap_omp_clause_seq (gimple_seq seq
,
5265 struct walk_stmt_info
*wi
);
5267 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5268 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5269 remaps all local declarations to appropriate replacements in gimple
5273 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5275 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5276 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5277 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5281 /* For recursive invocations this is no longer the LHS itself. */
5282 bool is_lhs
= wi
->is_lhs
;
5285 if (TREE_CODE (expr
) == SSA_NAME
)
5287 *tp
= remap_ssa_name (*tp
, id
);
5290 SSA_NAME_DEF_STMT (*tp
) = gsi_stmt (wi
->gsi
);
5292 /* Only a local declaration (variable or label). */
5293 else if ((VAR_P (expr
) && !TREE_STATIC (expr
))
5294 || TREE_CODE (expr
) == LABEL_DECL
)
5296 /* Lookup the declaration. */
5299 /* If it's there, remap it. */
5304 else if (TREE_CODE (expr
) == STATEMENT_LIST
5305 || TREE_CODE (expr
) == BIND_EXPR
5306 || TREE_CODE (expr
) == SAVE_EXPR
)
5308 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5310 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5311 It's OK for this to happen if it was part of a subtree that
5312 isn't immediately expanded, such as operand 2 of another
5314 if (!TREE_OPERAND (expr
, 1))
5316 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5317 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5320 else if (TREE_CODE (expr
) == OMP_CLAUSE
)
5322 /* Before the omplower pass completes, some OMP clauses can contain
5323 sequences that are neither copied by gimple_seq_copy nor walked by
5324 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5325 in those situations, we have to copy and process them explicitely. */
5327 if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LASTPRIVATE
)
5329 gimple_seq seq
= OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
);
5330 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5331 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
) = seq
;
5333 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LINEAR
)
5335 gimple_seq seq
= OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
);
5336 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5337 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
) = seq
;
5339 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_REDUCTION
)
5341 gimple_seq seq
= OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
);
5342 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5343 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
) = seq
;
5344 seq
= OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
);
5345 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5346 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
) = seq
;
5350 /* Keep iterating. */
5355 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5356 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5357 remaps all local declarations to appropriate replacements in gimple
5361 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5362 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5363 struct walk_stmt_info
*wi
)
5365 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5366 gimple
*gs
= gsi_stmt (*gsip
);
5368 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5370 tree block
= gimple_bind_block (stmt
);
5374 remap_block (&block
, id
);
5375 gimple_bind_set_block (stmt
, block
);
5378 /* This will remap a lot of the same decls again, but this should be
5380 if (gimple_bind_vars (stmt
))
5382 tree old_var
, decls
= gimple_bind_vars (stmt
);
5384 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
5385 if (!can_be_nonlocal (old_var
, id
)
5386 && ! variably_modified_type_p (TREE_TYPE (old_var
), id
->src_fn
))
5387 remap_decl (old_var
, id
);
5389 gcc_checking_assert (!id
->prevent_decl_creation_for_types
);
5390 id
->prevent_decl_creation_for_types
= true;
5391 gimple_bind_set_vars (stmt
, remap_decls (decls
, NULL
, id
));
5392 id
->prevent_decl_creation_for_types
= false;
5396 /* Keep iterating. */
5400 /* Create a copy of SEQ and remap all decls in it. */
5403 duplicate_remap_omp_clause_seq (gimple_seq seq
, struct walk_stmt_info
*wi
)
5408 /* If there are any labels in OMP sequences, they can be only referred to in
5409 the sequence itself and therefore we can do both here. */
5410 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, wi
);
5411 gimple_seq copy
= gimple_seq_copy (seq
);
5412 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, wi
);
5416 /* Copies everything in SEQ and replaces variables and labels local to
5417 current_function_decl. */
5420 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5423 struct walk_stmt_info wi
;
5426 /* There's nothing to do for NULL_TREE. */
5431 memset (&id
, 0, sizeof (id
));
5432 id
.src_fn
= current_function_decl
;
5433 id
.dst_fn
= current_function_decl
;
5435 id
.decl_map
= new hash_map
<tree
, tree
>;
5436 id
.debug_map
= NULL
;
5438 id
.copy_decl
= copy_decl_no_change
;
5439 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5440 id
.transform_new_cfg
= false;
5441 id
.transform_return_to_modify
= false;
5442 id
.transform_parameter
= false;
5443 id
.transform_lang_insert_block
= NULL
;
5445 /* Walk the tree once to find local labels. */
5446 memset (&wi
, 0, sizeof (wi
));
5447 hash_set
<tree
> visited
;
5450 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5452 copy
= gimple_seq_copy (seq
);
5454 /* Walk the copy, remapping decls. */
5455 memset (&wi
, 0, sizeof (wi
));
5457 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5462 delete id
.debug_map
;
5463 if (id
.dependence_map
)
5465 delete id
.dependence_map
;
5466 id
.dependence_map
= NULL
;
5473 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5476 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5485 debug_find_tree (tree top
, tree search
)
5487 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5491 /* Declare the variables created by the inliner. Add all the variables in
5492 VARS to BIND_EXPR. */
5495 declare_inline_vars (tree block
, tree vars
)
5498 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5500 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5501 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5502 add_local_decl (cfun
, t
);
5506 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5509 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5510 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5511 VAR_DECL translation. */
5514 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5516 /* Don't generate debug information for the copy if we wouldn't have
5517 generated it for the copy either. */
5518 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5519 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5521 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5522 declaration inspired this copy. */
5523 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5525 /* The new variable/label has no RTL, yet. */
5526 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5527 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5528 SET_DECL_RTL (copy
, 0);
5530 /* These args would always appear unused, if not for this. */
5531 TREE_USED (copy
) = 1;
5533 /* Set the context for the new declaration. */
5534 if (!DECL_CONTEXT (decl
))
5535 /* Globals stay global. */
5537 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5538 /* Things that weren't in the scope of the function we're inlining
5539 from aren't in the scope we're inlining to, either. */
5541 else if (TREE_STATIC (decl
))
5542 /* Function-scoped static variables should stay in the original
5547 /* Ordinary automatic local variables are now in the scope of the
5549 DECL_CONTEXT (copy
) = id
->dst_fn
;
5550 if (VAR_P (copy
) && id
->dst_simt_vars
&& !is_gimple_reg (copy
))
5552 if (!lookup_attribute ("omp simt private", DECL_ATTRIBUTES (copy
)))
5553 DECL_ATTRIBUTES (copy
)
5554 = tree_cons (get_identifier ("omp simt private"), NULL
,
5555 DECL_ATTRIBUTES (copy
));
5556 id
->dst_simt_vars
->safe_push (copy
);
5564 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5568 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5569 || TREE_CODE (decl
) == RESULT_DECL
);
5571 type
= TREE_TYPE (decl
);
5573 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5574 VAR_DECL
, DECL_NAME (decl
), type
);
5575 if (DECL_PT_UID_SET_P (decl
))
5576 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5577 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5578 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5579 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5580 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5582 return copy_decl_for_dup_finish (id
, decl
, copy
);
5585 /* Like copy_decl_to_var, but create a return slot object instead of a
5586 pointer variable for return by invisible reference. */
5589 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5593 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5594 || TREE_CODE (decl
) == RESULT_DECL
);
5596 type
= TREE_TYPE (decl
);
5597 if (DECL_BY_REFERENCE (decl
))
5598 type
= TREE_TYPE (type
);
5600 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5601 VAR_DECL
, DECL_NAME (decl
), type
);
5602 if (DECL_PT_UID_SET_P (decl
))
5603 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5604 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5605 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5606 if (!DECL_BY_REFERENCE (decl
))
5608 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5609 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5612 return copy_decl_for_dup_finish (id
, decl
, copy
);
5616 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5620 copy
= copy_node (decl
);
5622 /* The COPY is not abstract; it will be generated in DST_FN. */
5623 DECL_ABSTRACT_P (copy
) = false;
5624 lang_hooks
.dup_lang_specific_decl (copy
);
5626 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5627 been taken; it's for internal bookkeeping in expand_goto_internal. */
5628 if (TREE_CODE (copy
) == LABEL_DECL
)
5630 TREE_ADDRESSABLE (copy
) = 0;
5631 LABEL_DECL_UID (copy
) = -1;
5634 return copy_decl_for_dup_finish (id
, decl
, copy
);
5638 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5640 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5641 return copy_decl_to_var (decl
, id
);
5643 return copy_decl_no_change (decl
, id
);
5646 /* Return a copy of the function's argument tree. */
5648 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5649 bitmap args_to_skip
, tree
*vars
)
5652 tree new_parm
= NULL
;
5657 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5658 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5660 tree new_tree
= remap_decl (arg
, id
);
5661 if (TREE_CODE (new_tree
) != PARM_DECL
)
5662 new_tree
= id
->copy_decl (arg
, id
);
5663 lang_hooks
.dup_lang_specific_decl (new_tree
);
5665 parg
= &DECL_CHAIN (new_tree
);
5667 else if (!id
->decl_map
->get (arg
))
5669 /* Make an equivalent VAR_DECL. If the argument was used
5670 as temporary variable later in function, the uses will be
5671 replaced by local variable. */
5672 tree var
= copy_decl_to_var (arg
, id
);
5673 insert_decl_map (id
, arg
, var
);
5674 /* Declare this new variable. */
5675 DECL_CHAIN (var
) = *vars
;
5681 /* Return a copy of the function's static chain. */
5683 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5685 tree
*chain_copy
, *pvar
;
5687 chain_copy
= &static_chain
;
5688 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5690 tree new_tree
= remap_decl (*pvar
, id
);
5691 lang_hooks
.dup_lang_specific_decl (new_tree
);
5692 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5695 return static_chain
;
5698 /* Return true if the function is allowed to be versioned.
5699 This is a guard for the versioning functionality. */
5702 tree_versionable_function_p (tree fndecl
)
5704 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5705 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
)) == NULL
);
5708 /* Delete all unreachable basic blocks and update callgraph.
5709 Doing so is somewhat nontrivial because we need to update all clones and
5710 remove inline function that become unreachable. */
5713 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5715 bool changed
= false;
5716 basic_block b
, next_bb
;
5718 find_unreachable_blocks ();
5720 /* Delete all unreachable basic blocks. */
5722 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5723 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5725 next_bb
= b
->next_bb
;
5727 if (!(b
->flags
& BB_REACHABLE
))
5729 gimple_stmt_iterator bsi
;
5731 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5733 struct cgraph_edge
*e
;
5734 struct cgraph_node
*node
;
5736 id
->dst_node
->remove_stmt_references (gsi_stmt (bsi
));
5738 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5739 &&(e
= id
->dst_node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5741 if (!e
->inline_failed
)
5742 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5746 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5747 && id
->dst_node
->clones
)
5748 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5750 node
->remove_stmt_references (gsi_stmt (bsi
));
5751 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5752 && (e
= node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5754 if (!e
->inline_failed
)
5755 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5761 node
= node
->clones
;
5762 else if (node
->next_sibling_clone
)
5763 node
= node
->next_sibling_clone
;
5766 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5767 node
= node
->clone_of
;
5768 if (node
!= id
->dst_node
)
5769 node
= node
->next_sibling_clone
;
5773 delete_basic_block (b
);
5781 /* Update clone info after duplication. */
5784 update_clone_info (copy_body_data
* id
)
5786 struct cgraph_node
*node
;
5787 if (!id
->dst_node
->clones
)
5789 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5791 /* First update replace maps to match the new body. */
5792 if (node
->clone
.tree_map
)
5795 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5797 struct ipa_replace_map
*replace_info
;
5798 replace_info
= (*node
->clone
.tree_map
)[i
];
5799 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5800 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5804 node
= node
->clones
;
5805 else if (node
->next_sibling_clone
)
5806 node
= node
->next_sibling_clone
;
5809 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5810 node
= node
->clone_of
;
5811 if (node
!= id
->dst_node
)
5812 node
= node
->next_sibling_clone
;
5817 /* Create a copy of a function's tree.
5818 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5819 of the original function and the new copied function
5820 respectively. In case we want to replace a DECL
5821 tree with another tree while duplicating the function's
5822 body, TREE_MAP represents the mapping between these
5823 trees. If UPDATE_CLONES is set, the call_stmt fields
5824 of edges of clones of the function will be updated.
5826 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5828 If SKIP_RETURN is true, the new version will return void.
5829 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5830 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5833 tree_function_versioning (tree old_decl
, tree new_decl
,
5834 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
5835 bool update_clones
, bitmap args_to_skip
,
5836 bool skip_return
, bitmap blocks_to_copy
,
5837 basic_block new_entry
)
5839 struct cgraph_node
*old_version_node
;
5840 struct cgraph_node
*new_version_node
;
5844 struct ipa_replace_map
*replace_info
;
5845 basic_block old_entry_block
, bb
;
5846 auto_vec
<gimple
*, 10> init_stmts
;
5847 tree vars
= NULL_TREE
;
5848 bitmap debug_args_to_skip
= args_to_skip
;
5850 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5851 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5852 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5854 old_version_node
= cgraph_node::get (old_decl
);
5855 gcc_checking_assert (old_version_node
);
5856 new_version_node
= cgraph_node::get (new_decl
);
5857 gcc_checking_assert (new_version_node
);
5859 /* Copy over debug args. */
5860 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5862 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5863 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5864 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5865 old_debug_args
= decl_debug_args_lookup (old_decl
);
5868 new_debug_args
= decl_debug_args_insert (new_decl
);
5869 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5873 /* Output the inlining info for this abstract function, since it has been
5874 inlined. If we don't do this now, we can lose the information about the
5875 variables in the function when the blocks get blown away as soon as we
5876 remove the cgraph node. */
5877 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5879 DECL_ARTIFICIAL (new_decl
) = 1;
5880 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5881 if (DECL_ORIGIN (old_decl
) == old_decl
)
5882 old_version_node
->used_as_abstract_origin
= true;
5883 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5885 /* Prepare the data structures for the tree copy. */
5886 memset (&id
, 0, sizeof (id
));
5888 /* Generate a new name for the new version. */
5889 id
.statements_to_fold
= new hash_set
<gimple
*>;
5891 id
.decl_map
= new hash_map
<tree
, tree
>;
5892 id
.debug_map
= NULL
;
5893 id
.src_fn
= old_decl
;
5894 id
.dst_fn
= new_decl
;
5895 id
.src_node
= old_version_node
;
5896 id
.dst_node
= new_version_node
;
5897 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5898 id
.blocks_to_copy
= blocks_to_copy
;
5900 id
.copy_decl
= copy_decl_no_change
;
5901 id
.transform_call_graph_edges
5902 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5903 id
.transform_new_cfg
= true;
5904 id
.transform_return_to_modify
= false;
5905 id
.transform_parameter
= false;
5906 id
.transform_lang_insert_block
= NULL
;
5908 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5909 (DECL_STRUCT_FUNCTION (old_decl
));
5910 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5911 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5912 initialize_cfun (new_decl
, old_decl
,
5913 old_entry_block
->count
);
5914 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
5915 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5916 = id
.src_cfun
->gimple_df
->ipa_pta
;
5918 /* Copy the function's static chain. */
5919 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5921 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
5922 = copy_static_chain (p
, &id
);
5924 /* If there's a tree_map, prepare for substitution. */
5926 for (i
= 0; i
< tree_map
->length (); i
++)
5929 replace_info
= (*tree_map
)[i
];
5930 if (replace_info
->replace_p
)
5933 if (!replace_info
->old_tree
)
5935 int p
= replace_info
->parm_num
;
5937 tree req_type
, new_type
;
5939 for (parm
= DECL_ARGUMENTS (old_decl
); p
;
5940 parm
= DECL_CHAIN (parm
))
5942 replace_info
->old_tree
= parm
;
5943 parm_num
= replace_info
->parm_num
;
5944 req_type
= TREE_TYPE (parm
);
5945 new_type
= TREE_TYPE (replace_info
->new_tree
);
5946 if (!useless_type_conversion_p (req_type
, new_type
))
5948 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5949 replace_info
->new_tree
5950 = fold_build1 (NOP_EXPR
, req_type
,
5951 replace_info
->new_tree
);
5952 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (new_type
))
5953 replace_info
->new_tree
5954 = fold_build1 (VIEW_CONVERT_EXPR
, req_type
,
5955 replace_info
->new_tree
);
5960 fprintf (dump_file
, " const ");
5961 print_generic_expr (dump_file
,
5962 replace_info
->new_tree
);
5964 " can't be converted to param ");
5965 print_generic_expr (dump_file
, parm
);
5966 fprintf (dump_file
, "\n");
5968 replace_info
->old_tree
= NULL
;
5973 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5974 if (replace_info
->old_tree
)
5976 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5977 replace_info
->new_tree
, id
.src_fn
,
5981 init_stmts
.safe_push (init
);
5982 if (MAY_HAVE_DEBUG_STMTS
&& args_to_skip
)
5988 for (parm
= DECL_ARGUMENTS (old_decl
), p
= 0; parm
;
5989 parm
= DECL_CHAIN (parm
), p
++)
5990 if (parm
== replace_info
->old_tree
)
5998 if (debug_args_to_skip
== args_to_skip
)
6000 debug_args_to_skip
= BITMAP_ALLOC (NULL
);
6001 bitmap_copy (debug_args_to_skip
, args_to_skip
);
6003 bitmap_clear_bit (debug_args_to_skip
, parm_num
);
6009 /* Copy the function's arguments. */
6010 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
6011 DECL_ARGUMENTS (new_decl
)
6012 = copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
6013 args_to_skip
, &vars
);
6015 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
6016 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
6018 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
6020 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
6021 /* Add local vars. */
6022 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
6024 if (DECL_RESULT (old_decl
) == NULL_TREE
)
6026 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
6028 DECL_RESULT (new_decl
)
6029 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
6030 RESULT_DECL
, NULL_TREE
, void_type_node
);
6031 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
6032 cfun
->returns_struct
= 0;
6033 cfun
->returns_pcc_struct
= 0;
6038 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
6039 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
6040 if (gimple_in_ssa_p (id
.src_cfun
)
6041 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
6042 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
6044 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
6045 insert_decl_map (&id
, old_name
, new_name
);
6046 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
6047 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
6051 /* Set up the destination functions loop tree. */
6052 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
6054 cfun
->curr_properties
&= ~PROP_loops
;
6055 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
6056 cfun
->curr_properties
|= PROP_loops
;
6059 /* Copy the Function's body. */
6060 copy_body (&id
, old_entry_block
->count
,
6061 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
6064 /* Renumber the lexical scoping (non-code) blocks consecutively. */
6065 number_blocks (new_decl
);
6067 /* We want to create the BB unconditionally, so that the addition of
6068 debug stmts doesn't affect BB count, which may in the end cause
6069 codegen differences. */
6070 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6071 while (init_stmts
.length ())
6072 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
6073 update_clone_info (&id
);
6075 /* Remap the nonlocal_goto_save_area, if any. */
6076 if (cfun
->nonlocal_goto_save_area
)
6078 struct walk_stmt_info wi
;
6080 memset (&wi
, 0, sizeof (wi
));
6082 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
6088 delete id
.debug_map
;
6089 free_dominance_info (CDI_DOMINATORS
);
6090 free_dominance_info (CDI_POST_DOMINATORS
);
6093 fold_marked_statements (0, id
.statements_to_fold
);
6094 delete id
.statements_to_fold
;
6095 delete_unreachable_blocks_update_callgraph (&id
);
6096 if (id
.dst_node
->definition
)
6097 cgraph_edge::rebuild_references ();
6098 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
6100 calculate_dominance_info (CDI_DOMINATORS
);
6101 fix_loop_structure (NULL
);
6103 update_ssa (TODO_update_ssa
);
6105 /* After partial cloning we need to rescale frequencies, so they are
6106 within proper range in the cloned function. */
6109 struct cgraph_edge
*e
;
6110 rebuild_frequencies ();
6112 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
.ipa ();
6113 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
6115 basic_block bb
= gimple_bb (e
->call_stmt
);
6116 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
6118 e
->count
= bb
->count
.ipa ();
6120 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
6122 basic_block bb
= gimple_bb (e
->call_stmt
);
6123 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
6125 e
->count
= bb
->count
.ipa ();
6129 if (debug_args_to_skip
&& MAY_HAVE_DEBUG_STMTS
)
6132 vec
<tree
, va_gc
> **debug_args
= NULL
;
6133 unsigned int len
= 0;
6134 for (parm
= DECL_ARGUMENTS (old_decl
), i
= 0;
6135 parm
; parm
= DECL_CHAIN (parm
), i
++)
6136 if (bitmap_bit_p (debug_args_to_skip
, i
) && is_gimple_reg (parm
))
6140 if (debug_args
== NULL
)
6142 debug_args
= decl_debug_args_insert (new_decl
);
6143 len
= vec_safe_length (*debug_args
);
6145 ddecl
= make_node (DEBUG_EXPR_DECL
);
6146 DECL_ARTIFICIAL (ddecl
) = 1;
6147 TREE_TYPE (ddecl
) = TREE_TYPE (parm
);
6148 SET_DECL_MODE (ddecl
, DECL_MODE (parm
));
6149 vec_safe_push (*debug_args
, DECL_ORIGIN (parm
));
6150 vec_safe_push (*debug_args
, ddecl
);
6152 if (debug_args
!= NULL
)
6154 /* On the callee side, add
6157 stmts to the first bb where var is a VAR_DECL created for the
6158 optimized away parameter in DECL_INITIAL block. This hints
6159 in the debug info that var (whole DECL_ORIGIN is the parm
6160 PARM_DECL) is optimized away, but could be looked up at the
6161 call site as value of D#X there. */
6162 tree var
= vars
, vexpr
;
6163 gimple_stmt_iterator cgsi
6164 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6167 i
= vec_safe_length (*debug_args
);
6171 while (var
!= NULL_TREE
6172 && DECL_ABSTRACT_ORIGIN (var
) != (**debug_args
)[i
])
6173 var
= TREE_CHAIN (var
);
6174 if (var
== NULL_TREE
)
6176 vexpr
= make_node (DEBUG_EXPR_DECL
);
6177 parm
= (**debug_args
)[i
];
6178 DECL_ARTIFICIAL (vexpr
) = 1;
6179 TREE_TYPE (vexpr
) = TREE_TYPE (parm
);
6180 SET_DECL_MODE (vexpr
, DECL_MODE (parm
));
6181 def_temp
= gimple_build_debug_bind (var
, vexpr
, NULL
);
6182 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6183 def_temp
= gimple_build_debug_source_bind (vexpr
, parm
, NULL
);
6184 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6190 if (debug_args_to_skip
&& debug_args_to_skip
!= args_to_skip
)
6191 BITMAP_FREE (debug_args_to_skip
);
6192 free_dominance_info (CDI_DOMINATORS
);
6193 free_dominance_info (CDI_POST_DOMINATORS
);
6195 gcc_assert (!id
.debug_stmts
.exists ());
6200 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6201 the callee and return the inlined body on success. */
6204 maybe_inline_call_in_expr (tree exp
)
6206 tree fn
= get_callee_fndecl (exp
);
6208 /* We can only try to inline "const" functions. */
6209 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
6211 call_expr_arg_iterator iter
;
6214 hash_map
<tree
, tree
> decl_map
;
6216 /* Remap the parameters. */
6217 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
6219 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
6220 decl_map
.put (param
, arg
);
6222 memset (&id
, 0, sizeof (id
));
6224 id
.dst_fn
= current_function_decl
;
6225 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6226 id
.decl_map
= &decl_map
;
6228 id
.copy_decl
= copy_decl_no_change
;
6229 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6230 id
.transform_new_cfg
= false;
6231 id
.transform_return_to_modify
= true;
6232 id
.transform_parameter
= true;
6233 id
.transform_lang_insert_block
= NULL
;
6235 /* Make sure not to unshare trees behind the front-end's back
6236 since front-end specific mechanisms may rely on sharing. */
6237 id
.regimplify
= false;
6238 id
.do_not_unshare
= true;
6240 /* We're not inside any EH region. */
6243 t
= copy_tree_body (&id
);
6245 /* We can only return something suitable for use in a GENERIC
6247 if (TREE_CODE (t
) == MODIFY_EXPR
)
6248 return TREE_OPERAND (t
, 1);
6254 /* Duplicate a type, fields and all. */
6257 build_duplicate_type (tree type
)
6259 struct copy_body_data id
;
6261 memset (&id
, 0, sizeof (id
));
6262 id
.src_fn
= current_function_decl
;
6263 id
.dst_fn
= current_function_decl
;
6265 id
.decl_map
= new hash_map
<tree
, tree
>;
6266 id
.debug_map
= NULL
;
6267 id
.copy_decl
= copy_decl_no_change
;
6269 type
= remap_type_1 (type
, &id
);
6273 delete id
.debug_map
;
6275 TYPE_CANONICAL (type
) = type
;
6280 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6281 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6285 copy_fn (tree fn
, tree
& parms
, tree
& result
)
6289 hash_map
<tree
, tree
> decl_map
;
6294 memset (&id
, 0, sizeof (id
));
6296 id
.dst_fn
= current_function_decl
;
6297 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6298 id
.decl_map
= &decl_map
;
6300 id
.copy_decl
= copy_decl_no_change
;
6301 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6302 id
.transform_new_cfg
= false;
6303 id
.transform_return_to_modify
= false;
6304 id
.transform_parameter
= true;
6305 id
.transform_lang_insert_block
= NULL
;
6307 /* Make sure not to unshare trees behind the front-end's back
6308 since front-end specific mechanisms may rely on sharing. */
6309 id
.regimplify
= false;
6310 id
.do_not_unshare
= true;
6312 /* We're not inside any EH region. */
6315 /* Remap the parameters and result and return them to the caller. */
6316 for (param
= DECL_ARGUMENTS (fn
);
6318 param
= DECL_CHAIN (param
))
6320 *p
= remap_decl (param
, &id
);
6321 p
= &DECL_CHAIN (*p
);
6324 if (DECL_RESULT (fn
))
6325 result
= remap_decl (DECL_RESULT (fn
), &id
);
6329 return copy_tree_body (&id
);