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"
69 #include "langhooks.h"
73 #include "rtl.h" /* FIXME: For asm_str_count. */
75 /* I'm not real happy about this, but we need to handle gimple and
78 /* Inlining, Cloning, Versioning, Parallelization
80 Inlining: a function body is duplicated, but the PARM_DECLs are
81 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
82 MODIFY_EXPRs that store to a dedicated returned-value variable.
83 The duplicated eh_region info of the copy will later be appended
84 to the info for the caller; the eh_region info in copied throwing
85 statements and RESX statements are adjusted accordingly.
87 Cloning: (only in C++) We have one body for a con/de/structor, and
88 multiple function decls, each with a unique parameter list.
89 Duplicate the body, using the given splay tree; some parameters
90 will become constants (like 0 or 1).
92 Versioning: a function body is duplicated and the result is a new
93 function rather than into blocks of an existing function as with
94 inlining. Some parameters will become constants.
96 Parallelization: a region of a function is duplicated resulting in
97 a new function. Variables may be replaced with complex expressions
98 to enable shared variable semantics.
100 All of these will simultaneously lookup any callgraph edges. If
101 we're going to inline the duplicated function body, and the given
102 function has some cloned callgraph nodes (one for each place this
103 function will be inlined) those callgraph edges will be duplicated.
104 If we're cloning the body, those callgraph edges will be
105 updated to point into the new body. (Note that the original
106 callgraph node and edge list will not be altered.)
108 See the CALL_EXPR handling case in copy_tree_body_r (). */
112 o In order to make inlining-on-trees work, we pessimized
113 function-local static constants. In particular, they are now
114 always output, even when not addressed. Fix this by treating
115 function-local static constants just like global static
116 constants; the back-end already knows not to output them if they
119 o Provide heuristics to clamp inlining of recursive template
123 /* Weights that estimate_num_insns uses to estimate the size of the
126 eni_weights eni_size_weights
;
128 /* Weights that estimate_num_insns uses to estimate the time necessary
129 to execute the produced code. */
131 eni_weights eni_time_weights
;
135 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, basic_block
);
136 static void remap_block (tree
*, copy_body_data
*);
137 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
138 static void declare_inline_vars (tree
, tree
);
139 static void remap_save_expr (tree
*, void *, int *);
140 static void prepend_lexical_block (tree current_block
, tree new_block
);
141 static tree
copy_decl_to_var (tree
, copy_body_data
*);
142 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
143 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
144 static gimple
remap_gimple_stmt (gimple
, copy_body_data
*);
145 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
147 /* Insert a tree->tree mapping for ID. Despite the name suggests
148 that the trees should be variables, it is used for more than that. */
151 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
153 *pointer_map_insert (id
->decl_map
, key
) = value
;
155 /* Always insert an identity map as well. If we see this same new
156 node again, we won't want to duplicate it a second time. */
158 *pointer_map_insert (id
->decl_map
, value
) = value
;
161 /* Insert a tree->tree mapping for ID. This is only used for
165 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
167 if (!gimple_in_ssa_p (id
->src_cfun
))
170 if (!MAY_HAVE_DEBUG_STMTS
)
173 if (!target_for_debug_bind (key
))
176 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
177 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
180 id
->debug_map
= pointer_map_create ();
182 *pointer_map_insert (id
->debug_map
, key
) = value
;
185 /* If nonzero, we're remapping the contents of inlined debug
186 statements. If negative, an error has occurred, such as a
187 reference to a variable that isn't available in the inlined
189 static int processing_debug_stmt
= 0;
191 /* Construct new SSA name for old NAME. ID is the inline context. */
194 remap_ssa_name (tree name
, copy_body_data
*id
)
199 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
201 n
= (tree
*) pointer_map_contains (id
->decl_map
, name
);
203 return unshare_expr (*n
);
205 if (processing_debug_stmt
)
207 if (SSA_NAME_IS_DEFAULT_DEF (name
)
208 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
209 && id
->entry_bb
== NULL
210 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
212 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
214 gimple_stmt_iterator gsi
;
215 tree val
= SSA_NAME_VAR (name
);
217 n
= (tree
*) pointer_map_contains (id
->decl_map
, val
);
220 if (TREE_CODE (val
) != PARM_DECL
)
222 processing_debug_stmt
= -1;
225 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
226 DECL_ARTIFICIAL (vexpr
) = 1;
227 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
228 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
229 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
230 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
234 processing_debug_stmt
= -1;
238 /* Remap anonymous SSA names or SSA names of anonymous decls. */
239 var
= SSA_NAME_VAR (name
);
241 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
242 && TREE_CODE (var
) == VAR_DECL
243 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
244 && DECL_ARTIFICIAL (var
)
245 && DECL_IGNORED_P (var
)
246 && !DECL_NAME (var
)))
248 struct ptr_info_def
*pi
;
249 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
), NULL
);
250 if (!var
&& SSA_NAME_IDENTIFIER (name
))
251 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
252 insert_decl_map (id
, name
, new_tree
);
253 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
254 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
255 /* At least IPA points-to info can be directly transferred. */
256 if (id
->src_cfun
->gimple_df
257 && id
->src_cfun
->gimple_df
->ipa_pta
258 && (pi
= SSA_NAME_PTR_INFO (name
))
261 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
267 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
269 new_tree
= remap_decl (var
, id
);
271 /* We might've substituted constant or another SSA_NAME for
274 Replace the SSA name representing RESULT_DECL by variable during
275 inlining: this saves us from need to introduce PHI node in a case
276 return value is just partly initialized. */
277 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
278 && (!SSA_NAME_VAR (name
)
279 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
280 || !id
->transform_return_to_modify
))
282 struct ptr_info_def
*pi
;
283 new_tree
= make_ssa_name (new_tree
, NULL
);
284 insert_decl_map (id
, name
, new_tree
);
285 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
286 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
287 /* At least IPA points-to info can be directly transferred. */
288 if (id
->src_cfun
->gimple_df
289 && id
->src_cfun
->gimple_df
->ipa_pta
290 && (pi
= SSA_NAME_PTR_INFO (name
))
293 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
296 if (SSA_NAME_IS_DEFAULT_DEF (name
))
298 /* By inlining function having uninitialized variable, we might
299 extend the lifetime (variable might get reused). This cause
300 ICE in the case we end up extending lifetime of SSA name across
301 abnormal edge, but also increase register pressure.
303 We simply initialize all uninitialized vars by 0 except
304 for case we are inlining to very first BB. We can avoid
305 this for all BBs that are not inside strongly connected
306 regions of the CFG, but this is expensive to test. */
308 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
309 && (!SSA_NAME_VAR (name
)
310 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
311 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
313 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
315 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
317 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
319 init_stmt
= gimple_build_assign (new_tree
, zero
);
320 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
321 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
325 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
326 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
331 insert_decl_map (id
, name
, new_tree
);
335 /* Remap DECL during the copying of the BLOCK tree for the function. */
338 remap_decl (tree decl
, copy_body_data
*id
)
342 /* We only remap local variables in the current function. */
344 /* See if we have remapped this declaration. */
346 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
348 if (!n
&& processing_debug_stmt
)
350 processing_debug_stmt
= -1;
354 /* If we didn't already have an equivalent for this declaration,
358 /* Make a copy of the variable or label. */
359 tree t
= id
->copy_decl (decl
, id
);
361 /* Remember it, so that if we encounter this local entity again
362 we can reuse this copy. Do this early because remap_type may
363 need this decl for TYPE_STUB_DECL. */
364 insert_decl_map (id
, decl
, t
);
369 /* Remap types, if necessary. */
370 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
371 if (TREE_CODE (t
) == TYPE_DECL
)
372 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
374 /* Remap sizes as necessary. */
375 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
376 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
378 /* If fields, do likewise for offset and qualifier. */
379 if (TREE_CODE (t
) == FIELD_DECL
)
381 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
382 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
383 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
389 if (id
->do_not_unshare
)
392 return unshare_expr (*n
);
396 remap_type_1 (tree type
, copy_body_data
*id
)
400 /* We do need a copy. build and register it now. If this is a pointer or
401 reference type, remap the designated type and make a new pointer or
403 if (TREE_CODE (type
) == POINTER_TYPE
)
405 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
407 TYPE_REF_CAN_ALIAS_ALL (type
));
408 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
409 new_tree
= build_type_attribute_qual_variant (new_tree
,
410 TYPE_ATTRIBUTES (type
),
412 insert_decl_map (id
, type
, new_tree
);
415 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
417 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
419 TYPE_REF_CAN_ALIAS_ALL (type
));
420 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
421 new_tree
= build_type_attribute_qual_variant (new_tree
,
422 TYPE_ATTRIBUTES (type
),
424 insert_decl_map (id
, type
, new_tree
);
428 new_tree
= copy_node (type
);
430 insert_decl_map (id
, type
, new_tree
);
432 /* This is a new type, not a copy of an old type. Need to reassociate
433 variants. We can handle everything except the main variant lazily. */
434 t
= TYPE_MAIN_VARIANT (type
);
437 t
= remap_type (t
, id
);
438 TYPE_MAIN_VARIANT (new_tree
) = t
;
439 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
440 TYPE_NEXT_VARIANT (t
) = new_tree
;
444 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
445 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
448 if (TYPE_STUB_DECL (type
))
449 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
451 /* Lazily create pointer and reference types. */
452 TYPE_POINTER_TO (new_tree
) = NULL
;
453 TYPE_REFERENCE_TO (new_tree
) = NULL
;
455 switch (TREE_CODE (new_tree
))
459 case FIXED_POINT_TYPE
:
462 t
= TYPE_MIN_VALUE (new_tree
);
463 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
464 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
466 t
= TYPE_MAX_VALUE (new_tree
);
467 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
468 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
472 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
473 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
477 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
478 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
483 case QUAL_UNION_TYPE
:
487 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
489 t
= remap_decl (f
, id
);
490 DECL_CONTEXT (t
) = new_tree
;
494 TYPE_FIELDS (new_tree
) = nreverse (nf
);
500 /* Shouldn't have been thought variable sized. */
504 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
505 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
511 remap_type (tree type
, copy_body_data
*id
)
519 /* See if we have remapped this type. */
520 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
524 /* The type only needs remapping if it's variably modified. */
525 if (! variably_modified_type_p (type
, id
->src_fn
))
527 insert_decl_map (id
, type
, type
);
531 id
->remapping_type_depth
++;
532 tmp
= remap_type_1 (type
, id
);
533 id
->remapping_type_depth
--;
538 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
541 can_be_nonlocal (tree decl
, copy_body_data
*id
)
543 /* We can not duplicate function decls. */
544 if (TREE_CODE (decl
) == FUNCTION_DECL
)
547 /* Local static vars must be non-local or we get multiple declaration
549 if (TREE_CODE (decl
) == VAR_DECL
550 && !auto_var_in_fn_p (decl
, id
->src_fn
))
557 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
561 tree new_decls
= NULL_TREE
;
563 /* Remap its variables. */
564 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
568 if (can_be_nonlocal (old_var
, id
))
570 /* We need to add this variable to the local decls as otherwise
571 nothing else will do so. */
572 if (TREE_CODE (old_var
) == VAR_DECL
573 && ! DECL_EXTERNAL (old_var
))
574 add_local_decl (cfun
, old_var
);
575 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
576 && !DECL_IGNORED_P (old_var
)
577 && nonlocalized_list
)
578 vec_safe_push (*nonlocalized_list
, old_var
);
582 /* Remap the variable. */
583 new_var
= remap_decl (old_var
, id
);
585 /* If we didn't remap this variable, we can't mess with its
586 TREE_CHAIN. If we remapped this variable to the return slot, it's
587 already declared somewhere else, so don't declare it here. */
589 if (new_var
== id
->retvar
)
593 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
594 && !DECL_IGNORED_P (old_var
)
595 && nonlocalized_list
)
596 vec_safe_push (*nonlocalized_list
, old_var
);
600 gcc_assert (DECL_P (new_var
));
601 DECL_CHAIN (new_var
) = new_decls
;
604 /* Also copy value-expressions. */
605 if (TREE_CODE (new_var
) == VAR_DECL
606 && DECL_HAS_VALUE_EXPR_P (new_var
))
608 tree tem
= DECL_VALUE_EXPR (new_var
);
609 bool old_regimplify
= id
->regimplify
;
610 id
->remapping_type_depth
++;
611 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
612 id
->remapping_type_depth
--;
613 id
->regimplify
= old_regimplify
;
614 SET_DECL_VALUE_EXPR (new_var
, tem
);
619 return nreverse (new_decls
);
622 /* Copy the BLOCK to contain remapped versions of the variables
623 therein. And hook the new block into the block-tree. */
626 remap_block (tree
*block
, copy_body_data
*id
)
631 /* Make the new block. */
633 new_block
= make_node (BLOCK
);
634 TREE_USED (new_block
) = TREE_USED (old_block
);
635 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
636 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
637 BLOCK_NONLOCALIZED_VARS (new_block
)
638 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
641 /* Remap its variables. */
642 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
643 &BLOCK_NONLOCALIZED_VARS (new_block
),
646 if (id
->transform_lang_insert_block
)
647 id
->transform_lang_insert_block (new_block
);
649 /* Remember the remapped block. */
650 insert_decl_map (id
, old_block
, new_block
);
653 /* Copy the whole block tree and root it in id->block. */
655 remap_blocks (tree block
, copy_body_data
*id
)
658 tree new_tree
= block
;
663 remap_block (&new_tree
, id
);
664 gcc_assert (new_tree
!= block
);
665 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
666 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
667 /* Blocks are in arbitrary order, but make things slightly prettier and do
668 not swap order when producing a copy. */
669 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
673 /* Remap the block tree rooted at BLOCK to nothing. */
675 remap_blocks_to_null (tree block
, copy_body_data
*id
)
678 insert_decl_map (id
, block
, NULL_TREE
);
679 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
680 remap_blocks_to_null (t
, id
);
684 copy_statement_list (tree
*tp
)
686 tree_stmt_iterator oi
, ni
;
689 new_tree
= alloc_stmt_list ();
690 ni
= tsi_start (new_tree
);
691 oi
= tsi_start (*tp
);
692 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
695 for (; !tsi_end_p (oi
); tsi_next (&oi
))
697 tree stmt
= tsi_stmt (oi
);
698 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
699 /* This copy is not redundant; tsi_link_after will smash this
700 STATEMENT_LIST into the end of the one we're building, and we
701 don't want to do that with the original. */
702 copy_statement_list (&stmt
);
703 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
708 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
710 tree block
= BIND_EXPR_BLOCK (*tp
);
711 /* Copy (and replace) the statement. */
712 copy_tree_r (tp
, walk_subtrees
, NULL
);
715 remap_block (&block
, id
);
716 BIND_EXPR_BLOCK (*tp
) = block
;
719 if (BIND_EXPR_VARS (*tp
))
720 /* This will remap a lot of the same decls again, but this should be
722 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
726 /* Create a new gimple_seq by remapping all the statements in BODY
727 using the inlining information in ID. */
730 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
732 gimple_stmt_iterator si
;
733 gimple_seq new_body
= NULL
;
735 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
737 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
738 gimple_seq_add_stmt (&new_body
, new_stmt
);
745 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
746 block using the mapping information in ID. */
749 copy_gimple_bind (gimple stmt
, copy_body_data
*id
)
752 tree new_block
, new_vars
;
753 gimple_seq body
, new_body
;
755 /* Copy the statement. Note that we purposely don't use copy_stmt
756 here because we need to remap statements as we copy. */
757 body
= gimple_bind_body (stmt
);
758 new_body
= remap_gimple_seq (body
, id
);
760 new_block
= gimple_bind_block (stmt
);
762 remap_block (&new_block
, id
);
764 /* This will remap a lot of the same decls again, but this should be
766 new_vars
= gimple_bind_vars (stmt
);
768 new_vars
= remap_decls (new_vars
, NULL
, id
);
770 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
775 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
780 if (TREE_CODE (decl
) == SSA_NAME
)
782 decl
= SSA_NAME_VAR (decl
);
787 return (TREE_CODE (decl
) == PARM_DECL
);
790 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
791 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
792 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
793 recursing into the children nodes of *TP. */
796 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
798 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
799 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
800 tree fn
= id
->src_fn
;
802 if (TREE_CODE (*tp
) == SSA_NAME
)
804 *tp
= remap_ssa_name (*tp
, id
);
808 else if (auto_var_in_fn_p (*tp
, fn
))
810 /* Local variables and labels need to be replaced by equivalent
811 variables. We don't want to copy static variables; there's
812 only one of those, no matter how many times we inline the
813 containing function. Similarly for globals from an outer
817 /* Remap the declaration. */
818 new_decl
= remap_decl (*tp
, id
);
819 gcc_assert (new_decl
);
820 /* Replace this variable with the copy. */
821 STRIP_TYPE_NOPS (new_decl
);
822 /* ??? The C++ frontend uses void * pointer zero to initialize
823 any other type. This confuses the middle-end type verification.
824 As cloned bodies do not go through gimplification again the fixup
825 there doesn't trigger. */
826 if (TREE_CODE (new_decl
) == INTEGER_CST
827 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
828 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
832 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
834 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
836 else if (TREE_CODE (*tp
) == LABEL_DECL
837 && (!DECL_CONTEXT (*tp
)
838 || decl_function_context (*tp
) == id
->src_fn
))
839 /* These may need to be remapped for EH handling. */
840 *tp
= remap_decl (*tp
, id
);
841 else if (TREE_CODE (*tp
) == FIELD_DECL
)
843 /* If the enclosing record type is variably_modified_type_p, the field
844 has already been remapped. Otherwise, it need not be. */
845 tree
*n
= (tree
*) pointer_map_contains (id
->decl_map
, *tp
);
850 else if (TYPE_P (*tp
))
851 /* Types may need remapping as well. */
852 *tp
= remap_type (*tp
, id
);
853 else if (CONSTANT_CLASS_P (*tp
))
855 /* If this is a constant, we have to copy the node iff the type
856 will be remapped. copy_tree_r will not copy a constant. */
857 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
859 if (new_type
== TREE_TYPE (*tp
))
862 else if (TREE_CODE (*tp
) == INTEGER_CST
)
863 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
864 TREE_INT_CST_HIGH (*tp
));
867 *tp
= copy_node (*tp
);
868 TREE_TYPE (*tp
) = new_type
;
873 /* Otherwise, just copy the node. Note that copy_tree_r already
874 knows not to copy VAR_DECLs, etc., so this is safe. */
876 if (TREE_CODE (*tp
) == MEM_REF
)
878 /* We need to re-canonicalize MEM_REFs from inline substitutions
879 that can happen when a pointer argument is an ADDR_EXPR.
880 Recurse here manually to allow that. */
881 tree ptr
= TREE_OPERAND (*tp
, 0);
882 tree type
= remap_type (TREE_TYPE (*tp
), id
);
884 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
885 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
886 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
887 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
888 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
889 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
890 remapped a parameter as the property might be valid only
891 for the parameter itself. */
892 if (TREE_THIS_NOTRAP (old
)
893 && (!is_parm (TREE_OPERAND (old
, 0))
894 || (!id
->transform_parameter
&& is_parm (ptr
))))
895 TREE_THIS_NOTRAP (*tp
) = 1;
900 /* Here is the "usual case". Copy this tree node, and then
901 tweak some special cases. */
902 copy_tree_r (tp
, walk_subtrees
, NULL
);
904 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
905 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
907 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
909 /* The copied TARGET_EXPR has never been expanded, even if the
910 original node was expanded already. */
911 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
912 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
914 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
916 /* Variable substitution need not be simple. In particular,
917 the MEM_REF substitution above. Make sure that
918 TREE_CONSTANT and friends are up-to-date. */
919 int invariant
= is_gimple_min_invariant (*tp
);
920 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
921 recompute_tree_invariant_for_addr_expr (*tp
);
923 /* If this used to be invariant, but is not any longer,
924 then regimplification is probably needed. */
925 if (invariant
&& !is_gimple_min_invariant (*tp
))
926 id
->regimplify
= true;
932 /* Update the TREE_BLOCK for the cloned expr. */
935 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
936 tree old_block
= TREE_BLOCK (*tp
);
940 n
= (tree
*) pointer_map_contains (id
->decl_map
,
945 TREE_SET_BLOCK (*tp
, new_block
);
948 /* Keep iterating. */
953 /* Called from copy_body_id via walk_tree. DATA is really a
954 `copy_body_data *'. */
957 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
959 copy_body_data
*id
= (copy_body_data
*) data
;
960 tree fn
= id
->src_fn
;
963 /* Begin by recognizing trees that we'll completely rewrite for the
964 inlining context. Our output for these trees is completely
965 different from out input (e.g. RETURN_EXPR is deleted, and morphs
966 into an edge). Further down, we'll handle trees that get
967 duplicated and/or tweaked. */
969 /* When requested, RETURN_EXPRs should be transformed to just the
970 contained MODIFY_EXPR. The branch semantics of the return will
971 be handled elsewhere by manipulating the CFG rather than a statement. */
972 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
974 tree assignment
= TREE_OPERAND (*tp
, 0);
976 /* If we're returning something, just turn that into an
977 assignment into the equivalent of the original RESULT_DECL.
978 If the "assignment" is just the result decl, the result
979 decl has already been set (e.g. a recent "foo (&result_decl,
980 ...)"); just toss the entire RETURN_EXPR. */
981 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
983 /* Replace the RETURN_EXPR with (a copy of) the
984 MODIFY_EXPR hanging underneath. */
985 *tp
= copy_node (assignment
);
987 else /* Else the RETURN_EXPR returns no value. */
990 return (tree
) (void *)1;
993 else if (TREE_CODE (*tp
) == SSA_NAME
)
995 *tp
= remap_ssa_name (*tp
, id
);
1000 /* Local variables and labels need to be replaced by equivalent
1001 variables. We don't want to copy static variables; there's only
1002 one of those, no matter how many times we inline the containing
1003 function. Similarly for globals from an outer function. */
1004 else if (auto_var_in_fn_p (*tp
, fn
))
1008 /* Remap the declaration. */
1009 new_decl
= remap_decl (*tp
, id
);
1010 gcc_assert (new_decl
);
1011 /* Replace this variable with the copy. */
1012 STRIP_TYPE_NOPS (new_decl
);
1016 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1017 copy_statement_list (tp
);
1018 else if (TREE_CODE (*tp
) == SAVE_EXPR
1019 || TREE_CODE (*tp
) == TARGET_EXPR
)
1020 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1021 else if (TREE_CODE (*tp
) == LABEL_DECL
1022 && (! DECL_CONTEXT (*tp
)
1023 || decl_function_context (*tp
) == id
->src_fn
))
1024 /* These may need to be remapped for EH handling. */
1025 *tp
= remap_decl (*tp
, id
);
1026 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1027 copy_bind_expr (tp
, walk_subtrees
, id
);
1028 /* Types may need remapping as well. */
1029 else if (TYPE_P (*tp
))
1030 *tp
= remap_type (*tp
, id
);
1032 /* If this is a constant, we have to copy the node iff the type will be
1033 remapped. copy_tree_r will not copy a constant. */
1034 else if (CONSTANT_CLASS_P (*tp
))
1036 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1038 if (new_type
== TREE_TYPE (*tp
))
1041 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1042 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
1043 TREE_INT_CST_HIGH (*tp
));
1046 *tp
= copy_node (*tp
);
1047 TREE_TYPE (*tp
) = new_type
;
1051 /* Otherwise, just copy the node. Note that copy_tree_r already
1052 knows not to copy VAR_DECLs, etc., so this is safe. */
1055 /* Here we handle trees that are not completely rewritten.
1056 First we detect some inlining-induced bogosities for
1058 if (TREE_CODE (*tp
) == MODIFY_EXPR
1059 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1060 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1062 /* Some assignments VAR = VAR; don't generate any rtl code
1063 and thus don't count as variable modification. Avoid
1064 keeping bogosities like 0 = 0. */
1065 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1068 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1072 STRIP_TYPE_NOPS (value
);
1073 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1075 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1076 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1080 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1082 /* Get rid of *& from inline substitutions that can happen when a
1083 pointer argument is an ADDR_EXPR. */
1084 tree decl
= TREE_OPERAND (*tp
, 0);
1085 tree
*n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1088 /* If we happen to get an ADDR_EXPR in n->value, strip
1089 it manually here as we'll eventually get ADDR_EXPRs
1090 which lie about their types pointed to. In this case
1091 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1092 but we absolutely rely on that. As fold_indirect_ref
1093 does other useful transformations, try that first, though. */
1094 tree type
= TREE_TYPE (*tp
);
1095 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1097 *tp
= gimple_fold_indirect_ref (ptr
);
1100 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1103 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1104 /* ??? We should either assert here or build
1105 a VIEW_CONVERT_EXPR instead of blindly leaking
1106 incompatible types to our IL. */
1108 *tp
= TREE_OPERAND (ptr
, 0);
1112 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1113 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1114 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1115 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1116 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1117 have remapped a parameter as the property might be
1118 valid only for the parameter itself. */
1119 if (TREE_THIS_NOTRAP (old
)
1120 && (!is_parm (TREE_OPERAND (old
, 0))
1121 || (!id
->transform_parameter
&& is_parm (ptr
))))
1122 TREE_THIS_NOTRAP (*tp
) = 1;
1129 else if (TREE_CODE (*tp
) == MEM_REF
)
1131 /* We need to re-canonicalize MEM_REFs from inline substitutions
1132 that can happen when a pointer argument is an ADDR_EXPR.
1133 Recurse here manually to allow that. */
1134 tree ptr
= TREE_OPERAND (*tp
, 0);
1135 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1137 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1138 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1139 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1140 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1141 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1142 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1143 remapped a parameter as the property might be valid only
1144 for the parameter itself. */
1145 if (TREE_THIS_NOTRAP (old
)
1146 && (!is_parm (TREE_OPERAND (old
, 0))
1147 || (!id
->transform_parameter
&& is_parm (ptr
))))
1148 TREE_THIS_NOTRAP (*tp
) = 1;
1153 /* Here is the "usual case". Copy this tree node, and then
1154 tweak some special cases. */
1155 copy_tree_r (tp
, walk_subtrees
, NULL
);
1157 /* If EXPR has block defined, map it to newly constructed block.
1158 When inlining we want EXPRs without block appear in the block
1159 of function call if we are not remapping a type. */
1162 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1163 if (TREE_BLOCK (*tp
))
1166 n
= (tree
*) pointer_map_contains (id
->decl_map
,
1171 TREE_SET_BLOCK (*tp
, new_block
);
1174 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1175 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1177 /* The copied TARGET_EXPR has never been expanded, even if the
1178 original node was expanded already. */
1179 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1181 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1182 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1185 /* Variable substitution need not be simple. In particular, the
1186 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1187 and friends are up-to-date. */
1188 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1190 int invariant
= is_gimple_min_invariant (*tp
);
1191 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1193 /* Handle the case where we substituted an INDIRECT_REF
1194 into the operand of the ADDR_EXPR. */
1195 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1196 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1198 recompute_tree_invariant_for_addr_expr (*tp
);
1200 /* If this used to be invariant, but is not any longer,
1201 then regimplification is probably needed. */
1202 if (invariant
&& !is_gimple_min_invariant (*tp
))
1203 id
->regimplify
= true;
1209 /* Keep iterating. */
1213 /* Helper for remap_gimple_stmt. Given an EH region number for the
1214 source function, map that to the duplicate EH region number in
1215 the destination function. */
1218 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1220 eh_region old_r
, new_r
;
1223 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1224 slot
= pointer_map_contains (id
->eh_map
, old_r
);
1225 new_r
= (eh_region
) *slot
;
1227 return new_r
->index
;
1230 /* Similar, but operate on INTEGER_CSTs. */
1233 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1237 old_nr
= tree_to_shwi (old_t_nr
);
1238 new_nr
= remap_eh_region_nr (old_nr
, id
);
1240 return build_int_cst (integer_type_node
, new_nr
);
1243 /* Helper for copy_bb. Remap statement STMT using the inlining
1244 information in ID. Return the new statement copy. */
1247 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1250 struct walk_stmt_info wi
;
1251 bool skip_first
= false;
1253 /* Begin by recognizing trees that we'll completely rewrite for the
1254 inlining context. Our output for these trees is completely
1255 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1256 into an edge). Further down, we'll handle trees that get
1257 duplicated and/or tweaked. */
1259 /* When requested, GIMPLE_RETURNs should be transformed to just the
1260 contained GIMPLE_ASSIGN. The branch semantics of the return will
1261 be handled elsewhere by manipulating the CFG rather than the
1263 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1265 tree retval
= gimple_return_retval (stmt
);
1267 /* If we're returning something, just turn that into an
1268 assignment into the equivalent of the original RESULT_DECL.
1269 If RETVAL is just the result decl, the result decl has
1270 already been set (e.g. a recent "foo (&result_decl, ...)");
1271 just toss the entire GIMPLE_RETURN. */
1273 && (TREE_CODE (retval
) != RESULT_DECL
1274 && (TREE_CODE (retval
) != SSA_NAME
1275 || ! SSA_NAME_VAR (retval
)
1276 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1278 copy
= gimple_build_assign (id
->do_not_unshare
1279 ? id
->retvar
: unshare_expr (id
->retvar
),
1281 /* id->retvar is already substituted. Skip it on later remapping. */
1285 return gimple_build_nop ();
1287 else if (gimple_has_substatements (stmt
))
1291 /* When cloning bodies from the C++ front end, we will be handed bodies
1292 in High GIMPLE form. Handle here all the High GIMPLE statements that
1293 have embedded statements. */
1294 switch (gimple_code (stmt
))
1297 copy
= copy_gimple_bind (stmt
, id
);
1301 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1302 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1305 case GIMPLE_EH_FILTER
:
1306 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1307 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1311 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1312 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1313 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1316 case GIMPLE_WITH_CLEANUP_EXPR
:
1317 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1318 copy
= gimple_build_wce (s1
);
1321 case GIMPLE_OMP_PARALLEL
:
1322 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1323 copy
= gimple_build_omp_parallel
1325 gimple_omp_parallel_clauses (stmt
),
1326 gimple_omp_parallel_child_fn (stmt
),
1327 gimple_omp_parallel_data_arg (stmt
));
1330 case GIMPLE_OMP_TASK
:
1331 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1332 copy
= gimple_build_omp_task
1334 gimple_omp_task_clauses (stmt
),
1335 gimple_omp_task_child_fn (stmt
),
1336 gimple_omp_task_data_arg (stmt
),
1337 gimple_omp_task_copy_fn (stmt
),
1338 gimple_omp_task_arg_size (stmt
),
1339 gimple_omp_task_arg_align (stmt
));
1342 case GIMPLE_OMP_FOR
:
1343 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1344 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1345 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1346 gimple_omp_for_clauses (stmt
),
1347 gimple_omp_for_collapse (stmt
), s2
);
1350 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1352 gimple_omp_for_set_index (copy
, i
,
1353 gimple_omp_for_index (stmt
, i
));
1354 gimple_omp_for_set_initial (copy
, i
,
1355 gimple_omp_for_initial (stmt
, i
));
1356 gimple_omp_for_set_final (copy
, i
,
1357 gimple_omp_for_final (stmt
, i
));
1358 gimple_omp_for_set_incr (copy
, i
,
1359 gimple_omp_for_incr (stmt
, i
));
1360 gimple_omp_for_set_cond (copy
, i
,
1361 gimple_omp_for_cond (stmt
, i
));
1366 case GIMPLE_OMP_MASTER
:
1367 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1368 copy
= gimple_build_omp_master (s1
);
1371 case GIMPLE_OMP_TASKGROUP
:
1372 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1373 copy
= gimple_build_omp_taskgroup (s1
);
1376 case GIMPLE_OMP_ORDERED
:
1377 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1378 copy
= gimple_build_omp_ordered (s1
);
1381 case GIMPLE_OMP_SECTION
:
1382 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1383 copy
= gimple_build_omp_section (s1
);
1386 case GIMPLE_OMP_SECTIONS
:
1387 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1388 copy
= gimple_build_omp_sections
1389 (s1
, gimple_omp_sections_clauses (stmt
));
1392 case GIMPLE_OMP_SINGLE
:
1393 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1394 copy
= gimple_build_omp_single
1395 (s1
, gimple_omp_single_clauses (stmt
));
1398 case GIMPLE_OMP_TARGET
:
1399 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1400 copy
= gimple_build_omp_target
1401 (s1
, gimple_omp_target_kind (stmt
),
1402 gimple_omp_target_clauses (stmt
));
1405 case GIMPLE_OMP_TEAMS
:
1406 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1407 copy
= gimple_build_omp_teams
1408 (s1
, gimple_omp_teams_clauses (stmt
));
1411 case GIMPLE_OMP_CRITICAL
:
1412 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1414 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1417 case GIMPLE_TRANSACTION
:
1418 s1
= remap_gimple_seq (gimple_transaction_body (stmt
), id
);
1419 copy
= gimple_build_transaction (s1
, gimple_transaction_label (stmt
));
1420 gimple_transaction_set_subcode (copy
, gimple_transaction_subcode (stmt
));
1429 if (gimple_assign_copy_p (stmt
)
1430 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1431 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1433 /* Here we handle statements that are not completely rewritten.
1434 First we detect some inlining-induced bogosities for
1437 /* Some assignments VAR = VAR; don't generate any rtl code
1438 and thus don't count as variable modification. Avoid
1439 keeping bogosities like 0 = 0. */
1440 tree decl
= gimple_assign_lhs (stmt
), value
;
1443 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1447 STRIP_TYPE_NOPS (value
);
1448 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1449 return gimple_build_nop ();
1453 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1454 in a block that we aren't copying during tree_function_versioning,
1455 just drop the clobber stmt. */
1456 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1458 tree lhs
= gimple_assign_lhs (stmt
);
1459 if (TREE_CODE (lhs
) == MEM_REF
1460 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1462 gimple def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1463 if (gimple_bb (def_stmt
)
1464 && !bitmap_bit_p (id
->blocks_to_copy
,
1465 gimple_bb (def_stmt
)->index
))
1466 return gimple_build_nop ();
1470 if (gimple_debug_bind_p (stmt
))
1472 copy
= gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1473 gimple_debug_bind_get_value (stmt
),
1475 id
->debug_stmts
.safe_push (copy
);
1478 if (gimple_debug_source_bind_p (stmt
))
1480 copy
= gimple_build_debug_source_bind
1481 (gimple_debug_source_bind_get_var (stmt
),
1482 gimple_debug_source_bind_get_value (stmt
), stmt
);
1483 id
->debug_stmts
.safe_push (copy
);
1487 /* Create a new deep copy of the statement. */
1488 copy
= gimple_copy (stmt
);
1490 /* Clear flags that need revisiting. */
1491 if (is_gimple_call (copy
)
1492 && gimple_call_tail_p (copy
))
1493 gimple_call_set_tail (copy
, false);
1495 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1496 RESX and EH_DISPATCH. */
1498 switch (gimple_code (copy
))
1502 tree r
, fndecl
= gimple_call_fndecl (copy
);
1503 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1504 switch (DECL_FUNCTION_CODE (fndecl
))
1506 case BUILT_IN_EH_COPY_VALUES
:
1507 r
= gimple_call_arg (copy
, 1);
1508 r
= remap_eh_region_tree_nr (r
, id
);
1509 gimple_call_set_arg (copy
, 1, r
);
1512 case BUILT_IN_EH_POINTER
:
1513 case BUILT_IN_EH_FILTER
:
1514 r
= gimple_call_arg (copy
, 0);
1515 r
= remap_eh_region_tree_nr (r
, id
);
1516 gimple_call_set_arg (copy
, 0, r
);
1523 /* Reset alias info if we didn't apply measures to
1524 keep it valid over inlining by setting DECL_PT_UID. */
1525 if (!id
->src_cfun
->gimple_df
1526 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1527 gimple_call_reset_alias_info (copy
);
1533 int r
= gimple_resx_region (copy
);
1534 r
= remap_eh_region_nr (r
, id
);
1535 gimple_resx_set_region (copy
, r
);
1539 case GIMPLE_EH_DISPATCH
:
1541 int r
= gimple_eh_dispatch_region (copy
);
1542 r
= remap_eh_region_nr (r
, id
);
1543 gimple_eh_dispatch_set_region (copy
, r
);
1552 /* If STMT has a block defined, map it to the newly constructed
1554 if (gimple_block (copy
))
1557 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1559 gimple_set_block (copy
, *n
);
1562 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1565 /* Remap all the operands in COPY. */
1566 memset (&wi
, 0, sizeof (wi
));
1569 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1571 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1573 /* Clear the copied virtual operands. We are not remapping them here
1574 but are going to recreate them from scratch. */
1575 if (gimple_has_mem_ops (copy
))
1577 gimple_set_vdef (copy
, NULL_TREE
);
1578 gimple_set_vuse (copy
, NULL_TREE
);
1585 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1589 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1590 gcov_type count_scale
)
1592 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1593 basic_block copy_basic_block
;
1598 /* Search for previous copied basic block. */
1601 prev
= prev
->prev_bb
;
1603 /* create_basic_block() will append every new block to
1604 basic_block_info automatically. */
1605 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1606 (basic_block
) prev
->aux
);
1607 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1609 /* We are going to rebuild frequencies from scratch. These values
1610 have just small importance to drive canonicalize_loop_headers. */
1611 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1613 /* We recompute frequencies after inlining, so this is quite safe. */
1614 if (freq
> BB_FREQ_MAX
)
1616 copy_basic_block
->frequency
= freq
;
1618 copy_gsi
= gsi_start_bb (copy_basic_block
);
1620 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1622 gimple stmt
= gsi_stmt (gsi
);
1623 gimple orig_stmt
= stmt
;
1625 id
->regimplify
= false;
1626 stmt
= remap_gimple_stmt (stmt
, id
);
1627 if (gimple_nop_p (stmt
))
1630 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1633 /* With return slot optimization we can end up with
1634 non-gimple (foo *)&this->m, fix that here. */
1635 if (is_gimple_assign (stmt
)
1636 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1637 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1640 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1641 gimple_assign_rhs1 (stmt
),
1643 GSI_CONTINUE_LINKING
);
1644 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1645 id
->regimplify
= false;
1648 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1651 gimple_regimplify_operands (stmt
, &seq_gsi
);
1653 /* If copy_basic_block has been empty at the start of this iteration,
1654 call gsi_start_bb again to get at the newly added statements. */
1655 if (gsi_end_p (copy_gsi
))
1656 copy_gsi
= gsi_start_bb (copy_basic_block
);
1658 gsi_next (©_gsi
);
1660 /* Process the new statement. The call to gimple_regimplify_operands
1661 possibly turned the statement into multiple statements, we
1662 need to process all of them. */
1667 stmt
= gsi_stmt (copy_gsi
);
1668 if (is_gimple_call (stmt
)
1669 && gimple_call_va_arg_pack_p (stmt
)
1672 /* __builtin_va_arg_pack () should be replaced by
1673 all arguments corresponding to ... in the caller. */
1677 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1680 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1683 /* Create the new array of arguments. */
1684 n
= nargs
+ gimple_call_num_args (stmt
);
1685 argarray
.create (n
);
1686 argarray
.safe_grow_cleared (n
);
1688 /* Copy all the arguments before '...' */
1689 memcpy (argarray
.address (),
1690 gimple_call_arg_ptr (stmt
, 0),
1691 gimple_call_num_args (stmt
) * sizeof (tree
));
1693 /* Append the arguments passed in '...' */
1694 memcpy (argarray
.address () + gimple_call_num_args (stmt
),
1695 gimple_call_arg_ptr (id
->gimple_call
, 0)
1696 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1697 nargs
* sizeof (tree
));
1699 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1702 argarray
.release ();
1704 /* Copy all GIMPLE_CALL flags, location and block, except
1705 GF_CALL_VA_ARG_PACK. */
1706 gimple_call_copy_flags (new_call
, stmt
);
1707 gimple_call_set_va_arg_pack (new_call
, false);
1708 gimple_set_location (new_call
, gimple_location (stmt
));
1709 gimple_set_block (new_call
, gimple_block (stmt
));
1710 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1712 gsi_replace (©_gsi
, new_call
, false);
1715 else if (is_gimple_call (stmt
)
1717 && (decl
= gimple_call_fndecl (stmt
))
1718 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1719 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1721 /* __builtin_va_arg_pack_len () should be replaced by
1722 the number of anonymous arguments. */
1723 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1727 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1730 count
= build_int_cst (integer_type_node
, nargs
);
1731 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1732 gsi_replace (©_gsi
, new_stmt
, false);
1736 /* Statements produced by inlining can be unfolded, especially
1737 when we constant propagated some operands. We can't fold
1738 them right now for two reasons:
1739 1) folding require SSA_NAME_DEF_STMTs to be correct
1740 2) we can't change function calls to builtins.
1741 So we just mark statement for later folding. We mark
1742 all new statements, instead just statements that has changed
1743 by some nontrivial substitution so even statements made
1744 foldable indirectly are updated. If this turns out to be
1745 expensive, copy_body can be told to watch for nontrivial
1747 if (id
->statements_to_fold
)
1748 pointer_set_insert (id
->statements_to_fold
, stmt
);
1750 /* We're duplicating a CALL_EXPR. Find any corresponding
1751 callgraph edges and update or duplicate them. */
1752 if (is_gimple_call (stmt
))
1754 struct cgraph_edge
*edge
;
1756 switch (id
->transform_call_graph_edges
)
1758 case CB_CGE_DUPLICATE
:
1759 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1762 int edge_freq
= edge
->frequency
;
1764 struct cgraph_edge
*old_edge
= edge
;
1765 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1767 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1769 /* We could also just rescale the frequency, but
1770 doing so would introduce roundoff errors and make
1771 verifier unhappy. */
1772 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1775 /* Speculative calls consist of two edges - direct and indirect.
1776 Duplicate the whole thing and distribute frequencies accordingly. */
1777 if (edge
->speculative
)
1779 struct cgraph_edge
*direct
, *indirect
;
1780 struct ipa_ref
*ref
;
1782 gcc_assert (!edge
->indirect_unknown_callee
);
1783 cgraph_speculative_call_info (old_edge
, direct
, indirect
, ref
);
1784 indirect
= cgraph_clone_edge (indirect
, id
->dst_node
, stmt
,
1786 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1788 if (old_edge
->frequency
+ indirect
->frequency
)
1790 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
1791 (old_edge
->frequency
+ indirect
->frequency
)),
1793 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
1794 (old_edge
->frequency
+ indirect
->frequency
)),
1797 ipa_clone_ref (ref
, id
->dst_node
, stmt
);
1801 edge
->frequency
= new_freq
;
1803 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
1804 && (edge_freq
> edge
->frequency
+ 10
1805 || edge_freq
< edge
->frequency
- 10))
1807 fprintf (dump_file
, "Edge frequency estimated by "
1808 "cgraph %i diverge from inliner's estimate %i\n",
1812 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1815 copy_basic_block
->frequency
);
1821 case CB_CGE_MOVE_CLONES
:
1822 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1824 edge
= cgraph_edge (id
->dst_node
, stmt
);
1828 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1830 cgraph_set_call_stmt (edge
, stmt
);
1837 /* Constant propagation on argument done during inlining
1838 may create new direct call. Produce an edge for it. */
1840 || (edge
->indirect_inlining_edge
1841 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1842 && id
->dst_node
->definition
1843 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1845 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1847 /* We have missing edge in the callgraph. This can happen
1848 when previous inlining turned an indirect call into a
1849 direct call by constant propagating arguments or we are
1850 producing dead clone (for further cloning). In all
1851 other cases we hit a bug (incorrect node sharing is the
1852 most common reason for missing edges). */
1853 gcc_assert (!dest
->definition
1854 || dest
->address_taken
1855 || !id
->src_node
->definition
1856 || !id
->dst_node
->definition
);
1857 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1858 cgraph_create_edge_including_clones
1859 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1860 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1862 CIF_ORIGINALLY_INDIRECT_CALL
);
1864 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1866 compute_call_stmt_bb_frequency
1867 (id
->dst_node
->decl
,
1868 copy_basic_block
))->inline_failed
1869 = CIF_ORIGINALLY_INDIRECT_CALL
;
1872 fprintf (dump_file
, "Created new direct edge to %s\n",
1877 notice_special_calls (stmt
);
1880 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1881 id
->eh_map
, id
->eh_lp_nr
);
1883 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1888 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1889 if (TREE_CODE (def
) == SSA_NAME
)
1890 SSA_NAME_DEF_STMT (def
) = stmt
;
1893 gsi_next (©_gsi
);
1895 while (!gsi_end_p (copy_gsi
));
1897 copy_gsi
= gsi_last_bb (copy_basic_block
);
1900 return copy_basic_block
;
1903 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1904 form is quite easy, since dominator relationship for old basic blocks does
1907 There is however exception where inlining might change dominator relation
1908 across EH edges from basic block within inlined functions destinating
1909 to landing pads in function we inline into.
1911 The function fills in PHI_RESULTs of such PHI nodes if they refer
1912 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1913 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1914 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1915 set, and this means that there will be no overlapping live ranges
1916 for the underlying symbol.
1918 This might change in future if we allow redirecting of EH edges and
1919 we might want to change way build CFG pre-inlining to include
1920 all the possible edges then. */
1922 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1923 bool can_throw
, bool nonlocal_goto
)
1928 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1930 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1933 gimple_stmt_iterator si
;
1936 gcc_assert (e
->flags
& EDGE_EH
);
1939 gcc_assert (!(e
->flags
& EDGE_EH
));
1941 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1945 phi
= gsi_stmt (si
);
1947 /* For abnormal goto/call edges the receiver can be the
1948 ENTRY_BLOCK. Do not assert this cannot happen. */
1950 gcc_assert ((e
->flags
& EDGE_EH
)
1951 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1953 re
= find_edge (ret_bb
, e
->dest
);
1954 gcc_checking_assert (re
);
1955 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1956 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1958 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1959 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1965 /* Copy edges from BB into its copy constructed earlier, scale profile
1966 accordingly. Edges will be taken care of later. Assume aux
1967 pointers to point to the copies of each BB. Return true if any
1968 debug stmts are left after a statement that must end the basic block. */
1971 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
1972 basic_block abnormal_goto_dest
)
1974 basic_block new_bb
= (basic_block
) bb
->aux
;
1977 gimple_stmt_iterator si
;
1979 bool need_debug_cleanup
= false;
1981 /* Use the indices from the original blocks to create edges for the
1983 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1984 if (!(old_edge
->flags
& EDGE_EH
))
1988 flags
= old_edge
->flags
;
1989 flags
&= (~EDGE_ANNOTATED
);
1991 /* Return edges do get a FALLTHRU flag when the get inlined. */
1992 if (old_edge
->dest
->index
== EXIT_BLOCK
1993 && !(old_edge
->flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
1994 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
1995 flags
|= EDGE_FALLTHRU
;
1996 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1997 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
1998 new_edge
->probability
= old_edge
->probability
;
2001 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2004 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2007 bool can_throw
, nonlocal_goto
;
2009 copy_stmt
= gsi_stmt (si
);
2010 if (!is_gimple_debug (copy_stmt
))
2011 update_stmt (copy_stmt
);
2013 /* Do this before the possible split_block. */
2016 /* If this tree could throw an exception, there are two
2017 cases where we need to add abnormal edge(s): the
2018 tree wasn't in a region and there is a "current
2019 region" in the caller; or the original tree had
2020 EH edges. In both cases split the block after the tree,
2021 and add abnormal edge(s) as needed; we need both
2022 those from the callee and the caller.
2023 We check whether the copy can throw, because the const
2024 propagation can change an INDIRECT_REF which throws
2025 into a COMPONENT_REF which doesn't. If the copy
2026 can throw, the original could also throw. */
2027 can_throw
= stmt_can_throw_internal (copy_stmt
);
2029 = (stmt_can_make_abnormal_goto (copy_stmt
)
2030 && !computed_goto_p (copy_stmt
));
2032 if (can_throw
|| nonlocal_goto
)
2034 if (!gsi_end_p (si
))
2036 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2039 need_debug_cleanup
= true;
2041 if (!gsi_end_p (si
))
2042 /* Note that bb's predecessor edges aren't necessarily
2043 right at this point; split_block doesn't care. */
2045 edge e
= split_block (new_bb
, copy_stmt
);
2048 new_bb
->aux
= e
->src
->aux
;
2049 si
= gsi_start_bb (new_bb
);
2053 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2054 make_eh_dispatch_edges (copy_stmt
);
2056 make_eh_edges (copy_stmt
);
2058 /* If the call we inline cannot make abnormal goto do not add
2059 additional abnormal edges but only retain those already present
2060 in the original function body. */
2061 if (abnormal_goto_dest
== NULL
)
2062 nonlocal_goto
= false;
2065 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2067 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2068 nonlocal_goto
= false;
2069 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2070 in OpenMP regions which aren't allowed to be left abnormally.
2071 So, no need to add abnormal edge in that case. */
2072 else if (is_gimple_call (copy_stmt
)
2073 && gimple_call_internal_p (copy_stmt
)
2074 && (gimple_call_internal_fn (copy_stmt
)
2075 == IFN_ABNORMAL_DISPATCHER
)
2076 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2077 nonlocal_goto
= false;
2079 make_edge (copy_stmt_bb
, abnormal_goto_dest
, EDGE_ABNORMAL
);
2082 if ((can_throw
|| nonlocal_goto
)
2083 && gimple_in_ssa_p (cfun
))
2084 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2085 can_throw
, nonlocal_goto
);
2087 return need_debug_cleanup
;
2090 /* Copy the PHIs. All blocks and edges are copied, some blocks
2091 was possibly split and new outgoing EH edges inserted.
2092 BB points to the block of original function and AUX pointers links
2093 the original and newly copied blocks. */
2096 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2098 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2101 gimple_stmt_iterator si
;
2103 bool inserted
= false;
2105 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2110 phi
= gsi_stmt (si
);
2111 res
= PHI_RESULT (phi
);
2113 if (!virtual_operand_p (res
))
2115 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2116 new_phi
= create_phi_node (new_res
, new_bb
);
2117 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2119 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2125 /* When doing partial cloning, we allow PHIs on the entry block
2126 as long as all the arguments are the same. Find any input
2127 edge to see argument to copy. */
2129 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2130 if (!old_edge
->src
->aux
)
2133 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2135 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2136 gcc_assert (new_arg
);
2137 /* With return slot optimization we can end up with
2138 non-gimple (foo *)&this->m, fix that here. */
2139 if (TREE_CODE (new_arg
) != SSA_NAME
2140 && TREE_CODE (new_arg
) != FUNCTION_DECL
2141 && !is_gimple_val (new_arg
))
2143 gimple_seq stmts
= NULL
;
2144 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2145 gsi_insert_seq_on_edge (new_edge
, stmts
);
2148 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2149 if (LOCATION_BLOCK (locus
))
2152 n
= (tree
*) pointer_map_contains (id
->decl_map
,
2153 LOCATION_BLOCK (locus
));
2156 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2158 locus
= LOCATION_LOCUS (locus
);
2161 locus
= LOCATION_LOCUS (locus
);
2163 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2168 /* Commit the delayed edge insertions. */
2170 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2171 gsi_commit_one_edge_insert (new_edge
, NULL
);
2175 /* Wrapper for remap_decl so it can be used as a callback. */
2178 remap_decl_1 (tree decl
, void *data
)
2180 return remap_decl (decl
, (copy_body_data
*) data
);
2183 /* Build struct function and associated datastructures for the new clone
2184 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2185 the cfun to the function of new_fndecl (and current_function_decl too). */
2188 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2190 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2191 gcov_type count_scale
;
2193 if (!DECL_ARGUMENTS (new_fndecl
))
2194 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2195 if (!DECL_RESULT (new_fndecl
))
2196 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2198 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2200 = GCOV_COMPUTE_SCALE (count
,
2201 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2203 count_scale
= REG_BR_PROB_BASE
;
2205 /* Register specific tree functions. */
2206 gimple_register_cfg_hooks ();
2208 /* Get clean struct function. */
2209 push_struct_function (new_fndecl
);
2211 /* We will rebuild these, so just sanity check that they are empty. */
2212 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2213 gcc_assert (cfun
->local_decls
== NULL
);
2214 gcc_assert (cfun
->cfg
== NULL
);
2215 gcc_assert (cfun
->decl
== new_fndecl
);
2217 /* Copy items we preserve during cloning. */
2218 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2219 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2220 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2221 cfun
->curr_properties
= src_cfun
->curr_properties
;
2222 cfun
->last_verified
= src_cfun
->last_verified
;
2223 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2224 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2225 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2226 cfun
->stdarg
= src_cfun
->stdarg
;
2227 cfun
->after_inlining
= src_cfun
->after_inlining
;
2228 cfun
->can_throw_non_call_exceptions
2229 = src_cfun
->can_throw_non_call_exceptions
;
2230 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2231 cfun
->returns_struct
= src_cfun
->returns_struct
;
2232 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2233 cfun
->module_id
= src_cfun
->module_id
;
2235 init_empty_tree_cfg ();
2237 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2238 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2239 (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
* (double)count_scale
/
2241 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2242 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2243 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2244 (EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
* (double)count_scale
/
2246 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2247 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2249 init_eh_for_function ();
2251 if (src_cfun
->gimple_df
)
2253 init_tree_ssa (cfun
);
2254 cfun
->gimple_df
->in_ssa_p
= true;
2255 init_ssa_operands (cfun
);
2259 /* Helper function for copy_cfg_body. Move debug stmts from the end
2260 of NEW_BB to the beginning of successor basic blocks when needed. If the
2261 successor has multiple predecessors, reset them, otherwise keep
2265 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2269 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2272 || gsi_one_before_end_p (si
)
2273 || !(stmt_can_throw_internal (gsi_stmt (si
))
2274 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2277 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2279 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2280 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2281 while (is_gimple_debug (gsi_stmt (ssi
)))
2283 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2287 /* For the last edge move the debug stmts instead of copying
2289 if (ei_one_before_end_p (ei
))
2293 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2294 gimple_debug_bind_reset_value (stmt
);
2295 gsi_remove (&si
, false);
2296 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2300 if (gimple_debug_bind_p (stmt
))
2302 var
= gimple_debug_bind_get_var (stmt
);
2303 if (single_pred_p (e
->dest
))
2305 value
= gimple_debug_bind_get_value (stmt
);
2306 value
= unshare_expr (value
);
2310 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2312 else if (gimple_debug_source_bind_p (stmt
))
2314 var
= gimple_debug_source_bind_get_var (stmt
);
2315 value
= gimple_debug_source_bind_get_value (stmt
);
2316 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2320 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2321 id
->debug_stmts
.safe_push (new_stmt
);
2327 /* Make a copy of the sub-loops of SRC_PARENT and place them
2328 as siblings of DEST_PARENT. */
2331 copy_loops (copy_body_data
*id
,
2332 struct loop
*dest_parent
, struct loop
*src_parent
)
2334 struct loop
*src_loop
= src_parent
->inner
;
2337 if (!id
->blocks_to_copy
2338 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2340 struct loop
*dest_loop
= alloc_loop ();
2342 /* Assign the new loop its header and latch and associate
2343 those with the new loop. */
2344 if (src_loop
->header
!= NULL
)
2346 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2347 dest_loop
->header
->loop_father
= dest_loop
;
2349 if (src_loop
->latch
!= NULL
)
2351 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2352 dest_loop
->latch
->loop_father
= dest_loop
;
2355 /* Copy loop meta-data. */
2356 copy_loop_info (src_loop
, dest_loop
);
2358 /* Finally place it into the loop array and the loop tree. */
2359 place_new_loop (cfun
, dest_loop
);
2360 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2362 if (src_loop
->simduid
)
2364 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2365 cfun
->has_simduid_loops
= true;
2367 if (src_loop
->force_vect
)
2369 dest_loop
->force_vect
= true;
2370 cfun
->has_force_vect_loops
= true;
2372 dest_loop
->safelen
= src_loop
->safelen
;
2375 copy_loops (id
, dest_loop
, src_loop
);
2377 src_loop
= src_loop
->next
;
2381 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2384 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2386 gimple_stmt_iterator si
;
2387 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2389 if (is_gimple_call (gsi_stmt (si
)))
2391 struct cgraph_edge
*edge
= cgraph_edge (id
->dst_node
, gsi_stmt (si
));
2393 cgraph_redirect_edge_call_stmt_to_callee (edge
);
2398 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2399 with each bb's frequency. Used when NODE has a 0-weight entry
2400 but we are about to inline it into a non-zero count call bb.
2401 See the comments for handle_missing_profiles() in predict.c for
2402 when this can happen for COMDATs. */
2405 freqs_to_counts (struct cgraph_node
*node
, gcov_type count
)
2410 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2412 FOR_ALL_BB_FN(bb
, fn
)
2414 bb
->count
= apply_scale (count
,
2415 GCOV_COMPUTE_SCALE (bb
->frequency
, BB_FREQ_MAX
));
2416 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2417 e
->count
= apply_probability (e
->src
->count
, e
->probability
);
2421 /* Make a copy of the body of FN so that it can be inserted inline in
2422 another function. Walks FN via CFG, returns new fndecl. */
2425 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2426 basic_block entry_block_map
, basic_block exit_block_map
,
2427 basic_block new_entry
)
2429 tree callee_fndecl
= id
->src_fn
;
2430 /* Original cfun for the callee, doesn't change. */
2431 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2432 struct function
*cfun_to_copy
;
2434 tree new_fndecl
= NULL
;
2435 bool need_debug_cleanup
= false;
2436 gcov_type count_scale
;
2438 int incoming_frequency
= 0;
2439 gcov_type incoming_count
= 0;
2441 /* This can happen for COMDAT routines that end up with 0 counts
2442 despite being called (see the comments for handle_missing_profiles()
2443 in predict.c as to why). Apply counts to the blocks in the callee
2444 before inlining, using the guessed edge frequencies, so that we don't
2445 end up with a 0-count inline body which can confuse downstream
2446 optimizations such as function splitting. */
2447 if (!ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
&& count
)
2449 /* Apply the larger of the call bb count and the total incoming
2450 call edge count to the callee. */
2451 gcov_type in_count
= 0;
2452 struct cgraph_edge
*in_edge
;
2453 for (in_edge
= id
->src_node
->callers
; in_edge
;
2454 in_edge
= in_edge
->next_caller
)
2455 in_count
+= in_edge
->count
;
2456 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2459 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2461 = GCOV_COMPUTE_SCALE (count
,
2462 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2464 count_scale
= REG_BR_PROB_BASE
;
2466 /* Register specific tree functions. */
2467 gimple_register_cfg_hooks ();
2469 /* If we are inlining just region of the function, make sure to connect
2470 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2471 part of loop, we must compute frequency and probability of
2472 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2473 probabilities of edges incoming from nonduplicated region. */
2479 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2482 incoming_frequency
+= EDGE_FREQUENCY (e
);
2483 incoming_count
+= e
->count
;
2485 incoming_count
= apply_scale (incoming_count
, count_scale
);
2487 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2488 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2489 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2492 /* Must have a CFG here at this point. */
2493 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2494 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2496 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2498 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2499 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2500 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2501 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2503 /* Duplicate any exception-handling regions. */
2505 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2508 /* Use aux pointers to map the original blocks to copy. */
2509 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2510 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2512 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2515 new_bb
->loop_father
= entry_block_map
->loop_father
;
2518 last
= last_basic_block_for_fn (cfun
);
2520 /* Now that we've duplicated the blocks, duplicate their edges. */
2521 basic_block abnormal_goto_dest
= NULL
;
2523 && stmt_can_make_abnormal_goto (id
->gimple_call
))
2525 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->gimple_call
);
2527 bb
= gimple_bb (id
->gimple_call
);
2529 if (gsi_end_p (gsi
))
2530 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2532 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2533 if (!id
->blocks_to_copy
2534 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2535 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2536 abnormal_goto_dest
);
2540 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2541 e
->probability
= REG_BR_PROB_BASE
;
2542 e
->count
= incoming_count
;
2545 /* Duplicate the loop tree, if available and wanted. */
2546 if (loops_for_fn (src_cfun
) != NULL
2547 && current_loops
!= NULL
)
2549 copy_loops (id
, entry_block_map
->loop_father
,
2550 get_loop (src_cfun
, 0));
2551 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2552 loops_state_set (LOOPS_NEED_FIXUP
);
2555 /* If the loop tree in the source function needed fixup, mark the
2556 destination loop tree for fixup, too. */
2557 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2558 loops_state_set (LOOPS_NEED_FIXUP
);
2560 if (gimple_in_ssa_p (cfun
))
2561 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2562 if (!id
->blocks_to_copy
2563 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2564 copy_phis_for_bb (bb
, id
);
2566 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2569 if (need_debug_cleanup
2570 && bb
->index
!= ENTRY_BLOCK
2571 && bb
->index
!= EXIT_BLOCK
)
2572 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2573 /* Update call edge destinations. This can not be done before loop
2574 info is updated, because we may split basic blocks. */
2575 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2576 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2577 ((basic_block
)bb
->aux
)->aux
= NULL
;
2581 /* Zero out AUX fields of newly created block during EH edge
2583 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2585 if (need_debug_cleanup
)
2586 maybe_move_debug_stmts_to_successors (id
,
2587 BASIC_BLOCK_FOR_FN (cfun
, last
));
2588 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2589 /* Update call edge destinations. This can not be done before loop
2590 info is updated, because we may split basic blocks. */
2591 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2592 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2594 entry_block_map
->aux
= NULL
;
2595 exit_block_map
->aux
= NULL
;
2599 pointer_map_destroy (id
->eh_map
);
2606 /* Copy the debug STMT using ID. We deal with these statements in a
2607 special way: if any variable in their VALUE expression wasn't
2608 remapped yet, we won't remap it, because that would get decl uids
2609 out of sync, causing codegen differences between -g and -g0. If
2610 this arises, we drop the VALUE expression altogether. */
2613 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2616 struct walk_stmt_info wi
;
2618 if (gimple_block (stmt
))
2620 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2621 gimple_set_block (stmt
, n
? *n
: id
->block
);
2624 /* Remap all the operands in COPY. */
2625 memset (&wi
, 0, sizeof (wi
));
2628 processing_debug_stmt
= 1;
2630 if (gimple_debug_source_bind_p (stmt
))
2631 t
= gimple_debug_source_bind_get_var (stmt
);
2633 t
= gimple_debug_bind_get_var (stmt
);
2635 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2636 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2638 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2641 else if (TREE_CODE (t
) == VAR_DECL
2642 && !is_global_var (t
)
2643 && !pointer_map_contains (id
->decl_map
, t
))
2644 /* T is a non-localized variable. */;
2646 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2648 if (gimple_debug_bind_p (stmt
))
2650 gimple_debug_bind_set_var (stmt
, t
);
2652 if (gimple_debug_bind_has_value_p (stmt
))
2654 tree v
= gimple_debug_bind_get_value (stmt
);
2655 if (TREE_CODE (v
) == ADDR_EXPR
)
2656 v
= TREE_OPERAND (v
, 0);
2658 /* The global var may be deleted */
2659 if (L_IPO_COMP_MODE
&&
2660 ((TREE_CODE (v
) != VAR_DECL
)
2661 || is_global_var (v
)))
2662 processing_debug_stmt
= -1;
2664 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2665 remap_gimple_op_r
, &wi
, NULL
);
2668 /* Punt if any decl couldn't be remapped. */
2669 if (processing_debug_stmt
< 0)
2670 gimple_debug_bind_reset_value (stmt
);
2672 else if (gimple_debug_source_bind_p (stmt
))
2674 gimple_debug_source_bind_set_var (stmt
, t
);
2675 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2676 remap_gimple_op_r
, &wi
, NULL
);
2677 /* When inlining and source bind refers to one of the optimized
2678 away parameters, change the source bind into normal debug bind
2679 referring to the corresponding DEBUG_EXPR_DECL that should have
2680 been bound before the call stmt. */
2681 t
= gimple_debug_source_bind_get_value (stmt
);
2683 && TREE_CODE (t
) == PARM_DECL
2686 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2688 if (debug_args
!= NULL
)
2690 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2691 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2692 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2694 t
= (**debug_args
)[i
+ 1];
2695 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2696 gimple_debug_bind_set_value (stmt
, t
);
2703 processing_debug_stmt
= 0;
2708 /* Process deferred debug stmts. In order to give values better odds
2709 of being successfully remapped, we delay the processing of debug
2710 stmts until all other stmts that might require remapping are
2714 copy_debug_stmts (copy_body_data
*id
)
2719 if (!id
->debug_stmts
.exists ())
2722 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2723 copy_debug_stmt (stmt
, id
);
2725 id
->debug_stmts
.release ();
2728 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2729 another function. */
2732 copy_tree_body (copy_body_data
*id
)
2734 tree fndecl
= id
->src_fn
;
2735 tree body
= DECL_SAVED_TREE (fndecl
);
2737 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2742 /* Make a copy of the body of FN so that it can be inserted inline in
2743 another function. */
2746 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2747 basic_block entry_block_map
, basic_block exit_block_map
,
2748 basic_block new_entry
)
2750 tree fndecl
= id
->src_fn
;
2753 /* If this body has a CFG, walk CFG and copy. */
2754 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2755 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2757 copy_debug_stmts (id
);
2762 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2763 defined in function FN, or of a data member thereof. */
2766 self_inlining_addr_expr (tree value
, tree fn
)
2770 if (TREE_CODE (value
) != ADDR_EXPR
)
2773 var
= get_base_address (TREE_OPERAND (value
, 0));
2775 return var
&& auto_var_in_fn_p (var
, fn
);
2778 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2779 lexical block and line number information from base_stmt, if given,
2780 or from the last stmt of the block otherwise. */
2783 insert_init_debug_bind (copy_body_data
*id
,
2784 basic_block bb
, tree var
, tree value
,
2788 gimple_stmt_iterator gsi
;
2791 if (!gimple_in_ssa_p (id
->src_cfun
))
2794 if (!MAY_HAVE_DEBUG_STMTS
)
2797 tracked_var
= target_for_debug_bind (var
);
2803 gsi
= gsi_last_bb (bb
);
2804 if (!base_stmt
&& !gsi_end_p (gsi
))
2805 base_stmt
= gsi_stmt (gsi
);
2808 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2812 if (!gsi_end_p (gsi
))
2813 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2815 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2822 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2824 /* If VAR represents a zero-sized variable, it's possible that the
2825 assignment statement may result in no gimple statements. */
2828 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2830 /* We can end up with init statements that store to a non-register
2831 from a rhs with a conversion. Handle that here by forcing the
2832 rhs into a temporary. gimple_regimplify_operands is not
2833 prepared to do this for us. */
2834 if (!is_gimple_debug (init_stmt
)
2835 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2836 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2837 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2839 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2840 gimple_expr_type (init_stmt
),
2841 gimple_assign_rhs1 (init_stmt
));
2842 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2844 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2845 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2847 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2848 gimple_regimplify_operands (init_stmt
, &si
);
2850 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2852 tree def
= gimple_assign_lhs (init_stmt
);
2853 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2858 /* Initialize parameter P with VALUE. If needed, produce init statement
2859 at the end of BB. When BB is NULL, we return init statement to be
2862 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2863 basic_block bb
, tree
*vars
)
2865 gimple init_stmt
= NULL
;
2868 tree def
= (gimple_in_ssa_p (cfun
)
2869 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2872 && value
!= error_mark_node
2873 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2875 /* If we can match up types by promotion/demotion do so. */
2876 if (fold_convertible_p (TREE_TYPE (p
), value
))
2877 rhs
= fold_convert (TREE_TYPE (p
), value
);
2880 /* ??? For valid programs we should not end up here.
2881 Still if we end up with truly mismatched types here, fall back
2882 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2883 GIMPLE to the following passes. */
2884 if (!is_gimple_reg_type (TREE_TYPE (value
))
2885 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2886 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2888 rhs
= build_zero_cst (TREE_TYPE (p
));
2892 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2893 here since the type of this decl must be visible to the calling
2895 var
= copy_decl_to_var (p
, id
);
2897 /* Declare this new variable. */
2898 DECL_CHAIN (var
) = *vars
;
2901 /* Make gimplifier happy about this variable. */
2902 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2904 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2905 we would not need to create a new variable here at all, if it
2906 weren't for debug info. Still, we can just use the argument
2908 if (TREE_READONLY (p
)
2909 && !TREE_ADDRESSABLE (p
)
2910 && value
&& !TREE_SIDE_EFFECTS (value
)
2913 /* We may produce non-gimple trees by adding NOPs or introduce
2914 invalid sharing when operand is not really constant.
2915 It is not big deal to prohibit constant propagation here as
2916 we will constant propagate in DOM1 pass anyway. */
2917 if (is_gimple_min_invariant (value
)
2918 && useless_type_conversion_p (TREE_TYPE (p
),
2920 /* We have to be very careful about ADDR_EXPR. Make sure
2921 the base variable isn't a local variable of the inlined
2922 function, e.g., when doing recursive inlining, direct or
2923 mutually-recursive or whatever, which is why we don't
2924 just test whether fn == current_function_decl. */
2925 && ! self_inlining_addr_expr (value
, fn
))
2927 insert_decl_map (id
, p
, value
);
2928 insert_debug_decl_map (id
, p
, var
);
2929 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2933 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2934 that way, when the PARM_DECL is encountered, it will be
2935 automatically replaced by the VAR_DECL. */
2936 insert_decl_map (id
, p
, var
);
2938 /* Even if P was TREE_READONLY, the new VAR should not be.
2939 In the original code, we would have constructed a
2940 temporary, and then the function body would have never
2941 changed the value of P. However, now, we will be
2942 constructing VAR directly. The constructor body may
2943 change its value multiple times as it is being
2944 constructed. Therefore, it must not be TREE_READONLY;
2945 the back-end assumes that TREE_READONLY variable is
2946 assigned to only once. */
2947 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2948 TREE_READONLY (var
) = 0;
2950 /* If there is no setup required and we are in SSA, take the easy route
2951 replacing all SSA names representing the function parameter by the
2952 SSA name passed to function.
2954 We need to construct map for the variable anyway as it might be used
2955 in different SSA names when parameter is set in function.
2957 Do replacement at -O0 for const arguments replaced by constant.
2958 This is important for builtin_constant_p and other construct requiring
2959 constant argument to be visible in inlined function body. */
2960 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2962 || (TREE_READONLY (p
)
2963 && is_gimple_min_invariant (rhs
)))
2964 && (TREE_CODE (rhs
) == SSA_NAME
2965 || is_gimple_min_invariant (rhs
))
2966 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2968 insert_decl_map (id
, def
, rhs
);
2969 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2972 /* If the value of argument is never used, don't care about initializing
2974 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2976 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2977 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2980 /* Initialize this VAR_DECL from the equivalent argument. Convert
2981 the argument to the proper type in case it was promoted. */
2984 if (rhs
== error_mark_node
)
2986 insert_decl_map (id
, p
, var
);
2987 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2990 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2992 /* If we are in SSA form properly remap the default definition
2993 or assign to a dummy SSA name if the parameter is unused and
2994 we are not optimizing. */
2995 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2999 def
= remap_ssa_name (def
, id
);
3000 init_stmt
= gimple_build_assign (def
, rhs
);
3001 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3002 set_ssa_default_def (cfun
, var
, NULL
);
3006 def
= make_ssa_name (var
, NULL
);
3007 init_stmt
= gimple_build_assign (def
, rhs
);
3011 init_stmt
= gimple_build_assign (var
, rhs
);
3013 if (bb
&& init_stmt
)
3014 insert_init_stmt (id
, bb
, init_stmt
);
3019 /* Generate code to initialize the parameters of the function at the
3020 top of the stack in ID from the GIMPLE_CALL STMT. */
3023 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
3024 tree fn
, basic_block bb
)
3029 tree vars
= NULL_TREE
;
3030 tree static_chain
= gimple_call_chain (stmt
);
3032 /* Figure out what the parameters are. */
3033 parms
= DECL_ARGUMENTS (fn
);
3035 /* Loop through the parameter declarations, replacing each with an
3036 equivalent VAR_DECL, appropriately initialized. */
3037 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3040 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3041 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3043 /* After remapping parameters remap their types. This has to be done
3044 in a second loop over all parameters to appropriately remap
3045 variable sized arrays when the size is specified in a
3046 parameter following the array. */
3047 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3049 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
3051 && TREE_CODE (*varp
) == VAR_DECL
)
3053 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3054 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3056 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3057 /* Also remap the default definition if it was remapped
3058 to the default definition of the parameter replacement
3059 by the parameter setup. */
3062 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
3064 && TREE_CODE (*defp
) == SSA_NAME
3065 && SSA_NAME_VAR (*defp
) == var
)
3066 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3071 /* Initialize the static chain. */
3072 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3073 gcc_assert (fn
!= current_function_decl
);
3076 /* No static chain? Seems like a bug in tree-nested.c. */
3077 gcc_assert (static_chain
);
3079 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3082 declare_inline_vars (id
->block
, vars
);
3086 /* Declare a return variable to replace the RESULT_DECL for the
3087 function we are calling. An appropriate DECL_STMT is returned.
3088 The USE_STMT is filled to contain a use of the declaration to
3089 indicate the return value of the function.
3091 RETURN_SLOT, if non-null is place where to store the result. It
3092 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3093 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3095 The return value is a (possibly null) value that holds the result
3096 as seen by the caller. */
3099 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3100 basic_block entry_bb
)
3102 tree callee
= id
->src_fn
;
3103 tree result
= DECL_RESULT (callee
);
3104 tree callee_type
= TREE_TYPE (result
);
3108 /* Handle type-mismatches in the function declaration return type
3109 vs. the call expression. */
3111 caller_type
= TREE_TYPE (modify_dest
);
3113 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3115 /* We don't need to do anything for functions that don't return anything. */
3116 if (VOID_TYPE_P (callee_type
))
3119 /* If there was a return slot, then the return value is the
3120 dereferenced address of that object. */
3123 /* The front end shouldn't have used both return_slot and
3124 a modify expression. */
3125 gcc_assert (!modify_dest
);
3126 if (DECL_BY_REFERENCE (result
))
3128 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3129 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3131 /* We are going to construct *&return_slot and we can't do that
3132 for variables believed to be not addressable.
3134 FIXME: This check possibly can match, because values returned
3135 via return slot optimization are not believed to have address
3136 taken by alias analysis. */
3137 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3138 var
= return_slot_addr
;
3143 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3144 if (TREE_ADDRESSABLE (result
))
3145 mark_addressable (var
);
3147 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3148 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3149 && !DECL_GIMPLE_REG_P (result
)
3151 DECL_GIMPLE_REG_P (var
) = 0;
3156 /* All types requiring non-trivial constructors should have been handled. */
3157 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3159 /* Attempt to avoid creating a new temporary variable. */
3161 && TREE_CODE (modify_dest
) != SSA_NAME
)
3163 bool use_it
= false;
3165 /* We can't use MODIFY_DEST if there's type promotion involved. */
3166 if (!useless_type_conversion_p (callee_type
, caller_type
))
3169 /* ??? If we're assigning to a variable sized type, then we must
3170 reuse the destination variable, because we've no good way to
3171 create variable sized temporaries at this point. */
3172 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3175 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3176 reuse it as the result of the call directly. Don't do this if
3177 it would promote MODIFY_DEST to addressable. */
3178 else if (TREE_ADDRESSABLE (result
))
3182 tree base_m
= get_base_address (modify_dest
);
3184 /* If the base isn't a decl, then it's a pointer, and we don't
3185 know where that's going to go. */
3186 if (!DECL_P (base_m
))
3188 else if (is_global_var (base_m
))
3190 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3191 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3192 && !DECL_GIMPLE_REG_P (result
)
3193 && DECL_GIMPLE_REG_P (base_m
))
3195 else if (!TREE_ADDRESSABLE (base_m
))
3207 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3209 var
= copy_result_decl_to_var (result
, id
);
3210 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3212 /* Do not have the rest of GCC warn about this variable as it should
3213 not be visible to the user. */
3214 TREE_NO_WARNING (var
) = 1;
3216 declare_inline_vars (id
->block
, var
);
3218 /* Build the use expr. If the return type of the function was
3219 promoted, convert it back to the expected type. */
3221 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3223 /* If we can match up types by promotion/demotion do so. */
3224 if (fold_convertible_p (caller_type
, var
))
3225 use
= fold_convert (caller_type
, var
);
3228 /* ??? For valid programs we should not end up here.
3229 Still if we end up with truly mismatched types here, fall back
3230 to using a MEM_REF to not leak invalid GIMPLE to the following
3232 /* Prevent var from being written into SSA form. */
3233 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3234 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3235 DECL_GIMPLE_REG_P (var
) = false;
3236 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3237 TREE_ADDRESSABLE (var
) = true;
3238 use
= fold_build2 (MEM_REF
, caller_type
,
3239 build_fold_addr_expr (var
),
3240 build_int_cst (ptr_type_node
, 0));
3244 STRIP_USELESS_TYPE_CONVERSION (use
);
3246 if (DECL_BY_REFERENCE (result
))
3248 TREE_ADDRESSABLE (var
) = 1;
3249 var
= build_fold_addr_expr (var
);
3253 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3254 way, when the RESULT_DECL is encountered, it will be
3255 automatically replaced by the VAR_DECL.
3257 When returning by reference, ensure that RESULT_DECL remaps to
3259 if (DECL_BY_REFERENCE (result
)
3260 && !is_gimple_val (var
))
3262 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3263 insert_decl_map (id
, result
, temp
);
3264 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3265 it's default_def SSA_NAME. */
3266 if (gimple_in_ssa_p (id
->src_cfun
)
3267 && is_gimple_reg (result
))
3269 temp
= make_ssa_name (temp
, NULL
);
3270 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3272 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3275 insert_decl_map (id
, result
, var
);
3277 /* Remember this so we can ignore it in remap_decls. */
3283 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3284 to a local label. */
3287 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3290 tree fn
= (tree
) fnp
;
3292 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3301 /* Determine if the function can be copied. If so return NULL. If
3302 not return a string describng the reason for failure. */
3305 copy_forbidden (struct function
*fun
, tree fndecl
)
3307 const char *reason
= fun
->cannot_be_copied_reason
;
3311 /* Only examine the function once. */
3312 if (fun
->cannot_be_copied_set
)
3315 /* We cannot copy a function that receives a non-local goto
3316 because we cannot remap the destination label used in the
3317 function that is performing the non-local goto. */
3318 /* ??? Actually, this should be possible, if we work at it.
3319 No doubt there's just a handful of places that simply
3320 assume it doesn't happen and don't substitute properly. */
3321 if (fun
->has_nonlocal_label
)
3323 reason
= G_("function %q+F can never be copied "
3324 "because it receives a non-local goto");
3328 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3329 if (TREE_CODE (decl
) == VAR_DECL
3330 && TREE_STATIC (decl
)
3331 && !DECL_EXTERNAL (decl
)
3332 && DECL_INITIAL (decl
)
3333 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3334 has_label_address_in_static_1
,
3337 reason
= G_("function %q+F can never be copied because it saves "
3338 "address of local label in a static variable");
3343 fun
->cannot_be_copied_reason
= reason
;
3344 fun
->cannot_be_copied_set
= true;
3349 static const char *inline_forbidden_reason
;
3351 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3352 iff a function can not be inlined. Also sets the reason why. */
3355 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3356 struct walk_stmt_info
*wip
)
3358 tree fn
= (tree
) wip
->info
;
3360 gimple stmt
= gsi_stmt (*gsi
);
3362 switch (gimple_code (stmt
))
3365 /* Refuse to inline alloca call unless user explicitly forced so as
3366 this may change program's memory overhead drastically when the
3367 function using alloca is called in loop. In GCC present in
3368 SPEC2000 inlining into schedule_block cause it to require 2GB of
3369 RAM instead of 256MB. Don't do so for alloca calls emitted for
3370 VLA objects as those can't cause unbounded growth (they're always
3371 wrapped inside stack_save/stack_restore regions. */
3372 if (gimple_alloca_call_p (stmt
)
3373 && !gimple_call_alloca_for_var_p (stmt
)
3374 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3376 inline_forbidden_reason
3377 = G_("function %q+F can never be inlined because it uses "
3378 "alloca (override using the always_inline attribute)");
3379 *handled_ops_p
= true;
3383 t
= gimple_call_fndecl (stmt
);
3387 /* We cannot inline functions that call setjmp. */
3388 if (setjmp_call_p (t
))
3390 inline_forbidden_reason
3391 = G_("function %q+F can never be inlined because it uses setjmp");
3392 *handled_ops_p
= true;
3396 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3397 switch (DECL_FUNCTION_CODE (t
))
3399 /* We cannot inline functions that take a variable number of
3401 case BUILT_IN_VA_START
:
3402 case BUILT_IN_NEXT_ARG
:
3403 case BUILT_IN_VA_END
:
3404 inline_forbidden_reason
3405 = G_("function %q+F can never be inlined because it "
3406 "uses variable argument lists");
3407 *handled_ops_p
= true;
3410 case BUILT_IN_LONGJMP
:
3411 /* We can't inline functions that call __builtin_longjmp at
3412 all. The non-local goto machinery really requires the
3413 destination be in a different function. If we allow the
3414 function calling __builtin_longjmp to be inlined into the
3415 function calling __builtin_setjmp, Things will Go Awry. */
3416 inline_forbidden_reason
3417 = G_("function %q+F can never be inlined because "
3418 "it uses setjmp-longjmp exception handling");
3419 *handled_ops_p
= true;
3422 case BUILT_IN_NONLOCAL_GOTO
:
3424 inline_forbidden_reason
3425 = G_("function %q+F can never be inlined because "
3426 "it uses non-local goto");
3427 *handled_ops_p
= true;
3430 case BUILT_IN_RETURN
:
3431 case BUILT_IN_APPLY_ARGS
:
3432 /* If a __builtin_apply_args caller would be inlined,
3433 it would be saving arguments of the function it has
3434 been inlined into. Similarly __builtin_return would
3435 return from the function the inline has been inlined into. */
3436 inline_forbidden_reason
3437 = G_("function %q+F can never be inlined because "
3438 "it uses __builtin_return or __builtin_apply_args");
3439 *handled_ops_p
= true;
3448 t
= gimple_goto_dest (stmt
);
3450 /* We will not inline a function which uses computed goto. The
3451 addresses of its local labels, which may be tucked into
3452 global storage, are of course not constant across
3453 instantiations, which causes unexpected behavior. */
3454 if (TREE_CODE (t
) != LABEL_DECL
)
3456 inline_forbidden_reason
3457 = G_("function %q+F can never be inlined "
3458 "because it contains a computed goto");
3459 *handled_ops_p
= true;
3468 *handled_ops_p
= false;
3472 /* Return true if FNDECL is a function that cannot be inlined into
3476 inline_forbidden_p (tree fndecl
)
3478 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3479 struct walk_stmt_info wi
;
3480 struct pointer_set_t
*visited_nodes
;
3482 bool forbidden_p
= false;
3484 /* First check for shared reasons not to copy the code. */
3485 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3486 if (inline_forbidden_reason
!= NULL
)
3489 /* Next, walk the statements of the function looking for
3490 constraucts we can't handle, or are non-optimal for inlining. */
3491 visited_nodes
= pointer_set_create ();
3492 memset (&wi
, 0, sizeof (wi
));
3493 wi
.info
= (void *) fndecl
;
3494 wi
.pset
= visited_nodes
;
3496 FOR_EACH_BB_FN (bb
, fun
)
3499 gimple_seq seq
= bb_seq (bb
);
3500 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3501 forbidden_p
= (ret
!= NULL
);
3506 pointer_set_destroy (visited_nodes
);
3510 /* Return false if the function FNDECL cannot be inlined on account of its
3511 attributes, true otherwise. */
3513 function_attribute_inlinable_p (const_tree fndecl
)
3515 if (targetm
.attribute_table
)
3519 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3521 const_tree name
= TREE_PURPOSE (a
);
3524 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3525 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3526 return targetm
.function_attribute_inlinable_p (fndecl
);
3533 /* Returns nonzero if FN is a function that does not have any
3534 fundamental inline blocking properties. */
3537 tree_inlinable_function_p (tree fn
)
3539 bool inlinable
= true;
3543 /* If we've already decided this function shouldn't be inlined,
3544 there's no need to check again. But the cached bit from analysis
3545 can be reset during decl merge in multi-module compilation (C FE only).
3546 The problem is we can not really use a 2 state cached value --
3547 can not tell the init state (unknown value) from a computed value. */
3548 if (DECL_UNINLINABLE (fn
)
3549 && (!L_IPO_COMP_MODE
3550 || lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))))
3553 /* We only warn for functions declared `inline' by the user. */
3554 do_warning
= (warn_inline
3555 && DECL_DECLARED_INLINE_P (fn
)
3556 && !DECL_NO_INLINE_WARNING_P (fn
)
3557 && !DECL_IN_SYSTEM_HEADER (fn
));
3559 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3562 && always_inline
== NULL
)
3565 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3566 "is suppressed using -fno-inline", fn
);
3570 else if (!function_attribute_inlinable_p (fn
))
3573 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3574 "uses attributes conflicting with inlining", fn
);
3578 else if (inline_forbidden_p (fn
))
3580 /* See if we should warn about uninlinable functions. Previously,
3581 some of these warnings would be issued while trying to expand
3582 the function inline, but that would cause multiple warnings
3583 about functions that would for example call alloca. But since
3584 this a property of the function, just one warning is enough.
3585 As a bonus we can now give more details about the reason why a
3586 function is not inlinable. */
3588 error (inline_forbidden_reason
, fn
);
3589 else if (do_warning
)
3590 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3595 /* Squirrel away the result so that we don't have to check again. */
3596 DECL_UNINLINABLE (fn
) = !inlinable
;
3601 /* Estimate the cost of a memory move. Use machine dependent
3602 word size and take possible memcpy call into account. */
3605 estimate_move_cost (tree type
)
3609 gcc_assert (!VOID_TYPE_P (type
));
3611 if (TREE_CODE (type
) == VECTOR_TYPE
)
3613 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3614 enum machine_mode simd
3615 = targetm
.vectorize
.preferred_simd_mode (inner
);
3616 int simd_mode_size
= GET_MODE_SIZE (simd
);
3617 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3621 size
= int_size_in_bytes (type
);
3623 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3624 /* Cost of a memcpy call, 3 arguments and the call. */
3627 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3630 /* Returns cost of operation CODE, according to WEIGHTS */
3633 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3634 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3638 /* These are "free" conversions, or their presumed cost
3639 is folded into other operations. */
3644 case VIEW_CONVERT_EXPR
:
3647 /* Assign cost of 1 to usual operations.
3648 ??? We may consider mapping RTL costs to this. */
3654 case POINTER_PLUS_EXPR
:
3657 case MULT_HIGHPART_EXPR
:
3660 case ADDR_SPACE_CONVERT_EXPR
:
3661 case FIXED_CONVERT_EXPR
:
3662 case FIX_TRUNC_EXPR
:
3674 case VEC_LSHIFT_EXPR
:
3675 case VEC_RSHIFT_EXPR
:
3682 case TRUTH_ANDIF_EXPR
:
3683 case TRUTH_ORIF_EXPR
:
3684 case TRUTH_AND_EXPR
:
3686 case TRUTH_XOR_EXPR
:
3687 case TRUTH_NOT_EXPR
:
3696 case UNORDERED_EXPR
:
3707 case PREDECREMENT_EXPR
:
3708 case PREINCREMENT_EXPR
:
3709 case POSTDECREMENT_EXPR
:
3710 case POSTINCREMENT_EXPR
:
3712 case REALIGN_LOAD_EXPR
:
3714 case REDUC_MAX_EXPR
:
3715 case REDUC_MIN_EXPR
:
3716 case REDUC_PLUS_EXPR
:
3717 case WIDEN_SUM_EXPR
:
3718 case WIDEN_MULT_EXPR
:
3721 case WIDEN_MULT_PLUS_EXPR
:
3722 case WIDEN_MULT_MINUS_EXPR
:
3723 case WIDEN_LSHIFT_EXPR
:
3725 case VEC_WIDEN_MULT_HI_EXPR
:
3726 case VEC_WIDEN_MULT_LO_EXPR
:
3727 case VEC_WIDEN_MULT_EVEN_EXPR
:
3728 case VEC_WIDEN_MULT_ODD_EXPR
:
3729 case VEC_UNPACK_HI_EXPR
:
3730 case VEC_UNPACK_LO_EXPR
:
3731 case VEC_UNPACK_FLOAT_HI_EXPR
:
3732 case VEC_UNPACK_FLOAT_LO_EXPR
:
3733 case VEC_PACK_TRUNC_EXPR
:
3734 case VEC_PACK_SAT_EXPR
:
3735 case VEC_PACK_FIX_TRUNC_EXPR
:
3736 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3737 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3741 /* Few special cases of expensive operations. This is useful
3742 to avoid inlining on functions having too many of these. */
3743 case TRUNC_DIV_EXPR
:
3745 case FLOOR_DIV_EXPR
:
3746 case ROUND_DIV_EXPR
:
3747 case EXACT_DIV_EXPR
:
3748 case TRUNC_MOD_EXPR
:
3750 case FLOOR_MOD_EXPR
:
3751 case ROUND_MOD_EXPR
:
3753 if (TREE_CODE (op2
) != INTEGER_CST
)
3754 return weights
->div_mod_cost
;
3758 /* We expect a copy assignment with no operator. */
3759 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3765 /* Estimate number of instructions that will be created by expanding
3766 the statements in the statement sequence STMTS.
3767 WEIGHTS contains weights attributed to various constructs. */
3770 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3773 gimple_stmt_iterator gsi
;
3776 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3777 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3783 /* Estimate number of instructions that will be created by expanding STMT.
3784 WEIGHTS contains weights attributed to various constructs. */
3787 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3790 enum gimple_code code
= gimple_code (stmt
);
3797 /* Try to estimate the cost of assignments. We have three cases to
3799 1) Simple assignments to registers;
3800 2) Stores to things that must live in memory. This includes
3801 "normal" stores to scalars, but also assignments of large
3802 structures, or constructors of big arrays;
3804 Let us look at the first two cases, assuming we have "a = b + C":
3805 <GIMPLE_ASSIGN <var_decl "a">
3806 <plus_expr <var_decl "b"> <constant C>>
3807 If "a" is a GIMPLE register, the assignment to it is free on almost
3808 any target, because "a" usually ends up in a real register. Hence
3809 the only cost of this expression comes from the PLUS_EXPR, and we
3810 can ignore the GIMPLE_ASSIGN.
3811 If "a" is not a GIMPLE register, the assignment to "a" will most
3812 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3813 of moving something into "a", which we compute using the function
3814 estimate_move_cost. */
3815 if (gimple_clobber_p (stmt
))
3816 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3818 lhs
= gimple_assign_lhs (stmt
);
3819 rhs
= gimple_assign_rhs1 (stmt
);
3823 /* Account for the cost of moving to / from memory. */
3824 if (gimple_store_p (stmt
))
3825 cost
+= estimate_move_cost (TREE_TYPE (lhs
));
3826 if (gimple_assign_load_p (stmt
))
3827 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3829 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3830 gimple_assign_rhs1 (stmt
),
3831 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3832 == GIMPLE_BINARY_RHS
3833 ? gimple_assign_rhs2 (stmt
) : NULL
);
3837 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3838 gimple_op (stmt
, 0),
3839 gimple_op (stmt
, 1));
3843 /* Take into account cost of the switch + guess 2 conditional jumps for
3846 TODO: once the switch expansion logic is sufficiently separated, we can
3847 do better job on estimating cost of the switch. */
3848 if (weights
->time_based
)
3849 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3851 cost
= gimple_switch_num_labels (stmt
) * 2;
3858 if (gimple_call_internal_p (stmt
))
3860 else if ((decl
= gimple_call_fndecl (stmt
))
3861 && DECL_BUILT_IN (decl
))
3863 /* Do not special case builtins where we see the body.
3864 This just confuse inliner. */
3865 struct cgraph_node
*node
;
3866 if (!(node
= cgraph_get_node (decl
))
3867 || node
->definition
)
3869 /* For buitins that are likely expanded to nothing or
3870 inlined do not account operand costs. */
3871 else if (is_simple_builtin (decl
))
3873 else if (is_inexpensive_builtin (decl
))
3874 return weights
->target_builtin_call_cost
;
3875 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3877 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3878 specialize the cheap expansion we do here.
3879 ??? This asks for a more general solution. */
3880 switch (DECL_FUNCTION_CODE (decl
))
3885 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3886 && REAL_VALUES_EQUAL
3887 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3888 return estimate_operator_cost
3889 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
3890 gimple_call_arg (stmt
, 0));
3899 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
3900 if (gimple_call_lhs (stmt
))
3901 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3902 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3904 tree arg
= gimple_call_arg (stmt
, i
);
3905 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3911 return weights
->return_cost
;
3917 case GIMPLE_PREDICT
:
3923 int count
= asm_str_count (gimple_asm_string (stmt
));
3924 /* 1000 means infinity. This avoids overflows later
3925 with very long asm statements. */
3932 /* This is either going to be an external function call with one
3933 argument, or two register copy statements plus a goto. */
3936 case GIMPLE_EH_DISPATCH
:
3937 /* ??? This is going to turn into a switch statement. Ideally
3938 we'd have a look at the eh region and estimate the number of
3943 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3945 case GIMPLE_EH_FILTER
:
3946 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3949 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3952 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3953 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3955 /* OpenMP directives are generally very expensive. */
3957 case GIMPLE_OMP_RETURN
:
3958 case GIMPLE_OMP_SECTIONS_SWITCH
:
3959 case GIMPLE_OMP_ATOMIC_STORE
:
3960 case GIMPLE_OMP_CONTINUE
:
3961 /* ...except these, which are cheap. */
3964 case GIMPLE_OMP_ATOMIC_LOAD
:
3965 return weights
->omp_cost
;
3967 case GIMPLE_OMP_FOR
:
3968 return (weights
->omp_cost
3969 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3970 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3972 case GIMPLE_OMP_PARALLEL
:
3973 case GIMPLE_OMP_TASK
:
3974 case GIMPLE_OMP_CRITICAL
:
3975 case GIMPLE_OMP_MASTER
:
3976 case GIMPLE_OMP_TASKGROUP
:
3977 case GIMPLE_OMP_ORDERED
:
3978 case GIMPLE_OMP_SECTION
:
3979 case GIMPLE_OMP_SECTIONS
:
3980 case GIMPLE_OMP_SINGLE
:
3981 case GIMPLE_OMP_TARGET
:
3982 case GIMPLE_OMP_TEAMS
:
3983 return (weights
->omp_cost
3984 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3986 case GIMPLE_TRANSACTION
:
3987 return (weights
->tm_cost
3988 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3998 /* Estimate number of instructions that will be created by expanding
3999 function FNDECL. WEIGHTS contains weights attributed to various
4003 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4005 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4006 gimple_stmt_iterator bsi
;
4010 gcc_assert (my_function
&& my_function
->cfg
);
4011 FOR_EACH_BB_FN (bb
, my_function
)
4013 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4014 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4021 /* Initializes weights used by estimate_num_insns. */
4024 init_inline_once (void)
4026 eni_size_weights
.call_cost
= 1;
4027 eni_size_weights
.indirect_call_cost
= 3;
4028 eni_size_weights
.target_builtin_call_cost
= 1;
4029 eni_size_weights
.div_mod_cost
= 1;
4030 eni_size_weights
.omp_cost
= 40;
4031 eni_size_weights
.tm_cost
= 10;
4032 eni_size_weights
.time_based
= false;
4033 eni_size_weights
.return_cost
= 1;
4035 /* Estimating time for call is difficult, since we have no idea what the
4036 called function does. In the current uses of eni_time_weights,
4037 underestimating the cost does less harm than overestimating it, so
4038 we choose a rather small value here. */
4039 eni_time_weights
.call_cost
= 10;
4040 eni_time_weights
.indirect_call_cost
= 15;
4041 eni_time_weights
.target_builtin_call_cost
= 1;
4042 eni_time_weights
.div_mod_cost
= 10;
4043 eni_time_weights
.omp_cost
= 40;
4044 eni_time_weights
.tm_cost
= 40;
4045 eni_time_weights
.time_based
= true;
4046 eni_time_weights
.return_cost
= 2;
4049 /* Estimate the number of instructions in a gimple_seq. */
4052 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
4054 gimple_stmt_iterator gsi
;
4056 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4057 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4063 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4066 prepend_lexical_block (tree current_block
, tree new_block
)
4068 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4069 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4070 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4073 /* Add local variables from CALLEE to CALLER. */
4076 add_local_variables (struct function
*callee
, struct function
*caller
,
4082 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4083 if (!can_be_nonlocal (var
, id
))
4085 tree new_var
= remap_decl (var
, id
);
4087 /* Remap debug-expressions. */
4088 if (TREE_CODE (new_var
) == VAR_DECL
4089 && DECL_HAS_DEBUG_EXPR_P (var
)
4092 tree tem
= DECL_DEBUG_EXPR (var
);
4093 bool old_regimplify
= id
->regimplify
;
4095 /* The mapped debug expression might be deleted
4096 as a varpool node (the reachbility analysis
4097 of varpool node does not check the reference
4098 from debug expressions.
4099 Set it to 0 for all global vars. */
4100 if (L_IPO_COMP_MODE
&& tem
&& TREE_CODE (tem
) == VAR_DECL
4101 && is_global_var (tem
))
4104 id
->remapping_type_depth
++;
4105 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4106 id
->remapping_type_depth
--;
4107 id
->regimplify
= old_regimplify
;
4108 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4109 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4111 add_local_decl (caller
, new_var
);
4115 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4118 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
4122 struct pointer_map_t
*st
, *dst
;
4125 location_t saved_location
;
4126 struct cgraph_edge
*cg_edge
;
4127 cgraph_inline_failed_t reason
;
4128 basic_block return_block
;
4130 gimple_stmt_iterator gsi
, stmt_gsi
;
4131 bool successfully_inlined
= FALSE
;
4132 bool purge_dead_abnormal_edges
;
4134 /* Set input_location here so we get the right instantiation context
4135 if we call instantiate_decl from inlinable_function_p. */
4136 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
4137 saved_location
= input_location
;
4138 input_location
= gimple_location (stmt
);
4140 /* From here on, we're only interested in CALL_EXPRs. */
4141 if (gimple_code (stmt
) != GIMPLE_CALL
)
4144 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
4145 gcc_checking_assert (cg_edge
);
4146 /* First, see if we can figure out what function is being called.
4147 If we cannot, then there is no hope of inlining the function. */
4148 if (cg_edge
->indirect_unknown_callee
)
4150 fn
= cg_edge
->callee
->decl
;
4151 gcc_checking_assert (fn
);
4153 /* If FN is a declaration of a function in a nested scope that was
4154 globally declared inline, we don't set its DECL_INITIAL.
4155 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4156 C++ front-end uses it for cdtors to refer to their internal
4157 declarations, that are not real functions. Fortunately those
4158 don't have trees to be saved, so we can tell by checking their
4160 if (!DECL_INITIAL (fn
)
4161 && DECL_ABSTRACT_ORIGIN (fn
)
4162 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4163 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4165 /* Don't try to inline functions that are not well-suited to inlining. */
4166 if (cg_edge
->inline_failed
)
4168 reason
= cg_edge
->inline_failed
;
4169 /* If this call was originally indirect, we do not want to emit any
4170 inlining related warnings or sorry messages because there are no
4171 guarantees regarding those. */
4172 if (cg_edge
->indirect_inlining_edge
)
4175 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4176 /* For extern inline functions that get redefined we always
4177 silently ignored always_inline flag. Better behaviour would
4178 be to be able to keep both bodies and use extern inline body
4179 for inlining, but we can't do that because frontends overwrite
4181 && !cg_edge
->callee
->local
.redefined_extern_inline
4182 /* During early inline pass, report only when optimization is
4184 && (cgraph_global_info_ready
4186 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4187 /* PR 20090218-1_0.c. Body can be provided by another module. */
4188 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4190 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4191 cgraph_inline_failed_string (reason
));
4192 error ("called from here");
4194 else if (warn_inline
4195 && DECL_DECLARED_INLINE_P (fn
)
4196 && !DECL_NO_INLINE_WARNING_P (fn
)
4197 && !DECL_IN_SYSTEM_HEADER (fn
)
4198 && reason
!= CIF_UNSPECIFIED
4199 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4200 /* Do not warn about not inlined recursive calls. */
4201 && !cgraph_edge_recursive_p (cg_edge
)
4202 /* Avoid warnings during early inline pass. */
4203 && cgraph_global_info_ready
)
4205 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4206 fn
, _(cgraph_inline_failed_string (reason
)));
4207 warning (OPT_Winline
, "called from here");
4211 fn
= cg_edge
->callee
->decl
;
4212 cgraph_get_body (cg_edge
->callee
);
4214 #ifdef ENABLE_CHECKING
4215 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4216 verify_cgraph_node (cg_edge
->callee
);
4219 /* We will be inlining this callee. */
4220 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4222 /* Update the callers EH personality. */
4223 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4224 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4225 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4227 /* Split the block holding the GIMPLE_CALL. */
4228 e
= split_block (bb
, stmt
);
4230 return_block
= e
->dest
;
4233 /* split_block splits after the statement; work around this by
4234 moving the call into the second block manually. Not pretty,
4235 but seems easier than doing the CFG manipulation by hand
4236 when the GIMPLE_CALL is in the last statement of BB. */
4237 stmt_gsi
= gsi_last_bb (bb
);
4238 gsi_remove (&stmt_gsi
, false);
4240 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4241 been the source of abnormal edges. In this case, schedule
4242 the removal of dead abnormal edges. */
4243 gsi
= gsi_start_bb (return_block
);
4244 if (gsi_end_p (gsi
))
4246 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4247 purge_dead_abnormal_edges
= true;
4251 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4252 purge_dead_abnormal_edges
= false;
4255 stmt_gsi
= gsi_start_bb (return_block
);
4257 /* Build a block containing code to initialize the arguments, the
4258 actual inline expansion of the body, and a label for the return
4259 statements within the function to jump to. The type of the
4260 statement expression is the return type of the function call.
4261 ??? If the call does not have an associated block then we will
4262 remap all callee blocks to NULL, effectively dropping most of
4263 its debug information. This should only happen for calls to
4264 artificial decls inserted by the compiler itself. We need to
4265 either link the inlined blocks into the caller block tree or
4266 not refer to them in any way to not break GC for locations. */
4267 if (gimple_block (stmt
))
4269 id
->block
= make_node (BLOCK
);
4270 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4271 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
4272 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4275 /* Local declarations will be replaced by their equivalents in this
4278 id
->decl_map
= pointer_map_create ();
4279 dst
= id
->debug_map
;
4280 id
->debug_map
= NULL
;
4282 /* Record the function we are about to inline. */
4284 id
->src_node
= cg_edge
->callee
;
4285 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4286 id
->gimple_call
= stmt
;
4288 gcc_assert (!id
->src_cfun
->after_inlining
);
4291 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4293 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4294 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4298 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4300 if (DECL_INITIAL (fn
))
4302 if (gimple_block (stmt
))
4306 prepend_lexical_block (id
->block
,
4307 remap_blocks (DECL_INITIAL (fn
), id
));
4308 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4309 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4311 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4312 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4313 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4314 under it. The parameters can be then evaluated in the debugger,
4315 but don't show in backtraces. */
4316 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4317 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4320 *var
= TREE_CHAIN (v
);
4321 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4322 BLOCK_VARS (id
->block
) = v
;
4325 var
= &TREE_CHAIN (*var
);
4328 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4331 /* Return statements in the function body will be replaced by jumps
4332 to the RET_LABEL. */
4333 gcc_assert (DECL_INITIAL (fn
));
4334 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4336 /* Find the LHS to which the result of this call is assigned. */
4338 if (gimple_call_lhs (stmt
))
4340 modify_dest
= gimple_call_lhs (stmt
);
4342 /* The function which we are inlining might not return a value,
4343 in which case we should issue a warning that the function
4344 does not return a value. In that case the optimizers will
4345 see that the variable to which the value is assigned was not
4346 initialized. We do not want to issue a warning about that
4347 uninitialized variable. */
4348 if (DECL_P (modify_dest
))
4349 TREE_NO_WARNING (modify_dest
) = 1;
4351 if (gimple_call_return_slot_opt_p (stmt
))
4353 return_slot
= modify_dest
;
4360 /* If we are inlining a call to the C++ operator new, we don't want
4361 to use type based alias analysis on the return value. Otherwise
4362 we may get confused if the compiler sees that the inlined new
4363 function returns a pointer which was just deleted. See bug
4365 if (DECL_IS_OPERATOR_NEW (fn
))
4371 /* Declare the return variable for the function. */
4372 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4374 /* Add local vars in this inlined callee to caller. */
4375 add_local_variables (id
->src_cfun
, cfun
, id
);
4377 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4379 fprintf (dump_file
, "Inlining ");
4380 print_generic_expr (dump_file
, id
->src_fn
, 0);
4381 fprintf (dump_file
, " to ");
4382 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4383 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4386 /* This is it. Duplicate the callee body. Assume callee is
4387 pre-gimplified. Note that we must not alter the caller
4388 function in any way before this point, as this CALL_EXPR may be
4389 a self-referential call; if we're calling ourselves, we need to
4390 duplicate our body before altering anything. */
4391 copy_body (id
, MIN (cg_edge
->count
, cg_edge
->callee
->count
),
4392 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4393 bb
, return_block
, NULL
);
4395 /* Reset the escaped solution. */
4396 if (cfun
->gimple_df
)
4397 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4402 pointer_map_destroy (id
->debug_map
);
4403 id
->debug_map
= dst
;
4405 pointer_map_destroy (id
->decl_map
);
4408 /* Unlink the calls virtual operands before replacing it. */
4409 unlink_stmt_vdef (stmt
);
4410 if (gimple_vdef (stmt
)
4411 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4412 release_ssa_name (gimple_vdef (stmt
));
4414 /* If the inlined function returns a result that we care about,
4415 substitute the GIMPLE_CALL with an assignment of the return
4416 variable to the LHS of the call. That is, if STMT was
4417 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4418 if (use_retvar
&& gimple_call_lhs (stmt
))
4420 gimple old_stmt
= stmt
;
4421 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4422 gsi_replace (&stmt_gsi
, stmt
, false);
4423 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4427 /* Handle the case of inlining a function with no return
4428 statement, which causes the return value to become undefined. */
4429 if (gimple_call_lhs (stmt
)
4430 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4432 tree name
= gimple_call_lhs (stmt
);
4433 tree var
= SSA_NAME_VAR (name
);
4434 tree def
= ssa_default_def (cfun
, var
);
4438 /* If the variable is used undefined, make this name
4439 undefined via a move. */
4440 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4441 gsi_replace (&stmt_gsi
, stmt
, true);
4445 /* Otherwise make this variable undefined. */
4446 gsi_remove (&stmt_gsi
, true);
4447 set_ssa_default_def (cfun
, var
, name
);
4448 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4452 gsi_remove (&stmt_gsi
, true);
4455 if (purge_dead_abnormal_edges
)
4457 gimple_purge_dead_eh_edges (return_block
);
4458 gimple_purge_dead_abnormal_call_edges (return_block
);
4461 /* If the value of the new expression is ignored, that's OK. We
4462 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4463 the equivalent inlined version either. */
4464 if (is_gimple_assign (stmt
))
4466 gcc_assert (gimple_assign_single_p (stmt
)
4467 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4468 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4471 /* Output the inlining info for this abstract function, since it has been
4472 inlined. If we don't do this now, we can lose the information about the
4473 variables in the function when the blocks get blown away as soon as we
4474 remove the cgraph node. */
4475 if (gimple_block (stmt
))
4476 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4478 /* Update callgraph if needed. */
4479 cgraph_remove_node (cg_edge
->callee
);
4481 id
->block
= NULL_TREE
;
4482 successfully_inlined
= TRUE
;
4485 input_location
= saved_location
;
4486 return successfully_inlined
;
4489 /* Expand call statements reachable from STMT_P.
4490 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4491 in a MODIFY_EXPR. */
4494 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4496 gimple_stmt_iterator gsi
;
4498 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4500 gimple stmt
= gsi_stmt (gsi
);
4502 if (is_gimple_call (stmt
)
4503 && !gimple_call_internal_p (stmt
)
4504 && expand_call_inline (bb
, stmt
, id
))
4512 /* Walk all basic blocks created after FIRST and try to fold every statement
4513 in the STATEMENTS pointer set. */
4516 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4518 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4519 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4521 gimple_stmt_iterator gsi
;
4523 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4526 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4528 gimple old_stmt
= gsi_stmt (gsi
);
4529 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4531 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4533 /* Folding builtins can create multiple instructions,
4534 we need to look at all of them. */
4535 gimple_stmt_iterator i2
= gsi
;
4537 if (fold_stmt (&gsi
))
4540 /* If a builtin at the end of a bb folded into nothing,
4541 the following loop won't work. */
4542 if (gsi_end_p (gsi
))
4544 cgraph_update_edges_for_call_stmt (old_stmt
,
4549 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4554 new_stmt
= gsi_stmt (i2
);
4555 update_stmt (new_stmt
);
4556 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4559 if (new_stmt
== gsi_stmt (gsi
))
4561 /* It is okay to check only for the very last
4562 of these statements. If it is a throwing
4563 statement nothing will change. If it isn't
4564 this can remove EH edges. If that weren't
4565 correct then because some intermediate stmts
4566 throw, but not the last one. That would mean
4567 we'd have to split the block, which we can't
4568 here and we'd loose anyway. And as builtins
4569 probably never throw, this all
4571 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4573 gimple_purge_dead_eh_edges (
4574 BASIC_BLOCK_FOR_FN (cfun
, first
));
4581 else if (fold_stmt (&gsi
))
4583 /* Re-read the statement from GSI as fold_stmt() may
4585 gimple new_stmt
= gsi_stmt (gsi
);
4586 update_stmt (new_stmt
);
4588 if (is_gimple_call (old_stmt
)
4589 || is_gimple_call (new_stmt
))
4590 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4593 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4594 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
4601 /* Expand calls to inline functions in the body of FN. */
4604 optimize_inline_calls (tree fn
)
4608 int last
= n_basic_blocks_for_fn (cfun
);
4609 bool inlined_p
= false;
4612 memset (&id
, 0, sizeof (id
));
4614 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4615 gcc_assert (id
.dst_node
->definition
);
4617 /* Or any functions that aren't finished yet. */
4618 if (current_function_decl
)
4619 id
.dst_fn
= current_function_decl
;
4621 id
.copy_decl
= copy_decl_maybe_to_var
;
4622 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4623 id
.transform_new_cfg
= false;
4624 id
.transform_return_to_modify
= true;
4625 id
.transform_parameter
= true;
4626 id
.transform_lang_insert_block
= NULL
;
4627 id
.statements_to_fold
= pointer_set_create ();
4629 push_gimplify_context ();
4631 /* We make no attempts to keep dominance info up-to-date. */
4632 free_dominance_info (CDI_DOMINATORS
);
4633 free_dominance_info (CDI_POST_DOMINATORS
);
4635 /* Register specific gimple functions. */
4636 gimple_register_cfg_hooks ();
4638 /* Reach the trees by walking over the CFG, and note the
4639 enclosing basic-blocks in the call edges. */
4640 /* We walk the blocks going forward, because inlined function bodies
4641 will split id->current_basic_block, and the new blocks will
4642 follow it; we'll trudge through them, processing their CALL_EXPRs
4644 FOR_EACH_BB_FN (bb
, cfun
)
4645 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4647 pop_gimplify_context (NULL
);
4649 #ifdef ENABLE_CHECKING
4651 struct cgraph_edge
*e
;
4653 verify_cgraph_node (id
.dst_node
);
4655 /* Double check that we inlined everything we are supposed to inline. */
4656 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4657 gcc_assert (e
->inline_failed
|| !e
->call_stmt
/*fake edge*/);
4661 /* Fold queued statements. */
4662 fold_marked_statements (last
, id
.statements_to_fold
);
4663 pointer_set_destroy (id
.statements_to_fold
);
4665 gcc_assert (!id
.debug_stmts
.exists ());
4667 /* If we didn't inline into the function there is nothing to do. */
4671 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4674 delete_unreachable_blocks_update_callgraph (&id
);
4675 #ifdef ENABLE_CHECKING
4676 verify_cgraph_node (id
.dst_node
);
4679 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4680 not possible yet - the IPA passes might make various functions to not
4681 throw and they don't care to proactively update local EH info. This is
4682 done later in fixup_cfg pass that also execute the verification. */
4683 return (TODO_update_ssa
4685 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4686 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4687 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
4688 ? TODO_rebuild_frequencies
: 0));
4691 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4694 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4696 enum tree_code code
= TREE_CODE (*tp
);
4697 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4699 /* We make copies of most nodes. */
4700 if (IS_EXPR_CODE_CLASS (cl
)
4701 || code
== TREE_LIST
4703 || code
== TYPE_DECL
4704 || code
== OMP_CLAUSE
)
4706 /* Because the chain gets clobbered when we make a copy, we save it
4708 tree chain
= NULL_TREE
, new_tree
;
4710 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4711 chain
= TREE_CHAIN (*tp
);
4713 /* Copy the node. */
4714 new_tree
= copy_node (*tp
);
4718 /* Now, restore the chain, if appropriate. That will cause
4719 walk_tree to walk into the chain as well. */
4720 if (code
== PARM_DECL
4721 || code
== TREE_LIST
4722 || code
== OMP_CLAUSE
)
4723 TREE_CHAIN (*tp
) = chain
;
4725 /* For now, we don't update BLOCKs when we make copies. So, we
4726 have to nullify all BIND_EXPRs. */
4727 if (TREE_CODE (*tp
) == BIND_EXPR
)
4728 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4730 else if (code
== CONSTRUCTOR
)
4732 /* CONSTRUCTOR nodes need special handling because
4733 we need to duplicate the vector of elements. */
4736 new_tree
= copy_node (*tp
);
4737 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
4740 else if (code
== STATEMENT_LIST
)
4741 /* We used to just abort on STATEMENT_LIST, but we can run into them
4742 with statement-expressions (c++/40975). */
4743 copy_statement_list (tp
);
4744 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4746 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4750 && (code
== VAR_DECL
)
4751 && (TREE_STATIC (*tp
) || DECL_EXTERNAL (*tp
)))
4753 tree resolved_decl
= real_varpool_node (*tp
)->decl
;
4754 if (resolved_decl
!= *tp
)
4756 *tp
= resolved_decl
;
4760 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4765 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4766 information indicating to what new SAVE_EXPR this one should be mapped,
4767 use that one. Otherwise, create a new node and enter it in ST. FN is
4768 the function into which the copy will be placed. */
4771 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4773 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4777 /* See if we already encountered this SAVE_EXPR. */
4778 n
= (tree
*) pointer_map_contains (st
, *tp
);
4780 /* If we didn't already remap this SAVE_EXPR, do so now. */
4783 t
= copy_node (*tp
);
4785 /* Remember this SAVE_EXPR. */
4786 *pointer_map_insert (st
, *tp
) = t
;
4787 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4788 *pointer_map_insert (st
, t
) = t
;
4792 /* We've already walked into this SAVE_EXPR; don't do it again. */
4797 /* Replace this SAVE_EXPR with the copy. */
4801 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4802 label, copies the declaration and enters it in the splay_tree in DATA (which
4803 is really a 'copy_body_data *'. */
4806 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4807 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4808 struct walk_stmt_info
*wi
)
4810 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4811 gimple stmt
= gsi_stmt (*gsip
);
4813 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4815 tree decl
= gimple_label_label (stmt
);
4817 /* Copy the decl and remember the copy. */
4818 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
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_op (tree
*tp
, int *walk_subtrees
, void *data
)
4833 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4834 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4835 struct pointer_map_t
*st
= id
->decl_map
;
4839 /* Only a local declaration (variable or label). */
4840 if ((TREE_CODE (expr
) == VAR_DECL
4841 && !TREE_STATIC (expr
))
4842 || TREE_CODE (expr
) == LABEL_DECL
)
4844 /* Lookup the declaration. */
4845 n
= (tree
*) pointer_map_contains (st
, expr
);
4847 /* If it's there, remap it. */
4852 else if (TREE_CODE (expr
) == STATEMENT_LIST
4853 || TREE_CODE (expr
) == BIND_EXPR
4854 || TREE_CODE (expr
) == SAVE_EXPR
)
4856 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4858 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4859 It's OK for this to happen if it was part of a subtree that
4860 isn't immediately expanded, such as operand 2 of another
4862 if (!TREE_OPERAND (expr
, 1))
4864 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4865 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4869 /* Keep iterating. */
4874 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4875 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4876 remaps all local declarations to appropriate replacements in gimple
4880 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4881 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4882 struct walk_stmt_info
*wi
)
4884 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4885 gimple stmt
= gsi_stmt (*gsip
);
4887 if (gimple_code (stmt
) == GIMPLE_BIND
)
4889 tree block
= gimple_bind_block (stmt
);
4893 remap_block (&block
, id
);
4894 gimple_bind_set_block (stmt
, block
);
4897 /* This will remap a lot of the same decls again, but this should be
4899 if (gimple_bind_vars (stmt
))
4900 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
4904 /* Keep iterating. */
4909 /* Copies everything in SEQ and replaces variables and labels local to
4910 current_function_decl. */
4913 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4916 struct walk_stmt_info wi
;
4917 struct pointer_set_t
*visited
;
4920 /* There's nothing to do for NULL_TREE. */
4925 memset (&id
, 0, sizeof (id
));
4926 id
.src_fn
= current_function_decl
;
4927 id
.dst_fn
= current_function_decl
;
4928 id
.decl_map
= pointer_map_create ();
4929 id
.debug_map
= NULL
;
4931 id
.copy_decl
= copy_decl_no_change
;
4932 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4933 id
.transform_new_cfg
= false;
4934 id
.transform_return_to_modify
= false;
4935 id
.transform_parameter
= false;
4936 id
.transform_lang_insert_block
= NULL
;
4938 /* Walk the tree once to find local labels. */
4939 memset (&wi
, 0, sizeof (wi
));
4940 visited
= pointer_set_create ();
4943 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4944 pointer_set_destroy (visited
);
4946 copy
= gimple_seq_copy (seq
);
4948 /* Walk the copy, remapping decls. */
4949 memset (&wi
, 0, sizeof (wi
));
4951 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4954 pointer_map_destroy (id
.decl_map
);
4956 pointer_map_destroy (id
.debug_map
);
4962 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4965 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4974 debug_find_tree (tree top
, tree search
)
4976 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4980 /* Declare the variables created by the inliner. Add all the variables in
4981 VARS to BIND_EXPR. */
4984 declare_inline_vars (tree block
, tree vars
)
4987 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4989 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4990 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4991 add_local_decl (cfun
, t
);
4995 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4998 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4999 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5000 VAR_DECL translation. */
5003 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5005 /* Don't generate debug information for the copy if we wouldn't have
5006 generated it for the copy either. */
5007 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5008 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5010 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5011 declaration inspired this copy. */
5012 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5014 /* The new variable/label has no RTL, yet. */
5015 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5016 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5017 SET_DECL_RTL (copy
, 0);
5019 /* These args would always appear unused, if not for this. */
5020 TREE_USED (copy
) = 1;
5022 /* Set the context for the new declaration. */
5023 if (!DECL_CONTEXT (decl
))
5024 /* Globals stay global. */
5026 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5027 /* Things that weren't in the scope of the function we're inlining
5028 from aren't in the scope we're inlining to, either. */
5030 else if (TREE_STATIC (decl
))
5031 /* Function-scoped static variables should stay in the original
5035 /* Ordinary automatic local variables are now in the scope of the
5037 DECL_CONTEXT (copy
) = id
->dst_fn
;
5043 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5047 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5048 || TREE_CODE (decl
) == RESULT_DECL
);
5050 type
= TREE_TYPE (decl
);
5052 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5053 VAR_DECL
, DECL_NAME (decl
), type
);
5054 if (DECL_PT_UID_SET_P (decl
))
5055 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5056 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5057 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5058 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5059 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5061 return copy_decl_for_dup_finish (id
, decl
, copy
);
5064 /* Like copy_decl_to_var, but create a return slot object instead of a
5065 pointer variable for return by invisible reference. */
5068 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5072 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5073 || TREE_CODE (decl
) == RESULT_DECL
);
5075 type
= TREE_TYPE (decl
);
5076 if (DECL_BY_REFERENCE (decl
))
5077 type
= TREE_TYPE (type
);
5079 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5080 VAR_DECL
, DECL_NAME (decl
), type
);
5081 if (DECL_PT_UID_SET_P (decl
))
5082 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5083 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5084 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5085 if (!DECL_BY_REFERENCE (decl
))
5087 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5088 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5091 return copy_decl_for_dup_finish (id
, decl
, copy
);
5095 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5099 copy
= copy_node (decl
);
5101 /* The COPY is not abstract; it will be generated in DST_FN. */
5102 DECL_ABSTRACT (copy
) = 0;
5103 lang_hooks
.dup_lang_specific_decl (copy
);
5105 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5106 been taken; it's for internal bookkeeping in expand_goto_internal. */
5107 if (TREE_CODE (copy
) == LABEL_DECL
)
5109 TREE_ADDRESSABLE (copy
) = 0;
5110 LABEL_DECL_UID (copy
) = -1;
5113 return copy_decl_for_dup_finish (id
, decl
, copy
);
5117 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5119 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5120 return copy_decl_to_var (decl
, id
);
5122 return copy_decl_no_change (decl
, id
);
5125 /* Return a copy of the function's argument tree. */
5127 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5128 bitmap args_to_skip
, tree
*vars
)
5131 tree new_parm
= NULL
;
5136 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5137 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5139 tree new_tree
= remap_decl (arg
, id
);
5140 if (TREE_CODE (new_tree
) != PARM_DECL
)
5141 new_tree
= id
->copy_decl (arg
, id
);
5142 lang_hooks
.dup_lang_specific_decl (new_tree
);
5144 parg
= &DECL_CHAIN (new_tree
);
5146 else if (!pointer_map_contains (id
->decl_map
, arg
))
5148 /* Make an equivalent VAR_DECL. If the argument was used
5149 as temporary variable later in function, the uses will be
5150 replaced by local variable. */
5151 tree var
= copy_decl_to_var (arg
, id
);
5152 insert_decl_map (id
, arg
, var
);
5153 /* Declare this new variable. */
5154 DECL_CHAIN (var
) = *vars
;
5160 /* Return a copy of the function's static chain. */
5162 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5164 tree
*chain_copy
, *pvar
;
5166 chain_copy
= &static_chain
;
5167 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5169 tree new_tree
= remap_decl (*pvar
, id
);
5170 lang_hooks
.dup_lang_specific_decl (new_tree
);
5171 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5174 return static_chain
;
5177 /* Return true if the function is allowed to be versioned.
5178 This is a guard for the versioning functionality. */
5181 tree_versionable_function_p (tree fndecl
)
5183 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5184 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
5187 /* Delete all unreachable basic blocks and update callgraph.
5188 Doing so is somewhat nontrivial because we need to update all clones and
5189 remove inline function that become unreachable. */
5192 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5194 bool changed
= false;
5195 basic_block b
, next_bb
;
5197 find_unreachable_blocks ();
5199 /* Delete all unreachable basic blocks. */
5201 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5202 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5204 next_bb
= b
->next_bb
;
5206 if (!(b
->flags
& BB_REACHABLE
))
5208 gimple_stmt_iterator bsi
;
5210 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5212 struct cgraph_edge
*e
;
5213 struct cgraph_node
*node
;
5215 ipa_remove_stmt_references (id
->dst_node
, gsi_stmt (bsi
));
5217 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5218 &&(e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
5220 if (!e
->inline_failed
)
5221 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5223 cgraph_remove_edge (e
);
5225 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5226 && id
->dst_node
->clones
)
5227 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5229 ipa_remove_stmt_references (node
, gsi_stmt (bsi
));
5230 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5231 && (e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
5233 if (!e
->inline_failed
)
5234 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5236 cgraph_remove_edge (e
);
5240 node
= node
->clones
;
5241 else if (node
->next_sibling_clone
)
5242 node
= node
->next_sibling_clone
;
5245 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5246 node
= node
->clone_of
;
5247 if (node
!= id
->dst_node
)
5248 node
= node
->next_sibling_clone
;
5252 delete_basic_block (b
);
5260 /* Update clone info after duplication. */
5263 update_clone_info (copy_body_data
* id
)
5265 struct cgraph_node
*node
;
5266 if (!id
->dst_node
->clones
)
5268 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5270 /* First update replace maps to match the new body. */
5271 if (node
->clone
.tree_map
)
5274 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5276 struct ipa_replace_map
*replace_info
;
5277 replace_info
= (*node
->clone
.tree_map
)[i
];
5278 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5279 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5283 node
= node
->clones
;
5284 else if (node
->next_sibling_clone
)
5285 node
= node
->next_sibling_clone
;
5288 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5289 node
= node
->clone_of
;
5290 if (node
!= id
->dst_node
)
5291 node
= node
->next_sibling_clone
;
5296 /* Create a copy of a function's tree.
5297 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5298 of the original function and the new copied function
5299 respectively. In case we want to replace a DECL
5300 tree with another tree while duplicating the function's
5301 body, TREE_MAP represents the mapping between these
5302 trees. If UPDATE_CLONES is set, the call_stmt fields
5303 of edges of clones of the function will be updated.
5305 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5307 If SKIP_RETURN is true, the new version will return void.
5308 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5309 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5312 tree_function_versioning (tree old_decl
, tree new_decl
,
5313 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
5314 bool update_clones
, bitmap args_to_skip
,
5315 bool skip_return
, bitmap blocks_to_copy
,
5316 basic_block new_entry
)
5318 struct cgraph_node
*old_version_node
;
5319 struct cgraph_node
*new_version_node
;
5323 struct ipa_replace_map
*replace_info
;
5324 basic_block old_entry_block
, bb
;
5325 auto_vec
<gimple
, 10> init_stmts
;
5326 tree vars
= NULL_TREE
;
5328 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5329 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5330 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5332 old_version_node
= cgraph_get_node (old_decl
);
5333 gcc_checking_assert (old_version_node
);
5334 new_version_node
= cgraph_get_node (new_decl
);
5335 gcc_checking_assert (new_version_node
);
5337 /* Copy over debug args. */
5338 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5340 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5341 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5342 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5343 old_debug_args
= decl_debug_args_lookup (old_decl
);
5346 new_debug_args
= decl_debug_args_insert (new_decl
);
5347 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5351 /* Output the inlining info for this abstract function, since it has been
5352 inlined. If we don't do this now, we can lose the information about the
5353 variables in the function when the blocks get blown away as soon as we
5354 remove the cgraph node. */
5355 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5357 DECL_ARTIFICIAL (new_decl
) = 1;
5358 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5359 if (DECL_ORIGIN (old_decl
) == old_decl
)
5360 old_version_node
->used_as_abstract_origin
= true;
5361 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5363 /* Prepare the data structures for the tree copy. */
5364 memset (&id
, 0, sizeof (id
));
5366 /* Generate a new name for the new version. */
5367 id
.statements_to_fold
= pointer_set_create ();
5369 id
.decl_map
= pointer_map_create ();
5370 id
.debug_map
= NULL
;
5371 id
.src_fn
= old_decl
;
5372 id
.dst_fn
= new_decl
;
5373 id
.src_node
= old_version_node
;
5374 id
.dst_node
= new_version_node
;
5375 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5376 id
.blocks_to_copy
= blocks_to_copy
;
5377 if (id
.src_node
->ipa_transforms_to_apply
.exists ())
5379 vec
<ipa_opt_pass
> old_transforms_to_apply
5380 = id
.dst_node
->ipa_transforms_to_apply
;
5383 id
.dst_node
->ipa_transforms_to_apply
5384 = id
.src_node
->ipa_transforms_to_apply
.copy ();
5385 for (i
= 0; i
< old_transforms_to_apply
.length (); i
++)
5386 id
.dst_node
->ipa_transforms_to_apply
.safe_push (old_transforms_to_apply
[i
]);
5387 old_transforms_to_apply
.release ();
5390 id
.copy_decl
= copy_decl_no_change
;
5391 id
.transform_call_graph_edges
5392 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5393 id
.transform_new_cfg
= true;
5394 id
.transform_return_to_modify
= false;
5395 id
.transform_parameter
= false;
5396 id
.transform_lang_insert_block
= NULL
;
5398 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5399 (DECL_STRUCT_FUNCTION (old_decl
));
5400 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5401 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5402 initialize_cfun (new_decl
, old_decl
,
5403 old_entry_block
->count
);
5404 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5405 = id
.src_cfun
->gimple_df
->ipa_pta
;
5407 /* Copy the function's static chain. */
5408 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5410 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5411 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5414 /* If there's a tree_map, prepare for substitution. */
5416 for (i
= 0; i
< tree_map
->length (); i
++)
5419 replace_info
= (*tree_map
)[i
];
5420 if (replace_info
->replace_p
)
5422 if (!replace_info
->old_tree
)
5424 int i
= replace_info
->parm_num
;
5428 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5430 replace_info
->old_tree
= parm
;
5431 req_type
= TREE_TYPE (parm
);
5432 if (!useless_type_conversion_p (req_type
, TREE_TYPE (replace_info
->new_tree
)))
5434 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5435 replace_info
->new_tree
= fold_build1 (NOP_EXPR
, req_type
, replace_info
->new_tree
);
5436 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (TREE_TYPE (replace_info
->new_tree
)))
5437 replace_info
->new_tree
= fold_build1 (VIEW_CONVERT_EXPR
, req_type
, replace_info
->new_tree
);
5442 fprintf (dump_file
, " const ");
5443 print_generic_expr (dump_file
, replace_info
->new_tree
, 0);
5444 fprintf (dump_file
, " can't be converted to param ");
5445 print_generic_expr (dump_file
, parm
, 0);
5446 fprintf (dump_file
, "\n");
5448 replace_info
->old_tree
= NULL
;
5453 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5454 if (replace_info
->old_tree
)
5456 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5457 replace_info
->new_tree
, id
.src_fn
,
5461 init_stmts
.safe_push (init
);
5465 /* Copy the function's arguments. */
5466 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5467 DECL_ARGUMENTS (new_decl
) =
5468 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5469 args_to_skip
, &vars
);
5471 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5472 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5474 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5476 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5477 /* Add local vars. */
5478 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5480 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5482 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5484 DECL_RESULT (new_decl
)
5485 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5486 RESULT_DECL
, NULL_TREE
, void_type_node
);
5487 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5488 cfun
->returns_struct
= 0;
5489 cfun
->returns_pcc_struct
= 0;
5494 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5495 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5496 if (gimple_in_ssa_p (id
.src_cfun
)
5497 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5498 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5500 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5501 insert_decl_map (&id
, old_name
, new_name
);
5502 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5503 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5507 /* Set up the destination functions loop tree. */
5508 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5510 cfun
->curr_properties
&= ~PROP_loops
;
5511 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5512 cfun
->curr_properties
|= PROP_loops
;
5515 /* Copy the Function's body. */
5516 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5517 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
5520 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5521 number_blocks (new_decl
);
5523 /* We want to create the BB unconditionally, so that the addition of
5524 debug stmts doesn't affect BB count, which may in the end cause
5525 codegen differences. */
5526 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5527 while (init_stmts
.length ())
5528 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5529 update_clone_info (&id
);
5531 /* Remap the nonlocal_goto_save_area, if any. */
5532 if (cfun
->nonlocal_goto_save_area
)
5534 struct walk_stmt_info wi
;
5536 memset (&wi
, 0, sizeof (wi
));
5538 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5542 pointer_map_destroy (id
.decl_map
);
5544 pointer_map_destroy (id
.debug_map
);
5545 free_dominance_info (CDI_DOMINATORS
);
5546 free_dominance_info (CDI_POST_DOMINATORS
);
5548 fold_marked_statements (0, id
.statements_to_fold
);
5549 pointer_set_destroy (id
.statements_to_fold
);
5550 fold_cond_expr_cond ();
5551 delete_unreachable_blocks_update_callgraph (&id
);
5552 if (id
.dst_node
->definition
)
5553 cgraph_rebuild_references ();
5554 update_ssa (TODO_update_ssa
);
5556 /* After partial cloning we need to rescale frequencies, so they are
5557 within proper range in the cloned function. */
5560 struct cgraph_edge
*e
;
5561 rebuild_frequencies ();
5563 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5564 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5566 basic_block bb
= gimple_bb (e
->call_stmt
);
5567 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5569 e
->count
= bb
->count
;
5571 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5573 basic_block bb
= gimple_bb (e
->call_stmt
);
5574 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5576 e
->count
= bb
->count
;
5580 free_dominance_info (CDI_DOMINATORS
);
5581 free_dominance_info (CDI_POST_DOMINATORS
);
5583 gcc_assert (!id
.debug_stmts
.exists ());
5588 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5589 the callee and return the inlined body on success. */
5592 maybe_inline_call_in_expr (tree exp
)
5594 tree fn
= get_callee_fndecl (exp
);
5596 /* We can only try to inline "const" functions. */
5597 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5599 struct pointer_map_t
*decl_map
= pointer_map_create ();
5600 call_expr_arg_iterator iter
;
5604 /* Remap the parameters. */
5605 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5607 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5608 *pointer_map_insert (decl_map
, param
) = arg
;
5610 memset (&id
, 0, sizeof (id
));
5612 id
.dst_fn
= current_function_decl
;
5613 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5614 id
.decl_map
= decl_map
;
5616 id
.copy_decl
= copy_decl_no_change
;
5617 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5618 id
.transform_new_cfg
= false;
5619 id
.transform_return_to_modify
= true;
5620 id
.transform_parameter
= true;
5621 id
.transform_lang_insert_block
= NULL
;
5623 /* Make sure not to unshare trees behind the front-end's back
5624 since front-end specific mechanisms may rely on sharing. */
5625 id
.regimplify
= false;
5626 id
.do_not_unshare
= true;
5628 /* We're not inside any EH region. */
5631 t
= copy_tree_body (&id
);
5632 pointer_map_destroy (decl_map
);
5634 /* We can only return something suitable for use in a GENERIC
5636 if (TREE_CODE (t
) == MODIFY_EXPR
)
5637 return TREE_OPERAND (t
, 1);
5643 /* Duplicate a type, fields and all. */
5646 build_duplicate_type (tree type
)
5648 struct copy_body_data id
;
5650 memset (&id
, 0, sizeof (id
));
5651 id
.src_fn
= current_function_decl
;
5652 id
.dst_fn
= current_function_decl
;
5654 id
.decl_map
= pointer_map_create ();
5655 id
.debug_map
= NULL
;
5656 id
.copy_decl
= copy_decl_no_change
;
5658 type
= remap_type_1 (type
, &id
);
5660 pointer_map_destroy (id
.decl_map
);
5662 pointer_map_destroy (id
.debug_map
);
5664 TYPE_CANONICAL (type
) = type
;