2 Copyright (C) 2001-2022 Free Software Foundation, Inc.
3 Contributed by Alexandre Oliva <aoliva@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
30 #include "tree-pass.h"
33 #include "tree-pretty-print.h"
34 #include "diagnostic-core.h"
35 #include "gimple-predict.h"
36 #include "fold-const.h"
37 #include "stor-layout.h"
39 #include "tree-inline.h"
40 #include "langhooks.h"
42 #include "tree-iterator.h"
44 #include "gimple-fold.h"
47 #include "gimple-iterator.h"
48 #include "gimplify-me.h"
49 #include "gimple-walk.h"
51 #include "tree-into-ssa.h"
56 #include "value-prof.h"
59 #include "stringpool.h"
62 #include "tree-cfgcleanup.h"
63 #include "tree-ssa-live.h"
64 #include "alloc-pool.h"
65 #include "symbol-summary.h"
66 #include "symtab-thunks.h"
67 #include "symtab-clones.h"
69 /* I'm not real happy about this, but we need to handle gimple and
72 /* Inlining, Cloning, Versioning, Parallelization
74 Inlining: a function body is duplicated, but the PARM_DECLs are
75 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
76 MODIFY_EXPRs that store to a dedicated returned-value variable.
77 The duplicated eh_region info of the copy will later be appended
78 to the info for the caller; the eh_region info in copied throwing
79 statements and RESX statements are adjusted accordingly.
81 Cloning: (only in C++) We have one body for a con/de/structor, and
82 multiple function decls, each with a unique parameter list.
83 Duplicate the body, using the given splay tree; some parameters
84 will become constants (like 0 or 1).
86 Versioning: a function body is duplicated and the result is a new
87 function rather than into blocks of an existing function as with
88 inlining. Some parameters will become constants.
90 Parallelization: a region of a function is duplicated resulting in
91 a new function. Variables may be replaced with complex expressions
92 to enable shared variable semantics.
94 All of these will simultaneously lookup any callgraph edges. If
95 we're going to inline the duplicated function body, and the given
96 function has some cloned callgraph nodes (one for each place this
97 function will be inlined) those callgraph edges will be duplicated.
98 If we're cloning the body, those callgraph edges will be
99 updated to point into the new body. (Note that the original
100 callgraph node and edge list will not be altered.)
102 See the CALL_EXPR handling case in copy_tree_body_r (). */
106 o In order to make inlining-on-trees work, we pessimized
107 function-local static constants. In particular, they are now
108 always output, even when not addressed. Fix this by treating
109 function-local static constants just like global static
110 constants; the back-end already knows not to output them if they
113 o Provide heuristics to clamp inlining of recursive template
117 /* Weights that estimate_num_insns uses to estimate the size of the
120 eni_weights eni_size_weights
;
122 /* Weights that estimate_num_insns uses to estimate the time necessary
123 to execute the produced code. */
125 eni_weights eni_time_weights
;
129 static tree
declare_return_variable (copy_body_data
*, tree
, tree
,
131 static void remap_block (tree
*, copy_body_data
*);
132 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
133 static void declare_inline_vars (tree
, tree
);
134 static void remap_save_expr (tree
*, hash_map
<tree
, tree
> *, int *);
135 static void prepend_lexical_block (tree current_block
, tree new_block
);
136 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
137 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
138 static gimple_seq
remap_gimple_stmt (gimple
*, copy_body_data
*);
139 static void insert_init_stmt (copy_body_data
*, basic_block
, gimple
*);
141 /* Insert a tree->tree mapping for ID. Despite the name suggests
142 that the trees should be variables, it is used for more than that. */
145 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
147 id
->decl_map
->put (key
, value
);
149 /* Always insert an identity map as well. If we see this same new
150 node again, we won't want to duplicate it a second time. */
152 id
->decl_map
->put (value
, value
);
155 /* If nonzero, we're remapping the contents of inlined debug
156 statements. If negative, an error has occurred, such as a
157 reference to a variable that isn't available in the inlined
159 static int processing_debug_stmt
= 0;
161 /* Construct new SSA name for old NAME. ID is the inline context. */
164 remap_ssa_name (tree name
, copy_body_data
*id
)
169 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
171 n
= id
->decl_map
->get (name
);
174 /* WHen we perform edge redirection as part of CFG copy, IPA-SRA can
175 remove an unused LHS from a call statement. Such LHS can however
176 still appear in debug statements, but their value is lost in this
177 function and we do not want to map them. */
178 if (id
->killed_new_ssa_names
179 && id
->killed_new_ssa_names
->contains (*n
))
181 gcc_assert (processing_debug_stmt
);
182 processing_debug_stmt
= -1;
186 return unshare_expr (*n
);
189 if (processing_debug_stmt
)
191 if (SSA_NAME_IS_DEFAULT_DEF (name
)
192 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
193 && id
->entry_bb
== NULL
194 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
197 gimple_stmt_iterator gsi
;
198 tree val
= SSA_NAME_VAR (name
);
200 n
= id
->decl_map
->get (val
);
203 if (TREE_CODE (val
) != PARM_DECL
204 && !(VAR_P (val
) && DECL_ABSTRACT_ORIGIN (val
)))
206 processing_debug_stmt
= -1;
209 n
= id
->decl_map
->get (val
);
210 if (n
&& TREE_CODE (*n
) == DEBUG_EXPR_DECL
)
212 tree vexpr
= build_debug_expr_decl (TREE_TYPE (name
));
213 /* FIXME: Is setting the mode really necessary? */
214 SET_DECL_MODE (vexpr
, DECL_MODE (SSA_NAME_VAR (name
)));
215 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
216 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
217 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
218 insert_decl_map (id
, val
, vexpr
);
222 processing_debug_stmt
= -1;
226 /* Remap anonymous SSA names or SSA names of anonymous decls. */
227 var
= SSA_NAME_VAR (name
);
229 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
231 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
232 && DECL_ARTIFICIAL (var
)
233 && DECL_IGNORED_P (var
)
234 && !DECL_NAME (var
)))
236 struct ptr_info_def
*pi
;
237 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
));
238 if (!var
&& SSA_NAME_IDENTIFIER (name
))
239 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
240 insert_decl_map (id
, name
, new_tree
);
241 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
242 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
243 /* At least IPA points-to info can be directly transferred. */
244 if (id
->src_cfun
->gimple_df
245 && id
->src_cfun
->gimple_df
->ipa_pta
246 && POINTER_TYPE_P (TREE_TYPE (name
))
247 && (pi
= SSA_NAME_PTR_INFO (name
))
250 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
253 /* So can range-info. */
254 if (!POINTER_TYPE_P (TREE_TYPE (name
))
255 && SSA_NAME_RANGE_INFO (name
))
256 duplicate_ssa_name_range_info (new_tree
, SSA_NAME_RANGE_TYPE (name
),
257 SSA_NAME_RANGE_INFO (name
));
261 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
263 new_tree
= remap_decl (var
, id
);
265 /* We might've substituted constant or another SSA_NAME for
268 Replace the SSA name representing RESULT_DECL by variable during
269 inlining: this saves us from need to introduce PHI node in a case
270 return value is just partly initialized. */
271 if ((VAR_P (new_tree
) || TREE_CODE (new_tree
) == PARM_DECL
)
272 && (!SSA_NAME_VAR (name
)
273 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
274 || !id
->transform_return_to_modify
))
276 struct ptr_info_def
*pi
;
277 new_tree
= make_ssa_name (new_tree
);
278 insert_decl_map (id
, name
, new_tree
);
279 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
280 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
281 /* At least IPA points-to info can be directly transferred. */
282 if (id
->src_cfun
->gimple_df
283 && id
->src_cfun
->gimple_df
->ipa_pta
284 && POINTER_TYPE_P (TREE_TYPE (name
))
285 && (pi
= SSA_NAME_PTR_INFO (name
))
288 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
291 /* So can range-info. */
292 if (!POINTER_TYPE_P (TREE_TYPE (name
))
293 && SSA_NAME_RANGE_INFO (name
))
294 duplicate_ssa_name_range_info (new_tree
, SSA_NAME_RANGE_TYPE (name
),
295 SSA_NAME_RANGE_INFO (name
));
296 if (SSA_NAME_IS_DEFAULT_DEF (name
))
298 /* By inlining function having uninitialized variable, we might
299 extend the lifetime (variable might get reused). This cause
300 ICE in the case we end up extending lifetime of SSA name across
301 abnormal edge, but also increase register pressure.
303 We simply initialize all uninitialized vars by 0 except
304 for case we are inlining to very first BB. We can avoid
305 this for all BBs that are not inside strongly connected
306 regions of the CFG, but this is expensive to test. */
308 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
309 && (!SSA_NAME_VAR (name
)
310 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
311 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
313 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
315 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
317 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
319 init_stmt
= gimple_build_assign (new_tree
, zero
);
320 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
321 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
325 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
326 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
331 insert_decl_map (id
, name
, new_tree
);
335 /* Remap DECL during the copying of the BLOCK tree for the function. */
338 remap_decl (tree decl
, copy_body_data
*id
)
342 /* We only remap local variables in the current function. */
344 /* See if we have remapped this declaration. */
346 n
= id
->decl_map
->get (decl
);
348 if (!n
&& processing_debug_stmt
)
350 processing_debug_stmt
= -1;
354 /* When remapping a type within copy_gimple_seq_and_replace_locals, all
355 necessary DECLs have already been remapped and we do not want to duplicate
356 a decl coming from outside of the sequence we are copying. */
358 && id
->prevent_decl_creation_for_types
359 && id
->remapping_type_depth
> 0
360 && (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
))
363 /* If we didn't already have an equivalent for this declaration, create one
367 /* Make a copy of the variable or label. */
368 tree t
= id
->copy_decl (decl
, id
);
370 /* Remember it, so that if we encounter this local entity again
371 we can reuse this copy. Do this early because remap_type may
372 need this decl for TYPE_STUB_DECL. */
373 insert_decl_map (id
, decl
, t
);
378 /* Remap types, if necessary. */
379 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
380 if (TREE_CODE (t
) == TYPE_DECL
)
382 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
384 /* Preserve the invariant that DECL_ORIGINAL_TYPE != TREE_TYPE,
385 which is enforced in gen_typedef_die when DECL_ABSTRACT_ORIGIN
386 is not set on the TYPE_DECL, for example in LTO mode. */
387 if (DECL_ORIGINAL_TYPE (t
) == TREE_TYPE (t
))
389 tree x
= build_variant_type_copy (TREE_TYPE (t
));
390 TYPE_STUB_DECL (x
) = TYPE_STUB_DECL (TREE_TYPE (t
));
391 TYPE_NAME (x
) = TYPE_NAME (TREE_TYPE (t
));
392 DECL_ORIGINAL_TYPE (t
) = x
;
396 /* Remap sizes as necessary. */
397 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
398 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
400 /* If fields, do likewise for offset and qualifier. */
401 if (TREE_CODE (t
) == FIELD_DECL
)
403 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
404 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
405 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
411 if (id
->do_not_unshare
)
414 return unshare_expr (*n
);
418 remap_type_1 (tree type
, copy_body_data
*id
)
422 /* We do need a copy. build and register it now. If this is a pointer or
423 reference type, remap the designated type and make a new pointer or
425 if (TREE_CODE (type
) == POINTER_TYPE
)
427 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
429 TYPE_REF_CAN_ALIAS_ALL (type
));
430 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
431 new_tree
= build_type_attribute_qual_variant (new_tree
,
432 TYPE_ATTRIBUTES (type
),
434 insert_decl_map (id
, type
, new_tree
);
437 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
439 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
441 TYPE_REF_CAN_ALIAS_ALL (type
));
442 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
443 new_tree
= build_type_attribute_qual_variant (new_tree
,
444 TYPE_ATTRIBUTES (type
),
446 insert_decl_map (id
, type
, new_tree
);
450 new_tree
= copy_node (type
);
452 insert_decl_map (id
, type
, new_tree
);
454 /* This is a new type, not a copy of an old type. Need to reassociate
455 variants. We can handle everything except the main variant lazily. */
456 t
= TYPE_MAIN_VARIANT (type
);
459 t
= remap_type (t
, id
);
460 TYPE_MAIN_VARIANT (new_tree
) = t
;
461 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
462 TYPE_NEXT_VARIANT (t
) = new_tree
;
466 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
467 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
470 if (TYPE_STUB_DECL (type
))
471 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
473 /* Lazily create pointer and reference types. */
474 TYPE_POINTER_TO (new_tree
) = NULL
;
475 TYPE_REFERENCE_TO (new_tree
) = NULL
;
477 /* Copy all types that may contain references to local variables; be sure to
478 preserve sharing in between type and its main variant when possible. */
479 switch (TREE_CODE (new_tree
))
483 case FIXED_POINT_TYPE
:
486 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
488 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
489 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
491 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
492 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
496 t
= TYPE_MIN_VALUE (new_tree
);
497 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
498 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
500 t
= TYPE_MAX_VALUE (new_tree
);
501 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
502 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
507 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
508 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
509 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
511 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
512 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
513 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
514 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
516 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
520 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
521 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
522 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
524 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
526 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
528 gcc_checking_assert (TYPE_DOMAIN (type
)
529 == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
530 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
534 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
535 /* For array bounds where we have decided not to copy over the bounds
536 variable which isn't used in OpenMP/OpenACC region, change them to
537 an uninitialized VAR_DECL temporary. */
538 if (id
->adjust_array_error_bounds
539 && TYPE_DOMAIN (new_tree
)
540 && TYPE_MAX_VALUE (TYPE_DOMAIN (new_tree
)) == error_mark_node
541 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) != error_mark_node
)
543 tree v
= create_tmp_var (TREE_TYPE (TYPE_DOMAIN (new_tree
)));
545 = tree_cons (get_identifier ("omp dummy var"), NULL_TREE
,
546 DECL_ATTRIBUTES (v
));
547 TYPE_MAX_VALUE (TYPE_DOMAIN (new_tree
)) = v
;
554 case QUAL_UNION_TYPE
:
555 if (TYPE_MAIN_VARIANT (type
) != type
556 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
557 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
562 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
564 t
= remap_decl (f
, id
);
565 DECL_CONTEXT (t
) = new_tree
;
569 TYPE_FIELDS (new_tree
) = nreverse (nf
);
575 /* Shouldn't have been thought variable sized. */
579 /* All variants of type share the same size, so use the already remaped data. */
580 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
582 tree s
= TYPE_SIZE (type
);
583 tree mvs
= TYPE_SIZE (TYPE_MAIN_VARIANT (type
));
584 tree su
= TYPE_SIZE_UNIT (type
);
585 tree mvsu
= TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
));
586 gcc_checking_assert ((TREE_CODE (s
) == PLACEHOLDER_EXPR
587 && (TREE_CODE (mvs
) == PLACEHOLDER_EXPR
))
589 gcc_checking_assert ((TREE_CODE (su
) == PLACEHOLDER_EXPR
590 && (TREE_CODE (mvsu
) == PLACEHOLDER_EXPR
))
592 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
593 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
597 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
598 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
604 /* Helper function for remap_type_2, called through walk_tree. */
607 remap_type_3 (tree
*tp
, int *walk_subtrees
, void *data
)
609 copy_body_data
*id
= (copy_body_data
*) data
;
614 else if (DECL_P (*tp
) && remap_decl (*tp
, id
) != *tp
)
620 /* Return true if TYPE needs to be remapped because remap_decl on any
621 needed embedded decl returns something other than that decl. */
624 remap_type_2 (tree type
, copy_body_data
*id
)
628 #define RETURN_TRUE_IF_VAR(T) \
634 if (DECL_P (_t) && remap_decl (_t, id) != _t) \
636 if (!TYPE_SIZES_GIMPLIFIED (type) \
637 && walk_tree (&_t, remap_type_3, id, NULL)) \
643 switch (TREE_CODE (type
))
649 return remap_type_2 (TREE_TYPE (type
), id
);
653 case FIXED_POINT_TYPE
:
656 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
657 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
661 if (remap_type_2 (TREE_TYPE (type
), id
)
662 || (TYPE_DOMAIN (type
) && remap_type_2 (TYPE_DOMAIN (type
), id
)))
668 case QUAL_UNION_TYPE
:
669 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
670 if (TREE_CODE (t
) == FIELD_DECL
)
672 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
673 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
674 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
675 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
676 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
684 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
685 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
687 #undef RETURN_TRUE_IF_VAR
691 remap_type (tree type
, copy_body_data
*id
)
699 /* See if we have remapped this type. */
700 node
= id
->decl_map
->get (type
);
704 /* The type only needs remapping if it's variably modified. */
705 if (! variably_modified_type_p (type
, id
->src_fn
)
706 /* Don't remap if copy_decl method doesn't always return a new
707 decl and for all embedded decls returns the passed in decl. */
708 || (id
->dont_remap_vla_if_no_change
&& !remap_type_2 (type
, id
)))
710 insert_decl_map (id
, type
, type
);
714 id
->remapping_type_depth
++;
715 tmp
= remap_type_1 (type
, id
);
716 id
->remapping_type_depth
--;
721 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
724 can_be_nonlocal (tree decl
, copy_body_data
*id
)
726 /* We cannot duplicate function decls. */
727 if (TREE_CODE (decl
) == FUNCTION_DECL
)
730 /* Local static vars must be non-local or we get multiple declaration
732 if (VAR_P (decl
) && !auto_var_in_fn_p (decl
, id
->src_fn
))
739 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
743 tree new_decls
= NULL_TREE
;
745 /* Remap its variables. */
746 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
750 if (can_be_nonlocal (old_var
, id
))
752 /* We need to add this variable to the local decls as otherwise
753 nothing else will do so. */
754 if (VAR_P (old_var
) && ! DECL_EXTERNAL (old_var
) && cfun
)
755 add_local_decl (cfun
, old_var
);
756 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
757 && !DECL_IGNORED_P (old_var
)
758 && nonlocalized_list
)
759 vec_safe_push (*nonlocalized_list
, old_var
);
763 /* Remap the variable. */
764 new_var
= remap_decl (old_var
, id
);
766 /* If we didn't remap this variable, we can't mess with its
767 TREE_CHAIN. If we remapped this variable to the return slot, it's
768 already declared somewhere else, so don't declare it here. */
770 if (new_var
== id
->retvar
)
774 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
775 && !DECL_IGNORED_P (old_var
)
776 && nonlocalized_list
)
777 vec_safe_push (*nonlocalized_list
, old_var
);
781 gcc_assert (DECL_P (new_var
));
782 DECL_CHAIN (new_var
) = new_decls
;
785 /* Also copy value-expressions. */
786 if (VAR_P (new_var
) && DECL_HAS_VALUE_EXPR_P (new_var
))
788 tree tem
= DECL_VALUE_EXPR (new_var
);
789 bool old_regimplify
= id
->regimplify
;
790 id
->remapping_type_depth
++;
791 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
792 id
->remapping_type_depth
--;
793 id
->regimplify
= old_regimplify
;
794 SET_DECL_VALUE_EXPR (new_var
, tem
);
799 return nreverse (new_decls
);
802 /* Copy the BLOCK to contain remapped versions of the variables
803 therein. And hook the new block into the block-tree. */
806 remap_block (tree
*block
, copy_body_data
*id
)
811 /* Make the new block. */
813 new_block
= make_node (BLOCK
);
814 TREE_USED (new_block
) = TREE_USED (old_block
);
815 BLOCK_ABSTRACT_ORIGIN (new_block
) = BLOCK_ORIGIN (old_block
);
816 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
817 BLOCK_NONLOCALIZED_VARS (new_block
)
818 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
821 /* Remap its variables. */
822 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
823 &BLOCK_NONLOCALIZED_VARS (new_block
),
826 /* Remember the remapped block. */
827 insert_decl_map (id
, old_block
, new_block
);
830 /* Copy the whole block tree and root it in id->block. */
833 remap_blocks (tree block
, copy_body_data
*id
)
836 tree new_tree
= block
;
841 remap_block (&new_tree
, id
);
842 gcc_assert (new_tree
!= block
);
843 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
844 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
845 /* Blocks are in arbitrary order, but make things slightly prettier and do
846 not swap order when producing a copy. */
847 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
851 /* Remap the block tree rooted at BLOCK to nothing. */
854 remap_blocks_to_null (tree block
, copy_body_data
*id
)
857 insert_decl_map (id
, block
, NULL_TREE
);
858 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
859 remap_blocks_to_null (t
, id
);
862 /* Remap the location info pointed to by LOCUS. */
865 remap_location (location_t locus
, copy_body_data
*id
)
867 if (LOCATION_BLOCK (locus
))
869 tree
*n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
872 return set_block (locus
, *n
);
875 locus
= LOCATION_LOCUS (locus
);
877 if (locus
!= UNKNOWN_LOCATION
&& id
->block
)
878 return set_block (locus
, id
->block
);
884 copy_statement_list (tree
*tp
)
886 tree_stmt_iterator oi
, ni
;
889 new_tree
= alloc_stmt_list ();
890 ni
= tsi_start (new_tree
);
891 oi
= tsi_start (*tp
);
892 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
895 for (; !tsi_end_p (oi
); tsi_next (&oi
))
897 tree stmt
= tsi_stmt (oi
);
898 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
899 /* This copy is not redundant; tsi_link_after will smash this
900 STATEMENT_LIST into the end of the one we're building, and we
901 don't want to do that with the original. */
902 copy_statement_list (&stmt
);
903 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
908 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
910 tree block
= BIND_EXPR_BLOCK (*tp
);
911 /* Copy (and replace) the statement. */
912 copy_tree_r (tp
, walk_subtrees
, NULL
);
915 remap_block (&block
, id
);
916 BIND_EXPR_BLOCK (*tp
) = block
;
919 if (BIND_EXPR_VARS (*tp
))
920 /* This will remap a lot of the same decls again, but this should be
922 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
926 /* Create a new gimple_seq by remapping all the statements in BODY
927 using the inlining information in ID. */
930 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
932 gimple_stmt_iterator si
;
933 gimple_seq new_body
= NULL
;
935 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
937 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
938 gimple_seq_add_seq (&new_body
, new_stmts
);
945 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
946 block using the mapping information in ID. */
949 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
952 tree new_block
, new_vars
;
953 gimple_seq body
, new_body
;
955 /* Copy the statement. Note that we purposely don't use copy_stmt
956 here because we need to remap statements as we copy. */
957 body
= gimple_bind_body (stmt
);
958 new_body
= remap_gimple_seq (body
, id
);
960 new_block
= gimple_bind_block (stmt
);
962 remap_block (&new_block
, id
);
964 /* This will remap a lot of the same decls again, but this should be
966 new_vars
= gimple_bind_vars (stmt
);
968 new_vars
= remap_decls (new_vars
, NULL
, id
);
970 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
975 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
980 if (TREE_CODE (decl
) == SSA_NAME
)
982 decl
= SSA_NAME_VAR (decl
);
987 return (TREE_CODE (decl
) == PARM_DECL
);
990 /* Remap the dependence CLIQUE from the source to the destination function
991 as specified in ID. */
993 static unsigned short
994 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
996 if (clique
== 0 || processing_debug_stmt
)
998 if (!id
->dependence_map
)
999 id
->dependence_map
= new hash_map
<dependence_hash
, unsigned short>;
1001 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
1004 /* Clique 1 is reserved for local ones set by PTA. */
1005 if (cfun
->last_clique
== 0)
1006 cfun
->last_clique
= 1;
1007 newc
= ++cfun
->last_clique
;
1012 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
1013 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
1014 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
1015 recursing into the children nodes of *TP. */
1018 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
1020 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
1021 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
1022 tree fn
= id
->src_fn
;
1024 /* For recursive invocations this is no longer the LHS itself. */
1025 bool is_lhs
= wi_p
->is_lhs
;
1026 wi_p
->is_lhs
= false;
1028 if (TREE_CODE (*tp
) == SSA_NAME
)
1030 *tp
= remap_ssa_name (*tp
, id
);
1033 SSA_NAME_DEF_STMT (*tp
) = wi_p
->stmt
;
1036 else if (auto_var_in_fn_p (*tp
, fn
))
1038 /* Local variables and labels need to be replaced by equivalent
1039 variables. We don't want to copy static variables; there's
1040 only one of those, no matter how many times we inline the
1041 containing function. Similarly for globals from an outer
1045 /* Remap the declaration. */
1046 new_decl
= remap_decl (*tp
, id
);
1047 gcc_assert (new_decl
);
1048 /* Replace this variable with the copy. */
1049 STRIP_TYPE_NOPS (new_decl
);
1050 /* ??? The C++ frontend uses void * pointer zero to initialize
1051 any other type. This confuses the middle-end type verification.
1052 As cloned bodies do not go through gimplification again the fixup
1053 there doesn't trigger. */
1054 if (TREE_CODE (new_decl
) == INTEGER_CST
1055 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
1056 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
1060 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1062 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
1064 else if (TREE_CODE (*tp
) == LABEL_DECL
1065 && (!DECL_CONTEXT (*tp
)
1066 || decl_function_context (*tp
) == id
->src_fn
))
1067 /* These may need to be remapped for EH handling. */
1068 *tp
= remap_decl (*tp
, id
);
1069 else if (TREE_CODE (*tp
) == FIELD_DECL
)
1071 /* If the enclosing record type is variably_modified_type_p, the field
1072 has already been remapped. Otherwise, it need not be. */
1073 tree
*n
= id
->decl_map
->get (*tp
);
1078 else if (TYPE_P (*tp
))
1079 /* Types may need remapping as well. */
1080 *tp
= remap_type (*tp
, id
);
1081 else if (CONSTANT_CLASS_P (*tp
))
1083 /* If this is a constant, we have to copy the node iff the type
1084 will be remapped. copy_tree_r will not copy a constant. */
1085 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1087 if (new_type
== TREE_TYPE (*tp
))
1090 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1091 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1094 *tp
= copy_node (*tp
);
1095 TREE_TYPE (*tp
) = new_type
;
1100 /* Otherwise, just copy the node. Note that copy_tree_r already
1101 knows not to copy VAR_DECLs, etc., so this is safe. */
1103 if (TREE_CODE (*tp
) == MEM_REF
&& !id
->do_not_fold
)
1105 /* We need to re-canonicalize MEM_REFs from inline substitutions
1106 that can happen when a pointer argument is an ADDR_EXPR.
1107 Recurse here manually to allow that. */
1108 tree ptr
= TREE_OPERAND (*tp
, 0);
1109 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1111 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
1112 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1113 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1114 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1115 copy_warning (*tp
, old
);
1116 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1118 MR_DEPENDENCE_CLIQUE (*tp
)
1119 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1120 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1122 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1123 remapped a parameter as the property might be valid only
1124 for the parameter itself. */
1125 if (TREE_THIS_NOTRAP (old
)
1126 && (!is_parm (TREE_OPERAND (old
, 0))
1127 || (!id
->transform_parameter
&& is_parm (ptr
))))
1128 TREE_THIS_NOTRAP (*tp
) = 1;
1129 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1134 /* Here is the "usual case". Copy this tree node, and then
1135 tweak some special cases. */
1136 copy_tree_r (tp
, walk_subtrees
, NULL
);
1138 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1139 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1141 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1143 /* The copied TARGET_EXPR has never been expanded, even if the
1144 original node was expanded already. */
1145 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1146 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1148 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1150 /* Variable substitution need not be simple. In particular,
1151 the MEM_REF substitution above. Make sure that
1152 TREE_CONSTANT and friends are up-to-date. */
1153 int invariant
= is_gimple_min_invariant (*tp
);
1154 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
1155 recompute_tree_invariant_for_addr_expr (*tp
);
1157 /* If this used to be invariant, but is not any longer,
1158 then regimplification is probably needed. */
1159 if (invariant
&& !is_gimple_min_invariant (*tp
))
1160 id
->regimplify
= true;
1166 /* Update the TREE_BLOCK for the cloned expr. */
1169 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1170 tree old_block
= TREE_BLOCK (*tp
);
1174 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1178 TREE_SET_BLOCK (*tp
, new_block
);
1181 /* Keep iterating. */
1186 /* Called from copy_body_id via walk_tree. DATA is really a
1187 `copy_body_data *'. */
1190 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1192 copy_body_data
*id
= (copy_body_data
*) data
;
1193 tree fn
= id
->src_fn
;
1196 /* Begin by recognizing trees that we'll completely rewrite for the
1197 inlining context. Our output for these trees is completely
1198 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1199 into an edge). Further down, we'll handle trees that get
1200 duplicated and/or tweaked. */
1202 /* When requested, RETURN_EXPRs should be transformed to just the
1203 contained MODIFY_EXPR. The branch semantics of the return will
1204 be handled elsewhere by manipulating the CFG rather than a statement. */
1205 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1207 tree assignment
= TREE_OPERAND (*tp
, 0);
1209 /* If we're returning something, just turn that into an
1210 assignment into the equivalent of the original RESULT_DECL.
1211 If the "assignment" is just the result decl, the result
1212 decl has already been set (e.g. a recent "foo (&result_decl,
1213 ...)"); just toss the entire RETURN_EXPR. */
1214 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1216 /* Replace the RETURN_EXPR with (a copy of) the
1217 MODIFY_EXPR hanging underneath. */
1218 *tp
= copy_node (assignment
);
1220 else /* Else the RETURN_EXPR returns no value. */
1223 return (tree
) (void *)1;
1226 else if (TREE_CODE (*tp
) == SSA_NAME
)
1228 *tp
= remap_ssa_name (*tp
, id
);
1233 /* Local variables and labels need to be replaced by equivalent
1234 variables. We don't want to copy static variables; there's only
1235 one of those, no matter how many times we inline the containing
1236 function. Similarly for globals from an outer function. */
1237 else if (auto_var_in_fn_p (*tp
, fn
))
1241 /* Remap the declaration. */
1242 new_decl
= remap_decl (*tp
, id
);
1243 gcc_assert (new_decl
);
1244 /* Replace this variable with the copy. */
1245 STRIP_TYPE_NOPS (new_decl
);
1249 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1250 copy_statement_list (tp
);
1251 else if (TREE_CODE (*tp
) == SAVE_EXPR
1252 || TREE_CODE (*tp
) == TARGET_EXPR
)
1253 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1254 else if (TREE_CODE (*tp
) == LABEL_DECL
1255 && (! DECL_CONTEXT (*tp
)
1256 || decl_function_context (*tp
) == id
->src_fn
))
1257 /* These may need to be remapped for EH handling. */
1258 *tp
= remap_decl (*tp
, id
);
1259 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1260 copy_bind_expr (tp
, walk_subtrees
, id
);
1261 /* Types may need remapping as well. */
1262 else if (TYPE_P (*tp
))
1263 *tp
= remap_type (*tp
, id
);
1265 /* If this is a constant, we have to copy the node iff the type will be
1266 remapped. copy_tree_r will not copy a constant. */
1267 else if (CONSTANT_CLASS_P (*tp
))
1269 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1271 if (new_type
== TREE_TYPE (*tp
))
1274 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1275 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1278 *tp
= copy_node (*tp
);
1279 TREE_TYPE (*tp
) = new_type
;
1283 /* Otherwise, just copy the node. Note that copy_tree_r already
1284 knows not to copy VAR_DECLs, etc., so this is safe. */
1287 /* Here we handle trees that are not completely rewritten.
1288 First we detect some inlining-induced bogosities for
1290 if (TREE_CODE (*tp
) == MODIFY_EXPR
1291 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1292 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1294 /* Some assignments VAR = VAR; don't generate any rtl code
1295 and thus don't count as variable modification. Avoid
1296 keeping bogosities like 0 = 0. */
1297 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1300 n
= id
->decl_map
->get (decl
);
1304 STRIP_TYPE_NOPS (value
);
1305 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1307 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1308 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1312 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1314 /* Get rid of *& from inline substitutions that can happen when a
1315 pointer argument is an ADDR_EXPR. */
1316 tree decl
= TREE_OPERAND (*tp
, 0);
1317 tree
*n
= id
->decl_map
->get (decl
);
1320 /* If we happen to get an ADDR_EXPR in n->value, strip
1321 it manually here as we'll eventually get ADDR_EXPRs
1322 which lie about their types pointed to. In this case
1323 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1324 but we absolutely rely on that. As fold_indirect_ref
1325 does other useful transformations, try that first, though. */
1326 tree type
= TREE_TYPE (*tp
);
1327 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1329 *tp
= id
->do_not_fold
? NULL
: gimple_fold_indirect_ref (ptr
);
1332 type
= remap_type (type
, id
);
1333 if (TREE_CODE (ptr
) == ADDR_EXPR
&& !id
->do_not_fold
)
1336 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1337 /* ??? We should either assert here or build
1338 a VIEW_CONVERT_EXPR instead of blindly leaking
1339 incompatible types to our IL. */
1341 *tp
= TREE_OPERAND (ptr
, 0);
1345 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1346 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1347 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1348 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1349 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1350 have remapped a parameter as the property might be
1351 valid only for the parameter itself. */
1352 if (TREE_THIS_NOTRAP (old
)
1353 && (!is_parm (TREE_OPERAND (old
, 0))
1354 || (!id
->transform_parameter
&& is_parm (ptr
))))
1355 TREE_THIS_NOTRAP (*tp
) = 1;
1362 else if (TREE_CODE (*tp
) == MEM_REF
&& !id
->do_not_fold
)
1364 /* We need to re-canonicalize MEM_REFs from inline substitutions
1365 that can happen when a pointer argument is an ADDR_EXPR.
1366 Recurse here manually to allow that. */
1367 tree ptr
= TREE_OPERAND (*tp
, 0);
1368 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1370 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1371 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1372 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1373 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1374 copy_warning (*tp
, old
);
1375 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1377 MR_DEPENDENCE_CLIQUE (*tp
)
1378 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1379 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1381 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1382 remapped a parameter as the property might be valid only
1383 for the parameter itself. */
1384 if (TREE_THIS_NOTRAP (old
)
1385 && (!is_parm (TREE_OPERAND (old
, 0))
1386 || (!id
->transform_parameter
&& is_parm (ptr
))))
1387 TREE_THIS_NOTRAP (*tp
) = 1;
1388 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1393 /* Here is the "usual case". Copy this tree node, and then
1394 tweak some special cases. */
1395 copy_tree_r (tp
, walk_subtrees
, NULL
);
1397 /* If EXPR has block defined, map it to newly constructed block.
1398 When inlining we want EXPRs without block appear in the block
1399 of function call if we are not remapping a type. */
1402 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1403 if (TREE_BLOCK (*tp
))
1406 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1410 TREE_SET_BLOCK (*tp
, new_block
);
1413 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1414 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1416 /* The copied TARGET_EXPR has never been expanded, even if the
1417 original node was expanded already. */
1418 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1420 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1421 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1424 /* Variable substitution need not be simple. In particular, the
1425 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1426 and friends are up-to-date. */
1427 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1429 int invariant
= is_gimple_min_invariant (*tp
);
1430 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1432 /* Handle the case where we substituted an INDIRECT_REF
1433 into the operand of the ADDR_EXPR. */
1434 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
1435 && !id
->do_not_fold
)
1437 tree t
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1438 if (TREE_TYPE (t
) != TREE_TYPE (*tp
))
1439 t
= fold_convert (remap_type (TREE_TYPE (*tp
), id
), t
);
1443 recompute_tree_invariant_for_addr_expr (*tp
);
1445 /* If this used to be invariant, but is not any longer,
1446 then regimplification is probably needed. */
1447 if (invariant
&& !is_gimple_min_invariant (*tp
))
1448 id
->regimplify
= true;
1452 else if (TREE_CODE (*tp
) == OMP_CLAUSE
1453 && (OMP_CLAUSE_CODE (*tp
) == OMP_CLAUSE_AFFINITY
1454 || OMP_CLAUSE_CODE (*tp
) == OMP_CLAUSE_DEPEND
))
1456 tree t
= OMP_CLAUSE_DECL (*tp
);
1458 && TREE_CODE (t
) == TREE_LIST
1460 && TREE_CODE (TREE_PURPOSE (t
)) == TREE_VEC
)
1463 OMP_CLAUSE_DECL (*tp
) = copy_node (t
);
1464 t
= OMP_CLAUSE_DECL (*tp
);
1465 TREE_PURPOSE (t
) = copy_node (TREE_PURPOSE (t
));
1466 for (int i
= 0; i
<= 4; i
++)
1467 walk_tree (&TREE_VEC_ELT (TREE_PURPOSE (t
), i
),
1468 copy_tree_body_r
, id
, NULL
);
1469 if (TREE_VEC_ELT (TREE_PURPOSE (t
), 5))
1470 remap_block (&TREE_VEC_ELT (TREE_PURPOSE (t
), 5), id
);
1471 walk_tree (&TREE_VALUE (t
), copy_tree_body_r
, id
, NULL
);
1476 /* Keep iterating. */
1480 /* Helper for remap_gimple_stmt. Given an EH region number for the
1481 source function, map that to the duplicate EH region number in
1482 the destination function. */
1485 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1487 eh_region old_r
, new_r
;
1489 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1490 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1492 return new_r
->index
;
1495 /* Similar, but operate on INTEGER_CSTs. */
1498 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1502 old_nr
= tree_to_shwi (old_t_nr
);
1503 new_nr
= remap_eh_region_nr (old_nr
, id
);
1505 return build_int_cst (integer_type_node
, new_nr
);
1508 /* Helper for copy_bb. Remap statement STMT using the inlining
1509 information in ID. Return the new statement copy. */
1512 remap_gimple_stmt (gimple
*stmt
, copy_body_data
*id
)
1514 gimple
*copy
= NULL
;
1515 struct walk_stmt_info wi
;
1516 bool skip_first
= false;
1517 gimple_seq stmts
= NULL
;
1519 if (is_gimple_debug (stmt
)
1520 && (gimple_debug_nonbind_marker_p (stmt
)
1521 ? !DECL_STRUCT_FUNCTION (id
->dst_fn
)->debug_nonbind_markers
1522 : !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
)))
1525 if (!is_gimple_debug (stmt
)
1526 && id
->param_body_adjs
1527 && id
->param_body_adjs
->m_dead_stmts
.contains (stmt
))
1529 tree
*dval
= id
->param_body_adjs
->m_dead_stmt_debug_equiv
.get (stmt
);
1533 gcc_assert (is_gimple_assign (stmt
));
1534 tree lhs
= gimple_assign_lhs (stmt
);
1535 tree
*dvar
= id
->param_body_adjs
->m_dead_ssa_debug_equiv
.get (lhs
);
1536 gdebug
*bind
= gimple_build_debug_bind (*dvar
, *dval
, stmt
);
1537 if (id
->reset_location
)
1538 gimple_set_location (bind
, input_location
);
1539 id
->debug_stmts
.safe_push (bind
);
1540 gimple_seq_add_stmt (&stmts
, bind
);
1544 /* Begin by recognizing trees that we'll completely rewrite for the
1545 inlining context. Our output for these trees is completely
1546 different from our input (e.g. RETURN_EXPR is deleted and morphs
1547 into an edge). Further down, we'll handle trees that get
1548 duplicated and/or tweaked. */
1550 /* When requested, GIMPLE_RETURN should be transformed to just the
1551 contained GIMPLE_ASSIGN. The branch semantics of the return will
1552 be handled elsewhere by manipulating the CFG rather than the
1554 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1556 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1558 /* If we're returning something, just turn that into an
1559 assignment to the equivalent of the original RESULT_DECL.
1560 If RETVAL is just the result decl, the result decl has
1561 already been set (e.g. a recent "foo (&result_decl, ...)");
1562 just toss the entire GIMPLE_RETURN. Likewise for when the
1563 call doesn't want the return value. */
1565 && (TREE_CODE (retval
) != RESULT_DECL
1567 || gimple_call_lhs (id
->call_stmt
) != NULL_TREE
)
1568 && (TREE_CODE (retval
) != SSA_NAME
1569 || ! SSA_NAME_VAR (retval
)
1570 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1572 copy
= gimple_build_assign (id
->do_not_unshare
1573 ? id
->retvar
: unshare_expr (id
->retvar
),
1575 /* id->retvar is already substituted. Skip it on later remapping. */
1581 else if (gimple_has_substatements (stmt
))
1585 /* When cloning bodies from the C++ front end, we will be handed bodies
1586 in High GIMPLE form. Handle here all the High GIMPLE statements that
1587 have embedded statements. */
1588 switch (gimple_code (stmt
))
1591 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1596 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1597 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1598 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1602 case GIMPLE_EH_FILTER
:
1603 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1604 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1608 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1609 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1610 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1613 case GIMPLE_WITH_CLEANUP_EXPR
:
1614 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1615 copy
= gimple_build_wce (s1
);
1618 case GIMPLE_OMP_PARALLEL
:
1620 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1621 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1622 copy
= gimple_build_omp_parallel
1624 gimple_omp_parallel_clauses (omp_par_stmt
),
1625 gimple_omp_parallel_child_fn (omp_par_stmt
),
1626 gimple_omp_parallel_data_arg (omp_par_stmt
));
1630 case GIMPLE_OMP_TASK
:
1631 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1632 copy
= gimple_build_omp_task
1634 gimple_omp_task_clauses (stmt
),
1635 gimple_omp_task_child_fn (stmt
),
1636 gimple_omp_task_data_arg (stmt
),
1637 gimple_omp_task_copy_fn (stmt
),
1638 gimple_omp_task_arg_size (stmt
),
1639 gimple_omp_task_arg_align (stmt
));
1642 case GIMPLE_OMP_FOR
:
1643 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1644 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1645 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1646 gimple_omp_for_clauses (stmt
),
1647 gimple_omp_for_collapse (stmt
), s2
);
1650 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1652 gimple_omp_for_set_index (copy
, i
,
1653 gimple_omp_for_index (stmt
, i
));
1654 gimple_omp_for_set_initial (copy
, i
,
1655 gimple_omp_for_initial (stmt
, i
));
1656 gimple_omp_for_set_final (copy
, i
,
1657 gimple_omp_for_final (stmt
, i
));
1658 gimple_omp_for_set_incr (copy
, i
,
1659 gimple_omp_for_incr (stmt
, i
));
1660 gimple_omp_for_set_cond (copy
, i
,
1661 gimple_omp_for_cond (stmt
, i
));
1666 case GIMPLE_OMP_MASTER
:
1667 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1668 copy
= gimple_build_omp_master (s1
);
1671 case GIMPLE_OMP_MASKED
:
1672 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1673 copy
= gimple_build_omp_masked
1674 (s1
, gimple_omp_masked_clauses (stmt
));
1677 case GIMPLE_OMP_SCOPE
:
1678 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1679 copy
= gimple_build_omp_scope
1680 (s1
, gimple_omp_scope_clauses (stmt
));
1683 case GIMPLE_OMP_TASKGROUP
:
1684 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1685 copy
= gimple_build_omp_taskgroup
1686 (s1
, gimple_omp_taskgroup_clauses (stmt
));
1689 case GIMPLE_OMP_ORDERED
:
1690 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1691 copy
= gimple_build_omp_ordered
1693 gimple_omp_ordered_clauses (as_a
<gomp_ordered
*> (stmt
)));
1696 case GIMPLE_OMP_SCAN
:
1697 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1698 copy
= gimple_build_omp_scan
1699 (s1
, gimple_omp_scan_clauses (as_a
<gomp_scan
*> (stmt
)));
1702 case GIMPLE_OMP_SECTION
:
1703 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1704 copy
= gimple_build_omp_section (s1
);
1707 case GIMPLE_OMP_SECTIONS
:
1708 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1709 copy
= gimple_build_omp_sections
1710 (s1
, gimple_omp_sections_clauses (stmt
));
1713 case GIMPLE_OMP_SINGLE
:
1714 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1715 copy
= gimple_build_omp_single
1716 (s1
, gimple_omp_single_clauses (stmt
));
1719 case GIMPLE_OMP_TARGET
:
1720 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1721 copy
= gimple_build_omp_target
1722 (s1
, gimple_omp_target_kind (stmt
),
1723 gimple_omp_target_clauses (stmt
));
1726 case GIMPLE_OMP_TEAMS
:
1727 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1728 copy
= gimple_build_omp_teams
1729 (s1
, gimple_omp_teams_clauses (stmt
));
1732 case GIMPLE_OMP_CRITICAL
:
1733 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1734 copy
= gimple_build_omp_critical (s1
,
1735 gimple_omp_critical_name
1736 (as_a
<gomp_critical
*> (stmt
)),
1737 gimple_omp_critical_clauses
1738 (as_a
<gomp_critical
*> (stmt
)));
1741 case GIMPLE_TRANSACTION
:
1743 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1744 gtransaction
*new_trans_stmt
;
1745 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1747 copy
= new_trans_stmt
= gimple_build_transaction (s1
);
1748 gimple_transaction_set_subcode (new_trans_stmt
,
1749 gimple_transaction_subcode (old_trans_stmt
));
1750 gimple_transaction_set_label_norm (new_trans_stmt
,
1751 gimple_transaction_label_norm (old_trans_stmt
));
1752 gimple_transaction_set_label_uninst (new_trans_stmt
,
1753 gimple_transaction_label_uninst (old_trans_stmt
));
1754 gimple_transaction_set_label_over (new_trans_stmt
,
1755 gimple_transaction_label_over (old_trans_stmt
));
1765 if (gimple_assign_copy_p (stmt
)
1766 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1767 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1769 /* Here we handle statements that are not completely rewritten.
1770 First we detect some inlining-induced bogosities for
1773 /* Some assignments VAR = VAR; don't generate any rtl code
1774 and thus don't count as variable modification. Avoid
1775 keeping bogosities like 0 = 0. */
1776 tree decl
= gimple_assign_lhs (stmt
), value
;
1779 n
= id
->decl_map
->get (decl
);
1783 STRIP_TYPE_NOPS (value
);
1784 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1789 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1790 in a block that we aren't copying during tree_function_versioning,
1791 just drop the clobber stmt. */
1792 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1794 tree lhs
= gimple_assign_lhs (stmt
);
1795 if (TREE_CODE (lhs
) == MEM_REF
1796 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1798 gimple
*def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1799 if (gimple_bb (def_stmt
)
1800 && !bitmap_bit_p (id
->blocks_to_copy
,
1801 gimple_bb (def_stmt
)->index
))
1806 /* We do not allow CLOBBERs of handled components. In case
1807 returned value is stored via such handled component, remove
1808 the clobber so stmt verifier is happy. */
1809 if (gimple_clobber_p (stmt
)
1810 && TREE_CODE (gimple_assign_lhs (stmt
)) == RESULT_DECL
)
1812 tree remapped
= remap_decl (gimple_assign_lhs (stmt
), id
);
1813 if (!DECL_P (remapped
)
1814 && TREE_CODE (remapped
) != MEM_REF
)
1818 if (gimple_debug_bind_p (stmt
))
1820 tree var
= gimple_debug_bind_get_var (stmt
);
1821 tree value
= gimple_debug_bind_get_value (stmt
);
1822 if (id
->param_body_adjs
1823 && id
->param_body_adjs
->m_dead_stmts
.contains (stmt
))
1825 value
= unshare_expr_without_location (value
);
1826 id
->param_body_adjs
->remap_with_debug_expressions (&value
);
1829 gdebug
*copy
= gimple_build_debug_bind (var
, value
, stmt
);
1830 if (id
->reset_location
)
1831 gimple_set_location (copy
, input_location
);
1832 id
->debug_stmts
.safe_push (copy
);
1833 gimple_seq_add_stmt (&stmts
, copy
);
1836 if (gimple_debug_source_bind_p (stmt
))
1838 gdebug
*copy
= gimple_build_debug_source_bind
1839 (gimple_debug_source_bind_get_var (stmt
),
1840 gimple_debug_source_bind_get_value (stmt
),
1842 if (id
->reset_location
)
1843 gimple_set_location (copy
, input_location
);
1844 id
->debug_stmts
.safe_push (copy
);
1845 gimple_seq_add_stmt (&stmts
, copy
);
1848 if (gimple_debug_nonbind_marker_p (stmt
))
1850 /* If the inlined function has too many debug markers,
1852 if (id
->src_cfun
->debug_marker_count
1853 > param_max_debug_marker_count
1854 || id
->reset_location
)
1857 gdebug
*copy
= as_a
<gdebug
*> (gimple_copy (stmt
));
1858 id
->debug_stmts
.safe_push (copy
);
1859 gimple_seq_add_stmt (&stmts
, copy
);
1863 /* Create a new deep copy of the statement. */
1864 copy
= gimple_copy (stmt
);
1866 /* Clear flags that need revisiting. */
1867 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1869 if (gimple_call_tail_p (call_stmt
))
1870 gimple_call_set_tail (call_stmt
, false);
1871 if (gimple_call_from_thunk_p (call_stmt
))
1872 gimple_call_set_from_thunk (call_stmt
, false);
1873 if (gimple_call_internal_p (call_stmt
))
1874 switch (gimple_call_internal_fn (call_stmt
))
1876 case IFN_GOMP_SIMD_LANE
:
1877 case IFN_GOMP_SIMD_VF
:
1878 case IFN_GOMP_SIMD_LAST_LANE
:
1879 case IFN_GOMP_SIMD_ORDERED_START
:
1880 case IFN_GOMP_SIMD_ORDERED_END
:
1881 DECL_STRUCT_FUNCTION (id
->dst_fn
)->has_simduid_loops
= true;
1888 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1889 RESX and EH_DISPATCH. */
1891 switch (gimple_code (copy
))
1895 tree r
, fndecl
= gimple_call_fndecl (copy
);
1896 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
1897 switch (DECL_FUNCTION_CODE (fndecl
))
1899 case BUILT_IN_EH_COPY_VALUES
:
1900 r
= gimple_call_arg (copy
, 1);
1901 r
= remap_eh_region_tree_nr (r
, id
);
1902 gimple_call_set_arg (copy
, 1, r
);
1905 case BUILT_IN_EH_POINTER
:
1906 case BUILT_IN_EH_FILTER
:
1907 r
= gimple_call_arg (copy
, 0);
1908 r
= remap_eh_region_tree_nr (r
, id
);
1909 gimple_call_set_arg (copy
, 0, r
);
1916 /* Reset alias info if we didn't apply measures to
1917 keep it valid over inlining by setting DECL_PT_UID. */
1918 if (!id
->src_cfun
->gimple_df
1919 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1920 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1926 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1927 int r
= gimple_resx_region (resx_stmt
);
1928 r
= remap_eh_region_nr (r
, id
);
1929 gimple_resx_set_region (resx_stmt
, r
);
1933 case GIMPLE_EH_DISPATCH
:
1935 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1936 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1937 r
= remap_eh_region_nr (r
, id
);
1938 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1947 /* If STMT has a block defined, map it to the newly constructed block. */
1948 if (tree block
= gimple_block (copy
))
1951 n
= id
->decl_map
->get (block
);
1953 gimple_set_block (copy
, *n
);
1955 if (id
->param_body_adjs
)
1957 gimple_seq extra_stmts
= NULL
;
1958 id
->param_body_adjs
->modify_gimple_stmt (©
, &extra_stmts
, stmt
);
1959 if (!gimple_seq_empty_p (extra_stmts
))
1961 memset (&wi
, 0, sizeof (wi
));
1963 for (gimple_stmt_iterator egsi
= gsi_start (extra_stmts
);
1966 walk_gimple_op (gsi_stmt (egsi
), remap_gimple_op_r
, &wi
);
1967 gimple_seq_add_seq (&stmts
, extra_stmts
);
1971 if (id
->reset_location
)
1972 gimple_set_location (copy
, input_location
);
1974 /* Debug statements ought to be rebuilt and not copied. */
1975 gcc_checking_assert (!is_gimple_debug (copy
));
1977 /* Remap all the operands in COPY. */
1978 memset (&wi
, 0, sizeof (wi
));
1981 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1983 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1985 /* Clear the copied virtual operands. We are not remapping them here
1986 but are going to recreate them from scratch. */
1987 if (gimple_has_mem_ops (copy
))
1989 gimple_set_vdef (copy
, NULL_TREE
);
1990 gimple_set_vuse (copy
, NULL_TREE
);
1993 if (cfun
->can_throw_non_call_exceptions
)
1995 /* When inlining a function which does not have non-call exceptions
1996 enabled into a function that has (which only happens with
1997 always-inline) we have to fixup stmts that cannot throw. */
1998 if (gcond
*cond
= dyn_cast
<gcond
*> (copy
))
1999 if (gimple_could_trap_p (cond
))
2002 = gimple_build_assign (make_ssa_name (boolean_type_node
),
2003 gimple_cond_code (cond
),
2004 gimple_cond_lhs (cond
),
2005 gimple_cond_rhs (cond
));
2006 gimple_seq_add_stmt (&stmts
, cmp
);
2007 gimple_cond_set_code (cond
, NE_EXPR
);
2008 gimple_cond_set_lhs (cond
, gimple_assign_lhs (cmp
));
2009 gimple_cond_set_rhs (cond
, boolean_false_node
);
2013 gimple_seq_add_stmt (&stmts
, copy
);
2018 /* Copy basic block, scale profile accordingly. Edges will be taken care of
2022 copy_bb (copy_body_data
*id
, basic_block bb
,
2023 profile_count num
, profile_count den
)
2025 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
2026 basic_block copy_basic_block
;
2030 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2032 /* Search for previous copied basic block. */
2035 prev
= prev
->prev_bb
;
2037 /* create_basic_block() will append every new block to
2038 basic_block_info automatically. */
2039 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
2040 copy_basic_block
->count
= bb
->count
.apply_scale (num
, den
);
2042 copy_gsi
= gsi_start_bb (copy_basic_block
);
2044 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
2047 gimple
*stmt
= gsi_stmt (gsi
);
2048 gimple
*orig_stmt
= stmt
;
2049 gimple_stmt_iterator stmts_gsi
;
2050 bool stmt_added
= false;
2052 id
->regimplify
= false;
2053 stmts
= remap_gimple_stmt (stmt
, id
);
2055 if (gimple_seq_empty_p (stmts
))
2060 for (stmts_gsi
= gsi_start (stmts
);
2061 !gsi_end_p (stmts_gsi
); )
2063 stmt
= gsi_stmt (stmts_gsi
);
2065 /* Advance iterator now before stmt is moved to seq_gsi. */
2066 gsi_next (&stmts_gsi
);
2068 if (gimple_nop_p (stmt
))
2071 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
2074 /* With return slot optimization we can end up with
2075 non-gimple (foo *)&this->m, fix that here. */
2076 if (is_gimple_assign (stmt
)
2077 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
2078 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
2081 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
2082 gimple_assign_rhs1 (stmt
),
2084 GSI_CONTINUE_LINKING
);
2085 gimple_assign_set_rhs1 (stmt
, new_rhs
);
2086 id
->regimplify
= false;
2089 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
2092 gimple_regimplify_operands (stmt
, &seq_gsi
);
2100 /* If copy_basic_block has been empty at the start of this iteration,
2101 call gsi_start_bb again to get at the newly added statements. */
2102 if (gsi_end_p (copy_gsi
))
2103 copy_gsi
= gsi_start_bb (copy_basic_block
);
2105 gsi_next (©_gsi
);
2107 /* Process the new statement. The call to gimple_regimplify_operands
2108 possibly turned the statement into multiple statements, we
2109 need to process all of them. */
2115 stmt
= gsi_stmt (copy_gsi
);
2116 call_stmt
= dyn_cast
<gcall
*> (stmt
);
2118 && gimple_call_va_arg_pack_p (call_stmt
)
2120 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
2122 /* __builtin_va_arg_pack () should be replaced by
2123 all arguments corresponding to ... in the caller. */
2127 size_t nargs_caller
= gimple_call_num_args (id
->call_stmt
);
2128 size_t nargs
= nargs_caller
;
2130 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
2132 /* Avoid crashing on invalid IL that doesn't have a
2133 varargs function or that passes not enough arguments. */
2139 /* Create the new array of arguments. */
2140 size_t nargs_callee
= gimple_call_num_args (call_stmt
);
2141 size_t n
= nargs
+ nargs_callee
;
2142 argarray
.create (n
);
2143 argarray
.safe_grow_cleared (n
, true);
2145 /* Copy all the arguments before '...' */
2147 memcpy (argarray
.address (),
2148 gimple_call_arg_ptr (call_stmt
, 0),
2149 nargs_callee
* sizeof (tree
));
2151 /* Append the arguments passed in '...' */
2153 memcpy (argarray
.address () + nargs_callee
,
2154 gimple_call_arg_ptr (id
->call_stmt
, 0)
2155 + (nargs_caller
- nargs
), nargs
* sizeof (tree
));
2157 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
2160 argarray
.release ();
2162 /* Copy all GIMPLE_CALL flags, location and block, except
2163 GF_CALL_VA_ARG_PACK. */
2164 gimple_call_copy_flags (new_call
, call_stmt
);
2165 gimple_call_set_va_arg_pack (new_call
, false);
2166 gimple_call_set_fntype (new_call
, gimple_call_fntype (call_stmt
));
2167 /* location includes block. */
2168 gimple_set_location (new_call
, gimple_location (stmt
));
2169 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
2171 gsi_replace (©_gsi
, new_call
, false);
2176 && (decl
= gimple_call_fndecl (stmt
))
2177 && fndecl_built_in_p (decl
, BUILT_IN_VA_ARG_PACK_LEN
))
2179 /* __builtin_va_arg_pack_len () should be replaced by
2180 the number of anonymous arguments. */
2181 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
2185 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
2188 if (!gimple_call_lhs (stmt
))
2190 /* Drop unused calls. */
2191 gsi_remove (©_gsi
, false);
2194 else if (!gimple_call_va_arg_pack_p (id
->call_stmt
))
2196 count
= build_int_cst (integer_type_node
, nargs
);
2197 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
2198 gsi_replace (©_gsi
, new_stmt
, false);
2201 else if (nargs
!= 0)
2203 tree newlhs
= create_tmp_reg_or_ssa_name (integer_type_node
);
2204 count
= build_int_cst (integer_type_node
, nargs
);
2205 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
2206 PLUS_EXPR
, newlhs
, count
);
2207 gimple_call_set_lhs (stmt
, newlhs
);
2208 gsi_insert_after (©_gsi
, new_stmt
, GSI_NEW_STMT
);
2213 && gimple_call_internal_p (stmt
)
2214 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
2216 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
2217 gsi_remove (©_gsi
, false);
2221 /* Statements produced by inlining can be unfolded, especially
2222 when we constant propagated some operands. We can't fold
2223 them right now for two reasons:
2224 1) folding require SSA_NAME_DEF_STMTs to be correct
2225 2) we can't change function calls to builtins.
2226 So we just mark statement for later folding. We mark
2227 all new statements, instead just statements that has changed
2228 by some nontrivial substitution so even statements made
2229 foldable indirectly are updated. If this turns out to be
2230 expensive, copy_body can be told to watch for nontrivial
2232 if (id
->statements_to_fold
)
2233 id
->statements_to_fold
->add (stmt
);
2235 /* We're duplicating a CALL_EXPR. Find any corresponding
2236 callgraph edges and update or duplicate them. */
2237 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
2239 struct cgraph_edge
*edge
;
2241 switch (id
->transform_call_graph_edges
)
2243 case CB_CGE_DUPLICATE
:
2244 edge
= id
->src_node
->get_edge (orig_stmt
);
2247 struct cgraph_edge
*old_edge
= edge
;
2249 /* A speculative call is consist of multiple
2250 edges - indirect edge and one or more direct edges
2251 Duplicate the whole thing and distribute frequencies
2253 if (edge
->speculative
)
2256 profile_count direct_cnt
2257 = profile_count::zero ();
2259 /* First figure out the distribution of counts
2260 so we can re-scale BB profile accordingly. */
2261 for (cgraph_edge
*e
= old_edge
; e
;
2262 e
= e
->next_speculative_call_target ())
2263 direct_cnt
= direct_cnt
+ e
->count
;
2265 cgraph_edge
*indirect
2266 = old_edge
->speculative_call_indirect_edge ();
2267 profile_count indir_cnt
= indirect
->count
;
2269 /* Next iterate all direct edges, clone it and its
2270 corresponding reference and update profile. */
2271 for (cgraph_edge
*e
= old_edge
;
2273 e
= e
->next_speculative_call_target ())
2275 profile_count cnt
= e
->count
;
2277 id
->dst_node
->clone_reference
2278 (e
->speculative_call_target_ref (), stmt
);
2279 edge
= e
->clone (id
->dst_node
, call_stmt
,
2280 gimple_uid (stmt
), num
, den
,
2282 profile_probability prob
2283 = cnt
.probability_in (direct_cnt
2286 = copy_basic_block
->count
.apply_probability
2291 (indirect
->num_speculative_call_targets_p ()
2294 /* Duplicate the indirect edge after all direct edges
2296 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2301 profile_probability prob
2302 = indir_cnt
.probability_in (direct_cnt
2305 = copy_basic_block
->count
.apply_probability (prob
);
2309 edge
= edge
->clone (id
->dst_node
, call_stmt
,
2313 edge
->count
= copy_basic_block
->count
;
2318 case CB_CGE_MOVE_CLONES
:
2319 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2321 edge
= id
->dst_node
->get_edge (stmt
);
2325 edge
= id
->dst_node
->get_edge (orig_stmt
);
2327 edge
= cgraph_edge::set_call_stmt (edge
, call_stmt
);
2334 /* Constant propagation on argument done during inlining
2335 may create new direct call. Produce an edge for it. */
2337 || (edge
->indirect_inlining_edge
2338 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2339 && id
->dst_node
->definition
2340 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2342 struct cgraph_node
*dest
= cgraph_node::get_create (fn
);
2344 /* We have missing edge in the callgraph. This can happen
2345 when previous inlining turned an indirect call into a
2346 direct call by constant propagating arguments or we are
2347 producing dead clone (for further cloning). In all
2348 other cases we hit a bug (incorrect node sharing is the
2349 most common reason for missing edges). */
2350 gcc_assert (!dest
->definition
2351 || dest
->address_taken
2352 || !id
->src_node
->definition
2353 || !id
->dst_node
->definition
);
2354 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2355 id
->dst_node
->create_edge_including_clones
2356 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2357 CIF_ORIGINALLY_INDIRECT_CALL
);
2359 id
->dst_node
->create_edge (dest
, call_stmt
,
2360 bb
->count
)->inline_failed
2361 = CIF_ORIGINALLY_INDIRECT_CALL
;
2364 fprintf (dump_file
, "Created new direct edge to %s\n",
2365 dest
->dump_name ());
2369 notice_special_calls (as_a
<gcall
*> (stmt
));
2372 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2373 id
->eh_map
, id
->eh_lp_nr
);
2375 gsi_next (©_gsi
);
2377 while (!gsi_end_p (copy_gsi
));
2379 copy_gsi
= gsi_last_bb (copy_basic_block
);
2382 return copy_basic_block
;
2385 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2386 form is quite easy, since dominator relationship for old basic blocks does
2389 There is however exception where inlining might change dominator relation
2390 across EH edges from basic block within inlined functions destinating
2391 to landing pads in function we inline into.
2393 The function fills in PHI_RESULTs of such PHI nodes if they refer
2394 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2395 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2396 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2397 set, and this means that there will be no overlapping live ranges
2398 for the underlying symbol.
2400 This might change in future if we allow redirecting of EH edges and
2401 we might want to change way build CFG pre-inlining to include
2402 all the possible edges then. */
2404 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2405 bool can_throw
, bool nonlocal_goto
)
2410 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2412 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2418 gcc_assert (e
->flags
& EDGE_EH
);
2421 gcc_assert (!(e
->flags
& EDGE_EH
));
2423 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2429 /* For abnormal goto/call edges the receiver can be the
2430 ENTRY_BLOCK. Do not assert this cannot happen. */
2432 gcc_assert ((e
->flags
& EDGE_EH
)
2433 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2435 re
= find_edge (ret_bb
, e
->dest
);
2436 gcc_checking_assert (re
);
2437 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2438 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2440 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2441 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2446 /* Insert clobbers for automatic variables of inlined ID->src_fn
2447 function at the start of basic block ID->eh_landing_pad_dest. */
2450 add_clobbers_to_eh_landing_pad (copy_body_data
*id
)
2453 basic_block bb
= id
->eh_landing_pad_dest
;
2454 live_vars_map
*vars
= NULL
;
2455 unsigned int cnt
= 0;
2457 FOR_EACH_VEC_SAFE_ELT (id
->src_cfun
->local_decls
, i
, var
)
2459 && !DECL_HARD_REGISTER (var
)
2460 && !TREE_THIS_VOLATILE (var
)
2461 && !DECL_HAS_VALUE_EXPR_P (var
)
2462 && !is_gimple_reg (var
)
2463 && auto_var_in_fn_p (var
, id
->src_fn
)
2464 && !lookup_attribute ("omp simd array", DECL_ATTRIBUTES (var
)))
2466 tree
*t
= id
->decl_map
->get (var
);
2471 && !DECL_HARD_REGISTER (new_var
)
2472 && !TREE_THIS_VOLATILE (new_var
)
2473 && !DECL_HAS_VALUE_EXPR_P (new_var
)
2474 && !is_gimple_reg (new_var
)
2475 && auto_var_in_fn_p (new_var
, id
->dst_fn
))
2478 vars
= new live_vars_map
;
2479 vars
->put (DECL_UID (var
), cnt
++);
2485 vec
<bitmap_head
> live
= compute_live_vars (id
->src_cfun
, vars
);
2486 FOR_EACH_VEC_SAFE_ELT (id
->src_cfun
->local_decls
, i
, var
)
2491 bool needed
= false;
2492 unsigned int *v
= vars
->get (DECL_UID (var
));
2495 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
2496 if ((e
->flags
& EDGE_EH
) != 0
2497 && e
->src
->index
>= id
->add_clobbers_to_eh_landing_pads
)
2499 basic_block src_bb
= (basic_block
) e
->src
->aux
;
2501 if (bitmap_bit_p (&live
[src_bb
->index
], *v
))
2509 tree new_var
= *id
->decl_map
->get (var
);
2510 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
2511 tree clobber
= build_clobber (TREE_TYPE (new_var
));
2512 gimple
*clobber_stmt
= gimple_build_assign (new_var
, clobber
);
2513 gsi_insert_before (&gsi
, clobber_stmt
, GSI_NEW_STMT
);
2516 destroy_live_vars (live
);
2520 /* Copy edges from BB into its copy constructed earlier, scale profile
2521 accordingly. Edges will be taken care of later. Assume aux
2522 pointers to point to the copies of each BB. Return true if any
2523 debug stmts are left after a statement that must end the basic block. */
2526 copy_edges_for_bb (basic_block bb
, profile_count num
, profile_count den
,
2527 basic_block ret_bb
, basic_block abnormal_goto_dest
,
2530 basic_block new_bb
= (basic_block
) bb
->aux
;
2533 gimple_stmt_iterator si
;
2534 bool need_debug_cleanup
= false;
2536 /* Use the indices from the original blocks to create edges for the
2538 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2539 if (!(old_edge
->flags
& EDGE_EH
))
2542 int flags
= old_edge
->flags
;
2543 location_t locus
= old_edge
->goto_locus
;
2545 /* Return edges do get a FALLTHRU flag when they get inlined. */
2546 if (old_edge
->dest
->index
== EXIT_BLOCK
2547 && !(flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2548 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2549 flags
|= EDGE_FALLTHRU
;
2552 = make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2553 new_edge
->probability
= old_edge
->probability
;
2554 if (!id
->reset_location
)
2555 new_edge
->goto_locus
= remap_location (locus
, id
);
2558 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2561 /* When doing function splitting, we must decrease count of the return block
2562 which was previously reachable by block we did not copy. */
2563 if (single_succ_p (bb
) && single_succ_edge (bb
)->dest
->index
== EXIT_BLOCK
)
2564 FOR_EACH_EDGE (old_edge
, ei
, bb
->preds
)
2565 if (old_edge
->src
->index
!= ENTRY_BLOCK
2566 && !old_edge
->src
->aux
)
2567 new_bb
->count
-= old_edge
->count ().apply_scale (num
, den
);
2569 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2572 bool can_throw
, nonlocal_goto
;
2574 copy_stmt
= gsi_stmt (si
);
2575 if (!is_gimple_debug (copy_stmt
))
2576 update_stmt (copy_stmt
);
2578 /* Do this before the possible split_block. */
2581 /* If this tree could throw an exception, there are two
2582 cases where we need to add abnormal edge(s): the
2583 tree wasn't in a region and there is a "current
2584 region" in the caller; or the original tree had
2585 EH edges. In both cases split the block after the tree,
2586 and add abnormal edge(s) as needed; we need both
2587 those from the callee and the caller.
2588 We check whether the copy can throw, because the const
2589 propagation can change an INDIRECT_REF which throws
2590 into a COMPONENT_REF which doesn't. If the copy
2591 can throw, the original could also throw. */
2592 can_throw
= stmt_can_throw_internal (cfun
, copy_stmt
);
2594 = (stmt_can_make_abnormal_goto (copy_stmt
)
2595 && !computed_goto_p (copy_stmt
));
2597 if (can_throw
|| nonlocal_goto
)
2599 if (!gsi_end_p (si
))
2601 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2604 need_debug_cleanup
= true;
2606 if (!gsi_end_p (si
))
2607 /* Note that bb's predecessor edges aren't necessarily
2608 right at this point; split_block doesn't care. */
2610 edge e
= split_block (new_bb
, copy_stmt
);
2613 new_bb
->aux
= e
->src
->aux
;
2614 si
= gsi_start_bb (new_bb
);
2618 bool update_probs
= false;
2620 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2622 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2623 update_probs
= true;
2627 make_eh_edges (copy_stmt
);
2628 update_probs
= true;
2631 /* EH edges may not match old edges. Copy as much as possible. */
2636 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2638 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2639 if ((old_edge
->flags
& EDGE_EH
)
2640 && (e
= find_edge (copy_stmt_bb
,
2641 (basic_block
) old_edge
->dest
->aux
))
2642 && (e
->flags
& EDGE_EH
))
2643 e
->probability
= old_edge
->probability
;
2645 FOR_EACH_EDGE (e
, ei
, copy_stmt_bb
->succs
)
2646 if (e
->flags
& EDGE_EH
)
2648 if (!e
->probability
.initialized_p ())
2649 e
->probability
= profile_probability::never ();
2650 if (e
->dest
->index
< id
->add_clobbers_to_eh_landing_pads
)
2652 if (id
->eh_landing_pad_dest
== NULL
)
2653 id
->eh_landing_pad_dest
= e
->dest
;
2655 gcc_assert (id
->eh_landing_pad_dest
== e
->dest
);
2661 /* If the call we inline cannot make abnormal goto do not add
2662 additional abnormal edges but only retain those already present
2663 in the original function body. */
2664 if (abnormal_goto_dest
== NULL
)
2665 nonlocal_goto
= false;
2668 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2670 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2671 nonlocal_goto
= false;
2672 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2673 in OpenMP regions which aren't allowed to be left abnormally.
2674 So, no need to add abnormal edge in that case. */
2675 else if (is_gimple_call (copy_stmt
)
2676 && gimple_call_internal_p (copy_stmt
)
2677 && (gimple_call_internal_fn (copy_stmt
)
2678 == IFN_ABNORMAL_DISPATCHER
)
2679 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2680 nonlocal_goto
= false;
2682 make_single_succ_edge (copy_stmt_bb
, abnormal_goto_dest
,
2686 if ((can_throw
|| nonlocal_goto
)
2687 && gimple_in_ssa_p (cfun
))
2688 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2689 can_throw
, nonlocal_goto
);
2691 return need_debug_cleanup
;
2694 /* Copy the PHIs. All blocks and edges are copied, some blocks
2695 was possibly split and new outgoing EH edges inserted.
2696 BB points to the block of original function and AUX pointers links
2697 the original and newly copied blocks. */
2700 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2702 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2707 bool inserted
= false;
2709 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2715 res
= PHI_RESULT (phi
);
2717 if (!virtual_operand_p (res
)
2718 && (!id
->param_body_adjs
2719 || !id
->param_body_adjs
->m_dead_stmts
.contains (phi
)))
2721 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2722 if (EDGE_COUNT (new_bb
->preds
) == 0)
2724 /* Technically we'd want a SSA_DEFAULT_DEF here... */
2725 SSA_NAME_DEF_STMT (new_res
) = gimple_build_nop ();
2729 new_phi
= create_phi_node (new_res
, new_bb
);
2730 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2732 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
,
2739 /* When doing partial cloning, we allow PHIs on the entry
2740 block as long as all the arguments are the same.
2741 Find any input edge to see argument to copy. */
2743 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2744 if (!old_edge
->src
->aux
)
2747 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2749 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2750 gcc_assert (new_arg
);
2751 /* With return slot optimization we can end up with
2752 non-gimple (foo *)&this->m, fix that here. */
2753 if (TREE_CODE (new_arg
) != SSA_NAME
2754 && TREE_CODE (new_arg
) != FUNCTION_DECL
2755 && !is_gimple_val (new_arg
))
2757 gimple_seq stmts
= NULL
;
2758 new_arg
= force_gimple_operand (new_arg
, &stmts
, true,
2760 gsi_insert_seq_on_edge (new_edge
, stmts
);
2763 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2764 if (id
->reset_location
)
2765 locus
= input_location
;
2767 locus
= remap_location (locus
, id
);
2768 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2774 /* Commit the delayed edge insertions. */
2776 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2777 gsi_commit_one_edge_insert (new_edge
, NULL
);
2781 /* Wrapper for remap_decl so it can be used as a callback. */
2784 remap_decl_1 (tree decl
, void *data
)
2786 return remap_decl (decl
, (copy_body_data
*) data
);
2789 /* Build struct function and associated datastructures for the new clone
2790 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2791 the cfun to the function of new_fndecl (and current_function_decl too). */
2794 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, profile_count count
)
2796 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2798 if (!DECL_ARGUMENTS (new_fndecl
))
2799 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2800 if (!DECL_RESULT (new_fndecl
))
2801 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2803 /* Register specific tree functions. */
2804 gimple_register_cfg_hooks ();
2806 /* Get clean struct function. */
2807 push_struct_function (new_fndecl
);
2809 /* We will rebuild these, so just sanity check that they are empty. */
2810 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2811 gcc_assert (cfun
->local_decls
== NULL
);
2812 gcc_assert (cfun
->cfg
== NULL
);
2813 gcc_assert (cfun
->decl
== new_fndecl
);
2815 /* Copy items we preserve during cloning. */
2816 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2817 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2818 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2819 cfun
->curr_properties
= src_cfun
->curr_properties
;
2820 cfun
->last_verified
= src_cfun
->last_verified
;
2821 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2822 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2823 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2824 cfun
->calls_eh_return
= src_cfun
->calls_eh_return
;
2825 cfun
->stdarg
= src_cfun
->stdarg
;
2826 cfun
->after_inlining
= src_cfun
->after_inlining
;
2827 cfun
->can_throw_non_call_exceptions
2828 = src_cfun
->can_throw_non_call_exceptions
;
2829 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2830 cfun
->returns_struct
= src_cfun
->returns_struct
;
2831 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2833 init_empty_tree_cfg ();
2835 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2837 profile_count num
= count
;
2838 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2839 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2841 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2842 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2843 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2844 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2845 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2846 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2848 init_eh_for_function ();
2850 if (src_cfun
->gimple_df
)
2852 init_tree_ssa (cfun
);
2853 cfun
->gimple_df
->in_ssa_p
= src_cfun
->gimple_df
->in_ssa_p
;
2854 if (cfun
->gimple_df
->in_ssa_p
)
2855 init_ssa_operands (cfun
);
2859 /* Helper function for copy_cfg_body. Move debug stmts from the end
2860 of NEW_BB to the beginning of successor basic blocks when needed. If the
2861 successor has multiple predecessors, reset them, otherwise keep
2865 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2869 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2872 || gsi_one_before_end_p (si
)
2873 || !(stmt_can_throw_internal (cfun
, gsi_stmt (si
))
2874 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2877 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2879 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2880 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2881 while (is_gimple_debug (gsi_stmt (ssi
)))
2883 gimple
*stmt
= gsi_stmt (ssi
);
2888 /* For the last edge move the debug stmts instead of copying
2890 if (ei_one_before_end_p (ei
))
2894 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2896 gimple_debug_bind_reset_value (stmt
);
2897 gimple_set_location (stmt
, UNKNOWN_LOCATION
);
2899 gsi_remove (&si
, false);
2900 gsi_insert_before (&dsi
, stmt
, GSI_NEW_STMT
);
2904 if (gimple_debug_bind_p (stmt
))
2906 var
= gimple_debug_bind_get_var (stmt
);
2907 if (single_pred_p (e
->dest
))
2909 value
= gimple_debug_bind_get_value (stmt
);
2910 value
= unshare_expr (value
);
2911 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2914 new_stmt
= gimple_build_debug_bind (var
, NULL_TREE
, NULL
);
2916 else if (gimple_debug_source_bind_p (stmt
))
2918 var
= gimple_debug_source_bind_get_var (stmt
);
2919 value
= gimple_debug_source_bind_get_value (stmt
);
2920 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2922 else if (gimple_debug_nonbind_marker_p (stmt
))
2923 new_stmt
= as_a
<gdebug
*> (gimple_copy (stmt
));
2926 gsi_insert_before (&dsi
, new_stmt
, GSI_NEW_STMT
);
2927 id
->debug_stmts
.safe_push (new_stmt
);
2933 /* Make a copy of the sub-loops of SRC_PARENT and place them
2934 as siblings of DEST_PARENT. */
2937 copy_loops (copy_body_data
*id
,
2938 class loop
*dest_parent
, class loop
*src_parent
)
2940 class loop
*src_loop
= src_parent
->inner
;
2943 if (!id
->blocks_to_copy
2944 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2946 class loop
*dest_loop
= alloc_loop ();
2948 /* Assign the new loop its header and latch and associate
2949 those with the new loop. */
2950 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2951 dest_loop
->header
->loop_father
= dest_loop
;
2952 if (src_loop
->latch
!= NULL
)
2954 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2955 dest_loop
->latch
->loop_father
= dest_loop
;
2958 /* Copy loop meta-data. */
2959 copy_loop_info (src_loop
, dest_loop
);
2960 if (dest_loop
->unroll
)
2961 cfun
->has_unroll
= true;
2962 if (dest_loop
->force_vectorize
)
2963 cfun
->has_force_vectorize_loops
= true;
2964 if (id
->src_cfun
->last_clique
!= 0)
2965 dest_loop
->owned_clique
2966 = remap_dependence_clique (id
,
2967 src_loop
->owned_clique
2968 ? src_loop
->owned_clique
: 1);
2970 /* Finally place it into the loop array and the loop tree. */
2971 place_new_loop (cfun
, dest_loop
);
2972 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2974 if (src_loop
->simduid
)
2976 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2977 cfun
->has_simduid_loops
= true;
2981 copy_loops (id
, dest_loop
, src_loop
);
2983 src_loop
= src_loop
->next
;
2987 /* Call redirect_call_stmt_to_callee on all calls in BB. */
2990 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2992 gimple_stmt_iterator si
;
2993 gimple
*last
= last_stmt (bb
);
2994 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2996 gimple
*stmt
= gsi_stmt (si
);
2997 if (is_gimple_call (stmt
))
2999 tree old_lhs
= gimple_call_lhs (stmt
);
3000 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
3004 = cgraph_edge::redirect_call_stmt_to_callee (edge
);
3005 /* If IPA-SRA transformation, run as part of edge redirection,
3006 removed the LHS because it is unused, save it to
3007 killed_new_ssa_names so that we can prune it from debug
3010 && TREE_CODE (old_lhs
) == SSA_NAME
3011 && !gimple_call_lhs (new_stmt
))
3013 if (!id
->killed_new_ssa_names
)
3014 id
->killed_new_ssa_names
= new hash_set
<tree
> (16);
3015 id
->killed_new_ssa_names
->add (old_lhs
);
3018 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
3019 gimple_purge_dead_eh_edges (bb
);
3025 /* Make a copy of the body of FN so that it can be inserted inline in
3026 another function. Walks FN via CFG, returns new fndecl. */
3029 copy_cfg_body (copy_body_data
* id
,
3030 basic_block entry_block_map
, basic_block exit_block_map
,
3031 basic_block new_entry
)
3033 tree callee_fndecl
= id
->src_fn
;
3034 /* Original cfun for the callee, doesn't change. */
3035 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
3036 struct function
*cfun_to_copy
;
3038 tree new_fndecl
= NULL
;
3039 bool need_debug_cleanup
= false;
3041 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
3042 profile_count num
= entry_block_map
->count
;
3044 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
3046 /* Register specific tree functions. */
3047 gimple_register_cfg_hooks ();
3049 /* If we are inlining just region of the function, make sure to connect
3050 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
3051 part of loop, we must compute frequency and probability of
3052 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
3053 probabilities of edges incoming from nonduplicated region. */
3058 den
= profile_count::zero ();
3060 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
3063 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= den
;
3066 profile_count::adjust_for_ipa_scaling (&num
, &den
);
3068 /* Must have a CFG here at this point. */
3069 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
3070 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
3073 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
3074 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
3075 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
3076 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
3078 /* Duplicate any exception-handling regions. */
3080 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
3083 /* Use aux pointers to map the original blocks to copy. */
3084 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
3085 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
3087 basic_block new_bb
= copy_bb (id
, bb
, num
, den
);
3090 new_bb
->loop_father
= entry_block_map
->loop_father
;
3093 last
= last_basic_block_for_fn (cfun
);
3095 /* Now that we've duplicated the blocks, duplicate their edges. */
3096 basic_block abnormal_goto_dest
= NULL
;
3098 && stmt_can_make_abnormal_goto (id
->call_stmt
))
3100 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
3102 bb
= gimple_bb (id
->call_stmt
);
3104 if (gsi_end_p (gsi
))
3105 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
3107 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3108 if (!id
->blocks_to_copy
3109 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
3110 need_debug_cleanup
|= copy_edges_for_bb (bb
, num
, den
, exit_block_map
,
3111 abnormal_goto_dest
, id
);
3113 if (id
->eh_landing_pad_dest
)
3115 add_clobbers_to_eh_landing_pad (id
);
3116 id
->eh_landing_pad_dest
= NULL
;
3121 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
,
3123 e
->probability
= profile_probability::always ();
3126 /* Duplicate the loop tree, if available and wanted. */
3127 if (loops_for_fn (src_cfun
) != NULL
3128 && current_loops
!= NULL
)
3130 copy_loops (id
, entry_block_map
->loop_father
,
3131 get_loop (src_cfun
, 0));
3132 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
3133 loops_state_set (LOOPS_NEED_FIXUP
);
3136 /* If the loop tree in the source function needed fixup, mark the
3137 destination loop tree for fixup, too. */
3138 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
3139 loops_state_set (LOOPS_NEED_FIXUP
);
3141 if (gimple_in_ssa_p (cfun
))
3142 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3143 if (!id
->blocks_to_copy
3144 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
3145 copy_phis_for_bb (bb
, id
);
3147 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3150 if (need_debug_cleanup
3151 && bb
->index
!= ENTRY_BLOCK
3152 && bb
->index
!= EXIT_BLOCK
)
3153 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
3154 /* Update call edge destinations. This cannot be done before loop
3155 info is updated, because we may split basic blocks. */
3156 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
3157 && bb
->index
!= ENTRY_BLOCK
3158 && bb
->index
!= EXIT_BLOCK
)
3159 redirect_all_calls (id
, (basic_block
)bb
->aux
);
3160 ((basic_block
)bb
->aux
)->aux
= NULL
;
3164 /* Zero out AUX fields of newly created block during EH edge
3166 for (; last
< last_basic_block_for_fn (cfun
); last
++)
3168 if (need_debug_cleanup
)
3169 maybe_move_debug_stmts_to_successors (id
,
3170 BASIC_BLOCK_FOR_FN (cfun
, last
));
3171 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
3172 /* Update call edge destinations. This cannot be done before loop
3173 info is updated, because we may split basic blocks. */
3174 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
3175 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
3177 entry_block_map
->aux
= NULL
;
3178 exit_block_map
->aux
= NULL
;
3185 if (id
->dependence_map
)
3187 delete id
->dependence_map
;
3188 id
->dependence_map
= NULL
;
3194 /* Copy the debug STMT using ID. We deal with these statements in a
3195 special way: if any variable in their VALUE expression wasn't
3196 remapped yet, we won't remap it, because that would get decl uids
3197 out of sync, causing codegen differences between -g and -g0. If
3198 this arises, we drop the VALUE expression altogether. */
3201 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
3204 struct walk_stmt_info wi
;
3206 if (tree block
= gimple_block (stmt
))
3208 n
= id
->decl_map
->get (block
);
3209 gimple_set_block (stmt
, n
? *n
: id
->block
);
3212 if (gimple_debug_nonbind_marker_p (stmt
))
3214 if (id
->call_stmt
&& !gimple_block (stmt
))
3216 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
3217 gsi_remove (&gsi
, true);
3222 /* Remap all the operands in COPY. */
3223 memset (&wi
, 0, sizeof (wi
));
3226 processing_debug_stmt
= 1;
3228 if (gimple_debug_source_bind_p (stmt
))
3229 t
= gimple_debug_source_bind_get_var (stmt
);
3230 else if (gimple_debug_bind_p (stmt
))
3231 t
= gimple_debug_bind_get_var (stmt
);
3235 if (TREE_CODE (t
) == PARM_DECL
3237 && (n
= id
->debug_map
->get (t
)))
3239 gcc_assert (VAR_P (*n
));
3242 else if (VAR_P (t
) && !is_global_var (t
) && !id
->decl_map
->get (t
))
3243 /* T is a non-localized variable. */;
3245 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
3247 if (gimple_debug_bind_p (stmt
))
3249 gimple_debug_bind_set_var (stmt
, t
);
3251 if (gimple_debug_bind_has_value_p (stmt
))
3252 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
3253 remap_gimple_op_r
, &wi
, NULL
);
3255 /* Punt if any decl couldn't be remapped. */
3256 if (processing_debug_stmt
< 0)
3257 gimple_debug_bind_reset_value (stmt
);
3259 else if (gimple_debug_source_bind_p (stmt
))
3261 gimple_debug_source_bind_set_var (stmt
, t
);
3262 /* When inlining and source bind refers to one of the optimized
3263 away parameters, change the source bind into normal debug bind
3264 referring to the corresponding DEBUG_EXPR_DECL that should have
3265 been bound before the call stmt. */
3266 t
= gimple_debug_source_bind_get_value (stmt
);
3268 && TREE_CODE (t
) == PARM_DECL
3271 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
3273 if (debug_args
!= NULL
)
3275 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
3276 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
3277 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
3279 t
= (**debug_args
)[i
+ 1];
3280 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
3281 gimple_debug_bind_set_value (stmt
, t
);
3286 if (gimple_debug_source_bind_p (stmt
))
3287 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
3288 remap_gimple_op_r
, &wi
, NULL
);
3291 processing_debug_stmt
= 0;
3296 /* Process deferred debug stmts. In order to give values better odds
3297 of being successfully remapped, we delay the processing of debug
3298 stmts until all other stmts that might require remapping are
3302 copy_debug_stmts (copy_body_data
*id
)
3304 if (!id
->debug_stmts
.exists ())
3307 for (gdebug
*stmt
: id
->debug_stmts
)
3308 copy_debug_stmt (stmt
, id
);
3310 id
->debug_stmts
.release ();
3313 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
3314 another function. */
3317 copy_tree_body (copy_body_data
*id
)
3319 tree fndecl
= id
->src_fn
;
3320 tree body
= DECL_SAVED_TREE (fndecl
);
3322 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
3327 /* Make a copy of the body of FN so that it can be inserted inline in
3328 another function. */
3331 copy_body (copy_body_data
*id
,
3332 basic_block entry_block_map
, basic_block exit_block_map
,
3333 basic_block new_entry
)
3335 tree fndecl
= id
->src_fn
;
3338 /* If this body has a CFG, walk CFG and copy. */
3339 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
3340 body
= copy_cfg_body (id
, entry_block_map
, exit_block_map
,
3342 copy_debug_stmts (id
);
3343 delete id
->killed_new_ssa_names
;
3344 id
->killed_new_ssa_names
= NULL
;
3349 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
3350 defined in function FN, or of a data member thereof. */
3353 self_inlining_addr_expr (tree value
, tree fn
)
3357 if (TREE_CODE (value
) != ADDR_EXPR
)
3360 var
= get_base_address (TREE_OPERAND (value
, 0));
3362 return var
&& auto_var_in_fn_p (var
, fn
);
3365 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
3366 lexical block and line number information from base_stmt, if given,
3367 or from the last stmt of the block otherwise. */
3370 insert_init_debug_bind (copy_body_data
*id
,
3371 basic_block bb
, tree var
, tree value
,
3375 gimple_stmt_iterator gsi
;
3378 if (!gimple_in_ssa_p (id
->src_cfun
))
3381 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
3384 tracked_var
= target_for_debug_bind (var
);
3390 gsi
= gsi_last_bb (bb
);
3391 if (!base_stmt
&& !gsi_end_p (gsi
))
3392 base_stmt
= gsi_stmt (gsi
);
3395 note
= gimple_build_debug_bind (tracked_var
,
3396 value
== error_mark_node
3397 ? NULL_TREE
: unshare_expr (value
),
3402 if (!gsi_end_p (gsi
))
3403 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
3405 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3412 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple
*init_stmt
)
3414 /* If VAR represents a zero-sized variable, it's possible that the
3415 assignment statement may result in no gimple statements. */
3418 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3420 /* We can end up with init statements that store to a non-register
3421 from a rhs with a conversion. Handle that here by forcing the
3422 rhs into a temporary. gimple_regimplify_operands is not
3423 prepared to do this for us. */
3424 if (!is_gimple_debug (init_stmt
)
3425 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3426 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3427 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3429 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3430 TREE_TYPE (gimple_assign_lhs (init_stmt
)),
3431 gimple_assign_rhs1 (init_stmt
));
3432 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3434 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3435 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3437 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3438 if (!is_gimple_debug (init_stmt
))
3440 gimple_regimplify_operands (init_stmt
, &si
);
3442 tree def
= gimple_assign_lhs (init_stmt
);
3443 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3448 /* Deal with mismatched formal/actual parameters, in a rather brute-force way
3449 if need be (which should only be necessary for invalid programs). Attempt
3450 to convert VAL to TYPE and return the result if it is possible, just return
3451 a zero constant of the given type if it fails. */
3454 force_value_to_type (tree type
, tree value
)
3456 /* If we can match up types by promotion/demotion do so. */
3457 if (fold_convertible_p (type
, value
))
3458 return fold_convert (type
, value
);
3460 /* ??? For valid programs we should not end up here.
3461 Still if we end up with truly mismatched types here, fall back
3462 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3463 GIMPLE to the following passes. */
3464 if (TREE_CODE (value
) == WITH_SIZE_EXPR
)
3465 return error_mark_node
;
3466 else if (!is_gimple_reg_type (TREE_TYPE (value
))
3467 || TYPE_SIZE (type
) == TYPE_SIZE (TREE_TYPE (value
)))
3468 return fold_build1 (VIEW_CONVERT_EXPR
, type
, value
);
3470 return build_zero_cst (type
);
3473 /* Initialize parameter P with VALUE. If needed, produce init statement
3474 at the end of BB. When BB is NULL, we return init statement to be
3477 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3478 basic_block bb
, tree
*vars
)
3480 gimple
*init_stmt
= NULL
;
3482 tree def
= (gimple_in_ssa_p (cfun
)
3483 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3485 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3486 here since the type of this decl must be visible to the calling
3488 var
= copy_decl_to_var (p
, id
);
3490 /* Declare this new variable. */
3491 DECL_CHAIN (var
) = *vars
;
3494 /* Make gimplifier happy about this variable. */
3495 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3497 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3498 we would not need to create a new variable here at all, if it
3499 weren't for debug info. Still, we can just use the argument
3501 if (TREE_READONLY (p
)
3502 && !TREE_ADDRESSABLE (p
)
3504 && !TREE_SIDE_EFFECTS (value
)
3507 /* We may produce non-gimple trees by adding NOPs or introduce invalid
3508 sharing when the value is not constant or DECL. And we need to make
3509 sure that it cannot be modified from another path in the callee. */
3510 if (((is_gimple_min_invariant (value
)
3511 /* When the parameter is used in a context that forces it to
3512 not be a GIMPLE register avoid substituting something that
3513 is not a decl there. */
3514 && ! DECL_NOT_GIMPLE_REG_P (p
))
3515 || (DECL_P (value
) && TREE_READONLY (value
))
3516 || (auto_var_in_fn_p (value
, id
->dst_fn
)
3517 && !TREE_ADDRESSABLE (value
)))
3518 && useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
))
3519 /* We have to be very careful about ADDR_EXPR. Make sure
3520 the base variable isn't a local variable of the inlined
3521 function, e.g., when doing recursive inlining, direct or
3522 mutually-recursive or whatever, which is why we don't
3523 just test whether fn == current_function_decl. */
3524 && ! self_inlining_addr_expr (value
, fn
))
3526 insert_decl_map (id
, p
, value
);
3528 id
->debug_map
= new hash_map
<tree
, tree
>;
3529 id
->debug_map
->put (p
, var
);
3530 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3534 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3535 that way, when the PARM_DECL is encountered, it will be
3536 automatically replaced by the VAR_DECL. */
3537 insert_decl_map (id
, p
, var
);
3539 /* Even if P was TREE_READONLY, the new VAR should not be. In the original
3540 code, we would have constructed a temporary, and then the function body
3541 would have never changed the value of P. However, now, we will be
3542 constructing VAR directly. Therefore, it must not be TREE_READONLY. */
3543 TREE_READONLY (var
) = 0;
3547 && value
!= error_mark_node
3548 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3549 rhs
= force_value_to_type (TREE_TYPE (p
), value
);
3551 /* If there is no setup required and we are in SSA, take the easy route
3552 replacing all SSA names representing the function parameter by the
3553 SSA name passed to function.
3555 We need to construct map for the variable anyway as it might be used
3556 in different SSA names when parameter is set in function.
3558 Do replacement at -O0 for const arguments replaced by constant.
3559 This is important for builtin_constant_p and other construct requiring
3560 constant argument to be visible in inlined function body. */
3561 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3563 || (TREE_READONLY (p
)
3564 && is_gimple_min_invariant (rhs
)))
3565 && (TREE_CODE (rhs
) == SSA_NAME
3566 || is_gimple_min_invariant (rhs
))
3567 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3569 insert_decl_map (id
, def
, rhs
);
3570 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3573 /* If the value of argument is never used, don't care about initializing
3575 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3577 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3578 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3581 /* Initialize this VAR_DECL from the equivalent argument. Convert
3582 the argument to the proper type in case it was promoted. */
3585 if (rhs
== error_mark_node
)
3587 insert_decl_map (id
, p
, var
);
3588 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3591 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3593 /* If we are in SSA form properly remap the default definition
3594 or assign to a dummy SSA name if the parameter is unused and
3595 we are not optimizing. */
3596 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3600 def
= remap_ssa_name (def
, id
);
3601 init_stmt
= gimple_build_assign (def
, rhs
);
3602 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3603 set_ssa_default_def (cfun
, var
, NULL
);
3607 def
= make_ssa_name (var
);
3608 init_stmt
= gimple_build_assign (def
, rhs
);
3611 else if (!is_empty_type (TREE_TYPE (var
)))
3612 init_stmt
= gimple_build_assign (var
, rhs
);
3614 if (bb
&& init_stmt
)
3615 insert_init_stmt (id
, bb
, init_stmt
);
3620 /* Generate code to initialize the parameters of the function at the
3621 top of the stack in ID from the GIMPLE_CALL STMT. */
3624 initialize_inlined_parameters (copy_body_data
*id
, gimple
*stmt
,
3625 tree fn
, basic_block bb
)
3630 tree vars
= NULL_TREE
;
3631 tree static_chain
= gimple_call_chain (stmt
);
3633 /* Figure out what the parameters are. */
3634 parms
= DECL_ARGUMENTS (fn
);
3636 /* Loop through the parameter declarations, replacing each with an
3637 equivalent VAR_DECL, appropriately initialized. */
3638 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3641 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3642 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3644 /* After remapping parameters remap their types. This has to be done
3645 in a second loop over all parameters to appropriately remap
3646 variable sized arrays when the size is specified in a
3647 parameter following the array. */
3648 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3650 tree
*varp
= id
->decl_map
->get (p
);
3651 if (varp
&& VAR_P (*varp
))
3653 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3654 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3656 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3657 /* Also remap the default definition if it was remapped
3658 to the default definition of the parameter replacement
3659 by the parameter setup. */
3662 tree
*defp
= id
->decl_map
->get (def
);
3664 && TREE_CODE (*defp
) == SSA_NAME
3665 && SSA_NAME_VAR (*defp
) == var
)
3666 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3671 /* Initialize the static chain. */
3672 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3673 gcc_assert (fn
!= current_function_decl
);
3676 /* No static chain? Seems like a bug in tree-nested.c. */
3677 gcc_assert (static_chain
);
3679 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3682 declare_inline_vars (id
->block
, vars
);
3686 /* Declare a return variable to replace the RESULT_DECL for the
3687 function we are calling. An appropriate DECL_STMT is returned.
3688 The USE_STMT is filled to contain a use of the declaration to
3689 indicate the return value of the function.
3691 RETURN_SLOT, if non-null is place where to store the result. It
3692 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3693 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3695 The return value is a (possibly null) value that holds the result
3696 as seen by the caller. */
3699 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3700 basic_block entry_bb
)
3702 tree callee
= id
->src_fn
;
3703 tree result
= DECL_RESULT (callee
);
3704 tree callee_type
= TREE_TYPE (result
);
3708 /* Handle type-mismatches in the function declaration return type
3709 vs. the call expression. */
3711 caller_type
= TREE_TYPE (modify_dest
);
3712 else if (return_slot
)
3713 caller_type
= TREE_TYPE (return_slot
);
3714 else /* No LHS on the call. */
3715 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3717 /* We don't need to do anything for functions that don't return anything. */
3718 if (VOID_TYPE_P (callee_type
))
3721 /* If there was a return slot, then the return value is the
3722 dereferenced address of that object. */
3725 /* The front end shouldn't have used both return_slot and
3726 a modify expression. */
3727 gcc_assert (!modify_dest
);
3728 if (DECL_BY_REFERENCE (result
))
3730 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3731 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3733 /* We are going to construct *&return_slot and we can't do that
3734 for variables believed to be not addressable.
3736 FIXME: This check possibly can match, because values returned
3737 via return slot optimization are not believed to have address
3738 taken by alias analysis. */
3739 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3740 var
= return_slot_addr
;
3741 mark_addressable (return_slot
);
3746 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3747 if (TREE_ADDRESSABLE (result
))
3748 mark_addressable (var
);
3750 if (DECL_NOT_GIMPLE_REG_P (result
)
3752 DECL_NOT_GIMPLE_REG_P (var
) = 1;
3754 if (!useless_type_conversion_p (callee_type
, caller_type
))
3755 var
= build1 (VIEW_CONVERT_EXPR
, callee_type
, var
);
3761 /* All types requiring non-trivial constructors should have been handled. */
3762 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3764 /* Attempt to avoid creating a new temporary variable. */
3766 && TREE_CODE (modify_dest
) != SSA_NAME
)
3768 bool use_it
= false;
3770 /* We can't use MODIFY_DEST if there's type promotion involved. */
3771 if (!useless_type_conversion_p (callee_type
, caller_type
))
3774 /* ??? If we're assigning to a variable sized type, then we must
3775 reuse the destination variable, because we've no good way to
3776 create variable sized temporaries at this point. */
3777 else if (!poly_int_tree_p (TYPE_SIZE_UNIT (caller_type
)))
3780 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3781 reuse it as the result of the call directly. Don't do this if
3782 it would promote MODIFY_DEST to addressable. */
3783 else if (TREE_ADDRESSABLE (result
))
3787 tree base_m
= get_base_address (modify_dest
);
3789 /* If the base isn't a decl, then it's a pointer, and we don't
3790 know where that's going to go. */
3791 if (!DECL_P (base_m
))
3793 else if (is_global_var (base_m
))
3795 else if (DECL_NOT_GIMPLE_REG_P (result
)
3796 && !DECL_NOT_GIMPLE_REG_P (base_m
))
3798 else if (!TREE_ADDRESSABLE (base_m
))
3810 gcc_assert (poly_int_tree_p (TYPE_SIZE_UNIT (callee_type
)));
3812 var
= copy_result_decl_to_var (result
, id
);
3813 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3815 /* Do not have the rest of GCC warn about this variable as it should
3816 not be visible to the user. */
3817 suppress_warning (var
/* OPT_Wuninitialized? */);
3819 declare_inline_vars (id
->block
, var
);
3821 /* Build the use expr. If the return type of the function was
3822 promoted, convert it back to the expected type. */
3824 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3826 /* If we can match up types by promotion/demotion do so. */
3827 if (fold_convertible_p (caller_type
, var
))
3828 use
= fold_convert (caller_type
, var
);
3831 /* ??? For valid programs we should not end up here.
3832 Still if we end up with truly mismatched types here, fall back
3833 to using a MEM_REF to not leak invalid GIMPLE to the following
3835 /* Prevent var from being written into SSA form. */
3836 if (is_gimple_reg_type (TREE_TYPE (var
)))
3837 DECL_NOT_GIMPLE_REG_P (var
) = true;
3838 use
= fold_build2 (MEM_REF
, caller_type
,
3839 build_fold_addr_expr (var
),
3840 build_int_cst (ptr_type_node
, 0));
3844 STRIP_USELESS_TYPE_CONVERSION (use
);
3846 if (DECL_BY_REFERENCE (result
))
3848 TREE_ADDRESSABLE (var
) = 1;
3849 var
= build_fold_addr_expr (var
);
3853 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3854 way, when the RESULT_DECL is encountered, it will be
3855 automatically replaced by the VAR_DECL.
3857 When returning by reference, ensure that RESULT_DECL remaps to
3859 if (DECL_BY_REFERENCE (result
)
3860 && !is_gimple_val (var
))
3862 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3863 insert_decl_map (id
, result
, temp
);
3864 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3865 it's default_def SSA_NAME. */
3866 if (gimple_in_ssa_p (id
->src_cfun
)
3867 && is_gimple_reg (result
))
3869 temp
= make_ssa_name (temp
);
3870 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3872 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3875 insert_decl_map (id
, result
, var
);
3877 /* Remember this so we can ignore it in remap_decls. */
3882 /* Determine if the function can be copied. If so return NULL. If
3883 not return a string describng the reason for failure. */
3886 copy_forbidden (struct function
*fun
)
3888 const char *reason
= fun
->cannot_be_copied_reason
;
3890 /* Only examine the function once. */
3891 if (fun
->cannot_be_copied_set
)
3894 /* We cannot copy a function that receives a non-local goto
3895 because we cannot remap the destination label used in the
3896 function that is performing the non-local goto. */
3897 /* ??? Actually, this should be possible, if we work at it.
3898 No doubt there's just a handful of places that simply
3899 assume it doesn't happen and don't substitute properly. */
3900 if (fun
->has_nonlocal_label
)
3902 reason
= G_("function %q+F can never be copied "
3903 "because it receives a non-local goto");
3907 if (fun
->has_forced_label_in_static
)
3909 reason
= G_("function %q+F can never be copied because it saves "
3910 "address of local label in a static variable");
3915 fun
->cannot_be_copied_reason
= reason
;
3916 fun
->cannot_be_copied_set
= true;
3921 static const char *inline_forbidden_reason
;
3923 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3924 iff a function cannot be inlined. Also sets the reason why. */
3927 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3928 struct walk_stmt_info
*wip
)
3930 tree fn
= (tree
) wip
->info
;
3932 gimple
*stmt
= gsi_stmt (*gsi
);
3934 switch (gimple_code (stmt
))
3937 /* Refuse to inline alloca call unless user explicitly forced so as
3938 this may change program's memory overhead drastically when the
3939 function using alloca is called in loop. In GCC present in
3940 SPEC2000 inlining into schedule_block cause it to require 2GB of
3941 RAM instead of 256MB. Don't do so for alloca calls emitted for
3942 VLA objects as those can't cause unbounded growth (they're always
3943 wrapped inside stack_save/stack_restore regions. */
3944 if (gimple_maybe_alloca_call_p (stmt
)
3945 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3946 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3948 inline_forbidden_reason
3949 = G_("function %q+F can never be inlined because it uses "
3950 "alloca (override using the always_inline attribute)");
3951 *handled_ops_p
= true;
3955 t
= gimple_call_fndecl (stmt
);
3959 /* We cannot inline functions that call setjmp. */
3960 if (setjmp_call_p (t
))
3962 inline_forbidden_reason
3963 = G_("function %q+F can never be inlined because it uses setjmp");
3964 *handled_ops_p
= true;
3968 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3969 switch (DECL_FUNCTION_CODE (t
))
3971 /* We cannot inline functions that take a variable number of
3973 case BUILT_IN_VA_START
:
3974 case BUILT_IN_NEXT_ARG
:
3975 case BUILT_IN_VA_END
:
3976 inline_forbidden_reason
3977 = G_("function %q+F can never be inlined because it "
3978 "uses variable argument lists");
3979 *handled_ops_p
= true;
3982 case BUILT_IN_LONGJMP
:
3983 /* We can't inline functions that call __builtin_longjmp at
3984 all. The non-local goto machinery really requires the
3985 destination be in a different function. If we allow the
3986 function calling __builtin_longjmp to be inlined into the
3987 function calling __builtin_setjmp, Things will Go Awry. */
3988 inline_forbidden_reason
3989 = G_("function %q+F can never be inlined because "
3990 "it uses setjmp-longjmp exception handling");
3991 *handled_ops_p
= true;
3994 case BUILT_IN_NONLOCAL_GOTO
:
3996 inline_forbidden_reason
3997 = G_("function %q+F can never be inlined because "
3998 "it uses non-local goto");
3999 *handled_ops_p
= true;
4002 case BUILT_IN_RETURN
:
4003 case BUILT_IN_APPLY_ARGS
:
4004 /* If a __builtin_apply_args caller would be inlined,
4005 it would be saving arguments of the function it has
4006 been inlined into. Similarly __builtin_return would
4007 return from the function the inline has been inlined into. */
4008 inline_forbidden_reason
4009 = G_("function %q+F can never be inlined because "
4010 "it uses %<__builtin_return%> or %<__builtin_apply_args%>");
4011 *handled_ops_p
= true;
4020 t
= gimple_goto_dest (stmt
);
4022 /* We will not inline a function which uses computed goto. The
4023 addresses of its local labels, which may be tucked into
4024 global storage, are of course not constant across
4025 instantiations, which causes unexpected behavior. */
4026 if (TREE_CODE (t
) != LABEL_DECL
)
4028 inline_forbidden_reason
4029 = G_("function %q+F can never be inlined "
4030 "because it contains a computed goto");
4031 *handled_ops_p
= true;
4040 *handled_ops_p
= false;
4044 /* Return true if FNDECL is a function that cannot be inlined into
4048 inline_forbidden_p (tree fndecl
)
4050 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
4051 struct walk_stmt_info wi
;
4053 bool forbidden_p
= false;
4055 /* First check for shared reasons not to copy the code. */
4056 inline_forbidden_reason
= copy_forbidden (fun
);
4057 if (inline_forbidden_reason
!= NULL
)
4060 /* Next, walk the statements of the function looking for
4061 constraucts we can't handle, or are non-optimal for inlining. */
4062 hash_set
<tree
> visited_nodes
;
4063 memset (&wi
, 0, sizeof (wi
));
4064 wi
.info
= (void *) fndecl
;
4065 wi
.pset
= &visited_nodes
;
4067 /* We cannot inline a function with a variable-sized parameter because we
4068 cannot materialize a temporary of such a type in the caller if need be.
4069 Note that the return case is not symmetrical because we can guarantee
4070 that a temporary is not needed by means of CALL_EXPR_RETURN_SLOT_OPT. */
4071 for (tree parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= DECL_CHAIN (parm
))
4072 if (!poly_int_tree_p (DECL_SIZE (parm
)))
4074 inline_forbidden_reason
4075 = G_("function %q+F can never be inlined because "
4076 "it has a VLA argument");
4080 FOR_EACH_BB_FN (bb
, fun
)
4083 gimple_seq seq
= bb_seq (bb
);
4084 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
4085 forbidden_p
= (ret
!= NULL
);
4093 /* Return false if the function FNDECL cannot be inlined on account of its
4094 attributes, true otherwise. */
4096 function_attribute_inlinable_p (const_tree fndecl
)
4098 if (targetm
.attribute_table
)
4102 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
4104 const_tree name
= get_attribute_name (a
);
4107 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
4108 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
4109 return targetm
.function_attribute_inlinable_p (fndecl
);
4116 /* Returns nonzero if FN is a function that does not have any
4117 fundamental inline blocking properties. */
4120 tree_inlinable_function_p (tree fn
)
4122 bool inlinable
= true;
4126 /* If we've already decided this function shouldn't be inlined,
4127 there's no need to check again. */
4128 if (DECL_UNINLINABLE (fn
))
4131 /* We only warn for functions declared `inline' by the user. */
4132 do_warning
= (opt_for_fn (fn
, warn_inline
)
4133 && DECL_DECLARED_INLINE_P (fn
)
4134 && !DECL_NO_INLINE_WARNING_P (fn
)
4135 && !DECL_IN_SYSTEM_HEADER (fn
));
4137 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
4140 && always_inline
== NULL
)
4143 warning (OPT_Winline
, "function %q+F can never be inlined because it "
4144 "is suppressed using %<-fno-inline%>", fn
);
4148 else if (!function_attribute_inlinable_p (fn
))
4151 warning (OPT_Winline
, "function %q+F can never be inlined because it "
4152 "uses attributes conflicting with inlining", fn
);
4156 else if (inline_forbidden_p (fn
))
4158 /* See if we should warn about uninlinable functions. Previously,
4159 some of these warnings would be issued while trying to expand
4160 the function inline, but that would cause multiple warnings
4161 about functions that would for example call alloca. But since
4162 this a property of the function, just one warning is enough.
4163 As a bonus we can now give more details about the reason why a
4164 function is not inlinable. */
4166 error (inline_forbidden_reason
, fn
);
4167 else if (do_warning
)
4168 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
4173 /* Squirrel away the result so that we don't have to check again. */
4174 DECL_UNINLINABLE (fn
) = !inlinable
;
4179 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
4180 word size and take possible memcpy call into account and return
4181 cost based on whether optimizing for size or speed according to SPEED_P. */
4184 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
4188 gcc_assert (!VOID_TYPE_P (type
));
4190 if (TREE_CODE (type
) == VECTOR_TYPE
)
4192 scalar_mode inner
= SCALAR_TYPE_MODE (TREE_TYPE (type
));
4193 machine_mode simd
= targetm
.vectorize
.preferred_simd_mode (inner
);
4195 = estimated_poly_value (GET_MODE_SIZE (TYPE_MODE (type
)));
4196 int simd_mode_size
= estimated_poly_value (GET_MODE_SIZE (simd
));
4197 return ((orig_mode_size
+ simd_mode_size
- 1)
4201 size
= int_size_in_bytes (type
);
4203 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
4204 /* Cost of a memcpy call, 3 arguments and the call. */
4207 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
4210 /* Returns cost of operation CODE, according to WEIGHTS */
4213 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
4214 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
4218 /* These are "free" conversions, or their presumed cost
4219 is folded into other operations. */
4224 case VIEW_CONVERT_EXPR
:
4227 /* Assign cost of 1 to usual operations.
4228 ??? We may consider mapping RTL costs to this. */
4234 case POINTER_PLUS_EXPR
:
4235 case POINTER_DIFF_EXPR
:
4238 case MULT_HIGHPART_EXPR
:
4240 case ADDR_SPACE_CONVERT_EXPR
:
4241 case FIXED_CONVERT_EXPR
:
4242 case FIX_TRUNC_EXPR
:
4261 case TRUTH_ANDIF_EXPR
:
4262 case TRUTH_ORIF_EXPR
:
4263 case TRUTH_AND_EXPR
:
4265 case TRUTH_XOR_EXPR
:
4266 case TRUTH_NOT_EXPR
:
4275 case UNORDERED_EXPR
:
4286 case PREDECREMENT_EXPR
:
4287 case PREINCREMENT_EXPR
:
4288 case POSTDECREMENT_EXPR
:
4289 case POSTINCREMENT_EXPR
:
4291 case REALIGN_LOAD_EXPR
:
4293 case WIDEN_PLUS_EXPR
:
4294 case WIDEN_MINUS_EXPR
:
4295 case WIDEN_SUM_EXPR
:
4296 case WIDEN_MULT_EXPR
:
4299 case WIDEN_MULT_PLUS_EXPR
:
4300 case WIDEN_MULT_MINUS_EXPR
:
4301 case WIDEN_LSHIFT_EXPR
:
4303 case VEC_WIDEN_PLUS_HI_EXPR
:
4304 case VEC_WIDEN_PLUS_LO_EXPR
:
4305 case VEC_WIDEN_MINUS_HI_EXPR
:
4306 case VEC_WIDEN_MINUS_LO_EXPR
:
4307 case VEC_WIDEN_MULT_HI_EXPR
:
4308 case VEC_WIDEN_MULT_LO_EXPR
:
4309 case VEC_WIDEN_MULT_EVEN_EXPR
:
4310 case VEC_WIDEN_MULT_ODD_EXPR
:
4311 case VEC_UNPACK_HI_EXPR
:
4312 case VEC_UNPACK_LO_EXPR
:
4313 case VEC_UNPACK_FLOAT_HI_EXPR
:
4314 case VEC_UNPACK_FLOAT_LO_EXPR
:
4315 case VEC_UNPACK_FIX_TRUNC_HI_EXPR
:
4316 case VEC_UNPACK_FIX_TRUNC_LO_EXPR
:
4317 case VEC_PACK_TRUNC_EXPR
:
4318 case VEC_PACK_SAT_EXPR
:
4319 case VEC_PACK_FIX_TRUNC_EXPR
:
4320 case VEC_PACK_FLOAT_EXPR
:
4321 case VEC_WIDEN_LSHIFT_HI_EXPR
:
4322 case VEC_WIDEN_LSHIFT_LO_EXPR
:
4323 case VEC_DUPLICATE_EXPR
:
4324 case VEC_SERIES_EXPR
:
4328 /* Few special cases of expensive operations. This is useful
4329 to avoid inlining on functions having too many of these. */
4330 case TRUNC_DIV_EXPR
:
4332 case FLOOR_DIV_EXPR
:
4333 case ROUND_DIV_EXPR
:
4334 case EXACT_DIV_EXPR
:
4335 case TRUNC_MOD_EXPR
:
4337 case FLOOR_MOD_EXPR
:
4338 case ROUND_MOD_EXPR
:
4340 if (TREE_CODE (op2
) != INTEGER_CST
)
4341 return weights
->div_mod_cost
;
4344 /* Bit-field insertion needs several shift and mask operations. */
4345 case BIT_INSERT_EXPR
:
4349 /* We expect a copy assignment with no operator. */
4350 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
4356 /* Estimate number of instructions that will be created by expanding
4357 the statements in the statement sequence STMTS.
4358 WEIGHTS contains weights attributed to various constructs. */
4361 estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
4364 gimple_stmt_iterator gsi
;
4367 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4368 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4374 /* Estimate number of instructions that will be created by expanding STMT.
4375 WEIGHTS contains weights attributed to various constructs. */
4378 estimate_num_insns (gimple
*stmt
, eni_weights
*weights
)
4381 enum gimple_code code
= gimple_code (stmt
);
4388 /* Try to estimate the cost of assignments. We have three cases to
4390 1) Simple assignments to registers;
4391 2) Stores to things that must live in memory. This includes
4392 "normal" stores to scalars, but also assignments of large
4393 structures, or constructors of big arrays;
4395 Let us look at the first two cases, assuming we have "a = b + C":
4396 <GIMPLE_ASSIGN <var_decl "a">
4397 <plus_expr <var_decl "b"> <constant C>>
4398 If "a" is a GIMPLE register, the assignment to it is free on almost
4399 any target, because "a" usually ends up in a real register. Hence
4400 the only cost of this expression comes from the PLUS_EXPR, and we
4401 can ignore the GIMPLE_ASSIGN.
4402 If "a" is not a GIMPLE register, the assignment to "a" will most
4403 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4404 of moving something into "a", which we compute using the function
4405 estimate_move_cost. */
4406 if (gimple_clobber_p (stmt
))
4407 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4409 lhs
= gimple_assign_lhs (stmt
);
4410 rhs
= gimple_assign_rhs1 (stmt
);
4414 /* Account for the cost of moving to / from memory. */
4415 if (gimple_store_p (stmt
))
4416 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
4417 if (gimple_assign_load_p (stmt
))
4418 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
4420 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
4421 gimple_assign_rhs1 (stmt
),
4422 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
4423 == GIMPLE_BINARY_RHS
4424 ? gimple_assign_rhs2 (stmt
) : NULL
);
4428 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4429 gimple_op (stmt
, 0),
4430 gimple_op (stmt
, 1));
4435 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4436 /* Take into account cost of the switch + guess 2 conditional jumps for
4439 TODO: once the switch expansion logic is sufficiently separated, we can
4440 do better job on estimating cost of the switch. */
4441 if (weights
->time_based
)
4442 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4444 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4452 if (gimple_call_internal_p (stmt
))
4454 else if ((decl
= gimple_call_fndecl (stmt
))
4455 && fndecl_built_in_p (decl
))
4457 /* Do not special case builtins where we see the body.
4458 This just confuse inliner. */
4459 struct cgraph_node
*node
;
4460 if ((node
= cgraph_node::get (decl
))
4461 && node
->definition
)
4463 /* For buitins that are likely expanded to nothing or
4464 inlined do not account operand costs. */
4465 else if (is_simple_builtin (decl
))
4467 else if (is_inexpensive_builtin (decl
))
4468 return weights
->target_builtin_call_cost
;
4469 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
4471 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4472 specialize the cheap expansion we do here.
4473 ??? This asks for a more general solution. */
4474 switch (DECL_FUNCTION_CODE (decl
))
4479 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4481 (&TREE_REAL_CST (gimple_call_arg (stmt
, 1)),
4483 return estimate_operator_cost
4484 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4485 gimple_call_arg (stmt
, 0));
4494 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4495 if (gimple_call_lhs (stmt
))
4496 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4497 weights
->time_based
);
4498 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4500 tree arg
= gimple_call_arg (stmt
, i
);
4501 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4502 weights
->time_based
);
4508 return weights
->return_cost
;
4514 case GIMPLE_PREDICT
:
4520 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4521 /* 1000 means infinity. This avoids overflows later
4522 with very long asm statements. */
4525 /* If this asm is asm inline, count anything as minimum size. */
4526 if (gimple_asm_inline_p (as_a
<gasm
*> (stmt
)))
4527 count
= MIN (1, count
);
4528 return MAX (1, count
);
4532 /* This is either going to be an external function call with one
4533 argument, or two register copy statements plus a goto. */
4536 case GIMPLE_EH_DISPATCH
:
4537 /* ??? This is going to turn into a switch statement. Ideally
4538 we'd have a look at the eh region and estimate the number of
4543 return estimate_num_insns_seq (
4544 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4547 case GIMPLE_EH_FILTER
:
4548 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4551 return estimate_num_insns_seq (gimple_catch_handler (
4552 as_a
<gcatch
*> (stmt
)),
4556 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4557 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4559 /* OMP directives are generally very expensive. */
4561 case GIMPLE_OMP_RETURN
:
4562 case GIMPLE_OMP_SECTIONS_SWITCH
:
4563 case GIMPLE_OMP_ATOMIC_STORE
:
4564 case GIMPLE_OMP_CONTINUE
:
4565 /* ...except these, which are cheap. */
4568 case GIMPLE_OMP_ATOMIC_LOAD
:
4569 return weights
->omp_cost
;
4571 case GIMPLE_OMP_FOR
:
4572 return (weights
->omp_cost
4573 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4574 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4576 case GIMPLE_OMP_PARALLEL
:
4577 case GIMPLE_OMP_TASK
:
4578 case GIMPLE_OMP_CRITICAL
:
4579 case GIMPLE_OMP_MASTER
:
4580 case GIMPLE_OMP_MASKED
:
4581 case GIMPLE_OMP_SCOPE
:
4582 case GIMPLE_OMP_TASKGROUP
:
4583 case GIMPLE_OMP_ORDERED
:
4584 case GIMPLE_OMP_SCAN
:
4585 case GIMPLE_OMP_SECTION
:
4586 case GIMPLE_OMP_SECTIONS
:
4587 case GIMPLE_OMP_SINGLE
:
4588 case GIMPLE_OMP_TARGET
:
4589 case GIMPLE_OMP_TEAMS
:
4590 return (weights
->omp_cost
4591 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4593 case GIMPLE_TRANSACTION
:
4594 return (weights
->tm_cost
4595 + estimate_num_insns_seq (gimple_transaction_body (
4596 as_a
<gtransaction
*> (stmt
)),
4606 /* Estimate number of instructions that will be created by expanding
4607 function FNDECL. WEIGHTS contains weights attributed to various
4611 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4613 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4614 gimple_stmt_iterator bsi
;
4618 gcc_assert (my_function
&& my_function
->cfg
);
4619 FOR_EACH_BB_FN (bb
, my_function
)
4621 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4622 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4629 /* Initializes weights used by estimate_num_insns. */
4632 init_inline_once (void)
4634 eni_size_weights
.call_cost
= 1;
4635 eni_size_weights
.indirect_call_cost
= 3;
4636 eni_size_weights
.target_builtin_call_cost
= 1;
4637 eni_size_weights
.div_mod_cost
= 1;
4638 eni_size_weights
.omp_cost
= 40;
4639 eni_size_weights
.tm_cost
= 10;
4640 eni_size_weights
.time_based
= false;
4641 eni_size_weights
.return_cost
= 1;
4643 /* Estimating time for call is difficult, since we have no idea what the
4644 called function does. In the current uses of eni_time_weights,
4645 underestimating the cost does less harm than overestimating it, so
4646 we choose a rather small value here. */
4647 eni_time_weights
.call_cost
= 10;
4648 eni_time_weights
.indirect_call_cost
= 15;
4649 eni_time_weights
.target_builtin_call_cost
= 1;
4650 eni_time_weights
.div_mod_cost
= 10;
4651 eni_time_weights
.omp_cost
= 40;
4652 eni_time_weights
.tm_cost
= 40;
4653 eni_time_weights
.time_based
= true;
4654 eni_time_weights
.return_cost
= 2;
4658 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4661 prepend_lexical_block (tree current_block
, tree new_block
)
4663 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4664 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4665 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4668 /* Add local variables from CALLEE to CALLER. */
4671 add_local_variables (struct function
*callee
, struct function
*caller
,
4677 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4678 if (!can_be_nonlocal (var
, id
))
4680 tree new_var
= remap_decl (var
, id
);
4682 /* Remap debug-expressions. */
4684 && DECL_HAS_DEBUG_EXPR_P (var
)
4687 tree tem
= DECL_DEBUG_EXPR (var
);
4688 bool old_regimplify
= id
->regimplify
;
4689 id
->remapping_type_depth
++;
4690 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4691 id
->remapping_type_depth
--;
4692 id
->regimplify
= old_regimplify
;
4693 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4694 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4696 add_local_decl (caller
, new_var
);
4700 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4701 have brought in or introduced any debug stmts for SRCVAR. */
4704 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4706 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4711 if (!VAR_P (*remappedvarp
))
4714 if (*remappedvarp
== id
->retvar
)
4717 tree tvar
= target_for_debug_bind (*remappedvarp
);
4721 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4723 gimple_seq_add_stmt (bindings
, stmt
);
4726 /* For each inlined variable for which we may have debug bind stmts,
4727 add before GSI a final debug stmt resetting it, marking the end of
4728 its life, so that var-tracking knows it doesn't have to compute
4729 further locations for it. */
4732 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4736 gimple_seq bindings
= NULL
;
4738 if (!gimple_in_ssa_p (id
->src_cfun
))
4741 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4744 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4745 var
; var
= DECL_CHAIN (var
))
4746 reset_debug_binding (id
, var
, &bindings
);
4748 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4749 reset_debug_binding (id
, var
, &bindings
);
4751 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4754 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4757 expand_call_inline (basic_block bb
, gimple
*stmt
, copy_body_data
*id
,
4762 hash_map
<tree
, tree
> *dst
;
4763 hash_map
<tree
, tree
> *st
= NULL
;
4766 struct cgraph_edge
*cg_edge
;
4767 cgraph_inline_failed_t reason
;
4768 basic_block return_block
;
4770 gimple_stmt_iterator gsi
, stmt_gsi
;
4771 bool successfully_inlined
= false;
4772 bool purge_dead_abnormal_edges
;
4774 unsigned int prop_mask
, src_properties
;
4775 struct function
*dst_cfun
;
4778 gimple
*simtenter_stmt
= NULL
;
4779 vec
<tree
> *simtvars_save
;
4781 /* The gimplifier uses input_location in too many places, such as
4782 internal_get_tmp_var (). */
4783 location_t saved_location
= input_location
;
4784 input_location
= gimple_location (stmt
);
4786 /* From here on, we're only interested in CALL_EXPRs. */
4787 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4791 cg_edge
= id
->dst_node
->get_edge (stmt
);
4792 gcc_checking_assert (cg_edge
);
4793 /* First, see if we can figure out what function is being called.
4794 If we cannot, then there is no hope of inlining the function. */
4795 if (cg_edge
->indirect_unknown_callee
)
4797 fn
= cg_edge
->callee
->decl
;
4798 gcc_checking_assert (fn
);
4800 /* If FN is a declaration of a function in a nested scope that was
4801 globally declared inline, we don't set its DECL_INITIAL.
4802 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4803 C++ front-end uses it for cdtors to refer to their internal
4804 declarations, that are not real functions. Fortunately those
4805 don't have trees to be saved, so we can tell by checking their
4807 if (!DECL_INITIAL (fn
)
4808 && DECL_ABSTRACT_ORIGIN (fn
)
4809 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4810 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4812 /* Don't try to inline functions that are not well-suited to inlining. */
4813 if (cg_edge
->inline_failed
)
4815 reason
= cg_edge
->inline_failed
;
4816 /* If this call was originally indirect, we do not want to emit any
4817 inlining related warnings or sorry messages because there are no
4818 guarantees regarding those. */
4819 if (cg_edge
->indirect_inlining_edge
)
4822 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4823 /* For extern inline functions that get redefined we always
4824 silently ignored always_inline flag. Better behavior would
4825 be to be able to keep both bodies and use extern inline body
4826 for inlining, but we can't do that because frontends overwrite
4828 && !cg_edge
->callee
->redefined_extern_inline
4829 /* During early inline pass, report only when optimization is
4831 && (symtab
->global_info_ready
4833 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4834 /* PR 20090218-1_0.c. Body can be provided by another module. */
4835 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4837 error ("inlining failed in call to %<always_inline%> %q+F: %s", fn
,
4838 cgraph_inline_failed_string (reason
));
4839 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4840 inform (gimple_location (stmt
), "called from here");
4841 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4842 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4843 "called from this function");
4845 else if (opt_for_fn (fn
, warn_inline
)
4846 && DECL_DECLARED_INLINE_P (fn
)
4847 && !DECL_NO_INLINE_WARNING_P (fn
)
4848 && !DECL_IN_SYSTEM_HEADER (fn
)
4849 && reason
!= CIF_UNSPECIFIED
4850 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4851 /* Do not warn about not inlined recursive calls. */
4852 && !cg_edge
->recursive_p ()
4853 /* Avoid warnings during early inline pass. */
4854 && symtab
->global_info_ready
)
4856 auto_diagnostic_group d
;
4857 if (warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4858 fn
, _(cgraph_inline_failed_string (reason
))))
4860 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4861 inform (gimple_location (stmt
), "called from here");
4862 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4863 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4864 "called from this function");
4869 id
->src_node
= cg_edge
->callee
;
4871 /* If callee is thunk, all we need is to adjust the THIS pointer
4872 and redirect to function being thunked. */
4873 if (id
->src_node
->thunk
)
4876 tree virtual_offset
= NULL
;
4877 profile_count count
= cg_edge
->count
;
4879 gimple_stmt_iterator iter
= gsi_for_stmt (stmt
);
4880 thunk_info
*info
= thunk_info::get (id
->src_node
);
4882 cgraph_edge::remove (cg_edge
);
4883 edge
= id
->src_node
->callees
->clone (id
->dst_node
, call_stmt
,
4885 profile_count::one (),
4886 profile_count::one (),
4888 edge
->count
= count
;
4889 if (info
->virtual_offset_p
)
4890 virtual_offset
= size_int (info
->virtual_value
);
4891 op
= create_tmp_reg_fn (cfun
, TREE_TYPE (gimple_call_arg (stmt
, 0)),
4893 gsi_insert_before (&iter
, gimple_build_assign (op
,
4894 gimple_call_arg (stmt
, 0)),
4896 gcc_assert (info
->this_adjusting
);
4897 op
= thunk_adjust (&iter
, op
, 1, info
->fixed_offset
,
4898 virtual_offset
, info
->indirect_offset
);
4900 gimple_call_set_arg (stmt
, 0, op
);
4901 gimple_call_set_fndecl (stmt
, edge
->callee
->decl
);
4903 id
->src_node
->remove ();
4904 successfully_inlined
= expand_call_inline (bb
, stmt
, id
, to_purge
);
4905 maybe_remove_unused_call_args (cfun
, stmt
);
4906 /* This used to return true even though we do fail to inline in
4907 some cases. See PR98525. */
4910 fn
= cg_edge
->callee
->decl
;
4911 cg_edge
->callee
->get_untransformed_body ();
4913 if (flag_checking
&& cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4914 cg_edge
->callee
->verify ();
4916 /* We will be inlining this callee. */
4917 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4919 /* Update the callers EH personality. */
4920 if (DECL_FUNCTION_PERSONALITY (fn
))
4921 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4922 = DECL_FUNCTION_PERSONALITY (fn
);
4924 /* Split the block before the GIMPLE_CALL. */
4925 stmt_gsi
= gsi_for_stmt (stmt
);
4926 gsi_prev (&stmt_gsi
);
4927 e
= split_block (bb
, gsi_end_p (stmt_gsi
) ? NULL
: gsi_stmt (stmt_gsi
));
4929 return_block
= e
->dest
;
4932 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4933 been the source of abnormal edges. In this case, schedule
4934 the removal of dead abnormal edges. */
4935 gsi
= gsi_start_bb (return_block
);
4937 purge_dead_abnormal_edges
= gsi_end_p (gsi
);
4939 stmt_gsi
= gsi_start_bb (return_block
);
4941 /* Build a block containing code to initialize the arguments, the
4942 actual inline expansion of the body, and a label for the return
4943 statements within the function to jump to. The type of the
4944 statement expression is the return type of the function call.
4945 ??? If the call does not have an associated block then we will
4946 remap all callee blocks to NULL, effectively dropping most of
4947 its debug information. This should only happen for calls to
4948 artificial decls inserted by the compiler itself. We need to
4949 either link the inlined blocks into the caller block tree or
4950 not refer to them in any way to not break GC for locations. */
4951 if (tree block
= gimple_block (stmt
))
4953 /* We do want to assign a not UNKNOWN_LOCATION BLOCK_SOURCE_LOCATION
4954 to make inlined_function_outer_scope_p return true on this BLOCK. */
4955 location_t loc
= LOCATION_LOCUS (gimple_location (stmt
));
4956 if (loc
== UNKNOWN_LOCATION
)
4957 loc
= LOCATION_LOCUS (DECL_SOURCE_LOCATION (fn
));
4958 if (loc
== UNKNOWN_LOCATION
)
4959 loc
= BUILTINS_LOCATION
;
4960 id
->block
= make_node (BLOCK
);
4961 BLOCK_ABSTRACT_ORIGIN (id
->block
) = DECL_ORIGIN (fn
);
4962 BLOCK_SOURCE_LOCATION (id
->block
) = loc
;
4963 prepend_lexical_block (block
, id
->block
);
4966 /* Local declarations will be replaced by their equivalents in this map. */
4968 id
->decl_map
= new hash_map
<tree
, tree
>;
4969 dst
= id
->debug_map
;
4970 id
->debug_map
= NULL
;
4971 if (flag_stack_reuse
!= SR_NONE
)
4972 id
->add_clobbers_to_eh_landing_pads
= last_basic_block_for_fn (cfun
);
4974 /* Record the function we are about to inline. */
4976 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4977 id
->reset_location
= DECL_IGNORED_P (fn
);
4978 id
->call_stmt
= call_stmt
;
4980 /* When inlining into an OpenMP SIMD-on-SIMT loop, arrange for new automatic
4981 variables to be added to IFN_GOMP_SIMT_ENTER argument list. */
4982 dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4983 simtvars_save
= id
->dst_simt_vars
;
4984 if (!(dst_cfun
->curr_properties
& PROP_gimple_lomp_dev
)
4985 && (simduid
= bb
->loop_father
->simduid
) != NULL_TREE
4986 && (simduid
= ssa_default_def (dst_cfun
, simduid
)) != NULL_TREE
4987 && single_imm_use (simduid
, &use
, &simtenter_stmt
)
4988 && is_gimple_call (simtenter_stmt
)
4989 && gimple_call_internal_p (simtenter_stmt
, IFN_GOMP_SIMT_ENTER
))
4990 vec_alloc (id
->dst_simt_vars
, 0);
4992 id
->dst_simt_vars
= NULL
;
4994 if (profile_status_for_fn (id
->src_cfun
) == PROFILE_ABSENT
)
4995 profile_status_for_fn (dst_cfun
) = PROFILE_ABSENT
;
4997 /* If the src function contains an IFN_VA_ARG, then so will the dst
4998 function after inlining. Likewise for IFN_GOMP_USE_SIMT. */
4999 prop_mask
= PROP_gimple_lva
| PROP_gimple_lomp_dev
;
5000 src_properties
= id
->src_cfun
->curr_properties
& prop_mask
;
5001 if (src_properties
!= prop_mask
)
5002 dst_cfun
->curr_properties
&= src_properties
| ~prop_mask
;
5003 dst_cfun
->calls_eh_return
|= id
->src_cfun
->calls_eh_return
;
5004 id
->dst_node
->calls_declare_variant_alt
5005 |= id
->src_node
->calls_declare_variant_alt
;
5007 gcc_assert (!id
->src_cfun
->after_inlining
);
5010 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
5012 gimple_stmt_iterator si
= gsi_last_bb (bb
);
5013 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
5017 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
5018 if (debug_nonbind_markers_p
&& debug_inline_points
&& id
->block
5019 && inlined_function_outer_scope_p (id
->block
))
5021 gimple_stmt_iterator si
= gsi_last_bb (bb
);
5022 gsi_insert_after (&si
, gimple_build_debug_inline_entry
5023 (id
->block
, DECL_SOURCE_LOCATION (id
->src_fn
)),
5027 if (DECL_INITIAL (fn
))
5029 if (gimple_block (stmt
))
5033 prepend_lexical_block (id
->block
,
5034 remap_blocks (DECL_INITIAL (fn
), id
));
5035 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
5036 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
5038 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
5039 otherwise for DWARF DW_TAG_formal_parameter will not be children of
5040 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
5041 under it. The parameters can be then evaluated in the debugger,
5042 but don't show in backtraces. */
5043 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
5044 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
5047 *var
= TREE_CHAIN (v
);
5048 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
5049 BLOCK_VARS (id
->block
) = v
;
5052 var
= &TREE_CHAIN (*var
);
5055 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
5058 /* Return statements in the function body will be replaced by jumps
5059 to the RET_LABEL. */
5060 gcc_assert (DECL_INITIAL (fn
));
5061 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
5063 /* Find the LHS to which the result of this call is assigned. */
5065 if (gimple_call_lhs (stmt
))
5067 modify_dest
= gimple_call_lhs (stmt
);
5069 /* The function which we are inlining might not return a value,
5070 in which case we should issue a warning that the function
5071 does not return a value. In that case the optimizers will
5072 see that the variable to which the value is assigned was not
5073 initialized. We do not want to issue a warning about that
5074 uninitialized variable. */
5075 if (DECL_P (modify_dest
))
5076 suppress_warning (modify_dest
, OPT_Wuninitialized
);
5078 if (gimple_call_return_slot_opt_p (call_stmt
))
5080 return_slot
= modify_dest
;
5087 /* If we are inlining a call to the C++ operator new, we don't want
5088 to use type based alias analysis on the return value. Otherwise
5089 we may get confused if the compiler sees that the inlined new
5090 function returns a pointer which was just deleted. See bug
5092 if (DECL_IS_OPERATOR_NEW_P (fn
))
5098 /* Declare the return variable for the function. */
5099 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
5101 /* Add local vars in this inlined callee to caller. */
5102 add_local_variables (id
->src_cfun
, cfun
, id
);
5104 if (dump_enabled_p ())
5107 snprintf (buf
, sizeof(buf
), "%4.2f",
5108 cg_edge
->sreal_frequency ().to_double ());
5109 dump_printf_loc (MSG_NOTE
| MSG_PRIORITY_INTERNALS
,
5111 "Inlining %C to %C with frequency %s\n",
5112 id
->src_node
, id
->dst_node
, buf
);
5113 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5115 id
->src_node
->dump (dump_file
);
5116 id
->dst_node
->dump (dump_file
);
5120 /* This is it. Duplicate the callee body. Assume callee is
5121 pre-gimplified. Note that we must not alter the caller
5122 function in any way before this point, as this CALL_EXPR may be
5123 a self-referential call; if we're calling ourselves, we need to
5124 duplicate our body before altering anything. */
5125 copy_body (id
, bb
, return_block
, NULL
);
5127 reset_debug_bindings (id
, stmt_gsi
);
5129 if (flag_stack_reuse
!= SR_NONE
)
5130 for (tree p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
5131 if (!TREE_THIS_VOLATILE (p
))
5133 /* The value associated with P is a local temporary only if
5134 there is no value associated with P in the debug map. */
5135 tree
*varp
= id
->decl_map
->get (p
);
5138 && !is_gimple_reg (*varp
)
5139 && !(id
->debug_map
&& id
->debug_map
->get (p
)))
5141 tree clobber
= build_clobber (TREE_TYPE (*varp
));
5142 gimple
*clobber_stmt
;
5143 clobber_stmt
= gimple_build_assign (*varp
, clobber
);
5144 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
5145 gsi_insert_before (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
5149 /* Reset the escaped solution. */
5150 if (cfun
->gimple_df
)
5151 pt_solution_reset (&cfun
->gimple_df
->escaped
);
5153 /* Add new automatic variables to IFN_GOMP_SIMT_ENTER arguments. */
5154 if (id
->dst_simt_vars
&& id
->dst_simt_vars
->length () > 0)
5156 size_t nargs
= gimple_call_num_args (simtenter_stmt
);
5157 vec
<tree
> *vars
= id
->dst_simt_vars
;
5158 auto_vec
<tree
> newargs (nargs
+ vars
->length ());
5159 for (size_t i
= 0; i
< nargs
; i
++)
5160 newargs
.quick_push (gimple_call_arg (simtenter_stmt
, i
));
5161 for (tree
*pvar
= vars
->begin (); pvar
!= vars
->end (); pvar
++)
5163 tree ptrtype
= build_pointer_type (TREE_TYPE (*pvar
));
5164 newargs
.quick_push (build1 (ADDR_EXPR
, ptrtype
, *pvar
));
5166 gcall
*g
= gimple_build_call_internal_vec (IFN_GOMP_SIMT_ENTER
, newargs
);
5167 gimple_call_set_lhs (g
, gimple_call_lhs (simtenter_stmt
));
5168 gimple_stmt_iterator gsi
= gsi_for_stmt (simtenter_stmt
);
5169 gsi_replace (&gsi
, g
, false);
5171 vec_free (id
->dst_simt_vars
);
5172 id
->dst_simt_vars
= simtvars_save
;
5177 delete id
->debug_map
;
5178 id
->debug_map
= dst
;
5180 delete id
->decl_map
;
5183 /* Unlink the calls virtual operands before replacing it. */
5184 unlink_stmt_vdef (stmt
);
5185 if (gimple_vdef (stmt
)
5186 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
5187 release_ssa_name (gimple_vdef (stmt
));
5189 /* If the inlined function returns a result that we care about,
5190 substitute the GIMPLE_CALL with an assignment of the return
5191 variable to the LHS of the call. That is, if STMT was
5192 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
5193 if (use_retvar
&& gimple_call_lhs (stmt
))
5195 gimple
*old_stmt
= stmt
;
5196 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
5197 gimple_set_location (stmt
, gimple_location (old_stmt
));
5198 gsi_replace (&stmt_gsi
, stmt
, false);
5199 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
5200 /* Append a clobber for id->retvar if easily possible. */
5201 if (flag_stack_reuse
!= SR_NONE
5203 && VAR_P (id
->retvar
)
5204 && id
->retvar
!= return_slot
5205 && id
->retvar
!= modify_dest
5206 && !TREE_THIS_VOLATILE (id
->retvar
)
5207 && !is_gimple_reg (id
->retvar
)
5208 && !stmt_ends_bb_p (stmt
))
5210 tree clobber
= build_clobber (TREE_TYPE (id
->retvar
));
5211 gimple
*clobber_stmt
;
5212 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
5213 gimple_set_location (clobber_stmt
, gimple_location (old_stmt
));
5214 gsi_insert_after (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
5219 /* Handle the case of inlining a function with no return
5220 statement, which causes the return value to become undefined. */
5221 if (gimple_call_lhs (stmt
)
5222 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
5224 tree name
= gimple_call_lhs (stmt
);
5225 tree var
= SSA_NAME_VAR (name
);
5226 tree def
= var
? ssa_default_def (cfun
, var
) : NULL
;
5230 /* If the variable is used undefined, make this name
5231 undefined via a move. */
5232 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
5233 gsi_replace (&stmt_gsi
, stmt
, true);
5239 var
= create_tmp_reg_fn (cfun
, TREE_TYPE (name
), NULL
);
5240 SET_SSA_NAME_VAR_OR_IDENTIFIER (name
, var
);
5242 /* Otherwise make this variable undefined. */
5243 gsi_remove (&stmt_gsi
, true);
5244 set_ssa_default_def (cfun
, var
, name
);
5245 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
5248 /* Replace with a clobber for id->retvar. */
5249 else if (flag_stack_reuse
!= SR_NONE
5251 && VAR_P (id
->retvar
)
5252 && id
->retvar
!= return_slot
5253 && id
->retvar
!= modify_dest
5254 && !TREE_THIS_VOLATILE (id
->retvar
)
5255 && !is_gimple_reg (id
->retvar
))
5257 tree clobber
= build_clobber (TREE_TYPE (id
->retvar
));
5258 gimple
*clobber_stmt
;
5259 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
5260 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
5261 gsi_replace (&stmt_gsi
, clobber_stmt
, false);
5262 maybe_clean_or_replace_eh_stmt (stmt
, clobber_stmt
);
5265 gsi_remove (&stmt_gsi
, true);
5268 if (purge_dead_abnormal_edges
)
5269 bitmap_set_bit (to_purge
, return_block
->index
);
5271 /* If the value of the new expression is ignored, that's OK. We
5272 don't warn about this for CALL_EXPRs, so we shouldn't warn about
5273 the equivalent inlined version either. */
5274 if (is_gimple_assign (stmt
))
5276 gcc_assert (gimple_assign_single_p (stmt
)
5277 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
5278 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
5281 id
->add_clobbers_to_eh_landing_pads
= 0;
5283 /* Output the inlining info for this abstract function, since it has been
5284 inlined. If we don't do this now, we can lose the information about the
5285 variables in the function when the blocks get blown away as soon as we
5286 remove the cgraph node. */
5287 if (gimple_block (stmt
))
5288 (*debug_hooks
->outlining_inline_function
) (fn
);
5290 /* Update callgraph if needed. */
5291 cg_edge
->callee
->remove ();
5293 id
->block
= NULL_TREE
;
5294 id
->retvar
= NULL_TREE
;
5295 successfully_inlined
= true;
5298 input_location
= saved_location
;
5299 return successfully_inlined
;
5302 /* Expand call statements reachable from STMT_P.
5303 We can only have CALL_EXPRs as the "toplevel" tree code or nested
5304 in a MODIFY_EXPR. */
5307 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
,
5310 gimple_stmt_iterator gsi
;
5311 bool inlined
= false;
5313 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
5315 gimple
*stmt
= gsi_stmt (gsi
);
5318 if (is_gimple_call (stmt
)
5319 && !gimple_call_internal_p (stmt
))
5320 inlined
|= expand_call_inline (bb
, stmt
, id
, to_purge
);
5327 /* Walk all basic blocks created after FIRST and try to fold every statement
5328 in the STATEMENTS pointer set. */
5331 fold_marked_statements (int first
, hash_set
<gimple
*> *statements
)
5333 auto_bitmap to_purge
;
5335 auto_vec
<edge
, 20> stack (n_basic_blocks_for_fn (cfun
) + 2);
5336 auto_sbitmap
visited (last_basic_block_for_fn (cfun
));
5337 bitmap_clear (visited
);
5339 stack
.quick_push (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5340 while (!stack
.is_empty ())
5342 /* Look at the edge on the top of the stack. */
5343 edge e
= stack
.pop ();
5344 basic_block dest
= e
->dest
;
5346 if (dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
)
5347 || bitmap_bit_p (visited
, dest
->index
))
5350 bitmap_set_bit (visited
, dest
->index
);
5352 if (dest
->index
>= first
)
5353 for (gimple_stmt_iterator gsi
= gsi_start_bb (dest
);
5354 !gsi_end_p (gsi
); gsi_next (&gsi
))
5356 if (!statements
->contains (gsi_stmt (gsi
)))
5359 gimple
*old_stmt
= gsi_stmt (gsi
);
5360 tree old_decl
= (is_gimple_call (old_stmt
)
5361 ? gimple_call_fndecl (old_stmt
) : 0);
5362 if (old_decl
&& fndecl_built_in_p (old_decl
))
5364 /* Folding builtins can create multiple instructions,
5365 we need to look at all of them. */
5366 gimple_stmt_iterator i2
= gsi
;
5368 if (fold_stmt (&gsi
))
5371 /* If a builtin at the end of a bb folded into nothing,
5372 the following loop won't work. */
5373 if (gsi_end_p (gsi
))
5375 cgraph_update_edges_for_call_stmt (old_stmt
,
5380 i2
= gsi_start_bb (dest
);
5385 new_stmt
= gsi_stmt (i2
);
5386 update_stmt (new_stmt
);
5387 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5390 if (new_stmt
== gsi_stmt (gsi
))
5392 /* It is okay to check only for the very last
5393 of these statements. If it is a throwing
5394 statement nothing will change. If it isn't
5395 this can remove EH edges. If that weren't
5396 correct then because some intermediate stmts
5397 throw, but not the last one. That would mean
5398 we'd have to split the block, which we can't
5399 here and we'd loose anyway. And as builtins
5400 probably never throw, this all
5402 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
5404 bitmap_set_bit (to_purge
, dest
->index
);
5411 else if (fold_stmt (&gsi
))
5413 /* Re-read the statement from GSI as fold_stmt() may
5415 gimple
*new_stmt
= gsi_stmt (gsi
);
5416 update_stmt (new_stmt
);
5418 if (is_gimple_call (old_stmt
)
5419 || is_gimple_call (new_stmt
))
5420 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5423 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
5424 bitmap_set_bit (to_purge
, dest
->index
);
5428 if (EDGE_COUNT (dest
->succs
) > 0)
5430 /* Avoid warnings emitted from folding statements that
5431 became unreachable because of inlined function parameter
5433 e
= find_taken_edge (dest
, NULL_TREE
);
5435 stack
.quick_push (e
);
5439 FOR_EACH_EDGE (e
, ei
, dest
->succs
)
5440 stack
.safe_push (e
);
5445 gimple_purge_all_dead_eh_edges (to_purge
);
5448 /* Expand calls to inline functions in the body of FN. */
5451 optimize_inline_calls (tree fn
)
5455 int last
= n_basic_blocks_for_fn (cfun
);
5456 bool inlined_p
= false;
5459 memset (&id
, 0, sizeof (id
));
5461 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
5462 gcc_assert (id
.dst_node
->definition
);
5464 /* Or any functions that aren't finished yet. */
5465 if (current_function_decl
)
5466 id
.dst_fn
= current_function_decl
;
5468 id
.copy_decl
= copy_decl_maybe_to_var
;
5469 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5470 id
.transform_new_cfg
= false;
5471 id
.transform_return_to_modify
= true;
5472 id
.transform_parameter
= true;
5473 id
.statements_to_fold
= new hash_set
<gimple
*>;
5475 push_gimplify_context ();
5477 /* We make no attempts to keep dominance info up-to-date. */
5478 free_dominance_info (CDI_DOMINATORS
);
5479 free_dominance_info (CDI_POST_DOMINATORS
);
5481 /* Register specific gimple functions. */
5482 gimple_register_cfg_hooks ();
5484 /* Reach the trees by walking over the CFG, and note the
5485 enclosing basic-blocks in the call edges. */
5486 /* We walk the blocks going forward, because inlined function bodies
5487 will split id->current_basic_block, and the new blocks will
5488 follow it; we'll trudge through them, processing their CALL_EXPRs
5490 auto_bitmap to_purge
;
5491 FOR_EACH_BB_FN (bb
, cfun
)
5492 inlined_p
|= gimple_expand_calls_inline (bb
, &id
, to_purge
);
5494 pop_gimplify_context (NULL
);
5498 struct cgraph_edge
*e
;
5500 id
.dst_node
->verify ();
5502 /* Double check that we inlined everything we are supposed to inline. */
5503 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
5504 gcc_assert (e
->inline_failed
);
5507 /* If we didn't inline into the function there is nothing to do. */
5510 delete id
.statements_to_fold
;
5514 /* Fold queued statements. */
5515 update_max_bb_count ();
5516 fold_marked_statements (last
, id
.statements_to_fold
);
5517 delete id
.statements_to_fold
;
5519 /* Finally purge EH and abnormal edges from the call stmts we inlined.
5520 We need to do this after fold_marked_statements since that may walk
5521 the SSA use-def chain. */
5524 EXECUTE_IF_SET_IN_BITMAP (to_purge
, 0, i
, bi
)
5526 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
5529 gimple_purge_dead_eh_edges (bb
);
5530 gimple_purge_dead_abnormal_call_edges (bb
);
5534 gcc_assert (!id
.debug_stmts
.exists ());
5536 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5539 delete_unreachable_blocks_update_callgraph (id
.dst_node
, false);
5540 id
.dst_node
->calls_comdat_local
= id
.dst_node
->check_calls_comdat_local_p ();
5543 id
.dst_node
->verify ();
5545 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5546 not possible yet - the IPA passes might make various functions to not
5547 throw and they don't care to proactively update local EH info. This is
5548 done later in fixup_cfg pass that also execute the verification. */
5549 return (TODO_update_ssa
5551 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5552 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
5553 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
5554 ? TODO_rebuild_frequencies
: 0));
5557 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5560 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5562 enum tree_code code
= TREE_CODE (*tp
);
5563 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5565 /* We make copies of most nodes. */
5566 if (IS_EXPR_CODE_CLASS (cl
)
5567 || code
== TREE_LIST
5569 || code
== TYPE_DECL
5570 || code
== OMP_CLAUSE
)
5572 /* Because the chain gets clobbered when we make a copy, we save it
5574 tree chain
= NULL_TREE
, new_tree
;
5576 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5577 chain
= TREE_CHAIN (*tp
);
5579 /* Copy the node. */
5580 new_tree
= copy_node (*tp
);
5584 /* Now, restore the chain, if appropriate. That will cause
5585 walk_tree to walk into the chain as well. */
5586 if (code
== PARM_DECL
5587 || code
== TREE_LIST
5588 || code
== OMP_CLAUSE
)
5589 TREE_CHAIN (*tp
) = chain
;
5591 /* For now, we don't update BLOCKs when we make copies. So, we
5592 have to nullify all BIND_EXPRs. */
5593 if (TREE_CODE (*tp
) == BIND_EXPR
)
5594 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5596 else if (code
== CONSTRUCTOR
)
5598 /* CONSTRUCTOR nodes need special handling because
5599 we need to duplicate the vector of elements. */
5602 new_tree
= copy_node (*tp
);
5603 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5606 else if (code
== STATEMENT_LIST
)
5607 /* We used to just abort on STATEMENT_LIST, but we can run into them
5608 with statement-expressions (c++/40975). */
5609 copy_statement_list (tp
);
5610 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5612 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5614 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5619 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5620 information indicating to what new SAVE_EXPR this one should be mapped,
5621 use that one. Otherwise, create a new node and enter it in ST. FN is
5622 the function into which the copy will be placed. */
5625 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5630 /* See if we already encountered this SAVE_EXPR. */
5633 /* If we didn't already remap this SAVE_EXPR, do so now. */
5636 t
= copy_node (*tp
);
5638 /* Remember this SAVE_EXPR. */
5640 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5645 /* We've already walked into this SAVE_EXPR; don't do it again. */
5650 /* Replace this SAVE_EXPR with the copy. */
5654 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5655 label, copies the declaration and enters it in the splay_tree in DATA (which
5656 is really a 'copy_body_data *'. */
5659 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5660 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5661 struct walk_stmt_info
*wi
)
5663 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5664 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5668 tree decl
= gimple_label_label (stmt
);
5670 /* Copy the decl and remember the copy. */
5671 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5677 static gimple_seq
duplicate_remap_omp_clause_seq (gimple_seq seq
,
5678 struct walk_stmt_info
*wi
);
5680 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5681 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5682 remaps all local declarations to appropriate replacements in gimple
5686 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5688 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5689 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5690 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5694 /* For recursive invocations this is no longer the LHS itself. */
5695 bool is_lhs
= wi
->is_lhs
;
5698 if (TREE_CODE (expr
) == SSA_NAME
)
5700 *tp
= remap_ssa_name (*tp
, id
);
5703 SSA_NAME_DEF_STMT (*tp
) = gsi_stmt (wi
->gsi
);
5705 /* Only a local declaration (variable or label). */
5706 else if ((VAR_P (expr
) && !TREE_STATIC (expr
))
5707 || TREE_CODE (expr
) == LABEL_DECL
)
5709 /* Lookup the declaration. */
5712 /* If it's there, remap it. */
5717 else if (TREE_CODE (expr
) == STATEMENT_LIST
5718 || TREE_CODE (expr
) == BIND_EXPR
5719 || TREE_CODE (expr
) == SAVE_EXPR
)
5721 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5723 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5724 It's OK for this to happen if it was part of a subtree that
5725 isn't immediately expanded, such as operand 2 of another
5727 if (!TREE_OPERAND (expr
, 1))
5729 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5730 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5733 else if (TREE_CODE (expr
) == OMP_CLAUSE
)
5735 /* Before the omplower pass completes, some OMP clauses can contain
5736 sequences that are neither copied by gimple_seq_copy nor walked by
5737 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5738 in those situations, we have to copy and process them explicitely. */
5740 if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LASTPRIVATE
)
5742 gimple_seq seq
= OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
);
5743 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5744 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
) = seq
;
5746 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LINEAR
)
5748 gimple_seq seq
= OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
);
5749 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5750 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
) = seq
;
5752 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_REDUCTION
)
5754 gimple_seq seq
= OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
);
5755 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5756 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
) = seq
;
5757 seq
= OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
);
5758 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5759 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
) = seq
;
5763 /* Keep iterating. */
5768 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5769 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5770 remaps all local declarations to appropriate replacements in gimple
5774 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5775 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5776 struct walk_stmt_info
*wi
)
5778 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5779 gimple
*gs
= gsi_stmt (*gsip
);
5781 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5783 tree block
= gimple_bind_block (stmt
);
5787 remap_block (&block
, id
);
5788 gimple_bind_set_block (stmt
, block
);
5791 /* This will remap a lot of the same decls again, but this should be
5793 if (gimple_bind_vars (stmt
))
5795 tree old_var
, decls
= gimple_bind_vars (stmt
);
5797 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
5798 if (!can_be_nonlocal (old_var
, id
)
5799 && ! variably_modified_type_p (TREE_TYPE (old_var
), id
->src_fn
))
5800 remap_decl (old_var
, id
);
5802 gcc_checking_assert (!id
->prevent_decl_creation_for_types
);
5803 id
->prevent_decl_creation_for_types
= true;
5804 gimple_bind_set_vars (stmt
, remap_decls (decls
, NULL
, id
));
5805 id
->prevent_decl_creation_for_types
= false;
5809 /* Keep iterating. */
5813 /* Create a copy of SEQ and remap all decls in it. */
5816 duplicate_remap_omp_clause_seq (gimple_seq seq
, struct walk_stmt_info
*wi
)
5821 /* If there are any labels in OMP sequences, they can be only referred to in
5822 the sequence itself and therefore we can do both here. */
5823 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, wi
);
5824 gimple_seq copy
= gimple_seq_copy (seq
);
5825 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, wi
);
5829 /* Copies everything in SEQ and replaces variables and labels local to
5830 current_function_decl. */
5833 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5836 struct walk_stmt_info wi
;
5839 /* There's nothing to do for NULL_TREE. */
5844 memset (&id
, 0, sizeof (id
));
5845 id
.src_fn
= current_function_decl
;
5846 id
.dst_fn
= current_function_decl
;
5848 id
.decl_map
= new hash_map
<tree
, tree
>;
5849 id
.debug_map
= NULL
;
5851 id
.copy_decl
= copy_decl_no_change
;
5852 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5853 id
.transform_new_cfg
= false;
5854 id
.transform_return_to_modify
= false;
5855 id
.transform_parameter
= false;
5857 /* Walk the tree once to find local labels. */
5858 memset (&wi
, 0, sizeof (wi
));
5859 hash_set
<tree
> visited
;
5862 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5864 copy
= gimple_seq_copy (seq
);
5866 /* Walk the copy, remapping decls. */
5867 memset (&wi
, 0, sizeof (wi
));
5869 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5874 delete id
.debug_map
;
5875 if (id
.dependence_map
)
5877 delete id
.dependence_map
;
5878 id
.dependence_map
= NULL
;
5885 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5888 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5897 debug_find_tree (tree top
, tree search
)
5899 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5903 /* Declare the variables created by the inliner. Add all the variables in
5904 VARS to BIND_EXPR. */
5907 declare_inline_vars (tree block
, tree vars
)
5910 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5912 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5913 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5914 add_local_decl (cfun
, t
);
5918 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5921 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5922 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5923 VAR_DECL translation. */
5926 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5928 /* Don't generate debug information for the copy if we wouldn't have
5929 generated it for the copy either. */
5930 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5931 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5933 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5934 declaration inspired this copy. */
5935 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5937 /* The new variable/label has no RTL, yet. */
5938 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5939 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5940 SET_DECL_RTL (copy
, 0);
5941 /* For vector typed decls make sure to update DECL_MODE according
5942 to the new function context. */
5943 if (VECTOR_TYPE_P (TREE_TYPE (copy
)))
5944 SET_DECL_MODE (copy
, TYPE_MODE (TREE_TYPE (copy
)));
5946 /* These args would always appear unused, if not for this. */
5947 TREE_USED (copy
) = 1;
5949 /* Set the context for the new declaration. */
5950 if (!DECL_CONTEXT (decl
))
5951 /* Globals stay global. */
5953 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5954 /* Things that weren't in the scope of the function we're inlining
5955 from aren't in the scope we're inlining to, either. */
5957 else if (TREE_STATIC (decl
))
5958 /* Function-scoped static variables should stay in the original
5963 /* Ordinary automatic local variables are now in the scope of the
5965 DECL_CONTEXT (copy
) = id
->dst_fn
;
5966 if (VAR_P (copy
) && id
->dst_simt_vars
&& !is_gimple_reg (copy
))
5968 if (!lookup_attribute ("omp simt private", DECL_ATTRIBUTES (copy
)))
5969 DECL_ATTRIBUTES (copy
)
5970 = tree_cons (get_identifier ("omp simt private"), NULL
,
5971 DECL_ATTRIBUTES (copy
));
5972 id
->dst_simt_vars
->safe_push (copy
);
5979 /* Create a new VAR_DECL that is indentical in all respect to DECL except that
5980 DECL can be either a VAR_DECL, a PARM_DECL or RESULT_DECL. The original
5981 DECL must come from ID->src_fn and the copy will be part of ID->dst_fn. */
5984 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5988 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5989 || TREE_CODE (decl
) == RESULT_DECL
);
5991 type
= TREE_TYPE (decl
);
5993 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5994 VAR_DECL
, DECL_NAME (decl
), type
);
5995 if (DECL_PT_UID_SET_P (decl
))
5996 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5997 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5998 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5999 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
6000 DECL_NOT_GIMPLE_REG_P (copy
) = DECL_NOT_GIMPLE_REG_P (decl
);
6001 DECL_BY_REFERENCE (copy
) = DECL_BY_REFERENCE (decl
);
6003 return copy_decl_for_dup_finish (id
, decl
, copy
);
6006 /* Like copy_decl_to_var, but create a return slot object instead of a
6007 pointer variable for return by invisible reference. */
6010 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
6014 gcc_assert (TREE_CODE (decl
) == PARM_DECL
6015 || TREE_CODE (decl
) == RESULT_DECL
);
6017 type
= TREE_TYPE (decl
);
6018 if (DECL_BY_REFERENCE (decl
))
6019 type
= TREE_TYPE (type
);
6021 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
6022 VAR_DECL
, DECL_NAME (decl
), type
);
6023 if (DECL_PT_UID_SET_P (decl
))
6024 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
6025 TREE_READONLY (copy
) = TREE_READONLY (decl
);
6026 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
6027 if (!DECL_BY_REFERENCE (decl
))
6029 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
6030 DECL_NOT_GIMPLE_REG_P (copy
)
6031 = (DECL_NOT_GIMPLE_REG_P (decl
)
6032 /* RESULT_DECLs are treated special by needs_to_live_in_memory,
6033 mirror that to the created VAR_DECL. */
6034 || (TREE_CODE (decl
) == RESULT_DECL
6035 && aggregate_value_p (decl
, id
->src_fn
)));
6038 return copy_decl_for_dup_finish (id
, decl
, copy
);
6042 copy_decl_no_change (tree decl
, copy_body_data
*id
)
6046 copy
= copy_node (decl
);
6048 /* The COPY is not abstract; it will be generated in DST_FN. */
6049 DECL_ABSTRACT_P (copy
) = false;
6050 lang_hooks
.dup_lang_specific_decl (copy
);
6052 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
6053 been taken; it's for internal bookkeeping in expand_goto_internal. */
6054 if (TREE_CODE (copy
) == LABEL_DECL
)
6056 TREE_ADDRESSABLE (copy
) = 0;
6057 LABEL_DECL_UID (copy
) = -1;
6060 return copy_decl_for_dup_finish (id
, decl
, copy
);
6064 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
6066 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
6067 return copy_decl_to_var (decl
, id
);
6069 return copy_decl_no_change (decl
, id
);
6072 /* Return a copy of the function's argument tree without any modifications. */
6075 copy_arguments_nochange (tree orig_parm
, copy_body_data
* id
)
6078 tree new_parm
= NULL
;
6081 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
))
6083 tree new_tree
= remap_decl (arg
, id
);
6084 if (TREE_CODE (new_tree
) != PARM_DECL
)
6085 new_tree
= id
->copy_decl (arg
, id
);
6086 lang_hooks
.dup_lang_specific_decl (new_tree
);
6088 parg
= &DECL_CHAIN (new_tree
);
6093 /* Return a copy of the function's static chain. */
6095 copy_static_chain (tree static_chain
, copy_body_data
* id
)
6097 tree
*chain_copy
, *pvar
;
6099 chain_copy
= &static_chain
;
6100 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
6102 tree new_tree
= remap_decl (*pvar
, id
);
6103 lang_hooks
.dup_lang_specific_decl (new_tree
);
6104 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
6107 return static_chain
;
6110 /* Return true if the function is allowed to be versioned.
6111 This is a guard for the versioning functionality. */
6114 tree_versionable_function_p (tree fndecl
)
6116 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
6117 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
)) == NULL
);
6120 /* Update clone info after duplication. */
6123 update_clone_info (copy_body_data
* id
)
6125 struct cgraph_node
*this_node
= id
->dst_node
;
6126 if (!this_node
->clones
)
6128 for (cgraph_node
*node
= this_node
->clones
; node
!= this_node
;)
6130 /* First update replace maps to match the new body. */
6131 clone_info
*info
= clone_info::get (node
);
6132 if (info
&& info
->tree_map
)
6135 for (i
= 0; i
< vec_safe_length (info
->tree_map
); i
++)
6137 struct ipa_replace_map
*replace_info
;
6138 replace_info
= (*info
->tree_map
)[i
];
6139 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
6144 node
= node
->clones
;
6145 else if (node
->next_sibling_clone
)
6146 node
= node
->next_sibling_clone
;
6149 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
6150 node
= node
->clone_of
;
6151 if (node
!= id
->dst_node
)
6152 node
= node
->next_sibling_clone
;
6157 /* Create a copy of a function's tree.
6158 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
6159 of the original function and the new copied function
6160 respectively. In case we want to replace a DECL
6161 tree with another tree while duplicating the function's
6162 body, TREE_MAP represents the mapping between these
6163 trees. If UPDATE_CLONES is set, the call_stmt fields
6164 of edges of clones of the function will be updated.
6166 If non-NULL PARAM_ADJUSTMENTS determines how function prototype (i.e. the
6167 function parameters and return value) should be modified).
6168 If non-NULL BLOCKS_TO_COPY determine what basic blocks to copy.
6169 If non_NULL NEW_ENTRY determine new entry BB of the clone.
6172 tree_function_versioning (tree old_decl
, tree new_decl
,
6173 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
6174 ipa_param_adjustments
*param_adjustments
,
6175 bool update_clones
, bitmap blocks_to_copy
,
6176 basic_block new_entry
)
6178 struct cgraph_node
*old_version_node
;
6179 struct cgraph_node
*new_version_node
;
6183 struct ipa_replace_map
*replace_info
;
6184 basic_block old_entry_block
, bb
;
6185 auto_vec
<gimple
*, 10> init_stmts
;
6186 tree vars
= NULL_TREE
;
6188 /* We can get called recursively from expand_call_inline via clone
6189 materialization. While expand_call_inline maintains input_location
6190 we cannot tolerate it to leak into the materialized clone. */
6191 location_t saved_location
= input_location
;
6192 input_location
= UNKNOWN_LOCATION
;
6194 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
6195 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
6196 DECL_POSSIBLY_INLINED (old_decl
) = 1;
6198 old_version_node
= cgraph_node::get (old_decl
);
6199 gcc_checking_assert (old_version_node
);
6200 new_version_node
= cgraph_node::get (new_decl
);
6201 gcc_checking_assert (new_version_node
);
6203 /* Copy over debug args. */
6204 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
6206 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
6207 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
6208 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
6209 old_debug_args
= decl_debug_args_lookup (old_decl
);
6212 new_debug_args
= decl_debug_args_insert (new_decl
);
6213 *new_debug_args
= vec_safe_copy (*old_debug_args
);
6217 /* Output the inlining info for this abstract function, since it has been
6218 inlined. If we don't do this now, we can lose the information about the
6219 variables in the function when the blocks get blown away as soon as we
6220 remove the cgraph node. */
6221 (*debug_hooks
->outlining_inline_function
) (old_decl
);
6223 DECL_ARTIFICIAL (new_decl
) = 1;
6224 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
6225 if (DECL_ORIGIN (old_decl
) == old_decl
)
6226 old_version_node
->used_as_abstract_origin
= true;
6227 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
6229 /* Prepare the data structures for the tree copy. */
6230 memset (&id
, 0, sizeof (id
));
6232 /* Generate a new name for the new version. */
6233 id
.statements_to_fold
= new hash_set
<gimple
*>;
6235 id
.decl_map
= new hash_map
<tree
, tree
>;
6236 id
.debug_map
= NULL
;
6237 id
.src_fn
= old_decl
;
6238 id
.dst_fn
= new_decl
;
6239 id
.src_node
= old_version_node
;
6240 id
.dst_node
= new_version_node
;
6241 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
6242 id
.blocks_to_copy
= blocks_to_copy
;
6244 id
.copy_decl
= copy_decl_no_change
;
6245 id
.transform_call_graph_edges
6246 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
6247 id
.transform_new_cfg
= true;
6248 id
.transform_return_to_modify
= false;
6249 id
.transform_parameter
= false;
6251 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
6252 (DECL_STRUCT_FUNCTION (old_decl
));
6253 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
6254 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
6255 initialize_cfun (new_decl
, old_decl
,
6256 new_entry
? new_entry
->count
: old_entry_block
->count
);
6257 new_version_node
->calls_declare_variant_alt
6258 = old_version_node
->calls_declare_variant_alt
;
6259 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
6260 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
6261 = id
.src_cfun
->gimple_df
->ipa_pta
;
6263 /* Copy the function's static chain. */
6264 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
6266 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
6267 = copy_static_chain (p
, &id
);
6269 auto_vec
<int, 16> new_param_indices
;
6270 clone_info
*info
= clone_info::get (old_version_node
);
6271 ipa_param_adjustments
*old_param_adjustments
6272 = info
? info
->param_adjustments
: NULL
;
6273 if (old_param_adjustments
)
6274 old_param_adjustments
->get_updated_indices (&new_param_indices
);
6276 /* If there's a tree_map, prepare for substitution. */
6278 for (i
= 0; i
< tree_map
->length (); i
++)
6281 replace_info
= (*tree_map
)[i
];
6283 int p
= replace_info
->parm_num
;
6284 if (old_param_adjustments
)
6285 p
= new_param_indices
[p
];
6288 for (parm
= DECL_ARGUMENTS (old_decl
); p
;
6289 parm
= DECL_CHAIN (parm
))
6292 init
= setup_one_parameter (&id
, parm
, replace_info
->new_tree
,
6293 id
.src_fn
, NULL
, &vars
);
6295 init_stmts
.safe_push (init
);
6298 ipa_param_body_adjustments
*param_body_adjs
= NULL
;
6299 if (param_adjustments
)
6301 param_body_adjs
= new ipa_param_body_adjustments (param_adjustments
,
6303 &id
, &vars
, tree_map
);
6304 id
.param_body_adjs
= param_body_adjs
;
6305 DECL_ARGUMENTS (new_decl
) = param_body_adjs
->get_new_param_chain ();
6307 else if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
6308 DECL_ARGUMENTS (new_decl
)
6309 = copy_arguments_nochange (DECL_ARGUMENTS (old_decl
), &id
);
6311 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
6312 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
6314 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
6316 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
6317 /* Add local vars. */
6318 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
6320 if (DECL_RESULT (old_decl
) == NULL_TREE
)
6322 else if (param_adjustments
&& param_adjustments
->m_skip_return
6323 && !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
6325 tree resdecl_repl
= copy_result_decl_to_var (DECL_RESULT (old_decl
),
6327 declare_inline_vars (NULL
, resdecl_repl
);
6328 if (DECL_BY_REFERENCE (DECL_RESULT (old_decl
)))
6329 resdecl_repl
= build_fold_addr_expr (resdecl_repl
);
6330 insert_decl_map (&id
, DECL_RESULT (old_decl
), resdecl_repl
);
6332 DECL_RESULT (new_decl
)
6333 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
6334 RESULT_DECL
, NULL_TREE
, void_type_node
);
6335 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
6336 DECL_IS_MALLOC (new_decl
) = false;
6337 cfun
->returns_struct
= 0;
6338 cfun
->returns_pcc_struct
= 0;
6343 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
6344 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
6345 if (gimple_in_ssa_p (id
.src_cfun
)
6346 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
6347 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
6349 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
6350 insert_decl_map (&id
, old_name
, new_name
);
6351 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
6352 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
6356 /* Set up the destination functions loop tree. */
6357 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
6359 cfun
->curr_properties
&= ~PROP_loops
;
6360 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
6361 cfun
->curr_properties
|= PROP_loops
;
6364 /* Copy the Function's body. */
6365 copy_body (&id
, ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
6368 /* Renumber the lexical scoping (non-code) blocks consecutively. */
6369 number_blocks (new_decl
);
6371 /* We want to create the BB unconditionally, so that the addition of
6372 debug stmts doesn't affect BB count, which may in the end cause
6373 codegen differences. */
6374 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6375 while (init_stmts
.length ())
6376 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
6377 update_clone_info (&id
);
6379 /* Remap the nonlocal_goto_save_area, if any. */
6380 if (cfun
->nonlocal_goto_save_area
)
6382 struct walk_stmt_info wi
;
6384 memset (&wi
, 0, sizeof (wi
));
6386 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
6392 delete id
.debug_map
;
6393 free_dominance_info (CDI_DOMINATORS
);
6394 free_dominance_info (CDI_POST_DOMINATORS
);
6396 update_max_bb_count ();
6397 fold_marked_statements (0, id
.statements_to_fold
);
6398 delete id
.statements_to_fold
;
6399 delete_unreachable_blocks_update_callgraph (id
.dst_node
, update_clones
);
6400 if (id
.dst_node
->definition
)
6401 cgraph_edge::rebuild_references ();
6402 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
6404 calculate_dominance_info (CDI_DOMINATORS
);
6405 fix_loop_structure (NULL
);
6407 update_ssa (TODO_update_ssa
);
6409 /* After partial cloning we need to rescale frequencies, so they are
6410 within proper range in the cloned function. */
6413 struct cgraph_edge
*e
;
6414 rebuild_frequencies ();
6416 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
6417 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
6419 basic_block bb
= gimple_bb (e
->call_stmt
);
6420 e
->count
= bb
->count
;
6422 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
6424 basic_block bb
= gimple_bb (e
->call_stmt
);
6425 e
->count
= bb
->count
;
6429 if (param_body_adjs
&& MAY_HAVE_DEBUG_BIND_STMTS
)
6431 vec
<tree
, va_gc
> **debug_args
= NULL
;
6432 unsigned int len
= 0;
6433 unsigned reset_len
= param_body_adjs
->m_reset_debug_decls
.length ();
6435 for (i
= 0; i
< reset_len
; i
++)
6437 tree parm
= param_body_adjs
->m_reset_debug_decls
[i
];
6438 gcc_assert (is_gimple_reg (parm
));
6441 if (debug_args
== NULL
)
6443 debug_args
= decl_debug_args_insert (new_decl
);
6444 len
= vec_safe_length (*debug_args
);
6446 ddecl
= build_debug_expr_decl (TREE_TYPE (parm
));
6447 /* FIXME: Is setting the mode really necessary? */
6448 SET_DECL_MODE (ddecl
, DECL_MODE (parm
));
6449 vec_safe_push (*debug_args
, DECL_ORIGIN (parm
));
6450 vec_safe_push (*debug_args
, ddecl
);
6452 if (debug_args
!= NULL
)
6454 /* On the callee side, add
6457 stmts to the first bb where var is a VAR_DECL created for the
6458 optimized away parameter in DECL_INITIAL block. This hints
6459 in the debug info that var (whole DECL_ORIGIN is the parm
6460 PARM_DECL) is optimized away, but could be looked up at the
6461 call site as value of D#X there. */
6462 gimple_stmt_iterator cgsi
6463 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6466 i
= vec_safe_length (*debug_args
);
6469 tree vexpr
= NULL_TREE
;
6471 while (var
!= NULL_TREE
6472 && DECL_ABSTRACT_ORIGIN (var
) != (**debug_args
)[i
])
6473 var
= TREE_CHAIN (var
);
6474 if (var
== NULL_TREE
)
6476 tree parm
= (**debug_args
)[i
];
6477 if (tree parm_ddef
= ssa_default_def (id
.src_cfun
, parm
))
6479 = param_body_adjs
->m_dead_ssa_debug_equiv
.get (parm_ddef
))
6483 vexpr
= build_debug_expr_decl (TREE_TYPE (parm
));
6484 /* FIXME: Is setting the mode really necessary? */
6485 SET_DECL_MODE (vexpr
, DECL_MODE (parm
));
6487 def_temp
= gimple_build_debug_bind (var
, vexpr
, NULL
);
6488 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6489 def_temp
= gimple_build_debug_source_bind (vexpr
, parm
, NULL
);
6490 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6495 delete param_body_adjs
;
6496 free_dominance_info (CDI_DOMINATORS
);
6497 free_dominance_info (CDI_POST_DOMINATORS
);
6499 gcc_assert (!id
.debug_stmts
.exists ());
6501 input_location
= saved_location
;
6505 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6506 the callee and return the inlined body on success. */
6509 maybe_inline_call_in_expr (tree exp
)
6511 tree fn
= get_callee_fndecl (exp
);
6513 /* We can only try to inline "const" functions. */
6514 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
6516 call_expr_arg_iterator iter
;
6519 hash_map
<tree
, tree
> decl_map
;
6521 /* Remap the parameters. */
6522 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
6524 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
6525 decl_map
.put (param
, arg
);
6527 memset (&id
, 0, sizeof (id
));
6529 id
.dst_fn
= current_function_decl
;
6530 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6531 id
.decl_map
= &decl_map
;
6533 id
.copy_decl
= copy_decl_no_change
;
6534 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6535 id
.transform_new_cfg
= false;
6536 id
.transform_return_to_modify
= true;
6537 id
.transform_parameter
= true;
6539 /* Make sure not to unshare trees behind the front-end's back
6540 since front-end specific mechanisms may rely on sharing. */
6541 id
.regimplify
= false;
6542 id
.do_not_unshare
= true;
6544 /* We're not inside any EH region. */
6547 t
= copy_tree_body (&id
);
6549 /* We can only return something suitable for use in a GENERIC
6551 if (TREE_CODE (t
) == MODIFY_EXPR
)
6552 return TREE_OPERAND (t
, 1);
6558 /* Duplicate a type, fields and all. */
6561 build_duplicate_type (tree type
)
6563 struct copy_body_data id
;
6565 memset (&id
, 0, sizeof (id
));
6566 id
.src_fn
= current_function_decl
;
6567 id
.dst_fn
= current_function_decl
;
6569 id
.decl_map
= new hash_map
<tree
, tree
>;
6570 id
.debug_map
= NULL
;
6571 id
.copy_decl
= copy_decl_no_change
;
6573 type
= remap_type_1 (type
, &id
);
6577 delete id
.debug_map
;
6579 TYPE_CANONICAL (type
) = type
;
6584 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6585 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6589 copy_fn (tree fn
, tree
& parms
, tree
& result
)
6593 hash_map
<tree
, tree
> decl_map
;
6598 memset (&id
, 0, sizeof (id
));
6600 id
.dst_fn
= current_function_decl
;
6601 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6602 id
.decl_map
= &decl_map
;
6604 id
.copy_decl
= copy_decl_no_change
;
6605 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6606 id
.transform_new_cfg
= false;
6607 id
.transform_return_to_modify
= false;
6608 id
.transform_parameter
= true;
6610 /* Make sure not to unshare trees behind the front-end's back
6611 since front-end specific mechanisms may rely on sharing. */
6612 id
.regimplify
= false;
6613 id
.do_not_unshare
= true;
6614 id
.do_not_fold
= true;
6616 /* We're not inside any EH region. */
6619 /* Remap the parameters and result and return them to the caller. */
6620 for (param
= DECL_ARGUMENTS (fn
);
6622 param
= DECL_CHAIN (param
))
6624 *p
= remap_decl (param
, &id
);
6625 p
= &DECL_CHAIN (*p
);
6628 if (DECL_RESULT (fn
))
6629 result
= remap_decl (DECL_RESULT (fn
), &id
);
6633 return copy_tree_body (&id
);