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 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1491 RESX and EH_DISPATCH. */
1493 switch (gimple_code (copy
))
1497 tree r
, fndecl
= gimple_call_fndecl (copy
);
1498 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1499 switch (DECL_FUNCTION_CODE (fndecl
))
1501 case BUILT_IN_EH_COPY_VALUES
:
1502 r
= gimple_call_arg (copy
, 1);
1503 r
= remap_eh_region_tree_nr (r
, id
);
1504 gimple_call_set_arg (copy
, 1, r
);
1507 case BUILT_IN_EH_POINTER
:
1508 case BUILT_IN_EH_FILTER
:
1509 r
= gimple_call_arg (copy
, 0);
1510 r
= remap_eh_region_tree_nr (r
, id
);
1511 gimple_call_set_arg (copy
, 0, r
);
1518 /* Reset alias info if we didn't apply measures to
1519 keep it valid over inlining by setting DECL_PT_UID. */
1520 if (!id
->src_cfun
->gimple_df
1521 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1522 gimple_call_reset_alias_info (copy
);
1528 int r
= gimple_resx_region (copy
);
1529 r
= remap_eh_region_nr (r
, id
);
1530 gimple_resx_set_region (copy
, r
);
1534 case GIMPLE_EH_DISPATCH
:
1536 int r
= gimple_eh_dispatch_region (copy
);
1537 r
= remap_eh_region_nr (r
, id
);
1538 gimple_eh_dispatch_set_region (copy
, r
);
1547 /* If STMT has a block defined, map it to the newly constructed
1549 if (gimple_block (copy
))
1552 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1554 gimple_set_block (copy
, *n
);
1557 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1560 /* Remap all the operands in COPY. */
1561 memset (&wi
, 0, sizeof (wi
));
1564 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1566 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1568 /* Clear the copied virtual operands. We are not remapping them here
1569 but are going to recreate them from scratch. */
1570 if (gimple_has_mem_ops (copy
))
1572 gimple_set_vdef (copy
, NULL_TREE
);
1573 gimple_set_vuse (copy
, NULL_TREE
);
1580 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1584 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1585 gcov_type count_scale
)
1587 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1588 basic_block copy_basic_block
;
1593 /* Search for previous copied basic block. */
1596 prev
= prev
->prev_bb
;
1598 /* create_basic_block() will append every new block to
1599 basic_block_info automatically. */
1600 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1601 (basic_block
) prev
->aux
);
1602 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1604 /* We are going to rebuild frequencies from scratch. These values
1605 have just small importance to drive canonicalize_loop_headers. */
1606 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1608 /* We recompute frequencies after inlining, so this is quite safe. */
1609 if (freq
> BB_FREQ_MAX
)
1611 copy_basic_block
->frequency
= freq
;
1613 copy_gsi
= gsi_start_bb (copy_basic_block
);
1615 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1617 gimple stmt
= gsi_stmt (gsi
);
1618 gimple orig_stmt
= stmt
;
1620 id
->regimplify
= false;
1621 stmt
= remap_gimple_stmt (stmt
, id
);
1622 if (gimple_nop_p (stmt
))
1625 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1628 /* With return slot optimization we can end up with
1629 non-gimple (foo *)&this->m, fix that here. */
1630 if (is_gimple_assign (stmt
)
1631 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1632 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1635 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1636 gimple_assign_rhs1 (stmt
),
1638 GSI_CONTINUE_LINKING
);
1639 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1640 id
->regimplify
= false;
1643 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1646 gimple_regimplify_operands (stmt
, &seq_gsi
);
1648 /* If copy_basic_block has been empty at the start of this iteration,
1649 call gsi_start_bb again to get at the newly added statements. */
1650 if (gsi_end_p (copy_gsi
))
1651 copy_gsi
= gsi_start_bb (copy_basic_block
);
1653 gsi_next (©_gsi
);
1655 /* Process the new statement. The call to gimple_regimplify_operands
1656 possibly turned the statement into multiple statements, we
1657 need to process all of them. */
1662 stmt
= gsi_stmt (copy_gsi
);
1663 if (is_gimple_call (stmt
)
1664 && gimple_call_va_arg_pack_p (stmt
)
1667 /* __builtin_va_arg_pack () should be replaced by
1668 all arguments corresponding to ... in the caller. */
1672 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1675 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1678 /* Create the new array of arguments. */
1679 n
= nargs
+ gimple_call_num_args (stmt
);
1680 argarray
.create (n
);
1681 argarray
.safe_grow_cleared (n
);
1683 /* Copy all the arguments before '...' */
1684 memcpy (argarray
.address (),
1685 gimple_call_arg_ptr (stmt
, 0),
1686 gimple_call_num_args (stmt
) * sizeof (tree
));
1688 /* Append the arguments passed in '...' */
1689 memcpy (argarray
.address () + gimple_call_num_args (stmt
),
1690 gimple_call_arg_ptr (id
->gimple_call
, 0)
1691 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1692 nargs
* sizeof (tree
));
1694 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1697 argarray
.release ();
1699 /* Copy all GIMPLE_CALL flags, location and block, except
1700 GF_CALL_VA_ARG_PACK. */
1701 gimple_call_copy_flags (new_call
, stmt
);
1702 gimple_call_set_va_arg_pack (new_call
, false);
1703 gimple_set_location (new_call
, gimple_location (stmt
));
1704 gimple_set_block (new_call
, gimple_block (stmt
));
1705 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1707 gsi_replace (©_gsi
, new_call
, false);
1710 else if (is_gimple_call (stmt
)
1712 && (decl
= gimple_call_fndecl (stmt
))
1713 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1714 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1716 /* __builtin_va_arg_pack_len () should be replaced by
1717 the number of anonymous arguments. */
1718 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1722 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1725 count
= build_int_cst (integer_type_node
, nargs
);
1726 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1727 gsi_replace (©_gsi
, new_stmt
, false);
1731 /* Statements produced by inlining can be unfolded, especially
1732 when we constant propagated some operands. We can't fold
1733 them right now for two reasons:
1734 1) folding require SSA_NAME_DEF_STMTs to be correct
1735 2) we can't change function calls to builtins.
1736 So we just mark statement for later folding. We mark
1737 all new statements, instead just statements that has changed
1738 by some nontrivial substitution so even statements made
1739 foldable indirectly are updated. If this turns out to be
1740 expensive, copy_body can be told to watch for nontrivial
1742 if (id
->statements_to_fold
)
1743 pointer_set_insert (id
->statements_to_fold
, stmt
);
1745 /* We're duplicating a CALL_EXPR. Find any corresponding
1746 callgraph edges and update or duplicate them. */
1747 if (is_gimple_call (stmt
))
1749 struct cgraph_edge
*edge
;
1751 switch (id
->transform_call_graph_edges
)
1753 case CB_CGE_DUPLICATE
:
1754 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1757 int edge_freq
= edge
->frequency
;
1759 struct cgraph_edge
*old_edge
= edge
;
1760 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1762 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1764 /* We could also just rescale the frequency, but
1765 doing so would introduce roundoff errors and make
1766 verifier unhappy. */
1767 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1770 /* Speculative calls consist of two edges - direct and indirect.
1771 Duplicate the whole thing and distribute frequencies accordingly. */
1772 if (edge
->speculative
)
1774 struct cgraph_edge
*direct
, *indirect
;
1775 struct ipa_ref
*ref
;
1777 gcc_assert (!edge
->indirect_unknown_callee
);
1778 cgraph_speculative_call_info (old_edge
, direct
, indirect
, ref
);
1779 indirect
= cgraph_clone_edge (indirect
, id
->dst_node
, stmt
,
1781 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1783 if (old_edge
->frequency
+ indirect
->frequency
)
1785 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
1786 (old_edge
->frequency
+ indirect
->frequency
)),
1788 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
1789 (old_edge
->frequency
+ indirect
->frequency
)),
1792 ipa_clone_ref (ref
, id
->dst_node
, stmt
);
1796 edge
->frequency
= new_freq
;
1798 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
1799 && (edge_freq
> edge
->frequency
+ 10
1800 || edge_freq
< edge
->frequency
- 10))
1802 fprintf (dump_file
, "Edge frequency estimated by "
1803 "cgraph %i diverge from inliner's estimate %i\n",
1807 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1810 copy_basic_block
->frequency
);
1816 case CB_CGE_MOVE_CLONES
:
1817 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1819 edge
= cgraph_edge (id
->dst_node
, stmt
);
1823 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1825 cgraph_set_call_stmt (edge
, stmt
);
1832 /* Constant propagation on argument done during inlining
1833 may create new direct call. Produce an edge for it. */
1835 || (edge
->indirect_inlining_edge
1836 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1837 && id
->dst_node
->definition
1838 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1840 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1842 /* We have missing edge in the callgraph. This can happen
1843 when previous inlining turned an indirect call into a
1844 direct call by constant propagating arguments or we are
1845 producing dead clone (for further cloning). In all
1846 other cases we hit a bug (incorrect node sharing is the
1847 most common reason for missing edges). */
1848 gcc_assert (!dest
->definition
1849 || dest
->address_taken
1850 || !id
->src_node
->definition
1851 || !id
->dst_node
->definition
);
1852 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1853 cgraph_create_edge_including_clones
1854 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1855 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1857 CIF_ORIGINALLY_INDIRECT_CALL
);
1859 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1861 compute_call_stmt_bb_frequency
1862 (id
->dst_node
->decl
,
1863 copy_basic_block
))->inline_failed
1864 = CIF_ORIGINALLY_INDIRECT_CALL
;
1867 fprintf (dump_file
, "Created new direct edge to %s\n",
1872 notice_special_calls (stmt
);
1875 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1876 id
->eh_map
, id
->eh_lp_nr
);
1878 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1883 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1884 if (TREE_CODE (def
) == SSA_NAME
)
1885 SSA_NAME_DEF_STMT (def
) = stmt
;
1888 gsi_next (©_gsi
);
1890 while (!gsi_end_p (copy_gsi
));
1892 copy_gsi
= gsi_last_bb (copy_basic_block
);
1895 return copy_basic_block
;
1898 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1899 form is quite easy, since dominator relationship for old basic blocks does
1902 There is however exception where inlining might change dominator relation
1903 across EH edges from basic block within inlined functions destinating
1904 to landing pads in function we inline into.
1906 The function fills in PHI_RESULTs of such PHI nodes if they refer
1907 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1908 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1909 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1910 set, and this means that there will be no overlapping live ranges
1911 for the underlying symbol.
1913 This might change in future if we allow redirecting of EH edges and
1914 we might want to change way build CFG pre-inlining to include
1915 all the possible edges then. */
1917 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1918 bool can_throw
, bool nonlocal_goto
)
1923 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1925 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1928 gimple_stmt_iterator si
;
1931 gcc_assert (e
->flags
& EDGE_EH
);
1934 gcc_assert (!(e
->flags
& EDGE_EH
));
1936 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1940 phi
= gsi_stmt (si
);
1942 /* For abnormal goto/call edges the receiver can be the
1943 ENTRY_BLOCK. Do not assert this cannot happen. */
1945 gcc_assert ((e
->flags
& EDGE_EH
)
1946 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1948 re
= find_edge (ret_bb
, e
->dest
);
1949 gcc_checking_assert (re
);
1950 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1951 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1953 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1954 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1960 /* Copy edges from BB into its copy constructed earlier, scale profile
1961 accordingly. Edges will be taken care of later. Assume aux
1962 pointers to point to the copies of each BB. Return true if any
1963 debug stmts are left after a statement that must end the basic block. */
1966 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
1967 basic_block abnormal_goto_dest
)
1969 basic_block new_bb
= (basic_block
) bb
->aux
;
1972 gimple_stmt_iterator si
;
1974 bool need_debug_cleanup
= false;
1976 /* Use the indices from the original blocks to create edges for the
1978 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1979 if (!(old_edge
->flags
& EDGE_EH
))
1983 flags
= old_edge
->flags
;
1985 /* Return edges do get a FALLTHRU flag when the get inlined. */
1986 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1987 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
1988 flags
|= EDGE_FALLTHRU
;
1989 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1990 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
1991 new_edge
->probability
= old_edge
->probability
;
1994 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1997 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2000 bool can_throw
, nonlocal_goto
;
2002 copy_stmt
= gsi_stmt (si
);
2003 if (!is_gimple_debug (copy_stmt
))
2004 update_stmt (copy_stmt
);
2006 /* Do this before the possible split_block. */
2009 /* If this tree could throw an exception, there are two
2010 cases where we need to add abnormal edge(s): the
2011 tree wasn't in a region and there is a "current
2012 region" in the caller; or the original tree had
2013 EH edges. In both cases split the block after the tree,
2014 and add abnormal edge(s) as needed; we need both
2015 those from the callee and the caller.
2016 We check whether the copy can throw, because the const
2017 propagation can change an INDIRECT_REF which throws
2018 into a COMPONENT_REF which doesn't. If the copy
2019 can throw, the original could also throw. */
2020 can_throw
= stmt_can_throw_internal (copy_stmt
);
2022 = (stmt_can_make_abnormal_goto (copy_stmt
)
2023 && !computed_goto_p (copy_stmt
));
2025 if (can_throw
|| nonlocal_goto
)
2027 if (!gsi_end_p (si
))
2029 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2032 need_debug_cleanup
= true;
2034 if (!gsi_end_p (si
))
2035 /* Note that bb's predecessor edges aren't necessarily
2036 right at this point; split_block doesn't care. */
2038 edge e
= split_block (new_bb
, copy_stmt
);
2041 new_bb
->aux
= e
->src
->aux
;
2042 si
= gsi_start_bb (new_bb
);
2046 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2047 make_eh_dispatch_edges (copy_stmt
);
2049 make_eh_edges (copy_stmt
);
2051 /* If the call we inline cannot make abnormal goto do not add
2052 additional abnormal edges but only retain those already present
2053 in the original function body. */
2054 if (abnormal_goto_dest
== NULL
)
2055 nonlocal_goto
= false;
2058 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2060 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2061 nonlocal_goto
= false;
2062 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2063 in OpenMP regions which aren't allowed to be left abnormally.
2064 So, no need to add abnormal edge in that case. */
2065 else if (is_gimple_call (copy_stmt
)
2066 && gimple_call_internal_p (copy_stmt
)
2067 && (gimple_call_internal_fn (copy_stmt
)
2068 == IFN_ABNORMAL_DISPATCHER
)
2069 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2070 nonlocal_goto
= false;
2072 make_edge (copy_stmt_bb
, abnormal_goto_dest
, EDGE_ABNORMAL
);
2075 if ((can_throw
|| nonlocal_goto
)
2076 && gimple_in_ssa_p (cfun
))
2077 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2078 can_throw
, nonlocal_goto
);
2080 return need_debug_cleanup
;
2083 /* Copy the PHIs. All blocks and edges are copied, some blocks
2084 was possibly split and new outgoing EH edges inserted.
2085 BB points to the block of original function and AUX pointers links
2086 the original and newly copied blocks. */
2089 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2091 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2094 gimple_stmt_iterator si
;
2096 bool inserted
= false;
2098 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2103 phi
= gsi_stmt (si
);
2104 res
= PHI_RESULT (phi
);
2106 if (!virtual_operand_p (res
))
2108 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2109 new_phi
= create_phi_node (new_res
, new_bb
);
2110 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2112 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2118 /* When doing partial cloning, we allow PHIs on the entry block
2119 as long as all the arguments are the same. Find any input
2120 edge to see argument to copy. */
2122 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2123 if (!old_edge
->src
->aux
)
2126 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2128 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2129 gcc_assert (new_arg
);
2130 /* With return slot optimization we can end up with
2131 non-gimple (foo *)&this->m, fix that here. */
2132 if (TREE_CODE (new_arg
) != SSA_NAME
2133 && TREE_CODE (new_arg
) != FUNCTION_DECL
2134 && !is_gimple_val (new_arg
))
2136 gimple_seq stmts
= NULL
;
2137 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2138 gsi_insert_seq_on_edge (new_edge
, stmts
);
2141 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2142 if (LOCATION_BLOCK (locus
))
2145 n
= (tree
*) pointer_map_contains (id
->decl_map
,
2146 LOCATION_BLOCK (locus
));
2149 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2151 locus
= LOCATION_LOCUS (locus
);
2154 locus
= LOCATION_LOCUS (locus
);
2156 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2161 /* Commit the delayed edge insertions. */
2163 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2164 gsi_commit_one_edge_insert (new_edge
, NULL
);
2168 /* Wrapper for remap_decl so it can be used as a callback. */
2171 remap_decl_1 (tree decl
, void *data
)
2173 return remap_decl (decl
, (copy_body_data
*) data
);
2176 /* Build struct function and associated datastructures for the new clone
2177 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2178 the cfun to the function of new_fndecl (and current_function_decl too). */
2181 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2183 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2184 gcov_type count_scale
;
2186 if (!DECL_ARGUMENTS (new_fndecl
))
2187 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2188 if (!DECL_RESULT (new_fndecl
))
2189 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2191 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2193 = GCOV_COMPUTE_SCALE (count
,
2194 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2196 count_scale
= REG_BR_PROB_BASE
;
2198 /* Register specific tree functions. */
2199 gimple_register_cfg_hooks ();
2201 /* Get clean struct function. */
2202 push_struct_function (new_fndecl
);
2204 /* We will rebuild these, so just sanity check that they are empty. */
2205 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2206 gcc_assert (cfun
->local_decls
== NULL
);
2207 gcc_assert (cfun
->cfg
== NULL
);
2208 gcc_assert (cfun
->decl
== new_fndecl
);
2210 /* Copy items we preserve during cloning. */
2211 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2212 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2213 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2214 cfun
->curr_properties
= src_cfun
->curr_properties
;
2215 cfun
->last_verified
= src_cfun
->last_verified
;
2216 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2217 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2218 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2219 cfun
->stdarg
= src_cfun
->stdarg
;
2220 cfun
->after_inlining
= src_cfun
->after_inlining
;
2221 cfun
->can_throw_non_call_exceptions
2222 = src_cfun
->can_throw_non_call_exceptions
;
2223 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2224 cfun
->returns_struct
= src_cfun
->returns_struct
;
2225 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2226 cfun
->module_id
= src_cfun
->module_id
;
2228 init_empty_tree_cfg ();
2230 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2231 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2232 (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
* (double)count_scale
/
2234 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2235 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2236 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2237 (EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
* (double)count_scale
/
2239 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2240 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2242 init_eh_for_function ();
2244 if (src_cfun
->gimple_df
)
2246 init_tree_ssa (cfun
);
2247 cfun
->gimple_df
->in_ssa_p
= true;
2248 init_ssa_operands (cfun
);
2252 /* Helper function for copy_cfg_body. Move debug stmts from the end
2253 of NEW_BB to the beginning of successor basic blocks when needed. If the
2254 successor has multiple predecessors, reset them, otherwise keep
2258 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2262 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2265 || gsi_one_before_end_p (si
)
2266 || !(stmt_can_throw_internal (gsi_stmt (si
))
2267 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2270 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2272 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2273 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2274 while (is_gimple_debug (gsi_stmt (ssi
)))
2276 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2280 /* For the last edge move the debug stmts instead of copying
2282 if (ei_one_before_end_p (ei
))
2286 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2287 gimple_debug_bind_reset_value (stmt
);
2288 gsi_remove (&si
, false);
2289 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2293 if (gimple_debug_bind_p (stmt
))
2295 var
= gimple_debug_bind_get_var (stmt
);
2296 if (single_pred_p (e
->dest
))
2298 value
= gimple_debug_bind_get_value (stmt
);
2299 value
= unshare_expr (value
);
2303 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2305 else if (gimple_debug_source_bind_p (stmt
))
2307 var
= gimple_debug_source_bind_get_var (stmt
);
2308 value
= gimple_debug_source_bind_get_value (stmt
);
2309 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2313 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2314 id
->debug_stmts
.safe_push (new_stmt
);
2320 /* Make a copy of the sub-loops of SRC_PARENT and place them
2321 as siblings of DEST_PARENT. */
2324 copy_loops (copy_body_data
*id
,
2325 struct loop
*dest_parent
, struct loop
*src_parent
)
2327 struct loop
*src_loop
= src_parent
->inner
;
2330 if (!id
->blocks_to_copy
2331 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2333 struct loop
*dest_loop
= alloc_loop ();
2335 /* Assign the new loop its header and latch and associate
2336 those with the new loop. */
2337 if (src_loop
->header
!= NULL
)
2339 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2340 dest_loop
->header
->loop_father
= dest_loop
;
2342 if (src_loop
->latch
!= NULL
)
2344 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2345 dest_loop
->latch
->loop_father
= dest_loop
;
2348 /* Copy loop meta-data. */
2349 copy_loop_info (src_loop
, dest_loop
);
2351 /* Finally place it into the loop array and the loop tree. */
2352 place_new_loop (cfun
, dest_loop
);
2353 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2355 if (src_loop
->simduid
)
2357 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2358 cfun
->has_simduid_loops
= true;
2360 if (src_loop
->force_vect
)
2362 dest_loop
->force_vect
= true;
2363 cfun
->has_force_vect_loops
= true;
2365 dest_loop
->safelen
= src_loop
->safelen
;
2368 copy_loops (id
, dest_loop
, src_loop
);
2370 src_loop
= src_loop
->next
;
2374 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2377 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2379 gimple_stmt_iterator si
;
2380 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2382 if (is_gimple_call (gsi_stmt (si
)))
2384 struct cgraph_edge
*edge
= cgraph_edge (id
->dst_node
, gsi_stmt (si
));
2386 cgraph_redirect_edge_call_stmt_to_callee (edge
);
2391 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2392 with each bb's frequency. Used when NODE has a 0-weight entry
2393 but we are about to inline it into a non-zero count call bb.
2394 See the comments for handle_missing_profiles() in predict.c for
2395 when this can happen for COMDATs. */
2398 freqs_to_counts (struct cgraph_node
*node
, gcov_type count
)
2403 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2405 FOR_ALL_BB_FN(bb
, fn
)
2407 bb
->count
= apply_scale (count
,
2408 GCOV_COMPUTE_SCALE (bb
->frequency
, BB_FREQ_MAX
));
2409 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2410 e
->count
= apply_probability (e
->src
->count
, e
->probability
);
2414 /* Make a copy of the body of FN so that it can be inserted inline in
2415 another function. Walks FN via CFG, returns new fndecl. */
2418 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2419 basic_block entry_block_map
, basic_block exit_block_map
,
2420 basic_block new_entry
)
2422 tree callee_fndecl
= id
->src_fn
;
2423 /* Original cfun for the callee, doesn't change. */
2424 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2425 struct function
*cfun_to_copy
;
2427 tree new_fndecl
= NULL
;
2428 bool need_debug_cleanup
= false;
2429 gcov_type count_scale
;
2431 int incoming_frequency
= 0;
2432 gcov_type incoming_count
= 0;
2434 /* This can happen for COMDAT routines that end up with 0 counts
2435 despite being called (see the comments for handle_missing_profiles()
2436 in predict.c as to why). Apply counts to the blocks in the callee
2437 before inlining, using the guessed edge frequencies, so that we don't
2438 end up with a 0-count inline body which can confuse downstream
2439 optimizations such as function splitting. */
2440 if (!ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
&& count
)
2442 /* Apply the larger of the call bb count and the total incoming
2443 call edge count to the callee. */
2444 gcov_type in_count
= 0;
2445 struct cgraph_edge
*in_edge
;
2446 for (in_edge
= id
->src_node
->callers
; in_edge
;
2447 in_edge
= in_edge
->next_caller
)
2448 in_count
+= in_edge
->count
;
2449 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2452 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2454 = GCOV_COMPUTE_SCALE (count
,
2455 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2457 count_scale
= REG_BR_PROB_BASE
;
2459 /* Register specific tree functions. */
2460 gimple_register_cfg_hooks ();
2462 /* If we are inlining just region of the function, make sure to connect
2463 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2464 part of loop, we must compute frequency and probability of
2465 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2466 probabilities of edges incoming from nonduplicated region. */
2472 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2475 incoming_frequency
+= EDGE_FREQUENCY (e
);
2476 incoming_count
+= e
->count
;
2478 incoming_count
= apply_scale (incoming_count
, count_scale
);
2480 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2481 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2482 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2485 /* Must have a CFG here at this point. */
2486 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2487 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2489 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2491 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2492 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2493 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2494 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2496 /* Duplicate any exception-handling regions. */
2498 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2501 /* Use aux pointers to map the original blocks to copy. */
2502 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2503 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2505 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2508 new_bb
->loop_father
= entry_block_map
->loop_father
;
2511 last
= last_basic_block_for_fn (cfun
);
2513 /* Now that we've duplicated the blocks, duplicate their edges. */
2514 basic_block abnormal_goto_dest
= NULL
;
2516 && stmt_can_make_abnormal_goto (id
->gimple_call
))
2518 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->gimple_call
);
2520 bb
= gimple_bb (id
->gimple_call
);
2522 if (gsi_end_p (gsi
))
2523 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2525 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2526 if (!id
->blocks_to_copy
2527 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2528 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2529 abnormal_goto_dest
);
2533 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2534 e
->probability
= REG_BR_PROB_BASE
;
2535 e
->count
= incoming_count
;
2538 /* Duplicate the loop tree, if available and wanted. */
2539 if (loops_for_fn (src_cfun
) != NULL
2540 && current_loops
!= NULL
)
2542 copy_loops (id
, entry_block_map
->loop_father
,
2543 get_loop (src_cfun
, 0));
2544 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2545 loops_state_set (LOOPS_NEED_FIXUP
);
2548 /* If the loop tree in the source function needed fixup, mark the
2549 destination loop tree for fixup, too. */
2550 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2551 loops_state_set (LOOPS_NEED_FIXUP
);
2553 if (gimple_in_ssa_p (cfun
))
2554 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2555 if (!id
->blocks_to_copy
2556 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2557 copy_phis_for_bb (bb
, id
);
2559 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2562 if (need_debug_cleanup
2563 && bb
->index
!= ENTRY_BLOCK
2564 && bb
->index
!= EXIT_BLOCK
)
2565 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2566 /* Update call edge destinations. This can not be done before loop
2567 info is updated, because we may split basic blocks. */
2568 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2569 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2570 ((basic_block
)bb
->aux
)->aux
= NULL
;
2574 /* Zero out AUX fields of newly created block during EH edge
2576 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2578 if (need_debug_cleanup
)
2579 maybe_move_debug_stmts_to_successors (id
,
2580 BASIC_BLOCK_FOR_FN (cfun
, last
));
2581 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2582 /* Update call edge destinations. This can not be done before loop
2583 info is updated, because we may split basic blocks. */
2584 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2585 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2587 entry_block_map
->aux
= NULL
;
2588 exit_block_map
->aux
= NULL
;
2592 pointer_map_destroy (id
->eh_map
);
2599 /* Copy the debug STMT using ID. We deal with these statements in a
2600 special way: if any variable in their VALUE expression wasn't
2601 remapped yet, we won't remap it, because that would get decl uids
2602 out of sync, causing codegen differences between -g and -g0. If
2603 this arises, we drop the VALUE expression altogether. */
2606 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2609 struct walk_stmt_info wi
;
2611 if (gimple_block (stmt
))
2613 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2614 gimple_set_block (stmt
, n
? *n
: id
->block
);
2617 /* Remap all the operands in COPY. */
2618 memset (&wi
, 0, sizeof (wi
));
2621 processing_debug_stmt
= 1;
2623 if (gimple_debug_source_bind_p (stmt
))
2624 t
= gimple_debug_source_bind_get_var (stmt
);
2626 t
= gimple_debug_bind_get_var (stmt
);
2628 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2629 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2631 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2634 else if (TREE_CODE (t
) == VAR_DECL
2635 && !is_global_var (t
)
2636 && !pointer_map_contains (id
->decl_map
, t
))
2637 /* T is a non-localized variable. */;
2639 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2641 if (gimple_debug_bind_p (stmt
))
2643 gimple_debug_bind_set_var (stmt
, t
);
2645 if (gimple_debug_bind_has_value_p (stmt
))
2646 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2647 remap_gimple_op_r
, &wi
, NULL
);
2649 /* Punt if any decl couldn't be remapped. */
2650 if (processing_debug_stmt
< 0)
2651 gimple_debug_bind_reset_value (stmt
);
2653 else if (gimple_debug_source_bind_p (stmt
))
2655 gimple_debug_source_bind_set_var (stmt
, t
);
2656 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2657 remap_gimple_op_r
, &wi
, NULL
);
2658 /* When inlining and source bind refers to one of the optimized
2659 away parameters, change the source bind into normal debug bind
2660 referring to the corresponding DEBUG_EXPR_DECL that should have
2661 been bound before the call stmt. */
2662 t
= gimple_debug_source_bind_get_value (stmt
);
2664 && TREE_CODE (t
) == PARM_DECL
2667 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2669 if (debug_args
!= NULL
)
2671 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2672 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2673 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2675 t
= (**debug_args
)[i
+ 1];
2676 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2677 gimple_debug_bind_set_value (stmt
, t
);
2684 processing_debug_stmt
= 0;
2689 /* Process deferred debug stmts. In order to give values better odds
2690 of being successfully remapped, we delay the processing of debug
2691 stmts until all other stmts that might require remapping are
2695 copy_debug_stmts (copy_body_data
*id
)
2700 if (!id
->debug_stmts
.exists ())
2703 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2704 copy_debug_stmt (stmt
, id
);
2706 id
->debug_stmts
.release ();
2709 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2710 another function. */
2713 copy_tree_body (copy_body_data
*id
)
2715 tree fndecl
= id
->src_fn
;
2716 tree body
= DECL_SAVED_TREE (fndecl
);
2718 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2723 /* Make a copy of the body of FN so that it can be inserted inline in
2724 another function. */
2727 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2728 basic_block entry_block_map
, basic_block exit_block_map
,
2729 basic_block new_entry
)
2731 tree fndecl
= id
->src_fn
;
2734 /* If this body has a CFG, walk CFG and copy. */
2735 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2736 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2738 copy_debug_stmts (id
);
2743 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2744 defined in function FN, or of a data member thereof. */
2747 self_inlining_addr_expr (tree value
, tree fn
)
2751 if (TREE_CODE (value
) != ADDR_EXPR
)
2754 var
= get_base_address (TREE_OPERAND (value
, 0));
2756 return var
&& auto_var_in_fn_p (var
, fn
);
2759 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2760 lexical block and line number information from base_stmt, if given,
2761 or from the last stmt of the block otherwise. */
2764 insert_init_debug_bind (copy_body_data
*id
,
2765 basic_block bb
, tree var
, tree value
,
2769 gimple_stmt_iterator gsi
;
2772 if (!gimple_in_ssa_p (id
->src_cfun
))
2775 if (!MAY_HAVE_DEBUG_STMTS
)
2778 tracked_var
= target_for_debug_bind (var
);
2784 gsi
= gsi_last_bb (bb
);
2785 if (!base_stmt
&& !gsi_end_p (gsi
))
2786 base_stmt
= gsi_stmt (gsi
);
2789 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2793 if (!gsi_end_p (gsi
))
2794 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2796 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2803 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2805 /* If VAR represents a zero-sized variable, it's possible that the
2806 assignment statement may result in no gimple statements. */
2809 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2811 /* We can end up with init statements that store to a non-register
2812 from a rhs with a conversion. Handle that here by forcing the
2813 rhs into a temporary. gimple_regimplify_operands is not
2814 prepared to do this for us. */
2815 if (!is_gimple_debug (init_stmt
)
2816 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2817 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2818 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2820 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2821 gimple_expr_type (init_stmt
),
2822 gimple_assign_rhs1 (init_stmt
));
2823 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2825 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2826 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2828 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2829 gimple_regimplify_operands (init_stmt
, &si
);
2831 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2833 tree def
= gimple_assign_lhs (init_stmt
);
2834 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2839 /* Initialize parameter P with VALUE. If needed, produce init statement
2840 at the end of BB. When BB is NULL, we return init statement to be
2843 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2844 basic_block bb
, tree
*vars
)
2846 gimple init_stmt
= NULL
;
2849 tree def
= (gimple_in_ssa_p (cfun
)
2850 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2853 && value
!= error_mark_node
2854 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2856 /* If we can match up types by promotion/demotion do so. */
2857 if (fold_convertible_p (TREE_TYPE (p
), value
))
2858 rhs
= fold_convert (TREE_TYPE (p
), value
);
2861 /* ??? For valid programs we should not end up here.
2862 Still if we end up with truly mismatched types here, fall back
2863 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2864 GIMPLE to the following passes. */
2865 if (!is_gimple_reg_type (TREE_TYPE (value
))
2866 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2867 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2869 rhs
= build_zero_cst (TREE_TYPE (p
));
2873 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2874 here since the type of this decl must be visible to the calling
2876 var
= copy_decl_to_var (p
, id
);
2878 /* Declare this new variable. */
2879 DECL_CHAIN (var
) = *vars
;
2882 /* Make gimplifier happy about this variable. */
2883 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2885 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2886 we would not need to create a new variable here at all, if it
2887 weren't for debug info. Still, we can just use the argument
2889 if (TREE_READONLY (p
)
2890 && !TREE_ADDRESSABLE (p
)
2891 && value
&& !TREE_SIDE_EFFECTS (value
)
2894 /* We may produce non-gimple trees by adding NOPs or introduce
2895 invalid sharing when operand is not really constant.
2896 It is not big deal to prohibit constant propagation here as
2897 we will constant propagate in DOM1 pass anyway. */
2898 if (is_gimple_min_invariant (value
)
2899 && useless_type_conversion_p (TREE_TYPE (p
),
2901 /* We have to be very careful about ADDR_EXPR. Make sure
2902 the base variable isn't a local variable of the inlined
2903 function, e.g., when doing recursive inlining, direct or
2904 mutually-recursive or whatever, which is why we don't
2905 just test whether fn == current_function_decl. */
2906 && ! self_inlining_addr_expr (value
, fn
))
2908 insert_decl_map (id
, p
, value
);
2909 insert_debug_decl_map (id
, p
, var
);
2910 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2914 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2915 that way, when the PARM_DECL is encountered, it will be
2916 automatically replaced by the VAR_DECL. */
2917 insert_decl_map (id
, p
, var
);
2919 /* Even if P was TREE_READONLY, the new VAR should not be.
2920 In the original code, we would have constructed a
2921 temporary, and then the function body would have never
2922 changed the value of P. However, now, we will be
2923 constructing VAR directly. The constructor body may
2924 change its value multiple times as it is being
2925 constructed. Therefore, it must not be TREE_READONLY;
2926 the back-end assumes that TREE_READONLY variable is
2927 assigned to only once. */
2928 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2929 TREE_READONLY (var
) = 0;
2931 /* If there is no setup required and we are in SSA, take the easy route
2932 replacing all SSA names representing the function parameter by the
2933 SSA name passed to function.
2935 We need to construct map for the variable anyway as it might be used
2936 in different SSA names when parameter is set in function.
2938 Do replacement at -O0 for const arguments replaced by constant.
2939 This is important for builtin_constant_p and other construct requiring
2940 constant argument to be visible in inlined function body. */
2941 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2943 || (TREE_READONLY (p
)
2944 && is_gimple_min_invariant (rhs
)))
2945 && (TREE_CODE (rhs
) == SSA_NAME
2946 || is_gimple_min_invariant (rhs
))
2947 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2949 insert_decl_map (id
, def
, rhs
);
2950 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2953 /* If the value of argument is never used, don't care about initializing
2955 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2957 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2958 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2961 /* Initialize this VAR_DECL from the equivalent argument. Convert
2962 the argument to the proper type in case it was promoted. */
2965 if (rhs
== error_mark_node
)
2967 insert_decl_map (id
, p
, var
);
2968 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2971 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2973 /* If we are in SSA form properly remap the default definition
2974 or assign to a dummy SSA name if the parameter is unused and
2975 we are not optimizing. */
2976 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2980 def
= remap_ssa_name (def
, id
);
2981 init_stmt
= gimple_build_assign (def
, rhs
);
2982 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2983 set_ssa_default_def (cfun
, var
, NULL
);
2987 def
= make_ssa_name (var
, NULL
);
2988 init_stmt
= gimple_build_assign (def
, rhs
);
2992 init_stmt
= gimple_build_assign (var
, rhs
);
2994 if (bb
&& init_stmt
)
2995 insert_init_stmt (id
, bb
, init_stmt
);
3000 /* Generate code to initialize the parameters of the function at the
3001 top of the stack in ID from the GIMPLE_CALL STMT. */
3004 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
3005 tree fn
, basic_block bb
)
3010 tree vars
= NULL_TREE
;
3011 tree static_chain
= gimple_call_chain (stmt
);
3013 /* Figure out what the parameters are. */
3014 parms
= DECL_ARGUMENTS (fn
);
3016 /* Loop through the parameter declarations, replacing each with an
3017 equivalent VAR_DECL, appropriately initialized. */
3018 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3021 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3022 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3024 /* After remapping parameters remap their types. This has to be done
3025 in a second loop over all parameters to appropriately remap
3026 variable sized arrays when the size is specified in a
3027 parameter following the array. */
3028 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3030 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
3032 && TREE_CODE (*varp
) == VAR_DECL
)
3034 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3035 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3037 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3038 /* Also remap the default definition if it was remapped
3039 to the default definition of the parameter replacement
3040 by the parameter setup. */
3043 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
3045 && TREE_CODE (*defp
) == SSA_NAME
3046 && SSA_NAME_VAR (*defp
) == var
)
3047 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3052 /* Initialize the static chain. */
3053 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3054 gcc_assert (fn
!= current_function_decl
);
3057 /* No static chain? Seems like a bug in tree-nested.c. */
3058 gcc_assert (static_chain
);
3060 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3063 declare_inline_vars (id
->block
, vars
);
3067 /* Declare a return variable to replace the RESULT_DECL for the
3068 function we are calling. An appropriate DECL_STMT is returned.
3069 The USE_STMT is filled to contain a use of the declaration to
3070 indicate the return value of the function.
3072 RETURN_SLOT, if non-null is place where to store the result. It
3073 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3074 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3076 The return value is a (possibly null) value that holds the result
3077 as seen by the caller. */
3080 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3081 basic_block entry_bb
)
3083 tree callee
= id
->src_fn
;
3084 tree result
= DECL_RESULT (callee
);
3085 tree callee_type
= TREE_TYPE (result
);
3089 /* Handle type-mismatches in the function declaration return type
3090 vs. the call expression. */
3092 caller_type
= TREE_TYPE (modify_dest
);
3094 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3096 /* We don't need to do anything for functions that don't return anything. */
3097 if (VOID_TYPE_P (callee_type
))
3100 /* If there was a return slot, then the return value is the
3101 dereferenced address of that object. */
3104 /* The front end shouldn't have used both return_slot and
3105 a modify expression. */
3106 gcc_assert (!modify_dest
);
3107 if (DECL_BY_REFERENCE (result
))
3109 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3110 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3112 /* We are going to construct *&return_slot and we can't do that
3113 for variables believed to be not addressable.
3115 FIXME: This check possibly can match, because values returned
3116 via return slot optimization are not believed to have address
3117 taken by alias analysis. */
3118 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3119 var
= return_slot_addr
;
3124 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3125 if (TREE_ADDRESSABLE (result
))
3126 mark_addressable (var
);
3128 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3129 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3130 && !DECL_GIMPLE_REG_P (result
)
3132 DECL_GIMPLE_REG_P (var
) = 0;
3137 /* All types requiring non-trivial constructors should have been handled. */
3138 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3140 /* Attempt to avoid creating a new temporary variable. */
3142 && TREE_CODE (modify_dest
) != SSA_NAME
)
3144 bool use_it
= false;
3146 /* We can't use MODIFY_DEST if there's type promotion involved. */
3147 if (!useless_type_conversion_p (callee_type
, caller_type
))
3150 /* ??? If we're assigning to a variable sized type, then we must
3151 reuse the destination variable, because we've no good way to
3152 create variable sized temporaries at this point. */
3153 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3156 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3157 reuse it as the result of the call directly. Don't do this if
3158 it would promote MODIFY_DEST to addressable. */
3159 else if (TREE_ADDRESSABLE (result
))
3163 tree base_m
= get_base_address (modify_dest
);
3165 /* If the base isn't a decl, then it's a pointer, and we don't
3166 know where that's going to go. */
3167 if (!DECL_P (base_m
))
3169 else if (is_global_var (base_m
))
3171 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3172 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3173 && !DECL_GIMPLE_REG_P (result
)
3174 && DECL_GIMPLE_REG_P (base_m
))
3176 else if (!TREE_ADDRESSABLE (base_m
))
3188 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3190 var
= copy_result_decl_to_var (result
, id
);
3191 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3193 /* Do not have the rest of GCC warn about this variable as it should
3194 not be visible to the user. */
3195 TREE_NO_WARNING (var
) = 1;
3197 declare_inline_vars (id
->block
, var
);
3199 /* Build the use expr. If the return type of the function was
3200 promoted, convert it back to the expected type. */
3202 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3204 /* If we can match up types by promotion/demotion do so. */
3205 if (fold_convertible_p (caller_type
, var
))
3206 use
= fold_convert (caller_type
, var
);
3209 /* ??? For valid programs we should not end up here.
3210 Still if we end up with truly mismatched types here, fall back
3211 to using a MEM_REF to not leak invalid GIMPLE to the following
3213 /* Prevent var from being written into SSA form. */
3214 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3215 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3216 DECL_GIMPLE_REG_P (var
) = false;
3217 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3218 TREE_ADDRESSABLE (var
) = true;
3219 use
= fold_build2 (MEM_REF
, caller_type
,
3220 build_fold_addr_expr (var
),
3221 build_int_cst (ptr_type_node
, 0));
3225 STRIP_USELESS_TYPE_CONVERSION (use
);
3227 if (DECL_BY_REFERENCE (result
))
3229 TREE_ADDRESSABLE (var
) = 1;
3230 var
= build_fold_addr_expr (var
);
3234 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3235 way, when the RESULT_DECL is encountered, it will be
3236 automatically replaced by the VAR_DECL.
3238 When returning by reference, ensure that RESULT_DECL remaps to
3240 if (DECL_BY_REFERENCE (result
)
3241 && !is_gimple_val (var
))
3243 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3244 insert_decl_map (id
, result
, temp
);
3245 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3246 it's default_def SSA_NAME. */
3247 if (gimple_in_ssa_p (id
->src_cfun
)
3248 && is_gimple_reg (result
))
3250 temp
= make_ssa_name (temp
, NULL
);
3251 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3253 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3256 insert_decl_map (id
, result
, var
);
3258 /* Remember this so we can ignore it in remap_decls. */
3264 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3265 to a local label. */
3268 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3271 tree fn
= (tree
) fnp
;
3273 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3282 /* Determine if the function can be copied. If so return NULL. If
3283 not return a string describng the reason for failure. */
3286 copy_forbidden (struct function
*fun
, tree fndecl
)
3288 const char *reason
= fun
->cannot_be_copied_reason
;
3292 /* Only examine the function once. */
3293 if (fun
->cannot_be_copied_set
)
3296 /* We cannot copy a function that receives a non-local goto
3297 because we cannot remap the destination label used in the
3298 function that is performing the non-local goto. */
3299 /* ??? Actually, this should be possible, if we work at it.
3300 No doubt there's just a handful of places that simply
3301 assume it doesn't happen and don't substitute properly. */
3302 if (fun
->has_nonlocal_label
)
3304 reason
= G_("function %q+F can never be copied "
3305 "because it receives a non-local goto");
3309 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3310 if (TREE_CODE (decl
) == VAR_DECL
3311 && TREE_STATIC (decl
)
3312 && !DECL_EXTERNAL (decl
)
3313 && DECL_INITIAL (decl
)
3314 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3315 has_label_address_in_static_1
,
3318 reason
= G_("function %q+F can never be copied because it saves "
3319 "address of local label in a static variable");
3324 fun
->cannot_be_copied_reason
= reason
;
3325 fun
->cannot_be_copied_set
= true;
3330 static const char *inline_forbidden_reason
;
3332 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3333 iff a function can not be inlined. Also sets the reason why. */
3336 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3337 struct walk_stmt_info
*wip
)
3339 tree fn
= (tree
) wip
->info
;
3341 gimple stmt
= gsi_stmt (*gsi
);
3343 switch (gimple_code (stmt
))
3346 /* Refuse to inline alloca call unless user explicitly forced so as
3347 this may change program's memory overhead drastically when the
3348 function using alloca is called in loop. In GCC present in
3349 SPEC2000 inlining into schedule_block cause it to require 2GB of
3350 RAM instead of 256MB. Don't do so for alloca calls emitted for
3351 VLA objects as those can't cause unbounded growth (they're always
3352 wrapped inside stack_save/stack_restore regions. */
3353 if (gimple_alloca_call_p (stmt
)
3354 && !gimple_call_alloca_for_var_p (stmt
)
3355 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3357 inline_forbidden_reason
3358 = G_("function %q+F can never be inlined because it uses "
3359 "alloca (override using the always_inline attribute)");
3360 *handled_ops_p
= true;
3364 t
= gimple_call_fndecl (stmt
);
3368 /* We cannot inline functions that call setjmp. */
3369 if (setjmp_call_p (t
))
3371 inline_forbidden_reason
3372 = G_("function %q+F can never be inlined because it uses setjmp");
3373 *handled_ops_p
= true;
3377 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3378 switch (DECL_FUNCTION_CODE (t
))
3380 /* We cannot inline functions that take a variable number of
3382 case BUILT_IN_VA_START
:
3383 case BUILT_IN_NEXT_ARG
:
3384 case BUILT_IN_VA_END
:
3385 inline_forbidden_reason
3386 = G_("function %q+F can never be inlined because it "
3387 "uses variable argument lists");
3388 *handled_ops_p
= true;
3391 case BUILT_IN_LONGJMP
:
3392 /* We can't inline functions that call __builtin_longjmp at
3393 all. The non-local goto machinery really requires the
3394 destination be in a different function. If we allow the
3395 function calling __builtin_longjmp to be inlined into the
3396 function calling __builtin_setjmp, Things will Go Awry. */
3397 inline_forbidden_reason
3398 = G_("function %q+F can never be inlined because "
3399 "it uses setjmp-longjmp exception handling");
3400 *handled_ops_p
= true;
3403 case BUILT_IN_NONLOCAL_GOTO
:
3405 inline_forbidden_reason
3406 = G_("function %q+F can never be inlined because "
3407 "it uses non-local goto");
3408 *handled_ops_p
= true;
3411 case BUILT_IN_RETURN
:
3412 case BUILT_IN_APPLY_ARGS
:
3413 /* If a __builtin_apply_args caller would be inlined,
3414 it would be saving arguments of the function it has
3415 been inlined into. Similarly __builtin_return would
3416 return from the function the inline has been inlined into. */
3417 inline_forbidden_reason
3418 = G_("function %q+F can never be inlined because "
3419 "it uses __builtin_return or __builtin_apply_args");
3420 *handled_ops_p
= true;
3429 t
= gimple_goto_dest (stmt
);
3431 /* We will not inline a function which uses computed goto. The
3432 addresses of its local labels, which may be tucked into
3433 global storage, are of course not constant across
3434 instantiations, which causes unexpected behavior. */
3435 if (TREE_CODE (t
) != LABEL_DECL
)
3437 inline_forbidden_reason
3438 = G_("function %q+F can never be inlined "
3439 "because it contains a computed goto");
3440 *handled_ops_p
= true;
3449 *handled_ops_p
= false;
3453 /* Return true if FNDECL is a function that cannot be inlined into
3457 inline_forbidden_p (tree fndecl
)
3459 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3460 struct walk_stmt_info wi
;
3461 struct pointer_set_t
*visited_nodes
;
3463 bool forbidden_p
= false;
3465 /* First check for shared reasons not to copy the code. */
3466 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3467 if (inline_forbidden_reason
!= NULL
)
3470 /* Next, walk the statements of the function looking for
3471 constraucts we can't handle, or are non-optimal for inlining. */
3472 visited_nodes
= pointer_set_create ();
3473 memset (&wi
, 0, sizeof (wi
));
3474 wi
.info
= (void *) fndecl
;
3475 wi
.pset
= visited_nodes
;
3477 FOR_EACH_BB_FN (bb
, fun
)
3480 gimple_seq seq
= bb_seq (bb
);
3481 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3482 forbidden_p
= (ret
!= NULL
);
3487 pointer_set_destroy (visited_nodes
);
3491 /* Return false if the function FNDECL cannot be inlined on account of its
3492 attributes, true otherwise. */
3494 function_attribute_inlinable_p (const_tree fndecl
)
3496 if (targetm
.attribute_table
)
3500 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3502 const_tree name
= TREE_PURPOSE (a
);
3505 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3506 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3507 return targetm
.function_attribute_inlinable_p (fndecl
);
3514 /* Returns nonzero if FN is a function that does not have any
3515 fundamental inline blocking properties. */
3518 tree_inlinable_function_p (tree fn
)
3520 bool inlinable
= true;
3524 /* If we've already decided this function shouldn't be inlined,
3525 there's no need to check again. But the cached bit from analysis
3526 can be reset during decl merge in multi-module compilation (C FE only).
3527 The problem is we can not really use a 2 state cached value --
3528 can not tell the init state (unknown value) from a computed value. */
3529 if (DECL_UNINLINABLE (fn
)
3530 && (!L_IPO_COMP_MODE
3531 || lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))))
3534 /* We only warn for functions declared `inline' by the user. */
3535 do_warning
= (warn_inline
3536 && DECL_DECLARED_INLINE_P (fn
)
3537 && !DECL_NO_INLINE_WARNING_P (fn
)
3538 && !DECL_IN_SYSTEM_HEADER (fn
));
3540 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3543 && always_inline
== NULL
)
3546 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3547 "is suppressed using -fno-inline", fn
);
3551 else if (!function_attribute_inlinable_p (fn
))
3554 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3555 "uses attributes conflicting with inlining", fn
);
3559 else if (inline_forbidden_p (fn
))
3561 /* See if we should warn about uninlinable functions. Previously,
3562 some of these warnings would be issued while trying to expand
3563 the function inline, but that would cause multiple warnings
3564 about functions that would for example call alloca. But since
3565 this a property of the function, just one warning is enough.
3566 As a bonus we can now give more details about the reason why a
3567 function is not inlinable. */
3569 error (inline_forbidden_reason
, fn
);
3570 else if (do_warning
)
3571 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3576 /* Squirrel away the result so that we don't have to check again. */
3577 DECL_UNINLINABLE (fn
) = !inlinable
;
3582 /* Estimate the cost of a memory move. Use machine dependent
3583 word size and take possible memcpy call into account. */
3586 estimate_move_cost (tree type
)
3590 gcc_assert (!VOID_TYPE_P (type
));
3592 if (TREE_CODE (type
) == VECTOR_TYPE
)
3594 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3595 enum machine_mode simd
3596 = targetm
.vectorize
.preferred_simd_mode (inner
);
3597 int simd_mode_size
= GET_MODE_SIZE (simd
);
3598 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3602 size
= int_size_in_bytes (type
);
3604 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3605 /* Cost of a memcpy call, 3 arguments and the call. */
3608 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3611 /* Returns cost of operation CODE, according to WEIGHTS */
3614 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3615 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3619 /* These are "free" conversions, or their presumed cost
3620 is folded into other operations. */
3625 case VIEW_CONVERT_EXPR
:
3628 /* Assign cost of 1 to usual operations.
3629 ??? We may consider mapping RTL costs to this. */
3635 case POINTER_PLUS_EXPR
:
3638 case MULT_HIGHPART_EXPR
:
3641 case ADDR_SPACE_CONVERT_EXPR
:
3642 case FIXED_CONVERT_EXPR
:
3643 case FIX_TRUNC_EXPR
:
3655 case VEC_LSHIFT_EXPR
:
3656 case VEC_RSHIFT_EXPR
:
3663 case TRUTH_ANDIF_EXPR
:
3664 case TRUTH_ORIF_EXPR
:
3665 case TRUTH_AND_EXPR
:
3667 case TRUTH_XOR_EXPR
:
3668 case TRUTH_NOT_EXPR
:
3677 case UNORDERED_EXPR
:
3688 case PREDECREMENT_EXPR
:
3689 case PREINCREMENT_EXPR
:
3690 case POSTDECREMENT_EXPR
:
3691 case POSTINCREMENT_EXPR
:
3693 case REALIGN_LOAD_EXPR
:
3695 case REDUC_MAX_EXPR
:
3696 case REDUC_MIN_EXPR
:
3697 case REDUC_PLUS_EXPR
:
3698 case WIDEN_SUM_EXPR
:
3699 case WIDEN_MULT_EXPR
:
3701 case WIDEN_MULT_PLUS_EXPR
:
3702 case WIDEN_MULT_MINUS_EXPR
:
3703 case WIDEN_LSHIFT_EXPR
:
3705 case VEC_WIDEN_MULT_HI_EXPR
:
3706 case VEC_WIDEN_MULT_LO_EXPR
:
3707 case VEC_WIDEN_MULT_EVEN_EXPR
:
3708 case VEC_WIDEN_MULT_ODD_EXPR
:
3709 case VEC_UNPACK_HI_EXPR
:
3710 case VEC_UNPACK_LO_EXPR
:
3711 case VEC_UNPACK_FLOAT_HI_EXPR
:
3712 case VEC_UNPACK_FLOAT_LO_EXPR
:
3713 case VEC_PACK_TRUNC_EXPR
:
3714 case VEC_PACK_SAT_EXPR
:
3715 case VEC_PACK_FIX_TRUNC_EXPR
:
3716 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3717 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3721 /* Few special cases of expensive operations. This is useful
3722 to avoid inlining on functions having too many of these. */
3723 case TRUNC_DIV_EXPR
:
3725 case FLOOR_DIV_EXPR
:
3726 case ROUND_DIV_EXPR
:
3727 case EXACT_DIV_EXPR
:
3728 case TRUNC_MOD_EXPR
:
3730 case FLOOR_MOD_EXPR
:
3731 case ROUND_MOD_EXPR
:
3733 if (TREE_CODE (op2
) != INTEGER_CST
)
3734 return weights
->div_mod_cost
;
3738 /* We expect a copy assignment with no operator. */
3739 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3745 /* Estimate number of instructions that will be created by expanding
3746 the statements in the statement sequence STMTS.
3747 WEIGHTS contains weights attributed to various constructs. */
3750 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3753 gimple_stmt_iterator gsi
;
3756 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3757 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3763 /* Estimate number of instructions that will be created by expanding STMT.
3764 WEIGHTS contains weights attributed to various constructs. */
3767 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3770 enum gimple_code code
= gimple_code (stmt
);
3777 /* Try to estimate the cost of assignments. We have three cases to
3779 1) Simple assignments to registers;
3780 2) Stores to things that must live in memory. This includes
3781 "normal" stores to scalars, but also assignments of large
3782 structures, or constructors of big arrays;
3784 Let us look at the first two cases, assuming we have "a = b + C":
3785 <GIMPLE_ASSIGN <var_decl "a">
3786 <plus_expr <var_decl "b"> <constant C>>
3787 If "a" is a GIMPLE register, the assignment to it is free on almost
3788 any target, because "a" usually ends up in a real register. Hence
3789 the only cost of this expression comes from the PLUS_EXPR, and we
3790 can ignore the GIMPLE_ASSIGN.
3791 If "a" is not a GIMPLE register, the assignment to "a" will most
3792 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3793 of moving something into "a", which we compute using the function
3794 estimate_move_cost. */
3795 if (gimple_clobber_p (stmt
))
3796 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3798 lhs
= gimple_assign_lhs (stmt
);
3799 rhs
= gimple_assign_rhs1 (stmt
);
3803 /* Account for the cost of moving to / from memory. */
3804 if (gimple_store_p (stmt
))
3805 cost
+= estimate_move_cost (TREE_TYPE (lhs
));
3806 if (gimple_assign_load_p (stmt
))
3807 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3809 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3810 gimple_assign_rhs1 (stmt
),
3811 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3812 == GIMPLE_BINARY_RHS
3813 ? gimple_assign_rhs2 (stmt
) : NULL
);
3817 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3818 gimple_op (stmt
, 0),
3819 gimple_op (stmt
, 1));
3823 /* Take into account cost of the switch + guess 2 conditional jumps for
3826 TODO: once the switch expansion logic is sufficiently separated, we can
3827 do better job on estimating cost of the switch. */
3828 if (weights
->time_based
)
3829 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3831 cost
= gimple_switch_num_labels (stmt
) * 2;
3838 if (gimple_call_internal_p (stmt
))
3840 else if ((decl
= gimple_call_fndecl (stmt
))
3841 && DECL_BUILT_IN (decl
))
3843 /* Do not special case builtins where we see the body.
3844 This just confuse inliner. */
3845 struct cgraph_node
*node
;
3846 if (!(node
= cgraph_get_node (decl
))
3847 || node
->definition
)
3849 /* For buitins that are likely expanded to nothing or
3850 inlined do not account operand costs. */
3851 else if (is_simple_builtin (decl
))
3853 else if (is_inexpensive_builtin (decl
))
3854 return weights
->target_builtin_call_cost
;
3855 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3857 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3858 specialize the cheap expansion we do here.
3859 ??? This asks for a more general solution. */
3860 switch (DECL_FUNCTION_CODE (decl
))
3865 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3866 && REAL_VALUES_EQUAL
3867 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3868 return estimate_operator_cost
3869 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
3870 gimple_call_arg (stmt
, 0));
3879 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
3880 if (gimple_call_lhs (stmt
))
3881 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3882 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3884 tree arg
= gimple_call_arg (stmt
, i
);
3885 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3891 return weights
->return_cost
;
3897 case GIMPLE_PREDICT
:
3903 int count
= asm_str_count (gimple_asm_string (stmt
));
3904 /* 1000 means infinity. This avoids overflows later
3905 with very long asm statements. */
3912 /* This is either going to be an external function call with one
3913 argument, or two register copy statements plus a goto. */
3916 case GIMPLE_EH_DISPATCH
:
3917 /* ??? This is going to turn into a switch statement. Ideally
3918 we'd have a look at the eh region and estimate the number of
3923 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3925 case GIMPLE_EH_FILTER
:
3926 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3929 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3932 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3933 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3935 /* OpenMP directives are generally very expensive. */
3937 case GIMPLE_OMP_RETURN
:
3938 case GIMPLE_OMP_SECTIONS_SWITCH
:
3939 case GIMPLE_OMP_ATOMIC_STORE
:
3940 case GIMPLE_OMP_CONTINUE
:
3941 /* ...except these, which are cheap. */
3944 case GIMPLE_OMP_ATOMIC_LOAD
:
3945 return weights
->omp_cost
;
3947 case GIMPLE_OMP_FOR
:
3948 return (weights
->omp_cost
3949 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3950 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3952 case GIMPLE_OMP_PARALLEL
:
3953 case GIMPLE_OMP_TASK
:
3954 case GIMPLE_OMP_CRITICAL
:
3955 case GIMPLE_OMP_MASTER
:
3956 case GIMPLE_OMP_TASKGROUP
:
3957 case GIMPLE_OMP_ORDERED
:
3958 case GIMPLE_OMP_SECTION
:
3959 case GIMPLE_OMP_SECTIONS
:
3960 case GIMPLE_OMP_SINGLE
:
3961 case GIMPLE_OMP_TARGET
:
3962 case GIMPLE_OMP_TEAMS
:
3963 return (weights
->omp_cost
3964 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3966 case GIMPLE_TRANSACTION
:
3967 return (weights
->tm_cost
3968 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3978 /* Estimate number of instructions that will be created by expanding
3979 function FNDECL. WEIGHTS contains weights attributed to various
3983 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3985 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3986 gimple_stmt_iterator bsi
;
3990 gcc_assert (my_function
&& my_function
->cfg
);
3991 FOR_EACH_BB_FN (bb
, my_function
)
3993 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3994 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4001 /* Initializes weights used by estimate_num_insns. */
4004 init_inline_once (void)
4006 eni_size_weights
.call_cost
= 1;
4007 eni_size_weights
.indirect_call_cost
= 3;
4008 eni_size_weights
.target_builtin_call_cost
= 1;
4009 eni_size_weights
.div_mod_cost
= 1;
4010 eni_size_weights
.omp_cost
= 40;
4011 eni_size_weights
.tm_cost
= 10;
4012 eni_size_weights
.time_based
= false;
4013 eni_size_weights
.return_cost
= 1;
4015 /* Estimating time for call is difficult, since we have no idea what the
4016 called function does. In the current uses of eni_time_weights,
4017 underestimating the cost does less harm than overestimating it, so
4018 we choose a rather small value here. */
4019 eni_time_weights
.call_cost
= 10;
4020 eni_time_weights
.indirect_call_cost
= 15;
4021 eni_time_weights
.target_builtin_call_cost
= 1;
4022 eni_time_weights
.div_mod_cost
= 10;
4023 eni_time_weights
.omp_cost
= 40;
4024 eni_time_weights
.tm_cost
= 40;
4025 eni_time_weights
.time_based
= true;
4026 eni_time_weights
.return_cost
= 2;
4029 /* Estimate the number of instructions in a gimple_seq. */
4032 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
4034 gimple_stmt_iterator gsi
;
4036 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4037 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4043 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4046 prepend_lexical_block (tree current_block
, tree new_block
)
4048 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4049 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4050 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4053 /* Add local variables from CALLEE to CALLER. */
4056 add_local_variables (struct function
*callee
, struct function
*caller
,
4062 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4063 if (!can_be_nonlocal (var
, id
))
4065 tree new_var
= remap_decl (var
, id
);
4067 /* Remap debug-expressions. */
4068 if (TREE_CODE (new_var
) == VAR_DECL
4069 && DECL_HAS_DEBUG_EXPR_P (var
)
4072 tree tem
= DECL_DEBUG_EXPR (var
);
4073 bool old_regimplify
= id
->regimplify
;
4075 /* The mapped debug expression might be deleted
4076 as a varpool node (the reachbility analysis
4077 of varpool node does not check the reference
4078 from debug expressions.
4079 Set it to 0 for all global vars. */
4080 if (L_IPO_COMP_MODE
&& tem
&& TREE_CODE (tem
) == VAR_DECL
4081 && is_global_var (tem
))
4084 id
->remapping_type_depth
++;
4085 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4086 id
->remapping_type_depth
--;
4087 id
->regimplify
= old_regimplify
;
4088 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4089 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4091 add_local_decl (caller
, new_var
);
4095 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4098 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
4102 struct pointer_map_t
*st
, *dst
;
4105 location_t saved_location
;
4106 struct cgraph_edge
*cg_edge
;
4107 cgraph_inline_failed_t reason
;
4108 basic_block return_block
;
4110 gimple_stmt_iterator gsi
, stmt_gsi
;
4111 bool successfully_inlined
= FALSE
;
4112 bool purge_dead_abnormal_edges
;
4114 /* Set input_location here so we get the right instantiation context
4115 if we call instantiate_decl from inlinable_function_p. */
4116 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
4117 saved_location
= input_location
;
4118 input_location
= gimple_location (stmt
);
4120 /* From here on, we're only interested in CALL_EXPRs. */
4121 if (gimple_code (stmt
) != GIMPLE_CALL
)
4124 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
4125 gcc_checking_assert (cg_edge
);
4126 /* First, see if we can figure out what function is being called.
4127 If we cannot, then there is no hope of inlining the function. */
4128 if (cg_edge
->indirect_unknown_callee
)
4130 fn
= cg_edge
->callee
->decl
;
4131 gcc_checking_assert (fn
);
4133 /* If FN is a declaration of a function in a nested scope that was
4134 globally declared inline, we don't set its DECL_INITIAL.
4135 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4136 C++ front-end uses it for cdtors to refer to their internal
4137 declarations, that are not real functions. Fortunately those
4138 don't have trees to be saved, so we can tell by checking their
4140 if (!DECL_INITIAL (fn
)
4141 && DECL_ABSTRACT_ORIGIN (fn
)
4142 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4143 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4145 /* Don't try to inline functions that are not well-suited to inlining. */
4146 if (cg_edge
->inline_failed
)
4148 reason
= cg_edge
->inline_failed
;
4149 /* If this call was originally indirect, we do not want to emit any
4150 inlining related warnings or sorry messages because there are no
4151 guarantees regarding those. */
4152 if (cg_edge
->indirect_inlining_edge
)
4155 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4156 /* For extern inline functions that get redefined we always
4157 silently ignored always_inline flag. Better behaviour would
4158 be to be able to keep both bodies and use extern inline body
4159 for inlining, but we can't do that because frontends overwrite
4161 && !cg_edge
->callee
->local
.redefined_extern_inline
4162 /* During early inline pass, report only when optimization is
4164 && (cgraph_global_info_ready
4166 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4167 /* PR 20090218-1_0.c. Body can be provided by another module. */
4168 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4170 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4171 cgraph_inline_failed_string (reason
));
4172 error ("called from here");
4174 else if (warn_inline
4175 && DECL_DECLARED_INLINE_P (fn
)
4176 && !DECL_NO_INLINE_WARNING_P (fn
)
4177 && !DECL_IN_SYSTEM_HEADER (fn
)
4178 && reason
!= CIF_UNSPECIFIED
4179 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4180 /* Do not warn about not inlined recursive calls. */
4181 && !cgraph_edge_recursive_p (cg_edge
)
4182 /* Avoid warnings during early inline pass. */
4183 && cgraph_global_info_ready
)
4185 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4186 fn
, _(cgraph_inline_failed_string (reason
)));
4187 warning (OPT_Winline
, "called from here");
4191 fn
= cg_edge
->callee
->decl
;
4192 cgraph_get_body (cg_edge
->callee
);
4194 #ifdef ENABLE_CHECKING
4195 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4196 verify_cgraph_node (cg_edge
->callee
);
4199 /* We will be inlining this callee. */
4200 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4202 /* Update the callers EH personality. */
4203 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4204 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4205 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4207 /* Split the block holding the GIMPLE_CALL. */
4208 e
= split_block (bb
, stmt
);
4210 return_block
= e
->dest
;
4213 /* split_block splits after the statement; work around this by
4214 moving the call into the second block manually. Not pretty,
4215 but seems easier than doing the CFG manipulation by hand
4216 when the GIMPLE_CALL is in the last statement of BB. */
4217 stmt_gsi
= gsi_last_bb (bb
);
4218 gsi_remove (&stmt_gsi
, false);
4220 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4221 been the source of abnormal edges. In this case, schedule
4222 the removal of dead abnormal edges. */
4223 gsi
= gsi_start_bb (return_block
);
4224 if (gsi_end_p (gsi
))
4226 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4227 purge_dead_abnormal_edges
= true;
4231 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4232 purge_dead_abnormal_edges
= false;
4235 stmt_gsi
= gsi_start_bb (return_block
);
4237 /* Build a block containing code to initialize the arguments, the
4238 actual inline expansion of the body, and a label for the return
4239 statements within the function to jump to. The type of the
4240 statement expression is the return type of the function call.
4241 ??? If the call does not have an associated block then we will
4242 remap all callee blocks to NULL, effectively dropping most of
4243 its debug information. This should only happen for calls to
4244 artificial decls inserted by the compiler itself. We need to
4245 either link the inlined blocks into the caller block tree or
4246 not refer to them in any way to not break GC for locations. */
4247 if (gimple_block (stmt
))
4249 id
->block
= make_node (BLOCK
);
4250 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4251 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
4252 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4255 /* Local declarations will be replaced by their equivalents in this
4258 id
->decl_map
= pointer_map_create ();
4259 dst
= id
->debug_map
;
4260 id
->debug_map
= NULL
;
4262 /* Record the function we are about to inline. */
4264 id
->src_node
= cg_edge
->callee
;
4265 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4266 id
->gimple_call
= stmt
;
4268 gcc_assert (!id
->src_cfun
->after_inlining
);
4271 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4273 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4274 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4278 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4280 if (DECL_INITIAL (fn
))
4282 if (gimple_block (stmt
))
4286 prepend_lexical_block (id
->block
,
4287 remap_blocks (DECL_INITIAL (fn
), id
));
4288 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4289 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4291 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4292 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4293 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4294 under it. The parameters can be then evaluated in the debugger,
4295 but don't show in backtraces. */
4296 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4297 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4300 *var
= TREE_CHAIN (v
);
4301 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4302 BLOCK_VARS (id
->block
) = v
;
4305 var
= &TREE_CHAIN (*var
);
4308 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4311 /* Return statements in the function body will be replaced by jumps
4312 to the RET_LABEL. */
4313 gcc_assert (DECL_INITIAL (fn
));
4314 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4316 /* Find the LHS to which the result of this call is assigned. */
4318 if (gimple_call_lhs (stmt
))
4320 modify_dest
= gimple_call_lhs (stmt
);
4322 /* The function which we are inlining might not return a value,
4323 in which case we should issue a warning that the function
4324 does not return a value. In that case the optimizers will
4325 see that the variable to which the value is assigned was not
4326 initialized. We do not want to issue a warning about that
4327 uninitialized variable. */
4328 if (DECL_P (modify_dest
))
4329 TREE_NO_WARNING (modify_dest
) = 1;
4331 if (gimple_call_return_slot_opt_p (stmt
))
4333 return_slot
= modify_dest
;
4340 /* If we are inlining a call to the C++ operator new, we don't want
4341 to use type based alias analysis on the return value. Otherwise
4342 we may get confused if the compiler sees that the inlined new
4343 function returns a pointer which was just deleted. See bug
4345 if (DECL_IS_OPERATOR_NEW (fn
))
4351 /* Declare the return variable for the function. */
4352 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4354 /* Add local vars in this inlined callee to caller. */
4355 add_local_variables (id
->src_cfun
, cfun
, id
);
4357 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4359 fprintf (dump_file
, "Inlining ");
4360 print_generic_expr (dump_file
, id
->src_fn
, 0);
4361 fprintf (dump_file
, " to ");
4362 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4363 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4366 /* This is it. Duplicate the callee body. Assume callee is
4367 pre-gimplified. Note that we must not alter the caller
4368 function in any way before this point, as this CALL_EXPR may be
4369 a self-referential call; if we're calling ourselves, we need to
4370 duplicate our body before altering anything. */
4371 copy_body (id
, bb
->count
,
4372 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4373 bb
, return_block
, NULL
);
4375 /* Reset the escaped solution. */
4376 if (cfun
->gimple_df
)
4377 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4382 pointer_map_destroy (id
->debug_map
);
4383 id
->debug_map
= dst
;
4385 pointer_map_destroy (id
->decl_map
);
4388 /* Unlink the calls virtual operands before replacing it. */
4389 unlink_stmt_vdef (stmt
);
4390 if (gimple_vdef (stmt
)
4391 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4392 release_ssa_name (gimple_vdef (stmt
));
4394 /* If the inlined function returns a result that we care about,
4395 substitute the GIMPLE_CALL with an assignment of the return
4396 variable to the LHS of the call. That is, if STMT was
4397 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4398 if (use_retvar
&& gimple_call_lhs (stmt
))
4400 gimple old_stmt
= stmt
;
4401 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4402 gsi_replace (&stmt_gsi
, stmt
, false);
4403 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4407 /* Handle the case of inlining a function with no return
4408 statement, which causes the return value to become undefined. */
4409 if (gimple_call_lhs (stmt
)
4410 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4412 tree name
= gimple_call_lhs (stmt
);
4413 tree var
= SSA_NAME_VAR (name
);
4414 tree def
= ssa_default_def (cfun
, var
);
4418 /* If the variable is used undefined, make this name
4419 undefined via a move. */
4420 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4421 gsi_replace (&stmt_gsi
, stmt
, true);
4425 /* Otherwise make this variable undefined. */
4426 gsi_remove (&stmt_gsi
, true);
4427 set_ssa_default_def (cfun
, var
, name
);
4428 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4432 gsi_remove (&stmt_gsi
, true);
4435 if (purge_dead_abnormal_edges
)
4437 gimple_purge_dead_eh_edges (return_block
);
4438 gimple_purge_dead_abnormal_call_edges (return_block
);
4441 /* If the value of the new expression is ignored, that's OK. We
4442 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4443 the equivalent inlined version either. */
4444 if (is_gimple_assign (stmt
))
4446 gcc_assert (gimple_assign_single_p (stmt
)
4447 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4448 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4451 /* Output the inlining info for this abstract function, since it has been
4452 inlined. If we don't do this now, we can lose the information about the
4453 variables in the function when the blocks get blown away as soon as we
4454 remove the cgraph node. */
4455 if (gimple_block (stmt
))
4456 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4458 /* Update callgraph if needed. */
4459 cgraph_remove_node (cg_edge
->callee
);
4461 id
->block
= NULL_TREE
;
4462 successfully_inlined
= TRUE
;
4465 input_location
= saved_location
;
4466 return successfully_inlined
;
4469 /* Expand call statements reachable from STMT_P.
4470 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4471 in a MODIFY_EXPR. */
4474 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4476 gimple_stmt_iterator gsi
;
4478 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4480 gimple stmt
= gsi_stmt (gsi
);
4482 if (is_gimple_call (stmt
)
4483 && !gimple_call_internal_p (stmt
)
4484 && expand_call_inline (bb
, stmt
, id
))
4492 /* Walk all basic blocks created after FIRST and try to fold every statement
4493 in the STATEMENTS pointer set. */
4496 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4498 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4499 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4501 gimple_stmt_iterator gsi
;
4503 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4506 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4508 gimple old_stmt
= gsi_stmt (gsi
);
4509 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4511 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4513 /* Folding builtins can create multiple instructions,
4514 we need to look at all of them. */
4515 gimple_stmt_iterator i2
= gsi
;
4517 if (fold_stmt (&gsi
))
4520 /* If a builtin at the end of a bb folded into nothing,
4521 the following loop won't work. */
4522 if (gsi_end_p (gsi
))
4524 cgraph_update_edges_for_call_stmt (old_stmt
,
4529 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4534 new_stmt
= gsi_stmt (i2
);
4535 update_stmt (new_stmt
);
4536 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4539 if (new_stmt
== gsi_stmt (gsi
))
4541 /* It is okay to check only for the very last
4542 of these statements. If it is a throwing
4543 statement nothing will change. If it isn't
4544 this can remove EH edges. If that weren't
4545 correct then because some intermediate stmts
4546 throw, but not the last one. That would mean
4547 we'd have to split the block, which we can't
4548 here and we'd loose anyway. And as builtins
4549 probably never throw, this all
4551 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4553 gimple_purge_dead_eh_edges (
4554 BASIC_BLOCK_FOR_FN (cfun
, first
));
4561 else if (fold_stmt (&gsi
))
4563 /* Re-read the statement from GSI as fold_stmt() may
4565 gimple new_stmt
= gsi_stmt (gsi
);
4566 update_stmt (new_stmt
);
4568 if (is_gimple_call (old_stmt
)
4569 || is_gimple_call (new_stmt
))
4570 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4573 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4574 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
4581 /* Expand calls to inline functions in the body of FN. */
4584 optimize_inline_calls (tree fn
)
4588 int last
= n_basic_blocks_for_fn (cfun
);
4589 bool inlined_p
= false;
4592 memset (&id
, 0, sizeof (id
));
4594 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4595 gcc_assert (id
.dst_node
->definition
);
4597 /* Or any functions that aren't finished yet. */
4598 if (current_function_decl
)
4599 id
.dst_fn
= current_function_decl
;
4601 id
.copy_decl
= copy_decl_maybe_to_var
;
4602 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4603 id
.transform_new_cfg
= false;
4604 id
.transform_return_to_modify
= true;
4605 id
.transform_parameter
= true;
4606 id
.transform_lang_insert_block
= NULL
;
4607 id
.statements_to_fold
= pointer_set_create ();
4609 push_gimplify_context ();
4611 /* We make no attempts to keep dominance info up-to-date. */
4612 free_dominance_info (CDI_DOMINATORS
);
4613 free_dominance_info (CDI_POST_DOMINATORS
);
4615 /* Register specific gimple functions. */
4616 gimple_register_cfg_hooks ();
4618 /* Reach the trees by walking over the CFG, and note the
4619 enclosing basic-blocks in the call edges. */
4620 /* We walk the blocks going forward, because inlined function bodies
4621 will split id->current_basic_block, and the new blocks will
4622 follow it; we'll trudge through them, processing their CALL_EXPRs
4624 FOR_EACH_BB_FN (bb
, cfun
)
4625 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4627 pop_gimplify_context (NULL
);
4629 #ifdef ENABLE_CHECKING
4631 struct cgraph_edge
*e
;
4633 verify_cgraph_node (id
.dst_node
);
4635 /* Double check that we inlined everything we are supposed to inline. */
4636 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4637 gcc_assert (e
->inline_failed
|| !e
->call_stmt
/*fake edge*/);
4641 /* Fold queued statements. */
4642 fold_marked_statements (last
, id
.statements_to_fold
);
4643 pointer_set_destroy (id
.statements_to_fold
);
4645 gcc_assert (!id
.debug_stmts
.exists ());
4647 /* If we didn't inline into the function there is nothing to do. */
4651 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4654 delete_unreachable_blocks_update_callgraph (&id
);
4655 #ifdef ENABLE_CHECKING
4656 verify_cgraph_node (id
.dst_node
);
4659 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4660 not possible yet - the IPA passes might make various functions to not
4661 throw and they don't care to proactively update local EH info. This is
4662 done later in fixup_cfg pass that also execute the verification. */
4663 return (TODO_update_ssa
4665 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4666 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4667 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
4668 ? TODO_rebuild_frequencies
: 0));
4671 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4674 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4676 enum tree_code code
= TREE_CODE (*tp
);
4677 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4679 /* We make copies of most nodes. */
4680 if (IS_EXPR_CODE_CLASS (cl
)
4681 || code
== TREE_LIST
4683 || code
== TYPE_DECL
4684 || code
== OMP_CLAUSE
)
4686 /* Because the chain gets clobbered when we make a copy, we save it
4688 tree chain
= NULL_TREE
, new_tree
;
4690 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4691 chain
= TREE_CHAIN (*tp
);
4693 /* Copy the node. */
4694 new_tree
= copy_node (*tp
);
4698 /* Now, restore the chain, if appropriate. That will cause
4699 walk_tree to walk into the chain as well. */
4700 if (code
== PARM_DECL
4701 || code
== TREE_LIST
4702 || code
== OMP_CLAUSE
)
4703 TREE_CHAIN (*tp
) = chain
;
4705 /* For now, we don't update BLOCKs when we make copies. So, we
4706 have to nullify all BIND_EXPRs. */
4707 if (TREE_CODE (*tp
) == BIND_EXPR
)
4708 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4710 else if (code
== CONSTRUCTOR
)
4712 /* CONSTRUCTOR nodes need special handling because
4713 we need to duplicate the vector of elements. */
4716 new_tree
= copy_node (*tp
);
4717 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
4720 else if (code
== STATEMENT_LIST
)
4721 /* We used to just abort on STATEMENT_LIST, but we can run into them
4722 with statement-expressions (c++/40975). */
4723 copy_statement_list (tp
);
4724 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4726 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4730 && (code
== VAR_DECL
)
4731 && (TREE_STATIC (*tp
) || DECL_EXTERNAL (*tp
)))
4733 tree resolved_decl
= real_varpool_node (*tp
)->decl
;
4734 if (resolved_decl
!= *tp
)
4736 *tp
= resolved_decl
;
4740 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4745 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4746 information indicating to what new SAVE_EXPR this one should be mapped,
4747 use that one. Otherwise, create a new node and enter it in ST. FN is
4748 the function into which the copy will be placed. */
4751 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4753 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4757 /* See if we already encountered this SAVE_EXPR. */
4758 n
= (tree
*) pointer_map_contains (st
, *tp
);
4760 /* If we didn't already remap this SAVE_EXPR, do so now. */
4763 t
= copy_node (*tp
);
4765 /* Remember this SAVE_EXPR. */
4766 *pointer_map_insert (st
, *tp
) = t
;
4767 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4768 *pointer_map_insert (st
, t
) = t
;
4772 /* We've already walked into this SAVE_EXPR; don't do it again. */
4777 /* Replace this SAVE_EXPR with the copy. */
4781 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4782 label, copies the declaration and enters it in the splay_tree in DATA (which
4783 is really a 'copy_body_data *'. */
4786 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4787 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4788 struct walk_stmt_info
*wi
)
4790 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4791 gimple stmt
= gsi_stmt (*gsip
);
4793 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4795 tree decl
= gimple_label_label (stmt
);
4797 /* Copy the decl and remember the copy. */
4798 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4805 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4806 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4807 remaps all local declarations to appropriate replacements in gimple
4811 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4813 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4814 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4815 struct pointer_map_t
*st
= id
->decl_map
;
4819 /* Only a local declaration (variable or label). */
4820 if ((TREE_CODE (expr
) == VAR_DECL
4821 && !TREE_STATIC (expr
))
4822 || TREE_CODE (expr
) == LABEL_DECL
)
4824 /* Lookup the declaration. */
4825 n
= (tree
*) pointer_map_contains (st
, expr
);
4827 /* If it's there, remap it. */
4832 else if (TREE_CODE (expr
) == STATEMENT_LIST
4833 || TREE_CODE (expr
) == BIND_EXPR
4834 || TREE_CODE (expr
) == SAVE_EXPR
)
4836 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4838 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4839 It's OK for this to happen if it was part of a subtree that
4840 isn't immediately expanded, such as operand 2 of another
4842 if (!TREE_OPERAND (expr
, 1))
4844 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4845 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4849 /* Keep iterating. */
4854 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4855 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4856 remaps all local declarations to appropriate replacements in gimple
4860 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4861 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4862 struct walk_stmt_info
*wi
)
4864 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4865 gimple stmt
= gsi_stmt (*gsip
);
4867 if (gimple_code (stmt
) == GIMPLE_BIND
)
4869 tree block
= gimple_bind_block (stmt
);
4873 remap_block (&block
, id
);
4874 gimple_bind_set_block (stmt
, block
);
4877 /* This will remap a lot of the same decls again, but this should be
4879 if (gimple_bind_vars (stmt
))
4880 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
4884 /* Keep iterating. */
4889 /* Copies everything in SEQ and replaces variables and labels local to
4890 current_function_decl. */
4893 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4896 struct walk_stmt_info wi
;
4897 struct pointer_set_t
*visited
;
4900 /* There's nothing to do for NULL_TREE. */
4905 memset (&id
, 0, sizeof (id
));
4906 id
.src_fn
= current_function_decl
;
4907 id
.dst_fn
= current_function_decl
;
4908 id
.decl_map
= pointer_map_create ();
4909 id
.debug_map
= NULL
;
4911 id
.copy_decl
= copy_decl_no_change
;
4912 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4913 id
.transform_new_cfg
= false;
4914 id
.transform_return_to_modify
= false;
4915 id
.transform_parameter
= false;
4916 id
.transform_lang_insert_block
= NULL
;
4918 /* Walk the tree once to find local labels. */
4919 memset (&wi
, 0, sizeof (wi
));
4920 visited
= pointer_set_create ();
4923 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4924 pointer_set_destroy (visited
);
4926 copy
= gimple_seq_copy (seq
);
4928 /* Walk the copy, remapping decls. */
4929 memset (&wi
, 0, sizeof (wi
));
4931 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4934 pointer_map_destroy (id
.decl_map
);
4936 pointer_map_destroy (id
.debug_map
);
4942 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4945 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4954 debug_find_tree (tree top
, tree search
)
4956 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4960 /* Declare the variables created by the inliner. Add all the variables in
4961 VARS to BIND_EXPR. */
4964 declare_inline_vars (tree block
, tree vars
)
4967 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4969 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4970 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4971 add_local_decl (cfun
, t
);
4975 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4978 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4979 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4980 VAR_DECL translation. */
4983 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4985 /* Don't generate debug information for the copy if we wouldn't have
4986 generated it for the copy either. */
4987 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4988 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4990 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4991 declaration inspired this copy. */
4992 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4994 /* The new variable/label has no RTL, yet. */
4995 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4996 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4997 SET_DECL_RTL (copy
, 0);
4999 /* These args would always appear unused, if not for this. */
5000 TREE_USED (copy
) = 1;
5002 /* Set the context for the new declaration. */
5003 if (!DECL_CONTEXT (decl
))
5004 /* Globals stay global. */
5006 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5007 /* Things that weren't in the scope of the function we're inlining
5008 from aren't in the scope we're inlining to, either. */
5010 else if (TREE_STATIC (decl
))
5011 /* Function-scoped static variables should stay in the original
5015 /* Ordinary automatic local variables are now in the scope of the
5017 DECL_CONTEXT (copy
) = id
->dst_fn
;
5023 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5027 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5028 || TREE_CODE (decl
) == RESULT_DECL
);
5030 type
= TREE_TYPE (decl
);
5032 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5033 VAR_DECL
, DECL_NAME (decl
), type
);
5034 if (DECL_PT_UID_SET_P (decl
))
5035 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5036 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5037 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5038 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5039 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5041 return copy_decl_for_dup_finish (id
, decl
, copy
);
5044 /* Like copy_decl_to_var, but create a return slot object instead of a
5045 pointer variable for return by invisible reference. */
5048 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5052 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5053 || TREE_CODE (decl
) == RESULT_DECL
);
5055 type
= TREE_TYPE (decl
);
5056 if (DECL_BY_REFERENCE (decl
))
5057 type
= TREE_TYPE (type
);
5059 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5060 VAR_DECL
, DECL_NAME (decl
), type
);
5061 if (DECL_PT_UID_SET_P (decl
))
5062 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5063 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5064 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5065 if (!DECL_BY_REFERENCE (decl
))
5067 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5068 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5071 return copy_decl_for_dup_finish (id
, decl
, copy
);
5075 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5079 copy
= copy_node (decl
);
5081 /* The COPY is not abstract; it will be generated in DST_FN. */
5082 DECL_ABSTRACT (copy
) = 0;
5083 lang_hooks
.dup_lang_specific_decl (copy
);
5085 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5086 been taken; it's for internal bookkeeping in expand_goto_internal. */
5087 if (TREE_CODE (copy
) == LABEL_DECL
)
5089 TREE_ADDRESSABLE (copy
) = 0;
5090 LABEL_DECL_UID (copy
) = -1;
5093 return copy_decl_for_dup_finish (id
, decl
, copy
);
5097 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5099 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5100 return copy_decl_to_var (decl
, id
);
5102 return copy_decl_no_change (decl
, id
);
5105 /* Return a copy of the function's argument tree. */
5107 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5108 bitmap args_to_skip
, tree
*vars
)
5111 tree new_parm
= NULL
;
5116 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5117 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5119 tree new_tree
= remap_decl (arg
, id
);
5120 if (TREE_CODE (new_tree
) != PARM_DECL
)
5121 new_tree
= id
->copy_decl (arg
, id
);
5122 lang_hooks
.dup_lang_specific_decl (new_tree
);
5124 parg
= &DECL_CHAIN (new_tree
);
5126 else if (!pointer_map_contains (id
->decl_map
, arg
))
5128 /* Make an equivalent VAR_DECL. If the argument was used
5129 as temporary variable later in function, the uses will be
5130 replaced by local variable. */
5131 tree var
= copy_decl_to_var (arg
, id
);
5132 insert_decl_map (id
, arg
, var
);
5133 /* Declare this new variable. */
5134 DECL_CHAIN (var
) = *vars
;
5140 /* Return a copy of the function's static chain. */
5142 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5144 tree
*chain_copy
, *pvar
;
5146 chain_copy
= &static_chain
;
5147 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5149 tree new_tree
= remap_decl (*pvar
, id
);
5150 lang_hooks
.dup_lang_specific_decl (new_tree
);
5151 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5154 return static_chain
;
5157 /* Return true if the function is allowed to be versioned.
5158 This is a guard for the versioning functionality. */
5161 tree_versionable_function_p (tree fndecl
)
5163 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5164 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
5167 /* Delete all unreachable basic blocks and update callgraph.
5168 Doing so is somewhat nontrivial because we need to update all clones and
5169 remove inline function that become unreachable. */
5172 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5174 bool changed
= false;
5175 basic_block b
, next_bb
;
5177 find_unreachable_blocks ();
5179 /* Delete all unreachable basic blocks. */
5181 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5182 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5184 next_bb
= b
->next_bb
;
5186 if (!(b
->flags
& BB_REACHABLE
))
5188 gimple_stmt_iterator bsi
;
5190 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5192 struct cgraph_edge
*e
;
5193 struct cgraph_node
*node
;
5195 ipa_remove_stmt_references (id
->dst_node
, gsi_stmt (bsi
));
5197 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5198 &&(e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
5200 if (!e
->inline_failed
)
5201 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5203 cgraph_remove_edge (e
);
5205 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5206 && id
->dst_node
->clones
)
5207 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5209 ipa_remove_stmt_references (node
, gsi_stmt (bsi
));
5210 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5211 && (e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
5213 if (!e
->inline_failed
)
5214 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5216 cgraph_remove_edge (e
);
5220 node
= node
->clones
;
5221 else if (node
->next_sibling_clone
)
5222 node
= node
->next_sibling_clone
;
5225 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5226 node
= node
->clone_of
;
5227 if (node
!= id
->dst_node
)
5228 node
= node
->next_sibling_clone
;
5232 delete_basic_block (b
);
5240 /* Update clone info after duplication. */
5243 update_clone_info (copy_body_data
* id
)
5245 struct cgraph_node
*node
;
5246 if (!id
->dst_node
->clones
)
5248 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5250 /* First update replace maps to match the new body. */
5251 if (node
->clone
.tree_map
)
5254 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5256 struct ipa_replace_map
*replace_info
;
5257 replace_info
= (*node
->clone
.tree_map
)[i
];
5258 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5259 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5263 node
= node
->clones
;
5264 else if (node
->next_sibling_clone
)
5265 node
= node
->next_sibling_clone
;
5268 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5269 node
= node
->clone_of
;
5270 if (node
!= id
->dst_node
)
5271 node
= node
->next_sibling_clone
;
5276 /* Create a copy of a function's tree.
5277 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5278 of the original function and the new copied function
5279 respectively. In case we want to replace a DECL
5280 tree with another tree while duplicating the function's
5281 body, TREE_MAP represents the mapping between these
5282 trees. If UPDATE_CLONES is set, the call_stmt fields
5283 of edges of clones of the function will be updated.
5285 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5287 If SKIP_RETURN is true, the new version will return void.
5288 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5289 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5292 tree_function_versioning (tree old_decl
, tree new_decl
,
5293 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
5294 bool update_clones
, bitmap args_to_skip
,
5295 bool skip_return
, bitmap blocks_to_copy
,
5296 basic_block new_entry
)
5298 struct cgraph_node
*old_version_node
;
5299 struct cgraph_node
*new_version_node
;
5303 struct ipa_replace_map
*replace_info
;
5304 basic_block old_entry_block
, bb
;
5305 auto_vec
<gimple
, 10> init_stmts
;
5306 tree vars
= NULL_TREE
;
5308 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5309 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5310 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5312 old_version_node
= cgraph_get_node (old_decl
);
5313 gcc_checking_assert (old_version_node
);
5314 new_version_node
= cgraph_get_node (new_decl
);
5315 gcc_checking_assert (new_version_node
);
5317 /* Copy over debug args. */
5318 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5320 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5321 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5322 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5323 old_debug_args
= decl_debug_args_lookup (old_decl
);
5326 new_debug_args
= decl_debug_args_insert (new_decl
);
5327 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5331 /* Output the inlining info for this abstract function, since it has been
5332 inlined. If we don't do this now, we can lose the information about the
5333 variables in the function when the blocks get blown away as soon as we
5334 remove the cgraph node. */
5335 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5337 DECL_ARTIFICIAL (new_decl
) = 1;
5338 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5339 if (DECL_ORIGIN (old_decl
) == old_decl
)
5340 old_version_node
->used_as_abstract_origin
= true;
5341 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5343 /* Prepare the data structures for the tree copy. */
5344 memset (&id
, 0, sizeof (id
));
5346 /* Generate a new name for the new version. */
5347 id
.statements_to_fold
= pointer_set_create ();
5349 id
.decl_map
= pointer_map_create ();
5350 id
.debug_map
= NULL
;
5351 id
.src_fn
= old_decl
;
5352 id
.dst_fn
= new_decl
;
5353 id
.src_node
= old_version_node
;
5354 id
.dst_node
= new_version_node
;
5355 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5356 id
.blocks_to_copy
= blocks_to_copy
;
5357 if (id
.src_node
->ipa_transforms_to_apply
.exists ())
5359 vec
<ipa_opt_pass
> old_transforms_to_apply
5360 = id
.dst_node
->ipa_transforms_to_apply
;
5363 id
.dst_node
->ipa_transforms_to_apply
5364 = id
.src_node
->ipa_transforms_to_apply
.copy ();
5365 for (i
= 0; i
< old_transforms_to_apply
.length (); i
++)
5366 id
.dst_node
->ipa_transforms_to_apply
.safe_push (old_transforms_to_apply
[i
]);
5367 old_transforms_to_apply
.release ();
5370 id
.copy_decl
= copy_decl_no_change
;
5371 id
.transform_call_graph_edges
5372 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5373 id
.transform_new_cfg
= true;
5374 id
.transform_return_to_modify
= false;
5375 id
.transform_parameter
= false;
5376 id
.transform_lang_insert_block
= NULL
;
5378 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5379 (DECL_STRUCT_FUNCTION (old_decl
));
5380 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5381 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5382 initialize_cfun (new_decl
, old_decl
,
5383 old_entry_block
->count
);
5384 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5385 = id
.src_cfun
->gimple_df
->ipa_pta
;
5387 /* Copy the function's static chain. */
5388 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5390 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5391 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5394 /* If there's a tree_map, prepare for substitution. */
5396 for (i
= 0; i
< tree_map
->length (); i
++)
5399 replace_info
= (*tree_map
)[i
];
5400 if (replace_info
->replace_p
)
5402 if (!replace_info
->old_tree
)
5404 int i
= replace_info
->parm_num
;
5408 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5410 replace_info
->old_tree
= parm
;
5411 req_type
= TREE_TYPE (parm
);
5412 if (!useless_type_conversion_p (req_type
, TREE_TYPE (replace_info
->new_tree
)))
5414 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5415 replace_info
->new_tree
= fold_build1 (NOP_EXPR
, req_type
, replace_info
->new_tree
);
5416 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (TREE_TYPE (replace_info
->new_tree
)))
5417 replace_info
->new_tree
= fold_build1 (VIEW_CONVERT_EXPR
, req_type
, replace_info
->new_tree
);
5422 fprintf (dump_file
, " const ");
5423 print_generic_expr (dump_file
, replace_info
->new_tree
, 0);
5424 fprintf (dump_file
, " can't be converted to param ");
5425 print_generic_expr (dump_file
, parm
, 0);
5426 fprintf (dump_file
, "\n");
5428 replace_info
->old_tree
= NULL
;
5433 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5434 if (replace_info
->old_tree
)
5436 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5437 replace_info
->new_tree
, id
.src_fn
,
5441 init_stmts
.safe_push (init
);
5445 /* Copy the function's arguments. */
5446 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5447 DECL_ARGUMENTS (new_decl
) =
5448 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5449 args_to_skip
, &vars
);
5451 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5452 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5454 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5456 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5457 /* Add local vars. */
5458 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5460 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5462 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5464 DECL_RESULT (new_decl
)
5465 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5466 RESULT_DECL
, NULL_TREE
, void_type_node
);
5467 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5468 cfun
->returns_struct
= 0;
5469 cfun
->returns_pcc_struct
= 0;
5474 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5475 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5476 if (gimple_in_ssa_p (id
.src_cfun
)
5477 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5478 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5480 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5481 insert_decl_map (&id
, old_name
, new_name
);
5482 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5483 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5487 /* Set up the destination functions loop tree. */
5488 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5490 cfun
->curr_properties
&= ~PROP_loops
;
5491 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5492 cfun
->curr_properties
|= PROP_loops
;
5495 /* Copy the Function's body. */
5496 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5497 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
5500 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5501 number_blocks (new_decl
);
5503 /* We want to create the BB unconditionally, so that the addition of
5504 debug stmts doesn't affect BB count, which may in the end cause
5505 codegen differences. */
5506 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5507 while (init_stmts
.length ())
5508 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5509 update_clone_info (&id
);
5511 /* Remap the nonlocal_goto_save_area, if any. */
5512 if (cfun
->nonlocal_goto_save_area
)
5514 struct walk_stmt_info wi
;
5516 memset (&wi
, 0, sizeof (wi
));
5518 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5522 pointer_map_destroy (id
.decl_map
);
5524 pointer_map_destroy (id
.debug_map
);
5525 free_dominance_info (CDI_DOMINATORS
);
5526 free_dominance_info (CDI_POST_DOMINATORS
);
5528 fold_marked_statements (0, id
.statements_to_fold
);
5529 pointer_set_destroy (id
.statements_to_fold
);
5530 fold_cond_expr_cond ();
5531 delete_unreachable_blocks_update_callgraph (&id
);
5532 if (id
.dst_node
->definition
)
5533 cgraph_rebuild_references ();
5534 update_ssa (TODO_update_ssa
);
5536 /* After partial cloning we need to rescale frequencies, so they are
5537 within proper range in the cloned function. */
5540 struct cgraph_edge
*e
;
5541 rebuild_frequencies ();
5543 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5544 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5546 basic_block bb
= gimple_bb (e
->call_stmt
);
5547 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5549 e
->count
= bb
->count
;
5551 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5553 basic_block bb
= gimple_bb (e
->call_stmt
);
5554 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5556 e
->count
= bb
->count
;
5560 free_dominance_info (CDI_DOMINATORS
);
5561 free_dominance_info (CDI_POST_DOMINATORS
);
5563 gcc_assert (!id
.debug_stmts
.exists ());
5568 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5569 the callee and return the inlined body on success. */
5572 maybe_inline_call_in_expr (tree exp
)
5574 tree fn
= get_callee_fndecl (exp
);
5576 /* We can only try to inline "const" functions. */
5577 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5579 struct pointer_map_t
*decl_map
= pointer_map_create ();
5580 call_expr_arg_iterator iter
;
5584 /* Remap the parameters. */
5585 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5587 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5588 *pointer_map_insert (decl_map
, param
) = arg
;
5590 memset (&id
, 0, sizeof (id
));
5592 id
.dst_fn
= current_function_decl
;
5593 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5594 id
.decl_map
= decl_map
;
5596 id
.copy_decl
= copy_decl_no_change
;
5597 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5598 id
.transform_new_cfg
= false;
5599 id
.transform_return_to_modify
= true;
5600 id
.transform_parameter
= true;
5601 id
.transform_lang_insert_block
= NULL
;
5603 /* Make sure not to unshare trees behind the front-end's back
5604 since front-end specific mechanisms may rely on sharing. */
5605 id
.regimplify
= false;
5606 id
.do_not_unshare
= true;
5608 /* We're not inside any EH region. */
5611 t
= copy_tree_body (&id
);
5612 pointer_map_destroy (decl_map
);
5614 /* We can only return something suitable for use in a GENERIC
5616 if (TREE_CODE (t
) == MODIFY_EXPR
)
5617 return TREE_OPERAND (t
, 1);
5623 /* Duplicate a type, fields and all. */
5626 build_duplicate_type (tree type
)
5628 struct copy_body_data id
;
5630 memset (&id
, 0, sizeof (id
));
5631 id
.src_fn
= current_function_decl
;
5632 id
.dst_fn
= current_function_decl
;
5634 id
.decl_map
= pointer_map_create ();
5635 id
.debug_map
= NULL
;
5636 id
.copy_decl
= copy_decl_no_change
;
5638 type
= remap_type_1 (type
, &id
);
5640 pointer_map_destroy (id
.decl_map
);
5642 pointer_map_destroy (id
.debug_map
);
5644 TYPE_CANONICAL (type
) = type
;