2 Copyright (C) 2001-2013 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"
25 #include "diagnostic-core.h"
27 #include "stor-layout.h"
29 #include "tree-inline.h"
33 #include "insn-config.h"
35 #include "langhooks.h"
36 #include "basic-block.h"
37 #include "tree-iterator.h"
39 #include "pointer-set.h"
40 #include "tree-ssa-alias.h"
41 #include "internal-fn.h"
42 #include "gimple-fold.h"
44 #include "gimple-expr.h"
48 #include "gimple-iterator.h"
49 #include "gimplify-me.h"
50 #include "gimple-walk.h"
51 #include "gimple-ssa.h"
53 #include "tree-phinodes.h"
54 #include "ssa-iterators.h"
55 #include "stringpool.h"
56 #include "tree-ssanames.h"
57 #include "tree-into-ssa.h"
62 #include "tree-pretty-print.h"
66 #include "value-prof.h"
67 #include "tree-pass.h"
71 #include "rtl.h" /* FIXME: For asm_str_count. */
73 /* I'm not real happy about this, but we need to handle gimple and
76 /* Inlining, Cloning, Versioning, Parallelization
78 Inlining: a function body is duplicated, but the PARM_DECLs are
79 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
80 MODIFY_EXPRs that store to a dedicated returned-value variable.
81 The duplicated eh_region info of the copy will later be appended
82 to the info for the caller; the eh_region info in copied throwing
83 statements and RESX statements are adjusted accordingly.
85 Cloning: (only in C++) We have one body for a con/de/structor, and
86 multiple function decls, each with a unique parameter list.
87 Duplicate the body, using the given splay tree; some parameters
88 will become constants (like 0 or 1).
90 Versioning: a function body is duplicated and the result is a new
91 function rather than into blocks of an existing function as with
92 inlining. Some parameters will become constants.
94 Parallelization: a region of a function is duplicated resulting in
95 a new function. Variables may be replaced with complex expressions
96 to enable shared variable semantics.
98 All of these will simultaneously lookup any callgraph edges. If
99 we're going to inline the duplicated function body, and the given
100 function has some cloned callgraph nodes (one for each place this
101 function will be inlined) those callgraph edges will be duplicated.
102 If we're cloning the body, those callgraph edges will be
103 updated to point into the new body. (Note that the original
104 callgraph node and edge list will not be altered.)
106 See the CALL_EXPR handling case in copy_tree_body_r (). */
110 o In order to make inlining-on-trees work, we pessimized
111 function-local static constants. In particular, they are now
112 always output, even when not addressed. Fix this by treating
113 function-local static constants just like global static
114 constants; the back-end already knows not to output them if they
117 o Provide heuristics to clamp inlining of recursive template
121 /* Weights that estimate_num_insns uses to estimate the size of the
124 eni_weights eni_size_weights
;
126 /* Weights that estimate_num_insns uses to estimate the time necessary
127 to execute the produced code. */
129 eni_weights eni_time_weights
;
133 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, basic_block
);
134 static void remap_block (tree
*, copy_body_data
*);
135 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
136 static void declare_inline_vars (tree
, tree
);
137 static void remap_save_expr (tree
*, void *, int *);
138 static void prepend_lexical_block (tree current_block
, tree new_block
);
139 static tree
copy_decl_to_var (tree
, copy_body_data
*);
140 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
141 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
142 static gimple
remap_gimple_stmt (gimple
, copy_body_data
*);
143 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
145 /* Insert a tree->tree mapping for ID. Despite the name suggests
146 that the trees should be variables, it is used for more than that. */
149 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
151 *pointer_map_insert (id
->decl_map
, key
) = value
;
153 /* Always insert an identity map as well. If we see this same new
154 node again, we won't want to duplicate it a second time. */
156 *pointer_map_insert (id
->decl_map
, value
) = value
;
159 /* Insert a tree->tree mapping for ID. This is only used for
163 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
165 if (!gimple_in_ssa_p (id
->src_cfun
))
168 if (!MAY_HAVE_DEBUG_STMTS
)
171 if (!target_for_debug_bind (key
))
174 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
175 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
178 id
->debug_map
= pointer_map_create ();
180 *pointer_map_insert (id
->debug_map
, key
) = value
;
183 /* If nonzero, we're remapping the contents of inlined debug
184 statements. If negative, an error has occurred, such as a
185 reference to a variable that isn't available in the inlined
187 static int processing_debug_stmt
= 0;
189 /* Construct new SSA name for old NAME. ID is the inline context. */
192 remap_ssa_name (tree name
, copy_body_data
*id
)
197 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
199 n
= (tree
*) pointer_map_contains (id
->decl_map
, name
);
201 return unshare_expr (*n
);
203 if (processing_debug_stmt
)
205 if (SSA_NAME_IS_DEFAULT_DEF (name
)
206 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
207 && id
->entry_bb
== NULL
208 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
210 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
212 gimple_stmt_iterator gsi
;
213 tree val
= SSA_NAME_VAR (name
);
215 n
= (tree
*) pointer_map_contains (id
->decl_map
, val
);
218 if (TREE_CODE (val
) != PARM_DECL
)
220 processing_debug_stmt
= -1;
223 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
224 DECL_ARTIFICIAL (vexpr
) = 1;
225 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
226 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
227 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
228 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
232 processing_debug_stmt
= -1;
236 /* Remap anonymous SSA names or SSA names of anonymous decls. */
237 var
= SSA_NAME_VAR (name
);
239 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
240 && TREE_CODE (var
) == VAR_DECL
241 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
242 && DECL_ARTIFICIAL (var
)
243 && DECL_IGNORED_P (var
)
244 && !DECL_NAME (var
)))
246 struct ptr_info_def
*pi
;
247 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
), NULL
);
248 if (!var
&& SSA_NAME_IDENTIFIER (name
))
249 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
250 insert_decl_map (id
, name
, new_tree
);
251 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
252 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
253 /* At least IPA points-to info can be directly transferred. */
254 if (id
->src_cfun
->gimple_df
255 && id
->src_cfun
->gimple_df
->ipa_pta
256 && (pi
= SSA_NAME_PTR_INFO (name
))
259 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
265 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
267 new_tree
= remap_decl (var
, id
);
269 /* We might've substituted constant or another SSA_NAME for
272 Replace the SSA name representing RESULT_DECL by variable during
273 inlining: this saves us from need to introduce PHI node in a case
274 return value is just partly initialized. */
275 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
276 && (!SSA_NAME_VAR (name
)
277 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
278 || !id
->transform_return_to_modify
))
280 struct ptr_info_def
*pi
;
281 new_tree
= make_ssa_name (new_tree
, NULL
);
282 insert_decl_map (id
, name
, new_tree
);
283 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
284 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
285 /* At least IPA points-to info can be directly transferred. */
286 if (id
->src_cfun
->gimple_df
287 && id
->src_cfun
->gimple_df
->ipa_pta
288 && (pi
= SSA_NAME_PTR_INFO (name
))
291 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
294 if (SSA_NAME_IS_DEFAULT_DEF (name
))
296 /* By inlining function having uninitialized variable, we might
297 extend the lifetime (variable might get reused). This cause
298 ICE in the case we end up extending lifetime of SSA name across
299 abnormal edge, but also increase register pressure.
301 We simply initialize all uninitialized vars by 0 except
302 for case we are inlining to very first BB. We can avoid
303 this for all BBs that are not inside strongly connected
304 regions of the CFG, but this is expensive to test. */
306 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
307 && (!SSA_NAME_VAR (name
)
308 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
309 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
311 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
313 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
315 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
317 init_stmt
= gimple_build_assign (new_tree
, zero
);
318 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
319 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
323 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
324 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
329 insert_decl_map (id
, name
, new_tree
);
333 /* Remap DECL during the copying of the BLOCK tree for the function. */
336 remap_decl (tree decl
, copy_body_data
*id
)
340 /* We only remap local variables in the current function. */
342 /* See if we have remapped this declaration. */
344 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
346 if (!n
&& processing_debug_stmt
)
348 processing_debug_stmt
= -1;
352 /* If we didn't already have an equivalent for this declaration,
356 /* Make a copy of the variable or label. */
357 tree t
= id
->copy_decl (decl
, id
);
359 /* Remember it, so that if we encounter this local entity again
360 we can reuse this copy. Do this early because remap_type may
361 need this decl for TYPE_STUB_DECL. */
362 insert_decl_map (id
, decl
, t
);
367 /* Remap types, if necessary. */
368 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
369 if (TREE_CODE (t
) == TYPE_DECL
)
370 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
372 /* Remap sizes as necessary. */
373 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
374 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
376 /* If fields, do likewise for offset and qualifier. */
377 if (TREE_CODE (t
) == FIELD_DECL
)
379 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
380 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
381 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
387 if (id
->do_not_unshare
)
390 return unshare_expr (*n
);
394 remap_type_1 (tree type
, copy_body_data
*id
)
398 /* We do need a copy. build and register it now. If this is a pointer or
399 reference type, remap the designated type and make a new pointer or
401 if (TREE_CODE (type
) == POINTER_TYPE
)
403 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
405 TYPE_REF_CAN_ALIAS_ALL (type
));
406 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
407 new_tree
= build_type_attribute_qual_variant (new_tree
,
408 TYPE_ATTRIBUTES (type
),
410 insert_decl_map (id
, type
, new_tree
);
413 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
415 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
417 TYPE_REF_CAN_ALIAS_ALL (type
));
418 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
419 new_tree
= build_type_attribute_qual_variant (new_tree
,
420 TYPE_ATTRIBUTES (type
),
422 insert_decl_map (id
, type
, new_tree
);
426 new_tree
= copy_node (type
);
428 insert_decl_map (id
, type
, new_tree
);
430 /* This is a new type, not a copy of an old type. Need to reassociate
431 variants. We can handle everything except the main variant lazily. */
432 t
= TYPE_MAIN_VARIANT (type
);
435 t
= remap_type (t
, id
);
436 TYPE_MAIN_VARIANT (new_tree
) = t
;
437 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
438 TYPE_NEXT_VARIANT (t
) = new_tree
;
442 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
443 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
446 if (TYPE_STUB_DECL (type
))
447 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
449 /* Lazily create pointer and reference types. */
450 TYPE_POINTER_TO (new_tree
) = NULL
;
451 TYPE_REFERENCE_TO (new_tree
) = NULL
;
453 switch (TREE_CODE (new_tree
))
457 case FIXED_POINT_TYPE
:
460 t
= TYPE_MIN_VALUE (new_tree
);
461 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
462 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
464 t
= TYPE_MAX_VALUE (new_tree
);
465 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
466 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
470 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
471 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
475 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
476 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
481 case QUAL_UNION_TYPE
:
485 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
487 t
= remap_decl (f
, id
);
488 DECL_CONTEXT (t
) = new_tree
;
492 TYPE_FIELDS (new_tree
) = nreverse (nf
);
498 /* Shouldn't have been thought variable sized. */
502 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
503 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
509 remap_type (tree type
, copy_body_data
*id
)
517 /* See if we have remapped this type. */
518 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
522 /* The type only needs remapping if it's variably modified. */
523 if (! variably_modified_type_p (type
, id
->src_fn
))
525 insert_decl_map (id
, type
, type
);
529 id
->remapping_type_depth
++;
530 tmp
= remap_type_1 (type
, id
);
531 id
->remapping_type_depth
--;
536 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
539 can_be_nonlocal (tree decl
, copy_body_data
*id
)
541 /* We can not duplicate function decls. */
542 if (TREE_CODE (decl
) == FUNCTION_DECL
)
545 /* Local static vars must be non-local or we get multiple declaration
547 if (TREE_CODE (decl
) == VAR_DECL
548 && !auto_var_in_fn_p (decl
, id
->src_fn
))
555 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
559 tree new_decls
= NULL_TREE
;
561 /* Remap its variables. */
562 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
566 if (can_be_nonlocal (old_var
, id
))
568 /* We need to add this variable to the local decls as otherwise
569 nothing else will do so. */
570 if (TREE_CODE (old_var
) == VAR_DECL
571 && ! DECL_EXTERNAL (old_var
))
572 add_local_decl (cfun
, old_var
);
573 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
574 && !DECL_IGNORED_P (old_var
)
575 && nonlocalized_list
)
576 vec_safe_push (*nonlocalized_list
, old_var
);
580 /* Remap the variable. */
581 new_var
= remap_decl (old_var
, id
);
583 /* If we didn't remap this variable, we can't mess with its
584 TREE_CHAIN. If we remapped this variable to the return slot, it's
585 already declared somewhere else, so don't declare it here. */
587 if (new_var
== id
->retvar
)
591 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
592 && !DECL_IGNORED_P (old_var
)
593 && nonlocalized_list
)
594 vec_safe_push (*nonlocalized_list
, old_var
);
598 gcc_assert (DECL_P (new_var
));
599 DECL_CHAIN (new_var
) = new_decls
;
602 /* Also copy value-expressions. */
603 if (TREE_CODE (new_var
) == VAR_DECL
604 && DECL_HAS_VALUE_EXPR_P (new_var
))
606 tree tem
= DECL_VALUE_EXPR (new_var
);
607 bool old_regimplify
= id
->regimplify
;
608 id
->remapping_type_depth
++;
609 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
610 id
->remapping_type_depth
--;
611 id
->regimplify
= old_regimplify
;
612 SET_DECL_VALUE_EXPR (new_var
, tem
);
617 return nreverse (new_decls
);
620 /* Copy the BLOCK to contain remapped versions of the variables
621 therein. And hook the new block into the block-tree. */
624 remap_block (tree
*block
, copy_body_data
*id
)
629 /* Make the new block. */
631 new_block
= make_node (BLOCK
);
632 TREE_USED (new_block
) = TREE_USED (old_block
);
633 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
634 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
635 BLOCK_NONLOCALIZED_VARS (new_block
)
636 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
639 /* Remap its variables. */
640 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
641 &BLOCK_NONLOCALIZED_VARS (new_block
),
644 if (id
->transform_lang_insert_block
)
645 id
->transform_lang_insert_block (new_block
);
647 /* Remember the remapped block. */
648 insert_decl_map (id
, old_block
, new_block
);
651 /* Copy the whole block tree and root it in id->block. */
653 remap_blocks (tree block
, copy_body_data
*id
)
656 tree new_tree
= block
;
661 remap_block (&new_tree
, id
);
662 gcc_assert (new_tree
!= block
);
663 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
664 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
665 /* Blocks are in arbitrary order, but make things slightly prettier and do
666 not swap order when producing a copy. */
667 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
671 /* Remap the block tree rooted at BLOCK to nothing. */
673 remap_blocks_to_null (tree block
, copy_body_data
*id
)
676 insert_decl_map (id
, block
, NULL_TREE
);
677 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
678 remap_blocks_to_null (t
, id
);
682 copy_statement_list (tree
*tp
)
684 tree_stmt_iterator oi
, ni
;
687 new_tree
= alloc_stmt_list ();
688 ni
= tsi_start (new_tree
);
689 oi
= tsi_start (*tp
);
690 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
693 for (; !tsi_end_p (oi
); tsi_next (&oi
))
695 tree stmt
= tsi_stmt (oi
);
696 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
697 /* This copy is not redundant; tsi_link_after will smash this
698 STATEMENT_LIST into the end of the one we're building, and we
699 don't want to do that with the original. */
700 copy_statement_list (&stmt
);
701 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
706 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
708 tree block
= BIND_EXPR_BLOCK (*tp
);
709 /* Copy (and replace) the statement. */
710 copy_tree_r (tp
, walk_subtrees
, NULL
);
713 remap_block (&block
, id
);
714 BIND_EXPR_BLOCK (*tp
) = block
;
717 if (BIND_EXPR_VARS (*tp
))
718 /* This will remap a lot of the same decls again, but this should be
720 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
724 /* Create a new gimple_seq by remapping all the statements in BODY
725 using the inlining information in ID. */
728 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
730 gimple_stmt_iterator si
;
731 gimple_seq new_body
= NULL
;
733 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
735 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
736 gimple_seq_add_stmt (&new_body
, new_stmt
);
743 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
744 block using the mapping information in ID. */
747 copy_gimple_bind (gimple stmt
, copy_body_data
*id
)
750 tree new_block
, new_vars
;
751 gimple_seq body
, new_body
;
753 /* Copy the statement. Note that we purposely don't use copy_stmt
754 here because we need to remap statements as we copy. */
755 body
= gimple_bind_body (stmt
);
756 new_body
= remap_gimple_seq (body
, id
);
758 new_block
= gimple_bind_block (stmt
);
760 remap_block (&new_block
, id
);
762 /* This will remap a lot of the same decls again, but this should be
764 new_vars
= gimple_bind_vars (stmt
);
766 new_vars
= remap_decls (new_vars
, NULL
, id
);
768 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
773 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
778 if (TREE_CODE (decl
) == SSA_NAME
)
780 decl
= SSA_NAME_VAR (decl
);
785 return (TREE_CODE (decl
) == PARM_DECL
);
788 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
789 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
790 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
791 recursing into the children nodes of *TP. */
794 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
796 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
797 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
798 tree fn
= id
->src_fn
;
800 if (TREE_CODE (*tp
) == SSA_NAME
)
802 *tp
= remap_ssa_name (*tp
, id
);
806 else if (auto_var_in_fn_p (*tp
, fn
))
808 /* Local variables and labels need to be replaced by equivalent
809 variables. We don't want to copy static variables; there's
810 only one of those, no matter how many times we inline the
811 containing function. Similarly for globals from an outer
815 /* Remap the declaration. */
816 new_decl
= remap_decl (*tp
, id
);
817 gcc_assert (new_decl
);
818 /* Replace this variable with the copy. */
819 STRIP_TYPE_NOPS (new_decl
);
820 /* ??? The C++ frontend uses void * pointer zero to initialize
821 any other type. This confuses the middle-end type verification.
822 As cloned bodies do not go through gimplification again the fixup
823 there doesn't trigger. */
824 if (TREE_CODE (new_decl
) == INTEGER_CST
825 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
826 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
830 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
832 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
834 else if (TREE_CODE (*tp
) == LABEL_DECL
835 && (!DECL_CONTEXT (*tp
)
836 || decl_function_context (*tp
) == id
->src_fn
))
837 /* These may need to be remapped for EH handling. */
838 *tp
= remap_decl (*tp
, id
);
839 else if (TREE_CODE (*tp
) == FIELD_DECL
)
841 /* If the enclosing record type is variably_modified_type_p, the field
842 has already been remapped. Otherwise, it need not be. */
843 tree
*n
= (tree
*) pointer_map_contains (id
->decl_map
, *tp
);
848 else if (TYPE_P (*tp
))
849 /* Types may need remapping as well. */
850 *tp
= remap_type (*tp
, id
);
851 else if (CONSTANT_CLASS_P (*tp
))
853 /* If this is a constant, we have to copy the node iff the type
854 will be remapped. copy_tree_r will not copy a constant. */
855 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
857 if (new_type
== TREE_TYPE (*tp
))
860 else if (TREE_CODE (*tp
) == INTEGER_CST
)
861 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
862 TREE_INT_CST_HIGH (*tp
));
865 *tp
= copy_node (*tp
);
866 TREE_TYPE (*tp
) = new_type
;
871 /* Otherwise, just copy the node. Note that copy_tree_r already
872 knows not to copy VAR_DECLs, etc., so this is safe. */
874 if (TREE_CODE (*tp
) == MEM_REF
)
876 /* We need to re-canonicalize MEM_REFs from inline substitutions
877 that can happen when a pointer argument is an ADDR_EXPR.
878 Recurse here manually to allow that. */
879 tree ptr
= TREE_OPERAND (*tp
, 0);
880 tree type
= remap_type (TREE_TYPE (*tp
), id
);
882 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
883 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
884 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
885 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
886 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
887 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
888 remapped a parameter as the property might be valid only
889 for the parameter itself. */
890 if (TREE_THIS_NOTRAP (old
)
891 && (!is_parm (TREE_OPERAND (old
, 0))
892 || (!id
->transform_parameter
&& is_parm (ptr
))))
893 TREE_THIS_NOTRAP (*tp
) = 1;
898 /* Here is the "usual case". Copy this tree node, and then
899 tweak some special cases. */
900 copy_tree_r (tp
, walk_subtrees
, NULL
);
902 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
903 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
905 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
907 /* The copied TARGET_EXPR has never been expanded, even if the
908 original node was expanded already. */
909 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
910 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
912 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
914 /* Variable substitution need not be simple. In particular,
915 the MEM_REF substitution above. Make sure that
916 TREE_CONSTANT and friends are up-to-date. */
917 int invariant
= is_gimple_min_invariant (*tp
);
918 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
919 recompute_tree_invariant_for_addr_expr (*tp
);
921 /* If this used to be invariant, but is not any longer,
922 then regimplification is probably needed. */
923 if (invariant
&& !is_gimple_min_invariant (*tp
))
924 id
->regimplify
= true;
930 /* Update the TREE_BLOCK for the cloned expr. */
933 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
934 tree old_block
= TREE_BLOCK (*tp
);
938 n
= (tree
*) pointer_map_contains (id
->decl_map
,
943 TREE_SET_BLOCK (*tp
, new_block
);
946 /* Keep iterating. */
951 /* Called from copy_body_id via walk_tree. DATA is really a
952 `copy_body_data *'. */
955 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
957 copy_body_data
*id
= (copy_body_data
*) data
;
958 tree fn
= id
->src_fn
;
961 /* Begin by recognizing trees that we'll completely rewrite for the
962 inlining context. Our output for these trees is completely
963 different from out input (e.g. RETURN_EXPR is deleted, and morphs
964 into an edge). Further down, we'll handle trees that get
965 duplicated and/or tweaked. */
967 /* When requested, RETURN_EXPRs should be transformed to just the
968 contained MODIFY_EXPR. The branch semantics of the return will
969 be handled elsewhere by manipulating the CFG rather than a statement. */
970 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
972 tree assignment
= TREE_OPERAND (*tp
, 0);
974 /* If we're returning something, just turn that into an
975 assignment into the equivalent of the original RESULT_DECL.
976 If the "assignment" is just the result decl, the result
977 decl has already been set (e.g. a recent "foo (&result_decl,
978 ...)"); just toss the entire RETURN_EXPR. */
979 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
981 /* Replace the RETURN_EXPR with (a copy of) the
982 MODIFY_EXPR hanging underneath. */
983 *tp
= copy_node (assignment
);
985 else /* Else the RETURN_EXPR returns no value. */
988 return (tree
) (void *)1;
991 else if (TREE_CODE (*tp
) == SSA_NAME
)
993 *tp
= remap_ssa_name (*tp
, id
);
998 /* Local variables and labels need to be replaced by equivalent
999 variables. We don't want to copy static variables; there's only
1000 one of those, no matter how many times we inline the containing
1001 function. Similarly for globals from an outer function. */
1002 else if (auto_var_in_fn_p (*tp
, fn
))
1006 /* Remap the declaration. */
1007 new_decl
= remap_decl (*tp
, id
);
1008 gcc_assert (new_decl
);
1009 /* Replace this variable with the copy. */
1010 STRIP_TYPE_NOPS (new_decl
);
1014 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1015 copy_statement_list (tp
);
1016 else if (TREE_CODE (*tp
) == SAVE_EXPR
1017 || TREE_CODE (*tp
) == TARGET_EXPR
)
1018 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1019 else if (TREE_CODE (*tp
) == LABEL_DECL
1020 && (! DECL_CONTEXT (*tp
)
1021 || decl_function_context (*tp
) == id
->src_fn
))
1022 /* These may need to be remapped for EH handling. */
1023 *tp
= remap_decl (*tp
, id
);
1024 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1025 copy_bind_expr (tp
, walk_subtrees
, id
);
1026 /* Types may need remapping as well. */
1027 else if (TYPE_P (*tp
))
1028 *tp
= remap_type (*tp
, id
);
1030 /* If this is a constant, we have to copy the node iff the type will be
1031 remapped. copy_tree_r will not copy a constant. */
1032 else if (CONSTANT_CLASS_P (*tp
))
1034 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1036 if (new_type
== TREE_TYPE (*tp
))
1039 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1040 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
1041 TREE_INT_CST_HIGH (*tp
));
1044 *tp
= copy_node (*tp
);
1045 TREE_TYPE (*tp
) = new_type
;
1049 /* Otherwise, just copy the node. Note that copy_tree_r already
1050 knows not to copy VAR_DECLs, etc., so this is safe. */
1053 /* Here we handle trees that are not completely rewritten.
1054 First we detect some inlining-induced bogosities for
1056 if (TREE_CODE (*tp
) == MODIFY_EXPR
1057 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1058 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1060 /* Some assignments VAR = VAR; don't generate any rtl code
1061 and thus don't count as variable modification. Avoid
1062 keeping bogosities like 0 = 0. */
1063 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1066 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1070 STRIP_TYPE_NOPS (value
);
1071 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1073 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1074 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1078 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1080 /* Get rid of *& from inline substitutions that can happen when a
1081 pointer argument is an ADDR_EXPR. */
1082 tree decl
= TREE_OPERAND (*tp
, 0);
1083 tree
*n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1086 /* If we happen to get an ADDR_EXPR in n->value, strip
1087 it manually here as we'll eventually get ADDR_EXPRs
1088 which lie about their types pointed to. In this case
1089 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1090 but we absolutely rely on that. As fold_indirect_ref
1091 does other useful transformations, try that first, though. */
1092 tree type
= TREE_TYPE (*tp
);
1093 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1095 *tp
= gimple_fold_indirect_ref (ptr
);
1098 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1101 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1102 /* ??? We should either assert here or build
1103 a VIEW_CONVERT_EXPR instead of blindly leaking
1104 incompatible types to our IL. */
1106 *tp
= TREE_OPERAND (ptr
, 0);
1110 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1111 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1112 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1113 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1114 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1115 have remapped a parameter as the property might be
1116 valid only for the parameter itself. */
1117 if (TREE_THIS_NOTRAP (old
)
1118 && (!is_parm (TREE_OPERAND (old
, 0))
1119 || (!id
->transform_parameter
&& is_parm (ptr
))))
1120 TREE_THIS_NOTRAP (*tp
) = 1;
1127 else if (TREE_CODE (*tp
) == MEM_REF
)
1129 /* We need to re-canonicalize MEM_REFs from inline substitutions
1130 that can happen when a pointer argument is an ADDR_EXPR.
1131 Recurse here manually to allow that. */
1132 tree ptr
= TREE_OPERAND (*tp
, 0);
1133 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1135 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1136 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1137 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1138 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1139 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1140 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1141 remapped a parameter as the property might be valid only
1142 for the parameter itself. */
1143 if (TREE_THIS_NOTRAP (old
)
1144 && (!is_parm (TREE_OPERAND (old
, 0))
1145 || (!id
->transform_parameter
&& is_parm (ptr
))))
1146 TREE_THIS_NOTRAP (*tp
) = 1;
1151 /* Here is the "usual case". Copy this tree node, and then
1152 tweak some special cases. */
1153 copy_tree_r (tp
, walk_subtrees
, NULL
);
1155 /* If EXPR has block defined, map it to newly constructed block.
1156 When inlining we want EXPRs without block appear in the block
1157 of function call if we are not remapping a type. */
1160 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1161 if (TREE_BLOCK (*tp
))
1164 n
= (tree
*) pointer_map_contains (id
->decl_map
,
1169 TREE_SET_BLOCK (*tp
, new_block
);
1172 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1173 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1175 /* The copied TARGET_EXPR has never been expanded, even if the
1176 original node was expanded already. */
1177 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1179 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1180 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1183 /* Variable substitution need not be simple. In particular, the
1184 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1185 and friends are up-to-date. */
1186 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1188 int invariant
= is_gimple_min_invariant (*tp
);
1189 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1191 /* Handle the case where we substituted an INDIRECT_REF
1192 into the operand of the ADDR_EXPR. */
1193 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1194 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1196 recompute_tree_invariant_for_addr_expr (*tp
);
1198 /* If this used to be invariant, but is not any longer,
1199 then regimplification is probably needed. */
1200 if (invariant
&& !is_gimple_min_invariant (*tp
))
1201 id
->regimplify
= true;
1207 /* Keep iterating. */
1211 /* Helper for remap_gimple_stmt. Given an EH region number for the
1212 source function, map that to the duplicate EH region number in
1213 the destination function. */
1216 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1218 eh_region old_r
, new_r
;
1221 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1222 slot
= pointer_map_contains (id
->eh_map
, old_r
);
1223 new_r
= (eh_region
) *slot
;
1225 return new_r
->index
;
1228 /* Similar, but operate on INTEGER_CSTs. */
1231 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1235 old_nr
= tree_to_shwi (old_t_nr
);
1236 new_nr
= remap_eh_region_nr (old_nr
, id
);
1238 return build_int_cst (integer_type_node
, new_nr
);
1241 /* Helper for copy_bb. Remap statement STMT using the inlining
1242 information in ID. Return the new statement copy. */
1245 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1248 struct walk_stmt_info wi
;
1249 bool skip_first
= false;
1251 /* Begin by recognizing trees that we'll completely rewrite for the
1252 inlining context. Our output for these trees is completely
1253 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1254 into an edge). Further down, we'll handle trees that get
1255 duplicated and/or tweaked. */
1257 /* When requested, GIMPLE_RETURNs should be transformed to just the
1258 contained GIMPLE_ASSIGN. The branch semantics of the return will
1259 be handled elsewhere by manipulating the CFG rather than the
1261 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1263 tree retval
= gimple_return_retval (stmt
);
1265 /* If we're returning something, just turn that into an
1266 assignment into the equivalent of the original RESULT_DECL.
1267 If RETVAL is just the result decl, the result decl has
1268 already been set (e.g. a recent "foo (&result_decl, ...)");
1269 just toss the entire GIMPLE_RETURN. */
1271 && (TREE_CODE (retval
) != RESULT_DECL
1272 && (TREE_CODE (retval
) != SSA_NAME
1273 || ! SSA_NAME_VAR (retval
)
1274 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1276 copy
= gimple_build_assign (id
->retvar
, retval
);
1277 /* id->retvar is already substituted. Skip it on later remapping. */
1281 return gimple_build_nop ();
1283 else if (gimple_has_substatements (stmt
))
1287 /* When cloning bodies from the C++ front end, we will be handed bodies
1288 in High GIMPLE form. Handle here all the High GIMPLE statements that
1289 have embedded statements. */
1290 switch (gimple_code (stmt
))
1293 copy
= copy_gimple_bind (stmt
, id
);
1297 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1298 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1301 case GIMPLE_EH_FILTER
:
1302 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1303 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1307 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1308 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1309 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1312 case GIMPLE_WITH_CLEANUP_EXPR
:
1313 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1314 copy
= gimple_build_wce (s1
);
1317 case GIMPLE_OMP_PARALLEL
:
1318 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1319 copy
= gimple_build_omp_parallel
1321 gimple_omp_parallel_clauses (stmt
),
1322 gimple_omp_parallel_child_fn (stmt
),
1323 gimple_omp_parallel_data_arg (stmt
));
1326 case GIMPLE_OMP_TASK
:
1327 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1328 copy
= gimple_build_omp_task
1330 gimple_omp_task_clauses (stmt
),
1331 gimple_omp_task_child_fn (stmt
),
1332 gimple_omp_task_data_arg (stmt
),
1333 gimple_omp_task_copy_fn (stmt
),
1334 gimple_omp_task_arg_size (stmt
),
1335 gimple_omp_task_arg_align (stmt
));
1338 case GIMPLE_OMP_FOR
:
1339 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1340 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1341 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1342 gimple_omp_for_clauses (stmt
),
1343 gimple_omp_for_collapse (stmt
), s2
);
1346 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1348 gimple_omp_for_set_index (copy
, i
,
1349 gimple_omp_for_index (stmt
, i
));
1350 gimple_omp_for_set_initial (copy
, i
,
1351 gimple_omp_for_initial (stmt
, i
));
1352 gimple_omp_for_set_final (copy
, i
,
1353 gimple_omp_for_final (stmt
, i
));
1354 gimple_omp_for_set_incr (copy
, i
,
1355 gimple_omp_for_incr (stmt
, i
));
1356 gimple_omp_for_set_cond (copy
, i
,
1357 gimple_omp_for_cond (stmt
, i
));
1362 case GIMPLE_OMP_MASTER
:
1363 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1364 copy
= gimple_build_omp_master (s1
);
1367 case GIMPLE_OMP_TASKGROUP
:
1368 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1369 copy
= gimple_build_omp_taskgroup (s1
);
1372 case GIMPLE_OMP_ORDERED
:
1373 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1374 copy
= gimple_build_omp_ordered (s1
);
1377 case GIMPLE_OMP_SECTION
:
1378 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1379 copy
= gimple_build_omp_section (s1
);
1382 case GIMPLE_OMP_SECTIONS
:
1383 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1384 copy
= gimple_build_omp_sections
1385 (s1
, gimple_omp_sections_clauses (stmt
));
1388 case GIMPLE_OMP_SINGLE
:
1389 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1390 copy
= gimple_build_omp_single
1391 (s1
, gimple_omp_single_clauses (stmt
));
1394 case GIMPLE_OMP_TARGET
:
1395 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1396 copy
= gimple_build_omp_target
1397 (s1
, gimple_omp_target_kind (stmt
),
1398 gimple_omp_target_clauses (stmt
));
1401 case GIMPLE_OMP_TEAMS
:
1402 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1403 copy
= gimple_build_omp_teams
1404 (s1
, gimple_omp_teams_clauses (stmt
));
1407 case GIMPLE_OMP_CRITICAL
:
1408 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1410 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1413 case GIMPLE_TRANSACTION
:
1414 s1
= remap_gimple_seq (gimple_transaction_body (stmt
), id
);
1415 copy
= gimple_build_transaction (s1
, gimple_transaction_label (stmt
));
1416 gimple_transaction_set_subcode (copy
, gimple_transaction_subcode (stmt
));
1425 if (gimple_assign_copy_p (stmt
)
1426 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1427 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1429 /* Here we handle statements that are not completely rewritten.
1430 First we detect some inlining-induced bogosities for
1433 /* Some assignments VAR = VAR; don't generate any rtl code
1434 and thus don't count as variable modification. Avoid
1435 keeping bogosities like 0 = 0. */
1436 tree decl
= gimple_assign_lhs (stmt
), value
;
1439 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1443 STRIP_TYPE_NOPS (value
);
1444 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1445 return gimple_build_nop ();
1449 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1450 in a block that we aren't copying during tree_function_versioning,
1451 just drop the clobber stmt. */
1452 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1454 tree lhs
= gimple_assign_lhs (stmt
);
1455 if (TREE_CODE (lhs
) == MEM_REF
1456 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1458 gimple def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1459 if (gimple_bb (def_stmt
)
1460 && !bitmap_bit_p (id
->blocks_to_copy
,
1461 gimple_bb (def_stmt
)->index
))
1462 return gimple_build_nop ();
1466 if (gimple_debug_bind_p (stmt
))
1468 copy
= gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1469 gimple_debug_bind_get_value (stmt
),
1471 id
->debug_stmts
.safe_push (copy
);
1474 if (gimple_debug_source_bind_p (stmt
))
1476 copy
= gimple_build_debug_source_bind
1477 (gimple_debug_source_bind_get_var (stmt
),
1478 gimple_debug_source_bind_get_value (stmt
), stmt
);
1479 id
->debug_stmts
.safe_push (copy
);
1483 /* Create a new deep copy of the statement. */
1484 copy
= gimple_copy (stmt
);
1486 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1487 RESX and EH_DISPATCH. */
1489 switch (gimple_code (copy
))
1493 tree r
, fndecl
= gimple_call_fndecl (copy
);
1494 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1495 switch (DECL_FUNCTION_CODE (fndecl
))
1497 case BUILT_IN_EH_COPY_VALUES
:
1498 r
= gimple_call_arg (copy
, 1);
1499 r
= remap_eh_region_tree_nr (r
, id
);
1500 gimple_call_set_arg (copy
, 1, r
);
1503 case BUILT_IN_EH_POINTER
:
1504 case BUILT_IN_EH_FILTER
:
1505 r
= gimple_call_arg (copy
, 0);
1506 r
= remap_eh_region_tree_nr (r
, id
);
1507 gimple_call_set_arg (copy
, 0, r
);
1514 /* Reset alias info if we didn't apply measures to
1515 keep it valid over inlining by setting DECL_PT_UID. */
1516 if (!id
->src_cfun
->gimple_df
1517 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1518 gimple_call_reset_alias_info (copy
);
1524 int r
= gimple_resx_region (copy
);
1525 r
= remap_eh_region_nr (r
, id
);
1526 gimple_resx_set_region (copy
, r
);
1530 case GIMPLE_EH_DISPATCH
:
1532 int r
= gimple_eh_dispatch_region (copy
);
1533 r
= remap_eh_region_nr (r
, id
);
1534 gimple_eh_dispatch_set_region (copy
, r
);
1543 /* If STMT has a block defined, map it to the newly constructed
1545 if (gimple_block (copy
))
1548 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1550 gimple_set_block (copy
, *n
);
1553 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1556 /* Remap all the operands in COPY. */
1557 memset (&wi
, 0, sizeof (wi
));
1560 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1562 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1564 /* Clear the copied virtual operands. We are not remapping them here
1565 but are going to recreate them from scratch. */
1566 if (gimple_has_mem_ops (copy
))
1568 gimple_set_vdef (copy
, NULL_TREE
);
1569 gimple_set_vuse (copy
, NULL_TREE
);
1576 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1580 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1581 gcov_type count_scale
)
1583 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1584 basic_block copy_basic_block
;
1589 /* Search for previous copied basic block. */
1592 prev
= prev
->prev_bb
;
1594 /* create_basic_block() will append every new block to
1595 basic_block_info automatically. */
1596 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1597 (basic_block
) prev
->aux
);
1598 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1600 /* We are going to rebuild frequencies from scratch. These values
1601 have just small importance to drive canonicalize_loop_headers. */
1602 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1604 /* We recompute frequencies after inlining, so this is quite safe. */
1605 if (freq
> BB_FREQ_MAX
)
1607 copy_basic_block
->frequency
= freq
;
1609 copy_gsi
= gsi_start_bb (copy_basic_block
);
1611 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1613 gimple stmt
= gsi_stmt (gsi
);
1614 gimple orig_stmt
= stmt
;
1616 id
->regimplify
= false;
1617 stmt
= remap_gimple_stmt (stmt
, id
);
1618 if (gimple_nop_p (stmt
))
1621 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1624 /* With return slot optimization we can end up with
1625 non-gimple (foo *)&this->m, fix that here. */
1626 if (is_gimple_assign (stmt
)
1627 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1628 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1631 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1632 gimple_assign_rhs1 (stmt
),
1634 GSI_CONTINUE_LINKING
);
1635 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1636 id
->regimplify
= false;
1639 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1642 gimple_regimplify_operands (stmt
, &seq_gsi
);
1644 /* If copy_basic_block has been empty at the start of this iteration,
1645 call gsi_start_bb again to get at the newly added statements. */
1646 if (gsi_end_p (copy_gsi
))
1647 copy_gsi
= gsi_start_bb (copy_basic_block
);
1649 gsi_next (©_gsi
);
1651 /* Process the new statement. The call to gimple_regimplify_operands
1652 possibly turned the statement into multiple statements, we
1653 need to process all of them. */
1658 stmt
= gsi_stmt (copy_gsi
);
1659 if (is_gimple_call (stmt
)
1660 && gimple_call_va_arg_pack_p (stmt
)
1663 /* __builtin_va_arg_pack () should be replaced by
1664 all arguments corresponding to ... in the caller. */
1668 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1671 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1674 /* Create the new array of arguments. */
1675 n
= nargs
+ gimple_call_num_args (stmt
);
1676 argarray
.create (n
);
1677 argarray
.safe_grow_cleared (n
);
1679 /* Copy all the arguments before '...' */
1680 memcpy (argarray
.address (),
1681 gimple_call_arg_ptr (stmt
, 0),
1682 gimple_call_num_args (stmt
) * sizeof (tree
));
1684 /* Append the arguments passed in '...' */
1685 memcpy (argarray
.address () + gimple_call_num_args (stmt
),
1686 gimple_call_arg_ptr (id
->gimple_call
, 0)
1687 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1688 nargs
* sizeof (tree
));
1690 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1693 argarray
.release ();
1695 /* Copy all GIMPLE_CALL flags, location and block, except
1696 GF_CALL_VA_ARG_PACK. */
1697 gimple_call_copy_flags (new_call
, stmt
);
1698 gimple_call_set_va_arg_pack (new_call
, false);
1699 gimple_set_location (new_call
, gimple_location (stmt
));
1700 gimple_set_block (new_call
, gimple_block (stmt
));
1701 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1703 gsi_replace (©_gsi
, new_call
, false);
1706 else if (is_gimple_call (stmt
)
1708 && (decl
= gimple_call_fndecl (stmt
))
1709 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1710 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1712 /* __builtin_va_arg_pack_len () should be replaced by
1713 the number of anonymous arguments. */
1714 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1718 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1721 count
= build_int_cst (integer_type_node
, nargs
);
1722 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1723 gsi_replace (©_gsi
, new_stmt
, false);
1727 /* Statements produced by inlining can be unfolded, especially
1728 when we constant propagated some operands. We can't fold
1729 them right now for two reasons:
1730 1) folding require SSA_NAME_DEF_STMTs to be correct
1731 2) we can't change function calls to builtins.
1732 So we just mark statement for later folding. We mark
1733 all new statements, instead just statements that has changed
1734 by some nontrivial substitution so even statements made
1735 foldable indirectly are updated. If this turns out to be
1736 expensive, copy_body can be told to watch for nontrivial
1738 if (id
->statements_to_fold
)
1739 pointer_set_insert (id
->statements_to_fold
, stmt
);
1741 /* We're duplicating a CALL_EXPR. Find any corresponding
1742 callgraph edges and update or duplicate them. */
1743 if (is_gimple_call (stmt
))
1745 struct cgraph_edge
*edge
;
1748 switch (id
->transform_call_graph_edges
)
1750 case CB_CGE_DUPLICATE
:
1751 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1754 int edge_freq
= edge
->frequency
;
1756 struct cgraph_edge
*old_edge
= edge
;
1757 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1759 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1761 /* We could also just rescale the frequency, but
1762 doing so would introduce roundoff errors and make
1763 verifier unhappy. */
1764 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1767 /* Speculative calls consist of two edges - direct and indirect.
1768 Duplicate the whole thing and distribute frequencies accordingly. */
1769 if (edge
->speculative
)
1771 struct cgraph_edge
*direct
, *indirect
;
1772 struct ipa_ref
*ref
;
1774 gcc_assert (!edge
->indirect_unknown_callee
);
1775 cgraph_speculative_call_info (old_edge
, direct
, indirect
, ref
);
1776 indirect
= cgraph_clone_edge (indirect
, id
->dst_node
, stmt
,
1778 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1780 if (old_edge
->frequency
+ indirect
->frequency
)
1782 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
1783 (old_edge
->frequency
+ indirect
->frequency
)),
1785 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
1786 (old_edge
->frequency
+ indirect
->frequency
)),
1789 ipa_clone_ref (ref
, id
->dst_node
, stmt
);
1793 edge
->frequency
= new_freq
;
1795 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
1796 && (edge_freq
> edge
->frequency
+ 10
1797 || edge_freq
< edge
->frequency
- 10))
1799 fprintf (dump_file
, "Edge frequency estimated by "
1800 "cgraph %i diverge from inliner's estimate %i\n",
1804 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1807 copy_basic_block
->frequency
);
1813 case CB_CGE_MOVE_CLONES
:
1814 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1816 edge
= cgraph_edge (id
->dst_node
, stmt
);
1820 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1822 cgraph_set_call_stmt (edge
, stmt
);
1829 /* Constant propagation on argument done during inlining
1830 may create new direct call. Produce an edge for it. */
1832 || (edge
->indirect_inlining_edge
1833 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1834 && id
->dst_node
->definition
1835 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1837 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1839 /* We have missing edge in the callgraph. This can happen
1840 when previous inlining turned an indirect call into a
1841 direct call by constant propagating arguments or we are
1842 producing dead clone (for further cloning). In all
1843 other cases we hit a bug (incorrect node sharing is the
1844 most common reason for missing edges). */
1845 gcc_assert (!dest
->definition
1846 || dest
->address_taken
1847 || !id
->src_node
->definition
1848 || !id
->dst_node
->definition
);
1849 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1850 cgraph_create_edge_including_clones
1851 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1852 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1854 CIF_ORIGINALLY_INDIRECT_CALL
);
1856 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1858 compute_call_stmt_bb_frequency
1859 (id
->dst_node
->decl
,
1860 copy_basic_block
))->inline_failed
1861 = CIF_ORIGINALLY_INDIRECT_CALL
;
1864 fprintf (dump_file
, "Created new direct edge to %s\n",
1869 flags
= gimple_call_flags (stmt
);
1870 if (flags
& ECF_MAY_BE_ALLOCA
)
1871 cfun
->calls_alloca
= true;
1872 if (flags
& ECF_RETURNS_TWICE
)
1873 cfun
->calls_setjmp
= true;
1876 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1877 id
->eh_map
, id
->eh_lp_nr
);
1879 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1884 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1885 if (TREE_CODE (def
) == SSA_NAME
)
1886 SSA_NAME_DEF_STMT (def
) = stmt
;
1889 gsi_next (©_gsi
);
1891 while (!gsi_end_p (copy_gsi
));
1893 copy_gsi
= gsi_last_bb (copy_basic_block
);
1896 return copy_basic_block
;
1899 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1900 form is quite easy, since dominator relationship for old basic blocks does
1903 There is however exception where inlining might change dominator relation
1904 across EH edges from basic block within inlined functions destinating
1905 to landing pads in function we inline into.
1907 The function fills in PHI_RESULTs of such PHI nodes if they refer
1908 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1909 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1910 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1911 set, and this means that there will be no overlapping live ranges
1912 for the underlying symbol.
1914 This might change in future if we allow redirecting of EH edges and
1915 we might want to change way build CFG pre-inlining to include
1916 all the possible edges then. */
1918 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1919 bool can_throw
, bool nonlocal_goto
)
1924 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1926 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1929 gimple_stmt_iterator si
;
1932 gcc_assert (e
->flags
& EDGE_EH
);
1935 gcc_assert (!(e
->flags
& EDGE_EH
));
1937 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1941 phi
= gsi_stmt (si
);
1943 /* For abnormal goto/call edges the receiver can be the
1944 ENTRY_BLOCK. Do not assert this cannot happen. */
1946 gcc_assert ((e
->flags
& EDGE_EH
)
1947 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1949 re
= find_edge (ret_bb
, e
->dest
);
1950 gcc_checking_assert (re
);
1951 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1952 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1954 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1955 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1961 /* Copy edges from BB into its copy constructed earlier, scale profile
1962 accordingly. Edges will be taken care of later. Assume aux
1963 pointers to point to the copies of each BB. Return true if any
1964 debug stmts are left after a statement that must end the basic block. */
1967 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
1968 bool can_make_abnormal_goto
)
1970 basic_block new_bb
= (basic_block
) bb
->aux
;
1973 gimple_stmt_iterator si
;
1975 bool need_debug_cleanup
= false;
1977 /* Use the indices from the original blocks to create edges for the
1979 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1980 if (!(old_edge
->flags
& EDGE_EH
))
1984 flags
= old_edge
->flags
;
1986 /* Return edges do get a FALLTHRU flag when the get inlined. */
1987 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1988 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
1989 flags
|= EDGE_FALLTHRU
;
1990 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1991 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
1992 new_edge
->probability
= old_edge
->probability
;
1995 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1998 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2001 bool can_throw
, nonlocal_goto
;
2003 copy_stmt
= gsi_stmt (si
);
2004 if (!is_gimple_debug (copy_stmt
))
2005 update_stmt (copy_stmt
);
2007 /* Do this before the possible split_block. */
2010 /* If this tree could throw an exception, there are two
2011 cases where we need to add abnormal edge(s): the
2012 tree wasn't in a region and there is a "current
2013 region" in the caller; or the original tree had
2014 EH edges. In both cases split the block after the tree,
2015 and add abnormal edge(s) as needed; we need both
2016 those from the callee and the caller.
2017 We check whether the copy can throw, because the const
2018 propagation can change an INDIRECT_REF which throws
2019 into a COMPONENT_REF which doesn't. If the copy
2020 can throw, the original could also throw. */
2021 can_throw
= stmt_can_throw_internal (copy_stmt
);
2022 nonlocal_goto
= stmt_can_make_abnormal_goto (copy_stmt
);
2024 if (can_throw
|| nonlocal_goto
)
2026 if (!gsi_end_p (si
))
2028 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2031 need_debug_cleanup
= true;
2033 if (!gsi_end_p (si
))
2034 /* Note that bb's predecessor edges aren't necessarily
2035 right at this point; split_block doesn't care. */
2037 edge e
= split_block (new_bb
, copy_stmt
);
2040 new_bb
->aux
= e
->src
->aux
;
2041 si
= gsi_start_bb (new_bb
);
2045 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2046 make_eh_dispatch_edges (copy_stmt
);
2048 make_eh_edges (copy_stmt
);
2050 /* If the call we inline cannot make abnormal goto do not add
2051 additional abnormal edges but only retain those already present
2052 in the original function body. */
2053 nonlocal_goto
&= can_make_abnormal_goto
;
2055 make_abnormal_goto_edges (gimple_bb (copy_stmt
), true);
2057 if ((can_throw
|| nonlocal_goto
)
2058 && gimple_in_ssa_p (cfun
))
2059 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2060 can_throw
, nonlocal_goto
);
2062 return need_debug_cleanup
;
2065 /* Copy the PHIs. All blocks and edges are copied, some blocks
2066 was possibly split and new outgoing EH edges inserted.
2067 BB points to the block of original function and AUX pointers links
2068 the original and newly copied blocks. */
2071 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2073 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2076 gimple_stmt_iterator si
;
2078 bool inserted
= false;
2080 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2085 phi
= gsi_stmt (si
);
2086 res
= PHI_RESULT (phi
);
2088 if (!virtual_operand_p (res
))
2090 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2091 new_phi
= create_phi_node (new_res
, new_bb
);
2092 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2094 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2100 /* When doing partial cloning, we allow PHIs on the entry block
2101 as long as all the arguments are the same. Find any input
2102 edge to see argument to copy. */
2104 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2105 if (!old_edge
->src
->aux
)
2108 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2110 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2111 gcc_assert (new_arg
);
2112 /* With return slot optimization we can end up with
2113 non-gimple (foo *)&this->m, fix that here. */
2114 if (TREE_CODE (new_arg
) != SSA_NAME
2115 && TREE_CODE (new_arg
) != FUNCTION_DECL
2116 && !is_gimple_val (new_arg
))
2118 gimple_seq stmts
= NULL
;
2119 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2120 gsi_insert_seq_on_edge (new_edge
, stmts
);
2123 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2124 if (LOCATION_BLOCK (locus
))
2127 n
= (tree
*) pointer_map_contains (id
->decl_map
,
2128 LOCATION_BLOCK (locus
));
2131 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2133 locus
= LOCATION_LOCUS (locus
);
2136 locus
= LOCATION_LOCUS (locus
);
2138 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2143 /* Commit the delayed edge insertions. */
2145 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2146 gsi_commit_one_edge_insert (new_edge
, NULL
);
2150 /* Wrapper for remap_decl so it can be used as a callback. */
2153 remap_decl_1 (tree decl
, void *data
)
2155 return remap_decl (decl
, (copy_body_data
*) data
);
2158 /* Build struct function and associated datastructures for the new clone
2159 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2160 the cfun to the function of new_fndecl (and current_function_decl too). */
2163 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2165 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2166 gcov_type count_scale
;
2168 if (!DECL_ARGUMENTS (new_fndecl
))
2169 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2170 if (!DECL_RESULT (new_fndecl
))
2171 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2173 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2175 = GCOV_COMPUTE_SCALE (count
,
2176 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2178 count_scale
= REG_BR_PROB_BASE
;
2180 /* Register specific tree functions. */
2181 gimple_register_cfg_hooks ();
2183 /* Get clean struct function. */
2184 push_struct_function (new_fndecl
);
2186 /* We will rebuild these, so just sanity check that they are empty. */
2187 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2188 gcc_assert (cfun
->local_decls
== NULL
);
2189 gcc_assert (cfun
->cfg
== NULL
);
2190 gcc_assert (cfun
->decl
== new_fndecl
);
2192 /* Copy items we preserve during cloning. */
2193 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2194 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2195 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2196 cfun
->curr_properties
= src_cfun
->curr_properties
;
2197 cfun
->last_verified
= src_cfun
->last_verified
;
2198 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2199 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2200 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2201 cfun
->stdarg
= src_cfun
->stdarg
;
2202 cfun
->after_inlining
= src_cfun
->after_inlining
;
2203 cfun
->can_throw_non_call_exceptions
2204 = src_cfun
->can_throw_non_call_exceptions
;
2205 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2206 cfun
->returns_struct
= src_cfun
->returns_struct
;
2207 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2209 init_empty_tree_cfg ();
2211 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2212 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2213 (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2215 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2216 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2217 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2218 (EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2220 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2221 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2223 init_eh_for_function ();
2225 if (src_cfun
->gimple_df
)
2227 init_tree_ssa (cfun
);
2228 cfun
->gimple_df
->in_ssa_p
= true;
2229 init_ssa_operands (cfun
);
2233 /* Helper function for copy_cfg_body. Move debug stmts from the end
2234 of NEW_BB to the beginning of successor basic blocks when needed. If the
2235 successor has multiple predecessors, reset them, otherwise keep
2239 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2243 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2246 || gsi_one_before_end_p (si
)
2247 || !(stmt_can_throw_internal (gsi_stmt (si
))
2248 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2251 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2253 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2254 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2255 while (is_gimple_debug (gsi_stmt (ssi
)))
2257 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2261 /* For the last edge move the debug stmts instead of copying
2263 if (ei_one_before_end_p (ei
))
2267 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2268 gimple_debug_bind_reset_value (stmt
);
2269 gsi_remove (&si
, false);
2270 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2274 if (gimple_debug_bind_p (stmt
))
2276 var
= gimple_debug_bind_get_var (stmt
);
2277 if (single_pred_p (e
->dest
))
2279 value
= gimple_debug_bind_get_value (stmt
);
2280 value
= unshare_expr (value
);
2284 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2286 else if (gimple_debug_source_bind_p (stmt
))
2288 var
= gimple_debug_source_bind_get_var (stmt
);
2289 value
= gimple_debug_source_bind_get_value (stmt
);
2290 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2294 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2295 id
->debug_stmts
.safe_push (new_stmt
);
2301 /* Make a copy of the sub-loops of SRC_PARENT and place them
2302 as siblings of DEST_PARENT. */
2305 copy_loops (copy_body_data
*id
,
2306 struct loop
*dest_parent
, struct loop
*src_parent
)
2308 struct loop
*src_loop
= src_parent
->inner
;
2311 if (!id
->blocks_to_copy
2312 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2314 struct loop
*dest_loop
= alloc_loop ();
2316 /* Assign the new loop its header and latch and associate
2317 those with the new loop. */
2318 if (src_loop
->header
!= NULL
)
2320 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2321 dest_loop
->header
->loop_father
= dest_loop
;
2323 if (src_loop
->latch
!= NULL
)
2325 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2326 dest_loop
->latch
->loop_father
= dest_loop
;
2329 /* Copy loop meta-data. */
2330 copy_loop_info (src_loop
, dest_loop
);
2332 /* Finally place it into the loop array and the loop tree. */
2333 place_new_loop (cfun
, dest_loop
);
2334 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2336 if (src_loop
->simduid
)
2338 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2339 cfun
->has_simduid_loops
= true;
2341 if (src_loop
->force_vect
)
2343 dest_loop
->force_vect
= true;
2344 cfun
->has_force_vect_loops
= true;
2348 copy_loops (id
, dest_loop
, src_loop
);
2350 src_loop
= src_loop
->next
;
2354 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2357 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2359 gimple_stmt_iterator si
;
2360 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2362 if (is_gimple_call (gsi_stmt (si
)))
2364 struct cgraph_edge
*edge
= cgraph_edge (id
->dst_node
, gsi_stmt (si
));
2366 cgraph_redirect_edge_call_stmt_to_callee (edge
);
2371 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2372 with each bb's frequency. Used when NODE has a 0-weight entry
2373 but we are about to inline it into a non-zero count call bb.
2374 See the comments for handle_missing_profiles() in predict.c for
2375 when this can happen for COMDATs. */
2378 freqs_to_counts (struct cgraph_node
*node
, gcov_type count
)
2383 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2385 FOR_ALL_BB_FN(bb
, fn
)
2387 bb
->count
= apply_scale (count
,
2388 GCOV_COMPUTE_SCALE (bb
->frequency
, BB_FREQ_MAX
));
2389 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2390 e
->count
= apply_probability (e
->src
->count
, e
->probability
);
2394 /* Make a copy of the body of FN so that it can be inserted inline in
2395 another function. Walks FN via CFG, returns new fndecl. */
2398 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2399 basic_block entry_block_map
, basic_block exit_block_map
,
2400 basic_block new_entry
)
2402 tree callee_fndecl
= id
->src_fn
;
2403 /* Original cfun for the callee, doesn't change. */
2404 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2405 struct function
*cfun_to_copy
;
2407 tree new_fndecl
= NULL
;
2408 bool need_debug_cleanup
= false;
2409 gcov_type count_scale
;
2411 int incoming_frequency
= 0;
2412 gcov_type incoming_count
= 0;
2414 /* This can happen for COMDAT routines that end up with 0 counts
2415 despite being called (see the comments for handle_missing_profiles()
2416 in predict.c as to why). Apply counts to the blocks in the callee
2417 before inlining, using the guessed edge frequencies, so that we don't
2418 end up with a 0-count inline body which can confuse downstream
2419 optimizations such as function splitting. */
2420 if (!ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
&& count
)
2422 /* Apply the larger of the call bb count and the total incoming
2423 call edge count to the callee. */
2424 gcov_type in_count
= 0;
2425 struct cgraph_edge
*in_edge
;
2426 for (in_edge
= id
->src_node
->callers
; in_edge
;
2427 in_edge
= in_edge
->next_caller
)
2428 in_count
+= in_edge
->count
;
2429 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2432 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2434 = GCOV_COMPUTE_SCALE (count
,
2435 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2437 count_scale
= REG_BR_PROB_BASE
;
2439 /* Register specific tree functions. */
2440 gimple_register_cfg_hooks ();
2442 /* If we are inlining just region of the function, make sure to connect
2443 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2444 part of loop, we must compute frequency and probability of
2445 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2446 probabilities of edges incoming from nonduplicated region. */
2452 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2455 incoming_frequency
+= EDGE_FREQUENCY (e
);
2456 incoming_count
+= e
->count
;
2458 incoming_count
= apply_scale (incoming_count
, count_scale
);
2460 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2461 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2462 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2465 /* Must have a CFG here at this point. */
2466 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2467 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2469 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2471 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2472 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2473 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2474 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2476 /* Duplicate any exception-handling regions. */
2478 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2481 /* Use aux pointers to map the original blocks to copy. */
2482 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2483 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2485 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2488 new_bb
->loop_father
= entry_block_map
->loop_father
;
2491 last
= last_basic_block
;
2493 /* Now that we've duplicated the blocks, duplicate their edges. */
2494 bool can_make_abormal_goto
2495 = id
->gimple_call
&& stmt_can_make_abnormal_goto (id
->gimple_call
);
2496 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2497 if (!id
->blocks_to_copy
2498 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2499 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2500 can_make_abormal_goto
);
2504 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2505 e
->probability
= REG_BR_PROB_BASE
;
2506 e
->count
= incoming_count
;
2509 /* Duplicate the loop tree, if available and wanted. */
2510 if (loops_for_fn (src_cfun
) != NULL
2511 && current_loops
!= NULL
)
2513 copy_loops (id
, entry_block_map
->loop_father
,
2514 get_loop (src_cfun
, 0));
2515 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2516 loops_state_set (LOOPS_NEED_FIXUP
);
2519 /* If the loop tree in the source function needed fixup, mark the
2520 destination loop tree for fixup, too. */
2521 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2522 loops_state_set (LOOPS_NEED_FIXUP
);
2524 if (gimple_in_ssa_p (cfun
))
2525 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2526 if (!id
->blocks_to_copy
2527 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2528 copy_phis_for_bb (bb
, id
);
2530 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2533 if (need_debug_cleanup
2534 && bb
->index
!= ENTRY_BLOCK
2535 && bb
->index
!= EXIT_BLOCK
)
2536 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2537 /* Update call edge destinations. This can not be done before loop
2538 info is updated, because we may split basic blocks. */
2539 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2540 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2541 ((basic_block
)bb
->aux
)->aux
= NULL
;
2545 /* Zero out AUX fields of newly created block during EH edge
2547 for (; last
< last_basic_block
; last
++)
2549 if (need_debug_cleanup
)
2550 maybe_move_debug_stmts_to_successors (id
,
2551 BASIC_BLOCK_FOR_FN (cfun
, last
));
2552 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2553 /* Update call edge destinations. This can not be done before loop
2554 info is updated, because we may split basic blocks. */
2555 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2556 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2558 entry_block_map
->aux
= NULL
;
2559 exit_block_map
->aux
= NULL
;
2563 pointer_map_destroy (id
->eh_map
);
2570 /* Copy the debug STMT using ID. We deal with these statements in a
2571 special way: if any variable in their VALUE expression wasn't
2572 remapped yet, we won't remap it, because that would get decl uids
2573 out of sync, causing codegen differences between -g and -g0. If
2574 this arises, we drop the VALUE expression altogether. */
2577 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2580 struct walk_stmt_info wi
;
2582 if (gimple_block (stmt
))
2584 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2585 gimple_set_block (stmt
, n
? *n
: id
->block
);
2588 /* Remap all the operands in COPY. */
2589 memset (&wi
, 0, sizeof (wi
));
2592 processing_debug_stmt
= 1;
2594 if (gimple_debug_source_bind_p (stmt
))
2595 t
= gimple_debug_source_bind_get_var (stmt
);
2597 t
= gimple_debug_bind_get_var (stmt
);
2599 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2600 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2602 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2605 else if (TREE_CODE (t
) == VAR_DECL
2606 && !is_global_var (t
)
2607 && !pointer_map_contains (id
->decl_map
, t
))
2608 /* T is a non-localized variable. */;
2610 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2612 if (gimple_debug_bind_p (stmt
))
2614 gimple_debug_bind_set_var (stmt
, t
);
2616 if (gimple_debug_bind_has_value_p (stmt
))
2617 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2618 remap_gimple_op_r
, &wi
, NULL
);
2620 /* Punt if any decl couldn't be remapped. */
2621 if (processing_debug_stmt
< 0)
2622 gimple_debug_bind_reset_value (stmt
);
2624 else if (gimple_debug_source_bind_p (stmt
))
2626 gimple_debug_source_bind_set_var (stmt
, t
);
2627 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2628 remap_gimple_op_r
, &wi
, NULL
);
2629 /* When inlining and source bind refers to one of the optimized
2630 away parameters, change the source bind into normal debug bind
2631 referring to the corresponding DEBUG_EXPR_DECL that should have
2632 been bound before the call stmt. */
2633 t
= gimple_debug_source_bind_get_value (stmt
);
2635 && TREE_CODE (t
) == PARM_DECL
2638 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2640 if (debug_args
!= NULL
)
2642 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2643 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2644 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2646 t
= (**debug_args
)[i
+ 1];
2647 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2648 gimple_debug_bind_set_value (stmt
, t
);
2655 processing_debug_stmt
= 0;
2660 /* Process deferred debug stmts. In order to give values better odds
2661 of being successfully remapped, we delay the processing of debug
2662 stmts until all other stmts that might require remapping are
2666 copy_debug_stmts (copy_body_data
*id
)
2671 if (!id
->debug_stmts
.exists ())
2674 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2675 copy_debug_stmt (stmt
, id
);
2677 id
->debug_stmts
.release ();
2680 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2681 another function. */
2684 copy_tree_body (copy_body_data
*id
)
2686 tree fndecl
= id
->src_fn
;
2687 tree body
= DECL_SAVED_TREE (fndecl
);
2689 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2694 /* Make a copy of the body of FN so that it can be inserted inline in
2695 another function. */
2698 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2699 basic_block entry_block_map
, basic_block exit_block_map
,
2700 basic_block new_entry
)
2702 tree fndecl
= id
->src_fn
;
2705 /* If this body has a CFG, walk CFG and copy. */
2706 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2707 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2709 copy_debug_stmts (id
);
2714 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2715 defined in function FN, or of a data member thereof. */
2718 self_inlining_addr_expr (tree value
, tree fn
)
2722 if (TREE_CODE (value
) != ADDR_EXPR
)
2725 var
= get_base_address (TREE_OPERAND (value
, 0));
2727 return var
&& auto_var_in_fn_p (var
, fn
);
2730 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2731 lexical block and line number information from base_stmt, if given,
2732 or from the last stmt of the block otherwise. */
2735 insert_init_debug_bind (copy_body_data
*id
,
2736 basic_block bb
, tree var
, tree value
,
2740 gimple_stmt_iterator gsi
;
2743 if (!gimple_in_ssa_p (id
->src_cfun
))
2746 if (!MAY_HAVE_DEBUG_STMTS
)
2749 tracked_var
= target_for_debug_bind (var
);
2755 gsi
= gsi_last_bb (bb
);
2756 if (!base_stmt
&& !gsi_end_p (gsi
))
2757 base_stmt
= gsi_stmt (gsi
);
2760 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2764 if (!gsi_end_p (gsi
))
2765 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2767 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2774 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2776 /* If VAR represents a zero-sized variable, it's possible that the
2777 assignment statement may result in no gimple statements. */
2780 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2782 /* We can end up with init statements that store to a non-register
2783 from a rhs with a conversion. Handle that here by forcing the
2784 rhs into a temporary. gimple_regimplify_operands is not
2785 prepared to do this for us. */
2786 if (!is_gimple_debug (init_stmt
)
2787 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2788 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2789 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2791 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2792 gimple_expr_type (init_stmt
),
2793 gimple_assign_rhs1 (init_stmt
));
2794 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2796 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2797 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2799 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2800 gimple_regimplify_operands (init_stmt
, &si
);
2802 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2804 tree def
= gimple_assign_lhs (init_stmt
);
2805 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2810 /* Initialize parameter P with VALUE. If needed, produce init statement
2811 at the end of BB. When BB is NULL, we return init statement to be
2814 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2815 basic_block bb
, tree
*vars
)
2817 gimple init_stmt
= NULL
;
2820 tree def
= (gimple_in_ssa_p (cfun
)
2821 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2824 && value
!= error_mark_node
2825 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2827 /* If we can match up types by promotion/demotion do so. */
2828 if (fold_convertible_p (TREE_TYPE (p
), value
))
2829 rhs
= fold_convert (TREE_TYPE (p
), value
);
2832 /* ??? For valid programs we should not end up here.
2833 Still if we end up with truly mismatched types here, fall back
2834 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2835 GIMPLE to the following passes. */
2836 if (!is_gimple_reg_type (TREE_TYPE (value
))
2837 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2838 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2840 rhs
= build_zero_cst (TREE_TYPE (p
));
2844 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2845 here since the type of this decl must be visible to the calling
2847 var
= copy_decl_to_var (p
, id
);
2849 /* Declare this new variable. */
2850 DECL_CHAIN (var
) = *vars
;
2853 /* Make gimplifier happy about this variable. */
2854 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2856 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2857 we would not need to create a new variable here at all, if it
2858 weren't for debug info. Still, we can just use the argument
2860 if (TREE_READONLY (p
)
2861 && !TREE_ADDRESSABLE (p
)
2862 && value
&& !TREE_SIDE_EFFECTS (value
)
2865 /* We may produce non-gimple trees by adding NOPs or introduce
2866 invalid sharing when operand is not really constant.
2867 It is not big deal to prohibit constant propagation here as
2868 we will constant propagate in DOM1 pass anyway. */
2869 if (is_gimple_min_invariant (value
)
2870 && useless_type_conversion_p (TREE_TYPE (p
),
2872 /* We have to be very careful about ADDR_EXPR. Make sure
2873 the base variable isn't a local variable of the inlined
2874 function, e.g., when doing recursive inlining, direct or
2875 mutually-recursive or whatever, which is why we don't
2876 just test whether fn == current_function_decl. */
2877 && ! self_inlining_addr_expr (value
, fn
))
2879 insert_decl_map (id
, p
, value
);
2880 insert_debug_decl_map (id
, p
, var
);
2881 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2885 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2886 that way, when the PARM_DECL is encountered, it will be
2887 automatically replaced by the VAR_DECL. */
2888 insert_decl_map (id
, p
, var
);
2890 /* Even if P was TREE_READONLY, the new VAR should not be.
2891 In the original code, we would have constructed a
2892 temporary, and then the function body would have never
2893 changed the value of P. However, now, we will be
2894 constructing VAR directly. The constructor body may
2895 change its value multiple times as it is being
2896 constructed. Therefore, it must not be TREE_READONLY;
2897 the back-end assumes that TREE_READONLY variable is
2898 assigned to only once. */
2899 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2900 TREE_READONLY (var
) = 0;
2902 /* If there is no setup required and we are in SSA, take the easy route
2903 replacing all SSA names representing the function parameter by the
2904 SSA name passed to function.
2906 We need to construct map for the variable anyway as it might be used
2907 in different SSA names when parameter is set in function.
2909 Do replacement at -O0 for const arguments replaced by constant.
2910 This is important for builtin_constant_p and other construct requiring
2911 constant argument to be visible in inlined function body. */
2912 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2914 || (TREE_READONLY (p
)
2915 && is_gimple_min_invariant (rhs
)))
2916 && (TREE_CODE (rhs
) == SSA_NAME
2917 || is_gimple_min_invariant (rhs
))
2918 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2920 insert_decl_map (id
, def
, rhs
);
2921 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2924 /* If the value of argument is never used, don't care about initializing
2926 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2928 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2929 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2932 /* Initialize this VAR_DECL from the equivalent argument. Convert
2933 the argument to the proper type in case it was promoted. */
2936 if (rhs
== error_mark_node
)
2938 insert_decl_map (id
, p
, var
);
2939 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2942 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2944 /* If we are in SSA form properly remap the default definition
2945 or assign to a dummy SSA name if the parameter is unused and
2946 we are not optimizing. */
2947 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2951 def
= remap_ssa_name (def
, id
);
2952 init_stmt
= gimple_build_assign (def
, rhs
);
2953 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2954 set_ssa_default_def (cfun
, var
, NULL
);
2958 def
= make_ssa_name (var
, NULL
);
2959 init_stmt
= gimple_build_assign (def
, rhs
);
2963 init_stmt
= gimple_build_assign (var
, rhs
);
2965 if (bb
&& init_stmt
)
2966 insert_init_stmt (id
, bb
, init_stmt
);
2971 /* Generate code to initialize the parameters of the function at the
2972 top of the stack in ID from the GIMPLE_CALL STMT. */
2975 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2976 tree fn
, basic_block bb
)
2981 tree vars
= NULL_TREE
;
2982 tree static_chain
= gimple_call_chain (stmt
);
2984 /* Figure out what the parameters are. */
2985 parms
= DECL_ARGUMENTS (fn
);
2987 /* Loop through the parameter declarations, replacing each with an
2988 equivalent VAR_DECL, appropriately initialized. */
2989 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2992 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2993 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2995 /* After remapping parameters remap their types. This has to be done
2996 in a second loop over all parameters to appropriately remap
2997 variable sized arrays when the size is specified in a
2998 parameter following the array. */
2999 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3001 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
3003 && TREE_CODE (*varp
) == VAR_DECL
)
3005 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3006 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3008 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3009 /* Also remap the default definition if it was remapped
3010 to the default definition of the parameter replacement
3011 by the parameter setup. */
3014 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
3016 && TREE_CODE (*defp
) == SSA_NAME
3017 && SSA_NAME_VAR (*defp
) == var
)
3018 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3023 /* Initialize the static chain. */
3024 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3025 gcc_assert (fn
!= current_function_decl
);
3028 /* No static chain? Seems like a bug in tree-nested.c. */
3029 gcc_assert (static_chain
);
3031 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3034 declare_inline_vars (id
->block
, vars
);
3038 /* Declare a return variable to replace the RESULT_DECL for the
3039 function we are calling. An appropriate DECL_STMT is returned.
3040 The USE_STMT is filled to contain a use of the declaration to
3041 indicate the return value of the function.
3043 RETURN_SLOT, if non-null is place where to store the result. It
3044 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3045 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3047 The return value is a (possibly null) value that holds the result
3048 as seen by the caller. */
3051 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3052 basic_block entry_bb
)
3054 tree callee
= id
->src_fn
;
3055 tree result
= DECL_RESULT (callee
);
3056 tree callee_type
= TREE_TYPE (result
);
3060 /* Handle type-mismatches in the function declaration return type
3061 vs. the call expression. */
3063 caller_type
= TREE_TYPE (modify_dest
);
3065 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3067 /* We don't need to do anything for functions that don't return anything. */
3068 if (VOID_TYPE_P (callee_type
))
3071 /* If there was a return slot, then the return value is the
3072 dereferenced address of that object. */
3075 /* The front end shouldn't have used both return_slot and
3076 a modify expression. */
3077 gcc_assert (!modify_dest
);
3078 if (DECL_BY_REFERENCE (result
))
3080 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3081 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3083 /* We are going to construct *&return_slot and we can't do that
3084 for variables believed to be not addressable.
3086 FIXME: This check possibly can match, because values returned
3087 via return slot optimization are not believed to have address
3088 taken by alias analysis. */
3089 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3090 var
= return_slot_addr
;
3095 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3096 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
3098 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3099 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3100 && !DECL_GIMPLE_REG_P (result
)
3102 DECL_GIMPLE_REG_P (var
) = 0;
3107 /* All types requiring non-trivial constructors should have been handled. */
3108 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3110 /* Attempt to avoid creating a new temporary variable. */
3112 && TREE_CODE (modify_dest
) != SSA_NAME
)
3114 bool use_it
= false;
3116 /* We can't use MODIFY_DEST if there's type promotion involved. */
3117 if (!useless_type_conversion_p (callee_type
, caller_type
))
3120 /* ??? If we're assigning to a variable sized type, then we must
3121 reuse the destination variable, because we've no good way to
3122 create variable sized temporaries at this point. */
3123 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3126 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3127 reuse it as the result of the call directly. Don't do this if
3128 it would promote MODIFY_DEST to addressable. */
3129 else if (TREE_ADDRESSABLE (result
))
3133 tree base_m
= get_base_address (modify_dest
);
3135 /* If the base isn't a decl, then it's a pointer, and we don't
3136 know where that's going to go. */
3137 if (!DECL_P (base_m
))
3139 else if (is_global_var (base_m
))
3141 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3142 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3143 && !DECL_GIMPLE_REG_P (result
)
3144 && DECL_GIMPLE_REG_P (base_m
))
3146 else if (!TREE_ADDRESSABLE (base_m
))
3158 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3160 var
= copy_result_decl_to_var (result
, id
);
3161 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3163 /* Do not have the rest of GCC warn about this variable as it should
3164 not be visible to the user. */
3165 TREE_NO_WARNING (var
) = 1;
3167 declare_inline_vars (id
->block
, var
);
3169 /* Build the use expr. If the return type of the function was
3170 promoted, convert it back to the expected type. */
3172 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3174 /* If we can match up types by promotion/demotion do so. */
3175 if (fold_convertible_p (caller_type
, var
))
3176 use
= fold_convert (caller_type
, var
);
3179 /* ??? For valid programs we should not end up here.
3180 Still if we end up with truly mismatched types here, fall back
3181 to using a MEM_REF to not leak invalid GIMPLE to the following
3183 /* Prevent var from being written into SSA form. */
3184 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3185 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3186 DECL_GIMPLE_REG_P (var
) = false;
3187 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3188 TREE_ADDRESSABLE (var
) = true;
3189 use
= fold_build2 (MEM_REF
, caller_type
,
3190 build_fold_addr_expr (var
),
3191 build_int_cst (ptr_type_node
, 0));
3195 STRIP_USELESS_TYPE_CONVERSION (use
);
3197 if (DECL_BY_REFERENCE (result
))
3199 TREE_ADDRESSABLE (var
) = 1;
3200 var
= build_fold_addr_expr (var
);
3204 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3205 way, when the RESULT_DECL is encountered, it will be
3206 automatically replaced by the VAR_DECL.
3208 When returning by reference, ensure that RESULT_DECL remaps to
3210 if (DECL_BY_REFERENCE (result
)
3211 && !is_gimple_val (var
))
3213 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3214 insert_decl_map (id
, result
, temp
);
3215 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3216 it's default_def SSA_NAME. */
3217 if (gimple_in_ssa_p (id
->src_cfun
)
3218 && is_gimple_reg (result
))
3220 temp
= make_ssa_name (temp
, NULL
);
3221 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3223 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3226 insert_decl_map (id
, result
, var
);
3228 /* Remember this so we can ignore it in remap_decls. */
3234 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3235 to a local label. */
3238 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3241 tree fn
= (tree
) fnp
;
3243 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3252 /* Determine if the function can be copied. If so return NULL. If
3253 not return a string describng the reason for failure. */
3256 copy_forbidden (struct function
*fun
, tree fndecl
)
3258 const char *reason
= fun
->cannot_be_copied_reason
;
3262 /* Only examine the function once. */
3263 if (fun
->cannot_be_copied_set
)
3266 /* We cannot copy a function that receives a non-local goto
3267 because we cannot remap the destination label used in the
3268 function that is performing the non-local goto. */
3269 /* ??? Actually, this should be possible, if we work at it.
3270 No doubt there's just a handful of places that simply
3271 assume it doesn't happen and don't substitute properly. */
3272 if (fun
->has_nonlocal_label
)
3274 reason
= G_("function %q+F can never be copied "
3275 "because it receives a non-local goto");
3279 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3280 if (TREE_CODE (decl
) == VAR_DECL
3281 && TREE_STATIC (decl
)
3282 && !DECL_EXTERNAL (decl
)
3283 && DECL_INITIAL (decl
)
3284 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3285 has_label_address_in_static_1
,
3288 reason
= G_("function %q+F can never be copied because it saves "
3289 "address of local label in a static variable");
3294 fun
->cannot_be_copied_reason
= reason
;
3295 fun
->cannot_be_copied_set
= true;
3300 static const char *inline_forbidden_reason
;
3302 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3303 iff a function can not be inlined. Also sets the reason why. */
3306 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3307 struct walk_stmt_info
*wip
)
3309 tree fn
= (tree
) wip
->info
;
3311 gimple stmt
= gsi_stmt (*gsi
);
3313 switch (gimple_code (stmt
))
3316 /* Refuse to inline alloca call unless user explicitly forced so as
3317 this may change program's memory overhead drastically when the
3318 function using alloca is called in loop. In GCC present in
3319 SPEC2000 inlining into schedule_block cause it to require 2GB of
3320 RAM instead of 256MB. Don't do so for alloca calls emitted for
3321 VLA objects as those can't cause unbounded growth (they're always
3322 wrapped inside stack_save/stack_restore regions. */
3323 if (gimple_alloca_call_p (stmt
)
3324 && !gimple_call_alloca_for_var_p (stmt
)
3325 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3327 inline_forbidden_reason
3328 = G_("function %q+F can never be inlined because it uses "
3329 "alloca (override using the always_inline attribute)");
3330 *handled_ops_p
= true;
3334 t
= gimple_call_fndecl (stmt
);
3338 /* We cannot inline functions that call setjmp. */
3339 if (setjmp_call_p (t
))
3341 inline_forbidden_reason
3342 = G_("function %q+F can never be inlined because it uses setjmp");
3343 *handled_ops_p
= true;
3347 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3348 switch (DECL_FUNCTION_CODE (t
))
3350 /* We cannot inline functions that take a variable number of
3352 case BUILT_IN_VA_START
:
3353 case BUILT_IN_NEXT_ARG
:
3354 case BUILT_IN_VA_END
:
3355 inline_forbidden_reason
3356 = G_("function %q+F can never be inlined because it "
3357 "uses variable argument lists");
3358 *handled_ops_p
= true;
3361 case BUILT_IN_LONGJMP
:
3362 /* We can't inline functions that call __builtin_longjmp at
3363 all. The non-local goto machinery really requires the
3364 destination be in a different function. If we allow the
3365 function calling __builtin_longjmp to be inlined into the
3366 function calling __builtin_setjmp, Things will Go Awry. */
3367 inline_forbidden_reason
3368 = G_("function %q+F can never be inlined because "
3369 "it uses setjmp-longjmp exception handling");
3370 *handled_ops_p
= true;
3373 case BUILT_IN_NONLOCAL_GOTO
:
3375 inline_forbidden_reason
3376 = G_("function %q+F can never be inlined because "
3377 "it uses non-local goto");
3378 *handled_ops_p
= true;
3381 case BUILT_IN_RETURN
:
3382 case BUILT_IN_APPLY_ARGS
:
3383 /* If a __builtin_apply_args caller would be inlined,
3384 it would be saving arguments of the function it has
3385 been inlined into. Similarly __builtin_return would
3386 return from the function the inline has been inlined into. */
3387 inline_forbidden_reason
3388 = G_("function %q+F can never be inlined because "
3389 "it uses __builtin_return or __builtin_apply_args");
3390 *handled_ops_p
= true;
3399 t
= gimple_goto_dest (stmt
);
3401 /* We will not inline a function which uses computed goto. The
3402 addresses of its local labels, which may be tucked into
3403 global storage, are of course not constant across
3404 instantiations, which causes unexpected behavior. */
3405 if (TREE_CODE (t
) != LABEL_DECL
)
3407 inline_forbidden_reason
3408 = G_("function %q+F can never be inlined "
3409 "because it contains a computed goto");
3410 *handled_ops_p
= true;
3419 *handled_ops_p
= false;
3423 /* Return true if FNDECL is a function that cannot be inlined into
3427 inline_forbidden_p (tree fndecl
)
3429 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3430 struct walk_stmt_info wi
;
3431 struct pointer_set_t
*visited_nodes
;
3433 bool forbidden_p
= false;
3435 /* First check for shared reasons not to copy the code. */
3436 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3437 if (inline_forbidden_reason
!= NULL
)
3440 /* Next, walk the statements of the function looking for
3441 constraucts we can't handle, or are non-optimal for inlining. */
3442 visited_nodes
= pointer_set_create ();
3443 memset (&wi
, 0, sizeof (wi
));
3444 wi
.info
= (void *) fndecl
;
3445 wi
.pset
= visited_nodes
;
3447 FOR_EACH_BB_FN (bb
, fun
)
3450 gimple_seq seq
= bb_seq (bb
);
3451 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3452 forbidden_p
= (ret
!= NULL
);
3457 pointer_set_destroy (visited_nodes
);
3461 /* Return false if the function FNDECL cannot be inlined on account of its
3462 attributes, true otherwise. */
3464 function_attribute_inlinable_p (const_tree fndecl
)
3466 if (targetm
.attribute_table
)
3470 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3472 const_tree name
= TREE_PURPOSE (a
);
3475 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3476 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3477 return targetm
.function_attribute_inlinable_p (fndecl
);
3484 /* Returns nonzero if FN is a function that does not have any
3485 fundamental inline blocking properties. */
3488 tree_inlinable_function_p (tree fn
)
3490 bool inlinable
= true;
3494 /* If we've already decided this function shouldn't be inlined,
3495 there's no need to check again. */
3496 if (DECL_UNINLINABLE (fn
))
3499 /* We only warn for functions declared `inline' by the user. */
3500 do_warning
= (warn_inline
3501 && DECL_DECLARED_INLINE_P (fn
)
3502 && !DECL_NO_INLINE_WARNING_P (fn
)
3503 && !DECL_IN_SYSTEM_HEADER (fn
));
3505 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3508 && always_inline
== NULL
)
3511 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3512 "is suppressed using -fno-inline", fn
);
3516 else if (!function_attribute_inlinable_p (fn
))
3519 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3520 "uses attributes conflicting with inlining", fn
);
3524 else if (inline_forbidden_p (fn
))
3526 /* See if we should warn about uninlinable functions. Previously,
3527 some of these warnings would be issued while trying to expand
3528 the function inline, but that would cause multiple warnings
3529 about functions that would for example call alloca. But since
3530 this a property of the function, just one warning is enough.
3531 As a bonus we can now give more details about the reason why a
3532 function is not inlinable. */
3534 error (inline_forbidden_reason
, fn
);
3535 else if (do_warning
)
3536 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3541 /* Squirrel away the result so that we don't have to check again. */
3542 DECL_UNINLINABLE (fn
) = !inlinable
;
3547 /* Estimate the cost of a memory move. Use machine dependent
3548 word size and take possible memcpy call into account. */
3551 estimate_move_cost (tree type
)
3555 gcc_assert (!VOID_TYPE_P (type
));
3557 if (TREE_CODE (type
) == VECTOR_TYPE
)
3559 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3560 enum machine_mode simd
3561 = targetm
.vectorize
.preferred_simd_mode (inner
);
3562 int simd_mode_size
= GET_MODE_SIZE (simd
);
3563 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3567 size
= int_size_in_bytes (type
);
3569 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3570 /* Cost of a memcpy call, 3 arguments and the call. */
3573 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3576 /* Returns cost of operation CODE, according to WEIGHTS */
3579 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3580 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3584 /* These are "free" conversions, or their presumed cost
3585 is folded into other operations. */
3590 case VIEW_CONVERT_EXPR
:
3593 /* Assign cost of 1 to usual operations.
3594 ??? We may consider mapping RTL costs to this. */
3600 case POINTER_PLUS_EXPR
:
3603 case MULT_HIGHPART_EXPR
:
3606 case ADDR_SPACE_CONVERT_EXPR
:
3607 case FIXED_CONVERT_EXPR
:
3608 case FIX_TRUNC_EXPR
:
3620 case VEC_LSHIFT_EXPR
:
3621 case VEC_RSHIFT_EXPR
:
3628 case TRUTH_ANDIF_EXPR
:
3629 case TRUTH_ORIF_EXPR
:
3630 case TRUTH_AND_EXPR
:
3632 case TRUTH_XOR_EXPR
:
3633 case TRUTH_NOT_EXPR
:
3642 case UNORDERED_EXPR
:
3653 case PREDECREMENT_EXPR
:
3654 case PREINCREMENT_EXPR
:
3655 case POSTDECREMENT_EXPR
:
3656 case POSTINCREMENT_EXPR
:
3658 case REALIGN_LOAD_EXPR
:
3660 case REDUC_MAX_EXPR
:
3661 case REDUC_MIN_EXPR
:
3662 case REDUC_PLUS_EXPR
:
3663 case WIDEN_SUM_EXPR
:
3664 case WIDEN_MULT_EXPR
:
3666 case WIDEN_MULT_PLUS_EXPR
:
3667 case WIDEN_MULT_MINUS_EXPR
:
3668 case WIDEN_LSHIFT_EXPR
:
3670 case VEC_WIDEN_MULT_HI_EXPR
:
3671 case VEC_WIDEN_MULT_LO_EXPR
:
3672 case VEC_WIDEN_MULT_EVEN_EXPR
:
3673 case VEC_WIDEN_MULT_ODD_EXPR
:
3674 case VEC_UNPACK_HI_EXPR
:
3675 case VEC_UNPACK_LO_EXPR
:
3676 case VEC_UNPACK_FLOAT_HI_EXPR
:
3677 case VEC_UNPACK_FLOAT_LO_EXPR
:
3678 case VEC_PACK_TRUNC_EXPR
:
3679 case VEC_PACK_SAT_EXPR
:
3680 case VEC_PACK_FIX_TRUNC_EXPR
:
3681 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3682 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3686 /* Few special cases of expensive operations. This is useful
3687 to avoid inlining on functions having too many of these. */
3688 case TRUNC_DIV_EXPR
:
3690 case FLOOR_DIV_EXPR
:
3691 case ROUND_DIV_EXPR
:
3692 case EXACT_DIV_EXPR
:
3693 case TRUNC_MOD_EXPR
:
3695 case FLOOR_MOD_EXPR
:
3696 case ROUND_MOD_EXPR
:
3698 if (TREE_CODE (op2
) != INTEGER_CST
)
3699 return weights
->div_mod_cost
;
3703 /* We expect a copy assignment with no operator. */
3704 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3710 /* Estimate number of instructions that will be created by expanding
3711 the statements in the statement sequence STMTS.
3712 WEIGHTS contains weights attributed to various constructs. */
3715 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3718 gimple_stmt_iterator gsi
;
3721 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3722 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3728 /* Estimate number of instructions that will be created by expanding STMT.
3729 WEIGHTS contains weights attributed to various constructs. */
3732 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3735 enum gimple_code code
= gimple_code (stmt
);
3742 /* Try to estimate the cost of assignments. We have three cases to
3744 1) Simple assignments to registers;
3745 2) Stores to things that must live in memory. This includes
3746 "normal" stores to scalars, but also assignments of large
3747 structures, or constructors of big arrays;
3749 Let us look at the first two cases, assuming we have "a = b + C":
3750 <GIMPLE_ASSIGN <var_decl "a">
3751 <plus_expr <var_decl "b"> <constant C>>
3752 If "a" is a GIMPLE register, the assignment to it is free on almost
3753 any target, because "a" usually ends up in a real register. Hence
3754 the only cost of this expression comes from the PLUS_EXPR, and we
3755 can ignore the GIMPLE_ASSIGN.
3756 If "a" is not a GIMPLE register, the assignment to "a" will most
3757 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3758 of moving something into "a", which we compute using the function
3759 estimate_move_cost. */
3760 if (gimple_clobber_p (stmt
))
3761 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3763 lhs
= gimple_assign_lhs (stmt
);
3764 rhs
= gimple_assign_rhs1 (stmt
);
3768 /* Account for the cost of moving to / from memory. */
3769 if (gimple_store_p (stmt
))
3770 cost
+= estimate_move_cost (TREE_TYPE (lhs
));
3771 if (gimple_assign_load_p (stmt
))
3772 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3774 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3775 gimple_assign_rhs1 (stmt
),
3776 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3777 == GIMPLE_BINARY_RHS
3778 ? gimple_assign_rhs2 (stmt
) : NULL
);
3782 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3783 gimple_op (stmt
, 0),
3784 gimple_op (stmt
, 1));
3788 /* Take into account cost of the switch + guess 2 conditional jumps for
3791 TODO: once the switch expansion logic is sufficiently separated, we can
3792 do better job on estimating cost of the switch. */
3793 if (weights
->time_based
)
3794 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3796 cost
= gimple_switch_num_labels (stmt
) * 2;
3802 struct cgraph_node
*node
= NULL
;
3804 /* Do not special case builtins where we see the body.
3805 This just confuse inliner. */
3806 if (gimple_call_internal_p (stmt
))
3808 else if (!(decl
= gimple_call_fndecl (stmt
))
3809 || !(node
= cgraph_get_node (decl
))
3810 || node
->definition
)
3812 /* For buitins that are likely expanded to nothing or
3813 inlined do not account operand costs. */
3814 else if (is_simple_builtin (decl
))
3816 else if (is_inexpensive_builtin (decl
))
3817 return weights
->target_builtin_call_cost
;
3818 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3820 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3821 specialize the cheap expansion we do here.
3822 ??? This asks for a more general solution. */
3823 switch (DECL_FUNCTION_CODE (decl
))
3828 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3829 && REAL_VALUES_EQUAL
3830 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3831 return estimate_operator_cost (MULT_EXPR
, weights
,
3832 gimple_call_arg (stmt
, 0),
3833 gimple_call_arg (stmt
, 0));
3841 cost
= node
? weights
->call_cost
: weights
->indirect_call_cost
;
3842 if (gimple_call_lhs (stmt
))
3843 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3844 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3846 tree arg
= gimple_call_arg (stmt
, i
);
3847 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3853 return weights
->return_cost
;
3859 case GIMPLE_PREDICT
:
3865 int count
= asm_str_count (gimple_asm_string (stmt
));
3866 /* 1000 means infinity. This avoids overflows later
3867 with very long asm statements. */
3874 /* This is either going to be an external function call with one
3875 argument, or two register copy statements plus a goto. */
3878 case GIMPLE_EH_DISPATCH
:
3879 /* ??? This is going to turn into a switch statement. Ideally
3880 we'd have a look at the eh region and estimate the number of
3885 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3887 case GIMPLE_EH_FILTER
:
3888 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3891 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3894 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3895 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3897 /* OpenMP directives are generally very expensive. */
3899 case GIMPLE_OMP_RETURN
:
3900 case GIMPLE_OMP_SECTIONS_SWITCH
:
3901 case GIMPLE_OMP_ATOMIC_STORE
:
3902 case GIMPLE_OMP_CONTINUE
:
3903 /* ...except these, which are cheap. */
3906 case GIMPLE_OMP_ATOMIC_LOAD
:
3907 return weights
->omp_cost
;
3909 case GIMPLE_OMP_FOR
:
3910 return (weights
->omp_cost
3911 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3912 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3914 case GIMPLE_OMP_PARALLEL
:
3915 case GIMPLE_OMP_TASK
:
3916 case GIMPLE_OMP_CRITICAL
:
3917 case GIMPLE_OMP_MASTER
:
3918 case GIMPLE_OMP_TASKGROUP
:
3919 case GIMPLE_OMP_ORDERED
:
3920 case GIMPLE_OMP_SECTION
:
3921 case GIMPLE_OMP_SECTIONS
:
3922 case GIMPLE_OMP_SINGLE
:
3923 case GIMPLE_OMP_TARGET
:
3924 case GIMPLE_OMP_TEAMS
:
3925 return (weights
->omp_cost
3926 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3928 case GIMPLE_TRANSACTION
:
3929 return (weights
->tm_cost
3930 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3940 /* Estimate number of instructions that will be created by expanding
3941 function FNDECL. WEIGHTS contains weights attributed to various
3945 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3947 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3948 gimple_stmt_iterator bsi
;
3952 gcc_assert (my_function
&& my_function
->cfg
);
3953 FOR_EACH_BB_FN (bb
, my_function
)
3955 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3956 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3963 /* Initializes weights used by estimate_num_insns. */
3966 init_inline_once (void)
3968 eni_size_weights
.call_cost
= 1;
3969 eni_size_weights
.indirect_call_cost
= 3;
3970 eni_size_weights
.target_builtin_call_cost
= 1;
3971 eni_size_weights
.div_mod_cost
= 1;
3972 eni_size_weights
.omp_cost
= 40;
3973 eni_size_weights
.tm_cost
= 10;
3974 eni_size_weights
.time_based
= false;
3975 eni_size_weights
.return_cost
= 1;
3977 /* Estimating time for call is difficult, since we have no idea what the
3978 called function does. In the current uses of eni_time_weights,
3979 underestimating the cost does less harm than overestimating it, so
3980 we choose a rather small value here. */
3981 eni_time_weights
.call_cost
= 10;
3982 eni_time_weights
.indirect_call_cost
= 15;
3983 eni_time_weights
.target_builtin_call_cost
= 1;
3984 eni_time_weights
.div_mod_cost
= 10;
3985 eni_time_weights
.omp_cost
= 40;
3986 eni_time_weights
.tm_cost
= 40;
3987 eni_time_weights
.time_based
= true;
3988 eni_time_weights
.return_cost
= 2;
3991 /* Estimate the number of instructions in a gimple_seq. */
3994 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3996 gimple_stmt_iterator gsi
;
3998 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3999 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4005 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4008 prepend_lexical_block (tree current_block
, tree new_block
)
4010 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4011 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4012 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4015 /* Add local variables from CALLEE to CALLER. */
4018 add_local_variables (struct function
*callee
, struct function
*caller
,
4024 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4025 if (!can_be_nonlocal (var
, id
))
4027 tree new_var
= remap_decl (var
, id
);
4029 /* Remap debug-expressions. */
4030 if (TREE_CODE (new_var
) == VAR_DECL
4031 && DECL_HAS_DEBUG_EXPR_P (var
)
4034 tree tem
= DECL_DEBUG_EXPR (var
);
4035 bool old_regimplify
= id
->regimplify
;
4036 id
->remapping_type_depth
++;
4037 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4038 id
->remapping_type_depth
--;
4039 id
->regimplify
= old_regimplify
;
4040 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4041 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4043 add_local_decl (caller
, new_var
);
4047 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4050 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
4054 struct pointer_map_t
*st
, *dst
;
4057 location_t saved_location
;
4058 struct cgraph_edge
*cg_edge
;
4059 cgraph_inline_failed_t reason
;
4060 basic_block return_block
;
4062 gimple_stmt_iterator gsi
, stmt_gsi
;
4063 bool successfully_inlined
= FALSE
;
4064 bool purge_dead_abnormal_edges
;
4066 /* Set input_location here so we get the right instantiation context
4067 if we call instantiate_decl from inlinable_function_p. */
4068 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
4069 saved_location
= input_location
;
4070 input_location
= gimple_location (stmt
);
4072 /* From here on, we're only interested in CALL_EXPRs. */
4073 if (gimple_code (stmt
) != GIMPLE_CALL
)
4076 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
4077 gcc_checking_assert (cg_edge
);
4078 /* First, see if we can figure out what function is being called.
4079 If we cannot, then there is no hope of inlining the function. */
4080 if (cg_edge
->indirect_unknown_callee
)
4082 fn
= cg_edge
->callee
->decl
;
4083 gcc_checking_assert (fn
);
4085 /* If FN is a declaration of a function in a nested scope that was
4086 globally declared inline, we don't set its DECL_INITIAL.
4087 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4088 C++ front-end uses it for cdtors to refer to their internal
4089 declarations, that are not real functions. Fortunately those
4090 don't have trees to be saved, so we can tell by checking their
4092 if (!DECL_INITIAL (fn
)
4093 && DECL_ABSTRACT_ORIGIN (fn
)
4094 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4095 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4097 /* Don't try to inline functions that are not well-suited to inlining. */
4098 if (cg_edge
->inline_failed
)
4100 reason
= cg_edge
->inline_failed
;
4101 /* If this call was originally indirect, we do not want to emit any
4102 inlining related warnings or sorry messages because there are no
4103 guarantees regarding those. */
4104 if (cg_edge
->indirect_inlining_edge
)
4107 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4108 /* For extern inline functions that get redefined we always
4109 silently ignored always_inline flag. Better behaviour would
4110 be to be able to keep both bodies and use extern inline body
4111 for inlining, but we can't do that because frontends overwrite
4113 && !cg_edge
->callee
->local
.redefined_extern_inline
4114 /* During early inline pass, report only when optimization is
4116 && (cgraph_global_info_ready
4118 /* PR 20090218-1_0.c. Body can be provided by another module. */
4119 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4121 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4122 cgraph_inline_failed_string (reason
));
4123 error ("called from here");
4125 else if (warn_inline
4126 && DECL_DECLARED_INLINE_P (fn
)
4127 && !DECL_NO_INLINE_WARNING_P (fn
)
4128 && !DECL_IN_SYSTEM_HEADER (fn
)
4129 && reason
!= CIF_UNSPECIFIED
4130 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4131 /* Do not warn about not inlined recursive calls. */
4132 && !cgraph_edge_recursive_p (cg_edge
)
4133 /* Avoid warnings during early inline pass. */
4134 && cgraph_global_info_ready
)
4136 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4137 fn
, _(cgraph_inline_failed_string (reason
)));
4138 warning (OPT_Winline
, "called from here");
4142 fn
= cg_edge
->callee
->decl
;
4143 cgraph_get_body (cg_edge
->callee
);
4145 #ifdef ENABLE_CHECKING
4146 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4147 verify_cgraph_node (cg_edge
->callee
);
4150 /* We will be inlining this callee. */
4151 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4153 /* Update the callers EH personality. */
4154 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4155 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4156 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4158 /* Split the block holding the GIMPLE_CALL. */
4159 e
= split_block (bb
, stmt
);
4161 return_block
= e
->dest
;
4164 /* split_block splits after the statement; work around this by
4165 moving the call into the second block manually. Not pretty,
4166 but seems easier than doing the CFG manipulation by hand
4167 when the GIMPLE_CALL is in the last statement of BB. */
4168 stmt_gsi
= gsi_last_bb (bb
);
4169 gsi_remove (&stmt_gsi
, false);
4171 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4172 been the source of abnormal edges. In this case, schedule
4173 the removal of dead abnormal edges. */
4174 gsi
= gsi_start_bb (return_block
);
4175 if (gsi_end_p (gsi
))
4177 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4178 purge_dead_abnormal_edges
= true;
4182 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4183 purge_dead_abnormal_edges
= false;
4186 stmt_gsi
= gsi_start_bb (return_block
);
4188 /* Build a block containing code to initialize the arguments, the
4189 actual inline expansion of the body, and a label for the return
4190 statements within the function to jump to. The type of the
4191 statement expression is the return type of the function call.
4192 ??? If the call does not have an associated block then we will
4193 remap all callee blocks to NULL, effectively dropping most of
4194 its debug information. This should only happen for calls to
4195 artificial decls inserted by the compiler itself. We need to
4196 either link the inlined blocks into the caller block tree or
4197 not refer to them in any way to not break GC for locations. */
4198 if (gimple_block (stmt
))
4200 id
->block
= make_node (BLOCK
);
4201 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4202 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
4203 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4206 /* Local declarations will be replaced by their equivalents in this
4209 id
->decl_map
= pointer_map_create ();
4210 dst
= id
->debug_map
;
4211 id
->debug_map
= NULL
;
4213 /* Record the function we are about to inline. */
4215 id
->src_node
= cg_edge
->callee
;
4216 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4217 id
->gimple_call
= stmt
;
4219 gcc_assert (!id
->src_cfun
->after_inlining
);
4222 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4224 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4225 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4229 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4231 if (DECL_INITIAL (fn
))
4233 if (gimple_block (stmt
))
4237 prepend_lexical_block (id
->block
,
4238 remap_blocks (DECL_INITIAL (fn
), id
));
4239 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4240 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4242 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4243 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4244 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4245 under it. The parameters can be then evaluated in the debugger,
4246 but don't show in backtraces. */
4247 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4248 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4251 *var
= TREE_CHAIN (v
);
4252 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4253 BLOCK_VARS (id
->block
) = v
;
4256 var
= &TREE_CHAIN (*var
);
4259 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4262 /* Return statements in the function body will be replaced by jumps
4263 to the RET_LABEL. */
4264 gcc_assert (DECL_INITIAL (fn
));
4265 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4267 /* Find the LHS to which the result of this call is assigned. */
4269 if (gimple_call_lhs (stmt
))
4271 modify_dest
= gimple_call_lhs (stmt
);
4273 /* The function which we are inlining might not return a value,
4274 in which case we should issue a warning that the function
4275 does not return a value. In that case the optimizers will
4276 see that the variable to which the value is assigned was not
4277 initialized. We do not want to issue a warning about that
4278 uninitialized variable. */
4279 if (DECL_P (modify_dest
))
4280 TREE_NO_WARNING (modify_dest
) = 1;
4282 if (gimple_call_return_slot_opt_p (stmt
))
4284 return_slot
= modify_dest
;
4291 /* If we are inlining a call to the C++ operator new, we don't want
4292 to use type based alias analysis on the return value. Otherwise
4293 we may get confused if the compiler sees that the inlined new
4294 function returns a pointer which was just deleted. See bug
4296 if (DECL_IS_OPERATOR_NEW (fn
))
4302 /* Declare the return variable for the function. */
4303 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4305 /* Add local vars in this inlined callee to caller. */
4306 add_local_variables (id
->src_cfun
, cfun
, id
);
4308 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4310 fprintf (dump_file
, "Inlining ");
4311 print_generic_expr (dump_file
, id
->src_fn
, 0);
4312 fprintf (dump_file
, " to ");
4313 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4314 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4317 /* This is it. Duplicate the callee body. Assume callee is
4318 pre-gimplified. Note that we must not alter the caller
4319 function in any way before this point, as this CALL_EXPR may be
4320 a self-referential call; if we're calling ourselves, we need to
4321 duplicate our body before altering anything. */
4322 copy_body (id
, bb
->count
,
4323 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4324 bb
, return_block
, NULL
);
4326 /* Reset the escaped solution. */
4327 if (cfun
->gimple_df
)
4328 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4333 pointer_map_destroy (id
->debug_map
);
4334 id
->debug_map
= dst
;
4336 pointer_map_destroy (id
->decl_map
);
4339 /* Unlink the calls virtual operands before replacing it. */
4340 unlink_stmt_vdef (stmt
);
4342 /* If the inlined function returns a result that we care about,
4343 substitute the GIMPLE_CALL with an assignment of the return
4344 variable to the LHS of the call. That is, if STMT was
4345 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4346 if (use_retvar
&& gimple_call_lhs (stmt
))
4348 gimple old_stmt
= stmt
;
4349 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4350 gsi_replace (&stmt_gsi
, stmt
, false);
4351 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4355 /* Handle the case of inlining a function with no return
4356 statement, which causes the return value to become undefined. */
4357 if (gimple_call_lhs (stmt
)
4358 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4360 tree name
= gimple_call_lhs (stmt
);
4361 tree var
= SSA_NAME_VAR (name
);
4362 tree def
= ssa_default_def (cfun
, var
);
4366 /* If the variable is used undefined, make this name
4367 undefined via a move. */
4368 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4369 gsi_replace (&stmt_gsi
, stmt
, true);
4373 /* Otherwise make this variable undefined. */
4374 gsi_remove (&stmt_gsi
, true);
4375 set_ssa_default_def (cfun
, var
, name
);
4376 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4380 gsi_remove (&stmt_gsi
, true);
4383 if (purge_dead_abnormal_edges
)
4385 gimple_purge_dead_eh_edges (return_block
);
4386 gimple_purge_dead_abnormal_call_edges (return_block
);
4389 /* If the value of the new expression is ignored, that's OK. We
4390 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4391 the equivalent inlined version either. */
4392 if (is_gimple_assign (stmt
))
4394 gcc_assert (gimple_assign_single_p (stmt
)
4395 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4396 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4399 /* Output the inlining info for this abstract function, since it has been
4400 inlined. If we don't do this now, we can lose the information about the
4401 variables in the function when the blocks get blown away as soon as we
4402 remove the cgraph node. */
4403 if (gimple_block (stmt
))
4404 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4406 /* Update callgraph if needed. */
4407 cgraph_remove_node (cg_edge
->callee
);
4409 id
->block
= NULL_TREE
;
4410 successfully_inlined
= TRUE
;
4413 input_location
= saved_location
;
4414 return successfully_inlined
;
4417 /* Expand call statements reachable from STMT_P.
4418 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4419 in a MODIFY_EXPR. */
4422 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4424 gimple_stmt_iterator gsi
;
4426 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4428 gimple stmt
= gsi_stmt (gsi
);
4430 if (is_gimple_call (stmt
)
4431 && !gimple_call_internal_p (stmt
)
4432 && expand_call_inline (bb
, stmt
, id
))
4440 /* Walk all basic blocks created after FIRST and try to fold every statement
4441 in the STATEMENTS pointer set. */
4444 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4446 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4447 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4449 gimple_stmt_iterator gsi
;
4451 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4454 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4456 gimple old_stmt
= gsi_stmt (gsi
);
4457 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4459 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4461 /* Folding builtins can create multiple instructions,
4462 we need to look at all of them. */
4463 gimple_stmt_iterator i2
= gsi
;
4465 if (fold_stmt (&gsi
))
4468 /* If a builtin at the end of a bb folded into nothing,
4469 the following loop won't work. */
4470 if (gsi_end_p (gsi
))
4472 cgraph_update_edges_for_call_stmt (old_stmt
,
4477 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4482 new_stmt
= gsi_stmt (i2
);
4483 update_stmt (new_stmt
);
4484 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4487 if (new_stmt
== gsi_stmt (gsi
))
4489 /* It is okay to check only for the very last
4490 of these statements. If it is a throwing
4491 statement nothing will change. If it isn't
4492 this can remove EH edges. If that weren't
4493 correct then because some intermediate stmts
4494 throw, but not the last one. That would mean
4495 we'd have to split the block, which we can't
4496 here and we'd loose anyway. And as builtins
4497 probably never throw, this all
4499 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4501 gimple_purge_dead_eh_edges (
4502 BASIC_BLOCK_FOR_FN (cfun
, first
));
4509 else if (fold_stmt (&gsi
))
4511 /* Re-read the statement from GSI as fold_stmt() may
4513 gimple new_stmt
= gsi_stmt (gsi
);
4514 update_stmt (new_stmt
);
4516 if (is_gimple_call (old_stmt
)
4517 || is_gimple_call (new_stmt
))
4518 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4521 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4522 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
4529 /* Expand calls to inline functions in the body of FN. */
4532 optimize_inline_calls (tree fn
)
4536 int last
= n_basic_blocks_for_fn (cfun
);
4537 bool inlined_p
= false;
4540 memset (&id
, 0, sizeof (id
));
4542 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4543 gcc_assert (id
.dst_node
->definition
);
4545 /* Or any functions that aren't finished yet. */
4546 if (current_function_decl
)
4547 id
.dst_fn
= current_function_decl
;
4549 id
.copy_decl
= copy_decl_maybe_to_var
;
4550 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4551 id
.transform_new_cfg
= false;
4552 id
.transform_return_to_modify
= true;
4553 id
.transform_parameter
= true;
4554 id
.transform_lang_insert_block
= NULL
;
4555 id
.statements_to_fold
= pointer_set_create ();
4557 push_gimplify_context ();
4559 /* We make no attempts to keep dominance info up-to-date. */
4560 free_dominance_info (CDI_DOMINATORS
);
4561 free_dominance_info (CDI_POST_DOMINATORS
);
4563 /* Register specific gimple functions. */
4564 gimple_register_cfg_hooks ();
4566 /* Reach the trees by walking over the CFG, and note the
4567 enclosing basic-blocks in the call edges. */
4568 /* We walk the blocks going forward, because inlined function bodies
4569 will split id->current_basic_block, and the new blocks will
4570 follow it; we'll trudge through them, processing their CALL_EXPRs
4573 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4575 pop_gimplify_context (NULL
);
4577 #ifdef ENABLE_CHECKING
4579 struct cgraph_edge
*e
;
4581 verify_cgraph_node (id
.dst_node
);
4583 /* Double check that we inlined everything we are supposed to inline. */
4584 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4585 gcc_assert (e
->inline_failed
);
4589 /* Fold queued statements. */
4590 fold_marked_statements (last
, id
.statements_to_fold
);
4591 pointer_set_destroy (id
.statements_to_fold
);
4593 gcc_assert (!id
.debug_stmts
.exists ());
4595 /* If we didn't inline into the function there is nothing to do. */
4599 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4602 delete_unreachable_blocks_update_callgraph (&id
);
4603 #ifdef ENABLE_CHECKING
4604 verify_cgraph_node (id
.dst_node
);
4607 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4608 not possible yet - the IPA passes might make various functions to not
4609 throw and they don't care to proactively update local EH info. This is
4610 done later in fixup_cfg pass that also execute the verification. */
4611 return (TODO_update_ssa
4613 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4614 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4615 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
4618 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4621 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4623 enum tree_code code
= TREE_CODE (*tp
);
4624 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4626 /* We make copies of most nodes. */
4627 if (IS_EXPR_CODE_CLASS (cl
)
4628 || code
== TREE_LIST
4630 || code
== TYPE_DECL
4631 || code
== OMP_CLAUSE
)
4633 /* Because the chain gets clobbered when we make a copy, we save it
4635 tree chain
= NULL_TREE
, new_tree
;
4637 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4638 chain
= TREE_CHAIN (*tp
);
4640 /* Copy the node. */
4641 new_tree
= copy_node (*tp
);
4645 /* Now, restore the chain, if appropriate. That will cause
4646 walk_tree to walk into the chain as well. */
4647 if (code
== PARM_DECL
4648 || code
== TREE_LIST
4649 || code
== OMP_CLAUSE
)
4650 TREE_CHAIN (*tp
) = chain
;
4652 /* For now, we don't update BLOCKs when we make copies. So, we
4653 have to nullify all BIND_EXPRs. */
4654 if (TREE_CODE (*tp
) == BIND_EXPR
)
4655 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4657 else if (code
== CONSTRUCTOR
)
4659 /* CONSTRUCTOR nodes need special handling because
4660 we need to duplicate the vector of elements. */
4663 new_tree
= copy_node (*tp
);
4664 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
4667 else if (code
== STATEMENT_LIST
)
4668 /* We used to just abort on STATEMENT_LIST, but we can run into them
4669 with statement-expressions (c++/40975). */
4670 copy_statement_list (tp
);
4671 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4673 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4675 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4680 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4681 information indicating to what new SAVE_EXPR this one should be mapped,
4682 use that one. Otherwise, create a new node and enter it in ST. FN is
4683 the function into which the copy will be placed. */
4686 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4688 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4692 /* See if we already encountered this SAVE_EXPR. */
4693 n
= (tree
*) pointer_map_contains (st
, *tp
);
4695 /* If we didn't already remap this SAVE_EXPR, do so now. */
4698 t
= copy_node (*tp
);
4700 /* Remember this SAVE_EXPR. */
4701 *pointer_map_insert (st
, *tp
) = t
;
4702 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4703 *pointer_map_insert (st
, t
) = t
;
4707 /* We've already walked into this SAVE_EXPR; don't do it again. */
4712 /* Replace this SAVE_EXPR with the copy. */
4716 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4717 label, copies the declaration and enters it in the splay_tree in DATA (which
4718 is really a 'copy_body_data *'. */
4721 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4722 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4723 struct walk_stmt_info
*wi
)
4725 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4726 gimple stmt
= gsi_stmt (*gsip
);
4728 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4730 tree decl
= gimple_label_label (stmt
);
4732 /* Copy the decl and remember the copy. */
4733 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4740 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4741 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4742 remaps all local declarations to appropriate replacements in gimple
4746 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4748 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4749 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4750 struct pointer_map_t
*st
= id
->decl_map
;
4754 /* Only a local declaration (variable or label). */
4755 if ((TREE_CODE (expr
) == VAR_DECL
4756 && !TREE_STATIC (expr
))
4757 || TREE_CODE (expr
) == LABEL_DECL
)
4759 /* Lookup the declaration. */
4760 n
= (tree
*) pointer_map_contains (st
, expr
);
4762 /* If it's there, remap it. */
4767 else if (TREE_CODE (expr
) == STATEMENT_LIST
4768 || TREE_CODE (expr
) == BIND_EXPR
4769 || TREE_CODE (expr
) == SAVE_EXPR
)
4771 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4773 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4774 It's OK for this to happen if it was part of a subtree that
4775 isn't immediately expanded, such as operand 2 of another
4777 if (!TREE_OPERAND (expr
, 1))
4779 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4780 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4784 /* Keep iterating. */
4789 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4790 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4791 remaps all local declarations to appropriate replacements in gimple
4795 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4796 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4797 struct walk_stmt_info
*wi
)
4799 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4800 gimple stmt
= gsi_stmt (*gsip
);
4802 if (gimple_code (stmt
) == GIMPLE_BIND
)
4804 tree block
= gimple_bind_block (stmt
);
4808 remap_block (&block
, id
);
4809 gimple_bind_set_block (stmt
, block
);
4812 /* This will remap a lot of the same decls again, but this should be
4814 if (gimple_bind_vars (stmt
))
4815 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
4819 /* Keep iterating. */
4824 /* Copies everything in SEQ and replaces variables and labels local to
4825 current_function_decl. */
4828 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4831 struct walk_stmt_info wi
;
4832 struct pointer_set_t
*visited
;
4835 /* There's nothing to do for NULL_TREE. */
4840 memset (&id
, 0, sizeof (id
));
4841 id
.src_fn
= current_function_decl
;
4842 id
.dst_fn
= current_function_decl
;
4843 id
.decl_map
= pointer_map_create ();
4844 id
.debug_map
= NULL
;
4846 id
.copy_decl
= copy_decl_no_change
;
4847 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4848 id
.transform_new_cfg
= false;
4849 id
.transform_return_to_modify
= false;
4850 id
.transform_parameter
= false;
4851 id
.transform_lang_insert_block
= NULL
;
4853 /* Walk the tree once to find local labels. */
4854 memset (&wi
, 0, sizeof (wi
));
4855 visited
= pointer_set_create ();
4858 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4859 pointer_set_destroy (visited
);
4861 copy
= gimple_seq_copy (seq
);
4863 /* Walk the copy, remapping decls. */
4864 memset (&wi
, 0, sizeof (wi
));
4866 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4869 pointer_map_destroy (id
.decl_map
);
4871 pointer_map_destroy (id
.debug_map
);
4877 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4880 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4889 debug_find_tree (tree top
, tree search
)
4891 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4895 /* Declare the variables created by the inliner. Add all the variables in
4896 VARS to BIND_EXPR. */
4899 declare_inline_vars (tree block
, tree vars
)
4902 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4904 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4905 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4906 add_local_decl (cfun
, t
);
4910 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4913 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4914 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4915 VAR_DECL translation. */
4918 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4920 /* Don't generate debug information for the copy if we wouldn't have
4921 generated it for the copy either. */
4922 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4923 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4925 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4926 declaration inspired this copy. */
4927 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4929 /* The new variable/label has no RTL, yet. */
4930 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4931 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4932 SET_DECL_RTL (copy
, 0);
4934 /* These args would always appear unused, if not for this. */
4935 TREE_USED (copy
) = 1;
4937 /* Set the context for the new declaration. */
4938 if (!DECL_CONTEXT (decl
))
4939 /* Globals stay global. */
4941 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4942 /* Things that weren't in the scope of the function we're inlining
4943 from aren't in the scope we're inlining to, either. */
4945 else if (TREE_STATIC (decl
))
4946 /* Function-scoped static variables should stay in the original
4950 /* Ordinary automatic local variables are now in the scope of the
4952 DECL_CONTEXT (copy
) = id
->dst_fn
;
4958 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4962 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4963 || TREE_CODE (decl
) == RESULT_DECL
);
4965 type
= TREE_TYPE (decl
);
4967 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4968 VAR_DECL
, DECL_NAME (decl
), type
);
4969 if (DECL_PT_UID_SET_P (decl
))
4970 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4971 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4972 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4973 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4974 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4976 return copy_decl_for_dup_finish (id
, decl
, copy
);
4979 /* Like copy_decl_to_var, but create a return slot object instead of a
4980 pointer variable for return by invisible reference. */
4983 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4987 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4988 || TREE_CODE (decl
) == RESULT_DECL
);
4990 type
= TREE_TYPE (decl
);
4991 if (DECL_BY_REFERENCE (decl
))
4992 type
= TREE_TYPE (type
);
4994 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4995 VAR_DECL
, DECL_NAME (decl
), type
);
4996 if (DECL_PT_UID_SET_P (decl
))
4997 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4998 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4999 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5000 if (!DECL_BY_REFERENCE (decl
))
5002 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5003 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5006 return copy_decl_for_dup_finish (id
, decl
, copy
);
5010 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5014 copy
= copy_node (decl
);
5016 /* The COPY is not abstract; it will be generated in DST_FN. */
5017 DECL_ABSTRACT (copy
) = 0;
5018 lang_hooks
.dup_lang_specific_decl (copy
);
5020 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5021 been taken; it's for internal bookkeeping in expand_goto_internal. */
5022 if (TREE_CODE (copy
) == LABEL_DECL
)
5024 TREE_ADDRESSABLE (copy
) = 0;
5025 LABEL_DECL_UID (copy
) = -1;
5028 return copy_decl_for_dup_finish (id
, decl
, copy
);
5032 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5034 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5035 return copy_decl_to_var (decl
, id
);
5037 return copy_decl_no_change (decl
, id
);
5040 /* Return a copy of the function's argument tree. */
5042 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5043 bitmap args_to_skip
, tree
*vars
)
5046 tree new_parm
= NULL
;
5051 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5052 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5054 tree new_tree
= remap_decl (arg
, id
);
5055 if (TREE_CODE (new_tree
) != PARM_DECL
)
5056 new_tree
= id
->copy_decl (arg
, id
);
5057 lang_hooks
.dup_lang_specific_decl (new_tree
);
5059 parg
= &DECL_CHAIN (new_tree
);
5061 else if (!pointer_map_contains (id
->decl_map
, arg
))
5063 /* Make an equivalent VAR_DECL. If the argument was used
5064 as temporary variable later in function, the uses will be
5065 replaced by local variable. */
5066 tree var
= copy_decl_to_var (arg
, id
);
5067 insert_decl_map (id
, arg
, var
);
5068 /* Declare this new variable. */
5069 DECL_CHAIN (var
) = *vars
;
5075 /* Return a copy of the function's static chain. */
5077 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5079 tree
*chain_copy
, *pvar
;
5081 chain_copy
= &static_chain
;
5082 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5084 tree new_tree
= remap_decl (*pvar
, id
);
5085 lang_hooks
.dup_lang_specific_decl (new_tree
);
5086 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5089 return static_chain
;
5092 /* Return true if the function is allowed to be versioned.
5093 This is a guard for the versioning functionality. */
5096 tree_versionable_function_p (tree fndecl
)
5098 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5099 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
5102 /* Delete all unreachable basic blocks and update callgraph.
5103 Doing so is somewhat nontrivial because we need to update all clones and
5104 remove inline function that become unreachable. */
5107 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5109 bool changed
= false;
5110 basic_block b
, next_bb
;
5112 find_unreachable_blocks ();
5114 /* Delete all unreachable basic blocks. */
5116 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5117 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5119 next_bb
= b
->next_bb
;
5121 if (!(b
->flags
& BB_REACHABLE
))
5123 gimple_stmt_iterator bsi
;
5125 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5127 struct cgraph_edge
*e
;
5128 struct cgraph_node
*node
;
5130 ipa_remove_stmt_references (id
->dst_node
, gsi_stmt (bsi
));
5132 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5133 &&(e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
5135 if (!e
->inline_failed
)
5136 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5138 cgraph_remove_edge (e
);
5140 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5141 && id
->dst_node
->clones
)
5142 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5144 ipa_remove_stmt_references (node
, gsi_stmt (bsi
));
5145 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5146 && (e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
5148 if (!e
->inline_failed
)
5149 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5151 cgraph_remove_edge (e
);
5155 node
= node
->clones
;
5156 else if (node
->next_sibling_clone
)
5157 node
= node
->next_sibling_clone
;
5160 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5161 node
= node
->clone_of
;
5162 if (node
!= id
->dst_node
)
5163 node
= node
->next_sibling_clone
;
5167 delete_basic_block (b
);
5175 /* Update clone info after duplication. */
5178 update_clone_info (copy_body_data
* id
)
5180 struct cgraph_node
*node
;
5181 if (!id
->dst_node
->clones
)
5183 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5185 /* First update replace maps to match the new body. */
5186 if (node
->clone
.tree_map
)
5189 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5191 struct ipa_replace_map
*replace_info
;
5192 replace_info
= (*node
->clone
.tree_map
)[i
];
5193 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5194 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5198 node
= node
->clones
;
5199 else if (node
->next_sibling_clone
)
5200 node
= node
->next_sibling_clone
;
5203 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5204 node
= node
->clone_of
;
5205 if (node
!= id
->dst_node
)
5206 node
= node
->next_sibling_clone
;
5211 /* Create a copy of a function's tree.
5212 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5213 of the original function and the new copied function
5214 respectively. In case we want to replace a DECL
5215 tree with another tree while duplicating the function's
5216 body, TREE_MAP represents the mapping between these
5217 trees. If UPDATE_CLONES is set, the call_stmt fields
5218 of edges of clones of the function will be updated.
5220 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5222 If SKIP_RETURN is true, the new version will return void.
5223 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5224 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5227 tree_function_versioning (tree old_decl
, tree new_decl
,
5228 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
5229 bool update_clones
, bitmap args_to_skip
,
5230 bool skip_return
, bitmap blocks_to_copy
,
5231 basic_block new_entry
)
5233 struct cgraph_node
*old_version_node
;
5234 struct cgraph_node
*new_version_node
;
5238 struct ipa_replace_map
*replace_info
;
5239 basic_block old_entry_block
, bb
;
5240 stack_vec
<gimple
, 10> init_stmts
;
5241 tree vars
= NULL_TREE
;
5243 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5244 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5245 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5247 old_version_node
= cgraph_get_node (old_decl
);
5248 gcc_checking_assert (old_version_node
);
5249 new_version_node
= cgraph_get_node (new_decl
);
5250 gcc_checking_assert (new_version_node
);
5252 /* Copy over debug args. */
5253 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5255 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5256 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5257 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5258 old_debug_args
= decl_debug_args_lookup (old_decl
);
5261 new_debug_args
= decl_debug_args_insert (new_decl
);
5262 *new_debug_args
= vec_safe_copy (*old_debug_args
);
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 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5272 DECL_ARTIFICIAL (new_decl
) = 1;
5273 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5274 if (DECL_ORIGIN (old_decl
) == old_decl
)
5275 old_version_node
->used_as_abstract_origin
= true;
5276 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5278 /* Prepare the data structures for the tree copy. */
5279 memset (&id
, 0, sizeof (id
));
5281 /* Generate a new name for the new version. */
5282 id
.statements_to_fold
= pointer_set_create ();
5284 id
.decl_map
= pointer_map_create ();
5285 id
.debug_map
= NULL
;
5286 id
.src_fn
= old_decl
;
5287 id
.dst_fn
= new_decl
;
5288 id
.src_node
= old_version_node
;
5289 id
.dst_node
= new_version_node
;
5290 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5291 id
.blocks_to_copy
= blocks_to_copy
;
5292 if (id
.src_node
->ipa_transforms_to_apply
.exists ())
5294 vec
<ipa_opt_pass
> old_transforms_to_apply
5295 = id
.dst_node
->ipa_transforms_to_apply
;
5298 id
.dst_node
->ipa_transforms_to_apply
5299 = id
.src_node
->ipa_transforms_to_apply
.copy ();
5300 for (i
= 0; i
< old_transforms_to_apply
.length (); i
++)
5301 id
.dst_node
->ipa_transforms_to_apply
.safe_push (old_transforms_to_apply
[i
]);
5302 old_transforms_to_apply
.release ();
5305 id
.copy_decl
= copy_decl_no_change
;
5306 id
.transform_call_graph_edges
5307 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5308 id
.transform_new_cfg
= true;
5309 id
.transform_return_to_modify
= false;
5310 id
.transform_parameter
= false;
5311 id
.transform_lang_insert_block
= NULL
;
5313 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5314 (DECL_STRUCT_FUNCTION (old_decl
));
5315 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5316 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5317 initialize_cfun (new_decl
, old_decl
,
5318 old_entry_block
->count
);
5319 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5320 = id
.src_cfun
->gimple_df
->ipa_pta
;
5322 /* Copy the function's static chain. */
5323 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5325 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5326 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5329 /* If there's a tree_map, prepare for substitution. */
5331 for (i
= 0; i
< tree_map
->length (); i
++)
5334 replace_info
= (*tree_map
)[i
];
5335 if (replace_info
->replace_p
)
5337 if (!replace_info
->old_tree
)
5339 int i
= replace_info
->parm_num
;
5343 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5345 replace_info
->old_tree
= parm
;
5346 req_type
= TREE_TYPE (parm
);
5347 if (!useless_type_conversion_p (req_type
, TREE_TYPE (replace_info
->new_tree
)))
5349 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5350 replace_info
->new_tree
= fold_build1 (NOP_EXPR
, req_type
, replace_info
->new_tree
);
5351 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (TREE_TYPE (replace_info
->new_tree
)))
5352 replace_info
->new_tree
= fold_build1 (VIEW_CONVERT_EXPR
, req_type
, replace_info
->new_tree
);
5357 fprintf (dump_file
, " const ");
5358 print_generic_expr (dump_file
, replace_info
->new_tree
, 0);
5359 fprintf (dump_file
, " can't be converted to param ");
5360 print_generic_expr (dump_file
, parm
, 0);
5361 fprintf (dump_file
, "\n");
5363 replace_info
->old_tree
= NULL
;
5368 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5369 if (replace_info
->old_tree
)
5371 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5372 replace_info
->new_tree
, id
.src_fn
,
5376 init_stmts
.safe_push (init
);
5380 /* Copy the function's arguments. */
5381 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5382 DECL_ARGUMENTS (new_decl
) =
5383 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5384 args_to_skip
, &vars
);
5386 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5387 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5389 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5391 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5392 /* Add local vars. */
5393 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5395 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5397 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5399 DECL_RESULT (new_decl
)
5400 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5401 RESULT_DECL
, NULL_TREE
, void_type_node
);
5402 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5403 cfun
->returns_struct
= 0;
5404 cfun
->returns_pcc_struct
= 0;
5409 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5410 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5411 if (gimple_in_ssa_p (id
.src_cfun
)
5412 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5413 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5415 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5416 insert_decl_map (&id
, old_name
, new_name
);
5417 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5418 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5422 /* Set up the destination functions loop tree. */
5423 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5425 cfun
->curr_properties
&= ~PROP_loops
;
5426 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5427 cfun
->curr_properties
|= PROP_loops
;
5430 /* Copy the Function's body. */
5431 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5432 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
5435 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5436 number_blocks (new_decl
);
5438 /* We want to create the BB unconditionally, so that the addition of
5439 debug stmts doesn't affect BB count, which may in the end cause
5440 codegen differences. */
5441 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5442 while (init_stmts
.length ())
5443 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5444 update_clone_info (&id
);
5446 /* Remap the nonlocal_goto_save_area, if any. */
5447 if (cfun
->nonlocal_goto_save_area
)
5449 struct walk_stmt_info wi
;
5451 memset (&wi
, 0, sizeof (wi
));
5453 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5457 pointer_map_destroy (id
.decl_map
);
5459 pointer_map_destroy (id
.debug_map
);
5460 free_dominance_info (CDI_DOMINATORS
);
5461 free_dominance_info (CDI_POST_DOMINATORS
);
5463 fold_marked_statements (0, id
.statements_to_fold
);
5464 pointer_set_destroy (id
.statements_to_fold
);
5465 fold_cond_expr_cond ();
5466 delete_unreachable_blocks_update_callgraph (&id
);
5467 if (id
.dst_node
->definition
)
5468 cgraph_rebuild_references ();
5469 update_ssa (TODO_update_ssa
);
5471 /* After partial cloning we need to rescale frequencies, so they are
5472 within proper range in the cloned function. */
5475 struct cgraph_edge
*e
;
5476 rebuild_frequencies ();
5478 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5479 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5481 basic_block bb
= gimple_bb (e
->call_stmt
);
5482 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5484 e
->count
= bb
->count
;
5486 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5488 basic_block bb
= gimple_bb (e
->call_stmt
);
5489 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5491 e
->count
= bb
->count
;
5495 free_dominance_info (CDI_DOMINATORS
);
5496 free_dominance_info (CDI_POST_DOMINATORS
);
5498 gcc_assert (!id
.debug_stmts
.exists ());
5503 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5504 the callee and return the inlined body on success. */
5507 maybe_inline_call_in_expr (tree exp
)
5509 tree fn
= get_callee_fndecl (exp
);
5511 /* We can only try to inline "const" functions. */
5512 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5514 struct pointer_map_t
*decl_map
= pointer_map_create ();
5515 call_expr_arg_iterator iter
;
5519 /* Remap the parameters. */
5520 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5522 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5523 *pointer_map_insert (decl_map
, param
) = arg
;
5525 memset (&id
, 0, sizeof (id
));
5527 id
.dst_fn
= current_function_decl
;
5528 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5529 id
.decl_map
= decl_map
;
5531 id
.copy_decl
= copy_decl_no_change
;
5532 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5533 id
.transform_new_cfg
= false;
5534 id
.transform_return_to_modify
= true;
5535 id
.transform_parameter
= true;
5536 id
.transform_lang_insert_block
= NULL
;
5538 /* Make sure not to unshare trees behind the front-end's back
5539 since front-end specific mechanisms may rely on sharing. */
5540 id
.regimplify
= false;
5541 id
.do_not_unshare
= true;
5543 /* We're not inside any EH region. */
5546 t
= copy_tree_body (&id
);
5547 pointer_map_destroy (decl_map
);
5549 /* We can only return something suitable for use in a GENERIC
5551 if (TREE_CODE (t
) == MODIFY_EXPR
)
5552 return TREE_OPERAND (t
, 1);
5558 /* Duplicate a type, fields and all. */
5561 build_duplicate_type (tree type
)
5563 struct copy_body_data id
;
5565 memset (&id
, 0, sizeof (id
));
5566 id
.src_fn
= current_function_decl
;
5567 id
.dst_fn
= current_function_decl
;
5569 id
.decl_map
= pointer_map_create ();
5570 id
.debug_map
= NULL
;
5571 id
.copy_decl
= copy_decl_no_change
;
5573 type
= remap_type_1 (type
, &id
);
5575 pointer_map_destroy (id
.decl_map
);
5577 pointer_map_destroy (id
.debug_map
);
5579 TYPE_CANONICAL (type
) = type
;