2 Copyright (C) 2001-2021 Free Software Foundation, Inc.
3 Contributed by Alexandre Oliva <aoliva@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
30 #include "tree-pass.h"
33 #include "tree-pretty-print.h"
34 #include "diagnostic-core.h"
35 #include "gimple-predict.h"
36 #include "fold-const.h"
37 #include "stor-layout.h"
39 #include "tree-inline.h"
40 #include "langhooks.h"
42 #include "tree-iterator.h"
44 #include "gimple-fold.h"
47 #include "gimple-iterator.h"
48 #include "gimplify-me.h"
49 #include "gimple-walk.h"
51 #include "tree-into-ssa.h"
56 #include "value-prof.h"
59 #include "stringpool.h"
62 #include "tree-cfgcleanup.h"
63 #include "tree-ssa-live.h"
64 #include "alloc-pool.h"
65 #include "symbol-summary.h"
66 #include "symtab-thunks.h"
67 #include "symtab-clones.h"
69 /* I'm not real happy about this, but we need to handle gimple and
72 /* Inlining, Cloning, Versioning, Parallelization
74 Inlining: a function body is duplicated, but the PARM_DECLs are
75 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
76 MODIFY_EXPRs that store to a dedicated returned-value variable.
77 The duplicated eh_region info of the copy will later be appended
78 to the info for the caller; the eh_region info in copied throwing
79 statements and RESX statements are adjusted accordingly.
81 Cloning: (only in C++) We have one body for a con/de/structor, and
82 multiple function decls, each with a unique parameter list.
83 Duplicate the body, using the given splay tree; some parameters
84 will become constants (like 0 or 1).
86 Versioning: a function body is duplicated and the result is a new
87 function rather than into blocks of an existing function as with
88 inlining. Some parameters will become constants.
90 Parallelization: a region of a function is duplicated resulting in
91 a new function. Variables may be replaced with complex expressions
92 to enable shared variable semantics.
94 All of these will simultaneously lookup any callgraph edges. If
95 we're going to inline the duplicated function body, and the given
96 function has some cloned callgraph nodes (one for each place this
97 function will be inlined) those callgraph edges will be duplicated.
98 If we're cloning the body, those callgraph edges will be
99 updated to point into the new body. (Note that the original
100 callgraph node and edge list will not be altered.)
102 See the CALL_EXPR handling case in copy_tree_body_r (). */
106 o In order to make inlining-on-trees work, we pessimized
107 function-local static constants. In particular, they are now
108 always output, even when not addressed. Fix this by treating
109 function-local static constants just like global static
110 constants; the back-end already knows not to output them if they
113 o Provide heuristics to clamp inlining of recursive template
117 /* Weights that estimate_num_insns uses to estimate the size of the
120 eni_weights eni_size_weights
;
122 /* Weights that estimate_num_insns uses to estimate the time necessary
123 to execute the produced code. */
125 eni_weights eni_time_weights
;
129 static tree
declare_return_variable (copy_body_data
*, tree
, tree
,
131 static void remap_block (tree
*, copy_body_data
*);
132 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
133 static void declare_inline_vars (tree
, tree
);
134 static void remap_save_expr (tree
*, hash_map
<tree
, tree
> *, int *);
135 static void prepend_lexical_block (tree current_block
, tree new_block
);
136 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
137 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
138 static gimple_seq
remap_gimple_stmt (gimple
*, copy_body_data
*);
139 static void insert_init_stmt (copy_body_data
*, basic_block
, gimple
*);
141 /* Insert a tree->tree mapping for ID. Despite the name suggests
142 that the trees should be variables, it is used for more than that. */
145 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
147 id
->decl_map
->put (key
, value
);
149 /* Always insert an identity map as well. If we see this same new
150 node again, we won't want to duplicate it a second time. */
152 id
->decl_map
->put (value
, value
);
155 /* If nonzero, we're remapping the contents of inlined debug
156 statements. If negative, an error has occurred, such as a
157 reference to a variable that isn't available in the inlined
159 static int processing_debug_stmt
= 0;
161 /* Construct new SSA name for old NAME. ID is the inline context. */
164 remap_ssa_name (tree name
, copy_body_data
*id
)
169 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
171 n
= id
->decl_map
->get (name
);
174 /* WHen we perform edge redirection as part of CFG copy, IPA-SRA can
175 remove an unused LHS from a call statement. Such LHS can however
176 still appear in debug statements, but their value is lost in this
177 function and we do not want to map them. */
178 if (id
->killed_new_ssa_names
179 && id
->killed_new_ssa_names
->contains (*n
))
181 gcc_assert (processing_debug_stmt
);
182 processing_debug_stmt
= -1;
186 return unshare_expr (*n
);
189 if (processing_debug_stmt
)
191 if (SSA_NAME_IS_DEFAULT_DEF (name
)
192 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
193 && id
->entry_bb
== NULL
194 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
196 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
198 gimple_stmt_iterator gsi
;
199 tree val
= SSA_NAME_VAR (name
);
201 n
= id
->decl_map
->get (val
);
204 if (TREE_CODE (val
) != PARM_DECL
205 && !(VAR_P (val
) && DECL_ABSTRACT_ORIGIN (val
)))
207 processing_debug_stmt
= -1;
210 n
= id
->decl_map
->get (val
);
211 if (n
&& TREE_CODE (*n
) == DEBUG_EXPR_DECL
)
213 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
214 DECL_ARTIFICIAL (vexpr
) = 1;
215 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
216 SET_DECL_MODE (vexpr
, DECL_MODE (SSA_NAME_VAR (name
)));
217 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
218 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
219 insert_decl_map (id
, val
, vexpr
);
223 processing_debug_stmt
= -1;
227 /* Remap anonymous SSA names or SSA names of anonymous decls. */
228 var
= SSA_NAME_VAR (name
);
230 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
232 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
233 && DECL_ARTIFICIAL (var
)
234 && DECL_IGNORED_P (var
)
235 && !DECL_NAME (var
)))
237 struct ptr_info_def
*pi
;
238 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
));
239 if (!var
&& SSA_NAME_IDENTIFIER (name
))
240 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
241 insert_decl_map (id
, name
, new_tree
);
242 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
243 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
244 /* At least IPA points-to info can be directly transferred. */
245 if (id
->src_cfun
->gimple_df
246 && id
->src_cfun
->gimple_df
->ipa_pta
247 && POINTER_TYPE_P (TREE_TYPE (name
))
248 && (pi
= SSA_NAME_PTR_INFO (name
))
251 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
254 /* So can range-info. */
255 if (!POINTER_TYPE_P (TREE_TYPE (name
))
256 && SSA_NAME_RANGE_INFO (name
))
257 duplicate_ssa_name_range_info (new_tree
, SSA_NAME_RANGE_TYPE (name
),
258 SSA_NAME_RANGE_INFO (name
));
262 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
264 new_tree
= remap_decl (var
, id
);
266 /* We might've substituted constant or another SSA_NAME for
269 Replace the SSA name representing RESULT_DECL by variable during
270 inlining: this saves us from need to introduce PHI node in a case
271 return value is just partly initialized. */
272 if ((VAR_P (new_tree
) || TREE_CODE (new_tree
) == PARM_DECL
)
273 && (!SSA_NAME_VAR (name
)
274 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
275 || !id
->transform_return_to_modify
))
277 struct ptr_info_def
*pi
;
278 new_tree
= make_ssa_name (new_tree
);
279 insert_decl_map (id
, name
, new_tree
);
280 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
281 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
282 /* At least IPA points-to info can be directly transferred. */
283 if (id
->src_cfun
->gimple_df
284 && id
->src_cfun
->gimple_df
->ipa_pta
285 && POINTER_TYPE_P (TREE_TYPE (name
))
286 && (pi
= SSA_NAME_PTR_INFO (name
))
289 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
292 /* So can range-info. */
293 if (!POINTER_TYPE_P (TREE_TYPE (name
))
294 && SSA_NAME_RANGE_INFO (name
))
295 duplicate_ssa_name_range_info (new_tree
, SSA_NAME_RANGE_TYPE (name
),
296 SSA_NAME_RANGE_INFO (name
));
297 if (SSA_NAME_IS_DEFAULT_DEF (name
))
299 /* By inlining function having uninitialized variable, we might
300 extend the lifetime (variable might get reused). This cause
301 ICE in the case we end up extending lifetime of SSA name across
302 abnormal edge, but also increase register pressure.
304 We simply initialize all uninitialized vars by 0 except
305 for case we are inlining to very first BB. We can avoid
306 this for all BBs that are not inside strongly connected
307 regions of the CFG, but this is expensive to test. */
309 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
310 && (!SSA_NAME_VAR (name
)
311 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
312 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
314 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
316 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
318 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
320 init_stmt
= gimple_build_assign (new_tree
, zero
);
321 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
322 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
326 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
327 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
332 insert_decl_map (id
, name
, new_tree
);
336 /* Remap DECL during the copying of the BLOCK tree for the function. */
339 remap_decl (tree decl
, copy_body_data
*id
)
343 /* We only remap local variables in the current function. */
345 /* See if we have remapped this declaration. */
347 n
= id
->decl_map
->get (decl
);
349 if (!n
&& processing_debug_stmt
)
351 processing_debug_stmt
= -1;
355 /* When remapping a type within copy_gimple_seq_and_replace_locals, all
356 necessary DECLs have already been remapped and we do not want to duplicate
357 a decl coming from outside of the sequence we are copying. */
359 && id
->prevent_decl_creation_for_types
360 && id
->remapping_type_depth
> 0
361 && (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
))
364 /* If we didn't already have an equivalent for this declaration, create one
368 /* Make a copy of the variable or label. */
369 tree t
= id
->copy_decl (decl
, id
);
371 /* Remember it, so that if we encounter this local entity again
372 we can reuse this copy. Do this early because remap_type may
373 need this decl for TYPE_STUB_DECL. */
374 insert_decl_map (id
, decl
, t
);
379 /* Remap types, if necessary. */
380 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
381 if (TREE_CODE (t
) == TYPE_DECL
)
383 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
385 /* Preserve the invariant that DECL_ORIGINAL_TYPE != TREE_TYPE,
386 which is enforced in gen_typedef_die when DECL_ABSTRACT_ORIGIN
387 is not set on the TYPE_DECL, for example in LTO mode. */
388 if (DECL_ORIGINAL_TYPE (t
) == TREE_TYPE (t
))
390 tree x
= build_variant_type_copy (TREE_TYPE (t
));
391 TYPE_STUB_DECL (x
) = TYPE_STUB_DECL (TREE_TYPE (t
));
392 TYPE_NAME (x
) = TYPE_NAME (TREE_TYPE (t
));
393 DECL_ORIGINAL_TYPE (t
) = x
;
397 /* Remap sizes as necessary. */
398 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
399 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
401 /* If fields, do likewise for offset and qualifier. */
402 if (TREE_CODE (t
) == FIELD_DECL
)
404 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
405 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
406 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
412 if (id
->do_not_unshare
)
415 return unshare_expr (*n
);
419 remap_type_1 (tree type
, copy_body_data
*id
)
423 /* We do need a copy. build and register it now. If this is a pointer or
424 reference type, remap the designated type and make a new pointer or
426 if (TREE_CODE (type
) == POINTER_TYPE
)
428 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
430 TYPE_REF_CAN_ALIAS_ALL (type
));
431 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
432 new_tree
= build_type_attribute_qual_variant (new_tree
,
433 TYPE_ATTRIBUTES (type
),
435 insert_decl_map (id
, type
, new_tree
);
438 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
440 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
442 TYPE_REF_CAN_ALIAS_ALL (type
));
443 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
444 new_tree
= build_type_attribute_qual_variant (new_tree
,
445 TYPE_ATTRIBUTES (type
),
447 insert_decl_map (id
, type
, new_tree
);
451 new_tree
= copy_node (type
);
453 insert_decl_map (id
, type
, new_tree
);
455 /* This is a new type, not a copy of an old type. Need to reassociate
456 variants. We can handle everything except the main variant lazily. */
457 t
= TYPE_MAIN_VARIANT (type
);
460 t
= remap_type (t
, id
);
461 TYPE_MAIN_VARIANT (new_tree
) = t
;
462 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
463 TYPE_NEXT_VARIANT (t
) = new_tree
;
467 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
468 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
471 if (TYPE_STUB_DECL (type
))
472 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
474 /* Lazily create pointer and reference types. */
475 TYPE_POINTER_TO (new_tree
) = NULL
;
476 TYPE_REFERENCE_TO (new_tree
) = NULL
;
478 /* Copy all types that may contain references to local variables; be sure to
479 preserve sharing in between type and its main variant when possible. */
480 switch (TREE_CODE (new_tree
))
484 case FIXED_POINT_TYPE
:
487 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
489 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
490 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
492 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
493 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
497 t
= TYPE_MIN_VALUE (new_tree
);
498 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
499 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
501 t
= TYPE_MAX_VALUE (new_tree
);
502 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
503 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
508 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
509 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
510 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
512 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
513 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
514 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
515 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
517 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
521 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
522 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
523 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
525 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
527 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
529 gcc_checking_assert (TYPE_DOMAIN (type
)
530 == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
531 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
535 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
536 /* For array bounds where we have decided not to copy over the bounds
537 variable which isn't used in OpenMP/OpenACC region, change them to
538 an uninitialized VAR_DECL temporary. */
539 if (id
->adjust_array_error_bounds
540 && TYPE_DOMAIN (new_tree
)
541 && TYPE_MAX_VALUE (TYPE_DOMAIN (new_tree
)) == error_mark_node
542 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) != error_mark_node
)
544 tree v
= create_tmp_var (TREE_TYPE (TYPE_DOMAIN (new_tree
)));
546 = tree_cons (get_identifier ("omp dummy var"), NULL_TREE
,
547 DECL_ATTRIBUTES (v
));
548 TYPE_MAX_VALUE (TYPE_DOMAIN (new_tree
)) = v
;
555 case QUAL_UNION_TYPE
:
556 if (TYPE_MAIN_VARIANT (type
) != type
557 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
558 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
563 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
565 t
= remap_decl (f
, id
);
566 DECL_CONTEXT (t
) = new_tree
;
570 TYPE_FIELDS (new_tree
) = nreverse (nf
);
576 /* Shouldn't have been thought variable sized. */
580 /* All variants of type share the same size, so use the already remaped data. */
581 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
583 tree s
= TYPE_SIZE (type
);
584 tree mvs
= TYPE_SIZE (TYPE_MAIN_VARIANT (type
));
585 tree su
= TYPE_SIZE_UNIT (type
);
586 tree mvsu
= TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
));
587 gcc_checking_assert ((TREE_CODE (s
) == PLACEHOLDER_EXPR
588 && (TREE_CODE (mvs
) == PLACEHOLDER_EXPR
))
590 gcc_checking_assert ((TREE_CODE (su
) == PLACEHOLDER_EXPR
591 && (TREE_CODE (mvsu
) == PLACEHOLDER_EXPR
))
593 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
594 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
598 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
599 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
605 /* Helper function for remap_type_2, called through walk_tree. */
608 remap_type_3 (tree
*tp
, int *walk_subtrees
, void *data
)
610 copy_body_data
*id
= (copy_body_data
*) data
;
615 else if (DECL_P (*tp
) && remap_decl (*tp
, id
) != *tp
)
621 /* Return true if TYPE needs to be remapped because remap_decl on any
622 needed embedded decl returns something other than that decl. */
625 remap_type_2 (tree type
, copy_body_data
*id
)
629 #define RETURN_TRUE_IF_VAR(T) \
635 if (DECL_P (_t) && remap_decl (_t, id) != _t) \
637 if (!TYPE_SIZES_GIMPLIFIED (type) \
638 && walk_tree (&_t, remap_type_3, id, NULL)) \
644 switch (TREE_CODE (type
))
650 return remap_type_2 (TREE_TYPE (type
), id
);
654 case FIXED_POINT_TYPE
:
657 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
658 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
662 if (remap_type_2 (TREE_TYPE (type
), id
)
663 || (TYPE_DOMAIN (type
) && remap_type_2 (TYPE_DOMAIN (type
), id
)))
669 case QUAL_UNION_TYPE
:
670 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
671 if (TREE_CODE (t
) == FIELD_DECL
)
673 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
674 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
675 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
676 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
677 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
685 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
686 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
688 #undef RETURN_TRUE_IF_VAR
692 remap_type (tree type
, copy_body_data
*id
)
700 /* See if we have remapped this type. */
701 node
= id
->decl_map
->get (type
);
705 /* The type only needs remapping if it's variably modified. */
706 if (! variably_modified_type_p (type
, id
->src_fn
)
707 /* Don't remap if copy_decl method doesn't always return a new
708 decl and for all embedded decls returns the passed in decl. */
709 || (id
->dont_remap_vla_if_no_change
&& !remap_type_2 (type
, id
)))
711 insert_decl_map (id
, type
, type
);
715 id
->remapping_type_depth
++;
716 tmp
= remap_type_1 (type
, id
);
717 id
->remapping_type_depth
--;
722 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
725 can_be_nonlocal (tree decl
, copy_body_data
*id
)
727 /* We cannot duplicate function decls. */
728 if (TREE_CODE (decl
) == FUNCTION_DECL
)
731 /* Local static vars must be non-local or we get multiple declaration
733 if (VAR_P (decl
) && !auto_var_in_fn_p (decl
, id
->src_fn
))
740 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
744 tree new_decls
= NULL_TREE
;
746 /* Remap its variables. */
747 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
751 if (can_be_nonlocal (old_var
, id
))
753 /* We need to add this variable to the local decls as otherwise
754 nothing else will do so. */
755 if (VAR_P (old_var
) && ! DECL_EXTERNAL (old_var
) && cfun
)
756 add_local_decl (cfun
, old_var
);
757 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
758 && !DECL_IGNORED_P (old_var
)
759 && nonlocalized_list
)
760 vec_safe_push (*nonlocalized_list
, old_var
);
764 /* Remap the variable. */
765 new_var
= remap_decl (old_var
, id
);
767 /* If we didn't remap this variable, we can't mess with its
768 TREE_CHAIN. If we remapped this variable to the return slot, it's
769 already declared somewhere else, so don't declare it here. */
771 if (new_var
== id
->retvar
)
775 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
776 && !DECL_IGNORED_P (old_var
)
777 && nonlocalized_list
)
778 vec_safe_push (*nonlocalized_list
, old_var
);
782 gcc_assert (DECL_P (new_var
));
783 DECL_CHAIN (new_var
) = new_decls
;
786 /* Also copy value-expressions. */
787 if (VAR_P (new_var
) && DECL_HAS_VALUE_EXPR_P (new_var
))
789 tree tem
= DECL_VALUE_EXPR (new_var
);
790 bool old_regimplify
= id
->regimplify
;
791 id
->remapping_type_depth
++;
792 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
793 id
->remapping_type_depth
--;
794 id
->regimplify
= old_regimplify
;
795 SET_DECL_VALUE_EXPR (new_var
, tem
);
800 return nreverse (new_decls
);
803 /* Copy the BLOCK to contain remapped versions of the variables
804 therein. And hook the new block into the block-tree. */
807 remap_block (tree
*block
, copy_body_data
*id
)
812 /* Make the new block. */
814 new_block
= make_node (BLOCK
);
815 TREE_USED (new_block
) = TREE_USED (old_block
);
816 BLOCK_ABSTRACT_ORIGIN (new_block
) = BLOCK_ORIGIN (old_block
);
817 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
818 BLOCK_NONLOCALIZED_VARS (new_block
)
819 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
822 /* Remap its variables. */
823 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
824 &BLOCK_NONLOCALIZED_VARS (new_block
),
827 if (id
->transform_lang_insert_block
)
828 id
->transform_lang_insert_block (new_block
);
830 /* Remember the remapped block. */
831 insert_decl_map (id
, old_block
, new_block
);
834 /* Copy the whole block tree and root it in id->block. */
837 remap_blocks (tree block
, copy_body_data
*id
)
840 tree new_tree
= block
;
845 remap_block (&new_tree
, id
);
846 gcc_assert (new_tree
!= block
);
847 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
848 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
849 /* Blocks are in arbitrary order, but make things slightly prettier and do
850 not swap order when producing a copy. */
851 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
855 /* Remap the block tree rooted at BLOCK to nothing. */
858 remap_blocks_to_null (tree block
, copy_body_data
*id
)
861 insert_decl_map (id
, block
, NULL_TREE
);
862 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
863 remap_blocks_to_null (t
, id
);
866 /* Remap the location info pointed to by LOCUS. */
869 remap_location (location_t locus
, copy_body_data
*id
)
871 if (LOCATION_BLOCK (locus
))
873 tree
*n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
876 return set_block (locus
, *n
);
879 locus
= LOCATION_LOCUS (locus
);
881 if (locus
!= UNKNOWN_LOCATION
&& id
->block
)
882 return set_block (locus
, id
->block
);
888 copy_statement_list (tree
*tp
)
890 tree_stmt_iterator oi
, ni
;
893 new_tree
= alloc_stmt_list ();
894 ni
= tsi_start (new_tree
);
895 oi
= tsi_start (*tp
);
896 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
899 for (; !tsi_end_p (oi
); tsi_next (&oi
))
901 tree stmt
= tsi_stmt (oi
);
902 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
903 /* This copy is not redundant; tsi_link_after will smash this
904 STATEMENT_LIST into the end of the one we're building, and we
905 don't want to do that with the original. */
906 copy_statement_list (&stmt
);
907 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
912 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
914 tree block
= BIND_EXPR_BLOCK (*tp
);
915 /* Copy (and replace) the statement. */
916 copy_tree_r (tp
, walk_subtrees
, NULL
);
919 remap_block (&block
, id
);
920 BIND_EXPR_BLOCK (*tp
) = block
;
923 if (BIND_EXPR_VARS (*tp
))
924 /* This will remap a lot of the same decls again, but this should be
926 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
930 /* Create a new gimple_seq by remapping all the statements in BODY
931 using the inlining information in ID. */
934 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
936 gimple_stmt_iterator si
;
937 gimple_seq new_body
= NULL
;
939 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
941 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
942 gimple_seq_add_seq (&new_body
, new_stmts
);
949 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
950 block using the mapping information in ID. */
953 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
956 tree new_block
, new_vars
;
957 gimple_seq body
, new_body
;
959 /* Copy the statement. Note that we purposely don't use copy_stmt
960 here because we need to remap statements as we copy. */
961 body
= gimple_bind_body (stmt
);
962 new_body
= remap_gimple_seq (body
, id
);
964 new_block
= gimple_bind_block (stmt
);
966 remap_block (&new_block
, id
);
968 /* This will remap a lot of the same decls again, but this should be
970 new_vars
= gimple_bind_vars (stmt
);
972 new_vars
= remap_decls (new_vars
, NULL
, id
);
974 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
979 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
984 if (TREE_CODE (decl
) == SSA_NAME
)
986 decl
= SSA_NAME_VAR (decl
);
991 return (TREE_CODE (decl
) == PARM_DECL
);
994 /* Remap the dependence CLIQUE from the source to the destination function
995 as specified in ID. */
997 static unsigned short
998 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
1000 if (clique
== 0 || processing_debug_stmt
)
1002 if (!id
->dependence_map
)
1003 id
->dependence_map
= new hash_map
<dependence_hash
, unsigned short>;
1005 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
1008 /* Clique 1 is reserved for local ones set by PTA. */
1009 if (cfun
->last_clique
== 0)
1010 cfun
->last_clique
= 1;
1011 newc
= ++cfun
->last_clique
;
1016 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
1017 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
1018 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
1019 recursing into the children nodes of *TP. */
1022 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
1024 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
1025 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
1026 tree fn
= id
->src_fn
;
1028 /* For recursive invocations this is no longer the LHS itself. */
1029 bool is_lhs
= wi_p
->is_lhs
;
1030 wi_p
->is_lhs
= false;
1032 if (TREE_CODE (*tp
) == SSA_NAME
)
1034 *tp
= remap_ssa_name (*tp
, id
);
1037 SSA_NAME_DEF_STMT (*tp
) = wi_p
->stmt
;
1040 else if (auto_var_in_fn_p (*tp
, fn
))
1042 /* Local variables and labels need to be replaced by equivalent
1043 variables. We don't want to copy static variables; there's
1044 only one of those, no matter how many times we inline the
1045 containing function. Similarly for globals from an outer
1049 /* Remap the declaration. */
1050 new_decl
= remap_decl (*tp
, id
);
1051 gcc_assert (new_decl
);
1052 /* Replace this variable with the copy. */
1053 STRIP_TYPE_NOPS (new_decl
);
1054 /* ??? The C++ frontend uses void * pointer zero to initialize
1055 any other type. This confuses the middle-end type verification.
1056 As cloned bodies do not go through gimplification again the fixup
1057 there doesn't trigger. */
1058 if (TREE_CODE (new_decl
) == INTEGER_CST
1059 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
1060 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
1064 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1066 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
1068 else if (TREE_CODE (*tp
) == LABEL_DECL
1069 && (!DECL_CONTEXT (*tp
)
1070 || decl_function_context (*tp
) == id
->src_fn
))
1071 /* These may need to be remapped for EH handling. */
1072 *tp
= remap_decl (*tp
, id
);
1073 else if (TREE_CODE (*tp
) == FIELD_DECL
)
1075 /* If the enclosing record type is variably_modified_type_p, the field
1076 has already been remapped. Otherwise, it need not be. */
1077 tree
*n
= id
->decl_map
->get (*tp
);
1082 else if (TYPE_P (*tp
))
1083 /* Types may need remapping as well. */
1084 *tp
= remap_type (*tp
, id
);
1085 else if (CONSTANT_CLASS_P (*tp
))
1087 /* If this is a constant, we have to copy the node iff the type
1088 will be remapped. copy_tree_r will not copy a constant. */
1089 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1091 if (new_type
== TREE_TYPE (*tp
))
1094 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1095 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1098 *tp
= copy_node (*tp
);
1099 TREE_TYPE (*tp
) = new_type
;
1104 /* Otherwise, just copy the node. Note that copy_tree_r already
1105 knows not to copy VAR_DECLs, etc., so this is safe. */
1107 if (TREE_CODE (*tp
) == MEM_REF
&& !id
->do_not_fold
)
1109 /* We need to re-canonicalize MEM_REFs from inline substitutions
1110 that can happen when a pointer argument is an ADDR_EXPR.
1111 Recurse here manually to allow that. */
1112 tree ptr
= TREE_OPERAND (*tp
, 0);
1113 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1115 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
1116 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1117 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1118 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1119 copy_warning (*tp
, old
);
1120 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1122 MR_DEPENDENCE_CLIQUE (*tp
)
1123 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1124 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1126 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1127 remapped a parameter as the property might be valid only
1128 for the parameter itself. */
1129 if (TREE_THIS_NOTRAP (old
)
1130 && (!is_parm (TREE_OPERAND (old
, 0))
1131 || (!id
->transform_parameter
&& is_parm (ptr
))))
1132 TREE_THIS_NOTRAP (*tp
) = 1;
1133 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1138 /* Here is the "usual case". Copy this tree node, and then
1139 tweak some special cases. */
1140 copy_tree_r (tp
, walk_subtrees
, NULL
);
1142 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1143 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1145 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1147 /* The copied TARGET_EXPR has never been expanded, even if the
1148 original node was expanded already. */
1149 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1150 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1152 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1154 /* Variable substitution need not be simple. In particular,
1155 the MEM_REF substitution above. Make sure that
1156 TREE_CONSTANT and friends are up-to-date. */
1157 int invariant
= is_gimple_min_invariant (*tp
);
1158 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
1159 recompute_tree_invariant_for_addr_expr (*tp
);
1161 /* If this used to be invariant, but is not any longer,
1162 then regimplification is probably needed. */
1163 if (invariant
&& !is_gimple_min_invariant (*tp
))
1164 id
->regimplify
= true;
1170 /* Update the TREE_BLOCK for the cloned expr. */
1173 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1174 tree old_block
= TREE_BLOCK (*tp
);
1178 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1182 TREE_SET_BLOCK (*tp
, new_block
);
1185 /* Keep iterating. */
1190 /* Called from copy_body_id via walk_tree. DATA is really a
1191 `copy_body_data *'. */
1194 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1196 copy_body_data
*id
= (copy_body_data
*) data
;
1197 tree fn
= id
->src_fn
;
1200 /* Begin by recognizing trees that we'll completely rewrite for the
1201 inlining context. Our output for these trees is completely
1202 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1203 into an edge). Further down, we'll handle trees that get
1204 duplicated and/or tweaked. */
1206 /* When requested, RETURN_EXPRs should be transformed to just the
1207 contained MODIFY_EXPR. The branch semantics of the return will
1208 be handled elsewhere by manipulating the CFG rather than a statement. */
1209 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1211 tree assignment
= TREE_OPERAND (*tp
, 0);
1213 /* If we're returning something, just turn that into an
1214 assignment into the equivalent of the original RESULT_DECL.
1215 If the "assignment" is just the result decl, the result
1216 decl has already been set (e.g. a recent "foo (&result_decl,
1217 ...)"); just toss the entire RETURN_EXPR. */
1218 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1220 /* Replace the RETURN_EXPR with (a copy of) the
1221 MODIFY_EXPR hanging underneath. */
1222 *tp
= copy_node (assignment
);
1224 else /* Else the RETURN_EXPR returns no value. */
1227 return (tree
) (void *)1;
1230 else if (TREE_CODE (*tp
) == SSA_NAME
)
1232 *tp
= remap_ssa_name (*tp
, id
);
1237 /* Local variables and labels need to be replaced by equivalent
1238 variables. We don't want to copy static variables; there's only
1239 one of those, no matter how many times we inline the containing
1240 function. Similarly for globals from an outer function. */
1241 else if (auto_var_in_fn_p (*tp
, fn
))
1245 /* Remap the declaration. */
1246 new_decl
= remap_decl (*tp
, id
);
1247 gcc_assert (new_decl
);
1248 /* Replace this variable with the copy. */
1249 STRIP_TYPE_NOPS (new_decl
);
1253 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1254 copy_statement_list (tp
);
1255 else if (TREE_CODE (*tp
) == SAVE_EXPR
1256 || TREE_CODE (*tp
) == TARGET_EXPR
)
1257 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1258 else if (TREE_CODE (*tp
) == LABEL_DECL
1259 && (! DECL_CONTEXT (*tp
)
1260 || decl_function_context (*tp
) == id
->src_fn
))
1261 /* These may need to be remapped for EH handling. */
1262 *tp
= remap_decl (*tp
, id
);
1263 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1264 copy_bind_expr (tp
, walk_subtrees
, id
);
1265 /* Types may need remapping as well. */
1266 else if (TYPE_P (*tp
))
1267 *tp
= remap_type (*tp
, id
);
1269 /* If this is a constant, we have to copy the node iff the type will be
1270 remapped. copy_tree_r will not copy a constant. */
1271 else if (CONSTANT_CLASS_P (*tp
))
1273 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1275 if (new_type
== TREE_TYPE (*tp
))
1278 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1279 *tp
= wide_int_to_tree (new_type
, wi::to_wide (*tp
));
1282 *tp
= copy_node (*tp
);
1283 TREE_TYPE (*tp
) = new_type
;
1287 /* Otherwise, just copy the node. Note that copy_tree_r already
1288 knows not to copy VAR_DECLs, etc., so this is safe. */
1291 /* Here we handle trees that are not completely rewritten.
1292 First we detect some inlining-induced bogosities for
1294 if (TREE_CODE (*tp
) == MODIFY_EXPR
1295 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1296 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1298 /* Some assignments VAR = VAR; don't generate any rtl code
1299 and thus don't count as variable modification. Avoid
1300 keeping bogosities like 0 = 0. */
1301 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1304 n
= id
->decl_map
->get (decl
);
1308 STRIP_TYPE_NOPS (value
);
1309 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1311 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1312 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1316 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1318 /* Get rid of *& from inline substitutions that can happen when a
1319 pointer argument is an ADDR_EXPR. */
1320 tree decl
= TREE_OPERAND (*tp
, 0);
1321 tree
*n
= id
->decl_map
->get (decl
);
1324 /* If we happen to get an ADDR_EXPR in n->value, strip
1325 it manually here as we'll eventually get ADDR_EXPRs
1326 which lie about their types pointed to. In this case
1327 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1328 but we absolutely rely on that. As fold_indirect_ref
1329 does other useful transformations, try that first, though. */
1330 tree type
= TREE_TYPE (*tp
);
1331 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1333 *tp
= id
->do_not_fold
? NULL
: gimple_fold_indirect_ref (ptr
);
1336 type
= remap_type (type
, id
);
1337 if (TREE_CODE (ptr
) == ADDR_EXPR
&& !id
->do_not_fold
)
1340 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1341 /* ??? We should either assert here or build
1342 a VIEW_CONVERT_EXPR instead of blindly leaking
1343 incompatible types to our IL. */
1345 *tp
= TREE_OPERAND (ptr
, 0);
1349 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1350 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1351 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1352 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1353 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1354 have remapped a parameter as the property might be
1355 valid only for the parameter itself. */
1356 if (TREE_THIS_NOTRAP (old
)
1357 && (!is_parm (TREE_OPERAND (old
, 0))
1358 || (!id
->transform_parameter
&& is_parm (ptr
))))
1359 TREE_THIS_NOTRAP (*tp
) = 1;
1366 else if (TREE_CODE (*tp
) == MEM_REF
&& !id
->do_not_fold
)
1368 /* We need to re-canonicalize MEM_REFs from inline substitutions
1369 that can happen when a pointer argument is an ADDR_EXPR.
1370 Recurse here manually to allow that. */
1371 tree ptr
= TREE_OPERAND (*tp
, 0);
1372 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1374 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1375 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1376 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1377 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1378 copy_warning (*tp
, old
);
1379 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1381 MR_DEPENDENCE_CLIQUE (*tp
)
1382 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1383 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1385 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1386 remapped a parameter as the property might be valid only
1387 for the parameter itself. */
1388 if (TREE_THIS_NOTRAP (old
)
1389 && (!is_parm (TREE_OPERAND (old
, 0))
1390 || (!id
->transform_parameter
&& is_parm (ptr
))))
1391 TREE_THIS_NOTRAP (*tp
) = 1;
1392 REF_REVERSE_STORAGE_ORDER (*tp
) = REF_REVERSE_STORAGE_ORDER (old
);
1397 /* Here is the "usual case". Copy this tree node, and then
1398 tweak some special cases. */
1399 copy_tree_r (tp
, walk_subtrees
, NULL
);
1401 /* If EXPR has block defined, map it to newly constructed block.
1402 When inlining we want EXPRs without block appear in the block
1403 of function call if we are not remapping a type. */
1406 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1407 if (TREE_BLOCK (*tp
))
1410 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1414 TREE_SET_BLOCK (*tp
, new_block
);
1417 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1418 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1420 /* The copied TARGET_EXPR has never been expanded, even if the
1421 original node was expanded already. */
1422 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1424 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1425 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1428 /* Variable substitution need not be simple. In particular, the
1429 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1430 and friends are up-to-date. */
1431 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1433 int invariant
= is_gimple_min_invariant (*tp
);
1434 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1436 /* Handle the case where we substituted an INDIRECT_REF
1437 into the operand of the ADDR_EXPR. */
1438 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
1439 && !id
->do_not_fold
)
1441 tree t
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1442 if (TREE_TYPE (t
) != TREE_TYPE (*tp
))
1443 t
= fold_convert (remap_type (TREE_TYPE (*tp
), id
), t
);
1447 recompute_tree_invariant_for_addr_expr (*tp
);
1449 /* If this used to be invariant, but is not any longer,
1450 then regimplification is probably needed. */
1451 if (invariant
&& !is_gimple_min_invariant (*tp
))
1452 id
->regimplify
= true;
1456 else if (TREE_CODE (*tp
) == OMP_CLAUSE
1457 && (OMP_CLAUSE_CODE (*tp
) == OMP_CLAUSE_AFFINITY
1458 || OMP_CLAUSE_CODE (*tp
) == OMP_CLAUSE_DEPEND
))
1460 tree t
= OMP_CLAUSE_DECL (*tp
);
1462 && TREE_CODE (t
) == TREE_LIST
1464 && TREE_CODE (TREE_PURPOSE (t
)) == TREE_VEC
)
1467 OMP_CLAUSE_DECL (*tp
) = copy_node (t
);
1468 t
= OMP_CLAUSE_DECL (*tp
);
1469 TREE_PURPOSE (t
) = copy_node (TREE_PURPOSE (t
));
1470 for (int i
= 0; i
<= 4; i
++)
1471 walk_tree (&TREE_VEC_ELT (TREE_PURPOSE (t
), i
),
1472 copy_tree_body_r
, id
, NULL
);
1473 if (TREE_VEC_ELT (TREE_PURPOSE (t
), 5))
1474 remap_block (&TREE_VEC_ELT (TREE_PURPOSE (t
), 5), id
);
1475 walk_tree (&TREE_VALUE (t
), copy_tree_body_r
, id
, NULL
);
1480 /* Keep iterating. */
1484 /* Helper for remap_gimple_stmt. Given an EH region number for the
1485 source function, map that to the duplicate EH region number in
1486 the destination function. */
1489 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1491 eh_region old_r
, new_r
;
1493 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1494 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1496 return new_r
->index
;
1499 /* Similar, but operate on INTEGER_CSTs. */
1502 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1506 old_nr
= tree_to_shwi (old_t_nr
);
1507 new_nr
= remap_eh_region_nr (old_nr
, id
);
1509 return build_int_cst (integer_type_node
, new_nr
);
1512 /* Helper for copy_bb. Remap statement STMT using the inlining
1513 information in ID. Return the new statement copy. */
1516 remap_gimple_stmt (gimple
*stmt
, copy_body_data
*id
)
1518 gimple
*copy
= NULL
;
1519 struct walk_stmt_info wi
;
1520 bool skip_first
= false;
1521 gimple_seq stmts
= NULL
;
1523 if (is_gimple_debug (stmt
)
1524 && (gimple_debug_nonbind_marker_p (stmt
)
1525 ? !DECL_STRUCT_FUNCTION (id
->dst_fn
)->debug_nonbind_markers
1526 : !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
)))
1529 if (!is_gimple_debug (stmt
)
1530 && id
->param_body_adjs
1531 && id
->param_body_adjs
->m_dead_stmts
.contains (stmt
))
1534 /* Begin by recognizing trees that we'll completely rewrite for the
1535 inlining context. Our output for these trees is completely
1536 different from our input (e.g. RETURN_EXPR is deleted and morphs
1537 into an edge). Further down, we'll handle trees that get
1538 duplicated and/or tweaked. */
1540 /* When requested, GIMPLE_RETURN should be transformed to just the
1541 contained GIMPLE_ASSIGN. The branch semantics of the return will
1542 be handled elsewhere by manipulating the CFG rather than the
1544 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1546 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1548 /* If we're returning something, just turn that into an
1549 assignment to the equivalent of the original RESULT_DECL.
1550 If RETVAL is just the result decl, the result decl has
1551 already been set (e.g. a recent "foo (&result_decl, ...)");
1552 just toss the entire GIMPLE_RETURN. Likewise for when the
1553 call doesn't want the return value. */
1555 && (TREE_CODE (retval
) != RESULT_DECL
1557 || gimple_call_lhs (id
->call_stmt
) != NULL_TREE
)
1558 && (TREE_CODE (retval
) != SSA_NAME
1559 || ! SSA_NAME_VAR (retval
)
1560 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1562 copy
= gimple_build_assign (id
->do_not_unshare
1563 ? id
->retvar
: unshare_expr (id
->retvar
),
1565 /* id->retvar is already substituted. Skip it on later remapping. */
1571 else if (gimple_has_substatements (stmt
))
1575 /* When cloning bodies from the C++ front end, we will be handed bodies
1576 in High GIMPLE form. Handle here all the High GIMPLE statements that
1577 have embedded statements. */
1578 switch (gimple_code (stmt
))
1581 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1586 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1587 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1588 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1592 case GIMPLE_EH_FILTER
:
1593 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1594 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1598 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1599 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1600 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1603 case GIMPLE_WITH_CLEANUP_EXPR
:
1604 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1605 copy
= gimple_build_wce (s1
);
1608 case GIMPLE_OMP_PARALLEL
:
1610 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1611 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1612 copy
= gimple_build_omp_parallel
1614 gimple_omp_parallel_clauses (omp_par_stmt
),
1615 gimple_omp_parallel_child_fn (omp_par_stmt
),
1616 gimple_omp_parallel_data_arg (omp_par_stmt
));
1620 case GIMPLE_OMP_TASK
:
1621 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1622 copy
= gimple_build_omp_task
1624 gimple_omp_task_clauses (stmt
),
1625 gimple_omp_task_child_fn (stmt
),
1626 gimple_omp_task_data_arg (stmt
),
1627 gimple_omp_task_copy_fn (stmt
),
1628 gimple_omp_task_arg_size (stmt
),
1629 gimple_omp_task_arg_align (stmt
));
1632 case GIMPLE_OMP_FOR
:
1633 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1634 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1635 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1636 gimple_omp_for_clauses (stmt
),
1637 gimple_omp_for_collapse (stmt
), s2
);
1640 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1642 gimple_omp_for_set_index (copy
, i
,
1643 gimple_omp_for_index (stmt
, i
));
1644 gimple_omp_for_set_initial (copy
, i
,
1645 gimple_omp_for_initial (stmt
, i
));
1646 gimple_omp_for_set_final (copy
, i
,
1647 gimple_omp_for_final (stmt
, i
));
1648 gimple_omp_for_set_incr (copy
, i
,
1649 gimple_omp_for_incr (stmt
, i
));
1650 gimple_omp_for_set_cond (copy
, i
,
1651 gimple_omp_for_cond (stmt
, i
));
1656 case GIMPLE_OMP_MASTER
:
1657 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1658 copy
= gimple_build_omp_master (s1
);
1661 case GIMPLE_OMP_MASKED
:
1662 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1663 copy
= gimple_build_omp_masked
1664 (s1
, gimple_omp_masked_clauses (stmt
));
1667 case GIMPLE_OMP_SCOPE
:
1668 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1669 copy
= gimple_build_omp_scope
1670 (s1
, gimple_omp_scope_clauses (stmt
));
1673 case GIMPLE_OMP_TASKGROUP
:
1674 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1675 copy
= gimple_build_omp_taskgroup
1676 (s1
, gimple_omp_taskgroup_clauses (stmt
));
1679 case GIMPLE_OMP_ORDERED
:
1680 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1681 copy
= gimple_build_omp_ordered
1683 gimple_omp_ordered_clauses (as_a
<gomp_ordered
*> (stmt
)));
1686 case GIMPLE_OMP_SCAN
:
1687 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1688 copy
= gimple_build_omp_scan
1689 (s1
, gimple_omp_scan_clauses (as_a
<gomp_scan
*> (stmt
)));
1692 case GIMPLE_OMP_SECTION
:
1693 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1694 copy
= gimple_build_omp_section (s1
);
1697 case GIMPLE_OMP_SECTIONS
:
1698 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1699 copy
= gimple_build_omp_sections
1700 (s1
, gimple_omp_sections_clauses (stmt
));
1703 case GIMPLE_OMP_SINGLE
:
1704 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1705 copy
= gimple_build_omp_single
1706 (s1
, gimple_omp_single_clauses (stmt
));
1709 case GIMPLE_OMP_TARGET
:
1710 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1711 copy
= gimple_build_omp_target
1712 (s1
, gimple_omp_target_kind (stmt
),
1713 gimple_omp_target_clauses (stmt
));
1716 case GIMPLE_OMP_TEAMS
:
1717 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1718 copy
= gimple_build_omp_teams
1719 (s1
, gimple_omp_teams_clauses (stmt
));
1722 case GIMPLE_OMP_CRITICAL
:
1723 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1724 copy
= gimple_build_omp_critical (s1
,
1725 gimple_omp_critical_name
1726 (as_a
<gomp_critical
*> (stmt
)),
1727 gimple_omp_critical_clauses
1728 (as_a
<gomp_critical
*> (stmt
)));
1731 case GIMPLE_TRANSACTION
:
1733 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1734 gtransaction
*new_trans_stmt
;
1735 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1737 copy
= new_trans_stmt
= gimple_build_transaction (s1
);
1738 gimple_transaction_set_subcode (new_trans_stmt
,
1739 gimple_transaction_subcode (old_trans_stmt
));
1740 gimple_transaction_set_label_norm (new_trans_stmt
,
1741 gimple_transaction_label_norm (old_trans_stmt
));
1742 gimple_transaction_set_label_uninst (new_trans_stmt
,
1743 gimple_transaction_label_uninst (old_trans_stmt
));
1744 gimple_transaction_set_label_over (new_trans_stmt
,
1745 gimple_transaction_label_over (old_trans_stmt
));
1755 if (gimple_assign_copy_p (stmt
)
1756 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1757 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1759 /* Here we handle statements that are not completely rewritten.
1760 First we detect some inlining-induced bogosities for
1763 /* Some assignments VAR = VAR; don't generate any rtl code
1764 and thus don't count as variable modification. Avoid
1765 keeping bogosities like 0 = 0. */
1766 tree decl
= gimple_assign_lhs (stmt
), value
;
1769 n
= id
->decl_map
->get (decl
);
1773 STRIP_TYPE_NOPS (value
);
1774 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1779 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1780 in a block that we aren't copying during tree_function_versioning,
1781 just drop the clobber stmt. */
1782 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1784 tree lhs
= gimple_assign_lhs (stmt
);
1785 if (TREE_CODE (lhs
) == MEM_REF
1786 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1788 gimple
*def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1789 if (gimple_bb (def_stmt
)
1790 && !bitmap_bit_p (id
->blocks_to_copy
,
1791 gimple_bb (def_stmt
)->index
))
1796 /* We do not allow CLOBBERs of handled components. In case
1797 returned value is stored via such handled component, remove
1798 the clobber so stmt verifier is happy. */
1799 if (gimple_clobber_p (stmt
)
1800 && TREE_CODE (gimple_assign_lhs (stmt
)) == RESULT_DECL
)
1802 tree remapped
= remap_decl (gimple_assign_lhs (stmt
), id
);
1803 if (!DECL_P (remapped
)
1804 && TREE_CODE (remapped
) != MEM_REF
)
1808 if (gimple_debug_bind_p (stmt
))
1811 if (id
->param_body_adjs
1812 && id
->param_body_adjs
->m_dead_stmts
.contains (stmt
))
1815 value
= gimple_debug_bind_get_value (stmt
);
1817 = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1819 if (id
->reset_location
)
1820 gimple_set_location (copy
, input_location
);
1821 id
->debug_stmts
.safe_push (copy
);
1822 gimple_seq_add_stmt (&stmts
, copy
);
1825 if (gimple_debug_source_bind_p (stmt
))
1827 gdebug
*copy
= gimple_build_debug_source_bind
1828 (gimple_debug_source_bind_get_var (stmt
),
1829 gimple_debug_source_bind_get_value (stmt
),
1831 if (id
->reset_location
)
1832 gimple_set_location (copy
, input_location
);
1833 id
->debug_stmts
.safe_push (copy
);
1834 gimple_seq_add_stmt (&stmts
, copy
);
1837 if (gimple_debug_nonbind_marker_p (stmt
))
1839 /* If the inlined function has too many debug markers,
1841 if (id
->src_cfun
->debug_marker_count
1842 > param_max_debug_marker_count
1843 || id
->reset_location
)
1846 gdebug
*copy
= as_a
<gdebug
*> (gimple_copy (stmt
));
1847 id
->debug_stmts
.safe_push (copy
);
1848 gimple_seq_add_stmt (&stmts
, copy
);
1852 /* Create a new deep copy of the statement. */
1853 copy
= gimple_copy (stmt
);
1855 /* Clear flags that need revisiting. */
1856 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1858 if (gimple_call_tail_p (call_stmt
))
1859 gimple_call_set_tail (call_stmt
, false);
1860 if (gimple_call_from_thunk_p (call_stmt
))
1861 gimple_call_set_from_thunk (call_stmt
, false);
1862 if (gimple_call_internal_p (call_stmt
))
1863 switch (gimple_call_internal_fn (call_stmt
))
1865 case IFN_GOMP_SIMD_LANE
:
1866 case IFN_GOMP_SIMD_VF
:
1867 case IFN_GOMP_SIMD_LAST_LANE
:
1868 case IFN_GOMP_SIMD_ORDERED_START
:
1869 case IFN_GOMP_SIMD_ORDERED_END
:
1870 DECL_STRUCT_FUNCTION (id
->dst_fn
)->has_simduid_loops
= true;
1877 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1878 RESX and EH_DISPATCH. */
1880 switch (gimple_code (copy
))
1884 tree r
, fndecl
= gimple_call_fndecl (copy
);
1885 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
1886 switch (DECL_FUNCTION_CODE (fndecl
))
1888 case BUILT_IN_EH_COPY_VALUES
:
1889 r
= gimple_call_arg (copy
, 1);
1890 r
= remap_eh_region_tree_nr (r
, id
);
1891 gimple_call_set_arg (copy
, 1, r
);
1894 case BUILT_IN_EH_POINTER
:
1895 case BUILT_IN_EH_FILTER
:
1896 r
= gimple_call_arg (copy
, 0);
1897 r
= remap_eh_region_tree_nr (r
, id
);
1898 gimple_call_set_arg (copy
, 0, r
);
1905 /* Reset alias info if we didn't apply measures to
1906 keep it valid over inlining by setting DECL_PT_UID. */
1907 if (!id
->src_cfun
->gimple_df
1908 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1909 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1915 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1916 int r
= gimple_resx_region (resx_stmt
);
1917 r
= remap_eh_region_nr (r
, id
);
1918 gimple_resx_set_region (resx_stmt
, r
);
1922 case GIMPLE_EH_DISPATCH
:
1924 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1925 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1926 r
= remap_eh_region_nr (r
, id
);
1927 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1936 /* If STMT has a block defined, map it to the newly constructed block. */
1937 if (tree block
= gimple_block (copy
))
1940 n
= id
->decl_map
->get (block
);
1942 gimple_set_block (copy
, *n
);
1944 if (id
->param_body_adjs
)
1946 gimple_seq extra_stmts
= NULL
;
1947 id
->param_body_adjs
->modify_gimple_stmt (©
, &extra_stmts
, stmt
);
1948 if (!gimple_seq_empty_p (extra_stmts
))
1950 memset (&wi
, 0, sizeof (wi
));
1952 for (gimple_stmt_iterator egsi
= gsi_start (extra_stmts
);
1955 walk_gimple_op (gsi_stmt (egsi
), remap_gimple_op_r
, &wi
);
1956 gimple_seq_add_seq (&stmts
, extra_stmts
);
1960 if (id
->reset_location
)
1961 gimple_set_location (copy
, input_location
);
1963 /* Debug statements ought to be rebuilt and not copied. */
1964 gcc_checking_assert (!is_gimple_debug (copy
));
1966 /* Remap all the operands in COPY. */
1967 memset (&wi
, 0, sizeof (wi
));
1970 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1972 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1974 /* Clear the copied virtual operands. We are not remapping them here
1975 but are going to recreate them from scratch. */
1976 if (gimple_has_mem_ops (copy
))
1978 gimple_set_vdef (copy
, NULL_TREE
);
1979 gimple_set_vuse (copy
, NULL_TREE
);
1982 if (cfun
->can_throw_non_call_exceptions
)
1984 /* When inlining a function which does not have non-call exceptions
1985 enabled into a function that has (which only happens with
1986 always-inline) we have to fixup stmts that cannot throw. */
1987 if (gcond
*cond
= dyn_cast
<gcond
*> (copy
))
1988 if (gimple_could_trap_p (cond
))
1991 = gimple_build_assign (make_ssa_name (boolean_type_node
),
1992 gimple_cond_code (cond
),
1993 gimple_cond_lhs (cond
),
1994 gimple_cond_rhs (cond
));
1995 gimple_seq_add_stmt (&stmts
, cmp
);
1996 gimple_cond_set_code (cond
, NE_EXPR
);
1997 gimple_cond_set_lhs (cond
, gimple_assign_lhs (cmp
));
1998 gimple_cond_set_rhs (cond
, boolean_false_node
);
2002 gimple_seq_add_stmt (&stmts
, copy
);
2007 /* Copy basic block, scale profile accordingly. Edges will be taken care of
2011 copy_bb (copy_body_data
*id
, basic_block bb
,
2012 profile_count num
, profile_count den
)
2014 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
2015 basic_block copy_basic_block
;
2019 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2021 /* Search for previous copied basic block. */
2024 prev
= prev
->prev_bb
;
2026 /* create_basic_block() will append every new block to
2027 basic_block_info automatically. */
2028 copy_basic_block
= create_basic_block (NULL
, (basic_block
) prev
->aux
);
2029 copy_basic_block
->count
= bb
->count
.apply_scale (num
, den
);
2031 copy_gsi
= gsi_start_bb (copy_basic_block
);
2033 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
2036 gimple
*stmt
= gsi_stmt (gsi
);
2037 gimple
*orig_stmt
= stmt
;
2038 gimple_stmt_iterator stmts_gsi
;
2039 bool stmt_added
= false;
2041 id
->regimplify
= false;
2042 stmts
= remap_gimple_stmt (stmt
, id
);
2044 if (gimple_seq_empty_p (stmts
))
2049 for (stmts_gsi
= gsi_start (stmts
);
2050 !gsi_end_p (stmts_gsi
); )
2052 stmt
= gsi_stmt (stmts_gsi
);
2054 /* Advance iterator now before stmt is moved to seq_gsi. */
2055 gsi_next (&stmts_gsi
);
2057 if (gimple_nop_p (stmt
))
2060 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
2063 /* With return slot optimization we can end up with
2064 non-gimple (foo *)&this->m, fix that here. */
2065 if (is_gimple_assign (stmt
)
2066 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
2067 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
2070 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
2071 gimple_assign_rhs1 (stmt
),
2073 GSI_CONTINUE_LINKING
);
2074 gimple_assign_set_rhs1 (stmt
, new_rhs
);
2075 id
->regimplify
= false;
2078 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
2081 gimple_regimplify_operands (stmt
, &seq_gsi
);
2089 /* If copy_basic_block has been empty at the start of this iteration,
2090 call gsi_start_bb again to get at the newly added statements. */
2091 if (gsi_end_p (copy_gsi
))
2092 copy_gsi
= gsi_start_bb (copy_basic_block
);
2094 gsi_next (©_gsi
);
2096 /* Process the new statement. The call to gimple_regimplify_operands
2097 possibly turned the statement into multiple statements, we
2098 need to process all of them. */
2104 stmt
= gsi_stmt (copy_gsi
);
2105 call_stmt
= dyn_cast
<gcall
*> (stmt
);
2107 && gimple_call_va_arg_pack_p (call_stmt
)
2109 && ! gimple_call_va_arg_pack_p (id
->call_stmt
))
2111 /* __builtin_va_arg_pack () should be replaced by
2112 all arguments corresponding to ... in the caller. */
2116 size_t nargs_caller
= gimple_call_num_args (id
->call_stmt
);
2117 size_t nargs
= nargs_caller
;
2119 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
2122 /* Create the new array of arguments. */
2123 size_t nargs_callee
= gimple_call_num_args (call_stmt
);
2124 size_t n
= nargs
+ nargs_callee
;
2125 argarray
.create (n
);
2126 argarray
.safe_grow_cleared (n
, true);
2128 /* Copy all the arguments before '...' */
2130 memcpy (argarray
.address (),
2131 gimple_call_arg_ptr (call_stmt
, 0),
2132 nargs_callee
* sizeof (tree
));
2134 /* Append the arguments passed in '...' */
2136 memcpy (argarray
.address () + nargs_callee
,
2137 gimple_call_arg_ptr (id
->call_stmt
, 0)
2138 + (nargs_caller
- nargs
), nargs
* sizeof (tree
));
2140 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
2143 argarray
.release ();
2145 /* Copy all GIMPLE_CALL flags, location and block, except
2146 GF_CALL_VA_ARG_PACK. */
2147 gimple_call_copy_flags (new_call
, call_stmt
);
2148 gimple_call_set_va_arg_pack (new_call
, false);
2149 gimple_call_set_fntype (new_call
, gimple_call_fntype (call_stmt
));
2150 /* location includes block. */
2151 gimple_set_location (new_call
, gimple_location (stmt
));
2152 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
2154 gsi_replace (©_gsi
, new_call
, false);
2159 && (decl
= gimple_call_fndecl (stmt
))
2160 && fndecl_built_in_p (decl
, BUILT_IN_VA_ARG_PACK_LEN
))
2162 /* __builtin_va_arg_pack_len () should be replaced by
2163 the number of anonymous arguments. */
2164 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
2168 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
2171 if (!gimple_call_lhs (stmt
))
2173 /* Drop unused calls. */
2174 gsi_remove (©_gsi
, false);
2177 else if (!gimple_call_va_arg_pack_p (id
->call_stmt
))
2179 count
= build_int_cst (integer_type_node
, nargs
);
2180 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
2181 gsi_replace (©_gsi
, new_stmt
, false);
2184 else if (nargs
!= 0)
2186 tree newlhs
= create_tmp_reg_or_ssa_name (integer_type_node
);
2187 count
= build_int_cst (integer_type_node
, nargs
);
2188 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
2189 PLUS_EXPR
, newlhs
, count
);
2190 gimple_call_set_lhs (stmt
, newlhs
);
2191 gsi_insert_after (©_gsi
, new_stmt
, GSI_NEW_STMT
);
2196 && gimple_call_internal_p (stmt
)
2197 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
2199 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
2200 gsi_remove (©_gsi
, false);
2204 /* Statements produced by inlining can be unfolded, especially
2205 when we constant propagated some operands. We can't fold
2206 them right now for two reasons:
2207 1) folding require SSA_NAME_DEF_STMTs to be correct
2208 2) we can't change function calls to builtins.
2209 So we just mark statement for later folding. We mark
2210 all new statements, instead just statements that has changed
2211 by some nontrivial substitution so even statements made
2212 foldable indirectly are updated. If this turns out to be
2213 expensive, copy_body can be told to watch for nontrivial
2215 if (id
->statements_to_fold
)
2216 id
->statements_to_fold
->add (stmt
);
2218 /* We're duplicating a CALL_EXPR. Find any corresponding
2219 callgraph edges and update or duplicate them. */
2220 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
2222 struct cgraph_edge
*edge
;
2224 switch (id
->transform_call_graph_edges
)
2226 case CB_CGE_DUPLICATE
:
2227 edge
= id
->src_node
->get_edge (orig_stmt
);
2230 struct cgraph_edge
*old_edge
= edge
;
2232 /* A speculative call is consist of multiple
2233 edges - indirect edge and one or more direct edges
2234 Duplicate the whole thing and distribute frequencies
2236 if (edge
->speculative
)
2239 profile_count direct_cnt
2240 = profile_count::zero ();
2242 /* First figure out the distribution of counts
2243 so we can re-scale BB profile accordingly. */
2244 for (cgraph_edge
*e
= old_edge
; e
;
2245 e
= e
->next_speculative_call_target ())
2246 direct_cnt
= direct_cnt
+ e
->count
;
2248 cgraph_edge
*indirect
2249 = old_edge
->speculative_call_indirect_edge ();
2250 profile_count indir_cnt
= indirect
->count
;
2252 /* Next iterate all direct edges, clone it and its
2253 corresponding reference and update profile. */
2254 for (cgraph_edge
*e
= old_edge
;
2256 e
= e
->next_speculative_call_target ())
2258 profile_count cnt
= e
->count
;
2260 id
->dst_node
->clone_reference
2261 (e
->speculative_call_target_ref (), stmt
);
2262 edge
= e
->clone (id
->dst_node
, call_stmt
,
2263 gimple_uid (stmt
), num
, den
,
2265 profile_probability prob
2266 = cnt
.probability_in (direct_cnt
2269 = copy_basic_block
->count
.apply_probability
2274 (indirect
->num_speculative_call_targets_p ()
2277 /* Duplicate the indirect edge after all direct edges
2279 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2284 profile_probability prob
2285 = indir_cnt
.probability_in (direct_cnt
2288 = copy_basic_block
->count
.apply_probability (prob
);
2292 edge
= edge
->clone (id
->dst_node
, call_stmt
,
2296 edge
->count
= copy_basic_block
->count
;
2301 case CB_CGE_MOVE_CLONES
:
2302 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2304 edge
= id
->dst_node
->get_edge (stmt
);
2308 edge
= id
->dst_node
->get_edge (orig_stmt
);
2310 edge
= cgraph_edge::set_call_stmt (edge
, call_stmt
);
2317 /* Constant propagation on argument done during inlining
2318 may create new direct call. Produce an edge for it. */
2320 || (edge
->indirect_inlining_edge
2321 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2322 && id
->dst_node
->definition
2323 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2325 struct cgraph_node
*dest
= cgraph_node::get_create (fn
);
2327 /* We have missing edge in the callgraph. This can happen
2328 when previous inlining turned an indirect call into a
2329 direct call by constant propagating arguments or we are
2330 producing dead clone (for further cloning). In all
2331 other cases we hit a bug (incorrect node sharing is the
2332 most common reason for missing edges). */
2333 gcc_assert (!dest
->definition
2334 || dest
->address_taken
2335 || !id
->src_node
->definition
2336 || !id
->dst_node
->definition
);
2337 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2338 id
->dst_node
->create_edge_including_clones
2339 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2340 CIF_ORIGINALLY_INDIRECT_CALL
);
2342 id
->dst_node
->create_edge (dest
, call_stmt
,
2343 bb
->count
)->inline_failed
2344 = CIF_ORIGINALLY_INDIRECT_CALL
;
2347 fprintf (dump_file
, "Created new direct edge to %s\n",
2348 dest
->dump_name ());
2352 notice_special_calls (as_a
<gcall
*> (stmt
));
2355 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2356 id
->eh_map
, id
->eh_lp_nr
);
2358 gsi_next (©_gsi
);
2360 while (!gsi_end_p (copy_gsi
));
2362 copy_gsi
= gsi_last_bb (copy_basic_block
);
2365 return copy_basic_block
;
2368 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2369 form is quite easy, since dominator relationship for old basic blocks does
2372 There is however exception where inlining might change dominator relation
2373 across EH edges from basic block within inlined functions destinating
2374 to landing pads in function we inline into.
2376 The function fills in PHI_RESULTs of such PHI nodes if they refer
2377 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2378 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2379 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2380 set, and this means that there will be no overlapping live ranges
2381 for the underlying symbol.
2383 This might change in future if we allow redirecting of EH edges and
2384 we might want to change way build CFG pre-inlining to include
2385 all the possible edges then. */
2387 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2388 bool can_throw
, bool nonlocal_goto
)
2393 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2395 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2401 gcc_assert (e
->flags
& EDGE_EH
);
2404 gcc_assert (!(e
->flags
& EDGE_EH
));
2406 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2412 /* For abnormal goto/call edges the receiver can be the
2413 ENTRY_BLOCK. Do not assert this cannot happen. */
2415 gcc_assert ((e
->flags
& EDGE_EH
)
2416 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2418 re
= find_edge (ret_bb
, e
->dest
);
2419 gcc_checking_assert (re
);
2420 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2421 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2423 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2424 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2429 /* Insert clobbers for automatic variables of inlined ID->src_fn
2430 function at the start of basic block ID->eh_landing_pad_dest. */
2433 add_clobbers_to_eh_landing_pad (copy_body_data
*id
)
2436 basic_block bb
= id
->eh_landing_pad_dest
;
2437 live_vars_map
*vars
= NULL
;
2438 unsigned int cnt
= 0;
2440 FOR_EACH_VEC_SAFE_ELT (id
->src_cfun
->local_decls
, i
, var
)
2442 && !DECL_HARD_REGISTER (var
)
2443 && !TREE_THIS_VOLATILE (var
)
2444 && !DECL_HAS_VALUE_EXPR_P (var
)
2445 && !is_gimple_reg (var
)
2446 && auto_var_in_fn_p (var
, id
->src_fn
)
2447 && !lookup_attribute ("omp simd array", DECL_ATTRIBUTES (var
)))
2449 tree
*t
= id
->decl_map
->get (var
);
2454 && !DECL_HARD_REGISTER (new_var
)
2455 && !TREE_THIS_VOLATILE (new_var
)
2456 && !DECL_HAS_VALUE_EXPR_P (new_var
)
2457 && !is_gimple_reg (new_var
)
2458 && auto_var_in_fn_p (new_var
, id
->dst_fn
))
2461 vars
= new live_vars_map
;
2462 vars
->put (DECL_UID (var
), cnt
++);
2468 vec
<bitmap_head
> live
= compute_live_vars (id
->src_cfun
, vars
);
2469 FOR_EACH_VEC_SAFE_ELT (id
->src_cfun
->local_decls
, i
, var
)
2474 bool needed
= false;
2475 unsigned int *v
= vars
->get (DECL_UID (var
));
2478 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
2479 if ((e
->flags
& EDGE_EH
) != 0
2480 && e
->src
->index
>= id
->add_clobbers_to_eh_landing_pads
)
2482 basic_block src_bb
= (basic_block
) e
->src
->aux
;
2484 if (bitmap_bit_p (&live
[src_bb
->index
], *v
))
2492 tree new_var
= *id
->decl_map
->get (var
);
2493 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
2494 tree clobber
= build_clobber (TREE_TYPE (new_var
));
2495 gimple
*clobber_stmt
= gimple_build_assign (new_var
, clobber
);
2496 gsi_insert_before (&gsi
, clobber_stmt
, GSI_NEW_STMT
);
2499 destroy_live_vars (live
);
2503 /* Copy edges from BB into its copy constructed earlier, scale profile
2504 accordingly. Edges will be taken care of later. Assume aux
2505 pointers to point to the copies of each BB. Return true if any
2506 debug stmts are left after a statement that must end the basic block. */
2509 copy_edges_for_bb (basic_block bb
, profile_count num
, profile_count den
,
2510 basic_block ret_bb
, basic_block abnormal_goto_dest
,
2513 basic_block new_bb
= (basic_block
) bb
->aux
;
2516 gimple_stmt_iterator si
;
2517 bool need_debug_cleanup
= false;
2519 /* Use the indices from the original blocks to create edges for the
2521 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2522 if (!(old_edge
->flags
& EDGE_EH
))
2525 int flags
= old_edge
->flags
;
2526 location_t locus
= old_edge
->goto_locus
;
2528 /* Return edges do get a FALLTHRU flag when they get inlined. */
2529 if (old_edge
->dest
->index
== EXIT_BLOCK
2530 && !(flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2531 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2532 flags
|= EDGE_FALLTHRU
;
2535 = make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2536 new_edge
->probability
= old_edge
->probability
;
2537 if (!id
->reset_location
)
2538 new_edge
->goto_locus
= remap_location (locus
, id
);
2541 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2544 /* When doing function splitting, we must decrease count of the return block
2545 which was previously reachable by block we did not copy. */
2546 if (single_succ_p (bb
) && single_succ_edge (bb
)->dest
->index
== EXIT_BLOCK
)
2547 FOR_EACH_EDGE (old_edge
, ei
, bb
->preds
)
2548 if (old_edge
->src
->index
!= ENTRY_BLOCK
2549 && !old_edge
->src
->aux
)
2550 new_bb
->count
-= old_edge
->count ().apply_scale (num
, den
);
2552 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2555 bool can_throw
, nonlocal_goto
;
2557 copy_stmt
= gsi_stmt (si
);
2558 if (!is_gimple_debug (copy_stmt
))
2559 update_stmt (copy_stmt
);
2561 /* Do this before the possible split_block. */
2564 /* If this tree could throw an exception, there are two
2565 cases where we need to add abnormal edge(s): the
2566 tree wasn't in a region and there is a "current
2567 region" in the caller; or the original tree had
2568 EH edges. In both cases split the block after the tree,
2569 and add abnormal edge(s) as needed; we need both
2570 those from the callee and the caller.
2571 We check whether the copy can throw, because the const
2572 propagation can change an INDIRECT_REF which throws
2573 into a COMPONENT_REF which doesn't. If the copy
2574 can throw, the original could also throw. */
2575 can_throw
= stmt_can_throw_internal (cfun
, copy_stmt
);
2577 = (stmt_can_make_abnormal_goto (copy_stmt
)
2578 && !computed_goto_p (copy_stmt
));
2580 if (can_throw
|| nonlocal_goto
)
2582 if (!gsi_end_p (si
))
2584 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2587 need_debug_cleanup
= true;
2589 if (!gsi_end_p (si
))
2590 /* Note that bb's predecessor edges aren't necessarily
2591 right at this point; split_block doesn't care. */
2593 edge e
= split_block (new_bb
, copy_stmt
);
2596 new_bb
->aux
= e
->src
->aux
;
2597 si
= gsi_start_bb (new_bb
);
2601 bool update_probs
= false;
2603 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2605 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2606 update_probs
= true;
2610 make_eh_edges (copy_stmt
);
2611 update_probs
= true;
2614 /* EH edges may not match old edges. Copy as much as possible. */
2619 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2621 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2622 if ((old_edge
->flags
& EDGE_EH
)
2623 && (e
= find_edge (copy_stmt_bb
,
2624 (basic_block
) old_edge
->dest
->aux
))
2625 && (e
->flags
& EDGE_EH
))
2626 e
->probability
= old_edge
->probability
;
2628 FOR_EACH_EDGE (e
, ei
, copy_stmt_bb
->succs
)
2629 if (e
->flags
& EDGE_EH
)
2631 if (!e
->probability
.initialized_p ())
2632 e
->probability
= profile_probability::never ();
2633 if (e
->dest
->index
< id
->add_clobbers_to_eh_landing_pads
)
2635 if (id
->eh_landing_pad_dest
== NULL
)
2636 id
->eh_landing_pad_dest
= e
->dest
;
2638 gcc_assert (id
->eh_landing_pad_dest
== e
->dest
);
2644 /* If the call we inline cannot make abnormal goto do not add
2645 additional abnormal edges but only retain those already present
2646 in the original function body. */
2647 if (abnormal_goto_dest
== NULL
)
2648 nonlocal_goto
= false;
2651 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2653 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2654 nonlocal_goto
= false;
2655 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2656 in OpenMP regions which aren't allowed to be left abnormally.
2657 So, no need to add abnormal edge in that case. */
2658 else if (is_gimple_call (copy_stmt
)
2659 && gimple_call_internal_p (copy_stmt
)
2660 && (gimple_call_internal_fn (copy_stmt
)
2661 == IFN_ABNORMAL_DISPATCHER
)
2662 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2663 nonlocal_goto
= false;
2665 make_single_succ_edge (copy_stmt_bb
, abnormal_goto_dest
,
2669 if ((can_throw
|| nonlocal_goto
)
2670 && gimple_in_ssa_p (cfun
))
2671 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2672 can_throw
, nonlocal_goto
);
2674 return need_debug_cleanup
;
2677 /* Copy the PHIs. All blocks and edges are copied, some blocks
2678 was possibly split and new outgoing EH edges inserted.
2679 BB points to the block of original function and AUX pointers links
2680 the original and newly copied blocks. */
2683 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2685 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2690 bool inserted
= false;
2692 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2698 res
= PHI_RESULT (phi
);
2700 if (!virtual_operand_p (res
)
2701 && (!id
->param_body_adjs
2702 || !id
->param_body_adjs
->m_dead_stmts
.contains (phi
)))
2704 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2705 if (EDGE_COUNT (new_bb
->preds
) == 0)
2707 /* Technically we'd want a SSA_DEFAULT_DEF here... */
2708 SSA_NAME_DEF_STMT (new_res
) = gimple_build_nop ();
2712 new_phi
= create_phi_node (new_res
, new_bb
);
2713 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2715 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
,
2722 /* When doing partial cloning, we allow PHIs on the entry
2723 block as long as all the arguments are the same.
2724 Find any input edge to see argument to copy. */
2726 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2727 if (!old_edge
->src
->aux
)
2730 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2732 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2733 gcc_assert (new_arg
);
2734 /* With return slot optimization we can end up with
2735 non-gimple (foo *)&this->m, fix that here. */
2736 if (TREE_CODE (new_arg
) != SSA_NAME
2737 && TREE_CODE (new_arg
) != FUNCTION_DECL
2738 && !is_gimple_val (new_arg
))
2740 gimple_seq stmts
= NULL
;
2741 new_arg
= force_gimple_operand (new_arg
, &stmts
, true,
2743 gsi_insert_seq_on_edge (new_edge
, stmts
);
2746 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2747 if (id
->reset_location
)
2748 locus
= input_location
;
2750 locus
= remap_location (locus
, id
);
2751 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2757 /* Commit the delayed edge insertions. */
2759 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2760 gsi_commit_one_edge_insert (new_edge
, NULL
);
2764 /* Wrapper for remap_decl so it can be used as a callback. */
2767 remap_decl_1 (tree decl
, void *data
)
2769 return remap_decl (decl
, (copy_body_data
*) data
);
2772 /* Build struct function and associated datastructures for the new clone
2773 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2774 the cfun to the function of new_fndecl (and current_function_decl too). */
2777 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, profile_count count
)
2779 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2781 if (!DECL_ARGUMENTS (new_fndecl
))
2782 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2783 if (!DECL_RESULT (new_fndecl
))
2784 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2786 /* Register specific tree functions. */
2787 gimple_register_cfg_hooks ();
2789 /* Get clean struct function. */
2790 push_struct_function (new_fndecl
);
2792 /* We will rebuild these, so just sanity check that they are empty. */
2793 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2794 gcc_assert (cfun
->local_decls
== NULL
);
2795 gcc_assert (cfun
->cfg
== NULL
);
2796 gcc_assert (cfun
->decl
== new_fndecl
);
2798 /* Copy items we preserve during cloning. */
2799 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2800 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2801 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2802 cfun
->curr_properties
= src_cfun
->curr_properties
;
2803 cfun
->last_verified
= src_cfun
->last_verified
;
2804 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2805 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2806 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2807 cfun
->calls_eh_return
= src_cfun
->calls_eh_return
;
2808 cfun
->stdarg
= src_cfun
->stdarg
;
2809 cfun
->after_inlining
= src_cfun
->after_inlining
;
2810 cfun
->can_throw_non_call_exceptions
2811 = src_cfun
->can_throw_non_call_exceptions
;
2812 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2813 cfun
->returns_struct
= src_cfun
->returns_struct
;
2814 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2816 init_empty_tree_cfg ();
2818 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2820 profile_count num
= count
;
2821 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
2822 profile_count::adjust_for_ipa_scaling (&num
, &den
);
2824 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2825 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2826 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2827 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2828 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
.apply_scale (count
,
2829 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2831 init_eh_for_function ();
2833 if (src_cfun
->gimple_df
)
2835 init_tree_ssa (cfun
);
2836 cfun
->gimple_df
->in_ssa_p
= src_cfun
->gimple_df
->in_ssa_p
;
2837 if (cfun
->gimple_df
->in_ssa_p
)
2838 init_ssa_operands (cfun
);
2842 /* Helper function for copy_cfg_body. Move debug stmts from the end
2843 of NEW_BB to the beginning of successor basic blocks when needed. If the
2844 successor has multiple predecessors, reset them, otherwise keep
2848 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2852 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2855 || gsi_one_before_end_p (si
)
2856 || !(stmt_can_throw_internal (cfun
, gsi_stmt (si
))
2857 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2860 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2862 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2863 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2864 while (is_gimple_debug (gsi_stmt (ssi
)))
2866 gimple
*stmt
= gsi_stmt (ssi
);
2871 /* For the last edge move the debug stmts instead of copying
2873 if (ei_one_before_end_p (ei
))
2877 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2879 gimple_debug_bind_reset_value (stmt
);
2880 gimple_set_location (stmt
, UNKNOWN_LOCATION
);
2882 gsi_remove (&si
, false);
2883 gsi_insert_before (&dsi
, stmt
, GSI_NEW_STMT
);
2887 if (gimple_debug_bind_p (stmt
))
2889 var
= gimple_debug_bind_get_var (stmt
);
2890 if (single_pred_p (e
->dest
))
2892 value
= gimple_debug_bind_get_value (stmt
);
2893 value
= unshare_expr (value
);
2894 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2897 new_stmt
= gimple_build_debug_bind (var
, NULL_TREE
, NULL
);
2899 else if (gimple_debug_source_bind_p (stmt
))
2901 var
= gimple_debug_source_bind_get_var (stmt
);
2902 value
= gimple_debug_source_bind_get_value (stmt
);
2903 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2905 else if (gimple_debug_nonbind_marker_p (stmt
))
2906 new_stmt
= as_a
<gdebug
*> (gimple_copy (stmt
));
2909 gsi_insert_before (&dsi
, new_stmt
, GSI_NEW_STMT
);
2910 id
->debug_stmts
.safe_push (new_stmt
);
2916 /* Make a copy of the sub-loops of SRC_PARENT and place them
2917 as siblings of DEST_PARENT. */
2920 copy_loops (copy_body_data
*id
,
2921 class loop
*dest_parent
, class loop
*src_parent
)
2923 class loop
*src_loop
= src_parent
->inner
;
2926 if (!id
->blocks_to_copy
2927 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2929 class loop
*dest_loop
= alloc_loop ();
2931 /* Assign the new loop its header and latch and associate
2932 those with the new loop. */
2933 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2934 dest_loop
->header
->loop_father
= dest_loop
;
2935 if (src_loop
->latch
!= NULL
)
2937 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2938 dest_loop
->latch
->loop_father
= dest_loop
;
2941 /* Copy loop meta-data. */
2942 copy_loop_info (src_loop
, dest_loop
);
2943 if (dest_loop
->unroll
)
2944 cfun
->has_unroll
= true;
2945 if (dest_loop
->force_vectorize
)
2946 cfun
->has_force_vectorize_loops
= true;
2947 if (id
->src_cfun
->last_clique
!= 0)
2948 dest_loop
->owned_clique
2949 = remap_dependence_clique (id
,
2950 src_loop
->owned_clique
2951 ? src_loop
->owned_clique
: 1);
2953 /* Finally place it into the loop array and the loop tree. */
2954 place_new_loop (cfun
, dest_loop
);
2955 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2957 if (src_loop
->simduid
)
2959 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2960 cfun
->has_simduid_loops
= true;
2964 copy_loops (id
, dest_loop
, src_loop
);
2966 src_loop
= src_loop
->next
;
2970 /* Call redirect_call_stmt_to_callee on all calls in BB. */
2973 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2975 gimple_stmt_iterator si
;
2976 gimple
*last
= last_stmt (bb
);
2977 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2979 gimple
*stmt
= gsi_stmt (si
);
2980 if (is_gimple_call (stmt
))
2982 tree old_lhs
= gimple_call_lhs (stmt
);
2983 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2987 = cgraph_edge::redirect_call_stmt_to_callee (edge
);
2988 /* If IPA-SRA transformation, run as part of edge redirection,
2989 removed the LHS because it is unused, save it to
2990 killed_new_ssa_names so that we can prune it from debug
2993 && TREE_CODE (old_lhs
) == SSA_NAME
2994 && !gimple_call_lhs (new_stmt
))
2996 if (!id
->killed_new_ssa_names
)
2997 id
->killed_new_ssa_names
= new hash_set
<tree
> (16);
2998 id
->killed_new_ssa_names
->add (old_lhs
);
3001 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
3002 gimple_purge_dead_eh_edges (bb
);
3008 /* Make a copy of the body of FN so that it can be inserted inline in
3009 another function. Walks FN via CFG, returns new fndecl. */
3012 copy_cfg_body (copy_body_data
* id
,
3013 basic_block entry_block_map
, basic_block exit_block_map
,
3014 basic_block new_entry
)
3016 tree callee_fndecl
= id
->src_fn
;
3017 /* Original cfun for the callee, doesn't change. */
3018 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
3019 struct function
*cfun_to_copy
;
3021 tree new_fndecl
= NULL
;
3022 bool need_debug_cleanup
= false;
3024 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
;
3025 profile_count num
= entry_block_map
->count
;
3027 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
3029 /* Register specific tree functions. */
3030 gimple_register_cfg_hooks ();
3032 /* If we are inlining just region of the function, make sure to connect
3033 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
3034 part of loop, we must compute frequency and probability of
3035 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
3036 probabilities of edges incoming from nonduplicated region. */
3041 den
= profile_count::zero ();
3043 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
3046 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= den
;
3049 profile_count::adjust_for_ipa_scaling (&num
, &den
);
3051 /* Must have a CFG here at this point. */
3052 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
3053 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
3056 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
3057 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
3058 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
3059 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
3061 /* Duplicate any exception-handling regions. */
3063 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
3066 /* Use aux pointers to map the original blocks to copy. */
3067 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
3068 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
3070 basic_block new_bb
= copy_bb (id
, bb
, num
, den
);
3073 new_bb
->loop_father
= entry_block_map
->loop_father
;
3076 last
= last_basic_block_for_fn (cfun
);
3078 /* Now that we've duplicated the blocks, duplicate their edges. */
3079 basic_block abnormal_goto_dest
= NULL
;
3081 && stmt_can_make_abnormal_goto (id
->call_stmt
))
3083 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
3085 bb
= gimple_bb (id
->call_stmt
);
3087 if (gsi_end_p (gsi
))
3088 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
3090 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3091 if (!id
->blocks_to_copy
3092 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
3093 need_debug_cleanup
|= copy_edges_for_bb (bb
, num
, den
, exit_block_map
,
3094 abnormal_goto_dest
, id
);
3096 if (id
->eh_landing_pad_dest
)
3098 add_clobbers_to_eh_landing_pad (id
);
3099 id
->eh_landing_pad_dest
= NULL
;
3104 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
,
3106 e
->probability
= profile_probability::always ();
3109 /* Duplicate the loop tree, if available and wanted. */
3110 if (loops_for_fn (src_cfun
) != NULL
3111 && current_loops
!= NULL
)
3113 copy_loops (id
, entry_block_map
->loop_father
,
3114 get_loop (src_cfun
, 0));
3115 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
3116 loops_state_set (LOOPS_NEED_FIXUP
);
3119 /* If the loop tree in the source function needed fixup, mark the
3120 destination loop tree for fixup, too. */
3121 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
3122 loops_state_set (LOOPS_NEED_FIXUP
);
3124 if (gimple_in_ssa_p (cfun
))
3125 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3126 if (!id
->blocks_to_copy
3127 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
3128 copy_phis_for_bb (bb
, id
);
3130 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
3133 if (need_debug_cleanup
3134 && bb
->index
!= ENTRY_BLOCK
3135 && bb
->index
!= EXIT_BLOCK
)
3136 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
3137 /* Update call edge destinations. This cannot be done before loop
3138 info is updated, because we may split basic blocks. */
3139 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
3140 && bb
->index
!= ENTRY_BLOCK
3141 && bb
->index
!= EXIT_BLOCK
)
3142 redirect_all_calls (id
, (basic_block
)bb
->aux
);
3143 ((basic_block
)bb
->aux
)->aux
= NULL
;
3147 /* Zero out AUX fields of newly created block during EH edge
3149 for (; last
< last_basic_block_for_fn (cfun
); last
++)
3151 if (need_debug_cleanup
)
3152 maybe_move_debug_stmts_to_successors (id
,
3153 BASIC_BLOCK_FOR_FN (cfun
, last
));
3154 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
3155 /* Update call edge destinations. This cannot be done before loop
3156 info is updated, because we may split basic blocks. */
3157 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
3158 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
3160 entry_block_map
->aux
= NULL
;
3161 exit_block_map
->aux
= NULL
;
3168 if (id
->dependence_map
)
3170 delete id
->dependence_map
;
3171 id
->dependence_map
= NULL
;
3177 /* Copy the debug STMT using ID. We deal with these statements in a
3178 special way: if any variable in their VALUE expression wasn't
3179 remapped yet, we won't remap it, because that would get decl uids
3180 out of sync, causing codegen differences between -g and -g0. If
3181 this arises, we drop the VALUE expression altogether. */
3184 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
3187 struct walk_stmt_info wi
;
3189 if (tree block
= gimple_block (stmt
))
3191 n
= id
->decl_map
->get (block
);
3192 gimple_set_block (stmt
, n
? *n
: id
->block
);
3195 if (gimple_debug_nonbind_marker_p (stmt
))
3197 if (id
->call_stmt
&& !gimple_block (stmt
))
3199 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
3200 gsi_remove (&gsi
, true);
3205 /* Remap all the operands in COPY. */
3206 memset (&wi
, 0, sizeof (wi
));
3209 processing_debug_stmt
= 1;
3211 if (gimple_debug_source_bind_p (stmt
))
3212 t
= gimple_debug_source_bind_get_var (stmt
);
3213 else if (gimple_debug_bind_p (stmt
))
3214 t
= gimple_debug_bind_get_var (stmt
);
3218 if (TREE_CODE (t
) == PARM_DECL
3220 && (n
= id
->debug_map
->get (t
)))
3222 gcc_assert (VAR_P (*n
));
3225 else if (VAR_P (t
) && !is_global_var (t
) && !id
->decl_map
->get (t
))
3226 /* T is a non-localized variable. */;
3228 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
3230 if (gimple_debug_bind_p (stmt
))
3232 gimple_debug_bind_set_var (stmt
, t
);
3234 if (gimple_debug_bind_has_value_p (stmt
))
3235 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
3236 remap_gimple_op_r
, &wi
, NULL
);
3238 /* Punt if any decl couldn't be remapped. */
3239 if (processing_debug_stmt
< 0)
3240 gimple_debug_bind_reset_value (stmt
);
3242 else if (gimple_debug_source_bind_p (stmt
))
3244 gimple_debug_source_bind_set_var (stmt
, t
);
3245 /* When inlining and source bind refers to one of the optimized
3246 away parameters, change the source bind into normal debug bind
3247 referring to the corresponding DEBUG_EXPR_DECL that should have
3248 been bound before the call stmt. */
3249 t
= gimple_debug_source_bind_get_value (stmt
);
3251 && TREE_CODE (t
) == PARM_DECL
3254 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
3256 if (debug_args
!= NULL
)
3258 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
3259 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
3260 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
3262 t
= (**debug_args
)[i
+ 1];
3263 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
3264 gimple_debug_bind_set_value (stmt
, t
);
3269 if (gimple_debug_source_bind_p (stmt
))
3270 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
3271 remap_gimple_op_r
, &wi
, NULL
);
3274 processing_debug_stmt
= 0;
3279 /* Process deferred debug stmts. In order to give values better odds
3280 of being successfully remapped, we delay the processing of debug
3281 stmts until all other stmts that might require remapping are
3285 copy_debug_stmts (copy_body_data
*id
)
3287 if (!id
->debug_stmts
.exists ())
3290 for (gdebug
*stmt
: id
->debug_stmts
)
3291 copy_debug_stmt (stmt
, id
);
3293 id
->debug_stmts
.release ();
3296 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
3297 another function. */
3300 copy_tree_body (copy_body_data
*id
)
3302 tree fndecl
= id
->src_fn
;
3303 tree body
= DECL_SAVED_TREE (fndecl
);
3305 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
3310 /* Make a copy of the body of FN so that it can be inserted inline in
3311 another function. */
3314 copy_body (copy_body_data
*id
,
3315 basic_block entry_block_map
, basic_block exit_block_map
,
3316 basic_block new_entry
)
3318 tree fndecl
= id
->src_fn
;
3321 /* If this body has a CFG, walk CFG and copy. */
3322 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
3323 body
= copy_cfg_body (id
, entry_block_map
, exit_block_map
,
3325 copy_debug_stmts (id
);
3326 delete id
->killed_new_ssa_names
;
3327 id
->killed_new_ssa_names
= NULL
;
3332 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
3333 defined in function FN, or of a data member thereof. */
3336 self_inlining_addr_expr (tree value
, tree fn
)
3340 if (TREE_CODE (value
) != ADDR_EXPR
)
3343 var
= get_base_address (TREE_OPERAND (value
, 0));
3345 return var
&& auto_var_in_fn_p (var
, fn
);
3348 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
3349 lexical block and line number information from base_stmt, if given,
3350 or from the last stmt of the block otherwise. */
3353 insert_init_debug_bind (copy_body_data
*id
,
3354 basic_block bb
, tree var
, tree value
,
3358 gimple_stmt_iterator gsi
;
3361 if (!gimple_in_ssa_p (id
->src_cfun
))
3364 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
3367 tracked_var
= target_for_debug_bind (var
);
3373 gsi
= gsi_last_bb (bb
);
3374 if (!base_stmt
&& !gsi_end_p (gsi
))
3375 base_stmt
= gsi_stmt (gsi
);
3378 note
= gimple_build_debug_bind (tracked_var
,
3379 value
== error_mark_node
3380 ? NULL_TREE
: unshare_expr (value
),
3385 if (!gsi_end_p (gsi
))
3386 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
3388 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3395 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple
*init_stmt
)
3397 /* If VAR represents a zero-sized variable, it's possible that the
3398 assignment statement may result in no gimple statements. */
3401 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3403 /* We can end up with init statements that store to a non-register
3404 from a rhs with a conversion. Handle that here by forcing the
3405 rhs into a temporary. gimple_regimplify_operands is not
3406 prepared to do this for us. */
3407 if (!is_gimple_debug (init_stmt
)
3408 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3409 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3410 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3412 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3413 TREE_TYPE (gimple_assign_lhs (init_stmt
)),
3414 gimple_assign_rhs1 (init_stmt
));
3415 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3417 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3418 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3420 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3421 if (!is_gimple_debug (init_stmt
))
3423 gimple_regimplify_operands (init_stmt
, &si
);
3425 tree def
= gimple_assign_lhs (init_stmt
);
3426 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3431 /* Deal with mismatched formal/actual parameters, in a rather brute-force way
3432 if need be (which should only be necessary for invalid programs). Attempt
3433 to convert VAL to TYPE and return the result if it is possible, just return
3434 a zero constant of the given type if it fails. */
3437 force_value_to_type (tree type
, tree value
)
3439 /* If we can match up types by promotion/demotion do so. */
3440 if (fold_convertible_p (type
, value
))
3441 return fold_convert (type
, value
);
3443 /* ??? For valid programs we should not end up here.
3444 Still if we end up with truly mismatched types here, fall back
3445 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3446 GIMPLE to the following passes. */
3447 if (TREE_CODE (value
) == WITH_SIZE_EXPR
)
3448 return error_mark_node
;
3449 else if (!is_gimple_reg_type (TREE_TYPE (value
))
3450 || TYPE_SIZE (type
) == TYPE_SIZE (TREE_TYPE (value
)))
3451 return fold_build1 (VIEW_CONVERT_EXPR
, type
, value
);
3453 return build_zero_cst (type
);
3456 /* Initialize parameter P with VALUE. If needed, produce init statement
3457 at the end of BB. When BB is NULL, we return init statement to be
3460 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3461 basic_block bb
, tree
*vars
)
3463 gimple
*init_stmt
= NULL
;
3465 tree def
= (gimple_in_ssa_p (cfun
)
3466 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3468 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3469 here since the type of this decl must be visible to the calling
3471 var
= copy_decl_to_var (p
, id
);
3473 /* Declare this new variable. */
3474 DECL_CHAIN (var
) = *vars
;
3477 /* Make gimplifier happy about this variable. */
3478 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3480 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3481 we would not need to create a new variable here at all, if it
3482 weren't for debug info. Still, we can just use the argument
3484 if (TREE_READONLY (p
)
3485 && !TREE_ADDRESSABLE (p
)
3487 && !TREE_SIDE_EFFECTS (value
)
3490 /* We may produce non-gimple trees by adding NOPs or introduce invalid
3491 sharing when the value is not constant or DECL. And we need to make
3492 sure that it cannot be modified from another path in the callee. */
3493 if (((is_gimple_min_invariant (value
)
3494 /* When the parameter is used in a context that forces it to
3495 not be a GIMPLE register avoid substituting something that
3496 is not a decl there. */
3497 && ! DECL_NOT_GIMPLE_REG_P (p
))
3498 || (DECL_P (value
) && TREE_READONLY (value
))
3499 || (auto_var_in_fn_p (value
, id
->dst_fn
)
3500 && !TREE_ADDRESSABLE (value
)))
3501 && useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
))
3502 /* We have to be very careful about ADDR_EXPR. Make sure
3503 the base variable isn't a local variable of the inlined
3504 function, e.g., when doing recursive inlining, direct or
3505 mutually-recursive or whatever, which is why we don't
3506 just test whether fn == current_function_decl. */
3507 && ! self_inlining_addr_expr (value
, fn
))
3509 insert_decl_map (id
, p
, value
);
3511 id
->debug_map
= new hash_map
<tree
, tree
>;
3512 id
->debug_map
->put (p
, var
);
3513 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3517 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3518 that way, when the PARM_DECL is encountered, it will be
3519 automatically replaced by the VAR_DECL. */
3520 insert_decl_map (id
, p
, var
);
3522 /* Even if P was TREE_READONLY, the new VAR should not be. In the original
3523 code, we would have constructed a temporary, and then the function body
3524 would have never changed the value of P. However, now, we will be
3525 constructing VAR directly. Therefore, it must not be TREE_READONLY. */
3526 TREE_READONLY (var
) = 0;
3530 && value
!= error_mark_node
3531 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3532 rhs
= force_value_to_type (TREE_TYPE (p
), value
);
3534 /* If there is no setup required and we are in SSA, take the easy route
3535 replacing all SSA names representing the function parameter by the
3536 SSA name passed to function.
3538 We need to construct map for the variable anyway as it might be used
3539 in different SSA names when parameter is set in function.
3541 Do replacement at -O0 for const arguments replaced by constant.
3542 This is important for builtin_constant_p and other construct requiring
3543 constant argument to be visible in inlined function body. */
3544 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3546 || (TREE_READONLY (p
)
3547 && is_gimple_min_invariant (rhs
)))
3548 && (TREE_CODE (rhs
) == SSA_NAME
3549 || is_gimple_min_invariant (rhs
))
3550 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3552 insert_decl_map (id
, def
, rhs
);
3553 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3556 /* If the value of argument is never used, don't care about initializing
3558 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3560 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3561 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3564 /* Initialize this VAR_DECL from the equivalent argument. Convert
3565 the argument to the proper type in case it was promoted. */
3568 if (rhs
== error_mark_node
)
3570 insert_decl_map (id
, p
, var
);
3571 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3574 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3576 /* If we are in SSA form properly remap the default definition
3577 or assign to a dummy SSA name if the parameter is unused and
3578 we are not optimizing. */
3579 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3583 def
= remap_ssa_name (def
, id
);
3584 init_stmt
= gimple_build_assign (def
, rhs
);
3585 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3586 set_ssa_default_def (cfun
, var
, NULL
);
3590 def
= make_ssa_name (var
);
3591 init_stmt
= gimple_build_assign (def
, rhs
);
3595 init_stmt
= gimple_build_assign (var
, rhs
);
3597 if (bb
&& init_stmt
)
3598 insert_init_stmt (id
, bb
, init_stmt
);
3603 /* Generate code to initialize the parameters of the function at the
3604 top of the stack in ID from the GIMPLE_CALL STMT. */
3607 initialize_inlined_parameters (copy_body_data
*id
, gimple
*stmt
,
3608 tree fn
, basic_block bb
)
3613 tree vars
= NULL_TREE
;
3614 tree static_chain
= gimple_call_chain (stmt
);
3616 /* Figure out what the parameters are. */
3617 parms
= DECL_ARGUMENTS (fn
);
3619 /* Loop through the parameter declarations, replacing each with an
3620 equivalent VAR_DECL, appropriately initialized. */
3621 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3624 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3625 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3627 /* After remapping parameters remap their types. This has to be done
3628 in a second loop over all parameters to appropriately remap
3629 variable sized arrays when the size is specified in a
3630 parameter following the array. */
3631 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3633 tree
*varp
= id
->decl_map
->get (p
);
3634 if (varp
&& VAR_P (*varp
))
3636 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3637 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3639 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3640 /* Also remap the default definition if it was remapped
3641 to the default definition of the parameter replacement
3642 by the parameter setup. */
3645 tree
*defp
= id
->decl_map
->get (def
);
3647 && TREE_CODE (*defp
) == SSA_NAME
3648 && SSA_NAME_VAR (*defp
) == var
)
3649 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3654 /* Initialize the static chain. */
3655 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3656 gcc_assert (fn
!= current_function_decl
);
3659 /* No static chain? Seems like a bug in tree-nested.c. */
3660 gcc_assert (static_chain
);
3662 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3665 declare_inline_vars (id
->block
, vars
);
3669 /* Declare a return variable to replace the RESULT_DECL for the
3670 function we are calling. An appropriate DECL_STMT is returned.
3671 The USE_STMT is filled to contain a use of the declaration to
3672 indicate the return value of the function.
3674 RETURN_SLOT, if non-null is place where to store the result. It
3675 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3676 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3678 The return value is a (possibly null) value that holds the result
3679 as seen by the caller. */
3682 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3683 basic_block entry_bb
)
3685 tree callee
= id
->src_fn
;
3686 tree result
= DECL_RESULT (callee
);
3687 tree callee_type
= TREE_TYPE (result
);
3691 /* Handle type-mismatches in the function declaration return type
3692 vs. the call expression. */
3694 caller_type
= TREE_TYPE (modify_dest
);
3695 else if (return_slot
)
3696 caller_type
= TREE_TYPE (return_slot
);
3697 else /* No LHS on the call. */
3698 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3700 /* We don't need to do anything for functions that don't return anything. */
3701 if (VOID_TYPE_P (callee_type
))
3704 /* If there was a return slot, then the return value is the
3705 dereferenced address of that object. */
3708 /* The front end shouldn't have used both return_slot and
3709 a modify expression. */
3710 gcc_assert (!modify_dest
);
3711 if (DECL_BY_REFERENCE (result
))
3713 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3714 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3716 /* We are going to construct *&return_slot and we can't do that
3717 for variables believed to be not addressable.
3719 FIXME: This check possibly can match, because values returned
3720 via return slot optimization are not believed to have address
3721 taken by alias analysis. */
3722 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3723 var
= return_slot_addr
;
3724 mark_addressable (return_slot
);
3729 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3730 if (TREE_ADDRESSABLE (result
))
3731 mark_addressable (var
);
3733 if (DECL_NOT_GIMPLE_REG_P (result
)
3735 DECL_NOT_GIMPLE_REG_P (var
) = 1;
3737 if (!useless_type_conversion_p (callee_type
, caller_type
))
3738 var
= build1 (VIEW_CONVERT_EXPR
, callee_type
, var
);
3744 /* All types requiring non-trivial constructors should have been handled. */
3745 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3747 /* Attempt to avoid creating a new temporary variable. */
3749 && TREE_CODE (modify_dest
) != SSA_NAME
)
3751 bool use_it
= false;
3753 /* We can't use MODIFY_DEST if there's type promotion involved. */
3754 if (!useless_type_conversion_p (callee_type
, caller_type
))
3757 /* ??? If we're assigning to a variable sized type, then we must
3758 reuse the destination variable, because we've no good way to
3759 create variable sized temporaries at this point. */
3760 else if (!poly_int_tree_p (TYPE_SIZE_UNIT (caller_type
)))
3763 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3764 reuse it as the result of the call directly. Don't do this if
3765 it would promote MODIFY_DEST to addressable. */
3766 else if (TREE_ADDRESSABLE (result
))
3770 tree base_m
= get_base_address (modify_dest
);
3772 /* If the base isn't a decl, then it's a pointer, and we don't
3773 know where that's going to go. */
3774 if (!DECL_P (base_m
))
3776 else if (is_global_var (base_m
))
3778 else if (DECL_NOT_GIMPLE_REG_P (result
)
3779 && !DECL_NOT_GIMPLE_REG_P (base_m
))
3781 else if (!TREE_ADDRESSABLE (base_m
))
3793 gcc_assert (poly_int_tree_p (TYPE_SIZE_UNIT (callee_type
)));
3795 var
= copy_result_decl_to_var (result
, id
);
3796 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3798 /* Do not have the rest of GCC warn about this variable as it should
3799 not be visible to the user. */
3800 suppress_warning (var
/* OPT_Wuninitialized? */);
3802 declare_inline_vars (id
->block
, var
);
3804 /* Build the use expr. If the return type of the function was
3805 promoted, convert it back to the expected type. */
3807 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3809 /* If we can match up types by promotion/demotion do so. */
3810 if (fold_convertible_p (caller_type
, var
))
3811 use
= fold_convert (caller_type
, var
);
3814 /* ??? For valid programs we should not end up here.
3815 Still if we end up with truly mismatched types here, fall back
3816 to using a MEM_REF to not leak invalid GIMPLE to the following
3818 /* Prevent var from being written into SSA form. */
3819 if (is_gimple_reg_type (TREE_TYPE (var
)))
3820 DECL_NOT_GIMPLE_REG_P (var
) = true;
3821 use
= fold_build2 (MEM_REF
, caller_type
,
3822 build_fold_addr_expr (var
),
3823 build_int_cst (ptr_type_node
, 0));
3827 STRIP_USELESS_TYPE_CONVERSION (use
);
3829 if (DECL_BY_REFERENCE (result
))
3831 TREE_ADDRESSABLE (var
) = 1;
3832 var
= build_fold_addr_expr (var
);
3836 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3837 way, when the RESULT_DECL is encountered, it will be
3838 automatically replaced by the VAR_DECL.
3840 When returning by reference, ensure that RESULT_DECL remaps to
3842 if (DECL_BY_REFERENCE (result
)
3843 && !is_gimple_val (var
))
3845 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3846 insert_decl_map (id
, result
, temp
);
3847 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3848 it's default_def SSA_NAME. */
3849 if (gimple_in_ssa_p (id
->src_cfun
)
3850 && is_gimple_reg (result
))
3852 temp
= make_ssa_name (temp
);
3853 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3855 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3858 insert_decl_map (id
, result
, var
);
3860 /* Remember this so we can ignore it in remap_decls. */
3865 /* Determine if the function can be copied. If so return NULL. If
3866 not return a string describng the reason for failure. */
3869 copy_forbidden (struct function
*fun
)
3871 const char *reason
= fun
->cannot_be_copied_reason
;
3873 /* Only examine the function once. */
3874 if (fun
->cannot_be_copied_set
)
3877 /* We cannot copy a function that receives a non-local goto
3878 because we cannot remap the destination label used in the
3879 function that is performing the non-local goto. */
3880 /* ??? Actually, this should be possible, if we work at it.
3881 No doubt there's just a handful of places that simply
3882 assume it doesn't happen and don't substitute properly. */
3883 if (fun
->has_nonlocal_label
)
3885 reason
= G_("function %q+F can never be copied "
3886 "because it receives a non-local goto");
3890 if (fun
->has_forced_label_in_static
)
3892 reason
= G_("function %q+F can never be copied because it saves "
3893 "address of local label in a static variable");
3898 fun
->cannot_be_copied_reason
= reason
;
3899 fun
->cannot_be_copied_set
= true;
3904 static const char *inline_forbidden_reason
;
3906 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3907 iff a function cannot be inlined. Also sets the reason why. */
3910 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3911 struct walk_stmt_info
*wip
)
3913 tree fn
= (tree
) wip
->info
;
3915 gimple
*stmt
= gsi_stmt (*gsi
);
3917 switch (gimple_code (stmt
))
3920 /* Refuse to inline alloca call unless user explicitly forced so as
3921 this may change program's memory overhead drastically when the
3922 function using alloca is called in loop. In GCC present in
3923 SPEC2000 inlining into schedule_block cause it to require 2GB of
3924 RAM instead of 256MB. Don't do so for alloca calls emitted for
3925 VLA objects as those can't cause unbounded growth (they're always
3926 wrapped inside stack_save/stack_restore regions. */
3927 if (gimple_maybe_alloca_call_p (stmt
)
3928 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3929 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3931 inline_forbidden_reason
3932 = G_("function %q+F can never be inlined because it uses "
3933 "alloca (override using the always_inline attribute)");
3934 *handled_ops_p
= true;
3938 t
= gimple_call_fndecl (stmt
);
3942 /* We cannot inline functions that call setjmp. */
3943 if (setjmp_call_p (t
))
3945 inline_forbidden_reason
3946 = G_("function %q+F can never be inlined because it uses setjmp");
3947 *handled_ops_p
= true;
3951 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3952 switch (DECL_FUNCTION_CODE (t
))
3954 /* We cannot inline functions that take a variable number of
3956 case BUILT_IN_VA_START
:
3957 case BUILT_IN_NEXT_ARG
:
3958 case BUILT_IN_VA_END
:
3959 inline_forbidden_reason
3960 = G_("function %q+F can never be inlined because it "
3961 "uses variable argument lists");
3962 *handled_ops_p
= true;
3965 case BUILT_IN_LONGJMP
:
3966 /* We can't inline functions that call __builtin_longjmp at
3967 all. The non-local goto machinery really requires the
3968 destination be in a different function. If we allow the
3969 function calling __builtin_longjmp to be inlined into the
3970 function calling __builtin_setjmp, Things will Go Awry. */
3971 inline_forbidden_reason
3972 = G_("function %q+F can never be inlined because "
3973 "it uses setjmp-longjmp exception handling");
3974 *handled_ops_p
= true;
3977 case BUILT_IN_NONLOCAL_GOTO
:
3979 inline_forbidden_reason
3980 = G_("function %q+F can never be inlined because "
3981 "it uses non-local goto");
3982 *handled_ops_p
= true;
3985 case BUILT_IN_RETURN
:
3986 case BUILT_IN_APPLY_ARGS
:
3987 /* If a __builtin_apply_args caller would be inlined,
3988 it would be saving arguments of the function it has
3989 been inlined into. Similarly __builtin_return would
3990 return from the function the inline has been inlined into. */
3991 inline_forbidden_reason
3992 = G_("function %q+F can never be inlined because "
3993 "it uses %<__builtin_return%> or %<__builtin_apply_args%>");
3994 *handled_ops_p
= true;
4003 t
= gimple_goto_dest (stmt
);
4005 /* We will not inline a function which uses computed goto. The
4006 addresses of its local labels, which may be tucked into
4007 global storage, are of course not constant across
4008 instantiations, which causes unexpected behavior. */
4009 if (TREE_CODE (t
) != LABEL_DECL
)
4011 inline_forbidden_reason
4012 = G_("function %q+F can never be inlined "
4013 "because it contains a computed goto");
4014 *handled_ops_p
= true;
4023 *handled_ops_p
= false;
4027 /* Return true if FNDECL is a function that cannot be inlined into
4031 inline_forbidden_p (tree fndecl
)
4033 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
4034 struct walk_stmt_info wi
;
4036 bool forbidden_p
= false;
4038 /* First check for shared reasons not to copy the code. */
4039 inline_forbidden_reason
= copy_forbidden (fun
);
4040 if (inline_forbidden_reason
!= NULL
)
4043 /* Next, walk the statements of the function looking for
4044 constraucts we can't handle, or are non-optimal for inlining. */
4045 hash_set
<tree
> visited_nodes
;
4046 memset (&wi
, 0, sizeof (wi
));
4047 wi
.info
= (void *) fndecl
;
4048 wi
.pset
= &visited_nodes
;
4050 /* We cannot inline a function with a variable-sized parameter because we
4051 cannot materialize a temporary of such a type in the caller if need be.
4052 Note that the return case is not symmetrical because we can guarantee
4053 that a temporary is not needed by means of CALL_EXPR_RETURN_SLOT_OPT. */
4054 for (tree parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= DECL_CHAIN (parm
))
4055 if (!poly_int_tree_p (DECL_SIZE (parm
)))
4057 inline_forbidden_reason
4058 = G_("function %q+F can never be inlined because "
4059 "it has a VLA argument");
4063 FOR_EACH_BB_FN (bb
, fun
)
4066 gimple_seq seq
= bb_seq (bb
);
4067 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
4068 forbidden_p
= (ret
!= NULL
);
4076 /* Return false if the function FNDECL cannot be inlined on account of its
4077 attributes, true otherwise. */
4079 function_attribute_inlinable_p (const_tree fndecl
)
4081 if (targetm
.attribute_table
)
4085 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
4087 const_tree name
= get_attribute_name (a
);
4090 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
4091 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
4092 return targetm
.function_attribute_inlinable_p (fndecl
);
4099 /* Returns nonzero if FN is a function that does not have any
4100 fundamental inline blocking properties. */
4103 tree_inlinable_function_p (tree fn
)
4105 bool inlinable
= true;
4109 /* If we've already decided this function shouldn't be inlined,
4110 there's no need to check again. */
4111 if (DECL_UNINLINABLE (fn
))
4114 /* We only warn for functions declared `inline' by the user. */
4115 do_warning
= (opt_for_fn (fn
, warn_inline
)
4116 && DECL_DECLARED_INLINE_P (fn
)
4117 && !DECL_NO_INLINE_WARNING_P (fn
)
4118 && !DECL_IN_SYSTEM_HEADER (fn
));
4120 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
4123 && always_inline
== NULL
)
4126 warning (OPT_Winline
, "function %q+F can never be inlined because it "
4127 "is suppressed using %<-fno-inline%>", fn
);
4131 else if (!function_attribute_inlinable_p (fn
))
4134 warning (OPT_Winline
, "function %q+F can never be inlined because it "
4135 "uses attributes conflicting with inlining", fn
);
4139 else if (inline_forbidden_p (fn
))
4141 /* See if we should warn about uninlinable functions. Previously,
4142 some of these warnings would be issued while trying to expand
4143 the function inline, but that would cause multiple warnings
4144 about functions that would for example call alloca. But since
4145 this a property of the function, just one warning is enough.
4146 As a bonus we can now give more details about the reason why a
4147 function is not inlinable. */
4149 error (inline_forbidden_reason
, fn
);
4150 else if (do_warning
)
4151 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
4156 /* Squirrel away the result so that we don't have to check again. */
4157 DECL_UNINLINABLE (fn
) = !inlinable
;
4162 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
4163 word size and take possible memcpy call into account and return
4164 cost based on whether optimizing for size or speed according to SPEED_P. */
4167 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
4171 gcc_assert (!VOID_TYPE_P (type
));
4173 if (TREE_CODE (type
) == VECTOR_TYPE
)
4175 scalar_mode inner
= SCALAR_TYPE_MODE (TREE_TYPE (type
));
4176 machine_mode simd
= targetm
.vectorize
.preferred_simd_mode (inner
);
4178 = estimated_poly_value (GET_MODE_SIZE (TYPE_MODE (type
)));
4179 int simd_mode_size
= estimated_poly_value (GET_MODE_SIZE (simd
));
4180 return ((orig_mode_size
+ simd_mode_size
- 1)
4184 size
= int_size_in_bytes (type
);
4186 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
4187 /* Cost of a memcpy call, 3 arguments and the call. */
4190 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
4193 /* Returns cost of operation CODE, according to WEIGHTS */
4196 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
4197 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
4201 /* These are "free" conversions, or their presumed cost
4202 is folded into other operations. */
4207 case VIEW_CONVERT_EXPR
:
4210 /* Assign cost of 1 to usual operations.
4211 ??? We may consider mapping RTL costs to this. */
4217 case POINTER_PLUS_EXPR
:
4218 case POINTER_DIFF_EXPR
:
4221 case MULT_HIGHPART_EXPR
:
4223 case ADDR_SPACE_CONVERT_EXPR
:
4224 case FIXED_CONVERT_EXPR
:
4225 case FIX_TRUNC_EXPR
:
4244 case TRUTH_ANDIF_EXPR
:
4245 case TRUTH_ORIF_EXPR
:
4246 case TRUTH_AND_EXPR
:
4248 case TRUTH_XOR_EXPR
:
4249 case TRUTH_NOT_EXPR
:
4258 case UNORDERED_EXPR
:
4269 case PREDECREMENT_EXPR
:
4270 case PREINCREMENT_EXPR
:
4271 case POSTDECREMENT_EXPR
:
4272 case POSTINCREMENT_EXPR
:
4274 case REALIGN_LOAD_EXPR
:
4276 case WIDEN_PLUS_EXPR
:
4277 case WIDEN_MINUS_EXPR
:
4278 case WIDEN_SUM_EXPR
:
4279 case WIDEN_MULT_EXPR
:
4282 case WIDEN_MULT_PLUS_EXPR
:
4283 case WIDEN_MULT_MINUS_EXPR
:
4284 case WIDEN_LSHIFT_EXPR
:
4286 case VEC_WIDEN_PLUS_HI_EXPR
:
4287 case VEC_WIDEN_PLUS_LO_EXPR
:
4288 case VEC_WIDEN_MINUS_HI_EXPR
:
4289 case VEC_WIDEN_MINUS_LO_EXPR
:
4290 case VEC_WIDEN_MULT_HI_EXPR
:
4291 case VEC_WIDEN_MULT_LO_EXPR
:
4292 case VEC_WIDEN_MULT_EVEN_EXPR
:
4293 case VEC_WIDEN_MULT_ODD_EXPR
:
4294 case VEC_UNPACK_HI_EXPR
:
4295 case VEC_UNPACK_LO_EXPR
:
4296 case VEC_UNPACK_FLOAT_HI_EXPR
:
4297 case VEC_UNPACK_FLOAT_LO_EXPR
:
4298 case VEC_UNPACK_FIX_TRUNC_HI_EXPR
:
4299 case VEC_UNPACK_FIX_TRUNC_LO_EXPR
:
4300 case VEC_PACK_TRUNC_EXPR
:
4301 case VEC_PACK_SAT_EXPR
:
4302 case VEC_PACK_FIX_TRUNC_EXPR
:
4303 case VEC_PACK_FLOAT_EXPR
:
4304 case VEC_WIDEN_LSHIFT_HI_EXPR
:
4305 case VEC_WIDEN_LSHIFT_LO_EXPR
:
4306 case VEC_DUPLICATE_EXPR
:
4307 case VEC_SERIES_EXPR
:
4311 /* Few special cases of expensive operations. This is useful
4312 to avoid inlining on functions having too many of these. */
4313 case TRUNC_DIV_EXPR
:
4315 case FLOOR_DIV_EXPR
:
4316 case ROUND_DIV_EXPR
:
4317 case EXACT_DIV_EXPR
:
4318 case TRUNC_MOD_EXPR
:
4320 case FLOOR_MOD_EXPR
:
4321 case ROUND_MOD_EXPR
:
4323 if (TREE_CODE (op2
) != INTEGER_CST
)
4324 return weights
->div_mod_cost
;
4327 /* Bit-field insertion needs several shift and mask operations. */
4328 case BIT_INSERT_EXPR
:
4332 /* We expect a copy assignment with no operator. */
4333 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
4339 /* Estimate number of instructions that will be created by expanding
4340 the statements in the statement sequence STMTS.
4341 WEIGHTS contains weights attributed to various constructs. */
4344 estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
4347 gimple_stmt_iterator gsi
;
4350 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4351 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4357 /* Estimate number of instructions that will be created by expanding STMT.
4358 WEIGHTS contains weights attributed to various constructs. */
4361 estimate_num_insns (gimple
*stmt
, eni_weights
*weights
)
4364 enum gimple_code code
= gimple_code (stmt
);
4371 /* Try to estimate the cost of assignments. We have three cases to
4373 1) Simple assignments to registers;
4374 2) Stores to things that must live in memory. This includes
4375 "normal" stores to scalars, but also assignments of large
4376 structures, or constructors of big arrays;
4378 Let us look at the first two cases, assuming we have "a = b + C":
4379 <GIMPLE_ASSIGN <var_decl "a">
4380 <plus_expr <var_decl "b"> <constant C>>
4381 If "a" is a GIMPLE register, the assignment to it is free on almost
4382 any target, because "a" usually ends up in a real register. Hence
4383 the only cost of this expression comes from the PLUS_EXPR, and we
4384 can ignore the GIMPLE_ASSIGN.
4385 If "a" is not a GIMPLE register, the assignment to "a" will most
4386 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4387 of moving something into "a", which we compute using the function
4388 estimate_move_cost. */
4389 if (gimple_clobber_p (stmt
))
4390 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4392 lhs
= gimple_assign_lhs (stmt
);
4393 rhs
= gimple_assign_rhs1 (stmt
);
4397 /* Account for the cost of moving to / from memory. */
4398 if (gimple_store_p (stmt
))
4399 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
4400 if (gimple_assign_load_p (stmt
))
4401 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
4403 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
4404 gimple_assign_rhs1 (stmt
),
4405 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
4406 == GIMPLE_BINARY_RHS
4407 ? gimple_assign_rhs2 (stmt
) : NULL
);
4411 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4412 gimple_op (stmt
, 0),
4413 gimple_op (stmt
, 1));
4418 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4419 /* Take into account cost of the switch + guess 2 conditional jumps for
4422 TODO: once the switch expansion logic is sufficiently separated, we can
4423 do better job on estimating cost of the switch. */
4424 if (weights
->time_based
)
4425 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4427 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4435 if (gimple_call_internal_p (stmt
))
4437 else if ((decl
= gimple_call_fndecl (stmt
))
4438 && fndecl_built_in_p (decl
))
4440 /* Do not special case builtins where we see the body.
4441 This just confuse inliner. */
4442 struct cgraph_node
*node
;
4443 if ((node
= cgraph_node::get (decl
))
4444 && node
->definition
)
4446 /* For buitins that are likely expanded to nothing or
4447 inlined do not account operand costs. */
4448 else if (is_simple_builtin (decl
))
4450 else if (is_inexpensive_builtin (decl
))
4451 return weights
->target_builtin_call_cost
;
4452 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
4454 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4455 specialize the cheap expansion we do here.
4456 ??? This asks for a more general solution. */
4457 switch (DECL_FUNCTION_CODE (decl
))
4462 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4464 (&TREE_REAL_CST (gimple_call_arg (stmt
, 1)),
4466 return estimate_operator_cost
4467 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4468 gimple_call_arg (stmt
, 0));
4477 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4478 if (gimple_call_lhs (stmt
))
4479 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4480 weights
->time_based
);
4481 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4483 tree arg
= gimple_call_arg (stmt
, i
);
4484 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4485 weights
->time_based
);
4491 return weights
->return_cost
;
4497 case GIMPLE_PREDICT
:
4503 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4504 /* 1000 means infinity. This avoids overflows later
4505 with very long asm statements. */
4508 /* If this asm is asm inline, count anything as minimum size. */
4509 if (gimple_asm_inline_p (as_a
<gasm
*> (stmt
)))
4510 count
= MIN (1, count
);
4511 return MAX (1, count
);
4515 /* This is either going to be an external function call with one
4516 argument, or two register copy statements plus a goto. */
4519 case GIMPLE_EH_DISPATCH
:
4520 /* ??? This is going to turn into a switch statement. Ideally
4521 we'd have a look at the eh region and estimate the number of
4526 return estimate_num_insns_seq (
4527 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4530 case GIMPLE_EH_FILTER
:
4531 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4534 return estimate_num_insns_seq (gimple_catch_handler (
4535 as_a
<gcatch
*> (stmt
)),
4539 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4540 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4542 /* OMP directives are generally very expensive. */
4544 case GIMPLE_OMP_RETURN
:
4545 case GIMPLE_OMP_SECTIONS_SWITCH
:
4546 case GIMPLE_OMP_ATOMIC_STORE
:
4547 case GIMPLE_OMP_CONTINUE
:
4548 /* ...except these, which are cheap. */
4551 case GIMPLE_OMP_ATOMIC_LOAD
:
4552 return weights
->omp_cost
;
4554 case GIMPLE_OMP_FOR
:
4555 return (weights
->omp_cost
4556 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4557 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4559 case GIMPLE_OMP_PARALLEL
:
4560 case GIMPLE_OMP_TASK
:
4561 case GIMPLE_OMP_CRITICAL
:
4562 case GIMPLE_OMP_MASTER
:
4563 case GIMPLE_OMP_MASKED
:
4564 case GIMPLE_OMP_SCOPE
:
4565 case GIMPLE_OMP_TASKGROUP
:
4566 case GIMPLE_OMP_ORDERED
:
4567 case GIMPLE_OMP_SCAN
:
4568 case GIMPLE_OMP_SECTION
:
4569 case GIMPLE_OMP_SECTIONS
:
4570 case GIMPLE_OMP_SINGLE
:
4571 case GIMPLE_OMP_TARGET
:
4572 case GIMPLE_OMP_TEAMS
:
4573 return (weights
->omp_cost
4574 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4576 case GIMPLE_TRANSACTION
:
4577 return (weights
->tm_cost
4578 + estimate_num_insns_seq (gimple_transaction_body (
4579 as_a
<gtransaction
*> (stmt
)),
4589 /* Estimate number of instructions that will be created by expanding
4590 function FNDECL. WEIGHTS contains weights attributed to various
4594 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4596 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4597 gimple_stmt_iterator bsi
;
4601 gcc_assert (my_function
&& my_function
->cfg
);
4602 FOR_EACH_BB_FN (bb
, my_function
)
4604 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4605 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4612 /* Initializes weights used by estimate_num_insns. */
4615 init_inline_once (void)
4617 eni_size_weights
.call_cost
= 1;
4618 eni_size_weights
.indirect_call_cost
= 3;
4619 eni_size_weights
.target_builtin_call_cost
= 1;
4620 eni_size_weights
.div_mod_cost
= 1;
4621 eni_size_weights
.omp_cost
= 40;
4622 eni_size_weights
.tm_cost
= 10;
4623 eni_size_weights
.time_based
= false;
4624 eni_size_weights
.return_cost
= 1;
4626 /* Estimating time for call is difficult, since we have no idea what the
4627 called function does. In the current uses of eni_time_weights,
4628 underestimating the cost does less harm than overestimating it, so
4629 we choose a rather small value here. */
4630 eni_time_weights
.call_cost
= 10;
4631 eni_time_weights
.indirect_call_cost
= 15;
4632 eni_time_weights
.target_builtin_call_cost
= 1;
4633 eni_time_weights
.div_mod_cost
= 10;
4634 eni_time_weights
.omp_cost
= 40;
4635 eni_time_weights
.tm_cost
= 40;
4636 eni_time_weights
.time_based
= true;
4637 eni_time_weights
.return_cost
= 2;
4641 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4644 prepend_lexical_block (tree current_block
, tree new_block
)
4646 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4647 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4648 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4651 /* Add local variables from CALLEE to CALLER. */
4654 add_local_variables (struct function
*callee
, struct function
*caller
,
4660 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4661 if (!can_be_nonlocal (var
, id
))
4663 tree new_var
= remap_decl (var
, id
);
4665 /* Remap debug-expressions. */
4667 && DECL_HAS_DEBUG_EXPR_P (var
)
4670 tree tem
= DECL_DEBUG_EXPR (var
);
4671 bool old_regimplify
= id
->regimplify
;
4672 id
->remapping_type_depth
++;
4673 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4674 id
->remapping_type_depth
--;
4675 id
->regimplify
= old_regimplify
;
4676 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4677 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4679 add_local_decl (caller
, new_var
);
4683 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4684 have brought in or introduced any debug stmts for SRCVAR. */
4687 reset_debug_binding (copy_body_data
*id
, tree srcvar
, gimple_seq
*bindings
)
4689 tree
*remappedvarp
= id
->decl_map
->get (srcvar
);
4694 if (!VAR_P (*remappedvarp
))
4697 if (*remappedvarp
== id
->retvar
)
4700 tree tvar
= target_for_debug_bind (*remappedvarp
);
4704 gdebug
*stmt
= gimple_build_debug_bind (tvar
, NULL_TREE
,
4706 gimple_seq_add_stmt (bindings
, stmt
);
4709 /* For each inlined variable for which we may have debug bind stmts,
4710 add before GSI a final debug stmt resetting it, marking the end of
4711 its life, so that var-tracking knows it doesn't have to compute
4712 further locations for it. */
4715 reset_debug_bindings (copy_body_data
*id
, gimple_stmt_iterator gsi
)
4719 gimple_seq bindings
= NULL
;
4721 if (!gimple_in_ssa_p (id
->src_cfun
))
4724 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
4727 for (var
= DECL_ARGUMENTS (id
->src_fn
);
4728 var
; var
= DECL_CHAIN (var
))
4729 reset_debug_binding (id
, var
, &bindings
);
4731 FOR_EACH_LOCAL_DECL (id
->src_cfun
, ix
, var
)
4732 reset_debug_binding (id
, var
, &bindings
);
4734 gsi_insert_seq_before_without_update (&gsi
, bindings
, GSI_SAME_STMT
);
4737 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4740 expand_call_inline (basic_block bb
, gimple
*stmt
, copy_body_data
*id
,
4745 hash_map
<tree
, tree
> *dst
;
4746 hash_map
<tree
, tree
> *st
= NULL
;
4749 struct cgraph_edge
*cg_edge
;
4750 cgraph_inline_failed_t reason
;
4751 basic_block return_block
;
4753 gimple_stmt_iterator gsi
, stmt_gsi
;
4754 bool successfully_inlined
= false;
4755 bool purge_dead_abnormal_edges
;
4757 unsigned int prop_mask
, src_properties
;
4758 struct function
*dst_cfun
;
4761 gimple
*simtenter_stmt
= NULL
;
4762 vec
<tree
> *simtvars_save
;
4764 /* The gimplifier uses input_location in too many places, such as
4765 internal_get_tmp_var (). */
4766 location_t saved_location
= input_location
;
4767 input_location
= gimple_location (stmt
);
4769 /* From here on, we're only interested in CALL_EXPRs. */
4770 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4774 cg_edge
= id
->dst_node
->get_edge (stmt
);
4775 gcc_checking_assert (cg_edge
);
4776 /* First, see if we can figure out what function is being called.
4777 If we cannot, then there is no hope of inlining the function. */
4778 if (cg_edge
->indirect_unknown_callee
)
4780 fn
= cg_edge
->callee
->decl
;
4781 gcc_checking_assert (fn
);
4783 /* If FN is a declaration of a function in a nested scope that was
4784 globally declared inline, we don't set its DECL_INITIAL.
4785 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4786 C++ front-end uses it for cdtors to refer to their internal
4787 declarations, that are not real functions. Fortunately those
4788 don't have trees to be saved, so we can tell by checking their
4790 if (!DECL_INITIAL (fn
)
4791 && DECL_ABSTRACT_ORIGIN (fn
)
4792 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4793 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4795 /* Don't try to inline functions that are not well-suited to inlining. */
4796 if (cg_edge
->inline_failed
)
4798 reason
= cg_edge
->inline_failed
;
4799 /* If this call was originally indirect, we do not want to emit any
4800 inlining related warnings or sorry messages because there are no
4801 guarantees regarding those. */
4802 if (cg_edge
->indirect_inlining_edge
)
4805 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4806 /* For extern inline functions that get redefined we always
4807 silently ignored always_inline flag. Better behavior would
4808 be to be able to keep both bodies and use extern inline body
4809 for inlining, but we can't do that because frontends overwrite
4811 && !cg_edge
->callee
->redefined_extern_inline
4812 /* During early inline pass, report only when optimization is
4814 && (symtab
->global_info_ready
4816 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4817 /* PR 20090218-1_0.c. Body can be provided by another module. */
4818 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4820 error ("inlining failed in call to %<always_inline%> %q+F: %s", fn
,
4821 cgraph_inline_failed_string (reason
));
4822 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4823 inform (gimple_location (stmt
), "called from here");
4824 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4825 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4826 "called from this function");
4828 else if (opt_for_fn (fn
, warn_inline
)
4829 && DECL_DECLARED_INLINE_P (fn
)
4830 && !DECL_NO_INLINE_WARNING_P (fn
)
4831 && !DECL_IN_SYSTEM_HEADER (fn
)
4832 && reason
!= CIF_UNSPECIFIED
4833 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4834 /* Do not warn about not inlined recursive calls. */
4835 && !cg_edge
->recursive_p ()
4836 /* Avoid warnings during early inline pass. */
4837 && symtab
->global_info_ready
)
4839 auto_diagnostic_group d
;
4840 if (warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4841 fn
, _(cgraph_inline_failed_string (reason
))))
4843 if (gimple_location (stmt
) != UNKNOWN_LOCATION
)
4844 inform (gimple_location (stmt
), "called from here");
4845 else if (DECL_SOURCE_LOCATION (cfun
->decl
) != UNKNOWN_LOCATION
)
4846 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
4847 "called from this function");
4852 id
->src_node
= cg_edge
->callee
;
4854 /* If callee is thunk, all we need is to adjust the THIS pointer
4855 and redirect to function being thunked. */
4856 if (id
->src_node
->thunk
)
4859 tree virtual_offset
= NULL
;
4860 profile_count count
= cg_edge
->count
;
4862 gimple_stmt_iterator iter
= gsi_for_stmt (stmt
);
4863 thunk_info
*info
= thunk_info::get (id
->src_node
);
4865 cgraph_edge::remove (cg_edge
);
4866 edge
= id
->src_node
->callees
->clone (id
->dst_node
, call_stmt
,
4868 profile_count::one (),
4869 profile_count::one (),
4871 edge
->count
= count
;
4872 if (info
->virtual_offset_p
)
4873 virtual_offset
= size_int (info
->virtual_value
);
4874 op
= create_tmp_reg_fn (cfun
, TREE_TYPE (gimple_call_arg (stmt
, 0)),
4876 gsi_insert_before (&iter
, gimple_build_assign (op
,
4877 gimple_call_arg (stmt
, 0)),
4879 gcc_assert (info
->this_adjusting
);
4880 op
= thunk_adjust (&iter
, op
, 1, info
->fixed_offset
,
4881 virtual_offset
, info
->indirect_offset
);
4883 gimple_call_set_arg (stmt
, 0, op
);
4884 gimple_call_set_fndecl (stmt
, edge
->callee
->decl
);
4886 id
->src_node
->remove ();
4887 successfully_inlined
= expand_call_inline (bb
, stmt
, id
, to_purge
);
4888 maybe_remove_unused_call_args (cfun
, stmt
);
4889 /* This used to return true even though we do fail to inline in
4890 some cases. See PR98525. */
4893 fn
= cg_edge
->callee
->decl
;
4894 cg_edge
->callee
->get_untransformed_body ();
4896 if (flag_checking
&& cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4897 cg_edge
->callee
->verify ();
4899 /* We will be inlining this callee. */
4900 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4902 /* Update the callers EH personality. */
4903 if (DECL_FUNCTION_PERSONALITY (fn
))
4904 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4905 = DECL_FUNCTION_PERSONALITY (fn
);
4907 /* Split the block before the GIMPLE_CALL. */
4908 stmt_gsi
= gsi_for_stmt (stmt
);
4909 gsi_prev (&stmt_gsi
);
4910 e
= split_block (bb
, gsi_end_p (stmt_gsi
) ? NULL
: gsi_stmt (stmt_gsi
));
4912 return_block
= e
->dest
;
4915 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4916 been the source of abnormal edges. In this case, schedule
4917 the removal of dead abnormal edges. */
4918 gsi
= gsi_start_bb (return_block
);
4920 purge_dead_abnormal_edges
= gsi_end_p (gsi
);
4922 stmt_gsi
= gsi_start_bb (return_block
);
4924 /* Build a block containing code to initialize the arguments, the
4925 actual inline expansion of the body, and a label for the return
4926 statements within the function to jump to. The type of the
4927 statement expression is the return type of the function call.
4928 ??? If the call does not have an associated block then we will
4929 remap all callee blocks to NULL, effectively dropping most of
4930 its debug information. This should only happen for calls to
4931 artificial decls inserted by the compiler itself. We need to
4932 either link the inlined blocks into the caller block tree or
4933 not refer to them in any way to not break GC for locations. */
4934 if (tree block
= gimple_block (stmt
))
4936 /* We do want to assign a not UNKNOWN_LOCATION BLOCK_SOURCE_LOCATION
4937 to make inlined_function_outer_scope_p return true on this BLOCK. */
4938 location_t loc
= LOCATION_LOCUS (gimple_location (stmt
));
4939 if (loc
== UNKNOWN_LOCATION
)
4940 loc
= LOCATION_LOCUS (DECL_SOURCE_LOCATION (fn
));
4941 if (loc
== UNKNOWN_LOCATION
)
4942 loc
= BUILTINS_LOCATION
;
4943 id
->block
= make_node (BLOCK
);
4944 BLOCK_ABSTRACT_ORIGIN (id
->block
) = DECL_ORIGIN (fn
);
4945 BLOCK_SOURCE_LOCATION (id
->block
) = loc
;
4946 prepend_lexical_block (block
, id
->block
);
4949 /* Local declarations will be replaced by their equivalents in this map. */
4951 id
->decl_map
= new hash_map
<tree
, tree
>;
4952 dst
= id
->debug_map
;
4953 id
->debug_map
= NULL
;
4954 if (flag_stack_reuse
!= SR_NONE
)
4955 id
->add_clobbers_to_eh_landing_pads
= last_basic_block_for_fn (cfun
);
4957 /* Record the function we are about to inline. */
4959 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4960 id
->reset_location
= DECL_IGNORED_P (fn
);
4961 id
->call_stmt
= call_stmt
;
4963 /* When inlining into an OpenMP SIMD-on-SIMT loop, arrange for new automatic
4964 variables to be added to IFN_GOMP_SIMT_ENTER argument list. */
4965 dst_cfun
= DECL_STRUCT_FUNCTION (id
->dst_fn
);
4966 simtvars_save
= id
->dst_simt_vars
;
4967 if (!(dst_cfun
->curr_properties
& PROP_gimple_lomp_dev
)
4968 && (simduid
= bb
->loop_father
->simduid
) != NULL_TREE
4969 && (simduid
= ssa_default_def (dst_cfun
, simduid
)) != NULL_TREE
4970 && single_imm_use (simduid
, &use
, &simtenter_stmt
)
4971 && is_gimple_call (simtenter_stmt
)
4972 && gimple_call_internal_p (simtenter_stmt
, IFN_GOMP_SIMT_ENTER
))
4973 vec_alloc (id
->dst_simt_vars
, 0);
4975 id
->dst_simt_vars
= NULL
;
4977 if (profile_status_for_fn (id
->src_cfun
) == PROFILE_ABSENT
)
4978 profile_status_for_fn (dst_cfun
) = PROFILE_ABSENT
;
4980 /* If the src function contains an IFN_VA_ARG, then so will the dst
4981 function after inlining. Likewise for IFN_GOMP_USE_SIMT. */
4982 prop_mask
= PROP_gimple_lva
| PROP_gimple_lomp_dev
;
4983 src_properties
= id
->src_cfun
->curr_properties
& prop_mask
;
4984 if (src_properties
!= prop_mask
)
4985 dst_cfun
->curr_properties
&= src_properties
| ~prop_mask
;
4986 dst_cfun
->calls_eh_return
|= id
->src_cfun
->calls_eh_return
;
4987 id
->dst_node
->calls_declare_variant_alt
4988 |= id
->src_node
->calls_declare_variant_alt
;
4990 gcc_assert (!id
->src_cfun
->after_inlining
);
4993 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4995 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4996 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
5000 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
5001 if (debug_nonbind_markers_p
&& debug_inline_points
&& id
->block
5002 && inlined_function_outer_scope_p (id
->block
))
5004 gimple_stmt_iterator si
= gsi_last_bb (bb
);
5005 gsi_insert_after (&si
, gimple_build_debug_inline_entry
5006 (id
->block
, DECL_SOURCE_LOCATION (id
->src_fn
)),
5010 if (DECL_INITIAL (fn
))
5012 if (gimple_block (stmt
))
5016 prepend_lexical_block (id
->block
,
5017 remap_blocks (DECL_INITIAL (fn
), id
));
5018 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
5019 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
5021 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
5022 otherwise for DWARF DW_TAG_formal_parameter will not be children of
5023 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
5024 under it. The parameters can be then evaluated in the debugger,
5025 but don't show in backtraces. */
5026 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
5027 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
5030 *var
= TREE_CHAIN (v
);
5031 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
5032 BLOCK_VARS (id
->block
) = v
;
5035 var
= &TREE_CHAIN (*var
);
5038 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
5041 /* Return statements in the function body will be replaced by jumps
5042 to the RET_LABEL. */
5043 gcc_assert (DECL_INITIAL (fn
));
5044 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
5046 /* Find the LHS to which the result of this call is assigned. */
5048 if (gimple_call_lhs (stmt
))
5050 modify_dest
= gimple_call_lhs (stmt
);
5052 /* The function which we are inlining might not return a value,
5053 in which case we should issue a warning that the function
5054 does not return a value. In that case the optimizers will
5055 see that the variable to which the value is assigned was not
5056 initialized. We do not want to issue a warning about that
5057 uninitialized variable. */
5058 if (DECL_P (modify_dest
))
5059 suppress_warning (modify_dest
, OPT_Wuninitialized
);
5061 if (gimple_call_return_slot_opt_p (call_stmt
))
5063 return_slot
= modify_dest
;
5070 /* If we are inlining a call to the C++ operator new, we don't want
5071 to use type based alias analysis on the return value. Otherwise
5072 we may get confused if the compiler sees that the inlined new
5073 function returns a pointer which was just deleted. See bug
5075 if (DECL_IS_OPERATOR_NEW_P (fn
))
5081 /* Declare the return variable for the function. */
5082 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
5084 /* Add local vars in this inlined callee to caller. */
5085 add_local_variables (id
->src_cfun
, cfun
, id
);
5087 if (dump_enabled_p ())
5090 snprintf (buf
, sizeof(buf
), "%4.2f",
5091 cg_edge
->sreal_frequency ().to_double ());
5092 dump_printf_loc (MSG_NOTE
| MSG_PRIORITY_INTERNALS
,
5094 "Inlining %C to %C with frequency %s\n",
5095 id
->src_node
, id
->dst_node
, buf
);
5096 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5098 id
->src_node
->dump (dump_file
);
5099 id
->dst_node
->dump (dump_file
);
5103 /* This is it. Duplicate the callee body. Assume callee is
5104 pre-gimplified. Note that we must not alter the caller
5105 function in any way before this point, as this CALL_EXPR may be
5106 a self-referential call; if we're calling ourselves, we need to
5107 duplicate our body before altering anything. */
5108 copy_body (id
, bb
, return_block
, NULL
);
5110 reset_debug_bindings (id
, stmt_gsi
);
5112 if (flag_stack_reuse
!= SR_NONE
)
5113 for (tree p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
5114 if (!TREE_THIS_VOLATILE (p
))
5116 /* The value associated with P is a local temporary only if
5117 there is no value associated with P in the debug map. */
5118 tree
*varp
= id
->decl_map
->get (p
);
5121 && !is_gimple_reg (*varp
)
5122 && !(id
->debug_map
&& id
->debug_map
->get (p
)))
5124 tree clobber
= build_clobber (TREE_TYPE (*varp
));
5125 gimple
*clobber_stmt
;
5126 clobber_stmt
= gimple_build_assign (*varp
, clobber
);
5127 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
5128 gsi_insert_before (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
5132 /* Reset the escaped solution. */
5133 if (cfun
->gimple_df
)
5134 pt_solution_reset (&cfun
->gimple_df
->escaped
);
5136 /* Add new automatic variables to IFN_GOMP_SIMT_ENTER arguments. */
5137 if (id
->dst_simt_vars
&& id
->dst_simt_vars
->length () > 0)
5139 size_t nargs
= gimple_call_num_args (simtenter_stmt
);
5140 vec
<tree
> *vars
= id
->dst_simt_vars
;
5141 auto_vec
<tree
> newargs (nargs
+ vars
->length ());
5142 for (size_t i
= 0; i
< nargs
; i
++)
5143 newargs
.quick_push (gimple_call_arg (simtenter_stmt
, i
));
5144 for (tree
*pvar
= vars
->begin (); pvar
!= vars
->end (); pvar
++)
5146 tree ptrtype
= build_pointer_type (TREE_TYPE (*pvar
));
5147 newargs
.quick_push (build1 (ADDR_EXPR
, ptrtype
, *pvar
));
5149 gcall
*g
= gimple_build_call_internal_vec (IFN_GOMP_SIMT_ENTER
, newargs
);
5150 gimple_call_set_lhs (g
, gimple_call_lhs (simtenter_stmt
));
5151 gimple_stmt_iterator gsi
= gsi_for_stmt (simtenter_stmt
);
5152 gsi_replace (&gsi
, g
, false);
5154 vec_free (id
->dst_simt_vars
);
5155 id
->dst_simt_vars
= simtvars_save
;
5160 delete id
->debug_map
;
5161 id
->debug_map
= dst
;
5163 delete id
->decl_map
;
5166 /* Unlink the calls virtual operands before replacing it. */
5167 unlink_stmt_vdef (stmt
);
5168 if (gimple_vdef (stmt
)
5169 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
5170 release_ssa_name (gimple_vdef (stmt
));
5172 /* If the inlined function returns a result that we care about,
5173 substitute the GIMPLE_CALL with an assignment of the return
5174 variable to the LHS of the call. That is, if STMT was
5175 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
5176 if (use_retvar
&& gimple_call_lhs (stmt
))
5178 gimple
*old_stmt
= stmt
;
5179 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
5180 gimple_set_location (stmt
, gimple_location (old_stmt
));
5181 gsi_replace (&stmt_gsi
, stmt
, false);
5182 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
5183 /* Append a clobber for id->retvar if easily possible. */
5184 if (flag_stack_reuse
!= SR_NONE
5186 && VAR_P (id
->retvar
)
5187 && id
->retvar
!= return_slot
5188 && id
->retvar
!= modify_dest
5189 && !TREE_THIS_VOLATILE (id
->retvar
)
5190 && !is_gimple_reg (id
->retvar
)
5191 && !stmt_ends_bb_p (stmt
))
5193 tree clobber
= build_clobber (TREE_TYPE (id
->retvar
));
5194 gimple
*clobber_stmt
;
5195 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
5196 gimple_set_location (clobber_stmt
, gimple_location (old_stmt
));
5197 gsi_insert_after (&stmt_gsi
, clobber_stmt
, GSI_SAME_STMT
);
5202 /* Handle the case of inlining a function with no return
5203 statement, which causes the return value to become undefined. */
5204 if (gimple_call_lhs (stmt
)
5205 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
5207 tree name
= gimple_call_lhs (stmt
);
5208 tree var
= SSA_NAME_VAR (name
);
5209 tree def
= var
? ssa_default_def (cfun
, var
) : NULL
;
5213 /* If the variable is used undefined, make this name
5214 undefined via a move. */
5215 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
5216 gsi_replace (&stmt_gsi
, stmt
, true);
5222 var
= create_tmp_reg_fn (cfun
, TREE_TYPE (name
), NULL
);
5223 SET_SSA_NAME_VAR_OR_IDENTIFIER (name
, var
);
5225 /* Otherwise make this variable undefined. */
5226 gsi_remove (&stmt_gsi
, true);
5227 set_ssa_default_def (cfun
, var
, name
);
5228 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
5231 /* Replace with a clobber for id->retvar. */
5232 else if (flag_stack_reuse
!= SR_NONE
5234 && VAR_P (id
->retvar
)
5235 && id
->retvar
!= return_slot
5236 && id
->retvar
!= modify_dest
5237 && !TREE_THIS_VOLATILE (id
->retvar
)
5238 && !is_gimple_reg (id
->retvar
))
5240 tree clobber
= build_clobber (TREE_TYPE (id
->retvar
));
5241 gimple
*clobber_stmt
;
5242 clobber_stmt
= gimple_build_assign (id
->retvar
, clobber
);
5243 gimple_set_location (clobber_stmt
, gimple_location (stmt
));
5244 gsi_replace (&stmt_gsi
, clobber_stmt
, false);
5245 maybe_clean_or_replace_eh_stmt (stmt
, clobber_stmt
);
5248 gsi_remove (&stmt_gsi
, true);
5251 if (purge_dead_abnormal_edges
)
5252 bitmap_set_bit (to_purge
, return_block
->index
);
5254 /* If the value of the new expression is ignored, that's OK. We
5255 don't warn about this for CALL_EXPRs, so we shouldn't warn about
5256 the equivalent inlined version either. */
5257 if (is_gimple_assign (stmt
))
5259 gcc_assert (gimple_assign_single_p (stmt
)
5260 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
5261 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
5264 id
->add_clobbers_to_eh_landing_pads
= 0;
5266 /* Output the inlining info for this abstract function, since it has been
5267 inlined. If we don't do this now, we can lose the information about the
5268 variables in the function when the blocks get blown away as soon as we
5269 remove the cgraph node. */
5270 if (gimple_block (stmt
))
5271 (*debug_hooks
->outlining_inline_function
) (fn
);
5273 /* Update callgraph if needed. */
5274 cg_edge
->callee
->remove ();
5276 id
->block
= NULL_TREE
;
5277 id
->retvar
= NULL_TREE
;
5278 successfully_inlined
= true;
5281 input_location
= saved_location
;
5282 return successfully_inlined
;
5285 /* Expand call statements reachable from STMT_P.
5286 We can only have CALL_EXPRs as the "toplevel" tree code or nested
5287 in a MODIFY_EXPR. */
5290 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
,
5293 gimple_stmt_iterator gsi
;
5294 bool inlined
= false;
5296 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
);)
5298 gimple
*stmt
= gsi_stmt (gsi
);
5301 if (is_gimple_call (stmt
)
5302 && !gimple_call_internal_p (stmt
))
5303 inlined
|= expand_call_inline (bb
, stmt
, id
, to_purge
);
5310 /* Walk all basic blocks created after FIRST and try to fold every statement
5311 in the STATEMENTS pointer set. */
5314 fold_marked_statements (int first
, hash_set
<gimple
*> *statements
)
5316 auto_bitmap to_purge
;
5318 auto_vec
<edge
, 20> stack (n_basic_blocks_for_fn (cfun
) + 2);
5319 auto_sbitmap
visited (last_basic_block_for_fn (cfun
));
5320 bitmap_clear (visited
);
5322 stack
.quick_push (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5323 while (!stack
.is_empty ())
5325 /* Look at the edge on the top of the stack. */
5326 edge e
= stack
.pop ();
5327 basic_block dest
= e
->dest
;
5329 if (dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
)
5330 || bitmap_bit_p (visited
, dest
->index
))
5333 bitmap_set_bit (visited
, dest
->index
);
5335 if (dest
->index
>= first
)
5336 for (gimple_stmt_iterator gsi
= gsi_start_bb (dest
);
5337 !gsi_end_p (gsi
); gsi_next (&gsi
))
5339 if (!statements
->contains (gsi_stmt (gsi
)))
5342 gimple
*old_stmt
= gsi_stmt (gsi
);
5343 tree old_decl
= (is_gimple_call (old_stmt
)
5344 ? gimple_call_fndecl (old_stmt
) : 0);
5345 if (old_decl
&& fndecl_built_in_p (old_decl
))
5347 /* Folding builtins can create multiple instructions,
5348 we need to look at all of them. */
5349 gimple_stmt_iterator i2
= gsi
;
5351 if (fold_stmt (&gsi
))
5354 /* If a builtin at the end of a bb folded into nothing,
5355 the following loop won't work. */
5356 if (gsi_end_p (gsi
))
5358 cgraph_update_edges_for_call_stmt (old_stmt
,
5363 i2
= gsi_start_bb (dest
);
5368 new_stmt
= gsi_stmt (i2
);
5369 update_stmt (new_stmt
);
5370 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5373 if (new_stmt
== gsi_stmt (gsi
))
5375 /* It is okay to check only for the very last
5376 of these statements. If it is a throwing
5377 statement nothing will change. If it isn't
5378 this can remove EH edges. If that weren't
5379 correct then because some intermediate stmts
5380 throw, but not the last one. That would mean
5381 we'd have to split the block, which we can't
5382 here and we'd loose anyway. And as builtins
5383 probably never throw, this all
5385 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
5387 bitmap_set_bit (to_purge
, dest
->index
);
5394 else if (fold_stmt (&gsi
))
5396 /* Re-read the statement from GSI as fold_stmt() may
5398 gimple
*new_stmt
= gsi_stmt (gsi
);
5399 update_stmt (new_stmt
);
5401 if (is_gimple_call (old_stmt
)
5402 || is_gimple_call (new_stmt
))
5403 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
5406 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
5407 bitmap_set_bit (to_purge
, dest
->index
);
5411 if (EDGE_COUNT (dest
->succs
) > 0)
5413 /* Avoid warnings emitted from folding statements that
5414 became unreachable because of inlined function parameter
5416 e
= find_taken_edge (dest
, NULL_TREE
);
5418 stack
.quick_push (e
);
5422 FOR_EACH_EDGE (e
, ei
, dest
->succs
)
5423 stack
.safe_push (e
);
5428 gimple_purge_all_dead_eh_edges (to_purge
);
5431 /* Expand calls to inline functions in the body of FN. */
5434 optimize_inline_calls (tree fn
)
5438 int last
= n_basic_blocks_for_fn (cfun
);
5439 bool inlined_p
= false;
5442 memset (&id
, 0, sizeof (id
));
5444 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
5445 gcc_assert (id
.dst_node
->definition
);
5447 /* Or any functions that aren't finished yet. */
5448 if (current_function_decl
)
5449 id
.dst_fn
= current_function_decl
;
5451 id
.copy_decl
= copy_decl_maybe_to_var
;
5452 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5453 id
.transform_new_cfg
= false;
5454 id
.transform_return_to_modify
= true;
5455 id
.transform_parameter
= true;
5456 id
.transform_lang_insert_block
= NULL
;
5457 id
.statements_to_fold
= new hash_set
<gimple
*>;
5459 push_gimplify_context ();
5461 /* We make no attempts to keep dominance info up-to-date. */
5462 free_dominance_info (CDI_DOMINATORS
);
5463 free_dominance_info (CDI_POST_DOMINATORS
);
5465 /* Register specific gimple functions. */
5466 gimple_register_cfg_hooks ();
5468 /* Reach the trees by walking over the CFG, and note the
5469 enclosing basic-blocks in the call edges. */
5470 /* We walk the blocks going forward, because inlined function bodies
5471 will split id->current_basic_block, and the new blocks will
5472 follow it; we'll trudge through them, processing their CALL_EXPRs
5474 auto_bitmap to_purge
;
5475 FOR_EACH_BB_FN (bb
, cfun
)
5476 inlined_p
|= gimple_expand_calls_inline (bb
, &id
, to_purge
);
5478 pop_gimplify_context (NULL
);
5482 struct cgraph_edge
*e
;
5484 id
.dst_node
->verify ();
5486 /* Double check that we inlined everything we are supposed to inline. */
5487 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
5488 gcc_assert (e
->inline_failed
);
5491 /* If we didn't inline into the function there is nothing to do. */
5494 delete id
.statements_to_fold
;
5498 /* Fold queued statements. */
5499 update_max_bb_count ();
5500 fold_marked_statements (last
, id
.statements_to_fold
);
5501 delete id
.statements_to_fold
;
5503 /* Finally purge EH and abnormal edges from the call stmts we inlined.
5504 We need to do this after fold_marked_statements since that may walk
5505 the SSA use-def chain. */
5508 EXECUTE_IF_SET_IN_BITMAP (to_purge
, 0, i
, bi
)
5510 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
5513 gimple_purge_dead_eh_edges (bb
);
5514 gimple_purge_dead_abnormal_call_edges (bb
);
5518 gcc_assert (!id
.debug_stmts
.exists ());
5520 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5523 delete_unreachable_blocks_update_callgraph (id
.dst_node
, false);
5524 id
.dst_node
->calls_comdat_local
= id
.dst_node
->check_calls_comdat_local_p ();
5527 id
.dst_node
->verify ();
5529 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5530 not possible yet - the IPA passes might make various functions to not
5531 throw and they don't care to proactively update local EH info. This is
5532 done later in fixup_cfg pass that also execute the verification. */
5533 return (TODO_update_ssa
5535 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
5536 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
5537 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
5538 ? TODO_rebuild_frequencies
: 0));
5541 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5544 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5546 enum tree_code code
= TREE_CODE (*tp
);
5547 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
5549 /* We make copies of most nodes. */
5550 if (IS_EXPR_CODE_CLASS (cl
)
5551 || code
== TREE_LIST
5553 || code
== TYPE_DECL
5554 || code
== OMP_CLAUSE
)
5556 /* Because the chain gets clobbered when we make a copy, we save it
5558 tree chain
= NULL_TREE
, new_tree
;
5560 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
5561 chain
= TREE_CHAIN (*tp
);
5563 /* Copy the node. */
5564 new_tree
= copy_node (*tp
);
5568 /* Now, restore the chain, if appropriate. That will cause
5569 walk_tree to walk into the chain as well. */
5570 if (code
== PARM_DECL
5571 || code
== TREE_LIST
5572 || code
== OMP_CLAUSE
)
5573 TREE_CHAIN (*tp
) = chain
;
5575 /* For now, we don't update BLOCKs when we make copies. So, we
5576 have to nullify all BIND_EXPRs. */
5577 if (TREE_CODE (*tp
) == BIND_EXPR
)
5578 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5580 else if (code
== CONSTRUCTOR
)
5582 /* CONSTRUCTOR nodes need special handling because
5583 we need to duplicate the vector of elements. */
5586 new_tree
= copy_node (*tp
);
5587 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5590 else if (code
== STATEMENT_LIST
)
5591 /* We used to just abort on STATEMENT_LIST, but we can run into them
5592 with statement-expressions (c++/40975). */
5593 copy_statement_list (tp
);
5594 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5596 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5598 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5603 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5604 information indicating to what new SAVE_EXPR this one should be mapped,
5605 use that one. Otherwise, create a new node and enter it in ST. FN is
5606 the function into which the copy will be placed. */
5609 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5614 /* See if we already encountered this SAVE_EXPR. */
5617 /* If we didn't already remap this SAVE_EXPR, do so now. */
5620 t
= copy_node (*tp
);
5622 /* Remember this SAVE_EXPR. */
5624 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5629 /* We've already walked into this SAVE_EXPR; don't do it again. */
5634 /* Replace this SAVE_EXPR with the copy. */
5638 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5639 label, copies the declaration and enters it in the splay_tree in DATA (which
5640 is really a 'copy_body_data *'. */
5643 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5644 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5645 struct walk_stmt_info
*wi
)
5647 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5648 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5652 tree decl
= gimple_label_label (stmt
);
5654 /* Copy the decl and remember the copy. */
5655 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5661 static gimple_seq
duplicate_remap_omp_clause_seq (gimple_seq seq
,
5662 struct walk_stmt_info
*wi
);
5664 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5665 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5666 remaps all local declarations to appropriate replacements in gimple
5670 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5672 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5673 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5674 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5678 /* For recursive invocations this is no longer the LHS itself. */
5679 bool is_lhs
= wi
->is_lhs
;
5682 if (TREE_CODE (expr
) == SSA_NAME
)
5684 *tp
= remap_ssa_name (*tp
, id
);
5687 SSA_NAME_DEF_STMT (*tp
) = gsi_stmt (wi
->gsi
);
5689 /* Only a local declaration (variable or label). */
5690 else if ((VAR_P (expr
) && !TREE_STATIC (expr
))
5691 || TREE_CODE (expr
) == LABEL_DECL
)
5693 /* Lookup the declaration. */
5696 /* If it's there, remap it. */
5701 else if (TREE_CODE (expr
) == STATEMENT_LIST
5702 || TREE_CODE (expr
) == BIND_EXPR
5703 || TREE_CODE (expr
) == SAVE_EXPR
)
5705 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5707 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5708 It's OK for this to happen if it was part of a subtree that
5709 isn't immediately expanded, such as operand 2 of another
5711 if (!TREE_OPERAND (expr
, 1))
5713 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5714 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5717 else if (TREE_CODE (expr
) == OMP_CLAUSE
)
5719 /* Before the omplower pass completes, some OMP clauses can contain
5720 sequences that are neither copied by gimple_seq_copy nor walked by
5721 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5722 in those situations, we have to copy and process them explicitely. */
5724 if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LASTPRIVATE
)
5726 gimple_seq seq
= OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
);
5727 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5728 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr
) = seq
;
5730 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_LINEAR
)
5732 gimple_seq seq
= OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
);
5733 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5734 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr
) = seq
;
5736 else if (OMP_CLAUSE_CODE (expr
) == OMP_CLAUSE_REDUCTION
)
5738 gimple_seq seq
= OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
);
5739 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5740 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr
) = seq
;
5741 seq
= OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
);
5742 seq
= duplicate_remap_omp_clause_seq (seq
, wi
);
5743 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr
) = seq
;
5747 /* Keep iterating. */
5752 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5753 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5754 remaps all local declarations to appropriate replacements in gimple
5758 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5759 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5760 struct walk_stmt_info
*wi
)
5762 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5763 gimple
*gs
= gsi_stmt (*gsip
);
5765 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5767 tree block
= gimple_bind_block (stmt
);
5771 remap_block (&block
, id
);
5772 gimple_bind_set_block (stmt
, block
);
5775 /* This will remap a lot of the same decls again, but this should be
5777 if (gimple_bind_vars (stmt
))
5779 tree old_var
, decls
= gimple_bind_vars (stmt
);
5781 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
5782 if (!can_be_nonlocal (old_var
, id
)
5783 && ! variably_modified_type_p (TREE_TYPE (old_var
), id
->src_fn
))
5784 remap_decl (old_var
, id
);
5786 gcc_checking_assert (!id
->prevent_decl_creation_for_types
);
5787 id
->prevent_decl_creation_for_types
= true;
5788 gimple_bind_set_vars (stmt
, remap_decls (decls
, NULL
, id
));
5789 id
->prevent_decl_creation_for_types
= false;
5793 /* Keep iterating. */
5797 /* Create a copy of SEQ and remap all decls in it. */
5800 duplicate_remap_omp_clause_seq (gimple_seq seq
, struct walk_stmt_info
*wi
)
5805 /* If there are any labels in OMP sequences, they can be only referred to in
5806 the sequence itself and therefore we can do both here. */
5807 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, wi
);
5808 gimple_seq copy
= gimple_seq_copy (seq
);
5809 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, wi
);
5813 /* Copies everything in SEQ and replaces variables and labels local to
5814 current_function_decl. */
5817 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5820 struct walk_stmt_info wi
;
5823 /* There's nothing to do for NULL_TREE. */
5828 memset (&id
, 0, sizeof (id
));
5829 id
.src_fn
= current_function_decl
;
5830 id
.dst_fn
= current_function_decl
;
5832 id
.decl_map
= new hash_map
<tree
, tree
>;
5833 id
.debug_map
= NULL
;
5835 id
.copy_decl
= copy_decl_no_change
;
5836 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5837 id
.transform_new_cfg
= false;
5838 id
.transform_return_to_modify
= false;
5839 id
.transform_parameter
= false;
5840 id
.transform_lang_insert_block
= NULL
;
5842 /* Walk the tree once to find local labels. */
5843 memset (&wi
, 0, sizeof (wi
));
5844 hash_set
<tree
> visited
;
5847 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5849 copy
= gimple_seq_copy (seq
);
5851 /* Walk the copy, remapping decls. */
5852 memset (&wi
, 0, sizeof (wi
));
5854 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5859 delete id
.debug_map
;
5860 if (id
.dependence_map
)
5862 delete id
.dependence_map
;
5863 id
.dependence_map
= NULL
;
5870 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5873 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5882 debug_find_tree (tree top
, tree search
)
5884 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5888 /* Declare the variables created by the inliner. Add all the variables in
5889 VARS to BIND_EXPR. */
5892 declare_inline_vars (tree block
, tree vars
)
5895 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5897 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5898 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5899 add_local_decl (cfun
, t
);
5903 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5906 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5907 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5908 VAR_DECL translation. */
5911 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5913 /* Don't generate debug information for the copy if we wouldn't have
5914 generated it for the copy either. */
5915 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5916 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5918 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5919 declaration inspired this copy. */
5920 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5922 /* The new variable/label has no RTL, yet. */
5923 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5924 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5925 SET_DECL_RTL (copy
, 0);
5926 /* For vector typed decls make sure to update DECL_MODE according
5927 to the new function context. */
5928 if (VECTOR_TYPE_P (TREE_TYPE (copy
)))
5929 SET_DECL_MODE (copy
, TYPE_MODE (TREE_TYPE (copy
)));
5931 /* These args would always appear unused, if not for this. */
5932 TREE_USED (copy
) = 1;
5934 /* Set the context for the new declaration. */
5935 if (!DECL_CONTEXT (decl
))
5936 /* Globals stay global. */
5938 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5939 /* Things that weren't in the scope of the function we're inlining
5940 from aren't in the scope we're inlining to, either. */
5942 else if (TREE_STATIC (decl
))
5943 /* Function-scoped static variables should stay in the original
5948 /* Ordinary automatic local variables are now in the scope of the
5950 DECL_CONTEXT (copy
) = id
->dst_fn
;
5951 if (VAR_P (copy
) && id
->dst_simt_vars
&& !is_gimple_reg (copy
))
5953 if (!lookup_attribute ("omp simt private", DECL_ATTRIBUTES (copy
)))
5954 DECL_ATTRIBUTES (copy
)
5955 = tree_cons (get_identifier ("omp simt private"), NULL
,
5956 DECL_ATTRIBUTES (copy
));
5957 id
->dst_simt_vars
->safe_push (copy
);
5964 /* Create a new VAR_DECL that is indentical in all respect to DECL except that
5965 DECL can be either a VAR_DECL, a PARM_DECL or RESULT_DECL. The original
5966 DECL must come from ID->src_fn and the copy will be part of ID->dst_fn. */
5969 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5973 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5974 || TREE_CODE (decl
) == RESULT_DECL
);
5976 type
= TREE_TYPE (decl
);
5978 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5979 VAR_DECL
, DECL_NAME (decl
), type
);
5980 if (DECL_PT_UID_SET_P (decl
))
5981 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5982 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5983 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5984 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5985 DECL_NOT_GIMPLE_REG_P (copy
) = DECL_NOT_GIMPLE_REG_P (decl
);
5986 DECL_BY_REFERENCE (copy
) = DECL_BY_REFERENCE (decl
);
5988 return copy_decl_for_dup_finish (id
, decl
, copy
);
5991 /* Like copy_decl_to_var, but create a return slot object instead of a
5992 pointer variable for return by invisible reference. */
5995 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5999 gcc_assert (TREE_CODE (decl
) == PARM_DECL
6000 || TREE_CODE (decl
) == RESULT_DECL
);
6002 type
= TREE_TYPE (decl
);
6003 if (DECL_BY_REFERENCE (decl
))
6004 type
= TREE_TYPE (type
);
6006 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
6007 VAR_DECL
, DECL_NAME (decl
), type
);
6008 if (DECL_PT_UID_SET_P (decl
))
6009 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
6010 TREE_READONLY (copy
) = TREE_READONLY (decl
);
6011 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
6012 if (!DECL_BY_REFERENCE (decl
))
6014 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
6015 DECL_NOT_GIMPLE_REG_P (copy
)
6016 = (DECL_NOT_GIMPLE_REG_P (decl
)
6017 /* RESULT_DECLs are treated special by needs_to_live_in_memory,
6018 mirror that to the created VAR_DECL. */
6019 || (TREE_CODE (decl
) == RESULT_DECL
6020 && aggregate_value_p (decl
, id
->src_fn
)));
6023 return copy_decl_for_dup_finish (id
, decl
, copy
);
6027 copy_decl_no_change (tree decl
, copy_body_data
*id
)
6031 copy
= copy_node (decl
);
6033 /* The COPY is not abstract; it will be generated in DST_FN. */
6034 DECL_ABSTRACT_P (copy
) = false;
6035 lang_hooks
.dup_lang_specific_decl (copy
);
6037 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
6038 been taken; it's for internal bookkeeping in expand_goto_internal. */
6039 if (TREE_CODE (copy
) == LABEL_DECL
)
6041 TREE_ADDRESSABLE (copy
) = 0;
6042 LABEL_DECL_UID (copy
) = -1;
6045 return copy_decl_for_dup_finish (id
, decl
, copy
);
6049 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
6051 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
6052 return copy_decl_to_var (decl
, id
);
6054 return copy_decl_no_change (decl
, id
);
6057 /* Return a copy of the function's argument tree without any modifications. */
6060 copy_arguments_nochange (tree orig_parm
, copy_body_data
* id
)
6063 tree new_parm
= NULL
;
6066 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
))
6068 tree new_tree
= remap_decl (arg
, id
);
6069 if (TREE_CODE (new_tree
) != PARM_DECL
)
6070 new_tree
= id
->copy_decl (arg
, id
);
6071 lang_hooks
.dup_lang_specific_decl (new_tree
);
6073 parg
= &DECL_CHAIN (new_tree
);
6078 /* Return a copy of the function's static chain. */
6080 copy_static_chain (tree static_chain
, copy_body_data
* id
)
6082 tree
*chain_copy
, *pvar
;
6084 chain_copy
= &static_chain
;
6085 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
6087 tree new_tree
= remap_decl (*pvar
, id
);
6088 lang_hooks
.dup_lang_specific_decl (new_tree
);
6089 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
6092 return static_chain
;
6095 /* Return true if the function is allowed to be versioned.
6096 This is a guard for the versioning functionality. */
6099 tree_versionable_function_p (tree fndecl
)
6101 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
6102 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
)) == NULL
);
6105 /* Update clone info after duplication. */
6108 update_clone_info (copy_body_data
* id
)
6110 struct cgraph_node
*this_node
= id
->dst_node
;
6111 if (!this_node
->clones
)
6113 for (cgraph_node
*node
= this_node
->clones
; node
!= this_node
;)
6115 /* First update replace maps to match the new body. */
6116 clone_info
*info
= clone_info::get (node
);
6117 if (info
&& info
->tree_map
)
6120 for (i
= 0; i
< vec_safe_length (info
->tree_map
); i
++)
6122 struct ipa_replace_map
*replace_info
;
6123 replace_info
= (*info
->tree_map
)[i
];
6124 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
6129 node
= node
->clones
;
6130 else if (node
->next_sibling_clone
)
6131 node
= node
->next_sibling_clone
;
6134 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
6135 node
= node
->clone_of
;
6136 if (node
!= id
->dst_node
)
6137 node
= node
->next_sibling_clone
;
6142 /* Create a copy of a function's tree.
6143 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
6144 of the original function and the new copied function
6145 respectively. In case we want to replace a DECL
6146 tree with another tree while duplicating the function's
6147 body, TREE_MAP represents the mapping between these
6148 trees. If UPDATE_CLONES is set, the call_stmt fields
6149 of edges of clones of the function will be updated.
6151 If non-NULL PARAM_ADJUSTMENTS determines how function prototype (i.e. the
6152 function parameters and return value) should be modified).
6153 If non-NULL BLOCKS_TO_COPY determine what basic blocks to copy.
6154 If non_NULL NEW_ENTRY determine new entry BB of the clone.
6157 tree_function_versioning (tree old_decl
, tree new_decl
,
6158 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
6159 ipa_param_adjustments
*param_adjustments
,
6160 bool update_clones
, bitmap blocks_to_copy
,
6161 basic_block new_entry
)
6163 struct cgraph_node
*old_version_node
;
6164 struct cgraph_node
*new_version_node
;
6168 struct ipa_replace_map
*replace_info
;
6169 basic_block old_entry_block
, bb
;
6170 auto_vec
<gimple
*, 10> init_stmts
;
6171 tree vars
= NULL_TREE
;
6173 /* We can get called recursively from expand_call_inline via clone
6174 materialization. While expand_call_inline maintains input_location
6175 we cannot tolerate it to leak into the materialized clone. */
6176 location_t saved_location
= input_location
;
6177 input_location
= UNKNOWN_LOCATION
;
6179 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
6180 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
6181 DECL_POSSIBLY_INLINED (old_decl
) = 1;
6183 old_version_node
= cgraph_node::get (old_decl
);
6184 gcc_checking_assert (old_version_node
);
6185 new_version_node
= cgraph_node::get (new_decl
);
6186 gcc_checking_assert (new_version_node
);
6188 /* Copy over debug args. */
6189 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
6191 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
6192 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
6193 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
6194 old_debug_args
= decl_debug_args_lookup (old_decl
);
6197 new_debug_args
= decl_debug_args_insert (new_decl
);
6198 *new_debug_args
= vec_safe_copy (*old_debug_args
);
6202 /* Output the inlining info for this abstract function, since it has been
6203 inlined. If we don't do this now, we can lose the information about the
6204 variables in the function when the blocks get blown away as soon as we
6205 remove the cgraph node. */
6206 (*debug_hooks
->outlining_inline_function
) (old_decl
);
6208 DECL_ARTIFICIAL (new_decl
) = 1;
6209 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
6210 if (DECL_ORIGIN (old_decl
) == old_decl
)
6211 old_version_node
->used_as_abstract_origin
= true;
6212 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
6214 /* Prepare the data structures for the tree copy. */
6215 memset (&id
, 0, sizeof (id
));
6217 /* Generate a new name for the new version. */
6218 id
.statements_to_fold
= new hash_set
<gimple
*>;
6220 id
.decl_map
= new hash_map
<tree
, tree
>;
6221 id
.debug_map
= NULL
;
6222 id
.src_fn
= old_decl
;
6223 id
.dst_fn
= new_decl
;
6224 id
.src_node
= old_version_node
;
6225 id
.dst_node
= new_version_node
;
6226 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
6227 id
.blocks_to_copy
= blocks_to_copy
;
6229 id
.copy_decl
= copy_decl_no_change
;
6230 id
.transform_call_graph_edges
6231 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
6232 id
.transform_new_cfg
= true;
6233 id
.transform_return_to_modify
= false;
6234 id
.transform_parameter
= false;
6235 id
.transform_lang_insert_block
= NULL
;
6237 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
6238 (DECL_STRUCT_FUNCTION (old_decl
));
6239 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
6240 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
6241 initialize_cfun (new_decl
, old_decl
,
6242 new_entry
? new_entry
->count
: old_entry_block
->count
);
6243 new_version_node
->calls_declare_variant_alt
6244 = old_version_node
->calls_declare_variant_alt
;
6245 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
6246 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
6247 = id
.src_cfun
->gimple_df
->ipa_pta
;
6249 /* Copy the function's static chain. */
6250 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
6252 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
6253 = copy_static_chain (p
, &id
);
6255 auto_vec
<int, 16> new_param_indices
;
6256 clone_info
*info
= clone_info::get (old_version_node
);
6257 ipa_param_adjustments
*old_param_adjustments
6258 = info
? info
->param_adjustments
: NULL
;
6259 if (old_param_adjustments
)
6260 old_param_adjustments
->get_updated_indices (&new_param_indices
);
6262 /* If there's a tree_map, prepare for substitution. */
6264 for (i
= 0; i
< tree_map
->length (); i
++)
6267 replace_info
= (*tree_map
)[i
];
6269 int p
= replace_info
->parm_num
;
6270 if (old_param_adjustments
)
6271 p
= new_param_indices
[p
];
6274 for (parm
= DECL_ARGUMENTS (old_decl
); p
;
6275 parm
= DECL_CHAIN (parm
))
6278 init
= setup_one_parameter (&id
, parm
, replace_info
->new_tree
,
6279 id
.src_fn
, NULL
, &vars
);
6281 init_stmts
.safe_push (init
);
6284 ipa_param_body_adjustments
*param_body_adjs
= NULL
;
6285 if (param_adjustments
)
6287 param_body_adjs
= new ipa_param_body_adjustments (param_adjustments
,
6289 &id
, &vars
, tree_map
);
6290 id
.param_body_adjs
= param_body_adjs
;
6291 DECL_ARGUMENTS (new_decl
) = param_body_adjs
->get_new_param_chain ();
6293 else if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
6294 DECL_ARGUMENTS (new_decl
)
6295 = copy_arguments_nochange (DECL_ARGUMENTS (old_decl
), &id
);
6297 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
6298 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
6300 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
6302 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
6303 /* Add local vars. */
6304 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
6306 if (DECL_RESULT (old_decl
) == NULL_TREE
)
6308 else if (param_adjustments
&& param_adjustments
->m_skip_return
6309 && !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
6311 tree resdecl_repl
= copy_result_decl_to_var (DECL_RESULT (old_decl
),
6313 declare_inline_vars (NULL
, resdecl_repl
);
6314 if (DECL_BY_REFERENCE (DECL_RESULT (old_decl
)))
6315 resdecl_repl
= build_fold_addr_expr (resdecl_repl
);
6316 insert_decl_map (&id
, DECL_RESULT (old_decl
), resdecl_repl
);
6318 DECL_RESULT (new_decl
)
6319 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
6320 RESULT_DECL
, NULL_TREE
, void_type_node
);
6321 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
6322 DECL_IS_MALLOC (new_decl
) = false;
6323 cfun
->returns_struct
= 0;
6324 cfun
->returns_pcc_struct
= 0;
6329 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
6330 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
6331 if (gimple_in_ssa_p (id
.src_cfun
)
6332 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
6333 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
6335 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
6336 insert_decl_map (&id
, old_name
, new_name
);
6337 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
6338 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
6342 /* Set up the destination functions loop tree. */
6343 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
6345 cfun
->curr_properties
&= ~PROP_loops
;
6346 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
6347 cfun
->curr_properties
|= PROP_loops
;
6350 /* Copy the Function's body. */
6351 copy_body (&id
, ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
6354 /* Renumber the lexical scoping (non-code) blocks consecutively. */
6355 number_blocks (new_decl
);
6357 /* We want to create the BB unconditionally, so that the addition of
6358 debug stmts doesn't affect BB count, which may in the end cause
6359 codegen differences. */
6360 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6361 while (init_stmts
.length ())
6362 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
6363 update_clone_info (&id
);
6365 /* Remap the nonlocal_goto_save_area, if any. */
6366 if (cfun
->nonlocal_goto_save_area
)
6368 struct walk_stmt_info wi
;
6370 memset (&wi
, 0, sizeof (wi
));
6372 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
6378 delete id
.debug_map
;
6379 free_dominance_info (CDI_DOMINATORS
);
6380 free_dominance_info (CDI_POST_DOMINATORS
);
6382 update_max_bb_count ();
6383 fold_marked_statements (0, id
.statements_to_fold
);
6384 delete id
.statements_to_fold
;
6385 delete_unreachable_blocks_update_callgraph (id
.dst_node
, update_clones
);
6386 if (id
.dst_node
->definition
)
6387 cgraph_edge::rebuild_references ();
6388 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
6390 calculate_dominance_info (CDI_DOMINATORS
);
6391 fix_loop_structure (NULL
);
6393 update_ssa (TODO_update_ssa
);
6395 /* After partial cloning we need to rescale frequencies, so they are
6396 within proper range in the cloned function. */
6399 struct cgraph_edge
*e
;
6400 rebuild_frequencies ();
6402 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
6403 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
6405 basic_block bb
= gimple_bb (e
->call_stmt
);
6406 e
->count
= bb
->count
;
6408 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
6410 basic_block bb
= gimple_bb (e
->call_stmt
);
6411 e
->count
= bb
->count
;
6415 if (param_body_adjs
&& MAY_HAVE_DEBUG_BIND_STMTS
)
6417 vec
<tree
, va_gc
> **debug_args
= NULL
;
6418 unsigned int len
= 0;
6419 unsigned reset_len
= param_body_adjs
->m_reset_debug_decls
.length ();
6421 for (i
= 0; i
< reset_len
; i
++)
6423 tree parm
= param_body_adjs
->m_reset_debug_decls
[i
];
6424 gcc_assert (is_gimple_reg (parm
));
6427 if (debug_args
== NULL
)
6429 debug_args
= decl_debug_args_insert (new_decl
);
6430 len
= vec_safe_length (*debug_args
);
6432 ddecl
= make_node (DEBUG_EXPR_DECL
);
6433 DECL_ARTIFICIAL (ddecl
) = 1;
6434 TREE_TYPE (ddecl
) = TREE_TYPE (parm
);
6435 SET_DECL_MODE (ddecl
, DECL_MODE (parm
));
6436 vec_safe_push (*debug_args
, DECL_ORIGIN (parm
));
6437 vec_safe_push (*debug_args
, ddecl
);
6439 if (debug_args
!= NULL
)
6441 /* On the callee side, add
6444 stmts to the first bb where var is a VAR_DECL created for the
6445 optimized away parameter in DECL_INITIAL block. This hints
6446 in the debug info that var (whole DECL_ORIGIN is the parm
6447 PARM_DECL) is optimized away, but could be looked up at the
6448 call site as value of D#X there. */
6450 gimple_stmt_iterator cgsi
6451 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
6454 i
= vec_safe_length (*debug_args
);
6458 while (var
!= NULL_TREE
6459 && DECL_ABSTRACT_ORIGIN (var
) != (**debug_args
)[i
])
6460 var
= TREE_CHAIN (var
);
6461 if (var
== NULL_TREE
)
6463 vexpr
= make_node (DEBUG_EXPR_DECL
);
6464 tree parm
= (**debug_args
)[i
];
6465 DECL_ARTIFICIAL (vexpr
) = 1;
6466 TREE_TYPE (vexpr
) = TREE_TYPE (parm
);
6467 SET_DECL_MODE (vexpr
, DECL_MODE (parm
));
6468 def_temp
= gimple_build_debug_bind (var
, vexpr
, NULL
);
6469 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6470 def_temp
= gimple_build_debug_source_bind (vexpr
, parm
, NULL
);
6471 gsi_insert_before (&cgsi
, def_temp
, GSI_NEW_STMT
);
6476 delete param_body_adjs
;
6477 free_dominance_info (CDI_DOMINATORS
);
6478 free_dominance_info (CDI_POST_DOMINATORS
);
6480 gcc_assert (!id
.debug_stmts
.exists ());
6482 input_location
= saved_location
;
6486 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6487 the callee and return the inlined body on success. */
6490 maybe_inline_call_in_expr (tree exp
)
6492 tree fn
= get_callee_fndecl (exp
);
6494 /* We can only try to inline "const" functions. */
6495 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
6497 call_expr_arg_iterator iter
;
6500 hash_map
<tree
, tree
> decl_map
;
6502 /* Remap the parameters. */
6503 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
6505 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
6506 decl_map
.put (param
, arg
);
6508 memset (&id
, 0, sizeof (id
));
6510 id
.dst_fn
= current_function_decl
;
6511 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6512 id
.decl_map
= &decl_map
;
6514 id
.copy_decl
= copy_decl_no_change
;
6515 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6516 id
.transform_new_cfg
= false;
6517 id
.transform_return_to_modify
= true;
6518 id
.transform_parameter
= true;
6519 id
.transform_lang_insert_block
= NULL
;
6521 /* Make sure not to unshare trees behind the front-end's back
6522 since front-end specific mechanisms may rely on sharing. */
6523 id
.regimplify
= false;
6524 id
.do_not_unshare
= true;
6526 /* We're not inside any EH region. */
6529 t
= copy_tree_body (&id
);
6531 /* We can only return something suitable for use in a GENERIC
6533 if (TREE_CODE (t
) == MODIFY_EXPR
)
6534 return TREE_OPERAND (t
, 1);
6540 /* Duplicate a type, fields and all. */
6543 build_duplicate_type (tree type
)
6545 struct copy_body_data id
;
6547 memset (&id
, 0, sizeof (id
));
6548 id
.src_fn
= current_function_decl
;
6549 id
.dst_fn
= current_function_decl
;
6551 id
.decl_map
= new hash_map
<tree
, tree
>;
6552 id
.debug_map
= NULL
;
6553 id
.copy_decl
= copy_decl_no_change
;
6555 type
= remap_type_1 (type
, &id
);
6559 delete id
.debug_map
;
6561 TYPE_CANONICAL (type
) = type
;
6566 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6567 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6571 copy_fn (tree fn
, tree
& parms
, tree
& result
)
6575 hash_map
<tree
, tree
> decl_map
;
6580 memset (&id
, 0, sizeof (id
));
6582 id
.dst_fn
= current_function_decl
;
6583 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
6584 id
.decl_map
= &decl_map
;
6586 id
.copy_decl
= copy_decl_no_change
;
6587 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
6588 id
.transform_new_cfg
= false;
6589 id
.transform_return_to_modify
= false;
6590 id
.transform_parameter
= true;
6591 id
.transform_lang_insert_block
= NULL
;
6593 /* Make sure not to unshare trees behind the front-end's back
6594 since front-end specific mechanisms may rely on sharing. */
6595 id
.regimplify
= false;
6596 id
.do_not_unshare
= true;
6597 id
.do_not_fold
= true;
6599 /* We're not inside any EH region. */
6602 /* Remap the parameters and result and return them to the caller. */
6603 for (param
= DECL_ARGUMENTS (fn
);
6605 param
= DECL_CHAIN (param
))
6607 *p
= remap_decl (param
, &id
);
6608 p
= &DECL_CHAIN (*p
);
6611 if (DECL_RESULT (fn
))
6612 result
= remap_decl (DECL_RESULT (fn
), &id
);
6616 return copy_tree_body (&id
);