2 Copyright (C) 2001-2014 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
->do_not_unshare
1277 ? id
->retvar
: unshare_expr (id
->retvar
),
1279 /* id->retvar is already substituted. Skip it on later remapping. */
1283 return gimple_build_nop ();
1285 else if (gimple_has_substatements (stmt
))
1289 /* When cloning bodies from the C++ front end, we will be handed bodies
1290 in High GIMPLE form. Handle here all the High GIMPLE statements that
1291 have embedded statements. */
1292 switch (gimple_code (stmt
))
1295 copy
= copy_gimple_bind (stmt
, id
);
1299 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1300 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1303 case GIMPLE_EH_FILTER
:
1304 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1305 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1309 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1310 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1311 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1314 case GIMPLE_WITH_CLEANUP_EXPR
:
1315 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1316 copy
= gimple_build_wce (s1
);
1319 case GIMPLE_OMP_PARALLEL
:
1320 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1321 copy
= gimple_build_omp_parallel
1323 gimple_omp_parallel_clauses (stmt
),
1324 gimple_omp_parallel_child_fn (stmt
),
1325 gimple_omp_parallel_data_arg (stmt
));
1328 case GIMPLE_OMP_TASK
:
1329 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1330 copy
= gimple_build_omp_task
1332 gimple_omp_task_clauses (stmt
),
1333 gimple_omp_task_child_fn (stmt
),
1334 gimple_omp_task_data_arg (stmt
),
1335 gimple_omp_task_copy_fn (stmt
),
1336 gimple_omp_task_arg_size (stmt
),
1337 gimple_omp_task_arg_align (stmt
));
1340 case GIMPLE_OMP_FOR
:
1341 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1342 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1343 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1344 gimple_omp_for_clauses (stmt
),
1345 gimple_omp_for_collapse (stmt
), s2
);
1348 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1350 gimple_omp_for_set_index (copy
, i
,
1351 gimple_omp_for_index (stmt
, i
));
1352 gimple_omp_for_set_initial (copy
, i
,
1353 gimple_omp_for_initial (stmt
, i
));
1354 gimple_omp_for_set_final (copy
, i
,
1355 gimple_omp_for_final (stmt
, i
));
1356 gimple_omp_for_set_incr (copy
, i
,
1357 gimple_omp_for_incr (stmt
, i
));
1358 gimple_omp_for_set_cond (copy
, i
,
1359 gimple_omp_for_cond (stmt
, i
));
1364 case GIMPLE_OMP_MASTER
:
1365 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1366 copy
= gimple_build_omp_master (s1
);
1369 case GIMPLE_OMP_TASKGROUP
:
1370 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1371 copy
= gimple_build_omp_taskgroup (s1
);
1374 case GIMPLE_OMP_ORDERED
:
1375 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1376 copy
= gimple_build_omp_ordered (s1
);
1379 case GIMPLE_OMP_SECTION
:
1380 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1381 copy
= gimple_build_omp_section (s1
);
1384 case GIMPLE_OMP_SECTIONS
:
1385 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1386 copy
= gimple_build_omp_sections
1387 (s1
, gimple_omp_sections_clauses (stmt
));
1390 case GIMPLE_OMP_SINGLE
:
1391 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1392 copy
= gimple_build_omp_single
1393 (s1
, gimple_omp_single_clauses (stmt
));
1396 case GIMPLE_OMP_TARGET
:
1397 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1398 copy
= gimple_build_omp_target
1399 (s1
, gimple_omp_target_kind (stmt
),
1400 gimple_omp_target_clauses (stmt
));
1403 case GIMPLE_OMP_TEAMS
:
1404 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1405 copy
= gimple_build_omp_teams
1406 (s1
, gimple_omp_teams_clauses (stmt
));
1409 case GIMPLE_OMP_CRITICAL
:
1410 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1412 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1415 case GIMPLE_TRANSACTION
:
1416 s1
= remap_gimple_seq (gimple_transaction_body (stmt
), id
);
1417 copy
= gimple_build_transaction (s1
, gimple_transaction_label (stmt
));
1418 gimple_transaction_set_subcode (copy
, gimple_transaction_subcode (stmt
));
1427 if (gimple_assign_copy_p (stmt
)
1428 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1429 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1431 /* Here we handle statements that are not completely rewritten.
1432 First we detect some inlining-induced bogosities for
1435 /* Some assignments VAR = VAR; don't generate any rtl code
1436 and thus don't count as variable modification. Avoid
1437 keeping bogosities like 0 = 0. */
1438 tree decl
= gimple_assign_lhs (stmt
), value
;
1441 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1445 STRIP_TYPE_NOPS (value
);
1446 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1447 return gimple_build_nop ();
1451 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1452 in a block that we aren't copying during tree_function_versioning,
1453 just drop the clobber stmt. */
1454 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1456 tree lhs
= gimple_assign_lhs (stmt
);
1457 if (TREE_CODE (lhs
) == MEM_REF
1458 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1460 gimple def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1461 if (gimple_bb (def_stmt
)
1462 && !bitmap_bit_p (id
->blocks_to_copy
,
1463 gimple_bb (def_stmt
)->index
))
1464 return gimple_build_nop ();
1468 if (gimple_debug_bind_p (stmt
))
1470 copy
= gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1471 gimple_debug_bind_get_value (stmt
),
1473 id
->debug_stmts
.safe_push (copy
);
1476 if (gimple_debug_source_bind_p (stmt
))
1478 copy
= gimple_build_debug_source_bind
1479 (gimple_debug_source_bind_get_var (stmt
),
1480 gimple_debug_source_bind_get_value (stmt
), stmt
);
1481 id
->debug_stmts
.safe_push (copy
);
1485 /* Create a new deep copy of the statement. */
1486 copy
= gimple_copy (stmt
);
1488 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1489 RESX and EH_DISPATCH. */
1491 switch (gimple_code (copy
))
1495 tree r
, fndecl
= gimple_call_fndecl (copy
);
1496 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1497 switch (DECL_FUNCTION_CODE (fndecl
))
1499 case BUILT_IN_EH_COPY_VALUES
:
1500 r
= gimple_call_arg (copy
, 1);
1501 r
= remap_eh_region_tree_nr (r
, id
);
1502 gimple_call_set_arg (copy
, 1, r
);
1505 case BUILT_IN_EH_POINTER
:
1506 case BUILT_IN_EH_FILTER
:
1507 r
= gimple_call_arg (copy
, 0);
1508 r
= remap_eh_region_tree_nr (r
, id
);
1509 gimple_call_set_arg (copy
, 0, r
);
1516 /* Reset alias info if we didn't apply measures to
1517 keep it valid over inlining by setting DECL_PT_UID. */
1518 if (!id
->src_cfun
->gimple_df
1519 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1520 gimple_call_reset_alias_info (copy
);
1526 int r
= gimple_resx_region (copy
);
1527 r
= remap_eh_region_nr (r
, id
);
1528 gimple_resx_set_region (copy
, r
);
1532 case GIMPLE_EH_DISPATCH
:
1534 int r
= gimple_eh_dispatch_region (copy
);
1535 r
= remap_eh_region_nr (r
, id
);
1536 gimple_eh_dispatch_set_region (copy
, r
);
1545 /* If STMT has a block defined, map it to the newly constructed
1547 if (gimple_block (copy
))
1550 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1552 gimple_set_block (copy
, *n
);
1555 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1558 /* Remap all the operands in COPY. */
1559 memset (&wi
, 0, sizeof (wi
));
1562 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1564 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1566 /* Clear the copied virtual operands. We are not remapping them here
1567 but are going to recreate them from scratch. */
1568 if (gimple_has_mem_ops (copy
))
1570 gimple_set_vdef (copy
, NULL_TREE
);
1571 gimple_set_vuse (copy
, NULL_TREE
);
1578 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1582 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1583 gcov_type count_scale
)
1585 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1586 basic_block copy_basic_block
;
1591 /* Search for previous copied basic block. */
1594 prev
= prev
->prev_bb
;
1596 /* create_basic_block() will append every new block to
1597 basic_block_info automatically. */
1598 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1599 (basic_block
) prev
->aux
);
1600 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1602 /* We are going to rebuild frequencies from scratch. These values
1603 have just small importance to drive canonicalize_loop_headers. */
1604 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1606 /* We recompute frequencies after inlining, so this is quite safe. */
1607 if (freq
> BB_FREQ_MAX
)
1609 copy_basic_block
->frequency
= freq
;
1611 copy_gsi
= gsi_start_bb (copy_basic_block
);
1613 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1615 gimple stmt
= gsi_stmt (gsi
);
1616 gimple orig_stmt
= stmt
;
1618 id
->regimplify
= false;
1619 stmt
= remap_gimple_stmt (stmt
, id
);
1620 if (gimple_nop_p (stmt
))
1623 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1626 /* With return slot optimization we can end up with
1627 non-gimple (foo *)&this->m, fix that here. */
1628 if (is_gimple_assign (stmt
)
1629 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1630 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1633 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1634 gimple_assign_rhs1 (stmt
),
1636 GSI_CONTINUE_LINKING
);
1637 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1638 id
->regimplify
= false;
1641 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1644 gimple_regimplify_operands (stmt
, &seq_gsi
);
1646 /* If copy_basic_block has been empty at the start of this iteration,
1647 call gsi_start_bb again to get at the newly added statements. */
1648 if (gsi_end_p (copy_gsi
))
1649 copy_gsi
= gsi_start_bb (copy_basic_block
);
1651 gsi_next (©_gsi
);
1653 /* Process the new statement. The call to gimple_regimplify_operands
1654 possibly turned the statement into multiple statements, we
1655 need to process all of them. */
1660 stmt
= gsi_stmt (copy_gsi
);
1661 if (is_gimple_call (stmt
)
1662 && gimple_call_va_arg_pack_p (stmt
)
1665 /* __builtin_va_arg_pack () should be replaced by
1666 all arguments corresponding to ... in the caller. */
1670 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1673 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1676 /* Create the new array of arguments. */
1677 n
= nargs
+ gimple_call_num_args (stmt
);
1678 argarray
.create (n
);
1679 argarray
.safe_grow_cleared (n
);
1681 /* Copy all the arguments before '...' */
1682 memcpy (argarray
.address (),
1683 gimple_call_arg_ptr (stmt
, 0),
1684 gimple_call_num_args (stmt
) * sizeof (tree
));
1686 /* Append the arguments passed in '...' */
1687 memcpy (argarray
.address () + gimple_call_num_args (stmt
),
1688 gimple_call_arg_ptr (id
->gimple_call
, 0)
1689 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1690 nargs
* sizeof (tree
));
1692 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1695 argarray
.release ();
1697 /* Copy all GIMPLE_CALL flags, location and block, except
1698 GF_CALL_VA_ARG_PACK. */
1699 gimple_call_copy_flags (new_call
, stmt
);
1700 gimple_call_set_va_arg_pack (new_call
, false);
1701 gimple_set_location (new_call
, gimple_location (stmt
));
1702 gimple_set_block (new_call
, gimple_block (stmt
));
1703 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1705 gsi_replace (©_gsi
, new_call
, false);
1708 else if (is_gimple_call (stmt
)
1710 && (decl
= gimple_call_fndecl (stmt
))
1711 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1712 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1714 /* __builtin_va_arg_pack_len () should be replaced by
1715 the number of anonymous arguments. */
1716 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1720 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1723 count
= build_int_cst (integer_type_node
, nargs
);
1724 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1725 gsi_replace (©_gsi
, new_stmt
, false);
1729 /* Statements produced by inlining can be unfolded, especially
1730 when we constant propagated some operands. We can't fold
1731 them right now for two reasons:
1732 1) folding require SSA_NAME_DEF_STMTs to be correct
1733 2) we can't change function calls to builtins.
1734 So we just mark statement for later folding. We mark
1735 all new statements, instead just statements that has changed
1736 by some nontrivial substitution so even statements made
1737 foldable indirectly are updated. If this turns out to be
1738 expensive, copy_body can be told to watch for nontrivial
1740 if (id
->statements_to_fold
)
1741 pointer_set_insert (id
->statements_to_fold
, stmt
);
1743 /* We're duplicating a CALL_EXPR. Find any corresponding
1744 callgraph edges and update or duplicate them. */
1745 if (is_gimple_call (stmt
))
1747 struct cgraph_edge
*edge
;
1749 switch (id
->transform_call_graph_edges
)
1751 case CB_CGE_DUPLICATE
:
1752 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1755 int edge_freq
= edge
->frequency
;
1757 struct cgraph_edge
*old_edge
= edge
;
1758 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1760 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1762 /* We could also just rescale the frequency, but
1763 doing so would introduce roundoff errors and make
1764 verifier unhappy. */
1765 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1768 /* Speculative calls consist of two edges - direct and indirect.
1769 Duplicate the whole thing and distribute frequencies accordingly. */
1770 if (edge
->speculative
)
1772 struct cgraph_edge
*direct
, *indirect
;
1773 struct ipa_ref
*ref
;
1775 gcc_assert (!edge
->indirect_unknown_callee
);
1776 cgraph_speculative_call_info (old_edge
, direct
, indirect
, ref
);
1777 indirect
= cgraph_clone_edge (indirect
, id
->dst_node
, stmt
,
1779 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1781 if (old_edge
->frequency
+ indirect
->frequency
)
1783 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
1784 (old_edge
->frequency
+ indirect
->frequency
)),
1786 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
1787 (old_edge
->frequency
+ indirect
->frequency
)),
1790 ipa_clone_ref (ref
, id
->dst_node
, stmt
);
1794 edge
->frequency
= new_freq
;
1796 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
1797 && (edge_freq
> edge
->frequency
+ 10
1798 || edge_freq
< edge
->frequency
- 10))
1800 fprintf (dump_file
, "Edge frequency estimated by "
1801 "cgraph %i diverge from inliner's estimate %i\n",
1805 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1808 copy_basic_block
->frequency
);
1814 case CB_CGE_MOVE_CLONES
:
1815 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1817 edge
= cgraph_edge (id
->dst_node
, stmt
);
1821 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1823 cgraph_set_call_stmt (edge
, stmt
);
1830 /* Constant propagation on argument done during inlining
1831 may create new direct call. Produce an edge for it. */
1833 || (edge
->indirect_inlining_edge
1834 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1835 && id
->dst_node
->definition
1836 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1838 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1840 /* We have missing edge in the callgraph. This can happen
1841 when previous inlining turned an indirect call into a
1842 direct call by constant propagating arguments or we are
1843 producing dead clone (for further cloning). In all
1844 other cases we hit a bug (incorrect node sharing is the
1845 most common reason for missing edges). */
1846 gcc_assert (!dest
->definition
1847 || dest
->address_taken
1848 || !id
->src_node
->definition
1849 || !id
->dst_node
->definition
);
1850 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1851 cgraph_create_edge_including_clones
1852 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1853 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1855 CIF_ORIGINALLY_INDIRECT_CALL
);
1857 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1859 compute_call_stmt_bb_frequency
1860 (id
->dst_node
->decl
,
1861 copy_basic_block
))->inline_failed
1862 = CIF_ORIGINALLY_INDIRECT_CALL
;
1865 fprintf (dump_file
, "Created new direct edge to %s\n",
1870 notice_special_calls (stmt
);
1873 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1874 id
->eh_map
, id
->eh_lp_nr
);
1876 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1881 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1882 if (TREE_CODE (def
) == SSA_NAME
)
1883 SSA_NAME_DEF_STMT (def
) = stmt
;
1886 gsi_next (©_gsi
);
1888 while (!gsi_end_p (copy_gsi
));
1890 copy_gsi
= gsi_last_bb (copy_basic_block
);
1893 return copy_basic_block
;
1896 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1897 form is quite easy, since dominator relationship for old basic blocks does
1900 There is however exception where inlining might change dominator relation
1901 across EH edges from basic block within inlined functions destinating
1902 to landing pads in function we inline into.
1904 The function fills in PHI_RESULTs of such PHI nodes if they refer
1905 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1906 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1907 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1908 set, and this means that there will be no overlapping live ranges
1909 for the underlying symbol.
1911 This might change in future if we allow redirecting of EH edges and
1912 we might want to change way build CFG pre-inlining to include
1913 all the possible edges then. */
1915 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1916 bool can_throw
, bool nonlocal_goto
)
1921 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1923 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1926 gimple_stmt_iterator si
;
1929 gcc_assert (e
->flags
& EDGE_EH
);
1932 gcc_assert (!(e
->flags
& EDGE_EH
));
1934 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1938 phi
= gsi_stmt (si
);
1940 /* For abnormal goto/call edges the receiver can be the
1941 ENTRY_BLOCK. Do not assert this cannot happen. */
1943 gcc_assert ((e
->flags
& EDGE_EH
)
1944 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1946 re
= find_edge (ret_bb
, e
->dest
);
1947 gcc_checking_assert (re
);
1948 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1949 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1951 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1952 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1958 /* Copy edges from BB into its copy constructed earlier, scale profile
1959 accordingly. Edges will be taken care of later. Assume aux
1960 pointers to point to the copies of each BB. Return true if any
1961 debug stmts are left after a statement that must end the basic block. */
1964 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
1965 basic_block abnormal_goto_dest
)
1967 basic_block new_bb
= (basic_block
) bb
->aux
;
1970 gimple_stmt_iterator si
;
1972 bool need_debug_cleanup
= false;
1974 /* Use the indices from the original blocks to create edges for the
1976 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1977 if (!(old_edge
->flags
& EDGE_EH
))
1981 flags
= old_edge
->flags
;
1983 /* Return edges do get a FALLTHRU flag when the get inlined. */
1984 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1985 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
1986 flags
|= EDGE_FALLTHRU
;
1987 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1988 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
1989 new_edge
->probability
= old_edge
->probability
;
1992 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1995 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
1998 bool can_throw
, nonlocal_goto
;
2000 copy_stmt
= gsi_stmt (si
);
2001 if (!is_gimple_debug (copy_stmt
))
2002 update_stmt (copy_stmt
);
2004 /* Do this before the possible split_block. */
2007 /* If this tree could throw an exception, there are two
2008 cases where we need to add abnormal edge(s): the
2009 tree wasn't in a region and there is a "current
2010 region" in the caller; or the original tree had
2011 EH edges. In both cases split the block after the tree,
2012 and add abnormal edge(s) as needed; we need both
2013 those from the callee and the caller.
2014 We check whether the copy can throw, because the const
2015 propagation can change an INDIRECT_REF which throws
2016 into a COMPONENT_REF which doesn't. If the copy
2017 can throw, the original could also throw. */
2018 can_throw
= stmt_can_throw_internal (copy_stmt
);
2020 = (stmt_can_make_abnormal_goto (copy_stmt
)
2021 && !computed_goto_p (copy_stmt
));
2023 if (can_throw
|| nonlocal_goto
)
2025 if (!gsi_end_p (si
))
2027 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2030 need_debug_cleanup
= true;
2032 if (!gsi_end_p (si
))
2033 /* Note that bb's predecessor edges aren't necessarily
2034 right at this point; split_block doesn't care. */
2036 edge e
= split_block (new_bb
, copy_stmt
);
2039 new_bb
->aux
= e
->src
->aux
;
2040 si
= gsi_start_bb (new_bb
);
2044 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2045 make_eh_dispatch_edges (copy_stmt
);
2047 make_eh_edges (copy_stmt
);
2049 /* If the call we inline cannot make abnormal goto do not add
2050 additional abnormal edges but only retain those already present
2051 in the original function body. */
2052 if (abnormal_goto_dest
== NULL
)
2053 nonlocal_goto
= false;
2056 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2058 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2059 nonlocal_goto
= false;
2060 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2061 in OpenMP regions which aren't allowed to be left abnormally.
2062 So, no need to add abnormal edge in that case. */
2063 else if (is_gimple_call (copy_stmt
)
2064 && gimple_call_internal_p (copy_stmt
)
2065 && (gimple_call_internal_fn (copy_stmt
)
2066 == IFN_ABNORMAL_DISPATCHER
)
2067 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2068 nonlocal_goto
= false;
2070 make_edge (copy_stmt_bb
, abnormal_goto_dest
, EDGE_ABNORMAL
);
2073 if ((can_throw
|| nonlocal_goto
)
2074 && gimple_in_ssa_p (cfun
))
2075 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2076 can_throw
, nonlocal_goto
);
2078 return need_debug_cleanup
;
2081 /* Copy the PHIs. All blocks and edges are copied, some blocks
2082 was possibly split and new outgoing EH edges inserted.
2083 BB points to the block of original function and AUX pointers links
2084 the original and newly copied blocks. */
2087 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2089 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2092 gimple_stmt_iterator si
;
2094 bool inserted
= false;
2096 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2101 phi
= gsi_stmt (si
);
2102 res
= PHI_RESULT (phi
);
2104 if (!virtual_operand_p (res
))
2106 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2107 new_phi
= create_phi_node (new_res
, new_bb
);
2108 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2110 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2116 /* When doing partial cloning, we allow PHIs on the entry block
2117 as long as all the arguments are the same. Find any input
2118 edge to see argument to copy. */
2120 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2121 if (!old_edge
->src
->aux
)
2124 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2126 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2127 gcc_assert (new_arg
);
2128 /* With return slot optimization we can end up with
2129 non-gimple (foo *)&this->m, fix that here. */
2130 if (TREE_CODE (new_arg
) != SSA_NAME
2131 && TREE_CODE (new_arg
) != FUNCTION_DECL
2132 && !is_gimple_val (new_arg
))
2134 gimple_seq stmts
= NULL
;
2135 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2136 gsi_insert_seq_on_edge (new_edge
, stmts
);
2139 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2140 if (LOCATION_BLOCK (locus
))
2143 n
= (tree
*) pointer_map_contains (id
->decl_map
,
2144 LOCATION_BLOCK (locus
));
2147 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2149 locus
= LOCATION_LOCUS (locus
);
2152 locus
= LOCATION_LOCUS (locus
);
2154 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2159 /* Commit the delayed edge insertions. */
2161 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2162 gsi_commit_one_edge_insert (new_edge
, NULL
);
2166 /* Wrapper for remap_decl so it can be used as a callback. */
2169 remap_decl_1 (tree decl
, void *data
)
2171 return remap_decl (decl
, (copy_body_data
*) data
);
2174 /* Build struct function and associated datastructures for the new clone
2175 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2176 the cfun to the function of new_fndecl (and current_function_decl too). */
2179 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2181 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2182 gcov_type count_scale
;
2184 if (!DECL_ARGUMENTS (new_fndecl
))
2185 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2186 if (!DECL_RESULT (new_fndecl
))
2187 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2189 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2191 = GCOV_COMPUTE_SCALE (count
,
2192 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2194 count_scale
= REG_BR_PROB_BASE
;
2196 /* Register specific tree functions. */
2197 gimple_register_cfg_hooks ();
2199 /* Get clean struct function. */
2200 push_struct_function (new_fndecl
);
2202 /* We will rebuild these, so just sanity check that they are empty. */
2203 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2204 gcc_assert (cfun
->local_decls
== NULL
);
2205 gcc_assert (cfun
->cfg
== NULL
);
2206 gcc_assert (cfun
->decl
== new_fndecl
);
2208 /* Copy items we preserve during cloning. */
2209 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2210 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2211 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2212 cfun
->curr_properties
= src_cfun
->curr_properties
;
2213 cfun
->last_verified
= src_cfun
->last_verified
;
2214 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2215 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2216 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2217 cfun
->stdarg
= src_cfun
->stdarg
;
2218 cfun
->after_inlining
= src_cfun
->after_inlining
;
2219 cfun
->can_throw_non_call_exceptions
2220 = src_cfun
->can_throw_non_call_exceptions
;
2221 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2222 cfun
->returns_struct
= src_cfun
->returns_struct
;
2223 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2225 init_empty_tree_cfg ();
2227 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2228 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2229 (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2231 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2232 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2233 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2234 (EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2236 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2237 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2239 init_eh_for_function ();
2241 if (src_cfun
->gimple_df
)
2243 init_tree_ssa (cfun
);
2244 cfun
->gimple_df
->in_ssa_p
= true;
2245 init_ssa_operands (cfun
);
2249 /* Helper function for copy_cfg_body. Move debug stmts from the end
2250 of NEW_BB to the beginning of successor basic blocks when needed. If the
2251 successor has multiple predecessors, reset them, otherwise keep
2255 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2259 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2262 || gsi_one_before_end_p (si
)
2263 || !(stmt_can_throw_internal (gsi_stmt (si
))
2264 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2267 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2269 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2270 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2271 while (is_gimple_debug (gsi_stmt (ssi
)))
2273 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2277 /* For the last edge move the debug stmts instead of copying
2279 if (ei_one_before_end_p (ei
))
2283 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2284 gimple_debug_bind_reset_value (stmt
);
2285 gsi_remove (&si
, false);
2286 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2290 if (gimple_debug_bind_p (stmt
))
2292 var
= gimple_debug_bind_get_var (stmt
);
2293 if (single_pred_p (e
->dest
))
2295 value
= gimple_debug_bind_get_value (stmt
);
2296 value
= unshare_expr (value
);
2300 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2302 else if (gimple_debug_source_bind_p (stmt
))
2304 var
= gimple_debug_source_bind_get_var (stmt
);
2305 value
= gimple_debug_source_bind_get_value (stmt
);
2306 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2310 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2311 id
->debug_stmts
.safe_push (new_stmt
);
2317 /* Make a copy of the sub-loops of SRC_PARENT and place them
2318 as siblings of DEST_PARENT. */
2321 copy_loops (copy_body_data
*id
,
2322 struct loop
*dest_parent
, struct loop
*src_parent
)
2324 struct loop
*src_loop
= src_parent
->inner
;
2327 if (!id
->blocks_to_copy
2328 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2330 struct loop
*dest_loop
= alloc_loop ();
2332 /* Assign the new loop its header and latch and associate
2333 those with the new loop. */
2334 if (src_loop
->header
!= NULL
)
2336 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2337 dest_loop
->header
->loop_father
= dest_loop
;
2339 if (src_loop
->latch
!= NULL
)
2341 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2342 dest_loop
->latch
->loop_father
= dest_loop
;
2345 /* Copy loop meta-data. */
2346 copy_loop_info (src_loop
, dest_loop
);
2348 /* Finally place it into the loop array and the loop tree. */
2349 place_new_loop (cfun
, dest_loop
);
2350 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2352 dest_loop
->safelen
= src_loop
->safelen
;
2353 dest_loop
->dont_vectorize
= src_loop
->dont_vectorize
;
2354 if (src_loop
->force_vectorize
)
2356 dest_loop
->force_vectorize
= true;
2357 cfun
->has_force_vectorize_loops
= true;
2359 if (src_loop
->simduid
)
2361 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2362 cfun
->has_simduid_loops
= true;
2366 copy_loops (id
, dest_loop
, src_loop
);
2368 src_loop
= src_loop
->next
;
2372 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2375 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2377 gimple_stmt_iterator si
;
2378 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2380 if (is_gimple_call (gsi_stmt (si
)))
2382 struct cgraph_edge
*edge
= cgraph_edge (id
->dst_node
, gsi_stmt (si
));
2384 cgraph_redirect_edge_call_stmt_to_callee (edge
);
2389 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2390 with each bb's frequency. Used when NODE has a 0-weight entry
2391 but we are about to inline it into a non-zero count call bb.
2392 See the comments for handle_missing_profiles() in predict.c for
2393 when this can happen for COMDATs. */
2396 freqs_to_counts (struct cgraph_node
*node
, gcov_type count
)
2401 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2403 FOR_ALL_BB_FN(bb
, fn
)
2405 bb
->count
= apply_scale (count
,
2406 GCOV_COMPUTE_SCALE (bb
->frequency
, BB_FREQ_MAX
));
2407 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2408 e
->count
= apply_probability (e
->src
->count
, e
->probability
);
2412 /* Make a copy of the body of FN so that it can be inserted inline in
2413 another function. Walks FN via CFG, returns new fndecl. */
2416 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2417 basic_block entry_block_map
, basic_block exit_block_map
,
2418 basic_block new_entry
)
2420 tree callee_fndecl
= id
->src_fn
;
2421 /* Original cfun for the callee, doesn't change. */
2422 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2423 struct function
*cfun_to_copy
;
2425 tree new_fndecl
= NULL
;
2426 bool need_debug_cleanup
= false;
2427 gcov_type count_scale
;
2429 int incoming_frequency
= 0;
2430 gcov_type incoming_count
= 0;
2432 /* This can happen for COMDAT routines that end up with 0 counts
2433 despite being called (see the comments for handle_missing_profiles()
2434 in predict.c as to why). Apply counts to the blocks in the callee
2435 before inlining, using the guessed edge frequencies, so that we don't
2436 end up with a 0-count inline body which can confuse downstream
2437 optimizations such as function splitting. */
2438 if (!ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
&& count
)
2440 /* Apply the larger of the call bb count and the total incoming
2441 call edge count to the callee. */
2442 gcov_type in_count
= 0;
2443 struct cgraph_edge
*in_edge
;
2444 for (in_edge
= id
->src_node
->callers
; in_edge
;
2445 in_edge
= in_edge
->next_caller
)
2446 in_count
+= in_edge
->count
;
2447 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2450 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2452 = GCOV_COMPUTE_SCALE (count
,
2453 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2455 count_scale
= REG_BR_PROB_BASE
;
2457 /* Register specific tree functions. */
2458 gimple_register_cfg_hooks ();
2460 /* If we are inlining just region of the function, make sure to connect
2461 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2462 part of loop, we must compute frequency and probability of
2463 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2464 probabilities of edges incoming from nonduplicated region. */
2470 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2473 incoming_frequency
+= EDGE_FREQUENCY (e
);
2474 incoming_count
+= e
->count
;
2476 incoming_count
= apply_scale (incoming_count
, count_scale
);
2478 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2479 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2480 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2483 /* Must have a CFG here at this point. */
2484 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2485 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2487 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2489 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2490 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2491 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2492 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2494 /* Duplicate any exception-handling regions. */
2496 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2499 /* Use aux pointers to map the original blocks to copy. */
2500 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2501 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2503 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2506 new_bb
->loop_father
= entry_block_map
->loop_father
;
2509 last
= last_basic_block_for_fn (cfun
);
2511 /* Now that we've duplicated the blocks, duplicate their edges. */
2512 basic_block abnormal_goto_dest
= NULL
;
2514 && stmt_can_make_abnormal_goto (id
->gimple_call
))
2516 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->gimple_call
);
2518 bb
= gimple_bb (id
->gimple_call
);
2520 if (gsi_end_p (gsi
))
2521 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2523 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2524 if (!id
->blocks_to_copy
2525 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2526 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2527 abnormal_goto_dest
);
2531 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2532 e
->probability
= REG_BR_PROB_BASE
;
2533 e
->count
= incoming_count
;
2536 /* Duplicate the loop tree, if available and wanted. */
2537 if (loops_for_fn (src_cfun
) != NULL
2538 && current_loops
!= NULL
)
2540 copy_loops (id
, entry_block_map
->loop_father
,
2541 get_loop (src_cfun
, 0));
2542 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2543 loops_state_set (LOOPS_NEED_FIXUP
);
2546 /* If the loop tree in the source function needed fixup, mark the
2547 destination loop tree for fixup, too. */
2548 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2549 loops_state_set (LOOPS_NEED_FIXUP
);
2551 if (gimple_in_ssa_p (cfun
))
2552 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2553 if (!id
->blocks_to_copy
2554 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2555 copy_phis_for_bb (bb
, id
);
2557 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2560 if (need_debug_cleanup
2561 && bb
->index
!= ENTRY_BLOCK
2562 && bb
->index
!= EXIT_BLOCK
)
2563 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2564 /* Update call edge destinations. This can not be done before loop
2565 info is updated, because we may split basic blocks. */
2566 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2567 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2568 ((basic_block
)bb
->aux
)->aux
= NULL
;
2572 /* Zero out AUX fields of newly created block during EH edge
2574 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2576 if (need_debug_cleanup
)
2577 maybe_move_debug_stmts_to_successors (id
,
2578 BASIC_BLOCK_FOR_FN (cfun
, last
));
2579 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2580 /* Update call edge destinations. This can not be done before loop
2581 info is updated, because we may split basic blocks. */
2582 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2583 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2585 entry_block_map
->aux
= NULL
;
2586 exit_block_map
->aux
= NULL
;
2590 pointer_map_destroy (id
->eh_map
);
2597 /* Copy the debug STMT using ID. We deal with these statements in a
2598 special way: if any variable in their VALUE expression wasn't
2599 remapped yet, we won't remap it, because that would get decl uids
2600 out of sync, causing codegen differences between -g and -g0. If
2601 this arises, we drop the VALUE expression altogether. */
2604 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2607 struct walk_stmt_info wi
;
2609 if (gimple_block (stmt
))
2611 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2612 gimple_set_block (stmt
, n
? *n
: id
->block
);
2615 /* Remap all the operands in COPY. */
2616 memset (&wi
, 0, sizeof (wi
));
2619 processing_debug_stmt
= 1;
2621 if (gimple_debug_source_bind_p (stmt
))
2622 t
= gimple_debug_source_bind_get_var (stmt
);
2624 t
= gimple_debug_bind_get_var (stmt
);
2626 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2627 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2629 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2632 else if (TREE_CODE (t
) == VAR_DECL
2633 && !is_global_var (t
)
2634 && !pointer_map_contains (id
->decl_map
, t
))
2635 /* T is a non-localized variable. */;
2637 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2639 if (gimple_debug_bind_p (stmt
))
2641 gimple_debug_bind_set_var (stmt
, t
);
2643 if (gimple_debug_bind_has_value_p (stmt
))
2644 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2645 remap_gimple_op_r
, &wi
, NULL
);
2647 /* Punt if any decl couldn't be remapped. */
2648 if (processing_debug_stmt
< 0)
2649 gimple_debug_bind_reset_value (stmt
);
2651 else if (gimple_debug_source_bind_p (stmt
))
2653 gimple_debug_source_bind_set_var (stmt
, t
);
2654 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2655 remap_gimple_op_r
, &wi
, NULL
);
2656 /* When inlining and source bind refers to one of the optimized
2657 away parameters, change the source bind into normal debug bind
2658 referring to the corresponding DEBUG_EXPR_DECL that should have
2659 been bound before the call stmt. */
2660 t
= gimple_debug_source_bind_get_value (stmt
);
2662 && TREE_CODE (t
) == PARM_DECL
2665 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2667 if (debug_args
!= NULL
)
2669 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2670 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2671 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2673 t
= (**debug_args
)[i
+ 1];
2674 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2675 gimple_debug_bind_set_value (stmt
, t
);
2682 processing_debug_stmt
= 0;
2687 /* Process deferred debug stmts. In order to give values better odds
2688 of being successfully remapped, we delay the processing of debug
2689 stmts until all other stmts that might require remapping are
2693 copy_debug_stmts (copy_body_data
*id
)
2698 if (!id
->debug_stmts
.exists ())
2701 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2702 copy_debug_stmt (stmt
, id
);
2704 id
->debug_stmts
.release ();
2707 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2708 another function. */
2711 copy_tree_body (copy_body_data
*id
)
2713 tree fndecl
= id
->src_fn
;
2714 tree body
= DECL_SAVED_TREE (fndecl
);
2716 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2721 /* Make a copy of the body of FN so that it can be inserted inline in
2722 another function. */
2725 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2726 basic_block entry_block_map
, basic_block exit_block_map
,
2727 basic_block new_entry
)
2729 tree fndecl
= id
->src_fn
;
2732 /* If this body has a CFG, walk CFG and copy. */
2733 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2734 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2736 copy_debug_stmts (id
);
2741 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2742 defined in function FN, or of a data member thereof. */
2745 self_inlining_addr_expr (tree value
, tree fn
)
2749 if (TREE_CODE (value
) != ADDR_EXPR
)
2752 var
= get_base_address (TREE_OPERAND (value
, 0));
2754 return var
&& auto_var_in_fn_p (var
, fn
);
2757 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2758 lexical block and line number information from base_stmt, if given,
2759 or from the last stmt of the block otherwise. */
2762 insert_init_debug_bind (copy_body_data
*id
,
2763 basic_block bb
, tree var
, tree value
,
2767 gimple_stmt_iterator gsi
;
2770 if (!gimple_in_ssa_p (id
->src_cfun
))
2773 if (!MAY_HAVE_DEBUG_STMTS
)
2776 tracked_var
= target_for_debug_bind (var
);
2782 gsi
= gsi_last_bb (bb
);
2783 if (!base_stmt
&& !gsi_end_p (gsi
))
2784 base_stmt
= gsi_stmt (gsi
);
2787 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2791 if (!gsi_end_p (gsi
))
2792 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2794 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2801 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2803 /* If VAR represents a zero-sized variable, it's possible that the
2804 assignment statement may result in no gimple statements. */
2807 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2809 /* We can end up with init statements that store to a non-register
2810 from a rhs with a conversion. Handle that here by forcing the
2811 rhs into a temporary. gimple_regimplify_operands is not
2812 prepared to do this for us. */
2813 if (!is_gimple_debug (init_stmt
)
2814 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2815 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2816 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2818 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2819 gimple_expr_type (init_stmt
),
2820 gimple_assign_rhs1 (init_stmt
));
2821 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2823 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2824 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2826 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2827 gimple_regimplify_operands (init_stmt
, &si
);
2829 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2831 tree def
= gimple_assign_lhs (init_stmt
);
2832 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2837 /* Initialize parameter P with VALUE. If needed, produce init statement
2838 at the end of BB. When BB is NULL, we return init statement to be
2841 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2842 basic_block bb
, tree
*vars
)
2844 gimple init_stmt
= NULL
;
2847 tree def
= (gimple_in_ssa_p (cfun
)
2848 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2851 && value
!= error_mark_node
2852 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2854 /* If we can match up types by promotion/demotion do so. */
2855 if (fold_convertible_p (TREE_TYPE (p
), value
))
2856 rhs
= fold_convert (TREE_TYPE (p
), value
);
2859 /* ??? For valid programs we should not end up here.
2860 Still if we end up with truly mismatched types here, fall back
2861 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2862 GIMPLE to the following passes. */
2863 if (!is_gimple_reg_type (TREE_TYPE (value
))
2864 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2865 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2867 rhs
= build_zero_cst (TREE_TYPE (p
));
2871 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2872 here since the type of this decl must be visible to the calling
2874 var
= copy_decl_to_var (p
, id
);
2876 /* Declare this new variable. */
2877 DECL_CHAIN (var
) = *vars
;
2880 /* Make gimplifier happy about this variable. */
2881 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2883 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2884 we would not need to create a new variable here at all, if it
2885 weren't for debug info. Still, we can just use the argument
2887 if (TREE_READONLY (p
)
2888 && !TREE_ADDRESSABLE (p
)
2889 && value
&& !TREE_SIDE_EFFECTS (value
)
2892 /* We may produce non-gimple trees by adding NOPs or introduce
2893 invalid sharing when operand is not really constant.
2894 It is not big deal to prohibit constant propagation here as
2895 we will constant propagate in DOM1 pass anyway. */
2896 if (is_gimple_min_invariant (value
)
2897 && useless_type_conversion_p (TREE_TYPE (p
),
2899 /* We have to be very careful about ADDR_EXPR. Make sure
2900 the base variable isn't a local variable of the inlined
2901 function, e.g., when doing recursive inlining, direct or
2902 mutually-recursive or whatever, which is why we don't
2903 just test whether fn == current_function_decl. */
2904 && ! self_inlining_addr_expr (value
, fn
))
2906 insert_decl_map (id
, p
, value
);
2907 insert_debug_decl_map (id
, p
, var
);
2908 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2912 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2913 that way, when the PARM_DECL is encountered, it will be
2914 automatically replaced by the VAR_DECL. */
2915 insert_decl_map (id
, p
, var
);
2917 /* Even if P was TREE_READONLY, the new VAR should not be.
2918 In the original code, we would have constructed a
2919 temporary, and then the function body would have never
2920 changed the value of P. However, now, we will be
2921 constructing VAR directly. The constructor body may
2922 change its value multiple times as it is being
2923 constructed. Therefore, it must not be TREE_READONLY;
2924 the back-end assumes that TREE_READONLY variable is
2925 assigned to only once. */
2926 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2927 TREE_READONLY (var
) = 0;
2929 /* If there is no setup required and we are in SSA, take the easy route
2930 replacing all SSA names representing the function parameter by the
2931 SSA name passed to function.
2933 We need to construct map for the variable anyway as it might be used
2934 in different SSA names when parameter is set in function.
2936 Do replacement at -O0 for const arguments replaced by constant.
2937 This is important for builtin_constant_p and other construct requiring
2938 constant argument to be visible in inlined function body. */
2939 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2941 || (TREE_READONLY (p
)
2942 && is_gimple_min_invariant (rhs
)))
2943 && (TREE_CODE (rhs
) == SSA_NAME
2944 || is_gimple_min_invariant (rhs
))
2945 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2947 insert_decl_map (id
, def
, rhs
);
2948 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2951 /* If the value of argument is never used, don't care about initializing
2953 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2955 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2956 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2959 /* Initialize this VAR_DECL from the equivalent argument. Convert
2960 the argument to the proper type in case it was promoted. */
2963 if (rhs
== error_mark_node
)
2965 insert_decl_map (id
, p
, var
);
2966 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2969 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2971 /* If we are in SSA form properly remap the default definition
2972 or assign to a dummy SSA name if the parameter is unused and
2973 we are not optimizing. */
2974 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2978 def
= remap_ssa_name (def
, id
);
2979 init_stmt
= gimple_build_assign (def
, rhs
);
2980 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2981 set_ssa_default_def (cfun
, var
, NULL
);
2985 def
= make_ssa_name (var
, NULL
);
2986 init_stmt
= gimple_build_assign (def
, rhs
);
2990 init_stmt
= gimple_build_assign (var
, rhs
);
2992 if (bb
&& init_stmt
)
2993 insert_init_stmt (id
, bb
, init_stmt
);
2998 /* Generate code to initialize the parameters of the function at the
2999 top of the stack in ID from the GIMPLE_CALL STMT. */
3002 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
3003 tree fn
, basic_block bb
)
3008 tree vars
= NULL_TREE
;
3009 tree static_chain
= gimple_call_chain (stmt
);
3011 /* Figure out what the parameters are. */
3012 parms
= DECL_ARGUMENTS (fn
);
3014 /* Loop through the parameter declarations, replacing each with an
3015 equivalent VAR_DECL, appropriately initialized. */
3016 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3019 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3020 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3022 /* After remapping parameters remap their types. This has to be done
3023 in a second loop over all parameters to appropriately remap
3024 variable sized arrays when the size is specified in a
3025 parameter following the array. */
3026 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3028 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
3030 && TREE_CODE (*varp
) == VAR_DECL
)
3032 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3033 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3035 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3036 /* Also remap the default definition if it was remapped
3037 to the default definition of the parameter replacement
3038 by the parameter setup. */
3041 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
3043 && TREE_CODE (*defp
) == SSA_NAME
3044 && SSA_NAME_VAR (*defp
) == var
)
3045 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3050 /* Initialize the static chain. */
3051 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3052 gcc_assert (fn
!= current_function_decl
);
3055 /* No static chain? Seems like a bug in tree-nested.c. */
3056 gcc_assert (static_chain
);
3058 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3061 declare_inline_vars (id
->block
, vars
);
3065 /* Declare a return variable to replace the RESULT_DECL for the
3066 function we are calling. An appropriate DECL_STMT is returned.
3067 The USE_STMT is filled to contain a use of the declaration to
3068 indicate the return value of the function.
3070 RETURN_SLOT, if non-null is place where to store the result. It
3071 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3072 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3074 The return value is a (possibly null) value that holds the result
3075 as seen by the caller. */
3078 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3079 basic_block entry_bb
)
3081 tree callee
= id
->src_fn
;
3082 tree result
= DECL_RESULT (callee
);
3083 tree callee_type
= TREE_TYPE (result
);
3087 /* Handle type-mismatches in the function declaration return type
3088 vs. the call expression. */
3090 caller_type
= TREE_TYPE (modify_dest
);
3092 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3094 /* We don't need to do anything for functions that don't return anything. */
3095 if (VOID_TYPE_P (callee_type
))
3098 /* If there was a return slot, then the return value is the
3099 dereferenced address of that object. */
3102 /* The front end shouldn't have used both return_slot and
3103 a modify expression. */
3104 gcc_assert (!modify_dest
);
3105 if (DECL_BY_REFERENCE (result
))
3107 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3108 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3110 /* We are going to construct *&return_slot and we can't do that
3111 for variables believed to be not addressable.
3113 FIXME: This check possibly can match, because values returned
3114 via return slot optimization are not believed to have address
3115 taken by alias analysis. */
3116 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3117 var
= return_slot_addr
;
3122 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3123 if (TREE_ADDRESSABLE (result
))
3124 mark_addressable (var
);
3126 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3127 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3128 && !DECL_GIMPLE_REG_P (result
)
3130 DECL_GIMPLE_REG_P (var
) = 0;
3135 /* All types requiring non-trivial constructors should have been handled. */
3136 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3138 /* Attempt to avoid creating a new temporary variable. */
3140 && TREE_CODE (modify_dest
) != SSA_NAME
)
3142 bool use_it
= false;
3144 /* We can't use MODIFY_DEST if there's type promotion involved. */
3145 if (!useless_type_conversion_p (callee_type
, caller_type
))
3148 /* ??? If we're assigning to a variable sized type, then we must
3149 reuse the destination variable, because we've no good way to
3150 create variable sized temporaries at this point. */
3151 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3154 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3155 reuse it as the result of the call directly. Don't do this if
3156 it would promote MODIFY_DEST to addressable. */
3157 else if (TREE_ADDRESSABLE (result
))
3161 tree base_m
= get_base_address (modify_dest
);
3163 /* If the base isn't a decl, then it's a pointer, and we don't
3164 know where that's going to go. */
3165 if (!DECL_P (base_m
))
3167 else if (is_global_var (base_m
))
3169 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3170 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3171 && !DECL_GIMPLE_REG_P (result
)
3172 && DECL_GIMPLE_REG_P (base_m
))
3174 else if (!TREE_ADDRESSABLE (base_m
))
3186 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3188 var
= copy_result_decl_to_var (result
, id
);
3189 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3191 /* Do not have the rest of GCC warn about this variable as it should
3192 not be visible to the user. */
3193 TREE_NO_WARNING (var
) = 1;
3195 declare_inline_vars (id
->block
, var
);
3197 /* Build the use expr. If the return type of the function was
3198 promoted, convert it back to the expected type. */
3200 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3202 /* If we can match up types by promotion/demotion do so. */
3203 if (fold_convertible_p (caller_type
, var
))
3204 use
= fold_convert (caller_type
, var
);
3207 /* ??? For valid programs we should not end up here.
3208 Still if we end up with truly mismatched types here, fall back
3209 to using a MEM_REF to not leak invalid GIMPLE to the following
3211 /* Prevent var from being written into SSA form. */
3212 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3213 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3214 DECL_GIMPLE_REG_P (var
) = false;
3215 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3216 TREE_ADDRESSABLE (var
) = true;
3217 use
= fold_build2 (MEM_REF
, caller_type
,
3218 build_fold_addr_expr (var
),
3219 build_int_cst (ptr_type_node
, 0));
3223 STRIP_USELESS_TYPE_CONVERSION (use
);
3225 if (DECL_BY_REFERENCE (result
))
3227 TREE_ADDRESSABLE (var
) = 1;
3228 var
= build_fold_addr_expr (var
);
3232 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3233 way, when the RESULT_DECL is encountered, it will be
3234 automatically replaced by the VAR_DECL.
3236 When returning by reference, ensure that RESULT_DECL remaps to
3238 if (DECL_BY_REFERENCE (result
)
3239 && !is_gimple_val (var
))
3241 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3242 insert_decl_map (id
, result
, temp
);
3243 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3244 it's default_def SSA_NAME. */
3245 if (gimple_in_ssa_p (id
->src_cfun
)
3246 && is_gimple_reg (result
))
3248 temp
= make_ssa_name (temp
, NULL
);
3249 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3251 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3254 insert_decl_map (id
, result
, var
);
3256 /* Remember this so we can ignore it in remap_decls. */
3262 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3263 to a local label. */
3266 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3269 tree fn
= (tree
) fnp
;
3271 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3280 /* Determine if the function can be copied. If so return NULL. If
3281 not return a string describng the reason for failure. */
3284 copy_forbidden (struct function
*fun
, tree fndecl
)
3286 const char *reason
= fun
->cannot_be_copied_reason
;
3290 /* Only examine the function once. */
3291 if (fun
->cannot_be_copied_set
)
3294 /* We cannot copy a function that receives a non-local goto
3295 because we cannot remap the destination label used in the
3296 function that is performing the non-local goto. */
3297 /* ??? Actually, this should be possible, if we work at it.
3298 No doubt there's just a handful of places that simply
3299 assume it doesn't happen and don't substitute properly. */
3300 if (fun
->has_nonlocal_label
)
3302 reason
= G_("function %q+F can never be copied "
3303 "because it receives a non-local goto");
3307 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3308 if (TREE_CODE (decl
) == VAR_DECL
3309 && TREE_STATIC (decl
)
3310 && !DECL_EXTERNAL (decl
)
3311 && DECL_INITIAL (decl
)
3312 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3313 has_label_address_in_static_1
,
3316 reason
= G_("function %q+F can never be copied because it saves "
3317 "address of local label in a static variable");
3322 fun
->cannot_be_copied_reason
= reason
;
3323 fun
->cannot_be_copied_set
= true;
3328 static const char *inline_forbidden_reason
;
3330 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3331 iff a function can not be inlined. Also sets the reason why. */
3334 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3335 struct walk_stmt_info
*wip
)
3337 tree fn
= (tree
) wip
->info
;
3339 gimple stmt
= gsi_stmt (*gsi
);
3341 switch (gimple_code (stmt
))
3344 /* Refuse to inline alloca call unless user explicitly forced so as
3345 this may change program's memory overhead drastically when the
3346 function using alloca is called in loop. In GCC present in
3347 SPEC2000 inlining into schedule_block cause it to require 2GB of
3348 RAM instead of 256MB. Don't do so for alloca calls emitted for
3349 VLA objects as those can't cause unbounded growth (they're always
3350 wrapped inside stack_save/stack_restore regions. */
3351 if (gimple_alloca_call_p (stmt
)
3352 && !gimple_call_alloca_for_var_p (stmt
)
3353 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3355 inline_forbidden_reason
3356 = G_("function %q+F can never be inlined because it uses "
3357 "alloca (override using the always_inline attribute)");
3358 *handled_ops_p
= true;
3362 t
= gimple_call_fndecl (stmt
);
3366 /* We cannot inline functions that call setjmp. */
3367 if (setjmp_call_p (t
))
3369 inline_forbidden_reason
3370 = G_("function %q+F can never be inlined because it uses setjmp");
3371 *handled_ops_p
= true;
3375 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3376 switch (DECL_FUNCTION_CODE (t
))
3378 /* We cannot inline functions that take a variable number of
3380 case BUILT_IN_VA_START
:
3381 case BUILT_IN_NEXT_ARG
:
3382 case BUILT_IN_VA_END
:
3383 inline_forbidden_reason
3384 = G_("function %q+F can never be inlined because it "
3385 "uses variable argument lists");
3386 *handled_ops_p
= true;
3389 case BUILT_IN_LONGJMP
:
3390 /* We can't inline functions that call __builtin_longjmp at
3391 all. The non-local goto machinery really requires the
3392 destination be in a different function. If we allow the
3393 function calling __builtin_longjmp to be inlined into the
3394 function calling __builtin_setjmp, Things will Go Awry. */
3395 inline_forbidden_reason
3396 = G_("function %q+F can never be inlined because "
3397 "it uses setjmp-longjmp exception handling");
3398 *handled_ops_p
= true;
3401 case BUILT_IN_NONLOCAL_GOTO
:
3403 inline_forbidden_reason
3404 = G_("function %q+F can never be inlined because "
3405 "it uses non-local goto");
3406 *handled_ops_p
= true;
3409 case BUILT_IN_RETURN
:
3410 case BUILT_IN_APPLY_ARGS
:
3411 /* If a __builtin_apply_args caller would be inlined,
3412 it would be saving arguments of the function it has
3413 been inlined into. Similarly __builtin_return would
3414 return from the function the inline has been inlined into. */
3415 inline_forbidden_reason
3416 = G_("function %q+F can never be inlined because "
3417 "it uses __builtin_return or __builtin_apply_args");
3418 *handled_ops_p
= true;
3427 t
= gimple_goto_dest (stmt
);
3429 /* We will not inline a function which uses computed goto. The
3430 addresses of its local labels, which may be tucked into
3431 global storage, are of course not constant across
3432 instantiations, which causes unexpected behavior. */
3433 if (TREE_CODE (t
) != LABEL_DECL
)
3435 inline_forbidden_reason
3436 = G_("function %q+F can never be inlined "
3437 "because it contains a computed goto");
3438 *handled_ops_p
= true;
3447 *handled_ops_p
= false;
3451 /* Return true if FNDECL is a function that cannot be inlined into
3455 inline_forbidden_p (tree fndecl
)
3457 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3458 struct walk_stmt_info wi
;
3459 struct pointer_set_t
*visited_nodes
;
3461 bool forbidden_p
= false;
3463 /* First check for shared reasons not to copy the code. */
3464 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3465 if (inline_forbidden_reason
!= NULL
)
3468 /* Next, walk the statements of the function looking for
3469 constraucts we can't handle, or are non-optimal for inlining. */
3470 visited_nodes
= pointer_set_create ();
3471 memset (&wi
, 0, sizeof (wi
));
3472 wi
.info
= (void *) fndecl
;
3473 wi
.pset
= visited_nodes
;
3475 FOR_EACH_BB_FN (bb
, fun
)
3478 gimple_seq seq
= bb_seq (bb
);
3479 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3480 forbidden_p
= (ret
!= NULL
);
3485 pointer_set_destroy (visited_nodes
);
3489 /* Return false if the function FNDECL cannot be inlined on account of its
3490 attributes, true otherwise. */
3492 function_attribute_inlinable_p (const_tree fndecl
)
3494 if (targetm
.attribute_table
)
3498 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3500 const_tree name
= TREE_PURPOSE (a
);
3503 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3504 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3505 return targetm
.function_attribute_inlinable_p (fndecl
);
3512 /* Returns nonzero if FN is a function that does not have any
3513 fundamental inline blocking properties. */
3516 tree_inlinable_function_p (tree fn
)
3518 bool inlinable
= true;
3522 /* If we've already decided this function shouldn't be inlined,
3523 there's no need to check again. */
3524 if (DECL_UNINLINABLE (fn
))
3527 /* We only warn for functions declared `inline' by the user. */
3528 do_warning
= (warn_inline
3529 && DECL_DECLARED_INLINE_P (fn
)
3530 && !DECL_NO_INLINE_WARNING_P (fn
)
3531 && !DECL_IN_SYSTEM_HEADER (fn
));
3533 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3536 && always_inline
== NULL
)
3539 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3540 "is suppressed using -fno-inline", fn
);
3544 else if (!function_attribute_inlinable_p (fn
))
3547 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3548 "uses attributes conflicting with inlining", fn
);
3552 else if (inline_forbidden_p (fn
))
3554 /* See if we should warn about uninlinable functions. Previously,
3555 some of these warnings would be issued while trying to expand
3556 the function inline, but that would cause multiple warnings
3557 about functions that would for example call alloca. But since
3558 this a property of the function, just one warning is enough.
3559 As a bonus we can now give more details about the reason why a
3560 function is not inlinable. */
3562 error (inline_forbidden_reason
, fn
);
3563 else if (do_warning
)
3564 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3569 /* Squirrel away the result so that we don't have to check again. */
3570 DECL_UNINLINABLE (fn
) = !inlinable
;
3575 /* Estimate the cost of a memory move. Use machine dependent
3576 word size and take possible memcpy call into account. */
3579 estimate_move_cost (tree type
)
3583 gcc_assert (!VOID_TYPE_P (type
));
3585 if (TREE_CODE (type
) == VECTOR_TYPE
)
3587 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3588 enum machine_mode simd
3589 = targetm
.vectorize
.preferred_simd_mode (inner
);
3590 int simd_mode_size
= GET_MODE_SIZE (simd
);
3591 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3595 size
= int_size_in_bytes (type
);
3597 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3598 /* Cost of a memcpy call, 3 arguments and the call. */
3601 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3604 /* Returns cost of operation CODE, according to WEIGHTS */
3607 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3608 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3612 /* These are "free" conversions, or their presumed cost
3613 is folded into other operations. */
3618 case VIEW_CONVERT_EXPR
:
3621 /* Assign cost of 1 to usual operations.
3622 ??? We may consider mapping RTL costs to this. */
3628 case POINTER_PLUS_EXPR
:
3631 case MULT_HIGHPART_EXPR
:
3634 case ADDR_SPACE_CONVERT_EXPR
:
3635 case FIXED_CONVERT_EXPR
:
3636 case FIX_TRUNC_EXPR
:
3648 case VEC_LSHIFT_EXPR
:
3649 case VEC_RSHIFT_EXPR
:
3656 case TRUTH_ANDIF_EXPR
:
3657 case TRUTH_ORIF_EXPR
:
3658 case TRUTH_AND_EXPR
:
3660 case TRUTH_XOR_EXPR
:
3661 case TRUTH_NOT_EXPR
:
3670 case UNORDERED_EXPR
:
3681 case PREDECREMENT_EXPR
:
3682 case PREINCREMENT_EXPR
:
3683 case POSTDECREMENT_EXPR
:
3684 case POSTINCREMENT_EXPR
:
3686 case REALIGN_LOAD_EXPR
:
3688 case REDUC_MAX_EXPR
:
3689 case REDUC_MIN_EXPR
:
3690 case REDUC_PLUS_EXPR
:
3691 case WIDEN_SUM_EXPR
:
3692 case WIDEN_MULT_EXPR
:
3694 case WIDEN_MULT_PLUS_EXPR
:
3695 case WIDEN_MULT_MINUS_EXPR
:
3696 case WIDEN_LSHIFT_EXPR
:
3698 case VEC_WIDEN_MULT_HI_EXPR
:
3699 case VEC_WIDEN_MULT_LO_EXPR
:
3700 case VEC_WIDEN_MULT_EVEN_EXPR
:
3701 case VEC_WIDEN_MULT_ODD_EXPR
:
3702 case VEC_UNPACK_HI_EXPR
:
3703 case VEC_UNPACK_LO_EXPR
:
3704 case VEC_UNPACK_FLOAT_HI_EXPR
:
3705 case VEC_UNPACK_FLOAT_LO_EXPR
:
3706 case VEC_PACK_TRUNC_EXPR
:
3707 case VEC_PACK_SAT_EXPR
:
3708 case VEC_PACK_FIX_TRUNC_EXPR
:
3709 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3710 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3714 /* Few special cases of expensive operations. This is useful
3715 to avoid inlining on functions having too many of these. */
3716 case TRUNC_DIV_EXPR
:
3718 case FLOOR_DIV_EXPR
:
3719 case ROUND_DIV_EXPR
:
3720 case EXACT_DIV_EXPR
:
3721 case TRUNC_MOD_EXPR
:
3723 case FLOOR_MOD_EXPR
:
3724 case ROUND_MOD_EXPR
:
3726 if (TREE_CODE (op2
) != INTEGER_CST
)
3727 return weights
->div_mod_cost
;
3731 /* We expect a copy assignment with no operator. */
3732 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3738 /* Estimate number of instructions that will be created by expanding
3739 the statements in the statement sequence STMTS.
3740 WEIGHTS contains weights attributed to various constructs. */
3743 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3746 gimple_stmt_iterator gsi
;
3749 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3750 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3756 /* Estimate number of instructions that will be created by expanding STMT.
3757 WEIGHTS contains weights attributed to various constructs. */
3760 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3763 enum gimple_code code
= gimple_code (stmt
);
3770 /* Try to estimate the cost of assignments. We have three cases to
3772 1) Simple assignments to registers;
3773 2) Stores to things that must live in memory. This includes
3774 "normal" stores to scalars, but also assignments of large
3775 structures, or constructors of big arrays;
3777 Let us look at the first two cases, assuming we have "a = b + C":
3778 <GIMPLE_ASSIGN <var_decl "a">
3779 <plus_expr <var_decl "b"> <constant C>>
3780 If "a" is a GIMPLE register, the assignment to it is free on almost
3781 any target, because "a" usually ends up in a real register. Hence
3782 the only cost of this expression comes from the PLUS_EXPR, and we
3783 can ignore the GIMPLE_ASSIGN.
3784 If "a" is not a GIMPLE register, the assignment to "a" will most
3785 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3786 of moving something into "a", which we compute using the function
3787 estimate_move_cost. */
3788 if (gimple_clobber_p (stmt
))
3789 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3791 lhs
= gimple_assign_lhs (stmt
);
3792 rhs
= gimple_assign_rhs1 (stmt
);
3796 /* Account for the cost of moving to / from memory. */
3797 if (gimple_store_p (stmt
))
3798 cost
+= estimate_move_cost (TREE_TYPE (lhs
));
3799 if (gimple_assign_load_p (stmt
))
3800 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3802 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3803 gimple_assign_rhs1 (stmt
),
3804 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3805 == GIMPLE_BINARY_RHS
3806 ? gimple_assign_rhs2 (stmt
) : NULL
);
3810 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3811 gimple_op (stmt
, 0),
3812 gimple_op (stmt
, 1));
3816 /* Take into account cost of the switch + guess 2 conditional jumps for
3819 TODO: once the switch expansion logic is sufficiently separated, we can
3820 do better job on estimating cost of the switch. */
3821 if (weights
->time_based
)
3822 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3824 cost
= gimple_switch_num_labels (stmt
) * 2;
3831 if (gimple_call_internal_p (stmt
))
3833 else if ((decl
= gimple_call_fndecl (stmt
))
3834 && DECL_BUILT_IN (decl
))
3836 /* Do not special case builtins where we see the body.
3837 This just confuse inliner. */
3838 struct cgraph_node
*node
;
3839 if (!(node
= cgraph_get_node (decl
))
3840 || node
->definition
)
3842 /* For buitins that are likely expanded to nothing or
3843 inlined do not account operand costs. */
3844 else if (is_simple_builtin (decl
))
3846 else if (is_inexpensive_builtin (decl
))
3847 return weights
->target_builtin_call_cost
;
3848 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3850 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3851 specialize the cheap expansion we do here.
3852 ??? This asks for a more general solution. */
3853 switch (DECL_FUNCTION_CODE (decl
))
3858 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3859 && REAL_VALUES_EQUAL
3860 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3861 return estimate_operator_cost
3862 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
3863 gimple_call_arg (stmt
, 0));
3872 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
3873 if (gimple_call_lhs (stmt
))
3874 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3875 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3877 tree arg
= gimple_call_arg (stmt
, i
);
3878 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3884 return weights
->return_cost
;
3890 case GIMPLE_PREDICT
:
3896 int count
= asm_str_count (gimple_asm_string (stmt
));
3897 /* 1000 means infinity. This avoids overflows later
3898 with very long asm statements. */
3905 /* This is either going to be an external function call with one
3906 argument, or two register copy statements plus a goto. */
3909 case GIMPLE_EH_DISPATCH
:
3910 /* ??? This is going to turn into a switch statement. Ideally
3911 we'd have a look at the eh region and estimate the number of
3916 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3918 case GIMPLE_EH_FILTER
:
3919 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3922 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3925 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3926 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3928 /* OpenMP directives are generally very expensive. */
3930 case GIMPLE_OMP_RETURN
:
3931 case GIMPLE_OMP_SECTIONS_SWITCH
:
3932 case GIMPLE_OMP_ATOMIC_STORE
:
3933 case GIMPLE_OMP_CONTINUE
:
3934 /* ...except these, which are cheap. */
3937 case GIMPLE_OMP_ATOMIC_LOAD
:
3938 return weights
->omp_cost
;
3940 case GIMPLE_OMP_FOR
:
3941 return (weights
->omp_cost
3942 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3943 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3945 case GIMPLE_OMP_PARALLEL
:
3946 case GIMPLE_OMP_TASK
:
3947 case GIMPLE_OMP_CRITICAL
:
3948 case GIMPLE_OMP_MASTER
:
3949 case GIMPLE_OMP_TASKGROUP
:
3950 case GIMPLE_OMP_ORDERED
:
3951 case GIMPLE_OMP_SECTION
:
3952 case GIMPLE_OMP_SECTIONS
:
3953 case GIMPLE_OMP_SINGLE
:
3954 case GIMPLE_OMP_TARGET
:
3955 case GIMPLE_OMP_TEAMS
:
3956 return (weights
->omp_cost
3957 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3959 case GIMPLE_TRANSACTION
:
3960 return (weights
->tm_cost
3961 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3971 /* Estimate number of instructions that will be created by expanding
3972 function FNDECL. WEIGHTS contains weights attributed to various
3976 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3978 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3979 gimple_stmt_iterator bsi
;
3983 gcc_assert (my_function
&& my_function
->cfg
);
3984 FOR_EACH_BB_FN (bb
, my_function
)
3986 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3987 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3994 /* Initializes weights used by estimate_num_insns. */
3997 init_inline_once (void)
3999 eni_size_weights
.call_cost
= 1;
4000 eni_size_weights
.indirect_call_cost
= 3;
4001 eni_size_weights
.target_builtin_call_cost
= 1;
4002 eni_size_weights
.div_mod_cost
= 1;
4003 eni_size_weights
.omp_cost
= 40;
4004 eni_size_weights
.tm_cost
= 10;
4005 eni_size_weights
.time_based
= false;
4006 eni_size_weights
.return_cost
= 1;
4008 /* Estimating time for call is difficult, since we have no idea what the
4009 called function does. In the current uses of eni_time_weights,
4010 underestimating the cost does less harm than overestimating it, so
4011 we choose a rather small value here. */
4012 eni_time_weights
.call_cost
= 10;
4013 eni_time_weights
.indirect_call_cost
= 15;
4014 eni_time_weights
.target_builtin_call_cost
= 1;
4015 eni_time_weights
.div_mod_cost
= 10;
4016 eni_time_weights
.omp_cost
= 40;
4017 eni_time_weights
.tm_cost
= 40;
4018 eni_time_weights
.time_based
= true;
4019 eni_time_weights
.return_cost
= 2;
4022 /* Estimate the number of instructions in a gimple_seq. */
4025 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
4027 gimple_stmt_iterator gsi
;
4029 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4030 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4036 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4039 prepend_lexical_block (tree current_block
, tree new_block
)
4041 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4042 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4043 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4046 /* Add local variables from CALLEE to CALLER. */
4049 add_local_variables (struct function
*callee
, struct function
*caller
,
4055 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4056 if (!can_be_nonlocal (var
, id
))
4058 tree new_var
= remap_decl (var
, id
);
4060 /* Remap debug-expressions. */
4061 if (TREE_CODE (new_var
) == VAR_DECL
4062 && DECL_HAS_DEBUG_EXPR_P (var
)
4065 tree tem
= DECL_DEBUG_EXPR (var
);
4066 bool old_regimplify
= id
->regimplify
;
4067 id
->remapping_type_depth
++;
4068 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4069 id
->remapping_type_depth
--;
4070 id
->regimplify
= old_regimplify
;
4071 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4072 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4074 add_local_decl (caller
, new_var
);
4078 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4081 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
4085 struct pointer_map_t
*st
, *dst
;
4088 location_t saved_location
;
4089 struct cgraph_edge
*cg_edge
;
4090 cgraph_inline_failed_t reason
;
4091 basic_block return_block
;
4093 gimple_stmt_iterator gsi
, stmt_gsi
;
4094 bool successfully_inlined
= FALSE
;
4095 bool purge_dead_abnormal_edges
;
4097 /* Set input_location here so we get the right instantiation context
4098 if we call instantiate_decl from inlinable_function_p. */
4099 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
4100 saved_location
= input_location
;
4101 input_location
= gimple_location (stmt
);
4103 /* From here on, we're only interested in CALL_EXPRs. */
4104 if (gimple_code (stmt
) != GIMPLE_CALL
)
4107 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
4108 gcc_checking_assert (cg_edge
);
4109 /* First, see if we can figure out what function is being called.
4110 If we cannot, then there is no hope of inlining the function. */
4111 if (cg_edge
->indirect_unknown_callee
)
4113 fn
= cg_edge
->callee
->decl
;
4114 gcc_checking_assert (fn
);
4116 /* If FN is a declaration of a function in a nested scope that was
4117 globally declared inline, we don't set its DECL_INITIAL.
4118 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4119 C++ front-end uses it for cdtors to refer to their internal
4120 declarations, that are not real functions. Fortunately those
4121 don't have trees to be saved, so we can tell by checking their
4123 if (!DECL_INITIAL (fn
)
4124 && DECL_ABSTRACT_ORIGIN (fn
)
4125 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4126 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4128 /* Don't try to inline functions that are not well-suited to inlining. */
4129 if (cg_edge
->inline_failed
)
4131 reason
= cg_edge
->inline_failed
;
4132 /* If this call was originally indirect, we do not want to emit any
4133 inlining related warnings or sorry messages because there are no
4134 guarantees regarding those. */
4135 if (cg_edge
->indirect_inlining_edge
)
4138 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4139 /* For extern inline functions that get redefined we always
4140 silently ignored always_inline flag. Better behaviour would
4141 be to be able to keep both bodies and use extern inline body
4142 for inlining, but we can't do that because frontends overwrite
4144 && !cg_edge
->callee
->local
.redefined_extern_inline
4145 /* During early inline pass, report only when optimization is
4147 && (cgraph_global_info_ready
4149 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4150 /* PR 20090218-1_0.c. Body can be provided by another module. */
4151 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4153 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4154 cgraph_inline_failed_string (reason
));
4155 error ("called from here");
4157 else if (warn_inline
4158 && DECL_DECLARED_INLINE_P (fn
)
4159 && !DECL_NO_INLINE_WARNING_P (fn
)
4160 && !DECL_IN_SYSTEM_HEADER (fn
)
4161 && reason
!= CIF_UNSPECIFIED
4162 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4163 /* Do not warn about not inlined recursive calls. */
4164 && !cgraph_edge_recursive_p (cg_edge
)
4165 /* Avoid warnings during early inline pass. */
4166 && cgraph_global_info_ready
)
4168 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4169 fn
, _(cgraph_inline_failed_string (reason
)));
4170 warning (OPT_Winline
, "called from here");
4174 fn
= cg_edge
->callee
->decl
;
4175 cgraph_get_body (cg_edge
->callee
);
4177 #ifdef ENABLE_CHECKING
4178 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4179 verify_cgraph_node (cg_edge
->callee
);
4182 /* We will be inlining this callee. */
4183 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4185 /* Update the callers EH personality. */
4186 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4187 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4188 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4190 /* Split the block holding the GIMPLE_CALL. */
4191 e
= split_block (bb
, stmt
);
4193 return_block
= e
->dest
;
4196 /* split_block splits after the statement; work around this by
4197 moving the call into the second block manually. Not pretty,
4198 but seems easier than doing the CFG manipulation by hand
4199 when the GIMPLE_CALL is in the last statement of BB. */
4200 stmt_gsi
= gsi_last_bb (bb
);
4201 gsi_remove (&stmt_gsi
, false);
4203 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4204 been the source of abnormal edges. In this case, schedule
4205 the removal of dead abnormal edges. */
4206 gsi
= gsi_start_bb (return_block
);
4207 if (gsi_end_p (gsi
))
4209 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4210 purge_dead_abnormal_edges
= true;
4214 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4215 purge_dead_abnormal_edges
= false;
4218 stmt_gsi
= gsi_start_bb (return_block
);
4220 /* Build a block containing code to initialize the arguments, the
4221 actual inline expansion of the body, and a label for the return
4222 statements within the function to jump to. The type of the
4223 statement expression is the return type of the function call.
4224 ??? If the call does not have an associated block then we will
4225 remap all callee blocks to NULL, effectively dropping most of
4226 its debug information. This should only happen for calls to
4227 artificial decls inserted by the compiler itself. We need to
4228 either link the inlined blocks into the caller block tree or
4229 not refer to them in any way to not break GC for locations. */
4230 if (gimple_block (stmt
))
4232 id
->block
= make_node (BLOCK
);
4233 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4234 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
4235 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4238 /* Local declarations will be replaced by their equivalents in this
4241 id
->decl_map
= pointer_map_create ();
4242 dst
= id
->debug_map
;
4243 id
->debug_map
= NULL
;
4245 /* Record the function we are about to inline. */
4247 id
->src_node
= cg_edge
->callee
;
4248 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4249 id
->gimple_call
= stmt
;
4251 gcc_assert (!id
->src_cfun
->after_inlining
);
4254 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4256 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4257 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4261 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4263 if (DECL_INITIAL (fn
))
4265 if (gimple_block (stmt
))
4269 prepend_lexical_block (id
->block
,
4270 remap_blocks (DECL_INITIAL (fn
), id
));
4271 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4272 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4274 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4275 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4276 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4277 under it. The parameters can be then evaluated in the debugger,
4278 but don't show in backtraces. */
4279 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4280 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4283 *var
= TREE_CHAIN (v
);
4284 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4285 BLOCK_VARS (id
->block
) = v
;
4288 var
= &TREE_CHAIN (*var
);
4291 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4294 /* Return statements in the function body will be replaced by jumps
4295 to the RET_LABEL. */
4296 gcc_assert (DECL_INITIAL (fn
));
4297 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4299 /* Find the LHS to which the result of this call is assigned. */
4301 if (gimple_call_lhs (stmt
))
4303 modify_dest
= gimple_call_lhs (stmt
);
4305 /* The function which we are inlining might not return a value,
4306 in which case we should issue a warning that the function
4307 does not return a value. In that case the optimizers will
4308 see that the variable to which the value is assigned was not
4309 initialized. We do not want to issue a warning about that
4310 uninitialized variable. */
4311 if (DECL_P (modify_dest
))
4312 TREE_NO_WARNING (modify_dest
) = 1;
4314 if (gimple_call_return_slot_opt_p (stmt
))
4316 return_slot
= modify_dest
;
4323 /* If we are inlining a call to the C++ operator new, we don't want
4324 to use type based alias analysis on the return value. Otherwise
4325 we may get confused if the compiler sees that the inlined new
4326 function returns a pointer which was just deleted. See bug
4328 if (DECL_IS_OPERATOR_NEW (fn
))
4334 /* Declare the return variable for the function. */
4335 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4337 /* Add local vars in this inlined callee to caller. */
4338 add_local_variables (id
->src_cfun
, cfun
, id
);
4340 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4342 fprintf (dump_file
, "Inlining ");
4343 print_generic_expr (dump_file
, id
->src_fn
, 0);
4344 fprintf (dump_file
, " to ");
4345 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4346 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4349 /* This is it. Duplicate the callee body. Assume callee is
4350 pre-gimplified. Note that we must not alter the caller
4351 function in any way before this point, as this CALL_EXPR may be
4352 a self-referential call; if we're calling ourselves, we need to
4353 duplicate our body before altering anything. */
4354 copy_body (id
, bb
->count
,
4355 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4356 bb
, return_block
, NULL
);
4358 /* Reset the escaped solution. */
4359 if (cfun
->gimple_df
)
4360 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4365 pointer_map_destroy (id
->debug_map
);
4366 id
->debug_map
= dst
;
4368 pointer_map_destroy (id
->decl_map
);
4371 /* Unlink the calls virtual operands before replacing it. */
4372 unlink_stmt_vdef (stmt
);
4373 if (gimple_vdef (stmt
)
4374 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4375 release_ssa_name (gimple_vdef (stmt
));
4377 /* If the inlined function returns a result that we care about,
4378 substitute the GIMPLE_CALL with an assignment of the return
4379 variable to the LHS of the call. That is, if STMT was
4380 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4381 if (use_retvar
&& gimple_call_lhs (stmt
))
4383 gimple old_stmt
= stmt
;
4384 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4385 gsi_replace (&stmt_gsi
, stmt
, false);
4386 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4390 /* Handle the case of inlining a function with no return
4391 statement, which causes the return value to become undefined. */
4392 if (gimple_call_lhs (stmt
)
4393 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4395 tree name
= gimple_call_lhs (stmt
);
4396 tree var
= SSA_NAME_VAR (name
);
4397 tree def
= ssa_default_def (cfun
, var
);
4401 /* If the variable is used undefined, make this name
4402 undefined via a move. */
4403 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4404 gsi_replace (&stmt_gsi
, stmt
, true);
4408 /* Otherwise make this variable undefined. */
4409 gsi_remove (&stmt_gsi
, true);
4410 set_ssa_default_def (cfun
, var
, name
);
4411 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4415 gsi_remove (&stmt_gsi
, true);
4418 if (purge_dead_abnormal_edges
)
4420 gimple_purge_dead_eh_edges (return_block
);
4421 gimple_purge_dead_abnormal_call_edges (return_block
);
4424 /* If the value of the new expression is ignored, that's OK. We
4425 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4426 the equivalent inlined version either. */
4427 if (is_gimple_assign (stmt
))
4429 gcc_assert (gimple_assign_single_p (stmt
)
4430 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4431 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4434 /* Output the inlining info for this abstract function, since it has been
4435 inlined. If we don't do this now, we can lose the information about the
4436 variables in the function when the blocks get blown away as soon as we
4437 remove the cgraph node. */
4438 if (gimple_block (stmt
))
4439 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4441 /* Update callgraph if needed. */
4442 cgraph_remove_node (cg_edge
->callee
);
4444 id
->block
= NULL_TREE
;
4445 successfully_inlined
= TRUE
;
4448 input_location
= saved_location
;
4449 return successfully_inlined
;
4452 /* Expand call statements reachable from STMT_P.
4453 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4454 in a MODIFY_EXPR. */
4457 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4459 gimple_stmt_iterator gsi
;
4461 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4463 gimple stmt
= gsi_stmt (gsi
);
4465 if (is_gimple_call (stmt
)
4466 && !gimple_call_internal_p (stmt
)
4467 && expand_call_inline (bb
, stmt
, id
))
4475 /* Walk all basic blocks created after FIRST and try to fold every statement
4476 in the STATEMENTS pointer set. */
4479 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4481 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4482 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4484 gimple_stmt_iterator gsi
;
4486 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4489 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4491 gimple old_stmt
= gsi_stmt (gsi
);
4492 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4494 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4496 /* Folding builtins can create multiple instructions,
4497 we need to look at all of them. */
4498 gimple_stmt_iterator i2
= gsi
;
4500 if (fold_stmt (&gsi
))
4503 /* If a builtin at the end of a bb folded into nothing,
4504 the following loop won't work. */
4505 if (gsi_end_p (gsi
))
4507 cgraph_update_edges_for_call_stmt (old_stmt
,
4512 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4517 new_stmt
= gsi_stmt (i2
);
4518 update_stmt (new_stmt
);
4519 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4522 if (new_stmt
== gsi_stmt (gsi
))
4524 /* It is okay to check only for the very last
4525 of these statements. If it is a throwing
4526 statement nothing will change. If it isn't
4527 this can remove EH edges. If that weren't
4528 correct then because some intermediate stmts
4529 throw, but not the last one. That would mean
4530 we'd have to split the block, which we can't
4531 here and we'd loose anyway. And as builtins
4532 probably never throw, this all
4534 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4536 gimple_purge_dead_eh_edges (
4537 BASIC_BLOCK_FOR_FN (cfun
, first
));
4544 else if (fold_stmt (&gsi
))
4546 /* Re-read the statement from GSI as fold_stmt() may
4548 gimple new_stmt
= gsi_stmt (gsi
);
4549 update_stmt (new_stmt
);
4551 if (is_gimple_call (old_stmt
)
4552 || is_gimple_call (new_stmt
))
4553 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4556 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4557 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
4564 /* Expand calls to inline functions in the body of FN. */
4567 optimize_inline_calls (tree fn
)
4571 int last
= n_basic_blocks_for_fn (cfun
);
4572 bool inlined_p
= false;
4575 memset (&id
, 0, sizeof (id
));
4577 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4578 gcc_assert (id
.dst_node
->definition
);
4580 /* Or any functions that aren't finished yet. */
4581 if (current_function_decl
)
4582 id
.dst_fn
= current_function_decl
;
4584 id
.copy_decl
= copy_decl_maybe_to_var
;
4585 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4586 id
.transform_new_cfg
= false;
4587 id
.transform_return_to_modify
= true;
4588 id
.transform_parameter
= true;
4589 id
.transform_lang_insert_block
= NULL
;
4590 id
.statements_to_fold
= pointer_set_create ();
4592 push_gimplify_context ();
4594 /* We make no attempts to keep dominance info up-to-date. */
4595 free_dominance_info (CDI_DOMINATORS
);
4596 free_dominance_info (CDI_POST_DOMINATORS
);
4598 /* Register specific gimple functions. */
4599 gimple_register_cfg_hooks ();
4601 /* Reach the trees by walking over the CFG, and note the
4602 enclosing basic-blocks in the call edges. */
4603 /* We walk the blocks going forward, because inlined function bodies
4604 will split id->current_basic_block, and the new blocks will
4605 follow it; we'll trudge through them, processing their CALL_EXPRs
4607 FOR_EACH_BB_FN (bb
, cfun
)
4608 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4610 pop_gimplify_context (NULL
);
4612 #ifdef ENABLE_CHECKING
4614 struct cgraph_edge
*e
;
4616 verify_cgraph_node (id
.dst_node
);
4618 /* Double check that we inlined everything we are supposed to inline. */
4619 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4620 gcc_assert (e
->inline_failed
);
4624 /* Fold queued statements. */
4625 fold_marked_statements (last
, id
.statements_to_fold
);
4626 pointer_set_destroy (id
.statements_to_fold
);
4628 gcc_assert (!id
.debug_stmts
.exists ());
4630 /* If we didn't inline into the function there is nothing to do. */
4634 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4637 delete_unreachable_blocks_update_callgraph (&id
);
4638 #ifdef ENABLE_CHECKING
4639 verify_cgraph_node (id
.dst_node
);
4642 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4643 not possible yet - the IPA passes might make various functions to not
4644 throw and they don't care to proactively update local EH info. This is
4645 done later in fixup_cfg pass that also execute the verification. */
4646 return (TODO_update_ssa
4648 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4649 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4650 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
4651 ? TODO_rebuild_frequencies
: 0));
4654 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4657 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4659 enum tree_code code
= TREE_CODE (*tp
);
4660 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4662 /* We make copies of most nodes. */
4663 if (IS_EXPR_CODE_CLASS (cl
)
4664 || code
== TREE_LIST
4666 || code
== TYPE_DECL
4667 || code
== OMP_CLAUSE
)
4669 /* Because the chain gets clobbered when we make a copy, we save it
4671 tree chain
= NULL_TREE
, new_tree
;
4673 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4674 chain
= TREE_CHAIN (*tp
);
4676 /* Copy the node. */
4677 new_tree
= copy_node (*tp
);
4681 /* Now, restore the chain, if appropriate. That will cause
4682 walk_tree to walk into the chain as well. */
4683 if (code
== PARM_DECL
4684 || code
== TREE_LIST
4685 || code
== OMP_CLAUSE
)
4686 TREE_CHAIN (*tp
) = chain
;
4688 /* For now, we don't update BLOCKs when we make copies. So, we
4689 have to nullify all BIND_EXPRs. */
4690 if (TREE_CODE (*tp
) == BIND_EXPR
)
4691 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4693 else if (code
== CONSTRUCTOR
)
4695 /* CONSTRUCTOR nodes need special handling because
4696 we need to duplicate the vector of elements. */
4699 new_tree
= copy_node (*tp
);
4700 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
4703 else if (code
== STATEMENT_LIST
)
4704 /* We used to just abort on STATEMENT_LIST, but we can run into them
4705 with statement-expressions (c++/40975). */
4706 copy_statement_list (tp
);
4707 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4709 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4711 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4716 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4717 information indicating to what new SAVE_EXPR this one should be mapped,
4718 use that one. Otherwise, create a new node and enter it in ST. FN is
4719 the function into which the copy will be placed. */
4722 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4724 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4728 /* See if we already encountered this SAVE_EXPR. */
4729 n
= (tree
*) pointer_map_contains (st
, *tp
);
4731 /* If we didn't already remap this SAVE_EXPR, do so now. */
4734 t
= copy_node (*tp
);
4736 /* Remember this SAVE_EXPR. */
4737 *pointer_map_insert (st
, *tp
) = t
;
4738 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4739 *pointer_map_insert (st
, t
) = t
;
4743 /* We've already walked into this SAVE_EXPR; don't do it again. */
4748 /* Replace this SAVE_EXPR with the copy. */
4752 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4753 label, copies the declaration and enters it in the splay_tree in DATA (which
4754 is really a 'copy_body_data *'. */
4757 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4758 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4759 struct walk_stmt_info
*wi
)
4761 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4762 gimple stmt
= gsi_stmt (*gsip
);
4764 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4766 tree decl
= gimple_label_label (stmt
);
4768 /* Copy the decl and remember the copy. */
4769 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4776 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4777 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4778 remaps all local declarations to appropriate replacements in gimple
4782 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4784 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4785 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4786 struct pointer_map_t
*st
= id
->decl_map
;
4790 /* Only a local declaration (variable or label). */
4791 if ((TREE_CODE (expr
) == VAR_DECL
4792 && !TREE_STATIC (expr
))
4793 || TREE_CODE (expr
) == LABEL_DECL
)
4795 /* Lookup the declaration. */
4796 n
= (tree
*) pointer_map_contains (st
, expr
);
4798 /* If it's there, remap it. */
4803 else if (TREE_CODE (expr
) == STATEMENT_LIST
4804 || TREE_CODE (expr
) == BIND_EXPR
4805 || TREE_CODE (expr
) == SAVE_EXPR
)
4807 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4809 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4810 It's OK for this to happen if it was part of a subtree that
4811 isn't immediately expanded, such as operand 2 of another
4813 if (!TREE_OPERAND (expr
, 1))
4815 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4816 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4820 /* Keep iterating. */
4825 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4826 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4827 remaps all local declarations to appropriate replacements in gimple
4831 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4832 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4833 struct walk_stmt_info
*wi
)
4835 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4836 gimple stmt
= gsi_stmt (*gsip
);
4838 if (gimple_code (stmt
) == GIMPLE_BIND
)
4840 tree block
= gimple_bind_block (stmt
);
4844 remap_block (&block
, id
);
4845 gimple_bind_set_block (stmt
, block
);
4848 /* This will remap a lot of the same decls again, but this should be
4850 if (gimple_bind_vars (stmt
))
4851 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
4855 /* Keep iterating. */
4860 /* Copies everything in SEQ and replaces variables and labels local to
4861 current_function_decl. */
4864 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4867 struct walk_stmt_info wi
;
4868 struct pointer_set_t
*visited
;
4871 /* There's nothing to do for NULL_TREE. */
4876 memset (&id
, 0, sizeof (id
));
4877 id
.src_fn
= current_function_decl
;
4878 id
.dst_fn
= current_function_decl
;
4879 id
.decl_map
= pointer_map_create ();
4880 id
.debug_map
= NULL
;
4882 id
.copy_decl
= copy_decl_no_change
;
4883 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4884 id
.transform_new_cfg
= false;
4885 id
.transform_return_to_modify
= false;
4886 id
.transform_parameter
= false;
4887 id
.transform_lang_insert_block
= NULL
;
4889 /* Walk the tree once to find local labels. */
4890 memset (&wi
, 0, sizeof (wi
));
4891 visited
= pointer_set_create ();
4894 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4895 pointer_set_destroy (visited
);
4897 copy
= gimple_seq_copy (seq
);
4899 /* Walk the copy, remapping decls. */
4900 memset (&wi
, 0, sizeof (wi
));
4902 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4905 pointer_map_destroy (id
.decl_map
);
4907 pointer_map_destroy (id
.debug_map
);
4913 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4916 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4925 debug_find_tree (tree top
, tree search
)
4927 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4931 /* Declare the variables created by the inliner. Add all the variables in
4932 VARS to BIND_EXPR. */
4935 declare_inline_vars (tree block
, tree vars
)
4938 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4940 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4941 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4942 add_local_decl (cfun
, t
);
4946 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4949 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4950 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4951 VAR_DECL translation. */
4954 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4956 /* Don't generate debug information for the copy if we wouldn't have
4957 generated it for the copy either. */
4958 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4959 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4961 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4962 declaration inspired this copy. */
4963 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4965 /* The new variable/label has no RTL, yet. */
4966 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4967 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4968 SET_DECL_RTL (copy
, 0);
4970 /* These args would always appear unused, if not for this. */
4971 TREE_USED (copy
) = 1;
4973 /* Set the context for the new declaration. */
4974 if (!DECL_CONTEXT (decl
))
4975 /* Globals stay global. */
4977 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4978 /* Things that weren't in the scope of the function we're inlining
4979 from aren't in the scope we're inlining to, either. */
4981 else if (TREE_STATIC (decl
))
4982 /* Function-scoped static variables should stay in the original
4986 /* Ordinary automatic local variables are now in the scope of the
4988 DECL_CONTEXT (copy
) = id
->dst_fn
;
4994 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4998 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4999 || TREE_CODE (decl
) == RESULT_DECL
);
5001 type
= TREE_TYPE (decl
);
5003 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5004 VAR_DECL
, DECL_NAME (decl
), type
);
5005 if (DECL_PT_UID_SET_P (decl
))
5006 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5007 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5008 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5009 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5010 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5012 return copy_decl_for_dup_finish (id
, decl
, copy
);
5015 /* Like copy_decl_to_var, but create a return slot object instead of a
5016 pointer variable for return by invisible reference. */
5019 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5023 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5024 || TREE_CODE (decl
) == RESULT_DECL
);
5026 type
= TREE_TYPE (decl
);
5027 if (DECL_BY_REFERENCE (decl
))
5028 type
= TREE_TYPE (type
);
5030 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5031 VAR_DECL
, DECL_NAME (decl
), type
);
5032 if (DECL_PT_UID_SET_P (decl
))
5033 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5034 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5035 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5036 if (!DECL_BY_REFERENCE (decl
))
5038 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5039 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5042 return copy_decl_for_dup_finish (id
, decl
, copy
);
5046 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5050 copy
= copy_node (decl
);
5052 /* The COPY is not abstract; it will be generated in DST_FN. */
5053 DECL_ABSTRACT (copy
) = 0;
5054 lang_hooks
.dup_lang_specific_decl (copy
);
5056 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5057 been taken; it's for internal bookkeeping in expand_goto_internal. */
5058 if (TREE_CODE (copy
) == LABEL_DECL
)
5060 TREE_ADDRESSABLE (copy
) = 0;
5061 LABEL_DECL_UID (copy
) = -1;
5064 return copy_decl_for_dup_finish (id
, decl
, copy
);
5068 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5070 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5071 return copy_decl_to_var (decl
, id
);
5073 return copy_decl_no_change (decl
, id
);
5076 /* Return a copy of the function's argument tree. */
5078 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5079 bitmap args_to_skip
, tree
*vars
)
5082 tree new_parm
= NULL
;
5087 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5088 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5090 tree new_tree
= remap_decl (arg
, id
);
5091 if (TREE_CODE (new_tree
) != PARM_DECL
)
5092 new_tree
= id
->copy_decl (arg
, id
);
5093 lang_hooks
.dup_lang_specific_decl (new_tree
);
5095 parg
= &DECL_CHAIN (new_tree
);
5097 else if (!pointer_map_contains (id
->decl_map
, arg
))
5099 /* Make an equivalent VAR_DECL. If the argument was used
5100 as temporary variable later in function, the uses will be
5101 replaced by local variable. */
5102 tree var
= copy_decl_to_var (arg
, id
);
5103 insert_decl_map (id
, arg
, var
);
5104 /* Declare this new variable. */
5105 DECL_CHAIN (var
) = *vars
;
5111 /* Return a copy of the function's static chain. */
5113 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5115 tree
*chain_copy
, *pvar
;
5117 chain_copy
= &static_chain
;
5118 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5120 tree new_tree
= remap_decl (*pvar
, id
);
5121 lang_hooks
.dup_lang_specific_decl (new_tree
);
5122 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5125 return static_chain
;
5128 /* Return true if the function is allowed to be versioned.
5129 This is a guard for the versioning functionality. */
5132 tree_versionable_function_p (tree fndecl
)
5134 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5135 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
5138 /* Delete all unreachable basic blocks and update callgraph.
5139 Doing so is somewhat nontrivial because we need to update all clones and
5140 remove inline function that become unreachable. */
5143 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5145 bool changed
= false;
5146 basic_block b
, next_bb
;
5148 find_unreachable_blocks ();
5150 /* Delete all unreachable basic blocks. */
5152 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5153 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5155 next_bb
= b
->next_bb
;
5157 if (!(b
->flags
& BB_REACHABLE
))
5159 gimple_stmt_iterator bsi
;
5161 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5163 struct cgraph_edge
*e
;
5164 struct cgraph_node
*node
;
5166 ipa_remove_stmt_references (id
->dst_node
, gsi_stmt (bsi
));
5168 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5169 &&(e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
5171 if (!e
->inline_failed
)
5172 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5174 cgraph_remove_edge (e
);
5176 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5177 && id
->dst_node
->clones
)
5178 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5180 ipa_remove_stmt_references (node
, gsi_stmt (bsi
));
5181 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5182 && (e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
5184 if (!e
->inline_failed
)
5185 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5187 cgraph_remove_edge (e
);
5191 node
= node
->clones
;
5192 else if (node
->next_sibling_clone
)
5193 node
= node
->next_sibling_clone
;
5196 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5197 node
= node
->clone_of
;
5198 if (node
!= id
->dst_node
)
5199 node
= node
->next_sibling_clone
;
5203 delete_basic_block (b
);
5211 /* Update clone info after duplication. */
5214 update_clone_info (copy_body_data
* id
)
5216 struct cgraph_node
*node
;
5217 if (!id
->dst_node
->clones
)
5219 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5221 /* First update replace maps to match the new body. */
5222 if (node
->clone
.tree_map
)
5225 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5227 struct ipa_replace_map
*replace_info
;
5228 replace_info
= (*node
->clone
.tree_map
)[i
];
5229 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5230 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5234 node
= node
->clones
;
5235 else if (node
->next_sibling_clone
)
5236 node
= node
->next_sibling_clone
;
5239 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5240 node
= node
->clone_of
;
5241 if (node
!= id
->dst_node
)
5242 node
= node
->next_sibling_clone
;
5247 /* Create a copy of a function's tree.
5248 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5249 of the original function and the new copied function
5250 respectively. In case we want to replace a DECL
5251 tree with another tree while duplicating the function's
5252 body, TREE_MAP represents the mapping between these
5253 trees. If UPDATE_CLONES is set, the call_stmt fields
5254 of edges of clones of the function will be updated.
5256 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5258 If SKIP_RETURN is true, the new version will return void.
5259 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5260 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5263 tree_function_versioning (tree old_decl
, tree new_decl
,
5264 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
5265 bool update_clones
, bitmap args_to_skip
,
5266 bool skip_return
, bitmap blocks_to_copy
,
5267 basic_block new_entry
)
5269 struct cgraph_node
*old_version_node
;
5270 struct cgraph_node
*new_version_node
;
5274 struct ipa_replace_map
*replace_info
;
5275 basic_block old_entry_block
, bb
;
5276 auto_vec
<gimple
, 10> init_stmts
;
5277 tree vars
= NULL_TREE
;
5279 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5280 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5281 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5283 old_version_node
= cgraph_get_node (old_decl
);
5284 gcc_checking_assert (old_version_node
);
5285 new_version_node
= cgraph_get_node (new_decl
);
5286 gcc_checking_assert (new_version_node
);
5288 /* Copy over debug args. */
5289 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5291 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5292 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5293 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5294 old_debug_args
= decl_debug_args_lookup (old_decl
);
5297 new_debug_args
= decl_debug_args_insert (new_decl
);
5298 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5302 /* Output the inlining info for this abstract function, since it has been
5303 inlined. If we don't do this now, we can lose the information about the
5304 variables in the function when the blocks get blown away as soon as we
5305 remove the cgraph node. */
5306 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5308 DECL_ARTIFICIAL (new_decl
) = 1;
5309 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5310 if (DECL_ORIGIN (old_decl
) == old_decl
)
5311 old_version_node
->used_as_abstract_origin
= true;
5312 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5314 /* Prepare the data structures for the tree copy. */
5315 memset (&id
, 0, sizeof (id
));
5317 /* Generate a new name for the new version. */
5318 id
.statements_to_fold
= pointer_set_create ();
5320 id
.decl_map
= pointer_map_create ();
5321 id
.debug_map
= NULL
;
5322 id
.src_fn
= old_decl
;
5323 id
.dst_fn
= new_decl
;
5324 id
.src_node
= old_version_node
;
5325 id
.dst_node
= new_version_node
;
5326 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5327 id
.blocks_to_copy
= blocks_to_copy
;
5329 id
.copy_decl
= copy_decl_no_change
;
5330 id
.transform_call_graph_edges
5331 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5332 id
.transform_new_cfg
= true;
5333 id
.transform_return_to_modify
= false;
5334 id
.transform_parameter
= false;
5335 id
.transform_lang_insert_block
= NULL
;
5337 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5338 (DECL_STRUCT_FUNCTION (old_decl
));
5339 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5340 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5341 initialize_cfun (new_decl
, old_decl
,
5342 old_entry_block
->count
);
5343 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5344 = id
.src_cfun
->gimple_df
->ipa_pta
;
5346 /* Copy the function's static chain. */
5347 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5349 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5350 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5353 /* If there's a tree_map, prepare for substitution. */
5355 for (i
= 0; i
< tree_map
->length (); i
++)
5358 replace_info
= (*tree_map
)[i
];
5359 if (replace_info
->replace_p
)
5361 if (!replace_info
->old_tree
)
5363 int i
= replace_info
->parm_num
;
5367 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5369 replace_info
->old_tree
= parm
;
5370 req_type
= TREE_TYPE (parm
);
5371 if (!useless_type_conversion_p (req_type
, TREE_TYPE (replace_info
->new_tree
)))
5373 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5374 replace_info
->new_tree
= fold_build1 (NOP_EXPR
, req_type
, replace_info
->new_tree
);
5375 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (TREE_TYPE (replace_info
->new_tree
)))
5376 replace_info
->new_tree
= fold_build1 (VIEW_CONVERT_EXPR
, req_type
, replace_info
->new_tree
);
5381 fprintf (dump_file
, " const ");
5382 print_generic_expr (dump_file
, replace_info
->new_tree
, 0);
5383 fprintf (dump_file
, " can't be converted to param ");
5384 print_generic_expr (dump_file
, parm
, 0);
5385 fprintf (dump_file
, "\n");
5387 replace_info
->old_tree
= NULL
;
5392 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5393 if (replace_info
->old_tree
)
5395 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5396 replace_info
->new_tree
, id
.src_fn
,
5400 init_stmts
.safe_push (init
);
5404 /* Copy the function's arguments. */
5405 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5406 DECL_ARGUMENTS (new_decl
) =
5407 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5408 args_to_skip
, &vars
);
5410 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5411 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5413 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5415 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5416 /* Add local vars. */
5417 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5419 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5421 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5423 DECL_RESULT (new_decl
)
5424 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5425 RESULT_DECL
, NULL_TREE
, void_type_node
);
5426 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5427 cfun
->returns_struct
= 0;
5428 cfun
->returns_pcc_struct
= 0;
5433 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5434 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5435 if (gimple_in_ssa_p (id
.src_cfun
)
5436 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5437 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5439 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5440 insert_decl_map (&id
, old_name
, new_name
);
5441 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5442 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5446 /* Set up the destination functions loop tree. */
5447 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5449 cfun
->curr_properties
&= ~PROP_loops
;
5450 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5451 cfun
->curr_properties
|= PROP_loops
;
5454 /* Copy the Function's body. */
5455 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5456 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
5459 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5460 number_blocks (new_decl
);
5462 /* We want to create the BB unconditionally, so that the addition of
5463 debug stmts doesn't affect BB count, which may in the end cause
5464 codegen differences. */
5465 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5466 while (init_stmts
.length ())
5467 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5468 update_clone_info (&id
);
5470 /* Remap the nonlocal_goto_save_area, if any. */
5471 if (cfun
->nonlocal_goto_save_area
)
5473 struct walk_stmt_info wi
;
5475 memset (&wi
, 0, sizeof (wi
));
5477 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5481 pointer_map_destroy (id
.decl_map
);
5483 pointer_map_destroy (id
.debug_map
);
5484 free_dominance_info (CDI_DOMINATORS
);
5485 free_dominance_info (CDI_POST_DOMINATORS
);
5487 fold_marked_statements (0, id
.statements_to_fold
);
5488 pointer_set_destroy (id
.statements_to_fold
);
5489 fold_cond_expr_cond ();
5490 delete_unreachable_blocks_update_callgraph (&id
);
5491 if (id
.dst_node
->definition
)
5492 cgraph_rebuild_references ();
5493 update_ssa (TODO_update_ssa
);
5495 /* After partial cloning we need to rescale frequencies, so they are
5496 within proper range in the cloned function. */
5499 struct cgraph_edge
*e
;
5500 rebuild_frequencies ();
5502 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5503 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5505 basic_block bb
= gimple_bb (e
->call_stmt
);
5506 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5508 e
->count
= bb
->count
;
5510 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5512 basic_block bb
= gimple_bb (e
->call_stmt
);
5513 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5515 e
->count
= bb
->count
;
5519 free_dominance_info (CDI_DOMINATORS
);
5520 free_dominance_info (CDI_POST_DOMINATORS
);
5522 gcc_assert (!id
.debug_stmts
.exists ());
5527 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5528 the callee and return the inlined body on success. */
5531 maybe_inline_call_in_expr (tree exp
)
5533 tree fn
= get_callee_fndecl (exp
);
5535 /* We can only try to inline "const" functions. */
5536 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5538 struct pointer_map_t
*decl_map
= pointer_map_create ();
5539 call_expr_arg_iterator iter
;
5543 /* Remap the parameters. */
5544 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5546 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5547 *pointer_map_insert (decl_map
, param
) = arg
;
5549 memset (&id
, 0, sizeof (id
));
5551 id
.dst_fn
= current_function_decl
;
5552 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5553 id
.decl_map
= decl_map
;
5555 id
.copy_decl
= copy_decl_no_change
;
5556 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5557 id
.transform_new_cfg
= false;
5558 id
.transform_return_to_modify
= true;
5559 id
.transform_parameter
= true;
5560 id
.transform_lang_insert_block
= NULL
;
5562 /* Make sure not to unshare trees behind the front-end's back
5563 since front-end specific mechanisms may rely on sharing. */
5564 id
.regimplify
= false;
5565 id
.do_not_unshare
= true;
5567 /* We're not inside any EH region. */
5570 t
= copy_tree_body (&id
);
5571 pointer_map_destroy (decl_map
);
5573 /* We can only return something suitable for use in a GENERIC
5575 if (TREE_CODE (t
) == MODIFY_EXPR
)
5576 return TREE_OPERAND (t
, 1);
5582 /* Duplicate a type, fields and all. */
5585 build_duplicate_type (tree type
)
5587 struct copy_body_data id
;
5589 memset (&id
, 0, sizeof (id
));
5590 id
.src_fn
= current_function_decl
;
5591 id
.dst_fn
= current_function_decl
;
5593 id
.decl_map
= pointer_map_create ();
5594 id
.debug_map
= NULL
;
5595 id
.copy_decl
= copy_decl_no_change
;
5597 type
= remap_type_1 (type
, &id
);
5599 pointer_map_destroy (id
.decl_map
);
5601 pointer_map_destroy (id
.debug_map
);
5603 TYPE_CANONICAL (type
) = type
;