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 gcc_checking_assert (TYPE_SIZE (type
) == TYPE_SIZE (TYPE_MAIN_VARIANT (type
)));
558 gcc_checking_assert (TYPE_SIZE_UNIT (type
) == TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
)));
560 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
561 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
565 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
566 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
573 remap_type (tree type
, copy_body_data
*id
)
581 /* See if we have remapped this type. */
582 node
= id
->decl_map
->get (type
);
586 /* The type only needs remapping if it's variably modified. */
587 if (! variably_modified_type_p (type
, id
->src_fn
))
589 insert_decl_map (id
, type
, type
);
593 id
->remapping_type_depth
++;
594 tmp
= remap_type_1 (type
, id
);
595 id
->remapping_type_depth
--;
600 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
603 can_be_nonlocal (tree decl
, copy_body_data
*id
)
605 /* We can not duplicate function decls. */
606 if (TREE_CODE (decl
) == FUNCTION_DECL
)
609 /* Local static vars must be non-local or we get multiple declaration
611 if (VAR_P (decl
) && !auto_var_in_fn_p (decl
, id
->src_fn
))
618 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
622 tree new_decls
= NULL_TREE
;
624 /* Remap its variables. */
625 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
629 if (can_be_nonlocal (old_var
, id
))
631 /* We need to add this variable to the local decls as otherwise
632 nothing else will do so. */
633 if (VAR_P (old_var
) && ! DECL_EXTERNAL (old_var
) && cfun
)
634 add_local_decl (cfun
, old_var
);
635 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
636 && !DECL_IGNORED_P (old_var
)
637 && nonlocalized_list
)
638 vec_safe_push (*nonlocalized_list
, old_var
);
642 /* Remap the variable. */
643 new_var
= remap_decl (old_var
, id
);
645 /* If we didn't remap this variable, we can't mess with its
646 TREE_CHAIN. If we remapped this variable to the return slot, it's
647 already declared somewhere else, so don't declare it here. */
649 if (new_var
== id
->retvar
)
653 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
654 && !DECL_IGNORED_P (old_var
)
655 && nonlocalized_list
)
656 vec_safe_push (*nonlocalized_list
, old_var
);
660 gcc_assert (DECL_P (new_var
));
661 DECL_CHAIN (new_var
) = new_decls
;
664 /* Also copy value-expressions. */
665 if (VAR_P (new_var
) && DECL_HAS_VALUE_EXPR_P (new_var
))
667 tree tem
= DECL_VALUE_EXPR (new_var
);
668 bool old_regimplify
= id
->regimplify
;
669 id
->remapping_type_depth
++;
670 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
671 id
->remapping_type_depth
--;
672 id
->regimplify
= old_regimplify
;
673 SET_DECL_VALUE_EXPR (new_var
, tem
);
678 return nreverse (new_decls
);
681 /* Copy the BLOCK to contain remapped versions of the variables
682 therein. And hook the new block into the block-tree. */
685 remap_block (tree
*block
, copy_body_data
*id
)
690 /* Make the new block. */
692 new_block
= make_node (BLOCK
);
693 TREE_USED (new_block
) = TREE_USED (old_block
);
694 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
695 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
696 BLOCK_NONLOCALIZED_VARS (new_block
)
697 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
700 /* Remap its variables. */
701 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
702 &BLOCK_NONLOCALIZED_VARS (new_block
),
705 if (id
->transform_lang_insert_block
)
706 id
->transform_lang_insert_block (new_block
);
708 /* Remember the remapped block. */
709 insert_decl_map (id
, old_block
, new_block
);
712 /* Copy the whole block tree and root it in id->block. */
714 remap_blocks (tree block
, copy_body_data
*id
)
717 tree new_tree
= block
;
722 remap_block (&new_tree
, id
);
723 gcc_assert (new_tree
!= block
);
724 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
725 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
726 /* Blocks are in arbitrary order, but make things slightly prettier and do
727 not swap order when producing a copy. */
728 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
732 /* Remap the block tree rooted at BLOCK to nothing. */
734 remap_blocks_to_null (tree block
, copy_body_data
*id
)
737 insert_decl_map (id
, block
, NULL_TREE
);
738 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
739 remap_blocks_to_null (t
, id
);
743 copy_statement_list (tree
*tp
)
745 tree_stmt_iterator oi
, ni
;
748 new_tree
= alloc_stmt_list ();
749 ni
= tsi_start (new_tree
);
750 oi
= tsi_start (*tp
);
751 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
754 for (; !tsi_end_p (oi
); tsi_next (&oi
))
756 tree stmt
= tsi_stmt (oi
);
757 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
758 /* This copy is not redundant; tsi_link_after will smash this
759 STATEMENT_LIST into the end of the one we're building, and we
760 don't want to do that with the original. */
761 copy_statement_list (&stmt
);
762 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
767 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
769 tree block
= BIND_EXPR_BLOCK (*tp
);
770 /* Copy (and replace) the statement. */
771 copy_tree_r (tp
, walk_subtrees
, NULL
);
774 remap_block (&block
, id
);
775 BIND_EXPR_BLOCK (*tp
) = block
;
778 if (BIND_EXPR_VARS (*tp
))
779 /* This will remap a lot of the same decls again, but this should be
781 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
785 /* Create a new gimple_seq by remapping all the statements in BODY
786 using the inlining information in ID. */
789 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
791 gimple_stmt_iterator si
;
792 gimple_seq new_body
= NULL
;
794 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
796 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
797 gimple_seq_add_seq (&new_body
, new_stmts
);
804 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
805 block using the mapping information in ID. */
808 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
811 tree new_block
, new_vars
;
812 gimple_seq body
, new_body
;
814 /* Copy the statement. Note that we purposely don't use copy_stmt
815 here because we need to remap statements as we copy. */
816 body
= gimple_bind_body (stmt
);
817 new_body
= remap_gimple_seq (body
, id
);
819 new_block
= gimple_bind_block (stmt
);
821 remap_block (&new_block
, id
);
823 /* This will remap a lot of the same decls again, but this should be
825 new_vars
= gimple_bind_vars (stmt
);
827 new_vars
= remap_decls (new_vars
, NULL
, id
);
829 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
834 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
839 if (TREE_CODE (decl
) == SSA_NAME
)
841 decl
= SSA_NAME_VAR (decl
);
846 return (TREE_CODE (decl
) == PARM_DECL
);
849 /* Remap the dependence CLIQUE from the source to the destination function
850 as specified in ID. */
852 static unsigned short
853 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
855 if (clique
== 0 || processing_debug_stmt
)
857 if (!id
->dependence_map
)
858 id
->dependence_map
= new hash_map
<dependence_hash
, unsigned short>;
860 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
862 newc
= ++cfun
->last_clique
;
866 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
867 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
868 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
869 recursing into the children nodes of *TP. */
872 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
874 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
875 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
876 tree fn
= id
->src_fn
;
878 /* For recursive invocations this is no longer the LHS itself. */
879 bool is_lhs
= wi_p
->is_lhs
;
880 wi_p
->is_lhs
= false;
882 if (TREE_CODE (*tp
) == SSA_NAME
)
884 *tp
= remap_ssa_name (*tp
, id
);
887 SSA_NAME_DEF_STMT (*tp
) = wi_p
->stmt
;
890 else if (auto_var_in_fn_p (*tp
, fn
))
892 /* Local variables and labels need to be replaced by equivalent
893 variables. We don't want to copy static variables; there's
894 only one of those, no matter how many times we inline the
895 containing function. Similarly for globals from an outer
899 /* Remap the declaration. */
900 new_decl
= remap_decl (*tp
, id
);
901 gcc_assert (new_decl
);
902 /* Replace this variable with the copy. */
903 STRIP_TYPE_NOPS (new_decl
);
904 /* ??? The C++ frontend uses void * pointer zero to initialize
905 any other type. This confuses the middle-end type verification.
906 As cloned bodies do not go through gimplification again the fixup
907 there doesn't trigger. */
908 if (TREE_CODE (new_decl
) == INTEGER_CST
909 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
910 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
914 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
916 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
918 else if (TREE_CODE (*tp
) == LABEL_DECL
919 && (!DECL_CONTEXT (*tp
)
920 || decl_function_context (*tp
) == id
->src_fn
))
921 /* These may need to be remapped for EH handling. */
922 *tp
= remap_decl (*tp
, id
);
923 else if (TREE_CODE (*tp
) == FIELD_DECL
)
925 /* If the enclosing record type is variably_modified_type_p, the field
926 has already been remapped. Otherwise, it need not be. */
927 tree
*n
= id
->decl_map
->get (*tp
);
932 else if (TYPE_P (*tp
))
933 /* Types may need remapping as well. */
934 *tp
= remap_type (*tp
, id
);
935 else if (CONSTANT_CLASS_P (*tp
))
937 /* If this is a constant, we have to copy the node iff the type
938 will be remapped. copy_tree_r will not copy a constant. */
939 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
941 if (new_type
== TREE_TYPE (*tp
))
944 else if (TREE_CODE (*tp
) == INTEGER_CST
)
945 *tp
= wide_int_to_tree (new_type
, *tp
);
948 *tp
= copy_node (*tp
);
949 TREE_TYPE (*tp
) = new_type
;
954 /* Otherwise, just copy the node. Note that copy_tree_r already
955 knows not to copy VAR_DECLs, etc., so this is safe. */
957 if (TREE_CODE (*tp
) == MEM_REF
)
959 /* We need to re-canonicalize MEM_REFs from inline substitutions
960 that can happen when a pointer argument is an ADDR_EXPR.
961 Recurse here manually to allow that. */
962 tree ptr
= TREE_OPERAND (*tp
, 0);
963 tree type
= remap_type (TREE_TYPE (*tp
), id
);
965 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
966 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
967 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
968 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
969 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
970 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
972 MR_DEPENDENCE_CLIQUE (*tp
)
973 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
974 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
976 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
977 remapped a parameter as the property might be valid only
978 for the parameter itself. */
979 if (TREE_THIS_NOTRAP (old
)
980 && (!is_parm (TREE_OPERAND (old
, 0))
981 || (!id
->transform_parameter
&& is_parm (ptr
))))
982 TREE_THIS_NOTRAP (*tp
) = 1;
983 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
988 /* Here is the "usual case". Copy this tree node, and then
989 tweak some special cases. */
990 copy_tree_r (tp
, walk_subtrees
, NULL
);
992 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
993 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
995 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
997 /* The copied TARGET_EXPR has never been expanded, even if the
998 original node was expanded already. */
999 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1000 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1002 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1004 /* Variable substitution need not be simple. In particular,
1005 the MEM_REF substitution above. Make sure that
1006 TREE_CONSTANT and friends are up-to-date. */
1007 int invariant
= is_gimple_min_invariant (*tp
);
1008 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
1009 recompute_tree_invariant_for_addr_expr (*tp
);
1011 /* If this used to be invariant, but is not any longer,
1012 then regimplification is probably needed. */
1013 if (invariant
&& !is_gimple_min_invariant (*tp
))
1014 id
->regimplify
= true;
1020 /* Update the TREE_BLOCK for the cloned expr. */
1023 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1024 tree old_block
= TREE_BLOCK (*tp
);
1028 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1032 TREE_SET_BLOCK (*tp
, new_block
);
1035 /* Keep iterating. */
1040 /* Called from copy_body_id via walk_tree. DATA is really a
1041 `copy_body_data *'. */
1044 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1046 copy_body_data
*id
= (copy_body_data
*) data
;
1047 tree fn
= id
->src_fn
;
1050 /* Begin by recognizing trees that we'll completely rewrite for the
1051 inlining context. Our output for these trees is completely
1052 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1053 into an edge). Further down, we'll handle trees that get
1054 duplicated and/or tweaked. */
1056 /* When requested, RETURN_EXPRs should be transformed to just the
1057 contained MODIFY_EXPR. The branch semantics of the return will
1058 be handled elsewhere by manipulating the CFG rather than a statement. */
1059 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1061 tree assignment
= TREE_OPERAND (*tp
, 0);
1063 /* If we're returning something, just turn that into an
1064 assignment into the equivalent of the original RESULT_DECL.
1065 If the "assignment" is just the result decl, the result
1066 decl has already been set (e.g. a recent "foo (&result_decl,
1067 ...)"); just toss the entire RETURN_EXPR. */
1068 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1070 /* Replace the RETURN_EXPR with (a copy of) the
1071 MODIFY_EXPR hanging underneath. */
1072 *tp
= copy_node (assignment
);
1074 else /* Else the RETURN_EXPR returns no value. */
1077 return (tree
) (void *)1;
1080 else if (TREE_CODE (*tp
) == SSA_NAME
)
1082 *tp
= remap_ssa_name (*tp
, id
);
1087 /* Local variables and labels need to be replaced by equivalent
1088 variables. We don't want to copy static variables; there's only
1089 one of those, no matter how many times we inline the containing
1090 function. Similarly for globals from an outer function. */
1091 else if (auto_var_in_fn_p (*tp
, fn
))
1095 /* Remap the declaration. */
1096 new_decl
= remap_decl (*tp
, id
);
1097 gcc_assert (new_decl
);
1098 /* Replace this variable with the copy. */
1099 STRIP_TYPE_NOPS (new_decl
);
1103 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1104 copy_statement_list (tp
);
1105 else if (TREE_CODE (*tp
) == SAVE_EXPR
1106 || TREE_CODE (*tp
) == TARGET_EXPR
)
1107 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1108 else if (TREE_CODE (*tp
) == LABEL_DECL
1109 && (! DECL_CONTEXT (*tp
)
1110 || decl_function_context (*tp
) == id
->src_fn
))
1111 /* These may need to be remapped for EH handling. */
1112 *tp
= remap_decl (*tp
, id
);
1113 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1114 copy_bind_expr (tp
, walk_subtrees
, id
);
1115 /* Types may need remapping as well. */
1116 else if (TYPE_P (*tp
))
1117 *tp
= remap_type (*tp
, id
);
1119 /* If this is a constant, we have to copy the node iff the type will be
1120 remapped. copy_tree_r will not copy a constant. */
1121 else if (CONSTANT_CLASS_P (*tp
))
1123 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1125 if (new_type
== TREE_TYPE (*tp
))
1128 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1129 *tp
= wide_int_to_tree (new_type
, *tp
);
1132 *tp
= copy_node (*tp
);
1133 TREE_TYPE (*tp
) = new_type
;
1137 /* Otherwise, just copy the node. Note that copy_tree_r already
1138 knows not to copy VAR_DECLs, etc., so this is safe. */
1141 /* Here we handle trees that are not completely rewritten.
1142 First we detect some inlining-induced bogosities for
1144 if (TREE_CODE (*tp
) == MODIFY_EXPR
1145 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1146 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1148 /* Some assignments VAR = VAR; don't generate any rtl code
1149 and thus don't count as variable modification. Avoid
1150 keeping bogosities like 0 = 0. */
1151 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1154 n
= id
->decl_map
->get (decl
);
1158 STRIP_TYPE_NOPS (value
);
1159 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1161 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1162 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1166 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1168 /* Get rid of *& from inline substitutions that can happen when a
1169 pointer argument is an ADDR_EXPR. */
1170 tree decl
= TREE_OPERAND (*tp
, 0);
1171 tree
*n
= id
->decl_map
->get (decl
);
1174 /* If we happen to get an ADDR_EXPR in n->value, strip
1175 it manually here as we'll eventually get ADDR_EXPRs
1176 which lie about their types pointed to. In this case
1177 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1178 but we absolutely rely on that. As fold_indirect_ref
1179 does other useful transformations, try that first, though. */
1180 tree type
= TREE_TYPE (*tp
);
1181 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1183 *tp
= gimple_fold_indirect_ref (ptr
);
1186 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1189 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1190 /* ??? We should either assert here or build
1191 a VIEW_CONVERT_EXPR instead of blindly leaking
1192 incompatible types to our IL. */
1194 *tp
= TREE_OPERAND (ptr
, 0);
1198 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1199 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1200 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1201 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1202 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1203 have remapped a parameter as the property might be
1204 valid only for the parameter itself. */
1205 if (TREE_THIS_NOTRAP (old
)
1206 && (!is_parm (TREE_OPERAND (old
, 0))
1207 || (!id
->transform_parameter
&& is_parm (ptr
))))
1208 TREE_THIS_NOTRAP (*tp
) = 1;
1215 else if (TREE_CODE (*tp
) == MEM_REF
)
1217 /* We need to re-canonicalize MEM_REFs from inline substitutions
1218 that can happen when a pointer argument is an ADDR_EXPR.
1219 Recurse here manually to allow that. */
1220 tree ptr
= TREE_OPERAND (*tp
, 0);
1221 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1223 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1224 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1225 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1226 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1227 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1228 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1230 MR_DEPENDENCE_CLIQUE (*tp
)
1231 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1232 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1234 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1235 remapped a parameter as the property might be valid only
1236 for the parameter itself. */
1237 if (TREE_THIS_NOTRAP (old
)
1238 && (!is_parm (TREE_OPERAND (old
, 0))
1239 || (!id
->transform_parameter
&& is_parm (ptr
))))
1240 TREE_THIS_NOTRAP (*tp
) = 1;
1241 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1246 /* Here is the "usual case". Copy this tree node, and then
1247 tweak some special cases. */
1248 copy_tree_r (tp
, walk_subtrees
, NULL
);
1250 /* If EXPR has block defined, map it to newly constructed block.
1251 When inlining we want EXPRs without block appear in the block
1252 of function call if we are not remapping a type. */
1255 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1256 if (TREE_BLOCK (*tp
))
1259 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1263 TREE_SET_BLOCK (*tp
, new_block
);
1266 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1267 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1269 /* The copied TARGET_EXPR has never been expanded, even if the
1270 original node was expanded already. */
1271 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1273 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1274 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1277 /* Variable substitution need not be simple. In particular, the
1278 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1279 and friends are up-to-date. */
1280 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1282 int invariant
= is_gimple_min_invariant (*tp
);
1283 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1285 /* Handle the case where we substituted an INDIRECT_REF
1286 into the operand of the ADDR_EXPR. */
1287 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1289 tree t
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1290 if (TREE_TYPE (t
) != TREE_TYPE (*tp
))
1291 t
= fold_convert (remap_type (TREE_TYPE (*tp
), id
), t
);
1295 recompute_tree_invariant_for_addr_expr (*tp
);
1297 /* If this used to be invariant, but is not any longer,
1298 then regimplification is probably needed. */
1299 if (invariant
&& !is_gimple_min_invariant (*tp
))
1300 id
->regimplify
= true;
1306 /* Keep iterating. */
1310 /* Helper for remap_gimple_stmt. Given an EH region number for the
1311 source function, map that to the duplicate EH region number in
1312 the destination function. */
1315 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1317 eh_region old_r
, new_r
;
1319 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1320 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1322 return new_r
->index
;
1325 /* Similar, but operate on INTEGER_CSTs. */
1328 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1332 old_nr
= tree_to_shwi (old_t_nr
);
1333 new_nr
= remap_eh_region_nr (old_nr
, id
);
1335 return build_int_cst (integer_type_node
, new_nr
);
1338 /* Helper for copy_bb. Remap statement STMT using the inlining
1339 information in ID. Return the new statement copy. */
1342 remap_gimple_stmt (gimple
*stmt
, copy_body_data
*id
)
1344 gimple
*copy
= NULL
;
1345 struct walk_stmt_info wi
;
1346 bool skip_first
= false;
1347 gimple_seq stmts
= NULL
;
1349 if (is_gimple_debug (stmt
)
1350 && !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
1353 /* Begin by recognizing trees that we'll completely rewrite for the
1354 inlining context. Our output for these trees is completely
1355 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1356 into an edge). Further down, we'll handle trees that get
1357 duplicated and/or tweaked. */
1359 /* When requested, GIMPLE_RETURNs should be transformed to just the
1360 contained GIMPLE_ASSIGN. The branch semantics of the return will
1361 be handled elsewhere by manipulating the CFG rather than the
1363 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1365 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1366 tree retbnd
= gimple_return_retbnd (stmt
);
1367 tree bndslot
= id
->retbnd
;
1369 if (retbnd
&& bndslot
)
1371 gimple
*bndcopy
= gimple_build_assign (bndslot
, retbnd
);
1372 memset (&wi
, 0, sizeof (wi
));
1374 walk_gimple_op (bndcopy
, remap_gimple_op_r
, &wi
);
1375 gimple_seq_add_stmt (&stmts
, bndcopy
);
1378 /* If we're returning something, just turn that into an
1379 assignment into the equivalent of the original RESULT_DECL.
1380 If RETVAL is just the result decl, the result decl has
1381 already been set (e.g. a recent "foo (&result_decl, ...)");
1382 just toss the entire GIMPLE_RETURN. */
1384 && (TREE_CODE (retval
) != RESULT_DECL
1385 && (TREE_CODE (retval
) != SSA_NAME
1386 || ! SSA_NAME_VAR (retval
)
1387 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1389 copy
= gimple_build_assign (id
->do_not_unshare
1390 ? id
->retvar
: unshare_expr (id
->retvar
),
1392 /* id->retvar is already substituted. Skip it on later remapping. */
1395 /* We need to copy bounds if return structure with pointers into
1396 instrumented function. */
1397 if (chkp_function_instrumented_p (id
->dst_fn
)
1399 && !BOUNDED_P (id
->retvar
)
1400 && chkp_type_has_pointer (TREE_TYPE (id
->retvar
)))
1401 id
->assign_stmts
.safe_push (copy
);
1407 else if (gimple_has_substatements (stmt
))
1411 /* When cloning bodies from the C++ front end, we will be handed bodies
1412 in High GIMPLE form. Handle here all the High GIMPLE statements that
1413 have embedded statements. */
1414 switch (gimple_code (stmt
))
1417 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1422 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1423 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1424 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1428 case GIMPLE_EH_FILTER
:
1429 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1430 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1434 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1435 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1436 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1439 case GIMPLE_WITH_CLEANUP_EXPR
:
1440 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1441 copy
= gimple_build_wce (s1
);
1444 case GIMPLE_OMP_PARALLEL
:
1446 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1447 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1448 copy
= gimple_build_omp_parallel
1450 gimple_omp_parallel_clauses (omp_par_stmt
),
1451 gimple_omp_parallel_child_fn (omp_par_stmt
),
1452 gimple_omp_parallel_data_arg (omp_par_stmt
));
1456 case GIMPLE_OMP_TASK
:
1457 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1458 copy
= gimple_build_omp_task
1460 gimple_omp_task_clauses (stmt
),
1461 gimple_omp_task_child_fn (stmt
),
1462 gimple_omp_task_data_arg (stmt
),
1463 gimple_omp_task_copy_fn (stmt
),
1464 gimple_omp_task_arg_size (stmt
),
1465 gimple_omp_task_arg_align (stmt
));
1468 case GIMPLE_OMP_FOR
:
1469 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1470 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1471 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1472 gimple_omp_for_clauses (stmt
),
1473 gimple_omp_for_collapse (stmt
), s2
);
1476 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1478 gimple_omp_for_set_index (copy
, i
,
1479 gimple_omp_for_index (stmt
, i
));
1480 gimple_omp_for_set_initial (copy
, i
,
1481 gimple_omp_for_initial (stmt
, i
));
1482 gimple_omp_for_set_final (copy
, i
,
1483 gimple_omp_for_final (stmt
, i
));
1484 gimple_omp_for_set_incr (copy
, i
,
1485 gimple_omp_for_incr (stmt
, i
));
1486 gimple_omp_for_set_cond (copy
, i
,
1487 gimple_omp_for_cond (stmt
, i
));
1492 case GIMPLE_OMP_MASTER
:
1493 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1494 copy
= gimple_build_omp_master (s1
);
1497 case GIMPLE_OMP_TASKGROUP
:
1498 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1499 copy
= gimple_build_omp_taskgroup (s1
);
1502 case GIMPLE_OMP_ORDERED
:
1503 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1504 copy
= gimple_build_omp_ordered
1506 gimple_omp_ordered_clauses (as_a
<gomp_ordered
*> (stmt
)));
1509 case GIMPLE_OMP_SECTION
:
1510 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1511 copy
= gimple_build_omp_section (s1
);
1514 case GIMPLE_OMP_SECTIONS
:
1515 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1516 copy
= gimple_build_omp_sections
1517 (s1
, gimple_omp_sections_clauses (stmt
));
1520 case GIMPLE_OMP_SINGLE
:
1521 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1522 copy
= gimple_build_omp_single
1523 (s1
, gimple_omp_single_clauses (stmt
));
1526 case GIMPLE_OMP_TARGET
:
1527 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1528 copy
= gimple_build_omp_target
1529 (s1
, gimple_omp_target_kind (stmt
),
1530 gimple_omp_target_clauses (stmt
));
1533 case GIMPLE_OMP_TEAMS
:
1534 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1535 copy
= gimple_build_omp_teams
1536 (s1
, gimple_omp_teams_clauses (stmt
));
1539 case GIMPLE_OMP_CRITICAL
:
1540 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1541 copy
= gimple_build_omp_critical (s1
,
1542 gimple_omp_critical_name
1543 (as_a
<gomp_critical
*> (stmt
)),
1544 gimple_omp_critical_clauses
1545 (as_a
<gomp_critical
*> (stmt
)));
1548 case GIMPLE_TRANSACTION
:
1550 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1551 gtransaction
*new_trans_stmt
;
1552 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1554 copy
= new_trans_stmt
= gimple_build_transaction (s1
);
1555 gimple_transaction_set_subcode (new_trans_stmt
,
1556 gimple_transaction_subcode (old_trans_stmt
));
1557 gimple_transaction_set_label_norm (new_trans_stmt
,
1558 gimple_transaction_label_norm (old_trans_stmt
));
1559 gimple_transaction_set_label_uninst (new_trans_stmt
,
1560 gimple_transaction_label_uninst (old_trans_stmt
));
1561 gimple_transaction_set_label_over (new_trans_stmt
,
1562 gimple_transaction_label_over (old_trans_stmt
));
1572 if (gimple_assign_copy_p (stmt
)
1573 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1574 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1576 /* Here we handle statements that are not completely rewritten.
1577 First we detect some inlining-induced bogosities for
1580 /* Some assignments VAR = VAR; don't generate any rtl code
1581 and thus don't count as variable modification. Avoid
1582 keeping bogosities like 0 = 0. */
1583 tree decl
= gimple_assign_lhs (stmt
), value
;
1586 n
= id
->decl_map
->get (decl
);
1590 STRIP_TYPE_NOPS (value
);
1591 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1596 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1597 in a block that we aren't copying during tree_function_versioning,
1598 just drop the clobber stmt. */
1599 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1601 tree lhs
= gimple_assign_lhs (stmt
);
1602 if (TREE_CODE (lhs
) == MEM_REF
1603 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1605 gimple
*def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1606 if (gimple_bb (def_stmt
)
1607 && !bitmap_bit_p (id
->blocks_to_copy
,
1608 gimple_bb (def_stmt
)->index
))
1613 if (gimple_debug_bind_p (stmt
))
1616 = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1617 gimple_debug_bind_get_value (stmt
),
1619 id
->debug_stmts
.safe_push (copy
);
1620 gimple_seq_add_stmt (&stmts
, copy
);
1623 if (gimple_debug_source_bind_p (stmt
))
1625 gdebug
*copy
= gimple_build_debug_source_bind
1626 (gimple_debug_source_bind_get_var (stmt
),
1627 gimple_debug_source_bind_get_value (stmt
),
1629 id
->debug_stmts
.safe_push (copy
);
1630 gimple_seq_add_stmt (&stmts
, copy
);
1634 /* Create a new deep copy of the statement. */
1635 copy
= gimple_copy (stmt
);
1637 /* Clear flags that need revisiting. */
1638 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1640 if (gimple_call_tail_p (call_stmt
))
1641 gimple_call_set_tail (call_stmt
, false);
1642 if (gimple_call_from_thunk_p (call_stmt
))
1643 gimple_call_set_from_thunk (call_stmt
, false);
1644 if (gimple_call_internal_p (call_stmt
))
1645 switch (gimple_call_internal_fn (call_stmt
))
1647 case IFN_GOMP_SIMD_LANE
:
1648 case IFN_GOMP_SIMD_VF
:
1649 case IFN_GOMP_SIMD_LAST_LANE
:
1650 case IFN_GOMP_SIMD_ORDERED_START
:
1651 case IFN_GOMP_SIMD_ORDERED_END
:
1652 DECL_STRUCT_FUNCTION (id
->dst_fn
)->has_simduid_loops
= true;
1659 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1660 RESX and EH_DISPATCH. */
1662 switch (gimple_code (copy
))
1666 tree r
, fndecl
= gimple_call_fndecl (copy
);
1667 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1668 switch (DECL_FUNCTION_CODE (fndecl
))
1670 case BUILT_IN_EH_COPY_VALUES
:
1671 r
= gimple_call_arg (copy
, 1);
1672 r
= remap_eh_region_tree_nr (r
, id
);
1673 gimple_call_set_arg (copy
, 1, r
);
1676 case BUILT_IN_EH_POINTER
:
1677 case BUILT_IN_EH_FILTER
:
1678 r
= gimple_call_arg (copy
, 0);
1679 r
= remap_eh_region_tree_nr (r
, id
);
1680 gimple_call_set_arg (copy
, 0, r
);
1687 /* Reset alias info if we didn't apply measures to
1688 keep it valid over inlining by setting DECL_PT_UID. */
1689 if (!id
->src_cfun
->gimple_df
1690 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1691 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1697 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1698 int r
= gimple_resx_region (resx_stmt
);
1699 r
= remap_eh_region_nr (r
, id
);
1700 gimple_resx_set_region (resx_stmt
, r
);
1704 case GIMPLE_EH_DISPATCH
:
1706 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1707 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1708 r
= remap_eh_region_nr (r
, id
);
1709 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1718 /* If STMT has a block defined, map it to the newly constructed
1720 if (gimple_block (copy
))
1723 n
= id
->decl_map
->get (gimple_block (copy
));
1725 gimple_set_block (copy
, *n
);
1728 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1730 gimple_seq_add_stmt (&stmts
, copy
);
1734 /* Remap all the operands in COPY. */
1735 memset (&wi
, 0, sizeof (wi
));
1738 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1740 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1742 /* Clear the copied virtual operands. We are not remapping them here
1743 but are going to recreate them from scratch. */
1744 if (gimple_has_mem_ops (copy
))
1746 gimple_set_vdef (copy
, NULL_TREE
);
1747 gimple_set_vuse (copy
, NULL_TREE
);
1750 gimple_seq_add_stmt (&stmts
, copy
);
1755 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1759 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1760 profile_count num
, profile_count den
)
1762 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1763 basic_block copy_basic_block
;
1767 bool scale
= num
.initialized_p ()
1768 && (den
> 0 || num
== profile_count::zero ());
1770 /* Search for previous copied basic block. */
1773 prev
= prev
->prev_bb
;
1775 /* create_basic_block() will append every new block to
1776 basic_block_info automatically. */
1777 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
1779 copy_basic_block
->count
= bb
->count
.apply_scale (num
, den
);
1781 /* We are going to rebuild frequencies from scratch. These values
1782 have just small importance to drive canonicalize_loop_headers. */
1783 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1785 /* We recompute frequencies after inlining, so this is quite safe. */
1786 if (freq
> BB_FREQ_MAX
)
1788 copy_basic_block
->frequency
= freq
;
1790 copy_gsi
= gsi_start_bb (copy_basic_block
);
1792 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1795 gimple
*stmt
= gsi_stmt (gsi
);
1796 gimple
*orig_stmt
= stmt
;
1797 gimple_stmt_iterator stmts_gsi
;
1798 bool stmt_added
= false;
1800 id
->regimplify
= false;
1801 stmts
= remap_gimple_stmt (stmt
, id
);
1803 if (gimple_seq_empty_p (stmts
))
1808 for (stmts_gsi
= gsi_start (stmts
);
1809 !gsi_end_p (stmts_gsi
); )
1811 stmt
= gsi_stmt (stmts_gsi
);
1813 /* Advance iterator now before stmt is moved to seq_gsi. */
1814 gsi_next (&stmts_gsi
);
1816 if (gimple_nop_p (stmt
))
1819 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
1822 /* With return slot optimization we can end up with
1823 non-gimple (foo *)&this->m, fix that here. */
1824 if (is_gimple_assign (stmt
)
1825 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
1826 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1829 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1830 gimple_assign_rhs1 (stmt
),
1832 GSI_CONTINUE_LINKING
);
1833 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1834 id
->regimplify
= false;
1837 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1840 gimple_regimplify_operands (stmt
, &seq_gsi
);
1848 /* If copy_basic_block has been empty at the start of this iteration,
1849 call gsi_start_bb again to get at the newly added statements. */
1850 if (gsi_end_p (copy_gsi
))
1851 copy_gsi
= gsi_start_bb (copy_basic_block
);
1853 gsi_next (©_gsi
);
1855 /* Process the new statement. The call to gimple_regimplify_operands
1856 possibly turned the statement into multiple statements, we
1857 need to process all of them. */
1863 stmt
= gsi_stmt (copy_gsi
);
1864 call_stmt
= dyn_cast
<gcall
*> (stmt
);
1866 && gimple_call_va_arg_pack_p (call_stmt
)
1868 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
1870 /* __builtin_va_arg_pack () should be replaced by
1871 all arguments corresponding to ... in the caller. */
1875 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
1876 size_t n
, i
, nargs_to_copy
;
1877 bool remove_bounds
= false;
1879 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1882 /* Bounds should be removed from arg pack in case
1883 we handle not instrumented call in instrumented
1885 nargs_to_copy
= nargs
;
1886 if (gimple_call_with_bounds_p (id
->call_stmt
)
1887 && !gimple_call_with_bounds_p (stmt
))
1889 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1890 i
< gimple_call_num_args (id
->call_stmt
);
1892 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1894 remove_bounds
= true;
1897 /* Create the new array of arguments. */
1898 n
= nargs_to_copy
+ gimple_call_num_args (call_stmt
);
1899 argarray
.create (n
);
1900 argarray
.safe_grow_cleared (n
);
1902 /* Copy all the arguments before '...' */
1903 memcpy (argarray
.address (),
1904 gimple_call_arg_ptr (call_stmt
, 0),
1905 gimple_call_num_args (call_stmt
) * sizeof (tree
));
1909 /* Append the rest of arguments removing bounds. */
1910 unsigned cur
= gimple_call_num_args (call_stmt
);
1911 i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1912 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1913 i
< gimple_call_num_args (id
->call_stmt
);
1915 if (!POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1916 argarray
[cur
++] = gimple_call_arg (id
->call_stmt
, i
);
1917 gcc_assert (cur
== n
);
1921 /* Append the arguments passed in '...' */
1922 memcpy (argarray
.address () + gimple_call_num_args (call_stmt
),
1923 gimple_call_arg_ptr (id
->call_stmt
, 0)
1924 + (gimple_call_num_args (id
->call_stmt
) - nargs
),
1925 nargs
* sizeof (tree
));
1928 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
1931 argarray
.release ();
1933 /* Copy all GIMPLE_CALL flags, location and block, except
1934 GF_CALL_VA_ARG_PACK. */
1935 gimple_call_copy_flags (new_call
, call_stmt
);
1936 gimple_call_set_va_arg_pack (new_call
, false);
1937 gimple_set_location (new_call
, gimple_location (stmt
));
1938 gimple_set_block (new_call
, gimple_block (stmt
));
1939 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
1941 gsi_replace (©_gsi
, new_call
, false);
1946 && (decl
= gimple_call_fndecl (stmt
))
1947 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1948 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
1949 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
1951 /* __builtin_va_arg_pack_len () should be replaced by
1952 the number of anonymous arguments. */
1953 size_t nargs
= gimple_call_num_args (id
->call_stmt
), i
;
1957 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1960 /* For instrumented calls we should ignore bounds. */
1961 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1962 i
< gimple_call_num_args (id
->call_stmt
);
1964 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1967 count
= build_int_cst (integer_type_node
, nargs
);
1968 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1969 gsi_replace (©_gsi
, new_stmt
, false);
1974 && gimple_call_internal_p (stmt
)
1975 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
1977 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
1978 gsi_remove (©_gsi
, false);
1982 /* Statements produced by inlining can be unfolded, especially
1983 when we constant propagated some operands. We can't fold
1984 them right now for two reasons:
1985 1) folding require SSA_NAME_DEF_STMTs to be correct
1986 2) we can't change function calls to builtins.
1987 So we just mark statement for later folding. We mark
1988 all new statements, instead just statements that has changed
1989 by some nontrivial substitution so even statements made
1990 foldable indirectly are updated. If this turns out to be
1991 expensive, copy_body can be told to watch for nontrivial
1993 if (id
->statements_to_fold
)
1994 id
->statements_to_fold
->add (stmt
);
1996 /* We're duplicating a CALL_EXPR. Find any corresponding
1997 callgraph edges and update or duplicate them. */
1998 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
2000 struct cgraph_edge
*edge
;
2002 switch (id
->transform_call_graph_edges
)
2004 case CB_CGE_DUPLICATE
:
2005 edge
= id
->src_node
->get_edge (orig_stmt
);
2008 int edge_freq
= edge
->frequency
;
2010 struct cgraph_edge
*old_edge
= edge
;
2011 edge
= edge
->clone (id
->dst_node
, call_stmt
,
2013 profile_count::one (),
2014 profile_count::one (),
2017 /* We could also just rescale the frequency, but
2018 doing so would introduce roundoff errors and make
2019 verifier unhappy. */
2020 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
2023 /* Speculative calls consist of two edges - direct and indirect.
2024 Duplicate the whole thing and distribute frequencies accordingly. */
2025 if (edge
->speculative
)
2027 struct cgraph_edge
*direct
, *indirect
;
2028 struct ipa_ref
*ref
;
2030 gcc_assert (!edge
->indirect_unknown_callee
);
2031 old_edge
->speculative_call_info (direct
, indirect
, ref
);
2032 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2034 profile_count::one (),
2035 profile_count::one (),
2038 if (old_edge
->frequency
+ indirect
->frequency
)
2040 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
2041 (old_edge
->frequency
+ indirect
->frequency
)),
2043 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
2044 (old_edge
->frequency
+ indirect
->frequency
)),
2047 id
->dst_node
->clone_reference (ref
, stmt
);
2051 edge
->frequency
= new_freq
;
2053 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
2054 && (edge_freq
> edge
->frequency
+ 10
2055 || edge_freq
< edge
->frequency
- 10))
2057 fprintf (dump_file
, "Edge frequency estimated by "
2058 "cgraph %i diverge from inliner's estimate %i\n",
2062 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
2065 copy_basic_block
->frequency
);
2071 case CB_CGE_MOVE_CLONES
:
2072 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2074 edge
= id
->dst_node
->get_edge (stmt
);
2078 edge
= id
->dst_node
->get_edge (orig_stmt
);
2080 edge
->set_call_stmt (call_stmt
);
2087 /* Constant propagation on argument done during inlining
2088 may create new direct call. Produce an edge for it. */
2090 || (edge
->indirect_inlining_edge
2091 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2092 && id
->dst_node
->definition
2093 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2095 struct cgraph_node
*dest
= cgraph_node::get_create (fn
);
2097 /* We have missing edge in the callgraph. This can happen
2098 when previous inlining turned an indirect call into a
2099 direct call by constant propagating arguments or we are
2100 producing dead clone (for further cloning). In all
2101 other cases we hit a bug (incorrect node sharing is the
2102 most common reason for missing edges). */
2103 gcc_assert (!dest
->definition
2104 || dest
->address_taken
2105 || !id
->src_node
->definition
2106 || !id
->dst_node
->definition
);
2107 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2108 id
->dst_node
->create_edge_including_clones
2109 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2110 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
2112 CIF_ORIGINALLY_INDIRECT_CALL
);
2114 id
->dst_node
->create_edge (dest
, call_stmt
,
2116 compute_call_stmt_bb_frequency
2117 (id
->dst_node
->decl
,
2118 copy_basic_block
))->inline_failed
2119 = CIF_ORIGINALLY_INDIRECT_CALL
;
2122 fprintf (dump_file
, "Created new direct edge to %s\n",
2127 notice_special_calls (as_a
<gcall
*> (stmt
));
2130 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2131 id
->eh_map
, id
->eh_lp_nr
);
2133 gsi_next (©_gsi
);
2135 while (!gsi_end_p (copy_gsi
));
2137 copy_gsi
= gsi_last_bb (copy_basic_block
);
2140 return copy_basic_block
;
2143 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2144 form is quite easy, since dominator relationship for old basic blocks does
2147 There is however exception where inlining might change dominator relation
2148 across EH edges from basic block within inlined functions destinating
2149 to landing pads in function we inline into.
2151 The function fills in PHI_RESULTs of such PHI nodes if they refer
2152 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2153 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2154 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2155 set, and this means that there will be no overlapping live ranges
2156 for the underlying symbol.
2158 This might change in future if we allow redirecting of EH edges and
2159 we might want to change way build CFG pre-inlining to include
2160 all the possible edges then. */
2162 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2163 bool can_throw
, bool nonlocal_goto
)
2168 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2170 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2176 gcc_assert (e
->flags
& EDGE_EH
);
2179 gcc_assert (!(e
->flags
& EDGE_EH
));
2181 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2187 /* For abnormal goto/call edges the receiver can be the
2188 ENTRY_BLOCK. Do not assert this cannot happen. */
2190 gcc_assert ((e
->flags
& EDGE_EH
)
2191 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2193 re
= find_edge (ret_bb
, e
->dest
);
2194 gcc_checking_assert (re
);
2195 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2196 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2198 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2199 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2205 /* Copy edges from BB into its copy constructed earlier, scale profile
2206 accordingly. Edges will be taken care of later. Assume aux
2207 pointers to point to the copies of each BB. Return true if any
2208 debug stmts are left after a statement that must end the basic block. */
2211 copy_edges_for_bb (basic_block bb
, profile_count num
, profile_count den
,
2212 basic_block ret_bb
, basic_block abnormal_goto_dest
)
2214 basic_block new_bb
= (basic_block
) bb
->aux
;
2217 gimple_stmt_iterator si
;
2219 bool need_debug_cleanup
= false;
2220 bool scale
= num
.initialized_p ()
2221 && (den
> 0 || num
== profile_count::zero ());
2223 /* Use the indices from the original blocks to create edges for the
2225 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2226 if (!(old_edge
->flags
& EDGE_EH
))
2230 flags
= old_edge
->flags
;
2232 /* Return edges do get a FALLTHRU flag when the get inlined. */
2233 if (old_edge
->dest
->index
== EXIT_BLOCK
2234 && !(old_edge
->flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2235 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2236 flags
|= EDGE_FALLTHRU
;
2237 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2239 new_edge
->count
= old_edge
->count
.apply_scale (num
, den
);
2240 new_edge
->probability
= old_edge
->probability
;
2243 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2246 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2249 bool can_throw
, nonlocal_goto
;
2251 copy_stmt
= gsi_stmt (si
);
2252 if (!is_gimple_debug (copy_stmt
))
2253 update_stmt (copy_stmt
);
2255 /* Do this before the possible split_block. */
2258 /* If this tree could throw an exception, there are two
2259 cases where we need to add abnormal edge(s): the
2260 tree wasn't in a region and there is a "current
2261 region" in the caller; or the original tree had
2262 EH edges. In both cases split the block after the tree,
2263 and add abnormal edge(s) as needed; we need both
2264 those from the callee and the caller.
2265 We check whether the copy can throw, because the const
2266 propagation can change an INDIRECT_REF which throws
2267 into a COMPONENT_REF which doesn't. If the copy
2268 can throw, the original could also throw. */
2269 can_throw
= stmt_can_throw_internal (copy_stmt
);
2271 = (stmt_can_make_abnormal_goto (copy_stmt
)
2272 && !computed_goto_p (copy_stmt
));
2274 if (can_throw
|| nonlocal_goto
)
2276 if (!gsi_end_p (si
))
2278 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2281 need_debug_cleanup
= true;
2283 if (!gsi_end_p (si
))
2284 /* Note that bb's predecessor edges aren't necessarily
2285 right at this point; split_block doesn't care. */
2287 edge e
= split_block (new_bb
, copy_stmt
);
2290 new_bb
->aux
= e
->src
->aux
;
2291 si
= gsi_start_bb (new_bb
);
2295 bool update_probs
= false;
2297 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2299 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2300 update_probs
= true;
2304 make_eh_edges (copy_stmt
);
2305 update_probs
= true;
2308 /* EH edges may not match old edges. Copy as much as possible. */
2313 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2315 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2316 if ((old_edge
->flags
& EDGE_EH
)
2317 && (e
= find_edge (copy_stmt_bb
,
2318 (basic_block
) old_edge
->dest
->aux
))
2319 && (e
->flags
& EDGE_EH
))
2321 e
->probability
= old_edge
->probability
;
2322 e
->count
= old_edge
->count
;
2325 FOR_EACH_EDGE (e
, ei
, copy_stmt_bb
->succs
)
2326 if ((e
->flags
& EDGE_EH
) && !e
->probability
.initialized_p ())
2328 e
->probability
= profile_probability::never ();
2329 e
->count
= profile_count::zero ();
2334 /* If the call we inline cannot make abnormal goto do not add
2335 additional abnormal edges but only retain those already present
2336 in the original function body. */
2337 if (abnormal_goto_dest
== NULL
)
2338 nonlocal_goto
= false;
2341 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2343 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2344 nonlocal_goto
= false;
2345 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2346 in OpenMP regions which aren't allowed to be left abnormally.
2347 So, no need to add abnormal edge in that case. */
2348 else if (is_gimple_call (copy_stmt
)
2349 && gimple_call_internal_p (copy_stmt
)
2350 && (gimple_call_internal_fn (copy_stmt
)
2351 == IFN_ABNORMAL_DISPATCHER
)
2352 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2353 nonlocal_goto
= false;
2355 make_single_succ_edge (copy_stmt_bb
, abnormal_goto_dest
,
2359 if ((can_throw
|| nonlocal_goto
)
2360 && gimple_in_ssa_p (cfun
))
2361 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2362 can_throw
, nonlocal_goto
);
2364 return need_debug_cleanup
;
2367 /* Copy the PHIs. All blocks and edges are copied, some blocks
2368 was possibly split and new outgoing EH edges inserted.
2369 BB points to the block of original function and AUX pointers links
2370 the original and newly copied blocks. */
2373 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2375 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2380 bool inserted
= false;
2382 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2388 res
= PHI_RESULT (phi
);
2390 if (!virtual_operand_p (res
))
2392 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2393 if (EDGE_COUNT (new_bb
->preds
) == 0)
2395 /* Technically we'd want a SSA_DEFAULT_DEF here... */
2396 SSA_NAME_DEF_STMT (new_res
) = gimple_build_nop ();
2400 new_phi
= create_phi_node (new_res
, new_bb
);
2401 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2403 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
,
2410 /* When doing partial cloning, we allow PHIs on the entry
2411 block as long as all the arguments are the same.
2412 Find any input edge to see argument to copy. */
2414 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2415 if (!old_edge
->src
->aux
)
2418 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2420 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2421 gcc_assert (new_arg
);
2422 /* With return slot optimization we can end up with
2423 non-gimple (foo *)&this->m, fix that here. */
2424 if (TREE_CODE (new_arg
) != SSA_NAME
2425 && TREE_CODE (new_arg
) != FUNCTION_DECL
2426 && !is_gimple_val (new_arg
))
2428 gimple_seq stmts
= NULL
;
2429 new_arg
= force_gimple_operand (new_arg
, &stmts
, true,
2431 gsi_insert_seq_on_edge (new_edge
, stmts
);
2434 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2435 if (LOCATION_BLOCK (locus
))
2438 n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
2440 locus
= set_block (locus
, *n
);
2443 locus
= LOCATION_LOCUS (locus
);
2445 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2451 /* Commit the delayed edge insertions. */
2453 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2454 gsi_commit_one_edge_insert (new_edge
, NULL
);
2458 /* Wrapper for remap_decl so it can be used as a callback. */
2461 remap_decl_1 (tree decl
, void *data
)
2463 return remap_decl (decl
, (copy_body_data
*) data
);
2466 /* Build struct function and associated datastructures for the new clone
2467 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2468 the cfun to the function of new_fndecl (and current_function_decl too). */
2471 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, profile_count count
)
2473 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2475 if (!DECL_ARGUMENTS (new_fndecl
))
2476 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2477 if (!DECL_RESULT (new_fndecl
))
2478 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2480 /* Register specific tree functions. */
2481 gimple_register_cfg_hooks ();
2483 /* Get clean struct function. */
2484 push_struct_function (new_fndecl
);
2486 /* We will rebuild these, so just sanity check that they are empty. */
2487 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2488 gcc_assert (cfun
->local_decls
== NULL
);
2489 gcc_assert (cfun
->cfg
== NULL
);
2490 gcc_assert (cfun
->decl
== new_fndecl
);
2492 /* Copy items we preserve during cloning. */
2493 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2494 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2495 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2496 cfun
->curr_properties
= src_cfun
->curr_properties
;
2497 cfun
->last_verified
= src_cfun
->last_verified
;
2498 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2499 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2500 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2501 cfun
->stdarg
= src_cfun
->stdarg
;
2502 cfun
->after_inlining
= src_cfun
->after_inlining
;
2503 cfun
->can_throw_non_call_exceptions
2504 = src_cfun
->can_throw_non_call_exceptions
;
2505 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2506 cfun
->returns_struct
= src_cfun
->returns_struct
;
2507 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2509 init_empty_tree_cfg ();
2511 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2513 /* FIXME: When all counts are known to be zero, scaling is also meaningful.
2515 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.initialized_p ()
2516 && count
.initialized_p ()
2517 && ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.initialized_p ())
2519 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2520 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2521 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2522 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2523 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2524 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2526 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2527 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2528 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2529 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2531 init_eh_for_function ();
2533 if (src_cfun
->gimple_df
)
2535 init_tree_ssa (cfun
);
2536 cfun
->gimple_df
->in_ssa_p
= src_cfun
->gimple_df
->in_ssa_p
;
2537 if (cfun
->gimple_df
->in_ssa_p
)
2538 init_ssa_operands (cfun
);
2542 /* Helper function for copy_cfg_body. Move debug stmts from the end
2543 of NEW_BB to the beginning of successor basic blocks when needed. If the
2544 successor has multiple predecessors, reset them, otherwise keep
2548 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2552 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2555 || gsi_one_before_end_p (si
)
2556 || !(stmt_can_throw_internal (gsi_stmt (si
))
2557 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2560 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2562 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2563 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2564 while (is_gimple_debug (gsi_stmt (ssi
)))
2566 gimple
*stmt
= gsi_stmt (ssi
);
2571 /* For the last edge move the debug stmts instead of copying
2573 if (ei_one_before_end_p (ei
))
2577 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2578 gimple_debug_bind_reset_value (stmt
);
2579 gsi_remove (&si
, false);
2580 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2584 if (gimple_debug_bind_p (stmt
))
2586 var
= gimple_debug_bind_get_var (stmt
);
2587 if (single_pred_p (e
->dest
))
2589 value
= gimple_debug_bind_get_value (stmt
);
2590 value
= unshare_expr (value
);
2594 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2596 else if (gimple_debug_source_bind_p (stmt
))
2598 var
= gimple_debug_source_bind_get_var (stmt
);
2599 value
= gimple_debug_source_bind_get_value (stmt
);
2600 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2604 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2605 id
->debug_stmts
.safe_push (new_stmt
);
2611 /* Make a copy of the sub-loops of SRC_PARENT and place them
2612 as siblings of DEST_PARENT. */
2615 copy_loops (copy_body_data
*id
,
2616 struct loop
*dest_parent
, struct loop
*src_parent
)
2618 struct loop
*src_loop
= src_parent
->inner
;
2621 if (!id
->blocks_to_copy
2622 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2624 struct loop
*dest_loop
= alloc_loop ();
2626 /* Assign the new loop its header and latch and associate
2627 those with the new loop. */
2628 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2629 dest_loop
->header
->loop_father
= dest_loop
;
2630 if (src_loop
->latch
!= NULL
)
2632 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2633 dest_loop
->latch
->loop_father
= dest_loop
;
2636 /* Copy loop meta-data. */
2637 copy_loop_info (src_loop
, dest_loop
);
2639 /* Finally place it into the loop array and the loop tree. */
2640 place_new_loop (cfun
, dest_loop
);
2641 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2643 dest_loop
->safelen
= src_loop
->safelen
;
2644 dest_loop
->dont_vectorize
= src_loop
->dont_vectorize
;
2645 if (src_loop
->force_vectorize
)
2647 dest_loop
->force_vectorize
= true;
2648 cfun
->has_force_vectorize_loops
= true;
2650 if (src_loop
->simduid
)
2652 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2653 cfun
->has_simduid_loops
= true;
2657 copy_loops (id
, dest_loop
, src_loop
);
2659 src_loop
= src_loop
->next
;
2663 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2666 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2668 gimple_stmt_iterator si
;
2669 gimple
*last
= last_stmt (bb
);
2670 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2672 gimple
*stmt
= gsi_stmt (si
);
2673 if (is_gimple_call (stmt
))
2675 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2678 edge
->redirect_call_stmt_to_callee ();
2679 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
2680 gimple_purge_dead_eh_edges (bb
);
2686 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2687 with each bb's frequency. Used when NODE has a 0-weight entry
2688 but we are about to inline it into a non-zero count call bb.
2689 See the comments for handle_missing_profiles() in predict.c for
2690 when this can happen for COMDATs. */
2693 freqs_to_counts (struct cgraph_node
*node
, profile_count count
)
2698 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2700 FOR_ALL_BB_FN(bb
, fn
)
2702 bb
->count
= count
.apply_scale (bb
->frequency
, BB_FREQ_MAX
);
2703 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2704 e
->count
= e
->src
->count
.apply_probability (e
->probability
);
2708 /* Make a copy of the body of FN so that it can be inserted inline in
2709 another function. Walks FN via CFG, returns new fndecl. */
2712 copy_cfg_body (copy_body_data
* id
, profile_count count
, int frequency_scale
,
2713 basic_block entry_block_map
, basic_block exit_block_map
,
2714 basic_block new_entry
)
2716 tree callee_fndecl
= id
->src_fn
;
2717 /* Original cfun for the callee, doesn't change. */
2718 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2719 struct function
*cfun_to_copy
;
2721 tree new_fndecl
= NULL
;
2722 bool need_debug_cleanup
= false;
2724 int incoming_frequency
= 0;
2725 profile_count incoming_count
= profile_count::zero ();
2726 profile_count num
= count
;
2727 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2728 bool scale
= num
.initialized_p ()
2729 && (den
> 0 || num
== profile_count::zero ());
2731 /* This can happen for COMDAT routines that end up with 0 counts
2732 despite being called (see the comments for handle_missing_profiles()
2733 in predict.c as to why). Apply counts to the blocks in the callee
2734 before inlining, using the guessed edge frequencies, so that we don't
2735 end up with a 0-count inline body which can confuse downstream
2736 optimizations such as function splitting. */
2737 if (!(ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
> 0) && count
> 0)
2739 /* Apply the larger of the call bb count and the total incoming
2740 call edge count to the callee. */
2741 profile_count in_count
= profile_count::zero ();
2742 struct cgraph_edge
*in_edge
;
2743 for (in_edge
= id
->src_node
->callers
; in_edge
;
2744 in_edge
= in_edge
->next_caller
)
2745 if (in_edge
->count
.initialized_p ())
2746 in_count
+= in_edge
->count
;
2747 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2750 /* Register specific tree functions. */
2751 gimple_register_cfg_hooks ();
2753 /* If we are inlining just region of the function, make sure to connect
2754 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2755 part of loop, we must compute frequency and probability of
2756 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2757 probabilities of edges incoming from nonduplicated region. */
2763 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2766 incoming_frequency
+= EDGE_FREQUENCY (e
);
2767 incoming_count
+= e
->count
;
2770 incoming_count
= incoming_count
.apply_scale (num
, den
);
2772 incoming_count
= profile_count::uninitialized ();
2774 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2775 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2776 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2779 /* Must have a CFG here at this point. */
2780 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2781 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2783 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2785 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2786 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2787 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2788 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2790 /* Duplicate any exception-handling regions. */
2792 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2795 /* Use aux pointers to map the original blocks to copy. */
2796 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2797 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2799 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, num
, den
);
2802 new_bb
->loop_father
= entry_block_map
->loop_father
;
2805 last
= last_basic_block_for_fn (cfun
);
2807 /* Now that we've duplicated the blocks, duplicate their edges. */
2808 basic_block abnormal_goto_dest
= NULL
;
2810 && stmt_can_make_abnormal_goto (id
->call_stmt
))
2812 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
2814 bb
= gimple_bb (id
->call_stmt
);
2816 if (gsi_end_p (gsi
))
2817 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2819 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2820 if (!id
->blocks_to_copy
2821 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2822 need_debug_cleanup
|= copy_edges_for_bb (bb
, num
, den
, exit_block_map
,
2823 abnormal_goto_dest
);
2827 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2828 e
->probability
= profile_probability::always ();
2829 e
->count
= incoming_count
;
2832 /* Duplicate the loop tree, if available and wanted. */
2833 if (loops_for_fn (src_cfun
) != NULL
2834 && current_loops
!= NULL
)
2836 copy_loops (id
, entry_block_map
->loop_father
,
2837 get_loop (src_cfun
, 0));
2838 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2839 loops_state_set (LOOPS_NEED_FIXUP
);
2842 /* If the loop tree in the source function needed fixup, mark the
2843 destination loop tree for fixup, too. */
2844 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2845 loops_state_set (LOOPS_NEED_FIXUP
);
2847 if (gimple_in_ssa_p (cfun
))
2848 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2849 if (!id
->blocks_to_copy
2850 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2851 copy_phis_for_bb (bb
, id
);
2853 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2856 if (need_debug_cleanup
2857 && bb
->index
!= ENTRY_BLOCK
2858 && bb
->index
!= EXIT_BLOCK
)
2859 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2860 /* Update call edge destinations. This can not be done before loop
2861 info is updated, because we may split basic blocks. */
2862 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
2863 && bb
->index
!= ENTRY_BLOCK
2864 && bb
->index
!= EXIT_BLOCK
)
2865 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2866 ((basic_block
)bb
->aux
)->aux
= NULL
;
2870 /* Zero out AUX fields of newly created block during EH edge
2872 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2874 if (need_debug_cleanup
)
2875 maybe_move_debug_stmts_to_successors (id
,
2876 BASIC_BLOCK_FOR_FN (cfun
, last
));
2877 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2878 /* Update call edge destinations. This can not be done before loop
2879 info is updated, because we may split basic blocks. */
2880 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2881 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2883 entry_block_map
->aux
= NULL
;
2884 exit_block_map
->aux
= NULL
;
2891 if (id
->dependence_map
)
2893 delete id
->dependence_map
;
2894 id
->dependence_map
= NULL
;
2900 /* Copy the debug STMT using ID. We deal with these statements in a
2901 special way: if any variable in their VALUE expression wasn't
2902 remapped yet, we won't remap it, because that would get decl uids
2903 out of sync, causing codegen differences between -g and -g0. If
2904 this arises, we drop the VALUE expression altogether. */
2907 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
2910 struct walk_stmt_info wi
;
2912 if (gimple_block (stmt
))
2914 n
= id
->decl_map
->get (gimple_block (stmt
));
2915 gimple_set_block (stmt
, n
? *n
: id
->block
);
2918 /* Remap all the operands in COPY. */
2919 memset (&wi
, 0, sizeof (wi
));
2922 processing_debug_stmt
= 1;
2924 if (gimple_debug_source_bind_p (stmt
))
2925 t
= gimple_debug_source_bind_get_var (stmt
);
2927 t
= gimple_debug_bind_get_var (stmt
);
2929 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2930 && (n
= id
->debug_map
->get (t
)))
2932 gcc_assert (VAR_P (*n
));
2935 else if (VAR_P (t
) && !is_global_var (t
) && !id
->decl_map
->get (t
))
2936 /* T is a non-localized variable. */;
2938 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2940 if (gimple_debug_bind_p (stmt
))
2942 gimple_debug_bind_set_var (stmt
, t
);
2944 if (gimple_debug_bind_has_value_p (stmt
))
2945 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2946 remap_gimple_op_r
, &wi
, NULL
);
2948 /* Punt if any decl couldn't be remapped. */
2949 if (processing_debug_stmt
< 0)
2950 gimple_debug_bind_reset_value (stmt
);
2952 else if (gimple_debug_source_bind_p (stmt
))
2954 gimple_debug_source_bind_set_var (stmt
, t
);
2955 /* When inlining and source bind refers to one of the optimized
2956 away parameters, change the source bind into normal debug bind
2957 referring to the corresponding DEBUG_EXPR_DECL that should have
2958 been bound before the call stmt. */
2959 t
= gimple_debug_source_bind_get_value (stmt
);
2961 && TREE_CODE (t
) == PARM_DECL
2964 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2966 if (debug_args
!= NULL
)
2968 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2969 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2970 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2972 t
= (**debug_args
)[i
+ 1];
2973 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2974 gimple_debug_bind_set_value (stmt
, t
);
2979 if (gimple_debug_source_bind_p (stmt
))
2980 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2981 remap_gimple_op_r
, &wi
, NULL
);
2984 processing_debug_stmt
= 0;
2989 /* Process deferred debug stmts. In order to give values better odds
2990 of being successfully remapped, we delay the processing of debug
2991 stmts until all other stmts that might require remapping are
2995 copy_debug_stmts (copy_body_data
*id
)
3000 if (!id
->debug_stmts
.exists ())
3003 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
3004 copy_debug_stmt (stmt
, id
);
3006 id
->debug_stmts
.release ();
3009 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
3010 another function. */
3013 copy_tree_body (copy_body_data
*id
)
3015 tree fndecl
= id
->src_fn
;
3016 tree body
= DECL_SAVED_TREE (fndecl
);
3018 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
3023 /* Make a copy of the body of FN so that it can be inserted inline in
3024 another function. */
3027 copy_body (copy_body_data
*id
, profile_count count
, int frequency_scale
,
3028 basic_block entry_block_map
, basic_block exit_block_map
,
3029 basic_block new_entry
)
3031 tree fndecl
= id
->src_fn
;
3034 /* If this body has a CFG, walk CFG and copy. */
3035 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
3036 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
3038 copy_debug_stmts (id
);
3043 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
3044 defined in function FN, or of a data member thereof. */
3047 self_inlining_addr_expr (tree value
, tree fn
)
3051 if (TREE_CODE (value
) != ADDR_EXPR
)
3054 var
= get_base_address (TREE_OPERAND (value
, 0));
3056 return var
&& auto_var_in_fn_p (var
, fn
);
3059 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
3060 lexical block and line number information from base_stmt, if given,
3061 or from the last stmt of the block otherwise. */
3064 insert_init_debug_bind (copy_body_data
*id
,
3065 basic_block bb
, tree var
, tree value
,
3069 gimple_stmt_iterator gsi
;
3072 if (!gimple_in_ssa_p (id
->src_cfun
))
3075 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
3078 tracked_var
= target_for_debug_bind (var
);
3084 gsi
= gsi_last_bb (bb
);
3085 if (!base_stmt
&& !gsi_end_p (gsi
))
3086 base_stmt
= gsi_stmt (gsi
);
3089 note
= gimple_build_debug_bind (tracked_var
, unshare_expr (value
), base_stmt
);
3093 if (!gsi_end_p (gsi
))
3094 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
3096 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3103 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple
*init_stmt
)
3105 /* If VAR represents a zero-sized variable, it's possible that the
3106 assignment statement may result in no gimple statements. */
3109 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3111 /* We can end up with init statements that store to a non-register
3112 from a rhs with a conversion. Handle that here by forcing the
3113 rhs into a temporary. gimple_regimplify_operands is not
3114 prepared to do this for us. */
3115 if (!is_gimple_debug (init_stmt
)
3116 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3117 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3118 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3120 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3121 gimple_expr_type (init_stmt
),
3122 gimple_assign_rhs1 (init_stmt
));
3123 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3125 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3126 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3128 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3129 gimple_regimplify_operands (init_stmt
, &si
);
3131 if (!is_gimple_debug (init_stmt
))
3133 tree def
= gimple_assign_lhs (init_stmt
);
3134 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3139 /* Initialize parameter P with VALUE. If needed, produce init statement
3140 at the end of BB. When BB is NULL, we return init statement to be
3143 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3144 basic_block bb
, tree
*vars
)
3146 gimple
*init_stmt
= NULL
;
3149 tree def
= (gimple_in_ssa_p (cfun
)
3150 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3153 && value
!= error_mark_node
3154 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3156 /* If we can match up types by promotion/demotion do so. */
3157 if (fold_convertible_p (TREE_TYPE (p
), value
))
3158 rhs
= fold_convert (TREE_TYPE (p
), value
);
3161 /* ??? For valid programs we should not end up here.
3162 Still if we end up with truly mismatched types here, fall back
3163 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3164 GIMPLE to the following passes. */
3165 if (!is_gimple_reg_type (TREE_TYPE (value
))
3166 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
3167 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
3169 rhs
= build_zero_cst (TREE_TYPE (p
));
3173 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3174 here since the type of this decl must be visible to the calling
3176 var
= copy_decl_to_var (p
, id
);
3178 /* Declare this new variable. */
3179 DECL_CHAIN (var
) = *vars
;
3182 /* Make gimplifier happy about this variable. */
3183 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3185 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3186 we would not need to create a new variable here at all, if it
3187 weren't for debug info. Still, we can just use the argument
3189 if (TREE_READONLY (p
)
3190 && !TREE_ADDRESSABLE (p
)
3191 && value
&& !TREE_SIDE_EFFECTS (value
)
3194 /* We may produce non-gimple trees by adding NOPs or introduce
3195 invalid sharing when operand is not really constant.
3196 It is not big deal to prohibit constant propagation here as
3197 we will constant propagate in DOM1 pass anyway. */
3198 if (is_gimple_min_invariant (value
)
3199 && useless_type_conversion_p (TREE_TYPE (p
),
3201 /* We have to be very careful about ADDR_EXPR. Make sure
3202 the base variable isn't a local variable of the inlined
3203 function, e.g., when doing recursive inlining, direct or
3204 mutually-recursive or whatever, which is why we don't
3205 just test whether fn == current_function_decl. */
3206 && ! self_inlining_addr_expr (value
, fn
))
3208 insert_decl_map (id
, p
, value
);
3209 insert_debug_decl_map (id
, p
, var
);
3210 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3214 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3215 that way, when the PARM_DECL is encountered, it will be
3216 automatically replaced by the VAR_DECL. */
3217 insert_decl_map (id
, p
, var
);
3219 /* Even if P was TREE_READONLY, the new VAR should not be.
3220 In the original code, we would have constructed a
3221 temporary, and then the function body would have never
3222 changed the value of P. However, now, we will be
3223 constructing VAR directly. The constructor body may
3224 change its value multiple times as it is being
3225 constructed. Therefore, it must not be TREE_READONLY;
3226 the back-end assumes that TREE_READONLY variable is
3227 assigned to only once. */
3228 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
3229 TREE_READONLY (var
) = 0;
3231 /* If there is no setup required and we are in SSA, take the easy route
3232 replacing all SSA names representing the function parameter by the
3233 SSA name passed to function.
3235 We need to construct map for the variable anyway as it might be used
3236 in different SSA names when parameter is set in function.
3238 Do replacement at -O0 for const arguments replaced by constant.
3239 This is important for builtin_constant_p and other construct requiring
3240 constant argument to be visible in inlined function body. */
3241 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3243 || (TREE_READONLY (p
)
3244 && is_gimple_min_invariant (rhs
)))
3245 && (TREE_CODE (rhs
) == SSA_NAME
3246 || is_gimple_min_invariant (rhs
))
3247 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3249 insert_decl_map (id
, def
, rhs
);
3250 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3253 /* If the value of argument is never used, don't care about initializing
3255 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3257 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3258 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3261 /* Initialize this VAR_DECL from the equivalent argument. Convert
3262 the argument to the proper type in case it was promoted. */
3265 if (rhs
== error_mark_node
)
3267 insert_decl_map (id
, p
, var
);
3268 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3271 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3273 /* If we are in SSA form properly remap the default definition
3274 or assign to a dummy SSA name if the parameter is unused and
3275 we are not optimizing. */
3276 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3280 def
= remap_ssa_name (def
, id
);
3281 init_stmt
= gimple_build_assign (def
, rhs
);
3282 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3283 set_ssa_default_def (cfun
, var
, NULL
);
3287 def
= make_ssa_name (var
);
3288 init_stmt
= gimple_build_assign (def
, rhs
);
3292 init_stmt
= gimple_build_assign (var
, rhs
);
3294 if (bb
&& init_stmt
)
3295 insert_init_stmt (id
, bb
, init_stmt
);
3300 /* Generate code to initialize the parameters of the function at the
3301 top of the stack in ID from the GIMPLE_CALL STMT. */
3304 initialize_inlined_parameters (copy_body_data
*id
, gimple
*stmt
,
3305 tree fn
, basic_block bb
)
3310 tree vars
= NULL_TREE
;
3311 tree static_chain
= gimple_call_chain (stmt
);
3313 /* Figure out what the parameters are. */
3314 parms
= DECL_ARGUMENTS (fn
);
3316 /* Loop through the parameter declarations, replacing each with an
3317 equivalent VAR_DECL, appropriately initialized. */
3318 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3321 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3322 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3324 /* After remapping parameters remap their types. This has to be done
3325 in a second loop over all parameters to appropriately remap
3326 variable sized arrays when the size is specified in a
3327 parameter following the array. */
3328 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3330 tree
*varp
= id
->decl_map
->get (p
);
3331 if (varp
&& VAR_P (*varp
))
3333 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3334 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3336 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3337 /* Also remap the default definition if it was remapped
3338 to the default definition of the parameter replacement
3339 by the parameter setup. */
3342 tree
*defp
= id
->decl_map
->get (def
);
3344 && TREE_CODE (*defp
) == SSA_NAME
3345 && SSA_NAME_VAR (*defp
) == var
)
3346 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3351 /* Initialize the static chain. */
3352 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3353 gcc_assert (fn
!= current_function_decl
);
3356 /* No static chain? Seems like a bug in tree-nested.c. */
3357 gcc_assert (static_chain
);
3359 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3362 declare_inline_vars (id
->block
, vars
);
3366 /* Declare a return variable to replace the RESULT_DECL for the
3367 function we are calling. An appropriate DECL_STMT is returned.
3368 The USE_STMT is filled to contain a use of the declaration to
3369 indicate the return value of the function.
3371 RETURN_SLOT, if non-null is place where to store the result. It
3372 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3373 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3375 RETURN_BOUNDS holds a destination for returned bounds.
3377 The return value is a (possibly null) value that holds the result
3378 as seen by the caller. */
3381 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3382 tree return_bounds
, basic_block entry_bb
)
3384 tree callee
= id
->src_fn
;
3385 tree result
= DECL_RESULT (callee
);
3386 tree callee_type
= TREE_TYPE (result
);
3390 /* Handle type-mismatches in the function declaration return type
3391 vs. the call expression. */
3393 caller_type
= TREE_TYPE (modify_dest
);
3395 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3397 /* We don't need to do anything for functions that don't return anything. */
3398 if (VOID_TYPE_P (callee_type
))
3401 /* If there was a return slot, then the return value is the
3402 dereferenced address of that object. */
3405 /* The front end shouldn't have used both return_slot and
3406 a modify expression. */
3407 gcc_assert (!modify_dest
);
3408 if (DECL_BY_REFERENCE (result
))
3410 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3411 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3413 /* We are going to construct *&return_slot and we can't do that
3414 for variables believed to be not addressable.
3416 FIXME: This check possibly can match, because values returned
3417 via return slot optimization are not believed to have address
3418 taken by alias analysis. */
3419 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3420 var
= return_slot_addr
;
3425 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3426 if (TREE_ADDRESSABLE (result
))
3427 mark_addressable (var
);
3429 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3430 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3431 && !DECL_GIMPLE_REG_P (result
)
3433 DECL_GIMPLE_REG_P (var
) = 0;
3438 /* All types requiring non-trivial constructors should have been handled. */
3439 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3441 /* Attempt to avoid creating a new temporary variable. */
3443 && TREE_CODE (modify_dest
) != SSA_NAME
)
3445 bool use_it
= false;
3447 /* We can't use MODIFY_DEST if there's type promotion involved. */
3448 if (!useless_type_conversion_p (callee_type
, caller_type
))
3451 /* ??? If we're assigning to a variable sized type, then we must
3452 reuse the destination variable, because we've no good way to
3453 create variable sized temporaries at this point. */
3454 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3457 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3458 reuse it as the result of the call directly. Don't do this if
3459 it would promote MODIFY_DEST to addressable. */
3460 else if (TREE_ADDRESSABLE (result
))
3464 tree base_m
= get_base_address (modify_dest
);
3466 /* If the base isn't a decl, then it's a pointer, and we don't
3467 know where that's going to go. */
3468 if (!DECL_P (base_m
))
3470 else if (is_global_var (base_m
))
3472 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3473 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3474 && !DECL_GIMPLE_REG_P (result
)
3475 && DECL_GIMPLE_REG_P (base_m
))
3477 else if (!TREE_ADDRESSABLE (base_m
))
3489 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3491 var
= copy_result_decl_to_var (result
, id
);
3492 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3494 /* Do not have the rest of GCC warn about this variable as it should
3495 not be visible to the user. */
3496 TREE_NO_WARNING (var
) = 1;
3498 declare_inline_vars (id
->block
, var
);
3500 /* Build the use expr. If the return type of the function was
3501 promoted, convert it back to the expected type. */
3503 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3505 /* If we can match up types by promotion/demotion do so. */
3506 if (fold_convertible_p (caller_type
, var
))
3507 use
= fold_convert (caller_type
, var
);
3510 /* ??? For valid programs we should not end up here.
3511 Still if we end up with truly mismatched types here, fall back
3512 to using a MEM_REF to not leak invalid GIMPLE to the following
3514 /* Prevent var from being written into SSA form. */
3515 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3516 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3517 DECL_GIMPLE_REG_P (var
) = false;
3518 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3519 TREE_ADDRESSABLE (var
) = true;
3520 use
= fold_build2 (MEM_REF
, caller_type
,
3521 build_fold_addr_expr (var
),
3522 build_int_cst (ptr_type_node
, 0));
3526 STRIP_USELESS_TYPE_CONVERSION (use
);
3528 if (DECL_BY_REFERENCE (result
))
3530 TREE_ADDRESSABLE (var
) = 1;
3531 var
= build_fold_addr_expr (var
);
3535 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3536 way, when the RESULT_DECL is encountered, it will be
3537 automatically replaced by the VAR_DECL.
3539 When returning by reference, ensure that RESULT_DECL remaps to
3541 if (DECL_BY_REFERENCE (result
)
3542 && !is_gimple_val (var
))
3544 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3545 insert_decl_map (id
, result
, temp
);
3546 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3547 it's default_def SSA_NAME. */
3548 if (gimple_in_ssa_p (id
->src_cfun
)
3549 && is_gimple_reg (result
))
3551 temp
= make_ssa_name (temp
);
3552 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3554 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3557 insert_decl_map (id
, result
, var
);
3559 /* Remember this so we can ignore it in remap_decls. */
3562 /* If returned bounds are used, then make var for them. */
3565 tree bndtemp
= create_tmp_var (pointer_bounds_type_node
, "retbnd");
3566 DECL_SEEN_IN_BIND_EXPR_P (bndtemp
) = 1;
3567 TREE_NO_WARNING (bndtemp
) = 1;
3568 declare_inline_vars (id
->block
, bndtemp
);
3570 id
->retbnd
= bndtemp
;
3571 insert_init_stmt (id
, entry_bb
,
3572 gimple_build_assign (bndtemp
, chkp_get_zero_bounds_var ()));
3578 /* Determine if the function can be copied. If so return NULL. If
3579 not return a string describng the reason for failure. */
3582 copy_forbidden (struct function
*fun
)
3584 const char *reason
= fun
->cannot_be_copied_reason
;
3586 /* Only examine the function once. */
3587 if (fun
->cannot_be_copied_set
)
3590 /* We cannot copy a function that receives a non-local goto
3591 because we cannot remap the destination label used in the
3592 function that is performing the non-local goto. */
3593 /* ??? Actually, this should be possible, if we work at it.
3594 No doubt there's just a handful of places that simply
3595 assume it doesn't happen and don't substitute properly. */
3596 if (fun
->has_nonlocal_label
)
3598 reason
= G_("function %q+F can never be copied "
3599 "because it receives a non-local goto");
3603 if (fun
->has_forced_label_in_static
)
3605 reason
= G_("function %q+F can never be copied because it saves "
3606 "address of local label in a static variable");
3611 fun
->cannot_be_copied_reason
= reason
;
3612 fun
->cannot_be_copied_set
= true;
3617 static const char *inline_forbidden_reason
;
3619 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3620 iff a function can not be inlined. Also sets the reason why. */
3623 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3624 struct walk_stmt_info
*wip
)
3626 tree fn
= (tree
) wip
->info
;
3628 gimple
*stmt
= gsi_stmt (*gsi
);
3630 switch (gimple_code (stmt
))
3633 /* Refuse to inline alloca call unless user explicitly forced so as
3634 this may change program's memory overhead drastically when the
3635 function using alloca is called in loop. In GCC present in
3636 SPEC2000 inlining into schedule_block cause it to require 2GB of
3637 RAM instead of 256MB. Don't do so for alloca calls emitted for
3638 VLA objects as those can't cause unbounded growth (they're always
3639 wrapped inside stack_save/stack_restore regions. */
3640 if (gimple_maybe_alloca_call_p (stmt
)
3641 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3642 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3644 inline_forbidden_reason
3645 = G_("function %q+F can never be inlined because it uses "
3646 "alloca (override using the always_inline attribute)");
3647 *handled_ops_p
= true;
3651 t
= gimple_call_fndecl (stmt
);
3655 /* We cannot inline functions that call setjmp. */
3656 if (setjmp_call_p (t
))
3658 inline_forbidden_reason
3659 = G_("function %q+F can never be inlined because it uses setjmp");
3660 *handled_ops_p
= true;
3664 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3665 switch (DECL_FUNCTION_CODE (t
))
3667 /* We cannot inline functions that take a variable number of
3669 case BUILT_IN_VA_START
:
3670 case BUILT_IN_NEXT_ARG
:
3671 case BUILT_IN_VA_END
:
3672 inline_forbidden_reason
3673 = G_("function %q+F can never be inlined because it "
3674 "uses variable argument lists");
3675 *handled_ops_p
= true;
3678 case BUILT_IN_LONGJMP
:
3679 /* We can't inline functions that call __builtin_longjmp at
3680 all. The non-local goto machinery really requires the
3681 destination be in a different function. If we allow the
3682 function calling __builtin_longjmp to be inlined into the
3683 function calling __builtin_setjmp, Things will Go Awry. */
3684 inline_forbidden_reason
3685 = G_("function %q+F can never be inlined because "
3686 "it uses setjmp-longjmp exception handling");
3687 *handled_ops_p
= true;
3690 case BUILT_IN_NONLOCAL_GOTO
:
3692 inline_forbidden_reason
3693 = G_("function %q+F can never be inlined because "
3694 "it uses non-local goto");
3695 *handled_ops_p
= true;
3698 case BUILT_IN_RETURN
:
3699 case BUILT_IN_APPLY_ARGS
:
3700 /* If a __builtin_apply_args caller would be inlined,
3701 it would be saving arguments of the function it has
3702 been inlined into. Similarly __builtin_return would
3703 return from the function the inline has been inlined into. */
3704 inline_forbidden_reason
3705 = G_("function %q+F can never be inlined because "
3706 "it uses __builtin_return or __builtin_apply_args");
3707 *handled_ops_p
= true;
3716 t
= gimple_goto_dest (stmt
);
3718 /* We will not inline a function which uses computed goto. The
3719 addresses of its local labels, which may be tucked into
3720 global storage, are of course not constant across
3721 instantiations, which causes unexpected behavior. */
3722 if (TREE_CODE (t
) != LABEL_DECL
)
3724 inline_forbidden_reason
3725 = G_("function %q+F can never be inlined "
3726 "because it contains a computed goto");
3727 *handled_ops_p
= true;
3736 *handled_ops_p
= false;
3740 /* Return true if FNDECL is a function that cannot be inlined into
3744 inline_forbidden_p (tree fndecl
)
3746 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3747 struct walk_stmt_info wi
;
3749 bool forbidden_p
= false;
3751 /* First check for shared reasons not to copy the code. */
3752 inline_forbidden_reason
= copy_forbidden (fun
);
3753 if (inline_forbidden_reason
!= NULL
)
3756 /* Next, walk the statements of the function looking for
3757 constraucts we can't handle, or are non-optimal for inlining. */
3758 hash_set
<tree
> visited_nodes
;
3759 memset (&wi
, 0, sizeof (wi
));
3760 wi
.info
= (void *) fndecl
;
3761 wi
.pset
= &visited_nodes
;
3763 FOR_EACH_BB_FN (bb
, fun
)
3766 gimple_seq seq
= bb_seq (bb
);
3767 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3768 forbidden_p
= (ret
!= NULL
);
3776 /* Return false if the function FNDECL cannot be inlined on account of its
3777 attributes, true otherwise. */
3779 function_attribute_inlinable_p (const_tree fndecl
)
3781 if (targetm
.attribute_table
)
3785 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3787 const_tree name
= TREE_PURPOSE (a
);
3790 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3791 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3792 return targetm
.function_attribute_inlinable_p (fndecl
);
3799 /* Returns nonzero if FN is a function that does not have any
3800 fundamental inline blocking properties. */
3803 tree_inlinable_function_p (tree fn
)
3805 bool inlinable
= true;
3809 /* If we've already decided this function shouldn't be inlined,
3810 there's no need to check again. */
3811 if (DECL_UNINLINABLE (fn
))
3814 /* We only warn for functions declared `inline' by the user. */
3815 do_warning
= (warn_inline
3816 && DECL_DECLARED_INLINE_P (fn
)
3817 && !DECL_NO_INLINE_WARNING_P (fn
)
3818 && !DECL_IN_SYSTEM_HEADER (fn
));
3820 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3823 && always_inline
== NULL
)
3826 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3827 "is suppressed using -fno-inline", fn
);
3831 else if (!function_attribute_inlinable_p (fn
))
3834 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3835 "uses attributes conflicting with inlining", fn
);
3839 else if (inline_forbidden_p (fn
))
3841 /* See if we should warn about uninlinable functions. Previously,
3842 some of these warnings would be issued while trying to expand
3843 the function inline, but that would cause multiple warnings
3844 about functions that would for example call alloca. But since
3845 this a property of the function, just one warning is enough.
3846 As a bonus we can now give more details about the reason why a
3847 function is not inlinable. */
3849 error (inline_forbidden_reason
, fn
);
3850 else if (do_warning
)
3851 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3856 /* Squirrel away the result so that we don't have to check again. */
3857 DECL_UNINLINABLE (fn
) = !inlinable
;
3862 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
3863 word size and take possible memcpy call into account and return
3864 cost based on whether optimizing for size or speed according to SPEED_P. */
3867 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
3871 gcc_assert (!VOID_TYPE_P (type
));
3873 if (TREE_CODE (type
) == VECTOR_TYPE
)
3875 machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3877 = targetm
.vectorize
.preferred_simd_mode (inner
);
3878 int simd_mode_size
= GET_MODE_SIZE (simd
);
3879 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3883 size
= int_size_in_bytes (type
);
3885 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
3886 /* Cost of a memcpy call, 3 arguments and the call. */
3889 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3892 /* Returns cost of operation CODE, according to WEIGHTS */
3895 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3896 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3900 /* These are "free" conversions, or their presumed cost
3901 is folded into other operations. */
3906 case VIEW_CONVERT_EXPR
:
3909 /* Assign cost of 1 to usual operations.
3910 ??? We may consider mapping RTL costs to this. */
3916 case POINTER_PLUS_EXPR
:
3919 case MULT_HIGHPART_EXPR
:
3922 case ADDR_SPACE_CONVERT_EXPR
:
3923 case FIXED_CONVERT_EXPR
:
3924 case FIX_TRUNC_EXPR
:
3942 case TRUTH_ANDIF_EXPR
:
3943 case TRUTH_ORIF_EXPR
:
3944 case TRUTH_AND_EXPR
:
3946 case TRUTH_XOR_EXPR
:
3947 case TRUTH_NOT_EXPR
:
3956 case UNORDERED_EXPR
:
3967 case PREDECREMENT_EXPR
:
3968 case PREINCREMENT_EXPR
:
3969 case POSTDECREMENT_EXPR
:
3970 case POSTINCREMENT_EXPR
:
3972 case REALIGN_LOAD_EXPR
:
3974 case REDUC_MAX_EXPR
:
3975 case REDUC_MIN_EXPR
:
3976 case REDUC_PLUS_EXPR
:
3977 case WIDEN_SUM_EXPR
:
3978 case WIDEN_MULT_EXPR
:
3981 case WIDEN_MULT_PLUS_EXPR
:
3982 case WIDEN_MULT_MINUS_EXPR
:
3983 case WIDEN_LSHIFT_EXPR
:
3985 case VEC_WIDEN_MULT_HI_EXPR
:
3986 case VEC_WIDEN_MULT_LO_EXPR
:
3987 case VEC_WIDEN_MULT_EVEN_EXPR
:
3988 case VEC_WIDEN_MULT_ODD_EXPR
:
3989 case VEC_UNPACK_HI_EXPR
:
3990 case VEC_UNPACK_LO_EXPR
:
3991 case VEC_UNPACK_FLOAT_HI_EXPR
:
3992 case VEC_UNPACK_FLOAT_LO_EXPR
:
3993 case VEC_PACK_TRUNC_EXPR
:
3994 case VEC_PACK_SAT_EXPR
:
3995 case VEC_PACK_FIX_TRUNC_EXPR
:
3996 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3997 case VEC_WIDEN_LSHIFT_LO_EXPR
:
4001 /* Few special cases of expensive operations. This is useful
4002 to avoid inlining on functions having too many of these. */
4003 case TRUNC_DIV_EXPR
:
4005 case FLOOR_DIV_EXPR
:
4006 case ROUND_DIV_EXPR
:
4007 case EXACT_DIV_EXPR
:
4008 case TRUNC_MOD_EXPR
:
4010 case FLOOR_MOD_EXPR
:
4011 case ROUND_MOD_EXPR
:
4013 if (TREE_CODE (op2
) != INTEGER_CST
)
4014 return weights
->div_mod_cost
;
4017 /* Bit-field insertion needs several shift and mask operations. */
4018 case BIT_INSERT_EXPR
:
4022 /* We expect a copy assignment with no operator. */
4023 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
4029 /* Estimate number of instructions that will be created by expanding
4030 the statements in the statement sequence STMTS.
4031 WEIGHTS contains weights attributed to various constructs. */
4034 estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
4037 gimple_stmt_iterator gsi
;
4040 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4041 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4047 /* Estimate number of instructions that will be created by expanding STMT.
4048 WEIGHTS contains weights attributed to various constructs. */
4051 estimate_num_insns (gimple
*stmt
, eni_weights
*weights
)
4054 enum gimple_code code
= gimple_code (stmt
);
4061 /* Try to estimate the cost of assignments. We have three cases to
4063 1) Simple assignments to registers;
4064 2) Stores to things that must live in memory. This includes
4065 "normal" stores to scalars, but also assignments of large
4066 structures, or constructors of big arrays;
4068 Let us look at the first two cases, assuming we have "a = b + C":
4069 <GIMPLE_ASSIGN <var_decl "a">
4070 <plus_expr <var_decl "b"> <constant C>>
4071 If "a" is a GIMPLE register, the assignment to it is free on almost
4072 any target, because "a" usually ends up in a real register. Hence
4073 the only cost of this expression comes from the PLUS_EXPR, and we
4074 can ignore the GIMPLE_ASSIGN.
4075 If "a" is not a GIMPLE register, the assignment to "a" will most
4076 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4077 of moving something into "a", which we compute using the function
4078 estimate_move_cost. */
4079 if (gimple_clobber_p (stmt
))
4080 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4082 lhs
= gimple_assign_lhs (stmt
);
4083 rhs
= gimple_assign_rhs1 (stmt
);
4087 /* Account for the cost of moving to / from memory. */
4088 if (gimple_store_p (stmt
))
4089 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
4090 if (gimple_assign_load_p (stmt
))
4091 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
4093 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
4094 gimple_assign_rhs1 (stmt
),
4095 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
4096 == GIMPLE_BINARY_RHS
4097 ? gimple_assign_rhs2 (stmt
) : NULL
);
4101 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4102 gimple_op (stmt
, 0),
4103 gimple_op (stmt
, 1));
4108 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4109 /* Take into account cost of the switch + guess 2 conditional jumps for
4112 TODO: once the switch expansion logic is sufficiently separated, we can
4113 do better job on estimating cost of the switch. */
4114 if (weights
->time_based
)
4115 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4117 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4125 if (gimple_call_internal_p (stmt
))
4127 else if ((decl
= gimple_call_fndecl (stmt
))
4128 && DECL_BUILT_IN (decl
))
4130 /* Do not special case builtins where we see the body.
4131 This just confuse inliner. */
4132 struct cgraph_node
*node
;
4133 if (!(node
= cgraph_node::get (decl
))
4134 || node
->definition
)
4136 /* For buitins that are likely expanded to nothing or
4137 inlined do not account operand costs. */
4138 else if (is_simple_builtin (decl
))
4140 else if (is_inexpensive_builtin (decl
))
4141 return weights
->target_builtin_call_cost
;
4142 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
4144 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4145 specialize the cheap expansion we do here.
4146 ??? This asks for a more general solution. */
4147 switch (DECL_FUNCTION_CODE (decl
))
4152 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4154 (&TREE_REAL_CST (gimple_call_arg (stmt
, 1)),
4156 return estimate_operator_cost
4157 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4158 gimple_call_arg (stmt
, 0));
4167 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4168 if (gimple_call_lhs (stmt
))
4169 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4170 weights
->time_based
);
4171 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4173 tree arg
= gimple_call_arg (stmt
, i
);
4174 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4175 weights
->time_based
);
4181 return weights
->return_cost
;
4187 case GIMPLE_PREDICT
:
4193 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4194 /* 1000 means infinity. This avoids overflows later
4195 with very long asm statements. */
4202 /* This is either going to be an external function call with one
4203 argument, or two register copy statements plus a goto. */
4206 case GIMPLE_EH_DISPATCH
:
4207 /* ??? This is going to turn into a switch statement. Ideally
4208 we'd have a look at the eh region and estimate the number of
4213 return estimate_num_insns_seq (
4214 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4217 case GIMPLE_EH_FILTER
:
4218 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4221 return estimate_num_insns_seq (gimple_catch_handler (
4222 as_a
<gcatch
*> (stmt
)),
4226 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4227 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4229 /* OMP directives are generally very expensive. */
4231 case GIMPLE_OMP_RETURN
:
4232 case GIMPLE_OMP_SECTIONS_SWITCH
:
4233 case GIMPLE_OMP_ATOMIC_STORE
:
4234 case GIMPLE_OMP_CONTINUE
:
4235 /* ...except these, which are cheap. */
4238 case GIMPLE_OMP_ATOMIC_LOAD
:
4239 return weights
->omp_cost
;
4241 case GIMPLE_OMP_FOR
:
4242 return (weights
->omp_cost
4243 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4244 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4246 case GIMPLE_OMP_PARALLEL
:
4247 case GIMPLE_OMP_TASK
:
4248 case GIMPLE_OMP_CRITICAL
:
4249 case GIMPLE_OMP_MASTER
:
4250 case GIMPLE_OMP_TASKGROUP
:
4251 case GIMPLE_OMP_ORDERED
:
4252 case GIMPLE_OMP_SECTION
:
4253 case GIMPLE_OMP_SECTIONS
:
4254 case GIMPLE_OMP_SINGLE
:
4255 case GIMPLE_OMP_TARGET
:
4256 case GIMPLE_OMP_TEAMS
:
4257 return (weights
->omp_cost
4258 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4260 case GIMPLE_TRANSACTION
:
4261 return (weights
->tm_cost
4262 + estimate_num_insns_seq (gimple_transaction_body (
4263 as_a
<gtransaction
*> (stmt
)),
4273 /* Estimate number of instructions that will be created by expanding
4274 function FNDECL. WEIGHTS contains weights attributed to various
4278 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4280 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4281 gimple_stmt_iterator bsi
;
4285 gcc_assert (my_function
&& my_function
->cfg
);
4286 FOR_EACH_BB_FN (bb
, my_function
)
4288 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4289 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4296 /* Initializes weights used by estimate_num_insns. */
4299 init_inline_once (void)
4301 eni_size_weights
.call_cost
= 1;
4302 eni_size_weights
.indirect_call_cost
= 3;
4303 eni_size_weights
.target_builtin_call_cost
= 1;
4304 eni_size_weights
.div_mod_cost
= 1;
4305 eni_size_weights
.omp_cost
= 40;
4306 eni_size_weights
.tm_cost
= 10;
4307 eni_size_weights
.time_based
= false;
4308 eni_size_weights
.return_cost
= 1;
4310 /* Estimating time for call is difficult, since we have no idea what the
4311 called function does. In the current uses of eni_time_weights,
4312 underestimating the cost does less harm than overestimating it, so
4313 we choose a rather small value here. */
4314 eni_time_weights
.call_cost
= 10;
4315 eni_time_weights
.indirect_call_cost
= 15;
4316 eni_time_weights
.target_builtin_call_cost
= 1;
4317 eni_time_weights
.div_mod_cost
= 10;
4318 eni_time_weights
.omp_cost
= 40;
4319 eni_time_weights
.tm_cost
= 40;
4320 eni_time_weights
.time_based
= true;
4321 eni_time_weights
.return_cost
= 2;
4325 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4328 prepend_lexical_block (tree current_block
, tree new_block
)
4330 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4331 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4332 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4335 /* Add local variables from CALLEE to CALLER. */
4338 add_local_variables (struct function
*callee
, struct function
*caller
,
4344 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4345 if (!can_be_nonlocal (var
, id
))
4347 tree new_var
= remap_decl (var
, id
);
4349 /* Remap debug-expressions. */
4351 && DECL_HAS_DEBUG_EXPR_P (var
)
4354 tree tem
= DECL_DEBUG_EXPR (var
);
4355 bool old_regimplify
= id
->regimplify
;
4356 id
->remapping_type_depth
++;
4357 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4358 id
->remapping_type_depth
--;
4359 id
->regimplify
= old_regimplify
;
4360 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4361 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4363 add_local_decl (caller
, new_var
);
4367 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4368 have brought in or introduced any debug stmts for SRCVAR. */
4371 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4373 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4378 if (!VAR_P (*remappedvarp
))
4381 if (*remappedvarp
== id
->retvar
|| *remappedvarp
== id
->retbnd
)
4384 tree tvar
= target_for_debug_bind (*remappedvarp
);
4388 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4390 gimple_seq_add_stmt (bindings
, stmt
);
4393 /* For each inlined variable for which we may have debug bind stmts,
4394 add before GSI a final debug stmt resetting it, marking the end of
4395 its life, so that var-tracking knows it doesn't have to compute
4396 further locations for it. */
4399 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4403 gimple_seq bindings
= NULL
;
4405 if (!gimple_in_ssa_p (id
->src_cfun
))
4408 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4411 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4412 var
; var
= DECL_CHAIN (var
))
4413 reset_debug_binding (id
, var
, &bindings
);
4415 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4416 reset_debug_binding (id
, var
, &bindings
);
4418 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4421 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4424 expand_call_inline (basic_block bb
, gimple
*stmt
, copy_body_data
*id
)
4428 hash_map
<tree
, tree
> *dst
;
4429 hash_map
<tree
, tree
> *st
= NULL
;
4432 tree return_bounds
= NULL
;
4433 struct cgraph_edge
*cg_edge
;
4434 cgraph_inline_failed_t reason
;
4435 basic_block return_block
;
4437 gimple_stmt_iterator gsi
, stmt_gsi
;
4438 bool successfully_inlined
= false;
4439 bool purge_dead_abnormal_edges
;
4442 unsigned int prop_mask
, src_properties
;
4443 struct function
*dst_cfun
;
4446 gimple
*simtenter_stmt
= NULL
;
4447 vec
<tree
> *simtvars_save
;
4449 /* The gimplifier uses input_location in too many places, such as
4450 internal_get_tmp_var (). */
4451 location_t saved_location
= input_location
;
4452 input_location
= gimple_location (stmt
);
4454 /* From here on, we're only interested in CALL_EXPRs. */
4455 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4459 cg_edge
= id
->dst_node
->get_edge (stmt
);
4460 gcc_checking_assert (cg_edge
);
4461 /* First, see if we can figure out what function is being called.
4462 If we cannot, then there is no hope of inlining the function. */
4463 if (cg_edge
->indirect_unknown_callee
)
4465 fn
= cg_edge
->callee
->decl
;
4466 gcc_checking_assert (fn
);
4468 /* If FN is a declaration of a function in a nested scope that was
4469 globally declared inline, we don't set its DECL_INITIAL.
4470 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4471 C++ front-end uses it for cdtors to refer to their internal
4472 declarations, that are not real functions. Fortunately those
4473 don't have trees to be saved, so we can tell by checking their
4475 if (!DECL_INITIAL (fn
)
4476 && DECL_ABSTRACT_ORIGIN (fn
)
4477 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4478 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4480 /* Don't try to inline functions that are not well-suited to inlining. */
4481 if (cg_edge
->inline_failed
)
4483 reason
= cg_edge
->inline_failed
;
4484 /* If this call was originally indirect, we do not want to emit any
4485 inlining related warnings or sorry messages because there are no
4486 guarantees regarding those. */
4487 if (cg_edge
->indirect_inlining_edge
)
4490 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4491 /* For extern inline functions that get redefined we always
4492 silently ignored always_inline flag. Better behavior would
4493 be to be able to keep both bodies and use extern inline body
4494 for inlining, but we can't do that because frontends overwrite
4496 && !cg_edge
->callee
->local
.redefined_extern_inline
4497 /* During early inline pass, report only when optimization is
4499 && (symtab
->global_info_ready
4501 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4502 /* PR 20090218-1_0.c. Body can be provided by another module. */
4503 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4505 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4506 cgraph_inline_failed_string (reason
));
4507 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4508 inform (gimple_location (stmt
), "called from here");
4509 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4510 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4511 "called from this function");
4513 else if (warn_inline
4514 && DECL_DECLARED_INLINE_P (fn
)
4515 && !DECL_NO_INLINE_WARNING_P (fn
)
4516 && !DECL_IN_SYSTEM_HEADER (fn
)
4517 && reason
!= CIF_UNSPECIFIED
4518 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4519 /* Do not warn about not inlined recursive calls. */
4520 && !cg_edge
->recursive_p ()
4521 /* Avoid warnings during early inline pass. */
4522 && symtab
->global_info_ready
)
4524 if (warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4525 fn
, _(cgraph_inline_failed_string (reason
))))
4527 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4528 inform (gimple_location (stmt
), "called from here");
4529 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4530 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4531 "called from this function");
4536 id
->src_node
= cg_edge
->callee
;
4538 /* If callee is thunk, all we need is to adjust the THIS pointer
4539 and redirect to function being thunked. */
4540 if (id
->src_node
->thunk
.thunk_p
)
4543 tree virtual_offset
= NULL
;
4544 int freq
= cg_edge
->frequency
;
4545 profile_count count
= cg_edge
->count
;
4547 gimple_stmt_iterator iter
= gsi_for_stmt (stmt
);
4550 edge
= id
->src_node
->callees
->clone (id
->dst_node
, call_stmt
,
4552 profile_count::one (),
4553 profile_count::one (),
4556 edge
->frequency
= freq
;
4557 edge
->count
= count
;
4558 if (id
->src_node
->thunk
.virtual_offset_p
)
4559 virtual_offset
= size_int (id
->src_node
->thunk
.virtual_value
);
4560 op
= create_tmp_reg_fn (cfun
, TREE_TYPE (gimple_call_arg (stmt
, 0)),
4562 gsi_insert_before (&iter
, gimple_build_assign (op
,
4563 gimple_call_arg (stmt
, 0)),
4565 gcc_assert (id
->src_node
->thunk
.this_adjusting
);
4566 op
= thunk_adjust (&iter
, op
, 1, id
->src_node
->thunk
.fixed_offset
,
4569 gimple_call_set_arg (stmt
, 0, op
);
4570 gimple_call_set_fndecl (stmt
, edge
->callee
->decl
);
4572 id
->src_node
->remove ();
4573 expand_call_inline (bb
, stmt
, id
);
4574 maybe_remove_unused_call_args (cfun
, stmt
);
4577 fn
= cg_edge
->callee
->decl
;
4578 cg_edge
->callee
->get_untransformed_body ();
4580 if (flag_checking
&& cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4581 cg_edge
->callee
->verify ();
4583 /* We will be inlining this callee. */
4584 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4585 id
->assign_stmts
.create (0);
4587 /* Update the callers EH personality. */
4588 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4589 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4590 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4592 /* Split the block before the GIMPLE_CALL. */
4593 stmt_gsi
= gsi_for_stmt (stmt
);
4594 gsi_prev (&stmt_gsi
);
4595 e
= split_block (bb
, gsi_end_p (stmt_gsi
) ? NULL
: gsi_stmt (stmt_gsi
));
4597 return_block
= e
->dest
;
4600 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4601 been the source of abnormal edges. In this case, schedule
4602 the removal of dead abnormal edges. */
4603 gsi
= gsi_start_bb (return_block
);
4605 purge_dead_abnormal_edges
= gsi_end_p (gsi
);
4607 stmt_gsi
= gsi_start_bb (return_block
);
4609 /* Build a block containing code to initialize the arguments, the
4610 actual inline expansion of the body, and a label for the return
4611 statements within the function to jump to. The type of the
4612 statement expression is the return type of the function call.
4613 ??? If the call does not have an associated block then we will
4614 remap all callee blocks to NULL, effectively dropping most of
4615 its debug information. This should only happen for calls to
4616 artificial decls inserted by the compiler itself. We need to
4617 either link the inlined blocks into the caller block tree or
4618 not refer to them in any way to not break GC for locations. */
4619 if (gimple_block (stmt
))
4621 id
->block
= make_node (BLOCK
);
4622 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4623 BLOCK_SOURCE_LOCATION (id
->block
)
4624 = LOCATION_LOCUS (gimple_location (stmt
));
4625 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4628 /* Local declarations will be replaced by their equivalents in this
4631 id
->decl_map
= new hash_map
<tree
, tree
>;
4632 dst
= id
->debug_map
;
4633 id
->debug_map
= NULL
;
4635 /* Record the function we are about to inline. */
4637 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4638 id
->call_stmt
= call_stmt
;
4640 /* When inlining into an OpenMP SIMD-on-SIMT loop, arrange for new automatic
4641 variables to be added to IFN_GOMP_SIMT_ENTER argument list. */
4642 dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4643 simtvars_save
= id
->dst_simt_vars
;
4644 if (!(dst_cfun
->curr_properties
& PROP_gimple_lomp_dev
)
4645 && (simduid
= bb
->loop_father
->simduid
) != NULL_TREE
4646 && (simduid
= ssa_default_def (dst_cfun
, simduid
)) != NULL_TREE
4647 && single_imm_use (simduid
, &use
, &simtenter_stmt
)
4648 && is_gimple_call (simtenter_stmt
)
4649 && gimple_call_internal_p (simtenter_stmt
, IFN_GOMP_SIMT_ENTER
))
4650 vec_alloc (id
->dst_simt_vars
, 0);
4652 id
->dst_simt_vars
= NULL
;
4654 if (profile_status_for_fn (id
->src_cfun
) == PROFILE_ABSENT
)
4655 profile_status_for_fn (dst_cfun
) = PROFILE_ABSENT
;
4657 /* If the src function contains an IFN_VA_ARG, then so will the dst
4658 function after inlining. Likewise for IFN_GOMP_USE_SIMT. */
4659 prop_mask
= PROP_gimple_lva
| PROP_gimple_lomp_dev
;
4660 src_properties
= id
->src_cfun
->curr_properties
& prop_mask
;
4661 if (src_properties
!= prop_mask
)
4662 dst_cfun
->curr_properties
&= src_properties
| ~prop_mask
;
4664 gcc_assert (!id
->src_cfun
->after_inlining
);
4667 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4669 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4670 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4674 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4676 if (DECL_INITIAL (fn
))
4678 if (gimple_block (stmt
))
4682 prepend_lexical_block (id
->block
,
4683 remap_blocks (DECL_INITIAL (fn
), id
));
4684 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4685 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4687 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4688 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4689 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4690 under it. The parameters can be then evaluated in the debugger,
4691 but don't show in backtraces. */
4692 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4693 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4696 *var
= TREE_CHAIN (v
);
4697 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4698 BLOCK_VARS (id
->block
) = v
;
4701 var
= &TREE_CHAIN (*var
);
4704 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4707 /* Return statements in the function body will be replaced by jumps
4708 to the RET_LABEL. */
4709 gcc_assert (DECL_INITIAL (fn
));
4710 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4712 /* Find the LHS to which the result of this call is assigned. */
4714 if (gimple_call_lhs (stmt
))
4716 modify_dest
= gimple_call_lhs (stmt
);
4718 /* Remember where to copy returned bounds. */
4719 if (gimple_call_with_bounds_p (stmt
)
4720 && TREE_CODE (modify_dest
) == SSA_NAME
)
4722 gcall
*retbnd
= chkp_retbnd_call_by_val (modify_dest
);
4725 return_bounds
= gimple_call_lhs (retbnd
);
4726 /* If returned bounds are not used then just
4727 remove unused call. */
4730 gimple_stmt_iterator iter
= gsi_for_stmt (retbnd
);
4731 gsi_remove (&iter
, true);
4736 /* The function which we are inlining might not return a value,
4737 in which case we should issue a warning that the function
4738 does not return a value. In that case the optimizers will
4739 see that the variable to which the value is assigned was not
4740 initialized. We do not want to issue a warning about that
4741 uninitialized variable. */
4742 if (DECL_P (modify_dest
))
4743 TREE_NO_WARNING (modify_dest
) = 1;
4745 if (gimple_call_return_slot_opt_p (call_stmt
))
4747 return_slot
= modify_dest
;
4754 /* If we are inlining a call to the C++ operator new, we don't want
4755 to use type based alias analysis on the return value. Otherwise
4756 we may get confused if the compiler sees that the inlined new
4757 function returns a pointer which was just deleted. See bug
4759 if (DECL_IS_OPERATOR_NEW (fn
))
4765 /* Declare the return variable for the function. */
4766 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
,
4769 /* Add local vars in this inlined callee to caller. */
4770 add_local_variables (id
->src_cfun
, cfun
, id
);
4772 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4774 fprintf (dump_file
, "Inlining ");
4775 print_generic_expr (dump_file
, id
->src_fn
);
4776 fprintf (dump_file
, " to ");
4777 print_generic_expr (dump_file
, id
->dst_fn
);
4778 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4781 /* This is it. Duplicate the callee body. Assume callee is
4782 pre-gimplified. Note that we must not alter the caller
4783 function in any way before this point, as this CALL_EXPR may be
4784 a self-referential call; if we're calling ourselves, we need to
4785 duplicate our body before altering anything. */
4786 copy_body (id
, cg_edge
->callee
->count
,
4787 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4788 bb
, return_block
, NULL
);
4790 reset_debug_bindings (id
, stmt_gsi
);
4792 /* Reset the escaped solution. */
4793 if (cfun
->gimple_df
)
4794 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4796 /* Add new automatic variables to IFN_GOMP_SIMT_ENTER arguments. */
4797 if (id
->dst_simt_vars
&& id
->dst_simt_vars
->length () > 0)
4799 size_t nargs
= gimple_call_num_args (simtenter_stmt
);
4800 vec
<tree
> *vars
= id
->dst_simt_vars
;
4801 auto_vec
<tree
> newargs (nargs
+ vars
->length ());
4802 for (size_t i
= 0; i
< nargs
; i
++)
4803 newargs
.quick_push (gimple_call_arg (simtenter_stmt
, i
));
4804 for (tree
*pvar
= vars
->begin (); pvar
!= vars
->end (); pvar
++)
4806 tree ptrtype
= build_pointer_type (TREE_TYPE (*pvar
));
4807 newargs
.quick_push (build1 (ADDR_EXPR
, ptrtype
, *pvar
));
4809 gcall
*g
= gimple_build_call_internal_vec (IFN_GOMP_SIMT_ENTER
, newargs
);
4810 gimple_call_set_lhs (g
, gimple_call_lhs (simtenter_stmt
));
4811 gimple_stmt_iterator gsi
= gsi_for_stmt (simtenter_stmt
);
4812 gsi_replace (&gsi
, g
, false);
4814 vec_free (id
->dst_simt_vars
);
4815 id
->dst_simt_vars
= simtvars_save
;
4820 delete id
->debug_map
;
4821 id
->debug_map
= dst
;
4823 delete id
->decl_map
;
4826 /* Unlink the calls virtual operands before replacing it. */
4827 unlink_stmt_vdef (stmt
);
4828 if (gimple_vdef (stmt
)
4829 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4830 release_ssa_name (gimple_vdef (stmt
));
4832 /* If the inlined function returns a result that we care about,
4833 substitute the GIMPLE_CALL with an assignment of the return
4834 variable to the LHS of the call. That is, if STMT was
4835 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4836 if (use_retvar
&& gimple_call_lhs (stmt
))
4838 gimple
*old_stmt
= stmt
;
4839 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4840 gsi_replace (&stmt_gsi
, stmt
, false);
4841 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4843 /* Copy bounds if we copy structure with bounds. */
4844 if (chkp_function_instrumented_p (id
->dst_fn
)
4845 && !BOUNDED_P (use_retvar
)
4846 && chkp_type_has_pointer (TREE_TYPE (use_retvar
)))
4847 id
->assign_stmts
.safe_push (stmt
);
4851 /* Handle the case of inlining a function with no return
4852 statement, which causes the return value to become undefined. */
4853 if (gimple_call_lhs (stmt
)
4854 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4856 tree name
= gimple_call_lhs (stmt
);
4857 tree var
= SSA_NAME_VAR (name
);
4858 tree def
= var
? ssa_default_def (cfun
, var
) : NULL
;
4862 /* If the variable is used undefined, make this name
4863 undefined via a move. */
4864 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4865 gsi_replace (&stmt_gsi
, stmt
, true);
4871 var
= create_tmp_reg_fn (cfun
, TREE_TYPE (name
), NULL
);
4872 SET_SSA_NAME_VAR_OR_IDENTIFIER (name
, var
);
4874 /* Otherwise make this variable undefined. */
4875 gsi_remove (&stmt_gsi
, true);
4876 set_ssa_default_def (cfun
, var
, name
);
4877 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4881 gsi_remove (&stmt_gsi
, true);
4884 /* Put returned bounds into the correct place if required. */
4887 gimple
*old_stmt
= SSA_NAME_DEF_STMT (return_bounds
);
4888 gimple
*new_stmt
= gimple_build_assign (return_bounds
, id
->retbnd
);
4889 gimple_stmt_iterator bnd_gsi
= gsi_for_stmt (old_stmt
);
4890 unlink_stmt_vdef (old_stmt
);
4891 gsi_replace (&bnd_gsi
, new_stmt
, false);
4892 maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
);
4893 cgraph_update_edges_for_call_stmt (old_stmt
,
4894 gimple_call_fndecl (old_stmt
),
4898 if (purge_dead_abnormal_edges
)
4900 gimple_purge_dead_eh_edges (return_block
);
4901 gimple_purge_dead_abnormal_call_edges (return_block
);
4904 /* If the value of the new expression is ignored, that's OK. We
4905 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4906 the equivalent inlined version either. */
4907 if (is_gimple_assign (stmt
))
4909 gcc_assert (gimple_assign_single_p (stmt
)
4910 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4911 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4914 /* Copy bounds for all generated assigns that need it. */
4915 for (i
= 0; i
< id
->assign_stmts
.length (); i
++)
4916 chkp_copy_bounds_for_assign (id
->assign_stmts
[i
], cg_edge
);
4917 id
->assign_stmts
.release ();
4919 /* Output the inlining info for this abstract function, since it has been
4920 inlined. If we don't do this now, we can lose the information about the
4921 variables in the function when the blocks get blown away as soon as we
4922 remove the cgraph node. */
4923 if (gimple_block (stmt
))
4924 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4926 /* Update callgraph if needed. */
4927 cg_edge
->callee
->remove ();
4929 id
->block
= NULL_TREE
;
4930 successfully_inlined
= true;
4933 input_location
= saved_location
;
4934 return successfully_inlined
;
4937 /* Expand call statements reachable from STMT_P.
4938 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4939 in a MODIFY_EXPR. */
4942 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4944 gimple_stmt_iterator gsi
;
4945 bool inlined
= false;
4947 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
4949 gimple
*stmt
= gsi_stmt (gsi
);
4952 if (is_gimple_call (stmt
)
4953 && !gimple_call_internal_p (stmt
))
4954 inlined
|= expand_call_inline (bb
, stmt
, id
);
4961 /* Walk all basic blocks created after FIRST and try to fold every statement
4962 in the STATEMENTS pointer set. */
4965 fold_marked_statements (int first
, hash_set
<gimple
*> *statements
)
4967 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4968 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4970 gimple_stmt_iterator gsi
;
4972 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4975 if (statements
->contains (gsi_stmt (gsi
)))
4977 gimple
*old_stmt
= gsi_stmt (gsi
);
4978 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4980 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4982 /* Folding builtins can create multiple instructions,
4983 we need to look at all of them. */
4984 gimple_stmt_iterator i2
= gsi
;
4986 if (fold_stmt (&gsi
))
4989 /* If a builtin at the end of a bb folded into nothing,
4990 the following loop won't work. */
4991 if (gsi_end_p (gsi
))
4993 cgraph_update_edges_for_call_stmt (old_stmt
,
4998 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
5003 new_stmt
= gsi_stmt (i2
);
5004 update_stmt (new_stmt
);
5005 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5008 if (new_stmt
== gsi_stmt (gsi
))
5010 /* It is okay to check only for the very last
5011 of these statements. If it is a throwing
5012 statement nothing will change. If it isn't
5013 this can remove EH edges. If that weren't
5014 correct then because some intermediate stmts
5015 throw, but not the last one. That would mean
5016 we'd have to split the block, which we can't
5017 here and we'd loose anyway. And as builtins
5018 probably never throw, this all
5020 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
5022 gimple_purge_dead_eh_edges (
5023 BASIC_BLOCK_FOR_FN (cfun
, first
));
5030 else if (fold_stmt (&gsi
))
5032 /* Re-read the statement from GSI as fold_stmt() may
5034 gimple
*new_stmt
= gsi_stmt (gsi
);
5035 update_stmt (new_stmt
);
5037 if (is_gimple_call (old_stmt
)
5038 || is_gimple_call (new_stmt
))
5039 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5042 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
5043 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
5050 /* Expand calls to inline functions in the body of FN. */
5053 optimize_inline_calls (tree fn
)
5057 int last
= n_basic_blocks_for_fn (cfun
);
5058 bool inlined_p
= false;
5061 memset (&id
, 0, sizeof (id
));
5063 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
5064 gcc_assert (id
.dst_node
->definition
);
5066 /* Or any functions that aren't finished yet. */
5067 if (current_function_decl
)
5068 id
.dst_fn
= current_function_decl
;
5070 id
.copy_decl
= copy_decl_maybe_to_var
;
5071 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5072 id
.transform_new_cfg
= false;
5073 id
.transform_return_to_modify
= true;
5074 id
.transform_parameter
= true;
5075 id
.transform_lang_insert_block
= NULL
;
5076 id
.statements_to_fold
= new hash_set
<gimple
*>;
5078 push_gimplify_context ();
5080 /* We make no attempts to keep dominance info up-to-date. */
5081 free_dominance_info (CDI_DOMINATORS
);
5082 free_dominance_info (CDI_POST_DOMINATORS
);
5084 /* Register specific gimple functions. */
5085 gimple_register_cfg_hooks ();
5087 /* Reach the trees by walking over the CFG, and note the
5088 enclosing basic-blocks in the call edges. */
5089 /* We walk the blocks going forward, because inlined function bodies
5090 will split id->current_basic_block, and the new blocks will
5091 follow it; we'll trudge through them, processing their CALL_EXPRs
5093 FOR_EACH_BB_FN (bb
, cfun
)
5094 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
5096 pop_gimplify_context (NULL
);
5100 struct cgraph_edge
*e
;
5102 id
.dst_node
->verify ();
5104 /* Double check that we inlined everything we are supposed to inline. */
5105 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
5106 gcc_assert (e
->inline_failed
);
5109 /* Fold queued statements. */
5110 fold_marked_statements (last
, id
.statements_to_fold
);
5111 delete id
.statements_to_fold
;
5113 gcc_assert (!id
.debug_stmts
.exists ());
5115 /* If we didn't inline into the function there is nothing to do. */
5119 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5122 delete_unreachable_blocks_update_callgraph (&id
);
5124 id
.dst_node
->verify ();
5126 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5127 not possible yet - the IPA passes might make various functions to not
5128 throw and they don't care to proactively update local EH info. This is
5129 done later in fixup_cfg pass that also execute the verification. */
5130 return (TODO_update_ssa
5132 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5133 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
5134 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
5135 ? TODO_rebuild_frequencies
: 0));
5138 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5141 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5143 enum tree_code code
= TREE_CODE (*tp
);
5144 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5146 /* We make copies of most nodes. */
5147 if (IS_EXPR_CODE_CLASS (cl
)
5148 || code
== TREE_LIST
5150 || code
== TYPE_DECL
5151 || code
== OMP_CLAUSE
)
5153 /* Because the chain gets clobbered when we make a copy, we save it
5155 tree chain
= NULL_TREE
, new_tree
;
5157 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5158 chain
= TREE_CHAIN (*tp
);
5160 /* Copy the node. */
5161 new_tree
= copy_node (*tp
);
5165 /* Now, restore the chain, if appropriate. That will cause
5166 walk_tree to walk into the chain as well. */
5167 if (code
== PARM_DECL
5168 || code
== TREE_LIST
5169 || code
== OMP_CLAUSE
)
5170 TREE_CHAIN (*tp
) = chain
;
5172 /* For now, we don't update BLOCKs when we make copies. So, we
5173 have to nullify all BIND_EXPRs. */
5174 if (TREE_CODE (*tp
) == BIND_EXPR
)
5175 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5177 else if (code
== CONSTRUCTOR
)
5179 /* CONSTRUCTOR nodes need special handling because
5180 we need to duplicate the vector of elements. */
5183 new_tree
= copy_node (*tp
);
5184 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5187 else if (code
== STATEMENT_LIST
)
5188 /* We used to just abort on STATEMENT_LIST, but we can run into them
5189 with statement-expressions (c++/40975). */
5190 copy_statement_list (tp
);
5191 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5193 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5195 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5200 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5201 information indicating to what new SAVE_EXPR this one should be mapped,
5202 use that one. Otherwise, create a new node and enter it in ST. FN is
5203 the function into which the copy will be placed. */
5206 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5211 /* See if we already encountered this SAVE_EXPR. */
5214 /* If we didn't already remap this SAVE_EXPR, do so now. */
5217 t
= copy_node (*tp
);
5219 /* Remember this SAVE_EXPR. */
5221 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5226 /* We've already walked into this SAVE_EXPR; don't do it again. */
5231 /* Replace this SAVE_EXPR with the copy. */
5235 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5236 label, copies the declaration and enters it in the splay_tree in DATA (which
5237 is really a 'copy_body_data *'. */
5240 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5241 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5242 struct walk_stmt_info
*wi
)
5244 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5245 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5249 tree decl
= gimple_label_label (stmt
);
5251 /* Copy the decl and remember the copy. */
5252 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5258 static gimple_seq
duplicate_remap_omp_clause_seq (gimple_seq seq
,
5259 struct walk_stmt_info
*wi
);
5261 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5262 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5263 remaps all local declarations to appropriate replacements in gimple
5267 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5269 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5270 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5271 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5275 /* For recursive invocations this is no longer the LHS itself. */
5276 bool is_lhs
= wi
->is_lhs
;
5279 if (TREE_CODE (expr
) == SSA_NAME
)
5281 *tp
= remap_ssa_name (*tp
, id
);
5284 SSA_NAME_DEF_STMT (*tp
) = gsi_stmt (wi
->gsi
);
5286 /* Only a local declaration (variable or label). */
5287 else if ((VAR_P (expr
) && !TREE_STATIC (expr
))
5288 || TREE_CODE (expr
) == LABEL_DECL
)
5290 /* Lookup the declaration. */
5293 /* If it's there, remap it. */
5298 else if (TREE_CODE (expr
) == STATEMENT_LIST
5299 || TREE_CODE (expr
) == BIND_EXPR
5300 || TREE_CODE (expr
) == SAVE_EXPR
)
5302 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5304 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5305 It's OK for this to happen if it was part of a subtree that
5306 isn't immediately expanded, such as operand 2 of another
5308 if (!TREE_OPERAND (expr
, 1))
5310 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5311 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5314 else if (TREE_CODE (expr
) == OMP_CLAUSE
)
5316 /* Before the omplower pass completes, some OMP clauses can contain
5317 sequences that are neither copied by gimple_seq_copy nor walked by
5318 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5319 in those situations, we have to copy and process them explicitely. */
5321 if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LASTPRIVATE
)
5323 gimple_seq seq
= OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
);
5324 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5325 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
) = seq
;
5327 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LINEAR
)
5329 gimple_seq seq
= OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
);
5330 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5331 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
) = seq
;
5333 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_REDUCTION
)
5335 gimple_seq seq
= OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
);
5336 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5337 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
) = seq
;
5338 seq
= OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
);
5339 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5340 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
) = seq
;
5344 /* Keep iterating. */
5349 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5350 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5351 remaps all local declarations to appropriate replacements in gimple
5355 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5356 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5357 struct walk_stmt_info
*wi
)
5359 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5360 gimple
*gs
= gsi_stmt (*gsip
);
5362 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5364 tree block
= gimple_bind_block (stmt
);
5368 remap_block (&block
, id
);
5369 gimple_bind_set_block (stmt
, block
);
5372 /* This will remap a lot of the same decls again, but this should be
5374 if (gimple_bind_vars (stmt
))
5376 tree old_var
, decls
= gimple_bind_vars (stmt
);
5378 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
5379 if (!can_be_nonlocal (old_var
, id
)
5380 && ! variably_modified_type_p (TREE_TYPE (old_var
), id
->src_fn
))
5381 remap_decl (old_var
, id
);
5383 gcc_checking_assert (!id
->prevent_decl_creation_for_types
);
5384 id
->prevent_decl_creation_for_types
= true;
5385 gimple_bind_set_vars (stmt
, remap_decls (decls
, NULL
, id
));
5386 id
->prevent_decl_creation_for_types
= false;
5390 /* Keep iterating. */
5394 /* Create a copy of SEQ and remap all decls in it. */
5397 duplicate_remap_omp_clause_seq (gimple_seq seq
, struct walk_stmt_info
*wi
)
5402 /* If there are any labels in OMP sequences, they can be only referred to in
5403 the sequence itself and therefore we can do both here. */
5404 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, wi
);
5405 gimple_seq copy
= gimple_seq_copy (seq
);
5406 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, wi
);
5410 /* Copies everything in SEQ and replaces variables and labels local to
5411 current_function_decl. */
5414 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5417 struct walk_stmt_info wi
;
5420 /* There's nothing to do for NULL_TREE. */
5425 memset (&id
, 0, sizeof (id
));
5426 id
.src_fn
= current_function_decl
;
5427 id
.dst_fn
= current_function_decl
;
5429 id
.decl_map
= new hash_map
<tree
, tree
>;
5430 id
.debug_map
= NULL
;
5432 id
.copy_decl
= copy_decl_no_change
;
5433 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5434 id
.transform_new_cfg
= false;
5435 id
.transform_return_to_modify
= false;
5436 id
.transform_parameter
= false;
5437 id
.transform_lang_insert_block
= NULL
;
5439 /* Walk the tree once to find local labels. */
5440 memset (&wi
, 0, sizeof (wi
));
5441 hash_set
<tree
> visited
;
5444 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5446 copy
= gimple_seq_copy (seq
);
5448 /* Walk the copy, remapping decls. */
5449 memset (&wi
, 0, sizeof (wi
));
5451 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5456 delete id
.debug_map
;
5457 if (id
.dependence_map
)
5459 delete id
.dependence_map
;
5460 id
.dependence_map
= NULL
;
5467 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5470 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5479 debug_find_tree (tree top
, tree search
)
5481 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5485 /* Declare the variables created by the inliner. Add all the variables in
5486 VARS to BIND_EXPR. */
5489 declare_inline_vars (tree block
, tree vars
)
5492 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5494 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5495 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5496 add_local_decl (cfun
, t
);
5500 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5503 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5504 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5505 VAR_DECL translation. */
5508 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5510 /* Don't generate debug information for the copy if we wouldn't have
5511 generated it for the copy either. */
5512 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5513 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5515 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5516 declaration inspired this copy. */
5517 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5519 /* The new variable/label has no RTL, yet. */
5520 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5521 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5522 SET_DECL_RTL (copy
, 0);
5524 /* These args would always appear unused, if not for this. */
5525 TREE_USED (copy
) = 1;
5527 /* Set the context for the new declaration. */
5528 if (!DECL_CONTEXT (decl
))
5529 /* Globals stay global. */
5531 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5532 /* Things that weren't in the scope of the function we're inlining
5533 from aren't in the scope we're inlining to, either. */
5535 else if (TREE_STATIC (decl
))
5536 /* Function-scoped static variables should stay in the original
5541 /* Ordinary automatic local variables are now in the scope of the
5543 DECL_CONTEXT (copy
) = id
->dst_fn
;
5544 if (VAR_P (copy
) && id
->dst_simt_vars
&& !is_gimple_reg (copy
))
5546 if (!lookup_attribute ("omp simt private", DECL_ATTRIBUTES (copy
)))
5547 DECL_ATTRIBUTES (copy
)
5548 = tree_cons (get_identifier ("omp simt private"), NULL
,
5549 DECL_ATTRIBUTES (copy
));
5550 id
->dst_simt_vars
->safe_push (copy
);
5558 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5562 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5563 || TREE_CODE (decl
) == RESULT_DECL
);
5565 type
= TREE_TYPE (decl
);
5567 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5568 VAR_DECL
, DECL_NAME (decl
), type
);
5569 if (DECL_PT_UID_SET_P (decl
))
5570 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5571 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5572 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5573 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5574 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5576 return copy_decl_for_dup_finish (id
, decl
, copy
);
5579 /* Like copy_decl_to_var, but create a return slot object instead of a
5580 pointer variable for return by invisible reference. */
5583 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5587 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5588 || TREE_CODE (decl
) == RESULT_DECL
);
5590 type
= TREE_TYPE (decl
);
5591 if (DECL_BY_REFERENCE (decl
))
5592 type
= TREE_TYPE (type
);
5594 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5595 VAR_DECL
, DECL_NAME (decl
), type
);
5596 if (DECL_PT_UID_SET_P (decl
))
5597 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5598 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5599 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5600 if (!DECL_BY_REFERENCE (decl
))
5602 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5603 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5606 return copy_decl_for_dup_finish (id
, decl
, copy
);
5610 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5614 copy
= copy_node (decl
);
5616 /* The COPY is not abstract; it will be generated in DST_FN. */
5617 DECL_ABSTRACT_P (copy
) = false;
5618 lang_hooks
.dup_lang_specific_decl (copy
);
5620 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5621 been taken; it's for internal bookkeeping in expand_goto_internal. */
5622 if (TREE_CODE (copy
) == LABEL_DECL
)
5624 TREE_ADDRESSABLE (copy
) = 0;
5625 LABEL_DECL_UID (copy
) = -1;
5628 return copy_decl_for_dup_finish (id
, decl
, copy
);
5632 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5634 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5635 return copy_decl_to_var (decl
, id
);
5637 return copy_decl_no_change (decl
, id
);
5640 /* Return a copy of the function's argument tree. */
5642 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5643 bitmap args_to_skip
, tree
*vars
)
5646 tree new_parm
= NULL
;
5651 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5652 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5654 tree new_tree
= remap_decl (arg
, id
);
5655 if (TREE_CODE (new_tree
) != PARM_DECL
)
5656 new_tree
= id
->copy_decl (arg
, id
);
5657 lang_hooks
.dup_lang_specific_decl (new_tree
);
5659 parg
= &DECL_CHAIN (new_tree
);
5661 else if (!id
->decl_map
->get (arg
))
5663 /* Make an equivalent VAR_DECL. If the argument was used
5664 as temporary variable later in function, the uses will be
5665 replaced by local variable. */
5666 tree var
= copy_decl_to_var (arg
, id
);
5667 insert_decl_map (id
, arg
, var
);
5668 /* Declare this new variable. */
5669 DECL_CHAIN (var
) = *vars
;
5675 /* Return a copy of the function's static chain. */
5677 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5679 tree
*chain_copy
, *pvar
;
5681 chain_copy
= &static_chain
;
5682 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5684 tree new_tree
= remap_decl (*pvar
, id
);
5685 lang_hooks
.dup_lang_specific_decl (new_tree
);
5686 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5689 return static_chain
;
5692 /* Return true if the function is allowed to be versioned.
5693 This is a guard for the versioning functionality. */
5696 tree_versionable_function_p (tree fndecl
)
5698 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5699 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
)) == NULL
);
5702 /* Delete all unreachable basic blocks and update callgraph.
5703 Doing so is somewhat nontrivial because we need to update all clones and
5704 remove inline function that become unreachable. */
5707 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5709 bool changed
= false;
5710 basic_block b
, next_bb
;
5712 find_unreachable_blocks ();
5714 /* Delete all unreachable basic blocks. */
5716 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5717 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5719 next_bb
= b
->next_bb
;
5721 if (!(b
->flags
& BB_REACHABLE
))
5723 gimple_stmt_iterator bsi
;
5725 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5727 struct cgraph_edge
*e
;
5728 struct cgraph_node
*node
;
5730 id
->dst_node
->remove_stmt_references (gsi_stmt (bsi
));
5732 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5733 &&(e
= id
->dst_node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5735 if (!e
->inline_failed
)
5736 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5740 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5741 && id
->dst_node
->clones
)
5742 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5744 node
->remove_stmt_references (gsi_stmt (bsi
));
5745 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5746 && (e
= node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5748 if (!e
->inline_failed
)
5749 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5755 node
= node
->clones
;
5756 else if (node
->next_sibling_clone
)
5757 node
= node
->next_sibling_clone
;
5760 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5761 node
= node
->clone_of
;
5762 if (node
!= id
->dst_node
)
5763 node
= node
->next_sibling_clone
;
5767 delete_basic_block (b
);
5775 /* Update clone info after duplication. */
5778 update_clone_info (copy_body_data
* id
)
5780 struct cgraph_node
*node
;
5781 if (!id
->dst_node
->clones
)
5783 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5785 /* First update replace maps to match the new body. */
5786 if (node
->clone
.tree_map
)
5789 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5791 struct ipa_replace_map
*replace_info
;
5792 replace_info
= (*node
->clone
.tree_map
)[i
];
5793 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5794 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5798 node
= node
->clones
;
5799 else if (node
->next_sibling_clone
)
5800 node
= node
->next_sibling_clone
;
5803 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5804 node
= node
->clone_of
;
5805 if (node
!= id
->dst_node
)
5806 node
= node
->next_sibling_clone
;
5811 /* Create a copy of a function's tree.
5812 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5813 of the original function and the new copied function
5814 respectively. In case we want to replace a DECL
5815 tree with another tree while duplicating the function's
5816 body, TREE_MAP represents the mapping between these
5817 trees. If UPDATE_CLONES is set, the call_stmt fields
5818 of edges of clones of the function will be updated.
5820 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5822 If SKIP_RETURN is true, the new version will return void.
5823 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5824 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5827 tree_function_versioning (tree old_decl
, tree new_decl
,
5828 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
5829 bool update_clones
, bitmap args_to_skip
,
5830 bool skip_return
, bitmap blocks_to_copy
,
5831 basic_block new_entry
)
5833 struct cgraph_node
*old_version_node
;
5834 struct cgraph_node
*new_version_node
;
5838 struct ipa_replace_map
*replace_info
;
5839 basic_block old_entry_block
, bb
;
5840 auto_vec
<gimple
*, 10> init_stmts
;
5841 tree vars
= NULL_TREE
;
5842 bitmap debug_args_to_skip
= args_to_skip
;
5844 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5845 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5846 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5848 old_version_node
= cgraph_node::get (old_decl
);
5849 gcc_checking_assert (old_version_node
);
5850 new_version_node
= cgraph_node::get (new_decl
);
5851 gcc_checking_assert (new_version_node
);
5853 /* Copy over debug args. */
5854 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5856 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5857 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5858 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5859 old_debug_args
= decl_debug_args_lookup (old_decl
);
5862 new_debug_args
= decl_debug_args_insert (new_decl
);
5863 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5867 /* Output the inlining info for this abstract function, since it has been
5868 inlined. If we don't do this now, we can lose the information about the
5869 variables in the function when the blocks get blown away as soon as we
5870 remove the cgraph node. */
5871 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5873 DECL_ARTIFICIAL (new_decl
) = 1;
5874 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5875 if (DECL_ORIGIN (old_decl
) == old_decl
)
5876 old_version_node
->used_as_abstract_origin
= true;
5877 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5879 /* Prepare the data structures for the tree copy. */
5880 memset (&id
, 0, sizeof (id
));
5882 /* Generate a new name for the new version. */
5883 id
.statements_to_fold
= new hash_set
<gimple
*>;
5885 id
.decl_map
= new hash_map
<tree
, tree
>;
5886 id
.debug_map
= NULL
;
5887 id
.src_fn
= old_decl
;
5888 id
.dst_fn
= new_decl
;
5889 id
.src_node
= old_version_node
;
5890 id
.dst_node
= new_version_node
;
5891 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5892 id
.blocks_to_copy
= blocks_to_copy
;
5894 id
.copy_decl
= copy_decl_no_change
;
5895 id
.transform_call_graph_edges
5896 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5897 id
.transform_new_cfg
= true;
5898 id
.transform_return_to_modify
= false;
5899 id
.transform_parameter
= false;
5900 id
.transform_lang_insert_block
= NULL
;
5902 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5903 (DECL_STRUCT_FUNCTION (old_decl
));
5904 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5905 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5906 initialize_cfun (new_decl
, old_decl
,
5907 old_entry_block
->count
);
5908 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
5909 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5910 = id
.src_cfun
->gimple_df
->ipa_pta
;
5912 /* Copy the function's static chain. */
5913 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5915 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
5916 = copy_static_chain (p
, &id
);
5918 /* If there's a tree_map, prepare for substitution. */
5920 for (i
= 0; i
< tree_map
->length (); i
++)
5923 replace_info
= (*tree_map
)[i
];
5924 if (replace_info
->replace_p
)
5927 if (!replace_info
->old_tree
)
5929 int p
= replace_info
->parm_num
;
5931 tree req_type
, new_type
;
5933 for (parm
= DECL_ARGUMENTS (old_decl
); p
;
5934 parm
= DECL_CHAIN (parm
))
5936 replace_info
->old_tree
= parm
;
5937 parm_num
= replace_info
->parm_num
;
5938 req_type
= TREE_TYPE (parm
);
5939 new_type
= TREE_TYPE (replace_info
->new_tree
);
5940 if (!useless_type_conversion_p (req_type
, new_type
))
5942 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5943 replace_info
->new_tree
5944 = fold_build1 (NOP_EXPR
, req_type
,
5945 replace_info
->new_tree
);
5946 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (new_type
))
5947 replace_info
->new_tree
5948 = fold_build1 (VIEW_CONVERT_EXPR
, req_type
,
5949 replace_info
->new_tree
);
5954 fprintf (dump_file
, " const ");
5955 print_generic_expr (dump_file
,
5956 replace_info
->new_tree
);
5958 " can't be converted to param ");
5959 print_generic_expr (dump_file
, parm
);
5960 fprintf (dump_file
, "\n");
5962 replace_info
->old_tree
= NULL
;
5967 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5968 if (replace_info
->old_tree
)
5970 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5971 replace_info
->new_tree
, id
.src_fn
,
5975 init_stmts
.safe_push (init
);
5976 if (MAY_HAVE_DEBUG_STMTS
&& args_to_skip
)
5982 for (parm
= DECL_ARGUMENTS (old_decl
), p
= 0; parm
;
5983 parm
= DECL_CHAIN (parm
), p
++)
5984 if (parm
== replace_info
->old_tree
)
5992 if (debug_args_to_skip
== args_to_skip
)
5994 debug_args_to_skip
= BITMAP_ALLOC (NULL
);
5995 bitmap_copy (debug_args_to_skip
, args_to_skip
);
5997 bitmap_clear_bit (debug_args_to_skip
, parm_num
);
6003 /* Copy the function's arguments. */
6004 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
6005 DECL_ARGUMENTS (new_decl
)
6006 = copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
6007 args_to_skip
, &vars
);
6009 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
6010 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
6012 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
6014 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
6015 /* Add local vars. */
6016 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
6018 if (DECL_RESULT (old_decl
) == NULL_TREE
)
6020 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
6022 DECL_RESULT (new_decl
)
6023 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
6024 RESULT_DECL
, NULL_TREE
, void_type_node
);
6025 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
6026 cfun
->returns_struct
= 0;
6027 cfun
->returns_pcc_struct
= 0;
6032 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
6033 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
6034 if (gimple_in_ssa_p (id
.src_cfun
)
6035 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
6036 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
6038 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
6039 insert_decl_map (&id
, old_name
, new_name
);
6040 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
6041 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
6045 /* Set up the destination functions loop tree. */
6046 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
6048 cfun
->curr_properties
&= ~PROP_loops
;
6049 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
6050 cfun
->curr_properties
|= PROP_loops
;
6053 /* Copy the Function's body. */
6054 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
6055 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
6058 /* Renumber the lexical scoping (non-code) blocks consecutively. */
6059 number_blocks (new_decl
);
6061 /* We want to create the BB unconditionally, so that the addition of
6062 debug stmts doesn't affect BB count, which may in the end cause
6063 codegen differences. */
6064 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6065 while (init_stmts
.length ())
6066 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
6067 update_clone_info (&id
);
6069 /* Remap the nonlocal_goto_save_area, if any. */
6070 if (cfun
->nonlocal_goto_save_area
)
6072 struct walk_stmt_info wi
;
6074 memset (&wi
, 0, sizeof (wi
));
6076 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
6082 delete id
.debug_map
;
6083 free_dominance_info (CDI_DOMINATORS
);
6084 free_dominance_info (CDI_POST_DOMINATORS
);
6086 fold_marked_statements (0, id
.statements_to_fold
);
6087 delete id
.statements_to_fold
;
6088 delete_unreachable_blocks_update_callgraph (&id
);
6089 if (id
.dst_node
->definition
)
6090 cgraph_edge::rebuild_references ();
6091 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
6093 calculate_dominance_info (CDI_DOMINATORS
);
6094 fix_loop_structure (NULL
);
6096 update_ssa (TODO_update_ssa
);
6098 /* After partial cloning we need to rescale frequencies, so they are
6099 within proper range in the cloned function. */
6102 struct cgraph_edge
*e
;
6103 rebuild_frequencies ();
6105 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
6106 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
6108 basic_block bb
= gimple_bb (e
->call_stmt
);
6109 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
6111 e
->count
= bb
->count
;
6113 for (e
= new_version_node
->indirect_calls
; 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
;
6122 if (debug_args_to_skip
&& MAY_HAVE_DEBUG_STMTS
)
6125 vec
<tree
, va_gc
> **debug_args
= NULL
;
6126 unsigned int len
= 0;
6127 for (parm
= DECL_ARGUMENTS (old_decl
), i
= 0;
6128 parm
; parm
= DECL_CHAIN (parm
), i
++)
6129 if (bitmap_bit_p (debug_args_to_skip
, i
) && is_gimple_reg (parm
))
6133 if (debug_args
== NULL
)
6135 debug_args
= decl_debug_args_insert (new_decl
);
6136 len
= vec_safe_length (*debug_args
);
6138 ddecl
= make_node (DEBUG_EXPR_DECL
);
6139 DECL_ARTIFICIAL (ddecl
) = 1;
6140 TREE_TYPE (ddecl
) = TREE_TYPE (parm
);
6141 SET_DECL_MODE (ddecl
, DECL_MODE (parm
));
6142 vec_safe_push (*debug_args
, DECL_ORIGIN (parm
));
6143 vec_safe_push (*debug_args
, ddecl
);
6145 if (debug_args
!= NULL
)
6147 /* On the callee side, add
6150 stmts to the first bb where var is a VAR_DECL created for the
6151 optimized away parameter in DECL_INITIAL block. This hints
6152 in the debug info that var (whole DECL_ORIGIN is the parm
6153 PARM_DECL) is optimized away, but could be looked up at the
6154 call site as value of D#X there. */
6155 tree var
= vars
, vexpr
;
6156 gimple_stmt_iterator cgsi
6157 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6160 i
= vec_safe_length (*debug_args
);
6164 while (var
!= NULL_TREE
6165 && DECL_ABSTRACT_ORIGIN (var
) != (**debug_args
)[i
])
6166 var
= TREE_CHAIN (var
);
6167 if (var
== NULL_TREE
)
6169 vexpr
= make_node (DEBUG_EXPR_DECL
);
6170 parm
= (**debug_args
)[i
];
6171 DECL_ARTIFICIAL (vexpr
) = 1;
6172 TREE_TYPE (vexpr
) = TREE_TYPE (parm
);
6173 SET_DECL_MODE (vexpr
, DECL_MODE (parm
));
6174 def_temp
= gimple_build_debug_bind (var
, vexpr
, NULL
);
6175 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6176 def_temp
= gimple_build_debug_source_bind (vexpr
, parm
, NULL
);
6177 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6183 if (debug_args_to_skip
&& debug_args_to_skip
!= args_to_skip
)
6184 BITMAP_FREE (debug_args_to_skip
);
6185 free_dominance_info (CDI_DOMINATORS
);
6186 free_dominance_info (CDI_POST_DOMINATORS
);
6188 gcc_assert (!id
.debug_stmts
.exists ());
6193 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6194 the callee and return the inlined body on success. */
6197 maybe_inline_call_in_expr (tree exp
)
6199 tree fn
= get_callee_fndecl (exp
);
6201 /* We can only try to inline "const" functions. */
6202 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
6204 call_expr_arg_iterator iter
;
6207 hash_map
<tree
, tree
> decl_map
;
6209 /* Remap the parameters. */
6210 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
6212 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
6213 decl_map
.put (param
, arg
);
6215 memset (&id
, 0, sizeof (id
));
6217 id
.dst_fn
= current_function_decl
;
6218 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6219 id
.decl_map
= &decl_map
;
6221 id
.copy_decl
= copy_decl_no_change
;
6222 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6223 id
.transform_new_cfg
= false;
6224 id
.transform_return_to_modify
= true;
6225 id
.transform_parameter
= true;
6226 id
.transform_lang_insert_block
= NULL
;
6228 /* Make sure not to unshare trees behind the front-end's back
6229 since front-end specific mechanisms may rely on sharing. */
6230 id
.regimplify
= false;
6231 id
.do_not_unshare
= true;
6233 /* We're not inside any EH region. */
6236 t
= copy_tree_body (&id
);
6238 /* We can only return something suitable for use in a GENERIC
6240 if (TREE_CODE (t
) == MODIFY_EXPR
)
6241 return TREE_OPERAND (t
, 1);
6247 /* Duplicate a type, fields and all. */
6250 build_duplicate_type (tree type
)
6252 struct copy_body_data id
;
6254 memset (&id
, 0, sizeof (id
));
6255 id
.src_fn
= current_function_decl
;
6256 id
.dst_fn
= current_function_decl
;
6258 id
.decl_map
= new hash_map
<tree
, tree
>;
6259 id
.debug_map
= NULL
;
6260 id
.copy_decl
= copy_decl_no_change
;
6262 type
= remap_type_1 (type
, &id
);
6266 delete id
.debug_map
;
6268 TYPE_CANONICAL (type
) = type
;
6273 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6274 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6278 copy_fn (tree fn
, tree
& parms
, tree
& result
)
6282 hash_map
<tree
, tree
> decl_map
;
6287 memset (&id
, 0, sizeof (id
));
6289 id
.dst_fn
= current_function_decl
;
6290 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6291 id
.decl_map
= &decl_map
;
6293 id
.copy_decl
= copy_decl_no_change
;
6294 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6295 id
.transform_new_cfg
= false;
6296 id
.transform_return_to_modify
= false;
6297 id
.transform_parameter
= true;
6298 id
.transform_lang_insert_block
= NULL
;
6300 /* Make sure not to unshare trees behind the front-end's back
6301 since front-end specific mechanisms may rely on sharing. */
6302 id
.regimplify
= false;
6303 id
.do_not_unshare
= true;
6305 /* We're not inside any EH region. */
6308 /* Remap the parameters and result and return them to the caller. */
6309 for (param
= DECL_ARGUMENTS (fn
);
6311 param
= DECL_CHAIN (param
))
6313 *p
= remap_decl (param
, &id
);
6314 p
= &DECL_CHAIN (*p
);
6317 if (DECL_RESULT (fn
))
6318 result
= remap_decl (DECL_RESULT (fn
), &id
);
6322 return copy_tree_body (&id
);