2 Copyright (C) 2001-2019 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 (TYPE_MAX_VALUE (TYPE_DOMAIN (new_tree
)) == error_mark_node
560 && id
->adjust_array_error_bounds
561 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) != error_mark_node
)
563 tree v
= create_tmp_var (TREE_TYPE (TYPE_DOMAIN (new_tree
)));
565 = tree_cons (get_identifier ("omp dummy var"), NULL_TREE
,
566 DECL_ATTRIBUTES (v
));
567 TYPE_MAX_VALUE (TYPE_DOMAIN (new_tree
)) = v
;
574 case QUAL_UNION_TYPE
:
575 if (TYPE_MAIN_VARIANT (type
) != type
576 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
577 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
582 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
584 t
= remap_decl (f
, id
);
585 DECL_CONTEXT (t
) = new_tree
;
589 TYPE_FIELDS (new_tree
) = nreverse (nf
);
595 /* Shouldn't have been thought variable sized. */
599 /* All variants of type share the same size, so use the already remaped data. */
600 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
602 tree s
= TYPE_SIZE (type
);
603 tree mvs
= TYPE_SIZE (TYPE_MAIN_VARIANT (type
));
604 tree su
= TYPE_SIZE_UNIT (type
);
605 tree mvsu
= TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
));
606 gcc_checking_assert ((TREE_CODE (s
) == PLACEHOLDER_EXPR
607 && (TREE_CODE (mvs
) == PLACEHOLDER_EXPR
))
609 gcc_checking_assert ((TREE_CODE (su
) == PLACEHOLDER_EXPR
610 && (TREE_CODE (mvsu
) == PLACEHOLDER_EXPR
))
612 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
613 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
617 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
618 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
624 /* Helper function for remap_type_2, called through walk_tree. */
627 remap_type_3 (tree
*tp
, int *walk_subtrees
, void *data
)
629 copy_body_data
*id
= (copy_body_data
*) data
;
634 else if (DECL_P (*tp
) && remap_decl (*tp
, id
) != *tp
)
640 /* Return true if TYPE needs to be remapped because remap_decl on any
641 needed embedded decl returns something other than that decl. */
644 remap_type_2 (tree type
, copy_body_data
*id
)
648 #define RETURN_TRUE_IF_VAR(T) \
654 if (DECL_P (_t) && remap_decl (_t, id) != _t) \
656 if (!TYPE_SIZES_GIMPLIFIED (type) \
657 && walk_tree (&_t, remap_type_3, id, NULL)) \
663 switch (TREE_CODE (type
))
669 return remap_type_2 (TREE_TYPE (type
), id
);
673 case FIXED_POINT_TYPE
:
676 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
677 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
681 if (remap_type_2 (TREE_TYPE (type
), id
)
682 || (TYPE_DOMAIN (type
) && remap_type_2 (TYPE_DOMAIN (type
), id
)))
688 case QUAL_UNION_TYPE
:
689 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
690 if (TREE_CODE (t
) == FIELD_DECL
)
692 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
693 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
694 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
695 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
696 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
704 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
705 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
707 #undef RETURN_TRUE_IF_VAR
711 remap_type (tree type
, copy_body_data
*id
)
719 /* See if we have remapped this type. */
720 node
= id
->decl_map
->get (type
);
724 /* The type only needs remapping if it's variably modified. */
725 if (! variably_modified_type_p (type
, id
->src_fn
)
726 /* Don't remap if copy_decl method doesn't always return a new
727 decl and for all embedded decls returns the passed in decl. */
728 || (id
->dont_remap_vla_if_no_change
&& !remap_type_2 (type
, id
)))
730 insert_decl_map (id
, type
, type
);
734 id
->remapping_type_depth
++;
735 tmp
= remap_type_1 (type
, id
);
736 id
->remapping_type_depth
--;
741 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
744 can_be_nonlocal (tree decl
, copy_body_data
*id
)
746 /* We cannot duplicate function decls. */
747 if (TREE_CODE (decl
) == FUNCTION_DECL
)
750 /* Local static vars must be non-local or we get multiple declaration
752 if (VAR_P (decl
) && !auto_var_in_fn_p (decl
, id
->src_fn
))
759 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
763 tree new_decls
= NULL_TREE
;
765 /* Remap its variables. */
766 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
770 if (can_be_nonlocal (old_var
, id
))
772 /* We need to add this variable to the local decls as otherwise
773 nothing else will do so. */
774 if (VAR_P (old_var
) && ! DECL_EXTERNAL (old_var
) && cfun
)
775 add_local_decl (cfun
, old_var
);
776 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
777 && !DECL_IGNORED_P (old_var
)
778 && nonlocalized_list
)
779 vec_safe_push (*nonlocalized_list
, old_var
);
783 /* Remap the variable. */
784 new_var
= remap_decl (old_var
, id
);
786 /* If we didn't remap this variable, we can't mess with its
787 TREE_CHAIN. If we remapped this variable to the return slot, it's
788 already declared somewhere else, so don't declare it here. */
790 if (new_var
== id
->retvar
)
794 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
795 && !DECL_IGNORED_P (old_var
)
796 && nonlocalized_list
)
797 vec_safe_push (*nonlocalized_list
, old_var
);
801 gcc_assert (DECL_P (new_var
));
802 DECL_CHAIN (new_var
) = new_decls
;
805 /* Also copy value-expressions. */
806 if (VAR_P (new_var
) && DECL_HAS_VALUE_EXPR_P (new_var
))
808 tree tem
= DECL_VALUE_EXPR (new_var
);
809 bool old_regimplify
= id
->regimplify
;
810 id
->remapping_type_depth
++;
811 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
812 id
->remapping_type_depth
--;
813 id
->regimplify
= old_regimplify
;
814 SET_DECL_VALUE_EXPR (new_var
, tem
);
819 return nreverse (new_decls
);
822 /* Copy the BLOCK to contain remapped versions of the variables
823 therein. And hook the new block into the block-tree. */
826 remap_block (tree
*block
, copy_body_data
*id
)
831 /* Make the new block. */
833 new_block
= make_node (BLOCK
);
834 TREE_USED (new_block
) = TREE_USED (old_block
);
835 BLOCK_ABSTRACT_ORIGIN (new_block
) = BLOCK_ORIGIN (old_block
);
836 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
837 BLOCK_NONLOCALIZED_VARS (new_block
)
838 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
841 /* Remap its variables. */
842 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
843 &BLOCK_NONLOCALIZED_VARS (new_block
),
846 if (id
->transform_lang_insert_block
)
847 id
->transform_lang_insert_block (new_block
);
849 /* Remember the remapped block. */
850 insert_decl_map (id
, old_block
, new_block
);
853 /* Copy the whole block tree and root it in id->block. */
856 remap_blocks (tree block
, copy_body_data
*id
)
859 tree new_tree
= block
;
864 remap_block (&new_tree
, id
);
865 gcc_assert (new_tree
!= block
);
866 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
867 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
868 /* Blocks are in arbitrary order, but make things slightly prettier and do
869 not swap order when producing a copy. */
870 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
874 /* Remap the block tree rooted at BLOCK to nothing. */
877 remap_blocks_to_null (tree block
, copy_body_data
*id
)
880 insert_decl_map (id
, block
, NULL_TREE
);
881 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
882 remap_blocks_to_null (t
, id
);
885 /* Remap the location info pointed to by LOCUS. */
888 remap_location (location_t locus
, copy_body_data
*id
)
890 if (LOCATION_BLOCK (locus
))
892 tree
*n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
895 return set_block (locus
, *n
);
898 locus
= LOCATION_LOCUS (locus
);
900 if (locus
!= UNKNOWN_LOCATION
&& id
->block
)
901 return set_block (locus
, id
->block
);
907 copy_statement_list (tree
*tp
)
909 tree_stmt_iterator oi
, ni
;
912 new_tree
= alloc_stmt_list ();
913 ni
= tsi_start (new_tree
);
914 oi
= tsi_start (*tp
);
915 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
918 for (; !tsi_end_p (oi
); tsi_next (&oi
))
920 tree stmt
= tsi_stmt (oi
);
921 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
922 /* This copy is not redundant; tsi_link_after will smash this
923 STATEMENT_LIST into the end of the one we're building, and we
924 don't want to do that with the original. */
925 copy_statement_list (&stmt
);
926 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
931 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
933 tree block
= BIND_EXPR_BLOCK (*tp
);
934 /* Copy (and replace) the statement. */
935 copy_tree_r (tp
, walk_subtrees
, NULL
);
938 remap_block (&block
, id
);
939 BIND_EXPR_BLOCK (*tp
) = block
;
942 if (BIND_EXPR_VARS (*tp
))
943 /* This will remap a lot of the same decls again, but this should be
945 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
949 /* Create a new gimple_seq by remapping all the statements in BODY
950 using the inlining information in ID. */
953 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
955 gimple_stmt_iterator si
;
956 gimple_seq new_body
= NULL
;
958 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
960 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
961 gimple_seq_add_seq (&new_body
, new_stmts
);
968 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
969 block using the mapping information in ID. */
972 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
975 tree new_block
, new_vars
;
976 gimple_seq body
, new_body
;
978 /* Copy the statement. Note that we purposely don't use copy_stmt
979 here because we need to remap statements as we copy. */
980 body
= gimple_bind_body (stmt
);
981 new_body
= remap_gimple_seq (body
, id
);
983 new_block
= gimple_bind_block (stmt
);
985 remap_block (&new_block
, id
);
987 /* This will remap a lot of the same decls again, but this should be
989 new_vars
= gimple_bind_vars (stmt
);
991 new_vars
= remap_decls (new_vars
, NULL
, id
);
993 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
998 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
1003 if (TREE_CODE (decl
) == SSA_NAME
)
1005 decl
= SSA_NAME_VAR (decl
);
1010 return (TREE_CODE (decl
) == PARM_DECL
);
1013 /* Remap the dependence CLIQUE from the source to the destination function
1014 as specified in ID. */
1016 static unsigned short
1017 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
1019 if (clique
== 0 || processing_debug_stmt
)
1021 if (!id
->dependence_map
)
1022 id
->dependence_map
= new hash_map
<dependence_hash
, unsigned short>;
1024 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
1027 /* Clique 1 is reserved for local ones set by PTA. */
1028 if (cfun
->last_clique
== 0)
1029 cfun
->last_clique
= 1;
1030 newc
= ++cfun
->last_clique
;
1035 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
1036 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
1037 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
1038 recursing into the children nodes of *TP. */
1041 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
1043 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
1044 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
1045 tree fn
= id
->src_fn
;
1047 /* For recursive invocations this is no longer the LHS itself. */
1048 bool is_lhs
= wi_p
->is_lhs
;
1049 wi_p
->is_lhs
= false;
1051 if (TREE_CODE (*tp
) == SSA_NAME
)
1053 *tp
= remap_ssa_name (*tp
, id
);
1056 SSA_NAME_DEF_STMT (*tp
) = wi_p
->stmt
;
1059 else if (auto_var_in_fn_p (*tp
, fn
))
1061 /* Local variables and labels need to be replaced by equivalent
1062 variables. We don't want to copy static variables; there's
1063 only one of those, no matter how many times we inline the
1064 containing function. Similarly for globals from an outer
1068 /* Remap the declaration. */
1069 new_decl
= remap_decl (*tp
, id
);
1070 gcc_assert (new_decl
);
1071 /* Replace this variable with the copy. */
1072 STRIP_TYPE_NOPS (new_decl
);
1073 /* ??? The C++ frontend uses void * pointer zero to initialize
1074 any other type. This confuses the middle-end type verification.
1075 As cloned bodies do not go through gimplification again the fixup
1076 there doesn't trigger. */
1077 if (TREE_CODE (new_decl
) == INTEGER_CST
1078 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
1079 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
1083 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1085 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
1087 else if (TREE_CODE (*tp
) == LABEL_DECL
1088 && (!DECL_CONTEXT (*tp
)
1089 || decl_function_context (*tp
) == id
->src_fn
))
1090 /* These may need to be remapped for EH handling. */
1091 *tp
= remap_decl (*tp
, id
);
1092 else if (TREE_CODE (*tp
) == FIELD_DECL
)
1094 /* If the enclosing record type is variably_modified_type_p, the field
1095 has already been remapped. Otherwise, it need not be. */
1096 tree
*n
= id
->decl_map
->get (*tp
);
1101 else if (TYPE_P (*tp
))
1102 /* Types may need remapping as well. */
1103 *tp
= remap_type (*tp
, id
);
1104 else if (CONSTANT_CLASS_P (*tp
))
1106 /* If this is a constant, we have to copy the node iff the type
1107 will be remapped. copy_tree_r will not copy a constant. */
1108 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1110 if (new_type
== TREE_TYPE (*tp
))
1113 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1114 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1117 *tp
= copy_node (*tp
);
1118 TREE_TYPE (*tp
) = new_type
;
1123 /* Otherwise, just copy the node. Note that copy_tree_r already
1124 knows not to copy VAR_DECLs, etc., so this is safe. */
1126 if (TREE_CODE (*tp
) == MEM_REF
&& !id
->do_not_fold
)
1128 /* We need to re-canonicalize MEM_REFs from inline substitutions
1129 that can happen when a pointer argument is an ADDR_EXPR.
1130 Recurse here manually to allow that. */
1131 tree ptr
= TREE_OPERAND (*tp
, 0);
1132 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1134 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
1135 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1136 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1137 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1138 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1139 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1141 MR_DEPENDENCE_CLIQUE (*tp
)
1142 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1143 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1145 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1146 remapped a parameter as the property might be valid only
1147 for the parameter itself. */
1148 if (TREE_THIS_NOTRAP (old
)
1149 && (!is_parm (TREE_OPERAND (old
, 0))
1150 || (!id
->transform_parameter
&& is_parm (ptr
))))
1151 TREE_THIS_NOTRAP (*tp
) = 1;
1152 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1157 /* Here is the "usual case". Copy this tree node, and then
1158 tweak some special cases. */
1159 copy_tree_r (tp
, walk_subtrees
, NULL
);
1161 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1162 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1164 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1166 /* The copied TARGET_EXPR has never been expanded, even if the
1167 original node was expanded already. */
1168 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1169 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1171 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1173 /* Variable substitution need not be simple. In particular,
1174 the MEM_REF substitution above. Make sure that
1175 TREE_CONSTANT and friends are up-to-date. */
1176 int invariant
= is_gimple_min_invariant (*tp
);
1177 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
1178 recompute_tree_invariant_for_addr_expr (*tp
);
1180 /* If this used to be invariant, but is not any longer,
1181 then regimplification is probably needed. */
1182 if (invariant
&& !is_gimple_min_invariant (*tp
))
1183 id
->regimplify
= true;
1189 /* Update the TREE_BLOCK for the cloned expr. */
1192 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1193 tree old_block
= TREE_BLOCK (*tp
);
1197 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1201 TREE_SET_BLOCK (*tp
, new_block
);
1204 /* Keep iterating. */
1209 /* Called from copy_body_id via walk_tree. DATA is really a
1210 `copy_body_data *'. */
1213 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1215 copy_body_data
*id
= (copy_body_data
*) data
;
1216 tree fn
= id
->src_fn
;
1219 /* Begin by recognizing trees that we'll completely rewrite for the
1220 inlining context. Our output for these trees is completely
1221 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1222 into an edge). Further down, we'll handle trees that get
1223 duplicated and/or tweaked. */
1225 /* When requested, RETURN_EXPRs should be transformed to just the
1226 contained MODIFY_EXPR. The branch semantics of the return will
1227 be handled elsewhere by manipulating the CFG rather than a statement. */
1228 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1230 tree assignment
= TREE_OPERAND (*tp
, 0);
1232 /* If we're returning something, just turn that into an
1233 assignment into the equivalent of the original RESULT_DECL.
1234 If the "assignment" is just the result decl, the result
1235 decl has already been set (e.g. a recent "foo (&result_decl,
1236 ...)"); just toss the entire RETURN_EXPR. */
1237 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1239 /* Replace the RETURN_EXPR with (a copy of) the
1240 MODIFY_EXPR hanging underneath. */
1241 *tp
= copy_node (assignment
);
1243 else /* Else the RETURN_EXPR returns no value. */
1246 return (tree
) (void *)1;
1249 else if (TREE_CODE (*tp
) == SSA_NAME
)
1251 *tp
= remap_ssa_name (*tp
, id
);
1256 /* Local variables and labels need to be replaced by equivalent
1257 variables. We don't want to copy static variables; there's only
1258 one of those, no matter how many times we inline the containing
1259 function. Similarly for globals from an outer function. */
1260 else if (auto_var_in_fn_p (*tp
, fn
))
1264 /* Remap the declaration. */
1265 new_decl
= remap_decl (*tp
, id
);
1266 gcc_assert (new_decl
);
1267 /* Replace this variable with the copy. */
1268 STRIP_TYPE_NOPS (new_decl
);
1272 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1273 copy_statement_list (tp
);
1274 else if (TREE_CODE (*tp
) == SAVE_EXPR
1275 || TREE_CODE (*tp
) == TARGET_EXPR
)
1276 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1277 else if (TREE_CODE (*tp
) == LABEL_DECL
1278 && (! DECL_CONTEXT (*tp
)
1279 || decl_function_context (*tp
) == id
->src_fn
))
1280 /* These may need to be remapped for EH handling. */
1281 *tp
= remap_decl (*tp
, id
);
1282 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1283 copy_bind_expr (tp
, walk_subtrees
, id
);
1284 /* Types may need remapping as well. */
1285 else if (TYPE_P (*tp
))
1286 *tp
= remap_type (*tp
, id
);
1288 /* If this is a constant, we have to copy the node iff the type will be
1289 remapped. copy_tree_r will not copy a constant. */
1290 else if (CONSTANT_CLASS_P (*tp
))
1292 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1294 if (new_type
== TREE_TYPE (*tp
))
1297 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1298 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1301 *tp
= copy_node (*tp
);
1302 TREE_TYPE (*tp
) = new_type
;
1306 /* Otherwise, just copy the node. Note that copy_tree_r already
1307 knows not to copy VAR_DECLs, etc., so this is safe. */
1310 /* Here we handle trees that are not completely rewritten.
1311 First we detect some inlining-induced bogosities for
1313 if (TREE_CODE (*tp
) == MODIFY_EXPR
1314 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1315 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1317 /* Some assignments VAR = VAR; don't generate any rtl code
1318 and thus don't count as variable modification. Avoid
1319 keeping bogosities like 0 = 0. */
1320 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1323 n
= id
->decl_map
->get (decl
);
1327 STRIP_TYPE_NOPS (value
);
1328 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1330 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1331 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1335 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1337 /* Get rid of *& from inline substitutions that can happen when a
1338 pointer argument is an ADDR_EXPR. */
1339 tree decl
= TREE_OPERAND (*tp
, 0);
1340 tree
*n
= id
->decl_map
->get (decl
);
1343 /* If we happen to get an ADDR_EXPR in n->value, strip
1344 it manually here as we'll eventually get ADDR_EXPRs
1345 which lie about their types pointed to. In this case
1346 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1347 but we absolutely rely on that. As fold_indirect_ref
1348 does other useful transformations, try that first, though. */
1349 tree type
= TREE_TYPE (*tp
);
1350 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1352 *tp
= id
->do_not_fold
? NULL
: gimple_fold_indirect_ref (ptr
);
1355 type
= remap_type (type
, id
);
1356 if (TREE_CODE (ptr
) == ADDR_EXPR
&& !id
->do_not_fold
)
1359 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1360 /* ??? We should either assert here or build
1361 a VIEW_CONVERT_EXPR instead of blindly leaking
1362 incompatible types to our IL. */
1364 *tp
= TREE_OPERAND (ptr
, 0);
1368 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1369 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1370 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1371 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1372 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1373 have remapped a parameter as the property might be
1374 valid only for the parameter itself. */
1375 if (TREE_THIS_NOTRAP (old
)
1376 && (!is_parm (TREE_OPERAND (old
, 0))
1377 || (!id
->transform_parameter
&& is_parm (ptr
))))
1378 TREE_THIS_NOTRAP (*tp
) = 1;
1385 else if (TREE_CODE (*tp
) == MEM_REF
&& !id
->do_not_fold
)
1387 /* We need to re-canonicalize MEM_REFs from inline substitutions
1388 that can happen when a pointer argument is an ADDR_EXPR.
1389 Recurse here manually to allow that. */
1390 tree ptr
= TREE_OPERAND (*tp
, 0);
1391 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1393 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1394 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1395 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1396 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1397 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1398 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1400 MR_DEPENDENCE_CLIQUE (*tp
)
1401 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1402 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1404 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1405 remapped a parameter as the property might be valid only
1406 for the parameter itself. */
1407 if (TREE_THIS_NOTRAP (old
)
1408 && (!is_parm (TREE_OPERAND (old
, 0))
1409 || (!id
->transform_parameter
&& is_parm (ptr
))))
1410 TREE_THIS_NOTRAP (*tp
) = 1;
1411 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1416 /* Here is the "usual case". Copy this tree node, and then
1417 tweak some special cases. */
1418 copy_tree_r (tp
, walk_subtrees
, NULL
);
1420 /* If EXPR has block defined, map it to newly constructed block.
1421 When inlining we want EXPRs without block appear in the block
1422 of function call if we are not remapping a type. */
1425 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1426 if (TREE_BLOCK (*tp
))
1429 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1433 TREE_SET_BLOCK (*tp
, new_block
);
1436 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1437 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1439 /* The copied TARGET_EXPR has never been expanded, even if the
1440 original node was expanded already. */
1441 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1443 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1444 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1447 /* Variable substitution need not be simple. In particular, the
1448 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1449 and friends are up-to-date. */
1450 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1452 int invariant
= is_gimple_min_invariant (*tp
);
1453 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1455 /* Handle the case where we substituted an INDIRECT_REF
1456 into the operand of the ADDR_EXPR. */
1457 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
1458 && !id
->do_not_fold
)
1460 tree t
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1461 if (TREE_TYPE (t
) != TREE_TYPE (*tp
))
1462 t
= fold_convert (remap_type (TREE_TYPE (*tp
), id
), t
);
1466 recompute_tree_invariant_for_addr_expr (*tp
);
1468 /* If this used to be invariant, but is not any longer,
1469 then regimplification is probably needed. */
1470 if (invariant
&& !is_gimple_min_invariant (*tp
))
1471 id
->regimplify
= true;
1477 /* Keep iterating. */
1481 /* Helper for remap_gimple_stmt. Given an EH region number for the
1482 source function, map that to the duplicate EH region number in
1483 the destination function. */
1486 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1488 eh_region old_r
, new_r
;
1490 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1491 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1493 return new_r
->index
;
1496 /* Similar, but operate on INTEGER_CSTs. */
1499 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1503 old_nr
= tree_to_shwi (old_t_nr
);
1504 new_nr
= remap_eh_region_nr (old_nr
, id
);
1506 return build_int_cst (integer_type_node
, new_nr
);
1509 /* Helper for copy_bb. Remap statement STMT using the inlining
1510 information in ID. Return the new statement copy. */
1513 remap_gimple_stmt (gimple
*stmt
, copy_body_data
*id
)
1515 gimple
*copy
= NULL
;
1516 struct walk_stmt_info wi
;
1517 bool skip_first
= false;
1518 gimple_seq stmts
= NULL
;
1520 if (is_gimple_debug (stmt
)
1521 && (gimple_debug_nonbind_marker_p (stmt
)
1522 ? !DECL_STRUCT_FUNCTION (id
->dst_fn
)->debug_nonbind_markers
1523 : !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
)))
1526 /* Begin by recognizing trees that we'll completely rewrite for the
1527 inlining context. Our output for these trees is completely
1528 different from our input (e.g. RETURN_EXPR is deleted and morphs
1529 into an edge). Further down, we'll handle trees that get
1530 duplicated and/or tweaked. */
1532 /* When requested, GIMPLE_RETURN should be transformed to just the
1533 contained GIMPLE_ASSIGN. The branch semantics of the return will
1534 be handled elsewhere by manipulating the CFG rather than the
1536 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1538 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1540 /* If we're returning something, just turn that into an
1541 assignment to the equivalent of the original RESULT_DECL.
1542 If RETVAL is just the result decl, the result decl has
1543 already been set (e.g. a recent "foo (&result_decl, ...)");
1544 just toss the entire GIMPLE_RETURN. */
1546 && (TREE_CODE (retval
) != RESULT_DECL
1547 && (TREE_CODE (retval
) != SSA_NAME
1548 || ! SSA_NAME_VAR (retval
)
1549 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1551 copy
= gimple_build_assign (id
->do_not_unshare
1552 ? id
->retvar
: unshare_expr (id
->retvar
),
1554 /* id->retvar is already substituted. Skip it on later remapping. */
1560 else if (gimple_has_substatements (stmt
))
1564 /* When cloning bodies from the C++ front end, we will be handed bodies
1565 in High GIMPLE form. Handle here all the High GIMPLE statements that
1566 have embedded statements. */
1567 switch (gimple_code (stmt
))
1570 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1575 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1576 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1577 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1581 case GIMPLE_EH_FILTER
:
1582 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1583 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1587 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1588 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1589 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1592 case GIMPLE_WITH_CLEANUP_EXPR
:
1593 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1594 copy
= gimple_build_wce (s1
);
1597 case GIMPLE_OMP_PARALLEL
:
1599 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1600 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1601 copy
= gimple_build_omp_parallel
1603 gimple_omp_parallel_clauses (omp_par_stmt
),
1604 gimple_omp_parallel_child_fn (omp_par_stmt
),
1605 gimple_omp_parallel_data_arg (omp_par_stmt
));
1609 case GIMPLE_OMP_TASK
:
1610 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1611 copy
= gimple_build_omp_task
1613 gimple_omp_task_clauses (stmt
),
1614 gimple_omp_task_child_fn (stmt
),
1615 gimple_omp_task_data_arg (stmt
),
1616 gimple_omp_task_copy_fn (stmt
),
1617 gimple_omp_task_arg_size (stmt
),
1618 gimple_omp_task_arg_align (stmt
));
1621 case GIMPLE_OMP_FOR
:
1622 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1623 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1624 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1625 gimple_omp_for_clauses (stmt
),
1626 gimple_omp_for_collapse (stmt
), s2
);
1629 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1631 gimple_omp_for_set_index (copy
, i
,
1632 gimple_omp_for_index (stmt
, i
));
1633 gimple_omp_for_set_initial (copy
, i
,
1634 gimple_omp_for_initial (stmt
, i
));
1635 gimple_omp_for_set_final (copy
, i
,
1636 gimple_omp_for_final (stmt
, i
));
1637 gimple_omp_for_set_incr (copy
, i
,
1638 gimple_omp_for_incr (stmt
, i
));
1639 gimple_omp_for_set_cond (copy
, i
,
1640 gimple_omp_for_cond (stmt
, i
));
1645 case GIMPLE_OMP_MASTER
:
1646 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1647 copy
= gimple_build_omp_master (s1
);
1650 case GIMPLE_OMP_TASKGROUP
:
1651 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1652 copy
= gimple_build_omp_taskgroup
1653 (s1
, gimple_omp_taskgroup_clauses (stmt
));
1656 case GIMPLE_OMP_ORDERED
:
1657 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1658 copy
= gimple_build_omp_ordered
1660 gimple_omp_ordered_clauses (as_a
<gomp_ordered
*> (stmt
)));
1663 case GIMPLE_OMP_SCAN
:
1664 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1665 copy
= gimple_build_omp_scan
1666 (s1
, gimple_omp_scan_clauses (as_a
<gomp_scan
*> (stmt
)));
1669 case GIMPLE_OMP_SECTION
:
1670 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1671 copy
= gimple_build_omp_section (s1
);
1674 case GIMPLE_OMP_SECTIONS
:
1675 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1676 copy
= gimple_build_omp_sections
1677 (s1
, gimple_omp_sections_clauses (stmt
));
1680 case GIMPLE_OMP_SINGLE
:
1681 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1682 copy
= gimple_build_omp_single
1683 (s1
, gimple_omp_single_clauses (stmt
));
1686 case GIMPLE_OMP_TARGET
:
1687 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1688 copy
= gimple_build_omp_target
1689 (s1
, gimple_omp_target_kind (stmt
),
1690 gimple_omp_target_clauses (stmt
));
1693 case GIMPLE_OMP_TEAMS
:
1694 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1695 copy
= gimple_build_omp_teams
1696 (s1
, gimple_omp_teams_clauses (stmt
));
1699 case GIMPLE_OMP_CRITICAL
:
1700 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1701 copy
= gimple_build_omp_critical (s1
,
1702 gimple_omp_critical_name
1703 (as_a
<gomp_critical
*> (stmt
)),
1704 gimple_omp_critical_clauses
1705 (as_a
<gomp_critical
*> (stmt
)));
1708 case GIMPLE_TRANSACTION
:
1710 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1711 gtransaction
*new_trans_stmt
;
1712 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1714 copy
= new_trans_stmt
= gimple_build_transaction (s1
);
1715 gimple_transaction_set_subcode (new_trans_stmt
,
1716 gimple_transaction_subcode (old_trans_stmt
));
1717 gimple_transaction_set_label_norm (new_trans_stmt
,
1718 gimple_transaction_label_norm (old_trans_stmt
));
1719 gimple_transaction_set_label_uninst (new_trans_stmt
,
1720 gimple_transaction_label_uninst (old_trans_stmt
));
1721 gimple_transaction_set_label_over (new_trans_stmt
,
1722 gimple_transaction_label_over (old_trans_stmt
));
1732 if (gimple_assign_copy_p (stmt
)
1733 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1734 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1736 /* Here we handle statements that are not completely rewritten.
1737 First we detect some inlining-induced bogosities for
1740 /* Some assignments VAR = VAR; don't generate any rtl code
1741 and thus don't count as variable modification. Avoid
1742 keeping bogosities like 0 = 0. */
1743 tree decl
= gimple_assign_lhs (stmt
), value
;
1746 n
= id
->decl_map
->get (decl
);
1750 STRIP_TYPE_NOPS (value
);
1751 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1756 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1757 in a block that we aren't copying during tree_function_versioning,
1758 just drop the clobber stmt. */
1759 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1761 tree lhs
= gimple_assign_lhs (stmt
);
1762 if (TREE_CODE (lhs
) == MEM_REF
1763 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1765 gimple
*def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1766 if (gimple_bb (def_stmt
)
1767 && !bitmap_bit_p (id
->blocks_to_copy
,
1768 gimple_bb (def_stmt
)->index
))
1773 /* We do not allow CLOBBERs of handled components. In case
1774 returned value is stored via such handled component, remove
1775 the clobber so stmt verifier is happy. */
1776 if (gimple_clobber_p (stmt
)
1777 && TREE_CODE (gimple_assign_lhs (stmt
)) == RESULT_DECL
)
1779 tree remapped
= remap_decl (gimple_assign_lhs (stmt
), id
);
1780 if (!DECL_P (remapped
)
1781 && TREE_CODE (remapped
) != MEM_REF
)
1785 if (gimple_debug_bind_p (stmt
))
1788 = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1789 gimple_debug_bind_get_value (stmt
),
1791 if (id
->reset_location
)
1792 gimple_set_location (copy
, input_location
);
1793 id
->debug_stmts
.safe_push (copy
);
1794 gimple_seq_add_stmt (&stmts
, copy
);
1797 if (gimple_debug_source_bind_p (stmt
))
1799 gdebug
*copy
= gimple_build_debug_source_bind
1800 (gimple_debug_source_bind_get_var (stmt
),
1801 gimple_debug_source_bind_get_value (stmt
),
1803 if (id
->reset_location
)
1804 gimple_set_location (copy
, input_location
);
1805 id
->debug_stmts
.safe_push (copy
);
1806 gimple_seq_add_stmt (&stmts
, copy
);
1809 if (gimple_debug_nonbind_marker_p (stmt
))
1811 /* If the inlined function has too many debug markers,
1813 if (id
->src_cfun
->debug_marker_count
1814 > param_max_debug_marker_count
)
1817 gdebug
*copy
= as_a
<gdebug
*> (gimple_copy (stmt
));
1818 if (id
->reset_location
)
1819 gimple_set_location (copy
, input_location
);
1820 id
->debug_stmts
.safe_push (copy
);
1821 gimple_seq_add_stmt (&stmts
, copy
);
1825 /* Create a new deep copy of the statement. */
1826 copy
= gimple_copy (stmt
);
1828 /* Clear flags that need revisiting. */
1829 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1831 if (gimple_call_tail_p (call_stmt
))
1832 gimple_call_set_tail (call_stmt
, false);
1833 if (gimple_call_from_thunk_p (call_stmt
))
1834 gimple_call_set_from_thunk (call_stmt
, false);
1835 if (gimple_call_internal_p (call_stmt
))
1836 switch (gimple_call_internal_fn (call_stmt
))
1838 case IFN_GOMP_SIMD_LANE
:
1839 case IFN_GOMP_SIMD_VF
:
1840 case IFN_GOMP_SIMD_LAST_LANE
:
1841 case IFN_GOMP_SIMD_ORDERED_START
:
1842 case IFN_GOMP_SIMD_ORDERED_END
:
1843 DECL_STRUCT_FUNCTION (id
->dst_fn
)->has_simduid_loops
= true;
1850 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1851 RESX and EH_DISPATCH. */
1853 switch (gimple_code (copy
))
1857 tree r
, fndecl
= gimple_call_fndecl (copy
);
1858 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
1859 switch (DECL_FUNCTION_CODE (fndecl
))
1861 case BUILT_IN_EH_COPY_VALUES
:
1862 r
= gimple_call_arg (copy
, 1);
1863 r
= remap_eh_region_tree_nr (r
, id
);
1864 gimple_call_set_arg (copy
, 1, r
);
1867 case BUILT_IN_EH_POINTER
:
1868 case BUILT_IN_EH_FILTER
:
1869 r
= gimple_call_arg (copy
, 0);
1870 r
= remap_eh_region_tree_nr (r
, id
);
1871 gimple_call_set_arg (copy
, 0, r
);
1878 /* Reset alias info if we didn't apply measures to
1879 keep it valid over inlining by setting DECL_PT_UID. */
1880 if (!id
->src_cfun
->gimple_df
1881 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1882 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1888 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1889 int r
= gimple_resx_region (resx_stmt
);
1890 r
= remap_eh_region_nr (r
, id
);
1891 gimple_resx_set_region (resx_stmt
, r
);
1895 case GIMPLE_EH_DISPATCH
:
1897 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1898 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1899 r
= remap_eh_region_nr (r
, id
);
1900 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1909 /* If STMT has a block defined, map it to the newly constructed block. */
1910 if (tree block
= gimple_block (copy
))
1913 n
= id
->decl_map
->get (block
);
1915 gimple_set_block (copy
, *n
);
1917 if (id
->param_body_adjs
)
1919 gimple_seq extra_stmts
= NULL
;
1920 id
->param_body_adjs
->modify_gimple_stmt (©
, &extra_stmts
);
1921 if (!gimple_seq_empty_p (extra_stmts
))
1923 memset (&wi
, 0, sizeof (wi
));
1925 for (gimple_stmt_iterator egsi
= gsi_start (extra_stmts
);
1928 walk_gimple_op (gsi_stmt (egsi
), remap_gimple_op_r
, &wi
);
1929 gimple_seq_add_seq (&stmts
, extra_stmts
);
1933 if (id
->reset_location
)
1934 gimple_set_location (copy
, input_location
);
1936 /* Debug statements ought to be rebuilt and not copied. */
1937 gcc_checking_assert (!is_gimple_debug (copy
));
1939 /* Remap all the operands in COPY. */
1940 memset (&wi
, 0, sizeof (wi
));
1943 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1945 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1947 /* Clear the copied virtual operands. We are not remapping them here
1948 but are going to recreate them from scratch. */
1949 if (gimple_has_mem_ops (copy
))
1951 gimple_set_vdef (copy
, NULL_TREE
);
1952 gimple_set_vuse (copy
, NULL_TREE
);
1955 gimple_seq_add_stmt (&stmts
, copy
);
1960 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1964 copy_bb (copy_body_data
*id
, basic_block bb
,
1965 profile_count num
, profile_count den
)
1967 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1968 basic_block copy_basic_block
;
1972 profile_count::adjust_for_ipa_scaling (&num
, &den
);
1974 /* Search for previous copied basic block. */
1977 prev
= prev
->prev_bb
;
1979 /* create_basic_block() will append every new block to
1980 basic_block_info automatically. */
1981 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
1982 copy_basic_block
->count
= bb
->count
.apply_scale (num
, den
);
1984 copy_gsi
= gsi_start_bb (copy_basic_block
);
1986 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1989 gimple
*stmt
= gsi_stmt (gsi
);
1990 gimple
*orig_stmt
= stmt
;
1991 gimple_stmt_iterator stmts_gsi
;
1992 bool stmt_added
= false;
1994 id
->regimplify
= false;
1995 stmts
= remap_gimple_stmt (stmt
, id
);
1997 if (gimple_seq_empty_p (stmts
))
2002 for (stmts_gsi
= gsi_start (stmts
);
2003 !gsi_end_p (stmts_gsi
); )
2005 stmt
= gsi_stmt (stmts_gsi
);
2007 /* Advance iterator now before stmt is moved to seq_gsi. */
2008 gsi_next (&stmts_gsi
);
2010 if (gimple_nop_p (stmt
))
2013 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
2016 /* With return slot optimization we can end up with
2017 non-gimple (foo *)&this->m, fix that here. */
2018 if (is_gimple_assign (stmt
)
2019 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
2020 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
2023 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
2024 gimple_assign_rhs1 (stmt
),
2026 GSI_CONTINUE_LINKING
);
2027 gimple_assign_set_rhs1 (stmt
, new_rhs
);
2028 id
->regimplify
= false;
2031 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
2034 gimple_regimplify_operands (stmt
, &seq_gsi
);
2042 /* If copy_basic_block has been empty at the start of this iteration,
2043 call gsi_start_bb again to get at the newly added statements. */
2044 if (gsi_end_p (copy_gsi
))
2045 copy_gsi
= gsi_start_bb (copy_basic_block
);
2047 gsi_next (©_gsi
);
2049 /* Process the new statement. The call to gimple_regimplify_operands
2050 possibly turned the statement into multiple statements, we
2051 need to process all of them. */
2057 stmt
= gsi_stmt (copy_gsi
);
2058 call_stmt
= dyn_cast
<gcall
*> (stmt
);
2060 && gimple_call_va_arg_pack_p (call_stmt
)
2062 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
2064 /* __builtin_va_arg_pack () should be replaced by
2065 all arguments corresponding to ... in the caller. */
2069 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
2072 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
2075 /* Create the new array of arguments. */
2076 n
= nargs
+ gimple_call_num_args (call_stmt
);
2077 argarray
.create (n
);
2078 argarray
.safe_grow_cleared (n
);
2080 /* Copy all the arguments before '...' */
2081 memcpy (argarray
.address (),
2082 gimple_call_arg_ptr (call_stmt
, 0),
2083 gimple_call_num_args (call_stmt
) * sizeof (tree
));
2085 /* Append the arguments passed in '...' */
2086 memcpy (argarray
.address () + gimple_call_num_args (call_stmt
),
2087 gimple_call_arg_ptr (id
->call_stmt
, 0)
2088 + (gimple_call_num_args (id
->call_stmt
) - nargs
),
2089 nargs
* sizeof (tree
));
2091 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
2094 argarray
.release ();
2096 /* Copy all GIMPLE_CALL flags, location and block, except
2097 GF_CALL_VA_ARG_PACK. */
2098 gimple_call_copy_flags (new_call
, call_stmt
);
2099 gimple_call_set_va_arg_pack (new_call
, false);
2100 /* location includes block. */
2101 gimple_set_location (new_call
, gimple_location (stmt
));
2102 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
2104 gsi_replace (©_gsi
, new_call
, false);
2109 && (decl
= gimple_call_fndecl (stmt
))
2110 && fndecl_built_in_p (decl
, BUILT_IN_VA_ARG_PACK_LEN
))
2112 /* __builtin_va_arg_pack_len () should be replaced by
2113 the number of anonymous arguments. */
2114 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
2118 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
2121 if (!gimple_call_lhs (stmt
))
2123 /* Drop unused calls. */
2124 gsi_remove (©_gsi
, false);
2127 else if (!gimple_call_va_arg_pack_p (id
->call_stmt
))
2129 count
= build_int_cst (integer_type_node
, nargs
);
2130 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
2131 gsi_replace (©_gsi
, new_stmt
, false);
2134 else if (nargs
!= 0)
2136 tree newlhs
= create_tmp_reg_or_ssa_name (integer_type_node
);
2137 count
= build_int_cst (integer_type_node
, nargs
);
2138 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
2139 PLUS_EXPR
, newlhs
, count
);
2140 gimple_call_set_lhs (stmt
, newlhs
);
2141 gsi_insert_after (©_gsi
, new_stmt
, GSI_NEW_STMT
);
2146 && gimple_call_internal_p (stmt
)
2147 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
2149 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
2150 gsi_remove (©_gsi
, false);
2154 /* Statements produced by inlining can be unfolded, especially
2155 when we constant propagated some operands. We can't fold
2156 them right now for two reasons:
2157 1) folding require SSA_NAME_DEF_STMTs to be correct
2158 2) we can't change function calls to builtins.
2159 So we just mark statement for later folding. We mark
2160 all new statements, instead just statements that has changed
2161 by some nontrivial substitution so even statements made
2162 foldable indirectly are updated. If this turns out to be
2163 expensive, copy_body can be told to watch for nontrivial
2165 if (id
->statements_to_fold
)
2166 id
->statements_to_fold
->add (stmt
);
2168 /* We're duplicating a CALL_EXPR. Find any corresponding
2169 callgraph edges and update or duplicate them. */
2170 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
2172 struct cgraph_edge
*edge
;
2174 switch (id
->transform_call_graph_edges
)
2176 case CB_CGE_DUPLICATE
:
2177 edge
= id
->src_node
->get_edge (orig_stmt
);
2180 struct cgraph_edge
*old_edge
= edge
;
2181 profile_count old_cnt
= edge
->count
;
2182 edge
= edge
->clone (id
->dst_node
, call_stmt
,
2187 /* Speculative calls consist of two edges - direct and
2188 indirect. Duplicate the whole thing and distribute
2189 frequencies accordingly. */
2190 if (edge
->speculative
)
2192 struct cgraph_edge
*direct
, *indirect
;
2193 struct ipa_ref
*ref
;
2195 gcc_assert (!edge
->indirect_unknown_callee
);
2196 old_edge
->speculative_call_info (direct
, indirect
, ref
);
2198 profile_count indir_cnt
= indirect
->count
;
2199 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2204 profile_probability prob
2205 = indir_cnt
.probability_in (old_cnt
+ indir_cnt
);
2207 = copy_basic_block
->count
.apply_probability (prob
);
2208 edge
->count
= copy_basic_block
->count
- indirect
->count
;
2209 id
->dst_node
->clone_reference (ref
, stmt
);
2212 edge
->count
= copy_basic_block
->count
;
2216 case CB_CGE_MOVE_CLONES
:
2217 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2219 edge
= id
->dst_node
->get_edge (stmt
);
2223 edge
= id
->dst_node
->get_edge (orig_stmt
);
2225 edge
->set_call_stmt (call_stmt
);
2232 /* Constant propagation on argument done during inlining
2233 may create new direct call. Produce an edge for it. */
2235 || (edge
->indirect_inlining_edge
2236 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2237 && id
->dst_node
->definition
2238 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2240 struct cgraph_node
*dest
= cgraph_node::get_create (fn
);
2242 /* We have missing edge in the callgraph. This can happen
2243 when previous inlining turned an indirect call into a
2244 direct call by constant propagating arguments or we are
2245 producing dead clone (for further cloning). In all
2246 other cases we hit a bug (incorrect node sharing is the
2247 most common reason for missing edges). */
2248 gcc_assert (!dest
->definition
2249 || dest
->address_taken
2250 || !id
->src_node
->definition
2251 || !id
->dst_node
->definition
);
2252 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2253 id
->dst_node
->create_edge_including_clones
2254 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2255 CIF_ORIGINALLY_INDIRECT_CALL
);
2257 id
->dst_node
->create_edge (dest
, call_stmt
,
2258 bb
->count
)->inline_failed
2259 = CIF_ORIGINALLY_INDIRECT_CALL
;
2262 fprintf (dump_file
, "Created new direct edge to %s\n",
2267 notice_special_calls (as_a
<gcall
*> (stmt
));
2270 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2271 id
->eh_map
, id
->eh_lp_nr
);
2273 gsi_next (©_gsi
);
2275 while (!gsi_end_p (copy_gsi
));
2277 copy_gsi
= gsi_last_bb (copy_basic_block
);
2280 return copy_basic_block
;
2283 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2284 form is quite easy, since dominator relationship for old basic blocks does
2287 There is however exception where inlining might change dominator relation
2288 across EH edges from basic block within inlined functions destinating
2289 to landing pads in function we inline into.
2291 The function fills in PHI_RESULTs of such PHI nodes if they refer
2292 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2293 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2294 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2295 set, and this means that there will be no overlapping live ranges
2296 for the underlying symbol.
2298 This might change in future if we allow redirecting of EH edges and
2299 we might want to change way build CFG pre-inlining to include
2300 all the possible edges then. */
2302 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2303 bool can_throw
, bool nonlocal_goto
)
2308 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2310 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2316 gcc_assert (e
->flags
& EDGE_EH
);
2319 gcc_assert (!(e
->flags
& EDGE_EH
));
2321 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2327 /* For abnormal goto/call edges the receiver can be the
2328 ENTRY_BLOCK. Do not assert this cannot happen. */
2330 gcc_assert ((e
->flags
& EDGE_EH
)
2331 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2333 re
= find_edge (ret_bb
, e
->dest
);
2334 gcc_checking_assert (re
);
2335 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2336 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2338 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2339 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2344 /* Insert clobbers for automatic variables of inlined ID->src_fn
2345 function at the start of basic block ID->eh_landing_pad_dest. */
2348 add_clobbers_to_eh_landing_pad (copy_body_data
*id
)
2351 basic_block bb
= id
->eh_landing_pad_dest
;
2352 live_vars_map
*vars
= NULL
;
2353 unsigned int cnt
= 0;
2355 FOR_EACH_VEC_SAFE_ELT (id
->src_cfun
->local_decls
, i
, var
)
2357 && !DECL_HARD_REGISTER (var
)
2358 && !TREE_THIS_VOLATILE (var
)
2359 && !DECL_HAS_VALUE_EXPR_P (var
)
2360 && !is_gimple_reg (var
)
2361 && auto_var_in_fn_p (var
, id
->src_fn
)
2362 && !lookup_attribute ("omp simd array", DECL_ATTRIBUTES (var
)))
2364 tree
*t
= id
->decl_map
->get (var
);
2369 && !DECL_HARD_REGISTER (new_var
)
2370 && !TREE_THIS_VOLATILE (new_var
)
2371 && !DECL_HAS_VALUE_EXPR_P (new_var
)
2372 && !is_gimple_reg (new_var
)
2373 && auto_var_in_fn_p (new_var
, id
->dst_fn
))
2376 vars
= new live_vars_map
;
2377 vars
->put (DECL_UID (var
), cnt
++);
2383 vec
<bitmap_head
> live
= compute_live_vars (id
->src_cfun
, vars
);
2384 FOR_EACH_VEC_SAFE_ELT (id
->src_cfun
->local_decls
, i
, var
)
2389 bool needed
= false;
2390 unsigned int *v
= vars
->get (DECL_UID (var
));
2393 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
2394 if ((e
->flags
& EDGE_EH
) != 0
2395 && e
->src
->index
>= id
->add_clobbers_to_eh_landing_pads
)
2397 basic_block src_bb
= (basic_block
) e
->src
->aux
;
2399 if (bitmap_bit_p (&live
[src_bb
->index
], *v
))
2407 tree new_var
= *id
->decl_map
->get (var
);
2408 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
2409 tree clobber
= build_clobber (TREE_TYPE (new_var
));
2410 gimple
*clobber_stmt
= gimple_build_assign (new_var
, clobber
);
2411 gsi_insert_before (&gsi
, clobber_stmt
, GSI_NEW_STMT
);
2414 destroy_live_vars (live
);
2418 /* Copy edges from BB into its copy constructed earlier, scale profile
2419 accordingly. Edges will be taken care of later. Assume aux
2420 pointers to point to the copies of each BB. Return true if any
2421 debug stmts are left after a statement that must end the basic block. */
2424 copy_edges_for_bb (basic_block bb
, profile_count num
, profile_count den
,
2425 basic_block ret_bb
, basic_block abnormal_goto_dest
,
2428 basic_block new_bb
= (basic_block
) bb
->aux
;
2431 gimple_stmt_iterator si
;
2432 bool need_debug_cleanup
= false;
2434 /* Use the indices from the original blocks to create edges for the
2436 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2437 if (!(old_edge
->flags
& EDGE_EH
))
2440 int flags
= old_edge
->flags
;
2441 location_t locus
= old_edge
->goto_locus
;
2443 /* Return edges do get a FALLTHRU flag when they get inlined. */
2444 if (old_edge
->dest
->index
== EXIT_BLOCK
2445 && !(flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2446 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2447 flags
|= EDGE_FALLTHRU
;
2450 = make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2451 new_edge
->probability
= old_edge
->probability
;
2452 if (!id
->reset_location
)
2453 new_edge
->goto_locus
= remap_location (locus
, id
);
2456 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2459 /* When doing function splitting, we must decrease count of the return block
2460 which was previously reachable by block we did not copy. */
2461 if (single_succ_p (bb
) && single_succ_edge (bb
)->dest
->index
== EXIT_BLOCK
)
2462 FOR_EACH_EDGE (old_edge
, ei
, bb
->preds
)
2463 if (old_edge
->src
->index
!= ENTRY_BLOCK
2464 && !old_edge
->src
->aux
)
2465 new_bb
->count
-= old_edge
->count ().apply_scale (num
, den
);
2467 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2470 bool can_throw
, nonlocal_goto
;
2472 copy_stmt
= gsi_stmt (si
);
2473 if (!is_gimple_debug (copy_stmt
))
2474 update_stmt (copy_stmt
);
2476 /* Do this before the possible split_block. */
2479 /* If this tree could throw an exception, there are two
2480 cases where we need to add abnormal edge(s): the
2481 tree wasn't in a region and there is a "current
2482 region" in the caller; or the original tree had
2483 EH edges. In both cases split the block after the tree,
2484 and add abnormal edge(s) as needed; we need both
2485 those from the callee and the caller.
2486 We check whether the copy can throw, because the const
2487 propagation can change an INDIRECT_REF which throws
2488 into a COMPONENT_REF which doesn't. If the copy
2489 can throw, the original could also throw. */
2490 can_throw
= stmt_can_throw_internal (cfun
, copy_stmt
);
2492 = (stmt_can_make_abnormal_goto (copy_stmt
)
2493 && !computed_goto_p (copy_stmt
));
2495 if (can_throw
|| nonlocal_goto
)
2497 if (!gsi_end_p (si
))
2499 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2502 need_debug_cleanup
= true;
2504 if (!gsi_end_p (si
))
2505 /* Note that bb's predecessor edges aren't necessarily
2506 right at this point; split_block doesn't care. */
2508 edge e
= split_block (new_bb
, copy_stmt
);
2511 new_bb
->aux
= e
->src
->aux
;
2512 si
= gsi_start_bb (new_bb
);
2516 bool update_probs
= false;
2518 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2520 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2521 update_probs
= true;
2525 make_eh_edges (copy_stmt
);
2526 update_probs
= true;
2529 /* EH edges may not match old edges. Copy as much as possible. */
2534 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2536 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2537 if ((old_edge
->flags
& EDGE_EH
)
2538 && (e
= find_edge (copy_stmt_bb
,
2539 (basic_block
) old_edge
->dest
->aux
))
2540 && (e
->flags
& EDGE_EH
))
2541 e
->probability
= old_edge
->probability
;
2543 FOR_EACH_EDGE (e
, ei
, copy_stmt_bb
->succs
)
2544 if (e
->flags
& EDGE_EH
)
2546 if (!e
->probability
.initialized_p ())
2547 e
->probability
= profile_probability::never ();
2548 if (e
->dest
->index
< id
->add_clobbers_to_eh_landing_pads
)
2550 if (id
->eh_landing_pad_dest
== NULL
)
2551 id
->eh_landing_pad_dest
= e
->dest
;
2553 gcc_assert (id
->eh_landing_pad_dest
== e
->dest
);
2559 /* If the call we inline cannot make abnormal goto do not add
2560 additional abnormal edges but only retain those already present
2561 in the original function body. */
2562 if (abnormal_goto_dest
== NULL
)
2563 nonlocal_goto
= false;
2566 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2568 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2569 nonlocal_goto
= false;
2570 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2571 in OpenMP regions which aren't allowed to be left abnormally.
2572 So, no need to add abnormal edge in that case. */
2573 else if (is_gimple_call (copy_stmt
)
2574 && gimple_call_internal_p (copy_stmt
)
2575 && (gimple_call_internal_fn (copy_stmt
)
2576 == IFN_ABNORMAL_DISPATCHER
)
2577 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2578 nonlocal_goto
= false;
2580 make_single_succ_edge (copy_stmt_bb
, abnormal_goto_dest
,
2584 if ((can_throw
|| nonlocal_goto
)
2585 && gimple_in_ssa_p (cfun
))
2586 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2587 can_throw
, nonlocal_goto
);
2589 return need_debug_cleanup
;
2592 /* Copy the PHIs. All blocks and edges are copied, some blocks
2593 was possibly split and new outgoing EH edges inserted.
2594 BB points to the block of original function and AUX pointers links
2595 the original and newly copied blocks. */
2598 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2600 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2605 bool inserted
= false;
2607 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2613 res
= PHI_RESULT (phi
);
2615 if (!virtual_operand_p (res
))
2617 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2618 if (EDGE_COUNT (new_bb
->preds
) == 0)
2620 /* Technically we'd want a SSA_DEFAULT_DEF here... */
2621 SSA_NAME_DEF_STMT (new_res
) = gimple_build_nop ();
2625 new_phi
= create_phi_node (new_res
, new_bb
);
2626 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2628 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
,
2635 /* When doing partial cloning, we allow PHIs on the entry
2636 block as long as all the arguments are the same.
2637 Find any input edge to see argument to copy. */
2639 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2640 if (!old_edge
->src
->aux
)
2643 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2645 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2646 gcc_assert (new_arg
);
2647 /* With return slot optimization we can end up with
2648 non-gimple (foo *)&this->m, fix that here. */
2649 if (TREE_CODE (new_arg
) != SSA_NAME
2650 && TREE_CODE (new_arg
) != FUNCTION_DECL
2651 && !is_gimple_val (new_arg
))
2653 gimple_seq stmts
= NULL
;
2654 new_arg
= force_gimple_operand (new_arg
, &stmts
, true,
2656 gsi_insert_seq_on_edge (new_edge
, stmts
);
2659 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2660 if (id
->reset_location
)
2661 locus
= input_location
;
2663 locus
= remap_location (locus
, id
);
2664 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2670 /* Commit the delayed edge insertions. */
2672 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2673 gsi_commit_one_edge_insert (new_edge
, NULL
);
2677 /* Wrapper for remap_decl so it can be used as a callback. */
2680 remap_decl_1 (tree decl
, void *data
)
2682 return remap_decl (decl
, (copy_body_data
*) data
);
2685 /* Build struct function and associated datastructures for the new clone
2686 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2687 the cfun to the function of new_fndecl (and current_function_decl too). */
2690 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, profile_count count
)
2692 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2694 if (!DECL_ARGUMENTS (new_fndecl
))
2695 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2696 if (!DECL_RESULT (new_fndecl
))
2697 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2699 /* Register specific tree functions. */
2700 gimple_register_cfg_hooks ();
2702 /* Get clean struct function. */
2703 push_struct_function (new_fndecl
);
2705 /* We will rebuild these, so just sanity check that they are empty. */
2706 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2707 gcc_assert (cfun
->local_decls
== NULL
);
2708 gcc_assert (cfun
->cfg
== NULL
);
2709 gcc_assert (cfun
->decl
== new_fndecl
);
2711 /* Copy items we preserve during cloning. */
2712 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2713 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2714 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2715 cfun
->curr_properties
= src_cfun
->curr_properties
;
2716 cfun
->last_verified
= src_cfun
->last_verified
;
2717 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2718 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2719 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2720 cfun
->calls_eh_return
= src_cfun
->calls_eh_return
;
2721 cfun
->stdarg
= src_cfun
->stdarg
;
2722 cfun
->after_inlining
= src_cfun
->after_inlining
;
2723 cfun
->can_throw_non_call_exceptions
2724 = src_cfun
->can_throw_non_call_exceptions
;
2725 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2726 cfun
->returns_struct
= src_cfun
->returns_struct
;
2727 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2729 init_empty_tree_cfg ();
2731 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2733 profile_count num
= count
;
2734 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2735 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2737 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2738 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2739 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2740 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2741 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2742 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2744 init_eh_for_function ();
2746 if (src_cfun
->gimple_df
)
2748 init_tree_ssa (cfun
);
2749 cfun
->gimple_df
->in_ssa_p
= src_cfun
->gimple_df
->in_ssa_p
;
2750 if (cfun
->gimple_df
->in_ssa_p
)
2751 init_ssa_operands (cfun
);
2755 /* Helper function for copy_cfg_body. Move debug stmts from the end
2756 of NEW_BB to the beginning of successor basic blocks when needed. If the
2757 successor has multiple predecessors, reset them, otherwise keep
2761 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2765 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2768 || gsi_one_before_end_p (si
)
2769 || !(stmt_can_throw_internal (cfun
, gsi_stmt (si
))
2770 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2773 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2775 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2776 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2777 while (is_gimple_debug (gsi_stmt (ssi
)))
2779 gimple
*stmt
= gsi_stmt (ssi
);
2784 /* For the last edge move the debug stmts instead of copying
2786 if (ei_one_before_end_p (ei
))
2790 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2792 gimple_debug_bind_reset_value (stmt
);
2793 gimple_set_location (stmt
, UNKNOWN_LOCATION
);
2795 gsi_remove (&si
, false);
2796 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2800 if (gimple_debug_bind_p (stmt
))
2802 var
= gimple_debug_bind_get_var (stmt
);
2803 if (single_pred_p (e
->dest
))
2805 value
= gimple_debug_bind_get_value (stmt
);
2806 value
= unshare_expr (value
);
2807 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2810 new_stmt
= gimple_build_debug_bind (var
, NULL_TREE
, NULL
);
2812 else if (gimple_debug_source_bind_p (stmt
))
2814 var
= gimple_debug_source_bind_get_var (stmt
);
2815 value
= gimple_debug_source_bind_get_value (stmt
);
2816 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2818 else if (gimple_debug_nonbind_marker_p (stmt
))
2819 new_stmt
= as_a
<gdebug
*> (gimple_copy (stmt
));
2822 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2823 id
->debug_stmts
.safe_push (new_stmt
);
2829 /* Make a copy of the sub-loops of SRC_PARENT and place them
2830 as siblings of DEST_PARENT. */
2833 copy_loops (copy_body_data
*id
,
2834 class loop
*dest_parent
, class loop
*src_parent
)
2836 class loop
*src_loop
= src_parent
->inner
;
2839 if (!id
->blocks_to_copy
2840 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2842 class loop
*dest_loop
= alloc_loop ();
2844 /* Assign the new loop its header and latch and associate
2845 those with the new loop. */
2846 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2847 dest_loop
->header
->loop_father
= dest_loop
;
2848 if (src_loop
->latch
!= NULL
)
2850 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2851 dest_loop
->latch
->loop_father
= dest_loop
;
2854 /* Copy loop meta-data. */
2855 copy_loop_info (src_loop
, dest_loop
);
2856 if (dest_loop
->unroll
)
2857 cfun
->has_unroll
= true;
2858 if (dest_loop
->force_vectorize
)
2859 cfun
->has_force_vectorize_loops
= true;
2860 if (id
->src_cfun
->last_clique
!= 0)
2861 dest_loop
->owned_clique
2862 = remap_dependence_clique (id
,
2863 src_loop
->owned_clique
2864 ? src_loop
->owned_clique
: 1);
2866 /* Finally place it into the loop array and the loop tree. */
2867 place_new_loop (cfun
, dest_loop
);
2868 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2870 if (src_loop
->simduid
)
2872 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2873 cfun
->has_simduid_loops
= true;
2877 copy_loops (id
, dest_loop
, src_loop
);
2879 src_loop
= src_loop
->next
;
2883 /* Call redirect_call_stmt_to_callee on all calls in BB. */
2886 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2888 gimple_stmt_iterator si
;
2889 gimple
*last
= last_stmt (bb
);
2890 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2892 gimple
*stmt
= gsi_stmt (si
);
2893 if (is_gimple_call (stmt
))
2895 tree old_lhs
= gimple_call_lhs (stmt
);
2896 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2899 gimple
*new_stmt
= edge
->redirect_call_stmt_to_callee ();
2900 /* If IPA-SRA transformation, run as part of edge redirection,
2901 removed the LHS because it is unused, save it to
2902 killed_new_ssa_names so that we can prune it from debug
2905 && TREE_CODE (old_lhs
) == SSA_NAME
2906 && !gimple_call_lhs (new_stmt
))
2908 if (!id
->killed_new_ssa_names
)
2909 id
->killed_new_ssa_names
= new hash_set
<tree
> (16);
2910 id
->killed_new_ssa_names
->add (old_lhs
);
2913 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
2914 gimple_purge_dead_eh_edges (bb
);
2920 /* Make a copy of the body of FN so that it can be inserted inline in
2921 another function. Walks FN via CFG, returns new fndecl. */
2924 copy_cfg_body (copy_body_data
* id
,
2925 basic_block entry_block_map
, basic_block exit_block_map
,
2926 basic_block new_entry
)
2928 tree callee_fndecl
= id
->src_fn
;
2929 /* Original cfun for the callee, doesn't change. */
2930 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2931 struct function
*cfun_to_copy
;
2933 tree new_fndecl
= NULL
;
2934 bool need_debug_cleanup
= false;
2936 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2937 profile_count num
= entry_block_map
->count
;
2939 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2941 /* Register specific tree functions. */
2942 gimple_register_cfg_hooks ();
2944 /* If we are inlining just region of the function, make sure to connect
2945 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2946 part of loop, we must compute frequency and probability of
2947 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2948 probabilities of edges incoming from nonduplicated region. */
2953 den
= profile_count::zero ();
2955 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2958 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= den
;
2961 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2963 /* Must have a CFG here at this point. */
2964 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2965 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2968 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2969 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2970 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2971 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2973 /* Duplicate any exception-handling regions. */
2975 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2978 /* Use aux pointers to map the original blocks to copy. */
2979 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2980 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2982 basic_block new_bb
= copy_bb (id
, bb
, num
, den
);
2985 new_bb
->loop_father
= entry_block_map
->loop_father
;
2988 last
= last_basic_block_for_fn (cfun
);
2990 /* Now that we've duplicated the blocks, duplicate their edges. */
2991 basic_block abnormal_goto_dest
= NULL
;
2993 && stmt_can_make_abnormal_goto (id
->call_stmt
))
2995 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
2997 bb
= gimple_bb (id
->call_stmt
);
2999 if (gsi_end_p (gsi
))
3000 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
3002 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3003 if (!id
->blocks_to_copy
3004 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
3005 need_debug_cleanup
|= copy_edges_for_bb (bb
, num
, den
, exit_block_map
,
3006 abnormal_goto_dest
, id
);
3008 if (id
->eh_landing_pad_dest
)
3010 add_clobbers_to_eh_landing_pad (id
);
3011 id
->eh_landing_pad_dest
= NULL
;
3016 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
,
3018 e
->probability
= profile_probability::always ();
3021 /* Duplicate the loop tree, if available and wanted. */
3022 if (loops_for_fn (src_cfun
) != NULL
3023 && current_loops
!= NULL
)
3025 copy_loops (id
, entry_block_map
->loop_father
,
3026 get_loop (src_cfun
, 0));
3027 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
3028 loops_state_set (LOOPS_NEED_FIXUP
);
3031 /* If the loop tree in the source function needed fixup, mark the
3032 destination loop tree for fixup, too. */
3033 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
3034 loops_state_set (LOOPS_NEED_FIXUP
);
3036 if (gimple_in_ssa_p (cfun
))
3037 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3038 if (!id
->blocks_to_copy
3039 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
3040 copy_phis_for_bb (bb
, id
);
3042 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3045 if (need_debug_cleanup
3046 && bb
->index
!= ENTRY_BLOCK
3047 && bb
->index
!= EXIT_BLOCK
)
3048 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
3049 /* Update call edge destinations. This cannot be done before loop
3050 info is updated, because we may split basic blocks. */
3051 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
3052 && bb
->index
!= ENTRY_BLOCK
3053 && bb
->index
!= EXIT_BLOCK
)
3054 redirect_all_calls (id
, (basic_block
)bb
->aux
);
3055 ((basic_block
)bb
->aux
)->aux
= NULL
;
3059 /* Zero out AUX fields of newly created block during EH edge
3061 for (; last
< last_basic_block_for_fn (cfun
); last
++)
3063 if (need_debug_cleanup
)
3064 maybe_move_debug_stmts_to_successors (id
,
3065 BASIC_BLOCK_FOR_FN (cfun
, last
));
3066 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
3067 /* Update call edge destinations. This cannot be done before loop
3068 info is updated, because we may split basic blocks. */
3069 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
3070 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
3072 entry_block_map
->aux
= NULL
;
3073 exit_block_map
->aux
= NULL
;
3080 if (id
->dependence_map
)
3082 delete id
->dependence_map
;
3083 id
->dependence_map
= NULL
;
3089 /* Copy the debug STMT using ID. We deal with these statements in a
3090 special way: if any variable in their VALUE expression wasn't
3091 remapped yet, we won't remap it, because that would get decl uids
3092 out of sync, causing codegen differences between -g and -g0. If
3093 this arises, we drop the VALUE expression altogether. */
3096 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
3099 struct walk_stmt_info wi
;
3101 if (tree block
= gimple_block (stmt
))
3103 n
= id
->decl_map
->get (block
);
3104 gimple_set_block (stmt
, n
? *n
: id
->block
);
3107 if (gimple_debug_nonbind_marker_p (stmt
))
3110 /* Remap all the operands in COPY. */
3111 memset (&wi
, 0, sizeof (wi
));
3114 processing_debug_stmt
= 1;
3116 if (gimple_debug_source_bind_p (stmt
))
3117 t
= gimple_debug_source_bind_get_var (stmt
);
3118 else if (gimple_debug_bind_p (stmt
))
3119 t
= gimple_debug_bind_get_var (stmt
);
3123 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
3124 && (n
= id
->debug_map
->get (t
)))
3126 gcc_assert (VAR_P (*n
));
3129 else if (VAR_P (t
) && !is_global_var (t
) && !id
->decl_map
->get (t
))
3130 /* T is a non-localized variable. */;
3132 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
3134 if (gimple_debug_bind_p (stmt
))
3136 gimple_debug_bind_set_var (stmt
, t
);
3138 if (gimple_debug_bind_has_value_p (stmt
))
3139 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
3140 remap_gimple_op_r
, &wi
, NULL
);
3142 /* Punt if any decl couldn't be remapped. */
3143 if (processing_debug_stmt
< 0)
3144 gimple_debug_bind_reset_value (stmt
);
3146 else if (gimple_debug_source_bind_p (stmt
))
3148 gimple_debug_source_bind_set_var (stmt
, t
);
3149 /* When inlining and source bind refers to one of the optimized
3150 away parameters, change the source bind into normal debug bind
3151 referring to the corresponding DEBUG_EXPR_DECL that should have
3152 been bound before the call stmt. */
3153 t
= gimple_debug_source_bind_get_value (stmt
);
3155 && TREE_CODE (t
) == PARM_DECL
3158 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
3160 if (debug_args
!= NULL
)
3162 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
3163 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
3164 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
3166 t
= (**debug_args
)[i
+ 1];
3167 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
3168 gimple_debug_bind_set_value (stmt
, t
);
3173 if (gimple_debug_source_bind_p (stmt
))
3174 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
3175 remap_gimple_op_r
, &wi
, NULL
);
3178 processing_debug_stmt
= 0;
3183 /* Process deferred debug stmts. In order to give values better odds
3184 of being successfully remapped, we delay the processing of debug
3185 stmts until all other stmts that might require remapping are
3189 copy_debug_stmts (copy_body_data
*id
)
3194 if (!id
->debug_stmts
.exists ())
3197 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
3198 copy_debug_stmt (stmt
, id
);
3200 id
->debug_stmts
.release ();
3203 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
3204 another function. */
3207 copy_tree_body (copy_body_data
*id
)
3209 tree fndecl
= id
->src_fn
;
3210 tree body
= DECL_SAVED_TREE (fndecl
);
3212 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
3217 /* Make a copy of the body of FN so that it can be inserted inline in
3218 another function. */
3221 copy_body (copy_body_data
*id
,
3222 basic_block entry_block_map
, basic_block exit_block_map
,
3223 basic_block new_entry
)
3225 tree fndecl
= id
->src_fn
;
3228 /* If this body has a CFG, walk CFG and copy. */
3229 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
3230 body
= copy_cfg_body (id
, entry_block_map
, exit_block_map
,
3232 copy_debug_stmts (id
);
3233 delete id
->killed_new_ssa_names
;
3234 id
->killed_new_ssa_names
= NULL
;
3239 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
3240 defined in function FN, or of a data member thereof. */
3243 self_inlining_addr_expr (tree value
, tree fn
)
3247 if (TREE_CODE (value
) != ADDR_EXPR
)
3250 var
= get_base_address (TREE_OPERAND (value
, 0));
3252 return var
&& auto_var_in_fn_p (var
, fn
);
3255 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
3256 lexical block and line number information from base_stmt, if given,
3257 or from the last stmt of the block otherwise. */
3260 insert_init_debug_bind (copy_body_data
*id
,
3261 basic_block bb
, tree var
, tree value
,
3265 gimple_stmt_iterator gsi
;
3268 if (!gimple_in_ssa_p (id
->src_cfun
))
3271 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
3274 tracked_var
= target_for_debug_bind (var
);
3280 gsi
= gsi_last_bb (bb
);
3281 if (!base_stmt
&& !gsi_end_p (gsi
))
3282 base_stmt
= gsi_stmt (gsi
);
3285 note
= gimple_build_debug_bind (tracked_var
, unshare_expr (value
), base_stmt
);
3289 if (!gsi_end_p (gsi
))
3290 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
3292 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3299 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple
*init_stmt
)
3301 /* If VAR represents a zero-sized variable, it's possible that the
3302 assignment statement may result in no gimple statements. */
3305 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3307 /* We can end up with init statements that store to a non-register
3308 from a rhs with a conversion. Handle that here by forcing the
3309 rhs into a temporary. gimple_regimplify_operands is not
3310 prepared to do this for us. */
3311 if (!is_gimple_debug (init_stmt
)
3312 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3313 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3314 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3316 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3317 gimple_expr_type (init_stmt
),
3318 gimple_assign_rhs1 (init_stmt
));
3319 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3321 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3322 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3324 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3325 gimple_regimplify_operands (init_stmt
, &si
);
3327 if (!is_gimple_debug (init_stmt
))
3329 tree def
= gimple_assign_lhs (init_stmt
);
3330 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3335 /* Deal with mismatched formal/actual parameters, in a rather brute-force way
3336 if need be (which should only be necessary for invalid programs). Attempt
3337 to convert VAL to TYPE and return the result if it is possible, just return
3338 a zero constant of the given type if it fails. */
3341 force_value_to_type (tree type
, tree value
)
3343 /* If we can match up types by promotion/demotion do so. */
3344 if (fold_convertible_p (type
, value
))
3345 return fold_convert (type
, value
);
3347 /* ??? For valid programs we should not end up here.
3348 Still if we end up with truly mismatched types here, fall back
3349 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3350 GIMPLE to the following passes. */
3351 if (!is_gimple_reg_type (TREE_TYPE (value
))
3352 || TYPE_SIZE (type
) == TYPE_SIZE (TREE_TYPE (value
)))
3353 return fold_build1 (VIEW_CONVERT_EXPR
, type
, value
);
3355 return build_zero_cst (type
);
3358 /* Initialize parameter P with VALUE. If needed, produce init statement
3359 at the end of BB. When BB is NULL, we return init statement to be
3362 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3363 basic_block bb
, tree
*vars
)
3365 gimple
*init_stmt
= NULL
;
3368 tree def
= (gimple_in_ssa_p (cfun
)
3369 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3372 && value
!= error_mark_node
3373 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3374 rhs
= force_value_to_type (TREE_TYPE (p
), value
);
3376 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3377 here since the type of this decl must be visible to the calling
3379 var
= copy_decl_to_var (p
, id
);
3381 /* Declare this new variable. */
3382 DECL_CHAIN (var
) = *vars
;
3385 /* Make gimplifier happy about this variable. */
3386 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3388 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3389 we would not need to create a new variable here at all, if it
3390 weren't for debug info. Still, we can just use the argument
3392 if (TREE_READONLY (p
)
3393 && !TREE_ADDRESSABLE (p
)
3394 && value
&& !TREE_SIDE_EFFECTS (value
)
3397 /* We may produce non-gimple trees by adding NOPs or introduce
3398 invalid sharing when operand is not really constant.
3399 It is not big deal to prohibit constant propagation here as
3400 we will constant propagate in DOM1 pass anyway. */
3401 if (is_gimple_min_invariant (value
)
3402 && useless_type_conversion_p (TREE_TYPE (p
),
3404 /* We have to be very careful about ADDR_EXPR. Make sure
3405 the base variable isn't a local variable of the inlined
3406 function, e.g., when doing recursive inlining, direct or
3407 mutually-recursive or whatever, which is why we don't
3408 just test whether fn == current_function_decl. */
3409 && ! self_inlining_addr_expr (value
, fn
))
3411 insert_decl_map (id
, p
, value
);
3412 insert_debug_decl_map (id
, p
, var
);
3413 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3417 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3418 that way, when the PARM_DECL is encountered, it will be
3419 automatically replaced by the VAR_DECL. */
3420 insert_decl_map (id
, p
, var
);
3422 /* Even if P was TREE_READONLY, the new VAR should not be.
3423 In the original code, we would have constructed a
3424 temporary, and then the function body would have never
3425 changed the value of P. However, now, we will be
3426 constructing VAR directly. The constructor body may
3427 change its value multiple times as it is being
3428 constructed. Therefore, it must not be TREE_READONLY;
3429 the back-end assumes that TREE_READONLY variable is
3430 assigned to only once. */
3431 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
3432 TREE_READONLY (var
) = 0;
3434 /* If there is no setup required and we are in SSA, take the easy route
3435 replacing all SSA names representing the function parameter by the
3436 SSA name passed to function.
3438 We need to construct map for the variable anyway as it might be used
3439 in different SSA names when parameter is set in function.
3441 Do replacement at -O0 for const arguments replaced by constant.
3442 This is important for builtin_constant_p and other construct requiring
3443 constant argument to be visible in inlined function body. */
3444 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3446 || (TREE_READONLY (p
)
3447 && is_gimple_min_invariant (rhs
)))
3448 && (TREE_CODE (rhs
) == SSA_NAME
3449 || is_gimple_min_invariant (rhs
))
3450 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3452 insert_decl_map (id
, def
, rhs
);
3453 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3456 /* If the value of argument is never used, don't care about initializing
3458 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3460 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3461 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3464 /* Initialize this VAR_DECL from the equivalent argument. Convert
3465 the argument to the proper type in case it was promoted. */
3468 if (rhs
== error_mark_node
)
3470 insert_decl_map (id
, p
, var
);
3471 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3474 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3476 /* If we are in SSA form properly remap the default definition
3477 or assign to a dummy SSA name if the parameter is unused and
3478 we are not optimizing. */
3479 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3483 def
= remap_ssa_name (def
, id
);
3484 init_stmt
= gimple_build_assign (def
, rhs
);
3485 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3486 set_ssa_default_def (cfun
, var
, NULL
);
3490 def
= make_ssa_name (var
);
3491 init_stmt
= gimple_build_assign (def
, rhs
);
3495 init_stmt
= gimple_build_assign (var
, rhs
);
3497 if (bb
&& init_stmt
)
3498 insert_init_stmt (id
, bb
, init_stmt
);
3503 /* Generate code to initialize the parameters of the function at the
3504 top of the stack in ID from the GIMPLE_CALL STMT. */
3507 initialize_inlined_parameters (copy_body_data
*id
, gimple
*stmt
,
3508 tree fn
, basic_block bb
)
3513 tree vars
= NULL_TREE
;
3514 tree static_chain
= gimple_call_chain (stmt
);
3516 /* Figure out what the parameters are. */
3517 parms
= DECL_ARGUMENTS (fn
);
3519 /* Loop through the parameter declarations, replacing each with an
3520 equivalent VAR_DECL, appropriately initialized. */
3521 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3524 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3525 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3527 /* After remapping parameters remap their types. This has to be done
3528 in a second loop over all parameters to appropriately remap
3529 variable sized arrays when the size is specified in a
3530 parameter following the array. */
3531 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3533 tree
*varp
= id
->decl_map
->get (p
);
3534 if (varp
&& VAR_P (*varp
))
3536 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3537 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3539 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3540 /* Also remap the default definition if it was remapped
3541 to the default definition of the parameter replacement
3542 by the parameter setup. */
3545 tree
*defp
= id
->decl_map
->get (def
);
3547 && TREE_CODE (*defp
) == SSA_NAME
3548 && SSA_NAME_VAR (*defp
) == var
)
3549 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3554 /* Initialize the static chain. */
3555 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3556 gcc_assert (fn
!= current_function_decl
);
3559 /* No static chain? Seems like a bug in tree-nested.c. */
3560 gcc_assert (static_chain
);
3562 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3565 declare_inline_vars (id
->block
, vars
);
3569 /* Declare a return variable to replace the RESULT_DECL for the
3570 function we are calling. An appropriate DECL_STMT is returned.
3571 The USE_STMT is filled to contain a use of the declaration to
3572 indicate the return value of the function.
3574 RETURN_SLOT, if non-null is place where to store the result. It
3575 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3576 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3578 The return value is a (possibly null) value that holds the result
3579 as seen by the caller. */
3582 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3583 basic_block entry_bb
)
3585 tree callee
= id
->src_fn
;
3586 tree result
= DECL_RESULT (callee
);
3587 tree callee_type
= TREE_TYPE (result
);
3591 /* Handle type-mismatches in the function declaration return type
3592 vs. the call expression. */
3594 caller_type
= TREE_TYPE (modify_dest
);
3595 else if (return_slot
)
3596 caller_type
= TREE_TYPE (return_slot
);
3597 else /* No LHS on the call. */
3598 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3600 /* We don't need to do anything for functions that don't return anything. */
3601 if (VOID_TYPE_P (callee_type
))
3604 /* If there was a return slot, then the return value is the
3605 dereferenced address of that object. */
3608 /* The front end shouldn't have used both return_slot and
3609 a modify expression. */
3610 gcc_assert (!modify_dest
);
3611 if (DECL_BY_REFERENCE (result
))
3613 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3614 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3616 /* We are going to construct *&return_slot and we can't do that
3617 for variables believed to be not addressable.
3619 FIXME: This check possibly can match, because values returned
3620 via return slot optimization are not believed to have address
3621 taken by alias analysis. */
3622 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3623 var
= return_slot_addr
;
3624 mark_addressable (return_slot
);
3629 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3630 if (TREE_ADDRESSABLE (result
))
3631 mark_addressable (var
);
3633 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3634 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3635 && !DECL_GIMPLE_REG_P (result
)
3637 DECL_GIMPLE_REG_P (var
) = 0;
3639 if (!useless_type_conversion_p (callee_type
, caller_type
))
3640 var
= build1 (VIEW_CONVERT_EXPR
, callee_type
, var
);
3646 /* All types requiring non-trivial constructors should have been handled. */
3647 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3649 /* Attempt to avoid creating a new temporary variable. */
3651 && TREE_CODE (modify_dest
) != SSA_NAME
)
3653 bool use_it
= false;
3655 /* We can't use MODIFY_DEST if there's type promotion involved. */
3656 if (!useless_type_conversion_p (callee_type
, caller_type
))
3659 /* ??? If we're assigning to a variable sized type, then we must
3660 reuse the destination variable, because we've no good way to
3661 create variable sized temporaries at this point. */
3662 else if (!poly_int_tree_p (TYPE_SIZE_UNIT (caller_type
)))
3665 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3666 reuse it as the result of the call directly. Don't do this if
3667 it would promote MODIFY_DEST to addressable. */
3668 else if (TREE_ADDRESSABLE (result
))
3672 tree base_m
= get_base_address (modify_dest
);
3674 /* If the base isn't a decl, then it's a pointer, and we don't
3675 know where that's going to go. */
3676 if (!DECL_P (base_m
))
3678 else if (is_global_var (base_m
))
3680 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3681 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3682 && !DECL_GIMPLE_REG_P (result
)
3683 && DECL_GIMPLE_REG_P (base_m
))
3685 else if (!TREE_ADDRESSABLE (base_m
))
3697 gcc_assert (poly_int_tree_p (TYPE_SIZE_UNIT (callee_type
)));
3699 var
= copy_result_decl_to_var (result
, id
);
3700 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3702 /* Do not have the rest of GCC warn about this variable as it should
3703 not be visible to the user. */
3704 TREE_NO_WARNING (var
) = 1;
3706 declare_inline_vars (id
->block
, var
);
3708 /* Build the use expr. If the return type of the function was
3709 promoted, convert it back to the expected type. */
3711 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3713 /* If we can match up types by promotion/demotion do so. */
3714 if (fold_convertible_p (caller_type
, var
))
3715 use
= fold_convert (caller_type
, var
);
3718 /* ??? For valid programs we should not end up here.
3719 Still if we end up with truly mismatched types here, fall back
3720 to using a MEM_REF to not leak invalid GIMPLE to the following
3722 /* Prevent var from being written into SSA form. */
3723 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3724 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3725 DECL_GIMPLE_REG_P (var
) = false;
3726 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3727 TREE_ADDRESSABLE (var
) = true;
3728 use
= fold_build2 (MEM_REF
, caller_type
,
3729 build_fold_addr_expr (var
),
3730 build_int_cst (ptr_type_node
, 0));
3734 STRIP_USELESS_TYPE_CONVERSION (use
);
3736 if (DECL_BY_REFERENCE (result
))
3738 TREE_ADDRESSABLE (var
) = 1;
3739 var
= build_fold_addr_expr (var
);
3743 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3744 way, when the RESULT_DECL is encountered, it will be
3745 automatically replaced by the VAR_DECL.
3747 When returning by reference, ensure that RESULT_DECL remaps to
3749 if (DECL_BY_REFERENCE (result
)
3750 && !is_gimple_val (var
))
3752 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3753 insert_decl_map (id
, result
, temp
);
3754 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3755 it's default_def SSA_NAME. */
3756 if (gimple_in_ssa_p (id
->src_cfun
)
3757 && is_gimple_reg (result
))
3759 temp
= make_ssa_name (temp
);
3760 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3762 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3765 insert_decl_map (id
, result
, var
);
3767 /* Remember this so we can ignore it in remap_decls. */
3772 /* Determine if the function can be copied. If so return NULL. If
3773 not return a string describng the reason for failure. */
3776 copy_forbidden (struct function
*fun
)
3778 const char *reason
= fun
->cannot_be_copied_reason
;
3780 /* Only examine the function once. */
3781 if (fun
->cannot_be_copied_set
)
3784 /* We cannot copy a function that receives a non-local goto
3785 because we cannot remap the destination label used in the
3786 function that is performing the non-local goto. */
3787 /* ??? Actually, this should be possible, if we work at it.
3788 No doubt there's just a handful of places that simply
3789 assume it doesn't happen and don't substitute properly. */
3790 if (fun
->has_nonlocal_label
)
3792 reason
= G_("function %q+F can never be copied "
3793 "because it receives a non-local goto");
3797 if (fun
->has_forced_label_in_static
)
3799 reason
= G_("function %q+F can never be copied because it saves "
3800 "address of local label in a static variable");
3805 fun
->cannot_be_copied_reason
= reason
;
3806 fun
->cannot_be_copied_set
= true;
3811 static const char *inline_forbidden_reason
;
3813 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3814 iff a function cannot be inlined. Also sets the reason why. */
3817 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3818 struct walk_stmt_info
*wip
)
3820 tree fn
= (tree
) wip
->info
;
3822 gimple
*stmt
= gsi_stmt (*gsi
);
3824 switch (gimple_code (stmt
))
3827 /* Refuse to inline alloca call unless user explicitly forced so as
3828 this may change program's memory overhead drastically when the
3829 function using alloca is called in loop. In GCC present in
3830 SPEC2000 inlining into schedule_block cause it to require 2GB of
3831 RAM instead of 256MB. Don't do so for alloca calls emitted for
3832 VLA objects as those can't cause unbounded growth (they're always
3833 wrapped inside stack_save/stack_restore regions. */
3834 if (gimple_maybe_alloca_call_p (stmt
)
3835 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3836 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3838 inline_forbidden_reason
3839 = G_("function %q+F can never be inlined because it uses "
3840 "alloca (override using the always_inline attribute)");
3841 *handled_ops_p
= true;
3845 t
= gimple_call_fndecl (stmt
);
3849 /* We cannot inline functions that call setjmp. */
3850 if (setjmp_call_p (t
))
3852 inline_forbidden_reason
3853 = G_("function %q+F can never be inlined because it uses setjmp");
3854 *handled_ops_p
= true;
3858 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3859 switch (DECL_FUNCTION_CODE (t
))
3861 /* We cannot inline functions that take a variable number of
3863 case BUILT_IN_VA_START
:
3864 case BUILT_IN_NEXT_ARG
:
3865 case BUILT_IN_VA_END
:
3866 inline_forbidden_reason
3867 = G_("function %q+F can never be inlined because it "
3868 "uses variable argument lists");
3869 *handled_ops_p
= true;
3872 case BUILT_IN_LONGJMP
:
3873 /* We can't inline functions that call __builtin_longjmp at
3874 all. The non-local goto machinery really requires the
3875 destination be in a different function. If we allow the
3876 function calling __builtin_longjmp to be inlined into the
3877 function calling __builtin_setjmp, Things will Go Awry. */
3878 inline_forbidden_reason
3879 = G_("function %q+F can never be inlined because "
3880 "it uses setjmp-longjmp exception handling");
3881 *handled_ops_p
= true;
3884 case BUILT_IN_NONLOCAL_GOTO
:
3886 inline_forbidden_reason
3887 = G_("function %q+F can never be inlined because "
3888 "it uses non-local goto");
3889 *handled_ops_p
= true;
3892 case BUILT_IN_RETURN
:
3893 case BUILT_IN_APPLY_ARGS
:
3894 /* If a __builtin_apply_args caller would be inlined,
3895 it would be saving arguments of the function it has
3896 been inlined into. Similarly __builtin_return would
3897 return from the function the inline has been inlined into. */
3898 inline_forbidden_reason
3899 = G_("function %q+F can never be inlined because "
3900 "it uses %<__builtin_return%> or %<__builtin_apply_args%>");
3901 *handled_ops_p
= true;
3910 t
= gimple_goto_dest (stmt
);
3912 /* We will not inline a function which uses computed goto. The
3913 addresses of its local labels, which may be tucked into
3914 global storage, are of course not constant across
3915 instantiations, which causes unexpected behavior. */
3916 if (TREE_CODE (t
) != LABEL_DECL
)
3918 inline_forbidden_reason
3919 = G_("function %q+F can never be inlined "
3920 "because it contains a computed goto");
3921 *handled_ops_p
= true;
3930 *handled_ops_p
= false;
3934 /* Return true if FNDECL is a function that cannot be inlined into
3938 inline_forbidden_p (tree fndecl
)
3940 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3941 struct walk_stmt_info wi
;
3943 bool forbidden_p
= false;
3945 /* First check for shared reasons not to copy the code. */
3946 inline_forbidden_reason
= copy_forbidden (fun
);
3947 if (inline_forbidden_reason
!= NULL
)
3950 /* Next, walk the statements of the function looking for
3951 constraucts we can't handle, or are non-optimal for inlining. */
3952 hash_set
<tree
> visited_nodes
;
3953 memset (&wi
, 0, sizeof (wi
));
3954 wi
.info
= (void *) fndecl
;
3955 wi
.pset
= &visited_nodes
;
3957 FOR_EACH_BB_FN (bb
, fun
)
3960 gimple_seq seq
= bb_seq (bb
);
3961 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3962 forbidden_p
= (ret
!= NULL
);
3970 /* Return false if the function FNDECL cannot be inlined on account of its
3971 attributes, true otherwise. */
3973 function_attribute_inlinable_p (const_tree fndecl
)
3975 if (targetm
.attribute_table
)
3979 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3981 const_tree name
= get_attribute_name (a
);
3984 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3985 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3986 return targetm
.function_attribute_inlinable_p (fndecl
);
3993 /* Returns nonzero if FN is a function that does not have any
3994 fundamental inline blocking properties. */
3997 tree_inlinable_function_p (tree fn
)
3999 bool inlinable
= true;
4003 /* If we've already decided this function shouldn't be inlined,
4004 there's no need to check again. */
4005 if (DECL_UNINLINABLE (fn
))
4008 /* We only warn for functions declared `inline' by the user. */
4009 do_warning
= (warn_inline
4010 && DECL_DECLARED_INLINE_P (fn
)
4011 && !DECL_NO_INLINE_WARNING_P (fn
)
4012 && !DECL_IN_SYSTEM_HEADER (fn
));
4014 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
4017 && always_inline
== NULL
)
4020 warning (OPT_Winline
, "function %q+F can never be inlined because it "
4021 "is suppressed using %<-fno-inline%>", fn
);
4025 else if (!function_attribute_inlinable_p (fn
))
4028 warning (OPT_Winline
, "function %q+F can never be inlined because it "
4029 "uses attributes conflicting with inlining", fn
);
4033 else if (inline_forbidden_p (fn
))
4035 /* See if we should warn about uninlinable functions. Previously,
4036 some of these warnings would be issued while trying to expand
4037 the function inline, but that would cause multiple warnings
4038 about functions that would for example call alloca. But since
4039 this a property of the function, just one warning is enough.
4040 As a bonus we can now give more details about the reason why a
4041 function is not inlinable. */
4043 error (inline_forbidden_reason
, fn
);
4044 else if (do_warning
)
4045 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
4050 /* Squirrel away the result so that we don't have to check again. */
4051 DECL_UNINLINABLE (fn
) = !inlinable
;
4056 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
4057 word size and take possible memcpy call into account and return
4058 cost based on whether optimizing for size or speed according to SPEED_P. */
4061 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
4065 gcc_assert (!VOID_TYPE_P (type
));
4067 if (TREE_CODE (type
) == VECTOR_TYPE
)
4069 scalar_mode inner
= SCALAR_TYPE_MODE (TREE_TYPE (type
));
4070 machine_mode simd
= targetm
.vectorize
.preferred_simd_mode (inner
);
4072 = estimated_poly_value (GET_MODE_SIZE (TYPE_MODE (type
)));
4073 int simd_mode_size
= estimated_poly_value (GET_MODE_SIZE (simd
));
4074 return ((orig_mode_size
+ simd_mode_size
- 1)
4078 size
= int_size_in_bytes (type
);
4080 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
4081 /* Cost of a memcpy call, 3 arguments and the call. */
4084 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
4087 /* Returns cost of operation CODE, according to WEIGHTS */
4090 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
4091 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
4095 /* These are "free" conversions, or their presumed cost
4096 is folded into other operations. */
4101 case VIEW_CONVERT_EXPR
:
4104 /* Assign cost of 1 to usual operations.
4105 ??? We may consider mapping RTL costs to this. */
4111 case POINTER_PLUS_EXPR
:
4112 case POINTER_DIFF_EXPR
:
4115 case MULT_HIGHPART_EXPR
:
4117 case ADDR_SPACE_CONVERT_EXPR
:
4118 case FIXED_CONVERT_EXPR
:
4119 case FIX_TRUNC_EXPR
:
4138 case TRUTH_ANDIF_EXPR
:
4139 case TRUTH_ORIF_EXPR
:
4140 case TRUTH_AND_EXPR
:
4142 case TRUTH_XOR_EXPR
:
4143 case TRUTH_NOT_EXPR
:
4152 case UNORDERED_EXPR
:
4163 case PREDECREMENT_EXPR
:
4164 case PREINCREMENT_EXPR
:
4165 case POSTDECREMENT_EXPR
:
4166 case POSTINCREMENT_EXPR
:
4168 case REALIGN_LOAD_EXPR
:
4170 case WIDEN_SUM_EXPR
:
4171 case WIDEN_MULT_EXPR
:
4174 case WIDEN_MULT_PLUS_EXPR
:
4175 case WIDEN_MULT_MINUS_EXPR
:
4176 case WIDEN_LSHIFT_EXPR
:
4178 case VEC_WIDEN_MULT_HI_EXPR
:
4179 case VEC_WIDEN_MULT_LO_EXPR
:
4180 case VEC_WIDEN_MULT_EVEN_EXPR
:
4181 case VEC_WIDEN_MULT_ODD_EXPR
:
4182 case VEC_UNPACK_HI_EXPR
:
4183 case VEC_UNPACK_LO_EXPR
:
4184 case VEC_UNPACK_FLOAT_HI_EXPR
:
4185 case VEC_UNPACK_FLOAT_LO_EXPR
:
4186 case VEC_UNPACK_FIX_TRUNC_HI_EXPR
:
4187 case VEC_UNPACK_FIX_TRUNC_LO_EXPR
:
4188 case VEC_PACK_TRUNC_EXPR
:
4189 case VEC_PACK_SAT_EXPR
:
4190 case VEC_PACK_FIX_TRUNC_EXPR
:
4191 case VEC_PACK_FLOAT_EXPR
:
4192 case VEC_WIDEN_LSHIFT_HI_EXPR
:
4193 case VEC_WIDEN_LSHIFT_LO_EXPR
:
4194 case VEC_DUPLICATE_EXPR
:
4195 case VEC_SERIES_EXPR
:
4199 /* Few special cases of expensive operations. This is useful
4200 to avoid inlining on functions having too many of these. */
4201 case TRUNC_DIV_EXPR
:
4203 case FLOOR_DIV_EXPR
:
4204 case ROUND_DIV_EXPR
:
4205 case EXACT_DIV_EXPR
:
4206 case TRUNC_MOD_EXPR
:
4208 case FLOOR_MOD_EXPR
:
4209 case ROUND_MOD_EXPR
:
4211 if (TREE_CODE (op2
) != INTEGER_CST
)
4212 return weights
->div_mod_cost
;
4215 /* Bit-field insertion needs several shift and mask operations. */
4216 case BIT_INSERT_EXPR
:
4220 /* We expect a copy assignment with no operator. */
4221 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
4227 /* Estimate number of instructions that will be created by expanding
4228 the statements in the statement sequence STMTS.
4229 WEIGHTS contains weights attributed to various constructs. */
4232 estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
4235 gimple_stmt_iterator gsi
;
4238 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4239 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4245 /* Estimate number of instructions that will be created by expanding STMT.
4246 WEIGHTS contains weights attributed to various constructs. */
4249 estimate_num_insns (gimple
*stmt
, eni_weights
*weights
)
4252 enum gimple_code code
= gimple_code (stmt
);
4259 /* Try to estimate the cost of assignments. We have three cases to
4261 1) Simple assignments to registers;
4262 2) Stores to things that must live in memory. This includes
4263 "normal" stores to scalars, but also assignments of large
4264 structures, or constructors of big arrays;
4266 Let us look at the first two cases, assuming we have "a = b + C":
4267 <GIMPLE_ASSIGN <var_decl "a">
4268 <plus_expr <var_decl "b"> <constant C>>
4269 If "a" is a GIMPLE register, the assignment to it is free on almost
4270 any target, because "a" usually ends up in a real register. Hence
4271 the only cost of this expression comes from the PLUS_EXPR, and we
4272 can ignore the GIMPLE_ASSIGN.
4273 If "a" is not a GIMPLE register, the assignment to "a" will most
4274 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4275 of moving something into "a", which we compute using the function
4276 estimate_move_cost. */
4277 if (gimple_clobber_p (stmt
))
4278 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4280 lhs
= gimple_assign_lhs (stmt
);
4281 rhs
= gimple_assign_rhs1 (stmt
);
4285 /* Account for the cost of moving to / from memory. */
4286 if (gimple_store_p (stmt
))
4287 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
4288 if (gimple_assign_load_p (stmt
))
4289 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
4291 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
4292 gimple_assign_rhs1 (stmt
),
4293 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
4294 == GIMPLE_BINARY_RHS
4295 ? gimple_assign_rhs2 (stmt
) : NULL
);
4299 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4300 gimple_op (stmt
, 0),
4301 gimple_op (stmt
, 1));
4306 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4307 /* Take into account cost of the switch + guess 2 conditional jumps for
4310 TODO: once the switch expansion logic is sufficiently separated, we can
4311 do better job on estimating cost of the switch. */
4312 if (weights
->time_based
)
4313 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4315 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4323 if (gimple_call_internal_p (stmt
))
4325 else if ((decl
= gimple_call_fndecl (stmt
))
4326 && fndecl_built_in_p (decl
))
4328 /* Do not special case builtins where we see the body.
4329 This just confuse inliner. */
4330 struct cgraph_node
*node
;
4331 if (!(node
= cgraph_node::get (decl
))
4332 || node
->definition
)
4334 /* For buitins that are likely expanded to nothing or
4335 inlined do not account operand costs. */
4336 else if (is_simple_builtin (decl
))
4338 else if (is_inexpensive_builtin (decl
))
4339 return weights
->target_builtin_call_cost
;
4340 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
4342 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4343 specialize the cheap expansion we do here.
4344 ??? This asks for a more general solution. */
4345 switch (DECL_FUNCTION_CODE (decl
))
4350 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4352 (&TREE_REAL_CST (gimple_call_arg (stmt
, 1)),
4354 return estimate_operator_cost
4355 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4356 gimple_call_arg (stmt
, 0));
4365 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4366 if (gimple_call_lhs (stmt
))
4367 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4368 weights
->time_based
);
4369 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4371 tree arg
= gimple_call_arg (stmt
, i
);
4372 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4373 weights
->time_based
);
4379 return weights
->return_cost
;
4385 case GIMPLE_PREDICT
:
4391 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4392 /* 1000 means infinity. This avoids overflows later
4393 with very long asm statements. */
4396 /* If this asm is asm inline, count anything as minimum size. */
4397 if (gimple_asm_inline_p (as_a
<gasm
*> (stmt
)))
4398 count
= MIN (1, count
);
4399 return MAX (1, count
);
4403 /* This is either going to be an external function call with one
4404 argument, or two register copy statements plus a goto. */
4407 case GIMPLE_EH_DISPATCH
:
4408 /* ??? This is going to turn into a switch statement. Ideally
4409 we'd have a look at the eh region and estimate the number of
4414 return estimate_num_insns_seq (
4415 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4418 case GIMPLE_EH_FILTER
:
4419 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4422 return estimate_num_insns_seq (gimple_catch_handler (
4423 as_a
<gcatch
*> (stmt
)),
4427 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4428 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4430 /* OMP directives are generally very expensive. */
4432 case GIMPLE_OMP_RETURN
:
4433 case GIMPLE_OMP_SECTIONS_SWITCH
:
4434 case GIMPLE_OMP_ATOMIC_STORE
:
4435 case GIMPLE_OMP_CONTINUE
:
4436 /* ...except these, which are cheap. */
4439 case GIMPLE_OMP_ATOMIC_LOAD
:
4440 return weights
->omp_cost
;
4442 case GIMPLE_OMP_FOR
:
4443 return (weights
->omp_cost
4444 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4445 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4447 case GIMPLE_OMP_PARALLEL
:
4448 case GIMPLE_OMP_TASK
:
4449 case GIMPLE_OMP_CRITICAL
:
4450 case GIMPLE_OMP_MASTER
:
4451 case GIMPLE_OMP_TASKGROUP
:
4452 case GIMPLE_OMP_ORDERED
:
4453 case GIMPLE_OMP_SCAN
:
4454 case GIMPLE_OMP_SECTION
:
4455 case GIMPLE_OMP_SECTIONS
:
4456 case GIMPLE_OMP_SINGLE
:
4457 case GIMPLE_OMP_TARGET
:
4458 case GIMPLE_OMP_TEAMS
:
4459 return (weights
->omp_cost
4460 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4462 case GIMPLE_TRANSACTION
:
4463 return (weights
->tm_cost
4464 + estimate_num_insns_seq (gimple_transaction_body (
4465 as_a
<gtransaction
*> (stmt
)),
4475 /* Estimate number of instructions that will be created by expanding
4476 function FNDECL. WEIGHTS contains weights attributed to various
4480 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4482 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4483 gimple_stmt_iterator bsi
;
4487 gcc_assert (my_function
&& my_function
->cfg
);
4488 FOR_EACH_BB_FN (bb
, my_function
)
4490 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4491 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4498 /* Initializes weights used by estimate_num_insns. */
4501 init_inline_once (void)
4503 eni_size_weights
.call_cost
= 1;
4504 eni_size_weights
.indirect_call_cost
= 3;
4505 eni_size_weights
.target_builtin_call_cost
= 1;
4506 eni_size_weights
.div_mod_cost
= 1;
4507 eni_size_weights
.omp_cost
= 40;
4508 eni_size_weights
.tm_cost
= 10;
4509 eni_size_weights
.time_based
= false;
4510 eni_size_weights
.return_cost
= 1;
4512 /* Estimating time for call is difficult, since we have no idea what the
4513 called function does. In the current uses of eni_time_weights,
4514 underestimating the cost does less harm than overestimating it, so
4515 we choose a rather small value here. */
4516 eni_time_weights
.call_cost
= 10;
4517 eni_time_weights
.indirect_call_cost
= 15;
4518 eni_time_weights
.target_builtin_call_cost
= 1;
4519 eni_time_weights
.div_mod_cost
= 10;
4520 eni_time_weights
.omp_cost
= 40;
4521 eni_time_weights
.tm_cost
= 40;
4522 eni_time_weights
.time_based
= true;
4523 eni_time_weights
.return_cost
= 2;
4527 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4530 prepend_lexical_block (tree current_block
, tree new_block
)
4532 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4533 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4534 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4537 /* Add local variables from CALLEE to CALLER. */
4540 add_local_variables (struct function
*callee
, struct function
*caller
,
4546 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4547 if (!can_be_nonlocal (var
, id
))
4549 tree new_var
= remap_decl (var
, id
);
4551 /* Remap debug-expressions. */
4553 && DECL_HAS_DEBUG_EXPR_P (var
)
4556 tree tem
= DECL_DEBUG_EXPR (var
);
4557 bool old_regimplify
= id
->regimplify
;
4558 id
->remapping_type_depth
++;
4559 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4560 id
->remapping_type_depth
--;
4561 id
->regimplify
= old_regimplify
;
4562 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4563 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4565 add_local_decl (caller
, new_var
);
4569 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4570 have brought in or introduced any debug stmts for SRCVAR. */
4573 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4575 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4580 if (!VAR_P (*remappedvarp
))
4583 if (*remappedvarp
== id
->retvar
)
4586 tree tvar
= target_for_debug_bind (*remappedvarp
);
4590 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4592 gimple_seq_add_stmt (bindings
, stmt
);
4595 /* For each inlined variable for which we may have debug bind stmts,
4596 add before GSI a final debug stmt resetting it, marking the end of
4597 its life, so that var-tracking knows it doesn't have to compute
4598 further locations for it. */
4601 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4605 gimple_seq bindings
= NULL
;
4607 if (!gimple_in_ssa_p (id
->src_cfun
))
4610 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4613 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4614 var
; var
= DECL_CHAIN (var
))
4615 reset_debug_binding (id
, var
, &bindings
);
4617 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4618 reset_debug_binding (id
, var
, &bindings
);
4620 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4623 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4626 expand_call_inline (basic_block bb
, gimple
*stmt
, copy_body_data
*id
)
4630 hash_map
<tree
, tree
> *dst
;
4631 hash_map
<tree
, tree
> *st
= NULL
;
4634 struct cgraph_edge
*cg_edge
;
4635 cgraph_inline_failed_t reason
;
4636 basic_block return_block
;
4638 gimple_stmt_iterator gsi
, stmt_gsi
;
4639 bool successfully_inlined
= false;
4640 bool purge_dead_abnormal_edges
;
4642 unsigned int prop_mask
, src_properties
;
4643 struct function
*dst_cfun
;
4646 gimple
*simtenter_stmt
= NULL
;
4647 vec
<tree
> *simtvars_save
;
4649 /* The gimplifier uses input_location in too many places, such as
4650 internal_get_tmp_var (). */
4651 location_t saved_location
= input_location
;
4652 input_location
= gimple_location (stmt
);
4654 /* From here on, we're only interested in CALL_EXPRs. */
4655 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4659 cg_edge
= id
->dst_node
->get_edge (stmt
);
4660 gcc_checking_assert (cg_edge
);
4661 /* First, see if we can figure out what function is being called.
4662 If we cannot, then there is no hope of inlining the function. */
4663 if (cg_edge
->indirect_unknown_callee
)
4665 fn
= cg_edge
->callee
->decl
;
4666 gcc_checking_assert (fn
);
4668 /* If FN is a declaration of a function in a nested scope that was
4669 globally declared inline, we don't set its DECL_INITIAL.
4670 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4671 C++ front-end uses it for cdtors to refer to their internal
4672 declarations, that are not real functions. Fortunately those
4673 don't have trees to be saved, so we can tell by checking their
4675 if (!DECL_INITIAL (fn
)
4676 && DECL_ABSTRACT_ORIGIN (fn
)
4677 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4678 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4680 /* Don't try to inline functions that are not well-suited to inlining. */
4681 if (cg_edge
->inline_failed
)
4683 reason
= cg_edge
->inline_failed
;
4684 /* If this call was originally indirect, we do not want to emit any
4685 inlining related warnings or sorry messages because there are no
4686 guarantees regarding those. */
4687 if (cg_edge
->indirect_inlining_edge
)
4690 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4691 /* For extern inline functions that get redefined we always
4692 silently ignored always_inline flag. Better behavior would
4693 be to be able to keep both bodies and use extern inline body
4694 for inlining, but we can't do that because frontends overwrite
4696 && !cg_edge
->callee
->redefined_extern_inline
4697 /* During early inline pass, report only when optimization is
4699 && (symtab
->global_info_ready
4701 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4702 /* PR 20090218-1_0.c. Body can be provided by another module. */
4703 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4705 error ("inlining failed in call to %<always_inline%> %q+F: %s", fn
,
4706 cgraph_inline_failed_string (reason
));
4707 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4708 inform (gimple_location (stmt
), "called from here");
4709 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4710 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4711 "called from this function");
4713 else if (warn_inline
4714 && DECL_DECLARED_INLINE_P (fn
)
4715 && !DECL_NO_INLINE_WARNING_P (fn
)
4716 && !DECL_IN_SYSTEM_HEADER (fn
)
4717 && reason
!= CIF_UNSPECIFIED
4718 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4719 /* Do not warn about not inlined recursive calls. */
4720 && !cg_edge
->recursive_p ()
4721 /* Avoid warnings during early inline pass. */
4722 && symtab
->global_info_ready
)
4724 auto_diagnostic_group d
;
4725 if (warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4726 fn
, _(cgraph_inline_failed_string (reason
))))
4728 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4729 inform (gimple_location (stmt
), "called from here");
4730 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4731 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4732 "called from this function");
4737 id
->src_node
= cg_edge
->callee
;
4739 /* If callee is thunk, all we need is to adjust the THIS pointer
4740 and redirect to function being thunked. */
4741 if (id
->src_node
->thunk
.thunk_p
)
4744 tree virtual_offset
= NULL
;
4745 profile_count count
= cg_edge
->count
;
4747 gimple_stmt_iterator iter
= gsi_for_stmt (stmt
);
4750 edge
= id
->src_node
->callees
->clone (id
->dst_node
, call_stmt
,
4752 profile_count::one (),
4753 profile_count::one (),
4755 edge
->count
= count
;
4756 if (id
->src_node
->thunk
.virtual_offset_p
)
4757 virtual_offset
= size_int (id
->src_node
->thunk
.virtual_value
);
4758 op
= create_tmp_reg_fn (cfun
, TREE_TYPE (gimple_call_arg (stmt
, 0)),
4760 gsi_insert_before (&iter
, gimple_build_assign (op
,
4761 gimple_call_arg (stmt
, 0)),
4763 gcc_assert (id
->src_node
->thunk
.this_adjusting
);
4764 op
= thunk_adjust (&iter
, op
, 1, id
->src_node
->thunk
.fixed_offset
,
4765 virtual_offset
, id
->src_node
->thunk
.indirect_offset
);
4767 gimple_call_set_arg (stmt
, 0, op
);
4768 gimple_call_set_fndecl (stmt
, edge
->callee
->decl
);
4770 id
->src_node
->remove ();
4771 expand_call_inline (bb
, stmt
, id
);
4772 maybe_remove_unused_call_args (cfun
, stmt
);
4775 fn
= cg_edge
->callee
->decl
;
4776 cg_edge
->callee
->get_untransformed_body ();
4778 if (flag_checking
&& cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4779 cg_edge
->callee
->verify ();
4781 /* We will be inlining this callee. */
4782 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4784 /* Update the callers EH personality. */
4785 if (DECL_FUNCTION_PERSONALITY (fn
))
4786 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4787 = DECL_FUNCTION_PERSONALITY (fn
);
4789 /* Split the block before the GIMPLE_CALL. */
4790 stmt_gsi
= gsi_for_stmt (stmt
);
4791 gsi_prev (&stmt_gsi
);
4792 e
= split_block (bb
, gsi_end_p (stmt_gsi
) ? NULL
: gsi_stmt (stmt_gsi
));
4794 return_block
= e
->dest
;
4797 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4798 been the source of abnormal edges. In this case, schedule
4799 the removal of dead abnormal edges. */
4800 gsi
= gsi_start_bb (return_block
);
4802 purge_dead_abnormal_edges
= gsi_end_p (gsi
);
4804 stmt_gsi
= gsi_start_bb (return_block
);
4806 /* Build a block containing code to initialize the arguments, the
4807 actual inline expansion of the body, and a label for the return
4808 statements within the function to jump to. The type of the
4809 statement expression is the return type of the function call.
4810 ??? If the call does not have an associated block then we will
4811 remap all callee blocks to NULL, effectively dropping most of
4812 its debug information. This should only happen for calls to
4813 artificial decls inserted by the compiler itself. We need to
4814 either link the inlined blocks into the caller block tree or
4815 not refer to them in any way to not break GC for locations. */
4816 if (tree block
= gimple_block (stmt
))
4818 /* We do want to assign a not UNKNOWN_LOCATION BLOCK_SOURCE_LOCATION
4819 to make inlined_function_outer_scope_p return true on this BLOCK. */
4820 location_t loc
= LOCATION_LOCUS (gimple_location (stmt
));
4821 if (loc
== UNKNOWN_LOCATION
)
4822 loc
= LOCATION_LOCUS (DECL_SOURCE_LOCATION (fn
));
4823 if (loc
== UNKNOWN_LOCATION
)
4824 loc
= BUILTINS_LOCATION
;
4825 id
->block
= make_node (BLOCK
);
4826 BLOCK_ABSTRACT_ORIGIN (id
->block
) = DECL_ORIGIN (fn
);
4827 BLOCK_SOURCE_LOCATION (id
->block
) = loc
;
4828 prepend_lexical_block (block
, id
->block
);
4831 /* Local declarations will be replaced by their equivalents in this map. */
4833 id
->decl_map
= new hash_map
<tree
, tree
>;
4834 dst
= id
->debug_map
;
4835 id
->debug_map
= NULL
;
4836 if (flag_stack_reuse
!= SR_NONE
)
4837 id
->add_clobbers_to_eh_landing_pads
= last_basic_block_for_fn (cfun
);
4839 /* Record the function we are about to inline. */
4841 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4842 id
->reset_location
= DECL_IGNORED_P (fn
);
4843 id
->call_stmt
= call_stmt
;
4845 /* When inlining into an OpenMP SIMD-on-SIMT loop, arrange for new automatic
4846 variables to be added to IFN_GOMP_SIMT_ENTER argument list. */
4847 dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4848 simtvars_save
= id
->dst_simt_vars
;
4849 if (!(dst_cfun
->curr_properties
& PROP_gimple_lomp_dev
)
4850 && (simduid
= bb
->loop_father
->simduid
) != NULL_TREE
4851 && (simduid
= ssa_default_def (dst_cfun
, simduid
)) != NULL_TREE
4852 && single_imm_use (simduid
, &use
, &simtenter_stmt
)
4853 && is_gimple_call (simtenter_stmt
)
4854 && gimple_call_internal_p (simtenter_stmt
, IFN_GOMP_SIMT_ENTER
))
4855 vec_alloc (id
->dst_simt_vars
, 0);
4857 id
->dst_simt_vars
= NULL
;
4859 if (profile_status_for_fn (id
->src_cfun
) == PROFILE_ABSENT
)
4860 profile_status_for_fn (dst_cfun
) = PROFILE_ABSENT
;
4862 /* If the src function contains an IFN_VA_ARG, then so will the dst
4863 function after inlining. Likewise for IFN_GOMP_USE_SIMT. */
4864 prop_mask
= PROP_gimple_lva
| PROP_gimple_lomp_dev
;
4865 src_properties
= id
->src_cfun
->curr_properties
& prop_mask
;
4866 if (src_properties
!= prop_mask
)
4867 dst_cfun
->curr_properties
&= src_properties
| ~prop_mask
;
4868 dst_cfun
->calls_eh_return
|= id
->src_cfun
->calls_eh_return
;
4870 gcc_assert (!id
->src_cfun
->after_inlining
);
4873 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4875 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4876 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4880 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4881 if (debug_nonbind_markers_p
&& debug_inline_points
&& id
->block
4882 && inlined_function_outer_scope_p (id
->block
))
4884 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4885 gsi_insert_after (&si
, gimple_build_debug_inline_entry
4886 (id
->block
, DECL_SOURCE_LOCATION (id
->src_fn
)),
4890 if (DECL_INITIAL (fn
))
4892 if (gimple_block (stmt
))
4896 prepend_lexical_block (id
->block
,
4897 remap_blocks (DECL_INITIAL (fn
), id
));
4898 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4899 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4901 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4902 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4903 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4904 under it. The parameters can be then evaluated in the debugger,
4905 but don't show in backtraces. */
4906 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4907 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4910 *var
= TREE_CHAIN (v
);
4911 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4912 BLOCK_VARS (id
->block
) = v
;
4915 var
= &TREE_CHAIN (*var
);
4918 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4921 /* Return statements in the function body will be replaced by jumps
4922 to the RET_LABEL. */
4923 gcc_assert (DECL_INITIAL (fn
));
4924 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4926 /* Find the LHS to which the result of this call is assigned. */
4928 if (gimple_call_lhs (stmt
))
4930 modify_dest
= gimple_call_lhs (stmt
);
4932 /* The function which we are inlining might not return a value,
4933 in which case we should issue a warning that the function
4934 does not return a value. In that case the optimizers will
4935 see that the variable to which the value is assigned was not
4936 initialized. We do not want to issue a warning about that
4937 uninitialized variable. */
4938 if (DECL_P (modify_dest
))
4939 TREE_NO_WARNING (modify_dest
) = 1;
4941 if (gimple_call_return_slot_opt_p (call_stmt
))
4943 return_slot
= modify_dest
;
4950 /* If we are inlining a call to the C++ operator new, we don't want
4951 to use type based alias analysis on the return value. Otherwise
4952 we may get confused if the compiler sees that the inlined new
4953 function returns a pointer which was just deleted. See bug
4955 if (DECL_IS_OPERATOR_NEW_P (fn
))
4961 /* Declare the return variable for the function. */
4962 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4964 /* Add local vars in this inlined callee to caller. */
4965 add_local_variables (id
->src_cfun
, cfun
, id
);
4967 if (id
->src_node
->clone
.performed_splits
)
4969 /* Any calls from the inlined function will be turned into calls from the
4970 function we inline into. We must preserve notes about how to split
4971 parameters such calls should be redirected/updated. */
4972 unsigned len
= vec_safe_length (id
->src_node
->clone
.performed_splits
);
4973 for (unsigned i
= 0; i
< len
; i
++)
4975 ipa_param_performed_split ps
4976 = (*id
->src_node
->clone
.performed_splits
)[i
];
4977 ps
.dummy_decl
= remap_decl (ps
.dummy_decl
, id
);
4978 vec_safe_push (id
->dst_node
->clone
.performed_splits
, ps
);
4983 len
= vec_safe_length (id
->dst_node
->clone
.performed_splits
);
4984 for (unsigned i
= 0; i
< len
; i
++)
4986 ipa_param_performed_split
*ps1
4987 = &(*id
->dst_node
->clone
.performed_splits
)[i
];
4988 for (unsigned j
= i
+ 1; j
< len
; j
++)
4990 ipa_param_performed_split
*ps2
4991 = &(*id
->dst_node
->clone
.performed_splits
)[j
];
4992 gcc_assert (ps1
->dummy_decl
!= ps2
->dummy_decl
4993 || ps1
->unit_offset
!= ps2
->unit_offset
);
4999 if (dump_enabled_p ())
5002 snprintf (buf
, sizeof(buf
), "%4.2f",
5003 cg_edge
->sreal_frequency ().to_double ());
5004 dump_printf_loc (MSG_NOTE
| MSG_PRIORITY_INTERNALS
,
5006 "Inlining %C to %C with frequency %s\n",
5007 id
->src_node
, id
->dst_node
, buf
);
5008 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5010 id
->src_node
->dump (dump_file
);
5011 id
->dst_node
->dump (dump_file
);
5015 /* This is it. Duplicate the callee body. Assume callee is
5016 pre-gimplified. Note that we must not alter the caller
5017 function in any way before this point, as this CALL_EXPR may be
5018 a self-referential call; if we're calling ourselves, we need to
5019 duplicate our body before altering anything. */
5020 copy_body (id
, bb
, return_block
, NULL
);
5022 reset_debug_bindings (id
, stmt_gsi
);
5024 if (flag_stack_reuse
!= SR_NONE
)
5025 for (tree p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
5026 if (!TREE_THIS_VOLATILE (p
))
5028 tree
*varp
= id
->decl_map
->get (p
);
5029 if (varp
&& VAR_P (*varp
) && !is_gimple_reg (*varp
))
5031 tree clobber
= build_clobber (TREE_TYPE (*varp
));
5032 gimple
*clobber_stmt
;
5033 clobber_stmt
= gimple_build_assign (*varp
, clobber
);
5034 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
5035 gsi_insert_before (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
5039 /* Reset the escaped solution. */
5040 if (cfun
->gimple_df
)
5041 pt_solution_reset (&cfun
->gimple_df
->escaped
);
5043 /* Add new automatic variables to IFN_GOMP_SIMT_ENTER arguments. */
5044 if (id
->dst_simt_vars
&& id
->dst_simt_vars
->length () > 0)
5046 size_t nargs
= gimple_call_num_args (simtenter_stmt
);
5047 vec
<tree
> *vars
= id
->dst_simt_vars
;
5048 auto_vec
<tree
> newargs (nargs
+ vars
->length ());
5049 for (size_t i
= 0; i
< nargs
; i
++)
5050 newargs
.quick_push (gimple_call_arg (simtenter_stmt
, i
));
5051 for (tree
*pvar
= vars
->begin (); pvar
!= vars
->end (); pvar
++)
5053 tree ptrtype
= build_pointer_type (TREE_TYPE (*pvar
));
5054 newargs
.quick_push (build1 (ADDR_EXPR
, ptrtype
, *pvar
));
5056 gcall
*g
= gimple_build_call_internal_vec (IFN_GOMP_SIMT_ENTER
, newargs
);
5057 gimple_call_set_lhs (g
, gimple_call_lhs (simtenter_stmt
));
5058 gimple_stmt_iterator gsi
= gsi_for_stmt (simtenter_stmt
);
5059 gsi_replace (&gsi
, g
, false);
5061 vec_free (id
->dst_simt_vars
);
5062 id
->dst_simt_vars
= simtvars_save
;
5067 delete id
->debug_map
;
5068 id
->debug_map
= dst
;
5070 delete id
->decl_map
;
5073 /* Unlink the calls virtual operands before replacing it. */
5074 unlink_stmt_vdef (stmt
);
5075 if (gimple_vdef (stmt
)
5076 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
5077 release_ssa_name (gimple_vdef (stmt
));
5079 /* If the inlined function returns a result that we care about,
5080 substitute the GIMPLE_CALL with an assignment of the return
5081 variable to the LHS of the call. That is, if STMT was
5082 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
5083 if (use_retvar
&& gimple_call_lhs (stmt
))
5085 gimple
*old_stmt
= stmt
;
5086 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
5087 gimple_set_location (stmt
, gimple_location (old_stmt
));
5088 gsi_replace (&stmt_gsi
, stmt
, false);
5089 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
5090 /* Append a clobber for id->retvar if easily possible. */
5091 if (flag_stack_reuse
!= SR_NONE
5093 && VAR_P (id
->retvar
)
5094 && id
->retvar
!= return_slot
5095 && id
->retvar
!= modify_dest
5096 && !TREE_THIS_VOLATILE (id
->retvar
)
5097 && !is_gimple_reg (id
->retvar
)
5098 && !stmt_ends_bb_p (stmt
))
5100 tree clobber
= build_clobber (TREE_TYPE (id
->retvar
));
5101 gimple
*clobber_stmt
;
5102 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
5103 gimple_set_location (clobber_stmt
, gimple_location (old_stmt
));
5104 gsi_insert_after (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
5109 /* Handle the case of inlining a function with no return
5110 statement, which causes the return value to become undefined. */
5111 if (gimple_call_lhs (stmt
)
5112 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
5114 tree name
= gimple_call_lhs (stmt
);
5115 tree var
= SSA_NAME_VAR (name
);
5116 tree def
= var
? ssa_default_def (cfun
, var
) : NULL
;
5120 /* If the variable is used undefined, make this name
5121 undefined via a move. */
5122 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
5123 gsi_replace (&stmt_gsi
, stmt
, true);
5129 var
= create_tmp_reg_fn (cfun
, TREE_TYPE (name
), NULL
);
5130 SET_SSA_NAME_VAR_OR_IDENTIFIER (name
, var
);
5132 /* Otherwise make this variable undefined. */
5133 gsi_remove (&stmt_gsi
, true);
5134 set_ssa_default_def (cfun
, var
, name
);
5135 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
5138 /* Replace with a clobber for id->retvar. */
5139 else if (flag_stack_reuse
!= SR_NONE
5141 && VAR_P (id
->retvar
)
5142 && id
->retvar
!= return_slot
5143 && id
->retvar
!= modify_dest
5144 && !TREE_THIS_VOLATILE (id
->retvar
)
5145 && !is_gimple_reg (id
->retvar
))
5147 tree clobber
= build_clobber (TREE_TYPE (id
->retvar
));
5148 gimple
*clobber_stmt
;
5149 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
5150 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
5151 gsi_replace (&stmt_gsi
, clobber_stmt
, false);
5152 maybe_clean_or_replace_eh_stmt (stmt
, clobber_stmt
);
5155 gsi_remove (&stmt_gsi
, true);
5158 if (purge_dead_abnormal_edges
)
5160 gimple_purge_dead_eh_edges (return_block
);
5161 gimple_purge_dead_abnormal_call_edges (return_block
);
5164 /* If the value of the new expression is ignored, that's OK. We
5165 don't warn about this for CALL_EXPRs, so we shouldn't warn about
5166 the equivalent inlined version either. */
5167 if (is_gimple_assign (stmt
))
5169 gcc_assert (gimple_assign_single_p (stmt
)
5170 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
5171 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
5174 id
->add_clobbers_to_eh_landing_pads
= 0;
5176 /* Output the inlining info for this abstract function, since it has been
5177 inlined. If we don't do this now, we can lose the information about the
5178 variables in the function when the blocks get blown away as soon as we
5179 remove the cgraph node. */
5180 if (gimple_block (stmt
))
5181 (*debug_hooks
->outlining_inline_function
) (fn
);
5183 /* Update callgraph if needed. */
5184 cg_edge
->callee
->remove ();
5186 id
->block
= NULL_TREE
;
5187 id
->retvar
= NULL_TREE
;
5188 successfully_inlined
= true;
5191 input_location
= saved_location
;
5192 return successfully_inlined
;
5195 /* Expand call statements reachable from STMT_P.
5196 We can only have CALL_EXPRs as the "toplevel" tree code or nested
5197 in a MODIFY_EXPR. */
5200 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
5202 gimple_stmt_iterator gsi
;
5203 bool inlined
= false;
5205 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
5207 gimple
*stmt
= gsi_stmt (gsi
);
5210 if (is_gimple_call (stmt
)
5211 && !gimple_call_internal_p (stmt
))
5212 inlined
|= expand_call_inline (bb
, stmt
, id
);
5219 /* Walk all basic blocks created after FIRST and try to fold every statement
5220 in the STATEMENTS pointer set. */
5223 fold_marked_statements (int first
, hash_set
<gimple
*> *statements
)
5225 for (; first
< last_basic_block_for_fn (cfun
); first
++)
5226 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
5228 gimple_stmt_iterator gsi
;
5230 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
5233 if (statements
->contains (gsi_stmt (gsi
)))
5235 gimple
*old_stmt
= gsi_stmt (gsi
);
5236 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
5238 if (old_decl
&& fndecl_built_in_p (old_decl
))
5240 /* Folding builtins can create multiple instructions,
5241 we need to look at all of them. */
5242 gimple_stmt_iterator i2
= gsi
;
5244 if (fold_stmt (&gsi
))
5247 /* If a builtin at the end of a bb folded into nothing,
5248 the following loop won't work. */
5249 if (gsi_end_p (gsi
))
5251 cgraph_update_edges_for_call_stmt (old_stmt
,
5256 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
5261 new_stmt
= gsi_stmt (i2
);
5262 update_stmt (new_stmt
);
5263 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5266 if (new_stmt
== gsi_stmt (gsi
))
5268 /* It is okay to check only for the very last
5269 of these statements. If it is a throwing
5270 statement nothing will change. If it isn't
5271 this can remove EH edges. If that weren't
5272 correct then because some intermediate stmts
5273 throw, but not the last one. That would mean
5274 we'd have to split the block, which we can't
5275 here and we'd loose anyway. And as builtins
5276 probably never throw, this all
5278 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
5280 gimple_purge_dead_eh_edges (
5281 BASIC_BLOCK_FOR_FN (cfun
, first
));
5288 else if (fold_stmt (&gsi
))
5290 /* Re-read the statement from GSI as fold_stmt() may
5292 gimple
*new_stmt
= gsi_stmt (gsi
);
5293 update_stmt (new_stmt
);
5295 if (is_gimple_call (old_stmt
)
5296 || is_gimple_call (new_stmt
))
5297 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5300 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
5301 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
5308 /* Expand calls to inline functions in the body of FN. */
5311 optimize_inline_calls (tree fn
)
5315 int last
= n_basic_blocks_for_fn (cfun
);
5316 bool inlined_p
= false;
5319 memset (&id
, 0, sizeof (id
));
5321 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
5322 gcc_assert (id
.dst_node
->definition
);
5324 /* Or any functions that aren't finished yet. */
5325 if (current_function_decl
)
5326 id
.dst_fn
= current_function_decl
;
5328 id
.copy_decl
= copy_decl_maybe_to_var
;
5329 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5330 id
.transform_new_cfg
= false;
5331 id
.transform_return_to_modify
= true;
5332 id
.transform_parameter
= true;
5333 id
.transform_lang_insert_block
= NULL
;
5334 id
.statements_to_fold
= new hash_set
<gimple
*>;
5336 push_gimplify_context ();
5338 /* We make no attempts to keep dominance info up-to-date. */
5339 free_dominance_info (CDI_DOMINATORS
);
5340 free_dominance_info (CDI_POST_DOMINATORS
);
5342 /* Register specific gimple functions. */
5343 gimple_register_cfg_hooks ();
5345 /* Reach the trees by walking over the CFG, and note the
5346 enclosing basic-blocks in the call edges. */
5347 /* We walk the blocks going forward, because inlined function bodies
5348 will split id->current_basic_block, and the new blocks will
5349 follow it; we'll trudge through them, processing their CALL_EXPRs
5351 FOR_EACH_BB_FN (bb
, cfun
)
5352 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
5354 pop_gimplify_context (NULL
);
5358 struct cgraph_edge
*e
;
5360 id
.dst_node
->verify ();
5362 /* Double check that we inlined everything we are supposed to inline. */
5363 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
5364 gcc_assert (e
->inline_failed
);
5367 /* Fold queued statements. */
5368 update_max_bb_count ();
5369 fold_marked_statements (last
, id
.statements_to_fold
);
5370 delete id
.statements_to_fold
;
5372 gcc_assert (!id
.debug_stmts
.exists ());
5374 /* If we didn't inline into the function there is nothing to do. */
5378 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5381 delete_unreachable_blocks_update_callgraph (id
.dst_node
, false);
5384 id
.dst_node
->verify ();
5386 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5387 not possible yet - the IPA passes might make various functions to not
5388 throw and they don't care to proactively update local EH info. This is
5389 done later in fixup_cfg pass that also execute the verification. */
5390 return (TODO_update_ssa
5392 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5393 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
5394 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
5395 ? TODO_rebuild_frequencies
: 0));
5398 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5401 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5403 enum tree_code code
= TREE_CODE (*tp
);
5404 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5406 /* We make copies of most nodes. */
5407 if (IS_EXPR_CODE_CLASS (cl
)
5408 || code
== TREE_LIST
5410 || code
== TYPE_DECL
5411 || code
== OMP_CLAUSE
)
5413 /* Because the chain gets clobbered when we make a copy, we save it
5415 tree chain
= NULL_TREE
, new_tree
;
5417 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5418 chain
= TREE_CHAIN (*tp
);
5420 /* Copy the node. */
5421 new_tree
= copy_node (*tp
);
5425 /* Now, restore the chain, if appropriate. That will cause
5426 walk_tree to walk into the chain as well. */
5427 if (code
== PARM_DECL
5428 || code
== TREE_LIST
5429 || code
== OMP_CLAUSE
)
5430 TREE_CHAIN (*tp
) = chain
;
5432 /* For now, we don't update BLOCKs when we make copies. So, we
5433 have to nullify all BIND_EXPRs. */
5434 if (TREE_CODE (*tp
) == BIND_EXPR
)
5435 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5437 else if (code
== CONSTRUCTOR
)
5439 /* CONSTRUCTOR nodes need special handling because
5440 we need to duplicate the vector of elements. */
5443 new_tree
= copy_node (*tp
);
5444 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5447 else if (code
== STATEMENT_LIST
)
5448 /* We used to just abort on STATEMENT_LIST, but we can run into them
5449 with statement-expressions (c++/40975). */
5450 copy_statement_list (tp
);
5451 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5453 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5455 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5460 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5461 information indicating to what new SAVE_EXPR this one should be mapped,
5462 use that one. Otherwise, create a new node and enter it in ST. FN is
5463 the function into which the copy will be placed. */
5466 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5471 /* See if we already encountered this SAVE_EXPR. */
5474 /* If we didn't already remap this SAVE_EXPR, do so now. */
5477 t
= copy_node (*tp
);
5479 /* Remember this SAVE_EXPR. */
5481 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5486 /* We've already walked into this SAVE_EXPR; don't do it again. */
5491 /* Replace this SAVE_EXPR with the copy. */
5495 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5496 label, copies the declaration and enters it in the splay_tree in DATA (which
5497 is really a 'copy_body_data *'. */
5500 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5501 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5502 struct walk_stmt_info
*wi
)
5504 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5505 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5509 tree decl
= gimple_label_label (stmt
);
5511 /* Copy the decl and remember the copy. */
5512 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5518 static gimple_seq
duplicate_remap_omp_clause_seq (gimple_seq seq
,
5519 struct walk_stmt_info
*wi
);
5521 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5522 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5523 remaps all local declarations to appropriate replacements in gimple
5527 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5529 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5530 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5531 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5535 /* For recursive invocations this is no longer the LHS itself. */
5536 bool is_lhs
= wi
->is_lhs
;
5539 if (TREE_CODE (expr
) == SSA_NAME
)
5541 *tp
= remap_ssa_name (*tp
, id
);
5544 SSA_NAME_DEF_STMT (*tp
) = gsi_stmt (wi
->gsi
);
5546 /* Only a local declaration (variable or label). */
5547 else if ((VAR_P (expr
) && !TREE_STATIC (expr
))
5548 || TREE_CODE (expr
) == LABEL_DECL
)
5550 /* Lookup the declaration. */
5553 /* If it's there, remap it. */
5558 else if (TREE_CODE (expr
) == STATEMENT_LIST
5559 || TREE_CODE (expr
) == BIND_EXPR
5560 || TREE_CODE (expr
) == SAVE_EXPR
)
5562 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5564 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5565 It's OK for this to happen if it was part of a subtree that
5566 isn't immediately expanded, such as operand 2 of another
5568 if (!TREE_OPERAND (expr
, 1))
5570 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5571 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5574 else if (TREE_CODE (expr
) == OMP_CLAUSE
)
5576 /* Before the omplower pass completes, some OMP clauses can contain
5577 sequences that are neither copied by gimple_seq_copy nor walked by
5578 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5579 in those situations, we have to copy and process them explicitely. */
5581 if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LASTPRIVATE
)
5583 gimple_seq seq
= OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
);
5584 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5585 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
) = seq
;
5587 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LINEAR
)
5589 gimple_seq seq
= OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
);
5590 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5591 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
) = seq
;
5593 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_REDUCTION
)
5595 gimple_seq seq
= OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
);
5596 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5597 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
) = seq
;
5598 seq
= OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
);
5599 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5600 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
) = seq
;
5604 /* Keep iterating. */
5609 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5610 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5611 remaps all local declarations to appropriate replacements in gimple
5615 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5616 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5617 struct walk_stmt_info
*wi
)
5619 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5620 gimple
*gs
= gsi_stmt (*gsip
);
5622 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5624 tree block
= gimple_bind_block (stmt
);
5628 remap_block (&block
, id
);
5629 gimple_bind_set_block (stmt
, block
);
5632 /* This will remap a lot of the same decls again, but this should be
5634 if (gimple_bind_vars (stmt
))
5636 tree old_var
, decls
= gimple_bind_vars (stmt
);
5638 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
5639 if (!can_be_nonlocal (old_var
, id
)
5640 && ! variably_modified_type_p (TREE_TYPE (old_var
), id
->src_fn
))
5641 remap_decl (old_var
, id
);
5643 gcc_checking_assert (!id
->prevent_decl_creation_for_types
);
5644 id
->prevent_decl_creation_for_types
= true;
5645 gimple_bind_set_vars (stmt
, remap_decls (decls
, NULL
, id
));
5646 id
->prevent_decl_creation_for_types
= false;
5650 /* Keep iterating. */
5654 /* Create a copy of SEQ and remap all decls in it. */
5657 duplicate_remap_omp_clause_seq (gimple_seq seq
, struct walk_stmt_info
*wi
)
5662 /* If there are any labels in OMP sequences, they can be only referred to in
5663 the sequence itself and therefore we can do both here. */
5664 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, wi
);
5665 gimple_seq copy
= gimple_seq_copy (seq
);
5666 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, wi
);
5670 /* Copies everything in SEQ and replaces variables and labels local to
5671 current_function_decl. */
5674 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5677 struct walk_stmt_info wi
;
5680 /* There's nothing to do for NULL_TREE. */
5685 memset (&id
, 0, sizeof (id
));
5686 id
.src_fn
= current_function_decl
;
5687 id
.dst_fn
= current_function_decl
;
5689 id
.decl_map
= new hash_map
<tree
, tree
>;
5690 id
.debug_map
= NULL
;
5692 id
.copy_decl
= copy_decl_no_change
;
5693 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5694 id
.transform_new_cfg
= false;
5695 id
.transform_return_to_modify
= false;
5696 id
.transform_parameter
= false;
5697 id
.transform_lang_insert_block
= NULL
;
5699 /* Walk the tree once to find local labels. */
5700 memset (&wi
, 0, sizeof (wi
));
5701 hash_set
<tree
> visited
;
5704 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5706 copy
= gimple_seq_copy (seq
);
5708 /* Walk the copy, remapping decls. */
5709 memset (&wi
, 0, sizeof (wi
));
5711 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5716 delete id
.debug_map
;
5717 if (id
.dependence_map
)
5719 delete id
.dependence_map
;
5720 id
.dependence_map
= NULL
;
5727 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5730 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5739 debug_find_tree (tree top
, tree search
)
5741 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5745 /* Declare the variables created by the inliner. Add all the variables in
5746 VARS to BIND_EXPR. */
5749 declare_inline_vars (tree block
, tree vars
)
5752 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5754 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5755 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5756 add_local_decl (cfun
, t
);
5760 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5763 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5764 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5765 VAR_DECL translation. */
5768 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5770 /* Don't generate debug information for the copy if we wouldn't have
5771 generated it for the copy either. */
5772 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5773 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5775 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5776 declaration inspired this copy. */
5777 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5779 /* The new variable/label has no RTL, yet. */
5780 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5781 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5782 SET_DECL_RTL (copy
, 0);
5783 /* For vector typed decls make sure to update DECL_MODE according
5784 to the new function context. */
5785 if (VECTOR_TYPE_P (TREE_TYPE (copy
)))
5786 SET_DECL_MODE (copy
, TYPE_MODE (TREE_TYPE (copy
)));
5788 /* These args would always appear unused, if not for this. */
5789 TREE_USED (copy
) = 1;
5791 /* Set the context for the new declaration. */
5792 if (!DECL_CONTEXT (decl
))
5793 /* Globals stay global. */
5795 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5796 /* Things that weren't in the scope of the function we're inlining
5797 from aren't in the scope we're inlining to, either. */
5799 else if (TREE_STATIC (decl
))
5800 /* Function-scoped static variables should stay in the original
5805 /* Ordinary automatic local variables are now in the scope of the
5807 DECL_CONTEXT (copy
) = id
->dst_fn
;
5808 if (VAR_P (copy
) && id
->dst_simt_vars
&& !is_gimple_reg (copy
))
5810 if (!lookup_attribute ("omp simt private", DECL_ATTRIBUTES (copy
)))
5811 DECL_ATTRIBUTES (copy
)
5812 = tree_cons (get_identifier ("omp simt private"), NULL
,
5813 DECL_ATTRIBUTES (copy
));
5814 id
->dst_simt_vars
->safe_push (copy
);
5821 /* Create a new VAR_DECL that is indentical in all respect to DECL except that
5822 DECL can be either a VAR_DECL, a PARM_DECL or RESULT_DECL. The original
5823 DECL must come from ID->src_fn and the copy will be part of ID->dst_fn. */
5826 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5830 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5831 || TREE_CODE (decl
) == RESULT_DECL
);
5833 type
= TREE_TYPE (decl
);
5835 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5836 VAR_DECL
, DECL_NAME (decl
), type
);
5837 if (DECL_PT_UID_SET_P (decl
))
5838 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5839 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5840 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5841 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5842 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5844 return copy_decl_for_dup_finish (id
, decl
, copy
);
5847 /* Like copy_decl_to_var, but create a return slot object instead of a
5848 pointer variable for return by invisible reference. */
5851 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5855 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5856 || TREE_CODE (decl
) == RESULT_DECL
);
5858 type
= TREE_TYPE (decl
);
5859 if (DECL_BY_REFERENCE (decl
))
5860 type
= TREE_TYPE (type
);
5862 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5863 VAR_DECL
, DECL_NAME (decl
), type
);
5864 if (DECL_PT_UID_SET_P (decl
))
5865 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5866 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5867 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5868 if (!DECL_BY_REFERENCE (decl
))
5870 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5871 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5874 return copy_decl_for_dup_finish (id
, decl
, copy
);
5878 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5882 copy
= copy_node (decl
);
5884 /* The COPY is not abstract; it will be generated in DST_FN. */
5885 DECL_ABSTRACT_P (copy
) = false;
5886 lang_hooks
.dup_lang_specific_decl (copy
);
5888 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5889 been taken; it's for internal bookkeeping in expand_goto_internal. */
5890 if (TREE_CODE (copy
) == LABEL_DECL
)
5892 TREE_ADDRESSABLE (copy
) = 0;
5893 LABEL_DECL_UID (copy
) = -1;
5896 return copy_decl_for_dup_finish (id
, decl
, copy
);
5900 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5902 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5903 return copy_decl_to_var (decl
, id
);
5905 return copy_decl_no_change (decl
, id
);
5908 /* Return a copy of the function's argument tree without any modifications. */
5911 copy_arguments_nochange (tree orig_parm
, copy_body_data
* id
)
5914 tree new_parm
= NULL
;
5917 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
))
5919 tree new_tree
= remap_decl (arg
, id
);
5920 if (TREE_CODE (new_tree
) != PARM_DECL
)
5921 new_tree
= id
->copy_decl (arg
, id
);
5922 lang_hooks
.dup_lang_specific_decl (new_tree
);
5924 parg
= &DECL_CHAIN (new_tree
);
5929 /* Return a copy of the function's static chain. */
5931 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5933 tree
*chain_copy
, *pvar
;
5935 chain_copy
= &static_chain
;
5936 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5938 tree new_tree
= remap_decl (*pvar
, id
);
5939 lang_hooks
.dup_lang_specific_decl (new_tree
);
5940 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5943 return static_chain
;
5946 /* Return true if the function is allowed to be versioned.
5947 This is a guard for the versioning functionality. */
5950 tree_versionable_function_p (tree fndecl
)
5952 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5953 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
)) == NULL
);
5956 /* Update clone info after duplication. */
5959 update_clone_info (copy_body_data
* id
)
5961 vec
<ipa_param_performed_split
, va_gc
> *cur_performed_splits
5962 = id
->dst_node
->clone
.performed_splits
;
5963 if (cur_performed_splits
)
5965 unsigned len
= cur_performed_splits
->length ();
5966 for (unsigned i
= 0; i
< len
; i
++)
5968 ipa_param_performed_split
*ps
= &(*cur_performed_splits
)[i
];
5969 ps
->dummy_decl
= remap_decl (ps
->dummy_decl
, id
);
5973 struct cgraph_node
*node
;
5974 if (!id
->dst_node
->clones
)
5976 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5978 /* First update replace maps to match the new body. */
5979 if (node
->clone
.tree_map
)
5982 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5984 struct ipa_replace_map
*replace_info
;
5985 replace_info
= (*node
->clone
.tree_map
)[i
];
5986 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5989 if (node
->clone
.performed_splits
)
5991 unsigned len
= vec_safe_length (node
->clone
.performed_splits
);
5992 for (unsigned i
= 0; i
< len
; i
++)
5994 ipa_param_performed_split
*ps
5995 = &(*node
->clone
.performed_splits
)[i
];
5996 ps
->dummy_decl
= remap_decl (ps
->dummy_decl
, id
);
5999 if (unsigned len
= vec_safe_length (cur_performed_splits
))
6001 /* We do not want to add current performed splits when we are saving
6002 a copy of function body for later during inlining, that would just
6003 duplicate all entries. So let's have a look whether anything
6004 referring to the first dummy_decl is present. */
6005 unsigned dst_len
= vec_safe_length (node
->clone
.performed_splits
);
6006 ipa_param_performed_split
*first
= &(*cur_performed_splits
)[0];
6007 for (unsigned i
= 0; i
< dst_len
; i
++)
6008 if ((*node
->clone
.performed_splits
)[i
].dummy_decl
6009 == first
->dummy_decl
)
6015 for (unsigned i
= 0; i
< len
; i
++)
6016 vec_safe_push (node
->clone
.performed_splits
,
6017 (*cur_performed_splits
)[i
]);
6020 for (unsigned i
= 0; i
< dst_len
; i
++)
6022 ipa_param_performed_split
*ps1
6023 = &(*node
->clone
.performed_splits
)[i
];
6024 for (unsigned j
= i
+ 1; j
< dst_len
; j
++)
6026 ipa_param_performed_split
*ps2
6027 = &(*node
->clone
.performed_splits
)[j
];
6028 gcc_assert (ps1
->dummy_decl
!= ps2
->dummy_decl
6029 || ps1
->unit_offset
!= ps2
->unit_offset
);
6036 node
= node
->clones
;
6037 else if (node
->next_sibling_clone
)
6038 node
= node
->next_sibling_clone
;
6041 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
6042 node
= node
->clone_of
;
6043 if (node
!= id
->dst_node
)
6044 node
= node
->next_sibling_clone
;
6049 /* Create a copy of a function's tree.
6050 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
6051 of the original function and the new copied function
6052 respectively. In case we want to replace a DECL
6053 tree with another tree while duplicating the function's
6054 body, TREE_MAP represents the mapping between these
6055 trees. If UPDATE_CLONES is set, the call_stmt fields
6056 of edges of clones of the function will be updated.
6058 If non-NULL PARAM_ADJUSTMENTS determines how function prototype (i.e. the
6059 function parameters and return value) should be modified).
6060 If non-NULL BLOCKS_TO_COPY determine what basic blocks to copy.
6061 If non_NULL NEW_ENTRY determine new entry BB of the clone.
6064 tree_function_versioning (tree old_decl
, tree new_decl
,
6065 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
6066 ipa_param_adjustments
*param_adjustments
,
6067 bool update_clones
, bitmap blocks_to_copy
,
6068 basic_block new_entry
)
6070 struct cgraph_node
*old_version_node
;
6071 struct cgraph_node
*new_version_node
;
6075 struct ipa_replace_map
*replace_info
;
6076 basic_block old_entry_block
, bb
;
6077 auto_vec
<gimple
*, 10> init_stmts
;
6078 tree vars
= NULL_TREE
;
6080 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
6081 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
6082 DECL_POSSIBLY_INLINED (old_decl
) = 1;
6084 old_version_node
= cgraph_node::get (old_decl
);
6085 gcc_checking_assert (old_version_node
);
6086 new_version_node
= cgraph_node::get (new_decl
);
6087 gcc_checking_assert (new_version_node
);
6089 /* Copy over debug args. */
6090 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
6092 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
6093 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
6094 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
6095 old_debug_args
= decl_debug_args_lookup (old_decl
);
6098 new_debug_args
= decl_debug_args_insert (new_decl
);
6099 *new_debug_args
= vec_safe_copy (*old_debug_args
);
6103 /* Output the inlining info for this abstract function, since it has been
6104 inlined. If we don't do this now, we can lose the information about the
6105 variables in the function when the blocks get blown away as soon as we
6106 remove the cgraph node. */
6107 (*debug_hooks
->outlining_inline_function
) (old_decl
);
6109 DECL_ARTIFICIAL (new_decl
) = 1;
6110 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
6111 if (DECL_ORIGIN (old_decl
) == old_decl
)
6112 old_version_node
->used_as_abstract_origin
= true;
6113 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
6115 /* Prepare the data structures for the tree copy. */
6116 memset (&id
, 0, sizeof (id
));
6118 /* Generate a new name for the new version. */
6119 id
.statements_to_fold
= new hash_set
<gimple
*>;
6121 id
.decl_map
= new hash_map
<tree
, tree
>;
6122 id
.debug_map
= NULL
;
6123 id
.src_fn
= old_decl
;
6124 id
.dst_fn
= new_decl
;
6125 id
.src_node
= old_version_node
;
6126 id
.dst_node
= new_version_node
;
6127 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
6128 id
.blocks_to_copy
= blocks_to_copy
;
6130 id
.copy_decl
= copy_decl_no_change
;
6131 id
.transform_call_graph_edges
6132 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
6133 id
.transform_new_cfg
= true;
6134 id
.transform_return_to_modify
= false;
6135 id
.transform_parameter
= false;
6136 id
.transform_lang_insert_block
= NULL
;
6138 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
6139 (DECL_STRUCT_FUNCTION (old_decl
));
6140 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
6141 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
6142 initialize_cfun (new_decl
, old_decl
,
6143 new_entry
? new_entry
->count
: old_entry_block
->count
);
6144 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
6145 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
6146 = id
.src_cfun
->gimple_df
->ipa_pta
;
6148 /* Copy the function's static chain. */
6149 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
6151 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
6152 = copy_static_chain (p
, &id
);
6154 auto_vec
<int, 16> new_param_indices
;
6155 ipa_param_adjustments
*old_param_adjustments
6156 = old_version_node
->clone
.param_adjustments
;
6157 if (old_param_adjustments
)
6158 old_param_adjustments
->get_updated_indices (&new_param_indices
);
6160 /* If there's a tree_map, prepare for substitution. */
6162 for (i
= 0; i
< tree_map
->length (); i
++)
6165 replace_info
= (*tree_map
)[i
];
6167 int p
= replace_info
->parm_num
;
6168 if (old_param_adjustments
)
6169 p
= new_param_indices
[p
];
6172 tree req_type
, new_type
;
6174 for (parm
= DECL_ARGUMENTS (old_decl
); p
;
6175 parm
= DECL_CHAIN (parm
))
6177 tree old_tree
= parm
;
6178 req_type
= TREE_TYPE (parm
);
6179 new_type
= TREE_TYPE (replace_info
->new_tree
);
6180 if (!useless_type_conversion_p (req_type
, new_type
))
6182 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
6183 replace_info
->new_tree
6184 = fold_build1 (NOP_EXPR
, req_type
, replace_info
->new_tree
);
6185 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (new_type
))
6186 replace_info
->new_tree
6187 = fold_build1 (VIEW_CONVERT_EXPR
, req_type
,
6188 replace_info
->new_tree
);
6193 fprintf (dump_file
, " const ");
6194 print_generic_expr (dump_file
,
6195 replace_info
->new_tree
);
6197 " can't be converted to param ");
6198 print_generic_expr (dump_file
, parm
);
6199 fprintf (dump_file
, "\n");
6207 init
= setup_one_parameter (&id
, old_tree
, replace_info
->new_tree
,
6208 id
.src_fn
, NULL
, &vars
);
6210 init_stmts
.safe_push (init
);
6214 ipa_param_body_adjustments
*param_body_adjs
= NULL
;
6215 if (param_adjustments
)
6217 param_body_adjs
= new ipa_param_body_adjustments (param_adjustments
,
6219 &id
, &vars
, tree_map
);
6220 id
.param_body_adjs
= param_body_adjs
;
6221 DECL_ARGUMENTS (new_decl
) = param_body_adjs
->get_new_param_chain ();
6223 else if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
6224 DECL_ARGUMENTS (new_decl
)
6225 = copy_arguments_nochange (DECL_ARGUMENTS (old_decl
), &id
);
6227 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
6228 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
6230 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
6232 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
6233 /* Add local vars. */
6234 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
6236 if (DECL_RESULT (old_decl
) == NULL_TREE
)
6238 else if (param_adjustments
&& param_adjustments
->m_skip_return
6239 && !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
6241 tree resdecl_repl
= copy_result_decl_to_var (DECL_RESULT (old_decl
),
6243 declare_inline_vars (NULL
, resdecl_repl
);
6244 insert_decl_map (&id
, DECL_RESULT (old_decl
), resdecl_repl
);
6246 DECL_RESULT (new_decl
)
6247 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
6248 RESULT_DECL
, NULL_TREE
, void_type_node
);
6249 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
6250 DECL_IS_MALLOC (new_decl
) = false;
6251 cfun
->returns_struct
= 0;
6252 cfun
->returns_pcc_struct
= 0;
6257 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
6258 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
6259 if (gimple_in_ssa_p (id
.src_cfun
)
6260 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
6261 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
6263 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
6264 insert_decl_map (&id
, old_name
, new_name
);
6265 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
6266 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
6270 /* Set up the destination functions loop tree. */
6271 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
6273 cfun
->curr_properties
&= ~PROP_loops
;
6274 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
6275 cfun
->curr_properties
|= PROP_loops
;
6278 /* Copy the Function's body. */
6279 copy_body (&id
, ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
6282 /* Renumber the lexical scoping (non-code) blocks consecutively. */
6283 number_blocks (new_decl
);
6285 /* We want to create the BB unconditionally, so that the addition of
6286 debug stmts doesn't affect BB count, which may in the end cause
6287 codegen differences. */
6288 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6289 while (init_stmts
.length ())
6290 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
6291 update_clone_info (&id
);
6293 /* Remap the nonlocal_goto_save_area, if any. */
6294 if (cfun
->nonlocal_goto_save_area
)
6296 struct walk_stmt_info wi
;
6298 memset (&wi
, 0, sizeof (wi
));
6300 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
6306 delete id
.debug_map
;
6307 free_dominance_info (CDI_DOMINATORS
);
6308 free_dominance_info (CDI_POST_DOMINATORS
);
6310 update_max_bb_count ();
6311 fold_marked_statements (0, id
.statements_to_fold
);
6312 delete id
.statements_to_fold
;
6313 delete_unreachable_blocks_update_callgraph (id
.dst_node
, update_clones
);
6314 if (id
.dst_node
->definition
)
6315 cgraph_edge::rebuild_references ();
6316 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
6318 calculate_dominance_info (CDI_DOMINATORS
);
6319 fix_loop_structure (NULL
);
6321 update_ssa (TODO_update_ssa
);
6323 /* After partial cloning we need to rescale frequencies, so they are
6324 within proper range in the cloned function. */
6327 struct cgraph_edge
*e
;
6328 rebuild_frequencies ();
6330 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
6331 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
6333 basic_block bb
= gimple_bb (e
->call_stmt
);
6334 e
->count
= bb
->count
;
6336 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
6338 basic_block bb
= gimple_bb (e
->call_stmt
);
6339 e
->count
= bb
->count
;
6343 if (param_body_adjs
&& MAY_HAVE_DEBUG_BIND_STMTS
)
6345 vec
<tree
, va_gc
> **debug_args
= NULL
;
6346 unsigned int len
= 0;
6347 unsigned reset_len
= param_body_adjs
->m_reset_debug_decls
.length ();
6349 for (i
= 0; i
< reset_len
; i
++)
6351 tree parm
= param_body_adjs
->m_reset_debug_decls
[i
];
6352 gcc_assert (is_gimple_reg (parm
));
6355 if (debug_args
== NULL
)
6357 debug_args
= decl_debug_args_insert (new_decl
);
6358 len
= vec_safe_length (*debug_args
);
6360 ddecl
= make_node (DEBUG_EXPR_DECL
);
6361 DECL_ARTIFICIAL (ddecl
) = 1;
6362 TREE_TYPE (ddecl
) = TREE_TYPE (parm
);
6363 SET_DECL_MODE (ddecl
, DECL_MODE (parm
));
6364 vec_safe_push (*debug_args
, DECL_ORIGIN (parm
));
6365 vec_safe_push (*debug_args
, ddecl
);
6367 if (debug_args
!= NULL
)
6369 /* On the callee side, add
6372 stmts to the first bb where var is a VAR_DECL created for the
6373 optimized away parameter in DECL_INITIAL block. This hints
6374 in the debug info that var (whole DECL_ORIGIN is the parm
6375 PARM_DECL) is optimized away, but could be looked up at the
6376 call site as value of D#X there. */
6378 gimple_stmt_iterator cgsi
6379 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6382 i
= vec_safe_length (*debug_args
);
6386 while (var
!= NULL_TREE
6387 && DECL_ABSTRACT_ORIGIN (var
) != (**debug_args
)[i
])
6388 var
= TREE_CHAIN (var
);
6389 if (var
== NULL_TREE
)
6391 vexpr
= make_node (DEBUG_EXPR_DECL
);
6392 tree parm
= (**debug_args
)[i
];
6393 DECL_ARTIFICIAL (vexpr
) = 1;
6394 TREE_TYPE (vexpr
) = TREE_TYPE (parm
);
6395 SET_DECL_MODE (vexpr
, DECL_MODE (parm
));
6396 def_temp
= gimple_build_debug_bind (var
, vexpr
, NULL
);
6397 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6398 def_temp
= gimple_build_debug_source_bind (vexpr
, parm
, NULL
);
6399 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6404 delete param_body_adjs
;
6405 free_dominance_info (CDI_DOMINATORS
);
6406 free_dominance_info (CDI_POST_DOMINATORS
);
6408 gcc_assert (!id
.debug_stmts
.exists ());
6413 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6414 the callee and return the inlined body on success. */
6417 maybe_inline_call_in_expr (tree exp
)
6419 tree fn
= get_callee_fndecl (exp
);
6421 /* We can only try to inline "const" functions. */
6422 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
6424 call_expr_arg_iterator iter
;
6427 hash_map
<tree
, tree
> decl_map
;
6429 /* Remap the parameters. */
6430 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
6432 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
6433 decl_map
.put (param
, arg
);
6435 memset (&id
, 0, sizeof (id
));
6437 id
.dst_fn
= current_function_decl
;
6438 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6439 id
.decl_map
= &decl_map
;
6441 id
.copy_decl
= copy_decl_no_change
;
6442 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6443 id
.transform_new_cfg
= false;
6444 id
.transform_return_to_modify
= true;
6445 id
.transform_parameter
= true;
6446 id
.transform_lang_insert_block
= NULL
;
6448 /* Make sure not to unshare trees behind the front-end's back
6449 since front-end specific mechanisms may rely on sharing. */
6450 id
.regimplify
= false;
6451 id
.do_not_unshare
= true;
6453 /* We're not inside any EH region. */
6456 t
= copy_tree_body (&id
);
6458 /* We can only return something suitable for use in a GENERIC
6460 if (TREE_CODE (t
) == MODIFY_EXPR
)
6461 return TREE_OPERAND (t
, 1);
6467 /* Duplicate a type, fields and all. */
6470 build_duplicate_type (tree type
)
6472 struct copy_body_data id
;
6474 memset (&id
, 0, sizeof (id
));
6475 id
.src_fn
= current_function_decl
;
6476 id
.dst_fn
= current_function_decl
;
6478 id
.decl_map
= new hash_map
<tree
, tree
>;
6479 id
.debug_map
= NULL
;
6480 id
.copy_decl
= copy_decl_no_change
;
6482 type
= remap_type_1 (type
, &id
);
6486 delete id
.debug_map
;
6488 TYPE_CANONICAL (type
) = type
;
6493 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6494 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6498 copy_fn (tree fn
, tree
& parms
, tree
& result
)
6502 hash_map
<tree
, tree
> decl_map
;
6507 memset (&id
, 0, sizeof (id
));
6509 id
.dst_fn
= current_function_decl
;
6510 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6511 id
.decl_map
= &decl_map
;
6513 id
.copy_decl
= copy_decl_no_change
;
6514 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6515 id
.transform_new_cfg
= false;
6516 id
.transform_return_to_modify
= false;
6517 id
.transform_parameter
= true;
6518 id
.transform_lang_insert_block
= NULL
;
6520 /* Make sure not to unshare trees behind the front-end's back
6521 since front-end specific mechanisms may rely on sharing. */
6522 id
.regimplify
= false;
6523 id
.do_not_unshare
= true;
6524 id
.do_not_fold
= true;
6526 /* We're not inside any EH region. */
6529 /* Remap the parameters and result and return them to the caller. */
6530 for (param
= DECL_ARGUMENTS (fn
);
6532 param
= DECL_CHAIN (param
))
6534 *p
= remap_decl (param
, &id
);
6535 p
= &DECL_CHAIN (*p
);
6538 if (DECL_RESULT (fn
))
6539 result
= remap_decl (DECL_RESULT (fn
), &id
);
6543 return copy_tree_body (&id
);