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"
62 /* I'm not real happy about this, but we need to handle gimple and
65 /* Inlining, Cloning, Versioning, Parallelization
67 Inlining: a function body is duplicated, but the PARM_DECLs are
68 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
69 MODIFY_EXPRs that store to a dedicated returned-value variable.
70 The duplicated eh_region info of the copy will later be appended
71 to the info for the caller; the eh_region info in copied throwing
72 statements and RESX statements are adjusted accordingly.
74 Cloning: (only in C++) We have one body for a con/de/structor, and
75 multiple function decls, each with a unique parameter list.
76 Duplicate the body, using the given splay tree; some parameters
77 will become constants (like 0 or 1).
79 Versioning: a function body is duplicated and the result is a new
80 function rather than into blocks of an existing function as with
81 inlining. Some parameters will become constants.
83 Parallelization: a region of a function is duplicated resulting in
84 a new function. Variables may be replaced with complex expressions
85 to enable shared variable semantics.
87 All of these will simultaneously lookup any callgraph edges. If
88 we're going to inline the duplicated function body, and the given
89 function has some cloned callgraph nodes (one for each place this
90 function will be inlined) those callgraph edges will be duplicated.
91 If we're cloning the body, those callgraph edges will be
92 updated to point into the new body. (Note that the original
93 callgraph node and edge list will not be altered.)
95 See the CALL_EXPR handling case in copy_tree_body_r (). */
99 o In order to make inlining-on-trees work, we pessimized
100 function-local static constants. In particular, they are now
101 always output, even when not addressed. Fix this by treating
102 function-local static constants just like global static
103 constants; the back-end already knows not to output them if they
106 o Provide heuristics to clamp inlining of recursive template
110 /* Weights that estimate_num_insns uses to estimate the size of the
113 eni_weights eni_size_weights
;
115 /* Weights that estimate_num_insns uses to estimate the time necessary
116 to execute the produced code. */
118 eni_weights eni_time_weights
;
122 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, tree
,
124 static void remap_block (tree
*, copy_body_data
*);
125 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
126 static void declare_inline_vars (tree
, tree
);
127 static void remap_save_expr (tree
*, hash_map
<tree
, tree
> *, int *);
128 static void prepend_lexical_block (tree current_block
, tree new_block
);
129 static tree
copy_decl_to_var (tree
, copy_body_data
*);
130 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
131 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
132 static gimple_seq
remap_gimple_stmt (gimple
*, copy_body_data
*);
133 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
134 static void insert_init_stmt (copy_body_data
*, basic_block
, gimple
*);
136 /* Insert a tree->tree mapping for ID. Despite the name suggests
137 that the trees should be variables, it is used for more than that. */
140 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
142 id
->decl_map
->put (key
, value
);
144 /* Always insert an identity map as well. If we see this same new
145 node again, we won't want to duplicate it a second time. */
147 id
->decl_map
->put (value
, value
);
150 /* Insert a tree->tree mapping for ID. This is only used for
154 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
156 if (!gimple_in_ssa_p (id
->src_cfun
))
159 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
162 if (!target_for_debug_bind (key
))
165 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
166 gcc_assert (VAR_P (value
));
169 id
->debug_map
= new hash_map
<tree
, tree
>;
171 id
->debug_map
->put (key
, value
);
174 /* If nonzero, we're remapping the contents of inlined debug
175 statements. If negative, an error has occurred, such as a
176 reference to a variable that isn't available in the inlined
178 static int processing_debug_stmt
= 0;
180 /* Construct new SSA name for old NAME. ID is the inline context. */
183 remap_ssa_name (tree name
, copy_body_data
*id
)
188 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
190 n
= id
->decl_map
->get (name
);
192 return unshare_expr (*n
);
194 if (processing_debug_stmt
)
196 if (SSA_NAME_IS_DEFAULT_DEF (name
)
197 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
198 && id
->entry_bb
== NULL
199 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
201 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
203 gimple_stmt_iterator gsi
;
204 tree val
= SSA_NAME_VAR (name
);
206 n
= id
->decl_map
->get (val
);
209 if (TREE_CODE (val
) != PARM_DECL
)
211 processing_debug_stmt
= -1;
214 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
215 DECL_ARTIFICIAL (vexpr
) = 1;
216 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
217 SET_DECL_MODE (vexpr
, DECL_MODE (SSA_NAME_VAR (name
)));
218 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
219 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
223 processing_debug_stmt
= -1;
227 /* Remap anonymous SSA names or SSA names of anonymous decls. */
228 var
= SSA_NAME_VAR (name
);
230 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
232 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
233 && DECL_ARTIFICIAL (var
)
234 && DECL_IGNORED_P (var
)
235 && !DECL_NAME (var
)))
237 struct ptr_info_def
*pi
;
238 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
));
239 if (!var
&& SSA_NAME_IDENTIFIER (name
))
240 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
241 insert_decl_map (id
, name
, new_tree
);
242 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
243 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
244 /* At least IPA points-to info can be directly transferred. */
245 if (id
->src_cfun
->gimple_df
246 && id
->src_cfun
->gimple_df
->ipa_pta
247 && POINTER_TYPE_P (TREE_TYPE (name
))
248 && (pi
= SSA_NAME_PTR_INFO (name
))
251 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
257 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
259 new_tree
= remap_decl (var
, id
);
261 /* We might've substituted constant or another SSA_NAME for
264 Replace the SSA name representing RESULT_DECL by variable during
265 inlining: this saves us from need to introduce PHI node in a case
266 return value is just partly initialized. */
267 if ((VAR_P (new_tree
) || TREE_CODE (new_tree
) == PARM_DECL
)
268 && (!SSA_NAME_VAR (name
)
269 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
270 || !id
->transform_return_to_modify
))
272 struct ptr_info_def
*pi
;
273 new_tree
= make_ssa_name (new_tree
);
274 insert_decl_map (id
, name
, new_tree
);
275 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
276 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
277 /* At least IPA points-to info can be directly transferred. */
278 if (id
->src_cfun
->gimple_df
279 && id
->src_cfun
->gimple_df
->ipa_pta
280 && POINTER_TYPE_P (TREE_TYPE (name
))
281 && (pi
= SSA_NAME_PTR_INFO (name
))
284 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
287 if (SSA_NAME_IS_DEFAULT_DEF (name
))
289 /* By inlining function having uninitialized variable, we might
290 extend the lifetime (variable might get reused). This cause
291 ICE in the case we end up extending lifetime of SSA name across
292 abnormal edge, but also increase register pressure.
294 We simply initialize all uninitialized vars by 0 except
295 for case we are inlining to very first BB. We can avoid
296 this for all BBs that are not inside strongly connected
297 regions of the CFG, but this is expensive to test. */
299 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
300 && (!SSA_NAME_VAR (name
)
301 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
302 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
304 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
306 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
308 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
310 init_stmt
= gimple_build_assign (new_tree
, zero
);
311 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
312 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
316 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
317 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
322 insert_decl_map (id
, name
, new_tree
);
326 /* Remap DECL during the copying of the BLOCK tree for the function. */
329 remap_decl (tree decl
, copy_body_data
*id
)
333 /* We only remap local variables in the current function. */
335 /* See if we have remapped this declaration. */
337 n
= id
->decl_map
->get (decl
);
339 if (!n
&& processing_debug_stmt
)
341 processing_debug_stmt
= -1;
345 /* When remapping a type within copy_gimple_seq_and_replace_locals, all
346 necessary DECLs have already been remapped and we do not want to duplicate
347 a decl coming from outside of the sequence we are copying. */
349 && id
->prevent_decl_creation_for_types
350 && id
->remapping_type_depth
> 0
351 && (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
))
354 /* If we didn't already have an equivalent for this declaration, create one
358 /* Make a copy of the variable or label. */
359 tree t
= id
->copy_decl (decl
, id
);
361 /* Remember it, so that if we encounter this local entity again
362 we can reuse this copy. Do this early because remap_type may
363 need this decl for TYPE_STUB_DECL. */
364 insert_decl_map (id
, decl
, t
);
369 /* Remap types, if necessary. */
370 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
371 if (TREE_CODE (t
) == TYPE_DECL
)
373 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
375 /* Preserve the invariant that DECL_ORIGINAL_TYPE != TREE_TYPE,
376 which is enforced in gen_typedef_die when DECL_ABSTRACT_ORIGIN
377 is not set on the TYPE_DECL, for example in LTO mode. */
378 if (DECL_ORIGINAL_TYPE (t
) == TREE_TYPE (t
))
380 tree x
= build_variant_type_copy (TREE_TYPE (t
));
381 TYPE_STUB_DECL (x
) = TYPE_STUB_DECL (TREE_TYPE (t
));
382 TYPE_NAME (x
) = TYPE_NAME (TREE_TYPE (t
));
383 DECL_ORIGINAL_TYPE (t
) = x
;
387 /* Remap sizes as necessary. */
388 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
389 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
391 /* If fields, do likewise for offset and qualifier. */
392 if (TREE_CODE (t
) == FIELD_DECL
)
394 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
395 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
396 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
402 if (id
->do_not_unshare
)
405 return unshare_expr (*n
);
409 remap_type_1 (tree type
, copy_body_data
*id
)
413 /* We do need a copy. build and register it now. If this is a pointer or
414 reference type, remap the designated type and make a new pointer or
416 if (TREE_CODE (type
) == POINTER_TYPE
)
418 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
420 TYPE_REF_CAN_ALIAS_ALL (type
));
421 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
422 new_tree
= build_type_attribute_qual_variant (new_tree
,
423 TYPE_ATTRIBUTES (type
),
425 insert_decl_map (id
, type
, new_tree
);
428 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
430 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
432 TYPE_REF_CAN_ALIAS_ALL (type
));
433 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
434 new_tree
= build_type_attribute_qual_variant (new_tree
,
435 TYPE_ATTRIBUTES (type
),
437 insert_decl_map (id
, type
, new_tree
);
441 new_tree
= copy_node (type
);
443 insert_decl_map (id
, type
, new_tree
);
445 /* This is a new type, not a copy of an old type. Need to reassociate
446 variants. We can handle everything except the main variant lazily. */
447 t
= TYPE_MAIN_VARIANT (type
);
450 t
= remap_type (t
, id
);
451 TYPE_MAIN_VARIANT (new_tree
) = t
;
452 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
453 TYPE_NEXT_VARIANT (t
) = new_tree
;
457 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
458 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
461 if (TYPE_STUB_DECL (type
))
462 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
464 /* Lazily create pointer and reference types. */
465 TYPE_POINTER_TO (new_tree
) = NULL
;
466 TYPE_REFERENCE_TO (new_tree
) = NULL
;
468 /* Copy all types that may contain references to local variables; be sure to
469 preserve sharing in between type and its main variant when possible. */
470 switch (TREE_CODE (new_tree
))
474 case FIXED_POINT_TYPE
:
477 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
479 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
480 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
482 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
483 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
487 t
= TYPE_MIN_VALUE (new_tree
);
488 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
489 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
491 t
= TYPE_MAX_VALUE (new_tree
);
492 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
493 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
498 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
499 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
500 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
502 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
503 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
504 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
505 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
507 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
511 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
512 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
513 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
515 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
517 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
519 gcc_checking_assert (TYPE_DOMAIN (type
) == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
520 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
523 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
528 case QUAL_UNION_TYPE
:
529 if (TYPE_MAIN_VARIANT (type
) != type
530 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
531 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
536 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
538 t
= remap_decl (f
, id
);
539 DECL_CONTEXT (t
) = new_tree
;
543 TYPE_FIELDS (new_tree
) = nreverse (nf
);
549 /* Shouldn't have been thought variable sized. */
553 /* All variants of type share the same size, so use the already remaped data. */
554 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
556 gcc_checking_assert (TYPE_SIZE (type
) == TYPE_SIZE (TYPE_MAIN_VARIANT (type
)));
557 gcc_checking_assert (TYPE_SIZE_UNIT (type
) == TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
)));
559 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
560 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
564 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
565 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
572 remap_type (tree type
, copy_body_data
*id
)
580 /* See if we have remapped this type. */
581 node
= id
->decl_map
->get (type
);
585 /* The type only needs remapping if it's variably modified. */
586 if (! variably_modified_type_p (type
, id
->src_fn
))
588 insert_decl_map (id
, type
, type
);
592 id
->remapping_type_depth
++;
593 tmp
= remap_type_1 (type
, id
);
594 id
->remapping_type_depth
--;
599 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
602 can_be_nonlocal (tree decl
, copy_body_data
*id
)
604 /* We can not duplicate function decls. */
605 if (TREE_CODE (decl
) == FUNCTION_DECL
)
608 /* Local static vars must be non-local or we get multiple declaration
610 if (VAR_P (decl
) && !auto_var_in_fn_p (decl
, id
->src_fn
))
617 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
621 tree new_decls
= NULL_TREE
;
623 /* Remap its variables. */
624 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
628 if (can_be_nonlocal (old_var
, id
))
630 /* We need to add this variable to the local decls as otherwise
631 nothing else will do so. */
632 if (VAR_P (old_var
) && ! DECL_EXTERNAL (old_var
) && cfun
)
633 add_local_decl (cfun
, old_var
);
634 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
635 && !DECL_IGNORED_P (old_var
)
636 && nonlocalized_list
)
637 vec_safe_push (*nonlocalized_list
, old_var
);
641 /* Remap the variable. */
642 new_var
= remap_decl (old_var
, id
);
644 /* If we didn't remap this variable, we can't mess with its
645 TREE_CHAIN. If we remapped this variable to the return slot, it's
646 already declared somewhere else, so don't declare it here. */
648 if (new_var
== id
->retvar
)
652 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
653 && !DECL_IGNORED_P (old_var
)
654 && nonlocalized_list
)
655 vec_safe_push (*nonlocalized_list
, old_var
);
659 gcc_assert (DECL_P (new_var
));
660 DECL_CHAIN (new_var
) = new_decls
;
663 /* Also copy value-expressions. */
664 if (VAR_P (new_var
) && DECL_HAS_VALUE_EXPR_P (new_var
))
666 tree tem
= DECL_VALUE_EXPR (new_var
);
667 bool old_regimplify
= id
->regimplify
;
668 id
->remapping_type_depth
++;
669 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
670 id
->remapping_type_depth
--;
671 id
->regimplify
= old_regimplify
;
672 SET_DECL_VALUE_EXPR (new_var
, tem
);
677 return nreverse (new_decls
);
680 /* Copy the BLOCK to contain remapped versions of the variables
681 therein. And hook the new block into the block-tree. */
684 remap_block (tree
*block
, copy_body_data
*id
)
689 /* Make the new block. */
691 new_block
= make_node (BLOCK
);
692 TREE_USED (new_block
) = TREE_USED (old_block
);
693 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
694 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
695 BLOCK_NONLOCALIZED_VARS (new_block
)
696 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
699 /* Remap its variables. */
700 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
701 &BLOCK_NONLOCALIZED_VARS (new_block
),
704 if (id
->transform_lang_insert_block
)
705 id
->transform_lang_insert_block (new_block
);
707 /* Remember the remapped block. */
708 insert_decl_map (id
, old_block
, new_block
);
711 /* Copy the whole block tree and root it in id->block. */
713 remap_blocks (tree block
, copy_body_data
*id
)
716 tree new_tree
= block
;
721 remap_block (&new_tree
, id
);
722 gcc_assert (new_tree
!= block
);
723 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
724 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
725 /* Blocks are in arbitrary order, but make things slightly prettier and do
726 not swap order when producing a copy. */
727 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
731 /* Remap the block tree rooted at BLOCK to nothing. */
733 remap_blocks_to_null (tree block
, copy_body_data
*id
)
736 insert_decl_map (id
, block
, NULL_TREE
);
737 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
738 remap_blocks_to_null (t
, id
);
742 copy_statement_list (tree
*tp
)
744 tree_stmt_iterator oi
, ni
;
747 new_tree
= alloc_stmt_list ();
748 ni
= tsi_start (new_tree
);
749 oi
= tsi_start (*tp
);
750 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
753 for (; !tsi_end_p (oi
); tsi_next (&oi
))
755 tree stmt
= tsi_stmt (oi
);
756 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
757 /* This copy is not redundant; tsi_link_after will smash this
758 STATEMENT_LIST into the end of the one we're building, and we
759 don't want to do that with the original. */
760 copy_statement_list (&stmt
);
761 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
766 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
768 tree block
= BIND_EXPR_BLOCK (*tp
);
769 /* Copy (and replace) the statement. */
770 copy_tree_r (tp
, walk_subtrees
, NULL
);
773 remap_block (&block
, id
);
774 BIND_EXPR_BLOCK (*tp
) = block
;
777 if (BIND_EXPR_VARS (*tp
))
778 /* This will remap a lot of the same decls again, but this should be
780 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
784 /* Create a new gimple_seq by remapping all the statements in BODY
785 using the inlining information in ID. */
788 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
790 gimple_stmt_iterator si
;
791 gimple_seq new_body
= NULL
;
793 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
795 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
796 gimple_seq_add_seq (&new_body
, new_stmts
);
803 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
804 block using the mapping information in ID. */
807 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
810 tree new_block
, new_vars
;
811 gimple_seq body
, new_body
;
813 /* Copy the statement. Note that we purposely don't use copy_stmt
814 here because we need to remap statements as we copy. */
815 body
= gimple_bind_body (stmt
);
816 new_body
= remap_gimple_seq (body
, id
);
818 new_block
= gimple_bind_block (stmt
);
820 remap_block (&new_block
, id
);
822 /* This will remap a lot of the same decls again, but this should be
824 new_vars
= gimple_bind_vars (stmt
);
826 new_vars
= remap_decls (new_vars
, NULL
, id
);
828 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
833 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
838 if (TREE_CODE (decl
) == SSA_NAME
)
840 decl
= SSA_NAME_VAR (decl
);
845 return (TREE_CODE (decl
) == PARM_DECL
);
848 /* Remap the dependence CLIQUE from the source to the destination function
849 as specified in ID. */
851 static unsigned short
852 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
854 if (clique
== 0 || processing_debug_stmt
)
856 if (!id
->dependence_map
)
857 id
->dependence_map
= new hash_map
<dependence_hash
, unsigned short>;
859 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
861 newc
= ++cfun
->last_clique
;
865 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
866 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
867 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
868 recursing into the children nodes of *TP. */
871 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
873 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
874 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
875 tree fn
= id
->src_fn
;
877 /* For recursive invocations this is no longer the LHS itself. */
878 bool is_lhs
= wi_p
->is_lhs
;
879 wi_p
->is_lhs
= false;
881 if (TREE_CODE (*tp
) == SSA_NAME
)
883 *tp
= remap_ssa_name (*tp
, id
);
886 SSA_NAME_DEF_STMT (*tp
) = wi_p
->stmt
;
889 else if (auto_var_in_fn_p (*tp
, fn
))
891 /* Local variables and labels need to be replaced by equivalent
892 variables. We don't want to copy static variables; there's
893 only one of those, no matter how many times we inline the
894 containing function. Similarly for globals from an outer
898 /* Remap the declaration. */
899 new_decl
= remap_decl (*tp
, id
);
900 gcc_assert (new_decl
);
901 /* Replace this variable with the copy. */
902 STRIP_TYPE_NOPS (new_decl
);
903 /* ??? The C++ frontend uses void * pointer zero to initialize
904 any other type. This confuses the middle-end type verification.
905 As cloned bodies do not go through gimplification again the fixup
906 there doesn't trigger. */
907 if (TREE_CODE (new_decl
) == INTEGER_CST
908 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
909 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
913 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
915 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
917 else if (TREE_CODE (*tp
) == LABEL_DECL
918 && (!DECL_CONTEXT (*tp
)
919 || decl_function_context (*tp
) == id
->src_fn
))
920 /* These may need to be remapped for EH handling. */
921 *tp
= remap_decl (*tp
, id
);
922 else if (TREE_CODE (*tp
) == FIELD_DECL
)
924 /* If the enclosing record type is variably_modified_type_p, the field
925 has already been remapped. Otherwise, it need not be. */
926 tree
*n
= id
->decl_map
->get (*tp
);
931 else if (TYPE_P (*tp
))
932 /* Types may need remapping as well. */
933 *tp
= remap_type (*tp
, id
);
934 else if (CONSTANT_CLASS_P (*tp
))
936 /* If this is a constant, we have to copy the node iff the type
937 will be remapped. copy_tree_r will not copy a constant. */
938 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
940 if (new_type
== TREE_TYPE (*tp
))
943 else if (TREE_CODE (*tp
) == INTEGER_CST
)
944 *tp
= wide_int_to_tree (new_type
, *tp
);
947 *tp
= copy_node (*tp
);
948 TREE_TYPE (*tp
) = new_type
;
953 /* Otherwise, just copy the node. Note that copy_tree_r already
954 knows not to copy VAR_DECLs, etc., so this is safe. */
956 if (TREE_CODE (*tp
) == MEM_REF
)
958 /* We need to re-canonicalize MEM_REFs from inline substitutions
959 that can happen when a pointer argument is an ADDR_EXPR.
960 Recurse here manually to allow that. */
961 tree ptr
= TREE_OPERAND (*tp
, 0);
962 tree type
= remap_type (TREE_TYPE (*tp
), id
);
964 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
965 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
966 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
967 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
968 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
969 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
971 MR_DEPENDENCE_CLIQUE (*tp
)
972 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
973 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
975 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
976 remapped a parameter as the property might be valid only
977 for the parameter itself. */
978 if (TREE_THIS_NOTRAP (old
)
979 && (!is_parm (TREE_OPERAND (old
, 0))
980 || (!id
->transform_parameter
&& is_parm (ptr
))))
981 TREE_THIS_NOTRAP (*tp
) = 1;
982 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
987 /* Here is the "usual case". Copy this tree node, and then
988 tweak some special cases. */
989 copy_tree_r (tp
, walk_subtrees
, NULL
);
991 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
992 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
994 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
996 /* The copied TARGET_EXPR has never been expanded, even if the
997 original node was expanded already. */
998 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
999 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1001 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1003 /* Variable substitution need not be simple. In particular,
1004 the MEM_REF substitution above. Make sure that
1005 TREE_CONSTANT and friends are up-to-date. */
1006 int invariant
= is_gimple_min_invariant (*tp
);
1007 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
1008 recompute_tree_invariant_for_addr_expr (*tp
);
1010 /* If this used to be invariant, but is not any longer,
1011 then regimplification is probably needed. */
1012 if (invariant
&& !is_gimple_min_invariant (*tp
))
1013 id
->regimplify
= true;
1019 /* Update the TREE_BLOCK for the cloned expr. */
1022 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1023 tree old_block
= TREE_BLOCK (*tp
);
1027 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1031 TREE_SET_BLOCK (*tp
, new_block
);
1034 /* Keep iterating. */
1039 /* Called from copy_body_id via walk_tree. DATA is really a
1040 `copy_body_data *'. */
1043 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1045 copy_body_data
*id
= (copy_body_data
*) data
;
1046 tree fn
= id
->src_fn
;
1049 /* Begin by recognizing trees that we'll completely rewrite for the
1050 inlining context. Our output for these trees is completely
1051 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1052 into an edge). Further down, we'll handle trees that get
1053 duplicated and/or tweaked. */
1055 /* When requested, RETURN_EXPRs should be transformed to just the
1056 contained MODIFY_EXPR. The branch semantics of the return will
1057 be handled elsewhere by manipulating the CFG rather than a statement. */
1058 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1060 tree assignment
= TREE_OPERAND (*tp
, 0);
1062 /* If we're returning something, just turn that into an
1063 assignment into the equivalent of the original RESULT_DECL.
1064 If the "assignment" is just the result decl, the result
1065 decl has already been set (e.g. a recent "foo (&result_decl,
1066 ...)"); just toss the entire RETURN_EXPR. */
1067 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1069 /* Replace the RETURN_EXPR with (a copy of) the
1070 MODIFY_EXPR hanging underneath. */
1071 *tp
= copy_node (assignment
);
1073 else /* Else the RETURN_EXPR returns no value. */
1076 return (tree
) (void *)1;
1079 else if (TREE_CODE (*tp
) == SSA_NAME
)
1081 *tp
= remap_ssa_name (*tp
, id
);
1086 /* Local variables and labels need to be replaced by equivalent
1087 variables. We don't want to copy static variables; there's only
1088 one of those, no matter how many times we inline the containing
1089 function. Similarly for globals from an outer function. */
1090 else if (auto_var_in_fn_p (*tp
, fn
))
1094 /* Remap the declaration. */
1095 new_decl
= remap_decl (*tp
, id
);
1096 gcc_assert (new_decl
);
1097 /* Replace this variable with the copy. */
1098 STRIP_TYPE_NOPS (new_decl
);
1102 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1103 copy_statement_list (tp
);
1104 else if (TREE_CODE (*tp
) == SAVE_EXPR
1105 || TREE_CODE (*tp
) == TARGET_EXPR
)
1106 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1107 else if (TREE_CODE (*tp
) == LABEL_DECL
1108 && (! DECL_CONTEXT (*tp
)
1109 || decl_function_context (*tp
) == id
->src_fn
))
1110 /* These may need to be remapped for EH handling. */
1111 *tp
= remap_decl (*tp
, id
);
1112 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1113 copy_bind_expr (tp
, walk_subtrees
, id
);
1114 /* Types may need remapping as well. */
1115 else if (TYPE_P (*tp
))
1116 *tp
= remap_type (*tp
, id
);
1118 /* If this is a constant, we have to copy the node iff the type will be
1119 remapped. copy_tree_r will not copy a constant. */
1120 else if (CONSTANT_CLASS_P (*tp
))
1122 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1124 if (new_type
== TREE_TYPE (*tp
))
1127 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1128 *tp
= wide_int_to_tree (new_type
, *tp
);
1131 *tp
= copy_node (*tp
);
1132 TREE_TYPE (*tp
) = new_type
;
1136 /* Otherwise, just copy the node. Note that copy_tree_r already
1137 knows not to copy VAR_DECLs, etc., so this is safe. */
1140 /* Here we handle trees that are not completely rewritten.
1141 First we detect some inlining-induced bogosities for
1143 if (TREE_CODE (*tp
) == MODIFY_EXPR
1144 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1145 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1147 /* Some assignments VAR = VAR; don't generate any rtl code
1148 and thus don't count as variable modification. Avoid
1149 keeping bogosities like 0 = 0. */
1150 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1153 n
= id
->decl_map
->get (decl
);
1157 STRIP_TYPE_NOPS (value
);
1158 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1160 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1161 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1165 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1167 /* Get rid of *& from inline substitutions that can happen when a
1168 pointer argument is an ADDR_EXPR. */
1169 tree decl
= TREE_OPERAND (*tp
, 0);
1170 tree
*n
= id
->decl_map
->get (decl
);
1173 /* If we happen to get an ADDR_EXPR in n->value, strip
1174 it manually here as we'll eventually get ADDR_EXPRs
1175 which lie about their types pointed to. In this case
1176 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1177 but we absolutely rely on that. As fold_indirect_ref
1178 does other useful transformations, try that first, though. */
1179 tree type
= TREE_TYPE (*tp
);
1180 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1182 *tp
= gimple_fold_indirect_ref (ptr
);
1185 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1188 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1189 /* ??? We should either assert here or build
1190 a VIEW_CONVERT_EXPR instead of blindly leaking
1191 incompatible types to our IL. */
1193 *tp
= TREE_OPERAND (ptr
, 0);
1197 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1198 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1199 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1200 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1201 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1202 have remapped a parameter as the property might be
1203 valid only for the parameter itself. */
1204 if (TREE_THIS_NOTRAP (old
)
1205 && (!is_parm (TREE_OPERAND (old
, 0))
1206 || (!id
->transform_parameter
&& is_parm (ptr
))))
1207 TREE_THIS_NOTRAP (*tp
) = 1;
1214 else if (TREE_CODE (*tp
) == MEM_REF
)
1216 /* We need to re-canonicalize MEM_REFs from inline substitutions
1217 that can happen when a pointer argument is an ADDR_EXPR.
1218 Recurse here manually to allow that. */
1219 tree ptr
= TREE_OPERAND (*tp
, 0);
1220 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1222 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1223 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1224 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1225 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1226 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1227 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1229 MR_DEPENDENCE_CLIQUE (*tp
)
1230 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1231 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1233 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1234 remapped a parameter as the property might be valid only
1235 for the parameter itself. */
1236 if (TREE_THIS_NOTRAP (old
)
1237 && (!is_parm (TREE_OPERAND (old
, 0))
1238 || (!id
->transform_parameter
&& is_parm (ptr
))))
1239 TREE_THIS_NOTRAP (*tp
) = 1;
1240 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1245 /* Here is the "usual case". Copy this tree node, and then
1246 tweak some special cases. */
1247 copy_tree_r (tp
, walk_subtrees
, NULL
);
1249 /* If EXPR has block defined, map it to newly constructed block.
1250 When inlining we want EXPRs without block appear in the block
1251 of function call if we are not remapping a type. */
1254 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1255 if (TREE_BLOCK (*tp
))
1258 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1262 TREE_SET_BLOCK (*tp
, new_block
);
1265 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1266 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1268 /* The copied TARGET_EXPR has never been expanded, even if the
1269 original node was expanded already. */
1270 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1272 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1273 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1276 /* Variable substitution need not be simple. In particular, the
1277 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1278 and friends are up-to-date. */
1279 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1281 int invariant
= is_gimple_min_invariant (*tp
);
1282 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1284 /* Handle the case where we substituted an INDIRECT_REF
1285 into the operand of the ADDR_EXPR. */
1286 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1288 tree t
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1289 if (TREE_TYPE (t
) != TREE_TYPE (*tp
))
1290 t
= fold_convert (remap_type (TREE_TYPE (*tp
), id
), t
);
1294 recompute_tree_invariant_for_addr_expr (*tp
);
1296 /* If this used to be invariant, but is not any longer,
1297 then regimplification is probably needed. */
1298 if (invariant
&& !is_gimple_min_invariant (*tp
))
1299 id
->regimplify
= true;
1305 /* Keep iterating. */
1309 /* Helper for remap_gimple_stmt. Given an EH region number for the
1310 source function, map that to the duplicate EH region number in
1311 the destination function. */
1314 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1316 eh_region old_r
, new_r
;
1318 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1319 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1321 return new_r
->index
;
1324 /* Similar, but operate on INTEGER_CSTs. */
1327 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1331 old_nr
= tree_to_shwi (old_t_nr
);
1332 new_nr
= remap_eh_region_nr (old_nr
, id
);
1334 return build_int_cst (integer_type_node
, new_nr
);
1337 /* Helper for copy_bb. Remap statement STMT using the inlining
1338 information in ID. Return the new statement copy. */
1341 remap_gimple_stmt (gimple
*stmt
, copy_body_data
*id
)
1343 gimple
*copy
= NULL
;
1344 struct walk_stmt_info wi
;
1345 bool skip_first
= false;
1346 gimple_seq stmts
= NULL
;
1348 if (is_gimple_debug (stmt
)
1349 && !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
1352 /* Begin by recognizing trees that we'll completely rewrite for the
1353 inlining context. Our output for these trees is completely
1354 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1355 into an edge). Further down, we'll handle trees that get
1356 duplicated and/or tweaked. */
1358 /* When requested, GIMPLE_RETURNs should be transformed to just the
1359 contained GIMPLE_ASSIGN. The branch semantics of the return will
1360 be handled elsewhere by manipulating the CFG rather than the
1362 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1364 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1365 tree retbnd
= gimple_return_retbnd (stmt
);
1366 tree bndslot
= id
->retbnd
;
1368 if (retbnd
&& bndslot
)
1370 gimple
*bndcopy
= gimple_build_assign (bndslot
, retbnd
);
1371 memset (&wi
, 0, sizeof (wi
));
1373 walk_gimple_op (bndcopy
, remap_gimple_op_r
, &wi
);
1374 gimple_seq_add_stmt (&stmts
, bndcopy
);
1377 /* If we're returning something, just turn that into an
1378 assignment into the equivalent of the original RESULT_DECL.
1379 If RETVAL is just the result decl, the result decl has
1380 already been set (e.g. a recent "foo (&result_decl, ...)");
1381 just toss the entire GIMPLE_RETURN. */
1383 && (TREE_CODE (retval
) != RESULT_DECL
1384 && (TREE_CODE (retval
) != SSA_NAME
1385 || ! SSA_NAME_VAR (retval
)
1386 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1388 copy
= gimple_build_assign (id
->do_not_unshare
1389 ? id
->retvar
: unshare_expr (id
->retvar
),
1391 /* id->retvar is already substituted. Skip it on later remapping. */
1394 /* We need to copy bounds if return structure with pointers into
1395 instrumented function. */
1396 if (chkp_function_instrumented_p (id
->dst_fn
)
1398 && !BOUNDED_P (id
->retvar
)
1399 && chkp_type_has_pointer (TREE_TYPE (id
->retvar
)))
1400 id
->assign_stmts
.safe_push (copy
);
1406 else if (gimple_has_substatements (stmt
))
1410 /* When cloning bodies from the C++ front end, we will be handed bodies
1411 in High GIMPLE form. Handle here all the High GIMPLE statements that
1412 have embedded statements. */
1413 switch (gimple_code (stmt
))
1416 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1421 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1422 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1423 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1427 case GIMPLE_EH_FILTER
:
1428 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1429 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1433 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1434 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1435 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1438 case GIMPLE_WITH_CLEANUP_EXPR
:
1439 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1440 copy
= gimple_build_wce (s1
);
1443 case GIMPLE_OMP_PARALLEL
:
1445 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1446 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1447 copy
= gimple_build_omp_parallel
1449 gimple_omp_parallel_clauses (omp_par_stmt
),
1450 gimple_omp_parallel_child_fn (omp_par_stmt
),
1451 gimple_omp_parallel_data_arg (omp_par_stmt
));
1455 case GIMPLE_OMP_TASK
:
1456 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1457 copy
= gimple_build_omp_task
1459 gimple_omp_task_clauses (stmt
),
1460 gimple_omp_task_child_fn (stmt
),
1461 gimple_omp_task_data_arg (stmt
),
1462 gimple_omp_task_copy_fn (stmt
),
1463 gimple_omp_task_arg_size (stmt
),
1464 gimple_omp_task_arg_align (stmt
));
1467 case GIMPLE_OMP_FOR
:
1468 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1469 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1470 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1471 gimple_omp_for_clauses (stmt
),
1472 gimple_omp_for_collapse (stmt
), s2
);
1475 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1477 gimple_omp_for_set_index (copy
, i
,
1478 gimple_omp_for_index (stmt
, i
));
1479 gimple_omp_for_set_initial (copy
, i
,
1480 gimple_omp_for_initial (stmt
, i
));
1481 gimple_omp_for_set_final (copy
, i
,
1482 gimple_omp_for_final (stmt
, i
));
1483 gimple_omp_for_set_incr (copy
, i
,
1484 gimple_omp_for_incr (stmt
, i
));
1485 gimple_omp_for_set_cond (copy
, i
,
1486 gimple_omp_for_cond (stmt
, i
));
1491 case GIMPLE_OMP_MASTER
:
1492 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1493 copy
= gimple_build_omp_master (s1
);
1496 case GIMPLE_OMP_TASKGROUP
:
1497 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1498 copy
= gimple_build_omp_taskgroup (s1
);
1501 case GIMPLE_OMP_ORDERED
:
1502 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1503 copy
= gimple_build_omp_ordered
1505 gimple_omp_ordered_clauses (as_a
<gomp_ordered
*> (stmt
)));
1508 case GIMPLE_OMP_SECTION
:
1509 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1510 copy
= gimple_build_omp_section (s1
);
1513 case GIMPLE_OMP_SECTIONS
:
1514 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1515 copy
= gimple_build_omp_sections
1516 (s1
, gimple_omp_sections_clauses (stmt
));
1519 case GIMPLE_OMP_SINGLE
:
1520 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1521 copy
= gimple_build_omp_single
1522 (s1
, gimple_omp_single_clauses (stmt
));
1525 case GIMPLE_OMP_TARGET
:
1526 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1527 copy
= gimple_build_omp_target
1528 (s1
, gimple_omp_target_kind (stmt
),
1529 gimple_omp_target_clauses (stmt
));
1532 case GIMPLE_OMP_TEAMS
:
1533 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1534 copy
= gimple_build_omp_teams
1535 (s1
, gimple_omp_teams_clauses (stmt
));
1538 case GIMPLE_OMP_CRITICAL
:
1539 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1540 copy
= gimple_build_omp_critical (s1
,
1541 gimple_omp_critical_name
1542 (as_a
<gomp_critical
*> (stmt
)),
1543 gimple_omp_critical_clauses
1544 (as_a
<gomp_critical
*> (stmt
)));
1547 case GIMPLE_TRANSACTION
:
1549 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1550 gtransaction
*new_trans_stmt
;
1551 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1553 copy
= new_trans_stmt
= gimple_build_transaction (s1
);
1554 gimple_transaction_set_subcode (new_trans_stmt
,
1555 gimple_transaction_subcode (old_trans_stmt
));
1556 gimple_transaction_set_label_norm (new_trans_stmt
,
1557 gimple_transaction_label_norm (old_trans_stmt
));
1558 gimple_transaction_set_label_uninst (new_trans_stmt
,
1559 gimple_transaction_label_uninst (old_trans_stmt
));
1560 gimple_transaction_set_label_over (new_trans_stmt
,
1561 gimple_transaction_label_over (old_trans_stmt
));
1571 if (gimple_assign_copy_p (stmt
)
1572 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1573 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1575 /* Here we handle statements that are not completely rewritten.
1576 First we detect some inlining-induced bogosities for
1579 /* Some assignments VAR = VAR; don't generate any rtl code
1580 and thus don't count as variable modification. Avoid
1581 keeping bogosities like 0 = 0. */
1582 tree decl
= gimple_assign_lhs (stmt
), value
;
1585 n
= id
->decl_map
->get (decl
);
1589 STRIP_TYPE_NOPS (value
);
1590 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1595 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1596 in a block that we aren't copying during tree_function_versioning,
1597 just drop the clobber stmt. */
1598 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1600 tree lhs
= gimple_assign_lhs (stmt
);
1601 if (TREE_CODE (lhs
) == MEM_REF
1602 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1604 gimple
*def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1605 if (gimple_bb (def_stmt
)
1606 && !bitmap_bit_p (id
->blocks_to_copy
,
1607 gimple_bb (def_stmt
)->index
))
1612 if (gimple_debug_bind_p (stmt
))
1615 = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1616 gimple_debug_bind_get_value (stmt
),
1618 id
->debug_stmts
.safe_push (copy
);
1619 gimple_seq_add_stmt (&stmts
, copy
);
1622 if (gimple_debug_source_bind_p (stmt
))
1624 gdebug
*copy
= gimple_build_debug_source_bind
1625 (gimple_debug_source_bind_get_var (stmt
),
1626 gimple_debug_source_bind_get_value (stmt
),
1628 id
->debug_stmts
.safe_push (copy
);
1629 gimple_seq_add_stmt (&stmts
, copy
);
1633 /* Create a new deep copy of the statement. */
1634 copy
= gimple_copy (stmt
);
1636 /* Clear flags that need revisiting. */
1637 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1639 if (gimple_call_tail_p (call_stmt
))
1640 gimple_call_set_tail (call_stmt
, false);
1641 if (gimple_call_from_thunk_p (call_stmt
))
1642 gimple_call_set_from_thunk (call_stmt
, false);
1643 if (gimple_call_internal_p (call_stmt
))
1644 switch (gimple_call_internal_fn (call_stmt
))
1646 case IFN_GOMP_SIMD_LANE
:
1647 case IFN_GOMP_SIMD_VF
:
1648 case IFN_GOMP_SIMD_LAST_LANE
:
1649 case IFN_GOMP_SIMD_ORDERED_START
:
1650 case IFN_GOMP_SIMD_ORDERED_END
:
1651 DECL_STRUCT_FUNCTION (id
->dst_fn
)->has_simduid_loops
= true;
1658 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1659 RESX and EH_DISPATCH. */
1661 switch (gimple_code (copy
))
1665 tree r
, fndecl
= gimple_call_fndecl (copy
);
1666 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1667 switch (DECL_FUNCTION_CODE (fndecl
))
1669 case BUILT_IN_EH_COPY_VALUES
:
1670 r
= gimple_call_arg (copy
, 1);
1671 r
= remap_eh_region_tree_nr (r
, id
);
1672 gimple_call_set_arg (copy
, 1, r
);
1675 case BUILT_IN_EH_POINTER
:
1676 case BUILT_IN_EH_FILTER
:
1677 r
= gimple_call_arg (copy
, 0);
1678 r
= remap_eh_region_tree_nr (r
, id
);
1679 gimple_call_set_arg (copy
, 0, r
);
1686 /* Reset alias info if we didn't apply measures to
1687 keep it valid over inlining by setting DECL_PT_UID. */
1688 if (!id
->src_cfun
->gimple_df
1689 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1690 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1696 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1697 int r
= gimple_resx_region (resx_stmt
);
1698 r
= remap_eh_region_nr (r
, id
);
1699 gimple_resx_set_region (resx_stmt
, r
);
1703 case GIMPLE_EH_DISPATCH
:
1705 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1706 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1707 r
= remap_eh_region_nr (r
, id
);
1708 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1717 /* If STMT has a block defined, map it to the newly constructed
1719 if (gimple_block (copy
))
1722 n
= id
->decl_map
->get (gimple_block (copy
));
1724 gimple_set_block (copy
, *n
);
1727 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1729 gimple_seq_add_stmt (&stmts
, copy
);
1733 /* Remap all the operands in COPY. */
1734 memset (&wi
, 0, sizeof (wi
));
1737 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1739 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1741 /* Clear the copied virtual operands. We are not remapping them here
1742 but are going to recreate them from scratch. */
1743 if (gimple_has_mem_ops (copy
))
1745 gimple_set_vdef (copy
, NULL_TREE
);
1746 gimple_set_vuse (copy
, NULL_TREE
);
1749 gimple_seq_add_stmt (&stmts
, copy
);
1754 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1758 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1759 gcov_type count_scale
)
1761 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1762 basic_block copy_basic_block
;
1767 /* Search for previous copied basic block. */
1770 prev
= prev
->prev_bb
;
1772 /* create_basic_block() will append every new block to
1773 basic_block_info automatically. */
1774 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
1775 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1777 /* We are going to rebuild frequencies from scratch. These values
1778 have just small importance to drive canonicalize_loop_headers. */
1779 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1781 /* We recompute frequencies after inlining, so this is quite safe. */
1782 if (freq
> BB_FREQ_MAX
)
1784 copy_basic_block
->frequency
= freq
;
1786 copy_gsi
= gsi_start_bb (copy_basic_block
);
1788 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1791 gimple
*stmt
= gsi_stmt (gsi
);
1792 gimple
*orig_stmt
= stmt
;
1793 gimple_stmt_iterator stmts_gsi
;
1794 bool stmt_added
= false;
1796 id
->regimplify
= false;
1797 stmts
= remap_gimple_stmt (stmt
, id
);
1799 if (gimple_seq_empty_p (stmts
))
1804 for (stmts_gsi
= gsi_start (stmts
);
1805 !gsi_end_p (stmts_gsi
); )
1807 stmt
= gsi_stmt (stmts_gsi
);
1809 /* Advance iterator now before stmt is moved to seq_gsi. */
1810 gsi_next (&stmts_gsi
);
1812 if (gimple_nop_p (stmt
))
1815 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
1818 /* With return slot optimization we can end up with
1819 non-gimple (foo *)&this->m, fix that here. */
1820 if (is_gimple_assign (stmt
)
1821 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
1822 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1825 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1826 gimple_assign_rhs1 (stmt
),
1828 GSI_CONTINUE_LINKING
);
1829 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1830 id
->regimplify
= false;
1833 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1836 gimple_regimplify_operands (stmt
, &seq_gsi
);
1844 /* If copy_basic_block has been empty at the start of this iteration,
1845 call gsi_start_bb again to get at the newly added statements. */
1846 if (gsi_end_p (copy_gsi
))
1847 copy_gsi
= gsi_start_bb (copy_basic_block
);
1849 gsi_next (©_gsi
);
1851 /* Process the new statement. The call to gimple_regimplify_operands
1852 possibly turned the statement into multiple statements, we
1853 need to process all of them. */
1859 stmt
= gsi_stmt (copy_gsi
);
1860 call_stmt
= dyn_cast
<gcall
*> (stmt
);
1862 && gimple_call_va_arg_pack_p (call_stmt
)
1864 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
1866 /* __builtin_va_arg_pack () should be replaced by
1867 all arguments corresponding to ... in the caller. */
1871 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
1872 size_t n
, i
, nargs_to_copy
;
1873 bool remove_bounds
= false;
1875 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1878 /* Bounds should be removed from arg pack in case
1879 we handle not instrumented call in instrumented
1881 nargs_to_copy
= nargs
;
1882 if (gimple_call_with_bounds_p (id
->call_stmt
)
1883 && !gimple_call_with_bounds_p (stmt
))
1885 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1886 i
< gimple_call_num_args (id
->call_stmt
);
1888 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1890 remove_bounds
= true;
1893 /* Create the new array of arguments. */
1894 n
= nargs_to_copy
+ gimple_call_num_args (call_stmt
);
1895 argarray
.create (n
);
1896 argarray
.safe_grow_cleared (n
);
1898 /* Copy all the arguments before '...' */
1899 memcpy (argarray
.address (),
1900 gimple_call_arg_ptr (call_stmt
, 0),
1901 gimple_call_num_args (call_stmt
) * sizeof (tree
));
1905 /* Append the rest of arguments removing bounds. */
1906 unsigned cur
= gimple_call_num_args (call_stmt
);
1907 i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1908 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1909 i
< gimple_call_num_args (id
->call_stmt
);
1911 if (!POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1912 argarray
[cur
++] = gimple_call_arg (id
->call_stmt
, i
);
1913 gcc_assert (cur
== n
);
1917 /* Append the arguments passed in '...' */
1918 memcpy (argarray
.address () + gimple_call_num_args (call_stmt
),
1919 gimple_call_arg_ptr (id
->call_stmt
, 0)
1920 + (gimple_call_num_args (id
->call_stmt
) - nargs
),
1921 nargs
* sizeof (tree
));
1924 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
1927 argarray
.release ();
1929 /* Copy all GIMPLE_CALL flags, location and block, except
1930 GF_CALL_VA_ARG_PACK. */
1931 gimple_call_copy_flags (new_call
, call_stmt
);
1932 gimple_call_set_va_arg_pack (new_call
, false);
1933 gimple_set_location (new_call
, gimple_location (stmt
));
1934 gimple_set_block (new_call
, gimple_block (stmt
));
1935 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
1937 gsi_replace (©_gsi
, new_call
, false);
1942 && (decl
= gimple_call_fndecl (stmt
))
1943 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1944 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
1945 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
1947 /* __builtin_va_arg_pack_len () should be replaced by
1948 the number of anonymous arguments. */
1949 size_t nargs
= gimple_call_num_args (id
->call_stmt
), i
;
1953 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1956 /* For instrumented calls we should ignore bounds. */
1957 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1958 i
< gimple_call_num_args (id
->call_stmt
);
1960 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1963 count
= build_int_cst (integer_type_node
, nargs
);
1964 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1965 gsi_replace (©_gsi
, new_stmt
, false);
1970 && gimple_call_internal_p (stmt
)
1971 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
1973 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
1974 gsi_remove (©_gsi
, false);
1978 /* Statements produced by inlining can be unfolded, especially
1979 when we constant propagated some operands. We can't fold
1980 them right now for two reasons:
1981 1) folding require SSA_NAME_DEF_STMTs to be correct
1982 2) we can't change function calls to builtins.
1983 So we just mark statement for later folding. We mark
1984 all new statements, instead just statements that has changed
1985 by some nontrivial substitution so even statements made
1986 foldable indirectly are updated. If this turns out to be
1987 expensive, copy_body can be told to watch for nontrivial
1989 if (id
->statements_to_fold
)
1990 id
->statements_to_fold
->add (stmt
);
1992 /* We're duplicating a CALL_EXPR. Find any corresponding
1993 callgraph edges and update or duplicate them. */
1994 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
1996 struct cgraph_edge
*edge
;
1998 switch (id
->transform_call_graph_edges
)
2000 case CB_CGE_DUPLICATE
:
2001 edge
= id
->src_node
->get_edge (orig_stmt
);
2004 int edge_freq
= edge
->frequency
;
2006 struct cgraph_edge
*old_edge
= edge
;
2007 edge
= edge
->clone (id
->dst_node
, call_stmt
,
2009 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
2011 /* We could also just rescale the frequency, but
2012 doing so would introduce roundoff errors and make
2013 verifier unhappy. */
2014 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
2017 /* Speculative calls consist of two edges - direct and indirect.
2018 Duplicate the whole thing and distribute frequencies accordingly. */
2019 if (edge
->speculative
)
2021 struct cgraph_edge
*direct
, *indirect
;
2022 struct ipa_ref
*ref
;
2024 gcc_assert (!edge
->indirect_unknown_callee
);
2025 old_edge
->speculative_call_info (direct
, indirect
, ref
);
2026 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2028 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
2030 if (old_edge
->frequency
+ indirect
->frequency
)
2032 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
2033 (old_edge
->frequency
+ indirect
->frequency
)),
2035 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
2036 (old_edge
->frequency
+ indirect
->frequency
)),
2039 id
->dst_node
->clone_reference (ref
, stmt
);
2043 edge
->frequency
= new_freq
;
2045 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
2046 && (edge_freq
> edge
->frequency
+ 10
2047 || edge_freq
< edge
->frequency
- 10))
2049 fprintf (dump_file
, "Edge frequency estimated by "
2050 "cgraph %i diverge from inliner's estimate %i\n",
2054 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
2057 copy_basic_block
->frequency
);
2063 case CB_CGE_MOVE_CLONES
:
2064 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2066 edge
= id
->dst_node
->get_edge (stmt
);
2070 edge
= id
->dst_node
->get_edge (orig_stmt
);
2072 edge
->set_call_stmt (call_stmt
);
2079 /* Constant propagation on argument done during inlining
2080 may create new direct call. Produce an edge for it. */
2082 || (edge
->indirect_inlining_edge
2083 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2084 && id
->dst_node
->definition
2085 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2087 struct cgraph_node
*dest
= cgraph_node::get_create (fn
);
2089 /* We have missing edge in the callgraph. This can happen
2090 when previous inlining turned an indirect call into a
2091 direct call by constant propagating arguments or we are
2092 producing dead clone (for further cloning). In all
2093 other cases we hit a bug (incorrect node sharing is the
2094 most common reason for missing edges). */
2095 gcc_assert (!dest
->definition
2096 || dest
->address_taken
2097 || !id
->src_node
->definition
2098 || !id
->dst_node
->definition
);
2099 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2100 id
->dst_node
->create_edge_including_clones
2101 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2102 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
2104 CIF_ORIGINALLY_INDIRECT_CALL
);
2106 id
->dst_node
->create_edge (dest
, call_stmt
,
2108 compute_call_stmt_bb_frequency
2109 (id
->dst_node
->decl
,
2110 copy_basic_block
))->inline_failed
2111 = CIF_ORIGINALLY_INDIRECT_CALL
;
2114 fprintf (dump_file
, "Created new direct edge to %s\n",
2119 notice_special_calls (as_a
<gcall
*> (stmt
));
2122 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2123 id
->eh_map
, id
->eh_lp_nr
);
2125 gsi_next (©_gsi
);
2127 while (!gsi_end_p (copy_gsi
));
2129 copy_gsi
= gsi_last_bb (copy_basic_block
);
2132 return copy_basic_block
;
2135 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2136 form is quite easy, since dominator relationship for old basic blocks does
2139 There is however exception where inlining might change dominator relation
2140 across EH edges from basic block within inlined functions destinating
2141 to landing pads in function we inline into.
2143 The function fills in PHI_RESULTs of such PHI nodes if they refer
2144 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2145 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2146 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2147 set, and this means that there will be no overlapping live ranges
2148 for the underlying symbol.
2150 This might change in future if we allow redirecting of EH edges and
2151 we might want to change way build CFG pre-inlining to include
2152 all the possible edges then. */
2154 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2155 bool can_throw
, bool nonlocal_goto
)
2160 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2162 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2168 gcc_assert (e
->flags
& EDGE_EH
);
2171 gcc_assert (!(e
->flags
& EDGE_EH
));
2173 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2179 /* For abnormal goto/call edges the receiver can be the
2180 ENTRY_BLOCK. Do not assert this cannot happen. */
2182 gcc_assert ((e
->flags
& EDGE_EH
)
2183 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2185 re
= find_edge (ret_bb
, e
->dest
);
2186 gcc_checking_assert (re
);
2187 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2188 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2190 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2191 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2197 /* Copy edges from BB into its copy constructed earlier, scale profile
2198 accordingly. Edges will be taken care of later. Assume aux
2199 pointers to point to the copies of each BB. Return true if any
2200 debug stmts are left after a statement that must end the basic block. */
2203 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
2204 basic_block abnormal_goto_dest
)
2206 basic_block new_bb
= (basic_block
) bb
->aux
;
2209 gimple_stmt_iterator si
;
2211 bool need_debug_cleanup
= false;
2213 /* Use the indices from the original blocks to create edges for the
2215 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2216 if (!(old_edge
->flags
& EDGE_EH
))
2220 flags
= old_edge
->flags
;
2222 /* Return edges do get a FALLTHRU flag when the get inlined. */
2223 if (old_edge
->dest
->index
== EXIT_BLOCK
2224 && !(old_edge
->flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2225 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2226 flags
|= EDGE_FALLTHRU
;
2227 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2228 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
2229 new_edge
->probability
= old_edge
->probability
;
2232 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2235 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2238 bool can_throw
, nonlocal_goto
;
2240 copy_stmt
= gsi_stmt (si
);
2241 if (!is_gimple_debug (copy_stmt
))
2242 update_stmt (copy_stmt
);
2244 /* Do this before the possible split_block. */
2247 /* If this tree could throw an exception, there are two
2248 cases where we need to add abnormal edge(s): the
2249 tree wasn't in a region and there is a "current
2250 region" in the caller; or the original tree had
2251 EH edges. In both cases split the block after the tree,
2252 and add abnormal edge(s) as needed; we need both
2253 those from the callee and the caller.
2254 We check whether the copy can throw, because the const
2255 propagation can change an INDIRECT_REF which throws
2256 into a COMPONENT_REF which doesn't. If the copy
2257 can throw, the original could also throw. */
2258 can_throw
= stmt_can_throw_internal (copy_stmt
);
2260 = (stmt_can_make_abnormal_goto (copy_stmt
)
2261 && !computed_goto_p (copy_stmt
));
2263 if (can_throw
|| nonlocal_goto
)
2265 if (!gsi_end_p (si
))
2267 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2270 need_debug_cleanup
= true;
2272 if (!gsi_end_p (si
))
2273 /* Note that bb's predecessor edges aren't necessarily
2274 right at this point; split_block doesn't care. */
2276 edge e
= split_block (new_bb
, copy_stmt
);
2279 new_bb
->aux
= e
->src
->aux
;
2280 si
= gsi_start_bb (new_bb
);
2284 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2285 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2287 make_eh_edges (copy_stmt
);
2289 /* If the call we inline cannot make abnormal goto do not add
2290 additional abnormal edges but only retain those already present
2291 in the original function body. */
2292 if (abnormal_goto_dest
== NULL
)
2293 nonlocal_goto
= false;
2296 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2298 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2299 nonlocal_goto
= false;
2300 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2301 in OpenMP regions which aren't allowed to be left abnormally.
2302 So, no need to add abnormal edge in that case. */
2303 else if (is_gimple_call (copy_stmt
)
2304 && gimple_call_internal_p (copy_stmt
)
2305 && (gimple_call_internal_fn (copy_stmt
)
2306 == IFN_ABNORMAL_DISPATCHER
)
2307 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2308 nonlocal_goto
= false;
2310 make_edge (copy_stmt_bb
, abnormal_goto_dest
, EDGE_ABNORMAL
);
2313 if ((can_throw
|| nonlocal_goto
)
2314 && gimple_in_ssa_p (cfun
))
2315 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2316 can_throw
, nonlocal_goto
);
2318 return need_debug_cleanup
;
2321 /* Copy the PHIs. All blocks and edges are copied, some blocks
2322 was possibly split and new outgoing EH edges inserted.
2323 BB points to the block of original function and AUX pointers links
2324 the original and newly copied blocks. */
2327 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2329 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2334 bool inserted
= false;
2336 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2342 res
= PHI_RESULT (phi
);
2344 if (!virtual_operand_p (res
))
2346 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2347 if (EDGE_COUNT (new_bb
->preds
) == 0)
2349 /* Technically we'd want a SSA_DEFAULT_DEF here... */
2350 SSA_NAME_DEF_STMT (new_res
) = gimple_build_nop ();
2354 new_phi
= create_phi_node (new_res
, new_bb
);
2355 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2357 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
,
2364 /* When doing partial cloning, we allow PHIs on the entry
2365 block as long as all the arguments are the same.
2366 Find any input edge to see argument to copy. */
2368 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2369 if (!old_edge
->src
->aux
)
2372 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2374 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2375 gcc_assert (new_arg
);
2376 /* With return slot optimization we can end up with
2377 non-gimple (foo *)&this->m, fix that here. */
2378 if (TREE_CODE (new_arg
) != SSA_NAME
2379 && TREE_CODE (new_arg
) != FUNCTION_DECL
2380 && !is_gimple_val (new_arg
))
2382 gimple_seq stmts
= NULL
;
2383 new_arg
= force_gimple_operand (new_arg
, &stmts
, true,
2385 gsi_insert_seq_on_edge (new_edge
, stmts
);
2388 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2389 if (LOCATION_BLOCK (locus
))
2392 n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
2394 locus
= set_block (locus
, *n
);
2397 locus
= LOCATION_LOCUS (locus
);
2399 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2405 /* Commit the delayed edge insertions. */
2407 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2408 gsi_commit_one_edge_insert (new_edge
, NULL
);
2412 /* Wrapper for remap_decl so it can be used as a callback. */
2415 remap_decl_1 (tree decl
, void *data
)
2417 return remap_decl (decl
, (copy_body_data
*) data
);
2420 /* Build struct function and associated datastructures for the new clone
2421 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2422 the cfun to the function of new_fndecl (and current_function_decl too). */
2425 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2427 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2428 gcov_type count_scale
;
2430 if (!DECL_ARGUMENTS (new_fndecl
))
2431 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2432 if (!DECL_RESULT (new_fndecl
))
2433 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2435 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2437 = GCOV_COMPUTE_SCALE (count
,
2438 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2440 count_scale
= REG_BR_PROB_BASE
;
2442 /* Register specific tree functions. */
2443 gimple_register_cfg_hooks ();
2445 /* Get clean struct function. */
2446 push_struct_function (new_fndecl
);
2448 /* We will rebuild these, so just sanity check that they are empty. */
2449 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2450 gcc_assert (cfun
->local_decls
== NULL
);
2451 gcc_assert (cfun
->cfg
== NULL
);
2452 gcc_assert (cfun
->decl
== new_fndecl
);
2454 /* Copy items we preserve during cloning. */
2455 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2456 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2457 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2458 cfun
->curr_properties
= src_cfun
->curr_properties
;
2459 cfun
->last_verified
= src_cfun
->last_verified
;
2460 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2461 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2462 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2463 cfun
->stdarg
= src_cfun
->stdarg
;
2464 cfun
->after_inlining
= src_cfun
->after_inlining
;
2465 cfun
->can_throw_non_call_exceptions
2466 = src_cfun
->can_throw_non_call_exceptions
;
2467 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2468 cfun
->returns_struct
= src_cfun
->returns_struct
;
2469 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2471 init_empty_tree_cfg ();
2473 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2474 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2475 (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2477 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2478 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2479 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2480 (EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2482 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2483 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2485 init_eh_for_function ();
2487 if (src_cfun
->gimple_df
)
2489 init_tree_ssa (cfun
);
2490 cfun
->gimple_df
->in_ssa_p
= src_cfun
->gimple_df
->in_ssa_p
;
2491 if (cfun
->gimple_df
->in_ssa_p
)
2492 init_ssa_operands (cfun
);
2496 /* Helper function for copy_cfg_body. Move debug stmts from the end
2497 of NEW_BB to the beginning of successor basic blocks when needed. If the
2498 successor has multiple predecessors, reset them, otherwise keep
2502 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2506 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2509 || gsi_one_before_end_p (si
)
2510 || !(stmt_can_throw_internal (gsi_stmt (si
))
2511 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2514 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2516 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2517 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2518 while (is_gimple_debug (gsi_stmt (ssi
)))
2520 gimple
*stmt
= gsi_stmt (ssi
);
2525 /* For the last edge move the debug stmts instead of copying
2527 if (ei_one_before_end_p (ei
))
2531 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2532 gimple_debug_bind_reset_value (stmt
);
2533 gsi_remove (&si
, false);
2534 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2538 if (gimple_debug_bind_p (stmt
))
2540 var
= gimple_debug_bind_get_var (stmt
);
2541 if (single_pred_p (e
->dest
))
2543 value
= gimple_debug_bind_get_value (stmt
);
2544 value
= unshare_expr (value
);
2548 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2550 else if (gimple_debug_source_bind_p (stmt
))
2552 var
= gimple_debug_source_bind_get_var (stmt
);
2553 value
= gimple_debug_source_bind_get_value (stmt
);
2554 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2558 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2559 id
->debug_stmts
.safe_push (new_stmt
);
2565 /* Make a copy of the sub-loops of SRC_PARENT and place them
2566 as siblings of DEST_PARENT. */
2569 copy_loops (copy_body_data
*id
,
2570 struct loop
*dest_parent
, struct loop
*src_parent
)
2572 struct loop
*src_loop
= src_parent
->inner
;
2575 if (!id
->blocks_to_copy
2576 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2578 struct loop
*dest_loop
= alloc_loop ();
2580 /* Assign the new loop its header and latch and associate
2581 those with the new loop. */
2582 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2583 dest_loop
->header
->loop_father
= dest_loop
;
2584 if (src_loop
->latch
!= NULL
)
2586 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2587 dest_loop
->latch
->loop_father
= dest_loop
;
2590 /* Copy loop meta-data. */
2591 copy_loop_info (src_loop
, dest_loop
);
2593 /* Finally place it into the loop array and the loop tree. */
2594 place_new_loop (cfun
, dest_loop
);
2595 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2597 dest_loop
->safelen
= src_loop
->safelen
;
2598 dest_loop
->dont_vectorize
= src_loop
->dont_vectorize
;
2599 if (src_loop
->force_vectorize
)
2601 dest_loop
->force_vectorize
= true;
2602 cfun
->has_force_vectorize_loops
= true;
2604 if (src_loop
->simduid
)
2606 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2607 cfun
->has_simduid_loops
= true;
2611 copy_loops (id
, dest_loop
, src_loop
);
2613 src_loop
= src_loop
->next
;
2617 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2620 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2622 gimple_stmt_iterator si
;
2623 gimple
*last
= last_stmt (bb
);
2624 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2626 gimple
*stmt
= gsi_stmt (si
);
2627 if (is_gimple_call (stmt
))
2629 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2632 edge
->redirect_call_stmt_to_callee ();
2633 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
2634 gimple_purge_dead_eh_edges (bb
);
2640 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2641 with each bb's frequency. Used when NODE has a 0-weight entry
2642 but we are about to inline it into a non-zero count call bb.
2643 See the comments for handle_missing_profiles() in predict.c for
2644 when this can happen for COMDATs. */
2647 freqs_to_counts (struct cgraph_node
*node
, gcov_type count
)
2652 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2654 FOR_ALL_BB_FN(bb
, fn
)
2656 bb
->count
= apply_scale (count
,
2657 GCOV_COMPUTE_SCALE (bb
->frequency
, BB_FREQ_MAX
));
2658 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2659 e
->count
= apply_probability (e
->src
->count
, e
->probability
);
2663 /* Make a copy of the body of FN so that it can be inserted inline in
2664 another function. Walks FN via CFG, returns new fndecl. */
2667 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2668 basic_block entry_block_map
, basic_block exit_block_map
,
2669 basic_block new_entry
)
2671 tree callee_fndecl
= id
->src_fn
;
2672 /* Original cfun for the callee, doesn't change. */
2673 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2674 struct function
*cfun_to_copy
;
2676 tree new_fndecl
= NULL
;
2677 bool need_debug_cleanup
= false;
2678 gcov_type count_scale
;
2680 int incoming_frequency
= 0;
2681 gcov_type incoming_count
= 0;
2683 /* This can happen for COMDAT routines that end up with 0 counts
2684 despite being called (see the comments for handle_missing_profiles()
2685 in predict.c as to why). Apply counts to the blocks in the callee
2686 before inlining, using the guessed edge frequencies, so that we don't
2687 end up with a 0-count inline body which can confuse downstream
2688 optimizations such as function splitting. */
2689 if (!ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
&& count
)
2691 /* Apply the larger of the call bb count and the total incoming
2692 call edge count to the callee. */
2693 gcov_type in_count
= 0;
2694 struct cgraph_edge
*in_edge
;
2695 for (in_edge
= id
->src_node
->callers
; in_edge
;
2696 in_edge
= in_edge
->next_caller
)
2697 in_count
+= in_edge
->count
;
2698 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2701 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2703 = GCOV_COMPUTE_SCALE (count
,
2704 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2706 count_scale
= REG_BR_PROB_BASE
;
2708 /* Register specific tree functions. */
2709 gimple_register_cfg_hooks ();
2711 /* If we are inlining just region of the function, make sure to connect
2712 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2713 part of loop, we must compute frequency and probability of
2714 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2715 probabilities of edges incoming from nonduplicated region. */
2721 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2724 incoming_frequency
+= EDGE_FREQUENCY (e
);
2725 incoming_count
+= e
->count
;
2727 incoming_count
= apply_scale (incoming_count
, count_scale
);
2729 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2730 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2731 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2734 /* Must have a CFG here at this point. */
2735 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2736 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2738 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2740 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2741 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2742 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2743 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2745 /* Duplicate any exception-handling regions. */
2747 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2750 /* Use aux pointers to map the original blocks to copy. */
2751 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2752 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2754 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2757 new_bb
->loop_father
= entry_block_map
->loop_father
;
2760 last
= last_basic_block_for_fn (cfun
);
2762 /* Now that we've duplicated the blocks, duplicate their edges. */
2763 basic_block abnormal_goto_dest
= NULL
;
2765 && stmt_can_make_abnormal_goto (id
->call_stmt
))
2767 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
2769 bb
= gimple_bb (id
->call_stmt
);
2771 if (gsi_end_p (gsi
))
2772 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2774 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2775 if (!id
->blocks_to_copy
2776 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2777 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2778 abnormal_goto_dest
);
2782 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2783 e
->probability
= REG_BR_PROB_BASE
;
2784 e
->count
= incoming_count
;
2787 /* Duplicate the loop tree, if available and wanted. */
2788 if (loops_for_fn (src_cfun
) != NULL
2789 && current_loops
!= NULL
)
2791 copy_loops (id
, entry_block_map
->loop_father
,
2792 get_loop (src_cfun
, 0));
2793 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2794 loops_state_set (LOOPS_NEED_FIXUP
);
2797 /* If the loop tree in the source function needed fixup, mark the
2798 destination loop tree for fixup, too. */
2799 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2800 loops_state_set (LOOPS_NEED_FIXUP
);
2802 if (gimple_in_ssa_p (cfun
))
2803 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2804 if (!id
->blocks_to_copy
2805 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2806 copy_phis_for_bb (bb
, id
);
2808 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2811 if (need_debug_cleanup
2812 && bb
->index
!= ENTRY_BLOCK
2813 && bb
->index
!= EXIT_BLOCK
)
2814 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2815 /* Update call edge destinations. This can not be done before loop
2816 info is updated, because we may split basic blocks. */
2817 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
2818 && bb
->index
!= ENTRY_BLOCK
2819 && bb
->index
!= EXIT_BLOCK
)
2820 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2821 ((basic_block
)bb
->aux
)->aux
= NULL
;
2825 /* Zero out AUX fields of newly created block during EH edge
2827 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2829 if (need_debug_cleanup
)
2830 maybe_move_debug_stmts_to_successors (id
,
2831 BASIC_BLOCK_FOR_FN (cfun
, last
));
2832 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2833 /* Update call edge destinations. This can not be done before loop
2834 info is updated, because we may split basic blocks. */
2835 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2836 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2838 entry_block_map
->aux
= NULL
;
2839 exit_block_map
->aux
= NULL
;
2846 if (id
->dependence_map
)
2848 delete id
->dependence_map
;
2849 id
->dependence_map
= NULL
;
2855 /* Copy the debug STMT using ID. We deal with these statements in a
2856 special way: if any variable in their VALUE expression wasn't
2857 remapped yet, we won't remap it, because that would get decl uids
2858 out of sync, causing codegen differences between -g and -g0. If
2859 this arises, we drop the VALUE expression altogether. */
2862 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
2865 struct walk_stmt_info wi
;
2867 if (gimple_block (stmt
))
2869 n
= id
->decl_map
->get (gimple_block (stmt
));
2870 gimple_set_block (stmt
, n
? *n
: id
->block
);
2873 /* Remap all the operands in COPY. */
2874 memset (&wi
, 0, sizeof (wi
));
2877 processing_debug_stmt
= 1;
2879 if (gimple_debug_source_bind_p (stmt
))
2880 t
= gimple_debug_source_bind_get_var (stmt
);
2882 t
= gimple_debug_bind_get_var (stmt
);
2884 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2885 && (n
= id
->debug_map
->get (t
)))
2887 gcc_assert (VAR_P (*n
));
2890 else if (VAR_P (t
) && !is_global_var (t
) && !id
->decl_map
->get (t
))
2891 /* T is a non-localized variable. */;
2893 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2895 if (gimple_debug_bind_p (stmt
))
2897 gimple_debug_bind_set_var (stmt
, t
);
2899 if (gimple_debug_bind_has_value_p (stmt
))
2900 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2901 remap_gimple_op_r
, &wi
, NULL
);
2903 /* Punt if any decl couldn't be remapped. */
2904 if (processing_debug_stmt
< 0)
2905 gimple_debug_bind_reset_value (stmt
);
2907 else if (gimple_debug_source_bind_p (stmt
))
2909 gimple_debug_source_bind_set_var (stmt
, t
);
2910 /* When inlining and source bind refers to one of the optimized
2911 away parameters, change the source bind into normal debug bind
2912 referring to the corresponding DEBUG_EXPR_DECL that should have
2913 been bound before the call stmt. */
2914 t
= gimple_debug_source_bind_get_value (stmt
);
2916 && TREE_CODE (t
) == PARM_DECL
2919 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2921 if (debug_args
!= NULL
)
2923 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2924 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2925 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2927 t
= (**debug_args
)[i
+ 1];
2928 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2929 gimple_debug_bind_set_value (stmt
, t
);
2934 if (gimple_debug_source_bind_p (stmt
))
2935 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2936 remap_gimple_op_r
, &wi
, NULL
);
2939 processing_debug_stmt
= 0;
2944 /* Process deferred debug stmts. In order to give values better odds
2945 of being successfully remapped, we delay the processing of debug
2946 stmts until all other stmts that might require remapping are
2950 copy_debug_stmts (copy_body_data
*id
)
2955 if (!id
->debug_stmts
.exists ())
2958 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2959 copy_debug_stmt (stmt
, id
);
2961 id
->debug_stmts
.release ();
2964 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2965 another function. */
2968 copy_tree_body (copy_body_data
*id
)
2970 tree fndecl
= id
->src_fn
;
2971 tree body
= DECL_SAVED_TREE (fndecl
);
2973 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2978 /* Make a copy of the body of FN so that it can be inserted inline in
2979 another function. */
2982 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2983 basic_block entry_block_map
, basic_block exit_block_map
,
2984 basic_block new_entry
)
2986 tree fndecl
= id
->src_fn
;
2989 /* If this body has a CFG, walk CFG and copy. */
2990 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2991 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2993 copy_debug_stmts (id
);
2998 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2999 defined in function FN, or of a data member thereof. */
3002 self_inlining_addr_expr (tree value
, tree fn
)
3006 if (TREE_CODE (value
) != ADDR_EXPR
)
3009 var
= get_base_address (TREE_OPERAND (value
, 0));
3011 return var
&& auto_var_in_fn_p (var
, fn
);
3014 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
3015 lexical block and line number information from base_stmt, if given,
3016 or from the last stmt of the block otherwise. */
3019 insert_init_debug_bind (copy_body_data
*id
,
3020 basic_block bb
, tree var
, tree value
,
3024 gimple_stmt_iterator gsi
;
3027 if (!gimple_in_ssa_p (id
->src_cfun
))
3030 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
3033 tracked_var
= target_for_debug_bind (var
);
3039 gsi
= gsi_last_bb (bb
);
3040 if (!base_stmt
&& !gsi_end_p (gsi
))
3041 base_stmt
= gsi_stmt (gsi
);
3044 note
= gimple_build_debug_bind (tracked_var
, unshare_expr (value
), base_stmt
);
3048 if (!gsi_end_p (gsi
))
3049 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
3051 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3058 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple
*init_stmt
)
3060 /* If VAR represents a zero-sized variable, it's possible that the
3061 assignment statement may result in no gimple statements. */
3064 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3066 /* We can end up with init statements that store to a non-register
3067 from a rhs with a conversion. Handle that here by forcing the
3068 rhs into a temporary. gimple_regimplify_operands is not
3069 prepared to do this for us. */
3070 if (!is_gimple_debug (init_stmt
)
3071 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3072 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3073 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3075 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3076 gimple_expr_type (init_stmt
),
3077 gimple_assign_rhs1 (init_stmt
));
3078 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3080 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3081 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3083 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3084 gimple_regimplify_operands (init_stmt
, &si
);
3086 if (!is_gimple_debug (init_stmt
))
3088 tree def
= gimple_assign_lhs (init_stmt
);
3089 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3094 /* Initialize parameter P with VALUE. If needed, produce init statement
3095 at the end of BB. When BB is NULL, we return init statement to be
3098 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3099 basic_block bb
, tree
*vars
)
3101 gimple
*init_stmt
= NULL
;
3104 tree def
= (gimple_in_ssa_p (cfun
)
3105 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3108 && value
!= error_mark_node
3109 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3111 /* If we can match up types by promotion/demotion do so. */
3112 if (fold_convertible_p (TREE_TYPE (p
), value
))
3113 rhs
= fold_convert (TREE_TYPE (p
), value
);
3116 /* ??? For valid programs we should not end up here.
3117 Still if we end up with truly mismatched types here, fall back
3118 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3119 GIMPLE to the following passes. */
3120 if (!is_gimple_reg_type (TREE_TYPE (value
))
3121 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
3122 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
3124 rhs
= build_zero_cst (TREE_TYPE (p
));
3128 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3129 here since the type of this decl must be visible to the calling
3131 var
= copy_decl_to_var (p
, id
);
3133 /* Declare this new variable. */
3134 DECL_CHAIN (var
) = *vars
;
3137 /* Make gimplifier happy about this variable. */
3138 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3140 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3141 we would not need to create a new variable here at all, if it
3142 weren't for debug info. Still, we can just use the argument
3144 if (TREE_READONLY (p
)
3145 && !TREE_ADDRESSABLE (p
)
3146 && value
&& !TREE_SIDE_EFFECTS (value
)
3149 /* We may produce non-gimple trees by adding NOPs or introduce
3150 invalid sharing when operand is not really constant.
3151 It is not big deal to prohibit constant propagation here as
3152 we will constant propagate in DOM1 pass anyway. */
3153 if (is_gimple_min_invariant (value
)
3154 && useless_type_conversion_p (TREE_TYPE (p
),
3156 /* We have to be very careful about ADDR_EXPR. Make sure
3157 the base variable isn't a local variable of the inlined
3158 function, e.g., when doing recursive inlining, direct or
3159 mutually-recursive or whatever, which is why we don't
3160 just test whether fn == current_function_decl. */
3161 && ! self_inlining_addr_expr (value
, fn
))
3163 insert_decl_map (id
, p
, value
);
3164 insert_debug_decl_map (id
, p
, var
);
3165 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3169 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3170 that way, when the PARM_DECL is encountered, it will be
3171 automatically replaced by the VAR_DECL. */
3172 insert_decl_map (id
, p
, var
);
3174 /* Even if P was TREE_READONLY, the new VAR should not be.
3175 In the original code, we would have constructed a
3176 temporary, and then the function body would have never
3177 changed the value of P. However, now, we will be
3178 constructing VAR directly. The constructor body may
3179 change its value multiple times as it is being
3180 constructed. Therefore, it must not be TREE_READONLY;
3181 the back-end assumes that TREE_READONLY variable is
3182 assigned to only once. */
3183 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
3184 TREE_READONLY (var
) = 0;
3186 /* If there is no setup required and we are in SSA, take the easy route
3187 replacing all SSA names representing the function parameter by the
3188 SSA name passed to function.
3190 We need to construct map for the variable anyway as it might be used
3191 in different SSA names when parameter is set in function.
3193 Do replacement at -O0 for const arguments replaced by constant.
3194 This is important for builtin_constant_p and other construct requiring
3195 constant argument to be visible in inlined function body. */
3196 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3198 || (TREE_READONLY (p
)
3199 && is_gimple_min_invariant (rhs
)))
3200 && (TREE_CODE (rhs
) == SSA_NAME
3201 || is_gimple_min_invariant (rhs
))
3202 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3204 insert_decl_map (id
, def
, rhs
);
3205 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3208 /* If the value of argument is never used, don't care about initializing
3210 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3212 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3213 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3216 /* Initialize this VAR_DECL from the equivalent argument. Convert
3217 the argument to the proper type in case it was promoted. */
3220 if (rhs
== error_mark_node
)
3222 insert_decl_map (id
, p
, var
);
3223 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3226 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3228 /* If we are in SSA form properly remap the default definition
3229 or assign to a dummy SSA name if the parameter is unused and
3230 we are not optimizing. */
3231 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3235 def
= remap_ssa_name (def
, id
);
3236 init_stmt
= gimple_build_assign (def
, rhs
);
3237 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3238 set_ssa_default_def (cfun
, var
, NULL
);
3242 def
= make_ssa_name (var
);
3243 init_stmt
= gimple_build_assign (def
, rhs
);
3247 init_stmt
= gimple_build_assign (var
, rhs
);
3249 if (bb
&& init_stmt
)
3250 insert_init_stmt (id
, bb
, init_stmt
);
3255 /* Generate code to initialize the parameters of the function at the
3256 top of the stack in ID from the GIMPLE_CALL STMT. */
3259 initialize_inlined_parameters (copy_body_data
*id
, gimple
*stmt
,
3260 tree fn
, basic_block bb
)
3265 tree vars
= NULL_TREE
;
3266 tree static_chain
= gimple_call_chain (stmt
);
3268 /* Figure out what the parameters are. */
3269 parms
= DECL_ARGUMENTS (fn
);
3271 /* Loop through the parameter declarations, replacing each with an
3272 equivalent VAR_DECL, appropriately initialized. */
3273 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3276 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3277 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3279 /* After remapping parameters remap their types. This has to be done
3280 in a second loop over all parameters to appropriately remap
3281 variable sized arrays when the size is specified in a
3282 parameter following the array. */
3283 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3285 tree
*varp
= id
->decl_map
->get (p
);
3286 if (varp
&& VAR_P (*varp
))
3288 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3289 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3291 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3292 /* Also remap the default definition if it was remapped
3293 to the default definition of the parameter replacement
3294 by the parameter setup. */
3297 tree
*defp
= id
->decl_map
->get (def
);
3299 && TREE_CODE (*defp
) == SSA_NAME
3300 && SSA_NAME_VAR (*defp
) == var
)
3301 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3306 /* Initialize the static chain. */
3307 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3308 gcc_assert (fn
!= current_function_decl
);
3311 /* No static chain? Seems like a bug in tree-nested.c. */
3312 gcc_assert (static_chain
);
3314 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3317 declare_inline_vars (id
->block
, vars
);
3321 /* Declare a return variable to replace the RESULT_DECL for the
3322 function we are calling. An appropriate DECL_STMT is returned.
3323 The USE_STMT is filled to contain a use of the declaration to
3324 indicate the return value of the function.
3326 RETURN_SLOT, if non-null is place where to store the result. It
3327 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3328 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3330 RETURN_BOUNDS holds a destination for returned bounds.
3332 The return value is a (possibly null) value that holds the result
3333 as seen by the caller. */
3336 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3337 tree return_bounds
, basic_block entry_bb
)
3339 tree callee
= id
->src_fn
;
3340 tree result
= DECL_RESULT (callee
);
3341 tree callee_type
= TREE_TYPE (result
);
3345 /* Handle type-mismatches in the function declaration return type
3346 vs. the call expression. */
3348 caller_type
= TREE_TYPE (modify_dest
);
3350 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3352 /* We don't need to do anything for functions that don't return anything. */
3353 if (VOID_TYPE_P (callee_type
))
3356 /* If there was a return slot, then the return value is the
3357 dereferenced address of that object. */
3360 /* The front end shouldn't have used both return_slot and
3361 a modify expression. */
3362 gcc_assert (!modify_dest
);
3363 if (DECL_BY_REFERENCE (result
))
3365 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3366 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3368 /* We are going to construct *&return_slot and we can't do that
3369 for variables believed to be not addressable.
3371 FIXME: This check possibly can match, because values returned
3372 via return slot optimization are not believed to have address
3373 taken by alias analysis. */
3374 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3375 var
= return_slot_addr
;
3380 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3381 if (TREE_ADDRESSABLE (result
))
3382 mark_addressable (var
);
3384 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3385 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3386 && !DECL_GIMPLE_REG_P (result
)
3388 DECL_GIMPLE_REG_P (var
) = 0;
3393 /* All types requiring non-trivial constructors should have been handled. */
3394 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3396 /* Attempt to avoid creating a new temporary variable. */
3398 && TREE_CODE (modify_dest
) != SSA_NAME
)
3400 bool use_it
= false;
3402 /* We can't use MODIFY_DEST if there's type promotion involved. */
3403 if (!useless_type_conversion_p (callee_type
, caller_type
))
3406 /* ??? If we're assigning to a variable sized type, then we must
3407 reuse the destination variable, because we've no good way to
3408 create variable sized temporaries at this point. */
3409 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3412 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3413 reuse it as the result of the call directly. Don't do this if
3414 it would promote MODIFY_DEST to addressable. */
3415 else if (TREE_ADDRESSABLE (result
))
3419 tree base_m
= get_base_address (modify_dest
);
3421 /* If the base isn't a decl, then it's a pointer, and we don't
3422 know where that's going to go. */
3423 if (!DECL_P (base_m
))
3425 else if (is_global_var (base_m
))
3427 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3428 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3429 && !DECL_GIMPLE_REG_P (result
)
3430 && DECL_GIMPLE_REG_P (base_m
))
3432 else if (!TREE_ADDRESSABLE (base_m
))
3444 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3446 var
= copy_result_decl_to_var (result
, id
);
3447 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3449 /* Do not have the rest of GCC warn about this variable as it should
3450 not be visible to the user. */
3451 TREE_NO_WARNING (var
) = 1;
3453 declare_inline_vars (id
->block
, var
);
3455 /* Build the use expr. If the return type of the function was
3456 promoted, convert it back to the expected type. */
3458 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3460 /* If we can match up types by promotion/demotion do so. */
3461 if (fold_convertible_p (caller_type
, var
))
3462 use
= fold_convert (caller_type
, var
);
3465 /* ??? For valid programs we should not end up here.
3466 Still if we end up with truly mismatched types here, fall back
3467 to using a MEM_REF to not leak invalid GIMPLE to the following
3469 /* Prevent var from being written into SSA form. */
3470 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3471 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3472 DECL_GIMPLE_REG_P (var
) = false;
3473 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3474 TREE_ADDRESSABLE (var
) = true;
3475 use
= fold_build2 (MEM_REF
, caller_type
,
3476 build_fold_addr_expr (var
),
3477 build_int_cst (ptr_type_node
, 0));
3481 STRIP_USELESS_TYPE_CONVERSION (use
);
3483 if (DECL_BY_REFERENCE (result
))
3485 TREE_ADDRESSABLE (var
) = 1;
3486 var
= build_fold_addr_expr (var
);
3490 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3491 way, when the RESULT_DECL is encountered, it will be
3492 automatically replaced by the VAR_DECL.
3494 When returning by reference, ensure that RESULT_DECL remaps to
3496 if (DECL_BY_REFERENCE (result
)
3497 && !is_gimple_val (var
))
3499 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3500 insert_decl_map (id
, result
, temp
);
3501 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3502 it's default_def SSA_NAME. */
3503 if (gimple_in_ssa_p (id
->src_cfun
)
3504 && is_gimple_reg (result
))
3506 temp
= make_ssa_name (temp
);
3507 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3509 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3512 insert_decl_map (id
, result
, var
);
3514 /* Remember this so we can ignore it in remap_decls. */
3517 /* If returned bounds are used, then make var for them. */
3520 tree bndtemp
= create_tmp_var (pointer_bounds_type_node
, "retbnd");
3521 DECL_SEEN_IN_BIND_EXPR_P (bndtemp
) = 1;
3522 TREE_NO_WARNING (bndtemp
) = 1;
3523 declare_inline_vars (id
->block
, bndtemp
);
3525 id
->retbnd
= bndtemp
;
3526 insert_init_stmt (id
, entry_bb
,
3527 gimple_build_assign (bndtemp
, chkp_get_zero_bounds_var ()));
3533 /* Determine if the function can be copied. If so return NULL. If
3534 not return a string describng the reason for failure. */
3537 copy_forbidden (struct function
*fun
)
3539 const char *reason
= fun
->cannot_be_copied_reason
;
3541 /* Only examine the function once. */
3542 if (fun
->cannot_be_copied_set
)
3545 /* We cannot copy a function that receives a non-local goto
3546 because we cannot remap the destination label used in the
3547 function that is performing the non-local goto. */
3548 /* ??? Actually, this should be possible, if we work at it.
3549 No doubt there's just a handful of places that simply
3550 assume it doesn't happen and don't substitute properly. */
3551 if (fun
->has_nonlocal_label
)
3553 reason
= G_("function %q+F can never be copied "
3554 "because it receives a non-local goto");
3558 if (fun
->has_forced_label_in_static
)
3560 reason
= G_("function %q+F can never be copied because it saves "
3561 "address of local label in a static variable");
3566 fun
->cannot_be_copied_reason
= reason
;
3567 fun
->cannot_be_copied_set
= true;
3572 static const char *inline_forbidden_reason
;
3574 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3575 iff a function can not be inlined. Also sets the reason why. */
3578 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3579 struct walk_stmt_info
*wip
)
3581 tree fn
= (tree
) wip
->info
;
3583 gimple
*stmt
= gsi_stmt (*gsi
);
3585 switch (gimple_code (stmt
))
3588 /* Refuse to inline alloca call unless user explicitly forced so as
3589 this may change program's memory overhead drastically when the
3590 function using alloca is called in loop. In GCC present in
3591 SPEC2000 inlining into schedule_block cause it to require 2GB of
3592 RAM instead of 256MB. Don't do so for alloca calls emitted for
3593 VLA objects as those can't cause unbounded growth (they're always
3594 wrapped inside stack_save/stack_restore regions. */
3595 if (gimple_maybe_alloca_call_p (stmt
)
3596 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3597 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3599 inline_forbidden_reason
3600 = G_("function %q+F can never be inlined because it uses "
3601 "alloca (override using the always_inline attribute)");
3602 *handled_ops_p
= true;
3606 t
= gimple_call_fndecl (stmt
);
3610 /* We cannot inline functions that call setjmp. */
3611 if (setjmp_call_p (t
))
3613 inline_forbidden_reason
3614 = G_("function %q+F can never be inlined because it uses setjmp");
3615 *handled_ops_p
= true;
3619 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3620 switch (DECL_FUNCTION_CODE (t
))
3622 /* We cannot inline functions that take a variable number of
3624 case BUILT_IN_VA_START
:
3625 case BUILT_IN_NEXT_ARG
:
3626 case BUILT_IN_VA_END
:
3627 inline_forbidden_reason
3628 = G_("function %q+F can never be inlined because it "
3629 "uses variable argument lists");
3630 *handled_ops_p
= true;
3633 case BUILT_IN_LONGJMP
:
3634 /* We can't inline functions that call __builtin_longjmp at
3635 all. The non-local goto machinery really requires the
3636 destination be in a different function. If we allow the
3637 function calling __builtin_longjmp to be inlined into the
3638 function calling __builtin_setjmp, Things will Go Awry. */
3639 inline_forbidden_reason
3640 = G_("function %q+F can never be inlined because "
3641 "it uses setjmp-longjmp exception handling");
3642 *handled_ops_p
= true;
3645 case BUILT_IN_NONLOCAL_GOTO
:
3647 inline_forbidden_reason
3648 = G_("function %q+F can never be inlined because "
3649 "it uses non-local goto");
3650 *handled_ops_p
= true;
3653 case BUILT_IN_RETURN
:
3654 case BUILT_IN_APPLY_ARGS
:
3655 /* If a __builtin_apply_args caller would be inlined,
3656 it would be saving arguments of the function it has
3657 been inlined into. Similarly __builtin_return would
3658 return from the function the inline has been inlined into. */
3659 inline_forbidden_reason
3660 = G_("function %q+F can never be inlined because "
3661 "it uses __builtin_return or __builtin_apply_args");
3662 *handled_ops_p
= true;
3671 t
= gimple_goto_dest (stmt
);
3673 /* We will not inline a function which uses computed goto. The
3674 addresses of its local labels, which may be tucked into
3675 global storage, are of course not constant across
3676 instantiations, which causes unexpected behavior. */
3677 if (TREE_CODE (t
) != LABEL_DECL
)
3679 inline_forbidden_reason
3680 = G_("function %q+F can never be inlined "
3681 "because it contains a computed goto");
3682 *handled_ops_p
= true;
3691 *handled_ops_p
= false;
3695 /* Return true if FNDECL is a function that cannot be inlined into
3699 inline_forbidden_p (tree fndecl
)
3701 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3702 struct walk_stmt_info wi
;
3704 bool forbidden_p
= false;
3706 /* First check for shared reasons not to copy the code. */
3707 inline_forbidden_reason
= copy_forbidden (fun
);
3708 if (inline_forbidden_reason
!= NULL
)
3711 /* Next, walk the statements of the function looking for
3712 constraucts we can't handle, or are non-optimal for inlining. */
3713 hash_set
<tree
> visited_nodes
;
3714 memset (&wi
, 0, sizeof (wi
));
3715 wi
.info
= (void *) fndecl
;
3716 wi
.pset
= &visited_nodes
;
3718 FOR_EACH_BB_FN (bb
, fun
)
3721 gimple_seq seq
= bb_seq (bb
);
3722 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3723 forbidden_p
= (ret
!= NULL
);
3731 /* Return false if the function FNDECL cannot be inlined on account of its
3732 attributes, true otherwise. */
3734 function_attribute_inlinable_p (const_tree fndecl
)
3736 if (targetm
.attribute_table
)
3740 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3742 const_tree name
= TREE_PURPOSE (a
);
3745 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3746 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3747 return targetm
.function_attribute_inlinable_p (fndecl
);
3754 /* Returns nonzero if FN is a function that does not have any
3755 fundamental inline blocking properties. */
3758 tree_inlinable_function_p (tree fn
)
3760 bool inlinable
= true;
3764 /* If we've already decided this function shouldn't be inlined,
3765 there's no need to check again. */
3766 if (DECL_UNINLINABLE (fn
))
3769 /* We only warn for functions declared `inline' by the user. */
3770 do_warning
= (warn_inline
3771 && DECL_DECLARED_INLINE_P (fn
)
3772 && !DECL_NO_INLINE_WARNING_P (fn
)
3773 && !DECL_IN_SYSTEM_HEADER (fn
));
3775 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3778 && always_inline
== NULL
)
3781 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3782 "is suppressed using -fno-inline", fn
);
3786 else if (!function_attribute_inlinable_p (fn
))
3789 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3790 "uses attributes conflicting with inlining", fn
);
3794 else if (inline_forbidden_p (fn
))
3796 /* See if we should warn about uninlinable functions. Previously,
3797 some of these warnings would be issued while trying to expand
3798 the function inline, but that would cause multiple warnings
3799 about functions that would for example call alloca. But since
3800 this a property of the function, just one warning is enough.
3801 As a bonus we can now give more details about the reason why a
3802 function is not inlinable. */
3804 error (inline_forbidden_reason
, fn
);
3805 else if (do_warning
)
3806 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3811 /* Squirrel away the result so that we don't have to check again. */
3812 DECL_UNINLINABLE (fn
) = !inlinable
;
3817 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
3818 word size and take possible memcpy call into account and return
3819 cost based on whether optimizing for size or speed according to SPEED_P. */
3822 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
3826 gcc_assert (!VOID_TYPE_P (type
));
3828 if (TREE_CODE (type
) == VECTOR_TYPE
)
3830 machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3832 = targetm
.vectorize
.preferred_simd_mode (inner
);
3833 int simd_mode_size
= GET_MODE_SIZE (simd
);
3834 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3838 size
= int_size_in_bytes (type
);
3840 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
3841 /* Cost of a memcpy call, 3 arguments and the call. */
3844 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3847 /* Returns cost of operation CODE, according to WEIGHTS */
3850 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3851 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3855 /* These are "free" conversions, or their presumed cost
3856 is folded into other operations. */
3861 case VIEW_CONVERT_EXPR
:
3864 /* Assign cost of 1 to usual operations.
3865 ??? We may consider mapping RTL costs to this. */
3871 case POINTER_PLUS_EXPR
:
3874 case MULT_HIGHPART_EXPR
:
3877 case ADDR_SPACE_CONVERT_EXPR
:
3878 case FIXED_CONVERT_EXPR
:
3879 case FIX_TRUNC_EXPR
:
3897 case TRUTH_ANDIF_EXPR
:
3898 case TRUTH_ORIF_EXPR
:
3899 case TRUTH_AND_EXPR
:
3901 case TRUTH_XOR_EXPR
:
3902 case TRUTH_NOT_EXPR
:
3911 case UNORDERED_EXPR
:
3922 case PREDECREMENT_EXPR
:
3923 case PREINCREMENT_EXPR
:
3924 case POSTDECREMENT_EXPR
:
3925 case POSTINCREMENT_EXPR
:
3927 case REALIGN_LOAD_EXPR
:
3929 case REDUC_MAX_EXPR
:
3930 case REDUC_MIN_EXPR
:
3931 case REDUC_PLUS_EXPR
:
3932 case WIDEN_SUM_EXPR
:
3933 case WIDEN_MULT_EXPR
:
3936 case WIDEN_MULT_PLUS_EXPR
:
3937 case WIDEN_MULT_MINUS_EXPR
:
3938 case WIDEN_LSHIFT_EXPR
:
3940 case VEC_WIDEN_MULT_HI_EXPR
:
3941 case VEC_WIDEN_MULT_LO_EXPR
:
3942 case VEC_WIDEN_MULT_EVEN_EXPR
:
3943 case VEC_WIDEN_MULT_ODD_EXPR
:
3944 case VEC_UNPACK_HI_EXPR
:
3945 case VEC_UNPACK_LO_EXPR
:
3946 case VEC_UNPACK_FLOAT_HI_EXPR
:
3947 case VEC_UNPACK_FLOAT_LO_EXPR
:
3948 case VEC_PACK_TRUNC_EXPR
:
3949 case VEC_PACK_SAT_EXPR
:
3950 case VEC_PACK_FIX_TRUNC_EXPR
:
3951 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3952 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3956 /* Few special cases of expensive operations. This is useful
3957 to avoid inlining on functions having too many of these. */
3958 case TRUNC_DIV_EXPR
:
3960 case FLOOR_DIV_EXPR
:
3961 case ROUND_DIV_EXPR
:
3962 case EXACT_DIV_EXPR
:
3963 case TRUNC_MOD_EXPR
:
3965 case FLOOR_MOD_EXPR
:
3966 case ROUND_MOD_EXPR
:
3968 if (TREE_CODE (op2
) != INTEGER_CST
)
3969 return weights
->div_mod_cost
;
3972 /* Bit-field insertion needs several shift and mask operations. */
3973 case BIT_INSERT_EXPR
:
3977 /* We expect a copy assignment with no operator. */
3978 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3984 /* Estimate number of instructions that will be created by expanding
3985 the statements in the statement sequence STMTS.
3986 WEIGHTS contains weights attributed to various constructs. */
3989 estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3992 gimple_stmt_iterator gsi
;
3995 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3996 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4002 /* Estimate number of instructions that will be created by expanding STMT.
4003 WEIGHTS contains weights attributed to various constructs. */
4006 estimate_num_insns (gimple
*stmt
, eni_weights
*weights
)
4009 enum gimple_code code
= gimple_code (stmt
);
4016 /* Try to estimate the cost of assignments. We have three cases to
4018 1) Simple assignments to registers;
4019 2) Stores to things that must live in memory. This includes
4020 "normal" stores to scalars, but also assignments of large
4021 structures, or constructors of big arrays;
4023 Let us look at the first two cases, assuming we have "a = b + C":
4024 <GIMPLE_ASSIGN <var_decl "a">
4025 <plus_expr <var_decl "b"> <constant C>>
4026 If "a" is a GIMPLE register, the assignment to it is free on almost
4027 any target, because "a" usually ends up in a real register. Hence
4028 the only cost of this expression comes from the PLUS_EXPR, and we
4029 can ignore the GIMPLE_ASSIGN.
4030 If "a" is not a GIMPLE register, the assignment to "a" will most
4031 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4032 of moving something into "a", which we compute using the function
4033 estimate_move_cost. */
4034 if (gimple_clobber_p (stmt
))
4035 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4037 lhs
= gimple_assign_lhs (stmt
);
4038 rhs
= gimple_assign_rhs1 (stmt
);
4042 /* Account for the cost of moving to / from memory. */
4043 if (gimple_store_p (stmt
))
4044 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
4045 if (gimple_assign_load_p (stmt
))
4046 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
4048 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
4049 gimple_assign_rhs1 (stmt
),
4050 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
4051 == GIMPLE_BINARY_RHS
4052 ? gimple_assign_rhs2 (stmt
) : NULL
);
4056 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4057 gimple_op (stmt
, 0),
4058 gimple_op (stmt
, 1));
4063 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4064 /* Take into account cost of the switch + guess 2 conditional jumps for
4067 TODO: once the switch expansion logic is sufficiently separated, we can
4068 do better job on estimating cost of the switch. */
4069 if (weights
->time_based
)
4070 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4072 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4080 if (gimple_call_internal_p (stmt
))
4082 else if ((decl
= gimple_call_fndecl (stmt
))
4083 && DECL_BUILT_IN (decl
))
4085 /* Do not special case builtins where we see the body.
4086 This just confuse inliner. */
4087 struct cgraph_node
*node
;
4088 if (!(node
= cgraph_node::get (decl
))
4089 || node
->definition
)
4091 /* For buitins that are likely expanded to nothing or
4092 inlined do not account operand costs. */
4093 else if (is_simple_builtin (decl
))
4095 else if (is_inexpensive_builtin (decl
))
4096 return weights
->target_builtin_call_cost
;
4097 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
4099 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4100 specialize the cheap expansion we do here.
4101 ??? This asks for a more general solution. */
4102 switch (DECL_FUNCTION_CODE (decl
))
4107 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4109 (&TREE_REAL_CST (gimple_call_arg (stmt
, 1)),
4111 return estimate_operator_cost
4112 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4113 gimple_call_arg (stmt
, 0));
4122 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4123 if (gimple_call_lhs (stmt
))
4124 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4125 weights
->time_based
);
4126 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4128 tree arg
= gimple_call_arg (stmt
, i
);
4129 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4130 weights
->time_based
);
4136 return weights
->return_cost
;
4142 case GIMPLE_PREDICT
:
4148 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4149 /* 1000 means infinity. This avoids overflows later
4150 with very long asm statements. */
4157 /* This is either going to be an external function call with one
4158 argument, or two register copy statements plus a goto. */
4161 case GIMPLE_EH_DISPATCH
:
4162 /* ??? This is going to turn into a switch statement. Ideally
4163 we'd have a look at the eh region and estimate the number of
4168 return estimate_num_insns_seq (
4169 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4172 case GIMPLE_EH_FILTER
:
4173 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4176 return estimate_num_insns_seq (gimple_catch_handler (
4177 as_a
<gcatch
*> (stmt
)),
4181 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4182 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4184 /* OMP directives are generally very expensive. */
4186 case GIMPLE_OMP_RETURN
:
4187 case GIMPLE_OMP_SECTIONS_SWITCH
:
4188 case GIMPLE_OMP_ATOMIC_STORE
:
4189 case GIMPLE_OMP_CONTINUE
:
4190 /* ...except these, which are cheap. */
4193 case GIMPLE_OMP_ATOMIC_LOAD
:
4194 return weights
->omp_cost
;
4196 case GIMPLE_OMP_FOR
:
4197 return (weights
->omp_cost
4198 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4199 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4201 case GIMPLE_OMP_PARALLEL
:
4202 case GIMPLE_OMP_TASK
:
4203 case GIMPLE_OMP_CRITICAL
:
4204 case GIMPLE_OMP_MASTER
:
4205 case GIMPLE_OMP_TASKGROUP
:
4206 case GIMPLE_OMP_ORDERED
:
4207 case GIMPLE_OMP_SECTION
:
4208 case GIMPLE_OMP_SECTIONS
:
4209 case GIMPLE_OMP_SINGLE
:
4210 case GIMPLE_OMP_TARGET
:
4211 case GIMPLE_OMP_TEAMS
:
4212 return (weights
->omp_cost
4213 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4215 case GIMPLE_TRANSACTION
:
4216 return (weights
->tm_cost
4217 + estimate_num_insns_seq (gimple_transaction_body (
4218 as_a
<gtransaction
*> (stmt
)),
4228 /* Estimate number of instructions that will be created by expanding
4229 function FNDECL. WEIGHTS contains weights attributed to various
4233 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4235 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4236 gimple_stmt_iterator bsi
;
4240 gcc_assert (my_function
&& my_function
->cfg
);
4241 FOR_EACH_BB_FN (bb
, my_function
)
4243 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4244 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4251 /* Initializes weights used by estimate_num_insns. */
4254 init_inline_once (void)
4256 eni_size_weights
.call_cost
= 1;
4257 eni_size_weights
.indirect_call_cost
= 3;
4258 eni_size_weights
.target_builtin_call_cost
= 1;
4259 eni_size_weights
.div_mod_cost
= 1;
4260 eni_size_weights
.omp_cost
= 40;
4261 eni_size_weights
.tm_cost
= 10;
4262 eni_size_weights
.time_based
= false;
4263 eni_size_weights
.return_cost
= 1;
4265 /* Estimating time for call is difficult, since we have no idea what the
4266 called function does. In the current uses of eni_time_weights,
4267 underestimating the cost does less harm than overestimating it, so
4268 we choose a rather small value here. */
4269 eni_time_weights
.call_cost
= 10;
4270 eni_time_weights
.indirect_call_cost
= 15;
4271 eni_time_weights
.target_builtin_call_cost
= 1;
4272 eni_time_weights
.div_mod_cost
= 10;
4273 eni_time_weights
.omp_cost
= 40;
4274 eni_time_weights
.tm_cost
= 40;
4275 eni_time_weights
.time_based
= true;
4276 eni_time_weights
.return_cost
= 2;
4280 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4283 prepend_lexical_block (tree current_block
, tree new_block
)
4285 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4286 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4287 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4290 /* Add local variables from CALLEE to CALLER. */
4293 add_local_variables (struct function
*callee
, struct function
*caller
,
4299 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4300 if (!can_be_nonlocal (var
, id
))
4302 tree new_var
= remap_decl (var
, id
);
4304 /* Remap debug-expressions. */
4306 && DECL_HAS_DEBUG_EXPR_P (var
)
4309 tree tem
= DECL_DEBUG_EXPR (var
);
4310 bool old_regimplify
= id
->regimplify
;
4311 id
->remapping_type_depth
++;
4312 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4313 id
->remapping_type_depth
--;
4314 id
->regimplify
= old_regimplify
;
4315 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4316 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4318 add_local_decl (caller
, new_var
);
4322 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4323 have brought in or introduced any debug stmts for SRCVAR. */
4326 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4328 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4333 if (!VAR_P (*remappedvarp
))
4336 if (*remappedvarp
== id
->retvar
|| *remappedvarp
== id
->retbnd
)
4339 tree tvar
= target_for_debug_bind (*remappedvarp
);
4343 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4345 gimple_seq_add_stmt (bindings
, stmt
);
4348 /* For each inlined variable for which we may have debug bind stmts,
4349 add before GSI a final debug stmt resetting it, marking the end of
4350 its life, so that var-tracking knows it doesn't have to compute
4351 further locations for it. */
4354 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4358 gimple_seq bindings
= NULL
;
4360 if (!gimple_in_ssa_p (id
->src_cfun
))
4363 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4366 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4367 var
; var
= DECL_CHAIN (var
))
4368 reset_debug_binding (id
, var
, &bindings
);
4370 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4371 reset_debug_binding (id
, var
, &bindings
);
4373 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4376 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4379 expand_call_inline (basic_block bb
, gimple
*stmt
, copy_body_data
*id
)
4383 hash_map
<tree
, tree
> *dst
;
4384 hash_map
<tree
, tree
> *st
= NULL
;
4387 tree return_bounds
= NULL
;
4388 struct cgraph_edge
*cg_edge
;
4389 cgraph_inline_failed_t reason
;
4390 basic_block return_block
;
4392 gimple_stmt_iterator gsi
, stmt_gsi
;
4393 bool successfully_inlined
= false;
4394 bool purge_dead_abnormal_edges
;
4397 unsigned int prop_mask
, src_properties
;
4398 struct function
*dst_cfun
;
4401 gimple
*simtenter_stmt
= NULL
;
4402 vec
<tree
> *simtvars_save
;
4404 /* The gimplifier uses input_location in too many places, such as
4405 internal_get_tmp_var (). */
4406 location_t saved_location
= input_location
;
4407 input_location
= gimple_location (stmt
);
4409 /* From here on, we're only interested in CALL_EXPRs. */
4410 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4414 cg_edge
= id
->dst_node
->get_edge (stmt
);
4415 gcc_checking_assert (cg_edge
);
4416 /* First, see if we can figure out what function is being called.
4417 If we cannot, then there is no hope of inlining the function. */
4418 if (cg_edge
->indirect_unknown_callee
)
4420 fn
= cg_edge
->callee
->decl
;
4421 gcc_checking_assert (fn
);
4423 /* If FN is a declaration of a function in a nested scope that was
4424 globally declared inline, we don't set its DECL_INITIAL.
4425 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4426 C++ front-end uses it for cdtors to refer to their internal
4427 declarations, that are not real functions. Fortunately those
4428 don't have trees to be saved, so we can tell by checking their
4430 if (!DECL_INITIAL (fn
)
4431 && DECL_ABSTRACT_ORIGIN (fn
)
4432 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4433 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4435 /* Don't try to inline functions that are not well-suited to inlining. */
4436 if (cg_edge
->inline_failed
)
4438 reason
= cg_edge
->inline_failed
;
4439 /* If this call was originally indirect, we do not want to emit any
4440 inlining related warnings or sorry messages because there are no
4441 guarantees regarding those. */
4442 if (cg_edge
->indirect_inlining_edge
)
4445 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4446 /* For extern inline functions that get redefined we always
4447 silently ignored always_inline flag. Better behavior would
4448 be to be able to keep both bodies and use extern inline body
4449 for inlining, but we can't do that because frontends overwrite
4451 && !cg_edge
->callee
->local
.redefined_extern_inline
4452 /* During early inline pass, report only when optimization is
4454 && (symtab
->global_info_ready
4456 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4457 /* PR 20090218-1_0.c. Body can be provided by another module. */
4458 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4460 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4461 cgraph_inline_failed_string (reason
));
4462 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4463 inform (gimple_location (stmt
), "called from here");
4464 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4465 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4466 "called from this function");
4468 else if (warn_inline
4469 && DECL_DECLARED_INLINE_P (fn
)
4470 && !DECL_NO_INLINE_WARNING_P (fn
)
4471 && !DECL_IN_SYSTEM_HEADER (fn
)
4472 && reason
!= CIF_UNSPECIFIED
4473 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4474 /* Do not warn about not inlined recursive calls. */
4475 && !cg_edge
->recursive_p ()
4476 /* Avoid warnings during early inline pass. */
4477 && symtab
->global_info_ready
)
4479 if (warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4480 fn
, _(cgraph_inline_failed_string (reason
))))
4482 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4483 inform (gimple_location (stmt
), "called from here");
4484 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4485 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4486 "called from this function");
4491 id
->src_node
= cg_edge
->callee
;
4493 /* If callee is thunk, all we need is to adjust the THIS pointer
4494 and redirect to function being thunked. */
4495 if (id
->src_node
->thunk
.thunk_p
)
4498 tree virtual_offset
= NULL
;
4499 int freq
= cg_edge
->frequency
;
4500 gcov_type count
= cg_edge
->count
;
4502 gimple_stmt_iterator iter
= gsi_for_stmt (stmt
);
4505 edge
= id
->src_node
->callees
->clone (id
->dst_node
, call_stmt
,
4507 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
4509 edge
->frequency
= freq
;
4510 edge
->count
= count
;
4511 if (id
->src_node
->thunk
.virtual_offset_p
)
4512 virtual_offset
= size_int (id
->src_node
->thunk
.virtual_value
);
4513 op
= create_tmp_reg_fn (cfun
, TREE_TYPE (gimple_call_arg (stmt
, 0)),
4515 gsi_insert_before (&iter
, gimple_build_assign (op
,
4516 gimple_call_arg (stmt
, 0)),
4518 gcc_assert (id
->src_node
->thunk
.this_adjusting
);
4519 op
= thunk_adjust (&iter
, op
, 1, id
->src_node
->thunk
.fixed_offset
,
4522 gimple_call_set_arg (stmt
, 0, op
);
4523 gimple_call_set_fndecl (stmt
, edge
->callee
->decl
);
4525 id
->src_node
->remove ();
4526 expand_call_inline (bb
, stmt
, id
);
4527 maybe_remove_unused_call_args (cfun
, stmt
);
4530 fn
= cg_edge
->callee
->decl
;
4531 cg_edge
->callee
->get_untransformed_body ();
4533 if (flag_checking
&& cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4534 cg_edge
->callee
->verify ();
4536 /* We will be inlining this callee. */
4537 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4538 id
->assign_stmts
.create (0);
4540 /* Update the callers EH personality. */
4541 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4542 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4543 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4545 /* Split the block holding the GIMPLE_CALL. */
4546 e
= split_block (bb
, stmt
);
4548 return_block
= e
->dest
;
4551 /* split_block splits after the statement; work around this by
4552 moving the call into the second block manually. Not pretty,
4553 but seems easier than doing the CFG manipulation by hand
4554 when the GIMPLE_CALL is in the last statement of BB. */
4555 stmt_gsi
= gsi_last_bb (bb
);
4556 gsi_remove (&stmt_gsi
, false);
4558 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4559 been the source of abnormal edges. In this case, schedule
4560 the removal of dead abnormal edges. */
4561 gsi
= gsi_start_bb (return_block
);
4562 if (gsi_end_p (gsi
))
4564 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4565 purge_dead_abnormal_edges
= true;
4569 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4570 purge_dead_abnormal_edges
= false;
4573 stmt_gsi
= gsi_start_bb (return_block
);
4575 /* Build a block containing code to initialize the arguments, the
4576 actual inline expansion of the body, and a label for the return
4577 statements within the function to jump to. The type of the
4578 statement expression is the return type of the function call.
4579 ??? If the call does not have an associated block then we will
4580 remap all callee blocks to NULL, effectively dropping most of
4581 its debug information. This should only happen for calls to
4582 artificial decls inserted by the compiler itself. We need to
4583 either link the inlined blocks into the caller block tree or
4584 not refer to them in any way to not break GC for locations. */
4585 if (gimple_block (stmt
))
4587 id
->block
= make_node (BLOCK
);
4588 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4589 BLOCK_SOURCE_LOCATION (id
->block
)
4590 = LOCATION_LOCUS (gimple_location (stmt
));
4591 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4594 /* Local declarations will be replaced by their equivalents in this
4597 id
->decl_map
= new hash_map
<tree
, tree
>;
4598 dst
= id
->debug_map
;
4599 id
->debug_map
= NULL
;
4601 /* Record the function we are about to inline. */
4603 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4604 id
->call_stmt
= call_stmt
;
4606 /* When inlining into an OpenMP SIMD-on-SIMT loop, arrange for new automatic
4607 variables to be added to IFN_GOMP_SIMT_ENTER argument list. */
4608 dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4609 simtvars_save
= id
->dst_simt_vars
;
4610 if (!(dst_cfun
->curr_properties
& PROP_gimple_lomp_dev
)
4611 && (simduid
= bb
->loop_father
->simduid
) != NULL_TREE
4612 && (simduid
= ssa_default_def (dst_cfun
, simduid
)) != NULL_TREE
4613 && single_imm_use (simduid
, &use
, &simtenter_stmt
)
4614 && is_gimple_call (simtenter_stmt
)
4615 && gimple_call_internal_p (simtenter_stmt
, IFN_GOMP_SIMT_ENTER
))
4616 vec_alloc (id
->dst_simt_vars
, 0);
4618 id
->dst_simt_vars
= NULL
;
4620 /* If the src function contains an IFN_VA_ARG, then so will the dst
4621 function after inlining. Likewise for IFN_GOMP_USE_SIMT. */
4622 prop_mask
= PROP_gimple_lva
| PROP_gimple_lomp_dev
;
4623 src_properties
= id
->src_cfun
->curr_properties
& prop_mask
;
4624 if (src_properties
!= prop_mask
)
4625 dst_cfun
->curr_properties
&= src_properties
| ~prop_mask
;
4627 gcc_assert (!id
->src_cfun
->after_inlining
);
4630 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4632 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4633 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4637 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4639 if (DECL_INITIAL (fn
))
4641 if (gimple_block (stmt
))
4645 prepend_lexical_block (id
->block
,
4646 remap_blocks (DECL_INITIAL (fn
), id
));
4647 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4648 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4650 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4651 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4652 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4653 under it. The parameters can be then evaluated in the debugger,
4654 but don't show in backtraces. */
4655 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4656 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4659 *var
= TREE_CHAIN (v
);
4660 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4661 BLOCK_VARS (id
->block
) = v
;
4664 var
= &TREE_CHAIN (*var
);
4667 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4670 /* Return statements in the function body will be replaced by jumps
4671 to the RET_LABEL. */
4672 gcc_assert (DECL_INITIAL (fn
));
4673 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4675 /* Find the LHS to which the result of this call is assigned. */
4677 if (gimple_call_lhs (stmt
))
4679 modify_dest
= gimple_call_lhs (stmt
);
4681 /* Remember where to copy returned bounds. */
4682 if (gimple_call_with_bounds_p (stmt
)
4683 && TREE_CODE (modify_dest
) == SSA_NAME
)
4685 gcall
*retbnd
= chkp_retbnd_call_by_val (modify_dest
);
4688 return_bounds
= gimple_call_lhs (retbnd
);
4689 /* If returned bounds are not used then just
4690 remove unused call. */
4693 gimple_stmt_iterator iter
= gsi_for_stmt (retbnd
);
4694 gsi_remove (&iter
, true);
4699 /* The function which we are inlining might not return a value,
4700 in which case we should issue a warning that the function
4701 does not return a value. In that case the optimizers will
4702 see that the variable to which the value is assigned was not
4703 initialized. We do not want to issue a warning about that
4704 uninitialized variable. */
4705 if (DECL_P (modify_dest
))
4706 TREE_NO_WARNING (modify_dest
) = 1;
4708 if (gimple_call_return_slot_opt_p (call_stmt
))
4710 return_slot
= modify_dest
;
4717 /* If we are inlining a call to the C++ operator new, we don't want
4718 to use type based alias analysis on the return value. Otherwise
4719 we may get confused if the compiler sees that the inlined new
4720 function returns a pointer which was just deleted. See bug
4722 if (DECL_IS_OPERATOR_NEW (fn
))
4728 /* Declare the return variable for the function. */
4729 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
,
4732 /* Add local vars in this inlined callee to caller. */
4733 add_local_variables (id
->src_cfun
, cfun
, id
);
4735 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4737 fprintf (dump_file
, "Inlining ");
4738 print_generic_expr (dump_file
, id
->src_fn
, 0);
4739 fprintf (dump_file
, " to ");
4740 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4741 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4744 /* This is it. Duplicate the callee body. Assume callee is
4745 pre-gimplified. Note that we must not alter the caller
4746 function in any way before this point, as this CALL_EXPR may be
4747 a self-referential call; if we're calling ourselves, we need to
4748 duplicate our body before altering anything. */
4749 copy_body (id
, cg_edge
->callee
->count
,
4750 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4751 bb
, return_block
, NULL
);
4753 reset_debug_bindings (id
, stmt_gsi
);
4755 /* Reset the escaped solution. */
4756 if (cfun
->gimple_df
)
4757 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4759 /* Add new automatic variables to IFN_GOMP_SIMT_ENTER arguments. */
4760 if (id
->dst_simt_vars
&& id
->dst_simt_vars
->length () > 0)
4762 size_t nargs
= gimple_call_num_args (simtenter_stmt
);
4763 vec
<tree
> *vars
= id
->dst_simt_vars
;
4764 auto_vec
<tree
> newargs (nargs
+ vars
->length ());
4765 for (size_t i
= 0; i
< nargs
; i
++)
4766 newargs
.quick_push (gimple_call_arg (simtenter_stmt
, i
));
4767 for (tree
*pvar
= vars
->begin (); pvar
!= vars
->end (); pvar
++)
4769 tree ptrtype
= build_pointer_type (TREE_TYPE (*pvar
));
4770 newargs
.quick_push (build1 (ADDR_EXPR
, ptrtype
, *pvar
));
4772 gcall
*g
= gimple_build_call_internal_vec (IFN_GOMP_SIMT_ENTER
, newargs
);
4773 gimple_call_set_lhs (g
, gimple_call_lhs (simtenter_stmt
));
4774 gimple_stmt_iterator gsi
= gsi_for_stmt (simtenter_stmt
);
4775 gsi_replace (&gsi
, g
, false);
4777 vec_free (id
->dst_simt_vars
);
4778 id
->dst_simt_vars
= simtvars_save
;
4783 delete id
->debug_map
;
4784 id
->debug_map
= dst
;
4786 delete id
->decl_map
;
4789 /* Unlink the calls virtual operands before replacing it. */
4790 unlink_stmt_vdef (stmt
);
4791 if (gimple_vdef (stmt
)
4792 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4793 release_ssa_name (gimple_vdef (stmt
));
4795 /* If the inlined function returns a result that we care about,
4796 substitute the GIMPLE_CALL with an assignment of the return
4797 variable to the LHS of the call. That is, if STMT was
4798 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4799 if (use_retvar
&& gimple_call_lhs (stmt
))
4801 gimple
*old_stmt
= stmt
;
4802 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4803 gsi_replace (&stmt_gsi
, stmt
, false);
4804 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4806 /* Copy bounds if we copy structure with bounds. */
4807 if (chkp_function_instrumented_p (id
->dst_fn
)
4808 && !BOUNDED_P (use_retvar
)
4809 && chkp_type_has_pointer (TREE_TYPE (use_retvar
)))
4810 id
->assign_stmts
.safe_push (stmt
);
4814 /* Handle the case of inlining a function with no return
4815 statement, which causes the return value to become undefined. */
4816 if (gimple_call_lhs (stmt
)
4817 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4819 tree name
= gimple_call_lhs (stmt
);
4820 tree var
= SSA_NAME_VAR (name
);
4821 tree def
= var
? ssa_default_def (cfun
, var
) : NULL
;
4825 /* If the variable is used undefined, make this name
4826 undefined via a move. */
4827 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4828 gsi_replace (&stmt_gsi
, stmt
, true);
4834 var
= create_tmp_reg_fn (cfun
, TREE_TYPE (name
), NULL
);
4835 SET_SSA_NAME_VAR_OR_IDENTIFIER (name
, var
);
4837 /* Otherwise make this variable undefined. */
4838 gsi_remove (&stmt_gsi
, true);
4839 set_ssa_default_def (cfun
, var
, name
);
4840 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4844 gsi_remove (&stmt_gsi
, true);
4847 /* Put returned bounds into the correct place if required. */
4850 gimple
*old_stmt
= SSA_NAME_DEF_STMT (return_bounds
);
4851 gimple
*new_stmt
= gimple_build_assign (return_bounds
, id
->retbnd
);
4852 gimple_stmt_iterator bnd_gsi
= gsi_for_stmt (old_stmt
);
4853 unlink_stmt_vdef (old_stmt
);
4854 gsi_replace (&bnd_gsi
, new_stmt
, false);
4855 maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
);
4856 cgraph_update_edges_for_call_stmt (old_stmt
,
4857 gimple_call_fndecl (old_stmt
),
4861 if (purge_dead_abnormal_edges
)
4863 gimple_purge_dead_eh_edges (return_block
);
4864 gimple_purge_dead_abnormal_call_edges (return_block
);
4867 /* If the value of the new expression is ignored, that's OK. We
4868 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4869 the equivalent inlined version either. */
4870 if (is_gimple_assign (stmt
))
4872 gcc_assert (gimple_assign_single_p (stmt
)
4873 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4874 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4877 /* Copy bounds for all generated assigns that need it. */
4878 for (i
= 0; i
< id
->assign_stmts
.length (); i
++)
4879 chkp_copy_bounds_for_assign (id
->assign_stmts
[i
], cg_edge
);
4880 id
->assign_stmts
.release ();
4882 /* Output the inlining info for this abstract function, since it has been
4883 inlined. If we don't do this now, we can lose the information about the
4884 variables in the function when the blocks get blown away as soon as we
4885 remove the cgraph node. */
4886 if (gimple_block (stmt
))
4887 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4889 /* Update callgraph if needed. */
4890 cg_edge
->callee
->remove ();
4892 id
->block
= NULL_TREE
;
4893 successfully_inlined
= true;
4896 input_location
= saved_location
;
4897 return successfully_inlined
;
4900 /* Expand call statements reachable from STMT_P.
4901 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4902 in a MODIFY_EXPR. */
4905 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4907 gimple_stmt_iterator gsi
;
4908 bool inlined
= false;
4910 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
4912 gimple
*stmt
= gsi_stmt (gsi
);
4915 if (is_gimple_call (stmt
)
4916 && !gimple_call_internal_p (stmt
))
4917 inlined
|= expand_call_inline (bb
, stmt
, id
);
4924 /* Walk all basic blocks created after FIRST and try to fold every statement
4925 in the STATEMENTS pointer set. */
4928 fold_marked_statements (int first
, hash_set
<gimple
*> *statements
)
4930 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4931 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4933 gimple_stmt_iterator gsi
;
4935 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4938 if (statements
->contains (gsi_stmt (gsi
)))
4940 gimple
*old_stmt
= gsi_stmt (gsi
);
4941 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4943 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4945 /* Folding builtins can create multiple instructions,
4946 we need to look at all of them. */
4947 gimple_stmt_iterator i2
= gsi
;
4949 if (fold_stmt (&gsi
))
4952 /* If a builtin at the end of a bb folded into nothing,
4953 the following loop won't work. */
4954 if (gsi_end_p (gsi
))
4956 cgraph_update_edges_for_call_stmt (old_stmt
,
4961 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4966 new_stmt
= gsi_stmt (i2
);
4967 update_stmt (new_stmt
);
4968 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4971 if (new_stmt
== gsi_stmt (gsi
))
4973 /* It is okay to check only for the very last
4974 of these statements. If it is a throwing
4975 statement nothing will change. If it isn't
4976 this can remove EH edges. If that weren't
4977 correct then because some intermediate stmts
4978 throw, but not the last one. That would mean
4979 we'd have to split the block, which we can't
4980 here and we'd loose anyway. And as builtins
4981 probably never throw, this all
4983 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4985 gimple_purge_dead_eh_edges (
4986 BASIC_BLOCK_FOR_FN (cfun
, first
));
4993 else if (fold_stmt (&gsi
))
4995 /* Re-read the statement from GSI as fold_stmt() may
4997 gimple
*new_stmt
= gsi_stmt (gsi
);
4998 update_stmt (new_stmt
);
5000 if (is_gimple_call (old_stmt
)
5001 || is_gimple_call (new_stmt
))
5002 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5005 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
5006 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
5013 /* Expand calls to inline functions in the body of FN. */
5016 optimize_inline_calls (tree fn
)
5020 int last
= n_basic_blocks_for_fn (cfun
);
5021 bool inlined_p
= false;
5024 memset (&id
, 0, sizeof (id
));
5026 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
5027 gcc_assert (id
.dst_node
->definition
);
5029 /* Or any functions that aren't finished yet. */
5030 if (current_function_decl
)
5031 id
.dst_fn
= current_function_decl
;
5033 id
.copy_decl
= copy_decl_maybe_to_var
;
5034 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5035 id
.transform_new_cfg
= false;
5036 id
.transform_return_to_modify
= true;
5037 id
.transform_parameter
= true;
5038 id
.transform_lang_insert_block
= NULL
;
5039 id
.statements_to_fold
= new hash_set
<gimple
*>;
5041 push_gimplify_context ();
5043 /* We make no attempts to keep dominance info up-to-date. */
5044 free_dominance_info (CDI_DOMINATORS
);
5045 free_dominance_info (CDI_POST_DOMINATORS
);
5047 /* Register specific gimple functions. */
5048 gimple_register_cfg_hooks ();
5050 /* Reach the trees by walking over the CFG, and note the
5051 enclosing basic-blocks in the call edges. */
5052 /* We walk the blocks going forward, because inlined function bodies
5053 will split id->current_basic_block, and the new blocks will
5054 follow it; we'll trudge through them, processing their CALL_EXPRs
5056 FOR_EACH_BB_FN (bb
, cfun
)
5057 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
5059 pop_gimplify_context (NULL
);
5063 struct cgraph_edge
*e
;
5065 id
.dst_node
->verify ();
5067 /* Double check that we inlined everything we are supposed to inline. */
5068 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
5069 gcc_assert (e
->inline_failed
);
5072 /* Fold queued statements. */
5073 fold_marked_statements (last
, id
.statements_to_fold
);
5074 delete id
.statements_to_fold
;
5076 gcc_assert (!id
.debug_stmts
.exists ());
5078 /* If we didn't inline into the function there is nothing to do. */
5082 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5085 delete_unreachable_blocks_update_callgraph (&id
);
5087 id
.dst_node
->verify ();
5089 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5090 not possible yet - the IPA passes might make various functions to not
5091 throw and they don't care to proactively update local EH info. This is
5092 done later in fixup_cfg pass that also execute the verification. */
5093 return (TODO_update_ssa
5095 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5096 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
5097 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
5098 ? TODO_rebuild_frequencies
: 0));
5101 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5104 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5106 enum tree_code code
= TREE_CODE (*tp
);
5107 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5109 /* We make copies of most nodes. */
5110 if (IS_EXPR_CODE_CLASS (cl
)
5111 || code
== TREE_LIST
5113 || code
== TYPE_DECL
5114 || code
== OMP_CLAUSE
)
5116 /* Because the chain gets clobbered when we make a copy, we save it
5118 tree chain
= NULL_TREE
, new_tree
;
5120 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5121 chain
= TREE_CHAIN (*tp
);
5123 /* Copy the node. */
5124 new_tree
= copy_node (*tp
);
5128 /* Now, restore the chain, if appropriate. That will cause
5129 walk_tree to walk into the chain as well. */
5130 if (code
== PARM_DECL
5131 || code
== TREE_LIST
5132 || code
== OMP_CLAUSE
)
5133 TREE_CHAIN (*tp
) = chain
;
5135 /* For now, we don't update BLOCKs when we make copies. So, we
5136 have to nullify all BIND_EXPRs. */
5137 if (TREE_CODE (*tp
) == BIND_EXPR
)
5138 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5140 else if (code
== CONSTRUCTOR
)
5142 /* CONSTRUCTOR nodes need special handling because
5143 we need to duplicate the vector of elements. */
5146 new_tree
= copy_node (*tp
);
5147 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5150 else if (code
== STATEMENT_LIST
)
5151 /* We used to just abort on STATEMENT_LIST, but we can run into them
5152 with statement-expressions (c++/40975). */
5153 copy_statement_list (tp
);
5154 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5156 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5158 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5163 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5164 information indicating to what new SAVE_EXPR this one should be mapped,
5165 use that one. Otherwise, create a new node and enter it in ST. FN is
5166 the function into which the copy will be placed. */
5169 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5174 /* See if we already encountered this SAVE_EXPR. */
5177 /* If we didn't already remap this SAVE_EXPR, do so now. */
5180 t
= copy_node (*tp
);
5182 /* Remember this SAVE_EXPR. */
5184 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5189 /* We've already walked into this SAVE_EXPR; don't do it again. */
5194 /* Replace this SAVE_EXPR with the copy. */
5198 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5199 label, copies the declaration and enters it in the splay_tree in DATA (which
5200 is really a 'copy_body_data *'. */
5203 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5204 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5205 struct walk_stmt_info
*wi
)
5207 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5208 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5212 tree decl
= gimple_label_label (stmt
);
5214 /* Copy the decl and remember the copy. */
5215 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5221 static gimple_seq
duplicate_remap_omp_clause_seq (gimple_seq seq
,
5222 struct walk_stmt_info
*wi
);
5224 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5225 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5226 remaps all local declarations to appropriate replacements in gimple
5230 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5232 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5233 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5234 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5238 /* For recursive invocations this is no longer the LHS itself. */
5239 bool is_lhs
= wi
->is_lhs
;
5242 if (TREE_CODE (expr
) == SSA_NAME
)
5244 *tp
= remap_ssa_name (*tp
, id
);
5247 SSA_NAME_DEF_STMT (*tp
) = gsi_stmt (wi
->gsi
);
5249 /* Only a local declaration (variable or label). */
5250 else if ((VAR_P (expr
) && !TREE_STATIC (expr
))
5251 || TREE_CODE (expr
) == LABEL_DECL
)
5253 /* Lookup the declaration. */
5256 /* If it's there, remap it. */
5261 else if (TREE_CODE (expr
) == STATEMENT_LIST
5262 || TREE_CODE (expr
) == BIND_EXPR
5263 || TREE_CODE (expr
) == SAVE_EXPR
)
5265 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5267 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5268 It's OK for this to happen if it was part of a subtree that
5269 isn't immediately expanded, such as operand 2 of another
5271 if (!TREE_OPERAND (expr
, 1))
5273 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5274 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5277 else if (TREE_CODE (expr
) == OMP_CLAUSE
)
5279 /* Before the omplower pass completes, some OMP clauses can contain
5280 sequences that are neither copied by gimple_seq_copy nor walked by
5281 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5282 in those situations, we have to copy and process them explicitely. */
5284 if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LASTPRIVATE
)
5286 gimple_seq seq
= OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
);
5287 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5288 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
) = seq
;
5290 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LINEAR
)
5292 gimple_seq seq
= OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
);
5293 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5294 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
) = seq
;
5296 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_REDUCTION
)
5298 gimple_seq seq
= OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
);
5299 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5300 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
) = seq
;
5301 seq
= OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
);
5302 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5303 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
) = seq
;
5307 /* Keep iterating. */
5312 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5313 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5314 remaps all local declarations to appropriate replacements in gimple
5318 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5319 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5320 struct walk_stmt_info
*wi
)
5322 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5323 gimple
*gs
= gsi_stmt (*gsip
);
5325 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5327 tree block
= gimple_bind_block (stmt
);
5331 remap_block (&block
, id
);
5332 gimple_bind_set_block (stmt
, block
);
5335 /* This will remap a lot of the same decls again, but this should be
5337 if (gimple_bind_vars (stmt
))
5339 tree old_var
, decls
= gimple_bind_vars (stmt
);
5341 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
5342 if (!can_be_nonlocal (old_var
, id
)
5343 && ! variably_modified_type_p (TREE_TYPE (old_var
), id
->src_fn
))
5344 remap_decl (old_var
, id
);
5346 gcc_checking_assert (!id
->prevent_decl_creation_for_types
);
5347 id
->prevent_decl_creation_for_types
= true;
5348 gimple_bind_set_vars (stmt
, remap_decls (decls
, NULL
, id
));
5349 id
->prevent_decl_creation_for_types
= false;
5353 /* Keep iterating. */
5357 /* Create a copy of SEQ and remap all decls in it. */
5360 duplicate_remap_omp_clause_seq (gimple_seq seq
, struct walk_stmt_info
*wi
)
5365 /* If there are any labels in OMP sequences, they can be only referred to in
5366 the sequence itself and therefore we can do both here. */
5367 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, wi
);
5368 gimple_seq copy
= gimple_seq_copy (seq
);
5369 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, wi
);
5373 /* Copies everything in SEQ and replaces variables and labels local to
5374 current_function_decl. */
5377 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5380 struct walk_stmt_info wi
;
5383 /* There's nothing to do for NULL_TREE. */
5388 memset (&id
, 0, sizeof (id
));
5389 id
.src_fn
= current_function_decl
;
5390 id
.dst_fn
= current_function_decl
;
5392 id
.decl_map
= new hash_map
<tree
, tree
>;
5393 id
.debug_map
= NULL
;
5395 id
.copy_decl
= copy_decl_no_change
;
5396 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5397 id
.transform_new_cfg
= false;
5398 id
.transform_return_to_modify
= false;
5399 id
.transform_parameter
= false;
5400 id
.transform_lang_insert_block
= NULL
;
5402 /* Walk the tree once to find local labels. */
5403 memset (&wi
, 0, sizeof (wi
));
5404 hash_set
<tree
> visited
;
5407 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5409 copy
= gimple_seq_copy (seq
);
5411 /* Walk the copy, remapping decls. */
5412 memset (&wi
, 0, sizeof (wi
));
5414 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5419 delete id
.debug_map
;
5420 if (id
.dependence_map
)
5422 delete id
.dependence_map
;
5423 id
.dependence_map
= NULL
;
5430 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5433 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5442 debug_find_tree (tree top
, tree search
)
5444 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5448 /* Declare the variables created by the inliner. Add all the variables in
5449 VARS to BIND_EXPR. */
5452 declare_inline_vars (tree block
, tree vars
)
5455 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5457 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5458 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5459 add_local_decl (cfun
, t
);
5463 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5466 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5467 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5468 VAR_DECL translation. */
5471 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5473 /* Don't generate debug information for the copy if we wouldn't have
5474 generated it for the copy either. */
5475 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5476 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5478 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5479 declaration inspired this copy. */
5480 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5482 /* The new variable/label has no RTL, yet. */
5483 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5484 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5485 SET_DECL_RTL (copy
, 0);
5487 /* These args would always appear unused, if not for this. */
5488 TREE_USED (copy
) = 1;
5490 /* Set the context for the new declaration. */
5491 if (!DECL_CONTEXT (decl
))
5492 /* Globals stay global. */
5494 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5495 /* Things that weren't in the scope of the function we're inlining
5496 from aren't in the scope we're inlining to, either. */
5498 else if (TREE_STATIC (decl
))
5499 /* Function-scoped static variables should stay in the original
5504 /* Ordinary automatic local variables are now in the scope of the
5506 DECL_CONTEXT (copy
) = id
->dst_fn
;
5507 if (VAR_P (copy
) && id
->dst_simt_vars
&& !is_gimple_reg (copy
))
5509 if (!lookup_attribute ("omp simt private", DECL_ATTRIBUTES (copy
)))
5510 DECL_ATTRIBUTES (copy
)
5511 = tree_cons (get_identifier ("omp simt private"), NULL
,
5512 DECL_ATTRIBUTES (copy
));
5513 id
->dst_simt_vars
->safe_push (copy
);
5521 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5525 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5526 || TREE_CODE (decl
) == RESULT_DECL
);
5528 type
= TREE_TYPE (decl
);
5530 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5531 VAR_DECL
, DECL_NAME (decl
), type
);
5532 if (DECL_PT_UID_SET_P (decl
))
5533 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5534 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5535 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5536 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5537 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5539 return copy_decl_for_dup_finish (id
, decl
, copy
);
5542 /* Like copy_decl_to_var, but create a return slot object instead of a
5543 pointer variable for return by invisible reference. */
5546 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5550 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5551 || TREE_CODE (decl
) == RESULT_DECL
);
5553 type
= TREE_TYPE (decl
);
5554 if (DECL_BY_REFERENCE (decl
))
5555 type
= TREE_TYPE (type
);
5557 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5558 VAR_DECL
, DECL_NAME (decl
), type
);
5559 if (DECL_PT_UID_SET_P (decl
))
5560 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5561 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5562 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5563 if (!DECL_BY_REFERENCE (decl
))
5565 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5566 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5569 return copy_decl_for_dup_finish (id
, decl
, copy
);
5573 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5577 copy
= copy_node (decl
);
5579 /* The COPY is not abstract; it will be generated in DST_FN. */
5580 DECL_ABSTRACT_P (copy
) = false;
5581 lang_hooks
.dup_lang_specific_decl (copy
);
5583 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5584 been taken; it's for internal bookkeeping in expand_goto_internal. */
5585 if (TREE_CODE (copy
) == LABEL_DECL
)
5587 TREE_ADDRESSABLE (copy
) = 0;
5588 LABEL_DECL_UID (copy
) = -1;
5591 return copy_decl_for_dup_finish (id
, decl
, copy
);
5595 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5597 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5598 return copy_decl_to_var (decl
, id
);
5600 return copy_decl_no_change (decl
, id
);
5603 /* Return a copy of the function's argument tree. */
5605 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5606 bitmap args_to_skip
, tree
*vars
)
5609 tree new_parm
= NULL
;
5614 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5615 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5617 tree new_tree
= remap_decl (arg
, id
);
5618 if (TREE_CODE (new_tree
) != PARM_DECL
)
5619 new_tree
= id
->copy_decl (arg
, id
);
5620 lang_hooks
.dup_lang_specific_decl (new_tree
);
5622 parg
= &DECL_CHAIN (new_tree
);
5624 else if (!id
->decl_map
->get (arg
))
5626 /* Make an equivalent VAR_DECL. If the argument was used
5627 as temporary variable later in function, the uses will be
5628 replaced by local variable. */
5629 tree var
= copy_decl_to_var (arg
, id
);
5630 insert_decl_map (id
, arg
, var
);
5631 /* Declare this new variable. */
5632 DECL_CHAIN (var
) = *vars
;
5638 /* Return a copy of the function's static chain. */
5640 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5642 tree
*chain_copy
, *pvar
;
5644 chain_copy
= &static_chain
;
5645 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5647 tree new_tree
= remap_decl (*pvar
, id
);
5648 lang_hooks
.dup_lang_specific_decl (new_tree
);
5649 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5652 return static_chain
;
5655 /* Return true if the function is allowed to be versioned.
5656 This is a guard for the versioning functionality. */
5659 tree_versionable_function_p (tree fndecl
)
5661 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5662 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
)) == NULL
);
5665 /* Delete all unreachable basic blocks and update callgraph.
5666 Doing so is somewhat nontrivial because we need to update all clones and
5667 remove inline function that become unreachable. */
5670 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5672 bool changed
= false;
5673 basic_block b
, next_bb
;
5675 find_unreachable_blocks ();
5677 /* Delete all unreachable basic blocks. */
5679 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5680 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5682 next_bb
= b
->next_bb
;
5684 if (!(b
->flags
& BB_REACHABLE
))
5686 gimple_stmt_iterator bsi
;
5688 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5690 struct cgraph_edge
*e
;
5691 struct cgraph_node
*node
;
5693 id
->dst_node
->remove_stmt_references (gsi_stmt (bsi
));
5695 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5696 &&(e
= id
->dst_node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5698 if (!e
->inline_failed
)
5699 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5703 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5704 && id
->dst_node
->clones
)
5705 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5707 node
->remove_stmt_references (gsi_stmt (bsi
));
5708 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5709 && (e
= node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5711 if (!e
->inline_failed
)
5712 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5718 node
= node
->clones
;
5719 else if (node
->next_sibling_clone
)
5720 node
= node
->next_sibling_clone
;
5723 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5724 node
= node
->clone_of
;
5725 if (node
!= id
->dst_node
)
5726 node
= node
->next_sibling_clone
;
5730 delete_basic_block (b
);
5738 /* Update clone info after duplication. */
5741 update_clone_info (copy_body_data
* id
)
5743 struct cgraph_node
*node
;
5744 if (!id
->dst_node
->clones
)
5746 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5748 /* First update replace maps to match the new body. */
5749 if (node
->clone
.tree_map
)
5752 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5754 struct ipa_replace_map
*replace_info
;
5755 replace_info
= (*node
->clone
.tree_map
)[i
];
5756 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5757 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5761 node
= node
->clones
;
5762 else if (node
->next_sibling_clone
)
5763 node
= node
->next_sibling_clone
;
5766 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5767 node
= node
->clone_of
;
5768 if (node
!= id
->dst_node
)
5769 node
= node
->next_sibling_clone
;
5774 /* Create a copy of a function's tree.
5775 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5776 of the original function and the new copied function
5777 respectively. In case we want to replace a DECL
5778 tree with another tree while duplicating the function's
5779 body, TREE_MAP represents the mapping between these
5780 trees. If UPDATE_CLONES is set, the call_stmt fields
5781 of edges of clones of the function will be updated.
5783 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5785 If SKIP_RETURN is true, the new version will return void.
5786 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5787 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5790 tree_function_versioning (tree old_decl
, tree new_decl
,
5791 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
5792 bool update_clones
, bitmap args_to_skip
,
5793 bool skip_return
, bitmap blocks_to_copy
,
5794 basic_block new_entry
)
5796 struct cgraph_node
*old_version_node
;
5797 struct cgraph_node
*new_version_node
;
5801 struct ipa_replace_map
*replace_info
;
5802 basic_block old_entry_block
, bb
;
5803 auto_vec
<gimple
*, 10> init_stmts
;
5804 tree vars
= NULL_TREE
;
5805 bitmap debug_args_to_skip
= args_to_skip
;
5807 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5808 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5809 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5811 old_version_node
= cgraph_node::get (old_decl
);
5812 gcc_checking_assert (old_version_node
);
5813 new_version_node
= cgraph_node::get (new_decl
);
5814 gcc_checking_assert (new_version_node
);
5816 /* Copy over debug args. */
5817 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5819 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5820 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5821 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5822 old_debug_args
= decl_debug_args_lookup (old_decl
);
5825 new_debug_args
= decl_debug_args_insert (new_decl
);
5826 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5830 /* Output the inlining info for this abstract function, since it has been
5831 inlined. If we don't do this now, we can lose the information about the
5832 variables in the function when the blocks get blown away as soon as we
5833 remove the cgraph node. */
5834 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5836 DECL_ARTIFICIAL (new_decl
) = 1;
5837 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5838 if (DECL_ORIGIN (old_decl
) == old_decl
)
5839 old_version_node
->used_as_abstract_origin
= true;
5840 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5842 /* Prepare the data structures for the tree copy. */
5843 memset (&id
, 0, sizeof (id
));
5845 /* Generate a new name for the new version. */
5846 id
.statements_to_fold
= new hash_set
<gimple
*>;
5848 id
.decl_map
= new hash_map
<tree
, tree
>;
5849 id
.debug_map
= NULL
;
5850 id
.src_fn
= old_decl
;
5851 id
.dst_fn
= new_decl
;
5852 id
.src_node
= old_version_node
;
5853 id
.dst_node
= new_version_node
;
5854 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5855 id
.blocks_to_copy
= blocks_to_copy
;
5857 id
.copy_decl
= copy_decl_no_change
;
5858 id
.transform_call_graph_edges
5859 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5860 id
.transform_new_cfg
= true;
5861 id
.transform_return_to_modify
= false;
5862 id
.transform_parameter
= false;
5863 id
.transform_lang_insert_block
= NULL
;
5865 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5866 (DECL_STRUCT_FUNCTION (old_decl
));
5867 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5868 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5869 initialize_cfun (new_decl
, old_decl
,
5870 old_entry_block
->count
);
5871 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
5872 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5873 = id
.src_cfun
->gimple_df
->ipa_pta
;
5875 /* Copy the function's static chain. */
5876 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5878 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
5879 = copy_static_chain (p
, &id
);
5881 /* If there's a tree_map, prepare for substitution. */
5883 for (i
= 0; i
< tree_map
->length (); i
++)
5886 replace_info
= (*tree_map
)[i
];
5887 if (replace_info
->replace_p
)
5890 if (!replace_info
->old_tree
)
5892 int p
= replace_info
->parm_num
;
5894 tree req_type
, new_type
;
5896 for (parm
= DECL_ARGUMENTS (old_decl
); p
;
5897 parm
= DECL_CHAIN (parm
))
5899 replace_info
->old_tree
= parm
;
5900 parm_num
= replace_info
->parm_num
;
5901 req_type
= TREE_TYPE (parm
);
5902 new_type
= TREE_TYPE (replace_info
->new_tree
);
5903 if (!useless_type_conversion_p (req_type
, new_type
))
5905 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5906 replace_info
->new_tree
5907 = fold_build1 (NOP_EXPR
, req_type
,
5908 replace_info
->new_tree
);
5909 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (new_type
))
5910 replace_info
->new_tree
5911 = fold_build1 (VIEW_CONVERT_EXPR
, req_type
,
5912 replace_info
->new_tree
);
5917 fprintf (dump_file
, " const ");
5918 print_generic_expr (dump_file
,
5919 replace_info
->new_tree
, 0);
5921 " can't be converted to param ");
5922 print_generic_expr (dump_file
, parm
, 0);
5923 fprintf (dump_file
, "\n");
5925 replace_info
->old_tree
= NULL
;
5930 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5931 if (replace_info
->old_tree
)
5933 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5934 replace_info
->new_tree
, id
.src_fn
,
5938 init_stmts
.safe_push (init
);
5939 if (MAY_HAVE_DEBUG_STMTS
&& args_to_skip
)
5945 for (parm
= DECL_ARGUMENTS (old_decl
), p
= 0; parm
;
5946 parm
= DECL_CHAIN (parm
), p
++)
5947 if (parm
== replace_info
->old_tree
)
5955 if (debug_args_to_skip
== args_to_skip
)
5957 debug_args_to_skip
= BITMAP_ALLOC (NULL
);
5958 bitmap_copy (debug_args_to_skip
, args_to_skip
);
5960 bitmap_clear_bit (debug_args_to_skip
, parm_num
);
5966 /* Copy the function's arguments. */
5967 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5968 DECL_ARGUMENTS (new_decl
)
5969 = copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5970 args_to_skip
, &vars
);
5972 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5973 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5975 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5977 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5978 /* Add local vars. */
5979 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5981 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5983 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5985 DECL_RESULT (new_decl
)
5986 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5987 RESULT_DECL
, NULL_TREE
, void_type_node
);
5988 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5989 cfun
->returns_struct
= 0;
5990 cfun
->returns_pcc_struct
= 0;
5995 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5996 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5997 if (gimple_in_ssa_p (id
.src_cfun
)
5998 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5999 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
6001 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
6002 insert_decl_map (&id
, old_name
, new_name
);
6003 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
6004 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
6008 /* Set up the destination functions loop tree. */
6009 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
6011 cfun
->curr_properties
&= ~PROP_loops
;
6012 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
6013 cfun
->curr_properties
|= PROP_loops
;
6016 /* Copy the Function's body. */
6017 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
6018 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
6021 /* Renumber the lexical scoping (non-code) blocks consecutively. */
6022 number_blocks (new_decl
);
6024 /* We want to create the BB unconditionally, so that the addition of
6025 debug stmts doesn't affect BB count, which may in the end cause
6026 codegen differences. */
6027 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6028 while (init_stmts
.length ())
6029 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
6030 update_clone_info (&id
);
6032 /* Remap the nonlocal_goto_save_area, if any. */
6033 if (cfun
->nonlocal_goto_save_area
)
6035 struct walk_stmt_info wi
;
6037 memset (&wi
, 0, sizeof (wi
));
6039 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
6045 delete id
.debug_map
;
6046 free_dominance_info (CDI_DOMINATORS
);
6047 free_dominance_info (CDI_POST_DOMINATORS
);
6049 fold_marked_statements (0, id
.statements_to_fold
);
6050 delete id
.statements_to_fold
;
6051 delete_unreachable_blocks_update_callgraph (&id
);
6052 if (id
.dst_node
->definition
)
6053 cgraph_edge::rebuild_references ();
6054 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
6056 calculate_dominance_info (CDI_DOMINATORS
);
6057 fix_loop_structure (NULL
);
6059 update_ssa (TODO_update_ssa
);
6061 /* After partial cloning we need to rescale frequencies, so they are
6062 within proper range in the cloned function. */
6065 struct cgraph_edge
*e
;
6066 rebuild_frequencies ();
6068 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
6069 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
6071 basic_block bb
= gimple_bb (e
->call_stmt
);
6072 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
6074 e
->count
= bb
->count
;
6076 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
6078 basic_block bb
= gimple_bb (e
->call_stmt
);
6079 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
6081 e
->count
= bb
->count
;
6085 if (debug_args_to_skip
&& MAY_HAVE_DEBUG_STMTS
)
6088 vec
<tree
, va_gc
> **debug_args
= NULL
;
6089 unsigned int len
= 0;
6090 for (parm
= DECL_ARGUMENTS (old_decl
), i
= 0;
6091 parm
; parm
= DECL_CHAIN (parm
), i
++)
6092 if (bitmap_bit_p (debug_args_to_skip
, i
) && is_gimple_reg (parm
))
6096 if (debug_args
== NULL
)
6098 debug_args
= decl_debug_args_insert (new_decl
);
6099 len
= vec_safe_length (*debug_args
);
6101 ddecl
= make_node (DEBUG_EXPR_DECL
);
6102 DECL_ARTIFICIAL (ddecl
) = 1;
6103 TREE_TYPE (ddecl
) = TREE_TYPE (parm
);
6104 SET_DECL_MODE (ddecl
, DECL_MODE (parm
));
6105 vec_safe_push (*debug_args
, DECL_ORIGIN (parm
));
6106 vec_safe_push (*debug_args
, ddecl
);
6108 if (debug_args
!= NULL
)
6110 /* On the callee side, add
6113 stmts to the first bb where var is a VAR_DECL created for the
6114 optimized away parameter in DECL_INITIAL block. This hints
6115 in the debug info that var (whole DECL_ORIGIN is the parm
6116 PARM_DECL) is optimized away, but could be looked up at the
6117 call site as value of D#X there. */
6118 tree var
= vars
, vexpr
;
6119 gimple_stmt_iterator cgsi
6120 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6123 i
= vec_safe_length (*debug_args
);
6127 while (var
!= NULL_TREE
6128 && DECL_ABSTRACT_ORIGIN (var
) != (**debug_args
)[i
])
6129 var
= TREE_CHAIN (var
);
6130 if (var
== NULL_TREE
)
6132 vexpr
= make_node (DEBUG_EXPR_DECL
);
6133 parm
= (**debug_args
)[i
];
6134 DECL_ARTIFICIAL (vexpr
) = 1;
6135 TREE_TYPE (vexpr
) = TREE_TYPE (parm
);
6136 SET_DECL_MODE (vexpr
, DECL_MODE (parm
));
6137 def_temp
= gimple_build_debug_bind (var
, vexpr
, NULL
);
6138 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6139 def_temp
= gimple_build_debug_source_bind (vexpr
, parm
, NULL
);
6140 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6146 if (debug_args_to_skip
&& debug_args_to_skip
!= args_to_skip
)
6147 BITMAP_FREE (debug_args_to_skip
);
6148 free_dominance_info (CDI_DOMINATORS
);
6149 free_dominance_info (CDI_POST_DOMINATORS
);
6151 gcc_assert (!id
.debug_stmts
.exists ());
6156 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6157 the callee and return the inlined body on success. */
6160 maybe_inline_call_in_expr (tree exp
)
6162 tree fn
= get_callee_fndecl (exp
);
6164 /* We can only try to inline "const" functions. */
6165 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
6167 call_expr_arg_iterator iter
;
6170 hash_map
<tree
, tree
> decl_map
;
6172 /* Remap the parameters. */
6173 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
6175 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
6176 decl_map
.put (param
, arg
);
6178 memset (&id
, 0, sizeof (id
));
6180 id
.dst_fn
= current_function_decl
;
6181 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6182 id
.decl_map
= &decl_map
;
6184 id
.copy_decl
= copy_decl_no_change
;
6185 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6186 id
.transform_new_cfg
= false;
6187 id
.transform_return_to_modify
= true;
6188 id
.transform_parameter
= true;
6189 id
.transform_lang_insert_block
= NULL
;
6191 /* Make sure not to unshare trees behind the front-end's back
6192 since front-end specific mechanisms may rely on sharing. */
6193 id
.regimplify
= false;
6194 id
.do_not_unshare
= true;
6196 /* We're not inside any EH region. */
6199 t
= copy_tree_body (&id
);
6201 /* We can only return something suitable for use in a GENERIC
6203 if (TREE_CODE (t
) == MODIFY_EXPR
)
6204 return TREE_OPERAND (t
, 1);
6210 /* Duplicate a type, fields and all. */
6213 build_duplicate_type (tree type
)
6215 struct copy_body_data id
;
6217 memset (&id
, 0, sizeof (id
));
6218 id
.src_fn
= current_function_decl
;
6219 id
.dst_fn
= current_function_decl
;
6221 id
.decl_map
= new hash_map
<tree
, tree
>;
6222 id
.debug_map
= NULL
;
6223 id
.copy_decl
= copy_decl_no_change
;
6225 type
= remap_type_1 (type
, &id
);
6229 delete id
.debug_map
;
6231 TYPE_CANONICAL (type
) = type
;
6236 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6237 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6241 copy_fn (tree fn
, tree
& parms
, tree
& result
)
6245 hash_map
<tree
, tree
> decl_map
;
6250 memset (&id
, 0, sizeof (id
));
6252 id
.dst_fn
= current_function_decl
;
6253 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6254 id
.decl_map
= &decl_map
;
6256 id
.copy_decl
= copy_decl_no_change
;
6257 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6258 id
.transform_new_cfg
= false;
6259 id
.transform_return_to_modify
= false;
6260 id
.transform_parameter
= true;
6261 id
.transform_lang_insert_block
= NULL
;
6263 /* Make sure not to unshare trees behind the front-end's back
6264 since front-end specific mechanisms may rely on sharing. */
6265 id
.regimplify
= false;
6266 id
.do_not_unshare
= true;
6268 /* We're not inside any EH region. */
6271 /* Remap the parameters and result and return them to the caller. */
6272 for (param
= DECL_ARGUMENTS (fn
);
6274 param
= DECL_CHAIN (param
))
6276 *p
= remap_decl (param
, &id
);
6277 p
= &DECL_CHAIN (*p
);
6280 if (DECL_RESULT (fn
))
6281 result
= remap_decl (DECL_RESULT (fn
), &id
);
6285 return copy_tree_body (&id
);