2 Copyright (C) 2001-2013 Free Software Foundation, Inc.
3 Contributed by Alexandre Oliva <aoliva@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
25 #include "diagnostic-core.h"
27 #include "tree-inline.h"
31 #include "insn-config.h"
33 #include "langhooks.h"
34 #include "basic-block.h"
35 #include "tree-iterator.h"
38 #include "tree-mudflap.h"
39 #include "tree-flow.h"
41 #include "tree-flow.h"
42 #include "tree-pretty-print.h"
45 #include "pointer-set.h"
47 #include "value-prof.h"
48 #include "tree-pass.h"
51 #include "rtl.h" /* FIXME: For asm_str_count. */
53 /* I'm not real happy about this, but we need to handle gimple and
57 /* Inlining, Cloning, Versioning, Parallelization
59 Inlining: a function body is duplicated, but the PARM_DECLs are
60 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
61 MODIFY_EXPRs that store to a dedicated returned-value variable.
62 The duplicated eh_region info of the copy will later be appended
63 to the info for the caller; the eh_region info in copied throwing
64 statements and RESX statements are adjusted accordingly.
66 Cloning: (only in C++) We have one body for a con/de/structor, and
67 multiple function decls, each with a unique parameter list.
68 Duplicate the body, using the given splay tree; some parameters
69 will become constants (like 0 or 1).
71 Versioning: a function body is duplicated and the result is a new
72 function rather than into blocks of an existing function as with
73 inlining. Some parameters will become constants.
75 Parallelization: a region of a function is duplicated resulting in
76 a new function. Variables may be replaced with complex expressions
77 to enable shared variable semantics.
79 All of these will simultaneously lookup any callgraph edges. If
80 we're going to inline the duplicated function body, and the given
81 function has some cloned callgraph nodes (one for each place this
82 function will be inlined) those callgraph edges will be duplicated.
83 If we're cloning the body, those callgraph edges will be
84 updated to point into the new body. (Note that the original
85 callgraph node and edge list will not be altered.)
87 See the CALL_EXPR handling case in copy_tree_body_r (). */
91 o In order to make inlining-on-trees work, we pessimized
92 function-local static constants. In particular, they are now
93 always output, even when not addressed. Fix this by treating
94 function-local static constants just like global static
95 constants; the back-end already knows not to output them if they
98 o Provide heuristics to clamp inlining of recursive template
102 /* Weights that estimate_num_insns uses to estimate the size of the
105 eni_weights eni_size_weights
;
107 /* Weights that estimate_num_insns uses to estimate the time necessary
108 to execute the produced code. */
110 eni_weights eni_time_weights
;
114 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, basic_block
);
115 static void remap_block (tree
*, copy_body_data
*);
116 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
117 static tree
mark_local_for_remap_r (tree
*, int *, void *);
118 static void unsave_expr_1 (tree
);
119 static tree
unsave_r (tree
*, int *, void *);
120 static void declare_inline_vars (tree
, tree
);
121 static void remap_save_expr (tree
*, void *, int *);
122 static void prepend_lexical_block (tree current_block
, tree new_block
);
123 static tree
copy_decl_to_var (tree
, copy_body_data
*);
124 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
125 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
126 static gimple
remap_gimple_stmt (gimple
, copy_body_data
*);
127 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
129 /* Insert a tree->tree mapping for ID. Despite the name suggests
130 that the trees should be variables, it is used for more than that. */
133 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
135 *pointer_map_insert (id
->decl_map
, key
) = value
;
137 /* Always insert an identity map as well. If we see this same new
138 node again, we won't want to duplicate it a second time. */
140 *pointer_map_insert (id
->decl_map
, value
) = value
;
143 /* Insert a tree->tree mapping for ID. This is only used for
147 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
149 if (!gimple_in_ssa_p (id
->src_cfun
))
152 if (!MAY_HAVE_DEBUG_STMTS
)
155 if (!target_for_debug_bind (key
))
158 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
159 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
162 id
->debug_map
= pointer_map_create ();
164 *pointer_map_insert (id
->debug_map
, key
) = value
;
167 /* If nonzero, we're remapping the contents of inlined debug
168 statements. If negative, an error has occurred, such as a
169 reference to a variable that isn't available in the inlined
171 static int processing_debug_stmt
= 0;
173 /* Construct new SSA name for old NAME. ID is the inline context. */
176 remap_ssa_name (tree name
, copy_body_data
*id
)
181 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
183 n
= (tree
*) pointer_map_contains (id
->decl_map
, name
);
185 return unshare_expr (*n
);
187 if (processing_debug_stmt
)
189 if (SSA_NAME_IS_DEFAULT_DEF (name
)
190 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
191 && id
->entry_bb
== NULL
192 && single_succ_p (ENTRY_BLOCK_PTR
))
194 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
196 gimple_stmt_iterator gsi
;
197 tree val
= SSA_NAME_VAR (name
);
199 n
= (tree
*) pointer_map_contains (id
->decl_map
, val
);
202 if (TREE_CODE (val
) != PARM_DECL
)
204 processing_debug_stmt
= -1;
207 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
208 DECL_ARTIFICIAL (vexpr
) = 1;
209 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
210 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
211 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR
));
212 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
216 processing_debug_stmt
= -1;
220 /* Remap anonymous SSA names or SSA names of anonymous decls. */
221 var
= SSA_NAME_VAR (name
);
223 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
224 && TREE_CODE (var
) == VAR_DECL
225 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
226 && DECL_ARTIFICIAL (var
)
227 && DECL_IGNORED_P (var
)
228 && !DECL_NAME (var
)))
230 struct ptr_info_def
*pi
;
231 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
), NULL
);
232 if (!var
&& SSA_NAME_IDENTIFIER (name
))
233 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
234 insert_decl_map (id
, name
, new_tree
);
235 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
236 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
237 /* At least IPA points-to info can be directly transferred. */
238 if (id
->src_cfun
->gimple_df
239 && id
->src_cfun
->gimple_df
->ipa_pta
240 && (pi
= SSA_NAME_PTR_INFO (name
))
243 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
249 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
251 new_tree
= remap_decl (var
, id
);
253 /* We might've substituted constant or another SSA_NAME for
256 Replace the SSA name representing RESULT_DECL by variable during
257 inlining: this saves us from need to introduce PHI node in a case
258 return value is just partly initialized. */
259 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
260 && (!SSA_NAME_VAR (name
)
261 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
262 || !id
->transform_return_to_modify
))
264 struct ptr_info_def
*pi
;
265 new_tree
= make_ssa_name (new_tree
, NULL
);
266 insert_decl_map (id
, name
, new_tree
);
267 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
268 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
269 /* At least IPA points-to info can be directly transferred. */
270 if (id
->src_cfun
->gimple_df
271 && id
->src_cfun
->gimple_df
->ipa_pta
272 && (pi
= SSA_NAME_PTR_INFO (name
))
275 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
278 if (SSA_NAME_IS_DEFAULT_DEF (name
))
280 /* By inlining function having uninitialized variable, we might
281 extend the lifetime (variable might get reused). This cause
282 ICE in the case we end up extending lifetime of SSA name across
283 abnormal edge, but also increase register pressure.
285 We simply initialize all uninitialized vars by 0 except
286 for case we are inlining to very first BB. We can avoid
287 this for all BBs that are not inside strongly connected
288 regions of the CFG, but this is expensive to test. */
290 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
291 && (!SSA_NAME_VAR (name
)
292 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
293 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR
, 0)->dest
294 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
296 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
298 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
300 init_stmt
= gimple_build_assign (new_tree
, zero
);
301 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
302 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
306 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
307 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
312 insert_decl_map (id
, name
, new_tree
);
316 /* Remap DECL during the copying of the BLOCK tree for the function. */
319 remap_decl (tree decl
, copy_body_data
*id
)
323 /* We only remap local variables in the current function. */
325 /* See if we have remapped this declaration. */
327 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
329 if (!n
&& processing_debug_stmt
)
331 processing_debug_stmt
= -1;
335 /* If we didn't already have an equivalent for this declaration,
339 /* Make a copy of the variable or label. */
340 tree t
= id
->copy_decl (decl
, id
);
342 /* Remember it, so that if we encounter this local entity again
343 we can reuse this copy. Do this early because remap_type may
344 need this decl for TYPE_STUB_DECL. */
345 insert_decl_map (id
, decl
, t
);
350 /* Remap types, if necessary. */
351 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
352 if (TREE_CODE (t
) == TYPE_DECL
)
353 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
355 /* Remap sizes as necessary. */
356 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
357 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
359 /* If fields, do likewise for offset and qualifier. */
360 if (TREE_CODE (t
) == FIELD_DECL
)
362 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
363 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
364 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
370 if (id
->do_not_unshare
)
373 return unshare_expr (*n
);
377 remap_type_1 (tree type
, copy_body_data
*id
)
381 /* We do need a copy. build and register it now. If this is a pointer or
382 reference type, remap the designated type and make a new pointer or
384 if (TREE_CODE (type
) == POINTER_TYPE
)
386 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
388 TYPE_REF_CAN_ALIAS_ALL (type
));
389 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
390 new_tree
= build_type_attribute_qual_variant (new_tree
,
391 TYPE_ATTRIBUTES (type
),
393 insert_decl_map (id
, type
, new_tree
);
396 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
398 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
400 TYPE_REF_CAN_ALIAS_ALL (type
));
401 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
402 new_tree
= build_type_attribute_qual_variant (new_tree
,
403 TYPE_ATTRIBUTES (type
),
405 insert_decl_map (id
, type
, new_tree
);
409 new_tree
= copy_node (type
);
411 insert_decl_map (id
, type
, new_tree
);
413 /* This is a new type, not a copy of an old type. Need to reassociate
414 variants. We can handle everything except the main variant lazily. */
415 t
= TYPE_MAIN_VARIANT (type
);
418 t
= remap_type (t
, id
);
419 TYPE_MAIN_VARIANT (new_tree
) = t
;
420 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
421 TYPE_NEXT_VARIANT (t
) = new_tree
;
425 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
426 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
429 if (TYPE_STUB_DECL (type
))
430 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
432 /* Lazily create pointer and reference types. */
433 TYPE_POINTER_TO (new_tree
) = NULL
;
434 TYPE_REFERENCE_TO (new_tree
) = NULL
;
436 switch (TREE_CODE (new_tree
))
440 case FIXED_POINT_TYPE
:
443 t
= TYPE_MIN_VALUE (new_tree
);
444 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
445 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
447 t
= TYPE_MAX_VALUE (new_tree
);
448 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
449 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
453 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
454 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
458 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
459 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
464 case QUAL_UNION_TYPE
:
468 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
470 t
= remap_decl (f
, id
);
471 DECL_CONTEXT (t
) = new_tree
;
475 TYPE_FIELDS (new_tree
) = nreverse (nf
);
481 /* Shouldn't have been thought variable sized. */
485 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
486 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
492 remap_type (tree type
, copy_body_data
*id
)
500 /* See if we have remapped this type. */
501 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
505 /* The type only needs remapping if it's variably modified. */
506 if (! variably_modified_type_p (type
, id
->src_fn
))
508 insert_decl_map (id
, type
, type
);
512 id
->remapping_type_depth
++;
513 tmp
= remap_type_1 (type
, id
);
514 id
->remapping_type_depth
--;
519 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
522 can_be_nonlocal (tree decl
, copy_body_data
*id
)
524 /* We can not duplicate function decls. */
525 if (TREE_CODE (decl
) == FUNCTION_DECL
)
528 /* Local static vars must be non-local or we get multiple declaration
530 if (TREE_CODE (decl
) == VAR_DECL
531 && !auto_var_in_fn_p (decl
, id
->src_fn
))
538 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
542 tree new_decls
= NULL_TREE
;
544 /* Remap its variables. */
545 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
549 if (can_be_nonlocal (old_var
, id
))
551 /* We need to add this variable to the local decls as otherwise
552 nothing else will do so. */
553 if (TREE_CODE (old_var
) == VAR_DECL
554 && ! DECL_EXTERNAL (old_var
))
555 add_local_decl (cfun
, old_var
);
556 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
557 && !DECL_IGNORED_P (old_var
)
558 && nonlocalized_list
)
559 vec_safe_push (*nonlocalized_list
, old_var
);
563 /* Remap the variable. */
564 new_var
= remap_decl (old_var
, id
);
566 /* If we didn't remap this variable, we can't mess with its
567 TREE_CHAIN. If we remapped this variable to the return slot, it's
568 already declared somewhere else, so don't declare it here. */
570 if (new_var
== id
->retvar
)
574 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
575 && !DECL_IGNORED_P (old_var
)
576 && nonlocalized_list
)
577 vec_safe_push (*nonlocalized_list
, old_var
);
581 gcc_assert (DECL_P (new_var
));
582 DECL_CHAIN (new_var
) = new_decls
;
585 /* Also copy value-expressions. */
586 if (TREE_CODE (new_var
) == VAR_DECL
587 && DECL_HAS_VALUE_EXPR_P (new_var
))
589 tree tem
= DECL_VALUE_EXPR (new_var
);
590 bool old_regimplify
= id
->regimplify
;
591 id
->remapping_type_depth
++;
592 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
593 id
->remapping_type_depth
--;
594 id
->regimplify
= old_regimplify
;
595 SET_DECL_VALUE_EXPR (new_var
, tem
);
600 return nreverse (new_decls
);
603 /* Copy the BLOCK to contain remapped versions of the variables
604 therein. And hook the new block into the block-tree. */
607 remap_block (tree
*block
, copy_body_data
*id
)
612 /* Make the new block. */
614 new_block
= make_node (BLOCK
);
615 TREE_USED (new_block
) = TREE_USED (old_block
);
616 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
617 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
618 BLOCK_NONLOCALIZED_VARS (new_block
)
619 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
622 /* Remap its variables. */
623 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
624 &BLOCK_NONLOCALIZED_VARS (new_block
),
627 if (id
->transform_lang_insert_block
)
628 id
->transform_lang_insert_block (new_block
);
630 /* Remember the remapped block. */
631 insert_decl_map (id
, old_block
, new_block
);
634 /* Copy the whole block tree and root it in id->block. */
636 remap_blocks (tree block
, copy_body_data
*id
)
639 tree new_tree
= block
;
644 remap_block (&new_tree
, id
);
645 gcc_assert (new_tree
!= block
);
646 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
647 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
648 /* Blocks are in arbitrary order, but make things slightly prettier and do
649 not swap order when producing a copy. */
650 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
654 /* Remap the block tree rooted at BLOCK to nothing. */
656 remap_blocks_to_null (tree block
, copy_body_data
*id
)
659 insert_decl_map (id
, block
, NULL_TREE
);
660 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
661 remap_blocks_to_null (t
, id
);
665 copy_statement_list (tree
*tp
)
667 tree_stmt_iterator oi
, ni
;
670 new_tree
= alloc_stmt_list ();
671 ni
= tsi_start (new_tree
);
672 oi
= tsi_start (*tp
);
673 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
676 for (; !tsi_end_p (oi
); tsi_next (&oi
))
678 tree stmt
= tsi_stmt (oi
);
679 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
680 /* This copy is not redundant; tsi_link_after will smash this
681 STATEMENT_LIST into the end of the one we're building, and we
682 don't want to do that with the original. */
683 copy_statement_list (&stmt
);
684 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
689 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
691 tree block
= BIND_EXPR_BLOCK (*tp
);
692 /* Copy (and replace) the statement. */
693 copy_tree_r (tp
, walk_subtrees
, NULL
);
696 remap_block (&block
, id
);
697 BIND_EXPR_BLOCK (*tp
) = block
;
700 if (BIND_EXPR_VARS (*tp
))
701 /* This will remap a lot of the same decls again, but this should be
703 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
707 /* Create a new gimple_seq by remapping all the statements in BODY
708 using the inlining information in ID. */
711 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
713 gimple_stmt_iterator si
;
714 gimple_seq new_body
= NULL
;
716 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
718 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
719 gimple_seq_add_stmt (&new_body
, new_stmt
);
726 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
727 block using the mapping information in ID. */
730 copy_gimple_bind (gimple stmt
, copy_body_data
*id
)
733 tree new_block
, new_vars
;
734 gimple_seq body
, new_body
;
736 /* Copy the statement. Note that we purposely don't use copy_stmt
737 here because we need to remap statements as we copy. */
738 body
= gimple_bind_body (stmt
);
739 new_body
= remap_gimple_seq (body
, id
);
741 new_block
= gimple_bind_block (stmt
);
743 remap_block (&new_block
, id
);
745 /* This will remap a lot of the same decls again, but this should be
747 new_vars
= gimple_bind_vars (stmt
);
749 new_vars
= remap_decls (new_vars
, NULL
, id
);
751 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
757 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
758 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
759 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
760 recursing into the children nodes of *TP. */
763 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
765 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
766 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
767 tree fn
= id
->src_fn
;
769 if (TREE_CODE (*tp
) == SSA_NAME
)
771 *tp
= remap_ssa_name (*tp
, id
);
775 else if (auto_var_in_fn_p (*tp
, fn
))
777 /* Local variables and labels need to be replaced by equivalent
778 variables. We don't want to copy static variables; there's
779 only one of those, no matter how many times we inline the
780 containing function. Similarly for globals from an outer
784 /* Remap the declaration. */
785 new_decl
= remap_decl (*tp
, id
);
786 gcc_assert (new_decl
);
787 /* Replace this variable with the copy. */
788 STRIP_TYPE_NOPS (new_decl
);
789 /* ??? The C++ frontend uses void * pointer zero to initialize
790 any other type. This confuses the middle-end type verification.
791 As cloned bodies do not go through gimplification again the fixup
792 there doesn't trigger. */
793 if (TREE_CODE (new_decl
) == INTEGER_CST
794 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
795 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
799 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
801 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
803 else if (TREE_CODE (*tp
) == LABEL_DECL
804 && (!DECL_CONTEXT (*tp
)
805 || decl_function_context (*tp
) == id
->src_fn
))
806 /* These may need to be remapped for EH handling. */
807 *tp
= remap_decl (*tp
, id
);
808 else if (TREE_CODE (*tp
) == FIELD_DECL
)
810 /* If the enclosing record type is variably_modified_type_p, the field
811 has already been remapped. Otherwise, it need not be. */
812 tree
*n
= (tree
*) pointer_map_contains (id
->decl_map
, *tp
);
817 else if (TYPE_P (*tp
))
818 /* Types may need remapping as well. */
819 *tp
= remap_type (*tp
, id
);
820 else if (CONSTANT_CLASS_P (*tp
))
822 /* If this is a constant, we have to copy the node iff the type
823 will be remapped. copy_tree_r will not copy a constant. */
824 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
826 if (new_type
== TREE_TYPE (*tp
))
829 else if (TREE_CODE (*tp
) == INTEGER_CST
)
830 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
831 TREE_INT_CST_HIGH (*tp
));
834 *tp
= copy_node (*tp
);
835 TREE_TYPE (*tp
) = new_type
;
840 /* Otherwise, just copy the node. Note that copy_tree_r already
841 knows not to copy VAR_DECLs, etc., so this is safe. */
843 if (TREE_CODE (*tp
) == MEM_REF
)
845 tree ptr
= TREE_OPERAND (*tp
, 0);
846 tree type
= remap_type (TREE_TYPE (*tp
), id
);
849 /* We need to re-canonicalize MEM_REFs from inline substitutions
850 that can happen when a pointer argument is an ADDR_EXPR.
851 Recurse here manually to allow that. */
852 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
853 *tp
= fold_build2 (MEM_REF
, type
,
854 ptr
, TREE_OPERAND (*tp
, 1));
855 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
856 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
857 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
858 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
863 /* Here is the "usual case". Copy this tree node, and then
864 tweak some special cases. */
865 copy_tree_r (tp
, walk_subtrees
, NULL
);
867 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
868 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
870 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
872 /* The copied TARGET_EXPR has never been expanded, even if the
873 original node was expanded already. */
874 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
875 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
877 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
879 /* Variable substitution need not be simple. In particular,
880 the MEM_REF substitution above. Make sure that
881 TREE_CONSTANT and friends are up-to-date. */
882 int invariant
= is_gimple_min_invariant (*tp
);
883 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
884 recompute_tree_invariant_for_addr_expr (*tp
);
886 /* If this used to be invariant, but is not any longer,
887 then regimplification is probably needed. */
888 if (invariant
&& !is_gimple_min_invariant (*tp
))
889 id
->regimplify
= true;
895 /* Update the TREE_BLOCK for the cloned expr. */
898 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
899 tree old_block
= TREE_BLOCK (*tp
);
903 n
= (tree
*) pointer_map_contains (id
->decl_map
,
908 TREE_SET_BLOCK (*tp
, new_block
);
911 /* Keep iterating. */
916 /* Called from copy_body_id via walk_tree. DATA is really a
917 `copy_body_data *'. */
920 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
922 copy_body_data
*id
= (copy_body_data
*) data
;
923 tree fn
= id
->src_fn
;
926 /* Begin by recognizing trees that we'll completely rewrite for the
927 inlining context. Our output for these trees is completely
928 different from out input (e.g. RETURN_EXPR is deleted, and morphs
929 into an edge). Further down, we'll handle trees that get
930 duplicated and/or tweaked. */
932 /* When requested, RETURN_EXPRs should be transformed to just the
933 contained MODIFY_EXPR. The branch semantics of the return will
934 be handled elsewhere by manipulating the CFG rather than a statement. */
935 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
937 tree assignment
= TREE_OPERAND (*tp
, 0);
939 /* If we're returning something, just turn that into an
940 assignment into the equivalent of the original RESULT_DECL.
941 If the "assignment" is just the result decl, the result
942 decl has already been set (e.g. a recent "foo (&result_decl,
943 ...)"); just toss the entire RETURN_EXPR. */
944 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
946 /* Replace the RETURN_EXPR with (a copy of) the
947 MODIFY_EXPR hanging underneath. */
948 *tp
= copy_node (assignment
);
950 else /* Else the RETURN_EXPR returns no value. */
953 return (tree
) (void *)1;
956 else if (TREE_CODE (*tp
) == SSA_NAME
)
958 *tp
= remap_ssa_name (*tp
, id
);
963 /* Local variables and labels need to be replaced by equivalent
964 variables. We don't want to copy static variables; there's only
965 one of those, no matter how many times we inline the containing
966 function. Similarly for globals from an outer function. */
967 else if (auto_var_in_fn_p (*tp
, fn
))
971 /* Remap the declaration. */
972 new_decl
= remap_decl (*tp
, id
);
973 gcc_assert (new_decl
);
974 /* Replace this variable with the copy. */
975 STRIP_TYPE_NOPS (new_decl
);
979 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
980 copy_statement_list (tp
);
981 else if (TREE_CODE (*tp
) == SAVE_EXPR
982 || TREE_CODE (*tp
) == TARGET_EXPR
)
983 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
984 else if (TREE_CODE (*tp
) == LABEL_DECL
985 && (! DECL_CONTEXT (*tp
)
986 || decl_function_context (*tp
) == id
->src_fn
))
987 /* These may need to be remapped for EH handling. */
988 *tp
= remap_decl (*tp
, id
);
989 else if (TREE_CODE (*tp
) == BIND_EXPR
)
990 copy_bind_expr (tp
, walk_subtrees
, id
);
991 /* Types may need remapping as well. */
992 else if (TYPE_P (*tp
))
993 *tp
= remap_type (*tp
, id
);
995 /* If this is a constant, we have to copy the node iff the type will be
996 remapped. copy_tree_r will not copy a constant. */
997 else if (CONSTANT_CLASS_P (*tp
))
999 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1001 if (new_type
== TREE_TYPE (*tp
))
1004 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1005 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
1006 TREE_INT_CST_HIGH (*tp
));
1009 *tp
= copy_node (*tp
);
1010 TREE_TYPE (*tp
) = new_type
;
1014 /* Otherwise, just copy the node. Note that copy_tree_r already
1015 knows not to copy VAR_DECLs, etc., so this is safe. */
1018 /* Here we handle trees that are not completely rewritten.
1019 First we detect some inlining-induced bogosities for
1021 if (TREE_CODE (*tp
) == MODIFY_EXPR
1022 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1023 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1025 /* Some assignments VAR = VAR; don't generate any rtl code
1026 and thus don't count as variable modification. Avoid
1027 keeping bogosities like 0 = 0. */
1028 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1031 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1035 STRIP_TYPE_NOPS (value
);
1036 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1038 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1039 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1043 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1045 /* Get rid of *& from inline substitutions that can happen when a
1046 pointer argument is an ADDR_EXPR. */
1047 tree decl
= TREE_OPERAND (*tp
, 0);
1050 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1055 /* If we happen to get an ADDR_EXPR in n->value, strip
1056 it manually here as we'll eventually get ADDR_EXPRs
1057 which lie about their types pointed to. In this case
1058 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1059 but we absolutely rely on that. As fold_indirect_ref
1060 does other useful transformations, try that first, though. */
1061 tree type
= TREE_TYPE (TREE_TYPE (*n
));
1062 if (id
->do_not_unshare
)
1065 new_tree
= unshare_expr (*n
);
1067 *tp
= gimple_fold_indirect_ref (new_tree
);
1070 if (TREE_CODE (new_tree
) == ADDR_EXPR
)
1072 *tp
= fold_indirect_ref_1 (EXPR_LOCATION (new_tree
),
1074 /* ??? We should either assert here or build
1075 a VIEW_CONVERT_EXPR instead of blindly leaking
1076 incompatible types to our IL. */
1078 *tp
= TREE_OPERAND (new_tree
, 0);
1082 *tp
= build1 (INDIRECT_REF
, type
, new_tree
);
1083 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1084 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1085 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1086 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
1093 else if (TREE_CODE (*tp
) == MEM_REF
)
1095 tree ptr
= TREE_OPERAND (*tp
, 0);
1096 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1099 /* We need to re-canonicalize MEM_REFs from inline substitutions
1100 that can happen when a pointer argument is an ADDR_EXPR.
1101 Recurse here manually to allow that. */
1102 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1103 *tp
= fold_build2 (MEM_REF
, type
,
1104 ptr
, TREE_OPERAND (*tp
, 1));
1105 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
1106 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1107 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1108 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1113 /* Here is the "usual case". Copy this tree node, and then
1114 tweak some special cases. */
1115 copy_tree_r (tp
, walk_subtrees
, NULL
);
1117 /* If EXPR has block defined, map it to newly constructed block.
1118 When inlining we want EXPRs without block appear in the block
1119 of function call if we are not remapping a type. */
1122 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1123 if (TREE_BLOCK (*tp
))
1126 n
= (tree
*) pointer_map_contains (id
->decl_map
,
1131 TREE_SET_BLOCK (*tp
, new_block
);
1134 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1135 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1137 /* The copied TARGET_EXPR has never been expanded, even if the
1138 original node was expanded already. */
1139 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1141 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1142 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1145 /* Variable substitution need not be simple. In particular, the
1146 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1147 and friends are up-to-date. */
1148 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1150 int invariant
= is_gimple_min_invariant (*tp
);
1151 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1153 /* Handle the case where we substituted an INDIRECT_REF
1154 into the operand of the ADDR_EXPR. */
1155 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1156 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1158 recompute_tree_invariant_for_addr_expr (*tp
);
1160 /* If this used to be invariant, but is not any longer,
1161 then regimplification is probably needed. */
1162 if (invariant
&& !is_gimple_min_invariant (*tp
))
1163 id
->regimplify
= true;
1169 /* Keep iterating. */
1173 /* Helper for remap_gimple_stmt. Given an EH region number for the
1174 source function, map that to the duplicate EH region number in
1175 the destination function. */
1178 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1180 eh_region old_r
, new_r
;
1183 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1184 slot
= pointer_map_contains (id
->eh_map
, old_r
);
1185 new_r
= (eh_region
) *slot
;
1187 return new_r
->index
;
1190 /* Similar, but operate on INTEGER_CSTs. */
1193 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1197 old_nr
= tree_low_cst (old_t_nr
, 0);
1198 new_nr
= remap_eh_region_nr (old_nr
, id
);
1200 return build_int_cst (integer_type_node
, new_nr
);
1203 /* Helper for copy_bb. Remap statement STMT using the inlining
1204 information in ID. Return the new statement copy. */
1207 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1210 struct walk_stmt_info wi
;
1211 bool skip_first
= false;
1213 /* Begin by recognizing trees that we'll completely rewrite for the
1214 inlining context. Our output for these trees is completely
1215 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1216 into an edge). Further down, we'll handle trees that get
1217 duplicated and/or tweaked. */
1219 /* When requested, GIMPLE_RETURNs should be transformed to just the
1220 contained GIMPLE_ASSIGN. The branch semantics of the return will
1221 be handled elsewhere by manipulating the CFG rather than the
1223 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1225 tree retval
= gimple_return_retval (stmt
);
1227 /* If we're returning something, just turn that into an
1228 assignment into the equivalent of the original RESULT_DECL.
1229 If RETVAL is just the result decl, the result decl has
1230 already been set (e.g. a recent "foo (&result_decl, ...)");
1231 just toss the entire GIMPLE_RETURN. */
1233 && (TREE_CODE (retval
) != RESULT_DECL
1234 && (TREE_CODE (retval
) != SSA_NAME
1235 || ! SSA_NAME_VAR (retval
)
1236 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1238 copy
= gimple_build_assign (id
->retvar
, retval
);
1239 /* id->retvar is already substituted. Skip it on later remapping. */
1243 return gimple_build_nop ();
1245 else if (gimple_has_substatements (stmt
))
1249 /* When cloning bodies from the C++ front end, we will be handed bodies
1250 in High GIMPLE form. Handle here all the High GIMPLE statements that
1251 have embedded statements. */
1252 switch (gimple_code (stmt
))
1255 copy
= copy_gimple_bind (stmt
, id
);
1259 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1260 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1263 case GIMPLE_EH_FILTER
:
1264 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1265 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1269 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1270 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1271 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1274 case GIMPLE_WITH_CLEANUP_EXPR
:
1275 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1276 copy
= gimple_build_wce (s1
);
1279 case GIMPLE_OMP_PARALLEL
:
1280 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1281 copy
= gimple_build_omp_parallel
1283 gimple_omp_parallel_clauses (stmt
),
1284 gimple_omp_parallel_child_fn (stmt
),
1285 gimple_omp_parallel_data_arg (stmt
));
1288 case GIMPLE_OMP_TASK
:
1289 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1290 copy
= gimple_build_omp_task
1292 gimple_omp_task_clauses (stmt
),
1293 gimple_omp_task_child_fn (stmt
),
1294 gimple_omp_task_data_arg (stmt
),
1295 gimple_omp_task_copy_fn (stmt
),
1296 gimple_omp_task_arg_size (stmt
),
1297 gimple_omp_task_arg_align (stmt
));
1300 case GIMPLE_OMP_FOR
:
1301 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1302 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1303 copy
= gimple_build_omp_for (s1
, gimple_omp_for_clauses (stmt
),
1304 gimple_omp_for_collapse (stmt
), s2
);
1307 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1309 gimple_omp_for_set_index (copy
, i
,
1310 gimple_omp_for_index (stmt
, i
));
1311 gimple_omp_for_set_initial (copy
, i
,
1312 gimple_omp_for_initial (stmt
, i
));
1313 gimple_omp_for_set_final (copy
, i
,
1314 gimple_omp_for_final (stmt
, i
));
1315 gimple_omp_for_set_incr (copy
, i
,
1316 gimple_omp_for_incr (stmt
, i
));
1317 gimple_omp_for_set_cond (copy
, i
,
1318 gimple_omp_for_cond (stmt
, i
));
1323 case GIMPLE_OMP_MASTER
:
1324 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1325 copy
= gimple_build_omp_master (s1
);
1328 case GIMPLE_OMP_ORDERED
:
1329 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1330 copy
= gimple_build_omp_ordered (s1
);
1333 case GIMPLE_OMP_SECTION
:
1334 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1335 copy
= gimple_build_omp_section (s1
);
1338 case GIMPLE_OMP_SECTIONS
:
1339 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1340 copy
= gimple_build_omp_sections
1341 (s1
, gimple_omp_sections_clauses (stmt
));
1344 case GIMPLE_OMP_SINGLE
:
1345 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1346 copy
= gimple_build_omp_single
1347 (s1
, gimple_omp_single_clauses (stmt
));
1350 case GIMPLE_OMP_CRITICAL
:
1351 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1353 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1356 case GIMPLE_TRANSACTION
:
1357 s1
= remap_gimple_seq (gimple_transaction_body (stmt
), id
);
1358 copy
= gimple_build_transaction (s1
, gimple_transaction_label (stmt
));
1359 gimple_transaction_set_subcode (copy
, gimple_transaction_subcode (stmt
));
1368 if (gimple_assign_copy_p (stmt
)
1369 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1370 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1372 /* Here we handle statements that are not completely rewritten.
1373 First we detect some inlining-induced bogosities for
1376 /* Some assignments VAR = VAR; don't generate any rtl code
1377 and thus don't count as variable modification. Avoid
1378 keeping bogosities like 0 = 0. */
1379 tree decl
= gimple_assign_lhs (stmt
), value
;
1382 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1386 STRIP_TYPE_NOPS (value
);
1387 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1388 return gimple_build_nop ();
1392 if (gimple_debug_bind_p (stmt
))
1394 copy
= gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1395 gimple_debug_bind_get_value (stmt
),
1397 id
->debug_stmts
.safe_push (copy
);
1400 if (gimple_debug_source_bind_p (stmt
))
1402 copy
= gimple_build_debug_source_bind
1403 (gimple_debug_source_bind_get_var (stmt
),
1404 gimple_debug_source_bind_get_value (stmt
), stmt
);
1405 id
->debug_stmts
.safe_push (copy
);
1409 /* Create a new deep copy of the statement. */
1410 copy
= gimple_copy (stmt
);
1412 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1413 RESX and EH_DISPATCH. */
1415 switch (gimple_code (copy
))
1419 tree r
, fndecl
= gimple_call_fndecl (copy
);
1420 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1421 switch (DECL_FUNCTION_CODE (fndecl
))
1423 case BUILT_IN_EH_COPY_VALUES
:
1424 r
= gimple_call_arg (copy
, 1);
1425 r
= remap_eh_region_tree_nr (r
, id
);
1426 gimple_call_set_arg (copy
, 1, r
);
1429 case BUILT_IN_EH_POINTER
:
1430 case BUILT_IN_EH_FILTER
:
1431 r
= gimple_call_arg (copy
, 0);
1432 r
= remap_eh_region_tree_nr (r
, id
);
1433 gimple_call_set_arg (copy
, 0, r
);
1440 /* Reset alias info if we didn't apply measures to
1441 keep it valid over inlining by setting DECL_PT_UID. */
1442 if (!id
->src_cfun
->gimple_df
1443 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1444 gimple_call_reset_alias_info (copy
);
1450 int r
= gimple_resx_region (copy
);
1451 r
= remap_eh_region_nr (r
, id
);
1452 gimple_resx_set_region (copy
, r
);
1456 case GIMPLE_EH_DISPATCH
:
1458 int r
= gimple_eh_dispatch_region (copy
);
1459 r
= remap_eh_region_nr (r
, id
);
1460 gimple_eh_dispatch_set_region (copy
, r
);
1469 /* If STMT has a block defined, map it to the newly constructed
1471 if (gimple_block (copy
))
1474 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1476 gimple_set_block (copy
, *n
);
1479 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1482 /* Remap all the operands in COPY. */
1483 memset (&wi
, 0, sizeof (wi
));
1486 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1488 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1490 /* Clear the copied virtual operands. We are not remapping them here
1491 but are going to recreate them from scratch. */
1492 if (gimple_has_mem_ops (copy
))
1494 gimple_set_vdef (copy
, NULL_TREE
);
1495 gimple_set_vuse (copy
, NULL_TREE
);
1502 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1506 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1507 gcov_type count_scale
)
1509 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1510 basic_block copy_basic_block
;
1515 /* Search for previous copied basic block. */
1518 prev
= prev
->prev_bb
;
1520 /* create_basic_block() will append every new block to
1521 basic_block_info automatically. */
1522 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1523 (basic_block
) prev
->aux
);
1524 /* Update to use apply_probability(). */
1525 copy_basic_block
->count
= bb
->count
* count_scale
/ REG_BR_PROB_BASE
;
1527 /* We are going to rebuild frequencies from scratch. These values
1528 have just small importance to drive canonicalize_loop_headers. */
1529 /* Update to use EDGE_FREQUENCY. */
1530 freq
= ((gcov_type
)bb
->frequency
* frequency_scale
/ REG_BR_PROB_BASE
);
1532 /* We recompute frequencies after inlining, so this is quite safe. */
1533 if (freq
> BB_FREQ_MAX
)
1535 copy_basic_block
->frequency
= freq
;
1537 copy_gsi
= gsi_start_bb (copy_basic_block
);
1539 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1541 gimple stmt
= gsi_stmt (gsi
);
1542 gimple orig_stmt
= stmt
;
1544 id
->regimplify
= false;
1545 stmt
= remap_gimple_stmt (stmt
, id
);
1546 if (gimple_nop_p (stmt
))
1549 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1552 /* With return slot optimization we can end up with
1553 non-gimple (foo *)&this->m, fix that here. */
1554 if (is_gimple_assign (stmt
)
1555 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1556 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1559 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1560 gimple_assign_rhs1 (stmt
),
1562 GSI_CONTINUE_LINKING
);
1563 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1564 id
->regimplify
= false;
1567 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1570 gimple_regimplify_operands (stmt
, &seq_gsi
);
1572 /* If copy_basic_block has been empty at the start of this iteration,
1573 call gsi_start_bb again to get at the newly added statements. */
1574 if (gsi_end_p (copy_gsi
))
1575 copy_gsi
= gsi_start_bb (copy_basic_block
);
1577 gsi_next (©_gsi
);
1579 /* Process the new statement. The call to gimple_regimplify_operands
1580 possibly turned the statement into multiple statements, we
1581 need to process all of them. */
1586 stmt
= gsi_stmt (copy_gsi
);
1587 if (is_gimple_call (stmt
)
1588 && gimple_call_va_arg_pack_p (stmt
)
1591 /* __builtin_va_arg_pack () should be replaced by
1592 all arguments corresponding to ... in the caller. */
1596 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1599 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1602 /* Create the new array of arguments. */
1603 n
= nargs
+ gimple_call_num_args (stmt
);
1604 argarray
.create (n
);
1605 argarray
.safe_grow_cleared (n
);
1607 /* Copy all the arguments before '...' */
1608 memcpy (argarray
.address (),
1609 gimple_call_arg_ptr (stmt
, 0),
1610 gimple_call_num_args (stmt
) * sizeof (tree
));
1612 /* Append the arguments passed in '...' */
1613 memcpy (argarray
.address () + gimple_call_num_args (stmt
),
1614 gimple_call_arg_ptr (id
->gimple_call
, 0)
1615 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1616 nargs
* sizeof (tree
));
1618 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1621 argarray
.release ();
1623 /* Copy all GIMPLE_CALL flags, location and block, except
1624 GF_CALL_VA_ARG_PACK. */
1625 gimple_call_copy_flags (new_call
, stmt
);
1626 gimple_call_set_va_arg_pack (new_call
, false);
1627 gimple_set_location (new_call
, gimple_location (stmt
));
1628 gimple_set_block (new_call
, gimple_block (stmt
));
1629 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1631 gsi_replace (©_gsi
, new_call
, false);
1634 else if (is_gimple_call (stmt
)
1636 && (decl
= gimple_call_fndecl (stmt
))
1637 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1638 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1640 /* __builtin_va_arg_pack_len () should be replaced by
1641 the number of anonymous arguments. */
1642 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1646 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1649 count
= build_int_cst (integer_type_node
, nargs
);
1650 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1651 gsi_replace (©_gsi
, new_stmt
, false);
1655 /* Statements produced by inlining can be unfolded, especially
1656 when we constant propagated some operands. We can't fold
1657 them right now for two reasons:
1658 1) folding require SSA_NAME_DEF_STMTs to be correct
1659 2) we can't change function calls to builtins.
1660 So we just mark statement for later folding. We mark
1661 all new statements, instead just statements that has changed
1662 by some nontrivial substitution so even statements made
1663 foldable indirectly are updated. If this turns out to be
1664 expensive, copy_body can be told to watch for nontrivial
1666 if (id
->statements_to_fold
)
1667 pointer_set_insert (id
->statements_to_fold
, stmt
);
1669 /* We're duplicating a CALL_EXPR. Find any corresponding
1670 callgraph edges and update or duplicate them. */
1671 if (is_gimple_call (stmt
))
1673 struct cgraph_edge
*edge
;
1676 switch (id
->transform_call_graph_edges
)
1678 case CB_CGE_DUPLICATE
:
1679 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1682 int edge_freq
= edge
->frequency
;
1683 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1685 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1687 /* We could also just rescale the frequency, but
1688 doing so would introduce roundoff errors and make
1689 verifier unhappy. */
1691 = compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1694 && profile_status_for_function (cfun
) != PROFILE_ABSENT
1695 && (edge_freq
> edge
->frequency
+ 10
1696 || edge_freq
< edge
->frequency
- 10))
1698 fprintf (dump_file
, "Edge frequency estimated by "
1699 "cgraph %i diverge from inliner's estimate %i\n",
1703 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1706 copy_basic_block
->frequency
);
1708 stmt
= cgraph_redirect_edge_call_stmt_to_callee (edge
);
1712 case CB_CGE_MOVE_CLONES
:
1713 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1715 edge
= cgraph_edge (id
->dst_node
, stmt
);
1719 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1721 cgraph_set_call_stmt (edge
, stmt
);
1728 /* Constant propagation on argument done during inlining
1729 may create new direct call. Produce an edge for it. */
1731 || (edge
->indirect_inlining_edge
1732 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1733 && id
->dst_node
->analyzed
1734 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1736 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1738 /* We have missing edge in the callgraph. This can happen
1739 when previous inlining turned an indirect call into a
1740 direct call by constant propagating arguments or we are
1741 producing dead clone (for further cloning). In all
1742 other cases we hit a bug (incorrect node sharing is the
1743 most common reason for missing edges). */
1744 gcc_assert (!dest
->analyzed
1745 || dest
->symbol
.address_taken
1746 || !id
->src_node
->analyzed
1747 || !id
->dst_node
->analyzed
);
1748 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1749 cgraph_create_edge_including_clones
1750 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1751 compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1753 CIF_ORIGINALLY_INDIRECT_CALL
);
1755 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1757 compute_call_stmt_bb_frequency
1758 (id
->dst_node
->symbol
.decl
,
1759 copy_basic_block
))->inline_failed
1760 = CIF_ORIGINALLY_INDIRECT_CALL
;
1763 fprintf (dump_file
, "Created new direct edge to %s\n",
1764 cgraph_node_name (dest
));
1768 flags
= gimple_call_flags (stmt
);
1769 if (flags
& ECF_MAY_BE_ALLOCA
)
1770 cfun
->calls_alloca
= true;
1771 if (flags
& ECF_RETURNS_TWICE
)
1772 cfun
->calls_setjmp
= true;
1775 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1776 id
->eh_map
, id
->eh_lp_nr
);
1778 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1783 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1784 if (TREE_CODE (def
) == SSA_NAME
)
1785 SSA_NAME_DEF_STMT (def
) = stmt
;
1788 gsi_next (©_gsi
);
1790 while (!gsi_end_p (copy_gsi
));
1792 copy_gsi
= gsi_last_bb (copy_basic_block
);
1795 return copy_basic_block
;
1798 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1799 form is quite easy, since dominator relationship for old basic blocks does
1802 There is however exception where inlining might change dominator relation
1803 across EH edges from basic block within inlined functions destinating
1804 to landing pads in function we inline into.
1806 The function fills in PHI_RESULTs of such PHI nodes if they refer
1807 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1808 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1809 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1810 set, and this means that there will be no overlapping live ranges
1811 for the underlying symbol.
1813 This might change in future if we allow redirecting of EH edges and
1814 we might want to change way build CFG pre-inlining to include
1815 all the possible edges then. */
1817 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1818 bool can_throw
, bool nonlocal_goto
)
1823 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1825 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1828 gimple_stmt_iterator si
;
1831 gcc_assert (e
->flags
& EDGE_EH
);
1834 gcc_assert (!(e
->flags
& EDGE_EH
));
1836 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1840 phi
= gsi_stmt (si
);
1842 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1843 gcc_assert (!e
->dest
->aux
);
1845 gcc_assert ((e
->flags
& EDGE_EH
)
1846 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1848 if (virtual_operand_p (PHI_RESULT (phi
)))
1850 mark_virtual_operands_for_renaming (cfun
);
1854 re
= find_edge (ret_bb
, e
->dest
);
1856 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1857 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1859 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1860 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1866 /* Copy edges from BB into its copy constructed earlier, scale profile
1867 accordingly. Edges will be taken care of later. Assume aux
1868 pointers to point to the copies of each BB. Return true if any
1869 debug stmts are left after a statement that must end the basic block. */
1872 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
)
1874 basic_block new_bb
= (basic_block
) bb
->aux
;
1877 gimple_stmt_iterator si
;
1879 bool need_debug_cleanup
= false;
1881 /* Use the indices from the original blocks to create edges for the
1883 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1884 if (!(old_edge
->flags
& EDGE_EH
))
1888 flags
= old_edge
->flags
;
1890 /* Return edges do get a FALLTHRU flag when the get inlined. */
1891 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1892 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR
)
1893 flags
|= EDGE_FALLTHRU
;
1894 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1895 /* Update to use apply_probability(). */
1896 new_edge
->count
= old_edge
->count
* count_scale
/ REG_BR_PROB_BASE
;
1897 new_edge
->probability
= old_edge
->probability
;
1900 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1903 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
1906 bool can_throw
, nonlocal_goto
;
1908 copy_stmt
= gsi_stmt (si
);
1909 if (!is_gimple_debug (copy_stmt
))
1910 update_stmt (copy_stmt
);
1912 /* Do this before the possible split_block. */
1915 /* If this tree could throw an exception, there are two
1916 cases where we need to add abnormal edge(s): the
1917 tree wasn't in a region and there is a "current
1918 region" in the caller; or the original tree had
1919 EH edges. In both cases split the block after the tree,
1920 and add abnormal edge(s) as needed; we need both
1921 those from the callee and the caller.
1922 We check whether the copy can throw, because the const
1923 propagation can change an INDIRECT_REF which throws
1924 into a COMPONENT_REF which doesn't. If the copy
1925 can throw, the original could also throw. */
1926 can_throw
= stmt_can_throw_internal (copy_stmt
);
1927 nonlocal_goto
= stmt_can_make_abnormal_goto (copy_stmt
);
1929 if (can_throw
|| nonlocal_goto
)
1931 if (!gsi_end_p (si
))
1933 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
1936 need_debug_cleanup
= true;
1938 if (!gsi_end_p (si
))
1939 /* Note that bb's predecessor edges aren't necessarily
1940 right at this point; split_block doesn't care. */
1942 edge e
= split_block (new_bb
, copy_stmt
);
1945 new_bb
->aux
= e
->src
->aux
;
1946 si
= gsi_start_bb (new_bb
);
1950 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
1951 make_eh_dispatch_edges (copy_stmt
);
1953 make_eh_edges (copy_stmt
);
1956 make_abnormal_goto_edges (gimple_bb (copy_stmt
), true);
1958 if ((can_throw
|| nonlocal_goto
)
1959 && gimple_in_ssa_p (cfun
))
1960 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
1961 can_throw
, nonlocal_goto
);
1963 return need_debug_cleanup
;
1966 /* Copy the PHIs. All blocks and edges are copied, some blocks
1967 was possibly split and new outgoing EH edges inserted.
1968 BB points to the block of original function and AUX pointers links
1969 the original and newly copied blocks. */
1972 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
1974 basic_block
const new_bb
= (basic_block
) bb
->aux
;
1977 gimple_stmt_iterator si
;
1979 bool inserted
= false;
1981 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
1986 phi
= gsi_stmt (si
);
1987 res
= PHI_RESULT (phi
);
1989 if (!virtual_operand_p (res
))
1991 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
1992 new_phi
= create_phi_node (new_res
, new_bb
);
1993 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
1995 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2001 /* When doing partial cloning, we allow PHIs on the entry block
2002 as long as all the arguments are the same. Find any input
2003 edge to see argument to copy. */
2005 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2006 if (!old_edge
->src
->aux
)
2009 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2011 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2012 gcc_assert (new_arg
);
2013 /* With return slot optimization we can end up with
2014 non-gimple (foo *)&this->m, fix that here. */
2015 if (TREE_CODE (new_arg
) != SSA_NAME
2016 && TREE_CODE (new_arg
) != FUNCTION_DECL
2017 && !is_gimple_val (new_arg
))
2019 gimple_seq stmts
= NULL
;
2020 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2021 gsi_insert_seq_on_edge (new_edge
, stmts
);
2024 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2025 if (LOCATION_BLOCK (locus
))
2028 n
= (tree
*) pointer_map_contains (id
->decl_map
,
2029 LOCATION_BLOCK (locus
));
2031 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2034 locus
= LOCATION_LOCUS (locus
);
2036 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2041 /* Commit the delayed edge insertions. */
2043 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2044 gsi_commit_one_edge_insert (new_edge
, NULL
);
2048 /* Wrapper for remap_decl so it can be used as a callback. */
2051 remap_decl_1 (tree decl
, void *data
)
2053 return remap_decl (decl
, (copy_body_data
*) data
);
2056 /* Build struct function and associated datastructures for the new clone
2057 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2058 the cfun to the function of new_fndecl (and current_function_decl too). */
2061 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2063 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2064 gcov_type count_scale
;
2066 /* Update to use GCOV_COMPUTE_SCALE. */
2067 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2068 count_scale
= (REG_BR_PROB_BASE
* count
2069 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2071 count_scale
= REG_BR_PROB_BASE
;
2073 /* Register specific tree functions. */
2074 gimple_register_cfg_hooks ();
2076 /* Get clean struct function. */
2077 push_struct_function (new_fndecl
);
2079 /* We will rebuild these, so just sanity check that they are empty. */
2080 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2081 gcc_assert (cfun
->local_decls
== NULL
);
2082 gcc_assert (cfun
->cfg
== NULL
);
2083 gcc_assert (cfun
->decl
== new_fndecl
);
2085 /* Copy items we preserve during cloning. */
2086 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2087 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2088 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2089 cfun
->curr_properties
= src_cfun
->curr_properties
& ~PROP_loops
;
2090 cfun
->last_verified
= src_cfun
->last_verified
;
2091 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2092 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2093 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2094 cfun
->stdarg
= src_cfun
->stdarg
;
2095 cfun
->after_inlining
= src_cfun
->after_inlining
;
2096 cfun
->can_throw_non_call_exceptions
2097 = src_cfun
->can_throw_non_call_exceptions
;
2098 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2099 cfun
->returns_struct
= src_cfun
->returns_struct
;
2100 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2102 init_empty_tree_cfg ();
2104 profile_status_for_function (cfun
) = profile_status_for_function (src_cfun
);
2105 ENTRY_BLOCK_PTR
->count
=
2106 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2108 ENTRY_BLOCK_PTR
->frequency
2109 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2110 EXIT_BLOCK_PTR
->count
=
2111 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2113 EXIT_BLOCK_PTR
->frequency
=
2114 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2116 init_eh_for_function ();
2118 if (src_cfun
->gimple_df
)
2120 init_tree_ssa (cfun
);
2121 cfun
->gimple_df
->in_ssa_p
= true;
2122 init_ssa_operands (cfun
);
2126 /* Helper function for copy_cfg_body. Move debug stmts from the end
2127 of NEW_BB to the beginning of successor basic blocks when needed. If the
2128 successor has multiple predecessors, reset them, otherwise keep
2132 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2136 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2139 || gsi_one_before_end_p (si
)
2140 || !(stmt_can_throw_internal (gsi_stmt (si
))
2141 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2144 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2146 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2147 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2148 while (is_gimple_debug (gsi_stmt (ssi
)))
2150 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2154 /* For the last edge move the debug stmts instead of copying
2156 if (ei_one_before_end_p (ei
))
2160 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2161 gimple_debug_bind_reset_value (stmt
);
2162 gsi_remove (&si
, false);
2163 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2167 if (gimple_debug_bind_p (stmt
))
2169 var
= gimple_debug_bind_get_var (stmt
);
2170 if (single_pred_p (e
->dest
))
2172 value
= gimple_debug_bind_get_value (stmt
);
2173 value
= unshare_expr (value
);
2177 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2179 else if (gimple_debug_source_bind_p (stmt
))
2181 var
= gimple_debug_source_bind_get_var (stmt
);
2182 value
= gimple_debug_source_bind_get_value (stmt
);
2183 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2187 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2188 id
->debug_stmts
.safe_push (new_stmt
);
2194 /* Make a copy of the body of FN so that it can be inserted inline in
2195 another function. Walks FN via CFG, returns new fndecl. */
2198 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2199 basic_block entry_block_map
, basic_block exit_block_map
,
2200 bitmap blocks_to_copy
, basic_block new_entry
)
2202 tree callee_fndecl
= id
->src_fn
;
2203 /* Original cfun for the callee, doesn't change. */
2204 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2205 struct function
*cfun_to_copy
;
2207 tree new_fndecl
= NULL
;
2208 bool need_debug_cleanup
= false;
2209 gcov_type count_scale
;
2211 int incoming_frequency
= 0;
2212 gcov_type incoming_count
= 0;
2214 /* Update to use GCOV_COMPUTE_SCALE. */
2215 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2216 count_scale
= (REG_BR_PROB_BASE
* count
2217 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2219 count_scale
= REG_BR_PROB_BASE
;
2221 /* Register specific tree functions. */
2222 gimple_register_cfg_hooks ();
2224 /* If we are inlining just region of the function, make sure to connect new entry
2225 to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute
2226 frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and
2227 probabilities of edges incoming from nonduplicated region. */
2233 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2236 incoming_frequency
+= EDGE_FREQUENCY (e
);
2237 incoming_count
+= e
->count
;
2239 /* Update to use apply_probability(). */
2240 incoming_count
= incoming_count
* count_scale
/ REG_BR_PROB_BASE
;
2241 /* Update to use EDGE_FREQUENCY. */
2243 = incoming_frequency
* frequency_scale
/ REG_BR_PROB_BASE
;
2244 ENTRY_BLOCK_PTR
->count
= incoming_count
;
2245 ENTRY_BLOCK_PTR
->frequency
= incoming_frequency
;
2248 /* Must have a CFG here at this point. */
2249 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2250 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2252 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2254 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= entry_block_map
;
2255 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= exit_block_map
;
2256 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2257 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2259 /* Duplicate any exception-handling regions. */
2261 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2264 /* Use aux pointers to map the original blocks to copy. */
2265 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2266 if (!blocks_to_copy
|| bitmap_bit_p (blocks_to_copy
, bb
->index
))
2268 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2273 last
= last_basic_block
;
2275 /* Now that we've duplicated the blocks, duplicate their edges. */
2276 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2278 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2279 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
);
2283 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2284 e
->probability
= REG_BR_PROB_BASE
;
2285 e
->count
= incoming_count
;
2288 if (gimple_in_ssa_p (cfun
))
2289 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2291 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2292 copy_phis_for_bb (bb
, id
);
2294 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2297 if (need_debug_cleanup
2298 && bb
->index
!= ENTRY_BLOCK
2299 && bb
->index
!= EXIT_BLOCK
)
2300 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2301 ((basic_block
)bb
->aux
)->aux
= NULL
;
2305 /* Zero out AUX fields of newly created block during EH edge
2307 for (; last
< last_basic_block
; last
++)
2309 if (need_debug_cleanup
)
2310 maybe_move_debug_stmts_to_successors (id
, BASIC_BLOCK (last
));
2311 BASIC_BLOCK (last
)->aux
= NULL
;
2313 entry_block_map
->aux
= NULL
;
2314 exit_block_map
->aux
= NULL
;
2318 pointer_map_destroy (id
->eh_map
);
2325 /* Copy the debug STMT using ID. We deal with these statements in a
2326 special way: if any variable in their VALUE expression wasn't
2327 remapped yet, we won't remap it, because that would get decl uids
2328 out of sync, causing codegen differences between -g and -g0. If
2329 this arises, we drop the VALUE expression altogether. */
2332 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2335 struct walk_stmt_info wi
;
2337 if (gimple_block (stmt
))
2339 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2340 gimple_set_block (stmt
, n
? *n
: id
->block
);
2343 /* Remap all the operands in COPY. */
2344 memset (&wi
, 0, sizeof (wi
));
2347 processing_debug_stmt
= 1;
2349 if (gimple_debug_source_bind_p (stmt
))
2350 t
= gimple_debug_source_bind_get_var (stmt
);
2352 t
= gimple_debug_bind_get_var (stmt
);
2354 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2355 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2357 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2360 else if (TREE_CODE (t
) == VAR_DECL
2361 && !is_global_var (t
)
2362 && !pointer_map_contains (id
->decl_map
, t
))
2363 /* T is a non-localized variable. */;
2365 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2367 if (gimple_debug_bind_p (stmt
))
2369 gimple_debug_bind_set_var (stmt
, t
);
2371 if (gimple_debug_bind_has_value_p (stmt
))
2372 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2373 remap_gimple_op_r
, &wi
, NULL
);
2375 /* Punt if any decl couldn't be remapped. */
2376 if (processing_debug_stmt
< 0)
2377 gimple_debug_bind_reset_value (stmt
);
2379 else if (gimple_debug_source_bind_p (stmt
))
2381 gimple_debug_source_bind_set_var (stmt
, t
);
2382 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2383 remap_gimple_op_r
, &wi
, NULL
);
2384 /* When inlining and source bind refers to one of the optimized
2385 away parameters, change the source bind into normal debug bind
2386 referring to the corresponding DEBUG_EXPR_DECL that should have
2387 been bound before the call stmt. */
2388 t
= gimple_debug_source_bind_get_value (stmt
);
2390 && TREE_CODE (t
) == PARM_DECL
2393 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2395 if (debug_args
!= NULL
)
2397 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2398 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2399 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2401 t
= (**debug_args
)[i
+ 1];
2402 stmt
->gsbase
.subcode
= GIMPLE_DEBUG_BIND
;
2403 gimple_debug_bind_set_value (stmt
, t
);
2410 processing_debug_stmt
= 0;
2415 /* Process deferred debug stmts. In order to give values better odds
2416 of being successfully remapped, we delay the processing of debug
2417 stmts until all other stmts that might require remapping are
2421 copy_debug_stmts (copy_body_data
*id
)
2426 if (!id
->debug_stmts
.exists ())
2429 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2430 copy_debug_stmt (stmt
, id
);
2432 id
->debug_stmts
.release ();
2435 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2436 another function. */
2439 copy_tree_body (copy_body_data
*id
)
2441 tree fndecl
= id
->src_fn
;
2442 tree body
= DECL_SAVED_TREE (fndecl
);
2444 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2449 /* Make a copy of the body of FN so that it can be inserted inline in
2450 another function. */
2453 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2454 basic_block entry_block_map
, basic_block exit_block_map
,
2455 bitmap blocks_to_copy
, basic_block new_entry
)
2457 tree fndecl
= id
->src_fn
;
2460 /* If this body has a CFG, walk CFG and copy. */
2461 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl
)));
2462 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2463 blocks_to_copy
, new_entry
);
2464 copy_debug_stmts (id
);
2469 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2470 defined in function FN, or of a data member thereof. */
2473 self_inlining_addr_expr (tree value
, tree fn
)
2477 if (TREE_CODE (value
) != ADDR_EXPR
)
2480 var
= get_base_address (TREE_OPERAND (value
, 0));
2482 return var
&& auto_var_in_fn_p (var
, fn
);
2485 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2486 lexical block and line number information from base_stmt, if given,
2487 or from the last stmt of the block otherwise. */
2490 insert_init_debug_bind (copy_body_data
*id
,
2491 basic_block bb
, tree var
, tree value
,
2495 gimple_stmt_iterator gsi
;
2498 if (!gimple_in_ssa_p (id
->src_cfun
))
2501 if (!MAY_HAVE_DEBUG_STMTS
)
2504 tracked_var
= target_for_debug_bind (var
);
2510 gsi
= gsi_last_bb (bb
);
2511 if (!base_stmt
&& !gsi_end_p (gsi
))
2512 base_stmt
= gsi_stmt (gsi
);
2515 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2519 if (!gsi_end_p (gsi
))
2520 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2522 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2529 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2531 /* If VAR represents a zero-sized variable, it's possible that the
2532 assignment statement may result in no gimple statements. */
2535 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2537 /* We can end up with init statements that store to a non-register
2538 from a rhs with a conversion. Handle that here by forcing the
2539 rhs into a temporary. gimple_regimplify_operands is not
2540 prepared to do this for us. */
2541 if (!is_gimple_debug (init_stmt
)
2542 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2543 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2544 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2546 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2547 gimple_expr_type (init_stmt
),
2548 gimple_assign_rhs1 (init_stmt
));
2549 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2551 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2552 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2554 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2555 gimple_regimplify_operands (init_stmt
, &si
);
2557 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2559 tree def
= gimple_assign_lhs (init_stmt
);
2560 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2565 /* Initialize parameter P with VALUE. If needed, produce init statement
2566 at the end of BB. When BB is NULL, we return init statement to be
2569 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2570 basic_block bb
, tree
*vars
)
2572 gimple init_stmt
= NULL
;
2575 tree def
= (gimple_in_ssa_p (cfun
)
2576 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2579 && value
!= error_mark_node
2580 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2582 /* If we can match up types by promotion/demotion do so. */
2583 if (fold_convertible_p (TREE_TYPE (p
), value
))
2584 rhs
= fold_convert (TREE_TYPE (p
), value
);
2587 /* ??? For valid programs we should not end up here.
2588 Still if we end up with truly mismatched types here, fall back
2589 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2590 GIMPLE to the following passes. */
2591 if (!is_gimple_reg_type (TREE_TYPE (value
))
2592 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2593 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2595 rhs
= build_zero_cst (TREE_TYPE (p
));
2599 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2600 here since the type of this decl must be visible to the calling
2602 var
= copy_decl_to_var (p
, id
);
2604 /* Declare this new variable. */
2605 DECL_CHAIN (var
) = *vars
;
2608 /* Make gimplifier happy about this variable. */
2609 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2611 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2612 we would not need to create a new variable here at all, if it
2613 weren't for debug info. Still, we can just use the argument
2615 if (TREE_READONLY (p
)
2616 && !TREE_ADDRESSABLE (p
)
2617 && value
&& !TREE_SIDE_EFFECTS (value
)
2620 /* We may produce non-gimple trees by adding NOPs or introduce
2621 invalid sharing when operand is not really constant.
2622 It is not big deal to prohibit constant propagation here as
2623 we will constant propagate in DOM1 pass anyway. */
2624 if (is_gimple_min_invariant (value
)
2625 && useless_type_conversion_p (TREE_TYPE (p
),
2627 /* We have to be very careful about ADDR_EXPR. Make sure
2628 the base variable isn't a local variable of the inlined
2629 function, e.g., when doing recursive inlining, direct or
2630 mutually-recursive or whatever, which is why we don't
2631 just test whether fn == current_function_decl. */
2632 && ! self_inlining_addr_expr (value
, fn
))
2634 insert_decl_map (id
, p
, value
);
2635 insert_debug_decl_map (id
, p
, var
);
2636 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2640 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2641 that way, when the PARM_DECL is encountered, it will be
2642 automatically replaced by the VAR_DECL. */
2643 insert_decl_map (id
, p
, var
);
2645 /* Even if P was TREE_READONLY, the new VAR should not be.
2646 In the original code, we would have constructed a
2647 temporary, and then the function body would have never
2648 changed the value of P. However, now, we will be
2649 constructing VAR directly. The constructor body may
2650 change its value multiple times as it is being
2651 constructed. Therefore, it must not be TREE_READONLY;
2652 the back-end assumes that TREE_READONLY variable is
2653 assigned to only once. */
2654 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2655 TREE_READONLY (var
) = 0;
2657 /* If there is no setup required and we are in SSA, take the easy route
2658 replacing all SSA names representing the function parameter by the
2659 SSA name passed to function.
2661 We need to construct map for the variable anyway as it might be used
2662 in different SSA names when parameter is set in function.
2664 Do replacement at -O0 for const arguments replaced by constant.
2665 This is important for builtin_constant_p and other construct requiring
2666 constant argument to be visible in inlined function body. */
2667 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2669 || (TREE_READONLY (p
)
2670 && is_gimple_min_invariant (rhs
)))
2671 && (TREE_CODE (rhs
) == SSA_NAME
2672 || is_gimple_min_invariant (rhs
))
2673 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2675 insert_decl_map (id
, def
, rhs
);
2676 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2679 /* If the value of argument is never used, don't care about initializing
2681 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2683 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2684 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2687 /* Initialize this VAR_DECL from the equivalent argument. Convert
2688 the argument to the proper type in case it was promoted. */
2691 if (rhs
== error_mark_node
)
2693 insert_decl_map (id
, p
, var
);
2694 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2697 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2699 /* If we are in SSA form properly remap the default definition
2700 or assign to a dummy SSA name if the parameter is unused and
2701 we are not optimizing. */
2702 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2706 def
= remap_ssa_name (def
, id
);
2707 init_stmt
= gimple_build_assign (def
, rhs
);
2708 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2709 set_ssa_default_def (cfun
, var
, NULL
);
2713 def
= make_ssa_name (var
, NULL
);
2714 init_stmt
= gimple_build_assign (def
, rhs
);
2718 init_stmt
= gimple_build_assign (var
, rhs
);
2720 if (bb
&& init_stmt
)
2721 insert_init_stmt (id
, bb
, init_stmt
);
2726 /* Generate code to initialize the parameters of the function at the
2727 top of the stack in ID from the GIMPLE_CALL STMT. */
2730 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2731 tree fn
, basic_block bb
)
2736 tree vars
= NULL_TREE
;
2737 tree static_chain
= gimple_call_chain (stmt
);
2739 /* Figure out what the parameters are. */
2740 parms
= DECL_ARGUMENTS (fn
);
2742 /* Loop through the parameter declarations, replacing each with an
2743 equivalent VAR_DECL, appropriately initialized. */
2744 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2747 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2748 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2750 /* After remapping parameters remap their types. This has to be done
2751 in a second loop over all parameters to appropriately remap
2752 variable sized arrays when the size is specified in a
2753 parameter following the array. */
2754 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2756 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
2758 && TREE_CODE (*varp
) == VAR_DECL
)
2760 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
2761 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2763 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
2764 /* Also remap the default definition if it was remapped
2765 to the default definition of the parameter replacement
2766 by the parameter setup. */
2769 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
2771 && TREE_CODE (*defp
) == SSA_NAME
2772 && SSA_NAME_VAR (*defp
) == var
)
2773 TREE_TYPE (*defp
) = TREE_TYPE (var
);
2778 /* Initialize the static chain. */
2779 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
2780 gcc_assert (fn
!= current_function_decl
);
2783 /* No static chain? Seems like a bug in tree-nested.c. */
2784 gcc_assert (static_chain
);
2786 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
2789 declare_inline_vars (id
->block
, vars
);
2793 /* Declare a return variable to replace the RESULT_DECL for the
2794 function we are calling. An appropriate DECL_STMT is returned.
2795 The USE_STMT is filled to contain a use of the declaration to
2796 indicate the return value of the function.
2798 RETURN_SLOT, if non-null is place where to store the result. It
2799 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2800 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2802 The return value is a (possibly null) value that holds the result
2803 as seen by the caller. */
2806 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
2807 basic_block entry_bb
)
2809 tree callee
= id
->src_fn
;
2810 tree result
= DECL_RESULT (callee
);
2811 tree callee_type
= TREE_TYPE (result
);
2815 /* Handle type-mismatches in the function declaration return type
2816 vs. the call expression. */
2818 caller_type
= TREE_TYPE (modify_dest
);
2820 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
2822 /* We don't need to do anything for functions that don't return anything. */
2823 if (VOID_TYPE_P (callee_type
))
2826 /* If there was a return slot, then the return value is the
2827 dereferenced address of that object. */
2830 /* The front end shouldn't have used both return_slot and
2831 a modify expression. */
2832 gcc_assert (!modify_dest
);
2833 if (DECL_BY_REFERENCE (result
))
2835 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
2836 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
2838 /* We are going to construct *&return_slot and we can't do that
2839 for variables believed to be not addressable.
2841 FIXME: This check possibly can match, because values returned
2842 via return slot optimization are not believed to have address
2843 taken by alias analysis. */
2844 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
2845 var
= return_slot_addr
;
2850 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
2851 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
2853 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2854 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2855 && !DECL_GIMPLE_REG_P (result
)
2857 DECL_GIMPLE_REG_P (var
) = 0;
2862 /* All types requiring non-trivial constructors should have been handled. */
2863 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
2865 /* Attempt to avoid creating a new temporary variable. */
2867 && TREE_CODE (modify_dest
) != SSA_NAME
)
2869 bool use_it
= false;
2871 /* We can't use MODIFY_DEST if there's type promotion involved. */
2872 if (!useless_type_conversion_p (callee_type
, caller_type
))
2875 /* ??? If we're assigning to a variable sized type, then we must
2876 reuse the destination variable, because we've no good way to
2877 create variable sized temporaries at this point. */
2878 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
2881 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2882 reuse it as the result of the call directly. Don't do this if
2883 it would promote MODIFY_DEST to addressable. */
2884 else if (TREE_ADDRESSABLE (result
))
2888 tree base_m
= get_base_address (modify_dest
);
2890 /* If the base isn't a decl, then it's a pointer, and we don't
2891 know where that's going to go. */
2892 if (!DECL_P (base_m
))
2894 else if (is_global_var (base_m
))
2896 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2897 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2898 && !DECL_GIMPLE_REG_P (result
)
2899 && DECL_GIMPLE_REG_P (base_m
))
2901 else if (!TREE_ADDRESSABLE (base_m
))
2913 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
2915 var
= copy_result_decl_to_var (result
, id
);
2916 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2918 /* Do not have the rest of GCC warn about this variable as it should
2919 not be visible to the user. */
2920 TREE_NO_WARNING (var
) = 1;
2922 declare_inline_vars (id
->block
, var
);
2924 /* Build the use expr. If the return type of the function was
2925 promoted, convert it back to the expected type. */
2927 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
2929 /* If we can match up types by promotion/demotion do so. */
2930 if (fold_convertible_p (caller_type
, var
))
2931 use
= fold_convert (caller_type
, var
);
2934 /* ??? For valid programs we should not end up here.
2935 Still if we end up with truly mismatched types here, fall back
2936 to using a MEM_REF to not leak invalid GIMPLE to the following
2938 /* Prevent var from being written into SSA form. */
2939 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
2940 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
2941 DECL_GIMPLE_REG_P (var
) = false;
2942 else if (is_gimple_reg_type (TREE_TYPE (var
)))
2943 TREE_ADDRESSABLE (var
) = true;
2944 use
= fold_build2 (MEM_REF
, caller_type
,
2945 build_fold_addr_expr (var
),
2946 build_int_cst (ptr_type_node
, 0));
2950 STRIP_USELESS_TYPE_CONVERSION (use
);
2952 if (DECL_BY_REFERENCE (result
))
2954 TREE_ADDRESSABLE (var
) = 1;
2955 var
= build_fold_addr_expr (var
);
2959 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2960 way, when the RESULT_DECL is encountered, it will be
2961 automatically replaced by the VAR_DECL.
2963 When returning by reference, ensure that RESULT_DECL remaps to
2965 if (DECL_BY_REFERENCE (result
)
2966 && !is_gimple_val (var
))
2968 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
2969 insert_decl_map (id
, result
, temp
);
2970 /* When RESULT_DECL is in SSA form, we need to remap and initialize
2971 it's default_def SSA_NAME. */
2972 if (gimple_in_ssa_p (id
->src_cfun
)
2973 && is_gimple_reg (result
))
2975 temp
= make_ssa_name (temp
, NULL
);
2976 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
2978 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
2981 insert_decl_map (id
, result
, var
);
2983 /* Remember this so we can ignore it in remap_decls. */
2989 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2990 to a local label. */
2993 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
2996 tree fn
= (tree
) fnp
;
2998 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3007 /* Determine if the function can be copied. If so return NULL. If
3008 not return a string describng the reason for failure. */
3011 copy_forbidden (struct function
*fun
, tree fndecl
)
3013 const char *reason
= fun
->cannot_be_copied_reason
;
3017 /* Only examine the function once. */
3018 if (fun
->cannot_be_copied_set
)
3021 /* We cannot copy a function that receives a non-local goto
3022 because we cannot remap the destination label used in the
3023 function that is performing the non-local goto. */
3024 /* ??? Actually, this should be possible, if we work at it.
3025 No doubt there's just a handful of places that simply
3026 assume it doesn't happen and don't substitute properly. */
3027 if (fun
->has_nonlocal_label
)
3029 reason
= G_("function %q+F can never be copied "
3030 "because it receives a non-local goto");
3034 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3035 if (TREE_CODE (decl
) == VAR_DECL
3036 && TREE_STATIC (decl
)
3037 && !DECL_EXTERNAL (decl
)
3038 && DECL_INITIAL (decl
)
3039 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3040 has_label_address_in_static_1
,
3043 reason
= G_("function %q+F can never be copied because it saves "
3044 "address of local label in a static variable");
3049 fun
->cannot_be_copied_reason
= reason
;
3050 fun
->cannot_be_copied_set
= true;
3055 static const char *inline_forbidden_reason
;
3057 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3058 iff a function can not be inlined. Also sets the reason why. */
3061 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3062 struct walk_stmt_info
*wip
)
3064 tree fn
= (tree
) wip
->info
;
3066 gimple stmt
= gsi_stmt (*gsi
);
3068 switch (gimple_code (stmt
))
3071 /* Refuse to inline alloca call unless user explicitly forced so as
3072 this may change program's memory overhead drastically when the
3073 function using alloca is called in loop. In GCC present in
3074 SPEC2000 inlining into schedule_block cause it to require 2GB of
3075 RAM instead of 256MB. Don't do so for alloca calls emitted for
3076 VLA objects as those can't cause unbounded growth (they're always
3077 wrapped inside stack_save/stack_restore regions. */
3078 if (gimple_alloca_call_p (stmt
)
3079 && !gimple_call_alloca_for_var_p (stmt
)
3080 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3082 inline_forbidden_reason
3083 = G_("function %q+F can never be inlined because it uses "
3084 "alloca (override using the always_inline attribute)");
3085 *handled_ops_p
= true;
3089 t
= gimple_call_fndecl (stmt
);
3093 /* We cannot inline functions that call setjmp. */
3094 if (setjmp_call_p (t
))
3096 inline_forbidden_reason
3097 = G_("function %q+F can never be inlined because it uses setjmp");
3098 *handled_ops_p
= true;
3102 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3103 switch (DECL_FUNCTION_CODE (t
))
3105 /* We cannot inline functions that take a variable number of
3107 case BUILT_IN_VA_START
:
3108 case BUILT_IN_NEXT_ARG
:
3109 case BUILT_IN_VA_END
:
3110 inline_forbidden_reason
3111 = G_("function %q+F can never be inlined because it "
3112 "uses variable argument lists");
3113 *handled_ops_p
= true;
3116 case BUILT_IN_LONGJMP
:
3117 /* We can't inline functions that call __builtin_longjmp at
3118 all. The non-local goto machinery really requires the
3119 destination be in a different function. If we allow the
3120 function calling __builtin_longjmp to be inlined into the
3121 function calling __builtin_setjmp, Things will Go Awry. */
3122 inline_forbidden_reason
3123 = G_("function %q+F can never be inlined because "
3124 "it uses setjmp-longjmp exception handling");
3125 *handled_ops_p
= true;
3128 case BUILT_IN_NONLOCAL_GOTO
:
3130 inline_forbidden_reason
3131 = G_("function %q+F can never be inlined because "
3132 "it uses non-local goto");
3133 *handled_ops_p
= true;
3136 case BUILT_IN_RETURN
:
3137 case BUILT_IN_APPLY_ARGS
:
3138 /* If a __builtin_apply_args caller would be inlined,
3139 it would be saving arguments of the function it has
3140 been inlined into. Similarly __builtin_return would
3141 return from the function the inline has been inlined into. */
3142 inline_forbidden_reason
3143 = G_("function %q+F can never be inlined because "
3144 "it uses __builtin_return or __builtin_apply_args");
3145 *handled_ops_p
= true;
3154 t
= gimple_goto_dest (stmt
);
3156 /* We will not inline a function which uses computed goto. The
3157 addresses of its local labels, which may be tucked into
3158 global storage, are of course not constant across
3159 instantiations, which causes unexpected behavior. */
3160 if (TREE_CODE (t
) != LABEL_DECL
)
3162 inline_forbidden_reason
3163 = G_("function %q+F can never be inlined "
3164 "because it contains a computed goto");
3165 *handled_ops_p
= true;
3174 *handled_ops_p
= false;
3178 /* Return true if FNDECL is a function that cannot be inlined into
3182 inline_forbidden_p (tree fndecl
)
3184 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3185 struct walk_stmt_info wi
;
3186 struct pointer_set_t
*visited_nodes
;
3188 bool forbidden_p
= false;
3190 /* First check for shared reasons not to copy the code. */
3191 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3192 if (inline_forbidden_reason
!= NULL
)
3195 /* Next, walk the statements of the function looking for
3196 constraucts we can't handle, or are non-optimal for inlining. */
3197 visited_nodes
= pointer_set_create ();
3198 memset (&wi
, 0, sizeof (wi
));
3199 wi
.info
= (void *) fndecl
;
3200 wi
.pset
= visited_nodes
;
3202 FOR_EACH_BB_FN (bb
, fun
)
3205 gimple_seq seq
= bb_seq (bb
);
3206 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3207 forbidden_p
= (ret
!= NULL
);
3212 pointer_set_destroy (visited_nodes
);
3216 /* Return false if the function FNDECL cannot be inlined on account of its
3217 attributes, true otherwise. */
3219 function_attribute_inlinable_p (const_tree fndecl
)
3221 if (targetm
.attribute_table
)
3225 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3227 const_tree name
= TREE_PURPOSE (a
);
3230 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3231 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3232 return targetm
.function_attribute_inlinable_p (fndecl
);
3239 /* Returns nonzero if FN is a function that does not have any
3240 fundamental inline blocking properties. */
3243 tree_inlinable_function_p (tree fn
)
3245 bool inlinable
= true;
3249 /* If we've already decided this function shouldn't be inlined,
3250 there's no need to check again. */
3251 if (DECL_UNINLINABLE (fn
))
3254 /* We only warn for functions declared `inline' by the user. */
3255 do_warning
= (warn_inline
3256 && DECL_DECLARED_INLINE_P (fn
)
3257 && !DECL_NO_INLINE_WARNING_P (fn
)
3258 && !DECL_IN_SYSTEM_HEADER (fn
));
3260 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3263 && always_inline
== NULL
)
3266 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3267 "is suppressed using -fno-inline", fn
);
3271 else if (!function_attribute_inlinable_p (fn
))
3274 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3275 "uses attributes conflicting with inlining", fn
);
3279 else if (inline_forbidden_p (fn
))
3281 /* See if we should warn about uninlinable functions. Previously,
3282 some of these warnings would be issued while trying to expand
3283 the function inline, but that would cause multiple warnings
3284 about functions that would for example call alloca. But since
3285 this a property of the function, just one warning is enough.
3286 As a bonus we can now give more details about the reason why a
3287 function is not inlinable. */
3289 error (inline_forbidden_reason
, fn
);
3290 else if (do_warning
)
3291 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3296 /* Squirrel away the result so that we don't have to check again. */
3297 DECL_UNINLINABLE (fn
) = !inlinable
;
3302 /* Estimate the cost of a memory move. Use machine dependent
3303 word size and take possible memcpy call into account. */
3306 estimate_move_cost (tree type
)
3310 gcc_assert (!VOID_TYPE_P (type
));
3312 if (TREE_CODE (type
) == VECTOR_TYPE
)
3314 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3315 enum machine_mode simd
3316 = targetm
.vectorize
.preferred_simd_mode (inner
);
3317 int simd_mode_size
= GET_MODE_SIZE (simd
);
3318 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3322 size
= int_size_in_bytes (type
);
3324 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3325 /* Cost of a memcpy call, 3 arguments and the call. */
3328 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3331 /* Returns cost of operation CODE, according to WEIGHTS */
3334 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3335 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3339 /* These are "free" conversions, or their presumed cost
3340 is folded into other operations. */
3345 case VIEW_CONVERT_EXPR
:
3348 /* Assign cost of 1 to usual operations.
3349 ??? We may consider mapping RTL costs to this. */
3355 case POINTER_PLUS_EXPR
:
3358 case MULT_HIGHPART_EXPR
:
3361 case ADDR_SPACE_CONVERT_EXPR
:
3362 case FIXED_CONVERT_EXPR
:
3363 case FIX_TRUNC_EXPR
:
3375 case VEC_LSHIFT_EXPR
:
3376 case VEC_RSHIFT_EXPR
:
3383 case TRUTH_ANDIF_EXPR
:
3384 case TRUTH_ORIF_EXPR
:
3385 case TRUTH_AND_EXPR
:
3387 case TRUTH_XOR_EXPR
:
3388 case TRUTH_NOT_EXPR
:
3397 case UNORDERED_EXPR
:
3408 case PREDECREMENT_EXPR
:
3409 case PREINCREMENT_EXPR
:
3410 case POSTDECREMENT_EXPR
:
3411 case POSTINCREMENT_EXPR
:
3413 case REALIGN_LOAD_EXPR
:
3415 case REDUC_MAX_EXPR
:
3416 case REDUC_MIN_EXPR
:
3417 case REDUC_PLUS_EXPR
:
3418 case WIDEN_SUM_EXPR
:
3419 case WIDEN_MULT_EXPR
:
3421 case WIDEN_MULT_PLUS_EXPR
:
3422 case WIDEN_MULT_MINUS_EXPR
:
3423 case WIDEN_LSHIFT_EXPR
:
3425 case VEC_WIDEN_MULT_HI_EXPR
:
3426 case VEC_WIDEN_MULT_LO_EXPR
:
3427 case VEC_WIDEN_MULT_EVEN_EXPR
:
3428 case VEC_WIDEN_MULT_ODD_EXPR
:
3429 case VEC_UNPACK_HI_EXPR
:
3430 case VEC_UNPACK_LO_EXPR
:
3431 case VEC_UNPACK_FLOAT_HI_EXPR
:
3432 case VEC_UNPACK_FLOAT_LO_EXPR
:
3433 case VEC_PACK_TRUNC_EXPR
:
3434 case VEC_PACK_SAT_EXPR
:
3435 case VEC_PACK_FIX_TRUNC_EXPR
:
3436 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3437 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3441 /* Few special cases of expensive operations. This is useful
3442 to avoid inlining on functions having too many of these. */
3443 case TRUNC_DIV_EXPR
:
3445 case FLOOR_DIV_EXPR
:
3446 case ROUND_DIV_EXPR
:
3447 case EXACT_DIV_EXPR
:
3448 case TRUNC_MOD_EXPR
:
3450 case FLOOR_MOD_EXPR
:
3451 case ROUND_MOD_EXPR
:
3453 if (TREE_CODE (op2
) != INTEGER_CST
)
3454 return weights
->div_mod_cost
;
3458 /* We expect a copy assignment with no operator. */
3459 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3465 /* Estimate number of instructions that will be created by expanding
3466 the statements in the statement sequence STMTS.
3467 WEIGHTS contains weights attributed to various constructs. */
3470 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3473 gimple_stmt_iterator gsi
;
3476 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3477 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3483 /* Estimate number of instructions that will be created by expanding STMT.
3484 WEIGHTS contains weights attributed to various constructs. */
3487 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3490 enum gimple_code code
= gimple_code (stmt
);
3497 /* Try to estimate the cost of assignments. We have three cases to
3499 1) Simple assignments to registers;
3500 2) Stores to things that must live in memory. This includes
3501 "normal" stores to scalars, but also assignments of large
3502 structures, or constructors of big arrays;
3504 Let us look at the first two cases, assuming we have "a = b + C":
3505 <GIMPLE_ASSIGN <var_decl "a">
3506 <plus_expr <var_decl "b"> <constant C>>
3507 If "a" is a GIMPLE register, the assignment to it is free on almost
3508 any target, because "a" usually ends up in a real register. Hence
3509 the only cost of this expression comes from the PLUS_EXPR, and we
3510 can ignore the GIMPLE_ASSIGN.
3511 If "a" is not a GIMPLE register, the assignment to "a" will most
3512 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3513 of moving something into "a", which we compute using the function
3514 estimate_move_cost. */
3515 if (gimple_clobber_p (stmt
))
3516 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3518 lhs
= gimple_assign_lhs (stmt
);
3519 rhs
= gimple_assign_rhs1 (stmt
);
3523 /* Account for the cost of moving to / from memory. */
3524 if (gimple_store_p (stmt
))
3525 cost
+= estimate_move_cost (TREE_TYPE (lhs
));
3526 if (gimple_assign_load_p (stmt
))
3527 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3529 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3530 gimple_assign_rhs1 (stmt
),
3531 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3532 == GIMPLE_BINARY_RHS
3533 ? gimple_assign_rhs2 (stmt
) : NULL
);
3537 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3538 gimple_op (stmt
, 0),
3539 gimple_op (stmt
, 1));
3543 /* Take into account cost of the switch + guess 2 conditional jumps for
3546 TODO: once the switch expansion logic is sufficiently separated, we can
3547 do better job on estimating cost of the switch. */
3548 if (weights
->time_based
)
3549 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3551 cost
= gimple_switch_num_labels (stmt
) * 2;
3556 tree decl
= gimple_call_fndecl (stmt
);
3557 struct cgraph_node
*node
= NULL
;
3559 /* Do not special case builtins where we see the body.
3560 This just confuse inliner. */
3561 if (!decl
|| !(node
= cgraph_get_node (decl
)) || node
->analyzed
)
3563 /* For buitins that are likely expanded to nothing or
3564 inlined do not account operand costs. */
3565 else if (is_simple_builtin (decl
))
3567 else if (is_inexpensive_builtin (decl
))
3568 return weights
->target_builtin_call_cost
;
3569 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3571 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3572 specialize the cheap expansion we do here.
3573 ??? This asks for a more general solution. */
3574 switch (DECL_FUNCTION_CODE (decl
))
3579 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3580 && REAL_VALUES_EQUAL
3581 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3582 return estimate_operator_cost (MULT_EXPR
, weights
,
3583 gimple_call_arg (stmt
, 0),
3584 gimple_call_arg (stmt
, 0));
3592 cost
= node
? weights
->call_cost
: weights
->indirect_call_cost
;
3593 if (gimple_call_lhs (stmt
))
3594 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3595 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3597 tree arg
= gimple_call_arg (stmt
, i
);
3598 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3604 return weights
->return_cost
;
3610 case GIMPLE_PREDICT
:
3615 return asm_str_count (gimple_asm_string (stmt
));
3618 /* This is either going to be an external function call with one
3619 argument, or two register copy statements plus a goto. */
3622 case GIMPLE_EH_DISPATCH
:
3623 /* ??? This is going to turn into a switch statement. Ideally
3624 we'd have a look at the eh region and estimate the number of
3629 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3631 case GIMPLE_EH_FILTER
:
3632 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3635 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3638 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3639 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3641 /* OpenMP directives are generally very expensive. */
3643 case GIMPLE_OMP_RETURN
:
3644 case GIMPLE_OMP_SECTIONS_SWITCH
:
3645 case GIMPLE_OMP_ATOMIC_STORE
:
3646 case GIMPLE_OMP_CONTINUE
:
3647 /* ...except these, which are cheap. */
3650 case GIMPLE_OMP_ATOMIC_LOAD
:
3651 return weights
->omp_cost
;
3653 case GIMPLE_OMP_FOR
:
3654 return (weights
->omp_cost
3655 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3656 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3658 case GIMPLE_OMP_PARALLEL
:
3659 case GIMPLE_OMP_TASK
:
3660 case GIMPLE_OMP_CRITICAL
:
3661 case GIMPLE_OMP_MASTER
:
3662 case GIMPLE_OMP_ORDERED
:
3663 case GIMPLE_OMP_SECTION
:
3664 case GIMPLE_OMP_SECTIONS
:
3665 case GIMPLE_OMP_SINGLE
:
3666 return (weights
->omp_cost
3667 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3669 case GIMPLE_TRANSACTION
:
3670 return (weights
->tm_cost
3671 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3681 /* Estimate number of instructions that will be created by expanding
3682 function FNDECL. WEIGHTS contains weights attributed to various
3686 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3688 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3689 gimple_stmt_iterator bsi
;
3693 gcc_assert (my_function
&& my_function
->cfg
);
3694 FOR_EACH_BB_FN (bb
, my_function
)
3696 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3697 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3704 /* Initializes weights used by estimate_num_insns. */
3707 init_inline_once (void)
3709 eni_size_weights
.call_cost
= 1;
3710 eni_size_weights
.indirect_call_cost
= 3;
3711 eni_size_weights
.target_builtin_call_cost
= 1;
3712 eni_size_weights
.div_mod_cost
= 1;
3713 eni_size_weights
.omp_cost
= 40;
3714 eni_size_weights
.tm_cost
= 10;
3715 eni_size_weights
.time_based
= false;
3716 eni_size_weights
.return_cost
= 1;
3718 /* Estimating time for call is difficult, since we have no idea what the
3719 called function does. In the current uses of eni_time_weights,
3720 underestimating the cost does less harm than overestimating it, so
3721 we choose a rather small value here. */
3722 eni_time_weights
.call_cost
= 10;
3723 eni_time_weights
.indirect_call_cost
= 15;
3724 eni_time_weights
.target_builtin_call_cost
= 1;
3725 eni_time_weights
.div_mod_cost
= 10;
3726 eni_time_weights
.omp_cost
= 40;
3727 eni_time_weights
.tm_cost
= 40;
3728 eni_time_weights
.time_based
= true;
3729 eni_time_weights
.return_cost
= 2;
3732 /* Estimate the number of instructions in a gimple_seq. */
3735 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3737 gimple_stmt_iterator gsi
;
3739 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3740 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3746 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3749 prepend_lexical_block (tree current_block
, tree new_block
)
3751 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
3752 BLOCK_SUBBLOCKS (current_block
) = new_block
;
3753 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
3756 /* Add local variables from CALLEE to CALLER. */
3759 add_local_variables (struct function
*callee
, struct function
*caller
,
3765 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
3766 if (!can_be_nonlocal (var
, id
))
3768 tree new_var
= remap_decl (var
, id
);
3770 /* Remap debug-expressions. */
3771 if (TREE_CODE (new_var
) == VAR_DECL
3772 && DECL_HAS_DEBUG_EXPR_P (var
)
3775 tree tem
= DECL_DEBUG_EXPR (var
);
3776 bool old_regimplify
= id
->regimplify
;
3777 id
->remapping_type_depth
++;
3778 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
3779 id
->remapping_type_depth
--;
3780 id
->regimplify
= old_regimplify
;
3781 SET_DECL_DEBUG_EXPR (new_var
, tem
);
3782 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
3784 add_local_decl (caller
, new_var
);
3788 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3791 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
3795 struct pointer_map_t
*st
, *dst
;
3798 location_t saved_location
;
3799 struct cgraph_edge
*cg_edge
;
3800 cgraph_inline_failed_t reason
;
3801 basic_block return_block
;
3803 gimple_stmt_iterator gsi
, stmt_gsi
;
3804 bool successfully_inlined
= FALSE
;
3805 bool purge_dead_abnormal_edges
;
3807 /* Set input_location here so we get the right instantiation context
3808 if we call instantiate_decl from inlinable_function_p. */
3809 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
3810 saved_location
= input_location
;
3811 input_location
= gimple_location (stmt
);
3813 /* From here on, we're only interested in CALL_EXPRs. */
3814 if (gimple_code (stmt
) != GIMPLE_CALL
)
3817 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
3818 gcc_checking_assert (cg_edge
);
3819 /* First, see if we can figure out what function is being called.
3820 If we cannot, then there is no hope of inlining the function. */
3821 if (cg_edge
->indirect_unknown_callee
)
3823 fn
= cg_edge
->callee
->symbol
.decl
;
3824 gcc_checking_assert (fn
);
3826 /* If FN is a declaration of a function in a nested scope that was
3827 globally declared inline, we don't set its DECL_INITIAL.
3828 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3829 C++ front-end uses it for cdtors to refer to their internal
3830 declarations, that are not real functions. Fortunately those
3831 don't have trees to be saved, so we can tell by checking their
3833 if (!DECL_INITIAL (fn
)
3834 && DECL_ABSTRACT_ORIGIN (fn
)
3835 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
3836 fn
= DECL_ABSTRACT_ORIGIN (fn
);
3838 /* Don't try to inline functions that are not well-suited to inlining. */
3839 if (cg_edge
->inline_failed
)
3841 reason
= cg_edge
->inline_failed
;
3842 /* If this call was originally indirect, we do not want to emit any
3843 inlining related warnings or sorry messages because there are no
3844 guarantees regarding those. */
3845 if (cg_edge
->indirect_inlining_edge
)
3848 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
3849 /* For extern inline functions that get redefined we always
3850 silently ignored always_inline flag. Better behaviour would
3851 be to be able to keep both bodies and use extern inline body
3852 for inlining, but we can't do that because frontends overwrite
3854 && !cg_edge
->callee
->local
.redefined_extern_inline
3855 /* Avoid warnings during early inline pass. */
3856 && cgraph_global_info_ready
3857 /* PR 20090218-1_0.c. Body can be provided by another module. */
3858 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
3860 error ("inlining failed in call to always_inline %q+F: %s", fn
,
3861 cgraph_inline_failed_string (reason
));
3862 error ("called from here");
3864 else if (warn_inline
3865 && DECL_DECLARED_INLINE_P (fn
)
3866 && !DECL_NO_INLINE_WARNING_P (fn
)
3867 && !DECL_IN_SYSTEM_HEADER (fn
)
3868 && reason
!= CIF_UNSPECIFIED
3869 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
3870 /* Do not warn about not inlined recursive calls. */
3871 && !cgraph_edge_recursive_p (cg_edge
)
3872 /* Avoid warnings during early inline pass. */
3873 && cgraph_global_info_ready
)
3875 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
3876 fn
, _(cgraph_inline_failed_string (reason
)));
3877 warning (OPT_Winline
, "called from here");
3881 fn
= cg_edge
->callee
->symbol
.decl
;
3883 #ifdef ENABLE_CHECKING
3884 if (cg_edge
->callee
->symbol
.decl
!= id
->dst_node
->symbol
.decl
)
3885 verify_cgraph_node (cg_edge
->callee
);
3888 /* We will be inlining this callee. */
3889 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
3891 /* Update the callers EH personality. */
3892 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
))
3893 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->symbol
.decl
)
3894 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
);
3896 /* Split the block holding the GIMPLE_CALL. */
3897 e
= split_block (bb
, stmt
);
3899 return_block
= e
->dest
;
3902 /* split_block splits after the statement; work around this by
3903 moving the call into the second block manually. Not pretty,
3904 but seems easier than doing the CFG manipulation by hand
3905 when the GIMPLE_CALL is in the last statement of BB. */
3906 stmt_gsi
= gsi_last_bb (bb
);
3907 gsi_remove (&stmt_gsi
, false);
3909 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3910 been the source of abnormal edges. In this case, schedule
3911 the removal of dead abnormal edges. */
3912 gsi
= gsi_start_bb (return_block
);
3913 if (gsi_end_p (gsi
))
3915 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
3916 purge_dead_abnormal_edges
= true;
3920 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
3921 purge_dead_abnormal_edges
= false;
3924 stmt_gsi
= gsi_start_bb (return_block
);
3926 /* Build a block containing code to initialize the arguments, the
3927 actual inline expansion of the body, and a label for the return
3928 statements within the function to jump to. The type of the
3929 statement expression is the return type of the function call.
3930 ??? If the call does not have an associated block then we will
3931 remap all callee blocks to NULL, effectively dropping most of
3932 its debug information. This should only happen for calls to
3933 artificial decls inserted by the compiler itself. We need to
3934 either link the inlined blocks into the caller block tree or
3935 not refer to them in any way to not break GC for locations. */
3936 if (gimple_block (stmt
))
3938 id
->block
= make_node (BLOCK
);
3939 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
3940 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
3941 prepend_lexical_block (gimple_block (stmt
), id
->block
);
3944 /* Local declarations will be replaced by their equivalents in this
3947 id
->decl_map
= pointer_map_create ();
3948 dst
= id
->debug_map
;
3949 id
->debug_map
= NULL
;
3951 /* Record the function we are about to inline. */
3953 id
->src_node
= cg_edge
->callee
;
3954 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
3955 id
->gimple_call
= stmt
;
3957 gcc_assert (!id
->src_cfun
->after_inlining
);
3960 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
3962 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3963 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
3967 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
3969 if (DECL_INITIAL (fn
))
3971 if (gimple_block (stmt
))
3975 prepend_lexical_block (id
->block
,
3976 remap_blocks (DECL_INITIAL (fn
), id
));
3977 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
3978 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
3980 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
3981 otherwise for DWARF DW_TAG_formal_parameter will not be children of
3982 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
3983 under it. The parameters can be then evaluated in the debugger,
3984 but don't show in backtraces. */
3985 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
3986 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
3989 *var
= TREE_CHAIN (v
);
3990 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
3991 BLOCK_VARS (id
->block
) = v
;
3994 var
= &TREE_CHAIN (*var
);
3997 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4000 /* Return statements in the function body will be replaced by jumps
4001 to the RET_LABEL. */
4002 gcc_assert (DECL_INITIAL (fn
));
4003 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4005 /* Find the LHS to which the result of this call is assigned. */
4007 if (gimple_call_lhs (stmt
))
4009 modify_dest
= gimple_call_lhs (stmt
);
4011 /* The function which we are inlining might not return a value,
4012 in which case we should issue a warning that the function
4013 does not return a value. In that case the optimizers will
4014 see that the variable to which the value is assigned was not
4015 initialized. We do not want to issue a warning about that
4016 uninitialized variable. */
4017 if (DECL_P (modify_dest
))
4018 TREE_NO_WARNING (modify_dest
) = 1;
4020 if (gimple_call_return_slot_opt_p (stmt
))
4022 return_slot
= modify_dest
;
4029 /* If we are inlining a call to the C++ operator new, we don't want
4030 to use type based alias analysis on the return value. Otherwise
4031 we may get confused if the compiler sees that the inlined new
4032 function returns a pointer which was just deleted. See bug
4034 if (DECL_IS_OPERATOR_NEW (fn
))
4040 /* Declare the return variable for the function. */
4041 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4043 /* Add local vars in this inlined callee to caller. */
4044 add_local_variables (id
->src_cfun
, cfun
, id
);
4046 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4048 fprintf (dump_file
, "Inlining ");
4049 print_generic_expr (dump_file
, id
->src_fn
, 0);
4050 fprintf (dump_file
, " to ");
4051 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4052 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4055 /* This is it. Duplicate the callee body. Assume callee is
4056 pre-gimplified. Note that we must not alter the caller
4057 function in any way before this point, as this CALL_EXPR may be
4058 a self-referential call; if we're calling ourselves, we need to
4059 duplicate our body before altering anything. */
4060 copy_body (id
, bb
->count
,
4061 /* Update to use GCOV_COMPUTE_SCALE. */
4062 cg_edge
->frequency
* REG_BR_PROB_BASE
/ CGRAPH_FREQ_BASE
,
4063 bb
, return_block
, NULL
, NULL
);
4065 /* Reset the escaped solution. */
4066 if (cfun
->gimple_df
)
4067 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4072 pointer_map_destroy (id
->debug_map
);
4073 id
->debug_map
= dst
;
4075 pointer_map_destroy (id
->decl_map
);
4078 /* Unlink the calls virtual operands before replacing it. */
4079 unlink_stmt_vdef (stmt
);
4081 /* If the inlined function returns a result that we care about,
4082 substitute the GIMPLE_CALL with an assignment of the return
4083 variable to the LHS of the call. That is, if STMT was
4084 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4085 if (use_retvar
&& gimple_call_lhs (stmt
))
4087 gimple old_stmt
= stmt
;
4088 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4089 gsi_replace (&stmt_gsi
, stmt
, false);
4090 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4094 /* Handle the case of inlining a function with no return
4095 statement, which causes the return value to become undefined. */
4096 if (gimple_call_lhs (stmt
)
4097 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4099 tree name
= gimple_call_lhs (stmt
);
4100 tree var
= SSA_NAME_VAR (name
);
4101 tree def
= ssa_default_def (cfun
, var
);
4105 /* If the variable is used undefined, make this name
4106 undefined via a move. */
4107 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4108 gsi_replace (&stmt_gsi
, stmt
, true);
4112 /* Otherwise make this variable undefined. */
4113 gsi_remove (&stmt_gsi
, true);
4114 set_ssa_default_def (cfun
, var
, name
);
4115 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4119 gsi_remove (&stmt_gsi
, true);
4122 if (purge_dead_abnormal_edges
)
4124 gimple_purge_dead_eh_edges (return_block
);
4125 gimple_purge_dead_abnormal_call_edges (return_block
);
4128 /* If the value of the new expression is ignored, that's OK. We
4129 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4130 the equivalent inlined version either. */
4131 if (is_gimple_assign (stmt
))
4133 gcc_assert (gimple_assign_single_p (stmt
)
4134 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4135 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4138 /* Output the inlining info for this abstract function, since it has been
4139 inlined. If we don't do this now, we can lose the information about the
4140 variables in the function when the blocks get blown away as soon as we
4141 remove the cgraph node. */
4142 if (gimple_block (stmt
))
4143 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->symbol
.decl
);
4145 /* Update callgraph if needed. */
4146 cgraph_remove_node (cg_edge
->callee
);
4148 id
->block
= NULL_TREE
;
4149 successfully_inlined
= TRUE
;
4152 input_location
= saved_location
;
4153 return successfully_inlined
;
4156 /* Expand call statements reachable from STMT_P.
4157 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4158 in a MODIFY_EXPR. */
4161 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4163 gimple_stmt_iterator gsi
;
4165 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4167 gimple stmt
= gsi_stmt (gsi
);
4169 if (is_gimple_call (stmt
)
4170 && expand_call_inline (bb
, stmt
, id
))
4178 /* Walk all basic blocks created after FIRST and try to fold every statement
4179 in the STATEMENTS pointer set. */
4182 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4184 for (; first
< n_basic_blocks
; first
++)
4185 if (BASIC_BLOCK (first
))
4187 gimple_stmt_iterator gsi
;
4189 for (gsi
= gsi_start_bb (BASIC_BLOCK (first
));
4192 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4194 gimple old_stmt
= gsi_stmt (gsi
);
4195 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4197 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4199 /* Folding builtins can create multiple instructions,
4200 we need to look at all of them. */
4201 gimple_stmt_iterator i2
= gsi
;
4203 if (fold_stmt (&gsi
))
4206 /* If a builtin at the end of a bb folded into nothing,
4207 the following loop won't work. */
4208 if (gsi_end_p (gsi
))
4210 cgraph_update_edges_for_call_stmt (old_stmt
,
4215 i2
= gsi_start_bb (BASIC_BLOCK (first
));
4220 new_stmt
= gsi_stmt (i2
);
4221 update_stmt (new_stmt
);
4222 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4225 if (new_stmt
== gsi_stmt (gsi
))
4227 /* It is okay to check only for the very last
4228 of these statements. If it is a throwing
4229 statement nothing will change. If it isn't
4230 this can remove EH edges. If that weren't
4231 correct then because some intermediate stmts
4232 throw, but not the last one. That would mean
4233 we'd have to split the block, which we can't
4234 here and we'd loose anyway. And as builtins
4235 probably never throw, this all
4237 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4239 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4246 else if (fold_stmt (&gsi
))
4248 /* Re-read the statement from GSI as fold_stmt() may
4250 gimple new_stmt
= gsi_stmt (gsi
);
4251 update_stmt (new_stmt
);
4253 if (is_gimple_call (old_stmt
)
4254 || is_gimple_call (new_stmt
))
4255 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4258 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4259 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4265 /* Return true if BB has at least one abnormal outgoing edge. */
4268 has_abnormal_outgoing_edge_p (basic_block bb
)
4273 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4274 if (e
->flags
& EDGE_ABNORMAL
)
4280 /* Expand calls to inline functions in the body of FN. */
4283 optimize_inline_calls (tree fn
)
4287 int last
= n_basic_blocks
;
4288 struct gimplify_ctx gctx
;
4289 bool inlined_p
= false;
4292 memset (&id
, 0, sizeof (id
));
4294 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4295 gcc_assert (id
.dst_node
->analyzed
);
4297 /* Or any functions that aren't finished yet. */
4298 if (current_function_decl
)
4299 id
.dst_fn
= current_function_decl
;
4301 id
.copy_decl
= copy_decl_maybe_to_var
;
4302 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4303 id
.transform_new_cfg
= false;
4304 id
.transform_return_to_modify
= true;
4305 id
.transform_lang_insert_block
= NULL
;
4306 id
.statements_to_fold
= pointer_set_create ();
4308 push_gimplify_context (&gctx
);
4310 /* We make no attempts to keep dominance info up-to-date. */
4311 free_dominance_info (CDI_DOMINATORS
);
4312 free_dominance_info (CDI_POST_DOMINATORS
);
4314 /* Register specific gimple functions. */
4315 gimple_register_cfg_hooks ();
4317 /* Reach the trees by walking over the CFG, and note the
4318 enclosing basic-blocks in the call edges. */
4319 /* We walk the blocks going forward, because inlined function bodies
4320 will split id->current_basic_block, and the new blocks will
4321 follow it; we'll trudge through them, processing their CALL_EXPRs
4324 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4326 pop_gimplify_context (NULL
);
4328 #ifdef ENABLE_CHECKING
4330 struct cgraph_edge
*e
;
4332 verify_cgraph_node (id
.dst_node
);
4334 /* Double check that we inlined everything we are supposed to inline. */
4335 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4336 gcc_assert (e
->inline_failed
);
4340 /* Fold queued statements. */
4341 fold_marked_statements (last
, id
.statements_to_fold
);
4342 pointer_set_destroy (id
.statements_to_fold
);
4344 gcc_assert (!id
.debug_stmts
.exists ());
4346 /* If we didn't inline into the function there is nothing to do. */
4350 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4353 delete_unreachable_blocks_update_callgraph (&id
);
4354 #ifdef ENABLE_CHECKING
4355 verify_cgraph_node (id
.dst_node
);
4358 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4359 not possible yet - the IPA passes might make various functions to not
4360 throw and they don't care to proactively update local EH info. This is
4361 done later in fixup_cfg pass that also execute the verification. */
4362 return (TODO_update_ssa
4364 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4365 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4366 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
4369 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4372 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4374 enum tree_code code
= TREE_CODE (*tp
);
4375 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4377 /* We make copies of most nodes. */
4378 if (IS_EXPR_CODE_CLASS (cl
)
4379 || code
== TREE_LIST
4381 || code
== TYPE_DECL
4382 || code
== OMP_CLAUSE
)
4384 /* Because the chain gets clobbered when we make a copy, we save it
4386 tree chain
= NULL_TREE
, new_tree
;
4388 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4389 chain
= TREE_CHAIN (*tp
);
4391 /* Copy the node. */
4392 new_tree
= copy_node (*tp
);
4394 /* Propagate mudflap marked-ness. */
4395 if (flag_mudflap
&& mf_marked_p (*tp
))
4400 /* Now, restore the chain, if appropriate. That will cause
4401 walk_tree to walk into the chain as well. */
4402 if (code
== PARM_DECL
4403 || code
== TREE_LIST
4404 || code
== OMP_CLAUSE
)
4405 TREE_CHAIN (*tp
) = chain
;
4407 /* For now, we don't update BLOCKs when we make copies. So, we
4408 have to nullify all BIND_EXPRs. */
4409 if (TREE_CODE (*tp
) == BIND_EXPR
)
4410 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4412 else if (code
== CONSTRUCTOR
)
4414 /* CONSTRUCTOR nodes need special handling because
4415 we need to duplicate the vector of elements. */
4418 new_tree
= copy_node (*tp
);
4420 /* Propagate mudflap marked-ness. */
4421 if (flag_mudflap
&& mf_marked_p (*tp
))
4424 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
4427 else if (code
== STATEMENT_LIST
)
4428 /* We used to just abort on STATEMENT_LIST, but we can run into them
4429 with statement-expressions (c++/40975). */
4430 copy_statement_list (tp
);
4431 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4433 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4435 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4440 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4441 information indicating to what new SAVE_EXPR this one should be mapped,
4442 use that one. Otherwise, create a new node and enter it in ST. FN is
4443 the function into which the copy will be placed. */
4446 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4448 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4452 /* See if we already encountered this SAVE_EXPR. */
4453 n
= (tree
*) pointer_map_contains (st
, *tp
);
4455 /* If we didn't already remap this SAVE_EXPR, do so now. */
4458 t
= copy_node (*tp
);
4460 /* Remember this SAVE_EXPR. */
4461 *pointer_map_insert (st
, *tp
) = t
;
4462 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4463 *pointer_map_insert (st
, t
) = t
;
4467 /* We've already walked into this SAVE_EXPR; don't do it again. */
4472 /* Replace this SAVE_EXPR with the copy. */
4476 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4477 copies the declaration and enters it in the splay_tree in DATA (which is
4478 really an `copy_body_data *'). */
4481 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
4484 copy_body_data
*id
= (copy_body_data
*) data
;
4486 /* Don't walk into types. */
4490 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
4492 tree decl
= TREE_OPERAND (*tp
, 0);
4494 /* Copy the decl and remember the copy. */
4495 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4501 /* Perform any modifications to EXPR required when it is unsaved. Does
4502 not recurse into EXPR's subtrees. */
4505 unsave_expr_1 (tree expr
)
4507 switch (TREE_CODE (expr
))
4510 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4511 It's OK for this to happen if it was part of a subtree that
4512 isn't immediately expanded, such as operand 2 of another
4514 if (TREE_OPERAND (expr
, 1))
4517 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4518 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4526 /* Called via walk_tree when an expression is unsaved. Using the
4527 splay_tree pointed to by ST (which is really a `splay_tree'),
4528 remaps all local declarations to appropriate replacements. */
4531 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
4533 copy_body_data
*id
= (copy_body_data
*) data
;
4534 struct pointer_map_t
*st
= id
->decl_map
;
4537 /* Only a local declaration (variable or label). */
4538 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
4539 || TREE_CODE (*tp
) == LABEL_DECL
)
4541 /* Lookup the declaration. */
4542 n
= (tree
*) pointer_map_contains (st
, *tp
);
4544 /* If it's there, remap it. */
4549 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
4551 else if (TREE_CODE (*tp
) == BIND_EXPR
)
4552 copy_bind_expr (tp
, walk_subtrees
, id
);
4553 else if (TREE_CODE (*tp
) == SAVE_EXPR
4554 || TREE_CODE (*tp
) == TARGET_EXPR
)
4555 remap_save_expr (tp
, st
, walk_subtrees
);
4558 copy_tree_r (tp
, walk_subtrees
, NULL
);
4560 /* Do whatever unsaving is required. */
4561 unsave_expr_1 (*tp
);
4564 /* Keep iterating. */
4568 /* Copies everything in EXPR and replaces variables, labels
4569 and SAVE_EXPRs local to EXPR. */
4572 unsave_expr_now (tree expr
)
4576 /* There's nothing to do for NULL_TREE. */
4581 memset (&id
, 0, sizeof (id
));
4582 id
.src_fn
= current_function_decl
;
4583 id
.dst_fn
= current_function_decl
;
4584 id
.decl_map
= pointer_map_create ();
4585 id
.debug_map
= NULL
;
4587 id
.copy_decl
= copy_decl_no_change
;
4588 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4589 id
.transform_new_cfg
= false;
4590 id
.transform_return_to_modify
= false;
4591 id
.transform_lang_insert_block
= NULL
;
4593 /* Walk the tree once to find local labels. */
4594 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
4596 /* Walk the tree again, copying, remapping, and unsaving. */
4597 walk_tree (&expr
, unsave_r
, &id
, NULL
);
4600 pointer_map_destroy (id
.decl_map
);
4602 pointer_map_destroy (id
.debug_map
);
4607 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4608 label, copies the declaration and enters it in the splay_tree in DATA (which
4609 is really a 'copy_body_data *'. */
4612 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4613 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4614 struct walk_stmt_info
*wi
)
4616 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4617 gimple stmt
= gsi_stmt (*gsip
);
4619 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4621 tree decl
= gimple_label_label (stmt
);
4623 /* Copy the decl and remember the copy. */
4624 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4631 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4632 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4633 remaps all local declarations to appropriate replacements in gimple
4637 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4639 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4640 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4641 struct pointer_map_t
*st
= id
->decl_map
;
4645 /* Only a local declaration (variable or label). */
4646 if ((TREE_CODE (expr
) == VAR_DECL
4647 && !TREE_STATIC (expr
))
4648 || TREE_CODE (expr
) == LABEL_DECL
)
4650 /* Lookup the declaration. */
4651 n
= (tree
*) pointer_map_contains (st
, expr
);
4653 /* If it's there, remap it. */
4658 else if (TREE_CODE (expr
) == STATEMENT_LIST
4659 || TREE_CODE (expr
) == BIND_EXPR
4660 || TREE_CODE (expr
) == SAVE_EXPR
)
4662 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4664 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4665 It's OK for this to happen if it was part of a subtree that
4666 isn't immediately expanded, such as operand 2 of another
4668 if (!TREE_OPERAND (expr
, 1))
4670 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4671 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4675 /* Keep iterating. */
4680 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4681 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4682 remaps all local declarations to appropriate replacements in gimple
4686 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4687 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4688 struct walk_stmt_info
*wi
)
4690 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4691 gimple stmt
= gsi_stmt (*gsip
);
4693 if (gimple_code (stmt
) == GIMPLE_BIND
)
4695 tree block
= gimple_bind_block (stmt
);
4699 remap_block (&block
, id
);
4700 gimple_bind_set_block (stmt
, block
);
4703 /* This will remap a lot of the same decls again, but this should be
4705 if (gimple_bind_vars (stmt
))
4706 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
4710 /* Keep iterating. */
4715 /* Copies everything in SEQ and replaces variables and labels local to
4716 current_function_decl. */
4719 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4722 struct walk_stmt_info wi
;
4723 struct pointer_set_t
*visited
;
4726 /* There's nothing to do for NULL_TREE. */
4731 memset (&id
, 0, sizeof (id
));
4732 id
.src_fn
= current_function_decl
;
4733 id
.dst_fn
= current_function_decl
;
4734 id
.decl_map
= pointer_map_create ();
4735 id
.debug_map
= NULL
;
4737 id
.copy_decl
= copy_decl_no_change
;
4738 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4739 id
.transform_new_cfg
= false;
4740 id
.transform_return_to_modify
= false;
4741 id
.transform_lang_insert_block
= NULL
;
4743 /* Walk the tree once to find local labels. */
4744 memset (&wi
, 0, sizeof (wi
));
4745 visited
= pointer_set_create ();
4748 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4749 pointer_set_destroy (visited
);
4751 copy
= gimple_seq_copy (seq
);
4753 /* Walk the copy, remapping decls. */
4754 memset (&wi
, 0, sizeof (wi
));
4756 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4759 pointer_map_destroy (id
.decl_map
);
4761 pointer_map_destroy (id
.debug_map
);
4767 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4770 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4779 debug_find_tree (tree top
, tree search
)
4781 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4785 /* Declare the variables created by the inliner. Add all the variables in
4786 VARS to BIND_EXPR. */
4789 declare_inline_vars (tree block
, tree vars
)
4792 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4794 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4795 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4796 add_local_decl (cfun
, t
);
4800 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4803 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4804 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4805 VAR_DECL translation. */
4808 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4810 /* Don't generate debug information for the copy if we wouldn't have
4811 generated it for the copy either. */
4812 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4813 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4815 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4816 declaration inspired this copy. */
4817 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4819 /* The new variable/label has no RTL, yet. */
4820 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4821 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4822 SET_DECL_RTL (copy
, 0);
4824 /* These args would always appear unused, if not for this. */
4825 TREE_USED (copy
) = 1;
4827 /* Set the context for the new declaration. */
4828 if (!DECL_CONTEXT (decl
))
4829 /* Globals stay global. */
4831 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4832 /* Things that weren't in the scope of the function we're inlining
4833 from aren't in the scope we're inlining to, either. */
4835 else if (TREE_STATIC (decl
))
4836 /* Function-scoped static variables should stay in the original
4840 /* Ordinary automatic local variables are now in the scope of the
4842 DECL_CONTEXT (copy
) = id
->dst_fn
;
4848 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4852 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4853 || TREE_CODE (decl
) == RESULT_DECL
);
4855 type
= TREE_TYPE (decl
);
4857 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4858 VAR_DECL
, DECL_NAME (decl
), type
);
4859 if (DECL_PT_UID_SET_P (decl
))
4860 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4861 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4862 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4863 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4864 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4866 return copy_decl_for_dup_finish (id
, decl
, copy
);
4869 /* Like copy_decl_to_var, but create a return slot object instead of a
4870 pointer variable for return by invisible reference. */
4873 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4877 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4878 || TREE_CODE (decl
) == RESULT_DECL
);
4880 type
= TREE_TYPE (decl
);
4881 if (DECL_BY_REFERENCE (decl
))
4882 type
= TREE_TYPE (type
);
4884 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4885 VAR_DECL
, DECL_NAME (decl
), type
);
4886 if (DECL_PT_UID_SET_P (decl
))
4887 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4888 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4889 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4890 if (!DECL_BY_REFERENCE (decl
))
4892 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4893 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4896 return copy_decl_for_dup_finish (id
, decl
, copy
);
4900 copy_decl_no_change (tree decl
, copy_body_data
*id
)
4904 copy
= copy_node (decl
);
4906 /* The COPY is not abstract; it will be generated in DST_FN. */
4907 DECL_ABSTRACT (copy
) = 0;
4908 lang_hooks
.dup_lang_specific_decl (copy
);
4910 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4911 been taken; it's for internal bookkeeping in expand_goto_internal. */
4912 if (TREE_CODE (copy
) == LABEL_DECL
)
4914 TREE_ADDRESSABLE (copy
) = 0;
4915 LABEL_DECL_UID (copy
) = -1;
4918 return copy_decl_for_dup_finish (id
, decl
, copy
);
4922 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
4924 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
4925 return copy_decl_to_var (decl
, id
);
4927 return copy_decl_no_change (decl
, id
);
4930 /* Return a copy of the function's argument tree. */
4932 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
4933 bitmap args_to_skip
, tree
*vars
)
4936 tree new_parm
= NULL
;
4941 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
4942 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
4944 tree new_tree
= remap_decl (arg
, id
);
4945 if (TREE_CODE (new_tree
) != PARM_DECL
)
4946 new_tree
= id
->copy_decl (arg
, id
);
4947 lang_hooks
.dup_lang_specific_decl (new_tree
);
4949 parg
= &DECL_CHAIN (new_tree
);
4951 else if (!pointer_map_contains (id
->decl_map
, arg
))
4953 /* Make an equivalent VAR_DECL. If the argument was used
4954 as temporary variable later in function, the uses will be
4955 replaced by local variable. */
4956 tree var
= copy_decl_to_var (arg
, id
);
4957 insert_decl_map (id
, arg
, var
);
4958 /* Declare this new variable. */
4959 DECL_CHAIN (var
) = *vars
;
4965 /* Return a copy of the function's static chain. */
4967 copy_static_chain (tree static_chain
, copy_body_data
* id
)
4969 tree
*chain_copy
, *pvar
;
4971 chain_copy
= &static_chain
;
4972 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
4974 tree new_tree
= remap_decl (*pvar
, id
);
4975 lang_hooks
.dup_lang_specific_decl (new_tree
);
4976 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
4979 return static_chain
;
4982 /* Return true if the function is allowed to be versioned.
4983 This is a guard for the versioning functionality. */
4986 tree_versionable_function_p (tree fndecl
)
4988 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
4989 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
4992 /* Delete all unreachable basic blocks and update callgraph.
4993 Doing so is somewhat nontrivial because we need to update all clones and
4994 remove inline function that become unreachable. */
4997 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
4999 bool changed
= false;
5000 basic_block b
, next_bb
;
5002 find_unreachable_blocks ();
5004 /* Delete all unreachable basic blocks. */
5006 for (b
= ENTRY_BLOCK_PTR
->next_bb
; b
!= EXIT_BLOCK_PTR
; b
= next_bb
)
5008 next_bb
= b
->next_bb
;
5010 if (!(b
->flags
& BB_REACHABLE
))
5012 gimple_stmt_iterator bsi
;
5014 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5015 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
)
5017 struct cgraph_edge
*e
;
5018 struct cgraph_node
*node
;
5020 if ((e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
5022 if (!e
->inline_failed
)
5023 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5025 cgraph_remove_edge (e
);
5027 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5028 && id
->dst_node
->clones
)
5029 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5031 if ((e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
5033 if (!e
->inline_failed
)
5034 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5036 cgraph_remove_edge (e
);
5040 node
= node
->clones
;
5041 else if (node
->next_sibling_clone
)
5042 node
= node
->next_sibling_clone
;
5045 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5046 node
= node
->clone_of
;
5047 if (node
!= id
->dst_node
)
5048 node
= node
->next_sibling_clone
;
5052 delete_basic_block (b
);
5060 /* Update clone info after duplication. */
5063 update_clone_info (copy_body_data
* id
)
5065 struct cgraph_node
*node
;
5066 if (!id
->dst_node
->clones
)
5068 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5070 /* First update replace maps to match the new body. */
5071 if (node
->clone
.tree_map
)
5074 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5076 struct ipa_replace_map
*replace_info
;
5077 replace_info
= (*node
->clone
.tree_map
)[i
];
5078 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5079 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5083 node
= node
->clones
;
5084 else if (node
->next_sibling_clone
)
5085 node
= node
->next_sibling_clone
;
5088 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5089 node
= node
->clone_of
;
5090 if (node
!= id
->dst_node
)
5091 node
= node
->next_sibling_clone
;
5096 /* Create a copy of a function's tree.
5097 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5098 of the original function and the new copied function
5099 respectively. In case we want to replace a DECL
5100 tree with another tree while duplicating the function's
5101 body, TREE_MAP represents the mapping between these
5102 trees. If UPDATE_CLONES is set, the call_stmt fields
5103 of edges of clones of the function will be updated.
5105 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5107 If SKIP_RETURN is true, the new version will return void.
5108 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5109 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5112 tree_function_versioning (tree old_decl
, tree new_decl
,
5113 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
5114 bool update_clones
, bitmap args_to_skip
,
5115 bool skip_return
, bitmap blocks_to_copy
,
5116 basic_block new_entry
)
5118 struct cgraph_node
*old_version_node
;
5119 struct cgraph_node
*new_version_node
;
5123 struct ipa_replace_map
*replace_info
;
5124 basic_block old_entry_block
, bb
;
5125 vec
<gimple
> init_stmts
;
5126 init_stmts
.create (10);
5127 tree vars
= NULL_TREE
;
5129 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5130 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5131 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5133 old_version_node
= cgraph_get_node (old_decl
);
5134 gcc_checking_assert (old_version_node
);
5135 new_version_node
= cgraph_get_node (new_decl
);
5136 gcc_checking_assert (new_version_node
);
5138 /* Copy over debug args. */
5139 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5141 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5142 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5143 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5144 old_debug_args
= decl_debug_args_lookup (old_decl
);
5147 new_debug_args
= decl_debug_args_insert (new_decl
);
5148 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5152 /* Output the inlining info for this abstract function, since it has been
5153 inlined. If we don't do this now, we can lose the information about the
5154 variables in the function when the blocks get blown away as soon as we
5155 remove the cgraph node. */
5156 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5158 DECL_ARTIFICIAL (new_decl
) = 1;
5159 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5160 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5162 /* Prepare the data structures for the tree copy. */
5163 memset (&id
, 0, sizeof (id
));
5165 /* Generate a new name for the new version. */
5166 id
.statements_to_fold
= pointer_set_create ();
5168 id
.decl_map
= pointer_map_create ();
5169 id
.debug_map
= NULL
;
5170 id
.src_fn
= old_decl
;
5171 id
.dst_fn
= new_decl
;
5172 id
.src_node
= old_version_node
;
5173 id
.dst_node
= new_version_node
;
5174 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5175 if (id
.src_node
->ipa_transforms_to_apply
.exists ())
5177 vec
<ipa_opt_pass
> old_transforms_to_apply
5178 = id
.dst_node
->ipa_transforms_to_apply
;
5181 id
.dst_node
->ipa_transforms_to_apply
5182 = id
.src_node
->ipa_transforms_to_apply
.copy ();
5183 for (i
= 0; i
< old_transforms_to_apply
.length (); i
++)
5184 id
.dst_node
->ipa_transforms_to_apply
.safe_push (old_transforms_to_apply
[i
]);
5185 old_transforms_to_apply
.release ();
5188 id
.copy_decl
= copy_decl_no_change
;
5189 id
.transform_call_graph_edges
5190 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5191 id
.transform_new_cfg
= true;
5192 id
.transform_return_to_modify
= false;
5193 id
.transform_lang_insert_block
= NULL
;
5195 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION
5196 (DECL_STRUCT_FUNCTION (old_decl
));
5197 initialize_cfun (new_decl
, old_decl
,
5198 old_entry_block
->count
);
5199 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5200 = id
.src_cfun
->gimple_df
->ipa_pta
;
5202 /* Copy the function's static chain. */
5203 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5205 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5206 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5209 /* If there's a tree_map, prepare for substitution. */
5211 for (i
= 0; i
< tree_map
->length (); i
++)
5214 replace_info
= (*tree_map
)[i
];
5215 if (replace_info
->replace_p
)
5217 if (!replace_info
->old_tree
)
5219 int i
= replace_info
->parm_num
;
5221 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5223 replace_info
->old_tree
= parm
;
5225 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5226 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5227 replace_info
->new_tree
, id
.src_fn
,
5231 init_stmts
.safe_push (init
);
5234 /* Copy the function's arguments. */
5235 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5236 DECL_ARGUMENTS (new_decl
) =
5237 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5238 args_to_skip
, &vars
);
5240 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5241 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5243 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5245 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5246 /* Add local vars. */
5247 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5249 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5251 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5253 DECL_RESULT (new_decl
)
5254 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5255 RESULT_DECL
, NULL_TREE
, void_type_node
);
5256 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5257 cfun
->returns_struct
= 0;
5258 cfun
->returns_pcc_struct
= 0;
5263 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5264 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5265 if (gimple_in_ssa_p (id
.src_cfun
)
5266 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5267 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5269 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5270 insert_decl_map (&id
, old_name
, new_name
);
5271 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5272 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5276 /* Copy the Function's body. */
5277 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5278 ENTRY_BLOCK_PTR
, EXIT_BLOCK_PTR
, blocks_to_copy
, new_entry
);
5280 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5281 number_blocks (new_decl
);
5283 /* We want to create the BB unconditionally, so that the addition of
5284 debug stmts doesn't affect BB count, which may in the end cause
5285 codegen differences. */
5286 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR
));
5287 while (init_stmts
.length ())
5288 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5289 update_clone_info (&id
);
5291 /* Remap the nonlocal_goto_save_area, if any. */
5292 if (cfun
->nonlocal_goto_save_area
)
5294 struct walk_stmt_info wi
;
5296 memset (&wi
, 0, sizeof (wi
));
5298 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5302 pointer_map_destroy (id
.decl_map
);
5304 pointer_map_destroy (id
.debug_map
);
5305 free_dominance_info (CDI_DOMINATORS
);
5306 free_dominance_info (CDI_POST_DOMINATORS
);
5308 fold_marked_statements (0, id
.statements_to_fold
);
5309 pointer_set_destroy (id
.statements_to_fold
);
5310 fold_cond_expr_cond ();
5311 delete_unreachable_blocks_update_callgraph (&id
);
5312 if (id
.dst_node
->analyzed
)
5313 cgraph_rebuild_references ();
5314 update_ssa (TODO_update_ssa
);
5316 /* After partial cloning we need to rescale frequencies, so they are
5317 within proper range in the cloned function. */
5320 struct cgraph_edge
*e
;
5321 rebuild_frequencies ();
5323 new_version_node
->count
= ENTRY_BLOCK_PTR
->count
;
5324 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5326 basic_block bb
= gimple_bb (e
->call_stmt
);
5327 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5329 e
->count
= bb
->count
;
5331 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5333 basic_block bb
= gimple_bb (e
->call_stmt
);
5334 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5336 e
->count
= bb
->count
;
5340 free_dominance_info (CDI_DOMINATORS
);
5341 free_dominance_info (CDI_POST_DOMINATORS
);
5343 gcc_assert (!id
.debug_stmts
.exists ());
5344 init_stmts
.release ();
5349 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5350 the callee and return the inlined body on success. */
5353 maybe_inline_call_in_expr (tree exp
)
5355 tree fn
= get_callee_fndecl (exp
);
5357 /* We can only try to inline "const" functions. */
5358 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5360 struct pointer_map_t
*decl_map
= pointer_map_create ();
5361 call_expr_arg_iterator iter
;
5365 /* Remap the parameters. */
5366 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5368 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5369 *pointer_map_insert (decl_map
, param
) = arg
;
5371 memset (&id
, 0, sizeof (id
));
5373 id
.dst_fn
= current_function_decl
;
5374 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5375 id
.decl_map
= decl_map
;
5377 id
.copy_decl
= copy_decl_no_change
;
5378 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5379 id
.transform_new_cfg
= false;
5380 id
.transform_return_to_modify
= true;
5381 id
.transform_lang_insert_block
= NULL
;
5383 /* Make sure not to unshare trees behind the front-end's back
5384 since front-end specific mechanisms may rely on sharing. */
5385 id
.regimplify
= false;
5386 id
.do_not_unshare
= true;
5388 /* We're not inside any EH region. */
5391 t
= copy_tree_body (&id
);
5392 pointer_map_destroy (decl_map
);
5394 /* We can only return something suitable for use in a GENERIC
5396 if (TREE_CODE (t
) == MODIFY_EXPR
)
5397 return TREE_OPERAND (t
, 1);
5403 /* Duplicate a type, fields and all. */
5406 build_duplicate_type (tree type
)
5408 struct copy_body_data id
;
5410 memset (&id
, 0, sizeof (id
));
5411 id
.src_fn
= current_function_decl
;
5412 id
.dst_fn
= current_function_decl
;
5414 id
.decl_map
= pointer_map_create ();
5415 id
.debug_map
= NULL
;
5416 id
.copy_decl
= copy_decl_no_change
;
5418 type
= remap_type_1 (type
, &id
);
5420 pointer_map_destroy (id
.decl_map
);
5422 pointer_map_destroy (id
.debug_map
);
5424 TYPE_CANONICAL (type
) = type
;