2 Copyright (C) 2001-2020 Free Software Foundation, Inc.
3 Contributed by Alexandre Oliva <aoliva@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
30 #include "tree-pass.h"
33 #include "tree-pretty-print.h"
34 #include "diagnostic-core.h"
35 #include "gimple-predict.h"
36 #include "fold-const.h"
37 #include "stor-layout.h"
39 #include "tree-inline.h"
40 #include "langhooks.h"
42 #include "tree-iterator.h"
44 #include "gimple-fold.h"
47 #include "gimple-iterator.h"
48 #include "gimplify-me.h"
49 #include "gimple-walk.h"
51 #include "tree-into-ssa.h"
56 #include "value-prof.h"
59 #include "stringpool.h"
62 #include "tree-cfgcleanup.h"
63 #include "tree-ssa-live.h"
65 /* I'm not real happy about this, but we need to handle gimple and
68 /* Inlining, Cloning, Versioning, Parallelization
70 Inlining: a function body is duplicated, but the PARM_DECLs are
71 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
72 MODIFY_EXPRs that store to a dedicated returned-value variable.
73 The duplicated eh_region info of the copy will later be appended
74 to the info for the caller; the eh_region info in copied throwing
75 statements and RESX statements are adjusted accordingly.
77 Cloning: (only in C++) We have one body for a con/de/structor, and
78 multiple function decls, each with a unique parameter list.
79 Duplicate the body, using the given splay tree; some parameters
80 will become constants (like 0 or 1).
82 Versioning: a function body is duplicated and the result is a new
83 function rather than into blocks of an existing function as with
84 inlining. Some parameters will become constants.
86 Parallelization: a region of a function is duplicated resulting in
87 a new function. Variables may be replaced with complex expressions
88 to enable shared variable semantics.
90 All of these will simultaneously lookup any callgraph edges. If
91 we're going to inline the duplicated function body, and the given
92 function has some cloned callgraph nodes (one for each place this
93 function will be inlined) those callgraph edges will be duplicated.
94 If we're cloning the body, those callgraph edges will be
95 updated to point into the new body. (Note that the original
96 callgraph node and edge list will not be altered.)
98 See the CALL_EXPR handling case in copy_tree_body_r (). */
102 o In order to make inlining-on-trees work, we pessimized
103 function-local static constants. In particular, they are now
104 always output, even when not addressed. Fix this by treating
105 function-local static constants just like global static
106 constants; the back-end already knows not to output them if they
109 o Provide heuristics to clamp inlining of recursive template
113 /* Weights that estimate_num_insns uses to estimate the size of the
116 eni_weights eni_size_weights
;
118 /* Weights that estimate_num_insns uses to estimate the time necessary
119 to execute the produced code. */
121 eni_weights eni_time_weights
;
125 static tree
declare_return_variable (copy_body_data
*, tree
, tree
,
127 static void remap_block (tree
*, copy_body_data
*);
128 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
129 static void declare_inline_vars (tree
, tree
);
130 static void remap_save_expr (tree
*, hash_map
<tree
, tree
> *, int *);
131 static void prepend_lexical_block (tree current_block
, tree new_block
);
132 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
133 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
134 static gimple_seq
remap_gimple_stmt (gimple
*, copy_body_data
*);
135 static void insert_init_stmt (copy_body_data
*, basic_block
, gimple
*);
137 /* Insert a tree->tree mapping for ID. Despite the name suggests
138 that the trees should be variables, it is used for more than that. */
141 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
143 id
->decl_map
->put (key
, value
);
145 /* Always insert an identity map as well. If we see this same new
146 node again, we won't want to duplicate it a second time. */
148 id
->decl_map
->put (value
, value
);
151 /* Insert a tree->tree mapping for ID. This is only used for
155 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
157 if (!gimple_in_ssa_p (id
->src_cfun
))
160 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
163 if (!target_for_debug_bind (key
))
166 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
167 gcc_assert (VAR_P (value
));
170 id
->debug_map
= new hash_map
<tree
, tree
>;
172 id
->debug_map
->put (key
, value
);
175 /* If nonzero, we're remapping the contents of inlined debug
176 statements. If negative, an error has occurred, such as a
177 reference to a variable that isn't available in the inlined
179 static int processing_debug_stmt
= 0;
181 /* Construct new SSA name for old NAME. ID is the inline context. */
184 remap_ssa_name (tree name
, copy_body_data
*id
)
189 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
191 n
= id
->decl_map
->get (name
);
194 /* WHen we perform edge redirection as part of CFG copy, IPA-SRA can
195 remove an unused LHS from a call statement. Such LHS can however
196 still appear in debug statements, but their value is lost in this
197 function and we do not want to map them. */
198 if (id
->killed_new_ssa_names
199 && id
->killed_new_ssa_names
->contains (*n
))
201 gcc_assert (processing_debug_stmt
);
202 processing_debug_stmt
= -1;
206 return unshare_expr (*n
);
209 if (processing_debug_stmt
)
211 if (SSA_NAME_IS_DEFAULT_DEF (name
)
212 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
213 && id
->entry_bb
== NULL
214 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
216 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
218 gimple_stmt_iterator gsi
;
219 tree val
= SSA_NAME_VAR (name
);
221 n
= id
->decl_map
->get (val
);
224 if (TREE_CODE (val
) != PARM_DECL
225 && !(VAR_P (val
) && DECL_ABSTRACT_ORIGIN (val
)))
227 processing_debug_stmt
= -1;
230 n
= id
->decl_map
->get (val
);
231 if (n
&& TREE_CODE (*n
) == DEBUG_EXPR_DECL
)
233 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
234 DECL_ARTIFICIAL (vexpr
) = 1;
235 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
236 SET_DECL_MODE (vexpr
, DECL_MODE (SSA_NAME_VAR (name
)));
237 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
238 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
239 insert_decl_map (id
, val
, vexpr
);
243 processing_debug_stmt
= -1;
247 /* Remap anonymous SSA names or SSA names of anonymous decls. */
248 var
= SSA_NAME_VAR (name
);
250 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
252 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
253 && DECL_ARTIFICIAL (var
)
254 && DECL_IGNORED_P (var
)
255 && !DECL_NAME (var
)))
257 struct ptr_info_def
*pi
;
258 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
));
259 if (!var
&& SSA_NAME_IDENTIFIER (name
))
260 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
261 insert_decl_map (id
, name
, new_tree
);
262 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
263 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
264 /* At least IPA points-to info can be directly transferred. */
265 if (id
->src_cfun
->gimple_df
266 && id
->src_cfun
->gimple_df
->ipa_pta
267 && POINTER_TYPE_P (TREE_TYPE (name
))
268 && (pi
= SSA_NAME_PTR_INFO (name
))
271 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
274 /* So can range-info. */
275 if (!POINTER_TYPE_P (TREE_TYPE (name
))
276 && SSA_NAME_RANGE_INFO (name
))
277 duplicate_ssa_name_range_info (new_tree
, SSA_NAME_RANGE_TYPE (name
),
278 SSA_NAME_RANGE_INFO (name
));
282 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
284 new_tree
= remap_decl (var
, id
);
286 /* We might've substituted constant or another SSA_NAME for
289 Replace the SSA name representing RESULT_DECL by variable during
290 inlining: this saves us from need to introduce PHI node in a case
291 return value is just partly initialized. */
292 if ((VAR_P (new_tree
) || TREE_CODE (new_tree
) == PARM_DECL
)
293 && (!SSA_NAME_VAR (name
)
294 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
295 || !id
->transform_return_to_modify
))
297 struct ptr_info_def
*pi
;
298 new_tree
= make_ssa_name (new_tree
);
299 insert_decl_map (id
, name
, new_tree
);
300 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
301 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
302 /* At least IPA points-to info can be directly transferred. */
303 if (id
->src_cfun
->gimple_df
304 && id
->src_cfun
->gimple_df
->ipa_pta
305 && POINTER_TYPE_P (TREE_TYPE (name
))
306 && (pi
= SSA_NAME_PTR_INFO (name
))
309 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
312 /* So can range-info. */
313 if (!POINTER_TYPE_P (TREE_TYPE (name
))
314 && SSA_NAME_RANGE_INFO (name
))
315 duplicate_ssa_name_range_info (new_tree
, SSA_NAME_RANGE_TYPE (name
),
316 SSA_NAME_RANGE_INFO (name
));
317 if (SSA_NAME_IS_DEFAULT_DEF (name
))
319 /* By inlining function having uninitialized variable, we might
320 extend the lifetime (variable might get reused). This cause
321 ICE in the case we end up extending lifetime of SSA name across
322 abnormal edge, but also increase register pressure.
324 We simply initialize all uninitialized vars by 0 except
325 for case we are inlining to very first BB. We can avoid
326 this for all BBs that are not inside strongly connected
327 regions of the CFG, but this is expensive to test. */
329 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
330 && (!SSA_NAME_VAR (name
)
331 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
332 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
334 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
336 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
338 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
340 init_stmt
= gimple_build_assign (new_tree
, zero
);
341 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
342 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
346 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
347 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
352 insert_decl_map (id
, name
, new_tree
);
356 /* Remap DECL during the copying of the BLOCK tree for the function. */
359 remap_decl (tree decl
, copy_body_data
*id
)
363 /* We only remap local variables in the current function. */
365 /* See if we have remapped this declaration. */
367 n
= id
->decl_map
->get (decl
);
369 if (!n
&& processing_debug_stmt
)
371 processing_debug_stmt
= -1;
375 /* When remapping a type within copy_gimple_seq_and_replace_locals, all
376 necessary DECLs have already been remapped and we do not want to duplicate
377 a decl coming from outside of the sequence we are copying. */
379 && id
->prevent_decl_creation_for_types
380 && id
->remapping_type_depth
> 0
381 && (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
))
384 /* If we didn't already have an equivalent for this declaration, create one
388 /* Make a copy of the variable or label. */
389 tree t
= id
->copy_decl (decl
, id
);
391 /* Remember it, so that if we encounter this local entity again
392 we can reuse this copy. Do this early because remap_type may
393 need this decl for TYPE_STUB_DECL. */
394 insert_decl_map (id
, decl
, t
);
399 /* Remap types, if necessary. */
400 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
401 if (TREE_CODE (t
) == TYPE_DECL
)
403 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
405 /* Preserve the invariant that DECL_ORIGINAL_TYPE != TREE_TYPE,
406 which is enforced in gen_typedef_die when DECL_ABSTRACT_ORIGIN
407 is not set on the TYPE_DECL, for example in LTO mode. */
408 if (DECL_ORIGINAL_TYPE (t
) == TREE_TYPE (t
))
410 tree x
= build_variant_type_copy (TREE_TYPE (t
));
411 TYPE_STUB_DECL (x
) = TYPE_STUB_DECL (TREE_TYPE (t
));
412 TYPE_NAME (x
) = TYPE_NAME (TREE_TYPE (t
));
413 DECL_ORIGINAL_TYPE (t
) = x
;
417 /* Remap sizes as necessary. */
418 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
419 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
421 /* If fields, do likewise for offset and qualifier. */
422 if (TREE_CODE (t
) == FIELD_DECL
)
424 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
425 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
426 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
432 if (id
->do_not_unshare
)
435 return unshare_expr (*n
);
439 remap_type_1 (tree type
, copy_body_data
*id
)
443 /* We do need a copy. build and register it now. If this is a pointer or
444 reference type, remap the designated type and make a new pointer or
446 if (TREE_CODE (type
) == POINTER_TYPE
)
448 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
450 TYPE_REF_CAN_ALIAS_ALL (type
));
451 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
452 new_tree
= build_type_attribute_qual_variant (new_tree
,
453 TYPE_ATTRIBUTES (type
),
455 insert_decl_map (id
, type
, new_tree
);
458 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
460 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
462 TYPE_REF_CAN_ALIAS_ALL (type
));
463 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
464 new_tree
= build_type_attribute_qual_variant (new_tree
,
465 TYPE_ATTRIBUTES (type
),
467 insert_decl_map (id
, type
, new_tree
);
471 new_tree
= copy_node (type
);
473 insert_decl_map (id
, type
, new_tree
);
475 /* This is a new type, not a copy of an old type. Need to reassociate
476 variants. We can handle everything except the main variant lazily. */
477 t
= TYPE_MAIN_VARIANT (type
);
480 t
= remap_type (t
, id
);
481 TYPE_MAIN_VARIANT (new_tree
) = t
;
482 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
483 TYPE_NEXT_VARIANT (t
) = new_tree
;
487 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
488 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
491 if (TYPE_STUB_DECL (type
))
492 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
494 /* Lazily create pointer and reference types. */
495 TYPE_POINTER_TO (new_tree
) = NULL
;
496 TYPE_REFERENCE_TO (new_tree
) = NULL
;
498 /* Copy all types that may contain references to local variables; be sure to
499 preserve sharing in between type and its main variant when possible. */
500 switch (TREE_CODE (new_tree
))
504 case FIXED_POINT_TYPE
:
507 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
509 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
510 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
512 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
513 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
517 t
= TYPE_MIN_VALUE (new_tree
);
518 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
519 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
521 t
= TYPE_MAX_VALUE (new_tree
);
522 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
523 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
528 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
529 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
530 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
532 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
533 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
534 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
535 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
537 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
541 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
542 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
543 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
545 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
547 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
549 gcc_checking_assert (TYPE_DOMAIN (type
)
550 == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
551 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
555 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
556 /* For array bounds where we have decided not to copy over the bounds
557 variable which isn't used in OpenMP/OpenACC region, change them to
558 an uninitialized VAR_DECL temporary. */
559 if (id
->adjust_array_error_bounds
560 && TYPE_DOMAIN (new_tree
)
561 && TYPE_MAX_VALUE (TYPE_DOMAIN (new_tree
)) == error_mark_node
562 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) != error_mark_node
)
564 tree v
= create_tmp_var (TREE_TYPE (TYPE_DOMAIN (new_tree
)));
566 = tree_cons (get_identifier ("omp dummy var"), NULL_TREE
,
567 DECL_ATTRIBUTES (v
));
568 TYPE_MAX_VALUE (TYPE_DOMAIN (new_tree
)) = v
;
575 case QUAL_UNION_TYPE
:
576 if (TYPE_MAIN_VARIANT (type
) != type
577 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
578 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
583 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
585 t
= remap_decl (f
, id
);
586 DECL_CONTEXT (t
) = new_tree
;
590 TYPE_FIELDS (new_tree
) = nreverse (nf
);
596 /* Shouldn't have been thought variable sized. */
600 /* All variants of type share the same size, so use the already remaped data. */
601 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
603 tree s
= TYPE_SIZE (type
);
604 tree mvs
= TYPE_SIZE (TYPE_MAIN_VARIANT (type
));
605 tree su
= TYPE_SIZE_UNIT (type
);
606 tree mvsu
= TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
));
607 gcc_checking_assert ((TREE_CODE (s
) == PLACEHOLDER_EXPR
608 && (TREE_CODE (mvs
) == PLACEHOLDER_EXPR
))
610 gcc_checking_assert ((TREE_CODE (su
) == PLACEHOLDER_EXPR
611 && (TREE_CODE (mvsu
) == PLACEHOLDER_EXPR
))
613 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
614 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
618 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
619 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
625 /* Helper function for remap_type_2, called through walk_tree. */
628 remap_type_3 (tree
*tp
, int *walk_subtrees
, void *data
)
630 copy_body_data
*id
= (copy_body_data
*) data
;
635 else if (DECL_P (*tp
) && remap_decl (*tp
, id
) != *tp
)
641 /* Return true if TYPE needs to be remapped because remap_decl on any
642 needed embedded decl returns something other than that decl. */
645 remap_type_2 (tree type
, copy_body_data
*id
)
649 #define RETURN_TRUE_IF_VAR(T) \
655 if (DECL_P (_t) && remap_decl (_t, id) != _t) \
657 if (!TYPE_SIZES_GIMPLIFIED (type) \
658 && walk_tree (&_t, remap_type_3, id, NULL)) \
664 switch (TREE_CODE (type
))
670 return remap_type_2 (TREE_TYPE (type
), id
);
674 case FIXED_POINT_TYPE
:
677 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
678 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
682 if (remap_type_2 (TREE_TYPE (type
), id
)
683 || (TYPE_DOMAIN (type
) && remap_type_2 (TYPE_DOMAIN (type
), id
)))
689 case QUAL_UNION_TYPE
:
690 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
691 if (TREE_CODE (t
) == FIELD_DECL
)
693 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
694 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
695 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
696 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
697 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
705 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
706 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
708 #undef RETURN_TRUE_IF_VAR
712 remap_type (tree type
, copy_body_data
*id
)
720 /* See if we have remapped this type. */
721 node
= id
->decl_map
->get (type
);
725 /* The type only needs remapping if it's variably modified. */
726 if (! variably_modified_type_p (type
, id
->src_fn
)
727 /* Don't remap if copy_decl method doesn't always return a new
728 decl and for all embedded decls returns the passed in decl. */
729 || (id
->dont_remap_vla_if_no_change
&& !remap_type_2 (type
, id
)))
731 insert_decl_map (id
, type
, type
);
735 id
->remapping_type_depth
++;
736 tmp
= remap_type_1 (type
, id
);
737 id
->remapping_type_depth
--;
742 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
745 can_be_nonlocal (tree decl
, copy_body_data
*id
)
747 /* We cannot duplicate function decls. */
748 if (TREE_CODE (decl
) == FUNCTION_DECL
)
751 /* Local static vars must be non-local or we get multiple declaration
753 if (VAR_P (decl
) && !auto_var_in_fn_p (decl
, id
->src_fn
))
760 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
764 tree new_decls
= NULL_TREE
;
766 /* Remap its variables. */
767 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
771 if (can_be_nonlocal (old_var
, id
))
773 /* We need to add this variable to the local decls as otherwise
774 nothing else will do so. */
775 if (VAR_P (old_var
) && ! DECL_EXTERNAL (old_var
) && cfun
)
776 add_local_decl (cfun
, old_var
);
777 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
778 && !DECL_IGNORED_P (old_var
)
779 && nonlocalized_list
)
780 vec_safe_push (*nonlocalized_list
, old_var
);
784 /* Remap the variable. */
785 new_var
= remap_decl (old_var
, id
);
787 /* If we didn't remap this variable, we can't mess with its
788 TREE_CHAIN. If we remapped this variable to the return slot, it's
789 already declared somewhere else, so don't declare it here. */
791 if (new_var
== id
->retvar
)
795 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
796 && !DECL_IGNORED_P (old_var
)
797 && nonlocalized_list
)
798 vec_safe_push (*nonlocalized_list
, old_var
);
802 gcc_assert (DECL_P (new_var
));
803 DECL_CHAIN (new_var
) = new_decls
;
806 /* Also copy value-expressions. */
807 if (VAR_P (new_var
) && DECL_HAS_VALUE_EXPR_P (new_var
))
809 tree tem
= DECL_VALUE_EXPR (new_var
);
810 bool old_regimplify
= id
->regimplify
;
811 id
->remapping_type_depth
++;
812 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
813 id
->remapping_type_depth
--;
814 id
->regimplify
= old_regimplify
;
815 SET_DECL_VALUE_EXPR (new_var
, tem
);
820 return nreverse (new_decls
);
823 /* Copy the BLOCK to contain remapped versions of the variables
824 therein. And hook the new block into the block-tree. */
827 remap_block (tree
*block
, copy_body_data
*id
)
832 /* Make the new block. */
834 new_block
= make_node (BLOCK
);
835 TREE_USED (new_block
) = TREE_USED (old_block
);
836 BLOCK_ABSTRACT_ORIGIN (new_block
) = BLOCK_ORIGIN (old_block
);
837 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
838 BLOCK_NONLOCALIZED_VARS (new_block
)
839 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
842 /* Remap its variables. */
843 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
844 &BLOCK_NONLOCALIZED_VARS (new_block
),
847 if (id
->transform_lang_insert_block
)
848 id
->transform_lang_insert_block (new_block
);
850 /* Remember the remapped block. */
851 insert_decl_map (id
, old_block
, new_block
);
854 /* Copy the whole block tree and root it in id->block. */
857 remap_blocks (tree block
, copy_body_data
*id
)
860 tree new_tree
= block
;
865 remap_block (&new_tree
, id
);
866 gcc_assert (new_tree
!= block
);
867 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
868 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
869 /* Blocks are in arbitrary order, but make things slightly prettier and do
870 not swap order when producing a copy. */
871 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
875 /* Remap the block tree rooted at BLOCK to nothing. */
878 remap_blocks_to_null (tree block
, copy_body_data
*id
)
881 insert_decl_map (id
, block
, NULL_TREE
);
882 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
883 remap_blocks_to_null (t
, id
);
886 /* Remap the location info pointed to by LOCUS. */
889 remap_location (location_t locus
, copy_body_data
*id
)
891 if (LOCATION_BLOCK (locus
))
893 tree
*n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
896 return set_block (locus
, *n
);
899 locus
= LOCATION_LOCUS (locus
);
901 if (locus
!= UNKNOWN_LOCATION
&& id
->block
)
902 return set_block (locus
, id
->block
);
908 copy_statement_list (tree
*tp
)
910 tree_stmt_iterator oi
, ni
;
913 new_tree
= alloc_stmt_list ();
914 ni
= tsi_start (new_tree
);
915 oi
= tsi_start (*tp
);
916 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
919 for (; !tsi_end_p (oi
); tsi_next (&oi
))
921 tree stmt
= tsi_stmt (oi
);
922 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
923 /* This copy is not redundant; tsi_link_after will smash this
924 STATEMENT_LIST into the end of the one we're building, and we
925 don't want to do that with the original. */
926 copy_statement_list (&stmt
);
927 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
932 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
934 tree block
= BIND_EXPR_BLOCK (*tp
);
935 /* Copy (and replace) the statement. */
936 copy_tree_r (tp
, walk_subtrees
, NULL
);
939 remap_block (&block
, id
);
940 BIND_EXPR_BLOCK (*tp
) = block
;
943 if (BIND_EXPR_VARS (*tp
))
944 /* This will remap a lot of the same decls again, but this should be
946 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
950 /* Create a new gimple_seq by remapping all the statements in BODY
951 using the inlining information in ID. */
954 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
956 gimple_stmt_iterator si
;
957 gimple_seq new_body
= NULL
;
959 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
961 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
962 gimple_seq_add_seq (&new_body
, new_stmts
);
969 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
970 block using the mapping information in ID. */
973 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
976 tree new_block
, new_vars
;
977 gimple_seq body
, new_body
;
979 /* Copy the statement. Note that we purposely don't use copy_stmt
980 here because we need to remap statements as we copy. */
981 body
= gimple_bind_body (stmt
);
982 new_body
= remap_gimple_seq (body
, id
);
984 new_block
= gimple_bind_block (stmt
);
986 remap_block (&new_block
, id
);
988 /* This will remap a lot of the same decls again, but this should be
990 new_vars
= gimple_bind_vars (stmt
);
992 new_vars
= remap_decls (new_vars
, NULL
, id
);
994 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
999 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
1004 if (TREE_CODE (decl
) == SSA_NAME
)
1006 decl
= SSA_NAME_VAR (decl
);
1011 return (TREE_CODE (decl
) == PARM_DECL
);
1014 /* Remap the dependence CLIQUE from the source to the destination function
1015 as specified in ID. */
1017 static unsigned short
1018 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
1020 if (clique
== 0 || processing_debug_stmt
)
1022 if (!id
->dependence_map
)
1023 id
->dependence_map
= new hash_map
<dependence_hash
, unsigned short>;
1025 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
1028 /* Clique 1 is reserved for local ones set by PTA. */
1029 if (cfun
->last_clique
== 0)
1030 cfun
->last_clique
= 1;
1031 newc
= ++cfun
->last_clique
;
1036 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
1037 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
1038 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
1039 recursing into the children nodes of *TP. */
1042 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
1044 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
1045 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
1046 tree fn
= id
->src_fn
;
1048 /* For recursive invocations this is no longer the LHS itself. */
1049 bool is_lhs
= wi_p
->is_lhs
;
1050 wi_p
->is_lhs
= false;
1052 if (TREE_CODE (*tp
) == SSA_NAME
)
1054 *tp
= remap_ssa_name (*tp
, id
);
1057 SSA_NAME_DEF_STMT (*tp
) = wi_p
->stmt
;
1060 else if (auto_var_in_fn_p (*tp
, fn
))
1062 /* Local variables and labels need to be replaced by equivalent
1063 variables. We don't want to copy static variables; there's
1064 only one of those, no matter how many times we inline the
1065 containing function. Similarly for globals from an outer
1069 /* Remap the declaration. */
1070 new_decl
= remap_decl (*tp
, id
);
1071 gcc_assert (new_decl
);
1072 /* Replace this variable with the copy. */
1073 STRIP_TYPE_NOPS (new_decl
);
1074 /* ??? The C++ frontend uses void * pointer zero to initialize
1075 any other type. This confuses the middle-end type verification.
1076 As cloned bodies do not go through gimplification again the fixup
1077 there doesn't trigger. */
1078 if (TREE_CODE (new_decl
) == INTEGER_CST
1079 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
1080 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
1084 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1086 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
1088 else if (TREE_CODE (*tp
) == LABEL_DECL
1089 && (!DECL_CONTEXT (*tp
)
1090 || decl_function_context (*tp
) == id
->src_fn
))
1091 /* These may need to be remapped for EH handling. */
1092 *tp
= remap_decl (*tp
, id
);
1093 else if (TREE_CODE (*tp
) == FIELD_DECL
)
1095 /* If the enclosing record type is variably_modified_type_p, the field
1096 has already been remapped. Otherwise, it need not be. */
1097 tree
*n
= id
->decl_map
->get (*tp
);
1102 else if (TYPE_P (*tp
))
1103 /* Types may need remapping as well. */
1104 *tp
= remap_type (*tp
, id
);
1105 else if (CONSTANT_CLASS_P (*tp
))
1107 /* If this is a constant, we have to copy the node iff the type
1108 will be remapped. copy_tree_r will not copy a constant. */
1109 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1111 if (new_type
== TREE_TYPE (*tp
))
1114 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1115 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1118 *tp
= copy_node (*tp
);
1119 TREE_TYPE (*tp
) = new_type
;
1124 /* Otherwise, just copy the node. Note that copy_tree_r already
1125 knows not to copy VAR_DECLs, etc., so this is safe. */
1127 if (TREE_CODE (*tp
) == MEM_REF
&& !id
->do_not_fold
)
1129 /* We need to re-canonicalize MEM_REFs from inline substitutions
1130 that can happen when a pointer argument is an ADDR_EXPR.
1131 Recurse here manually to allow that. */
1132 tree ptr
= TREE_OPERAND (*tp
, 0);
1133 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1135 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
1136 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1137 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1138 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1139 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1140 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1142 MR_DEPENDENCE_CLIQUE (*tp
)
1143 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1144 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1146 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1147 remapped a parameter as the property might be valid only
1148 for the parameter itself. */
1149 if (TREE_THIS_NOTRAP (old
)
1150 && (!is_parm (TREE_OPERAND (old
, 0))
1151 || (!id
->transform_parameter
&& is_parm (ptr
))))
1152 TREE_THIS_NOTRAP (*tp
) = 1;
1153 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1158 /* Here is the "usual case". Copy this tree node, and then
1159 tweak some special cases. */
1160 copy_tree_r (tp
, walk_subtrees
, NULL
);
1162 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1163 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1165 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1167 /* The copied TARGET_EXPR has never been expanded, even if the
1168 original node was expanded already. */
1169 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1170 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1172 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1174 /* Variable substitution need not be simple. In particular,
1175 the MEM_REF substitution above. Make sure that
1176 TREE_CONSTANT and friends are up-to-date. */
1177 int invariant
= is_gimple_min_invariant (*tp
);
1178 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
1179 recompute_tree_invariant_for_addr_expr (*tp
);
1181 /* If this used to be invariant, but is not any longer,
1182 then regimplification is probably needed. */
1183 if (invariant
&& !is_gimple_min_invariant (*tp
))
1184 id
->regimplify
= true;
1190 /* Update the TREE_BLOCK for the cloned expr. */
1193 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1194 tree old_block
= TREE_BLOCK (*tp
);
1198 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1202 TREE_SET_BLOCK (*tp
, new_block
);
1205 /* Keep iterating. */
1210 /* Called from copy_body_id via walk_tree. DATA is really a
1211 `copy_body_data *'. */
1214 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1216 copy_body_data
*id
= (copy_body_data
*) data
;
1217 tree fn
= id
->src_fn
;
1220 /* Begin by recognizing trees that we'll completely rewrite for the
1221 inlining context. Our output for these trees is completely
1222 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1223 into an edge). Further down, we'll handle trees that get
1224 duplicated and/or tweaked. */
1226 /* When requested, RETURN_EXPRs should be transformed to just the
1227 contained MODIFY_EXPR. The branch semantics of the return will
1228 be handled elsewhere by manipulating the CFG rather than a statement. */
1229 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1231 tree assignment
= TREE_OPERAND (*tp
, 0);
1233 /* If we're returning something, just turn that into an
1234 assignment into the equivalent of the original RESULT_DECL.
1235 If the "assignment" is just the result decl, the result
1236 decl has already been set (e.g. a recent "foo (&result_decl,
1237 ...)"); just toss the entire RETURN_EXPR. */
1238 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1240 /* Replace the RETURN_EXPR with (a copy of) the
1241 MODIFY_EXPR hanging underneath. */
1242 *tp
= copy_node (assignment
);
1244 else /* Else the RETURN_EXPR returns no value. */
1247 return (tree
) (void *)1;
1250 else if (TREE_CODE (*tp
) == SSA_NAME
)
1252 *tp
= remap_ssa_name (*tp
, id
);
1257 /* Local variables and labels need to be replaced by equivalent
1258 variables. We don't want to copy static variables; there's only
1259 one of those, no matter how many times we inline the containing
1260 function. Similarly for globals from an outer function. */
1261 else if (auto_var_in_fn_p (*tp
, fn
))
1265 /* Remap the declaration. */
1266 new_decl
= remap_decl (*tp
, id
);
1267 gcc_assert (new_decl
);
1268 /* Replace this variable with the copy. */
1269 STRIP_TYPE_NOPS (new_decl
);
1273 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1274 copy_statement_list (tp
);
1275 else if (TREE_CODE (*tp
) == SAVE_EXPR
1276 || TREE_CODE (*tp
) == TARGET_EXPR
)
1277 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1278 else if (TREE_CODE (*tp
) == LABEL_DECL
1279 && (! DECL_CONTEXT (*tp
)
1280 || decl_function_context (*tp
) == id
->src_fn
))
1281 /* These may need to be remapped for EH handling. */
1282 *tp
= remap_decl (*tp
, id
);
1283 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1284 copy_bind_expr (tp
, walk_subtrees
, id
);
1285 /* Types may need remapping as well. */
1286 else if (TYPE_P (*tp
))
1287 *tp
= remap_type (*tp
, id
);
1289 /* If this is a constant, we have to copy the node iff the type will be
1290 remapped. copy_tree_r will not copy a constant. */
1291 else if (CONSTANT_CLASS_P (*tp
))
1293 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1295 if (new_type
== TREE_TYPE (*tp
))
1298 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1299 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1302 *tp
= copy_node (*tp
);
1303 TREE_TYPE (*tp
) = new_type
;
1307 /* Otherwise, just copy the node. Note that copy_tree_r already
1308 knows not to copy VAR_DECLs, etc., so this is safe. */
1311 /* Here we handle trees that are not completely rewritten.
1312 First we detect some inlining-induced bogosities for
1314 if (TREE_CODE (*tp
) == MODIFY_EXPR
1315 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1316 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1318 /* Some assignments VAR = VAR; don't generate any rtl code
1319 and thus don't count as variable modification. Avoid
1320 keeping bogosities like 0 = 0. */
1321 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1324 n
= id
->decl_map
->get (decl
);
1328 STRIP_TYPE_NOPS (value
);
1329 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1331 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1332 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1336 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1338 /* Get rid of *& from inline substitutions that can happen when a
1339 pointer argument is an ADDR_EXPR. */
1340 tree decl
= TREE_OPERAND (*tp
, 0);
1341 tree
*n
= id
->decl_map
->get (decl
);
1344 /* If we happen to get an ADDR_EXPR in n->value, strip
1345 it manually here as we'll eventually get ADDR_EXPRs
1346 which lie about their types pointed to. In this case
1347 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1348 but we absolutely rely on that. As fold_indirect_ref
1349 does other useful transformations, try that first, though. */
1350 tree type
= TREE_TYPE (*tp
);
1351 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1353 *tp
= id
->do_not_fold
? NULL
: gimple_fold_indirect_ref (ptr
);
1356 type
= remap_type (type
, id
);
1357 if (TREE_CODE (ptr
) == ADDR_EXPR
&& !id
->do_not_fold
)
1360 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1361 /* ??? We should either assert here or build
1362 a VIEW_CONVERT_EXPR instead of blindly leaking
1363 incompatible types to our IL. */
1365 *tp
= TREE_OPERAND (ptr
, 0);
1369 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1370 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1371 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1372 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1373 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1374 have remapped a parameter as the property might be
1375 valid only for the parameter itself. */
1376 if (TREE_THIS_NOTRAP (old
)
1377 && (!is_parm (TREE_OPERAND (old
, 0))
1378 || (!id
->transform_parameter
&& is_parm (ptr
))))
1379 TREE_THIS_NOTRAP (*tp
) = 1;
1386 else if (TREE_CODE (*tp
) == MEM_REF
&& !id
->do_not_fold
)
1388 /* We need to re-canonicalize MEM_REFs from inline substitutions
1389 that can happen when a pointer argument is an ADDR_EXPR.
1390 Recurse here manually to allow that. */
1391 tree ptr
= TREE_OPERAND (*tp
, 0);
1392 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1394 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1395 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1396 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1397 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1398 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1399 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1401 MR_DEPENDENCE_CLIQUE (*tp
)
1402 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1403 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1405 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1406 remapped a parameter as the property might be valid only
1407 for the parameter itself. */
1408 if (TREE_THIS_NOTRAP (old
)
1409 && (!is_parm (TREE_OPERAND (old
, 0))
1410 || (!id
->transform_parameter
&& is_parm (ptr
))))
1411 TREE_THIS_NOTRAP (*tp
) = 1;
1412 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1417 /* Here is the "usual case". Copy this tree node, and then
1418 tweak some special cases. */
1419 copy_tree_r (tp
, walk_subtrees
, NULL
);
1421 /* If EXPR has block defined, map it to newly constructed block.
1422 When inlining we want EXPRs without block appear in the block
1423 of function call if we are not remapping a type. */
1426 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1427 if (TREE_BLOCK (*tp
))
1430 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1434 TREE_SET_BLOCK (*tp
, new_block
);
1437 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1438 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1440 /* The copied TARGET_EXPR has never been expanded, even if the
1441 original node was expanded already. */
1442 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1444 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1445 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1448 /* Variable substitution need not be simple. In particular, the
1449 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1450 and friends are up-to-date. */
1451 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1453 int invariant
= is_gimple_min_invariant (*tp
);
1454 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1456 /* Handle the case where we substituted an INDIRECT_REF
1457 into the operand of the ADDR_EXPR. */
1458 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
1459 && !id
->do_not_fold
)
1461 tree t
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1462 if (TREE_TYPE (t
) != TREE_TYPE (*tp
))
1463 t
= fold_convert (remap_type (TREE_TYPE (*tp
), id
), t
);
1467 recompute_tree_invariant_for_addr_expr (*tp
);
1469 /* If this used to be invariant, but is not any longer,
1470 then regimplification is probably needed. */
1471 if (invariant
&& !is_gimple_min_invariant (*tp
))
1472 id
->regimplify
= true;
1478 /* Keep iterating. */
1482 /* Helper for remap_gimple_stmt. Given an EH region number for the
1483 source function, map that to the duplicate EH region number in
1484 the destination function. */
1487 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1489 eh_region old_r
, new_r
;
1491 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1492 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1494 return new_r
->index
;
1497 /* Similar, but operate on INTEGER_CSTs. */
1500 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1504 old_nr
= tree_to_shwi (old_t_nr
);
1505 new_nr
= remap_eh_region_nr (old_nr
, id
);
1507 return build_int_cst (integer_type_node
, new_nr
);
1510 /* Helper for copy_bb. Remap statement STMT using the inlining
1511 information in ID. Return the new statement copy. */
1514 remap_gimple_stmt (gimple
*stmt
, copy_body_data
*id
)
1516 gimple
*copy
= NULL
;
1517 struct walk_stmt_info wi
;
1518 bool skip_first
= false;
1519 gimple_seq stmts
= NULL
;
1521 if (is_gimple_debug (stmt
)
1522 && (gimple_debug_nonbind_marker_p (stmt
)
1523 ? !DECL_STRUCT_FUNCTION (id
->dst_fn
)->debug_nonbind_markers
1524 : !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
)))
1527 /* Begin by recognizing trees that we'll completely rewrite for the
1528 inlining context. Our output for these trees is completely
1529 different from our input (e.g. RETURN_EXPR is deleted and morphs
1530 into an edge). Further down, we'll handle trees that get
1531 duplicated and/or tweaked. */
1533 /* When requested, GIMPLE_RETURN should be transformed to just the
1534 contained GIMPLE_ASSIGN. The branch semantics of the return will
1535 be handled elsewhere by manipulating the CFG rather than the
1537 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1539 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1541 /* If we're returning something, just turn that into an
1542 assignment to the equivalent of the original RESULT_DECL.
1543 If RETVAL is just the result decl, the result decl has
1544 already been set (e.g. a recent "foo (&result_decl, ...)");
1545 just toss the entire GIMPLE_RETURN. Likewise for when the
1546 call doesn't want the return value. */
1548 && (TREE_CODE (retval
) != RESULT_DECL
1550 || gimple_call_lhs (id
->call_stmt
) != NULL_TREE
)
1551 && (TREE_CODE (retval
) != SSA_NAME
1552 || ! SSA_NAME_VAR (retval
)
1553 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1555 copy
= gimple_build_assign (id
->do_not_unshare
1556 ? id
->retvar
: unshare_expr (id
->retvar
),
1558 /* id->retvar is already substituted. Skip it on later remapping. */
1564 else if (gimple_has_substatements (stmt
))
1568 /* When cloning bodies from the C++ front end, we will be handed bodies
1569 in High GIMPLE form. Handle here all the High GIMPLE statements that
1570 have embedded statements. */
1571 switch (gimple_code (stmt
))
1574 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1579 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1580 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1581 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1585 case GIMPLE_EH_FILTER
:
1586 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1587 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1591 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1592 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1593 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1596 case GIMPLE_WITH_CLEANUP_EXPR
:
1597 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1598 copy
= gimple_build_wce (s1
);
1601 case GIMPLE_OMP_PARALLEL
:
1603 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1604 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1605 copy
= gimple_build_omp_parallel
1607 gimple_omp_parallel_clauses (omp_par_stmt
),
1608 gimple_omp_parallel_child_fn (omp_par_stmt
),
1609 gimple_omp_parallel_data_arg (omp_par_stmt
));
1613 case GIMPLE_OMP_TASK
:
1614 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1615 copy
= gimple_build_omp_task
1617 gimple_omp_task_clauses (stmt
),
1618 gimple_omp_task_child_fn (stmt
),
1619 gimple_omp_task_data_arg (stmt
),
1620 gimple_omp_task_copy_fn (stmt
),
1621 gimple_omp_task_arg_size (stmt
),
1622 gimple_omp_task_arg_align (stmt
));
1625 case GIMPLE_OMP_FOR
:
1626 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1627 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1628 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1629 gimple_omp_for_clauses (stmt
),
1630 gimple_omp_for_collapse (stmt
), s2
);
1633 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1635 gimple_omp_for_set_index (copy
, i
,
1636 gimple_omp_for_index (stmt
, i
));
1637 gimple_omp_for_set_initial (copy
, i
,
1638 gimple_omp_for_initial (stmt
, i
));
1639 gimple_omp_for_set_final (copy
, i
,
1640 gimple_omp_for_final (stmt
, i
));
1641 gimple_omp_for_set_incr (copy
, i
,
1642 gimple_omp_for_incr (stmt
, i
));
1643 gimple_omp_for_set_cond (copy
, i
,
1644 gimple_omp_for_cond (stmt
, i
));
1649 case GIMPLE_OMP_MASTER
:
1650 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1651 copy
= gimple_build_omp_master (s1
);
1654 case GIMPLE_OMP_TASKGROUP
:
1655 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1656 copy
= gimple_build_omp_taskgroup
1657 (s1
, gimple_omp_taskgroup_clauses (stmt
));
1660 case GIMPLE_OMP_ORDERED
:
1661 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1662 copy
= gimple_build_omp_ordered
1664 gimple_omp_ordered_clauses (as_a
<gomp_ordered
*> (stmt
)));
1667 case GIMPLE_OMP_SCAN
:
1668 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1669 copy
= gimple_build_omp_scan
1670 (s1
, gimple_omp_scan_clauses (as_a
<gomp_scan
*> (stmt
)));
1673 case GIMPLE_OMP_SECTION
:
1674 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1675 copy
= gimple_build_omp_section (s1
);
1678 case GIMPLE_OMP_SECTIONS
:
1679 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1680 copy
= gimple_build_omp_sections
1681 (s1
, gimple_omp_sections_clauses (stmt
));
1684 case GIMPLE_OMP_SINGLE
:
1685 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1686 copy
= gimple_build_omp_single
1687 (s1
, gimple_omp_single_clauses (stmt
));
1690 case GIMPLE_OMP_TARGET
:
1691 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1692 copy
= gimple_build_omp_target
1693 (s1
, gimple_omp_target_kind (stmt
),
1694 gimple_omp_target_clauses (stmt
));
1697 case GIMPLE_OMP_TEAMS
:
1698 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1699 copy
= gimple_build_omp_teams
1700 (s1
, gimple_omp_teams_clauses (stmt
));
1703 case GIMPLE_OMP_CRITICAL
:
1704 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1705 copy
= gimple_build_omp_critical (s1
,
1706 gimple_omp_critical_name
1707 (as_a
<gomp_critical
*> (stmt
)),
1708 gimple_omp_critical_clauses
1709 (as_a
<gomp_critical
*> (stmt
)));
1712 case GIMPLE_TRANSACTION
:
1714 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1715 gtransaction
*new_trans_stmt
;
1716 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1718 copy
= new_trans_stmt
= gimple_build_transaction (s1
);
1719 gimple_transaction_set_subcode (new_trans_stmt
,
1720 gimple_transaction_subcode (old_trans_stmt
));
1721 gimple_transaction_set_label_norm (new_trans_stmt
,
1722 gimple_transaction_label_norm (old_trans_stmt
));
1723 gimple_transaction_set_label_uninst (new_trans_stmt
,
1724 gimple_transaction_label_uninst (old_trans_stmt
));
1725 gimple_transaction_set_label_over (new_trans_stmt
,
1726 gimple_transaction_label_over (old_trans_stmt
));
1736 if (gimple_assign_copy_p (stmt
)
1737 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1738 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1740 /* Here we handle statements that are not completely rewritten.
1741 First we detect some inlining-induced bogosities for
1744 /* Some assignments VAR = VAR; don't generate any rtl code
1745 and thus don't count as variable modification. Avoid
1746 keeping bogosities like 0 = 0. */
1747 tree decl
= gimple_assign_lhs (stmt
), value
;
1750 n
= id
->decl_map
->get (decl
);
1754 STRIP_TYPE_NOPS (value
);
1755 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1760 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1761 in a block that we aren't copying during tree_function_versioning,
1762 just drop the clobber stmt. */
1763 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1765 tree lhs
= gimple_assign_lhs (stmt
);
1766 if (TREE_CODE (lhs
) == MEM_REF
1767 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1769 gimple
*def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1770 if (gimple_bb (def_stmt
)
1771 && !bitmap_bit_p (id
->blocks_to_copy
,
1772 gimple_bb (def_stmt
)->index
))
1777 /* We do not allow CLOBBERs of handled components. In case
1778 returned value is stored via such handled component, remove
1779 the clobber so stmt verifier is happy. */
1780 if (gimple_clobber_p (stmt
)
1781 && TREE_CODE (gimple_assign_lhs (stmt
)) == RESULT_DECL
)
1783 tree remapped
= remap_decl (gimple_assign_lhs (stmt
), id
);
1784 if (!DECL_P (remapped
)
1785 && TREE_CODE (remapped
) != MEM_REF
)
1789 if (gimple_debug_bind_p (stmt
))
1792 = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1793 gimple_debug_bind_get_value (stmt
),
1795 if (id
->reset_location
)
1796 gimple_set_location (copy
, input_location
);
1797 id
->debug_stmts
.safe_push (copy
);
1798 gimple_seq_add_stmt (&stmts
, copy
);
1801 if (gimple_debug_source_bind_p (stmt
))
1803 gdebug
*copy
= gimple_build_debug_source_bind
1804 (gimple_debug_source_bind_get_var (stmt
),
1805 gimple_debug_source_bind_get_value (stmt
),
1807 if (id
->reset_location
)
1808 gimple_set_location (copy
, input_location
);
1809 id
->debug_stmts
.safe_push (copy
);
1810 gimple_seq_add_stmt (&stmts
, copy
);
1813 if (gimple_debug_nonbind_marker_p (stmt
))
1815 /* If the inlined function has too many debug markers,
1817 if (id
->src_cfun
->debug_marker_count
1818 > param_max_debug_marker_count
)
1821 gdebug
*copy
= as_a
<gdebug
*> (gimple_copy (stmt
));
1822 if (id
->reset_location
)
1823 gimple_set_location (copy
, input_location
);
1824 id
->debug_stmts
.safe_push (copy
);
1825 gimple_seq_add_stmt (&stmts
, copy
);
1829 /* Create a new deep copy of the statement. */
1830 copy
= gimple_copy (stmt
);
1832 /* Clear flags that need revisiting. */
1833 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1835 if (gimple_call_tail_p (call_stmt
))
1836 gimple_call_set_tail (call_stmt
, false);
1837 if (gimple_call_from_thunk_p (call_stmt
))
1838 gimple_call_set_from_thunk (call_stmt
, false);
1839 if (gimple_call_internal_p (call_stmt
))
1840 switch (gimple_call_internal_fn (call_stmt
))
1842 case IFN_GOMP_SIMD_LANE
:
1843 case IFN_GOMP_SIMD_VF
:
1844 case IFN_GOMP_SIMD_LAST_LANE
:
1845 case IFN_GOMP_SIMD_ORDERED_START
:
1846 case IFN_GOMP_SIMD_ORDERED_END
:
1847 DECL_STRUCT_FUNCTION (id
->dst_fn
)->has_simduid_loops
= true;
1854 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1855 RESX and EH_DISPATCH. */
1857 switch (gimple_code (copy
))
1861 tree r
, fndecl
= gimple_call_fndecl (copy
);
1862 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
1863 switch (DECL_FUNCTION_CODE (fndecl
))
1865 case BUILT_IN_EH_COPY_VALUES
:
1866 r
= gimple_call_arg (copy
, 1);
1867 r
= remap_eh_region_tree_nr (r
, id
);
1868 gimple_call_set_arg (copy
, 1, r
);
1871 case BUILT_IN_EH_POINTER
:
1872 case BUILT_IN_EH_FILTER
:
1873 r
= gimple_call_arg (copy
, 0);
1874 r
= remap_eh_region_tree_nr (r
, id
);
1875 gimple_call_set_arg (copy
, 0, r
);
1882 /* Reset alias info if we didn't apply measures to
1883 keep it valid over inlining by setting DECL_PT_UID. */
1884 if (!id
->src_cfun
->gimple_df
1885 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1886 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1892 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1893 int r
= gimple_resx_region (resx_stmt
);
1894 r
= remap_eh_region_nr (r
, id
);
1895 gimple_resx_set_region (resx_stmt
, r
);
1899 case GIMPLE_EH_DISPATCH
:
1901 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1902 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1903 r
= remap_eh_region_nr (r
, id
);
1904 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1913 /* If STMT has a block defined, map it to the newly constructed block. */
1914 if (tree block
= gimple_block (copy
))
1917 n
= id
->decl_map
->get (block
);
1919 gimple_set_block (copy
, *n
);
1921 if (id
->param_body_adjs
)
1923 gimple_seq extra_stmts
= NULL
;
1924 id
->param_body_adjs
->modify_gimple_stmt (©
, &extra_stmts
);
1925 if (!gimple_seq_empty_p (extra_stmts
))
1927 memset (&wi
, 0, sizeof (wi
));
1929 for (gimple_stmt_iterator egsi
= gsi_start (extra_stmts
);
1932 walk_gimple_op (gsi_stmt (egsi
), remap_gimple_op_r
, &wi
);
1933 gimple_seq_add_seq (&stmts
, extra_stmts
);
1937 if (id
->reset_location
)
1938 gimple_set_location (copy
, input_location
);
1940 /* Debug statements ought to be rebuilt and not copied. */
1941 gcc_checking_assert (!is_gimple_debug (copy
));
1943 /* Remap all the operands in COPY. */
1944 memset (&wi
, 0, sizeof (wi
));
1947 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1949 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1951 /* Clear the copied virtual operands. We are not remapping them here
1952 but are going to recreate them from scratch. */
1953 if (gimple_has_mem_ops (copy
))
1955 gimple_set_vdef (copy
, NULL_TREE
);
1956 gimple_set_vuse (copy
, NULL_TREE
);
1959 gimple_seq_add_stmt (&stmts
, copy
);
1964 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1968 copy_bb (copy_body_data
*id
, basic_block bb
,
1969 profile_count num
, profile_count den
)
1971 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1972 basic_block copy_basic_block
;
1976 profile_count::adjust_for_ipa_scaling (&num
, &den
);
1978 /* Search for previous copied basic block. */
1981 prev
= prev
->prev_bb
;
1983 /* create_basic_block() will append every new block to
1984 basic_block_info automatically. */
1985 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
1986 copy_basic_block
->count
= bb
->count
.apply_scale (num
, den
);
1988 copy_gsi
= gsi_start_bb (copy_basic_block
);
1990 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1993 gimple
*stmt
= gsi_stmt (gsi
);
1994 gimple
*orig_stmt
= stmt
;
1995 gimple_stmt_iterator stmts_gsi
;
1996 bool stmt_added
= false;
1998 id
->regimplify
= false;
1999 stmts
= remap_gimple_stmt (stmt
, id
);
2001 if (gimple_seq_empty_p (stmts
))
2006 for (stmts_gsi
= gsi_start (stmts
);
2007 !gsi_end_p (stmts_gsi
); )
2009 stmt
= gsi_stmt (stmts_gsi
);
2011 /* Advance iterator now before stmt is moved to seq_gsi. */
2012 gsi_next (&stmts_gsi
);
2014 if (gimple_nop_p (stmt
))
2017 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
2020 /* With return slot optimization we can end up with
2021 non-gimple (foo *)&this->m, fix that here. */
2022 if (is_gimple_assign (stmt
)
2023 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
2024 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
2027 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
2028 gimple_assign_rhs1 (stmt
),
2030 GSI_CONTINUE_LINKING
);
2031 gimple_assign_set_rhs1 (stmt
, new_rhs
);
2032 id
->regimplify
= false;
2035 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
2038 gimple_regimplify_operands (stmt
, &seq_gsi
);
2046 /* If copy_basic_block has been empty at the start of this iteration,
2047 call gsi_start_bb again to get at the newly added statements. */
2048 if (gsi_end_p (copy_gsi
))
2049 copy_gsi
= gsi_start_bb (copy_basic_block
);
2051 gsi_next (©_gsi
);
2053 /* Process the new statement. The call to gimple_regimplify_operands
2054 possibly turned the statement into multiple statements, we
2055 need to process all of them. */
2061 stmt
= gsi_stmt (copy_gsi
);
2062 call_stmt
= dyn_cast
<gcall
*> (stmt
);
2064 && gimple_call_va_arg_pack_p (call_stmt
)
2066 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
2068 /* __builtin_va_arg_pack () should be replaced by
2069 all arguments corresponding to ... in the caller. */
2073 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
2076 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
2079 /* Create the new array of arguments. */
2080 n
= nargs
+ gimple_call_num_args (call_stmt
);
2081 argarray
.create (n
);
2082 argarray
.safe_grow_cleared (n
);
2084 /* Copy all the arguments before '...' */
2085 memcpy (argarray
.address (),
2086 gimple_call_arg_ptr (call_stmt
, 0),
2087 gimple_call_num_args (call_stmt
) * sizeof (tree
));
2089 /* Append the arguments passed in '...' */
2090 memcpy (argarray
.address () + gimple_call_num_args (call_stmt
),
2091 gimple_call_arg_ptr (id
->call_stmt
, 0)
2092 + (gimple_call_num_args (id
->call_stmt
) - nargs
),
2093 nargs
* sizeof (tree
));
2095 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
2098 argarray
.release ();
2100 /* Copy all GIMPLE_CALL flags, location and block, except
2101 GF_CALL_VA_ARG_PACK. */
2102 gimple_call_copy_flags (new_call
, call_stmt
);
2103 gimple_call_set_va_arg_pack (new_call
, false);
2104 /* location includes block. */
2105 gimple_set_location (new_call
, gimple_location (stmt
));
2106 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
2108 gsi_replace (©_gsi
, new_call
, false);
2113 && (decl
= gimple_call_fndecl (stmt
))
2114 && fndecl_built_in_p (decl
, BUILT_IN_VA_ARG_PACK_LEN
))
2116 /* __builtin_va_arg_pack_len () should be replaced by
2117 the number of anonymous arguments. */
2118 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
2122 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
2125 if (!gimple_call_lhs (stmt
))
2127 /* Drop unused calls. */
2128 gsi_remove (©_gsi
, false);
2131 else if (!gimple_call_va_arg_pack_p (id
->call_stmt
))
2133 count
= build_int_cst (integer_type_node
, nargs
);
2134 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
2135 gsi_replace (©_gsi
, new_stmt
, false);
2138 else if (nargs
!= 0)
2140 tree newlhs
= create_tmp_reg_or_ssa_name (integer_type_node
);
2141 count
= build_int_cst (integer_type_node
, nargs
);
2142 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
2143 PLUS_EXPR
, newlhs
, count
);
2144 gimple_call_set_lhs (stmt
, newlhs
);
2145 gsi_insert_after (©_gsi
, new_stmt
, GSI_NEW_STMT
);
2150 && gimple_call_internal_p (stmt
)
2151 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
2153 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
2154 gsi_remove (©_gsi
, false);
2158 /* Statements produced by inlining can be unfolded, especially
2159 when we constant propagated some operands. We can't fold
2160 them right now for two reasons:
2161 1) folding require SSA_NAME_DEF_STMTs to be correct
2162 2) we can't change function calls to builtins.
2163 So we just mark statement for later folding. We mark
2164 all new statements, instead just statements that has changed
2165 by some nontrivial substitution so even statements made
2166 foldable indirectly are updated. If this turns out to be
2167 expensive, copy_body can be told to watch for nontrivial
2169 if (id
->statements_to_fold
)
2170 id
->statements_to_fold
->add (stmt
);
2172 /* We're duplicating a CALL_EXPR. Find any corresponding
2173 callgraph edges and update or duplicate them. */
2174 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
2176 struct cgraph_edge
*edge
;
2178 switch (id
->transform_call_graph_edges
)
2180 case CB_CGE_DUPLICATE
:
2181 edge
= id
->src_node
->get_edge (orig_stmt
);
2184 struct cgraph_edge
*old_edge
= edge
;
2186 /* A speculative call is consist of multiple
2187 edges - indirect edge and one or more direct edges
2188 Duplicate the whole thing and distribute frequencies
2190 if (edge
->speculative
)
2193 profile_count direct_cnt
2194 = profile_count::zero ();
2196 /* First figure out the distribution of counts
2197 so we can re-scale BB profile accordingly. */
2198 for (cgraph_edge
*e
= old_edge
; e
;
2199 e
= e
->next_speculative_call_target ())
2200 direct_cnt
= direct_cnt
+ e
->count
;
2202 cgraph_edge
*indirect
2203 = old_edge
->speculative_call_indirect_edge ();
2204 profile_count indir_cnt
= indirect
->count
;
2206 /* Next iterate all direct edges, clone it and its
2207 corresponding reference and update profile. */
2208 for (cgraph_edge
*e
= old_edge
;
2210 e
= e
->next_speculative_call_target ())
2212 profile_count cnt
= e
->count
;
2214 id
->dst_node
->clone_reference
2215 (e
->speculative_call_target_ref (), stmt
);
2216 edge
= e
->clone (id
->dst_node
, call_stmt
,
2217 gimple_uid (stmt
), num
, den
,
2219 profile_probability prob
2220 = cnt
.probability_in (direct_cnt
2223 = copy_basic_block
->count
.apply_probability
2228 (indirect
->num_speculative_call_targets_p ()
2231 /* Duplicate the indirect edge after all direct edges
2233 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2238 profile_probability prob
2239 = indir_cnt
.probability_in (direct_cnt
2242 = copy_basic_block
->count
.apply_probability (prob
);
2246 edge
= edge
->clone (id
->dst_node
, call_stmt
,
2250 edge
->count
= copy_basic_block
->count
;
2255 case CB_CGE_MOVE_CLONES
:
2256 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2258 edge
= id
->dst_node
->get_edge (stmt
);
2262 edge
= id
->dst_node
->get_edge (orig_stmt
);
2264 edge
= cgraph_edge::set_call_stmt (edge
, call_stmt
);
2271 /* Constant propagation on argument done during inlining
2272 may create new direct call. Produce an edge for it. */
2274 || (edge
->indirect_inlining_edge
2275 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2276 && id
->dst_node
->definition
2277 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2279 struct cgraph_node
*dest
= cgraph_node::get_create (fn
);
2281 /* We have missing edge in the callgraph. This can happen
2282 when previous inlining turned an indirect call into a
2283 direct call by constant propagating arguments or we are
2284 producing dead clone (for further cloning). In all
2285 other cases we hit a bug (incorrect node sharing is the
2286 most common reason for missing edges). */
2287 gcc_assert (!dest
->definition
2288 || dest
->address_taken
2289 || !id
->src_node
->definition
2290 || !id
->dst_node
->definition
);
2291 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2292 id
->dst_node
->create_edge_including_clones
2293 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2294 CIF_ORIGINALLY_INDIRECT_CALL
);
2296 id
->dst_node
->create_edge (dest
, call_stmt
,
2297 bb
->count
)->inline_failed
2298 = CIF_ORIGINALLY_INDIRECT_CALL
;
2301 fprintf (dump_file
, "Created new direct edge to %s\n",
2302 dest
->dump_name ());
2306 notice_special_calls (as_a
<gcall
*> (stmt
));
2309 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2310 id
->eh_map
, id
->eh_lp_nr
);
2312 gsi_next (©_gsi
);
2314 while (!gsi_end_p (copy_gsi
));
2316 copy_gsi
= gsi_last_bb (copy_basic_block
);
2319 return copy_basic_block
;
2322 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2323 form is quite easy, since dominator relationship for old basic blocks does
2326 There is however exception where inlining might change dominator relation
2327 across EH edges from basic block within inlined functions destinating
2328 to landing pads in function we inline into.
2330 The function fills in PHI_RESULTs of such PHI nodes if they refer
2331 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2332 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2333 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2334 set, and this means that there will be no overlapping live ranges
2335 for the underlying symbol.
2337 This might change in future if we allow redirecting of EH edges and
2338 we might want to change way build CFG pre-inlining to include
2339 all the possible edges then. */
2341 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2342 bool can_throw
, bool nonlocal_goto
)
2347 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2349 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2355 gcc_assert (e
->flags
& EDGE_EH
);
2358 gcc_assert (!(e
->flags
& EDGE_EH
));
2360 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2366 /* For abnormal goto/call edges the receiver can be the
2367 ENTRY_BLOCK. Do not assert this cannot happen. */
2369 gcc_assert ((e
->flags
& EDGE_EH
)
2370 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2372 re
= find_edge (ret_bb
, e
->dest
);
2373 gcc_checking_assert (re
);
2374 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2375 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2377 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2378 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2383 /* Insert clobbers for automatic variables of inlined ID->src_fn
2384 function at the start of basic block ID->eh_landing_pad_dest. */
2387 add_clobbers_to_eh_landing_pad (copy_body_data
*id
)
2390 basic_block bb
= id
->eh_landing_pad_dest
;
2391 live_vars_map
*vars
= NULL
;
2392 unsigned int cnt
= 0;
2394 FOR_EACH_VEC_SAFE_ELT (id
->src_cfun
->local_decls
, i
, var
)
2396 && !DECL_HARD_REGISTER (var
)
2397 && !TREE_THIS_VOLATILE (var
)
2398 && !DECL_HAS_VALUE_EXPR_P (var
)
2399 && !is_gimple_reg (var
)
2400 && auto_var_in_fn_p (var
, id
->src_fn
)
2401 && !lookup_attribute ("omp simd array", DECL_ATTRIBUTES (var
)))
2403 tree
*t
= id
->decl_map
->get (var
);
2408 && !DECL_HARD_REGISTER (new_var
)
2409 && !TREE_THIS_VOLATILE (new_var
)
2410 && !DECL_HAS_VALUE_EXPR_P (new_var
)
2411 && !is_gimple_reg (new_var
)
2412 && auto_var_in_fn_p (new_var
, id
->dst_fn
))
2415 vars
= new live_vars_map
;
2416 vars
->put (DECL_UID (var
), cnt
++);
2422 vec
<bitmap_head
> live
= compute_live_vars (id
->src_cfun
, vars
);
2423 FOR_EACH_VEC_SAFE_ELT (id
->src_cfun
->local_decls
, i
, var
)
2428 bool needed
= false;
2429 unsigned int *v
= vars
->get (DECL_UID (var
));
2432 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
2433 if ((e
->flags
& EDGE_EH
) != 0
2434 && e
->src
->index
>= id
->add_clobbers_to_eh_landing_pads
)
2436 basic_block src_bb
= (basic_block
) e
->src
->aux
;
2438 if (bitmap_bit_p (&live
[src_bb
->index
], *v
))
2446 tree new_var
= *id
->decl_map
->get (var
);
2447 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
2448 tree clobber
= build_clobber (TREE_TYPE (new_var
));
2449 gimple
*clobber_stmt
= gimple_build_assign (new_var
, clobber
);
2450 gsi_insert_before (&gsi
, clobber_stmt
, GSI_NEW_STMT
);
2453 destroy_live_vars (live
);
2457 /* Copy edges from BB into its copy constructed earlier, scale profile
2458 accordingly. Edges will be taken care of later. Assume aux
2459 pointers to point to the copies of each BB. Return true if any
2460 debug stmts are left after a statement that must end the basic block. */
2463 copy_edges_for_bb (basic_block bb
, profile_count num
, profile_count den
,
2464 basic_block ret_bb
, basic_block abnormal_goto_dest
,
2467 basic_block new_bb
= (basic_block
) bb
->aux
;
2470 gimple_stmt_iterator si
;
2471 bool need_debug_cleanup
= false;
2473 /* Use the indices from the original blocks to create edges for the
2475 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2476 if (!(old_edge
->flags
& EDGE_EH
))
2479 int flags
= old_edge
->flags
;
2480 location_t locus
= old_edge
->goto_locus
;
2482 /* Return edges do get a FALLTHRU flag when they get inlined. */
2483 if (old_edge
->dest
->index
== EXIT_BLOCK
2484 && !(flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2485 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2486 flags
|= EDGE_FALLTHRU
;
2489 = make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2490 new_edge
->probability
= old_edge
->probability
;
2491 if (!id
->reset_location
)
2492 new_edge
->goto_locus
= remap_location (locus
, id
);
2495 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2498 /* When doing function splitting, we must decrease count of the return block
2499 which was previously reachable by block we did not copy. */
2500 if (single_succ_p (bb
) && single_succ_edge (bb
)->dest
->index
== EXIT_BLOCK
)
2501 FOR_EACH_EDGE (old_edge
, ei
, bb
->preds
)
2502 if (old_edge
->src
->index
!= ENTRY_BLOCK
2503 && !old_edge
->src
->aux
)
2504 new_bb
->count
-= old_edge
->count ().apply_scale (num
, den
);
2506 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2509 bool can_throw
, nonlocal_goto
;
2511 copy_stmt
= gsi_stmt (si
);
2512 if (!is_gimple_debug (copy_stmt
))
2513 update_stmt (copy_stmt
);
2515 /* Do this before the possible split_block. */
2518 /* If this tree could throw an exception, there are two
2519 cases where we need to add abnormal edge(s): the
2520 tree wasn't in a region and there is a "current
2521 region" in the caller; or the original tree had
2522 EH edges. In both cases split the block after the tree,
2523 and add abnormal edge(s) as needed; we need both
2524 those from the callee and the caller.
2525 We check whether the copy can throw, because the const
2526 propagation can change an INDIRECT_REF which throws
2527 into a COMPONENT_REF which doesn't. If the copy
2528 can throw, the original could also throw. */
2529 can_throw
= stmt_can_throw_internal (cfun
, copy_stmt
);
2531 = (stmt_can_make_abnormal_goto (copy_stmt
)
2532 && !computed_goto_p (copy_stmt
));
2534 if (can_throw
|| nonlocal_goto
)
2536 if (!gsi_end_p (si
))
2538 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2541 need_debug_cleanup
= true;
2543 if (!gsi_end_p (si
))
2544 /* Note that bb's predecessor edges aren't necessarily
2545 right at this point; split_block doesn't care. */
2547 edge e
= split_block (new_bb
, copy_stmt
);
2550 new_bb
->aux
= e
->src
->aux
;
2551 si
= gsi_start_bb (new_bb
);
2555 bool update_probs
= false;
2557 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2559 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2560 update_probs
= true;
2564 make_eh_edges (copy_stmt
);
2565 update_probs
= true;
2568 /* EH edges may not match old edges. Copy as much as possible. */
2573 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2575 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2576 if ((old_edge
->flags
& EDGE_EH
)
2577 && (e
= find_edge (copy_stmt_bb
,
2578 (basic_block
) old_edge
->dest
->aux
))
2579 && (e
->flags
& EDGE_EH
))
2580 e
->probability
= old_edge
->probability
;
2582 FOR_EACH_EDGE (e
, ei
, copy_stmt_bb
->succs
)
2583 if (e
->flags
& EDGE_EH
)
2585 if (!e
->probability
.initialized_p ())
2586 e
->probability
= profile_probability::never ();
2587 if (e
->dest
->index
< id
->add_clobbers_to_eh_landing_pads
)
2589 if (id
->eh_landing_pad_dest
== NULL
)
2590 id
->eh_landing_pad_dest
= e
->dest
;
2592 gcc_assert (id
->eh_landing_pad_dest
== e
->dest
);
2598 /* If the call we inline cannot make abnormal goto do not add
2599 additional abnormal edges but only retain those already present
2600 in the original function body. */
2601 if (abnormal_goto_dest
== NULL
)
2602 nonlocal_goto
= false;
2605 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2607 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2608 nonlocal_goto
= false;
2609 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2610 in OpenMP regions which aren't allowed to be left abnormally.
2611 So, no need to add abnormal edge in that case. */
2612 else if (is_gimple_call (copy_stmt
)
2613 && gimple_call_internal_p (copy_stmt
)
2614 && (gimple_call_internal_fn (copy_stmt
)
2615 == IFN_ABNORMAL_DISPATCHER
)
2616 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2617 nonlocal_goto
= false;
2619 make_single_succ_edge (copy_stmt_bb
, abnormal_goto_dest
,
2623 if ((can_throw
|| nonlocal_goto
)
2624 && gimple_in_ssa_p (cfun
))
2625 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2626 can_throw
, nonlocal_goto
);
2628 return need_debug_cleanup
;
2631 /* Copy the PHIs. All blocks and edges are copied, some blocks
2632 was possibly split and new outgoing EH edges inserted.
2633 BB points to the block of original function and AUX pointers links
2634 the original and newly copied blocks. */
2637 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2639 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2644 bool inserted
= false;
2646 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2652 res
= PHI_RESULT (phi
);
2654 if (!virtual_operand_p (res
))
2656 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2657 if (EDGE_COUNT (new_bb
->preds
) == 0)
2659 /* Technically we'd want a SSA_DEFAULT_DEF here... */
2660 SSA_NAME_DEF_STMT (new_res
) = gimple_build_nop ();
2664 new_phi
= create_phi_node (new_res
, new_bb
);
2665 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2667 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
,
2674 /* When doing partial cloning, we allow PHIs on the entry
2675 block as long as all the arguments are the same.
2676 Find any input edge to see argument to copy. */
2678 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2679 if (!old_edge
->src
->aux
)
2682 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2684 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2685 gcc_assert (new_arg
);
2686 /* With return slot optimization we can end up with
2687 non-gimple (foo *)&this->m, fix that here. */
2688 if (TREE_CODE (new_arg
) != SSA_NAME
2689 && TREE_CODE (new_arg
) != FUNCTION_DECL
2690 && !is_gimple_val (new_arg
))
2692 gimple_seq stmts
= NULL
;
2693 new_arg
= force_gimple_operand (new_arg
, &stmts
, true,
2695 gsi_insert_seq_on_edge (new_edge
, stmts
);
2698 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2699 if (id
->reset_location
)
2700 locus
= input_location
;
2702 locus
= remap_location (locus
, id
);
2703 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2709 /* Commit the delayed edge insertions. */
2711 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2712 gsi_commit_one_edge_insert (new_edge
, NULL
);
2716 /* Wrapper for remap_decl so it can be used as a callback. */
2719 remap_decl_1 (tree decl
, void *data
)
2721 return remap_decl (decl
, (copy_body_data
*) data
);
2724 /* Build struct function and associated datastructures for the new clone
2725 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2726 the cfun to the function of new_fndecl (and current_function_decl too). */
2729 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, profile_count count
)
2731 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2733 if (!DECL_ARGUMENTS (new_fndecl
))
2734 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2735 if (!DECL_RESULT (new_fndecl
))
2736 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2738 /* Register specific tree functions. */
2739 gimple_register_cfg_hooks ();
2741 /* Get clean struct function. */
2742 push_struct_function (new_fndecl
);
2744 /* We will rebuild these, so just sanity check that they are empty. */
2745 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2746 gcc_assert (cfun
->local_decls
== NULL
);
2747 gcc_assert (cfun
->cfg
== NULL
);
2748 gcc_assert (cfun
->decl
== new_fndecl
);
2750 /* Copy items we preserve during cloning. */
2751 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2752 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2753 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2754 cfun
->curr_properties
= src_cfun
->curr_properties
;
2755 cfun
->last_verified
= src_cfun
->last_verified
;
2756 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2757 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2758 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2759 cfun
->calls_eh_return
= src_cfun
->calls_eh_return
;
2760 cfun
->stdarg
= src_cfun
->stdarg
;
2761 cfun
->after_inlining
= src_cfun
->after_inlining
;
2762 cfun
->can_throw_non_call_exceptions
2763 = src_cfun
->can_throw_non_call_exceptions
;
2764 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2765 cfun
->returns_struct
= src_cfun
->returns_struct
;
2766 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2768 init_empty_tree_cfg ();
2770 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2772 profile_count num
= count
;
2773 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2774 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2776 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2777 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2778 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2779 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2780 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2781 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2783 init_eh_for_function ();
2785 if (src_cfun
->gimple_df
)
2787 init_tree_ssa (cfun
);
2788 cfun
->gimple_df
->in_ssa_p
= src_cfun
->gimple_df
->in_ssa_p
;
2789 if (cfun
->gimple_df
->in_ssa_p
)
2790 init_ssa_operands (cfun
);
2794 /* Helper function for copy_cfg_body. Move debug stmts from the end
2795 of NEW_BB to the beginning of successor basic blocks when needed. If the
2796 successor has multiple predecessors, reset them, otherwise keep
2800 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2804 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2807 || gsi_one_before_end_p (si
)
2808 || !(stmt_can_throw_internal (cfun
, gsi_stmt (si
))
2809 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2812 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2814 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2815 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2816 while (is_gimple_debug (gsi_stmt (ssi
)))
2818 gimple
*stmt
= gsi_stmt (ssi
);
2823 /* For the last edge move the debug stmts instead of copying
2825 if (ei_one_before_end_p (ei
))
2829 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2831 gimple_debug_bind_reset_value (stmt
);
2832 gimple_set_location (stmt
, UNKNOWN_LOCATION
);
2834 gsi_remove (&si
, false);
2835 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2839 if (gimple_debug_bind_p (stmt
))
2841 var
= gimple_debug_bind_get_var (stmt
);
2842 if (single_pred_p (e
->dest
))
2844 value
= gimple_debug_bind_get_value (stmt
);
2845 value
= unshare_expr (value
);
2846 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2849 new_stmt
= gimple_build_debug_bind (var
, NULL_TREE
, NULL
);
2851 else if (gimple_debug_source_bind_p (stmt
))
2853 var
= gimple_debug_source_bind_get_var (stmt
);
2854 value
= gimple_debug_source_bind_get_value (stmt
);
2855 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2857 else if (gimple_debug_nonbind_marker_p (stmt
))
2858 new_stmt
= as_a
<gdebug
*> (gimple_copy (stmt
));
2861 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2862 id
->debug_stmts
.safe_push (new_stmt
);
2868 /* Make a copy of the sub-loops of SRC_PARENT and place them
2869 as siblings of DEST_PARENT. */
2872 copy_loops (copy_body_data
*id
,
2873 class loop
*dest_parent
, class loop
*src_parent
)
2875 class loop
*src_loop
= src_parent
->inner
;
2878 if (!id
->blocks_to_copy
2879 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2881 class loop
*dest_loop
= alloc_loop ();
2883 /* Assign the new loop its header and latch and associate
2884 those with the new loop. */
2885 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2886 dest_loop
->header
->loop_father
= dest_loop
;
2887 if (src_loop
->latch
!= NULL
)
2889 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2890 dest_loop
->latch
->loop_father
= dest_loop
;
2893 /* Copy loop meta-data. */
2894 copy_loop_info (src_loop
, dest_loop
);
2895 if (dest_loop
->unroll
)
2896 cfun
->has_unroll
= true;
2897 if (dest_loop
->force_vectorize
)
2898 cfun
->has_force_vectorize_loops
= true;
2899 if (id
->src_cfun
->last_clique
!= 0)
2900 dest_loop
->owned_clique
2901 = remap_dependence_clique (id
,
2902 src_loop
->owned_clique
2903 ? src_loop
->owned_clique
: 1);
2905 /* Finally place it into the loop array and the loop tree. */
2906 place_new_loop (cfun
, dest_loop
);
2907 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2909 if (src_loop
->simduid
)
2911 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2912 cfun
->has_simduid_loops
= true;
2916 copy_loops (id
, dest_loop
, src_loop
);
2918 src_loop
= src_loop
->next
;
2922 /* Call redirect_call_stmt_to_callee on all calls in BB. */
2925 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2927 gimple_stmt_iterator si
;
2928 gimple
*last
= last_stmt (bb
);
2929 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2931 gimple
*stmt
= gsi_stmt (si
);
2932 if (is_gimple_call (stmt
))
2934 tree old_lhs
= gimple_call_lhs (stmt
);
2935 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2939 = cgraph_edge::redirect_call_stmt_to_callee (edge
);
2940 /* If IPA-SRA transformation, run as part of edge redirection,
2941 removed the LHS because it is unused, save it to
2942 killed_new_ssa_names so that we can prune it from debug
2945 && TREE_CODE (old_lhs
) == SSA_NAME
2946 && !gimple_call_lhs (new_stmt
))
2948 if (!id
->killed_new_ssa_names
)
2949 id
->killed_new_ssa_names
= new hash_set
<tree
> (16);
2950 id
->killed_new_ssa_names
->add (old_lhs
);
2953 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
2954 gimple_purge_dead_eh_edges (bb
);
2960 /* Make a copy of the body of FN so that it can be inserted inline in
2961 another function. Walks FN via CFG, returns new fndecl. */
2964 copy_cfg_body (copy_body_data
* id
,
2965 basic_block entry_block_map
, basic_block exit_block_map
,
2966 basic_block new_entry
)
2968 tree callee_fndecl
= id
->src_fn
;
2969 /* Original cfun for the callee, doesn't change. */
2970 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2971 struct function
*cfun_to_copy
;
2973 tree new_fndecl
= NULL
;
2974 bool need_debug_cleanup
= false;
2976 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2977 profile_count num
= entry_block_map
->count
;
2979 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2981 /* Register specific tree functions. */
2982 gimple_register_cfg_hooks ();
2984 /* If we are inlining just region of the function, make sure to connect
2985 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2986 part of loop, we must compute frequency and probability of
2987 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2988 probabilities of edges incoming from nonduplicated region. */
2993 den
= profile_count::zero ();
2995 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2998 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= den
;
3001 profile_count::adjust_for_ipa_scaling (&num
, &den
);
3003 /* Must have a CFG here at this point. */
3004 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
3005 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
3008 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
3009 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
3010 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
3011 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
3013 /* Duplicate any exception-handling regions. */
3015 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
3018 /* Use aux pointers to map the original blocks to copy. */
3019 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
3020 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
3022 basic_block new_bb
= copy_bb (id
, bb
, num
, den
);
3025 new_bb
->loop_father
= entry_block_map
->loop_father
;
3028 last
= last_basic_block_for_fn (cfun
);
3030 /* Now that we've duplicated the blocks, duplicate their edges. */
3031 basic_block abnormal_goto_dest
= NULL
;
3033 && stmt_can_make_abnormal_goto (id
->call_stmt
))
3035 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
3037 bb
= gimple_bb (id
->call_stmt
);
3039 if (gsi_end_p (gsi
))
3040 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
3042 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3043 if (!id
->blocks_to_copy
3044 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
3045 need_debug_cleanup
|= copy_edges_for_bb (bb
, num
, den
, exit_block_map
,
3046 abnormal_goto_dest
, id
);
3048 if (id
->eh_landing_pad_dest
)
3050 add_clobbers_to_eh_landing_pad (id
);
3051 id
->eh_landing_pad_dest
= NULL
;
3056 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
,
3058 e
->probability
= profile_probability::always ();
3061 /* Duplicate the loop tree, if available and wanted. */
3062 if (loops_for_fn (src_cfun
) != NULL
3063 && current_loops
!= NULL
)
3065 copy_loops (id
, entry_block_map
->loop_father
,
3066 get_loop (src_cfun
, 0));
3067 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
3068 loops_state_set (LOOPS_NEED_FIXUP
);
3071 /* If the loop tree in the source function needed fixup, mark the
3072 destination loop tree for fixup, too. */
3073 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
3074 loops_state_set (LOOPS_NEED_FIXUP
);
3076 if (gimple_in_ssa_p (cfun
))
3077 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3078 if (!id
->blocks_to_copy
3079 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
3080 copy_phis_for_bb (bb
, id
);
3082 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3085 if (need_debug_cleanup
3086 && bb
->index
!= ENTRY_BLOCK
3087 && bb
->index
!= EXIT_BLOCK
)
3088 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
3089 /* Update call edge destinations. This cannot be done before loop
3090 info is updated, because we may split basic blocks. */
3091 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
3092 && bb
->index
!= ENTRY_BLOCK
3093 && bb
->index
!= EXIT_BLOCK
)
3094 redirect_all_calls (id
, (basic_block
)bb
->aux
);
3095 ((basic_block
)bb
->aux
)->aux
= NULL
;
3099 /* Zero out AUX fields of newly created block during EH edge
3101 for (; last
< last_basic_block_for_fn (cfun
); last
++)
3103 if (need_debug_cleanup
)
3104 maybe_move_debug_stmts_to_successors (id
,
3105 BASIC_BLOCK_FOR_FN (cfun
, last
));
3106 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
3107 /* Update call edge destinations. This cannot be done before loop
3108 info is updated, because we may split basic blocks. */
3109 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
3110 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
3112 entry_block_map
->aux
= NULL
;
3113 exit_block_map
->aux
= NULL
;
3120 if (id
->dependence_map
)
3122 delete id
->dependence_map
;
3123 id
->dependence_map
= NULL
;
3129 /* Copy the debug STMT using ID. We deal with these statements in a
3130 special way: if any variable in their VALUE expression wasn't
3131 remapped yet, we won't remap it, because that would get decl uids
3132 out of sync, causing codegen differences between -g and -g0. If
3133 this arises, we drop the VALUE expression altogether. */
3136 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
3139 struct walk_stmt_info wi
;
3141 if (tree block
= gimple_block (stmt
))
3143 n
= id
->decl_map
->get (block
);
3144 gimple_set_block (stmt
, n
? *n
: id
->block
);
3147 if (gimple_debug_nonbind_marker_p (stmt
))
3150 /* Remap all the operands in COPY. */
3151 memset (&wi
, 0, sizeof (wi
));
3154 processing_debug_stmt
= 1;
3156 if (gimple_debug_source_bind_p (stmt
))
3157 t
= gimple_debug_source_bind_get_var (stmt
);
3158 else if (gimple_debug_bind_p (stmt
))
3159 t
= gimple_debug_bind_get_var (stmt
);
3163 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
3164 && (n
= id
->debug_map
->get (t
)))
3166 gcc_assert (VAR_P (*n
));
3169 else if (VAR_P (t
) && !is_global_var (t
) && !id
->decl_map
->get (t
))
3170 /* T is a non-localized variable. */;
3172 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
3174 if (gimple_debug_bind_p (stmt
))
3176 gimple_debug_bind_set_var (stmt
, t
);
3178 if (gimple_debug_bind_has_value_p (stmt
))
3179 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
3180 remap_gimple_op_r
, &wi
, NULL
);
3182 /* Punt if any decl couldn't be remapped. */
3183 if (processing_debug_stmt
< 0)
3184 gimple_debug_bind_reset_value (stmt
);
3186 else if (gimple_debug_source_bind_p (stmt
))
3188 gimple_debug_source_bind_set_var (stmt
, t
);
3189 /* When inlining and source bind refers to one of the optimized
3190 away parameters, change the source bind into normal debug bind
3191 referring to the corresponding DEBUG_EXPR_DECL that should have
3192 been bound before the call stmt. */
3193 t
= gimple_debug_source_bind_get_value (stmt
);
3195 && TREE_CODE (t
) == PARM_DECL
3198 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
3200 if (debug_args
!= NULL
)
3202 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
3203 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
3204 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
3206 t
= (**debug_args
)[i
+ 1];
3207 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
3208 gimple_debug_bind_set_value (stmt
, t
);
3213 if (gimple_debug_source_bind_p (stmt
))
3214 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
3215 remap_gimple_op_r
, &wi
, NULL
);
3218 processing_debug_stmt
= 0;
3223 /* Process deferred debug stmts. In order to give values better odds
3224 of being successfully remapped, we delay the processing of debug
3225 stmts until all other stmts that might require remapping are
3229 copy_debug_stmts (copy_body_data
*id
)
3234 if (!id
->debug_stmts
.exists ())
3237 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
3238 copy_debug_stmt (stmt
, id
);
3240 id
->debug_stmts
.release ();
3243 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
3244 another function. */
3247 copy_tree_body (copy_body_data
*id
)
3249 tree fndecl
= id
->src_fn
;
3250 tree body
= DECL_SAVED_TREE (fndecl
);
3252 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
3257 /* Make a copy of the body of FN so that it can be inserted inline in
3258 another function. */
3261 copy_body (copy_body_data
*id
,
3262 basic_block entry_block_map
, basic_block exit_block_map
,
3263 basic_block new_entry
)
3265 tree fndecl
= id
->src_fn
;
3268 /* If this body has a CFG, walk CFG and copy. */
3269 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
3270 body
= copy_cfg_body (id
, entry_block_map
, exit_block_map
,
3272 copy_debug_stmts (id
);
3273 delete id
->killed_new_ssa_names
;
3274 id
->killed_new_ssa_names
= NULL
;
3279 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
3280 defined in function FN, or of a data member thereof. */
3283 self_inlining_addr_expr (tree value
, tree fn
)
3287 if (TREE_CODE (value
) != ADDR_EXPR
)
3290 var
= get_base_address (TREE_OPERAND (value
, 0));
3292 return var
&& auto_var_in_fn_p (var
, fn
);
3295 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
3296 lexical block and line number information from base_stmt, if given,
3297 or from the last stmt of the block otherwise. */
3300 insert_init_debug_bind (copy_body_data
*id
,
3301 basic_block bb
, tree var
, tree value
,
3305 gimple_stmt_iterator gsi
;
3308 if (!gimple_in_ssa_p (id
->src_cfun
))
3311 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
3314 tracked_var
= target_for_debug_bind (var
);
3320 gsi
= gsi_last_bb (bb
);
3321 if (!base_stmt
&& !gsi_end_p (gsi
))
3322 base_stmt
= gsi_stmt (gsi
);
3325 note
= gimple_build_debug_bind (tracked_var
, unshare_expr (value
), base_stmt
);
3329 if (!gsi_end_p (gsi
))
3330 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
3332 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3339 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple
*init_stmt
)
3341 /* If VAR represents a zero-sized variable, it's possible that the
3342 assignment statement may result in no gimple statements. */
3345 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3347 /* We can end up with init statements that store to a non-register
3348 from a rhs with a conversion. Handle that here by forcing the
3349 rhs into a temporary. gimple_regimplify_operands is not
3350 prepared to do this for us. */
3351 if (!is_gimple_debug (init_stmt
)
3352 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3353 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3354 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3356 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3357 gimple_expr_type (init_stmt
),
3358 gimple_assign_rhs1 (init_stmt
));
3359 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3361 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3362 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3364 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3365 if (!is_gimple_debug (init_stmt
))
3367 gimple_regimplify_operands (init_stmt
, &si
);
3369 tree def
= gimple_assign_lhs (init_stmt
);
3370 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3375 /* Deal with mismatched formal/actual parameters, in a rather brute-force way
3376 if need be (which should only be necessary for invalid programs). Attempt
3377 to convert VAL to TYPE and return the result if it is possible, just return
3378 a zero constant of the given type if it fails. */
3381 force_value_to_type (tree type
, tree value
)
3383 /* If we can match up types by promotion/demotion do so. */
3384 if (fold_convertible_p (type
, value
))
3385 return fold_convert (type
, value
);
3387 /* ??? For valid programs we should not end up here.
3388 Still if we end up with truly mismatched types here, fall back
3389 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3390 GIMPLE to the following passes. */
3391 if (!is_gimple_reg_type (TREE_TYPE (value
))
3392 || TYPE_SIZE (type
) == TYPE_SIZE (TREE_TYPE (value
)))
3393 return fold_build1 (VIEW_CONVERT_EXPR
, type
, value
);
3395 return build_zero_cst (type
);
3398 /* Initialize parameter P with VALUE. If needed, produce init statement
3399 at the end of BB. When BB is NULL, we return init statement to be
3402 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3403 basic_block bb
, tree
*vars
)
3405 gimple
*init_stmt
= NULL
;
3408 tree def
= (gimple_in_ssa_p (cfun
)
3409 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3412 && value
!= error_mark_node
3413 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3414 rhs
= force_value_to_type (TREE_TYPE (p
), value
);
3416 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3417 here since the type of this decl must be visible to the calling
3419 var
= copy_decl_to_var (p
, id
);
3421 /* Declare this new variable. */
3422 DECL_CHAIN (var
) = *vars
;
3425 /* Make gimplifier happy about this variable. */
3426 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3428 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3429 we would not need to create a new variable here at all, if it
3430 weren't for debug info. Still, we can just use the argument
3432 if (TREE_READONLY (p
)
3433 && !TREE_ADDRESSABLE (p
)
3434 && value
&& !TREE_SIDE_EFFECTS (value
)
3437 /* We may produce non-gimple trees by adding NOPs or introduce
3438 invalid sharing when operand is not really constant.
3439 It is not big deal to prohibit constant propagation here as
3440 we will constant propagate in DOM1 pass anyway. */
3441 if (is_gimple_min_invariant (value
)
3442 && useless_type_conversion_p (TREE_TYPE (p
),
3444 /* We have to be very careful about ADDR_EXPR. Make sure
3445 the base variable isn't a local variable of the inlined
3446 function, e.g., when doing recursive inlining, direct or
3447 mutually-recursive or whatever, which is why we don't
3448 just test whether fn == current_function_decl. */
3449 && ! self_inlining_addr_expr (value
, fn
))
3451 insert_decl_map (id
, p
, value
);
3452 insert_debug_decl_map (id
, p
, var
);
3453 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3457 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3458 that way, when the PARM_DECL is encountered, it will be
3459 automatically replaced by the VAR_DECL. */
3460 insert_decl_map (id
, p
, var
);
3462 /* Even if P was TREE_READONLY, the new VAR should not be.
3463 In the original code, we would have constructed a
3464 temporary, and then the function body would have never
3465 changed the value of P. However, now, we will be
3466 constructing VAR directly. The constructor body may
3467 change its value multiple times as it is being
3468 constructed. Therefore, it must not be TREE_READONLY;
3469 the back-end assumes that TREE_READONLY variable is
3470 assigned to only once. */
3471 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
3472 TREE_READONLY (var
) = 0;
3474 /* If there is no setup required and we are in SSA, take the easy route
3475 replacing all SSA names representing the function parameter by the
3476 SSA name passed to function.
3478 We need to construct map for the variable anyway as it might be used
3479 in different SSA names when parameter is set in function.
3481 Do replacement at -O0 for const arguments replaced by constant.
3482 This is important for builtin_constant_p and other construct requiring
3483 constant argument to be visible in inlined function body. */
3484 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3486 || (TREE_READONLY (p
)
3487 && is_gimple_min_invariant (rhs
)))
3488 && (TREE_CODE (rhs
) == SSA_NAME
3489 || is_gimple_min_invariant (rhs
))
3490 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3492 insert_decl_map (id
, def
, rhs
);
3493 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3496 /* If the value of argument is never used, don't care about initializing
3498 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3500 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3501 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3504 /* Initialize this VAR_DECL from the equivalent argument. Convert
3505 the argument to the proper type in case it was promoted. */
3508 if (rhs
== error_mark_node
)
3510 insert_decl_map (id
, p
, var
);
3511 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3514 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3516 /* If we are in SSA form properly remap the default definition
3517 or assign to a dummy SSA name if the parameter is unused and
3518 we are not optimizing. */
3519 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3523 def
= remap_ssa_name (def
, id
);
3524 init_stmt
= gimple_build_assign (def
, rhs
);
3525 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3526 set_ssa_default_def (cfun
, var
, NULL
);
3530 def
= make_ssa_name (var
);
3531 init_stmt
= gimple_build_assign (def
, rhs
);
3535 init_stmt
= gimple_build_assign (var
, rhs
);
3537 if (bb
&& init_stmt
)
3538 insert_init_stmt (id
, bb
, init_stmt
);
3543 /* Generate code to initialize the parameters of the function at the
3544 top of the stack in ID from the GIMPLE_CALL STMT. */
3547 initialize_inlined_parameters (copy_body_data
*id
, gimple
*stmt
,
3548 tree fn
, basic_block bb
)
3553 tree vars
= NULL_TREE
;
3554 tree static_chain
= gimple_call_chain (stmt
);
3556 /* Figure out what the parameters are. */
3557 parms
= DECL_ARGUMENTS (fn
);
3559 /* Loop through the parameter declarations, replacing each with an
3560 equivalent VAR_DECL, appropriately initialized. */
3561 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3564 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3565 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3567 /* After remapping parameters remap their types. This has to be done
3568 in a second loop over all parameters to appropriately remap
3569 variable sized arrays when the size is specified in a
3570 parameter following the array. */
3571 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3573 tree
*varp
= id
->decl_map
->get (p
);
3574 if (varp
&& VAR_P (*varp
))
3576 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3577 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3579 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3580 /* Also remap the default definition if it was remapped
3581 to the default definition of the parameter replacement
3582 by the parameter setup. */
3585 tree
*defp
= id
->decl_map
->get (def
);
3587 && TREE_CODE (*defp
) == SSA_NAME
3588 && SSA_NAME_VAR (*defp
) == var
)
3589 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3594 /* Initialize the static chain. */
3595 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3596 gcc_assert (fn
!= current_function_decl
);
3599 /* No static chain? Seems like a bug in tree-nested.c. */
3600 gcc_assert (static_chain
);
3602 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3605 declare_inline_vars (id
->block
, vars
);
3609 /* Declare a return variable to replace the RESULT_DECL for the
3610 function we are calling. An appropriate DECL_STMT is returned.
3611 The USE_STMT is filled to contain a use of the declaration to
3612 indicate the return value of the function.
3614 RETURN_SLOT, if non-null is place where to store the result. It
3615 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3616 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3618 The return value is a (possibly null) value that holds the result
3619 as seen by the caller. */
3622 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3623 basic_block entry_bb
)
3625 tree callee
= id
->src_fn
;
3626 tree result
= DECL_RESULT (callee
);
3627 tree callee_type
= TREE_TYPE (result
);
3631 /* Handle type-mismatches in the function declaration return type
3632 vs. the call expression. */
3634 caller_type
= TREE_TYPE (modify_dest
);
3635 else if (return_slot
)
3636 caller_type
= TREE_TYPE (return_slot
);
3637 else /* No LHS on the call. */
3638 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3640 /* We don't need to do anything for functions that don't return anything. */
3641 if (VOID_TYPE_P (callee_type
))
3644 /* If there was a return slot, then the return value is the
3645 dereferenced address of that object. */
3648 /* The front end shouldn't have used both return_slot and
3649 a modify expression. */
3650 gcc_assert (!modify_dest
);
3651 if (DECL_BY_REFERENCE (result
))
3653 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3654 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3656 /* We are going to construct *&return_slot and we can't do that
3657 for variables believed to be not addressable.
3659 FIXME: This check possibly can match, because values returned
3660 via return slot optimization are not believed to have address
3661 taken by alias analysis. */
3662 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3663 var
= return_slot_addr
;
3664 mark_addressable (return_slot
);
3669 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3670 if (TREE_ADDRESSABLE (result
))
3671 mark_addressable (var
);
3673 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3674 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3675 && !DECL_GIMPLE_REG_P (result
)
3677 DECL_GIMPLE_REG_P (var
) = 0;
3679 if (!useless_type_conversion_p (callee_type
, caller_type
))
3680 var
= build1 (VIEW_CONVERT_EXPR
, callee_type
, var
);
3686 /* All types requiring non-trivial constructors should have been handled. */
3687 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3689 /* Attempt to avoid creating a new temporary variable. */
3691 && TREE_CODE (modify_dest
) != SSA_NAME
)
3693 bool use_it
= false;
3695 /* We can't use MODIFY_DEST if there's type promotion involved. */
3696 if (!useless_type_conversion_p (callee_type
, caller_type
))
3699 /* ??? If we're assigning to a variable sized type, then we must
3700 reuse the destination variable, because we've no good way to
3701 create variable sized temporaries at this point. */
3702 else if (!poly_int_tree_p (TYPE_SIZE_UNIT (caller_type
)))
3705 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3706 reuse it as the result of the call directly. Don't do this if
3707 it would promote MODIFY_DEST to addressable. */
3708 else if (TREE_ADDRESSABLE (result
))
3712 tree base_m
= get_base_address (modify_dest
);
3714 /* If the base isn't a decl, then it's a pointer, and we don't
3715 know where that's going to go. */
3716 if (!DECL_P (base_m
))
3718 else if (is_global_var (base_m
))
3720 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3721 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3722 && !DECL_GIMPLE_REG_P (result
)
3723 && DECL_GIMPLE_REG_P (base_m
))
3725 else if (!TREE_ADDRESSABLE (base_m
))
3737 gcc_assert (poly_int_tree_p (TYPE_SIZE_UNIT (callee_type
)));
3739 var
= copy_result_decl_to_var (result
, id
);
3740 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3742 /* Do not have the rest of GCC warn about this variable as it should
3743 not be visible to the user. */
3744 TREE_NO_WARNING (var
) = 1;
3746 declare_inline_vars (id
->block
, var
);
3748 /* Build the use expr. If the return type of the function was
3749 promoted, convert it back to the expected type. */
3751 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3753 /* If we can match up types by promotion/demotion do so. */
3754 if (fold_convertible_p (caller_type
, var
))
3755 use
= fold_convert (caller_type
, var
);
3758 /* ??? For valid programs we should not end up here.
3759 Still if we end up with truly mismatched types here, fall back
3760 to using a MEM_REF to not leak invalid GIMPLE to the following
3762 /* Prevent var from being written into SSA form. */
3763 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3764 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3765 DECL_GIMPLE_REG_P (var
) = false;
3766 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3767 TREE_ADDRESSABLE (var
) = true;
3768 use
= fold_build2 (MEM_REF
, caller_type
,
3769 build_fold_addr_expr (var
),
3770 build_int_cst (ptr_type_node
, 0));
3774 STRIP_USELESS_TYPE_CONVERSION (use
);
3776 if (DECL_BY_REFERENCE (result
))
3778 TREE_ADDRESSABLE (var
) = 1;
3779 var
= build_fold_addr_expr (var
);
3783 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3784 way, when the RESULT_DECL is encountered, it will be
3785 automatically replaced by the VAR_DECL.
3787 When returning by reference, ensure that RESULT_DECL remaps to
3789 if (DECL_BY_REFERENCE (result
)
3790 && !is_gimple_val (var
))
3792 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3793 insert_decl_map (id
, result
, temp
);
3794 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3795 it's default_def SSA_NAME. */
3796 if (gimple_in_ssa_p (id
->src_cfun
)
3797 && is_gimple_reg (result
))
3799 temp
= make_ssa_name (temp
);
3800 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3802 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3805 insert_decl_map (id
, result
, var
);
3807 /* Remember this so we can ignore it in remap_decls. */
3812 /* Determine if the function can be copied. If so return NULL. If
3813 not return a string describng the reason for failure. */
3816 copy_forbidden (struct function
*fun
)
3818 const char *reason
= fun
->cannot_be_copied_reason
;
3820 /* Only examine the function once. */
3821 if (fun
->cannot_be_copied_set
)
3824 /* We cannot copy a function that receives a non-local goto
3825 because we cannot remap the destination label used in the
3826 function that is performing the non-local goto. */
3827 /* ??? Actually, this should be possible, if we work at it.
3828 No doubt there's just a handful of places that simply
3829 assume it doesn't happen and don't substitute properly. */
3830 if (fun
->has_nonlocal_label
)
3832 reason
= G_("function %q+F can never be copied "
3833 "because it receives a non-local goto");
3837 if (fun
->has_forced_label_in_static
)
3839 reason
= G_("function %q+F can never be copied because it saves "
3840 "address of local label in a static variable");
3845 fun
->cannot_be_copied_reason
= reason
;
3846 fun
->cannot_be_copied_set
= true;
3851 static const char *inline_forbidden_reason
;
3853 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3854 iff a function cannot be inlined. Also sets the reason why. */
3857 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3858 struct walk_stmt_info
*wip
)
3860 tree fn
= (tree
) wip
->info
;
3862 gimple
*stmt
= gsi_stmt (*gsi
);
3864 switch (gimple_code (stmt
))
3867 /* Refuse to inline alloca call unless user explicitly forced so as
3868 this may change program's memory overhead drastically when the
3869 function using alloca is called in loop. In GCC present in
3870 SPEC2000 inlining into schedule_block cause it to require 2GB of
3871 RAM instead of 256MB. Don't do so for alloca calls emitted for
3872 VLA objects as those can't cause unbounded growth (they're always
3873 wrapped inside stack_save/stack_restore regions. */
3874 if (gimple_maybe_alloca_call_p (stmt
)
3875 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3876 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3878 inline_forbidden_reason
3879 = G_("function %q+F can never be inlined because it uses "
3880 "alloca (override using the always_inline attribute)");
3881 *handled_ops_p
= true;
3885 t
= gimple_call_fndecl (stmt
);
3889 /* We cannot inline functions that call setjmp. */
3890 if (setjmp_call_p (t
))
3892 inline_forbidden_reason
3893 = G_("function %q+F can never be inlined because it uses setjmp");
3894 *handled_ops_p
= true;
3898 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3899 switch (DECL_FUNCTION_CODE (t
))
3901 /* We cannot inline functions that take a variable number of
3903 case BUILT_IN_VA_START
:
3904 case BUILT_IN_NEXT_ARG
:
3905 case BUILT_IN_VA_END
:
3906 inline_forbidden_reason
3907 = G_("function %q+F can never be inlined because it "
3908 "uses variable argument lists");
3909 *handled_ops_p
= true;
3912 case BUILT_IN_LONGJMP
:
3913 /* We can't inline functions that call __builtin_longjmp at
3914 all. The non-local goto machinery really requires the
3915 destination be in a different function. If we allow the
3916 function calling __builtin_longjmp to be inlined into the
3917 function calling __builtin_setjmp, Things will Go Awry. */
3918 inline_forbidden_reason
3919 = G_("function %q+F can never be inlined because "
3920 "it uses setjmp-longjmp exception handling");
3921 *handled_ops_p
= true;
3924 case BUILT_IN_NONLOCAL_GOTO
:
3926 inline_forbidden_reason
3927 = G_("function %q+F can never be inlined because "
3928 "it uses non-local goto");
3929 *handled_ops_p
= true;
3932 case BUILT_IN_RETURN
:
3933 case BUILT_IN_APPLY_ARGS
:
3934 /* If a __builtin_apply_args caller would be inlined,
3935 it would be saving arguments of the function it has
3936 been inlined into. Similarly __builtin_return would
3937 return from the function the inline has been inlined into. */
3938 inline_forbidden_reason
3939 = G_("function %q+F can never be inlined because "
3940 "it uses %<__builtin_return%> or %<__builtin_apply_args%>");
3941 *handled_ops_p
= true;
3950 t
= gimple_goto_dest (stmt
);
3952 /* We will not inline a function which uses computed goto. The
3953 addresses of its local labels, which may be tucked into
3954 global storage, are of course not constant across
3955 instantiations, which causes unexpected behavior. */
3956 if (TREE_CODE (t
) != LABEL_DECL
)
3958 inline_forbidden_reason
3959 = G_("function %q+F can never be inlined "
3960 "because it contains a computed goto");
3961 *handled_ops_p
= true;
3970 *handled_ops_p
= false;
3974 /* Return true if FNDECL is a function that cannot be inlined into
3978 inline_forbidden_p (tree fndecl
)
3980 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3981 struct walk_stmt_info wi
;
3983 bool forbidden_p
= false;
3985 /* First check for shared reasons not to copy the code. */
3986 inline_forbidden_reason
= copy_forbidden (fun
);
3987 if (inline_forbidden_reason
!= NULL
)
3990 /* Next, walk the statements of the function looking for
3991 constraucts we can't handle, or are non-optimal for inlining. */
3992 hash_set
<tree
> visited_nodes
;
3993 memset (&wi
, 0, sizeof (wi
));
3994 wi
.info
= (void *) fndecl
;
3995 wi
.pset
= &visited_nodes
;
3997 FOR_EACH_BB_FN (bb
, fun
)
4000 gimple_seq seq
= bb_seq (bb
);
4001 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
4002 forbidden_p
= (ret
!= NULL
);
4010 /* Return false if the function FNDECL cannot be inlined on account of its
4011 attributes, true otherwise. */
4013 function_attribute_inlinable_p (const_tree fndecl
)
4015 if (targetm
.attribute_table
)
4019 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
4021 const_tree name
= get_attribute_name (a
);
4024 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
4025 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
4026 return targetm
.function_attribute_inlinable_p (fndecl
);
4033 /* Returns nonzero if FN is a function that does not have any
4034 fundamental inline blocking properties. */
4037 tree_inlinable_function_p (tree fn
)
4039 bool inlinable
= true;
4043 /* If we've already decided this function shouldn't be inlined,
4044 there's no need to check again. */
4045 if (DECL_UNINLINABLE (fn
))
4048 /* We only warn for functions declared `inline' by the user. */
4049 do_warning
= (opt_for_fn (fn
, warn_inline
)
4050 && DECL_DECLARED_INLINE_P (fn
)
4051 && !DECL_NO_INLINE_WARNING_P (fn
)
4052 && !DECL_IN_SYSTEM_HEADER (fn
));
4054 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
4057 && always_inline
== NULL
)
4060 warning (OPT_Winline
, "function %q+F can never be inlined because it "
4061 "is suppressed using %<-fno-inline%>", fn
);
4065 else if (!function_attribute_inlinable_p (fn
))
4068 warning (OPT_Winline
, "function %q+F can never be inlined because it "
4069 "uses attributes conflicting with inlining", fn
);
4073 else if (inline_forbidden_p (fn
))
4075 /* See if we should warn about uninlinable functions. Previously,
4076 some of these warnings would be issued while trying to expand
4077 the function inline, but that would cause multiple warnings
4078 about functions that would for example call alloca. But since
4079 this a property of the function, just one warning is enough.
4080 As a bonus we can now give more details about the reason why a
4081 function is not inlinable. */
4083 error (inline_forbidden_reason
, fn
);
4084 else if (do_warning
)
4085 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
4090 /* Squirrel away the result so that we don't have to check again. */
4091 DECL_UNINLINABLE (fn
) = !inlinable
;
4096 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
4097 word size and take possible memcpy call into account and return
4098 cost based on whether optimizing for size or speed according to SPEED_P. */
4101 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
4105 gcc_assert (!VOID_TYPE_P (type
));
4107 if (TREE_CODE (type
) == VECTOR_TYPE
)
4109 scalar_mode inner
= SCALAR_TYPE_MODE (TREE_TYPE (type
));
4110 machine_mode simd
= targetm
.vectorize
.preferred_simd_mode (inner
);
4112 = estimated_poly_value (GET_MODE_SIZE (TYPE_MODE (type
)));
4113 int simd_mode_size
= estimated_poly_value (GET_MODE_SIZE (simd
));
4114 return ((orig_mode_size
+ simd_mode_size
- 1)
4118 size
= int_size_in_bytes (type
);
4120 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
4121 /* Cost of a memcpy call, 3 arguments and the call. */
4124 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
4127 /* Returns cost of operation CODE, according to WEIGHTS */
4130 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
4131 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
4135 /* These are "free" conversions, or their presumed cost
4136 is folded into other operations. */
4141 case VIEW_CONVERT_EXPR
:
4144 /* Assign cost of 1 to usual operations.
4145 ??? We may consider mapping RTL costs to this. */
4151 case POINTER_PLUS_EXPR
:
4152 case POINTER_DIFF_EXPR
:
4155 case MULT_HIGHPART_EXPR
:
4157 case ADDR_SPACE_CONVERT_EXPR
:
4158 case FIXED_CONVERT_EXPR
:
4159 case FIX_TRUNC_EXPR
:
4178 case TRUTH_ANDIF_EXPR
:
4179 case TRUTH_ORIF_EXPR
:
4180 case TRUTH_AND_EXPR
:
4182 case TRUTH_XOR_EXPR
:
4183 case TRUTH_NOT_EXPR
:
4192 case UNORDERED_EXPR
:
4203 case PREDECREMENT_EXPR
:
4204 case PREINCREMENT_EXPR
:
4205 case POSTDECREMENT_EXPR
:
4206 case POSTINCREMENT_EXPR
:
4208 case REALIGN_LOAD_EXPR
:
4210 case WIDEN_SUM_EXPR
:
4211 case WIDEN_MULT_EXPR
:
4214 case WIDEN_MULT_PLUS_EXPR
:
4215 case WIDEN_MULT_MINUS_EXPR
:
4216 case WIDEN_LSHIFT_EXPR
:
4218 case VEC_WIDEN_MULT_HI_EXPR
:
4219 case VEC_WIDEN_MULT_LO_EXPR
:
4220 case VEC_WIDEN_MULT_EVEN_EXPR
:
4221 case VEC_WIDEN_MULT_ODD_EXPR
:
4222 case VEC_UNPACK_HI_EXPR
:
4223 case VEC_UNPACK_LO_EXPR
:
4224 case VEC_UNPACK_FLOAT_HI_EXPR
:
4225 case VEC_UNPACK_FLOAT_LO_EXPR
:
4226 case VEC_UNPACK_FIX_TRUNC_HI_EXPR
:
4227 case VEC_UNPACK_FIX_TRUNC_LO_EXPR
:
4228 case VEC_PACK_TRUNC_EXPR
:
4229 case VEC_PACK_SAT_EXPR
:
4230 case VEC_PACK_FIX_TRUNC_EXPR
:
4231 case VEC_PACK_FLOAT_EXPR
:
4232 case VEC_WIDEN_LSHIFT_HI_EXPR
:
4233 case VEC_WIDEN_LSHIFT_LO_EXPR
:
4234 case VEC_DUPLICATE_EXPR
:
4235 case VEC_SERIES_EXPR
:
4239 /* Few special cases of expensive operations. This is useful
4240 to avoid inlining on functions having too many of these. */
4241 case TRUNC_DIV_EXPR
:
4243 case FLOOR_DIV_EXPR
:
4244 case ROUND_DIV_EXPR
:
4245 case EXACT_DIV_EXPR
:
4246 case TRUNC_MOD_EXPR
:
4248 case FLOOR_MOD_EXPR
:
4249 case ROUND_MOD_EXPR
:
4251 if (TREE_CODE (op2
) != INTEGER_CST
)
4252 return weights
->div_mod_cost
;
4255 /* Bit-field insertion needs several shift and mask operations. */
4256 case BIT_INSERT_EXPR
:
4260 /* We expect a copy assignment with no operator. */
4261 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
4267 /* Estimate number of instructions that will be created by expanding
4268 the statements in the statement sequence STMTS.
4269 WEIGHTS contains weights attributed to various constructs. */
4272 estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
4275 gimple_stmt_iterator gsi
;
4278 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4279 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4285 /* Estimate number of instructions that will be created by expanding STMT.
4286 WEIGHTS contains weights attributed to various constructs. */
4289 estimate_num_insns (gimple
*stmt
, eni_weights
*weights
)
4292 enum gimple_code code
= gimple_code (stmt
);
4299 /* Try to estimate the cost of assignments. We have three cases to
4301 1) Simple assignments to registers;
4302 2) Stores to things that must live in memory. This includes
4303 "normal" stores to scalars, but also assignments of large
4304 structures, or constructors of big arrays;
4306 Let us look at the first two cases, assuming we have "a = b + C":
4307 <GIMPLE_ASSIGN <var_decl "a">
4308 <plus_expr <var_decl "b"> <constant C>>
4309 If "a" is a GIMPLE register, the assignment to it is free on almost
4310 any target, because "a" usually ends up in a real register. Hence
4311 the only cost of this expression comes from the PLUS_EXPR, and we
4312 can ignore the GIMPLE_ASSIGN.
4313 If "a" is not a GIMPLE register, the assignment to "a" will most
4314 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4315 of moving something into "a", which we compute using the function
4316 estimate_move_cost. */
4317 if (gimple_clobber_p (stmt
))
4318 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4320 lhs
= gimple_assign_lhs (stmt
);
4321 rhs
= gimple_assign_rhs1 (stmt
);
4325 /* Account for the cost of moving to / from memory. */
4326 if (gimple_store_p (stmt
))
4327 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
4328 if (gimple_assign_load_p (stmt
))
4329 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
4331 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
4332 gimple_assign_rhs1 (stmt
),
4333 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
4334 == GIMPLE_BINARY_RHS
4335 ? gimple_assign_rhs2 (stmt
) : NULL
);
4339 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4340 gimple_op (stmt
, 0),
4341 gimple_op (stmt
, 1));
4346 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4347 /* Take into account cost of the switch + guess 2 conditional jumps for
4350 TODO: once the switch expansion logic is sufficiently separated, we can
4351 do better job on estimating cost of the switch. */
4352 if (weights
->time_based
)
4353 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4355 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4363 if (gimple_call_internal_p (stmt
))
4365 else if ((decl
= gimple_call_fndecl (stmt
))
4366 && fndecl_built_in_p (decl
))
4368 /* Do not special case builtins where we see the body.
4369 This just confuse inliner. */
4370 struct cgraph_node
*node
;
4371 if (!(node
= cgraph_node::get (decl
))
4372 || node
->definition
)
4374 /* For buitins that are likely expanded to nothing or
4375 inlined do not account operand costs. */
4376 else if (is_simple_builtin (decl
))
4378 else if (is_inexpensive_builtin (decl
))
4379 return weights
->target_builtin_call_cost
;
4380 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
4382 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4383 specialize the cheap expansion we do here.
4384 ??? This asks for a more general solution. */
4385 switch (DECL_FUNCTION_CODE (decl
))
4390 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4392 (&TREE_REAL_CST (gimple_call_arg (stmt
, 1)),
4394 return estimate_operator_cost
4395 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4396 gimple_call_arg (stmt
, 0));
4405 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4406 if (gimple_call_lhs (stmt
))
4407 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4408 weights
->time_based
);
4409 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4411 tree arg
= gimple_call_arg (stmt
, i
);
4412 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4413 weights
->time_based
);
4419 return weights
->return_cost
;
4425 case GIMPLE_PREDICT
:
4431 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4432 /* 1000 means infinity. This avoids overflows later
4433 with very long asm statements. */
4436 /* If this asm is asm inline, count anything as minimum size. */
4437 if (gimple_asm_inline_p (as_a
<gasm
*> (stmt
)))
4438 count
= MIN (1, count
);
4439 return MAX (1, count
);
4443 /* This is either going to be an external function call with one
4444 argument, or two register copy statements plus a goto. */
4447 case GIMPLE_EH_DISPATCH
:
4448 /* ??? This is going to turn into a switch statement. Ideally
4449 we'd have a look at the eh region and estimate the number of
4454 return estimate_num_insns_seq (
4455 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4458 case GIMPLE_EH_FILTER
:
4459 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4462 return estimate_num_insns_seq (gimple_catch_handler (
4463 as_a
<gcatch
*> (stmt
)),
4467 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4468 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4470 /* OMP directives are generally very expensive. */
4472 case GIMPLE_OMP_RETURN
:
4473 case GIMPLE_OMP_SECTIONS_SWITCH
:
4474 case GIMPLE_OMP_ATOMIC_STORE
:
4475 case GIMPLE_OMP_CONTINUE
:
4476 /* ...except these, which are cheap. */
4479 case GIMPLE_OMP_ATOMIC_LOAD
:
4480 return weights
->omp_cost
;
4482 case GIMPLE_OMP_FOR
:
4483 return (weights
->omp_cost
4484 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4485 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4487 case GIMPLE_OMP_PARALLEL
:
4488 case GIMPLE_OMP_TASK
:
4489 case GIMPLE_OMP_CRITICAL
:
4490 case GIMPLE_OMP_MASTER
:
4491 case GIMPLE_OMP_TASKGROUP
:
4492 case GIMPLE_OMP_ORDERED
:
4493 case GIMPLE_OMP_SCAN
:
4494 case GIMPLE_OMP_SECTION
:
4495 case GIMPLE_OMP_SECTIONS
:
4496 case GIMPLE_OMP_SINGLE
:
4497 case GIMPLE_OMP_TARGET
:
4498 case GIMPLE_OMP_TEAMS
:
4499 return (weights
->omp_cost
4500 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4502 case GIMPLE_TRANSACTION
:
4503 return (weights
->tm_cost
4504 + estimate_num_insns_seq (gimple_transaction_body (
4505 as_a
<gtransaction
*> (stmt
)),
4515 /* Estimate number of instructions that will be created by expanding
4516 function FNDECL. WEIGHTS contains weights attributed to various
4520 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4522 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4523 gimple_stmt_iterator bsi
;
4527 gcc_assert (my_function
&& my_function
->cfg
);
4528 FOR_EACH_BB_FN (bb
, my_function
)
4530 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4531 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4538 /* Initializes weights used by estimate_num_insns. */
4541 init_inline_once (void)
4543 eni_size_weights
.call_cost
= 1;
4544 eni_size_weights
.indirect_call_cost
= 3;
4545 eni_size_weights
.target_builtin_call_cost
= 1;
4546 eni_size_weights
.div_mod_cost
= 1;
4547 eni_size_weights
.omp_cost
= 40;
4548 eni_size_weights
.tm_cost
= 10;
4549 eni_size_weights
.time_based
= false;
4550 eni_size_weights
.return_cost
= 1;
4552 /* Estimating time for call is difficult, since we have no idea what the
4553 called function does. In the current uses of eni_time_weights,
4554 underestimating the cost does less harm than overestimating it, so
4555 we choose a rather small value here. */
4556 eni_time_weights
.call_cost
= 10;
4557 eni_time_weights
.indirect_call_cost
= 15;
4558 eni_time_weights
.target_builtin_call_cost
= 1;
4559 eni_time_weights
.div_mod_cost
= 10;
4560 eni_time_weights
.omp_cost
= 40;
4561 eni_time_weights
.tm_cost
= 40;
4562 eni_time_weights
.time_based
= true;
4563 eni_time_weights
.return_cost
= 2;
4567 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4570 prepend_lexical_block (tree current_block
, tree new_block
)
4572 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4573 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4574 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4577 /* Add local variables from CALLEE to CALLER. */
4580 add_local_variables (struct function
*callee
, struct function
*caller
,
4586 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4587 if (!can_be_nonlocal (var
, id
))
4589 tree new_var
= remap_decl (var
, id
);
4591 /* Remap debug-expressions. */
4593 && DECL_HAS_DEBUG_EXPR_P (var
)
4596 tree tem
= DECL_DEBUG_EXPR (var
);
4597 bool old_regimplify
= id
->regimplify
;
4598 id
->remapping_type_depth
++;
4599 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4600 id
->remapping_type_depth
--;
4601 id
->regimplify
= old_regimplify
;
4602 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4603 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4605 add_local_decl (caller
, new_var
);
4609 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4610 have brought in or introduced any debug stmts for SRCVAR. */
4613 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4615 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4620 if (!VAR_P (*remappedvarp
))
4623 if (*remappedvarp
== id
->retvar
)
4626 tree tvar
= target_for_debug_bind (*remappedvarp
);
4630 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4632 gimple_seq_add_stmt (bindings
, stmt
);
4635 /* For each inlined variable for which we may have debug bind stmts,
4636 add before GSI a final debug stmt resetting it, marking the end of
4637 its life, so that var-tracking knows it doesn't have to compute
4638 further locations for it. */
4641 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4645 gimple_seq bindings
= NULL
;
4647 if (!gimple_in_ssa_p (id
->src_cfun
))
4650 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4653 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4654 var
; var
= DECL_CHAIN (var
))
4655 reset_debug_binding (id
, var
, &bindings
);
4657 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4658 reset_debug_binding (id
, var
, &bindings
);
4660 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4663 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4666 expand_call_inline (basic_block bb
, gimple
*stmt
, copy_body_data
*id
,
4671 hash_map
<tree
, tree
> *dst
;
4672 hash_map
<tree
, tree
> *st
= NULL
;
4675 struct cgraph_edge
*cg_edge
;
4676 cgraph_inline_failed_t reason
;
4677 basic_block return_block
;
4679 gimple_stmt_iterator gsi
, stmt_gsi
;
4680 bool successfully_inlined
= false;
4681 bool purge_dead_abnormal_edges
;
4683 unsigned int prop_mask
, src_properties
;
4684 struct function
*dst_cfun
;
4687 gimple
*simtenter_stmt
= NULL
;
4688 vec
<tree
> *simtvars_save
;
4690 /* The gimplifier uses input_location in too many places, such as
4691 internal_get_tmp_var (). */
4692 location_t saved_location
= input_location
;
4693 input_location
= gimple_location (stmt
);
4695 /* From here on, we're only interested in CALL_EXPRs. */
4696 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4700 cg_edge
= id
->dst_node
->get_edge (stmt
);
4701 gcc_checking_assert (cg_edge
);
4702 /* First, see if we can figure out what function is being called.
4703 If we cannot, then there is no hope of inlining the function. */
4704 if (cg_edge
->indirect_unknown_callee
)
4706 fn
= cg_edge
->callee
->decl
;
4707 gcc_checking_assert (fn
);
4709 /* If FN is a declaration of a function in a nested scope that was
4710 globally declared inline, we don't set its DECL_INITIAL.
4711 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4712 C++ front-end uses it for cdtors to refer to their internal
4713 declarations, that are not real functions. Fortunately those
4714 don't have trees to be saved, so we can tell by checking their
4716 if (!DECL_INITIAL (fn
)
4717 && DECL_ABSTRACT_ORIGIN (fn
)
4718 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4719 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4721 /* Don't try to inline functions that are not well-suited to inlining. */
4722 if (cg_edge
->inline_failed
)
4724 reason
= cg_edge
->inline_failed
;
4725 /* If this call was originally indirect, we do not want to emit any
4726 inlining related warnings or sorry messages because there are no
4727 guarantees regarding those. */
4728 if (cg_edge
->indirect_inlining_edge
)
4731 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4732 /* For extern inline functions that get redefined we always
4733 silently ignored always_inline flag. Better behavior would
4734 be to be able to keep both bodies and use extern inline body
4735 for inlining, but we can't do that because frontends overwrite
4737 && !cg_edge
->callee
->redefined_extern_inline
4738 /* During early inline pass, report only when optimization is
4740 && (symtab
->global_info_ready
4742 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4743 /* PR 20090218-1_0.c. Body can be provided by another module. */
4744 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4746 error ("inlining failed in call to %<always_inline%> %q+F: %s", fn
,
4747 cgraph_inline_failed_string (reason
));
4748 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4749 inform (gimple_location (stmt
), "called from here");
4750 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4751 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4752 "called from this function");
4754 else if (opt_for_fn (fn
, warn_inline
)
4755 && DECL_DECLARED_INLINE_P (fn
)
4756 && !DECL_NO_INLINE_WARNING_P (fn
)
4757 && !DECL_IN_SYSTEM_HEADER (fn
)
4758 && reason
!= CIF_UNSPECIFIED
4759 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4760 /* Do not warn about not inlined recursive calls. */
4761 && !cg_edge
->recursive_p ()
4762 /* Avoid warnings during early inline pass. */
4763 && symtab
->global_info_ready
)
4765 auto_diagnostic_group d
;
4766 if (warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4767 fn
, _(cgraph_inline_failed_string (reason
))))
4769 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4770 inform (gimple_location (stmt
), "called from here");
4771 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4772 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4773 "called from this function");
4778 id
->src_node
= cg_edge
->callee
;
4780 /* If callee is thunk, all we need is to adjust the THIS pointer
4781 and redirect to function being thunked. */
4782 if (id
->src_node
->thunk
.thunk_p
)
4785 tree virtual_offset
= NULL
;
4786 profile_count count
= cg_edge
->count
;
4788 gimple_stmt_iterator iter
= gsi_for_stmt (stmt
);
4790 cgraph_edge::remove (cg_edge
);
4791 edge
= id
->src_node
->callees
->clone (id
->dst_node
, call_stmt
,
4793 profile_count::one (),
4794 profile_count::one (),
4796 edge
->count
= count
;
4797 if (id
->src_node
->thunk
.virtual_offset_p
)
4798 virtual_offset
= size_int (id
->src_node
->thunk
.virtual_value
);
4799 op
= create_tmp_reg_fn (cfun
, TREE_TYPE (gimple_call_arg (stmt
, 0)),
4801 gsi_insert_before (&iter
, gimple_build_assign (op
,
4802 gimple_call_arg (stmt
, 0)),
4804 gcc_assert (id
->src_node
->thunk
.this_adjusting
);
4805 op
= thunk_adjust (&iter
, op
, 1, id
->src_node
->thunk
.fixed_offset
,
4806 virtual_offset
, id
->src_node
->thunk
.indirect_offset
);
4808 gimple_call_set_arg (stmt
, 0, op
);
4809 gimple_call_set_fndecl (stmt
, edge
->callee
->decl
);
4811 id
->src_node
->remove ();
4812 expand_call_inline (bb
, stmt
, id
, to_purge
);
4813 maybe_remove_unused_call_args (cfun
, stmt
);
4816 fn
= cg_edge
->callee
->decl
;
4817 cg_edge
->callee
->get_untransformed_body ();
4819 if (flag_checking
&& cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4820 cg_edge
->callee
->verify ();
4822 /* We will be inlining this callee. */
4823 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4825 /* Update the callers EH personality. */
4826 if (DECL_FUNCTION_PERSONALITY (fn
))
4827 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4828 = DECL_FUNCTION_PERSONALITY (fn
);
4830 /* Split the block before the GIMPLE_CALL. */
4831 stmt_gsi
= gsi_for_stmt (stmt
);
4832 gsi_prev (&stmt_gsi
);
4833 e
= split_block (bb
, gsi_end_p (stmt_gsi
) ? NULL
: gsi_stmt (stmt_gsi
));
4835 return_block
= e
->dest
;
4838 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4839 been the source of abnormal edges. In this case, schedule
4840 the removal of dead abnormal edges. */
4841 gsi
= gsi_start_bb (return_block
);
4843 purge_dead_abnormal_edges
= gsi_end_p (gsi
);
4845 stmt_gsi
= gsi_start_bb (return_block
);
4847 /* Build a block containing code to initialize the arguments, the
4848 actual inline expansion of the body, and a label for the return
4849 statements within the function to jump to. The type of the
4850 statement expression is the return type of the function call.
4851 ??? If the call does not have an associated block then we will
4852 remap all callee blocks to NULL, effectively dropping most of
4853 its debug information. This should only happen for calls to
4854 artificial decls inserted by the compiler itself. We need to
4855 either link the inlined blocks into the caller block tree or
4856 not refer to them in any way to not break GC for locations. */
4857 if (tree block
= gimple_block (stmt
))
4859 /* We do want to assign a not UNKNOWN_LOCATION BLOCK_SOURCE_LOCATION
4860 to make inlined_function_outer_scope_p return true on this BLOCK. */
4861 location_t loc
= LOCATION_LOCUS (gimple_location (stmt
));
4862 if (loc
== UNKNOWN_LOCATION
)
4863 loc
= LOCATION_LOCUS (DECL_SOURCE_LOCATION (fn
));
4864 if (loc
== UNKNOWN_LOCATION
)
4865 loc
= BUILTINS_LOCATION
;
4866 id
->block
= make_node (BLOCK
);
4867 BLOCK_ABSTRACT_ORIGIN (id
->block
) = DECL_ORIGIN (fn
);
4868 BLOCK_SOURCE_LOCATION (id
->block
) = loc
;
4869 prepend_lexical_block (block
, id
->block
);
4872 /* Local declarations will be replaced by their equivalents in this map. */
4874 id
->decl_map
= new hash_map
<tree
, tree
>;
4875 dst
= id
->debug_map
;
4876 id
->debug_map
= NULL
;
4877 if (flag_stack_reuse
!= SR_NONE
)
4878 id
->add_clobbers_to_eh_landing_pads
= last_basic_block_for_fn (cfun
);
4880 /* Record the function we are about to inline. */
4882 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4883 id
->reset_location
= DECL_IGNORED_P (fn
);
4884 id
->call_stmt
= call_stmt
;
4886 /* When inlining into an OpenMP SIMD-on-SIMT loop, arrange for new automatic
4887 variables to be added to IFN_GOMP_SIMT_ENTER argument list. */
4888 dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4889 simtvars_save
= id
->dst_simt_vars
;
4890 if (!(dst_cfun
->curr_properties
& PROP_gimple_lomp_dev
)
4891 && (simduid
= bb
->loop_father
->simduid
) != NULL_TREE
4892 && (simduid
= ssa_default_def (dst_cfun
, simduid
)) != NULL_TREE
4893 && single_imm_use (simduid
, &use
, &simtenter_stmt
)
4894 && is_gimple_call (simtenter_stmt
)
4895 && gimple_call_internal_p (simtenter_stmt
, IFN_GOMP_SIMT_ENTER
))
4896 vec_alloc (id
->dst_simt_vars
, 0);
4898 id
->dst_simt_vars
= NULL
;
4900 if (profile_status_for_fn (id
->src_cfun
) == PROFILE_ABSENT
)
4901 profile_status_for_fn (dst_cfun
) = PROFILE_ABSENT
;
4903 /* If the src function contains an IFN_VA_ARG, then so will the dst
4904 function after inlining. Likewise for IFN_GOMP_USE_SIMT. */
4905 prop_mask
= PROP_gimple_lva
| PROP_gimple_lomp_dev
;
4906 src_properties
= id
->src_cfun
->curr_properties
& prop_mask
;
4907 if (src_properties
!= prop_mask
)
4908 dst_cfun
->curr_properties
&= src_properties
| ~prop_mask
;
4909 dst_cfun
->calls_eh_return
|= id
->src_cfun
->calls_eh_return
;
4911 gcc_assert (!id
->src_cfun
->after_inlining
);
4914 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4916 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4917 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4921 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4922 if (debug_nonbind_markers_p
&& debug_inline_points
&& id
->block
4923 && inlined_function_outer_scope_p (id
->block
))
4925 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4926 gsi_insert_after (&si
, gimple_build_debug_inline_entry
4927 (id
->block
, DECL_SOURCE_LOCATION (id
->src_fn
)),
4931 if (DECL_INITIAL (fn
))
4933 if (gimple_block (stmt
))
4937 prepend_lexical_block (id
->block
,
4938 remap_blocks (DECL_INITIAL (fn
), id
));
4939 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4940 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4942 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4943 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4944 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4945 under it. The parameters can be then evaluated in the debugger,
4946 but don't show in backtraces. */
4947 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4948 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4951 *var
= TREE_CHAIN (v
);
4952 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4953 BLOCK_VARS (id
->block
) = v
;
4956 var
= &TREE_CHAIN (*var
);
4959 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4962 /* Return statements in the function body will be replaced by jumps
4963 to the RET_LABEL. */
4964 gcc_assert (DECL_INITIAL (fn
));
4965 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4967 /* Find the LHS to which the result of this call is assigned. */
4969 if (gimple_call_lhs (stmt
))
4971 modify_dest
= gimple_call_lhs (stmt
);
4973 /* The function which we are inlining might not return a value,
4974 in which case we should issue a warning that the function
4975 does not return a value. In that case the optimizers will
4976 see that the variable to which the value is assigned was not
4977 initialized. We do not want to issue a warning about that
4978 uninitialized variable. */
4979 if (DECL_P (modify_dest
))
4980 TREE_NO_WARNING (modify_dest
) = 1;
4982 if (gimple_call_return_slot_opt_p (call_stmt
))
4984 return_slot
= modify_dest
;
4991 /* If we are inlining a call to the C++ operator new, we don't want
4992 to use type based alias analysis on the return value. Otherwise
4993 we may get confused if the compiler sees that the inlined new
4994 function returns a pointer which was just deleted. See bug
4996 if (DECL_IS_OPERATOR_NEW_P (fn
))
5002 /* Declare the return variable for the function. */
5003 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
5005 /* Add local vars in this inlined callee to caller. */
5006 add_local_variables (id
->src_cfun
, cfun
, id
);
5008 if (id
->src_node
->clone
.performed_splits
)
5010 /* Any calls from the inlined function will be turned into calls from the
5011 function we inline into. We must preserve notes about how to split
5012 parameters such calls should be redirected/updated. */
5013 unsigned len
= vec_safe_length (id
->src_node
->clone
.performed_splits
);
5014 for (unsigned i
= 0; i
< len
; i
++)
5016 ipa_param_performed_split ps
5017 = (*id
->src_node
->clone
.performed_splits
)[i
];
5018 ps
.dummy_decl
= remap_decl (ps
.dummy_decl
, id
);
5019 vec_safe_push (id
->dst_node
->clone
.performed_splits
, ps
);
5024 len
= vec_safe_length (id
->dst_node
->clone
.performed_splits
);
5025 for (unsigned i
= 0; i
< len
; i
++)
5027 ipa_param_performed_split
*ps1
5028 = &(*id
->dst_node
->clone
.performed_splits
)[i
];
5029 for (unsigned j
= i
+ 1; j
< len
; j
++)
5031 ipa_param_performed_split
*ps2
5032 = &(*id
->dst_node
->clone
.performed_splits
)[j
];
5033 gcc_assert (ps1
->dummy_decl
!= ps2
->dummy_decl
5034 || ps1
->unit_offset
!= ps2
->unit_offset
);
5040 if (dump_enabled_p ())
5043 snprintf (buf
, sizeof(buf
), "%4.2f",
5044 cg_edge
->sreal_frequency ().to_double ());
5045 dump_printf_loc (MSG_NOTE
| MSG_PRIORITY_INTERNALS
,
5047 "Inlining %C to %C with frequency %s\n",
5048 id
->src_node
, id
->dst_node
, buf
);
5049 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5051 id
->src_node
->dump (dump_file
);
5052 id
->dst_node
->dump (dump_file
);
5056 /* This is it. Duplicate the callee body. Assume callee is
5057 pre-gimplified. Note that we must not alter the caller
5058 function in any way before this point, as this CALL_EXPR may be
5059 a self-referential call; if we're calling ourselves, we need to
5060 duplicate our body before altering anything. */
5061 copy_body (id
, bb
, return_block
, NULL
);
5063 reset_debug_bindings (id
, stmt_gsi
);
5065 if (flag_stack_reuse
!= SR_NONE
)
5066 for (tree p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
5067 if (!TREE_THIS_VOLATILE (p
))
5069 tree
*varp
= id
->decl_map
->get (p
);
5070 if (varp
&& VAR_P (*varp
) && !is_gimple_reg (*varp
))
5072 tree clobber
= build_clobber (TREE_TYPE (*varp
));
5073 gimple
*clobber_stmt
;
5074 clobber_stmt
= gimple_build_assign (*varp
, clobber
);
5075 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
5076 gsi_insert_before (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
5080 /* Reset the escaped solution. */
5081 if (cfun
->gimple_df
)
5082 pt_solution_reset (&cfun
->gimple_df
->escaped
);
5084 /* Add new automatic variables to IFN_GOMP_SIMT_ENTER arguments. */
5085 if (id
->dst_simt_vars
&& id
->dst_simt_vars
->length () > 0)
5087 size_t nargs
= gimple_call_num_args (simtenter_stmt
);
5088 vec
<tree
> *vars
= id
->dst_simt_vars
;
5089 auto_vec
<tree
> newargs (nargs
+ vars
->length ());
5090 for (size_t i
= 0; i
< nargs
; i
++)
5091 newargs
.quick_push (gimple_call_arg (simtenter_stmt
, i
));
5092 for (tree
*pvar
= vars
->begin (); pvar
!= vars
->end (); pvar
++)
5094 tree ptrtype
= build_pointer_type (TREE_TYPE (*pvar
));
5095 newargs
.quick_push (build1 (ADDR_EXPR
, ptrtype
, *pvar
));
5097 gcall
*g
= gimple_build_call_internal_vec (IFN_GOMP_SIMT_ENTER
, newargs
);
5098 gimple_call_set_lhs (g
, gimple_call_lhs (simtenter_stmt
));
5099 gimple_stmt_iterator gsi
= gsi_for_stmt (simtenter_stmt
);
5100 gsi_replace (&gsi
, g
, false);
5102 vec_free (id
->dst_simt_vars
);
5103 id
->dst_simt_vars
= simtvars_save
;
5108 delete id
->debug_map
;
5109 id
->debug_map
= dst
;
5111 delete id
->decl_map
;
5114 /* Unlink the calls virtual operands before replacing it. */
5115 unlink_stmt_vdef (stmt
);
5116 if (gimple_vdef (stmt
)
5117 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
5118 release_ssa_name (gimple_vdef (stmt
));
5120 /* If the inlined function returns a result that we care about,
5121 substitute the GIMPLE_CALL with an assignment of the return
5122 variable to the LHS of the call. That is, if STMT was
5123 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
5124 if (use_retvar
&& gimple_call_lhs (stmt
))
5126 gimple
*old_stmt
= stmt
;
5127 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
5128 gimple_set_location (stmt
, gimple_location (old_stmt
));
5129 gsi_replace (&stmt_gsi
, stmt
, false);
5130 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
5131 /* Append a clobber for id->retvar if easily possible. */
5132 if (flag_stack_reuse
!= SR_NONE
5134 && VAR_P (id
->retvar
)
5135 && id
->retvar
!= return_slot
5136 && id
->retvar
!= modify_dest
5137 && !TREE_THIS_VOLATILE (id
->retvar
)
5138 && !is_gimple_reg (id
->retvar
)
5139 && !stmt_ends_bb_p (stmt
))
5141 tree clobber
= build_clobber (TREE_TYPE (id
->retvar
));
5142 gimple
*clobber_stmt
;
5143 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
5144 gimple_set_location (clobber_stmt
, gimple_location (old_stmt
));
5145 gsi_insert_after (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
5150 /* Handle the case of inlining a function with no return
5151 statement, which causes the return value to become undefined. */
5152 if (gimple_call_lhs (stmt
)
5153 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
5155 tree name
= gimple_call_lhs (stmt
);
5156 tree var
= SSA_NAME_VAR (name
);
5157 tree def
= var
? ssa_default_def (cfun
, var
) : NULL
;
5161 /* If the variable is used undefined, make this name
5162 undefined via a move. */
5163 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
5164 gsi_replace (&stmt_gsi
, stmt
, true);
5170 var
= create_tmp_reg_fn (cfun
, TREE_TYPE (name
), NULL
);
5171 SET_SSA_NAME_VAR_OR_IDENTIFIER (name
, var
);
5173 /* Otherwise make this variable undefined. */
5174 gsi_remove (&stmt_gsi
, true);
5175 set_ssa_default_def (cfun
, var
, name
);
5176 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
5179 /* Replace with a clobber for id->retvar. */
5180 else if (flag_stack_reuse
!= SR_NONE
5182 && VAR_P (id
->retvar
)
5183 && id
->retvar
!= return_slot
5184 && id
->retvar
!= modify_dest
5185 && !TREE_THIS_VOLATILE (id
->retvar
)
5186 && !is_gimple_reg (id
->retvar
))
5188 tree clobber
= build_clobber (TREE_TYPE (id
->retvar
));
5189 gimple
*clobber_stmt
;
5190 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
5191 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
5192 gsi_replace (&stmt_gsi
, clobber_stmt
, false);
5193 maybe_clean_or_replace_eh_stmt (stmt
, clobber_stmt
);
5196 gsi_remove (&stmt_gsi
, true);
5199 if (purge_dead_abnormal_edges
)
5200 bitmap_set_bit (to_purge
, return_block
->index
);
5202 /* If the value of the new expression is ignored, that's OK. We
5203 don't warn about this for CALL_EXPRs, so we shouldn't warn about
5204 the equivalent inlined version either. */
5205 if (is_gimple_assign (stmt
))
5207 gcc_assert (gimple_assign_single_p (stmt
)
5208 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
5209 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
5212 id
->add_clobbers_to_eh_landing_pads
= 0;
5214 /* Output the inlining info for this abstract function, since it has been
5215 inlined. If we don't do this now, we can lose the information about the
5216 variables in the function when the blocks get blown away as soon as we
5217 remove the cgraph node. */
5218 if (gimple_block (stmt
))
5219 (*debug_hooks
->outlining_inline_function
) (fn
);
5221 /* Update callgraph if needed. */
5222 cg_edge
->callee
->remove ();
5224 id
->block
= NULL_TREE
;
5225 id
->retvar
= NULL_TREE
;
5226 successfully_inlined
= true;
5229 input_location
= saved_location
;
5230 return successfully_inlined
;
5233 /* Expand call statements reachable from STMT_P.
5234 We can only have CALL_EXPRs as the "toplevel" tree code or nested
5235 in a MODIFY_EXPR. */
5238 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
,
5241 gimple_stmt_iterator gsi
;
5242 bool inlined
= false;
5244 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
5246 gimple
*stmt
= gsi_stmt (gsi
);
5249 if (is_gimple_call (stmt
)
5250 && !gimple_call_internal_p (stmt
))
5251 inlined
|= expand_call_inline (bb
, stmt
, id
, to_purge
);
5258 /* Walk all basic blocks created after FIRST and try to fold every statement
5259 in the STATEMENTS pointer set. */
5262 fold_marked_statements (int first
, hash_set
<gimple
*> *statements
)
5264 auto_bitmap to_purge
;
5266 auto_vec
<edge
, 20> stack (n_basic_blocks_for_fn (cfun
) + 2);
5267 auto_sbitmap
visited (last_basic_block_for_fn (cfun
));
5268 bitmap_clear (visited
);
5270 stack
.quick_push (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5271 while (!stack
.is_empty ())
5273 /* Look at the edge on the top of the stack. */
5274 edge e
= stack
.pop ();
5275 basic_block dest
= e
->dest
;
5277 if (dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
)
5278 || bitmap_bit_p (visited
, dest
->index
))
5281 bitmap_set_bit (visited
, dest
->index
);
5283 if (dest
->index
>= first
)
5284 for (gimple_stmt_iterator gsi
= gsi_start_bb (dest
);
5285 !gsi_end_p (gsi
); gsi_next (&gsi
))
5287 if (!statements
->contains (gsi_stmt (gsi
)))
5290 gimple
*old_stmt
= gsi_stmt (gsi
);
5291 tree old_decl
= (is_gimple_call (old_stmt
)
5292 ? gimple_call_fndecl (old_stmt
) : 0);
5293 if (old_decl
&& fndecl_built_in_p (old_decl
))
5295 /* Folding builtins can create multiple instructions,
5296 we need to look at all of them. */
5297 gimple_stmt_iterator i2
= gsi
;
5299 if (fold_stmt (&gsi
))
5302 /* If a builtin at the end of a bb folded into nothing,
5303 the following loop won't work. */
5304 if (gsi_end_p (gsi
))
5306 cgraph_update_edges_for_call_stmt (old_stmt
,
5311 i2
= gsi_start_bb (dest
);
5316 new_stmt
= gsi_stmt (i2
);
5317 update_stmt (new_stmt
);
5318 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5321 if (new_stmt
== gsi_stmt (gsi
))
5323 /* It is okay to check only for the very last
5324 of these statements. If it is a throwing
5325 statement nothing will change. If it isn't
5326 this can remove EH edges. If that weren't
5327 correct then because some intermediate stmts
5328 throw, but not the last one. That would mean
5329 we'd have to split the block, which we can't
5330 here and we'd loose anyway. And as builtins
5331 probably never throw, this all
5333 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
5335 bitmap_set_bit (to_purge
, dest
->index
);
5342 else if (fold_stmt (&gsi
))
5344 /* Re-read the statement from GSI as fold_stmt() may
5346 gimple
*new_stmt
= gsi_stmt (gsi
);
5347 update_stmt (new_stmt
);
5349 if (is_gimple_call (old_stmt
)
5350 || is_gimple_call (new_stmt
))
5351 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5354 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
5355 bitmap_set_bit (to_purge
, dest
->index
);
5359 if (EDGE_COUNT (dest
->succs
) > 0)
5361 /* Avoid warnings emitted from folding statements that
5362 became unreachable because of inlined function parameter
5364 e
= find_taken_edge (dest
, NULL_TREE
);
5366 stack
.quick_push (e
);
5370 FOR_EACH_EDGE (e
, ei
, dest
->succs
)
5371 stack
.safe_push (e
);
5376 gimple_purge_all_dead_eh_edges (to_purge
);
5379 /* Expand calls to inline functions in the body of FN. */
5382 optimize_inline_calls (tree fn
)
5386 int last
= n_basic_blocks_for_fn (cfun
);
5387 bool inlined_p
= false;
5390 memset (&id
, 0, sizeof (id
));
5392 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
5393 gcc_assert (id
.dst_node
->definition
);
5395 /* Or any functions that aren't finished yet. */
5396 if (current_function_decl
)
5397 id
.dst_fn
= current_function_decl
;
5399 id
.copy_decl
= copy_decl_maybe_to_var
;
5400 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5401 id
.transform_new_cfg
= false;
5402 id
.transform_return_to_modify
= true;
5403 id
.transform_parameter
= true;
5404 id
.transform_lang_insert_block
= NULL
;
5405 id
.statements_to_fold
= new hash_set
<gimple
*>;
5407 push_gimplify_context ();
5409 /* We make no attempts to keep dominance info up-to-date. */
5410 free_dominance_info (CDI_DOMINATORS
);
5411 free_dominance_info (CDI_POST_DOMINATORS
);
5413 /* Register specific gimple functions. */
5414 gimple_register_cfg_hooks ();
5416 /* Reach the trees by walking over the CFG, and note the
5417 enclosing basic-blocks in the call edges. */
5418 /* We walk the blocks going forward, because inlined function bodies
5419 will split id->current_basic_block, and the new blocks will
5420 follow it; we'll trudge through them, processing their CALL_EXPRs
5422 auto_bitmap to_purge
;
5423 FOR_EACH_BB_FN (bb
, cfun
)
5424 inlined_p
|= gimple_expand_calls_inline (bb
, &id
, to_purge
);
5426 pop_gimplify_context (NULL
);
5430 struct cgraph_edge
*e
;
5432 id
.dst_node
->verify ();
5434 /* Double check that we inlined everything we are supposed to inline. */
5435 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
5436 gcc_assert (e
->inline_failed
);
5439 /* If we didn't inline into the function there is nothing to do. */
5442 delete id
.statements_to_fold
;
5446 /* Fold queued statements. */
5447 update_max_bb_count ();
5448 fold_marked_statements (last
, id
.statements_to_fold
);
5449 delete id
.statements_to_fold
;
5451 /* Finally purge EH and abnormal edges from the call stmts we inlined.
5452 We need to do this after fold_marked_statements since that may walk
5453 the SSA use-def chain. */
5456 EXECUTE_IF_SET_IN_BITMAP (to_purge
, 0, i
, bi
)
5458 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
5461 gimple_purge_dead_eh_edges (bb
);
5462 gimple_purge_dead_abnormal_call_edges (bb
);
5466 gcc_assert (!id
.debug_stmts
.exists ());
5468 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5471 delete_unreachable_blocks_update_callgraph (id
.dst_node
, false);
5472 id
.dst_node
->calls_comdat_local
= id
.dst_node
->check_calls_comdat_local_p ();
5475 id
.dst_node
->verify ();
5477 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5478 not possible yet - the IPA passes might make various functions to not
5479 throw and they don't care to proactively update local EH info. This is
5480 done later in fixup_cfg pass that also execute the verification. */
5481 return (TODO_update_ssa
5483 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5484 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
5485 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
5486 ? TODO_rebuild_frequencies
: 0));
5489 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5492 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5494 enum tree_code code
= TREE_CODE (*tp
);
5495 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5497 /* We make copies of most nodes. */
5498 if (IS_EXPR_CODE_CLASS (cl
)
5499 || code
== TREE_LIST
5501 || code
== TYPE_DECL
5502 || code
== OMP_CLAUSE
)
5504 /* Because the chain gets clobbered when we make a copy, we save it
5506 tree chain
= NULL_TREE
, new_tree
;
5508 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5509 chain
= TREE_CHAIN (*tp
);
5511 /* Copy the node. */
5512 new_tree
= copy_node (*tp
);
5516 /* Now, restore the chain, if appropriate. That will cause
5517 walk_tree to walk into the chain as well. */
5518 if (code
== PARM_DECL
5519 || code
== TREE_LIST
5520 || code
== OMP_CLAUSE
)
5521 TREE_CHAIN (*tp
) = chain
;
5523 /* For now, we don't update BLOCKs when we make copies. So, we
5524 have to nullify all BIND_EXPRs. */
5525 if (TREE_CODE (*tp
) == BIND_EXPR
)
5526 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5528 else if (code
== CONSTRUCTOR
)
5530 /* CONSTRUCTOR nodes need special handling because
5531 we need to duplicate the vector of elements. */
5534 new_tree
= copy_node (*tp
);
5535 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5538 else if (code
== STATEMENT_LIST
)
5539 /* We used to just abort on STATEMENT_LIST, but we can run into them
5540 with statement-expressions (c++/40975). */
5541 copy_statement_list (tp
);
5542 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5544 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5546 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5551 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5552 information indicating to what new SAVE_EXPR this one should be mapped,
5553 use that one. Otherwise, create a new node and enter it in ST. FN is
5554 the function into which the copy will be placed. */
5557 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5562 /* See if we already encountered this SAVE_EXPR. */
5565 /* If we didn't already remap this SAVE_EXPR, do so now. */
5568 t
= copy_node (*tp
);
5570 /* Remember this SAVE_EXPR. */
5572 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5577 /* We've already walked into this SAVE_EXPR; don't do it again. */
5582 /* Replace this SAVE_EXPR with the copy. */
5586 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5587 label, copies the declaration and enters it in the splay_tree in DATA (which
5588 is really a 'copy_body_data *'. */
5591 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5592 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5593 struct walk_stmt_info
*wi
)
5595 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5596 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5600 tree decl
= gimple_label_label (stmt
);
5602 /* Copy the decl and remember the copy. */
5603 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5609 static gimple_seq
duplicate_remap_omp_clause_seq (gimple_seq seq
,
5610 struct walk_stmt_info
*wi
);
5612 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5613 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5614 remaps all local declarations to appropriate replacements in gimple
5618 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5620 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5621 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5622 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5626 /* For recursive invocations this is no longer the LHS itself. */
5627 bool is_lhs
= wi
->is_lhs
;
5630 if (TREE_CODE (expr
) == SSA_NAME
)
5632 *tp
= remap_ssa_name (*tp
, id
);
5635 SSA_NAME_DEF_STMT (*tp
) = gsi_stmt (wi
->gsi
);
5637 /* Only a local declaration (variable or label). */
5638 else if ((VAR_P (expr
) && !TREE_STATIC (expr
))
5639 || TREE_CODE (expr
) == LABEL_DECL
)
5641 /* Lookup the declaration. */
5644 /* If it's there, remap it. */
5649 else if (TREE_CODE (expr
) == STATEMENT_LIST
5650 || TREE_CODE (expr
) == BIND_EXPR
5651 || TREE_CODE (expr
) == SAVE_EXPR
)
5653 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5655 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5656 It's OK for this to happen if it was part of a subtree that
5657 isn't immediately expanded, such as operand 2 of another
5659 if (!TREE_OPERAND (expr
, 1))
5661 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5662 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5665 else if (TREE_CODE (expr
) == OMP_CLAUSE
)
5667 /* Before the omplower pass completes, some OMP clauses can contain
5668 sequences that are neither copied by gimple_seq_copy nor walked by
5669 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5670 in those situations, we have to copy and process them explicitely. */
5672 if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LASTPRIVATE
)
5674 gimple_seq seq
= OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
);
5675 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5676 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
) = seq
;
5678 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LINEAR
)
5680 gimple_seq seq
= OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
);
5681 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5682 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
) = seq
;
5684 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_REDUCTION
)
5686 gimple_seq seq
= OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
);
5687 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5688 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
) = seq
;
5689 seq
= OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
);
5690 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5691 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
) = seq
;
5695 /* Keep iterating. */
5700 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5701 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5702 remaps all local declarations to appropriate replacements in gimple
5706 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5707 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5708 struct walk_stmt_info
*wi
)
5710 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5711 gimple
*gs
= gsi_stmt (*gsip
);
5713 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5715 tree block
= gimple_bind_block (stmt
);
5719 remap_block (&block
, id
);
5720 gimple_bind_set_block (stmt
, block
);
5723 /* This will remap a lot of the same decls again, but this should be
5725 if (gimple_bind_vars (stmt
))
5727 tree old_var
, decls
= gimple_bind_vars (stmt
);
5729 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
5730 if (!can_be_nonlocal (old_var
, id
)
5731 && ! variably_modified_type_p (TREE_TYPE (old_var
), id
->src_fn
))
5732 remap_decl (old_var
, id
);
5734 gcc_checking_assert (!id
->prevent_decl_creation_for_types
);
5735 id
->prevent_decl_creation_for_types
= true;
5736 gimple_bind_set_vars (stmt
, remap_decls (decls
, NULL
, id
));
5737 id
->prevent_decl_creation_for_types
= false;
5741 /* Keep iterating. */
5745 /* Create a copy of SEQ and remap all decls in it. */
5748 duplicate_remap_omp_clause_seq (gimple_seq seq
, struct walk_stmt_info
*wi
)
5753 /* If there are any labels in OMP sequences, they can be only referred to in
5754 the sequence itself and therefore we can do both here. */
5755 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, wi
);
5756 gimple_seq copy
= gimple_seq_copy (seq
);
5757 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, wi
);
5761 /* Copies everything in SEQ and replaces variables and labels local to
5762 current_function_decl. */
5765 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5768 struct walk_stmt_info wi
;
5771 /* There's nothing to do for NULL_TREE. */
5776 memset (&id
, 0, sizeof (id
));
5777 id
.src_fn
= current_function_decl
;
5778 id
.dst_fn
= current_function_decl
;
5780 id
.decl_map
= new hash_map
<tree
, tree
>;
5781 id
.debug_map
= NULL
;
5783 id
.copy_decl
= copy_decl_no_change
;
5784 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5785 id
.transform_new_cfg
= false;
5786 id
.transform_return_to_modify
= false;
5787 id
.transform_parameter
= false;
5788 id
.transform_lang_insert_block
= NULL
;
5790 /* Walk the tree once to find local labels. */
5791 memset (&wi
, 0, sizeof (wi
));
5792 hash_set
<tree
> visited
;
5795 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5797 copy
= gimple_seq_copy (seq
);
5799 /* Walk the copy, remapping decls. */
5800 memset (&wi
, 0, sizeof (wi
));
5802 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5807 delete id
.debug_map
;
5808 if (id
.dependence_map
)
5810 delete id
.dependence_map
;
5811 id
.dependence_map
= NULL
;
5818 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5821 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5830 debug_find_tree (tree top
, tree search
)
5832 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5836 /* Declare the variables created by the inliner. Add all the variables in
5837 VARS to BIND_EXPR. */
5840 declare_inline_vars (tree block
, tree vars
)
5843 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5845 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5846 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5847 add_local_decl (cfun
, t
);
5851 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5854 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5855 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5856 VAR_DECL translation. */
5859 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5861 /* Don't generate debug information for the copy if we wouldn't have
5862 generated it for the copy either. */
5863 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5864 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5866 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5867 declaration inspired this copy. */
5868 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5870 /* The new variable/label has no RTL, yet. */
5871 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5872 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5873 SET_DECL_RTL (copy
, 0);
5874 /* For vector typed decls make sure to update DECL_MODE according
5875 to the new function context. */
5876 if (VECTOR_TYPE_P (TREE_TYPE (copy
)))
5877 SET_DECL_MODE (copy
, TYPE_MODE (TREE_TYPE (copy
)));
5879 /* These args would always appear unused, if not for this. */
5880 TREE_USED (copy
) = 1;
5882 /* Set the context for the new declaration. */
5883 if (!DECL_CONTEXT (decl
))
5884 /* Globals stay global. */
5886 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5887 /* Things that weren't in the scope of the function we're inlining
5888 from aren't in the scope we're inlining to, either. */
5890 else if (TREE_STATIC (decl
))
5891 /* Function-scoped static variables should stay in the original
5896 /* Ordinary automatic local variables are now in the scope of the
5898 DECL_CONTEXT (copy
) = id
->dst_fn
;
5899 if (VAR_P (copy
) && id
->dst_simt_vars
&& !is_gimple_reg (copy
))
5901 if (!lookup_attribute ("omp simt private", DECL_ATTRIBUTES (copy
)))
5902 DECL_ATTRIBUTES (copy
)
5903 = tree_cons (get_identifier ("omp simt private"), NULL
,
5904 DECL_ATTRIBUTES (copy
));
5905 id
->dst_simt_vars
->safe_push (copy
);
5912 /* Create a new VAR_DECL that is indentical in all respect to DECL except that
5913 DECL can be either a VAR_DECL, a PARM_DECL or RESULT_DECL. The original
5914 DECL must come from ID->src_fn and the copy will be part of ID->dst_fn. */
5917 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5921 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5922 || TREE_CODE (decl
) == RESULT_DECL
);
5924 type
= TREE_TYPE (decl
);
5926 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5927 VAR_DECL
, DECL_NAME (decl
), type
);
5928 if (DECL_PT_UID_SET_P (decl
))
5929 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5930 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5931 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5932 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5933 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5934 DECL_BY_REFERENCE (copy
) = DECL_BY_REFERENCE (decl
);
5936 return copy_decl_for_dup_finish (id
, decl
, copy
);
5939 /* Like copy_decl_to_var, but create a return slot object instead of a
5940 pointer variable for return by invisible reference. */
5943 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5947 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5948 || TREE_CODE (decl
) == RESULT_DECL
);
5950 type
= TREE_TYPE (decl
);
5951 if (DECL_BY_REFERENCE (decl
))
5952 type
= TREE_TYPE (type
);
5954 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5955 VAR_DECL
, DECL_NAME (decl
), type
);
5956 if (DECL_PT_UID_SET_P (decl
))
5957 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5958 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5959 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5960 if (!DECL_BY_REFERENCE (decl
))
5962 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5963 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5966 return copy_decl_for_dup_finish (id
, decl
, copy
);
5970 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5974 copy
= copy_node (decl
);
5976 /* The COPY is not abstract; it will be generated in DST_FN. */
5977 DECL_ABSTRACT_P (copy
) = false;
5978 lang_hooks
.dup_lang_specific_decl (copy
);
5980 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5981 been taken; it's for internal bookkeeping in expand_goto_internal. */
5982 if (TREE_CODE (copy
) == LABEL_DECL
)
5984 TREE_ADDRESSABLE (copy
) = 0;
5985 LABEL_DECL_UID (copy
) = -1;
5988 return copy_decl_for_dup_finish (id
, decl
, copy
);
5992 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5994 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5995 return copy_decl_to_var (decl
, id
);
5997 return copy_decl_no_change (decl
, id
);
6000 /* Return a copy of the function's argument tree without any modifications. */
6003 copy_arguments_nochange (tree orig_parm
, copy_body_data
* id
)
6006 tree new_parm
= NULL
;
6009 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
))
6011 tree new_tree
= remap_decl (arg
, id
);
6012 if (TREE_CODE (new_tree
) != PARM_DECL
)
6013 new_tree
= id
->copy_decl (arg
, id
);
6014 lang_hooks
.dup_lang_specific_decl (new_tree
);
6016 parg
= &DECL_CHAIN (new_tree
);
6021 /* Return a copy of the function's static chain. */
6023 copy_static_chain (tree static_chain
, copy_body_data
* id
)
6025 tree
*chain_copy
, *pvar
;
6027 chain_copy
= &static_chain
;
6028 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
6030 tree new_tree
= remap_decl (*pvar
, id
);
6031 lang_hooks
.dup_lang_specific_decl (new_tree
);
6032 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
6035 return static_chain
;
6038 /* Return true if the function is allowed to be versioned.
6039 This is a guard for the versioning functionality. */
6042 tree_versionable_function_p (tree fndecl
)
6044 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
6045 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
)) == NULL
);
6048 /* Update clone info after duplication. */
6051 update_clone_info (copy_body_data
* id
)
6053 vec
<ipa_param_performed_split
, va_gc
> *cur_performed_splits
6054 = id
->dst_node
->clone
.performed_splits
;
6055 if (cur_performed_splits
)
6057 unsigned len
= cur_performed_splits
->length ();
6058 for (unsigned i
= 0; i
< len
; i
++)
6060 ipa_param_performed_split
*ps
= &(*cur_performed_splits
)[i
];
6061 ps
->dummy_decl
= remap_decl (ps
->dummy_decl
, id
);
6065 struct cgraph_node
*node
;
6066 if (!id
->dst_node
->clones
)
6068 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
6070 /* First update replace maps to match the new body. */
6071 if (node
->clone
.tree_map
)
6074 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
6076 struct ipa_replace_map
*replace_info
;
6077 replace_info
= (*node
->clone
.tree_map
)[i
];
6078 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
6081 if (node
->clone
.performed_splits
)
6083 unsigned len
= vec_safe_length (node
->clone
.performed_splits
);
6084 for (unsigned i
= 0; i
< len
; i
++)
6086 ipa_param_performed_split
*ps
6087 = &(*node
->clone
.performed_splits
)[i
];
6088 ps
->dummy_decl
= remap_decl (ps
->dummy_decl
, id
);
6091 if (unsigned len
= vec_safe_length (cur_performed_splits
))
6093 /* We do not want to add current performed splits when we are saving
6094 a copy of function body for later during inlining, that would just
6095 duplicate all entries. So let's have a look whether anything
6096 referring to the first dummy_decl is present. */
6097 unsigned dst_len
= vec_safe_length (node
->clone
.performed_splits
);
6098 ipa_param_performed_split
*first
= &(*cur_performed_splits
)[0];
6099 for (unsigned i
= 0; i
< dst_len
; i
++)
6100 if ((*node
->clone
.performed_splits
)[i
].dummy_decl
6101 == first
->dummy_decl
)
6107 for (unsigned i
= 0; i
< len
; i
++)
6108 vec_safe_push (node
->clone
.performed_splits
,
6109 (*cur_performed_splits
)[i
]);
6112 for (unsigned i
= 0; i
< dst_len
; i
++)
6114 ipa_param_performed_split
*ps1
6115 = &(*node
->clone
.performed_splits
)[i
];
6116 for (unsigned j
= i
+ 1; j
< dst_len
; j
++)
6118 ipa_param_performed_split
*ps2
6119 = &(*node
->clone
.performed_splits
)[j
];
6120 gcc_assert (ps1
->dummy_decl
!= ps2
->dummy_decl
6121 || ps1
->unit_offset
!= ps2
->unit_offset
);
6128 node
= node
->clones
;
6129 else if (node
->next_sibling_clone
)
6130 node
= node
->next_sibling_clone
;
6133 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
6134 node
= node
->clone_of
;
6135 if (node
!= id
->dst_node
)
6136 node
= node
->next_sibling_clone
;
6141 /* Create a copy of a function's tree.
6142 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
6143 of the original function and the new copied function
6144 respectively. In case we want to replace a DECL
6145 tree with another tree while duplicating the function's
6146 body, TREE_MAP represents the mapping between these
6147 trees. If UPDATE_CLONES is set, the call_stmt fields
6148 of edges of clones of the function will be updated.
6150 If non-NULL PARAM_ADJUSTMENTS determines how function prototype (i.e. the
6151 function parameters and return value) should be modified).
6152 If non-NULL BLOCKS_TO_COPY determine what basic blocks to copy.
6153 If non_NULL NEW_ENTRY determine new entry BB of the clone.
6156 tree_function_versioning (tree old_decl
, tree new_decl
,
6157 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
6158 ipa_param_adjustments
*param_adjustments
,
6159 bool update_clones
, bitmap blocks_to_copy
,
6160 basic_block new_entry
)
6162 struct cgraph_node
*old_version_node
;
6163 struct cgraph_node
*new_version_node
;
6167 struct ipa_replace_map
*replace_info
;
6168 basic_block old_entry_block
, bb
;
6169 auto_vec
<gimple
*, 10> init_stmts
;
6170 tree vars
= NULL_TREE
;
6172 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
6173 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
6174 DECL_POSSIBLY_INLINED (old_decl
) = 1;
6176 old_version_node
= cgraph_node::get (old_decl
);
6177 gcc_checking_assert (old_version_node
);
6178 new_version_node
= cgraph_node::get (new_decl
);
6179 gcc_checking_assert (new_version_node
);
6181 /* Copy over debug args. */
6182 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
6184 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
6185 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
6186 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
6187 old_debug_args
= decl_debug_args_lookup (old_decl
);
6190 new_debug_args
= decl_debug_args_insert (new_decl
);
6191 *new_debug_args
= vec_safe_copy (*old_debug_args
);
6195 /* Output the inlining info for this abstract function, since it has been
6196 inlined. If we don't do this now, we can lose the information about the
6197 variables in the function when the blocks get blown away as soon as we
6198 remove the cgraph node. */
6199 (*debug_hooks
->outlining_inline_function
) (old_decl
);
6201 DECL_ARTIFICIAL (new_decl
) = 1;
6202 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
6203 if (DECL_ORIGIN (old_decl
) == old_decl
)
6204 old_version_node
->used_as_abstract_origin
= true;
6205 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
6207 /* Prepare the data structures for the tree copy. */
6208 memset (&id
, 0, sizeof (id
));
6210 /* Generate a new name for the new version. */
6211 id
.statements_to_fold
= new hash_set
<gimple
*>;
6213 id
.decl_map
= new hash_map
<tree
, tree
>;
6214 id
.debug_map
= NULL
;
6215 id
.src_fn
= old_decl
;
6216 id
.dst_fn
= new_decl
;
6217 id
.src_node
= old_version_node
;
6218 id
.dst_node
= new_version_node
;
6219 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
6220 id
.blocks_to_copy
= blocks_to_copy
;
6222 id
.copy_decl
= copy_decl_no_change
;
6223 id
.transform_call_graph_edges
6224 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
6225 id
.transform_new_cfg
= true;
6226 id
.transform_return_to_modify
= false;
6227 id
.transform_parameter
= false;
6228 id
.transform_lang_insert_block
= NULL
;
6230 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
6231 (DECL_STRUCT_FUNCTION (old_decl
));
6232 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
6233 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
6234 initialize_cfun (new_decl
, old_decl
,
6235 new_entry
? new_entry
->count
: old_entry_block
->count
);
6236 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
6237 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
6238 = id
.src_cfun
->gimple_df
->ipa_pta
;
6240 /* Copy the function's static chain. */
6241 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
6243 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
6244 = copy_static_chain (p
, &id
);
6246 auto_vec
<int, 16> new_param_indices
;
6247 ipa_param_adjustments
*old_param_adjustments
6248 = old_version_node
->clone
.param_adjustments
;
6249 if (old_param_adjustments
)
6250 old_param_adjustments
->get_updated_indices (&new_param_indices
);
6252 /* If there's a tree_map, prepare for substitution. */
6254 for (i
= 0; i
< tree_map
->length (); i
++)
6257 replace_info
= (*tree_map
)[i
];
6259 int p
= replace_info
->parm_num
;
6260 if (old_param_adjustments
)
6261 p
= new_param_indices
[p
];
6264 for (parm
= DECL_ARGUMENTS (old_decl
); p
;
6265 parm
= DECL_CHAIN (parm
))
6268 init
= setup_one_parameter (&id
, parm
, replace_info
->new_tree
,
6269 id
.src_fn
, NULL
, &vars
);
6271 init_stmts
.safe_push (init
);
6274 ipa_param_body_adjustments
*param_body_adjs
= NULL
;
6275 if (param_adjustments
)
6277 param_body_adjs
= new ipa_param_body_adjustments (param_adjustments
,
6279 &id
, &vars
, tree_map
);
6280 id
.param_body_adjs
= param_body_adjs
;
6281 DECL_ARGUMENTS (new_decl
) = param_body_adjs
->get_new_param_chain ();
6283 else if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
6284 DECL_ARGUMENTS (new_decl
)
6285 = copy_arguments_nochange (DECL_ARGUMENTS (old_decl
), &id
);
6287 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
6288 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
6290 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
6292 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
6293 /* Add local vars. */
6294 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
6296 if (DECL_RESULT (old_decl
) == NULL_TREE
)
6298 else if (param_adjustments
&& param_adjustments
->m_skip_return
6299 && !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
6301 tree resdecl_repl
= copy_result_decl_to_var (DECL_RESULT (old_decl
),
6303 declare_inline_vars (NULL
, resdecl_repl
);
6304 insert_decl_map (&id
, DECL_RESULT (old_decl
), resdecl_repl
);
6306 DECL_RESULT (new_decl
)
6307 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
6308 RESULT_DECL
, NULL_TREE
, void_type_node
);
6309 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
6310 DECL_IS_MALLOC (new_decl
) = false;
6311 cfun
->returns_struct
= 0;
6312 cfun
->returns_pcc_struct
= 0;
6317 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
6318 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
6319 if (gimple_in_ssa_p (id
.src_cfun
)
6320 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
6321 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
6323 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
6324 insert_decl_map (&id
, old_name
, new_name
);
6325 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
6326 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
6330 /* Set up the destination functions loop tree. */
6331 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
6333 cfun
->curr_properties
&= ~PROP_loops
;
6334 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
6335 cfun
->curr_properties
|= PROP_loops
;
6338 /* Copy the Function's body. */
6339 copy_body (&id
, ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
6342 /* Renumber the lexical scoping (non-code) blocks consecutively. */
6343 number_blocks (new_decl
);
6345 /* We want to create the BB unconditionally, so that the addition of
6346 debug stmts doesn't affect BB count, which may in the end cause
6347 codegen differences. */
6348 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6349 while (init_stmts
.length ())
6350 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
6351 update_clone_info (&id
);
6353 /* Remap the nonlocal_goto_save_area, if any. */
6354 if (cfun
->nonlocal_goto_save_area
)
6356 struct walk_stmt_info wi
;
6358 memset (&wi
, 0, sizeof (wi
));
6360 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
6366 delete id
.debug_map
;
6367 free_dominance_info (CDI_DOMINATORS
);
6368 free_dominance_info (CDI_POST_DOMINATORS
);
6370 update_max_bb_count ();
6371 fold_marked_statements (0, id
.statements_to_fold
);
6372 delete id
.statements_to_fold
;
6373 delete_unreachable_blocks_update_callgraph (id
.dst_node
, update_clones
);
6374 if (id
.dst_node
->definition
)
6375 cgraph_edge::rebuild_references ();
6376 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
6378 calculate_dominance_info (CDI_DOMINATORS
);
6379 fix_loop_structure (NULL
);
6381 update_ssa (TODO_update_ssa
);
6383 /* After partial cloning we need to rescale frequencies, so they are
6384 within proper range in the cloned function. */
6387 struct cgraph_edge
*e
;
6388 rebuild_frequencies ();
6390 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
6391 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
6393 basic_block bb
= gimple_bb (e
->call_stmt
);
6394 e
->count
= bb
->count
;
6396 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
6398 basic_block bb
= gimple_bb (e
->call_stmt
);
6399 e
->count
= bb
->count
;
6403 if (param_body_adjs
&& MAY_HAVE_DEBUG_BIND_STMTS
)
6405 vec
<tree
, va_gc
> **debug_args
= NULL
;
6406 unsigned int len
= 0;
6407 unsigned reset_len
= param_body_adjs
->m_reset_debug_decls
.length ();
6409 for (i
= 0; i
< reset_len
; i
++)
6411 tree parm
= param_body_adjs
->m_reset_debug_decls
[i
];
6412 gcc_assert (is_gimple_reg (parm
));
6415 if (debug_args
== NULL
)
6417 debug_args
= decl_debug_args_insert (new_decl
);
6418 len
= vec_safe_length (*debug_args
);
6420 ddecl
= make_node (DEBUG_EXPR_DECL
);
6421 DECL_ARTIFICIAL (ddecl
) = 1;
6422 TREE_TYPE (ddecl
) = TREE_TYPE (parm
);
6423 SET_DECL_MODE (ddecl
, DECL_MODE (parm
));
6424 vec_safe_push (*debug_args
, DECL_ORIGIN (parm
));
6425 vec_safe_push (*debug_args
, ddecl
);
6427 if (debug_args
!= NULL
)
6429 /* On the callee side, add
6432 stmts to the first bb where var is a VAR_DECL created for the
6433 optimized away parameter in DECL_INITIAL block. This hints
6434 in the debug info that var (whole DECL_ORIGIN is the parm
6435 PARM_DECL) is optimized away, but could be looked up at the
6436 call site as value of D#X there. */
6438 gimple_stmt_iterator cgsi
6439 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6442 i
= vec_safe_length (*debug_args
);
6446 while (var
!= NULL_TREE
6447 && DECL_ABSTRACT_ORIGIN (var
) != (**debug_args
)[i
])
6448 var
= TREE_CHAIN (var
);
6449 if (var
== NULL_TREE
)
6451 vexpr
= make_node (DEBUG_EXPR_DECL
);
6452 tree parm
= (**debug_args
)[i
];
6453 DECL_ARTIFICIAL (vexpr
) = 1;
6454 TREE_TYPE (vexpr
) = TREE_TYPE (parm
);
6455 SET_DECL_MODE (vexpr
, DECL_MODE (parm
));
6456 def_temp
= gimple_build_debug_bind (var
, vexpr
, NULL
);
6457 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6458 def_temp
= gimple_build_debug_source_bind (vexpr
, parm
, NULL
);
6459 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6464 delete param_body_adjs
;
6465 free_dominance_info (CDI_DOMINATORS
);
6466 free_dominance_info (CDI_POST_DOMINATORS
);
6468 gcc_assert (!id
.debug_stmts
.exists ());
6473 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6474 the callee and return the inlined body on success. */
6477 maybe_inline_call_in_expr (tree exp
)
6479 tree fn
= get_callee_fndecl (exp
);
6481 /* We can only try to inline "const" functions. */
6482 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
6484 call_expr_arg_iterator iter
;
6487 hash_map
<tree
, tree
> decl_map
;
6489 /* Remap the parameters. */
6490 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
6492 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
6493 decl_map
.put (param
, arg
);
6495 memset (&id
, 0, sizeof (id
));
6497 id
.dst_fn
= current_function_decl
;
6498 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6499 id
.decl_map
= &decl_map
;
6501 id
.copy_decl
= copy_decl_no_change
;
6502 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6503 id
.transform_new_cfg
= false;
6504 id
.transform_return_to_modify
= true;
6505 id
.transform_parameter
= true;
6506 id
.transform_lang_insert_block
= NULL
;
6508 /* Make sure not to unshare trees behind the front-end's back
6509 since front-end specific mechanisms may rely on sharing. */
6510 id
.regimplify
= false;
6511 id
.do_not_unshare
= true;
6513 /* We're not inside any EH region. */
6516 t
= copy_tree_body (&id
);
6518 /* We can only return something suitable for use in a GENERIC
6520 if (TREE_CODE (t
) == MODIFY_EXPR
)
6521 return TREE_OPERAND (t
, 1);
6527 /* Duplicate a type, fields and all. */
6530 build_duplicate_type (tree type
)
6532 struct copy_body_data id
;
6534 memset (&id
, 0, sizeof (id
));
6535 id
.src_fn
= current_function_decl
;
6536 id
.dst_fn
= current_function_decl
;
6538 id
.decl_map
= new hash_map
<tree
, tree
>;
6539 id
.debug_map
= NULL
;
6540 id
.copy_decl
= copy_decl_no_change
;
6542 type
= remap_type_1 (type
, &id
);
6546 delete id
.debug_map
;
6548 TYPE_CANONICAL (type
) = type
;
6553 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6554 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6558 copy_fn (tree fn
, tree
& parms
, tree
& result
)
6562 hash_map
<tree
, tree
> decl_map
;
6567 memset (&id
, 0, sizeof (id
));
6569 id
.dst_fn
= current_function_decl
;
6570 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6571 id
.decl_map
= &decl_map
;
6573 id
.copy_decl
= copy_decl_no_change
;
6574 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6575 id
.transform_new_cfg
= false;
6576 id
.transform_return_to_modify
= false;
6577 id
.transform_parameter
= true;
6578 id
.transform_lang_insert_block
= NULL
;
6580 /* Make sure not to unshare trees behind the front-end's back
6581 since front-end specific mechanisms may rely on sharing. */
6582 id
.regimplify
= false;
6583 id
.do_not_unshare
= true;
6584 id
.do_not_fold
= true;
6586 /* We're not inside any EH region. */
6589 /* Remap the parameters and result and return them to the caller. */
6590 for (param
= DECL_ARGUMENTS (fn
);
6592 param
= DECL_CHAIN (param
))
6594 *p
= remap_decl (param
, &id
);
6595 p
= &DECL_CHAIN (*p
);
6598 if (DECL_RESULT (fn
))
6599 result
= remap_decl (DECL_RESULT (fn
), &id
);
6603 return copy_tree_body (&id
);