2 Copyright (C) 2001-2023 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-iterator.h"
45 #include "gimple-fold.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. */
151 if (key
!= value
&& value
)
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
, name
);
260 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
262 new_tree
= remap_decl (var
, id
);
264 /* We might've substituted constant or another SSA_NAME for
267 Replace the SSA name representing RESULT_DECL by variable during
268 inlining: this saves us from need to introduce PHI node in a case
269 return value is just partly initialized. */
270 if ((VAR_P (new_tree
) || TREE_CODE (new_tree
) == PARM_DECL
)
271 && (!SSA_NAME_VAR (name
)
272 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
273 || !id
->transform_return_to_modify
))
275 struct ptr_info_def
*pi
;
276 new_tree
= make_ssa_name (new_tree
);
277 insert_decl_map (id
, name
, new_tree
);
278 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
279 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
280 /* At least IPA points-to info can be directly transferred. */
281 if (id
->src_cfun
->gimple_df
282 && id
->src_cfun
->gimple_df
->ipa_pta
283 && POINTER_TYPE_P (TREE_TYPE (name
))
284 && (pi
= SSA_NAME_PTR_INFO (name
))
287 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
290 /* So can range-info. */
291 if (!POINTER_TYPE_P (TREE_TYPE (name
))
292 && SSA_NAME_RANGE_INFO (name
))
293 duplicate_ssa_name_range_info (new_tree
, name
);
294 if (SSA_NAME_IS_DEFAULT_DEF (name
))
296 /* By inlining function having uninitialized variable, we might
297 extend the lifetime (variable might get reused). This cause
298 ICE in the case we end up extending lifetime of SSA name across
299 abnormal edge, but also increase register pressure.
301 We simply initialize all uninitialized vars by 0 except
302 for case we are inlining to very first BB. We can avoid
303 this for all BBs that are not inside strongly connected
304 regions of the CFG, but this is expensive to test. */
306 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
307 && (!SSA_NAME_VAR (name
)
308 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
309 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
311 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
313 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
315 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
317 init_stmt
= gimple_build_assign (new_tree
, zero
);
318 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
319 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
323 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
324 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
329 insert_decl_map (id
, name
, new_tree
);
333 /* Remap DECL during the copying of the BLOCK tree for the function. */
336 remap_decl (tree decl
, copy_body_data
*id
)
340 /* We only remap local variables in the current function. */
342 /* See if we have remapped this declaration. */
344 n
= id
->decl_map
->get (decl
);
346 if (!n
&& processing_debug_stmt
)
348 processing_debug_stmt
= -1;
352 /* When remapping a type within copy_gimple_seq_and_replace_locals, all
353 necessary DECLs have already been remapped and we do not want to duplicate
354 a decl coming from outside of the sequence we are copying. */
356 && id
->prevent_decl_creation_for_types
357 && id
->remapping_type_depth
> 0
358 && (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
))
361 /* If we didn't already have an equivalent for this declaration, create one
365 /* Make a copy of the variable or label. */
366 tree t
= id
->copy_decl (decl
, id
);
368 /* Remember it, so that if we encounter this local entity again
369 we can reuse this copy. Do this early because remap_type may
370 need this decl for TYPE_STUB_DECL. */
371 insert_decl_map (id
, decl
, t
);
376 /* Remap types, if necessary. */
377 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
378 if (TREE_CODE (t
) == TYPE_DECL
)
380 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
382 /* Preserve the invariant that DECL_ORIGINAL_TYPE != TREE_TYPE,
383 which is enforced in gen_typedef_die when DECL_ABSTRACT_ORIGIN
384 is not set on the TYPE_DECL, for example in LTO mode. */
385 if (DECL_ORIGINAL_TYPE (t
) == TREE_TYPE (t
))
387 tree x
= build_variant_type_copy (TREE_TYPE (t
));
388 TYPE_STUB_DECL (x
) = TYPE_STUB_DECL (TREE_TYPE (t
));
389 TYPE_NAME (x
) = TYPE_NAME (TREE_TYPE (t
));
390 DECL_ORIGINAL_TYPE (t
) = x
;
394 /* Remap sizes as necessary. */
395 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
396 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
398 /* If fields, do likewise for offset and qualifier. */
399 if (TREE_CODE (t
) == FIELD_DECL
)
401 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
402 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
403 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
409 if (id
->do_not_unshare
)
412 return unshare_expr (*n
);
416 remap_type_1 (tree type
, copy_body_data
*id
)
420 /* We do need a copy. build and register it now. If this is a pointer or
421 reference type, remap the designated type and make a new pointer or
423 if (TREE_CODE (type
) == POINTER_TYPE
)
425 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
427 TYPE_REF_CAN_ALIAS_ALL (type
));
428 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
429 new_tree
= build_type_attribute_qual_variant (new_tree
,
430 TYPE_ATTRIBUTES (type
),
432 insert_decl_map (id
, type
, new_tree
);
435 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
437 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
439 TYPE_REF_CAN_ALIAS_ALL (type
));
440 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
441 new_tree
= build_type_attribute_qual_variant (new_tree
,
442 TYPE_ATTRIBUTES (type
),
444 insert_decl_map (id
, type
, new_tree
);
448 new_tree
= copy_node (type
);
450 insert_decl_map (id
, type
, new_tree
);
452 /* This is a new type, not a copy of an old type. Need to reassociate
453 variants. We can handle everything except the main variant lazily. */
454 t
= TYPE_MAIN_VARIANT (type
);
457 t
= remap_type (t
, id
);
458 TYPE_MAIN_VARIANT (new_tree
) = t
;
459 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
460 TYPE_NEXT_VARIANT (t
) = new_tree
;
464 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
465 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
468 if (TYPE_STUB_DECL (type
))
469 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
471 /* Lazily create pointer and reference types. */
472 TYPE_POINTER_TO (new_tree
) = NULL
;
473 TYPE_REFERENCE_TO (new_tree
) = NULL
;
475 /* Copy all types that may contain references to local variables; be sure to
476 preserve sharing in between type and its main variant when possible. */
477 switch (TREE_CODE (new_tree
))
481 case FIXED_POINT_TYPE
:
484 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
486 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
487 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
489 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
490 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
494 t
= TYPE_MIN_VALUE (new_tree
);
495 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
496 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
498 t
= TYPE_MAX_VALUE (new_tree
);
499 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
500 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
505 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
506 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
507 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
509 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
510 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
511 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
512 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
514 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
518 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
519 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
520 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
522 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
524 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
526 gcc_checking_assert (TYPE_DOMAIN (type
)
527 == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
528 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
532 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
533 /* For array bounds where we have decided not to copy over the bounds
534 variable which isn't used in OpenMP/OpenACC region, change them to
535 an uninitialized VAR_DECL temporary. */
536 if (id
->adjust_array_error_bounds
537 && TYPE_DOMAIN (new_tree
)
538 && TYPE_MAX_VALUE (TYPE_DOMAIN (new_tree
)) == error_mark_node
539 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) != error_mark_node
)
541 tree v
= create_tmp_var (TREE_TYPE (TYPE_DOMAIN (new_tree
)));
543 = tree_cons (get_identifier ("omp dummy var"), NULL_TREE
,
544 DECL_ATTRIBUTES (v
));
545 TYPE_MAX_VALUE (TYPE_DOMAIN (new_tree
)) = v
;
552 case QUAL_UNION_TYPE
:
553 if (TYPE_MAIN_VARIANT (type
) != type
554 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
555 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
560 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
562 t
= remap_decl (f
, id
);
563 DECL_CONTEXT (t
) = new_tree
;
567 TYPE_FIELDS (new_tree
) = nreverse (nf
);
573 /* Shouldn't have been thought variable sized. */
577 /* All variants of type share the same size, so use the already remaped data. */
578 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
580 tree s
= TYPE_SIZE (type
);
581 tree mvs
= TYPE_SIZE (TYPE_MAIN_VARIANT (type
));
582 tree su
= TYPE_SIZE_UNIT (type
);
583 tree mvsu
= TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
));
584 gcc_checking_assert ((TREE_CODE (s
) == PLACEHOLDER_EXPR
585 && (TREE_CODE (mvs
) == PLACEHOLDER_EXPR
))
587 gcc_checking_assert ((TREE_CODE (su
) == PLACEHOLDER_EXPR
588 && (TREE_CODE (mvsu
) == PLACEHOLDER_EXPR
))
590 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
591 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
595 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
596 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
602 /* Helper function for remap_type_2, called through walk_tree. */
605 remap_type_3 (tree
*tp
, int *walk_subtrees
, void *data
)
607 copy_body_data
*id
= (copy_body_data
*) data
;
612 else if (DECL_P (*tp
) && remap_decl (*tp
, id
) != *tp
)
618 /* Return true if TYPE needs to be remapped because remap_decl on any
619 needed embedded decl returns something other than that decl. */
622 remap_type_2 (tree type
, copy_body_data
*id
)
626 #define RETURN_TRUE_IF_VAR(T) \
632 if (DECL_P (_t) && remap_decl (_t, id) != _t) \
634 if (!TYPE_SIZES_GIMPLIFIED (type) \
635 && walk_tree (&_t, remap_type_3, id, NULL)) \
641 switch (TREE_CODE (type
))
647 return remap_type_2 (TREE_TYPE (type
), id
);
651 case FIXED_POINT_TYPE
:
654 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
655 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
659 if (remap_type_2 (TREE_TYPE (type
), id
)
660 || (TYPE_DOMAIN (type
) && remap_type_2 (TYPE_DOMAIN (type
), id
)))
666 case QUAL_UNION_TYPE
:
667 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
668 if (TREE_CODE (t
) == FIELD_DECL
)
670 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
671 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
672 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
673 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
674 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
682 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
683 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
685 #undef RETURN_TRUE_IF_VAR
689 remap_type (tree type
, copy_body_data
*id
)
697 /* See if we have remapped this type. */
698 node
= id
->decl_map
->get (type
);
702 /* The type only needs remapping if it's variably modified. */
703 if (! variably_modified_type_p (type
, id
->src_fn
)
704 /* Don't remap if copy_decl method doesn't always return a new
705 decl and for all embedded decls returns the passed in decl. */
706 || (id
->dont_remap_vla_if_no_change
&& !remap_type_2 (type
, id
)))
708 insert_decl_map (id
, type
, type
);
712 id
->remapping_type_depth
++;
713 tmp
= remap_type_1 (type
, id
);
714 id
->remapping_type_depth
--;
719 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
722 can_be_nonlocal (tree decl
, copy_body_data
*id
)
724 /* We cannot duplicate function decls. */
725 if (TREE_CODE (decl
) == FUNCTION_DECL
)
728 /* Local static vars must be non-local or we get multiple declaration
730 if (VAR_P (decl
) && !auto_var_in_fn_p (decl
, id
->src_fn
))
737 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
741 tree new_decls
= NULL_TREE
;
743 /* Remap its variables. */
744 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
748 if (can_be_nonlocal (old_var
, id
))
750 /* We need to add this variable to the local decls as otherwise
751 nothing else will do so. */
752 if (VAR_P (old_var
) && ! DECL_EXTERNAL (old_var
) && cfun
)
753 add_local_decl (cfun
, old_var
);
754 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
755 && !DECL_IGNORED_P (old_var
)
756 && nonlocalized_list
)
757 vec_safe_push (*nonlocalized_list
, old_var
);
761 /* Remap the variable. */
762 new_var
= remap_decl (old_var
, id
);
764 /* If we didn't remap this variable, we can't mess with its
765 TREE_CHAIN. If we remapped this variable to the return slot, it's
766 already declared somewhere else, so don't declare it here. */
768 if (new_var
== id
->retvar
)
772 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
773 && !DECL_IGNORED_P (old_var
)
774 && nonlocalized_list
)
775 vec_safe_push (*nonlocalized_list
, old_var
);
779 gcc_assert (DECL_P (new_var
));
780 DECL_CHAIN (new_var
) = new_decls
;
783 /* Also copy value-expressions. */
784 if (VAR_P (new_var
) && DECL_HAS_VALUE_EXPR_P (new_var
))
786 tree tem
= DECL_VALUE_EXPR (new_var
);
787 bool old_regimplify
= id
->regimplify
;
788 id
->remapping_type_depth
++;
789 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
790 id
->remapping_type_depth
--;
791 id
->regimplify
= old_regimplify
;
792 SET_DECL_VALUE_EXPR (new_var
, tem
);
797 return nreverse (new_decls
);
800 /* Copy the BLOCK to contain remapped versions of the variables
801 therein. And hook the new block into the block-tree. */
804 remap_block (tree
*block
, copy_body_data
*id
)
809 /* Make the new block. */
811 new_block
= make_node (BLOCK
);
812 TREE_USED (new_block
) = TREE_USED (old_block
);
813 BLOCK_ABSTRACT_ORIGIN (new_block
) = BLOCK_ORIGIN (old_block
);
814 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
815 BLOCK_NONLOCALIZED_VARS (new_block
)
816 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
819 /* Remap its variables. */
820 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
821 &BLOCK_NONLOCALIZED_VARS (new_block
),
824 /* Remember the remapped block. */
825 insert_decl_map (id
, old_block
, new_block
);
828 /* Copy the whole block tree and root it in id->block. */
831 remap_blocks (tree block
, copy_body_data
*id
)
834 tree new_tree
= block
;
839 remap_block (&new_tree
, id
);
840 gcc_assert (new_tree
!= block
);
841 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
842 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
843 /* Blocks are in arbitrary order, but make things slightly prettier and do
844 not swap order when producing a copy. */
845 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
849 /* Remap the block tree rooted at BLOCK to nothing. */
852 remap_blocks_to_null (tree block
, copy_body_data
*id
)
855 insert_decl_map (id
, block
, NULL_TREE
);
856 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
857 remap_blocks_to_null (t
, id
);
860 /* Remap the location info pointed to by LOCUS. */
863 remap_location (location_t locus
, copy_body_data
*id
)
865 if (LOCATION_BLOCK (locus
))
867 tree
*n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
870 return set_block (locus
, *n
);
873 locus
= LOCATION_LOCUS (locus
);
875 if (locus
!= UNKNOWN_LOCATION
&& id
->block
)
876 return set_block (locus
, id
->block
);
882 copy_statement_list (tree
*tp
)
884 tree_stmt_iterator oi
, ni
;
887 new_tree
= alloc_stmt_list ();
888 ni
= tsi_start (new_tree
);
889 oi
= tsi_start (*tp
);
890 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
893 for (; !tsi_end_p (oi
); tsi_next (&oi
))
895 tree stmt
= tsi_stmt (oi
);
896 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
897 /* This copy is not redundant; tsi_link_after will smash this
898 STATEMENT_LIST into the end of the one we're building, and we
899 don't want to do that with the original. */
900 copy_statement_list (&stmt
);
901 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
906 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
908 tree block
= BIND_EXPR_BLOCK (*tp
);
909 /* Copy (and replace) the statement. */
910 copy_tree_r (tp
, walk_subtrees
, NULL
);
913 remap_block (&block
, id
);
914 BIND_EXPR_BLOCK (*tp
) = block
;
917 if (BIND_EXPR_VARS (*tp
))
918 /* This will remap a lot of the same decls again, but this should be
920 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
924 /* Create a new gimple_seq by remapping all the statements in BODY
925 using the inlining information in ID. */
928 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
930 gimple_stmt_iterator si
;
931 gimple_seq new_body
= NULL
;
933 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
935 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
936 gimple_seq_add_seq (&new_body
, new_stmts
);
943 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
944 block using the mapping information in ID. */
947 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
950 tree new_block
, new_vars
;
951 gimple_seq body
, new_body
;
953 /* Copy the statement. Note that we purposely don't use copy_stmt
954 here because we need to remap statements as we copy. */
955 body
= gimple_bind_body (stmt
);
956 new_body
= remap_gimple_seq (body
, id
);
958 new_block
= gimple_bind_block (stmt
);
960 remap_block (&new_block
, id
);
962 /* This will remap a lot of the same decls again, but this should be
964 new_vars
= gimple_bind_vars (stmt
);
966 new_vars
= remap_decls (new_vars
, NULL
, id
);
968 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
973 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
978 if (TREE_CODE (decl
) == SSA_NAME
)
980 decl
= SSA_NAME_VAR (decl
);
985 return (TREE_CODE (decl
) == PARM_DECL
);
988 /* Remap the dependence CLIQUE from the source to the destination function
989 as specified in ID. */
991 static unsigned short
992 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
994 if (clique
== 0 || processing_debug_stmt
)
996 if (!id
->dependence_map
)
997 id
->dependence_map
= new hash_map
<dependence_hash
, unsigned short>;
999 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
1002 /* Clique 1 is reserved for local ones set by PTA. */
1003 if (cfun
->last_clique
== 0)
1004 cfun
->last_clique
= 1;
1005 newc
= ++cfun
->last_clique
;
1010 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
1011 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
1012 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
1013 recursing into the children nodes of *TP. */
1016 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
1018 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
1019 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
1020 tree fn
= id
->src_fn
;
1022 /* For recursive invocations this is no longer the LHS itself. */
1023 bool is_lhs
= wi_p
->is_lhs
;
1024 wi_p
->is_lhs
= false;
1026 if (TREE_CODE (*tp
) == SSA_NAME
)
1028 *tp
= remap_ssa_name (*tp
, id
);
1031 SSA_NAME_DEF_STMT (*tp
) = wi_p
->stmt
;
1034 else if (auto_var_in_fn_p (*tp
, fn
))
1036 /* Local variables and labels need to be replaced by equivalent
1037 variables. We don't want to copy static variables; there's
1038 only one of those, no matter how many times we inline the
1039 containing function. Similarly for globals from an outer
1043 /* Remap the declaration. */
1044 new_decl
= remap_decl (*tp
, id
);
1045 gcc_assert (new_decl
);
1046 /* Replace this variable with the copy. */
1047 STRIP_TYPE_NOPS (new_decl
);
1048 /* ??? The C++ frontend uses void * pointer zero to initialize
1049 any other type. This confuses the middle-end type verification.
1050 As cloned bodies do not go through gimplification again the fixup
1051 there doesn't trigger. */
1052 if (TREE_CODE (new_decl
) == INTEGER_CST
1053 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
1054 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
1058 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1060 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
1062 else if (TREE_CODE (*tp
) == LABEL_DECL
1063 && (!DECL_CONTEXT (*tp
)
1064 || decl_function_context (*tp
) == id
->src_fn
))
1065 /* These may need to be remapped for EH handling. */
1066 *tp
= remap_decl (*tp
, id
);
1067 else if (TREE_CODE (*tp
) == FIELD_DECL
)
1069 /* If the enclosing record type is variably_modified_type_p, the field
1070 has already been remapped. Otherwise, it need not be. */
1071 tree
*n
= id
->decl_map
->get (*tp
);
1076 else if (TYPE_P (*tp
))
1077 /* Types may need remapping as well. */
1078 *tp
= remap_type (*tp
, id
);
1079 else if (CONSTANT_CLASS_P (*tp
))
1081 /* If this is a constant, we have to copy the node iff the type
1082 will be remapped. copy_tree_r will not copy a constant. */
1083 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1085 if (new_type
== TREE_TYPE (*tp
))
1088 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1089 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1092 *tp
= copy_node (*tp
);
1093 TREE_TYPE (*tp
) = new_type
;
1098 /* Otherwise, just copy the node. Note that copy_tree_r already
1099 knows not to copy VAR_DECLs, etc., so this is safe. */
1101 if (TREE_CODE (*tp
) == MEM_REF
&& !id
->do_not_fold
)
1103 /* We need to re-canonicalize MEM_REFs from inline substitutions
1104 that can happen when a pointer argument is an ADDR_EXPR.
1105 Recurse here manually to allow that. */
1106 tree ptr
= TREE_OPERAND (*tp
, 0);
1107 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1109 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
1110 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1111 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1112 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1113 copy_warning (*tp
, old
);
1114 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1116 MR_DEPENDENCE_CLIQUE (*tp
)
1117 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1118 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1120 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1121 remapped a parameter as the property might be valid only
1122 for the parameter itself. */
1123 if (TREE_THIS_NOTRAP (old
)
1124 && (!is_parm (TREE_OPERAND (old
, 0))
1125 || (!id
->transform_parameter
&& is_parm (ptr
))))
1126 TREE_THIS_NOTRAP (*tp
) = 1;
1127 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1132 /* Here is the "usual case". Copy this tree node, and then
1133 tweak some special cases. */
1134 copy_tree_r (tp
, walk_subtrees
, NULL
);
1136 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1137 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1139 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1141 /* The copied TARGET_EXPR has never been expanded, even if the
1142 original node was expanded already. */
1143 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1144 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1146 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1148 /* Variable substitution need not be simple. In particular,
1149 the MEM_REF substitution above. Make sure that
1150 TREE_CONSTANT and friends are up-to-date. */
1151 int invariant
= is_gimple_min_invariant (*tp
);
1152 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
1153 recompute_tree_invariant_for_addr_expr (*tp
);
1155 /* If this used to be invariant, but is not any longer,
1156 then regimplification is probably needed. */
1157 if (invariant
&& !is_gimple_min_invariant (*tp
))
1158 id
->regimplify
= true;
1164 /* Update the TREE_BLOCK for the cloned expr. */
1167 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1168 tree old_block
= TREE_BLOCK (*tp
);
1172 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1176 TREE_SET_BLOCK (*tp
, new_block
);
1179 /* Keep iterating. */
1184 /* Called from copy_body_id via walk_tree. DATA is really a
1185 `copy_body_data *'. */
1188 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1190 copy_body_data
*id
= (copy_body_data
*) data
;
1191 tree fn
= id
->src_fn
;
1194 /* Begin by recognizing trees that we'll completely rewrite for the
1195 inlining context. Our output for these trees is completely
1196 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1197 into an edge). Further down, we'll handle trees that get
1198 duplicated and/or tweaked. */
1200 /* When requested, RETURN_EXPRs should be transformed to just the
1201 contained MODIFY_EXPR. The branch semantics of the return will
1202 be handled elsewhere by manipulating the CFG rather than a statement. */
1203 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1205 tree assignment
= TREE_OPERAND (*tp
, 0);
1207 /* If we're returning something, just turn that into an
1208 assignment into the equivalent of the original RESULT_DECL.
1209 If the "assignment" is just the result decl, the result
1210 decl has already been set (e.g. a recent "foo (&result_decl,
1211 ...)"); just toss the entire RETURN_EXPR. */
1212 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1214 /* Replace the RETURN_EXPR with (a copy of) the
1215 MODIFY_EXPR hanging underneath. */
1216 *tp
= copy_node (assignment
);
1218 else /* Else the RETURN_EXPR returns no value. */
1221 return (tree
) (void *)1;
1224 else if (TREE_CODE (*tp
) == SSA_NAME
)
1226 *tp
= remap_ssa_name (*tp
, id
);
1231 /* Local variables and labels need to be replaced by equivalent
1232 variables. We don't want to copy static variables; there's only
1233 one of those, no matter how many times we inline the containing
1234 function. Similarly for globals from an outer function. */
1235 else if (auto_var_in_fn_p (*tp
, fn
))
1239 /* Remap the declaration. */
1240 new_decl
= remap_decl (*tp
, id
);
1241 gcc_assert (new_decl
);
1242 /* Replace this variable with the copy. */
1243 STRIP_TYPE_NOPS (new_decl
);
1247 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1248 copy_statement_list (tp
);
1249 else if (TREE_CODE (*tp
) == SAVE_EXPR
1250 || TREE_CODE (*tp
) == TARGET_EXPR
)
1251 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1252 else if (TREE_CODE (*tp
) == LABEL_DECL
1253 && (! DECL_CONTEXT (*tp
)
1254 || decl_function_context (*tp
) == id
->src_fn
))
1255 /* These may need to be remapped for EH handling. */
1256 *tp
= remap_decl (*tp
, id
);
1257 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1258 copy_bind_expr (tp
, walk_subtrees
, id
);
1259 /* Types may need remapping as well. */
1260 else if (TYPE_P (*tp
))
1261 *tp
= remap_type (*tp
, id
);
1263 /* If this is a constant, we have to copy the node iff the type will be
1264 remapped. copy_tree_r will not copy a constant. */
1265 else if (CONSTANT_CLASS_P (*tp
))
1267 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1269 if (new_type
== TREE_TYPE (*tp
))
1272 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1273 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1276 *tp
= copy_node (*tp
);
1277 TREE_TYPE (*tp
) = new_type
;
1281 /* Otherwise, just copy the node. Note that copy_tree_r already
1282 knows not to copy VAR_DECLs, etc., so this is safe. */
1285 /* Here we handle trees that are not completely rewritten.
1286 First we detect some inlining-induced bogosities for
1288 if (TREE_CODE (*tp
) == MODIFY_EXPR
1289 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1290 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1292 /* Some assignments VAR = VAR; don't generate any rtl code
1293 and thus don't count as variable modification. Avoid
1294 keeping bogosities like 0 = 0. */
1295 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1298 n
= id
->decl_map
->get (decl
);
1302 STRIP_TYPE_NOPS (value
);
1303 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1305 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1306 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1310 else if (INDIRECT_REF_P (*tp
))
1312 /* Get rid of *& from inline substitutions that can happen when a
1313 pointer argument is an ADDR_EXPR. */
1314 tree decl
= TREE_OPERAND (*tp
, 0);
1315 tree
*n
= id
->decl_map
->get (decl
);
1318 /* If we happen to get an ADDR_EXPR in n->value, strip
1319 it manually here as we'll eventually get ADDR_EXPRs
1320 which lie about their types pointed to. In this case
1321 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1322 but we absolutely rely on that. As fold_indirect_ref
1323 does other useful transformations, try that first, though. */
1324 tree type
= TREE_TYPE (*tp
);
1325 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1327 *tp
= id
->do_not_fold
? NULL
: gimple_fold_indirect_ref (ptr
);
1330 type
= remap_type (type
, id
);
1331 if (TREE_CODE (ptr
) == ADDR_EXPR
&& !id
->do_not_fold
)
1334 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1335 /* ??? We should either assert here or build
1336 a VIEW_CONVERT_EXPR instead of blindly leaking
1337 incompatible types to our IL. */
1339 *tp
= TREE_OPERAND (ptr
, 0);
1343 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1344 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1345 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1346 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1347 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1348 have remapped a parameter as the property might be
1349 valid only for the parameter itself. */
1350 if (TREE_THIS_NOTRAP (old
)
1351 && (!is_parm (TREE_OPERAND (old
, 0))
1352 || (!id
->transform_parameter
&& is_parm (ptr
))))
1353 TREE_THIS_NOTRAP (*tp
) = 1;
1360 else if (TREE_CODE (*tp
) == MEM_REF
&& !id
->do_not_fold
)
1362 /* We need to re-canonicalize MEM_REFs from inline substitutions
1363 that can happen when a pointer argument is an ADDR_EXPR.
1364 Recurse here manually to allow that. */
1365 tree ptr
= TREE_OPERAND (*tp
, 0);
1366 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1368 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1369 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1370 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1371 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1372 copy_warning (*tp
, old
);
1373 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1375 MR_DEPENDENCE_CLIQUE (*tp
)
1376 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1377 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1379 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1380 remapped a parameter as the property might be valid only
1381 for the parameter itself. */
1382 if (TREE_THIS_NOTRAP (old
)
1383 && (!is_parm (TREE_OPERAND (old
, 0))
1384 || (!id
->transform_parameter
&& is_parm (ptr
))))
1385 TREE_THIS_NOTRAP (*tp
) = 1;
1386 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1391 /* Here is the "usual case". Copy this tree node, and then
1392 tweak some special cases. */
1393 copy_tree_r (tp
, walk_subtrees
, NULL
);
1395 /* If EXPR has block defined, map it to newly constructed block.
1396 When inlining we want EXPRs without block appear in the block
1397 of function call if we are not remapping a type. */
1400 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1401 if (TREE_BLOCK (*tp
))
1404 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1408 TREE_SET_BLOCK (*tp
, new_block
);
1411 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1412 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1414 /* The copied TARGET_EXPR has never been expanded, even if the
1415 original node was expanded already. */
1416 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1418 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1419 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1422 /* Variable substitution need not be simple. In particular, the
1423 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1424 and friends are up-to-date. */
1425 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1427 int invariant
= is_gimple_min_invariant (*tp
);
1428 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1430 /* Handle the case where we substituted an INDIRECT_REF
1431 into the operand of the ADDR_EXPR. */
1432 if (INDIRECT_REF_P (TREE_OPERAND (*tp
, 0))
1433 && !id
->do_not_fold
)
1435 tree t
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1436 if (TREE_TYPE (t
) != TREE_TYPE (*tp
))
1437 t
= fold_convert (remap_type (TREE_TYPE (*tp
), id
), t
);
1441 recompute_tree_invariant_for_addr_expr (*tp
);
1443 /* If this used to be invariant, but is not any longer,
1444 then regimplification is probably needed. */
1445 if (invariant
&& !is_gimple_min_invariant (*tp
))
1446 id
->regimplify
= true;
1450 else if (TREE_CODE (*tp
) == OMP_CLAUSE
1451 && (OMP_CLAUSE_CODE (*tp
) == OMP_CLAUSE_AFFINITY
1452 || OMP_CLAUSE_CODE (*tp
) == OMP_CLAUSE_DEPEND
))
1454 tree t
= OMP_CLAUSE_DECL (*tp
);
1456 && TREE_CODE (t
) == TREE_LIST
1458 && TREE_CODE (TREE_PURPOSE (t
)) == TREE_VEC
)
1461 OMP_CLAUSE_DECL (*tp
) = copy_node (t
);
1462 t
= OMP_CLAUSE_DECL (*tp
);
1463 TREE_PURPOSE (t
) = copy_node (TREE_PURPOSE (t
));
1464 for (int i
= 0; i
<= 4; i
++)
1465 walk_tree (&TREE_VEC_ELT (TREE_PURPOSE (t
), i
),
1466 copy_tree_body_r
, id
, NULL
);
1467 if (TREE_VEC_ELT (TREE_PURPOSE (t
), 5))
1468 remap_block (&TREE_VEC_ELT (TREE_PURPOSE (t
), 5), id
);
1469 walk_tree (&TREE_VALUE (t
), copy_tree_body_r
, id
, NULL
);
1474 /* Keep iterating. */
1478 /* Helper for remap_gimple_stmt. Given an EH region number for the
1479 source function, map that to the duplicate EH region number in
1480 the destination function. */
1483 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1485 eh_region old_r
, new_r
;
1487 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1488 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1490 return new_r
->index
;
1493 /* Similar, but operate on INTEGER_CSTs. */
1496 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1500 old_nr
= tree_to_shwi (old_t_nr
);
1501 new_nr
= remap_eh_region_nr (old_nr
, id
);
1503 return build_int_cst (integer_type_node
, new_nr
);
1506 /* Helper for copy_bb. Remap statement STMT using the inlining
1507 information in ID. Return the new statement copy. */
1510 remap_gimple_stmt (gimple
*stmt
, copy_body_data
*id
)
1512 gimple
*copy
= NULL
;
1513 struct walk_stmt_info wi
;
1514 bool skip_first
= false;
1515 gimple_seq stmts
= NULL
;
1517 if (is_gimple_debug (stmt
)
1518 && (gimple_debug_nonbind_marker_p (stmt
)
1519 ? !DECL_STRUCT_FUNCTION (id
->dst_fn
)->debug_nonbind_markers
1520 : !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
)))
1523 if (!is_gimple_debug (stmt
)
1524 && id
->param_body_adjs
1525 && id
->param_body_adjs
->m_dead_stmts
.contains (stmt
))
1527 tree
*dval
= id
->param_body_adjs
->m_dead_stmt_debug_equiv
.get (stmt
);
1531 gcc_assert (is_gimple_assign (stmt
));
1532 tree lhs
= gimple_assign_lhs (stmt
);
1533 tree
*dvar
= id
->param_body_adjs
->m_dead_ssa_debug_equiv
.get (lhs
);
1534 gdebug
*bind
= gimple_build_debug_bind (*dvar
, *dval
, stmt
);
1535 if (id
->reset_location
)
1536 gimple_set_location (bind
, input_location
);
1537 id
->debug_stmts
.safe_push (bind
);
1538 gimple_seq_add_stmt_without_update (&stmts
, bind
);
1542 /* Begin by recognizing trees that we'll completely rewrite for the
1543 inlining context. Our output for these trees is completely
1544 different from our input (e.g. RETURN_EXPR is deleted and morphs
1545 into an edge). Further down, we'll handle trees that get
1546 duplicated and/or tweaked. */
1548 /* When requested, GIMPLE_RETURN should be transformed to just the
1549 contained GIMPLE_ASSIGN. The branch semantics of the return will
1550 be handled elsewhere by manipulating the CFG rather than the
1552 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1554 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1556 /* If we're returning something, just turn that into an
1557 assignment to the equivalent of the original RESULT_DECL.
1558 If RETVAL is just the result decl, the result decl has
1559 already been set (e.g. a recent "foo (&result_decl, ...)");
1560 just toss the entire GIMPLE_RETURN. Likewise for when the
1561 call doesn't want the return value. */
1563 && (TREE_CODE (retval
) != RESULT_DECL
1565 || gimple_call_lhs (id
->call_stmt
) != NULL_TREE
)
1566 && (TREE_CODE (retval
) != SSA_NAME
1567 || ! SSA_NAME_VAR (retval
)
1568 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1570 copy
= gimple_build_assign (id
->do_not_unshare
1571 ? id
->retvar
: unshare_expr (id
->retvar
),
1573 /* id->retvar is already substituted. Skip it on later remapping. */
1579 else if (gimple_has_substatements (stmt
))
1583 /* When cloning bodies from the C++ front end, we will be handed bodies
1584 in High GIMPLE form. Handle here all the High GIMPLE statements that
1585 have embedded statements. */
1586 switch (gimple_code (stmt
))
1589 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1594 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1595 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1596 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1600 case GIMPLE_EH_FILTER
:
1601 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1602 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1606 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1607 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1608 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1611 case GIMPLE_WITH_CLEANUP_EXPR
:
1612 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1613 copy
= gimple_build_wce (s1
);
1616 case GIMPLE_OMP_PARALLEL
:
1618 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1619 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1620 copy
= gimple_build_omp_parallel
1622 gimple_omp_parallel_clauses (omp_par_stmt
),
1623 gimple_omp_parallel_child_fn (omp_par_stmt
),
1624 gimple_omp_parallel_data_arg (omp_par_stmt
));
1628 case GIMPLE_OMP_TASK
:
1629 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1630 copy
= gimple_build_omp_task
1632 gimple_omp_task_clauses (stmt
),
1633 gimple_omp_task_child_fn (stmt
),
1634 gimple_omp_task_data_arg (stmt
),
1635 gimple_omp_task_copy_fn (stmt
),
1636 gimple_omp_task_arg_size (stmt
),
1637 gimple_omp_task_arg_align (stmt
));
1640 case GIMPLE_OMP_FOR
:
1641 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1642 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1643 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1644 gimple_omp_for_clauses (stmt
),
1645 gimple_omp_for_collapse (stmt
), s2
);
1648 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1650 gimple_omp_for_set_index (copy
, i
,
1651 gimple_omp_for_index (stmt
, i
));
1652 gimple_omp_for_set_initial (copy
, i
,
1653 gimple_omp_for_initial (stmt
, i
));
1654 gimple_omp_for_set_final (copy
, i
,
1655 gimple_omp_for_final (stmt
, i
));
1656 gimple_omp_for_set_incr (copy
, i
,
1657 gimple_omp_for_incr (stmt
, i
));
1658 gimple_omp_for_set_cond (copy
, i
,
1659 gimple_omp_for_cond (stmt
, i
));
1664 case GIMPLE_OMP_MASTER
:
1665 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1666 copy
= gimple_build_omp_master (s1
);
1669 case GIMPLE_OMP_MASKED
:
1670 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1671 copy
= gimple_build_omp_masked
1672 (s1
, gimple_omp_masked_clauses (stmt
));
1675 case GIMPLE_OMP_SCOPE
:
1676 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1677 copy
= gimple_build_omp_scope
1678 (s1
, gimple_omp_scope_clauses (stmt
));
1681 case GIMPLE_OMP_TASKGROUP
:
1682 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1683 copy
= gimple_build_omp_taskgroup
1684 (s1
, gimple_omp_taskgroup_clauses (stmt
));
1687 case GIMPLE_OMP_ORDERED
:
1688 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1689 copy
= gimple_build_omp_ordered
1691 gimple_omp_ordered_clauses (as_a
<gomp_ordered
*> (stmt
)));
1694 case GIMPLE_OMP_SCAN
:
1695 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1696 copy
= gimple_build_omp_scan
1697 (s1
, gimple_omp_scan_clauses (as_a
<gomp_scan
*> (stmt
)));
1700 case GIMPLE_OMP_SECTION
:
1701 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1702 copy
= gimple_build_omp_section (s1
);
1705 case GIMPLE_OMP_SECTIONS
:
1706 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1707 copy
= gimple_build_omp_sections
1708 (s1
, gimple_omp_sections_clauses (stmt
));
1711 case GIMPLE_OMP_STRUCTURED_BLOCK
:
1712 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1713 copy
= gimple_build_omp_structured_block (s1
);
1716 case GIMPLE_OMP_SINGLE
:
1717 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1718 copy
= gimple_build_omp_single
1719 (s1
, gimple_omp_single_clauses (stmt
));
1722 case GIMPLE_OMP_TARGET
:
1723 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1724 copy
= gimple_build_omp_target
1725 (s1
, gimple_omp_target_kind (stmt
),
1726 gimple_omp_target_clauses (stmt
));
1729 case GIMPLE_OMP_TEAMS
:
1730 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1731 copy
= gimple_build_omp_teams
1732 (s1
, gimple_omp_teams_clauses (stmt
));
1735 case GIMPLE_OMP_CRITICAL
:
1736 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1737 copy
= gimple_build_omp_critical (s1
,
1738 gimple_omp_critical_name
1739 (as_a
<gomp_critical
*> (stmt
)),
1740 gimple_omp_critical_clauses
1741 (as_a
<gomp_critical
*> (stmt
)));
1745 s1
= remap_gimple_seq (gimple_assume_body (stmt
), id
);
1746 copy
= gimple_build_assume (gimple_assume_guard (stmt
), s1
);
1749 case GIMPLE_TRANSACTION
:
1751 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1752 gtransaction
*new_trans_stmt
;
1753 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1755 copy
= new_trans_stmt
= gimple_build_transaction (s1
);
1756 gimple_transaction_set_subcode (new_trans_stmt
,
1757 gimple_transaction_subcode (old_trans_stmt
));
1758 gimple_transaction_set_label_norm (new_trans_stmt
,
1759 gimple_transaction_label_norm (old_trans_stmt
));
1760 gimple_transaction_set_label_uninst (new_trans_stmt
,
1761 gimple_transaction_label_uninst (old_trans_stmt
));
1762 gimple_transaction_set_label_over (new_trans_stmt
,
1763 gimple_transaction_label_over (old_trans_stmt
));
1773 if (gimple_assign_single_p (stmt
)
1774 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1775 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1777 /* Here we handle statements that are not completely rewritten.
1778 First we detect some inlining-induced bogosities for
1781 /* Some assignments VAR = VAR; don't generate any rtl code
1782 and thus don't count as variable modification. Avoid
1783 keeping bogosities like 0 = 0. */
1784 tree decl
= gimple_assign_lhs (stmt
), value
;
1787 n
= id
->decl_map
->get (decl
);
1791 STRIP_TYPE_NOPS (value
);
1792 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1797 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1798 in a block that we aren't copying during tree_function_versioning,
1799 just drop the clobber stmt. */
1800 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1802 tree lhs
= gimple_assign_lhs (stmt
);
1803 if (TREE_CODE (lhs
) == MEM_REF
1804 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1806 gimple
*def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1807 if (gimple_bb (def_stmt
)
1808 && !bitmap_bit_p (id
->blocks_to_copy
,
1809 gimple_bb (def_stmt
)->index
))
1814 /* We do not allow CLOBBERs of handled components. In case
1815 returned value is stored via such handled component, remove
1816 the clobber so stmt verifier is happy. */
1817 if (gimple_clobber_p (stmt
)
1818 && TREE_CODE (gimple_assign_lhs (stmt
)) == RESULT_DECL
)
1820 tree remapped
= remap_decl (gimple_assign_lhs (stmt
), id
);
1821 if (!DECL_P (remapped
)
1822 && TREE_CODE (remapped
) != MEM_REF
)
1826 if (gimple_debug_bind_p (stmt
))
1828 tree var
= gimple_debug_bind_get_var (stmt
);
1829 tree value
= gimple_debug_bind_get_value (stmt
);
1830 if (id
->param_body_adjs
1831 && id
->param_body_adjs
->m_dead_stmts
.contains (stmt
))
1833 value
= unshare_expr_without_location (value
);
1834 id
->param_body_adjs
->remap_with_debug_expressions (&value
);
1837 gdebug
*copy
= gimple_build_debug_bind (var
, value
, stmt
);
1838 if (id
->reset_location
)
1839 gimple_set_location (copy
, input_location
);
1840 id
->debug_stmts
.safe_push (copy
);
1841 gimple_seq_add_stmt_without_update (&stmts
, copy
);
1844 if (gimple_debug_source_bind_p (stmt
))
1846 gdebug
*copy
= gimple_build_debug_source_bind
1847 (gimple_debug_source_bind_get_var (stmt
),
1848 gimple_debug_source_bind_get_value (stmt
),
1850 if (id
->reset_location
)
1851 gimple_set_location (copy
, input_location
);
1852 id
->debug_stmts
.safe_push (copy
);
1853 gimple_seq_add_stmt_without_update (&stmts
, copy
);
1856 if (gimple_debug_nonbind_marker_p (stmt
))
1858 /* If the inlined function has too many debug markers,
1860 if (id
->src_cfun
->debug_marker_count
1861 > param_max_debug_marker_count
1862 || id
->reset_location
)
1865 gdebug
*copy
= as_a
<gdebug
*> (gimple_copy (stmt
));
1866 id
->debug_stmts
.safe_push (copy
);
1867 gimple_seq_add_stmt_without_update (&stmts
, copy
);
1871 /* Create a new deep copy of the statement. */
1872 copy
= gimple_copy (stmt
);
1874 /* Clear flags that need revisiting. */
1875 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1877 if (gimple_call_tail_p (call_stmt
))
1878 gimple_call_set_tail (call_stmt
, false);
1879 if (gimple_call_from_thunk_p (call_stmt
))
1880 gimple_call_set_from_thunk (call_stmt
, false);
1881 if (gimple_call_internal_p (call_stmt
))
1882 switch (gimple_call_internal_fn (call_stmt
))
1884 case IFN_GOMP_SIMD_LANE
:
1885 case IFN_GOMP_SIMD_VF
:
1886 case IFN_GOMP_SIMD_LAST_LANE
:
1887 case IFN_GOMP_SIMD_ORDERED_START
:
1888 case IFN_GOMP_SIMD_ORDERED_END
:
1889 DECL_STRUCT_FUNCTION (id
->dst_fn
)->has_simduid_loops
= true;
1896 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1897 RESX and EH_DISPATCH. */
1899 switch (gimple_code (copy
))
1903 tree r
, fndecl
= gimple_call_fndecl (copy
);
1904 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
1905 switch (DECL_FUNCTION_CODE (fndecl
))
1907 case BUILT_IN_EH_COPY_VALUES
:
1908 r
= gimple_call_arg (copy
, 1);
1909 r
= remap_eh_region_tree_nr (r
, id
);
1910 gimple_call_set_arg (copy
, 1, r
);
1913 case BUILT_IN_EH_POINTER
:
1914 case BUILT_IN_EH_FILTER
:
1915 r
= gimple_call_arg (copy
, 0);
1916 r
= remap_eh_region_tree_nr (r
, id
);
1917 gimple_call_set_arg (copy
, 0, r
);
1924 /* Reset alias info if we didn't apply measures to
1925 keep it valid over inlining by setting DECL_PT_UID. */
1926 if (!id
->src_cfun
->gimple_df
1927 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1928 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1934 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1935 int r
= gimple_resx_region (resx_stmt
);
1936 r
= remap_eh_region_nr (r
, id
);
1937 gimple_resx_set_region (resx_stmt
, r
);
1941 case GIMPLE_EH_DISPATCH
:
1943 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1944 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1945 r
= remap_eh_region_nr (r
, id
);
1946 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1955 /* If STMT has a block defined, map it to the newly constructed block. */
1956 if (tree block
= gimple_block (copy
))
1959 n
= id
->decl_map
->get (block
);
1961 gimple_set_block (copy
, *n
);
1963 if (id
->param_body_adjs
)
1965 gimple_seq extra_stmts
= NULL
;
1966 id
->param_body_adjs
->modify_gimple_stmt (©
, &extra_stmts
, stmt
);
1967 if (!gimple_seq_empty_p (extra_stmts
))
1969 memset (&wi
, 0, sizeof (wi
));
1971 for (gimple_stmt_iterator egsi
= gsi_start (extra_stmts
);
1974 walk_gimple_op (gsi_stmt (egsi
), remap_gimple_op_r
, &wi
);
1975 gimple_seq_add_seq_without_update (&stmts
, extra_stmts
);
1979 if (id
->reset_location
)
1980 gimple_set_location (copy
, input_location
);
1982 /* Debug statements ought to be rebuilt and not copied. */
1983 gcc_checking_assert (!is_gimple_debug (copy
));
1985 /* Remap all the operands in COPY. */
1986 memset (&wi
, 0, sizeof (wi
));
1989 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1991 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1993 /* Clear the copied virtual operands. We are not remapping them here
1994 but are going to recreate them from scratch. */
1995 if (gimple_has_mem_ops (copy
))
1997 gimple_set_vdef (copy
, NULL_TREE
);
1998 gimple_set_vuse (copy
, NULL_TREE
);
2001 if (cfun
->can_throw_non_call_exceptions
)
2003 /* When inlining a function which does not have non-call exceptions
2004 enabled into a function that has (which only happens with
2005 always-inline) we have to fixup stmts that cannot throw. */
2006 if (gcond
*cond
= dyn_cast
<gcond
*> (copy
))
2007 if (gimple_could_trap_p (cond
))
2010 = gimple_build_assign (make_ssa_name (boolean_type_node
),
2011 gimple_cond_code (cond
),
2012 gimple_cond_lhs (cond
),
2013 gimple_cond_rhs (cond
));
2014 gimple_seq_add_stmt_without_update (&stmts
, cmp
);
2015 gimple_cond_set_code (cond
, NE_EXPR
);
2016 gimple_cond_set_lhs (cond
, gimple_assign_lhs (cmp
));
2017 gimple_cond_set_rhs (cond
, boolean_false_node
);
2021 gimple_seq_add_stmt_without_update (&stmts
, copy
);
2026 /* Copy basic block, scale profile accordingly. Edges will be taken care of
2030 copy_bb (copy_body_data
*id
, basic_block bb
,
2031 profile_count num
, profile_count den
)
2033 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
2034 basic_block copy_basic_block
;
2038 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2040 /* Search for previous copied basic block. */
2043 prev
= prev
->prev_bb
;
2045 /* create_basic_block() will append every new block to
2046 basic_block_info automatically. */
2047 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
2048 copy_basic_block
->count
= bb
->count
.apply_scale (num
, den
);
2050 copy_gsi
= gsi_start_bb (copy_basic_block
);
2052 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
2055 gimple
*stmt
= gsi_stmt (gsi
);
2056 gimple
*orig_stmt
= stmt
;
2057 gimple_stmt_iterator stmts_gsi
;
2058 bool stmt_added
= false;
2060 id
->regimplify
= false;
2061 stmts
= remap_gimple_stmt (stmt
, id
);
2063 if (gimple_seq_empty_p (stmts
))
2068 for (stmts_gsi
= gsi_start (stmts
);
2069 !gsi_end_p (stmts_gsi
); )
2071 stmt
= gsi_stmt (stmts_gsi
);
2073 /* Advance iterator now before stmt is moved to seq_gsi. */
2074 gsi_next (&stmts_gsi
);
2076 if (gimple_nop_p (stmt
))
2079 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
2082 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
2085 gimple_regimplify_operands (stmt
, &seq_gsi
);
2093 /* If copy_basic_block has been empty at the start of this iteration,
2094 call gsi_start_bb again to get at the newly added statements. */
2095 if (gsi_end_p (copy_gsi
))
2096 copy_gsi
= gsi_start_bb (copy_basic_block
);
2098 gsi_next (©_gsi
);
2100 /* Process the new statement. The call to gimple_regimplify_operands
2101 possibly turned the statement into multiple statements, we
2102 need to process all of them. */
2108 stmt
= gsi_stmt (copy_gsi
);
2109 call_stmt
= dyn_cast
<gcall
*> (stmt
);
2111 && gimple_call_va_arg_pack_p (call_stmt
)
2113 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
2115 /* __builtin_va_arg_pack () should be replaced by
2116 all arguments corresponding to ... in the caller. */
2120 size_t nargs_caller
= gimple_call_num_args (id
->call_stmt
);
2121 size_t nargs
= nargs_caller
;
2123 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
2125 /* Avoid crashing on invalid IL that doesn't have a
2126 varargs function or that passes not enough arguments. */
2132 /* Create the new array of arguments. */
2133 size_t nargs_callee
= gimple_call_num_args (call_stmt
);
2134 size_t n
= nargs
+ nargs_callee
;
2135 argarray
.create (n
);
2136 argarray
.safe_grow_cleared (n
, true);
2138 /* Copy all the arguments before '...' */
2140 memcpy (argarray
.address (),
2141 gimple_call_arg_ptr (call_stmt
, 0),
2142 nargs_callee
* sizeof (tree
));
2144 /* Append the arguments passed in '...' */
2146 memcpy (argarray
.address () + nargs_callee
,
2147 gimple_call_arg_ptr (id
->call_stmt
, 0)
2148 + (nargs_caller
- nargs
), nargs
* sizeof (tree
));
2150 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
2153 argarray
.release ();
2155 /* Copy all GIMPLE_CALL flags, location and block, except
2156 GF_CALL_VA_ARG_PACK. */
2157 gimple_call_copy_flags (new_call
, call_stmt
);
2158 gimple_call_set_va_arg_pack (new_call
, false);
2159 gimple_call_set_fntype (new_call
, gimple_call_fntype (call_stmt
));
2160 /* location includes block. */
2161 gimple_set_location (new_call
, gimple_location (stmt
));
2162 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
2164 gsi_replace (©_gsi
, new_call
, false);
2169 && (decl
= gimple_call_fndecl (stmt
))
2170 && fndecl_built_in_p (decl
, BUILT_IN_VA_ARG_PACK_LEN
))
2172 /* __builtin_va_arg_pack_len () should be replaced by
2173 the number of anonymous arguments. */
2174 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
2178 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
2181 if (!gimple_call_lhs (stmt
))
2183 /* Drop unused calls. */
2184 gsi_remove (©_gsi
, false);
2187 else if (!gimple_call_va_arg_pack_p (id
->call_stmt
))
2189 count
= build_int_cst (integer_type_node
, nargs
);
2190 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
2191 gsi_replace (©_gsi
, new_stmt
, false);
2194 else if (nargs
!= 0)
2196 tree newlhs
= create_tmp_reg_or_ssa_name (integer_type_node
);
2197 count
= build_int_cst (integer_type_node
, nargs
);
2198 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
2199 PLUS_EXPR
, newlhs
, count
);
2200 gimple_call_set_lhs (stmt
, newlhs
);
2201 gsi_insert_after (©_gsi
, new_stmt
, GSI_NEW_STMT
);
2206 && gimple_call_internal_p (stmt
)
2207 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
2209 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
2210 gsi_remove (©_gsi
, false);
2214 /* Statements produced by inlining can be unfolded, especially
2215 when we constant propagated some operands. We can't fold
2216 them right now for two reasons:
2217 1) folding require SSA_NAME_DEF_STMTs to be correct
2218 2) we can't change function calls to builtins.
2219 So we just mark statement for later folding. We mark
2220 all new statements, instead just statements that has changed
2221 by some nontrivial substitution so even statements made
2222 foldable indirectly are updated. If this turns out to be
2223 expensive, copy_body can be told to watch for nontrivial
2225 if (id
->statements_to_fold
)
2226 id
->statements_to_fold
->add (stmt
);
2228 /* We're duplicating a CALL_EXPR. Find any corresponding
2229 callgraph edges and update or duplicate them. */
2230 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
2232 struct cgraph_edge
*edge
;
2234 switch (id
->transform_call_graph_edges
)
2236 case CB_CGE_DUPLICATE
:
2237 edge
= id
->src_node
->get_edge (orig_stmt
);
2240 struct cgraph_edge
*old_edge
= edge
;
2242 /* A speculative call is consist of multiple
2243 edges - indirect edge and one or more direct edges
2244 Duplicate the whole thing and distribute frequencies
2246 if (edge
->speculative
)
2249 profile_count direct_cnt
2250 = profile_count::zero ();
2252 /* First figure out the distribution of counts
2253 so we can re-scale BB profile accordingly. */
2254 for (cgraph_edge
*e
= old_edge
; e
;
2255 e
= e
->next_speculative_call_target ())
2256 direct_cnt
= direct_cnt
+ e
->count
;
2258 cgraph_edge
*indirect
2259 = old_edge
->speculative_call_indirect_edge ();
2260 profile_count indir_cnt
= indirect
->count
;
2262 /* Next iterate all direct edges, clone it and its
2263 corresponding reference and update profile. */
2264 for (cgraph_edge
*e
= old_edge
;
2266 e
= e
->next_speculative_call_target ())
2268 profile_count cnt
= e
->count
;
2270 id
->dst_node
->clone_reference
2271 (e
->speculative_call_target_ref (), stmt
);
2272 edge
= e
->clone (id
->dst_node
, call_stmt
,
2273 gimple_uid (stmt
), num
, den
,
2275 profile_probability prob
2276 = cnt
.probability_in (direct_cnt
2279 = copy_basic_block
->count
.apply_probability
2284 (indirect
->num_speculative_call_targets_p ()
2287 /* Duplicate the indirect edge after all direct edges
2289 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2294 profile_probability prob
2295 = indir_cnt
.probability_in (direct_cnt
2298 = copy_basic_block
->count
.apply_probability (prob
);
2302 edge
= edge
->clone (id
->dst_node
, call_stmt
,
2306 edge
->count
= copy_basic_block
->count
;
2311 case CB_CGE_MOVE_CLONES
:
2312 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2314 edge
= id
->dst_node
->get_edge (stmt
);
2318 edge
= id
->dst_node
->get_edge (orig_stmt
);
2320 edge
= cgraph_edge::set_call_stmt (edge
, call_stmt
);
2327 /* Constant propagation on argument done during inlining
2328 may create new direct call. Produce an edge for it. */
2330 || (edge
->indirect_inlining_edge
2331 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2332 && id
->dst_node
->definition
2333 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2335 struct cgraph_node
*dest
= cgraph_node::get_create (fn
);
2337 /* We have missing edge in the callgraph. This can happen
2338 when previous inlining turned an indirect call into a
2339 direct call by constant propagating arguments or we are
2340 producing dead clone (for further cloning). In all
2341 other cases we hit a bug (incorrect node sharing is the
2342 most common reason for missing edges). */
2343 gcc_assert (!dest
->definition
2344 || dest
->address_taken
2345 || !id
->src_node
->definition
2346 || !id
->dst_node
->definition
);
2347 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2348 id
->dst_node
->create_edge_including_clones
2349 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2350 CIF_ORIGINALLY_INDIRECT_CALL
);
2352 id
->dst_node
->create_edge (dest
, call_stmt
,
2353 bb
->count
)->inline_failed
2354 = CIF_ORIGINALLY_INDIRECT_CALL
;
2357 fprintf (dump_file
, "Created new direct edge to %s\n",
2358 dest
->dump_name ());
2362 notice_special_calls (as_a
<gcall
*> (stmt
));
2365 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2366 id
->eh_map
, id
->eh_lp_nr
);
2368 gsi_next (©_gsi
);
2370 while (!gsi_end_p (copy_gsi
));
2372 copy_gsi
= gsi_last_bb (copy_basic_block
);
2375 return copy_basic_block
;
2378 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2379 form is quite easy, since dominator relationship for old basic blocks does
2382 There is however exception where inlining might change dominator relation
2383 across EH edges from basic block within inlined functions destinating
2384 to landing pads in function we inline into.
2386 The function fills in PHI_RESULTs of such PHI nodes if they refer
2387 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2388 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2389 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2390 set, and this means that there will be no overlapping live ranges
2391 for the underlying symbol.
2393 This might change in future if we allow redirecting of EH edges and
2394 we might want to change way build CFG pre-inlining to include
2395 all the possible edges then. */
2397 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2398 bool can_throw
, bool nonlocal_goto
)
2403 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2405 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2411 gcc_assert (e
->flags
& EDGE_EH
);
2414 gcc_assert (!(e
->flags
& EDGE_EH
));
2416 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2422 /* For abnormal goto/call edges the receiver can be the
2423 ENTRY_BLOCK. Do not assert this cannot happen. */
2425 gcc_assert ((e
->flags
& EDGE_EH
)
2426 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2428 re
= find_edge (ret_bb
, e
->dest
);
2429 gcc_checking_assert (re
);
2430 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2431 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2433 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2434 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2439 /* Insert clobbers for automatic variables of inlined ID->src_fn
2440 function at the start of basic block ID->eh_landing_pad_dest. */
2443 add_clobbers_to_eh_landing_pad (copy_body_data
*id
)
2446 basic_block bb
= id
->eh_landing_pad_dest
;
2447 live_vars_map
*vars
= NULL
;
2448 unsigned int cnt
= 0;
2450 FOR_EACH_VEC_SAFE_ELT (id
->src_cfun
->local_decls
, i
, var
)
2452 && !DECL_HARD_REGISTER (var
)
2453 && !TREE_THIS_VOLATILE (var
)
2454 && !DECL_HAS_VALUE_EXPR_P (var
)
2455 && !is_gimple_reg (var
)
2456 && auto_var_in_fn_p (var
, id
->src_fn
)
2457 && !lookup_attribute ("omp simd array", DECL_ATTRIBUTES (var
)))
2459 tree
*t
= id
->decl_map
->get (var
);
2464 && !DECL_HARD_REGISTER (new_var
)
2465 && !TREE_THIS_VOLATILE (new_var
)
2466 && !DECL_HAS_VALUE_EXPR_P (new_var
)
2467 && !is_gimple_reg (new_var
)
2468 && auto_var_in_fn_p (new_var
, id
->dst_fn
))
2471 vars
= new live_vars_map
;
2472 vars
->put (DECL_UID (var
), cnt
++);
2478 vec
<bitmap_head
> live
= compute_live_vars (id
->src_cfun
, vars
);
2479 FOR_EACH_VEC_SAFE_ELT (id
->src_cfun
->local_decls
, i
, var
)
2484 bool needed
= false;
2485 unsigned int *v
= vars
->get (DECL_UID (var
));
2488 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
2489 if ((e
->flags
& EDGE_EH
) != 0
2490 && e
->src
->index
>= id
->add_clobbers_to_eh_landing_pads
)
2492 basic_block src_bb
= (basic_block
) e
->src
->aux
;
2494 if (bitmap_bit_p (&live
[src_bb
->index
], *v
))
2502 tree new_var
= *id
->decl_map
->get (var
);
2503 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
2504 tree clobber
= build_clobber (TREE_TYPE (new_var
));
2505 gimple
*clobber_stmt
= gimple_build_assign (new_var
, clobber
);
2506 gsi_insert_before (&gsi
, clobber_stmt
, GSI_NEW_STMT
);
2509 destroy_live_vars (live
);
2513 /* Copy edges from BB into its copy constructed earlier, scale profile
2514 accordingly. Edges will be taken care of later. Assume aux
2515 pointers to point to the copies of each BB. Return true if any
2516 debug stmts are left after a statement that must end the basic block. */
2519 copy_edges_for_bb (basic_block bb
, profile_count num
, profile_count den
,
2520 basic_block ret_bb
, basic_block abnormal_goto_dest
,
2523 basic_block new_bb
= (basic_block
) bb
->aux
;
2526 gimple_stmt_iterator si
;
2527 bool need_debug_cleanup
= false;
2529 /* Use the indices from the original blocks to create edges for the
2531 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2532 if (!(old_edge
->flags
& EDGE_EH
))
2535 int flags
= old_edge
->flags
;
2536 location_t locus
= old_edge
->goto_locus
;
2538 /* Return edges do get a FALLTHRU flag when they get inlined. */
2539 if (old_edge
->dest
->index
== EXIT_BLOCK
2540 && !(flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2541 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2542 flags
|= EDGE_FALLTHRU
;
2545 = make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2546 new_edge
->probability
= old_edge
->probability
;
2547 if (!id
->reset_location
)
2548 new_edge
->goto_locus
= remap_location (locus
, id
);
2551 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2554 /* When doing function splitting, we must decrease count of the return block
2555 which was previously reachable by block we did not copy. */
2556 if (single_succ_p (bb
) && single_succ_edge (bb
)->dest
->index
== EXIT_BLOCK
)
2557 FOR_EACH_EDGE (old_edge
, ei
, bb
->preds
)
2558 if (old_edge
->src
->index
!= ENTRY_BLOCK
2559 && !old_edge
->src
->aux
)
2560 new_bb
->count
-= old_edge
->count ().apply_scale (num
, den
);
2562 /* Walk stmts from end to start so that splitting will adjust the BB
2563 pointer for each stmt at most once, even when we split the block
2565 bool seen_nondebug
= false;
2566 for (si
= gsi_last_bb (new_bb
); !gsi_end_p (si
);)
2568 bool can_throw
, nonlocal_goto
;
2569 gimple
*copy_stmt
= gsi_stmt (si
);
2571 /* Do this before the possible split_block. */
2574 /* If this tree could throw an exception, there are two
2575 cases where we need to add abnormal edge(s): the
2576 tree wasn't in a region and there is a "current
2577 region" in the caller; or the original tree had
2578 EH edges. In both cases split the block after the tree,
2579 and add abnormal edge(s) as needed; we need both
2580 those from the callee and the caller.
2581 We check whether the copy can throw, because the const
2582 propagation can change an INDIRECT_REF which throws
2583 into a COMPONENT_REF which doesn't. If the copy
2584 can throw, the original could also throw. */
2585 can_throw
= stmt_can_throw_internal (cfun
, copy_stmt
);
2587 = (stmt_can_make_abnormal_goto (copy_stmt
)
2588 && !computed_goto_p (copy_stmt
));
2590 if (can_throw
|| nonlocal_goto
)
2592 /* If there's only debug insns after copy_stmt don't split
2593 the block but instead mark the block for cleanup. */
2595 need_debug_cleanup
= true;
2598 /* Note that bb's predecessor edges aren't necessarily
2599 right at this point; split_block doesn't care. */
2600 edge e
= split_block (new_bb
, copy_stmt
);
2601 e
->dest
->aux
= new_bb
->aux
;
2602 seen_nondebug
= false;
2606 if (!is_gimple_debug (copy_stmt
))
2607 seen_nondebug
= true;
2609 bool update_probs
= false;
2611 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2613 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2614 update_probs
= true;
2618 make_eh_edge (copy_stmt
);
2619 update_probs
= true;
2622 /* EH edges may not match old edges. Copy as much as possible. */
2627 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2629 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2630 if ((old_edge
->flags
& EDGE_EH
)
2631 && (e
= find_edge (copy_stmt_bb
,
2632 (basic_block
) old_edge
->dest
->aux
))
2633 && (e
->flags
& EDGE_EH
))
2634 e
->probability
= old_edge
->probability
;
2636 FOR_EACH_EDGE (e
, ei
, copy_stmt_bb
->succs
)
2637 if (e
->flags
& EDGE_EH
)
2639 if (!e
->probability
.initialized_p ())
2640 e
->probability
= profile_probability::never ();
2641 if (e
->dest
->index
< id
->add_clobbers_to_eh_landing_pads
)
2643 if (id
->eh_landing_pad_dest
== NULL
)
2644 id
->eh_landing_pad_dest
= e
->dest
;
2646 gcc_assert (id
->eh_landing_pad_dest
== e
->dest
);
2652 /* If the call we inline cannot make abnormal goto do not add
2653 additional abnormal edges but only retain those already present
2654 in the original function body. */
2655 if (abnormal_goto_dest
== NULL
)
2656 nonlocal_goto
= false;
2659 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2661 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2662 nonlocal_goto
= false;
2663 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2664 in OpenMP regions which aren't allowed to be left abnormally.
2665 So, no need to add abnormal edge in that case. */
2666 else if (is_gimple_call (copy_stmt
)
2667 && gimple_call_internal_p (copy_stmt
)
2668 && (gimple_call_internal_fn (copy_stmt
)
2669 == IFN_ABNORMAL_DISPATCHER
)
2670 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2671 nonlocal_goto
= false;
2673 make_single_succ_edge (copy_stmt_bb
, abnormal_goto_dest
,
2677 if ((can_throw
|| nonlocal_goto
)
2678 && gimple_in_ssa_p (cfun
))
2679 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2680 can_throw
, nonlocal_goto
);
2682 return need_debug_cleanup
;
2685 /* Copy the PHIs. All blocks and edges are copied, some blocks
2686 was possibly split and new outgoing EH edges inserted.
2687 BB points to the block of original function and AUX pointers links
2688 the original and newly copied blocks. */
2691 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2693 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2698 bool inserted
= false;
2700 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2706 res
= PHI_RESULT (phi
);
2708 if (!virtual_operand_p (res
)
2709 && (!id
->param_body_adjs
2710 || !id
->param_body_adjs
->m_dead_stmts
.contains (phi
)))
2712 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2713 if (EDGE_COUNT (new_bb
->preds
) == 0)
2715 /* Technically we'd want a SSA_DEFAULT_DEF here... */
2716 SSA_NAME_DEF_STMT (new_res
) = gimple_build_nop ();
2720 new_phi
= create_phi_node (new_res
, new_bb
);
2721 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2723 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
,
2730 /* When doing partial cloning, we allow PHIs on the entry
2731 block as long as all the arguments are the same.
2732 Find any input edge to see argument to copy. */
2734 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2735 if (!old_edge
->src
->aux
)
2738 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2740 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2741 gcc_assert (new_arg
);
2742 /* With return slot optimization we can end up with
2743 non-gimple (foo *)&this->m, fix that here. */
2744 if (TREE_CODE (new_arg
) != SSA_NAME
2745 && TREE_CODE (new_arg
) != FUNCTION_DECL
2746 && !is_gimple_val (new_arg
))
2748 gimple_seq stmts
= NULL
;
2749 new_arg
= force_gimple_operand (new_arg
, &stmts
, true,
2751 gsi_insert_seq_on_edge (new_edge
, stmts
);
2754 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2755 if (id
->reset_location
)
2756 locus
= input_location
;
2758 locus
= remap_location (locus
, id
);
2759 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2765 /* Commit the delayed edge insertions. */
2767 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2768 gsi_commit_one_edge_insert (new_edge
, NULL
);
2772 /* Wrapper for remap_decl so it can be used as a callback. */
2775 remap_decl_1 (tree decl
, void *data
)
2777 return remap_decl (decl
, (copy_body_data
*) data
);
2780 /* Build struct function and associated datastructures for the new clone
2781 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2782 the cfun to the function of new_fndecl (and current_function_decl too). */
2785 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, profile_count count
)
2787 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2789 /* Register specific tree functions. */
2790 gimple_register_cfg_hooks ();
2792 /* Get clean struct function. */
2793 push_struct_function (new_fndecl
, true);
2794 targetm
.target_option
.relayout_function (new_fndecl
);
2796 /* We will rebuild these, so just sanity check that they are empty. */
2797 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2798 gcc_assert (cfun
->local_decls
== NULL
);
2799 gcc_assert (cfun
->cfg
== NULL
);
2800 gcc_assert (cfun
->decl
== new_fndecl
);
2802 /* Copy items we preserve during cloning. */
2803 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2804 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2805 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2806 cfun
->curr_properties
= src_cfun
->curr_properties
;
2807 cfun
->last_verified
= src_cfun
->last_verified
;
2808 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2809 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2810 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2811 cfun
->calls_eh_return
= src_cfun
->calls_eh_return
;
2812 cfun
->stdarg
= src_cfun
->stdarg
;
2813 cfun
->after_inlining
= src_cfun
->after_inlining
;
2814 cfun
->can_throw_non_call_exceptions
2815 = src_cfun
->can_throw_non_call_exceptions
;
2816 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2817 cfun
->returns_struct
= src_cfun
->returns_struct
;
2818 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2820 init_empty_tree_cfg ();
2822 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2823 cfun
->cfg
->full_profile
= src_cfun
->cfg
->full_profile
;
2825 profile_count num
= count
;
2826 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2827 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2829 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2830 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2831 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2832 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2833 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2834 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2836 init_eh_for_function ();
2838 if (src_cfun
->gimple_df
)
2840 init_tree_ssa (cfun
);
2841 cfun
->gimple_df
->in_ssa_p
= src_cfun
->gimple_df
->in_ssa_p
;
2842 if (cfun
->gimple_df
->in_ssa_p
)
2843 init_ssa_operands (cfun
);
2847 /* Helper function for copy_cfg_body. Move debug stmts from the end
2848 of NEW_BB to the beginning of successor basic blocks when needed. If the
2849 successor has multiple predecessors, reset them, otherwise keep
2853 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2857 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2860 || gsi_one_before_end_p (si
)
2861 || !(stmt_can_throw_internal (cfun
, gsi_stmt (si
))
2862 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2865 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2867 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2868 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2869 while (is_gimple_debug (gsi_stmt (ssi
)))
2871 gimple
*stmt
= gsi_stmt (ssi
);
2876 /* For the last edge move the debug stmts instead of copying
2878 if (ei_one_before_end_p (ei
))
2882 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2884 gimple_debug_bind_reset_value (stmt
);
2885 gimple_set_location (stmt
, UNKNOWN_LOCATION
);
2887 gsi_remove (&si
, false);
2888 gsi_insert_before (&dsi
, stmt
, GSI_NEW_STMT
);
2892 if (gimple_debug_bind_p (stmt
))
2894 var
= gimple_debug_bind_get_var (stmt
);
2895 if (single_pred_p (e
->dest
))
2897 value
= gimple_debug_bind_get_value (stmt
);
2898 value
= unshare_expr (value
);
2899 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2902 new_stmt
= gimple_build_debug_bind (var
, NULL_TREE
, NULL
);
2904 else if (gimple_debug_source_bind_p (stmt
))
2906 var
= gimple_debug_source_bind_get_var (stmt
);
2907 value
= gimple_debug_source_bind_get_value (stmt
);
2908 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2910 else if (gimple_debug_nonbind_marker_p (stmt
))
2911 new_stmt
= as_a
<gdebug
*> (gimple_copy (stmt
));
2914 gsi_insert_before (&dsi
, new_stmt
, GSI_NEW_STMT
);
2915 id
->debug_stmts
.safe_push (new_stmt
);
2921 /* Make a copy of the sub-loops of SRC_PARENT and place them
2922 as siblings of DEST_PARENT. */
2925 copy_loops (copy_body_data
*id
,
2926 class loop
*dest_parent
, class loop
*src_parent
)
2928 class loop
*src_loop
= src_parent
->inner
;
2931 if (!id
->blocks_to_copy
2932 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2934 class loop
*dest_loop
= alloc_loop ();
2936 /* Assign the new loop its header and latch and associate
2937 those with the new loop. */
2938 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2939 dest_loop
->header
->loop_father
= dest_loop
;
2940 if (src_loop
->latch
!= NULL
)
2942 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2943 dest_loop
->latch
->loop_father
= dest_loop
;
2946 /* Copy loop meta-data. */
2947 copy_loop_info (src_loop
, dest_loop
);
2948 if (dest_loop
->unroll
)
2949 cfun
->has_unroll
= true;
2950 if (dest_loop
->force_vectorize
)
2951 cfun
->has_force_vectorize_loops
= true;
2952 if (id
->src_cfun
->last_clique
!= 0)
2953 dest_loop
->owned_clique
2954 = remap_dependence_clique (id
,
2955 src_loop
->owned_clique
2956 ? src_loop
->owned_clique
: 1);
2958 /* Finally place it into the loop array and the loop tree. */
2959 place_new_loop (cfun
, dest_loop
);
2960 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2962 if (src_loop
->simduid
)
2964 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2965 cfun
->has_simduid_loops
= true;
2969 copy_loops (id
, dest_loop
, src_loop
);
2971 src_loop
= src_loop
->next
;
2975 /* Call redirect_call_stmt_to_callee on all calls in BB. */
2978 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2980 gimple_stmt_iterator si
;
2981 gimple
*last
= last_nondebug_stmt (bb
);
2982 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2984 gimple
*stmt
= gsi_stmt (si
);
2985 if (is_gimple_call (stmt
))
2987 tree old_lhs
= gimple_call_lhs (stmt
);
2988 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2992 = cgraph_edge::redirect_call_stmt_to_callee (edge
);
2993 /* If IPA-SRA transformation, run as part of edge redirection,
2994 removed the LHS because it is unused, save it to
2995 killed_new_ssa_names so that we can prune it from debug
2998 && TREE_CODE (old_lhs
) == SSA_NAME
2999 && !gimple_call_lhs (new_stmt
))
3001 if (!id
->killed_new_ssa_names
)
3002 id
->killed_new_ssa_names
= new hash_set
<tree
> (16);
3003 id
->killed_new_ssa_names
->add (old_lhs
);
3006 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
3007 gimple_purge_dead_eh_edges (bb
);
3013 /* Make a copy of the body of FN so that it can be inserted inline in
3014 another function. Walks FN via CFG, returns new fndecl. */
3017 copy_cfg_body (copy_body_data
* id
,
3018 basic_block entry_block_map
, basic_block exit_block_map
,
3019 basic_block new_entry
)
3021 tree callee_fndecl
= id
->src_fn
;
3022 /* Original cfun for the callee, doesn't change. */
3023 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
3024 struct function
*cfun_to_copy
;
3026 tree new_fndecl
= NULL
;
3027 bool need_debug_cleanup
= false;
3029 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
3030 profile_count num
= entry_block_map
->count
;
3032 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
3034 /* Register specific tree functions. */
3035 gimple_register_cfg_hooks ();
3037 /* If we are inlining just region of the function, make sure to connect
3038 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
3039 part of loop, we must compute frequency and probability of
3040 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
3041 probabilities of edges incoming from nonduplicated region. */
3046 den
= profile_count::zero ();
3048 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
3051 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= den
;
3054 profile_count::adjust_for_ipa_scaling (&num
, &den
);
3056 /* Must have a CFG here at this point. */
3057 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
3058 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
3061 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
3062 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
3063 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
3064 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
3066 /* Duplicate any exception-handling regions. */
3068 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
3071 /* Use aux pointers to map the original blocks to copy. */
3072 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
3073 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
3075 basic_block new_bb
= copy_bb (id
, bb
, num
, den
);
3078 new_bb
->loop_father
= entry_block_map
->loop_father
;
3081 last
= last_basic_block_for_fn (cfun
);
3083 /* Now that we've duplicated the blocks, duplicate their edges. */
3084 basic_block abnormal_goto_dest
= NULL
;
3086 && stmt_can_make_abnormal_goto (id
->call_stmt
))
3088 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
3090 bb
= gimple_bb (id
->call_stmt
);
3092 if (gsi_end_p (gsi
))
3093 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
3095 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3096 if (!id
->blocks_to_copy
3097 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
3098 need_debug_cleanup
|= copy_edges_for_bb (bb
, num
, den
, exit_block_map
,
3099 abnormal_goto_dest
, id
);
3101 if (id
->eh_landing_pad_dest
)
3103 add_clobbers_to_eh_landing_pad (id
);
3104 id
->eh_landing_pad_dest
= NULL
;
3109 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
,
3111 e
->probability
= profile_probability::always ();
3114 /* Duplicate the loop tree, if available and wanted. */
3115 if (loops_for_fn (src_cfun
) != NULL
3116 && current_loops
!= NULL
)
3118 copy_loops (id
, entry_block_map
->loop_father
,
3119 get_loop (src_cfun
, 0));
3120 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
3121 loops_state_set (LOOPS_NEED_FIXUP
);
3124 /* If the loop tree in the source function needed fixup, mark the
3125 destination loop tree for fixup, too. */
3126 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
3127 loops_state_set (LOOPS_NEED_FIXUP
);
3129 if (gimple_in_ssa_p (cfun
))
3130 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3131 if (!id
->blocks_to_copy
3132 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
3133 copy_phis_for_bb (bb
, id
);
3135 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3138 if (need_debug_cleanup
3139 && bb
->index
!= ENTRY_BLOCK
3140 && bb
->index
!= EXIT_BLOCK
)
3141 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
3142 /* Update call edge destinations. This cannot be done before loop
3143 info is updated, because we may split basic blocks. */
3144 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
3145 && bb
->index
!= ENTRY_BLOCK
3146 && bb
->index
!= EXIT_BLOCK
)
3147 redirect_all_calls (id
, (basic_block
)bb
->aux
);
3148 ((basic_block
)bb
->aux
)->aux
= NULL
;
3152 /* Zero out AUX fields of newly created block during EH edge
3154 for (; last
< last_basic_block_for_fn (cfun
); last
++)
3156 if (need_debug_cleanup
)
3157 maybe_move_debug_stmts_to_successors (id
,
3158 BASIC_BLOCK_FOR_FN (cfun
, last
));
3159 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
3160 /* Update call edge destinations. This cannot be done before loop
3161 info is updated, because we may split basic blocks. */
3162 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
3163 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
3165 entry_block_map
->aux
= NULL
;
3166 exit_block_map
->aux
= NULL
;
3173 if (id
->dependence_map
)
3175 delete id
->dependence_map
;
3176 id
->dependence_map
= NULL
;
3182 /* Copy the debug STMT using ID. We deal with these statements in a
3183 special way: if any variable in their VALUE expression wasn't
3184 remapped yet, we won't remap it, because that would get decl uids
3185 out of sync, causing codegen differences between -g and -g0. If
3186 this arises, we drop the VALUE expression altogether. */
3189 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
3192 struct walk_stmt_info wi
;
3194 if (tree block
= gimple_block (stmt
))
3196 n
= id
->decl_map
->get (block
);
3197 gimple_set_block (stmt
, n
? *n
: id
->block
);
3200 if (gimple_debug_nonbind_marker_p (stmt
))
3202 if (id
->call_stmt
&& !gimple_block (stmt
))
3204 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
3205 gsi_remove (&gsi
, true);
3210 /* Remap all the operands in COPY. */
3211 memset (&wi
, 0, sizeof (wi
));
3214 processing_debug_stmt
= 1;
3216 if (gimple_debug_source_bind_p (stmt
))
3217 t
= gimple_debug_source_bind_get_var (stmt
);
3218 else if (gimple_debug_bind_p (stmt
))
3219 t
= gimple_debug_bind_get_var (stmt
);
3223 if (TREE_CODE (t
) == PARM_DECL
3225 && (n
= id
->debug_map
->get (t
)))
3227 gcc_assert (VAR_P (*n
));
3230 else if (VAR_P (t
) && !is_global_var (t
) && !id
->decl_map
->get (t
))
3231 /* T is a non-localized variable. */;
3233 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
3235 if (gimple_debug_bind_p (stmt
))
3237 gimple_debug_bind_set_var (stmt
, t
);
3239 if (gimple_debug_bind_has_value_p (stmt
))
3240 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
3241 remap_gimple_op_r
, &wi
, NULL
);
3243 /* Punt if any decl couldn't be remapped. */
3244 if (processing_debug_stmt
< 0)
3245 gimple_debug_bind_reset_value (stmt
);
3247 else if (gimple_debug_source_bind_p (stmt
))
3249 gimple_debug_source_bind_set_var (stmt
, t
);
3250 /* When inlining and source bind refers to one of the optimized
3251 away parameters, change the source bind into normal debug bind
3252 referring to the corresponding DEBUG_EXPR_DECL that should have
3253 been bound before the call stmt. */
3254 t
= gimple_debug_source_bind_get_value (stmt
);
3256 && TREE_CODE (t
) == PARM_DECL
3259 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
3261 if (debug_args
!= NULL
)
3263 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
3264 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
3265 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
3267 t
= (**debug_args
)[i
+ 1];
3268 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
3269 gimple_debug_bind_set_value (stmt
, t
);
3274 if (gimple_debug_source_bind_p (stmt
))
3275 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
3276 remap_gimple_op_r
, &wi
, NULL
);
3279 processing_debug_stmt
= 0;
3284 /* Process deferred debug stmts. In order to give values better odds
3285 of being successfully remapped, we delay the processing of debug
3286 stmts until all other stmts that might require remapping are
3290 copy_debug_stmts (copy_body_data
*id
)
3292 if (!id
->debug_stmts
.exists ())
3295 for (gdebug
*stmt
: id
->debug_stmts
)
3296 copy_debug_stmt (stmt
, id
);
3298 id
->debug_stmts
.release ();
3301 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
3302 another function. */
3305 copy_tree_body (copy_body_data
*id
)
3307 tree fndecl
= id
->src_fn
;
3308 tree body
= DECL_SAVED_TREE (fndecl
);
3310 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
3315 /* Make a copy of the body of FN so that it can be inserted inline in
3316 another function. */
3319 copy_body (copy_body_data
*id
,
3320 basic_block entry_block_map
, basic_block exit_block_map
,
3321 basic_block new_entry
)
3323 tree fndecl
= id
->src_fn
;
3326 /* If this body has a CFG, walk CFG and copy. */
3327 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
3328 body
= copy_cfg_body (id
, entry_block_map
, exit_block_map
,
3330 copy_debug_stmts (id
);
3331 delete id
->killed_new_ssa_names
;
3332 id
->killed_new_ssa_names
= NULL
;
3337 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
3338 defined in function FN, or of a data member thereof. */
3341 self_inlining_addr_expr (tree value
, tree fn
)
3345 if (TREE_CODE (value
) != ADDR_EXPR
)
3348 var
= get_base_address (TREE_OPERAND (value
, 0));
3350 return var
&& auto_var_in_fn_p (var
, fn
);
3353 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
3354 lexical block and line number information from base_stmt, if given,
3355 or from the last stmt of the block otherwise. */
3358 insert_init_debug_bind (copy_body_data
*id
,
3359 basic_block bb
, tree var
, tree value
,
3363 gimple_stmt_iterator gsi
;
3366 if (!gimple_in_ssa_p (id
->src_cfun
))
3369 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
3372 tracked_var
= target_for_debug_bind (var
);
3378 gsi
= gsi_last_bb (bb
);
3379 if (!base_stmt
&& !gsi_end_p (gsi
))
3380 base_stmt
= gsi_stmt (gsi
);
3383 note
= gimple_build_debug_bind (tracked_var
,
3384 value
== error_mark_node
3385 ? NULL_TREE
: unshare_expr (value
),
3390 if (!gsi_end_p (gsi
))
3391 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
3393 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3400 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple
*init_stmt
)
3402 /* If VAR represents a zero-sized variable, it's possible that the
3403 assignment statement may result in no gimple statements. */
3406 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3408 /* We can end up with init statements that store to a non-register
3409 from a rhs with a conversion. Handle that here by forcing the
3410 rhs into a temporary. gimple_regimplify_operands is not
3411 prepared to do this for us. */
3412 if (!is_gimple_debug (init_stmt
)
3413 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3414 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3415 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3417 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3418 TREE_TYPE (gimple_assign_lhs (init_stmt
)),
3419 gimple_assign_rhs1 (init_stmt
));
3420 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3422 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3423 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3425 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3426 if (!is_gimple_debug (init_stmt
))
3428 gimple_regimplify_operands (init_stmt
, &si
);
3430 tree def
= gimple_assign_lhs (init_stmt
);
3431 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3436 /* Deal with mismatched formal/actual parameters, in a rather brute-force way
3437 if need be (which should only be necessary for invalid programs). Attempt
3438 to convert VAL to TYPE and return the result if it is possible, just return
3439 a zero constant of the given type if it fails. */
3442 force_value_to_type (tree type
, tree value
)
3444 /* If we can match up types by promotion/demotion do so. */
3445 if (fold_convertible_p (type
, value
))
3446 return fold_convert (type
, value
);
3448 /* ??? For valid programs we should not end up here.
3449 Still if we end up with truly mismatched types here, fall back
3450 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3451 GIMPLE to the following passes. */
3452 if (TREE_CODE (value
) == WITH_SIZE_EXPR
)
3453 return error_mark_node
;
3454 else if (!is_gimple_reg_type (TREE_TYPE (value
))
3455 || TYPE_SIZE (type
) == TYPE_SIZE (TREE_TYPE (value
)))
3456 return fold_build1 (VIEW_CONVERT_EXPR
, type
, value
);
3458 return build_zero_cst (type
);
3461 /* Initialize parameter P with VALUE. If needed, produce init statement
3462 at the end of BB. When BB is NULL, we return init statement to be
3465 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3466 basic_block bb
, tree
*vars
)
3468 gimple
*init_stmt
= NULL
;
3470 tree def
= (gimple_in_ssa_p (cfun
)
3471 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3473 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3474 here since the type of this decl must be visible to the calling
3476 var
= copy_decl_to_var (p
, id
);
3478 /* Declare this new variable. */
3479 DECL_CHAIN (var
) = *vars
;
3482 /* Make gimplifier happy about this variable. */
3483 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3485 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3486 we would not need to create a new variable here at all, if it
3487 weren't for debug info. Still, we can just use the argument
3489 if (TREE_READONLY (p
)
3490 && !TREE_ADDRESSABLE (p
)
3492 && !TREE_SIDE_EFFECTS (value
)
3495 /* We may produce non-gimple trees by adding NOPs or introduce invalid
3496 sharing when the value is not constant or DECL. And we need to make
3497 sure that it cannot be modified from another path in the callee. */
3498 if (((is_gimple_min_invariant (value
)
3499 /* When the parameter is used in a context that forces it to
3500 not be a GIMPLE register avoid substituting something that
3501 is not a decl there. */
3502 && ! DECL_NOT_GIMPLE_REG_P (p
))
3503 || (DECL_P (value
) && TREE_READONLY (value
))
3504 || (auto_var_in_fn_p (value
, id
->dst_fn
)
3505 && !TREE_ADDRESSABLE (value
)))
3506 && useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
))
3507 /* We have to be very careful about ADDR_EXPR. Make sure
3508 the base variable isn't a local variable of the inlined
3509 function, e.g., when doing recursive inlining, direct or
3510 mutually-recursive or whatever, which is why we don't
3511 just test whether fn == current_function_decl. */
3512 && ! self_inlining_addr_expr (value
, fn
))
3514 insert_decl_map (id
, p
, value
);
3516 id
->debug_map
= new hash_map
<tree
, tree
>;
3517 id
->debug_map
->put (p
, var
);
3518 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3522 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3523 that way, when the PARM_DECL is encountered, it will be
3524 automatically replaced by the VAR_DECL. */
3525 insert_decl_map (id
, p
, var
);
3527 /* Even if P was TREE_READONLY, the new VAR should not be. In the original
3528 code, we would have constructed a temporary, and then the function body
3529 would have never changed the value of P. However, now, we will be
3530 constructing VAR directly. Therefore, it must not be TREE_READONLY. */
3531 TREE_READONLY (var
) = 0;
3535 && value
!= error_mark_node
3536 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3537 rhs
= force_value_to_type (TREE_TYPE (p
), value
);
3539 /* If there is no setup required and we are in SSA, take the easy route
3540 replacing all SSA names representing the function parameter by the
3541 SSA name passed to function.
3543 We need to construct map for the variable anyway as it might be used
3544 in different SSA names when parameter is set in function.
3546 Do replacement at -O0 for const arguments replaced by constant.
3547 This is important for builtin_constant_p and other construct requiring
3548 constant argument to be visible in inlined function body. */
3549 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3551 || (TREE_READONLY (p
)
3552 && is_gimple_min_invariant (rhs
)))
3553 && (TREE_CODE (rhs
) == SSA_NAME
3554 || is_gimple_min_invariant (rhs
))
3555 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3557 insert_decl_map (id
, def
, rhs
);
3558 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3561 /* If the value of argument is never used, don't care about initializing
3563 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3565 /* When there's a gross type mismatch between the passed value
3566 and the declared argument type drop it on the floor and do
3567 not bother to insert a debug bind. */
3568 if (value
&& !is_gimple_reg_type (TREE_TYPE (value
)))
3570 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3573 /* Initialize this VAR_DECL from the equivalent argument. Convert
3574 the argument to the proper type in case it was promoted. */
3577 if (rhs
== error_mark_node
)
3579 insert_decl_map (id
, p
, var
);
3580 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3583 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3585 /* If we are in SSA form properly remap the default definition. */
3586 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3590 def
= remap_ssa_name (def
, id
);
3591 init_stmt
= gimple_build_assign (def
, rhs
);
3592 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3593 set_ssa_default_def (cfun
, var
, NULL
);
3596 else if (!is_empty_type (TREE_TYPE (var
)))
3597 init_stmt
= gimple_build_assign (var
, rhs
);
3599 if (bb
&& init_stmt
)
3600 insert_init_stmt (id
, bb
, init_stmt
);
3605 /* Generate code to initialize the parameters of the function at the
3606 top of the stack in ID from the GIMPLE_CALL STMT. */
3609 initialize_inlined_parameters (copy_body_data
*id
, gimple
*stmt
,
3610 tree fn
, basic_block bb
)
3615 tree vars
= NULL_TREE
;
3616 tree static_chain
= gimple_call_chain (stmt
);
3618 /* Figure out what the parameters are. */
3619 parms
= DECL_ARGUMENTS (fn
);
3621 /* Loop through the parameter declarations, replacing each with an
3622 equivalent VAR_DECL, appropriately initialized. */
3623 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3626 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3627 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3629 /* After remapping parameters remap their types. This has to be done
3630 in a second loop over all parameters to appropriately remap
3631 variable sized arrays when the size is specified in a
3632 parameter following the array. */
3633 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3635 tree
*varp
= id
->decl_map
->get (p
);
3636 if (varp
&& VAR_P (*varp
))
3638 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3639 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3641 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3642 /* Also remap the default definition if it was remapped
3643 to the default definition of the parameter replacement
3644 by the parameter setup. */
3647 tree
*defp
= id
->decl_map
->get (def
);
3649 && TREE_CODE (*defp
) == SSA_NAME
3650 && SSA_NAME_VAR (*defp
) == var
)
3651 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3653 /* When not optimizing and the parameter is unused, assign to
3654 a dummy SSA name. Do this after remapping the type above. */
3656 && is_gimple_reg (p
)
3657 && i
< gimple_call_num_args (stmt
))
3659 tree val
= gimple_call_arg (stmt
, i
);
3660 if (val
!= error_mark_node
)
3662 if (!useless_type_conversion_p (TREE_TYPE (p
),
3664 val
= force_value_to_type (TREE_TYPE (p
), val
);
3665 def
= make_ssa_name (var
);
3666 gimple
*init_stmt
= gimple_build_assign (def
, val
);
3667 insert_init_stmt (id
, bb
, init_stmt
);
3673 /* Initialize the static chain. */
3674 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3675 gcc_assert (fn
!= current_function_decl
);
3678 /* No static chain? Seems like a bug in tree-nested.cc. */
3679 gcc_assert (static_chain
);
3681 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3684 declare_inline_vars (id
->block
, vars
);
3688 /* Declare a return variable to replace the RESULT_DECL for the
3689 function we are calling. An appropriate DECL_STMT is returned.
3690 The USE_STMT is filled to contain a use of the declaration to
3691 indicate the return value of the function.
3693 RETURN_SLOT, if non-null is place where to store the result. It
3694 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3695 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3697 The return value is a (possibly null) value that holds the result
3698 as seen by the caller. */
3701 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3702 basic_block entry_bb
)
3704 tree callee
= id
->src_fn
;
3705 tree result
= DECL_RESULT (callee
);
3706 tree callee_type
= TREE_TYPE (result
);
3710 /* Handle type-mismatches in the function declaration return type
3711 vs. the call expression. */
3713 caller_type
= TREE_TYPE (modify_dest
);
3714 else if (return_slot
)
3715 caller_type
= TREE_TYPE (return_slot
);
3716 else /* No LHS on the call. */
3717 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3719 /* We don't need to do anything for functions that don't return anything. */
3720 if (VOID_TYPE_P (callee_type
))
3723 /* If there was a return slot, then the return value is the
3724 dereferenced address of that object. */
3727 /* The front end shouldn't have used both return_slot and
3728 a modify expression. */
3729 gcc_assert (!modify_dest
);
3730 if (DECL_BY_REFERENCE (result
))
3732 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3733 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3735 /* We are going to construct *&return_slot and we can't do that
3736 for variables believed to be not addressable.
3738 FIXME: This check possibly can match, because values returned
3739 via return slot optimization are not believed to have address
3740 taken by alias analysis. */
3741 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3742 var
= return_slot_addr
;
3743 mark_addressable (return_slot
);
3748 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3749 if (TREE_ADDRESSABLE (result
))
3750 mark_addressable (var
);
3752 if (DECL_NOT_GIMPLE_REG_P (result
)
3754 DECL_NOT_GIMPLE_REG_P (var
) = 1;
3756 if (!useless_type_conversion_p (callee_type
, caller_type
))
3757 var
= build1 (VIEW_CONVERT_EXPR
, callee_type
, var
);
3763 /* All types requiring non-trivial constructors should have been handled. */
3764 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3766 /* Attempt to avoid creating a new temporary variable. */
3768 && TREE_CODE (modify_dest
) != SSA_NAME
)
3770 bool use_it
= false;
3772 /* We can't use MODIFY_DEST if there's type promotion involved. */
3773 if (!useless_type_conversion_p (callee_type
, caller_type
))
3776 /* ??? If we're assigning to a variable sized type, then we must
3777 reuse the destination variable, because we've no good way to
3778 create variable sized temporaries at this point. */
3779 else if (!poly_int_tree_p (TYPE_SIZE_UNIT (caller_type
)))
3782 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3783 reuse it as the result of the call directly. Don't do this if
3784 it would promote MODIFY_DEST to addressable. */
3785 else if (TREE_ADDRESSABLE (result
))
3789 tree base_m
= get_base_address (modify_dest
);
3791 /* If the base isn't a decl, then it's a pointer, and we don't
3792 know where that's going to go. */
3793 if (!DECL_P (base_m
))
3795 else if (is_global_var (base_m
))
3797 else if (DECL_NOT_GIMPLE_REG_P (result
)
3798 && !DECL_NOT_GIMPLE_REG_P (base_m
))
3800 else if (!TREE_ADDRESSABLE (base_m
))
3812 gcc_assert (poly_int_tree_p (TYPE_SIZE_UNIT (callee_type
)));
3814 var
= copy_result_decl_to_var (result
, id
);
3815 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3817 /* Do not have the rest of GCC warn about this variable as it should
3818 not be visible to the user. */
3819 suppress_warning (var
/* OPT_Wuninitialized? */);
3821 declare_inline_vars (id
->block
, var
);
3823 /* Build the use expr. If the return type of the function was
3824 promoted, convert it back to the expected type. */
3826 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3828 /* If we can match up types by promotion/demotion do so. */
3829 if (fold_convertible_p (caller_type
, var
))
3830 use
= fold_convert (caller_type
, var
);
3833 /* ??? For valid programs we should not end up here.
3834 Still if we end up with truly mismatched types here, fall back
3835 to using a MEM_REF to not leak invalid GIMPLE to the following
3837 /* Prevent var from being written into SSA form. */
3838 if (is_gimple_reg_type (TREE_TYPE (var
)))
3839 DECL_NOT_GIMPLE_REG_P (var
) = true;
3840 use
= fold_build2 (MEM_REF
, caller_type
,
3841 build_fold_addr_expr (var
),
3842 build_int_cst (ptr_type_node
, 0));
3846 STRIP_USELESS_TYPE_CONVERSION (use
);
3848 if (DECL_BY_REFERENCE (result
))
3850 TREE_ADDRESSABLE (var
) = 1;
3851 var
= build_fold_addr_expr (var
);
3855 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3856 way, when the RESULT_DECL is encountered, it will be
3857 automatically replaced by the VAR_DECL.
3859 When returning by reference, ensure that RESULT_DECL remaps to
3861 if (DECL_BY_REFERENCE (result
)
3862 && !is_gimple_val (var
))
3864 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3865 insert_decl_map (id
, result
, temp
);
3866 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3867 it's default_def SSA_NAME. */
3868 if (gimple_in_ssa_p (id
->src_cfun
)
3869 && is_gimple_reg (result
))
3870 if (tree default_def
= ssa_default_def (id
->src_cfun
, result
))
3872 temp
= make_ssa_name (temp
);
3873 insert_decl_map (id
, default_def
, temp
);
3875 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3878 insert_decl_map (id
, result
, var
);
3880 /* Remember this so we can ignore it in remap_decls. */
3885 /* Determine if the function can be copied. If so return NULL. If
3886 not return a string describng the reason for failure. */
3889 copy_forbidden (struct function
*fun
)
3891 const char *reason
= fun
->cannot_be_copied_reason
;
3893 /* Only examine the function once. */
3894 if (fun
->cannot_be_copied_set
)
3897 /* We cannot copy a function that receives a non-local goto
3898 because we cannot remap the destination label used in the
3899 function that is performing the non-local goto. */
3900 /* ??? Actually, this should be possible, if we work at it.
3901 No doubt there's just a handful of places that simply
3902 assume it doesn't happen and don't substitute properly. */
3903 if (fun
->has_nonlocal_label
)
3905 reason
= G_("function %q+F can never be copied "
3906 "because it receives a non-local goto");
3910 if (fun
->has_forced_label_in_static
)
3912 reason
= G_("function %q+F can never be copied because it saves "
3913 "address of local label in a static variable");
3918 fun
->cannot_be_copied_reason
= reason
;
3919 fun
->cannot_be_copied_set
= true;
3924 static const char *inline_forbidden_reason
;
3926 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3927 iff a function cannot be inlined. Also sets the reason why. */
3930 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3931 struct walk_stmt_info
*wip
)
3933 tree fn
= (tree
) wip
->info
;
3935 gimple
*stmt
= gsi_stmt (*gsi
);
3937 switch (gimple_code (stmt
))
3940 /* Refuse to inline alloca call unless user explicitly forced so as
3941 this may change program's memory overhead drastically when the
3942 function using alloca is called in loop. In GCC present in
3943 SPEC2000 inlining into schedule_block cause it to require 2GB of
3944 RAM instead of 256MB. Don't do so for alloca calls emitted for
3945 VLA objects as those can't cause unbounded growth (they're always
3946 wrapped inside stack_save/stack_restore regions. */
3947 if (gimple_maybe_alloca_call_p (stmt
)
3948 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3949 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3951 inline_forbidden_reason
3952 = G_("function %q+F can never be inlined because it uses "
3953 "alloca (override using the always_inline attribute)");
3954 *handled_ops_p
= true;
3958 t
= gimple_call_fndecl (stmt
);
3962 /* We cannot inline functions that call setjmp. */
3963 if (setjmp_call_p (t
))
3965 inline_forbidden_reason
3966 = G_("function %q+F can never be inlined because it uses setjmp");
3967 *handled_ops_p
= true;
3971 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3972 switch (DECL_FUNCTION_CODE (t
))
3974 /* We cannot inline functions that take a variable number of
3976 case BUILT_IN_VA_START
:
3977 case BUILT_IN_NEXT_ARG
:
3978 case BUILT_IN_VA_END
:
3979 inline_forbidden_reason
3980 = G_("function %q+F can never be inlined because it "
3981 "uses variable argument lists");
3982 *handled_ops_p
= true;
3985 case BUILT_IN_LONGJMP
:
3986 /* We can't inline functions that call __builtin_longjmp at
3987 all. The non-local goto machinery really requires the
3988 destination be in a different function. If we allow the
3989 function calling __builtin_longjmp to be inlined into the
3990 function calling __builtin_setjmp, Things will Go Awry. */
3991 inline_forbidden_reason
3992 = G_("function %q+F can never be inlined because "
3993 "it uses setjmp-longjmp exception handling");
3994 *handled_ops_p
= true;
3997 case BUILT_IN_NONLOCAL_GOTO
:
3999 inline_forbidden_reason
4000 = G_("function %q+F can never be inlined because "
4001 "it uses non-local goto");
4002 *handled_ops_p
= true;
4005 case BUILT_IN_RETURN
:
4006 case BUILT_IN_APPLY_ARGS
:
4007 /* If a __builtin_apply_args caller would be inlined,
4008 it would be saving arguments of the function it has
4009 been inlined into. Similarly __builtin_return would
4010 return from the function the inline has been inlined into. */
4011 inline_forbidden_reason
4012 = G_("function %q+F can never be inlined because "
4013 "it uses %<__builtin_return%> or %<__builtin_apply_args%>");
4014 *handled_ops_p
= true;
4023 t
= gimple_goto_dest (stmt
);
4025 /* We will not inline a function which uses computed goto. The
4026 addresses of its local labels, which may be tucked into
4027 global storage, are of course not constant across
4028 instantiations, which causes unexpected behavior. */
4029 if (TREE_CODE (t
) != LABEL_DECL
)
4031 inline_forbidden_reason
4032 = G_("function %q+F can never be inlined "
4033 "because it contains a computed goto");
4034 *handled_ops_p
= true;
4043 *handled_ops_p
= false;
4047 /* Return true if FNDECL is a function that cannot be inlined into
4051 inline_forbidden_p (tree fndecl
)
4053 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
4054 struct walk_stmt_info wi
;
4056 bool forbidden_p
= false;
4058 /* First check for shared reasons not to copy the code. */
4059 inline_forbidden_reason
= copy_forbidden (fun
);
4060 if (inline_forbidden_reason
!= NULL
)
4063 /* Next, walk the statements of the function looking for
4064 constraucts we can't handle, or are non-optimal for inlining. */
4065 hash_set
<tree
> visited_nodes
;
4066 memset (&wi
, 0, sizeof (wi
));
4067 wi
.info
= (void *) fndecl
;
4068 wi
.pset
= &visited_nodes
;
4070 /* We cannot inline a function with a variable-sized parameter because we
4071 cannot materialize a temporary of such a type in the caller if need be.
4072 Note that the return case is not symmetrical because we can guarantee
4073 that a temporary is not needed by means of CALL_EXPR_RETURN_SLOT_OPT. */
4074 for (tree parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= DECL_CHAIN (parm
))
4075 if (!poly_int_tree_p (DECL_SIZE (parm
)))
4077 inline_forbidden_reason
4078 = G_("function %q+F can never be inlined because "
4079 "it has a VLA argument");
4083 FOR_EACH_BB_FN (bb
, fun
)
4086 gimple_seq seq
= bb_seq (bb
);
4087 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
4088 forbidden_p
= (ret
!= NULL
);
4096 /* Return false if the function FNDECL cannot be inlined on account of its
4097 attributes, true otherwise. */
4099 function_attribute_inlinable_p (const_tree fndecl
)
4101 if (targetm
.attribute_table
)
4105 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
4107 const_tree name
= get_attribute_name (a
);
4110 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
4111 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
4112 return targetm
.function_attribute_inlinable_p (fndecl
);
4119 /* Returns nonzero if FN is a function that does not have any
4120 fundamental inline blocking properties. */
4123 tree_inlinable_function_p (tree fn
)
4125 bool inlinable
= true;
4129 /* If we've already decided this function shouldn't be inlined,
4130 there's no need to check again. */
4131 if (DECL_UNINLINABLE (fn
))
4134 /* We only warn for functions declared `inline' by the user. */
4135 do_warning
= (opt_for_fn (fn
, warn_inline
)
4136 && DECL_DECLARED_INLINE_P (fn
)
4137 && !DECL_NO_INLINE_WARNING_P (fn
)
4138 && !DECL_IN_SYSTEM_HEADER (fn
));
4140 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
4143 && always_inline
== NULL
)
4146 warning (OPT_Winline
, "function %q+F can never be inlined because it "
4147 "is suppressed using %<-fno-inline%>", fn
);
4151 else if (!function_attribute_inlinable_p (fn
))
4154 warning (OPT_Winline
, "function %q+F can never be inlined because it "
4155 "uses attributes conflicting with inlining", fn
);
4159 else if (inline_forbidden_p (fn
))
4161 /* See if we should warn about uninlinable functions. Previously,
4162 some of these warnings would be issued while trying to expand
4163 the function inline, but that would cause multiple warnings
4164 about functions that would for example call alloca. But since
4165 this a property of the function, just one warning is enough.
4166 As a bonus we can now give more details about the reason why a
4167 function is not inlinable. */
4169 error (inline_forbidden_reason
, fn
);
4170 else if (do_warning
)
4171 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
4176 /* Squirrel away the result so that we don't have to check again. */
4177 DECL_UNINLINABLE (fn
) = !inlinable
;
4182 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
4183 word size and take possible memcpy call into account and return
4184 cost based on whether optimizing for size or speed according to SPEED_P. */
4187 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
4191 gcc_assert (!VOID_TYPE_P (type
));
4193 if (VECTOR_TYPE_P (type
))
4195 scalar_mode inner
= SCALAR_TYPE_MODE (TREE_TYPE (type
));
4196 machine_mode simd
= targetm
.vectorize
.preferred_simd_mode (inner
);
4198 = estimated_poly_value (GET_MODE_SIZE (TYPE_MODE (type
)));
4199 int simd_mode_size
= estimated_poly_value (GET_MODE_SIZE (simd
));
4200 return ((orig_mode_size
+ simd_mode_size
- 1)
4204 size
= int_size_in_bytes (type
);
4206 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
4207 /* Cost of a memcpy call, 3 arguments and the call. */
4210 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
4213 /* Returns cost of operation CODE, according to WEIGHTS */
4216 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
4217 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
4221 /* These are "free" conversions, or their presumed cost
4222 is folded into other operations. */
4227 case VIEW_CONVERT_EXPR
:
4230 /* Assign cost of 1 to usual operations.
4231 ??? We may consider mapping RTL costs to this. */
4237 case POINTER_PLUS_EXPR
:
4238 case POINTER_DIFF_EXPR
:
4241 case MULT_HIGHPART_EXPR
:
4243 case ADDR_SPACE_CONVERT_EXPR
:
4244 case FIXED_CONVERT_EXPR
:
4245 case FIX_TRUNC_EXPR
:
4264 case TRUTH_ANDIF_EXPR
:
4265 case TRUTH_ORIF_EXPR
:
4266 case TRUTH_AND_EXPR
:
4268 case TRUTH_XOR_EXPR
:
4269 case TRUTH_NOT_EXPR
:
4278 case UNORDERED_EXPR
:
4289 case PREDECREMENT_EXPR
:
4290 case PREINCREMENT_EXPR
:
4291 case POSTDECREMENT_EXPR
:
4292 case POSTINCREMENT_EXPR
:
4294 case REALIGN_LOAD_EXPR
:
4296 case WIDEN_SUM_EXPR
:
4297 case WIDEN_MULT_EXPR
:
4300 case WIDEN_MULT_PLUS_EXPR
:
4301 case WIDEN_MULT_MINUS_EXPR
:
4302 case WIDEN_LSHIFT_EXPR
:
4304 case VEC_WIDEN_MULT_HI_EXPR
:
4305 case VEC_WIDEN_MULT_LO_EXPR
:
4306 case VEC_WIDEN_MULT_EVEN_EXPR
:
4307 case VEC_WIDEN_MULT_ODD_EXPR
:
4308 case VEC_UNPACK_HI_EXPR
:
4309 case VEC_UNPACK_LO_EXPR
:
4310 case VEC_UNPACK_FLOAT_HI_EXPR
:
4311 case VEC_UNPACK_FLOAT_LO_EXPR
:
4312 case VEC_UNPACK_FIX_TRUNC_HI_EXPR
:
4313 case VEC_UNPACK_FIX_TRUNC_LO_EXPR
:
4314 case VEC_PACK_TRUNC_EXPR
:
4315 case VEC_PACK_SAT_EXPR
:
4316 case VEC_PACK_FIX_TRUNC_EXPR
:
4317 case VEC_PACK_FLOAT_EXPR
:
4318 case VEC_WIDEN_LSHIFT_HI_EXPR
:
4319 case VEC_WIDEN_LSHIFT_LO_EXPR
:
4320 case VEC_DUPLICATE_EXPR
:
4321 case VEC_SERIES_EXPR
:
4325 /* Few special cases of expensive operations. This is useful
4326 to avoid inlining on functions having too many of these. */
4327 case TRUNC_DIV_EXPR
:
4329 case FLOOR_DIV_EXPR
:
4330 case ROUND_DIV_EXPR
:
4331 case EXACT_DIV_EXPR
:
4332 case TRUNC_MOD_EXPR
:
4334 case FLOOR_MOD_EXPR
:
4335 case ROUND_MOD_EXPR
:
4337 if (TREE_CODE (op2
) != INTEGER_CST
)
4338 return weights
->div_mod_cost
;
4341 /* Bit-field insertion needs several shift and mask operations. */
4342 case BIT_INSERT_EXPR
:
4346 /* We expect a copy assignment with no operator. */
4347 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
4353 /* Estimate number of instructions that will be created by expanding
4354 the statements in the statement sequence STMTS.
4355 WEIGHTS contains weights attributed to various constructs. */
4358 estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
4361 gimple_stmt_iterator gsi
;
4364 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4365 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4371 /* Estimate number of instructions that will be created by expanding STMT.
4372 WEIGHTS contains weights attributed to various constructs. */
4375 estimate_num_insns (gimple
*stmt
, eni_weights
*weights
)
4378 enum gimple_code code
= gimple_code (stmt
);
4385 /* Try to estimate the cost of assignments. We have three cases to
4387 1) Simple assignments to registers;
4388 2) Stores to things that must live in memory. This includes
4389 "normal" stores to scalars, but also assignments of large
4390 structures, or constructors of big arrays;
4392 Let us look at the first two cases, assuming we have "a = b + C":
4393 <GIMPLE_ASSIGN <var_decl "a">
4394 <plus_expr <var_decl "b"> <constant C>>
4395 If "a" is a GIMPLE register, the assignment to it is free on almost
4396 any target, because "a" usually ends up in a real register. Hence
4397 the only cost of this expression comes from the PLUS_EXPR, and we
4398 can ignore the GIMPLE_ASSIGN.
4399 If "a" is not a GIMPLE register, the assignment to "a" will most
4400 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4401 of moving something into "a", which we compute using the function
4402 estimate_move_cost. */
4403 if (gimple_clobber_p (stmt
))
4404 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4406 lhs
= gimple_assign_lhs (stmt
);
4407 rhs
= gimple_assign_rhs1 (stmt
);
4411 /* Account for the cost of moving to / from memory. */
4412 if (gimple_store_p (stmt
))
4413 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
4414 if (gimple_assign_load_p (stmt
))
4415 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
4417 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
4418 gimple_assign_rhs1 (stmt
),
4419 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
4420 == GIMPLE_BINARY_RHS
4421 ? gimple_assign_rhs2 (stmt
) : NULL
);
4425 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4426 gimple_op (stmt
, 0),
4427 gimple_op (stmt
, 1));
4432 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4433 /* Take into account cost of the switch + guess 2 conditional jumps for
4436 TODO: once the switch expansion logic is sufficiently separated, we can
4437 do better job on estimating cost of the switch. */
4438 if (weights
->time_based
)
4439 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4441 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4449 if (gimple_call_internal_p (stmt
))
4451 else if ((decl
= gimple_call_fndecl (stmt
))
4452 && fndecl_built_in_p (decl
))
4454 /* Do not special case builtins where we see the body.
4455 This just confuse inliner. */
4456 struct cgraph_node
*node
;
4457 if ((node
= cgraph_node::get (decl
))
4458 && node
->definition
)
4460 /* For buitins that are likely expanded to nothing or
4461 inlined do not account operand costs. */
4462 else if (is_simple_builtin (decl
))
4464 else if (is_inexpensive_builtin (decl
))
4465 return weights
->target_builtin_call_cost
;
4466 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
4468 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4469 specialize the cheap expansion we do here.
4470 ??? This asks for a more general solution. */
4471 switch (DECL_FUNCTION_CODE (decl
))
4476 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4478 (&TREE_REAL_CST (gimple_call_arg (stmt
, 1)),
4480 return estimate_operator_cost
4481 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4482 gimple_call_arg (stmt
, 0));
4491 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4492 if (gimple_call_lhs (stmt
))
4493 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4494 weights
->time_based
);
4495 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4497 tree arg
= gimple_call_arg (stmt
, i
);
4498 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4499 weights
->time_based
);
4505 return weights
->return_cost
;
4511 case GIMPLE_PREDICT
:
4517 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4518 /* 1000 means infinity. This avoids overflows later
4519 with very long asm statements. */
4522 /* If this asm is asm inline, count anything as minimum size. */
4523 if (gimple_asm_inline_p (as_a
<gasm
*> (stmt
)))
4524 count
= MIN (1, count
);
4525 return MAX (1, count
);
4529 /* This is either going to be an external function call with one
4530 argument, or two register copy statements plus a goto. */
4533 case GIMPLE_EH_DISPATCH
:
4534 /* ??? This is going to turn into a switch statement. Ideally
4535 we'd have a look at the eh region and estimate the number of
4540 return estimate_num_insns_seq (
4541 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4544 case GIMPLE_EH_FILTER
:
4545 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4548 return estimate_num_insns_seq (gimple_catch_handler (
4549 as_a
<gcatch
*> (stmt
)),
4553 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4554 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4556 /* OMP directives are generally very expensive. */
4558 case GIMPLE_OMP_RETURN
:
4559 case GIMPLE_OMP_SECTIONS_SWITCH
:
4560 case GIMPLE_OMP_ATOMIC_STORE
:
4561 case GIMPLE_OMP_CONTINUE
:
4562 /* ...except these, which are cheap. */
4565 case GIMPLE_OMP_ATOMIC_LOAD
:
4566 return weights
->omp_cost
;
4568 case GIMPLE_OMP_FOR
:
4569 return (weights
->omp_cost
4570 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4571 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4573 case GIMPLE_OMP_PARALLEL
:
4574 case GIMPLE_OMP_TASK
:
4575 case GIMPLE_OMP_CRITICAL
:
4576 case GIMPLE_OMP_MASTER
:
4577 case GIMPLE_OMP_MASKED
:
4578 case GIMPLE_OMP_SCOPE
:
4579 case GIMPLE_OMP_TASKGROUP
:
4580 case GIMPLE_OMP_ORDERED
:
4581 case GIMPLE_OMP_SCAN
:
4582 case GIMPLE_OMP_SECTION
:
4583 case GIMPLE_OMP_SECTIONS
:
4584 case GIMPLE_OMP_STRUCTURED_BLOCK
:
4585 case GIMPLE_OMP_SINGLE
:
4586 case GIMPLE_OMP_TARGET
:
4587 case GIMPLE_OMP_TEAMS
:
4588 return (weights
->omp_cost
4589 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4591 case GIMPLE_TRANSACTION
:
4592 return (weights
->tm_cost
4593 + estimate_num_insns_seq (gimple_transaction_body (
4594 as_a
<gtransaction
*> (stmt
)),
4604 /* Estimate number of instructions that will be created by expanding
4605 function FNDECL. WEIGHTS contains weights attributed to various
4609 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4611 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4612 gimple_stmt_iterator bsi
;
4616 gcc_assert (my_function
&& my_function
->cfg
);
4617 FOR_EACH_BB_FN (bb
, my_function
)
4619 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4620 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4627 /* Initializes weights used by estimate_num_insns. */
4630 init_inline_once (void)
4632 eni_size_weights
.call_cost
= 1;
4633 eni_size_weights
.indirect_call_cost
= 3;
4634 eni_size_weights
.target_builtin_call_cost
= 1;
4635 eni_size_weights
.div_mod_cost
= 1;
4636 eni_size_weights
.omp_cost
= 40;
4637 eni_size_weights
.tm_cost
= 10;
4638 eni_size_weights
.time_based
= false;
4639 eni_size_weights
.return_cost
= 1;
4641 /* Estimating time for call is difficult, since we have no idea what the
4642 called function does. In the current uses of eni_time_weights,
4643 underestimating the cost does less harm than overestimating it, so
4644 we choose a rather small value here. */
4645 eni_time_weights
.call_cost
= 10;
4646 eni_time_weights
.indirect_call_cost
= 15;
4647 eni_time_weights
.target_builtin_call_cost
= 1;
4648 eni_time_weights
.div_mod_cost
= 10;
4649 eni_time_weights
.omp_cost
= 40;
4650 eni_time_weights
.tm_cost
= 40;
4651 eni_time_weights
.time_based
= true;
4652 eni_time_weights
.return_cost
= 2;
4656 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4659 prepend_lexical_block (tree current_block
, tree new_block
)
4661 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4662 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4663 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4666 /* Add local variables from CALLEE to CALLER. */
4669 add_local_variables (struct function
*callee
, struct function
*caller
,
4675 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4676 if (!can_be_nonlocal (var
, id
))
4678 tree new_var
= remap_decl (var
, id
);
4680 /* Remap debug-expressions. */
4682 && DECL_HAS_DEBUG_EXPR_P (var
)
4685 tree tem
= DECL_DEBUG_EXPR (var
);
4686 bool old_regimplify
= id
->regimplify
;
4687 id
->remapping_type_depth
++;
4688 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4689 id
->remapping_type_depth
--;
4690 id
->regimplify
= old_regimplify
;
4691 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4692 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4694 add_local_decl (caller
, new_var
);
4698 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4699 have brought in or introduced any debug stmts for SRCVAR. */
4702 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4704 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4709 if (!VAR_P (*remappedvarp
))
4712 if (*remappedvarp
== id
->retvar
)
4715 tree tvar
= target_for_debug_bind (*remappedvarp
);
4719 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4721 gimple_seq_add_stmt (bindings
, stmt
);
4724 /* For each inlined variable for which we may have debug bind stmts,
4725 add before GSI a final debug stmt resetting it, marking the end of
4726 its life, so that var-tracking knows it doesn't have to compute
4727 further locations for it. */
4730 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4734 gimple_seq bindings
= NULL
;
4736 if (!gimple_in_ssa_p (id
->src_cfun
))
4739 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4742 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4743 var
; var
= DECL_CHAIN (var
))
4744 reset_debug_binding (id
, var
, &bindings
);
4746 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4747 reset_debug_binding (id
, var
, &bindings
);
4749 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4752 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4755 expand_call_inline (basic_block bb
, gimple
*stmt
, copy_body_data
*id
,
4760 hash_map
<tree
, tree
> *dst
;
4761 hash_map
<tree
, tree
> *st
= NULL
;
4764 struct cgraph_edge
*cg_edge
;
4765 cgraph_inline_failed_t reason
;
4766 basic_block return_block
;
4768 gimple_stmt_iterator gsi
, stmt_gsi
;
4769 bool successfully_inlined
= false;
4770 bool purge_dead_abnormal_edges
;
4772 unsigned int prop_mask
, src_properties
;
4773 struct function
*dst_cfun
;
4776 gimple
*simtenter_stmt
= NULL
;
4777 vec
<tree
> *simtvars_save
;
4779 /* The gimplifier uses input_location in too many places, such as
4780 internal_get_tmp_var (). */
4781 location_t saved_location
= input_location
;
4782 input_location
= gimple_location (stmt
);
4784 /* From here on, we're only interested in CALL_EXPRs. */
4785 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4789 cg_edge
= id
->dst_node
->get_edge (stmt
);
4790 gcc_checking_assert (cg_edge
);
4791 /* First, see if we can figure out what function is being called.
4792 If we cannot, then there is no hope of inlining the function. */
4793 if (cg_edge
->indirect_unknown_callee
)
4795 fn
= cg_edge
->callee
->decl
;
4796 gcc_checking_assert (fn
);
4798 /* If FN is a declaration of a function in a nested scope that was
4799 globally declared inline, we don't set its DECL_INITIAL.
4800 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4801 C++ front-end uses it for cdtors to refer to their internal
4802 declarations, that are not real functions. Fortunately those
4803 don't have trees to be saved, so we can tell by checking their
4805 if (!DECL_INITIAL (fn
)
4806 && DECL_ABSTRACT_ORIGIN (fn
)
4807 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4808 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4810 /* Don't try to inline functions that are not well-suited to inlining. */
4811 if (cg_edge
->inline_failed
)
4813 reason
= cg_edge
->inline_failed
;
4814 /* If this call was originally indirect, we do not want to emit any
4815 inlining related warnings or sorry messages because there are no
4816 guarantees regarding those. */
4817 if (cg_edge
->indirect_inlining_edge
)
4820 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4821 /* For extern inline functions that get redefined we always
4822 silently ignored always_inline flag. Better behavior would
4823 be to be able to keep both bodies and use extern inline body
4824 for inlining, but we can't do that because frontends overwrite
4826 && !cg_edge
->callee
->redefined_extern_inline
4827 /* During early inline pass, report only when optimization is
4829 && (symtab
->global_info_ready
4831 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4832 /* PR 20090218-1_0.c. Body can be provided by another module. */
4833 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4835 error ("inlining failed in call to %<always_inline%> %q+F: %s", fn
,
4836 cgraph_inline_failed_string (reason
));
4837 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4838 inform (gimple_location (stmt
), "called from here");
4839 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4840 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4841 "called from this function");
4843 else if (opt_for_fn (fn
, warn_inline
)
4844 && DECL_DECLARED_INLINE_P (fn
)
4845 && !DECL_NO_INLINE_WARNING_P (fn
)
4846 && !DECL_IN_SYSTEM_HEADER (fn
)
4847 && reason
!= CIF_UNSPECIFIED
4848 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4849 /* Do not warn about not inlined recursive calls. */
4850 && !cg_edge
->recursive_p ()
4851 /* Avoid warnings during early inline pass. */
4852 && symtab
->global_info_ready
)
4854 auto_diagnostic_group d
;
4855 if (warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4856 fn
, _(cgraph_inline_failed_string (reason
))))
4858 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4859 inform (gimple_location (stmt
), "called from here");
4860 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4861 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4862 "called from this function");
4867 id
->src_node
= cg_edge
->callee
;
4869 /* If callee is thunk, all we need is to adjust the THIS pointer
4870 and redirect to function being thunked. */
4871 if (id
->src_node
->thunk
)
4874 tree virtual_offset
= NULL
;
4875 profile_count count
= cg_edge
->count
;
4877 gimple_stmt_iterator iter
= gsi_for_stmt (stmt
);
4878 thunk_info
*info
= thunk_info::get (id
->src_node
);
4880 cgraph_edge::remove (cg_edge
);
4881 edge
= id
->src_node
->callees
->clone (id
->dst_node
, call_stmt
,
4883 profile_count::one (),
4884 profile_count::one (),
4886 edge
->count
= count
;
4887 if (info
->virtual_offset_p
)
4888 virtual_offset
= size_int (info
->virtual_value
);
4889 op
= create_tmp_reg_fn (cfun
, TREE_TYPE (gimple_call_arg (stmt
, 0)),
4891 gsi_insert_before (&iter
, gimple_build_assign (op
,
4892 gimple_call_arg (stmt
, 0)),
4894 gcc_assert (info
->this_adjusting
);
4895 op
= thunk_adjust (&iter
, op
, 1, info
->fixed_offset
,
4896 virtual_offset
, info
->indirect_offset
);
4898 gimple_call_set_arg (stmt
, 0, op
);
4899 gimple_call_set_fndecl (stmt
, edge
->callee
->decl
);
4901 id
->src_node
->remove ();
4902 successfully_inlined
= expand_call_inline (bb
, stmt
, id
, to_purge
);
4903 maybe_remove_unused_call_args (cfun
, stmt
);
4904 /* This used to return true even though we do fail to inline in
4905 some cases. See PR98525. */
4908 fn
= cg_edge
->callee
->decl
;
4909 cg_edge
->callee
->get_untransformed_body ();
4911 if (flag_checking
&& cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4912 cg_edge
->callee
->verify ();
4914 /* We will be inlining this callee. */
4915 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4917 /* Update the callers EH personality. */
4918 if (DECL_FUNCTION_PERSONALITY (fn
))
4919 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4920 = DECL_FUNCTION_PERSONALITY (fn
);
4922 /* Split the block before the GIMPLE_CALL. */
4923 stmt_gsi
= gsi_for_stmt (stmt
);
4924 gsi_prev (&stmt_gsi
);
4925 e
= split_block (bb
, gsi_end_p (stmt_gsi
) ? NULL
: gsi_stmt (stmt_gsi
));
4927 return_block
= e
->dest
;
4930 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4931 been the source of abnormal edges. In this case, schedule
4932 the removal of dead abnormal edges. */
4933 gsi
= gsi_start_bb (return_block
);
4935 purge_dead_abnormal_edges
= gsi_end_p (gsi
);
4937 stmt_gsi
= gsi_start_bb (return_block
);
4939 /* Build a block containing code to initialize the arguments, the
4940 actual inline expansion of the body, and a label for the return
4941 statements within the function to jump to. The type of the
4942 statement expression is the return type of the function call.
4943 ??? If the call does not have an associated block then we will
4944 remap all callee blocks to NULL, effectively dropping most of
4945 its debug information. This should only happen for calls to
4946 artificial decls inserted by the compiler itself. We need to
4947 either link the inlined blocks into the caller block tree or
4948 not refer to them in any way to not break GC for locations. */
4949 if (tree block
= gimple_block (stmt
))
4951 /* We do want to assign a not UNKNOWN_LOCATION BLOCK_SOURCE_LOCATION
4952 to make inlined_function_outer_scope_p return true on this BLOCK. */
4953 location_t loc
= LOCATION_LOCUS (gimple_location (stmt
));
4954 if (loc
== UNKNOWN_LOCATION
)
4955 loc
= LOCATION_LOCUS (DECL_SOURCE_LOCATION (fn
));
4956 if (loc
== UNKNOWN_LOCATION
)
4957 loc
= BUILTINS_LOCATION
;
4958 id
->block
= make_node (BLOCK
);
4959 BLOCK_ABSTRACT_ORIGIN (id
->block
) = DECL_ORIGIN (fn
);
4960 BLOCK_SOURCE_LOCATION (id
->block
) = loc
;
4961 prepend_lexical_block (block
, id
->block
);
4964 /* Local declarations will be replaced by their equivalents in this map. */
4966 id
->decl_map
= new hash_map
<tree
, tree
>;
4967 dst
= id
->debug_map
;
4968 id
->debug_map
= NULL
;
4969 if (flag_stack_reuse
!= SR_NONE
)
4970 id
->add_clobbers_to_eh_landing_pads
= last_basic_block_for_fn (cfun
);
4972 /* Record the function we are about to inline. */
4974 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4975 id
->reset_location
= DECL_IGNORED_P (fn
);
4976 id
->call_stmt
= call_stmt
;
4977 cfun
->cfg
->full_profile
&= id
->src_cfun
->cfg
->full_profile
;
4979 /* When inlining into an OpenMP SIMD-on-SIMT loop, arrange for new automatic
4980 variables to be added to IFN_GOMP_SIMT_ENTER argument list. */
4981 dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4982 simtvars_save
= id
->dst_simt_vars
;
4983 if (!(dst_cfun
->curr_properties
& PROP_gimple_lomp_dev
)
4984 && (simduid
= bb
->loop_father
->simduid
) != NULL_TREE
4985 && (simduid
= ssa_default_def (dst_cfun
, simduid
)) != NULL_TREE
4986 && single_imm_use (simduid
, &use
, &simtenter_stmt
)
4987 && is_gimple_call (simtenter_stmt
)
4988 && gimple_call_internal_p (simtenter_stmt
, IFN_GOMP_SIMT_ENTER
))
4989 vec_alloc (id
->dst_simt_vars
, 0);
4991 id
->dst_simt_vars
= NULL
;
4993 if (profile_status_for_fn (id
->src_cfun
) == PROFILE_ABSENT
)
4994 profile_status_for_fn (dst_cfun
) = PROFILE_ABSENT
;
4996 /* If the src function contains an IFN_VA_ARG, then so will the dst
4997 function after inlining. Likewise for IFN_GOMP_USE_SIMT. */
4998 prop_mask
= PROP_gimple_lva
| PROP_gimple_lomp_dev
;
4999 src_properties
= id
->src_cfun
->curr_properties
& prop_mask
;
5000 if (src_properties
!= prop_mask
)
5001 dst_cfun
->curr_properties
&= src_properties
| ~prop_mask
;
5002 dst_cfun
->calls_eh_return
|= id
->src_cfun
->calls_eh_return
;
5003 id
->dst_node
->calls_declare_variant_alt
5004 |= id
->src_node
->calls_declare_variant_alt
;
5006 gcc_assert (!id
->src_cfun
->after_inlining
);
5009 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
5011 gimple_stmt_iterator si
= gsi_last_bb (bb
);
5012 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
5016 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
5017 if (debug_nonbind_markers_p
&& debug_inline_points
&& id
->block
5018 && inlined_function_outer_scope_p (id
->block
))
5020 gimple_stmt_iterator si
= gsi_last_bb (bb
);
5021 gsi_insert_after (&si
, gimple_build_debug_inline_entry
5022 (id
->block
, DECL_SOURCE_LOCATION (id
->src_fn
)),
5026 if (DECL_INITIAL (fn
))
5028 if (gimple_block (stmt
))
5032 prepend_lexical_block (id
->block
,
5033 remap_blocks (DECL_INITIAL (fn
), id
));
5034 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
5035 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
5037 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
5038 otherwise for DWARF DW_TAG_formal_parameter will not be children of
5039 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
5040 under it. The parameters can be then evaluated in the debugger,
5041 but don't show in backtraces. */
5042 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
5043 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
5046 *var
= TREE_CHAIN (v
);
5047 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
5048 BLOCK_VARS (id
->block
) = v
;
5051 var
= &TREE_CHAIN (*var
);
5054 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
5057 /* Return statements in the function body will be replaced by jumps
5058 to the RET_LABEL. */
5059 gcc_assert (DECL_INITIAL (fn
));
5060 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
5062 /* Find the LHS to which the result of this call is assigned. */
5064 if (gimple_call_lhs (stmt
))
5066 modify_dest
= gimple_call_lhs (stmt
);
5068 /* The function which we are inlining might not return a value,
5069 in which case we should issue a warning that the function
5070 does not return a value. In that case the optimizers will
5071 see that the variable to which the value is assigned was not
5072 initialized. We do not want to issue a warning about that
5073 uninitialized variable. */
5074 if (DECL_P (modify_dest
))
5075 suppress_warning (modify_dest
, OPT_Wuninitialized
);
5077 if (gimple_call_return_slot_opt_p (call_stmt
))
5079 return_slot
= modify_dest
;
5086 /* If we are inlining a call to the C++ operator new, we don't want
5087 to use type based alias analysis on the return value. Otherwise
5088 we may get confused if the compiler sees that the inlined new
5089 function returns a pointer which was just deleted. See bug
5091 if (DECL_IS_OPERATOR_NEW_P (fn
))
5097 /* Declare the return variable for the function. */
5098 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
5100 /* Add local vars in this inlined callee to caller. */
5101 add_local_variables (id
->src_cfun
, cfun
, id
);
5103 if (dump_enabled_p ())
5106 snprintf (buf
, sizeof(buf
), "%4.2f",
5107 cg_edge
->sreal_frequency ().to_double ());
5108 dump_printf_loc (MSG_NOTE
| MSG_PRIORITY_INTERNALS
,
5110 "Inlining %C to %C with frequency %s\n",
5111 id
->src_node
, id
->dst_node
, buf
);
5112 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5114 id
->src_node
->dump (dump_file
);
5115 id
->dst_node
->dump (dump_file
);
5119 /* This is it. Duplicate the callee body. Assume callee is
5120 pre-gimplified. Note that we must not alter the caller
5121 function in any way before this point, as this CALL_EXPR may be
5122 a self-referential call; if we're calling ourselves, we need to
5123 duplicate our body before altering anything. */
5124 copy_body (id
, bb
, return_block
, NULL
);
5126 reset_debug_bindings (id
, stmt_gsi
);
5128 if (flag_stack_reuse
!= SR_NONE
)
5129 for (tree p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
5130 if (!TREE_THIS_VOLATILE (p
))
5132 /* The value associated with P is a local temporary only if
5133 there is no value associated with P in the debug map. */
5134 tree
*varp
= id
->decl_map
->get (p
);
5137 && !is_gimple_reg (*varp
)
5138 && !(id
->debug_map
&& id
->debug_map
->get (p
)))
5140 tree clobber
= build_clobber (TREE_TYPE (*varp
), CLOBBER_EOL
);
5141 gimple
*clobber_stmt
;
5142 clobber_stmt
= gimple_build_assign (*varp
, clobber
);
5143 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
5144 gsi_insert_before (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
5148 /* Reset the escaped solution. */
5149 if (cfun
->gimple_df
)
5150 pt_solution_reset (&cfun
->gimple_df
->escaped
);
5152 /* Add new automatic variables to IFN_GOMP_SIMT_ENTER arguments. */
5153 if (id
->dst_simt_vars
&& id
->dst_simt_vars
->length () > 0)
5155 size_t nargs
= gimple_call_num_args (simtenter_stmt
);
5156 vec
<tree
> *vars
= id
->dst_simt_vars
;
5157 auto_vec
<tree
> newargs (nargs
+ vars
->length ());
5158 for (size_t i
= 0; i
< nargs
; i
++)
5159 newargs
.quick_push (gimple_call_arg (simtenter_stmt
, i
));
5160 for (tree
*pvar
= vars
->begin (); pvar
!= vars
->end (); pvar
++)
5162 tree ptrtype
= build_pointer_type (TREE_TYPE (*pvar
));
5163 newargs
.quick_push (build1 (ADDR_EXPR
, ptrtype
, *pvar
));
5165 gcall
*g
= gimple_build_call_internal_vec (IFN_GOMP_SIMT_ENTER
, newargs
);
5166 gimple_call_set_lhs (g
, gimple_call_lhs (simtenter_stmt
));
5167 gimple_stmt_iterator gsi
= gsi_for_stmt (simtenter_stmt
);
5168 gsi_replace (&gsi
, g
, false);
5170 vec_free (id
->dst_simt_vars
);
5171 id
->dst_simt_vars
= simtvars_save
;
5176 delete id
->debug_map
;
5177 id
->debug_map
= dst
;
5179 delete id
->decl_map
;
5182 /* Unlink the calls virtual operands before replacing it. */
5183 unlink_stmt_vdef (stmt
);
5184 if (gimple_vdef (stmt
)
5185 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
5186 release_ssa_name (gimple_vdef (stmt
));
5188 /* If the inlined function returns a result that we care about,
5189 substitute the GIMPLE_CALL with an assignment of the return
5190 variable to the LHS of the call. That is, if STMT was
5191 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
5192 if (use_retvar
&& gimple_call_lhs (stmt
))
5194 gimple
*old_stmt
= stmt
;
5195 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
5196 gimple_set_location (stmt
, gimple_location (old_stmt
));
5197 gsi_replace (&stmt_gsi
, stmt
, false);
5198 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
5199 /* Append a clobber for id->retvar if easily possible. */
5200 if (flag_stack_reuse
!= SR_NONE
5202 && VAR_P (id
->retvar
)
5203 && id
->retvar
!= return_slot
5204 && id
->retvar
!= modify_dest
5205 && !TREE_THIS_VOLATILE (id
->retvar
)
5206 && !is_gimple_reg (id
->retvar
)
5207 && !stmt_ends_bb_p (stmt
))
5209 tree clobber
= build_clobber (TREE_TYPE (id
->retvar
), CLOBBER_EOL
);
5210 gimple
*clobber_stmt
;
5211 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
5212 gimple_set_location (clobber_stmt
, gimple_location (old_stmt
));
5213 gsi_insert_after (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
5218 /* Handle the case of inlining a function with no return
5219 statement, which causes the return value to become undefined. */
5220 if (gimple_call_lhs (stmt
)
5221 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
5223 tree name
= gimple_call_lhs (stmt
);
5224 tree var
= SSA_NAME_VAR (name
);
5225 tree def
= var
? ssa_default_def (cfun
, var
) : NULL
;
5229 /* If the variable is used undefined, make this name
5230 undefined via a move. */
5231 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
5232 gsi_replace (&stmt_gsi
, stmt
, true);
5238 var
= create_tmp_reg_fn (cfun
, TREE_TYPE (name
), NULL
);
5239 SET_SSA_NAME_VAR_OR_IDENTIFIER (name
, var
);
5241 /* Otherwise make this variable undefined. */
5242 gsi_remove (&stmt_gsi
, true);
5243 set_ssa_default_def (cfun
, var
, name
);
5244 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
5247 /* Replace with a clobber for id->retvar. */
5248 else if (flag_stack_reuse
!= SR_NONE
5250 && VAR_P (id
->retvar
)
5251 && id
->retvar
!= return_slot
5252 && id
->retvar
!= modify_dest
5253 && !TREE_THIS_VOLATILE (id
->retvar
)
5254 && !is_gimple_reg (id
->retvar
))
5256 tree clobber
= build_clobber (TREE_TYPE (id
->retvar
));
5257 gimple
*clobber_stmt
;
5258 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
5259 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
5260 gsi_replace (&stmt_gsi
, clobber_stmt
, false);
5261 maybe_clean_or_replace_eh_stmt (stmt
, clobber_stmt
);
5264 gsi_remove (&stmt_gsi
, true);
5267 if (purge_dead_abnormal_edges
)
5268 bitmap_set_bit (to_purge
, return_block
->index
);
5270 /* If the value of the new expression is ignored, that's OK. We
5271 don't warn about this for CALL_EXPRs, so we shouldn't warn about
5272 the equivalent inlined version either. */
5273 if (is_gimple_assign (stmt
))
5275 gcc_assert (gimple_assign_single_p (stmt
)
5276 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
5277 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
5280 id
->add_clobbers_to_eh_landing_pads
= 0;
5282 /* Output the inlining info for this abstract function, since it has been
5283 inlined. If we don't do this now, we can lose the information about the
5284 variables in the function when the blocks get blown away as soon as we
5285 remove the cgraph node. */
5286 if (gimple_block (stmt
))
5287 (*debug_hooks
->outlining_inline_function
) (fn
);
5289 /* Update callgraph if needed. */
5290 cg_edge
->callee
->remove ();
5292 id
->block
= NULL_TREE
;
5293 id
->retvar
= NULL_TREE
;
5294 successfully_inlined
= true;
5297 input_location
= saved_location
;
5298 return successfully_inlined
;
5301 /* Expand call statements reachable from STMT_P.
5302 We can only have CALL_EXPRs as the "toplevel" tree code or nested
5303 in a MODIFY_EXPR. */
5306 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
,
5309 gimple_stmt_iterator gsi
;
5310 bool inlined
= false;
5312 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
5314 gimple
*stmt
= gsi_stmt (gsi
);
5317 if (is_gimple_call (stmt
)
5318 && !gimple_call_internal_p (stmt
))
5319 inlined
|= expand_call_inline (bb
, stmt
, id
, to_purge
);
5326 /* Walk all basic blocks created after FIRST and try to fold every statement
5327 in the STATEMENTS pointer set. */
5330 fold_marked_statements (int first
, hash_set
<gimple
*> *statements
)
5332 auto_bitmap to_purge
;
5334 auto_vec
<edge
, 20> stack (n_basic_blocks_for_fn (cfun
) + 2);
5335 auto_sbitmap
visited (last_basic_block_for_fn (cfun
));
5336 bitmap_clear (visited
);
5338 stack
.quick_push (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5339 while (!stack
.is_empty ())
5341 /* Look at the edge on the top of the stack. */
5342 edge e
= stack
.pop ();
5343 basic_block dest
= e
->dest
;
5345 if (dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
)
5346 || bitmap_bit_p (visited
, dest
->index
))
5349 bitmap_set_bit (visited
, dest
->index
);
5351 if (dest
->index
>= first
)
5352 for (gimple_stmt_iterator gsi
= gsi_start_bb (dest
);
5353 !gsi_end_p (gsi
); gsi_next (&gsi
))
5355 if (!statements
->contains (gsi_stmt (gsi
)))
5358 gimple
*old_stmt
= gsi_stmt (gsi
);
5359 tree old_decl
= (is_gimple_call (old_stmt
)
5360 ? gimple_call_fndecl (old_stmt
) : 0);
5361 if (old_decl
&& fndecl_built_in_p (old_decl
))
5363 /* Folding builtins can create multiple instructions,
5364 we need to look at all of them. */
5365 gimple_stmt_iterator i2
= gsi
;
5367 if (fold_stmt (&gsi
))
5370 /* If a builtin at the end of a bb folded into nothing,
5371 the following loop won't work. */
5372 if (gsi_end_p (gsi
))
5374 cgraph_update_edges_for_call_stmt (old_stmt
,
5379 i2
= gsi_start_bb (dest
);
5384 new_stmt
= gsi_stmt (i2
);
5385 update_stmt (new_stmt
);
5386 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5389 if (new_stmt
== gsi_stmt (gsi
))
5391 /* It is okay to check only for the very last
5392 of these statements. If it is a throwing
5393 statement nothing will change. If it isn't
5394 this can remove EH edges. If that weren't
5395 correct then because some intermediate stmts
5396 throw, but not the last one. That would mean
5397 we'd have to split the block, which we can't
5398 here and we'd loose anyway. And as builtins
5399 probably never throw, this all
5401 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
5403 bitmap_set_bit (to_purge
, dest
->index
);
5410 else if (fold_stmt (&gsi
))
5412 /* Re-read the statement from GSI as fold_stmt() may
5414 gimple
*new_stmt
= gsi_stmt (gsi
);
5415 update_stmt (new_stmt
);
5417 if (is_gimple_call (old_stmt
)
5418 || is_gimple_call (new_stmt
))
5419 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5422 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
5423 bitmap_set_bit (to_purge
, dest
->index
);
5427 if (EDGE_COUNT (dest
->succs
) > 0)
5429 /* Avoid warnings emitted from folding statements that
5430 became unreachable because of inlined function parameter
5432 e
= find_taken_edge (dest
, NULL_TREE
);
5434 stack
.quick_push (e
);
5438 FOR_EACH_EDGE (e
, ei
, dest
->succs
)
5439 stack
.safe_push (e
);
5444 gimple_purge_all_dead_eh_edges (to_purge
);
5447 /* Expand calls to inline functions in the body of FN. */
5450 optimize_inline_calls (tree fn
)
5454 int last
= n_basic_blocks_for_fn (cfun
);
5455 bool inlined_p
= false;
5458 memset (&id
, 0, sizeof (id
));
5460 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
5461 gcc_assert (id
.dst_node
->definition
);
5463 /* Or any functions that aren't finished yet. */
5464 if (current_function_decl
)
5465 id
.dst_fn
= current_function_decl
;
5467 id
.copy_decl
= copy_decl_maybe_to_var
;
5468 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5469 id
.transform_new_cfg
= false;
5470 id
.transform_return_to_modify
= true;
5471 id
.transform_parameter
= true;
5472 id
.statements_to_fold
= new hash_set
<gimple
*>;
5474 push_gimplify_context ();
5476 /* We make no attempts to keep dominance info up-to-date. */
5477 free_dominance_info (CDI_DOMINATORS
);
5478 free_dominance_info (CDI_POST_DOMINATORS
);
5480 /* Register specific gimple functions. */
5481 gimple_register_cfg_hooks ();
5483 /* Reach the trees by walking over the CFG, and note the
5484 enclosing basic-blocks in the call edges. */
5485 /* We walk the blocks going forward, because inlined function bodies
5486 will split id->current_basic_block, and the new blocks will
5487 follow it; we'll trudge through them, processing their CALL_EXPRs
5489 auto_bitmap to_purge
;
5490 FOR_EACH_BB_FN (bb
, cfun
)
5491 inlined_p
|= gimple_expand_calls_inline (bb
, &id
, to_purge
);
5493 pop_gimplify_context (NULL
);
5497 struct cgraph_edge
*e
;
5499 id
.dst_node
->verify ();
5501 /* Double check that we inlined everything we are supposed to inline. */
5502 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
5503 gcc_assert (e
->inline_failed
);
5506 /* If we didn't inline into the function there is nothing to do. */
5509 delete id
.statements_to_fold
;
5513 /* Fold queued statements. */
5514 update_max_bb_count ();
5515 fold_marked_statements (last
, id
.statements_to_fold
);
5516 delete id
.statements_to_fold
;
5518 /* Finally purge EH and abnormal edges from the call stmts we inlined.
5519 We need to do this after fold_marked_statements since that may walk
5520 the SSA use-def chain. */
5523 EXECUTE_IF_SET_IN_BITMAP (to_purge
, 0, i
, bi
)
5525 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
5528 gimple_purge_dead_eh_edges (bb
);
5529 gimple_purge_dead_abnormal_call_edges (bb
);
5533 gcc_assert (!id
.debug_stmts
.exists ());
5535 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5538 delete_unreachable_blocks_update_callgraph (id
.dst_node
, false);
5539 id
.dst_node
->calls_comdat_local
= id
.dst_node
->check_calls_comdat_local_p ();
5542 id
.dst_node
->verify ();
5544 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5545 not possible yet - the IPA passes might make various functions to not
5546 throw and they don't care to proactively update local EH info. This is
5547 done later in fixup_cfg pass that also execute the verification. */
5548 return (TODO_update_ssa
5550 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5551 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0));
5554 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5557 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5559 enum tree_code code
= TREE_CODE (*tp
);
5560 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5562 /* We make copies of most nodes. */
5563 if (IS_EXPR_CODE_CLASS (cl
)
5564 || code
== TREE_LIST
5566 || code
== TYPE_DECL
5567 || code
== OMP_CLAUSE
)
5569 /* Because the chain gets clobbered when we make a copy, we save it
5571 tree chain
= NULL_TREE
, new_tree
;
5573 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5574 chain
= TREE_CHAIN (*tp
);
5576 /* Copy the node. */
5577 new_tree
= copy_node (*tp
);
5581 /* Now, restore the chain, if appropriate. That will cause
5582 walk_tree to walk into the chain as well. */
5583 if (code
== PARM_DECL
5584 || code
== TREE_LIST
5585 || code
== OMP_CLAUSE
)
5586 TREE_CHAIN (*tp
) = chain
;
5588 /* For now, we don't update BLOCKs when we make copies. So, we
5589 have to nullify all BIND_EXPRs. */
5590 if (TREE_CODE (*tp
) == BIND_EXPR
)
5591 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5593 else if (code
== CONSTRUCTOR
)
5595 /* CONSTRUCTOR nodes need special handling because
5596 we need to duplicate the vector of elements. */
5599 new_tree
= copy_node (*tp
);
5600 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5603 else if (code
== STATEMENT_LIST
)
5604 /* We used to just abort on STATEMENT_LIST, but we can run into them
5605 with statement-expressions (c++/40975). */
5606 copy_statement_list (tp
);
5607 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5609 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5611 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5616 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5617 information indicating to what new SAVE_EXPR this one should be mapped,
5618 use that one. Otherwise, create a new node and enter it in ST. FN is
5619 the function into which the copy will be placed. */
5622 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5627 /* See if we already encountered this SAVE_EXPR. */
5630 /* If we didn't already remap this SAVE_EXPR, do so now. */
5633 t
= copy_node (*tp
);
5635 /* Remember this SAVE_EXPR. */
5637 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5642 /* We've already walked into this SAVE_EXPR; don't do it again. */
5647 /* Replace this SAVE_EXPR with the copy. */
5651 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5652 label, copies the declaration and enters it in the splay_tree in DATA (which
5653 is really a 'copy_body_data *'. */
5656 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5657 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5658 struct walk_stmt_info
*wi
)
5660 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5661 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5665 tree decl
= gimple_label_label (stmt
);
5667 /* Copy the decl and remember the copy. */
5668 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5674 static gimple_seq
duplicate_remap_omp_clause_seq (gimple_seq seq
,
5675 struct walk_stmt_info
*wi
);
5677 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5678 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5679 remaps all local declarations to appropriate replacements in gimple
5683 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5685 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5686 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5687 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5691 /* For recursive invocations this is no longer the LHS itself. */
5692 bool is_lhs
= wi
->is_lhs
;
5695 if (TREE_CODE (expr
) == SSA_NAME
)
5697 *tp
= remap_ssa_name (*tp
, id
);
5700 SSA_NAME_DEF_STMT (*tp
) = gsi_stmt (wi
->gsi
);
5702 /* Only a local declaration (variable or label). */
5703 else if ((VAR_P (expr
) && !TREE_STATIC (expr
))
5704 || TREE_CODE (expr
) == LABEL_DECL
)
5706 /* Lookup the declaration. */
5709 /* If it's there, remap it. */
5714 else if (TREE_CODE (expr
) == STATEMENT_LIST
5715 || TREE_CODE (expr
) == BIND_EXPR
5716 || TREE_CODE (expr
) == SAVE_EXPR
)
5718 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5720 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5721 It's OK for this to happen if it was part of a subtree that
5722 isn't immediately expanded, such as operand 2 of another
5724 if (!TREE_OPERAND (expr
, 1))
5726 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5727 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5730 else if (TREE_CODE (expr
) == OMP_CLAUSE
)
5732 /* Before the omplower pass completes, some OMP clauses can contain
5733 sequences that are neither copied by gimple_seq_copy nor walked by
5734 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5735 in those situations, we have to copy and process them explicitely. */
5737 if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LASTPRIVATE
)
5739 gimple_seq seq
= OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
);
5740 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5741 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
) = seq
;
5743 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LINEAR
)
5745 gimple_seq seq
= OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
);
5746 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5747 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
) = seq
;
5749 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_REDUCTION
)
5751 gimple_seq seq
= OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
);
5752 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5753 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
) = seq
;
5754 seq
= OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
);
5755 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5756 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
) = seq
;
5760 /* Keep iterating. */
5765 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5766 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5767 remaps all local declarations to appropriate replacements in gimple
5771 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5772 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5773 struct walk_stmt_info
*wi
)
5775 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5776 gimple
*gs
= gsi_stmt (*gsip
);
5778 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5780 tree block
= gimple_bind_block (stmt
);
5784 remap_block (&block
, id
);
5785 gimple_bind_set_block (stmt
, block
);
5788 /* This will remap a lot of the same decls again, but this should be
5790 if (gimple_bind_vars (stmt
))
5792 tree old_var
, decls
= gimple_bind_vars (stmt
);
5794 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
5795 if (!can_be_nonlocal (old_var
, id
)
5796 && ! variably_modified_type_p (TREE_TYPE (old_var
), id
->src_fn
))
5797 remap_decl (old_var
, id
);
5799 gcc_checking_assert (!id
->prevent_decl_creation_for_types
);
5800 id
->prevent_decl_creation_for_types
= true;
5801 gimple_bind_set_vars (stmt
, remap_decls (decls
, NULL
, id
));
5802 id
->prevent_decl_creation_for_types
= false;
5806 /* Keep iterating. */
5810 /* Create a copy of SEQ and remap all decls in it. */
5813 duplicate_remap_omp_clause_seq (gimple_seq seq
, struct walk_stmt_info
*wi
)
5818 /* If there are any labels in OMP sequences, they can be only referred to in
5819 the sequence itself and therefore we can do both here. */
5820 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, wi
);
5821 gimple_seq copy
= gimple_seq_copy (seq
);
5822 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, wi
);
5826 /* Copies everything in SEQ and replaces variables and labels local to
5827 current_function_decl. */
5830 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5833 struct walk_stmt_info wi
;
5836 /* There's nothing to do for NULL_TREE. */
5841 memset (&id
, 0, sizeof (id
));
5842 id
.src_fn
= current_function_decl
;
5843 id
.dst_fn
= current_function_decl
;
5845 id
.decl_map
= new hash_map
<tree
, tree
>;
5846 id
.debug_map
= NULL
;
5848 id
.copy_decl
= copy_decl_no_change
;
5849 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5850 id
.transform_new_cfg
= false;
5851 id
.transform_return_to_modify
= false;
5852 id
.transform_parameter
= false;
5854 /* Walk the tree once to find local labels. */
5855 memset (&wi
, 0, sizeof (wi
));
5856 hash_set
<tree
> visited
;
5859 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5861 copy
= gimple_seq_copy (seq
);
5863 /* Walk the copy, remapping decls. */
5864 memset (&wi
, 0, sizeof (wi
));
5866 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5871 delete id
.debug_map
;
5872 if (id
.dependence_map
)
5874 delete id
.dependence_map
;
5875 id
.dependence_map
= NULL
;
5882 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5885 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5894 debug_find_tree (tree top
, tree search
)
5896 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5900 /* Declare the variables created by the inliner. Add all the variables in
5901 VARS to BIND_EXPR. */
5904 declare_inline_vars (tree block
, tree vars
)
5907 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5909 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5910 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5911 add_local_decl (cfun
, t
);
5915 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5918 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5919 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5920 VAR_DECL translation. */
5923 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5925 /* Don't generate debug information for the copy if we wouldn't have
5926 generated it for the copy either. */
5927 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5928 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5930 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5931 declaration inspired this copy. */
5932 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5934 /* The new variable/label has no RTL, yet. */
5935 if (HAS_RTL_P (copy
)
5936 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5937 SET_DECL_RTL (copy
, 0);
5938 /* For vector typed decls make sure to update DECL_MODE according
5939 to the new function context. */
5940 if (VECTOR_TYPE_P (TREE_TYPE (copy
)))
5941 SET_DECL_MODE (copy
, TYPE_MODE (TREE_TYPE (copy
)));
5943 /* These args would always appear unused, if not for this. */
5944 TREE_USED (copy
) = 1;
5946 /* Set the context for the new declaration. */
5947 if (!DECL_CONTEXT (decl
))
5948 /* Globals stay global. */
5950 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5951 /* Things that weren't in the scope of the function we're inlining
5952 from aren't in the scope we're inlining to, either. */
5954 else if (TREE_STATIC (decl
))
5955 /* Function-scoped static variables should stay in the original
5960 /* Ordinary automatic local variables are now in the scope of the
5962 DECL_CONTEXT (copy
) = id
->dst_fn
;
5963 if (VAR_P (copy
) && id
->dst_simt_vars
&& !is_gimple_reg (copy
))
5965 if (!lookup_attribute ("omp simt private", DECL_ATTRIBUTES (copy
)))
5966 DECL_ATTRIBUTES (copy
)
5967 = tree_cons (get_identifier ("omp simt private"), NULL
,
5968 DECL_ATTRIBUTES (copy
));
5969 id
->dst_simt_vars
->safe_push (copy
);
5976 /* Create a new VAR_DECL that is indentical in all respect to DECL except that
5977 DECL can be either a VAR_DECL, a PARM_DECL or RESULT_DECL. The original
5978 DECL must come from ID->src_fn and the copy will be part of ID->dst_fn. */
5981 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5985 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5986 || TREE_CODE (decl
) == RESULT_DECL
);
5988 type
= TREE_TYPE (decl
);
5990 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5991 VAR_DECL
, DECL_NAME (decl
), type
);
5992 if (DECL_PT_UID_SET_P (decl
))
5993 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5994 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5995 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5996 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5997 DECL_NOT_GIMPLE_REG_P (copy
) = DECL_NOT_GIMPLE_REG_P (decl
);
5998 DECL_BY_REFERENCE (copy
) = DECL_BY_REFERENCE (decl
);
6000 return copy_decl_for_dup_finish (id
, decl
, copy
);
6003 /* Like copy_decl_to_var, but create a return slot object instead of a
6004 pointer variable for return by invisible reference. */
6007 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
6011 gcc_assert (TREE_CODE (decl
) == PARM_DECL
6012 || TREE_CODE (decl
) == RESULT_DECL
);
6014 type
= TREE_TYPE (decl
);
6015 if (DECL_BY_REFERENCE (decl
))
6016 type
= TREE_TYPE (type
);
6018 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
6019 VAR_DECL
, DECL_NAME (decl
), type
);
6020 if (DECL_PT_UID_SET_P (decl
))
6021 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
6022 TREE_READONLY (copy
) = TREE_READONLY (decl
);
6023 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
6024 if (!DECL_BY_REFERENCE (decl
))
6026 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
6027 DECL_NOT_GIMPLE_REG_P (copy
)
6028 = (DECL_NOT_GIMPLE_REG_P (decl
)
6029 /* RESULT_DECLs are treated special by needs_to_live_in_memory,
6030 mirror that to the created VAR_DECL. */
6031 || (TREE_CODE (decl
) == RESULT_DECL
6032 && aggregate_value_p (decl
, id
->src_fn
)));
6035 return copy_decl_for_dup_finish (id
, decl
, copy
);
6039 copy_decl_no_change (tree decl
, copy_body_data
*id
)
6043 copy
= copy_node (decl
);
6045 /* The COPY is not abstract; it will be generated in DST_FN. */
6046 DECL_ABSTRACT_P (copy
) = false;
6047 lang_hooks
.dup_lang_specific_decl (copy
);
6049 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
6050 been taken; it's for internal bookkeeping in expand_goto_internal. */
6051 if (TREE_CODE (copy
) == LABEL_DECL
)
6053 TREE_ADDRESSABLE (copy
) = 0;
6054 LABEL_DECL_UID (copy
) = -1;
6057 return copy_decl_for_dup_finish (id
, decl
, copy
);
6061 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
6063 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
6064 return copy_decl_to_var (decl
, id
);
6066 return copy_decl_no_change (decl
, id
);
6069 /* Return a copy of the function's argument tree without any modifications. */
6072 copy_arguments_nochange (tree orig_parm
, copy_body_data
* id
)
6075 tree new_parm
= NULL
;
6078 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
))
6080 tree new_tree
= remap_decl (arg
, id
);
6081 if (TREE_CODE (new_tree
) != PARM_DECL
)
6082 new_tree
= id
->copy_decl (arg
, id
);
6083 lang_hooks
.dup_lang_specific_decl (new_tree
);
6085 parg
= &DECL_CHAIN (new_tree
);
6090 /* Return a copy of the function's static chain. */
6092 copy_static_chain (tree static_chain
, copy_body_data
* id
)
6094 tree
*chain_copy
, *pvar
;
6096 chain_copy
= &static_chain
;
6097 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
6099 tree new_tree
= remap_decl (*pvar
, id
);
6100 lang_hooks
.dup_lang_specific_decl (new_tree
);
6101 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
6104 return static_chain
;
6107 /* Return true if the function is allowed to be versioned.
6108 This is a guard for the versioning functionality. */
6111 tree_versionable_function_p (tree fndecl
)
6113 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
6114 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
)) == NULL
);
6117 /* Update clone info after duplication. */
6120 update_clone_info (copy_body_data
* id
)
6122 struct cgraph_node
*this_node
= id
->dst_node
;
6123 if (!this_node
->clones
)
6125 for (cgraph_node
*node
= this_node
->clones
; node
!= this_node
;)
6127 /* First update replace maps to match the new body. */
6128 clone_info
*info
= clone_info::get (node
);
6129 if (info
&& info
->tree_map
)
6132 for (i
= 0; i
< vec_safe_length (info
->tree_map
); i
++)
6134 struct ipa_replace_map
*replace_info
;
6135 replace_info
= (*info
->tree_map
)[i
];
6136 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
6141 node
= node
->clones
;
6142 else if (node
->next_sibling_clone
)
6143 node
= node
->next_sibling_clone
;
6146 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
6147 node
= node
->clone_of
;
6148 if (node
!= id
->dst_node
)
6149 node
= node
->next_sibling_clone
;
6154 /* Create a copy of a function's tree.
6155 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
6156 of the original function and the new copied function
6157 respectively. In case we want to replace a DECL
6158 tree with another tree while duplicating the function's
6159 body, TREE_MAP represents the mapping between these
6160 trees. If UPDATE_CLONES is set, the call_stmt fields
6161 of edges of clones of the function will be updated.
6163 If non-NULL PARAM_ADJUSTMENTS determines how function prototype (i.e. the
6164 function parameters and return value) should be modified).
6165 If non-NULL BLOCKS_TO_COPY determine what basic blocks to copy.
6166 If non_NULL NEW_ENTRY determine new entry BB of the clone.
6169 tree_function_versioning (tree old_decl
, tree new_decl
,
6170 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
6171 ipa_param_adjustments
*param_adjustments
,
6172 bool update_clones
, bitmap blocks_to_copy
,
6173 basic_block new_entry
)
6175 struct cgraph_node
*old_version_node
;
6176 struct cgraph_node
*new_version_node
;
6180 struct ipa_replace_map
*replace_info
;
6181 basic_block old_entry_block
, bb
;
6182 auto_vec
<gimple
*, 10> init_stmts
;
6183 tree vars
= NULL_TREE
;
6185 /* We can get called recursively from expand_call_inline via clone
6186 materialization. While expand_call_inline maintains input_location
6187 we cannot tolerate it to leak into the materialized clone. */
6188 location_t saved_location
= input_location
;
6189 input_location
= UNKNOWN_LOCATION
;
6191 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
6192 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
6193 DECL_POSSIBLY_INLINED (old_decl
) = 1;
6195 old_version_node
= cgraph_node::get (old_decl
);
6196 gcc_checking_assert (old_version_node
);
6197 new_version_node
= cgraph_node::get (new_decl
);
6198 gcc_checking_assert (new_version_node
);
6200 /* Copy over debug args. */
6201 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
6203 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
6204 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
6205 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
6206 old_debug_args
= decl_debug_args_lookup (old_decl
);
6209 new_debug_args
= decl_debug_args_insert (new_decl
);
6210 *new_debug_args
= vec_safe_copy (*old_debug_args
);
6214 /* Output the inlining info for this abstract function, since it has been
6215 inlined. If we don't do this now, we can lose the information about the
6216 variables in the function when the blocks get blown away as soon as we
6217 remove the cgraph node. */
6218 (*debug_hooks
->outlining_inline_function
) (old_decl
);
6220 DECL_ARTIFICIAL (new_decl
) = 1;
6221 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
6222 if (DECL_ORIGIN (old_decl
) == old_decl
)
6223 old_version_node
->used_as_abstract_origin
= true;
6224 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
6226 /* Prepare the data structures for the tree copy. */
6227 memset (&id
, 0, sizeof (id
));
6229 /* Generate a new name for the new version. */
6230 id
.statements_to_fold
= new hash_set
<gimple
*>;
6232 id
.decl_map
= new hash_map
<tree
, tree
>;
6233 id
.debug_map
= NULL
;
6234 id
.src_fn
= old_decl
;
6235 id
.dst_fn
= new_decl
;
6236 id
.src_node
= old_version_node
;
6237 id
.dst_node
= new_version_node
;
6238 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
6239 id
.blocks_to_copy
= blocks_to_copy
;
6241 id
.copy_decl
= copy_decl_no_change
;
6242 id
.transform_call_graph_edges
6243 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
6244 id
.transform_new_cfg
= true;
6245 id
.transform_return_to_modify
= false;
6246 id
.transform_parameter
= false;
6248 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (old_decl
));
6249 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
6250 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
6251 initialize_cfun (new_decl
, old_decl
,
6252 new_entry
? new_entry
->count
: old_entry_block
->count
);
6253 new_version_node
->calls_declare_variant_alt
6254 = old_version_node
->calls_declare_variant_alt
;
6255 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
6256 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
6257 = id
.src_cfun
->gimple_df
->ipa_pta
;
6259 /* Copy the function's static chain. */
6260 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
6262 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
6263 = copy_static_chain (p
, &id
);
6265 auto_vec
<int, 16> new_param_indices
;
6266 clone_info
*info
= clone_info::get (old_version_node
);
6267 ipa_param_adjustments
*old_param_adjustments
6268 = info
? info
->param_adjustments
: NULL
;
6269 if (old_param_adjustments
)
6270 old_param_adjustments
->get_updated_indices (&new_param_indices
);
6272 /* If there's a tree_map, prepare for substitution. */
6274 for (i
= 0; i
< tree_map
->length (); i
++)
6277 replace_info
= (*tree_map
)[i
];
6279 int p
= replace_info
->parm_num
;
6280 if (old_param_adjustments
)
6281 p
= new_param_indices
[p
];
6284 for (parm
= DECL_ARGUMENTS (old_decl
); p
;
6285 parm
= DECL_CHAIN (parm
))
6288 init
= setup_one_parameter (&id
, parm
, replace_info
->new_tree
,
6289 id
.src_fn
, NULL
, &vars
);
6291 init_stmts
.safe_push (init
);
6294 ipa_param_body_adjustments
*param_body_adjs
= NULL
;
6295 if (param_adjustments
)
6297 param_body_adjs
= new ipa_param_body_adjustments (param_adjustments
,
6299 &id
, &vars
, tree_map
);
6300 id
.param_body_adjs
= param_body_adjs
;
6301 DECL_ARGUMENTS (new_decl
) = param_body_adjs
->get_new_param_chain ();
6303 else if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
6304 DECL_ARGUMENTS (new_decl
)
6305 = copy_arguments_nochange (DECL_ARGUMENTS (old_decl
), &id
);
6307 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
6308 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
6310 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
6312 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
6313 /* Add local vars. */
6314 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
6316 if (DECL_RESULT (old_decl
) == NULL_TREE
)
6318 else if (param_adjustments
&& param_adjustments
->m_skip_return
6319 && !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
6321 tree resdecl_repl
= copy_result_decl_to_var (DECL_RESULT (old_decl
),
6323 declare_inline_vars (NULL
, resdecl_repl
);
6324 if (DECL_BY_REFERENCE (DECL_RESULT (old_decl
)))
6325 resdecl_repl
= build_fold_addr_expr (resdecl_repl
);
6326 insert_decl_map (&id
, DECL_RESULT (old_decl
), resdecl_repl
);
6328 DECL_RESULT (new_decl
)
6329 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
6330 RESULT_DECL
, NULL_TREE
, void_type_node
);
6331 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
6332 DECL_IS_MALLOC (new_decl
) = false;
6333 cfun
->returns_struct
= 0;
6334 cfun
->returns_pcc_struct
= 0;
6339 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
6340 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
6341 if (gimple_in_ssa_p (id
.src_cfun
)
6342 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
6343 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
6345 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
6346 insert_decl_map (&id
, old_name
, new_name
);
6347 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
6348 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
6352 /* Set up the destination functions loop tree. */
6353 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
6355 cfun
->curr_properties
&= ~PROP_loops
;
6356 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
6357 cfun
->curr_properties
|= PROP_loops
;
6360 /* Copy the Function's body. */
6361 copy_body (&id
, ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
6364 /* Renumber the lexical scoping (non-code) blocks consecutively. */
6365 number_blocks (new_decl
);
6367 /* We want to create the BB unconditionally, so that the addition of
6368 debug stmts doesn't affect BB count, which may in the end cause
6369 codegen differences. */
6370 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6371 while (init_stmts
.length ())
6372 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
6373 if (param_body_adjs
)
6374 param_body_adjs
->append_init_stmts (bb
);
6375 update_clone_info (&id
);
6377 /* Remap the nonlocal_goto_save_area, if any. */
6378 if (cfun
->nonlocal_goto_save_area
)
6380 struct walk_stmt_info wi
;
6382 memset (&wi
, 0, sizeof (wi
));
6384 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
6390 delete id
.debug_map
;
6391 free_dominance_info (CDI_DOMINATORS
);
6392 free_dominance_info (CDI_POST_DOMINATORS
);
6394 update_max_bb_count ();
6395 fold_marked_statements (0, id
.statements_to_fold
);
6396 delete id
.statements_to_fold
;
6397 delete_unreachable_blocks_update_callgraph (id
.dst_node
, update_clones
);
6398 if (id
.dst_node
->definition
)
6399 cgraph_edge::rebuild_references ();
6400 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
6402 calculate_dominance_info (CDI_DOMINATORS
);
6403 fix_loop_structure (NULL
);
6405 update_ssa (TODO_update_ssa
);
6407 /* After partial cloning we need to rescale frequencies, so they are
6408 within proper range in the cloned function. */
6411 struct cgraph_edge
*e
;
6412 rebuild_frequencies ();
6414 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
6415 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
6417 basic_block bb
= gimple_bb (e
->call_stmt
);
6418 e
->count
= bb
->count
;
6420 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
6422 basic_block bb
= gimple_bb (e
->call_stmt
);
6423 e
->count
= bb
->count
;
6427 if (param_body_adjs
&& MAY_HAVE_DEBUG_BIND_STMTS
)
6429 vec
<tree
, va_gc
> **debug_args
= NULL
;
6430 unsigned int len
= 0;
6431 unsigned reset_len
= param_body_adjs
->m_reset_debug_decls
.length ();
6433 for (i
= 0; i
< reset_len
; i
++)
6435 tree parm
= param_body_adjs
->m_reset_debug_decls
[i
];
6436 gcc_assert (is_gimple_reg (parm
));
6439 if (debug_args
== NULL
)
6441 debug_args
= decl_debug_args_insert (new_decl
);
6442 len
= vec_safe_length (*debug_args
);
6444 ddecl
= build_debug_expr_decl (TREE_TYPE (parm
));
6445 /* FIXME: Is setting the mode really necessary? */
6446 SET_DECL_MODE (ddecl
, DECL_MODE (parm
));
6447 vec_safe_push (*debug_args
, DECL_ORIGIN (parm
));
6448 vec_safe_push (*debug_args
, ddecl
);
6450 if (debug_args
!= NULL
)
6452 /* On the callee side, add
6455 stmts to the first bb where var is a VAR_DECL created for the
6456 optimized away parameter in DECL_INITIAL block. This hints
6457 in the debug info that var (whole DECL_ORIGIN is the parm
6458 PARM_DECL) is optimized away, but could be looked up at the
6459 call site as value of D#X there. */
6460 gimple_stmt_iterator cgsi
6461 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6464 i
= vec_safe_length (*debug_args
);
6467 tree vexpr
= NULL_TREE
;
6469 while (var
!= NULL_TREE
6470 && DECL_ABSTRACT_ORIGIN (var
) != (**debug_args
)[i
])
6471 var
= TREE_CHAIN (var
);
6472 if (var
== NULL_TREE
)
6474 tree parm
= (**debug_args
)[i
];
6475 if (tree parm_ddef
= ssa_default_def (id
.src_cfun
, parm
))
6477 = param_body_adjs
->m_dead_ssa_debug_equiv
.get (parm_ddef
))
6481 vexpr
= build_debug_expr_decl (TREE_TYPE (parm
));
6482 /* FIXME: Is setting the mode really necessary? */
6483 SET_DECL_MODE (vexpr
, DECL_MODE (parm
));
6485 def_temp
= gimple_build_debug_bind (var
, vexpr
, NULL
);
6486 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6487 def_temp
= gimple_build_debug_source_bind (vexpr
, parm
, NULL
);
6488 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6493 delete param_body_adjs
;
6494 free_dominance_info (CDI_DOMINATORS
);
6495 free_dominance_info (CDI_POST_DOMINATORS
);
6497 gcc_assert (!id
.debug_stmts
.exists ());
6499 input_location
= saved_location
;
6503 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6504 the callee and return the inlined body on success. */
6507 maybe_inline_call_in_expr (tree exp
)
6509 tree fn
= get_callee_fndecl (exp
);
6511 /* We can only try to inline "const" functions. */
6512 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
6514 call_expr_arg_iterator iter
;
6517 hash_map
<tree
, tree
> decl_map
;
6519 /* Remap the parameters. */
6520 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
6522 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
6523 decl_map
.put (param
, arg
);
6525 memset (&id
, 0, sizeof (id
));
6527 id
.dst_fn
= current_function_decl
;
6528 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6529 id
.decl_map
= &decl_map
;
6531 id
.copy_decl
= copy_decl_no_change
;
6532 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6533 id
.transform_new_cfg
= false;
6534 id
.transform_return_to_modify
= true;
6535 id
.transform_parameter
= true;
6537 /* Make sure not to unshare trees behind the front-end's back
6538 since front-end specific mechanisms may rely on sharing. */
6539 id
.regimplify
= false;
6540 id
.do_not_unshare
= true;
6542 /* We're not inside any EH region. */
6545 t
= copy_tree_body (&id
);
6547 /* We can only return something suitable for use in a GENERIC
6549 if (TREE_CODE (t
) == MODIFY_EXPR
)
6550 return TREE_OPERAND (t
, 1);
6556 /* Duplicate a type, fields and all. */
6559 build_duplicate_type (tree type
)
6561 struct copy_body_data id
;
6563 memset (&id
, 0, sizeof (id
));
6564 id
.src_fn
= current_function_decl
;
6565 id
.dst_fn
= current_function_decl
;
6567 id
.decl_map
= new hash_map
<tree
, tree
>;
6568 id
.debug_map
= NULL
;
6569 id
.copy_decl
= copy_decl_no_change
;
6571 type
= remap_type_1 (type
, &id
);
6575 delete id
.debug_map
;
6577 TYPE_CANONICAL (type
) = type
;
6582 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6583 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6587 copy_fn (tree fn
, tree
& parms
, tree
& result
)
6591 hash_map
<tree
, tree
> decl_map
;
6596 memset (&id
, 0, sizeof (id
));
6598 id
.dst_fn
= current_function_decl
;
6599 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6600 id
.decl_map
= &decl_map
;
6602 id
.copy_decl
= copy_decl_no_change
;
6603 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6604 id
.transform_new_cfg
= false;
6605 id
.transform_return_to_modify
= false;
6606 id
.transform_parameter
= true;
6608 /* Make sure not to unshare trees behind the front-end's back
6609 since front-end specific mechanisms may rely on sharing. */
6610 id
.regimplify
= false;
6611 id
.do_not_unshare
= true;
6612 id
.do_not_fold
= true;
6614 /* We're not inside any EH region. */
6617 /* Remap the parameters and result and return them to the caller. */
6618 for (param
= DECL_ARGUMENTS (fn
);
6620 param
= DECL_CHAIN (param
))
6622 *p
= remap_decl (param
, &id
);
6623 p
= &DECL_CHAIN (*p
);
6626 if (DECL_RESULT (fn
))
6627 result
= remap_decl (DECL_RESULT (fn
), &id
);
6631 return copy_tree_body (&id
);