2 Copyright (C) 2001-2015 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"
25 #include "diagnostic-core.h"
29 #include "fold-const.h"
30 #include "stor-layout.h"
32 #include "tree-inline.h"
35 #include "insn-config.h"
36 #include "langhooks.h"
38 #include "hard-reg-set.h"
40 #include "dominance.h"
43 #include "basic-block.h"
44 #include "tree-iterator.h"
46 #include "tree-ssa-alias.h"
47 #include "internal-fn.h"
48 #include "gimple-fold.h"
50 #include "gimple-expr.h"
53 #include "gimple-iterator.h"
54 #include "gimplify-me.h"
55 #include "gimple-walk.h"
56 #include "gimple-ssa.h"
58 #include "tree-phinodes.h"
59 #include "ssa-iterators.h"
60 #include "stringpool.h"
61 #include "tree-ssanames.h"
62 #include "tree-into-ssa.h"
73 #include "tree-pretty-print.h"
76 #include "plugin-api.h"
79 #include "alloc-pool.h"
80 #include "symbol-summary.h"
82 #include "value-prof.h"
83 #include "tree-pass.h"
87 #include "tree-chkp.h"
89 #include "rtl.h" /* FIXME: For asm_str_count. */
91 /* I'm not real happy about this, but we need to handle gimple and
94 /* Inlining, Cloning, Versioning, Parallelization
96 Inlining: a function body is duplicated, but the PARM_DECLs are
97 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
98 MODIFY_EXPRs that store to a dedicated returned-value variable.
99 The duplicated eh_region info of the copy will later be appended
100 to the info for the caller; the eh_region info in copied throwing
101 statements and RESX statements are adjusted accordingly.
103 Cloning: (only in C++) We have one body for a con/de/structor, and
104 multiple function decls, each with a unique parameter list.
105 Duplicate the body, using the given splay tree; some parameters
106 will become constants (like 0 or 1).
108 Versioning: a function body is duplicated and the result is a new
109 function rather than into blocks of an existing function as with
110 inlining. Some parameters will become constants.
112 Parallelization: a region of a function is duplicated resulting in
113 a new function. Variables may be replaced with complex expressions
114 to enable shared variable semantics.
116 All of these will simultaneously lookup any callgraph edges. If
117 we're going to inline the duplicated function body, and the given
118 function has some cloned callgraph nodes (one for each place this
119 function will be inlined) those callgraph edges will be duplicated.
120 If we're cloning the body, those callgraph edges will be
121 updated to point into the new body. (Note that the original
122 callgraph node and edge list will not be altered.)
124 See the CALL_EXPR handling case in copy_tree_body_r (). */
128 o In order to make inlining-on-trees work, we pessimized
129 function-local static constants. In particular, they are now
130 always output, even when not addressed. Fix this by treating
131 function-local static constants just like global static
132 constants; the back-end already knows not to output them if they
135 o Provide heuristics to clamp inlining of recursive template
139 /* Weights that estimate_num_insns uses to estimate the size of the
142 eni_weights eni_size_weights
;
144 /* Weights that estimate_num_insns uses to estimate the time necessary
145 to execute the produced code. */
147 eni_weights eni_time_weights
;
151 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, tree
,
153 static void remap_block (tree
*, copy_body_data
*);
154 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
155 static void declare_inline_vars (tree
, tree
);
156 static void remap_save_expr (tree
*, hash_map
<tree
, tree
> *, int *);
157 static void prepend_lexical_block (tree current_block
, tree new_block
);
158 static tree
copy_decl_to_var (tree
, copy_body_data
*);
159 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
160 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
161 static gimple_seq
remap_gimple_stmt (gimple
, copy_body_data
*);
162 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
163 static void insert_init_stmt (copy_body_data
*, basic_block
, gimple
);
165 /* Insert a tree->tree mapping for ID. Despite the name suggests
166 that the trees should be variables, it is used for more than that. */
169 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
171 id
->decl_map
->put (key
, value
);
173 /* Always insert an identity map as well. If we see this same new
174 node again, we won't want to duplicate it a second time. */
176 id
->decl_map
->put (value
, value
);
179 /* Insert a tree->tree mapping for ID. This is only used for
183 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
185 if (!gimple_in_ssa_p (id
->src_cfun
))
188 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
191 if (!target_for_debug_bind (key
))
194 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
195 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
198 id
->debug_map
= new hash_map
<tree
, tree
>;
200 id
->debug_map
->put (key
, value
);
203 /* If nonzero, we're remapping the contents of inlined debug
204 statements. If negative, an error has occurred, such as a
205 reference to a variable that isn't available in the inlined
207 static int processing_debug_stmt
= 0;
209 /* Construct new SSA name for old NAME. ID is the inline context. */
212 remap_ssa_name (tree name
, copy_body_data
*id
)
217 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
219 n
= id
->decl_map
->get (name
);
221 return unshare_expr (*n
);
223 if (processing_debug_stmt
)
225 if (SSA_NAME_IS_DEFAULT_DEF (name
)
226 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
227 && id
->entry_bb
== NULL
228 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
230 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
232 gimple_stmt_iterator gsi
;
233 tree val
= SSA_NAME_VAR (name
);
235 n
= id
->decl_map
->get (val
);
238 if (TREE_CODE (val
) != PARM_DECL
)
240 processing_debug_stmt
= -1;
243 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
244 DECL_ARTIFICIAL (vexpr
) = 1;
245 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
246 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
247 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
248 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
252 processing_debug_stmt
= -1;
256 /* Remap anonymous SSA names or SSA names of anonymous decls. */
257 var
= SSA_NAME_VAR (name
);
259 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
260 && TREE_CODE (var
) == VAR_DECL
261 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
262 && DECL_ARTIFICIAL (var
)
263 && DECL_IGNORED_P (var
)
264 && !DECL_NAME (var
)))
266 struct ptr_info_def
*pi
;
267 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
));
268 if (!var
&& SSA_NAME_IDENTIFIER (name
))
269 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
270 insert_decl_map (id
, name
, new_tree
);
271 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
272 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
273 /* At least IPA points-to info can be directly transferred. */
274 if (id
->src_cfun
->gimple_df
275 && id
->src_cfun
->gimple_df
->ipa_pta
276 && (pi
= SSA_NAME_PTR_INFO (name
))
279 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
285 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
287 new_tree
= remap_decl (var
, id
);
289 /* We might've substituted constant or another SSA_NAME for
292 Replace the SSA name representing RESULT_DECL by variable during
293 inlining: this saves us from need to introduce PHI node in a case
294 return value is just partly initialized. */
295 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
296 && (!SSA_NAME_VAR (name
)
297 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
298 || !id
->transform_return_to_modify
))
300 struct ptr_info_def
*pi
;
301 new_tree
= make_ssa_name (new_tree
);
302 insert_decl_map (id
, name
, new_tree
);
303 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
304 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
305 /* At least IPA points-to info can be directly transferred. */
306 if (id
->src_cfun
->gimple_df
307 && id
->src_cfun
->gimple_df
->ipa_pta
308 && (pi
= SSA_NAME_PTR_INFO (name
))
311 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
314 if (SSA_NAME_IS_DEFAULT_DEF (name
))
316 /* By inlining function having uninitialized variable, we might
317 extend the lifetime (variable might get reused). This cause
318 ICE in the case we end up extending lifetime of SSA name across
319 abnormal edge, but also increase register pressure.
321 We simply initialize all uninitialized vars by 0 except
322 for case we are inlining to very first BB. We can avoid
323 this for all BBs that are not inside strongly connected
324 regions of the CFG, but this is expensive to test. */
326 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
327 && (!SSA_NAME_VAR (name
)
328 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
329 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
331 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
333 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
335 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
337 init_stmt
= gimple_build_assign (new_tree
, zero
);
338 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
339 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
343 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
344 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
349 insert_decl_map (id
, name
, new_tree
);
353 /* Remap DECL during the copying of the BLOCK tree for the function. */
356 remap_decl (tree decl
, copy_body_data
*id
)
360 /* We only remap local variables in the current function. */
362 /* See if we have remapped this declaration. */
364 n
= id
->decl_map
->get (decl
);
366 if (!n
&& processing_debug_stmt
)
368 processing_debug_stmt
= -1;
372 /* If we didn't already have an equivalent for this declaration,
376 /* Make a copy of the variable or label. */
377 tree t
= id
->copy_decl (decl
, id
);
379 /* Remember it, so that if we encounter this local entity again
380 we can reuse this copy. Do this early because remap_type may
381 need this decl for TYPE_STUB_DECL. */
382 insert_decl_map (id
, decl
, t
);
387 /* Remap types, if necessary. */
388 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
389 if (TREE_CODE (t
) == TYPE_DECL
)
390 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
392 /* Remap sizes as necessary. */
393 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
394 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
396 /* If fields, do likewise for offset and qualifier. */
397 if (TREE_CODE (t
) == FIELD_DECL
)
399 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
400 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
401 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
407 if (id
->do_not_unshare
)
410 return unshare_expr (*n
);
414 remap_type_1 (tree type
, copy_body_data
*id
)
418 /* We do need a copy. build and register it now. If this is a pointer or
419 reference type, remap the designated type and make a new pointer or
421 if (TREE_CODE (type
) == POINTER_TYPE
)
423 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
425 TYPE_REF_CAN_ALIAS_ALL (type
));
426 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
427 new_tree
= build_type_attribute_qual_variant (new_tree
,
428 TYPE_ATTRIBUTES (type
),
430 insert_decl_map (id
, type
, new_tree
);
433 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
435 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
437 TYPE_REF_CAN_ALIAS_ALL (type
));
438 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
439 new_tree
= build_type_attribute_qual_variant (new_tree
,
440 TYPE_ATTRIBUTES (type
),
442 insert_decl_map (id
, type
, new_tree
);
446 new_tree
= copy_node (type
);
448 insert_decl_map (id
, type
, new_tree
);
450 /* This is a new type, not a copy of an old type. Need to reassociate
451 variants. We can handle everything except the main variant lazily. */
452 t
= TYPE_MAIN_VARIANT (type
);
455 t
= remap_type (t
, id
);
456 TYPE_MAIN_VARIANT (new_tree
) = t
;
457 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
458 TYPE_NEXT_VARIANT (t
) = new_tree
;
462 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
463 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
466 if (TYPE_STUB_DECL (type
))
467 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
469 /* Lazily create pointer and reference types. */
470 TYPE_POINTER_TO (new_tree
) = NULL
;
471 TYPE_REFERENCE_TO (new_tree
) = NULL
;
473 /* Copy all types that may contain references to local variables; be sure to
474 preserve sharing in between type and its main variant when possible. */
475 switch (TREE_CODE (new_tree
))
479 case FIXED_POINT_TYPE
:
482 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
484 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
485 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
487 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
488 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
492 t
= TYPE_MIN_VALUE (new_tree
);
493 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
494 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
496 t
= TYPE_MAX_VALUE (new_tree
);
497 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
498 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
503 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
504 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
505 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
507 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
508 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
509 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
510 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
512 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
516 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
517 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
518 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
520 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
522 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
524 gcc_checking_assert (TYPE_DOMAIN (type
) == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
525 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
528 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
533 case QUAL_UNION_TYPE
:
534 if (TYPE_MAIN_VARIANT (type
) != type
535 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
536 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
541 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
543 t
= remap_decl (f
, id
);
544 DECL_CONTEXT (t
) = new_tree
;
548 TYPE_FIELDS (new_tree
) = nreverse (nf
);
554 /* Shouldn't have been thought variable sized. */
558 /* All variants of type share the same size, so use the already remaped data. */
559 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
561 gcc_checking_assert (TYPE_SIZE (type
) == TYPE_SIZE (TYPE_MAIN_VARIANT (type
)));
562 gcc_checking_assert (TYPE_SIZE_UNIT (type
) == TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
)));
564 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
565 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
569 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
570 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
577 remap_type (tree type
, copy_body_data
*id
)
585 /* See if we have remapped this type. */
586 node
= id
->decl_map
->get (type
);
590 /* The type only needs remapping if it's variably modified. */
591 if (! variably_modified_type_p (type
, id
->src_fn
))
593 insert_decl_map (id
, type
, type
);
597 id
->remapping_type_depth
++;
598 tmp
= remap_type_1 (type
, id
);
599 id
->remapping_type_depth
--;
604 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
607 can_be_nonlocal (tree decl
, copy_body_data
*id
)
609 /* We can not duplicate function decls. */
610 if (TREE_CODE (decl
) == FUNCTION_DECL
)
613 /* Local static vars must be non-local or we get multiple declaration
615 if (TREE_CODE (decl
) == VAR_DECL
616 && !auto_var_in_fn_p (decl
, id
->src_fn
))
623 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
627 tree new_decls
= NULL_TREE
;
629 /* Remap its variables. */
630 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
634 if (can_be_nonlocal (old_var
, id
))
636 /* We need to add this variable to the local decls as otherwise
637 nothing else will do so. */
638 if (TREE_CODE (old_var
) == VAR_DECL
639 && ! DECL_EXTERNAL (old_var
))
640 add_local_decl (cfun
, old_var
);
641 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
642 && !DECL_IGNORED_P (old_var
)
643 && nonlocalized_list
)
644 vec_safe_push (*nonlocalized_list
, old_var
);
648 /* Remap the variable. */
649 new_var
= remap_decl (old_var
, id
);
651 /* If we didn't remap this variable, we can't mess with its
652 TREE_CHAIN. If we remapped this variable to the return slot, it's
653 already declared somewhere else, so don't declare it here. */
655 if (new_var
== id
->retvar
)
659 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
660 && !DECL_IGNORED_P (old_var
)
661 && nonlocalized_list
)
662 vec_safe_push (*nonlocalized_list
, old_var
);
666 gcc_assert (DECL_P (new_var
));
667 DECL_CHAIN (new_var
) = new_decls
;
670 /* Also copy value-expressions. */
671 if (TREE_CODE (new_var
) == VAR_DECL
672 && DECL_HAS_VALUE_EXPR_P (new_var
))
674 tree tem
= DECL_VALUE_EXPR (new_var
);
675 bool old_regimplify
= id
->regimplify
;
676 id
->remapping_type_depth
++;
677 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
678 id
->remapping_type_depth
--;
679 id
->regimplify
= old_regimplify
;
680 SET_DECL_VALUE_EXPR (new_var
, tem
);
685 return nreverse (new_decls
);
688 /* Copy the BLOCK to contain remapped versions of the variables
689 therein. And hook the new block into the block-tree. */
692 remap_block (tree
*block
, copy_body_data
*id
)
697 /* Make the new block. */
699 new_block
= make_node (BLOCK
);
700 TREE_USED (new_block
) = TREE_USED (old_block
);
701 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
702 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
703 BLOCK_NONLOCALIZED_VARS (new_block
)
704 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
707 /* Remap its variables. */
708 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
709 &BLOCK_NONLOCALIZED_VARS (new_block
),
712 if (id
->transform_lang_insert_block
)
713 id
->transform_lang_insert_block (new_block
);
715 /* Remember the remapped block. */
716 insert_decl_map (id
, old_block
, new_block
);
719 /* Copy the whole block tree and root it in id->block. */
721 remap_blocks (tree block
, copy_body_data
*id
)
724 tree new_tree
= block
;
729 remap_block (&new_tree
, id
);
730 gcc_assert (new_tree
!= block
);
731 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
732 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
733 /* Blocks are in arbitrary order, but make things slightly prettier and do
734 not swap order when producing a copy. */
735 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
739 /* Remap the block tree rooted at BLOCK to nothing. */
741 remap_blocks_to_null (tree block
, copy_body_data
*id
)
744 insert_decl_map (id
, block
, NULL_TREE
);
745 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
746 remap_blocks_to_null (t
, id
);
750 copy_statement_list (tree
*tp
)
752 tree_stmt_iterator oi
, ni
;
755 new_tree
= alloc_stmt_list ();
756 ni
= tsi_start (new_tree
);
757 oi
= tsi_start (*tp
);
758 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
761 for (; !tsi_end_p (oi
); tsi_next (&oi
))
763 tree stmt
= tsi_stmt (oi
);
764 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
765 /* This copy is not redundant; tsi_link_after will smash this
766 STATEMENT_LIST into the end of the one we're building, and we
767 don't want to do that with the original. */
768 copy_statement_list (&stmt
);
769 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
774 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
776 tree block
= BIND_EXPR_BLOCK (*tp
);
777 /* Copy (and replace) the statement. */
778 copy_tree_r (tp
, walk_subtrees
, NULL
);
781 remap_block (&block
, id
);
782 BIND_EXPR_BLOCK (*tp
) = block
;
785 if (BIND_EXPR_VARS (*tp
))
786 /* This will remap a lot of the same decls again, but this should be
788 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
792 /* Create a new gimple_seq by remapping all the statements in BODY
793 using the inlining information in ID. */
796 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
798 gimple_stmt_iterator si
;
799 gimple_seq new_body
= NULL
;
801 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
803 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
804 gimple_seq_add_seq (&new_body
, new_stmts
);
811 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
812 block using the mapping information in ID. */
815 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
818 tree new_block
, new_vars
;
819 gimple_seq body
, new_body
;
821 /* Copy the statement. Note that we purposely don't use copy_stmt
822 here because we need to remap statements as we copy. */
823 body
= gimple_bind_body (stmt
);
824 new_body
= remap_gimple_seq (body
, id
);
826 new_block
= gimple_bind_block (stmt
);
828 remap_block (&new_block
, id
);
830 /* This will remap a lot of the same decls again, but this should be
832 new_vars
= gimple_bind_vars (stmt
);
834 new_vars
= remap_decls (new_vars
, NULL
, id
);
836 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
841 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
846 if (TREE_CODE (decl
) == SSA_NAME
)
848 decl
= SSA_NAME_VAR (decl
);
853 return (TREE_CODE (decl
) == PARM_DECL
);
856 /* Remap the dependence CLIQUE from the source to the destination function
857 as specified in ID. */
859 static unsigned short
860 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
864 if (!id
->dependence_map
)
865 id
->dependence_map
= new hash_map
<dependence_hash
, unsigned short>;
867 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
869 newc
= ++cfun
->last_clique
;
873 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
874 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
875 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
876 recursing into the children nodes of *TP. */
879 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
881 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
882 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
883 tree fn
= id
->src_fn
;
885 if (TREE_CODE (*tp
) == SSA_NAME
)
887 *tp
= remap_ssa_name (*tp
, id
);
891 else if (auto_var_in_fn_p (*tp
, fn
))
893 /* Local variables and labels need to be replaced by equivalent
894 variables. We don't want to copy static variables; there's
895 only one of those, no matter how many times we inline the
896 containing function. Similarly for globals from an outer
900 /* Remap the declaration. */
901 new_decl
= remap_decl (*tp
, id
);
902 gcc_assert (new_decl
);
903 /* Replace this variable with the copy. */
904 STRIP_TYPE_NOPS (new_decl
);
905 /* ??? The C++ frontend uses void * pointer zero to initialize
906 any other type. This confuses the middle-end type verification.
907 As cloned bodies do not go through gimplification again the fixup
908 there doesn't trigger. */
909 if (TREE_CODE (new_decl
) == INTEGER_CST
910 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
911 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
915 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
917 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
919 else if (TREE_CODE (*tp
) == LABEL_DECL
920 && (!DECL_CONTEXT (*tp
)
921 || decl_function_context (*tp
) == id
->src_fn
))
922 /* These may need to be remapped for EH handling. */
923 *tp
= remap_decl (*tp
, id
);
924 else if (TREE_CODE (*tp
) == FIELD_DECL
)
926 /* If the enclosing record type is variably_modified_type_p, the field
927 has already been remapped. Otherwise, it need not be. */
928 tree
*n
= id
->decl_map
->get (*tp
);
933 else if (TYPE_P (*tp
))
934 /* Types may need remapping as well. */
935 *tp
= remap_type (*tp
, id
);
936 else if (CONSTANT_CLASS_P (*tp
))
938 /* If this is a constant, we have to copy the node iff the type
939 will be remapped. copy_tree_r will not copy a constant. */
940 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
942 if (new_type
== TREE_TYPE (*tp
))
945 else if (TREE_CODE (*tp
) == INTEGER_CST
)
946 *tp
= wide_int_to_tree (new_type
, *tp
);
949 *tp
= copy_node (*tp
);
950 TREE_TYPE (*tp
) = new_type
;
955 /* Otherwise, just copy the node. Note that copy_tree_r already
956 knows not to copy VAR_DECLs, etc., so this is safe. */
958 if (TREE_CODE (*tp
) == MEM_REF
)
960 /* We need to re-canonicalize MEM_REFs from inline substitutions
961 that can happen when a pointer argument is an ADDR_EXPR.
962 Recurse here manually to allow that. */
963 tree ptr
= TREE_OPERAND (*tp
, 0);
964 tree type
= remap_type (TREE_TYPE (*tp
), id
);
966 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
967 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
968 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
969 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
970 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
971 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
973 MR_DEPENDENCE_CLIQUE (*tp
)
974 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
975 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
977 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
978 remapped a parameter as the property might be valid only
979 for the parameter itself. */
980 if (TREE_THIS_NOTRAP (old
)
981 && (!is_parm (TREE_OPERAND (old
, 0))
982 || (!id
->transform_parameter
&& is_parm (ptr
))))
983 TREE_THIS_NOTRAP (*tp
) = 1;
988 /* Here is the "usual case". Copy this tree node, and then
989 tweak some special cases. */
990 copy_tree_r (tp
, walk_subtrees
, NULL
);
992 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
993 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
995 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
997 /* The copied TARGET_EXPR has never been expanded, even if the
998 original node was expanded already. */
999 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1000 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1002 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1004 /* Variable substitution need not be simple. In particular,
1005 the MEM_REF substitution above. Make sure that
1006 TREE_CONSTANT and friends are up-to-date. */
1007 int invariant
= is_gimple_min_invariant (*tp
);
1008 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
1009 recompute_tree_invariant_for_addr_expr (*tp
);
1011 /* If this used to be invariant, but is not any longer,
1012 then regimplification is probably needed. */
1013 if (invariant
&& !is_gimple_min_invariant (*tp
))
1014 id
->regimplify
= true;
1020 /* Update the TREE_BLOCK for the cloned expr. */
1023 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1024 tree old_block
= TREE_BLOCK (*tp
);
1028 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1032 TREE_SET_BLOCK (*tp
, new_block
);
1035 /* Keep iterating. */
1040 /* Called from copy_body_id via walk_tree. DATA is really a
1041 `copy_body_data *'. */
1044 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1046 copy_body_data
*id
= (copy_body_data
*) data
;
1047 tree fn
= id
->src_fn
;
1050 /* Begin by recognizing trees that we'll completely rewrite for the
1051 inlining context. Our output for these trees is completely
1052 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1053 into an edge). Further down, we'll handle trees that get
1054 duplicated and/or tweaked. */
1056 /* When requested, RETURN_EXPRs should be transformed to just the
1057 contained MODIFY_EXPR. The branch semantics of the return will
1058 be handled elsewhere by manipulating the CFG rather than a statement. */
1059 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1061 tree assignment
= TREE_OPERAND (*tp
, 0);
1063 /* If we're returning something, just turn that into an
1064 assignment into the equivalent of the original RESULT_DECL.
1065 If the "assignment" is just the result decl, the result
1066 decl has already been set (e.g. a recent "foo (&result_decl,
1067 ...)"); just toss the entire RETURN_EXPR. */
1068 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1070 /* Replace the RETURN_EXPR with (a copy of) the
1071 MODIFY_EXPR hanging underneath. */
1072 *tp
= copy_node (assignment
);
1074 else /* Else the RETURN_EXPR returns no value. */
1077 return (tree
) (void *)1;
1080 else if (TREE_CODE (*tp
) == SSA_NAME
)
1082 *tp
= remap_ssa_name (*tp
, id
);
1087 /* Local variables and labels need to be replaced by equivalent
1088 variables. We don't want to copy static variables; there's only
1089 one of those, no matter how many times we inline the containing
1090 function. Similarly for globals from an outer function. */
1091 else if (auto_var_in_fn_p (*tp
, fn
))
1095 /* Remap the declaration. */
1096 new_decl
= remap_decl (*tp
, id
);
1097 gcc_assert (new_decl
);
1098 /* Replace this variable with the copy. */
1099 STRIP_TYPE_NOPS (new_decl
);
1103 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1104 copy_statement_list (tp
);
1105 else if (TREE_CODE (*tp
) == SAVE_EXPR
1106 || TREE_CODE (*tp
) == TARGET_EXPR
)
1107 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1108 else if (TREE_CODE (*tp
) == LABEL_DECL
1109 && (! DECL_CONTEXT (*tp
)
1110 || decl_function_context (*tp
) == id
->src_fn
))
1111 /* These may need to be remapped for EH handling. */
1112 *tp
= remap_decl (*tp
, id
);
1113 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1114 copy_bind_expr (tp
, walk_subtrees
, id
);
1115 /* Types may need remapping as well. */
1116 else if (TYPE_P (*tp
))
1117 *tp
= remap_type (*tp
, id
);
1119 /* If this is a constant, we have to copy the node iff the type will be
1120 remapped. copy_tree_r will not copy a constant. */
1121 else if (CONSTANT_CLASS_P (*tp
))
1123 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1125 if (new_type
== TREE_TYPE (*tp
))
1128 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1129 *tp
= wide_int_to_tree (new_type
, *tp
);
1132 *tp
= copy_node (*tp
);
1133 TREE_TYPE (*tp
) = new_type
;
1137 /* Otherwise, just copy the node. Note that copy_tree_r already
1138 knows not to copy VAR_DECLs, etc., so this is safe. */
1141 /* Here we handle trees that are not completely rewritten.
1142 First we detect some inlining-induced bogosities for
1144 if (TREE_CODE (*tp
) == MODIFY_EXPR
1145 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1146 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1148 /* Some assignments VAR = VAR; don't generate any rtl code
1149 and thus don't count as variable modification. Avoid
1150 keeping bogosities like 0 = 0. */
1151 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1154 n
= id
->decl_map
->get (decl
);
1158 STRIP_TYPE_NOPS (value
);
1159 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1161 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1162 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1166 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1168 /* Get rid of *& from inline substitutions that can happen when a
1169 pointer argument is an ADDR_EXPR. */
1170 tree decl
= TREE_OPERAND (*tp
, 0);
1171 tree
*n
= id
->decl_map
->get (decl
);
1174 /* If we happen to get an ADDR_EXPR in n->value, strip
1175 it manually here as we'll eventually get ADDR_EXPRs
1176 which lie about their types pointed to. In this case
1177 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1178 but we absolutely rely on that. As fold_indirect_ref
1179 does other useful transformations, try that first, though. */
1180 tree type
= TREE_TYPE (*tp
);
1181 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1183 *tp
= gimple_fold_indirect_ref (ptr
);
1186 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1189 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1190 /* ??? We should either assert here or build
1191 a VIEW_CONVERT_EXPR instead of blindly leaking
1192 incompatible types to our IL. */
1194 *tp
= TREE_OPERAND (ptr
, 0);
1198 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1199 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1200 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1201 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1202 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1203 have remapped a parameter as the property might be
1204 valid only for the parameter itself. */
1205 if (TREE_THIS_NOTRAP (old
)
1206 && (!is_parm (TREE_OPERAND (old
, 0))
1207 || (!id
->transform_parameter
&& is_parm (ptr
))))
1208 TREE_THIS_NOTRAP (*tp
) = 1;
1215 else if (TREE_CODE (*tp
) == MEM_REF
)
1217 /* We need to re-canonicalize MEM_REFs from inline substitutions
1218 that can happen when a pointer argument is an ADDR_EXPR.
1219 Recurse here manually to allow that. */
1220 tree ptr
= TREE_OPERAND (*tp
, 0);
1221 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1223 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1224 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1225 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1226 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1227 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1228 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1230 MR_DEPENDENCE_CLIQUE (*tp
)
1231 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1232 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1234 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1235 remapped a parameter as the property might be valid only
1236 for the parameter itself. */
1237 if (TREE_THIS_NOTRAP (old
)
1238 && (!is_parm (TREE_OPERAND (old
, 0))
1239 || (!id
->transform_parameter
&& is_parm (ptr
))))
1240 TREE_THIS_NOTRAP (*tp
) = 1;
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
)
1287 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1289 recompute_tree_invariant_for_addr_expr (*tp
);
1291 /* If this used to be invariant, but is not any longer,
1292 then regimplification is probably needed. */
1293 if (invariant
&& !is_gimple_min_invariant (*tp
))
1294 id
->regimplify
= true;
1300 /* Keep iterating. */
1304 /* Helper for remap_gimple_stmt. Given an EH region number for the
1305 source function, map that to the duplicate EH region number in
1306 the destination function. */
1309 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1311 eh_region old_r
, new_r
;
1313 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1314 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1316 return new_r
->index
;
1319 /* Similar, but operate on INTEGER_CSTs. */
1322 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1326 old_nr
= tree_to_shwi (old_t_nr
);
1327 new_nr
= remap_eh_region_nr (old_nr
, id
);
1329 return build_int_cst (integer_type_node
, new_nr
);
1332 /* Helper for copy_bb. Remap statement STMT using the inlining
1333 information in ID. Return the new statement copy. */
1336 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1339 struct walk_stmt_info wi
;
1340 bool skip_first
= false;
1341 gimple_seq stmts
= NULL
;
1343 if (is_gimple_debug (stmt
)
1344 && !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
1347 /* Begin by recognizing trees that we'll completely rewrite for the
1348 inlining context. Our output for these trees is completely
1349 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1350 into an edge). Further down, we'll handle trees that get
1351 duplicated and/or tweaked. */
1353 /* When requested, GIMPLE_RETURNs should be transformed to just the
1354 contained GIMPLE_ASSIGN. The branch semantics of the return will
1355 be handled elsewhere by manipulating the CFG rather than the
1357 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1359 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1360 tree retbnd
= gimple_return_retbnd (stmt
);
1361 tree bndslot
= id
->retbnd
;
1363 if (retbnd
&& bndslot
)
1365 gimple bndcopy
= gimple_build_assign (bndslot
, retbnd
);
1366 memset (&wi
, 0, sizeof (wi
));
1368 walk_gimple_op (bndcopy
, remap_gimple_op_r
, &wi
);
1369 gimple_seq_add_stmt (&stmts
, bndcopy
);
1372 /* If we're returning something, just turn that into an
1373 assignment into the equivalent of the original RESULT_DECL.
1374 If RETVAL is just the result decl, the result decl has
1375 already been set (e.g. a recent "foo (&result_decl, ...)");
1376 just toss the entire GIMPLE_RETURN. */
1378 && (TREE_CODE (retval
) != RESULT_DECL
1379 && (TREE_CODE (retval
) != SSA_NAME
1380 || ! SSA_NAME_VAR (retval
)
1381 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1383 copy
= gimple_build_assign (id
->do_not_unshare
1384 ? id
->retvar
: unshare_expr (id
->retvar
),
1386 /* id->retvar is already substituted. Skip it on later remapping. */
1389 /* We need to copy bounds if return structure with pointers into
1390 instrumented function. */
1391 if (chkp_function_instrumented_p (id
->dst_fn
)
1393 && !BOUNDED_P (id
->retvar
)
1394 && chkp_type_has_pointer (TREE_TYPE (id
->retvar
)))
1395 id
->assign_stmts
.safe_push (copy
);
1401 else if (gimple_has_substatements (stmt
))
1405 /* When cloning bodies from the C++ front end, we will be handed bodies
1406 in High GIMPLE form. Handle here all the High GIMPLE statements that
1407 have embedded statements. */
1408 switch (gimple_code (stmt
))
1411 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1416 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1417 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1418 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1422 case GIMPLE_EH_FILTER
:
1423 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1424 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1428 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1429 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1430 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1433 case GIMPLE_WITH_CLEANUP_EXPR
:
1434 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1435 copy
= gimple_build_wce (s1
);
1438 case GIMPLE_OMP_PARALLEL
:
1440 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1441 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1442 copy
= gimple_build_omp_parallel
1444 gimple_omp_parallel_clauses (omp_par_stmt
),
1445 gimple_omp_parallel_child_fn (omp_par_stmt
),
1446 gimple_omp_parallel_data_arg (omp_par_stmt
));
1450 case GIMPLE_OMP_TASK
:
1451 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1452 copy
= gimple_build_omp_task
1454 gimple_omp_task_clauses (stmt
),
1455 gimple_omp_task_child_fn (stmt
),
1456 gimple_omp_task_data_arg (stmt
),
1457 gimple_omp_task_copy_fn (stmt
),
1458 gimple_omp_task_arg_size (stmt
),
1459 gimple_omp_task_arg_align (stmt
));
1462 case GIMPLE_OMP_FOR
:
1463 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1464 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1465 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1466 gimple_omp_for_clauses (stmt
),
1467 gimple_omp_for_collapse (stmt
), s2
);
1470 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1472 gimple_omp_for_set_index (copy
, i
,
1473 gimple_omp_for_index (stmt
, i
));
1474 gimple_omp_for_set_initial (copy
, i
,
1475 gimple_omp_for_initial (stmt
, i
));
1476 gimple_omp_for_set_final (copy
, i
,
1477 gimple_omp_for_final (stmt
, i
));
1478 gimple_omp_for_set_incr (copy
, i
,
1479 gimple_omp_for_incr (stmt
, i
));
1480 gimple_omp_for_set_cond (copy
, i
,
1481 gimple_omp_for_cond (stmt
, i
));
1486 case GIMPLE_OMP_MASTER
:
1487 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1488 copy
= gimple_build_omp_master (s1
);
1491 case GIMPLE_OMP_TASKGROUP
:
1492 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1493 copy
= gimple_build_omp_taskgroup (s1
);
1496 case GIMPLE_OMP_ORDERED
:
1497 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1498 copy
= gimple_build_omp_ordered (s1
);
1501 case GIMPLE_OMP_SECTION
:
1502 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1503 copy
= gimple_build_omp_section (s1
);
1506 case GIMPLE_OMP_SECTIONS
:
1507 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1508 copy
= gimple_build_omp_sections
1509 (s1
, gimple_omp_sections_clauses (stmt
));
1512 case GIMPLE_OMP_SINGLE
:
1513 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1514 copy
= gimple_build_omp_single
1515 (s1
, gimple_omp_single_clauses (stmt
));
1518 case GIMPLE_OMP_TARGET
:
1519 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1520 copy
= gimple_build_omp_target
1521 (s1
, gimple_omp_target_kind (stmt
),
1522 gimple_omp_target_clauses (stmt
));
1525 case GIMPLE_OMP_TEAMS
:
1526 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1527 copy
= gimple_build_omp_teams
1528 (s1
, gimple_omp_teams_clauses (stmt
));
1531 case GIMPLE_OMP_CRITICAL
:
1532 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1533 copy
= gimple_build_omp_critical (s1
,
1534 gimple_omp_critical_name (
1535 as_a
<gomp_critical
*> (stmt
)));
1538 case GIMPLE_TRANSACTION
:
1540 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1541 gtransaction
*new_trans_stmt
;
1542 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1544 copy
= new_trans_stmt
1545 = gimple_build_transaction (
1547 gimple_transaction_label (old_trans_stmt
));
1548 gimple_transaction_set_subcode (
1550 gimple_transaction_subcode (old_trans_stmt
));
1560 if (gimple_assign_copy_p (stmt
)
1561 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1562 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1564 /* Here we handle statements that are not completely rewritten.
1565 First we detect some inlining-induced bogosities for
1568 /* Some assignments VAR = VAR; don't generate any rtl code
1569 and thus don't count as variable modification. Avoid
1570 keeping bogosities like 0 = 0. */
1571 tree decl
= gimple_assign_lhs (stmt
), value
;
1574 n
= id
->decl_map
->get (decl
);
1578 STRIP_TYPE_NOPS (value
);
1579 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1584 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1585 in a block that we aren't copying during tree_function_versioning,
1586 just drop the clobber stmt. */
1587 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1589 tree lhs
= gimple_assign_lhs (stmt
);
1590 if (TREE_CODE (lhs
) == MEM_REF
1591 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1593 gimple def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1594 if (gimple_bb (def_stmt
)
1595 && !bitmap_bit_p (id
->blocks_to_copy
,
1596 gimple_bb (def_stmt
)->index
))
1601 if (gimple_debug_bind_p (stmt
))
1604 = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1605 gimple_debug_bind_get_value (stmt
),
1607 id
->debug_stmts
.safe_push (copy
);
1608 gimple_seq_add_stmt (&stmts
, copy
);
1611 if (gimple_debug_source_bind_p (stmt
))
1613 gdebug
*copy
= gimple_build_debug_source_bind
1614 (gimple_debug_source_bind_get_var (stmt
),
1615 gimple_debug_source_bind_get_value (stmt
),
1617 id
->debug_stmts
.safe_push (copy
);
1618 gimple_seq_add_stmt (&stmts
, copy
);
1622 /* Create a new deep copy of the statement. */
1623 copy
= gimple_copy (stmt
);
1625 /* Clear flags that need revisiting. */
1626 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1628 if (gimple_call_tail_p (call_stmt
))
1629 gimple_call_set_tail (call_stmt
, false);
1630 if (gimple_call_from_thunk_p (call_stmt
))
1631 gimple_call_set_from_thunk (call_stmt
, false);
1634 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1635 RESX and EH_DISPATCH. */
1637 switch (gimple_code (copy
))
1641 tree r
, fndecl
= gimple_call_fndecl (copy
);
1642 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1643 switch (DECL_FUNCTION_CODE (fndecl
))
1645 case BUILT_IN_EH_COPY_VALUES
:
1646 r
= gimple_call_arg (copy
, 1);
1647 r
= remap_eh_region_tree_nr (r
, id
);
1648 gimple_call_set_arg (copy
, 1, r
);
1651 case BUILT_IN_EH_POINTER
:
1652 case BUILT_IN_EH_FILTER
:
1653 r
= gimple_call_arg (copy
, 0);
1654 r
= remap_eh_region_tree_nr (r
, id
);
1655 gimple_call_set_arg (copy
, 0, r
);
1662 /* Reset alias info if we didn't apply measures to
1663 keep it valid over inlining by setting DECL_PT_UID. */
1664 if (!id
->src_cfun
->gimple_df
1665 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1666 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1672 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1673 int r
= gimple_resx_region (resx_stmt
);
1674 r
= remap_eh_region_nr (r
, id
);
1675 gimple_resx_set_region (resx_stmt
, r
);
1679 case GIMPLE_EH_DISPATCH
:
1681 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1682 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1683 r
= remap_eh_region_nr (r
, id
);
1684 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1693 /* If STMT has a block defined, map it to the newly constructed
1695 if (gimple_block (copy
))
1698 n
= id
->decl_map
->get (gimple_block (copy
));
1700 gimple_set_block (copy
, *n
);
1703 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1705 gimple_seq_add_stmt (&stmts
, copy
);
1709 /* Remap all the operands in COPY. */
1710 memset (&wi
, 0, sizeof (wi
));
1713 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1715 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1717 /* Clear the copied virtual operands. We are not remapping them here
1718 but are going to recreate them from scratch. */
1719 if (gimple_has_mem_ops (copy
))
1721 gimple_set_vdef (copy
, NULL_TREE
);
1722 gimple_set_vuse (copy
, NULL_TREE
);
1725 gimple_seq_add_stmt (&stmts
, copy
);
1730 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1734 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1735 gcov_type count_scale
)
1737 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1738 basic_block copy_basic_block
;
1743 /* Search for previous copied basic block. */
1746 prev
= prev
->prev_bb
;
1748 /* create_basic_block() will append every new block to
1749 basic_block_info automatically. */
1750 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
1751 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1753 /* We are going to rebuild frequencies from scratch. These values
1754 have just small importance to drive canonicalize_loop_headers. */
1755 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1757 /* We recompute frequencies after inlining, so this is quite safe. */
1758 if (freq
> BB_FREQ_MAX
)
1760 copy_basic_block
->frequency
= freq
;
1762 copy_gsi
= gsi_start_bb (copy_basic_block
);
1764 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1767 gimple stmt
= gsi_stmt (gsi
);
1768 gimple orig_stmt
= stmt
;
1769 gimple_stmt_iterator stmts_gsi
;
1770 bool stmt_added
= false;
1772 id
->regimplify
= false;
1773 stmts
= remap_gimple_stmt (stmt
, id
);
1775 if (gimple_seq_empty_p (stmts
))
1780 for (stmts_gsi
= gsi_start (stmts
);
1781 !gsi_end_p (stmts_gsi
); )
1783 stmt
= gsi_stmt (stmts_gsi
);
1785 /* Advance iterator now before stmt is moved to seq_gsi. */
1786 gsi_next (&stmts_gsi
);
1788 if (gimple_nop_p (stmt
))
1791 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
1794 /* With return slot optimization we can end up with
1795 non-gimple (foo *)&this->m, fix that here. */
1796 if (is_gimple_assign (stmt
)
1797 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
1798 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1801 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1802 gimple_assign_rhs1 (stmt
),
1804 GSI_CONTINUE_LINKING
);
1805 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1806 id
->regimplify
= false;
1809 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1812 gimple_regimplify_operands (stmt
, &seq_gsi
);
1820 /* If copy_basic_block has been empty at the start of this iteration,
1821 call gsi_start_bb again to get at the newly added statements. */
1822 if (gsi_end_p (copy_gsi
))
1823 copy_gsi
= gsi_start_bb (copy_basic_block
);
1825 gsi_next (©_gsi
);
1827 /* Process the new statement. The call to gimple_regimplify_operands
1828 possibly turned the statement into multiple statements, we
1829 need to process all of them. */
1835 stmt
= gsi_stmt (copy_gsi
);
1836 call_stmt
= dyn_cast
<gcall
*> (stmt
);
1838 && gimple_call_va_arg_pack_p (call_stmt
)
1841 /* __builtin_va_arg_pack () should be replaced by
1842 all arguments corresponding to ... in the caller. */
1846 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
1847 size_t n
, i
, nargs_to_copy
;
1848 bool remove_bounds
= false;
1850 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1853 /* Bounds should be removed from arg pack in case
1854 we handle not instrumented call in instrumented
1856 nargs_to_copy
= nargs
;
1857 if (gimple_call_with_bounds_p (id
->call_stmt
)
1858 && !gimple_call_with_bounds_p (stmt
))
1860 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1861 i
< gimple_call_num_args (id
->call_stmt
);
1863 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1865 remove_bounds
= true;
1868 /* Create the new array of arguments. */
1869 n
= nargs_to_copy
+ gimple_call_num_args (call_stmt
);
1870 argarray
.create (n
);
1871 argarray
.safe_grow_cleared (n
);
1873 /* Copy all the arguments before '...' */
1874 memcpy (argarray
.address (),
1875 gimple_call_arg_ptr (call_stmt
, 0),
1876 gimple_call_num_args (call_stmt
) * sizeof (tree
));
1880 /* Append the rest of arguments removing bounds. */
1881 unsigned cur
= gimple_call_num_args (call_stmt
);
1882 i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1883 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1884 i
< gimple_call_num_args (id
->call_stmt
);
1886 if (!POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1887 argarray
[cur
++] = gimple_call_arg (id
->call_stmt
, i
);
1888 gcc_assert (cur
== n
);
1892 /* Append the arguments passed in '...' */
1893 memcpy (argarray
.address () + gimple_call_num_args (call_stmt
),
1894 gimple_call_arg_ptr (id
->call_stmt
, 0)
1895 + (gimple_call_num_args (id
->call_stmt
) - nargs
),
1896 nargs
* sizeof (tree
));
1899 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
1902 argarray
.release ();
1904 /* Copy all GIMPLE_CALL flags, location and block, except
1905 GF_CALL_VA_ARG_PACK. */
1906 gimple_call_copy_flags (new_call
, call_stmt
);
1907 gimple_call_set_va_arg_pack (new_call
, false);
1908 gimple_set_location (new_call
, gimple_location (stmt
));
1909 gimple_set_block (new_call
, gimple_block (stmt
));
1910 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
1912 gsi_replace (©_gsi
, new_call
, false);
1917 && (decl
= gimple_call_fndecl (stmt
))
1918 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1919 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1921 /* __builtin_va_arg_pack_len () should be replaced by
1922 the number of anonymous arguments. */
1923 size_t nargs
= gimple_call_num_args (id
->call_stmt
), i
;
1927 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1930 /* For instrumented calls we should ignore bounds. */
1931 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1932 i
< gimple_call_num_args (id
->call_stmt
);
1934 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1937 count
= build_int_cst (integer_type_node
, nargs
);
1938 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1939 gsi_replace (©_gsi
, new_stmt
, false);
1944 && gimple_call_internal_p (stmt
)
1945 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
1947 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
1948 gsi_remove (©_gsi
, false);
1952 /* Statements produced by inlining can be unfolded, especially
1953 when we constant propagated some operands. We can't fold
1954 them right now for two reasons:
1955 1) folding require SSA_NAME_DEF_STMTs to be correct
1956 2) we can't change function calls to builtins.
1957 So we just mark statement for later folding. We mark
1958 all new statements, instead just statements that has changed
1959 by some nontrivial substitution so even statements made
1960 foldable indirectly are updated. If this turns out to be
1961 expensive, copy_body can be told to watch for nontrivial
1963 if (id
->statements_to_fold
)
1964 id
->statements_to_fold
->add (stmt
);
1966 /* We're duplicating a CALL_EXPR. Find any corresponding
1967 callgraph edges and update or duplicate them. */
1968 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
1970 struct cgraph_edge
*edge
;
1972 switch (id
->transform_call_graph_edges
)
1974 case CB_CGE_DUPLICATE
:
1975 edge
= id
->src_node
->get_edge (orig_stmt
);
1978 int edge_freq
= edge
->frequency
;
1980 struct cgraph_edge
*old_edge
= edge
;
1981 edge
= edge
->clone (id
->dst_node
, call_stmt
,
1983 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1985 /* We could also just rescale the frequency, but
1986 doing so would introduce roundoff errors and make
1987 verifier unhappy. */
1988 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1991 /* Speculative calls consist of two edges - direct and indirect.
1992 Duplicate the whole thing and distribute frequencies accordingly. */
1993 if (edge
->speculative
)
1995 struct cgraph_edge
*direct
, *indirect
;
1996 struct ipa_ref
*ref
;
1998 gcc_assert (!edge
->indirect_unknown_callee
);
1999 old_edge
->speculative_call_info (direct
, indirect
, ref
);
2000 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2002 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
2004 if (old_edge
->frequency
+ indirect
->frequency
)
2006 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
2007 (old_edge
->frequency
+ indirect
->frequency
)),
2009 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
2010 (old_edge
->frequency
+ indirect
->frequency
)),
2013 id
->dst_node
->clone_reference (ref
, stmt
);
2017 edge
->frequency
= new_freq
;
2019 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
2020 && (edge_freq
> edge
->frequency
+ 10
2021 || edge_freq
< edge
->frequency
- 10))
2023 fprintf (dump_file
, "Edge frequency estimated by "
2024 "cgraph %i diverge from inliner's estimate %i\n",
2028 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
2031 copy_basic_block
->frequency
);
2037 case CB_CGE_MOVE_CLONES
:
2038 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2040 edge
= id
->dst_node
->get_edge (stmt
);
2044 edge
= id
->dst_node
->get_edge (orig_stmt
);
2046 edge
->set_call_stmt (call_stmt
);
2053 /* Constant propagation on argument done during inlining
2054 may create new direct call. Produce an edge for it. */
2056 || (edge
->indirect_inlining_edge
2057 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2058 && id
->dst_node
->definition
2059 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2061 struct cgraph_node
*dest
= cgraph_node::get (fn
);
2063 /* We have missing edge in the callgraph. This can happen
2064 when previous inlining turned an indirect call into a
2065 direct call by constant propagating arguments or we are
2066 producing dead clone (for further cloning). In all
2067 other cases we hit a bug (incorrect node sharing is the
2068 most common reason for missing edges). */
2069 gcc_assert (!dest
->definition
2070 || dest
->address_taken
2071 || !id
->src_node
->definition
2072 || !id
->dst_node
->definition
);
2073 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2074 id
->dst_node
->create_edge_including_clones
2075 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2076 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
2078 CIF_ORIGINALLY_INDIRECT_CALL
);
2080 id
->dst_node
->create_edge (dest
, call_stmt
,
2082 compute_call_stmt_bb_frequency
2083 (id
->dst_node
->decl
,
2084 copy_basic_block
))->inline_failed
2085 = CIF_ORIGINALLY_INDIRECT_CALL
;
2088 fprintf (dump_file
, "Created new direct edge to %s\n",
2093 notice_special_calls (as_a
<gcall
*> (stmt
));
2096 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2097 id
->eh_map
, id
->eh_lp_nr
);
2099 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
2104 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
2105 if (TREE_CODE (def
) == SSA_NAME
)
2106 SSA_NAME_DEF_STMT (def
) = stmt
;
2109 gsi_next (©_gsi
);
2111 while (!gsi_end_p (copy_gsi
));
2113 copy_gsi
= gsi_last_bb (copy_basic_block
);
2116 return copy_basic_block
;
2119 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2120 form is quite easy, since dominator relationship for old basic blocks does
2123 There is however exception where inlining might change dominator relation
2124 across EH edges from basic block within inlined functions destinating
2125 to landing pads in function we inline into.
2127 The function fills in PHI_RESULTs of such PHI nodes if they refer
2128 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2129 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2130 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2131 set, and this means that there will be no overlapping live ranges
2132 for the underlying symbol.
2134 This might change in future if we allow redirecting of EH edges and
2135 we might want to change way build CFG pre-inlining to include
2136 all the possible edges then. */
2138 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2139 bool can_throw
, bool nonlocal_goto
)
2144 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2146 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2152 gcc_assert (e
->flags
& EDGE_EH
);
2155 gcc_assert (!(e
->flags
& EDGE_EH
));
2157 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2163 /* For abnormal goto/call edges the receiver can be the
2164 ENTRY_BLOCK. Do not assert this cannot happen. */
2166 gcc_assert ((e
->flags
& EDGE_EH
)
2167 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2169 re
= find_edge (ret_bb
, e
->dest
);
2170 gcc_checking_assert (re
);
2171 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2172 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2174 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2175 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2181 /* Copy edges from BB into its copy constructed earlier, scale profile
2182 accordingly. Edges will be taken care of later. Assume aux
2183 pointers to point to the copies of each BB. Return true if any
2184 debug stmts are left after a statement that must end the basic block. */
2187 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
2188 basic_block abnormal_goto_dest
)
2190 basic_block new_bb
= (basic_block
) bb
->aux
;
2193 gimple_stmt_iterator si
;
2195 bool need_debug_cleanup
= false;
2197 /* Use the indices from the original blocks to create edges for the
2199 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2200 if (!(old_edge
->flags
& EDGE_EH
))
2204 flags
= old_edge
->flags
;
2206 /* Return edges do get a FALLTHRU flag when the get inlined. */
2207 if (old_edge
->dest
->index
== EXIT_BLOCK
2208 && !(old_edge
->flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2209 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2210 flags
|= EDGE_FALLTHRU
;
2211 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2212 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
2213 new_edge
->probability
= old_edge
->probability
;
2216 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2219 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2222 bool can_throw
, nonlocal_goto
;
2224 copy_stmt
= gsi_stmt (si
);
2225 if (!is_gimple_debug (copy_stmt
))
2226 update_stmt (copy_stmt
);
2228 /* Do this before the possible split_block. */
2231 /* If this tree could throw an exception, there are two
2232 cases where we need to add abnormal edge(s): the
2233 tree wasn't in a region and there is a "current
2234 region" in the caller; or the original tree had
2235 EH edges. In both cases split the block after the tree,
2236 and add abnormal edge(s) as needed; we need both
2237 those from the callee and the caller.
2238 We check whether the copy can throw, because the const
2239 propagation can change an INDIRECT_REF which throws
2240 into a COMPONENT_REF which doesn't. If the copy
2241 can throw, the original could also throw. */
2242 can_throw
= stmt_can_throw_internal (copy_stmt
);
2244 = (stmt_can_make_abnormal_goto (copy_stmt
)
2245 && !computed_goto_p (copy_stmt
));
2247 if (can_throw
|| nonlocal_goto
)
2249 if (!gsi_end_p (si
))
2251 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2254 need_debug_cleanup
= true;
2256 if (!gsi_end_p (si
))
2257 /* Note that bb's predecessor edges aren't necessarily
2258 right at this point; split_block doesn't care. */
2260 edge e
= split_block (new_bb
, copy_stmt
);
2263 new_bb
->aux
= e
->src
->aux
;
2264 si
= gsi_start_bb (new_bb
);
2268 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2269 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2271 make_eh_edges (copy_stmt
);
2273 /* If the call we inline cannot make abnormal goto do not add
2274 additional abnormal edges but only retain those already present
2275 in the original function body. */
2276 if (abnormal_goto_dest
== NULL
)
2277 nonlocal_goto
= false;
2280 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2282 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2283 nonlocal_goto
= false;
2284 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2285 in OpenMP regions which aren't allowed to be left abnormally.
2286 So, no need to add abnormal edge in that case. */
2287 else if (is_gimple_call (copy_stmt
)
2288 && gimple_call_internal_p (copy_stmt
)
2289 && (gimple_call_internal_fn (copy_stmt
)
2290 == IFN_ABNORMAL_DISPATCHER
)
2291 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2292 nonlocal_goto
= false;
2294 make_edge (copy_stmt_bb
, abnormal_goto_dest
, EDGE_ABNORMAL
);
2297 if ((can_throw
|| nonlocal_goto
)
2298 && gimple_in_ssa_p (cfun
))
2299 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2300 can_throw
, nonlocal_goto
);
2302 return need_debug_cleanup
;
2305 /* Copy the PHIs. All blocks and edges are copied, some blocks
2306 was possibly split and new outgoing EH edges inserted.
2307 BB points to the block of original function and AUX pointers links
2308 the original and newly copied blocks. */
2311 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2313 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2318 bool inserted
= false;
2320 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2326 res
= PHI_RESULT (phi
);
2328 if (!virtual_operand_p (res
))
2330 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2331 new_phi
= create_phi_node (new_res
, new_bb
);
2332 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2334 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2340 /* When doing partial cloning, we allow PHIs on the entry block
2341 as long as all the arguments are the same. Find any input
2342 edge to see argument to copy. */
2344 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2345 if (!old_edge
->src
->aux
)
2348 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2350 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2351 gcc_assert (new_arg
);
2352 /* With return slot optimization we can end up with
2353 non-gimple (foo *)&this->m, fix that here. */
2354 if (TREE_CODE (new_arg
) != SSA_NAME
2355 && TREE_CODE (new_arg
) != FUNCTION_DECL
2356 && !is_gimple_val (new_arg
))
2358 gimple_seq stmts
= NULL
;
2359 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2360 gsi_insert_seq_on_edge (new_edge
, stmts
);
2363 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2364 if (LOCATION_BLOCK (locus
))
2367 n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
2370 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2372 locus
= LOCATION_LOCUS (locus
);
2375 locus
= LOCATION_LOCUS (locus
);
2377 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2382 /* Commit the delayed edge insertions. */
2384 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2385 gsi_commit_one_edge_insert (new_edge
, NULL
);
2389 /* Wrapper for remap_decl so it can be used as a callback. */
2392 remap_decl_1 (tree decl
, void *data
)
2394 return remap_decl (decl
, (copy_body_data
*) data
);
2397 /* Build struct function and associated datastructures for the new clone
2398 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2399 the cfun to the function of new_fndecl (and current_function_decl too). */
2402 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2404 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2405 gcov_type count_scale
;
2407 if (!DECL_ARGUMENTS (new_fndecl
))
2408 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2409 if (!DECL_RESULT (new_fndecl
))
2410 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2412 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2414 = GCOV_COMPUTE_SCALE (count
,
2415 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2417 count_scale
= REG_BR_PROB_BASE
;
2419 /* Register specific tree functions. */
2420 gimple_register_cfg_hooks ();
2422 /* Get clean struct function. */
2423 push_struct_function (new_fndecl
);
2425 /* We will rebuild these, so just sanity check that they are empty. */
2426 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2427 gcc_assert (cfun
->local_decls
== NULL
);
2428 gcc_assert (cfun
->cfg
== NULL
);
2429 gcc_assert (cfun
->decl
== new_fndecl
);
2431 /* Copy items we preserve during cloning. */
2432 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2433 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2434 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2435 cfun
->curr_properties
= src_cfun
->curr_properties
;
2436 cfun
->last_verified
= src_cfun
->last_verified
;
2437 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2438 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2439 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2440 cfun
->stdarg
= src_cfun
->stdarg
;
2441 cfun
->after_inlining
= src_cfun
->after_inlining
;
2442 cfun
->can_throw_non_call_exceptions
2443 = src_cfun
->can_throw_non_call_exceptions
;
2444 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2445 cfun
->returns_struct
= src_cfun
->returns_struct
;
2446 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2448 init_empty_tree_cfg ();
2450 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2451 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2452 (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2454 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2455 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2456 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2457 (EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2459 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2460 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2462 init_eh_for_function ();
2464 if (src_cfun
->gimple_df
)
2466 init_tree_ssa (cfun
);
2467 cfun
->gimple_df
->in_ssa_p
= true;
2468 init_ssa_operands (cfun
);
2472 /* Helper function for copy_cfg_body. Move debug stmts from the end
2473 of NEW_BB to the beginning of successor basic blocks when needed. If the
2474 successor has multiple predecessors, reset them, otherwise keep
2478 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2482 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2485 || gsi_one_before_end_p (si
)
2486 || !(stmt_can_throw_internal (gsi_stmt (si
))
2487 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2490 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2492 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2493 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2494 while (is_gimple_debug (gsi_stmt (ssi
)))
2496 gimple stmt
= gsi_stmt (ssi
);
2501 /* For the last edge move the debug stmts instead of copying
2503 if (ei_one_before_end_p (ei
))
2507 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2508 gimple_debug_bind_reset_value (stmt
);
2509 gsi_remove (&si
, false);
2510 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2514 if (gimple_debug_bind_p (stmt
))
2516 var
= gimple_debug_bind_get_var (stmt
);
2517 if (single_pred_p (e
->dest
))
2519 value
= gimple_debug_bind_get_value (stmt
);
2520 value
= unshare_expr (value
);
2524 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2526 else if (gimple_debug_source_bind_p (stmt
))
2528 var
= gimple_debug_source_bind_get_var (stmt
);
2529 value
= gimple_debug_source_bind_get_value (stmt
);
2530 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2534 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2535 id
->debug_stmts
.safe_push (new_stmt
);
2541 /* Make a copy of the sub-loops of SRC_PARENT and place them
2542 as siblings of DEST_PARENT. */
2545 copy_loops (copy_body_data
*id
,
2546 struct loop
*dest_parent
, struct loop
*src_parent
)
2548 struct loop
*src_loop
= src_parent
->inner
;
2551 if (!id
->blocks_to_copy
2552 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2554 struct loop
*dest_loop
= alloc_loop ();
2556 /* Assign the new loop its header and latch and associate
2557 those with the new loop. */
2558 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2559 dest_loop
->header
->loop_father
= dest_loop
;
2560 if (src_loop
->latch
!= NULL
)
2562 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2563 dest_loop
->latch
->loop_father
= dest_loop
;
2566 /* Copy loop meta-data. */
2567 copy_loop_info (src_loop
, dest_loop
);
2569 /* Finally place it into the loop array and the loop tree. */
2570 place_new_loop (cfun
, dest_loop
);
2571 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2573 dest_loop
->safelen
= src_loop
->safelen
;
2574 dest_loop
->dont_vectorize
= src_loop
->dont_vectorize
;
2575 if (src_loop
->force_vectorize
)
2577 dest_loop
->force_vectorize
= true;
2578 cfun
->has_force_vectorize_loops
= true;
2580 if (src_loop
->simduid
)
2582 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2583 cfun
->has_simduid_loops
= true;
2587 copy_loops (id
, dest_loop
, src_loop
);
2589 src_loop
= src_loop
->next
;
2593 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2596 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2598 gimple_stmt_iterator si
;
2599 gimple last
= last_stmt (bb
);
2600 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2602 gimple stmt
= gsi_stmt (si
);
2603 if (is_gimple_call (stmt
))
2605 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2608 edge
->redirect_call_stmt_to_callee ();
2609 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
2610 gimple_purge_dead_eh_edges (bb
);
2616 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2617 with each bb's frequency. Used when NODE has a 0-weight entry
2618 but we are about to inline it into a non-zero count call bb.
2619 See the comments for handle_missing_profiles() in predict.c for
2620 when this can happen for COMDATs. */
2623 freqs_to_counts (struct cgraph_node
*node
, gcov_type count
)
2628 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2630 FOR_ALL_BB_FN(bb
, fn
)
2632 bb
->count
= apply_scale (count
,
2633 GCOV_COMPUTE_SCALE (bb
->frequency
, BB_FREQ_MAX
));
2634 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2635 e
->count
= apply_probability (e
->src
->count
, e
->probability
);
2639 /* Make a copy of the body of FN so that it can be inserted inline in
2640 another function. Walks FN via CFG, returns new fndecl. */
2643 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2644 basic_block entry_block_map
, basic_block exit_block_map
,
2645 basic_block new_entry
)
2647 tree callee_fndecl
= id
->src_fn
;
2648 /* Original cfun for the callee, doesn't change. */
2649 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2650 struct function
*cfun_to_copy
;
2652 tree new_fndecl
= NULL
;
2653 bool need_debug_cleanup
= false;
2654 gcov_type count_scale
;
2656 int incoming_frequency
= 0;
2657 gcov_type incoming_count
= 0;
2659 /* This can happen for COMDAT routines that end up with 0 counts
2660 despite being called (see the comments for handle_missing_profiles()
2661 in predict.c as to why). Apply counts to the blocks in the callee
2662 before inlining, using the guessed edge frequencies, so that we don't
2663 end up with a 0-count inline body which can confuse downstream
2664 optimizations such as function splitting. */
2665 if (!ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
&& count
)
2667 /* Apply the larger of the call bb count and the total incoming
2668 call edge count to the callee. */
2669 gcov_type in_count
= 0;
2670 struct cgraph_edge
*in_edge
;
2671 for (in_edge
= id
->src_node
->callers
; in_edge
;
2672 in_edge
= in_edge
->next_caller
)
2673 in_count
+= in_edge
->count
;
2674 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2677 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2679 = GCOV_COMPUTE_SCALE (count
,
2680 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2682 count_scale
= REG_BR_PROB_BASE
;
2684 /* Register specific tree functions. */
2685 gimple_register_cfg_hooks ();
2687 /* If we are inlining just region of the function, make sure to connect
2688 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2689 part of loop, we must compute frequency and probability of
2690 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2691 probabilities of edges incoming from nonduplicated region. */
2697 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2700 incoming_frequency
+= EDGE_FREQUENCY (e
);
2701 incoming_count
+= e
->count
;
2703 incoming_count
= apply_scale (incoming_count
, count_scale
);
2705 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2706 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2707 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2710 /* Must have a CFG here at this point. */
2711 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2712 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2714 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2716 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2717 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2718 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2719 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2721 /* Duplicate any exception-handling regions. */
2723 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2726 /* Use aux pointers to map the original blocks to copy. */
2727 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2728 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2730 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2733 new_bb
->loop_father
= entry_block_map
->loop_father
;
2736 last
= last_basic_block_for_fn (cfun
);
2738 /* Now that we've duplicated the blocks, duplicate their edges. */
2739 basic_block abnormal_goto_dest
= NULL
;
2741 && stmt_can_make_abnormal_goto (id
->call_stmt
))
2743 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
2745 bb
= gimple_bb (id
->call_stmt
);
2747 if (gsi_end_p (gsi
))
2748 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2750 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2751 if (!id
->blocks_to_copy
2752 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2753 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2754 abnormal_goto_dest
);
2758 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2759 e
->probability
= REG_BR_PROB_BASE
;
2760 e
->count
= incoming_count
;
2763 /* Duplicate the loop tree, if available and wanted. */
2764 if (loops_for_fn (src_cfun
) != NULL
2765 && current_loops
!= NULL
)
2767 copy_loops (id
, entry_block_map
->loop_father
,
2768 get_loop (src_cfun
, 0));
2769 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2770 loops_state_set (LOOPS_NEED_FIXUP
);
2773 /* If the loop tree in the source function needed fixup, mark the
2774 destination loop tree for fixup, too. */
2775 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2776 loops_state_set (LOOPS_NEED_FIXUP
);
2778 if (gimple_in_ssa_p (cfun
))
2779 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2780 if (!id
->blocks_to_copy
2781 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2782 copy_phis_for_bb (bb
, id
);
2784 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2787 if (need_debug_cleanup
2788 && bb
->index
!= ENTRY_BLOCK
2789 && bb
->index
!= EXIT_BLOCK
)
2790 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2791 /* Update call edge destinations. This can not be done before loop
2792 info is updated, because we may split basic blocks. */
2793 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
2794 && bb
->index
!= ENTRY_BLOCK
2795 && bb
->index
!= EXIT_BLOCK
)
2796 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2797 ((basic_block
)bb
->aux
)->aux
= NULL
;
2801 /* Zero out AUX fields of newly created block during EH edge
2803 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2805 if (need_debug_cleanup
)
2806 maybe_move_debug_stmts_to_successors (id
,
2807 BASIC_BLOCK_FOR_FN (cfun
, last
));
2808 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2809 /* Update call edge destinations. This can not be done before loop
2810 info is updated, because we may split basic blocks. */
2811 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2812 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2814 entry_block_map
->aux
= NULL
;
2815 exit_block_map
->aux
= NULL
;
2822 if (id
->dependence_map
)
2824 delete id
->dependence_map
;
2825 id
->dependence_map
= NULL
;
2831 /* Copy the debug STMT using ID. We deal with these statements in a
2832 special way: if any variable in their VALUE expression wasn't
2833 remapped yet, we won't remap it, because that would get decl uids
2834 out of sync, causing codegen differences between -g and -g0. If
2835 this arises, we drop the VALUE expression altogether. */
2838 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
2841 struct walk_stmt_info wi
;
2843 if (gimple_block (stmt
))
2845 n
= id
->decl_map
->get (gimple_block (stmt
));
2846 gimple_set_block (stmt
, n
? *n
: id
->block
);
2849 /* Remap all the operands in COPY. */
2850 memset (&wi
, 0, sizeof (wi
));
2853 processing_debug_stmt
= 1;
2855 if (gimple_debug_source_bind_p (stmt
))
2856 t
= gimple_debug_source_bind_get_var (stmt
);
2858 t
= gimple_debug_bind_get_var (stmt
);
2860 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2861 && (n
= id
->debug_map
->get (t
)))
2863 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2866 else if (TREE_CODE (t
) == VAR_DECL
2867 && !is_global_var (t
)
2868 && !id
->decl_map
->get (t
))
2869 /* T is a non-localized variable. */;
2871 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2873 if (gimple_debug_bind_p (stmt
))
2875 gimple_debug_bind_set_var (stmt
, t
);
2877 if (gimple_debug_bind_has_value_p (stmt
))
2878 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2879 remap_gimple_op_r
, &wi
, NULL
);
2881 /* Punt if any decl couldn't be remapped. */
2882 if (processing_debug_stmt
< 0)
2883 gimple_debug_bind_reset_value (stmt
);
2885 else if (gimple_debug_source_bind_p (stmt
))
2887 gimple_debug_source_bind_set_var (stmt
, t
);
2888 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2889 remap_gimple_op_r
, &wi
, NULL
);
2890 /* When inlining and source bind refers to one of the optimized
2891 away parameters, change the source bind into normal debug bind
2892 referring to the corresponding DEBUG_EXPR_DECL that should have
2893 been bound before the call stmt. */
2894 t
= gimple_debug_source_bind_get_value (stmt
);
2896 && TREE_CODE (t
) == PARM_DECL
2899 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2901 if (debug_args
!= NULL
)
2903 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2904 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2905 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2907 t
= (**debug_args
)[i
+ 1];
2908 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2909 gimple_debug_bind_set_value (stmt
, t
);
2916 processing_debug_stmt
= 0;
2921 /* Process deferred debug stmts. In order to give values better odds
2922 of being successfully remapped, we delay the processing of debug
2923 stmts until all other stmts that might require remapping are
2927 copy_debug_stmts (copy_body_data
*id
)
2932 if (!id
->debug_stmts
.exists ())
2935 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2936 copy_debug_stmt (stmt
, id
);
2938 id
->debug_stmts
.release ();
2941 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2942 another function. */
2945 copy_tree_body (copy_body_data
*id
)
2947 tree fndecl
= id
->src_fn
;
2948 tree body
= DECL_SAVED_TREE (fndecl
);
2950 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2955 /* Make a copy of the body of FN so that it can be inserted inline in
2956 another function. */
2959 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2960 basic_block entry_block_map
, basic_block exit_block_map
,
2961 basic_block new_entry
)
2963 tree fndecl
= id
->src_fn
;
2966 /* If this body has a CFG, walk CFG and copy. */
2967 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2968 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2970 copy_debug_stmts (id
);
2975 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2976 defined in function FN, or of a data member thereof. */
2979 self_inlining_addr_expr (tree value
, tree fn
)
2983 if (TREE_CODE (value
) != ADDR_EXPR
)
2986 var
= get_base_address (TREE_OPERAND (value
, 0));
2988 return var
&& auto_var_in_fn_p (var
, fn
);
2991 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2992 lexical block and line number information from base_stmt, if given,
2993 or from the last stmt of the block otherwise. */
2996 insert_init_debug_bind (copy_body_data
*id
,
2997 basic_block bb
, tree var
, tree value
,
3001 gimple_stmt_iterator gsi
;
3004 if (!gimple_in_ssa_p (id
->src_cfun
))
3007 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
3010 tracked_var
= target_for_debug_bind (var
);
3016 gsi
= gsi_last_bb (bb
);
3017 if (!base_stmt
&& !gsi_end_p (gsi
))
3018 base_stmt
= gsi_stmt (gsi
);
3021 note
= gimple_build_debug_bind (tracked_var
, unshare_expr (value
), base_stmt
);
3025 if (!gsi_end_p (gsi
))
3026 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
3028 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3035 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
3037 /* If VAR represents a zero-sized variable, it's possible that the
3038 assignment statement may result in no gimple statements. */
3041 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3043 /* We can end up with init statements that store to a non-register
3044 from a rhs with a conversion. Handle that here by forcing the
3045 rhs into a temporary. gimple_regimplify_operands is not
3046 prepared to do this for us. */
3047 if (!is_gimple_debug (init_stmt
)
3048 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3049 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3050 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3052 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3053 gimple_expr_type (init_stmt
),
3054 gimple_assign_rhs1 (init_stmt
));
3055 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3057 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3058 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3060 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3061 gimple_regimplify_operands (init_stmt
, &si
);
3063 if (!is_gimple_debug (init_stmt
))
3065 tree def
= gimple_assign_lhs (init_stmt
);
3066 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3071 /* Initialize parameter P with VALUE. If needed, produce init statement
3072 at the end of BB. When BB is NULL, we return init statement to be
3075 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3076 basic_block bb
, tree
*vars
)
3078 gimple init_stmt
= NULL
;
3081 tree def
= (gimple_in_ssa_p (cfun
)
3082 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3085 && value
!= error_mark_node
3086 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3088 /* If we can match up types by promotion/demotion do so. */
3089 if (fold_convertible_p (TREE_TYPE (p
), value
))
3090 rhs
= fold_convert (TREE_TYPE (p
), value
);
3093 /* ??? For valid programs we should not end up here.
3094 Still if we end up with truly mismatched types here, fall back
3095 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3096 GIMPLE to the following passes. */
3097 if (!is_gimple_reg_type (TREE_TYPE (value
))
3098 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
3099 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
3101 rhs
= build_zero_cst (TREE_TYPE (p
));
3105 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3106 here since the type of this decl must be visible to the calling
3108 var
= copy_decl_to_var (p
, id
);
3110 /* Declare this new variable. */
3111 DECL_CHAIN (var
) = *vars
;
3114 /* Make gimplifier happy about this variable. */
3115 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3117 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3118 we would not need to create a new variable here at all, if it
3119 weren't for debug info. Still, we can just use the argument
3121 if (TREE_READONLY (p
)
3122 && !TREE_ADDRESSABLE (p
)
3123 && value
&& !TREE_SIDE_EFFECTS (value
)
3126 /* We may produce non-gimple trees by adding NOPs or introduce
3127 invalid sharing when operand is not really constant.
3128 It is not big deal to prohibit constant propagation here as
3129 we will constant propagate in DOM1 pass anyway. */
3130 if (is_gimple_min_invariant (value
)
3131 && useless_type_conversion_p (TREE_TYPE (p
),
3133 /* We have to be very careful about ADDR_EXPR. Make sure
3134 the base variable isn't a local variable of the inlined
3135 function, e.g., when doing recursive inlining, direct or
3136 mutually-recursive or whatever, which is why we don't
3137 just test whether fn == current_function_decl. */
3138 && ! self_inlining_addr_expr (value
, fn
))
3140 insert_decl_map (id
, p
, value
);
3141 insert_debug_decl_map (id
, p
, var
);
3142 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3146 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3147 that way, when the PARM_DECL is encountered, it will be
3148 automatically replaced by the VAR_DECL. */
3149 insert_decl_map (id
, p
, var
);
3151 /* Even if P was TREE_READONLY, the new VAR should not be.
3152 In the original code, we would have constructed a
3153 temporary, and then the function body would have never
3154 changed the value of P. However, now, we will be
3155 constructing VAR directly. The constructor body may
3156 change its value multiple times as it is being
3157 constructed. Therefore, it must not be TREE_READONLY;
3158 the back-end assumes that TREE_READONLY variable is
3159 assigned to only once. */
3160 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
3161 TREE_READONLY (var
) = 0;
3163 /* If there is no setup required and we are in SSA, take the easy route
3164 replacing all SSA names representing the function parameter by the
3165 SSA name passed to function.
3167 We need to construct map for the variable anyway as it might be used
3168 in different SSA names when parameter is set in function.
3170 Do replacement at -O0 for const arguments replaced by constant.
3171 This is important for builtin_constant_p and other construct requiring
3172 constant argument to be visible in inlined function body. */
3173 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3175 || (TREE_READONLY (p
)
3176 && is_gimple_min_invariant (rhs
)))
3177 && (TREE_CODE (rhs
) == SSA_NAME
3178 || is_gimple_min_invariant (rhs
))
3179 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3181 insert_decl_map (id
, def
, rhs
);
3182 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3185 /* If the value of argument is never used, don't care about initializing
3187 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3189 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3190 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3193 /* Initialize this VAR_DECL from the equivalent argument. Convert
3194 the argument to the proper type in case it was promoted. */
3197 if (rhs
== error_mark_node
)
3199 insert_decl_map (id
, p
, var
);
3200 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3203 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3205 /* If we are in SSA form properly remap the default definition
3206 or assign to a dummy SSA name if the parameter is unused and
3207 we are not optimizing. */
3208 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3212 def
= remap_ssa_name (def
, id
);
3213 init_stmt
= gimple_build_assign (def
, rhs
);
3214 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3215 set_ssa_default_def (cfun
, var
, NULL
);
3219 def
= make_ssa_name (var
);
3220 init_stmt
= gimple_build_assign (def
, rhs
);
3224 init_stmt
= gimple_build_assign (var
, rhs
);
3226 if (bb
&& init_stmt
)
3227 insert_init_stmt (id
, bb
, init_stmt
);
3232 /* Generate code to initialize the parameters of the function at the
3233 top of the stack in ID from the GIMPLE_CALL STMT. */
3236 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
3237 tree fn
, basic_block bb
)
3242 tree vars
= NULL_TREE
;
3243 tree static_chain
= gimple_call_chain (stmt
);
3245 /* Figure out what the parameters are. */
3246 parms
= DECL_ARGUMENTS (fn
);
3248 /* Loop through the parameter declarations, replacing each with an
3249 equivalent VAR_DECL, appropriately initialized. */
3250 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3253 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3254 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3256 /* After remapping parameters remap their types. This has to be done
3257 in a second loop over all parameters to appropriately remap
3258 variable sized arrays when the size is specified in a
3259 parameter following the array. */
3260 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3262 tree
*varp
= id
->decl_map
->get (p
);
3264 && TREE_CODE (*varp
) == VAR_DECL
)
3266 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3267 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3269 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3270 /* Also remap the default definition if it was remapped
3271 to the default definition of the parameter replacement
3272 by the parameter setup. */
3275 tree
*defp
= id
->decl_map
->get (def
);
3277 && TREE_CODE (*defp
) == SSA_NAME
3278 && SSA_NAME_VAR (*defp
) == var
)
3279 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3284 /* Initialize the static chain. */
3285 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3286 gcc_assert (fn
!= current_function_decl
);
3289 /* No static chain? Seems like a bug in tree-nested.c. */
3290 gcc_assert (static_chain
);
3292 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3295 declare_inline_vars (id
->block
, vars
);
3299 /* Declare a return variable to replace the RESULT_DECL for the
3300 function we are calling. An appropriate DECL_STMT is returned.
3301 The USE_STMT is filled to contain a use of the declaration to
3302 indicate the return value of the function.
3304 RETURN_SLOT, if non-null is place where to store the result. It
3305 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3306 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3308 RETURN_BOUNDS holds a destination for returned bounds.
3310 The return value is a (possibly null) value that holds the result
3311 as seen by the caller. */
3314 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3315 tree return_bounds
, basic_block entry_bb
)
3317 tree callee
= id
->src_fn
;
3318 tree result
= DECL_RESULT (callee
);
3319 tree callee_type
= TREE_TYPE (result
);
3323 /* Handle type-mismatches in the function declaration return type
3324 vs. the call expression. */
3326 caller_type
= TREE_TYPE (modify_dest
);
3328 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3330 /* We don't need to do anything for functions that don't return anything. */
3331 if (VOID_TYPE_P (callee_type
))
3334 /* If there was a return slot, then the return value is the
3335 dereferenced address of that object. */
3338 /* The front end shouldn't have used both return_slot and
3339 a modify expression. */
3340 gcc_assert (!modify_dest
);
3341 if (DECL_BY_REFERENCE (result
))
3343 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3344 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3346 /* We are going to construct *&return_slot and we can't do that
3347 for variables believed to be not addressable.
3349 FIXME: This check possibly can match, because values returned
3350 via return slot optimization are not believed to have address
3351 taken by alias analysis. */
3352 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3353 var
= return_slot_addr
;
3358 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3359 if (TREE_ADDRESSABLE (result
))
3360 mark_addressable (var
);
3362 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3363 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3364 && !DECL_GIMPLE_REG_P (result
)
3366 DECL_GIMPLE_REG_P (var
) = 0;
3371 /* All types requiring non-trivial constructors should have been handled. */
3372 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3374 /* Attempt to avoid creating a new temporary variable. */
3376 && TREE_CODE (modify_dest
) != SSA_NAME
)
3378 bool use_it
= false;
3380 /* We can't use MODIFY_DEST if there's type promotion involved. */
3381 if (!useless_type_conversion_p (callee_type
, caller_type
))
3384 /* ??? If we're assigning to a variable sized type, then we must
3385 reuse the destination variable, because we've no good way to
3386 create variable sized temporaries at this point. */
3387 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3390 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3391 reuse it as the result of the call directly. Don't do this if
3392 it would promote MODIFY_DEST to addressable. */
3393 else if (TREE_ADDRESSABLE (result
))
3397 tree base_m
= get_base_address (modify_dest
);
3399 /* If the base isn't a decl, then it's a pointer, and we don't
3400 know where that's going to go. */
3401 if (!DECL_P (base_m
))
3403 else if (is_global_var (base_m
))
3405 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3406 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3407 && !DECL_GIMPLE_REG_P (result
)
3408 && DECL_GIMPLE_REG_P (base_m
))
3410 else if (!TREE_ADDRESSABLE (base_m
))
3422 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3424 var
= copy_result_decl_to_var (result
, id
);
3425 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3427 /* Do not have the rest of GCC warn about this variable as it should
3428 not be visible to the user. */
3429 TREE_NO_WARNING (var
) = 1;
3431 declare_inline_vars (id
->block
, var
);
3433 /* Build the use expr. If the return type of the function was
3434 promoted, convert it back to the expected type. */
3436 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3438 /* If we can match up types by promotion/demotion do so. */
3439 if (fold_convertible_p (caller_type
, var
))
3440 use
= fold_convert (caller_type
, var
);
3443 /* ??? For valid programs we should not end up here.
3444 Still if we end up with truly mismatched types here, fall back
3445 to using a MEM_REF to not leak invalid GIMPLE to the following
3447 /* Prevent var from being written into SSA form. */
3448 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3449 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3450 DECL_GIMPLE_REG_P (var
) = false;
3451 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3452 TREE_ADDRESSABLE (var
) = true;
3453 use
= fold_build2 (MEM_REF
, caller_type
,
3454 build_fold_addr_expr (var
),
3455 build_int_cst (ptr_type_node
, 0));
3459 STRIP_USELESS_TYPE_CONVERSION (use
);
3461 if (DECL_BY_REFERENCE (result
))
3463 TREE_ADDRESSABLE (var
) = 1;
3464 var
= build_fold_addr_expr (var
);
3468 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3469 way, when the RESULT_DECL is encountered, it will be
3470 automatically replaced by the VAR_DECL.
3472 When returning by reference, ensure that RESULT_DECL remaps to
3474 if (DECL_BY_REFERENCE (result
)
3475 && !is_gimple_val (var
))
3477 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3478 insert_decl_map (id
, result
, temp
);
3479 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3480 it's default_def SSA_NAME. */
3481 if (gimple_in_ssa_p (id
->src_cfun
)
3482 && is_gimple_reg (result
))
3484 temp
= make_ssa_name (temp
);
3485 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3487 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3490 insert_decl_map (id
, result
, var
);
3492 /* Remember this so we can ignore it in remap_decls. */
3495 /* If returned bounds are used, then make var for them. */
3498 tree bndtemp
= create_tmp_var (pointer_bounds_type_node
, "retbnd");
3499 DECL_SEEN_IN_BIND_EXPR_P (bndtemp
) = 1;
3500 TREE_NO_WARNING (bndtemp
) = 1;
3501 declare_inline_vars (id
->block
, bndtemp
);
3503 id
->retbnd
= bndtemp
;
3504 insert_init_stmt (id
, entry_bb
,
3505 gimple_build_assign (bndtemp
, chkp_get_zero_bounds_var ()));
3511 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3512 to a local label. */
3515 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3518 tree fn
= (tree
) fnp
;
3520 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3529 /* Determine if the function can be copied. If so return NULL. If
3530 not return a string describng the reason for failure. */
3533 copy_forbidden (struct function
*fun
, tree fndecl
)
3535 const char *reason
= fun
->cannot_be_copied_reason
;
3539 /* Only examine the function once. */
3540 if (fun
->cannot_be_copied_set
)
3543 /* We cannot copy a function that receives a non-local goto
3544 because we cannot remap the destination label used in the
3545 function that is performing the non-local goto. */
3546 /* ??? Actually, this should be possible, if we work at it.
3547 No doubt there's just a handful of places that simply
3548 assume it doesn't happen and don't substitute properly. */
3549 if (fun
->has_nonlocal_label
)
3551 reason
= G_("function %q+F can never be copied "
3552 "because it receives a non-local goto");
3556 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3557 if (TREE_CODE (decl
) == VAR_DECL
3558 && TREE_STATIC (decl
)
3559 && !DECL_EXTERNAL (decl
)
3560 && DECL_INITIAL (decl
)
3561 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3562 has_label_address_in_static_1
,
3565 reason
= G_("function %q+F can never be copied because it saves "
3566 "address of local label in a static variable");
3571 fun
->cannot_be_copied_reason
= reason
;
3572 fun
->cannot_be_copied_set
= true;
3577 static const char *inline_forbidden_reason
;
3579 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3580 iff a function can not be inlined. Also sets the reason why. */
3583 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3584 struct walk_stmt_info
*wip
)
3586 tree fn
= (tree
) wip
->info
;
3588 gimple stmt
= gsi_stmt (*gsi
);
3590 switch (gimple_code (stmt
))
3593 /* Refuse to inline alloca call unless user explicitly forced so as
3594 this may change program's memory overhead drastically when the
3595 function using alloca is called in loop. In GCC present in
3596 SPEC2000 inlining into schedule_block cause it to require 2GB of
3597 RAM instead of 256MB. Don't do so for alloca calls emitted for
3598 VLA objects as those can't cause unbounded growth (they're always
3599 wrapped inside stack_save/stack_restore regions. */
3600 if (gimple_alloca_call_p (stmt
)
3601 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3602 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3604 inline_forbidden_reason
3605 = G_("function %q+F can never be inlined because it uses "
3606 "alloca (override using the always_inline attribute)");
3607 *handled_ops_p
= true;
3611 t
= gimple_call_fndecl (stmt
);
3615 /* We cannot inline functions that call setjmp. */
3616 if (setjmp_call_p (t
))
3618 inline_forbidden_reason
3619 = G_("function %q+F can never be inlined because it uses setjmp");
3620 *handled_ops_p
= true;
3624 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3625 switch (DECL_FUNCTION_CODE (t
))
3627 /* We cannot inline functions that take a variable number of
3629 case BUILT_IN_VA_START
:
3630 case BUILT_IN_NEXT_ARG
:
3631 case BUILT_IN_VA_END
:
3632 inline_forbidden_reason
3633 = G_("function %q+F can never be inlined because it "
3634 "uses variable argument lists");
3635 *handled_ops_p
= true;
3638 case BUILT_IN_LONGJMP
:
3639 /* We can't inline functions that call __builtin_longjmp at
3640 all. The non-local goto machinery really requires the
3641 destination be in a different function. If we allow the
3642 function calling __builtin_longjmp to be inlined into the
3643 function calling __builtin_setjmp, Things will Go Awry. */
3644 inline_forbidden_reason
3645 = G_("function %q+F can never be inlined because "
3646 "it uses setjmp-longjmp exception handling");
3647 *handled_ops_p
= true;
3650 case BUILT_IN_NONLOCAL_GOTO
:
3652 inline_forbidden_reason
3653 = G_("function %q+F can never be inlined because "
3654 "it uses non-local goto");
3655 *handled_ops_p
= true;
3658 case BUILT_IN_RETURN
:
3659 case BUILT_IN_APPLY_ARGS
:
3660 /* If a __builtin_apply_args caller would be inlined,
3661 it would be saving arguments of the function it has
3662 been inlined into. Similarly __builtin_return would
3663 return from the function the inline has been inlined into. */
3664 inline_forbidden_reason
3665 = G_("function %q+F can never be inlined because "
3666 "it uses __builtin_return or __builtin_apply_args");
3667 *handled_ops_p
= true;
3676 t
= gimple_goto_dest (stmt
);
3678 /* We will not inline a function which uses computed goto. The
3679 addresses of its local labels, which may be tucked into
3680 global storage, are of course not constant across
3681 instantiations, which causes unexpected behavior. */
3682 if (TREE_CODE (t
) != LABEL_DECL
)
3684 inline_forbidden_reason
3685 = G_("function %q+F can never be inlined "
3686 "because it contains a computed goto");
3687 *handled_ops_p
= true;
3696 *handled_ops_p
= false;
3700 /* Return true if FNDECL is a function that cannot be inlined into
3704 inline_forbidden_p (tree fndecl
)
3706 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3707 struct walk_stmt_info wi
;
3709 bool forbidden_p
= false;
3711 /* First check for shared reasons not to copy the code. */
3712 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3713 if (inline_forbidden_reason
!= NULL
)
3716 /* Next, walk the statements of the function looking for
3717 constraucts we can't handle, or are non-optimal for inlining. */
3718 hash_set
<tree
> visited_nodes
;
3719 memset (&wi
, 0, sizeof (wi
));
3720 wi
.info
= (void *) fndecl
;
3721 wi
.pset
= &visited_nodes
;
3723 FOR_EACH_BB_FN (bb
, fun
)
3726 gimple_seq seq
= bb_seq (bb
);
3727 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3728 forbidden_p
= (ret
!= NULL
);
3736 /* Return false if the function FNDECL cannot be inlined on account of its
3737 attributes, true otherwise. */
3739 function_attribute_inlinable_p (const_tree fndecl
)
3741 if (targetm
.attribute_table
)
3745 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3747 const_tree name
= TREE_PURPOSE (a
);
3750 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3751 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3752 return targetm
.function_attribute_inlinable_p (fndecl
);
3759 /* Returns nonzero if FN is a function that does not have any
3760 fundamental inline blocking properties. */
3763 tree_inlinable_function_p (tree fn
)
3765 bool inlinable
= true;
3769 /* If we've already decided this function shouldn't be inlined,
3770 there's no need to check again. */
3771 if (DECL_UNINLINABLE (fn
))
3774 /* We only warn for functions declared `inline' by the user. */
3775 do_warning
= (warn_inline
3776 && DECL_DECLARED_INLINE_P (fn
)
3777 && !DECL_NO_INLINE_WARNING_P (fn
)
3778 && !DECL_IN_SYSTEM_HEADER (fn
));
3780 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3783 && always_inline
== NULL
)
3786 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3787 "is suppressed using -fno-inline", fn
);
3791 else if (!function_attribute_inlinable_p (fn
))
3794 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3795 "uses attributes conflicting with inlining", fn
);
3799 else if (inline_forbidden_p (fn
))
3801 /* See if we should warn about uninlinable functions. Previously,
3802 some of these warnings would be issued while trying to expand
3803 the function inline, but that would cause multiple warnings
3804 about functions that would for example call alloca. But since
3805 this a property of the function, just one warning is enough.
3806 As a bonus we can now give more details about the reason why a
3807 function is not inlinable. */
3809 error (inline_forbidden_reason
, fn
);
3810 else if (do_warning
)
3811 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3816 /* Squirrel away the result so that we don't have to check again. */
3817 DECL_UNINLINABLE (fn
) = !inlinable
;
3822 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
3823 word size and take possible memcpy call into account and return
3824 cost based on whether optimizing for size or speed according to SPEED_P. */
3827 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
3831 gcc_assert (!VOID_TYPE_P (type
));
3833 if (TREE_CODE (type
) == VECTOR_TYPE
)
3835 machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3837 = targetm
.vectorize
.preferred_simd_mode (inner
);
3838 int simd_mode_size
= GET_MODE_SIZE (simd
);
3839 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3843 size
= int_size_in_bytes (type
);
3845 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
3846 /* Cost of a memcpy call, 3 arguments and the call. */
3849 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3852 /* Returns cost of operation CODE, according to WEIGHTS */
3855 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3856 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3860 /* These are "free" conversions, or their presumed cost
3861 is folded into other operations. */
3866 case VIEW_CONVERT_EXPR
:
3869 /* Assign cost of 1 to usual operations.
3870 ??? We may consider mapping RTL costs to this. */
3876 case POINTER_PLUS_EXPR
:
3879 case MULT_HIGHPART_EXPR
:
3882 case ADDR_SPACE_CONVERT_EXPR
:
3883 case FIXED_CONVERT_EXPR
:
3884 case FIX_TRUNC_EXPR
:
3902 case TRUTH_ANDIF_EXPR
:
3903 case TRUTH_ORIF_EXPR
:
3904 case TRUTH_AND_EXPR
:
3906 case TRUTH_XOR_EXPR
:
3907 case TRUTH_NOT_EXPR
:
3916 case UNORDERED_EXPR
:
3927 case PREDECREMENT_EXPR
:
3928 case PREINCREMENT_EXPR
:
3929 case POSTDECREMENT_EXPR
:
3930 case POSTINCREMENT_EXPR
:
3932 case REALIGN_LOAD_EXPR
:
3934 case REDUC_MAX_EXPR
:
3935 case REDUC_MIN_EXPR
:
3936 case REDUC_PLUS_EXPR
:
3937 case WIDEN_SUM_EXPR
:
3938 case WIDEN_MULT_EXPR
:
3941 case WIDEN_MULT_PLUS_EXPR
:
3942 case WIDEN_MULT_MINUS_EXPR
:
3943 case WIDEN_LSHIFT_EXPR
:
3945 case VEC_WIDEN_MULT_HI_EXPR
:
3946 case VEC_WIDEN_MULT_LO_EXPR
:
3947 case VEC_WIDEN_MULT_EVEN_EXPR
:
3948 case VEC_WIDEN_MULT_ODD_EXPR
:
3949 case VEC_UNPACK_HI_EXPR
:
3950 case VEC_UNPACK_LO_EXPR
:
3951 case VEC_UNPACK_FLOAT_HI_EXPR
:
3952 case VEC_UNPACK_FLOAT_LO_EXPR
:
3953 case VEC_PACK_TRUNC_EXPR
:
3954 case VEC_PACK_SAT_EXPR
:
3955 case VEC_PACK_FIX_TRUNC_EXPR
:
3956 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3957 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3961 /* Few special cases of expensive operations. This is useful
3962 to avoid inlining on functions having too many of these. */
3963 case TRUNC_DIV_EXPR
:
3965 case FLOOR_DIV_EXPR
:
3966 case ROUND_DIV_EXPR
:
3967 case EXACT_DIV_EXPR
:
3968 case TRUNC_MOD_EXPR
:
3970 case FLOOR_MOD_EXPR
:
3971 case ROUND_MOD_EXPR
:
3973 if (TREE_CODE (op2
) != INTEGER_CST
)
3974 return weights
->div_mod_cost
;
3978 /* We expect a copy assignment with no operator. */
3979 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3985 /* Estimate number of instructions that will be created by expanding
3986 the statements in the statement sequence STMTS.
3987 WEIGHTS contains weights attributed to various constructs. */
3990 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3993 gimple_stmt_iterator gsi
;
3996 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3997 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4003 /* Estimate number of instructions that will be created by expanding STMT.
4004 WEIGHTS contains weights attributed to various constructs. */
4007 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
4010 enum gimple_code code
= gimple_code (stmt
);
4017 /* Try to estimate the cost of assignments. We have three cases to
4019 1) Simple assignments to registers;
4020 2) Stores to things that must live in memory. This includes
4021 "normal" stores to scalars, but also assignments of large
4022 structures, or constructors of big arrays;
4024 Let us look at the first two cases, assuming we have "a = b + C":
4025 <GIMPLE_ASSIGN <var_decl "a">
4026 <plus_expr <var_decl "b"> <constant C>>
4027 If "a" is a GIMPLE register, the assignment to it is free on almost
4028 any target, because "a" usually ends up in a real register. Hence
4029 the only cost of this expression comes from the PLUS_EXPR, and we
4030 can ignore the GIMPLE_ASSIGN.
4031 If "a" is not a GIMPLE register, the assignment to "a" will most
4032 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4033 of moving something into "a", which we compute using the function
4034 estimate_move_cost. */
4035 if (gimple_clobber_p (stmt
))
4036 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4038 lhs
= gimple_assign_lhs (stmt
);
4039 rhs
= gimple_assign_rhs1 (stmt
);
4043 /* Account for the cost of moving to / from memory. */
4044 if (gimple_store_p (stmt
))
4045 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
4046 if (gimple_assign_load_p (stmt
))
4047 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
4049 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
4050 gimple_assign_rhs1 (stmt
),
4051 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
4052 == GIMPLE_BINARY_RHS
4053 ? gimple_assign_rhs2 (stmt
) : NULL
);
4057 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4058 gimple_op (stmt
, 0),
4059 gimple_op (stmt
, 1));
4064 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4065 /* Take into account cost of the switch + guess 2 conditional jumps for
4068 TODO: once the switch expansion logic is sufficiently separated, we can
4069 do better job on estimating cost of the switch. */
4070 if (weights
->time_based
)
4071 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4073 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4081 if (gimple_call_internal_p (stmt
))
4083 else if ((decl
= gimple_call_fndecl (stmt
))
4084 && DECL_BUILT_IN (decl
))
4086 /* Do not special case builtins where we see the body.
4087 This just confuse inliner. */
4088 struct cgraph_node
*node
;
4089 if (!(node
= cgraph_node::get (decl
))
4090 || node
->definition
)
4092 /* For buitins that are likely expanded to nothing or
4093 inlined do not account operand costs. */
4094 else if (is_simple_builtin (decl
))
4096 else if (is_inexpensive_builtin (decl
))
4097 return weights
->target_builtin_call_cost
;
4098 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
4100 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4101 specialize the cheap expansion we do here.
4102 ??? This asks for a more general solution. */
4103 switch (DECL_FUNCTION_CODE (decl
))
4108 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4109 && REAL_VALUES_EQUAL
4110 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
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;
4279 /* Estimate the number of instructions in a gimple_seq. */
4282 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
4284 gimple_stmt_iterator gsi
;
4286 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4287 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4293 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4296 prepend_lexical_block (tree current_block
, tree new_block
)
4298 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4299 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4300 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4303 /* Add local variables from CALLEE to CALLER. */
4306 add_local_variables (struct function
*callee
, struct function
*caller
,
4312 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4313 if (!can_be_nonlocal (var
, id
))
4315 tree new_var
= remap_decl (var
, id
);
4317 /* Remap debug-expressions. */
4318 if (TREE_CODE (new_var
) == VAR_DECL
4319 && DECL_HAS_DEBUG_EXPR_P (var
)
4322 tree tem
= DECL_DEBUG_EXPR (var
);
4323 bool old_regimplify
= id
->regimplify
;
4324 id
->remapping_type_depth
++;
4325 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4326 id
->remapping_type_depth
--;
4327 id
->regimplify
= old_regimplify
;
4328 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4329 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4331 add_local_decl (caller
, new_var
);
4335 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4336 have brought in or introduced any debug stmts for SRCVAR. */
4339 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4341 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4346 if (TREE_CODE (*remappedvarp
) != VAR_DECL
)
4349 if (*remappedvarp
== id
->retvar
|| *remappedvarp
== id
->retbnd
)
4352 tree tvar
= target_for_debug_bind (*remappedvarp
);
4356 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4358 gimple_seq_add_stmt (bindings
, stmt
);
4361 /* For each inlined variable for which we may have debug bind stmts,
4362 add before GSI a final debug stmt resetting it, marking the end of
4363 its life, so that var-tracking knows it doesn't have to compute
4364 further locations for it. */
4367 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4371 gimple_seq bindings
= NULL
;
4373 if (!gimple_in_ssa_p (id
->src_cfun
))
4376 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4379 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4380 var
; var
= DECL_CHAIN (var
))
4381 reset_debug_binding (id
, var
, &bindings
);
4383 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4384 reset_debug_binding (id
, var
, &bindings
);
4386 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4389 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4392 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
4396 hash_map
<tree
, tree
> *dst
;
4397 hash_map
<tree
, tree
> *st
= NULL
;
4400 tree return_bounds
= NULL
;
4401 location_t saved_location
;
4402 struct cgraph_edge
*cg_edge
;
4403 cgraph_inline_failed_t reason
;
4404 basic_block return_block
;
4406 gimple_stmt_iterator gsi
, stmt_gsi
;
4407 bool successfully_inlined
= FALSE
;
4408 bool purge_dead_abnormal_edges
;
4412 /* Set input_location here so we get the right instantiation context
4413 if we call instantiate_decl from inlinable_function_p. */
4414 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
4415 saved_location
= input_location
;
4416 input_location
= gimple_location (stmt
);
4418 /* From here on, we're only interested in CALL_EXPRs. */
4419 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4423 cg_edge
= id
->dst_node
->get_edge (stmt
);
4424 gcc_checking_assert (cg_edge
);
4425 /* First, see if we can figure out what function is being called.
4426 If we cannot, then there is no hope of inlining the function. */
4427 if (cg_edge
->indirect_unknown_callee
)
4429 fn
= cg_edge
->callee
->decl
;
4430 gcc_checking_assert (fn
);
4432 /* If FN is a declaration of a function in a nested scope that was
4433 globally declared inline, we don't set its DECL_INITIAL.
4434 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4435 C++ front-end uses it for cdtors to refer to their internal
4436 declarations, that are not real functions. Fortunately those
4437 don't have trees to be saved, so we can tell by checking their
4439 if (!DECL_INITIAL (fn
)
4440 && DECL_ABSTRACT_ORIGIN (fn
)
4441 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4442 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4444 /* Don't try to inline functions that are not well-suited to inlining. */
4445 if (cg_edge
->inline_failed
)
4447 reason
= cg_edge
->inline_failed
;
4448 /* If this call was originally indirect, we do not want to emit any
4449 inlining related warnings or sorry messages because there are no
4450 guarantees regarding those. */
4451 if (cg_edge
->indirect_inlining_edge
)
4454 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4455 /* For extern inline functions that get redefined we always
4456 silently ignored always_inline flag. Better behaviour would
4457 be to be able to keep both bodies and use extern inline body
4458 for inlining, but we can't do that because frontends overwrite
4460 && !cg_edge
->callee
->local
.redefined_extern_inline
4461 /* During early inline pass, report only when optimization is
4463 && (symtab
->global_info_ready
4465 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4466 /* PR 20090218-1_0.c. Body can be provided by another module. */
4467 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4469 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4470 cgraph_inline_failed_string (reason
));
4471 error ("called from here");
4473 else if (warn_inline
4474 && DECL_DECLARED_INLINE_P (fn
)
4475 && !DECL_NO_INLINE_WARNING_P (fn
)
4476 && !DECL_IN_SYSTEM_HEADER (fn
)
4477 && reason
!= CIF_UNSPECIFIED
4478 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4479 /* Do not warn about not inlined recursive calls. */
4480 && !cg_edge
->recursive_p ()
4481 /* Avoid warnings during early inline pass. */
4482 && symtab
->global_info_ready
)
4484 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4485 fn
, _(cgraph_inline_failed_string (reason
)));
4486 warning (OPT_Winline
, "called from here");
4490 fn
= cg_edge
->callee
->decl
;
4491 cg_edge
->callee
->get_untransformed_body ();
4493 #ifdef ENABLE_CHECKING
4494 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4495 cg_edge
->callee
->verify ();
4498 /* We will be inlining this callee. */
4499 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4500 id
->assign_stmts
.create (0);
4502 /* Update the callers EH personality. */
4503 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4504 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4505 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4507 /* Split the block holding the GIMPLE_CALL. */
4508 e
= split_block (bb
, stmt
);
4510 return_block
= e
->dest
;
4513 /* split_block splits after the statement; work around this by
4514 moving the call into the second block manually. Not pretty,
4515 but seems easier than doing the CFG manipulation by hand
4516 when the GIMPLE_CALL is in the last statement of BB. */
4517 stmt_gsi
= gsi_last_bb (bb
);
4518 gsi_remove (&stmt_gsi
, false);
4520 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4521 been the source of abnormal edges. In this case, schedule
4522 the removal of dead abnormal edges. */
4523 gsi
= gsi_start_bb (return_block
);
4524 if (gsi_end_p (gsi
))
4526 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4527 purge_dead_abnormal_edges
= true;
4531 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4532 purge_dead_abnormal_edges
= false;
4535 stmt_gsi
= gsi_start_bb (return_block
);
4537 /* Build a block containing code to initialize the arguments, the
4538 actual inline expansion of the body, and a label for the return
4539 statements within the function to jump to. The type of the
4540 statement expression is the return type of the function call.
4541 ??? If the call does not have an associated block then we will
4542 remap all callee blocks to NULL, effectively dropping most of
4543 its debug information. This should only happen for calls to
4544 artificial decls inserted by the compiler itself. We need to
4545 either link the inlined blocks into the caller block tree or
4546 not refer to them in any way to not break GC for locations. */
4547 if (gimple_block (stmt
))
4549 id
->block
= make_node (BLOCK
);
4550 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4551 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
4552 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4555 /* Local declarations will be replaced by their equivalents in this
4558 id
->decl_map
= new hash_map
<tree
, tree
>;
4559 dst
= id
->debug_map
;
4560 id
->debug_map
= NULL
;
4562 /* Record the function we are about to inline. */
4564 id
->src_node
= cg_edge
->callee
;
4565 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4566 id
->call_stmt
= stmt
;
4568 /* If the the src function contains an IFN_VA_ARG, then so will the dst
4569 function after inlining. */
4570 if ((id
->src_cfun
->curr_properties
& PROP_gimple_lva
) == 0)
4572 struct function
*dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4573 dst_cfun
->curr_properties
&= ~PROP_gimple_lva
;
4576 gcc_assert (!id
->src_cfun
->after_inlining
);
4579 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4581 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4582 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4586 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4588 if (DECL_INITIAL (fn
))
4590 if (gimple_block (stmt
))
4594 prepend_lexical_block (id
->block
,
4595 remap_blocks (DECL_INITIAL (fn
), id
));
4596 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4597 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4599 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4600 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4601 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4602 under it. The parameters can be then evaluated in the debugger,
4603 but don't show in backtraces. */
4604 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4605 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4608 *var
= TREE_CHAIN (v
);
4609 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4610 BLOCK_VARS (id
->block
) = v
;
4613 var
= &TREE_CHAIN (*var
);
4616 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4619 /* Return statements in the function body will be replaced by jumps
4620 to the RET_LABEL. */
4621 gcc_assert (DECL_INITIAL (fn
));
4622 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4624 /* Find the LHS to which the result of this call is assigned. */
4626 if (gimple_call_lhs (stmt
))
4628 modify_dest
= gimple_call_lhs (stmt
);
4630 /* Remember where to copy returned bounds. */
4631 if (gimple_call_with_bounds_p (stmt
)
4632 && TREE_CODE (modify_dest
) == SSA_NAME
)
4634 gcall
*retbnd
= chkp_retbnd_call_by_val (modify_dest
);
4637 return_bounds
= gimple_call_lhs (retbnd
);
4638 /* If returned bounds are not used then just
4639 remove unused call. */
4642 gimple_stmt_iterator iter
= gsi_for_stmt (retbnd
);
4643 gsi_remove (&iter
, true);
4648 /* The function which we are inlining might not return a value,
4649 in which case we should issue a warning that the function
4650 does not return a value. In that case the optimizers will
4651 see that the variable to which the value is assigned was not
4652 initialized. We do not want to issue a warning about that
4653 uninitialized variable. */
4654 if (DECL_P (modify_dest
))
4655 TREE_NO_WARNING (modify_dest
) = 1;
4657 if (gimple_call_return_slot_opt_p (call_stmt
))
4659 return_slot
= modify_dest
;
4666 /* If we are inlining a call to the C++ operator new, we don't want
4667 to use type based alias analysis on the return value. Otherwise
4668 we may get confused if the compiler sees that the inlined new
4669 function returns a pointer which was just deleted. See bug
4671 if (DECL_IS_OPERATOR_NEW (fn
))
4677 /* Declare the return variable for the function. */
4678 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
,
4681 /* Add local vars in this inlined callee to caller. */
4682 add_local_variables (id
->src_cfun
, cfun
, id
);
4684 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4686 fprintf (dump_file
, "Inlining ");
4687 print_generic_expr (dump_file
, id
->src_fn
, 0);
4688 fprintf (dump_file
, " to ");
4689 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4690 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4693 /* This is it. Duplicate the callee body. Assume callee is
4694 pre-gimplified. Note that we must not alter the caller
4695 function in any way before this point, as this CALL_EXPR may be
4696 a self-referential call; if we're calling ourselves, we need to
4697 duplicate our body before altering anything. */
4698 copy_body (id
, cg_edge
->callee
->count
,
4699 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4700 bb
, return_block
, NULL
);
4702 reset_debug_bindings (id
, stmt_gsi
);
4704 /* Reset the escaped solution. */
4705 if (cfun
->gimple_df
)
4706 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4711 delete id
->debug_map
;
4712 id
->debug_map
= dst
;
4714 delete id
->decl_map
;
4717 /* Unlink the calls virtual operands before replacing it. */
4718 unlink_stmt_vdef (stmt
);
4719 if (gimple_vdef (stmt
)
4720 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4721 release_ssa_name (gimple_vdef (stmt
));
4723 /* If the inlined function returns a result that we care about,
4724 substitute the GIMPLE_CALL with an assignment of the return
4725 variable to the LHS of the call. That is, if STMT was
4726 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4727 if (use_retvar
&& gimple_call_lhs (stmt
))
4729 gimple old_stmt
= stmt
;
4730 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4731 gsi_replace (&stmt_gsi
, stmt
, false);
4732 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4734 /* Copy bounds if we copy structure with bounds. */
4735 if (chkp_function_instrumented_p (id
->dst_fn
)
4736 && !BOUNDED_P (use_retvar
)
4737 && chkp_type_has_pointer (TREE_TYPE (use_retvar
)))
4738 id
->assign_stmts
.safe_push (stmt
);
4742 /* Handle the case of inlining a function with no return
4743 statement, which causes the return value to become undefined. */
4744 if (gimple_call_lhs (stmt
)
4745 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4747 tree name
= gimple_call_lhs (stmt
);
4748 tree var
= SSA_NAME_VAR (name
);
4749 tree def
= ssa_default_def (cfun
, var
);
4753 /* If the variable is used undefined, make this name
4754 undefined via a move. */
4755 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4756 gsi_replace (&stmt_gsi
, stmt
, true);
4760 /* Otherwise make this variable undefined. */
4761 gsi_remove (&stmt_gsi
, true);
4762 set_ssa_default_def (cfun
, var
, name
);
4763 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4767 gsi_remove (&stmt_gsi
, true);
4770 /* Put returned bounds into the correct place if required. */
4773 gimple old_stmt
= SSA_NAME_DEF_STMT (return_bounds
);
4774 gimple new_stmt
= gimple_build_assign (return_bounds
, id
->retbnd
);
4775 gimple_stmt_iterator bnd_gsi
= gsi_for_stmt (old_stmt
);
4776 unlink_stmt_vdef (old_stmt
);
4777 gsi_replace (&bnd_gsi
, new_stmt
, false);
4778 maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
);
4779 cgraph_update_edges_for_call_stmt (old_stmt
,
4780 gimple_call_fndecl (old_stmt
),
4784 if (purge_dead_abnormal_edges
)
4786 gimple_purge_dead_eh_edges (return_block
);
4787 gimple_purge_dead_abnormal_call_edges (return_block
);
4790 /* If the value of the new expression is ignored, that's OK. We
4791 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4792 the equivalent inlined version either. */
4793 if (is_gimple_assign (stmt
))
4795 gcc_assert (gimple_assign_single_p (stmt
)
4796 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4797 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4800 /* Copy bounds for all generated assigns that need it. */
4801 for (i
= 0; i
< id
->assign_stmts
.length (); i
++)
4802 chkp_copy_bounds_for_assign (id
->assign_stmts
[i
], cg_edge
);
4803 id
->assign_stmts
.release ();
4805 /* Output the inlining info for this abstract function, since it has been
4806 inlined. If we don't do this now, we can lose the information about the
4807 variables in the function when the blocks get blown away as soon as we
4808 remove the cgraph node. */
4809 if (gimple_block (stmt
))
4810 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4812 /* Update callgraph if needed. */
4813 cg_edge
->callee
->remove ();
4815 id
->block
= NULL_TREE
;
4816 successfully_inlined
= TRUE
;
4819 input_location
= saved_location
;
4820 return successfully_inlined
;
4823 /* Expand call statements reachable from STMT_P.
4824 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4825 in a MODIFY_EXPR. */
4828 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4830 gimple_stmt_iterator gsi
;
4831 bool inlined
= false;
4833 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
4835 gimple stmt
= gsi_stmt (gsi
);
4838 if (is_gimple_call (stmt
)
4839 && !gimple_call_internal_p (stmt
))
4840 inlined
|= expand_call_inline (bb
, stmt
, id
);
4847 /* Walk all basic blocks created after FIRST and try to fold every statement
4848 in the STATEMENTS pointer set. */
4851 fold_marked_statements (int first
, hash_set
<gimple
> *statements
)
4853 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4854 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4856 gimple_stmt_iterator gsi
;
4858 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4861 if (statements
->contains (gsi_stmt (gsi
)))
4863 gimple old_stmt
= gsi_stmt (gsi
);
4864 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4866 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4868 /* Folding builtins can create multiple instructions,
4869 we need to look at all of them. */
4870 gimple_stmt_iterator i2
= gsi
;
4872 if (fold_stmt (&gsi
))
4875 /* If a builtin at the end of a bb folded into nothing,
4876 the following loop won't work. */
4877 if (gsi_end_p (gsi
))
4879 cgraph_update_edges_for_call_stmt (old_stmt
,
4884 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4889 new_stmt
= gsi_stmt (i2
);
4890 update_stmt (new_stmt
);
4891 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4894 if (new_stmt
== gsi_stmt (gsi
))
4896 /* It is okay to check only for the very last
4897 of these statements. If it is a throwing
4898 statement nothing will change. If it isn't
4899 this can remove EH edges. If that weren't
4900 correct then because some intermediate stmts
4901 throw, but not the last one. That would mean
4902 we'd have to split the block, which we can't
4903 here and we'd loose anyway. And as builtins
4904 probably never throw, this all
4906 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4908 gimple_purge_dead_eh_edges (
4909 BASIC_BLOCK_FOR_FN (cfun
, first
));
4916 else if (fold_stmt (&gsi
))
4918 /* Re-read the statement from GSI as fold_stmt() may
4920 gimple new_stmt
= gsi_stmt (gsi
);
4921 update_stmt (new_stmt
);
4923 if (is_gimple_call (old_stmt
)
4924 || is_gimple_call (new_stmt
))
4925 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4928 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4929 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
4936 /* Expand calls to inline functions in the body of FN. */
4939 optimize_inline_calls (tree fn
)
4943 int last
= n_basic_blocks_for_fn (cfun
);
4944 bool inlined_p
= false;
4947 memset (&id
, 0, sizeof (id
));
4949 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
4950 gcc_assert (id
.dst_node
->definition
);
4952 /* Or any functions that aren't finished yet. */
4953 if (current_function_decl
)
4954 id
.dst_fn
= current_function_decl
;
4956 id
.copy_decl
= copy_decl_maybe_to_var
;
4957 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4958 id
.transform_new_cfg
= false;
4959 id
.transform_return_to_modify
= true;
4960 id
.transform_parameter
= true;
4961 id
.transform_lang_insert_block
= NULL
;
4962 id
.statements_to_fold
= new hash_set
<gimple
>;
4964 push_gimplify_context ();
4966 /* We make no attempts to keep dominance info up-to-date. */
4967 free_dominance_info (CDI_DOMINATORS
);
4968 free_dominance_info (CDI_POST_DOMINATORS
);
4970 /* Register specific gimple functions. */
4971 gimple_register_cfg_hooks ();
4973 /* Reach the trees by walking over the CFG, and note the
4974 enclosing basic-blocks in the call edges. */
4975 /* We walk the blocks going forward, because inlined function bodies
4976 will split id->current_basic_block, and the new blocks will
4977 follow it; we'll trudge through them, processing their CALL_EXPRs
4979 FOR_EACH_BB_FN (bb
, cfun
)
4980 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4982 pop_gimplify_context (NULL
);
4984 #ifdef ENABLE_CHECKING
4986 struct cgraph_edge
*e
;
4988 id
.dst_node
->verify ();
4990 /* Double check that we inlined everything we are supposed to inline. */
4991 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4992 gcc_assert (e
->inline_failed
);
4996 /* Fold queued statements. */
4997 fold_marked_statements (last
, id
.statements_to_fold
);
4998 delete id
.statements_to_fold
;
5000 gcc_assert (!id
.debug_stmts
.exists ());
5002 /* If we didn't inline into the function there is nothing to do. */
5006 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5009 delete_unreachable_blocks_update_callgraph (&id
);
5010 #ifdef ENABLE_CHECKING
5011 id
.dst_node
->verify ();
5014 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5015 not possible yet - the IPA passes might make various functions to not
5016 throw and they don't care to proactively update local EH info. This is
5017 done later in fixup_cfg pass that also execute the verification. */
5018 return (TODO_update_ssa
5020 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5021 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
5022 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
5023 ? TODO_rebuild_frequencies
: 0));
5026 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5029 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5031 enum tree_code code
= TREE_CODE (*tp
);
5032 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5034 /* We make copies of most nodes. */
5035 if (IS_EXPR_CODE_CLASS (cl
)
5036 || code
== TREE_LIST
5038 || code
== TYPE_DECL
5039 || code
== OMP_CLAUSE
)
5041 /* Because the chain gets clobbered when we make a copy, we save it
5043 tree chain
= NULL_TREE
, new_tree
;
5045 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5046 chain
= TREE_CHAIN (*tp
);
5048 /* Copy the node. */
5049 new_tree
= copy_node (*tp
);
5053 /* Now, restore the chain, if appropriate. That will cause
5054 walk_tree to walk into the chain as well. */
5055 if (code
== PARM_DECL
5056 || code
== TREE_LIST
5057 || code
== OMP_CLAUSE
)
5058 TREE_CHAIN (*tp
) = chain
;
5060 /* For now, we don't update BLOCKs when we make copies. So, we
5061 have to nullify all BIND_EXPRs. */
5062 if (TREE_CODE (*tp
) == BIND_EXPR
)
5063 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5065 else if (code
== CONSTRUCTOR
)
5067 /* CONSTRUCTOR nodes need special handling because
5068 we need to duplicate the vector of elements. */
5071 new_tree
= copy_node (*tp
);
5072 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5075 else if (code
== STATEMENT_LIST
)
5076 /* We used to just abort on STATEMENT_LIST, but we can run into them
5077 with statement-expressions (c++/40975). */
5078 copy_statement_list (tp
);
5079 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5081 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5083 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5088 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5089 information indicating to what new SAVE_EXPR this one should be mapped,
5090 use that one. Otherwise, create a new node and enter it in ST. FN is
5091 the function into which the copy will be placed. */
5094 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5099 /* See if we already encountered this SAVE_EXPR. */
5102 /* If we didn't already remap this SAVE_EXPR, do so now. */
5105 t
= copy_node (*tp
);
5107 /* Remember this SAVE_EXPR. */
5109 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5114 /* We've already walked into this SAVE_EXPR; don't do it again. */
5119 /* Replace this SAVE_EXPR with the copy. */
5123 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5124 label, copies the declaration and enters it in the splay_tree in DATA (which
5125 is really a 'copy_body_data *'. */
5128 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5129 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5130 struct walk_stmt_info
*wi
)
5132 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5133 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5137 tree decl
= gimple_label_label (stmt
);
5139 /* Copy the decl and remember the copy. */
5140 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5147 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5148 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5149 remaps all local declarations to appropriate replacements in gimple
5153 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5155 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5156 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5157 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5161 /* Only a local declaration (variable or label). */
5162 if ((TREE_CODE (expr
) == VAR_DECL
5163 && !TREE_STATIC (expr
))
5164 || TREE_CODE (expr
) == LABEL_DECL
)
5166 /* Lookup the declaration. */
5169 /* If it's there, remap it. */
5174 else if (TREE_CODE (expr
) == STATEMENT_LIST
5175 || TREE_CODE (expr
) == BIND_EXPR
5176 || TREE_CODE (expr
) == SAVE_EXPR
)
5178 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5180 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5181 It's OK for this to happen if it was part of a subtree that
5182 isn't immediately expanded, such as operand 2 of another
5184 if (!TREE_OPERAND (expr
, 1))
5186 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5187 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5191 /* Keep iterating. */
5196 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5197 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5198 remaps all local declarations to appropriate replacements in gimple
5202 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5203 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5204 struct walk_stmt_info
*wi
)
5206 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5207 gimple gs
= gsi_stmt (*gsip
);
5209 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5211 tree block
= gimple_bind_block (stmt
);
5215 remap_block (&block
, id
);
5216 gimple_bind_set_block (stmt
, block
);
5219 /* This will remap a lot of the same decls again, but this should be
5221 if (gimple_bind_vars (stmt
))
5222 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
5226 /* Keep iterating. */
5231 /* Copies everything in SEQ and replaces variables and labels local to
5232 current_function_decl. */
5235 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5238 struct walk_stmt_info wi
;
5241 /* There's nothing to do for NULL_TREE. */
5246 memset (&id
, 0, sizeof (id
));
5247 id
.src_fn
= current_function_decl
;
5248 id
.dst_fn
= current_function_decl
;
5249 id
.decl_map
= new hash_map
<tree
, tree
>;
5250 id
.debug_map
= NULL
;
5252 id
.copy_decl
= copy_decl_no_change
;
5253 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5254 id
.transform_new_cfg
= false;
5255 id
.transform_return_to_modify
= false;
5256 id
.transform_parameter
= false;
5257 id
.transform_lang_insert_block
= NULL
;
5259 /* Walk the tree once to find local labels. */
5260 memset (&wi
, 0, sizeof (wi
));
5261 hash_set
<tree
> visited
;
5264 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5266 copy
= gimple_seq_copy (seq
);
5268 /* Walk the copy, remapping decls. */
5269 memset (&wi
, 0, sizeof (wi
));
5271 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5276 delete id
.debug_map
;
5277 if (id
.dependence_map
)
5279 delete id
.dependence_map
;
5280 id
.dependence_map
= NULL
;
5287 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5290 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5299 debug_find_tree (tree top
, tree search
)
5301 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5305 /* Declare the variables created by the inliner. Add all the variables in
5306 VARS to BIND_EXPR. */
5309 declare_inline_vars (tree block
, tree vars
)
5312 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5314 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5315 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5316 add_local_decl (cfun
, t
);
5320 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5323 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5324 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5325 VAR_DECL translation. */
5328 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5330 /* Don't generate debug information for the copy if we wouldn't have
5331 generated it for the copy either. */
5332 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5333 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5335 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5336 declaration inspired this copy. */
5337 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5339 /* The new variable/label has no RTL, yet. */
5340 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5341 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5342 SET_DECL_RTL (copy
, 0);
5344 /* These args would always appear unused, if not for this. */
5345 TREE_USED (copy
) = 1;
5347 /* Set the context for the new declaration. */
5348 if (!DECL_CONTEXT (decl
))
5349 /* Globals stay global. */
5351 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5352 /* Things that weren't in the scope of the function we're inlining
5353 from aren't in the scope we're inlining to, either. */
5355 else if (TREE_STATIC (decl
))
5356 /* Function-scoped static variables should stay in the original
5360 /* Ordinary automatic local variables are now in the scope of the
5362 DECL_CONTEXT (copy
) = id
->dst_fn
;
5368 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5372 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5373 || TREE_CODE (decl
) == RESULT_DECL
);
5375 type
= TREE_TYPE (decl
);
5377 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5378 VAR_DECL
, DECL_NAME (decl
), type
);
5379 if (DECL_PT_UID_SET_P (decl
))
5380 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5381 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5382 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5383 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5384 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5386 return copy_decl_for_dup_finish (id
, decl
, copy
);
5389 /* Like copy_decl_to_var, but create a return slot object instead of a
5390 pointer variable for return by invisible reference. */
5393 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5397 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5398 || TREE_CODE (decl
) == RESULT_DECL
);
5400 type
= TREE_TYPE (decl
);
5401 if (DECL_BY_REFERENCE (decl
))
5402 type
= TREE_TYPE (type
);
5404 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5405 VAR_DECL
, DECL_NAME (decl
), type
);
5406 if (DECL_PT_UID_SET_P (decl
))
5407 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5408 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5409 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5410 if (!DECL_BY_REFERENCE (decl
))
5412 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5413 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5416 return copy_decl_for_dup_finish (id
, decl
, copy
);
5420 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5424 copy
= copy_node (decl
);
5426 /* The COPY is not abstract; it will be generated in DST_FN. */
5427 DECL_ABSTRACT_P (copy
) = false;
5428 lang_hooks
.dup_lang_specific_decl (copy
);
5430 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5431 been taken; it's for internal bookkeeping in expand_goto_internal. */
5432 if (TREE_CODE (copy
) == LABEL_DECL
)
5434 TREE_ADDRESSABLE (copy
) = 0;
5435 LABEL_DECL_UID (copy
) = -1;
5438 return copy_decl_for_dup_finish (id
, decl
, copy
);
5442 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5444 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5445 return copy_decl_to_var (decl
, id
);
5447 return copy_decl_no_change (decl
, id
);
5450 /* Return a copy of the function's argument tree. */
5452 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5453 bitmap args_to_skip
, tree
*vars
)
5456 tree new_parm
= NULL
;
5461 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5462 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5464 tree new_tree
= remap_decl (arg
, id
);
5465 if (TREE_CODE (new_tree
) != PARM_DECL
)
5466 new_tree
= id
->copy_decl (arg
, id
);
5467 lang_hooks
.dup_lang_specific_decl (new_tree
);
5469 parg
= &DECL_CHAIN (new_tree
);
5471 else if (!id
->decl_map
->get (arg
))
5473 /* Make an equivalent VAR_DECL. If the argument was used
5474 as temporary variable later in function, the uses will be
5475 replaced by local variable. */
5476 tree var
= copy_decl_to_var (arg
, id
);
5477 insert_decl_map (id
, arg
, var
);
5478 /* Declare this new variable. */
5479 DECL_CHAIN (var
) = *vars
;
5485 /* Return a copy of the function's static chain. */
5487 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5489 tree
*chain_copy
, *pvar
;
5491 chain_copy
= &static_chain
;
5492 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5494 tree new_tree
= remap_decl (*pvar
, id
);
5495 lang_hooks
.dup_lang_specific_decl (new_tree
);
5496 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5499 return static_chain
;
5502 /* Return true if the function is allowed to be versioned.
5503 This is a guard for the versioning functionality. */
5506 tree_versionable_function_p (tree fndecl
)
5508 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5509 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
5512 /* Delete all unreachable basic blocks and update callgraph.
5513 Doing so is somewhat nontrivial because we need to update all clones and
5514 remove inline function that become unreachable. */
5517 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5519 bool changed
= false;
5520 basic_block b
, next_bb
;
5522 find_unreachable_blocks ();
5524 /* Delete all unreachable basic blocks. */
5526 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5527 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5529 next_bb
= b
->next_bb
;
5531 if (!(b
->flags
& BB_REACHABLE
))
5533 gimple_stmt_iterator bsi
;
5535 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5537 struct cgraph_edge
*e
;
5538 struct cgraph_node
*node
;
5540 id
->dst_node
->remove_stmt_references (gsi_stmt (bsi
));
5542 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5543 &&(e
= id
->dst_node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5545 if (!e
->inline_failed
)
5546 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5550 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5551 && id
->dst_node
->clones
)
5552 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5554 node
->remove_stmt_references (gsi_stmt (bsi
));
5555 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5556 && (e
= node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5558 if (!e
->inline_failed
)
5559 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5565 node
= node
->clones
;
5566 else if (node
->next_sibling_clone
)
5567 node
= node
->next_sibling_clone
;
5570 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5571 node
= node
->clone_of
;
5572 if (node
!= id
->dst_node
)
5573 node
= node
->next_sibling_clone
;
5577 delete_basic_block (b
);
5585 /* Update clone info after duplication. */
5588 update_clone_info (copy_body_data
* id
)
5590 struct cgraph_node
*node
;
5591 if (!id
->dst_node
->clones
)
5593 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5595 /* First update replace maps to match the new body. */
5596 if (node
->clone
.tree_map
)
5599 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5601 struct ipa_replace_map
*replace_info
;
5602 replace_info
= (*node
->clone
.tree_map
)[i
];
5603 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5604 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5608 node
= node
->clones
;
5609 else if (node
->next_sibling_clone
)
5610 node
= node
->next_sibling_clone
;
5613 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5614 node
= node
->clone_of
;
5615 if (node
!= id
->dst_node
)
5616 node
= node
->next_sibling_clone
;
5621 /* Create a copy of a function's tree.
5622 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5623 of the original function and the new copied function
5624 respectively. In case we want to replace a DECL
5625 tree with another tree while duplicating the function's
5626 body, TREE_MAP represents the mapping between these
5627 trees. If UPDATE_CLONES is set, the call_stmt fields
5628 of edges of clones of the function will be updated.
5630 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5632 If SKIP_RETURN is true, the new version will return void.
5633 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5634 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5637 tree_function_versioning (tree old_decl
, tree new_decl
,
5638 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
5639 bool update_clones
, bitmap args_to_skip
,
5640 bool skip_return
, bitmap blocks_to_copy
,
5641 basic_block new_entry
)
5643 struct cgraph_node
*old_version_node
;
5644 struct cgraph_node
*new_version_node
;
5648 struct ipa_replace_map
*replace_info
;
5649 basic_block old_entry_block
, bb
;
5650 auto_vec
<gimple
, 10> init_stmts
;
5651 tree vars
= NULL_TREE
;
5653 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5654 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5655 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5657 old_version_node
= cgraph_node::get (old_decl
);
5658 gcc_checking_assert (old_version_node
);
5659 new_version_node
= cgraph_node::get (new_decl
);
5660 gcc_checking_assert (new_version_node
);
5662 /* Copy over debug args. */
5663 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5665 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5666 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5667 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5668 old_debug_args
= decl_debug_args_lookup (old_decl
);
5671 new_debug_args
= decl_debug_args_insert (new_decl
);
5672 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5676 /* Output the inlining info for this abstract function, since it has been
5677 inlined. If we don't do this now, we can lose the information about the
5678 variables in the function when the blocks get blown away as soon as we
5679 remove the cgraph node. */
5680 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5682 DECL_ARTIFICIAL (new_decl
) = 1;
5683 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5684 if (DECL_ORIGIN (old_decl
) == old_decl
)
5685 old_version_node
->used_as_abstract_origin
= true;
5686 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5688 /* Prepare the data structures for the tree copy. */
5689 memset (&id
, 0, sizeof (id
));
5691 /* Generate a new name for the new version. */
5692 id
.statements_to_fold
= new hash_set
<gimple
>;
5694 id
.decl_map
= new hash_map
<tree
, tree
>;
5695 id
.debug_map
= NULL
;
5696 id
.src_fn
= old_decl
;
5697 id
.dst_fn
= new_decl
;
5698 id
.src_node
= old_version_node
;
5699 id
.dst_node
= new_version_node
;
5700 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5701 id
.blocks_to_copy
= blocks_to_copy
;
5703 id
.copy_decl
= copy_decl_no_change
;
5704 id
.transform_call_graph_edges
5705 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5706 id
.transform_new_cfg
= true;
5707 id
.transform_return_to_modify
= false;
5708 id
.transform_parameter
= false;
5709 id
.transform_lang_insert_block
= NULL
;
5711 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5712 (DECL_STRUCT_FUNCTION (old_decl
));
5713 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5714 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5715 initialize_cfun (new_decl
, old_decl
,
5716 old_entry_block
->count
);
5717 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
5718 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5719 = id
.src_cfun
->gimple_df
->ipa_pta
;
5721 /* Copy the function's static chain. */
5722 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5724 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5725 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5728 /* If there's a tree_map, prepare for substitution. */
5730 for (i
= 0; i
< tree_map
->length (); i
++)
5733 replace_info
= (*tree_map
)[i
];
5734 if (replace_info
->replace_p
)
5736 if (!replace_info
->old_tree
)
5738 int i
= replace_info
->parm_num
;
5742 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5744 replace_info
->old_tree
= parm
;
5745 req_type
= TREE_TYPE (parm
);
5746 if (!useless_type_conversion_p (req_type
, TREE_TYPE (replace_info
->new_tree
)))
5748 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5749 replace_info
->new_tree
= fold_build1 (NOP_EXPR
, req_type
, replace_info
->new_tree
);
5750 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (TREE_TYPE (replace_info
->new_tree
)))
5751 replace_info
->new_tree
= fold_build1 (VIEW_CONVERT_EXPR
, req_type
, replace_info
->new_tree
);
5756 fprintf (dump_file
, " const ");
5757 print_generic_expr (dump_file
, replace_info
->new_tree
, 0);
5758 fprintf (dump_file
, " can't be converted to param ");
5759 print_generic_expr (dump_file
, parm
, 0);
5760 fprintf (dump_file
, "\n");
5762 replace_info
->old_tree
= NULL
;
5767 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5768 if (replace_info
->old_tree
)
5770 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5771 replace_info
->new_tree
, id
.src_fn
,
5775 init_stmts
.safe_push (init
);
5779 /* Copy the function's arguments. */
5780 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5781 DECL_ARGUMENTS (new_decl
) =
5782 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5783 args_to_skip
, &vars
);
5785 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5786 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5788 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5790 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5791 /* Add local vars. */
5792 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5794 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5796 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5798 DECL_RESULT (new_decl
)
5799 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5800 RESULT_DECL
, NULL_TREE
, void_type_node
);
5801 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5802 cfun
->returns_struct
= 0;
5803 cfun
->returns_pcc_struct
= 0;
5808 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5809 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5810 if (gimple_in_ssa_p (id
.src_cfun
)
5811 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5812 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5814 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
5815 insert_decl_map (&id
, old_name
, new_name
);
5816 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5817 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5821 /* Set up the destination functions loop tree. */
5822 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5824 cfun
->curr_properties
&= ~PROP_loops
;
5825 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5826 cfun
->curr_properties
|= PROP_loops
;
5829 /* Copy the Function's body. */
5830 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5831 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
5834 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5835 number_blocks (new_decl
);
5837 /* We want to create the BB unconditionally, so that the addition of
5838 debug stmts doesn't affect BB count, which may in the end cause
5839 codegen differences. */
5840 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5841 while (init_stmts
.length ())
5842 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5843 update_clone_info (&id
);
5845 /* Remap the nonlocal_goto_save_area, if any. */
5846 if (cfun
->nonlocal_goto_save_area
)
5848 struct walk_stmt_info wi
;
5850 memset (&wi
, 0, sizeof (wi
));
5852 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5858 delete id
.debug_map
;
5859 free_dominance_info (CDI_DOMINATORS
);
5860 free_dominance_info (CDI_POST_DOMINATORS
);
5862 fold_marked_statements (0, id
.statements_to_fold
);
5863 delete id
.statements_to_fold
;
5864 fold_cond_expr_cond ();
5865 delete_unreachable_blocks_update_callgraph (&id
);
5866 if (id
.dst_node
->definition
)
5867 cgraph_edge::rebuild_references ();
5868 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
5870 calculate_dominance_info (CDI_DOMINATORS
);
5871 fix_loop_structure (NULL
);
5873 update_ssa (TODO_update_ssa
);
5875 /* After partial cloning we need to rescale frequencies, so they are
5876 within proper range in the cloned function. */
5879 struct cgraph_edge
*e
;
5880 rebuild_frequencies ();
5882 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5883 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5885 basic_block bb
= gimple_bb (e
->call_stmt
);
5886 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5888 e
->count
= bb
->count
;
5890 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5892 basic_block bb
= gimple_bb (e
->call_stmt
);
5893 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5895 e
->count
= bb
->count
;
5899 free_dominance_info (CDI_DOMINATORS
);
5900 free_dominance_info (CDI_POST_DOMINATORS
);
5902 gcc_assert (!id
.debug_stmts
.exists ());
5907 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5908 the callee and return the inlined body on success. */
5911 maybe_inline_call_in_expr (tree exp
)
5913 tree fn
= get_callee_fndecl (exp
);
5915 /* We can only try to inline "const" functions. */
5916 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5918 call_expr_arg_iterator iter
;
5921 hash_map
<tree
, tree
> decl_map
;
5923 /* Remap the parameters. */
5924 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5926 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5927 decl_map
.put (param
, arg
);
5929 memset (&id
, 0, sizeof (id
));
5931 id
.dst_fn
= current_function_decl
;
5932 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5933 id
.decl_map
= &decl_map
;
5935 id
.copy_decl
= copy_decl_no_change
;
5936 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5937 id
.transform_new_cfg
= false;
5938 id
.transform_return_to_modify
= true;
5939 id
.transform_parameter
= true;
5940 id
.transform_lang_insert_block
= NULL
;
5942 /* Make sure not to unshare trees behind the front-end's back
5943 since front-end specific mechanisms may rely on sharing. */
5944 id
.regimplify
= false;
5945 id
.do_not_unshare
= true;
5947 /* We're not inside any EH region. */
5950 t
= copy_tree_body (&id
);
5952 /* We can only return something suitable for use in a GENERIC
5954 if (TREE_CODE (t
) == MODIFY_EXPR
)
5955 return TREE_OPERAND (t
, 1);
5961 /* Duplicate a type, fields and all. */
5964 build_duplicate_type (tree type
)
5966 struct copy_body_data id
;
5968 memset (&id
, 0, sizeof (id
));
5969 id
.src_fn
= current_function_decl
;
5970 id
.dst_fn
= current_function_decl
;
5972 id
.decl_map
= new hash_map
<tree
, tree
>;
5973 id
.debug_map
= NULL
;
5974 id
.copy_decl
= copy_decl_no_change
;
5976 type
= remap_type_1 (type
, &id
);
5980 delete id
.debug_map
;
5982 TYPE_CANONICAL (type
) = type
;
5987 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
5988 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
5992 copy_fn (tree fn
, tree
& parms
, tree
& result
)
5996 hash_map
<tree
, tree
> decl_map
;
6001 memset (&id
, 0, sizeof (id
));
6003 id
.dst_fn
= current_function_decl
;
6004 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6005 id
.decl_map
= &decl_map
;
6007 id
.copy_decl
= copy_decl_no_change
;
6008 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6009 id
.transform_new_cfg
= false;
6010 id
.transform_return_to_modify
= false;
6011 id
.transform_parameter
= true;
6012 id
.transform_lang_insert_block
= NULL
;
6014 /* Make sure not to unshare trees behind the front-end's back
6015 since front-end specific mechanisms may rely on sharing. */
6016 id
.regimplify
= false;
6017 id
.do_not_unshare
= true;
6019 /* We're not inside any EH region. */
6022 /* Remap the parameters and result and return them to the caller. */
6023 for (param
= DECL_ARGUMENTS (fn
);
6025 param
= DECL_CHAIN (param
))
6027 *p
= remap_decl (param
, &id
);
6028 p
= &DECL_CHAIN (*p
);
6031 if (DECL_RESULT (fn
))
6032 result
= remap_decl (DECL_RESULT (fn
), &id
);
6036 return copy_tree_body (&id
);