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 /* We need to re-canonicalize MEM_REFs from inline substitutions
1096 that can happen when a pointer argument is an ADDR_EXPR. */
1097 tree decl
= TREE_OPERAND (*tp
, 0);
1100 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1104 *tp
= fold_build2 (MEM_REF
, TREE_TYPE (*tp
),
1105 unshare_expr (*n
), TREE_OPERAND (*tp
, 1));
1106 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1107 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 copy_basic_block
->count
= bb
->count
* count_scale
/ REG_BR_PROB_BASE
;
1526 /* We are going to rebuild frequencies from scratch. These values
1527 have just small importance to drive canonicalize_loop_headers. */
1528 freq
= ((gcov_type
)bb
->frequency
* frequency_scale
/ REG_BR_PROB_BASE
);
1530 /* We recompute frequencies after inlining, so this is quite safe. */
1531 if (freq
> BB_FREQ_MAX
)
1533 copy_basic_block
->frequency
= freq
;
1535 copy_gsi
= gsi_start_bb (copy_basic_block
);
1537 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1539 gimple stmt
= gsi_stmt (gsi
);
1540 gimple orig_stmt
= stmt
;
1542 id
->regimplify
= false;
1543 stmt
= remap_gimple_stmt (stmt
, id
);
1544 if (gimple_nop_p (stmt
))
1547 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1550 /* With return slot optimization we can end up with
1551 non-gimple (foo *)&this->m, fix that here. */
1552 if (is_gimple_assign (stmt
)
1553 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1554 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1557 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1558 gimple_assign_rhs1 (stmt
),
1560 GSI_CONTINUE_LINKING
);
1561 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1562 id
->regimplify
= false;
1565 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1568 gimple_regimplify_operands (stmt
, &seq_gsi
);
1570 /* If copy_basic_block has been empty at the start of this iteration,
1571 call gsi_start_bb again to get at the newly added statements. */
1572 if (gsi_end_p (copy_gsi
))
1573 copy_gsi
= gsi_start_bb (copy_basic_block
);
1575 gsi_next (©_gsi
);
1577 /* Process the new statement. The call to gimple_regimplify_operands
1578 possibly turned the statement into multiple statements, we
1579 need to process all of them. */
1584 stmt
= gsi_stmt (copy_gsi
);
1585 if (is_gimple_call (stmt
)
1586 && gimple_call_va_arg_pack_p (stmt
)
1589 /* __builtin_va_arg_pack () should be replaced by
1590 all arguments corresponding to ... in the caller. */
1594 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1597 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1600 /* Create the new array of arguments. */
1601 n
= nargs
+ gimple_call_num_args (stmt
);
1602 argarray
.create (n
);
1603 argarray
.safe_grow_cleared (n
);
1605 /* Copy all the arguments before '...' */
1606 memcpy (argarray
.address (),
1607 gimple_call_arg_ptr (stmt
, 0),
1608 gimple_call_num_args (stmt
) * sizeof (tree
));
1610 /* Append the arguments passed in '...' */
1611 memcpy (argarray
.address () + gimple_call_num_args (stmt
),
1612 gimple_call_arg_ptr (id
->gimple_call
, 0)
1613 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1614 nargs
* sizeof (tree
));
1616 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1619 argarray
.release ();
1621 /* Copy all GIMPLE_CALL flags, location and block, except
1622 GF_CALL_VA_ARG_PACK. */
1623 gimple_call_copy_flags (new_call
, stmt
);
1624 gimple_call_set_va_arg_pack (new_call
, false);
1625 gimple_set_location (new_call
, gimple_location (stmt
));
1626 gimple_set_block (new_call
, gimple_block (stmt
));
1627 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1629 gsi_replace (©_gsi
, new_call
, false);
1632 else if (is_gimple_call (stmt
)
1634 && (decl
= gimple_call_fndecl (stmt
))
1635 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1636 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1638 /* __builtin_va_arg_pack_len () should be replaced by
1639 the number of anonymous arguments. */
1640 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1644 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1647 count
= build_int_cst (integer_type_node
, nargs
);
1648 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1649 gsi_replace (©_gsi
, new_stmt
, false);
1653 /* Statements produced by inlining can be unfolded, especially
1654 when we constant propagated some operands. We can't fold
1655 them right now for two reasons:
1656 1) folding require SSA_NAME_DEF_STMTs to be correct
1657 2) we can't change function calls to builtins.
1658 So we just mark statement for later folding. We mark
1659 all new statements, instead just statements that has changed
1660 by some nontrivial substitution so even statements made
1661 foldable indirectly are updated. If this turns out to be
1662 expensive, copy_body can be told to watch for nontrivial
1664 if (id
->statements_to_fold
)
1665 pointer_set_insert (id
->statements_to_fold
, stmt
);
1667 /* We're duplicating a CALL_EXPR. Find any corresponding
1668 callgraph edges and update or duplicate them. */
1669 if (is_gimple_call (stmt
))
1671 struct cgraph_edge
*edge
;
1674 switch (id
->transform_call_graph_edges
)
1676 case CB_CGE_DUPLICATE
:
1677 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1680 int edge_freq
= edge
->frequency
;
1681 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1683 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1685 /* We could also just rescale the frequency, but
1686 doing so would introduce roundoff errors and make
1687 verifier unhappy. */
1689 = compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1692 && profile_status_for_function (cfun
) != PROFILE_ABSENT
1693 && (edge_freq
> edge
->frequency
+ 10
1694 || edge_freq
< edge
->frequency
- 10))
1696 fprintf (dump_file
, "Edge frequency estimated by "
1697 "cgraph %i diverge from inliner's estimate %i\n",
1701 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1704 copy_basic_block
->frequency
);
1706 stmt
= cgraph_redirect_edge_call_stmt_to_callee (edge
);
1710 case CB_CGE_MOVE_CLONES
:
1711 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1713 edge
= cgraph_edge (id
->dst_node
, stmt
);
1717 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1719 cgraph_set_call_stmt (edge
, stmt
);
1726 /* Constant propagation on argument done during inlining
1727 may create new direct call. Produce an edge for it. */
1729 || (edge
->indirect_inlining_edge
1730 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1731 && id
->dst_node
->analyzed
1732 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1734 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1736 /* We have missing edge in the callgraph. This can happen
1737 when previous inlining turned an indirect call into a
1738 direct call by constant propagating arguments or we are
1739 producing dead clone (for further cloning). In all
1740 other cases we hit a bug (incorrect node sharing is the
1741 most common reason for missing edges). */
1742 gcc_assert (!dest
->analyzed
1743 || dest
->symbol
.address_taken
1744 || !id
->src_node
->analyzed
1745 || !id
->dst_node
->analyzed
);
1746 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1747 cgraph_create_edge_including_clones
1748 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1749 compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1751 CIF_ORIGINALLY_INDIRECT_CALL
);
1753 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1755 compute_call_stmt_bb_frequency
1756 (id
->dst_node
->symbol
.decl
,
1757 copy_basic_block
))->inline_failed
1758 = CIF_ORIGINALLY_INDIRECT_CALL
;
1761 fprintf (dump_file
, "Created new direct edge to %s\n",
1762 cgraph_node_name (dest
));
1766 flags
= gimple_call_flags (stmt
);
1767 if (flags
& ECF_MAY_BE_ALLOCA
)
1768 cfun
->calls_alloca
= true;
1769 if (flags
& ECF_RETURNS_TWICE
)
1770 cfun
->calls_setjmp
= true;
1773 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1774 id
->eh_map
, id
->eh_lp_nr
);
1776 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1781 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1782 if (TREE_CODE (def
) == SSA_NAME
)
1783 SSA_NAME_DEF_STMT (def
) = stmt
;
1786 gsi_next (©_gsi
);
1788 while (!gsi_end_p (copy_gsi
));
1790 copy_gsi
= gsi_last_bb (copy_basic_block
);
1793 return copy_basic_block
;
1796 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1797 form is quite easy, since dominator relationship for old basic blocks does
1800 There is however exception where inlining might change dominator relation
1801 across EH edges from basic block within inlined functions destinating
1802 to landing pads in function we inline into.
1804 The function fills in PHI_RESULTs of such PHI nodes if they refer
1805 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1806 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1807 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1808 set, and this means that there will be no overlapping live ranges
1809 for the underlying symbol.
1811 This might change in future if we allow redirecting of EH edges and
1812 we might want to change way build CFG pre-inlining to include
1813 all the possible edges then. */
1815 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1816 bool can_throw
, bool nonlocal_goto
)
1821 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1823 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1826 gimple_stmt_iterator si
;
1829 gcc_assert (e
->flags
& EDGE_EH
);
1832 gcc_assert (!(e
->flags
& EDGE_EH
));
1834 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1838 phi
= gsi_stmt (si
);
1840 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1841 gcc_assert (!e
->dest
->aux
);
1843 gcc_assert ((e
->flags
& EDGE_EH
)
1844 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1846 if (virtual_operand_p (PHI_RESULT (phi
)))
1848 mark_virtual_operands_for_renaming (cfun
);
1852 re
= find_edge (ret_bb
, e
->dest
);
1854 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1855 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1857 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1858 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1864 /* Copy edges from BB into its copy constructed earlier, scale profile
1865 accordingly. Edges will be taken care of later. Assume aux
1866 pointers to point to the copies of each BB. Return true if any
1867 debug stmts are left after a statement that must end the basic block. */
1870 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
)
1872 basic_block new_bb
= (basic_block
) bb
->aux
;
1875 gimple_stmt_iterator si
;
1877 bool need_debug_cleanup
= false;
1879 /* Use the indices from the original blocks to create edges for the
1881 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1882 if (!(old_edge
->flags
& EDGE_EH
))
1886 flags
= old_edge
->flags
;
1888 /* Return edges do get a FALLTHRU flag when the get inlined. */
1889 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1890 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR
)
1891 flags
|= EDGE_FALLTHRU
;
1892 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1893 new_edge
->count
= old_edge
->count
* count_scale
/ REG_BR_PROB_BASE
;
1894 new_edge
->probability
= old_edge
->probability
;
1897 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1900 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
1903 bool can_throw
, nonlocal_goto
;
1905 copy_stmt
= gsi_stmt (si
);
1906 if (!is_gimple_debug (copy_stmt
))
1907 update_stmt (copy_stmt
);
1909 /* Do this before the possible split_block. */
1912 /* If this tree could throw an exception, there are two
1913 cases where we need to add abnormal edge(s): the
1914 tree wasn't in a region and there is a "current
1915 region" in the caller; or the original tree had
1916 EH edges. In both cases split the block after the tree,
1917 and add abnormal edge(s) as needed; we need both
1918 those from the callee and the caller.
1919 We check whether the copy can throw, because the const
1920 propagation can change an INDIRECT_REF which throws
1921 into a COMPONENT_REF which doesn't. If the copy
1922 can throw, the original could also throw. */
1923 can_throw
= stmt_can_throw_internal (copy_stmt
);
1924 nonlocal_goto
= stmt_can_make_abnormal_goto (copy_stmt
);
1926 if (can_throw
|| nonlocal_goto
)
1928 if (!gsi_end_p (si
))
1930 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
1933 need_debug_cleanup
= true;
1935 if (!gsi_end_p (si
))
1936 /* Note that bb's predecessor edges aren't necessarily
1937 right at this point; split_block doesn't care. */
1939 edge e
= split_block (new_bb
, copy_stmt
);
1942 new_bb
->aux
= e
->src
->aux
;
1943 si
= gsi_start_bb (new_bb
);
1947 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
1948 make_eh_dispatch_edges (copy_stmt
);
1950 make_eh_edges (copy_stmt
);
1953 make_abnormal_goto_edges (gimple_bb (copy_stmt
), true);
1955 if ((can_throw
|| nonlocal_goto
)
1956 && gimple_in_ssa_p (cfun
))
1957 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
1958 can_throw
, nonlocal_goto
);
1960 return need_debug_cleanup
;
1963 /* Copy the PHIs. All blocks and edges are copied, some blocks
1964 was possibly split and new outgoing EH edges inserted.
1965 BB points to the block of original function and AUX pointers links
1966 the original and newly copied blocks. */
1969 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
1971 basic_block
const new_bb
= (basic_block
) bb
->aux
;
1974 gimple_stmt_iterator si
;
1976 bool inserted
= false;
1978 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
1983 phi
= gsi_stmt (si
);
1984 res
= PHI_RESULT (phi
);
1986 if (!virtual_operand_p (res
))
1988 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
1989 new_phi
= create_phi_node (new_res
, new_bb
);
1990 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
1992 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
1998 /* When doing partial cloning, we allow PHIs on the entry block
1999 as long as all the arguments are the same. Find any input
2000 edge to see argument to copy. */
2002 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2003 if (!old_edge
->src
->aux
)
2006 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2008 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2009 gcc_assert (new_arg
);
2010 /* With return slot optimization we can end up with
2011 non-gimple (foo *)&this->m, fix that here. */
2012 if (TREE_CODE (new_arg
) != SSA_NAME
2013 && TREE_CODE (new_arg
) != FUNCTION_DECL
2014 && !is_gimple_val (new_arg
))
2016 gimple_seq stmts
= NULL
;
2017 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2018 gsi_insert_seq_on_edge (new_edge
, stmts
);
2021 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2022 if (LOCATION_BLOCK (locus
))
2025 n
= (tree
*) pointer_map_contains (id
->decl_map
,
2026 LOCATION_BLOCK (locus
));
2028 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2031 locus
= LOCATION_LOCUS (locus
);
2033 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2038 /* Commit the delayed edge insertions. */
2040 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2041 gsi_commit_one_edge_insert (new_edge
, NULL
);
2045 /* Wrapper for remap_decl so it can be used as a callback. */
2048 remap_decl_1 (tree decl
, void *data
)
2050 return remap_decl (decl
, (copy_body_data
*) data
);
2053 /* Build struct function and associated datastructures for the new clone
2054 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2055 the cfun to the function of new_fndecl (and current_function_decl too). */
2058 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2060 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2061 gcov_type count_scale
;
2063 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2064 count_scale
= (REG_BR_PROB_BASE
* count
2065 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2067 count_scale
= REG_BR_PROB_BASE
;
2069 /* Register specific tree functions. */
2070 gimple_register_cfg_hooks ();
2072 /* Get clean struct function. */
2073 push_struct_function (new_fndecl
);
2075 /* We will rebuild these, so just sanity check that they are empty. */
2076 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2077 gcc_assert (cfun
->local_decls
== NULL
);
2078 gcc_assert (cfun
->cfg
== NULL
);
2079 gcc_assert (cfun
->decl
== new_fndecl
);
2081 /* Copy items we preserve during cloning. */
2082 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2083 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2084 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2085 cfun
->curr_properties
= src_cfun
->curr_properties
& ~PROP_loops
;
2086 cfun
->last_verified
= src_cfun
->last_verified
;
2087 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2088 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2089 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2090 cfun
->stdarg
= src_cfun
->stdarg
;
2091 cfun
->after_inlining
= src_cfun
->after_inlining
;
2092 cfun
->can_throw_non_call_exceptions
2093 = src_cfun
->can_throw_non_call_exceptions
;
2094 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2095 cfun
->returns_struct
= src_cfun
->returns_struct
;
2096 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2098 init_empty_tree_cfg ();
2100 profile_status_for_function (cfun
) = profile_status_for_function (src_cfun
);
2101 ENTRY_BLOCK_PTR
->count
=
2102 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2104 ENTRY_BLOCK_PTR
->frequency
2105 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2106 EXIT_BLOCK_PTR
->count
=
2107 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2109 EXIT_BLOCK_PTR
->frequency
=
2110 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2112 init_eh_for_function ();
2114 if (src_cfun
->gimple_df
)
2116 init_tree_ssa (cfun
);
2117 cfun
->gimple_df
->in_ssa_p
= true;
2118 init_ssa_operands (cfun
);
2122 /* Helper function for copy_cfg_body. Move debug stmts from the end
2123 of NEW_BB to the beginning of successor basic blocks when needed. If the
2124 successor has multiple predecessors, reset them, otherwise keep
2128 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2132 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2135 || gsi_one_before_end_p (si
)
2136 || !(stmt_can_throw_internal (gsi_stmt (si
))
2137 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2140 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2142 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2143 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2144 while (is_gimple_debug (gsi_stmt (ssi
)))
2146 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2150 /* For the last edge move the debug stmts instead of copying
2152 if (ei_one_before_end_p (ei
))
2156 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2157 gimple_debug_bind_reset_value (stmt
);
2158 gsi_remove (&si
, false);
2159 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2163 if (gimple_debug_bind_p (stmt
))
2165 var
= gimple_debug_bind_get_var (stmt
);
2166 if (single_pred_p (e
->dest
))
2168 value
= gimple_debug_bind_get_value (stmt
);
2169 value
= unshare_expr (value
);
2173 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2175 else if (gimple_debug_source_bind_p (stmt
))
2177 var
= gimple_debug_source_bind_get_var (stmt
);
2178 value
= gimple_debug_source_bind_get_value (stmt
);
2179 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2183 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2184 id
->debug_stmts
.safe_push (new_stmt
);
2190 /* Make a copy of the body of FN so that it can be inserted inline in
2191 another function. Walks FN via CFG, returns new fndecl. */
2194 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2195 basic_block entry_block_map
, basic_block exit_block_map
,
2196 bitmap blocks_to_copy
, basic_block new_entry
)
2198 tree callee_fndecl
= id
->src_fn
;
2199 /* Original cfun for the callee, doesn't change. */
2200 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2201 struct function
*cfun_to_copy
;
2203 tree new_fndecl
= NULL
;
2204 bool need_debug_cleanup
= false;
2205 gcov_type count_scale
;
2207 int incoming_frequency
= 0;
2208 gcov_type incoming_count
= 0;
2210 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2211 count_scale
= (REG_BR_PROB_BASE
* count
2212 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2214 count_scale
= REG_BR_PROB_BASE
;
2216 /* Register specific tree functions. */
2217 gimple_register_cfg_hooks ();
2219 /* If we are inlining just region of the function, make sure to connect new entry
2220 to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute
2221 frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and
2222 probabilities of edges incoming from nonduplicated region. */
2228 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2231 incoming_frequency
+= EDGE_FREQUENCY (e
);
2232 incoming_count
+= e
->count
;
2234 incoming_count
= incoming_count
* count_scale
/ REG_BR_PROB_BASE
;
2236 = incoming_frequency
* frequency_scale
/ REG_BR_PROB_BASE
;
2237 ENTRY_BLOCK_PTR
->count
= incoming_count
;
2238 ENTRY_BLOCK_PTR
->frequency
= incoming_frequency
;
2241 /* Must have a CFG here at this point. */
2242 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2243 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2245 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2247 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= entry_block_map
;
2248 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= exit_block_map
;
2249 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2250 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2252 /* Duplicate any exception-handling regions. */
2254 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2257 /* Use aux pointers to map the original blocks to copy. */
2258 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2259 if (!blocks_to_copy
|| bitmap_bit_p (blocks_to_copy
, bb
->index
))
2261 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2266 last
= last_basic_block
;
2268 /* Now that we've duplicated the blocks, duplicate their edges. */
2269 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2271 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2272 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
);
2276 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2277 e
->probability
= REG_BR_PROB_BASE
;
2278 e
->count
= incoming_count
;
2281 if (gimple_in_ssa_p (cfun
))
2282 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2284 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2285 copy_phis_for_bb (bb
, id
);
2287 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2290 if (need_debug_cleanup
2291 && bb
->index
!= ENTRY_BLOCK
2292 && bb
->index
!= EXIT_BLOCK
)
2293 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2294 ((basic_block
)bb
->aux
)->aux
= NULL
;
2298 /* Zero out AUX fields of newly created block during EH edge
2300 for (; last
< last_basic_block
; last
++)
2302 if (need_debug_cleanup
)
2303 maybe_move_debug_stmts_to_successors (id
, BASIC_BLOCK (last
));
2304 BASIC_BLOCK (last
)->aux
= NULL
;
2306 entry_block_map
->aux
= NULL
;
2307 exit_block_map
->aux
= NULL
;
2311 pointer_map_destroy (id
->eh_map
);
2318 /* Copy the debug STMT using ID. We deal with these statements in a
2319 special way: if any variable in their VALUE expression wasn't
2320 remapped yet, we won't remap it, because that would get decl uids
2321 out of sync, causing codegen differences between -g and -g0. If
2322 this arises, we drop the VALUE expression altogether. */
2325 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2328 struct walk_stmt_info wi
;
2330 if (gimple_block (stmt
))
2332 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2333 gimple_set_block (stmt
, n
? *n
: id
->block
);
2336 /* Remap all the operands in COPY. */
2337 memset (&wi
, 0, sizeof (wi
));
2340 processing_debug_stmt
= 1;
2342 if (gimple_debug_source_bind_p (stmt
))
2343 t
= gimple_debug_source_bind_get_var (stmt
);
2345 t
= gimple_debug_bind_get_var (stmt
);
2347 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2348 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2350 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2353 else if (TREE_CODE (t
) == VAR_DECL
2354 && !is_global_var (t
)
2355 && !pointer_map_contains (id
->decl_map
, t
))
2356 /* T is a non-localized variable. */;
2358 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2360 if (gimple_debug_bind_p (stmt
))
2362 gimple_debug_bind_set_var (stmt
, t
);
2364 if (gimple_debug_bind_has_value_p (stmt
))
2365 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2366 remap_gimple_op_r
, &wi
, NULL
);
2368 /* Punt if any decl couldn't be remapped. */
2369 if (processing_debug_stmt
< 0)
2370 gimple_debug_bind_reset_value (stmt
);
2372 else if (gimple_debug_source_bind_p (stmt
))
2374 gimple_debug_source_bind_set_var (stmt
, t
);
2375 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2376 remap_gimple_op_r
, &wi
, NULL
);
2377 /* When inlining and source bind refers to one of the optimized
2378 away parameters, change the source bind into normal debug bind
2379 referring to the corresponding DEBUG_EXPR_DECL that should have
2380 been bound before the call stmt. */
2381 t
= gimple_debug_source_bind_get_value (stmt
);
2383 && TREE_CODE (t
) == PARM_DECL
2386 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2388 if (debug_args
!= NULL
)
2390 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2391 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2392 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2394 t
= (**debug_args
)[i
+ 1];
2395 stmt
->gsbase
.subcode
= GIMPLE_DEBUG_BIND
;
2396 gimple_debug_bind_set_value (stmt
, t
);
2403 processing_debug_stmt
= 0;
2408 /* Process deferred debug stmts. In order to give values better odds
2409 of being successfully remapped, we delay the processing of debug
2410 stmts until all other stmts that might require remapping are
2414 copy_debug_stmts (copy_body_data
*id
)
2419 if (!id
->debug_stmts
.exists ())
2422 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2423 copy_debug_stmt (stmt
, id
);
2425 id
->debug_stmts
.release ();
2428 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2429 another function. */
2432 copy_tree_body (copy_body_data
*id
)
2434 tree fndecl
= id
->src_fn
;
2435 tree body
= DECL_SAVED_TREE (fndecl
);
2437 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2442 /* Make a copy of the body of FN so that it can be inserted inline in
2443 another function. */
2446 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2447 basic_block entry_block_map
, basic_block exit_block_map
,
2448 bitmap blocks_to_copy
, basic_block new_entry
)
2450 tree fndecl
= id
->src_fn
;
2453 /* If this body has a CFG, walk CFG and copy. */
2454 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl
)));
2455 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2456 blocks_to_copy
, new_entry
);
2457 copy_debug_stmts (id
);
2462 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2463 defined in function FN, or of a data member thereof. */
2466 self_inlining_addr_expr (tree value
, tree fn
)
2470 if (TREE_CODE (value
) != ADDR_EXPR
)
2473 var
= get_base_address (TREE_OPERAND (value
, 0));
2475 return var
&& auto_var_in_fn_p (var
, fn
);
2478 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2479 lexical block and line number information from base_stmt, if given,
2480 or from the last stmt of the block otherwise. */
2483 insert_init_debug_bind (copy_body_data
*id
,
2484 basic_block bb
, tree var
, tree value
,
2488 gimple_stmt_iterator gsi
;
2491 if (!gimple_in_ssa_p (id
->src_cfun
))
2494 if (!MAY_HAVE_DEBUG_STMTS
)
2497 tracked_var
= target_for_debug_bind (var
);
2503 gsi
= gsi_last_bb (bb
);
2504 if (!base_stmt
&& !gsi_end_p (gsi
))
2505 base_stmt
= gsi_stmt (gsi
);
2508 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2512 if (!gsi_end_p (gsi
))
2513 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2515 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2522 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2524 /* If VAR represents a zero-sized variable, it's possible that the
2525 assignment statement may result in no gimple statements. */
2528 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2530 /* We can end up with init statements that store to a non-register
2531 from a rhs with a conversion. Handle that here by forcing the
2532 rhs into a temporary. gimple_regimplify_operands is not
2533 prepared to do this for us. */
2534 if (!is_gimple_debug (init_stmt
)
2535 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2536 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2537 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2539 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2540 gimple_expr_type (init_stmt
),
2541 gimple_assign_rhs1 (init_stmt
));
2542 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2544 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2545 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2547 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2548 gimple_regimplify_operands (init_stmt
, &si
);
2550 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2552 tree def
= gimple_assign_lhs (init_stmt
);
2553 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2558 /* Initialize parameter P with VALUE. If needed, produce init statement
2559 at the end of BB. When BB is NULL, we return init statement to be
2562 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2563 basic_block bb
, tree
*vars
)
2565 gimple init_stmt
= NULL
;
2568 tree def
= (gimple_in_ssa_p (cfun
)
2569 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2572 && value
!= error_mark_node
2573 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2575 /* If we can match up types by promotion/demotion do so. */
2576 if (fold_convertible_p (TREE_TYPE (p
), value
))
2577 rhs
= fold_convert (TREE_TYPE (p
), value
);
2580 /* ??? For valid programs we should not end up here.
2581 Still if we end up with truly mismatched types here, fall back
2582 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2583 GIMPLE to the following passes. */
2584 if (!is_gimple_reg_type (TREE_TYPE (value
))
2585 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2586 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2588 rhs
= build_zero_cst (TREE_TYPE (p
));
2592 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2593 here since the type of this decl must be visible to the calling
2595 var
= copy_decl_to_var (p
, id
);
2597 /* Declare this new variable. */
2598 DECL_CHAIN (var
) = *vars
;
2601 /* Make gimplifier happy about this variable. */
2602 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2604 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2605 we would not need to create a new variable here at all, if it
2606 weren't for debug info. Still, we can just use the argument
2608 if (TREE_READONLY (p
)
2609 && !TREE_ADDRESSABLE (p
)
2610 && value
&& !TREE_SIDE_EFFECTS (value
)
2613 /* We may produce non-gimple trees by adding NOPs or introduce
2614 invalid sharing when operand is not really constant.
2615 It is not big deal to prohibit constant propagation here as
2616 we will constant propagate in DOM1 pass anyway. */
2617 if (is_gimple_min_invariant (value
)
2618 && useless_type_conversion_p (TREE_TYPE (p
),
2620 /* We have to be very careful about ADDR_EXPR. Make sure
2621 the base variable isn't a local variable of the inlined
2622 function, e.g., when doing recursive inlining, direct or
2623 mutually-recursive or whatever, which is why we don't
2624 just test whether fn == current_function_decl. */
2625 && ! self_inlining_addr_expr (value
, fn
))
2627 insert_decl_map (id
, p
, value
);
2628 insert_debug_decl_map (id
, p
, var
);
2629 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2633 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2634 that way, when the PARM_DECL is encountered, it will be
2635 automatically replaced by the VAR_DECL. */
2636 insert_decl_map (id
, p
, var
);
2638 /* Even if P was TREE_READONLY, the new VAR should not be.
2639 In the original code, we would have constructed a
2640 temporary, and then the function body would have never
2641 changed the value of P. However, now, we will be
2642 constructing VAR directly. The constructor body may
2643 change its value multiple times as it is being
2644 constructed. Therefore, it must not be TREE_READONLY;
2645 the back-end assumes that TREE_READONLY variable is
2646 assigned to only once. */
2647 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2648 TREE_READONLY (var
) = 0;
2650 /* If there is no setup required and we are in SSA, take the easy route
2651 replacing all SSA names representing the function parameter by the
2652 SSA name passed to function.
2654 We need to construct map for the variable anyway as it might be used
2655 in different SSA names when parameter is set in function.
2657 Do replacement at -O0 for const arguments replaced by constant.
2658 This is important for builtin_constant_p and other construct requiring
2659 constant argument to be visible in inlined function body. */
2660 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2662 || (TREE_READONLY (p
)
2663 && is_gimple_min_invariant (rhs
)))
2664 && (TREE_CODE (rhs
) == SSA_NAME
2665 || is_gimple_min_invariant (rhs
))
2666 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2668 insert_decl_map (id
, def
, rhs
);
2669 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2672 /* If the value of argument is never used, don't care about initializing
2674 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2676 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2677 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2680 /* Initialize this VAR_DECL from the equivalent argument. Convert
2681 the argument to the proper type in case it was promoted. */
2684 if (rhs
== error_mark_node
)
2686 insert_decl_map (id
, p
, var
);
2687 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2690 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2692 /* If we are in SSA form properly remap the default definition
2693 or assign to a dummy SSA name if the parameter is unused and
2694 we are not optimizing. */
2695 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2699 def
= remap_ssa_name (def
, id
);
2700 init_stmt
= gimple_build_assign (def
, rhs
);
2701 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2702 set_ssa_default_def (cfun
, var
, NULL
);
2706 def
= make_ssa_name (var
, NULL
);
2707 init_stmt
= gimple_build_assign (def
, rhs
);
2711 init_stmt
= gimple_build_assign (var
, rhs
);
2713 if (bb
&& init_stmt
)
2714 insert_init_stmt (id
, bb
, init_stmt
);
2719 /* Generate code to initialize the parameters of the function at the
2720 top of the stack in ID from the GIMPLE_CALL STMT. */
2723 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2724 tree fn
, basic_block bb
)
2729 tree vars
= NULL_TREE
;
2730 tree static_chain
= gimple_call_chain (stmt
);
2732 /* Figure out what the parameters are. */
2733 parms
= DECL_ARGUMENTS (fn
);
2735 /* Loop through the parameter declarations, replacing each with an
2736 equivalent VAR_DECL, appropriately initialized. */
2737 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2740 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2741 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2743 /* After remapping parameters remap their types. This has to be done
2744 in a second loop over all parameters to appropriately remap
2745 variable sized arrays when the size is specified in a
2746 parameter following the array. */
2747 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2749 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
2751 && TREE_CODE (*varp
) == VAR_DECL
)
2753 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
2754 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2756 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
2757 /* Also remap the default definition if it was remapped
2758 to the default definition of the parameter replacement
2759 by the parameter setup. */
2762 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
2764 && TREE_CODE (*defp
) == SSA_NAME
2765 && SSA_NAME_VAR (*defp
) == var
)
2766 TREE_TYPE (*defp
) = TREE_TYPE (var
);
2771 /* Initialize the static chain. */
2772 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
2773 gcc_assert (fn
!= current_function_decl
);
2776 /* No static chain? Seems like a bug in tree-nested.c. */
2777 gcc_assert (static_chain
);
2779 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
2782 declare_inline_vars (id
->block
, vars
);
2786 /* Declare a return variable to replace the RESULT_DECL for the
2787 function we are calling. An appropriate DECL_STMT is returned.
2788 The USE_STMT is filled to contain a use of the declaration to
2789 indicate the return value of the function.
2791 RETURN_SLOT, if non-null is place where to store the result. It
2792 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2793 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2795 The return value is a (possibly null) value that holds the result
2796 as seen by the caller. */
2799 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
2800 basic_block entry_bb
)
2802 tree callee
= id
->src_fn
;
2803 tree result
= DECL_RESULT (callee
);
2804 tree callee_type
= TREE_TYPE (result
);
2808 /* Handle type-mismatches in the function declaration return type
2809 vs. the call expression. */
2811 caller_type
= TREE_TYPE (modify_dest
);
2813 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
2815 /* We don't need to do anything for functions that don't return anything. */
2816 if (VOID_TYPE_P (callee_type
))
2819 /* If there was a return slot, then the return value is the
2820 dereferenced address of that object. */
2823 /* The front end shouldn't have used both return_slot and
2824 a modify expression. */
2825 gcc_assert (!modify_dest
);
2826 if (DECL_BY_REFERENCE (result
))
2828 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
2829 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
2831 /* We are going to construct *&return_slot and we can't do that
2832 for variables believed to be not addressable.
2834 FIXME: This check possibly can match, because values returned
2835 via return slot optimization are not believed to have address
2836 taken by alias analysis. */
2837 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
2838 var
= return_slot_addr
;
2843 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
2844 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
2846 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2847 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2848 && !DECL_GIMPLE_REG_P (result
)
2850 DECL_GIMPLE_REG_P (var
) = 0;
2855 /* All types requiring non-trivial constructors should have been handled. */
2856 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
2858 /* Attempt to avoid creating a new temporary variable. */
2860 && TREE_CODE (modify_dest
) != SSA_NAME
)
2862 bool use_it
= false;
2864 /* We can't use MODIFY_DEST if there's type promotion involved. */
2865 if (!useless_type_conversion_p (callee_type
, caller_type
))
2868 /* ??? If we're assigning to a variable sized type, then we must
2869 reuse the destination variable, because we've no good way to
2870 create variable sized temporaries at this point. */
2871 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
2874 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2875 reuse it as the result of the call directly. Don't do this if
2876 it would promote MODIFY_DEST to addressable. */
2877 else if (TREE_ADDRESSABLE (result
))
2881 tree base_m
= get_base_address (modify_dest
);
2883 /* If the base isn't a decl, then it's a pointer, and we don't
2884 know where that's going to go. */
2885 if (!DECL_P (base_m
))
2887 else if (is_global_var (base_m
))
2889 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2890 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2891 && !DECL_GIMPLE_REG_P (result
)
2892 && DECL_GIMPLE_REG_P (base_m
))
2894 else if (!TREE_ADDRESSABLE (base_m
))
2906 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
2908 var
= copy_result_decl_to_var (result
, id
);
2909 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2911 /* Do not have the rest of GCC warn about this variable as it should
2912 not be visible to the user. */
2913 TREE_NO_WARNING (var
) = 1;
2915 declare_inline_vars (id
->block
, var
);
2917 /* Build the use expr. If the return type of the function was
2918 promoted, convert it back to the expected type. */
2920 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
2922 /* If we can match up types by promotion/demotion do so. */
2923 if (fold_convertible_p (caller_type
, var
))
2924 use
= fold_convert (caller_type
, var
);
2927 /* ??? For valid programs we should not end up here.
2928 Still if we end up with truly mismatched types here, fall back
2929 to using a MEM_REF to not leak invalid GIMPLE to the following
2931 /* Prevent var from being written into SSA form. */
2932 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
2933 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
2934 DECL_GIMPLE_REG_P (var
) = false;
2935 else if (is_gimple_reg_type (TREE_TYPE (var
)))
2936 TREE_ADDRESSABLE (var
) = true;
2937 use
= fold_build2 (MEM_REF
, caller_type
,
2938 build_fold_addr_expr (var
),
2939 build_int_cst (ptr_type_node
, 0));
2943 STRIP_USELESS_TYPE_CONVERSION (use
);
2945 if (DECL_BY_REFERENCE (result
))
2947 TREE_ADDRESSABLE (var
) = 1;
2948 var
= build_fold_addr_expr (var
);
2952 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2953 way, when the RESULT_DECL is encountered, it will be
2954 automatically replaced by the VAR_DECL.
2956 When returning by reference, ensure that RESULT_DECL remaps to
2958 if (DECL_BY_REFERENCE (result
)
2959 && !is_gimple_val (var
))
2961 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
2962 insert_decl_map (id
, result
, temp
);
2963 /* When RESULT_DECL is in SSA form, we need to remap and initialize
2964 it's default_def SSA_NAME. */
2965 if (gimple_in_ssa_p (id
->src_cfun
)
2966 && is_gimple_reg (result
))
2968 temp
= make_ssa_name (temp
, NULL
);
2969 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
2971 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
2974 insert_decl_map (id
, result
, var
);
2976 /* Remember this so we can ignore it in remap_decls. */
2982 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2983 to a local label. */
2986 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
2989 tree fn
= (tree
) fnp
;
2991 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3000 /* Determine if the function can be copied. If so return NULL. If
3001 not return a string describng the reason for failure. */
3004 copy_forbidden (struct function
*fun
, tree fndecl
)
3006 const char *reason
= fun
->cannot_be_copied_reason
;
3010 /* Only examine the function once. */
3011 if (fun
->cannot_be_copied_set
)
3014 /* We cannot copy a function that receives a non-local goto
3015 because we cannot remap the destination label used in the
3016 function that is performing the non-local goto. */
3017 /* ??? Actually, this should be possible, if we work at it.
3018 No doubt there's just a handful of places that simply
3019 assume it doesn't happen and don't substitute properly. */
3020 if (fun
->has_nonlocal_label
)
3022 reason
= G_("function %q+F can never be copied "
3023 "because it receives a non-local goto");
3027 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3028 if (TREE_CODE (decl
) == VAR_DECL
3029 && TREE_STATIC (decl
)
3030 && !DECL_EXTERNAL (decl
)
3031 && DECL_INITIAL (decl
)
3032 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3033 has_label_address_in_static_1
,
3036 reason
= G_("function %q+F can never be copied because it saves "
3037 "address of local label in a static variable");
3042 fun
->cannot_be_copied_reason
= reason
;
3043 fun
->cannot_be_copied_set
= true;
3048 static const char *inline_forbidden_reason
;
3050 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3051 iff a function can not be inlined. Also sets the reason why. */
3054 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3055 struct walk_stmt_info
*wip
)
3057 tree fn
= (tree
) wip
->info
;
3059 gimple stmt
= gsi_stmt (*gsi
);
3061 switch (gimple_code (stmt
))
3064 /* Refuse to inline alloca call unless user explicitly forced so as
3065 this may change program's memory overhead drastically when the
3066 function using alloca is called in loop. In GCC present in
3067 SPEC2000 inlining into schedule_block cause it to require 2GB of
3068 RAM instead of 256MB. Don't do so for alloca calls emitted for
3069 VLA objects as those can't cause unbounded growth (they're always
3070 wrapped inside stack_save/stack_restore regions. */
3071 if (gimple_alloca_call_p (stmt
)
3072 && !gimple_call_alloca_for_var_p (stmt
)
3073 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3075 inline_forbidden_reason
3076 = G_("function %q+F can never be inlined because it uses "
3077 "alloca (override using the always_inline attribute)");
3078 *handled_ops_p
= true;
3082 t
= gimple_call_fndecl (stmt
);
3086 /* We cannot inline functions that call setjmp. */
3087 if (setjmp_call_p (t
))
3089 inline_forbidden_reason
3090 = G_("function %q+F can never be inlined because it uses setjmp");
3091 *handled_ops_p
= true;
3095 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3096 switch (DECL_FUNCTION_CODE (t
))
3098 /* We cannot inline functions that take a variable number of
3100 case BUILT_IN_VA_START
:
3101 case BUILT_IN_NEXT_ARG
:
3102 case BUILT_IN_VA_END
:
3103 inline_forbidden_reason
3104 = G_("function %q+F can never be inlined because it "
3105 "uses variable argument lists");
3106 *handled_ops_p
= true;
3109 case BUILT_IN_LONGJMP
:
3110 /* We can't inline functions that call __builtin_longjmp at
3111 all. The non-local goto machinery really requires the
3112 destination be in a different function. If we allow the
3113 function calling __builtin_longjmp to be inlined into the
3114 function calling __builtin_setjmp, Things will Go Awry. */
3115 inline_forbidden_reason
3116 = G_("function %q+F can never be inlined because "
3117 "it uses setjmp-longjmp exception handling");
3118 *handled_ops_p
= true;
3121 case BUILT_IN_NONLOCAL_GOTO
:
3123 inline_forbidden_reason
3124 = G_("function %q+F can never be inlined because "
3125 "it uses non-local goto");
3126 *handled_ops_p
= true;
3129 case BUILT_IN_RETURN
:
3130 case BUILT_IN_APPLY_ARGS
:
3131 /* If a __builtin_apply_args caller would be inlined,
3132 it would be saving arguments of the function it has
3133 been inlined into. Similarly __builtin_return would
3134 return from the function the inline has been inlined into. */
3135 inline_forbidden_reason
3136 = G_("function %q+F can never be inlined because "
3137 "it uses __builtin_return or __builtin_apply_args");
3138 *handled_ops_p
= true;
3147 t
= gimple_goto_dest (stmt
);
3149 /* We will not inline a function which uses computed goto. The
3150 addresses of its local labels, which may be tucked into
3151 global storage, are of course not constant across
3152 instantiations, which causes unexpected behavior. */
3153 if (TREE_CODE (t
) != LABEL_DECL
)
3155 inline_forbidden_reason
3156 = G_("function %q+F can never be inlined "
3157 "because it contains a computed goto");
3158 *handled_ops_p
= true;
3167 *handled_ops_p
= false;
3171 /* Return true if FNDECL is a function that cannot be inlined into
3175 inline_forbidden_p (tree fndecl
)
3177 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3178 struct walk_stmt_info wi
;
3179 struct pointer_set_t
*visited_nodes
;
3181 bool forbidden_p
= false;
3183 /* First check for shared reasons not to copy the code. */
3184 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3185 if (inline_forbidden_reason
!= NULL
)
3188 /* Next, walk the statements of the function looking for
3189 constraucts we can't handle, or are non-optimal for inlining. */
3190 visited_nodes
= pointer_set_create ();
3191 memset (&wi
, 0, sizeof (wi
));
3192 wi
.info
= (void *) fndecl
;
3193 wi
.pset
= visited_nodes
;
3195 FOR_EACH_BB_FN (bb
, fun
)
3198 gimple_seq seq
= bb_seq (bb
);
3199 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3200 forbidden_p
= (ret
!= NULL
);
3205 pointer_set_destroy (visited_nodes
);
3209 /* Return false if the function FNDECL cannot be inlined on account of its
3210 attributes, true otherwise. */
3212 function_attribute_inlinable_p (const_tree fndecl
)
3214 if (targetm
.attribute_table
)
3218 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3220 const_tree name
= TREE_PURPOSE (a
);
3223 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3224 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3225 return targetm
.function_attribute_inlinable_p (fndecl
);
3232 /* Returns nonzero if FN is a function that does not have any
3233 fundamental inline blocking properties. */
3236 tree_inlinable_function_p (tree fn
)
3238 bool inlinable
= true;
3242 /* If we've already decided this function shouldn't be inlined,
3243 there's no need to check again. */
3244 if (DECL_UNINLINABLE (fn
))
3247 /* We only warn for functions declared `inline' by the user. */
3248 do_warning
= (warn_inline
3249 && DECL_DECLARED_INLINE_P (fn
)
3250 && !DECL_NO_INLINE_WARNING_P (fn
)
3251 && !DECL_IN_SYSTEM_HEADER (fn
));
3253 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3256 && always_inline
== NULL
)
3259 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3260 "is suppressed using -fno-inline", fn
);
3264 else if (!function_attribute_inlinable_p (fn
))
3267 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3268 "uses attributes conflicting with inlining", fn
);
3272 else if (inline_forbidden_p (fn
))
3274 /* See if we should warn about uninlinable functions. Previously,
3275 some of these warnings would be issued while trying to expand
3276 the function inline, but that would cause multiple warnings
3277 about functions that would for example call alloca. But since
3278 this a property of the function, just one warning is enough.
3279 As a bonus we can now give more details about the reason why a
3280 function is not inlinable. */
3282 error (inline_forbidden_reason
, fn
);
3283 else if (do_warning
)
3284 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3289 /* Squirrel away the result so that we don't have to check again. */
3290 DECL_UNINLINABLE (fn
) = !inlinable
;
3295 /* Estimate the cost of a memory move. Use machine dependent
3296 word size and take possible memcpy call into account. */
3299 estimate_move_cost (tree type
)
3303 gcc_assert (!VOID_TYPE_P (type
));
3305 if (TREE_CODE (type
) == VECTOR_TYPE
)
3307 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3308 enum machine_mode simd
3309 = targetm
.vectorize
.preferred_simd_mode (inner
);
3310 int simd_mode_size
= GET_MODE_SIZE (simd
);
3311 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3315 size
= int_size_in_bytes (type
);
3317 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3318 /* Cost of a memcpy call, 3 arguments and the call. */
3321 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3324 /* Returns cost of operation CODE, according to WEIGHTS */
3327 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3328 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3332 /* These are "free" conversions, or their presumed cost
3333 is folded into other operations. */
3338 case VIEW_CONVERT_EXPR
:
3341 /* Assign cost of 1 to usual operations.
3342 ??? We may consider mapping RTL costs to this. */
3348 case POINTER_PLUS_EXPR
:
3351 case MULT_HIGHPART_EXPR
:
3354 case ADDR_SPACE_CONVERT_EXPR
:
3355 case FIXED_CONVERT_EXPR
:
3356 case FIX_TRUNC_EXPR
:
3368 case VEC_LSHIFT_EXPR
:
3369 case VEC_RSHIFT_EXPR
:
3376 case TRUTH_ANDIF_EXPR
:
3377 case TRUTH_ORIF_EXPR
:
3378 case TRUTH_AND_EXPR
:
3380 case TRUTH_XOR_EXPR
:
3381 case TRUTH_NOT_EXPR
:
3390 case UNORDERED_EXPR
:
3401 case PREDECREMENT_EXPR
:
3402 case PREINCREMENT_EXPR
:
3403 case POSTDECREMENT_EXPR
:
3404 case POSTINCREMENT_EXPR
:
3406 case REALIGN_LOAD_EXPR
:
3408 case REDUC_MAX_EXPR
:
3409 case REDUC_MIN_EXPR
:
3410 case REDUC_PLUS_EXPR
:
3411 case WIDEN_SUM_EXPR
:
3412 case WIDEN_MULT_EXPR
:
3414 case WIDEN_MULT_PLUS_EXPR
:
3415 case WIDEN_MULT_MINUS_EXPR
:
3416 case WIDEN_LSHIFT_EXPR
:
3418 case VEC_WIDEN_MULT_HI_EXPR
:
3419 case VEC_WIDEN_MULT_LO_EXPR
:
3420 case VEC_WIDEN_MULT_EVEN_EXPR
:
3421 case VEC_WIDEN_MULT_ODD_EXPR
:
3422 case VEC_UNPACK_HI_EXPR
:
3423 case VEC_UNPACK_LO_EXPR
:
3424 case VEC_UNPACK_FLOAT_HI_EXPR
:
3425 case VEC_UNPACK_FLOAT_LO_EXPR
:
3426 case VEC_PACK_TRUNC_EXPR
:
3427 case VEC_PACK_SAT_EXPR
:
3428 case VEC_PACK_FIX_TRUNC_EXPR
:
3429 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3430 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3434 /* Few special cases of expensive operations. This is useful
3435 to avoid inlining on functions having too many of these. */
3436 case TRUNC_DIV_EXPR
:
3438 case FLOOR_DIV_EXPR
:
3439 case ROUND_DIV_EXPR
:
3440 case EXACT_DIV_EXPR
:
3441 case TRUNC_MOD_EXPR
:
3443 case FLOOR_MOD_EXPR
:
3444 case ROUND_MOD_EXPR
:
3446 if (TREE_CODE (op2
) != INTEGER_CST
)
3447 return weights
->div_mod_cost
;
3451 /* We expect a copy assignment with no operator. */
3452 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3458 /* Estimate number of instructions that will be created by expanding
3459 the statements in the statement sequence STMTS.
3460 WEIGHTS contains weights attributed to various constructs. */
3463 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3466 gimple_stmt_iterator gsi
;
3469 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3470 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3476 /* Estimate number of instructions that will be created by expanding STMT.
3477 WEIGHTS contains weights attributed to various constructs. */
3480 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3483 enum gimple_code code
= gimple_code (stmt
);
3490 /* Try to estimate the cost of assignments. We have three cases to
3492 1) Simple assignments to registers;
3493 2) Stores to things that must live in memory. This includes
3494 "normal" stores to scalars, but also assignments of large
3495 structures, or constructors of big arrays;
3497 Let us look at the first two cases, assuming we have "a = b + C":
3498 <GIMPLE_ASSIGN <var_decl "a">
3499 <plus_expr <var_decl "b"> <constant C>>
3500 If "a" is a GIMPLE register, the assignment to it is free on almost
3501 any target, because "a" usually ends up in a real register. Hence
3502 the only cost of this expression comes from the PLUS_EXPR, and we
3503 can ignore the GIMPLE_ASSIGN.
3504 If "a" is not a GIMPLE register, the assignment to "a" will most
3505 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3506 of moving something into "a", which we compute using the function
3507 estimate_move_cost. */
3508 if (gimple_clobber_p (stmt
))
3509 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3511 lhs
= gimple_assign_lhs (stmt
);
3512 rhs
= gimple_assign_rhs1 (stmt
);
3516 /* Account for the cost of moving to / from memory. */
3517 if (gimple_store_p (stmt
))
3518 cost
+= estimate_move_cost (TREE_TYPE (lhs
));
3519 if (gimple_assign_load_p (stmt
))
3520 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3522 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3523 gimple_assign_rhs1 (stmt
),
3524 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3525 == GIMPLE_BINARY_RHS
3526 ? gimple_assign_rhs2 (stmt
) : NULL
);
3530 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3531 gimple_op (stmt
, 0),
3532 gimple_op (stmt
, 1));
3536 /* Take into account cost of the switch + guess 2 conditional jumps for
3539 TODO: once the switch expansion logic is sufficiently separated, we can
3540 do better job on estimating cost of the switch. */
3541 if (weights
->time_based
)
3542 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3544 cost
= gimple_switch_num_labels (stmt
) * 2;
3549 tree decl
= gimple_call_fndecl (stmt
);
3550 struct cgraph_node
*node
= NULL
;
3552 /* Do not special case builtins where we see the body.
3553 This just confuse inliner. */
3554 if (!decl
|| !(node
= cgraph_get_node (decl
)) || node
->analyzed
)
3556 /* For buitins that are likely expanded to nothing or
3557 inlined do not account operand costs. */
3558 else if (is_simple_builtin (decl
))
3560 else if (is_inexpensive_builtin (decl
))
3561 return weights
->target_builtin_call_cost
;
3562 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3564 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3565 specialize the cheap expansion we do here.
3566 ??? This asks for a more general solution. */
3567 switch (DECL_FUNCTION_CODE (decl
))
3572 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3573 && REAL_VALUES_EQUAL
3574 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3575 return estimate_operator_cost (MULT_EXPR
, weights
,
3576 gimple_call_arg (stmt
, 0),
3577 gimple_call_arg (stmt
, 0));
3585 cost
= node
? weights
->call_cost
: weights
->indirect_call_cost
;
3586 if (gimple_call_lhs (stmt
))
3587 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3588 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3590 tree arg
= gimple_call_arg (stmt
, i
);
3591 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3597 return weights
->return_cost
;
3603 case GIMPLE_PREDICT
:
3608 return asm_str_count (gimple_asm_string (stmt
));
3611 /* This is either going to be an external function call with one
3612 argument, or two register copy statements plus a goto. */
3615 case GIMPLE_EH_DISPATCH
:
3616 /* ??? This is going to turn into a switch statement. Ideally
3617 we'd have a look at the eh region and estimate the number of
3622 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3624 case GIMPLE_EH_FILTER
:
3625 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3628 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3631 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3632 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3634 /* OpenMP directives are generally very expensive. */
3636 case GIMPLE_OMP_RETURN
:
3637 case GIMPLE_OMP_SECTIONS_SWITCH
:
3638 case GIMPLE_OMP_ATOMIC_STORE
:
3639 case GIMPLE_OMP_CONTINUE
:
3640 /* ...except these, which are cheap. */
3643 case GIMPLE_OMP_ATOMIC_LOAD
:
3644 return weights
->omp_cost
;
3646 case GIMPLE_OMP_FOR
:
3647 return (weights
->omp_cost
3648 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3649 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3651 case GIMPLE_OMP_PARALLEL
:
3652 case GIMPLE_OMP_TASK
:
3653 case GIMPLE_OMP_CRITICAL
:
3654 case GIMPLE_OMP_MASTER
:
3655 case GIMPLE_OMP_ORDERED
:
3656 case GIMPLE_OMP_SECTION
:
3657 case GIMPLE_OMP_SECTIONS
:
3658 case GIMPLE_OMP_SINGLE
:
3659 return (weights
->omp_cost
3660 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3662 case GIMPLE_TRANSACTION
:
3663 return (weights
->tm_cost
3664 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3674 /* Estimate number of instructions that will be created by expanding
3675 function FNDECL. WEIGHTS contains weights attributed to various
3679 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3681 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3682 gimple_stmt_iterator bsi
;
3686 gcc_assert (my_function
&& my_function
->cfg
);
3687 FOR_EACH_BB_FN (bb
, my_function
)
3689 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3690 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3697 /* Initializes weights used by estimate_num_insns. */
3700 init_inline_once (void)
3702 eni_size_weights
.call_cost
= 1;
3703 eni_size_weights
.indirect_call_cost
= 3;
3704 eni_size_weights
.target_builtin_call_cost
= 1;
3705 eni_size_weights
.div_mod_cost
= 1;
3706 eni_size_weights
.omp_cost
= 40;
3707 eni_size_weights
.tm_cost
= 10;
3708 eni_size_weights
.time_based
= false;
3709 eni_size_weights
.return_cost
= 1;
3711 /* Estimating time for call is difficult, since we have no idea what the
3712 called function does. In the current uses of eni_time_weights,
3713 underestimating the cost does less harm than overestimating it, so
3714 we choose a rather small value here. */
3715 eni_time_weights
.call_cost
= 10;
3716 eni_time_weights
.indirect_call_cost
= 15;
3717 eni_time_weights
.target_builtin_call_cost
= 1;
3718 eni_time_weights
.div_mod_cost
= 10;
3719 eni_time_weights
.omp_cost
= 40;
3720 eni_time_weights
.tm_cost
= 40;
3721 eni_time_weights
.time_based
= true;
3722 eni_time_weights
.return_cost
= 2;
3725 /* Estimate the number of instructions in a gimple_seq. */
3728 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3730 gimple_stmt_iterator gsi
;
3732 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3733 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3739 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3742 prepend_lexical_block (tree current_block
, tree new_block
)
3744 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
3745 BLOCK_SUBBLOCKS (current_block
) = new_block
;
3746 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
3749 /* Add local variables from CALLEE to CALLER. */
3752 add_local_variables (struct function
*callee
, struct function
*caller
,
3758 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
3759 if (!can_be_nonlocal (var
, id
))
3761 tree new_var
= remap_decl (var
, id
);
3763 /* Remap debug-expressions. */
3764 if (TREE_CODE (new_var
) == VAR_DECL
3765 && DECL_DEBUG_EXPR_IS_FROM (new_var
)
3768 tree tem
= DECL_DEBUG_EXPR (var
);
3769 bool old_regimplify
= id
->regimplify
;
3770 id
->remapping_type_depth
++;
3771 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
3772 id
->remapping_type_depth
--;
3773 id
->regimplify
= old_regimplify
;
3774 SET_DECL_DEBUG_EXPR (new_var
, tem
);
3776 add_local_decl (caller
, new_var
);
3780 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3783 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
3787 struct pointer_map_t
*st
, *dst
;
3790 location_t saved_location
;
3791 struct cgraph_edge
*cg_edge
;
3792 cgraph_inline_failed_t reason
;
3793 basic_block return_block
;
3795 gimple_stmt_iterator gsi
, stmt_gsi
;
3796 bool successfully_inlined
= FALSE
;
3797 bool purge_dead_abnormal_edges
;
3799 /* Set input_location here so we get the right instantiation context
3800 if we call instantiate_decl from inlinable_function_p. */
3801 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
3802 saved_location
= input_location
;
3803 input_location
= gimple_location (stmt
);
3805 /* From here on, we're only interested in CALL_EXPRs. */
3806 if (gimple_code (stmt
) != GIMPLE_CALL
)
3809 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
3810 gcc_checking_assert (cg_edge
);
3811 /* First, see if we can figure out what function is being called.
3812 If we cannot, then there is no hope of inlining the function. */
3813 if (cg_edge
->indirect_unknown_callee
)
3815 fn
= cg_edge
->callee
->symbol
.decl
;
3816 gcc_checking_assert (fn
);
3818 /* If FN is a declaration of a function in a nested scope that was
3819 globally declared inline, we don't set its DECL_INITIAL.
3820 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3821 C++ front-end uses it for cdtors to refer to their internal
3822 declarations, that are not real functions. Fortunately those
3823 don't have trees to be saved, so we can tell by checking their
3825 if (!DECL_INITIAL (fn
)
3826 && DECL_ABSTRACT_ORIGIN (fn
)
3827 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
3828 fn
= DECL_ABSTRACT_ORIGIN (fn
);
3830 /* Don't try to inline functions that are not well-suited to inlining. */
3831 if (cg_edge
->inline_failed
)
3833 reason
= cg_edge
->inline_failed
;
3834 /* If this call was originally indirect, we do not want to emit any
3835 inlining related warnings or sorry messages because there are no
3836 guarantees regarding those. */
3837 if (cg_edge
->indirect_inlining_edge
)
3840 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
3841 /* For extern inline functions that get redefined we always
3842 silently ignored always_inline flag. Better behaviour would
3843 be to be able to keep both bodies and use extern inline body
3844 for inlining, but we can't do that because frontends overwrite
3846 && !cg_edge
->callee
->local
.redefined_extern_inline
3847 /* Avoid warnings during early inline pass. */
3848 && cgraph_global_info_ready
3849 /* PR 20090218-1_0.c. Body can be provided by another module. */
3850 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
3852 error ("inlining failed in call to always_inline %q+F: %s", fn
,
3853 cgraph_inline_failed_string (reason
));
3854 error ("called from here");
3856 else if (warn_inline
3857 && DECL_DECLARED_INLINE_P (fn
)
3858 && !DECL_NO_INLINE_WARNING_P (fn
)
3859 && !DECL_IN_SYSTEM_HEADER (fn
)
3860 && reason
!= CIF_UNSPECIFIED
3861 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
3862 /* Do not warn about not inlined recursive calls. */
3863 && !cgraph_edge_recursive_p (cg_edge
)
3864 /* Avoid warnings during early inline pass. */
3865 && cgraph_global_info_ready
)
3867 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
3868 fn
, _(cgraph_inline_failed_string (reason
)));
3869 warning (OPT_Winline
, "called from here");
3873 fn
= cg_edge
->callee
->symbol
.decl
;
3875 #ifdef ENABLE_CHECKING
3876 if (cg_edge
->callee
->symbol
.decl
!= id
->dst_node
->symbol
.decl
)
3877 verify_cgraph_node (cg_edge
->callee
);
3880 /* We will be inlining this callee. */
3881 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
3883 /* Update the callers EH personality. */
3884 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
))
3885 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->symbol
.decl
)
3886 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
);
3888 /* Split the block holding the GIMPLE_CALL. */
3889 e
= split_block (bb
, stmt
);
3891 return_block
= e
->dest
;
3894 /* split_block splits after the statement; work around this by
3895 moving the call into the second block manually. Not pretty,
3896 but seems easier than doing the CFG manipulation by hand
3897 when the GIMPLE_CALL is in the last statement of BB. */
3898 stmt_gsi
= gsi_last_bb (bb
);
3899 gsi_remove (&stmt_gsi
, false);
3901 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3902 been the source of abnormal edges. In this case, schedule
3903 the removal of dead abnormal edges. */
3904 gsi
= gsi_start_bb (return_block
);
3905 if (gsi_end_p (gsi
))
3907 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
3908 purge_dead_abnormal_edges
= true;
3912 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
3913 purge_dead_abnormal_edges
= false;
3916 stmt_gsi
= gsi_start_bb (return_block
);
3918 /* Build a block containing code to initialize the arguments, the
3919 actual inline expansion of the body, and a label for the return
3920 statements within the function to jump to. The type of the
3921 statement expression is the return type of the function call.
3922 ??? If the call does not have an associated block then we will
3923 remap all callee blocks to NULL, effectively dropping most of
3924 its debug information. This should only happen for calls to
3925 artificial decls inserted by the compiler itself. We need to
3926 either link the inlined blocks into the caller block tree or
3927 not refer to them in any way to not break GC for locations. */
3928 if (gimple_block (stmt
))
3930 id
->block
= make_node (BLOCK
);
3931 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
3932 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
3933 prepend_lexical_block (gimple_block (stmt
), id
->block
);
3936 /* Local declarations will be replaced by their equivalents in this
3939 id
->decl_map
= pointer_map_create ();
3940 dst
= id
->debug_map
;
3941 id
->debug_map
= NULL
;
3943 /* Record the function we are about to inline. */
3945 id
->src_node
= cg_edge
->callee
;
3946 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
3947 id
->gimple_call
= stmt
;
3949 gcc_assert (!id
->src_cfun
->after_inlining
);
3952 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
3954 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3955 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
3959 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
3961 if (DECL_INITIAL (fn
))
3963 if (gimple_block (stmt
))
3967 prepend_lexical_block (id
->block
,
3968 remap_blocks (DECL_INITIAL (fn
), id
));
3969 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
3970 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
3972 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
3973 otherwise for DWARF DW_TAG_formal_parameter will not be children of
3974 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
3975 under it. The parameters can be then evaluated in the debugger,
3976 but don't show in backtraces. */
3977 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
3978 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
3981 *var
= TREE_CHAIN (v
);
3982 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
3983 BLOCK_VARS (id
->block
) = v
;
3986 var
= &TREE_CHAIN (*var
);
3989 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
3992 /* Return statements in the function body will be replaced by jumps
3993 to the RET_LABEL. */
3994 gcc_assert (DECL_INITIAL (fn
));
3995 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
3997 /* Find the LHS to which the result of this call is assigned. */
3999 if (gimple_call_lhs (stmt
))
4001 modify_dest
= gimple_call_lhs (stmt
);
4003 /* The function which we are inlining might not return a value,
4004 in which case we should issue a warning that the function
4005 does not return a value. In that case the optimizers will
4006 see that the variable to which the value is assigned was not
4007 initialized. We do not want to issue a warning about that
4008 uninitialized variable. */
4009 if (DECL_P (modify_dest
))
4010 TREE_NO_WARNING (modify_dest
) = 1;
4012 if (gimple_call_return_slot_opt_p (stmt
))
4014 return_slot
= modify_dest
;
4021 /* If we are inlining a call to the C++ operator new, we don't want
4022 to use type based alias analysis on the return value. Otherwise
4023 we may get confused if the compiler sees that the inlined new
4024 function returns a pointer which was just deleted. See bug
4026 if (DECL_IS_OPERATOR_NEW (fn
))
4032 /* Declare the return variable for the function. */
4033 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4035 /* Add local vars in this inlined callee to caller. */
4036 add_local_variables (id
->src_cfun
, cfun
, id
);
4038 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4040 fprintf (dump_file
, "Inlining ");
4041 print_generic_expr (dump_file
, id
->src_fn
, 0);
4042 fprintf (dump_file
, " to ");
4043 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4044 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4047 /* This is it. Duplicate the callee body. Assume callee is
4048 pre-gimplified. Note that we must not alter the caller
4049 function in any way before this point, as this CALL_EXPR may be
4050 a self-referential call; if we're calling ourselves, we need to
4051 duplicate our body before altering anything. */
4052 copy_body (id
, bb
->count
,
4053 cg_edge
->frequency
* REG_BR_PROB_BASE
/ CGRAPH_FREQ_BASE
,
4054 bb
, return_block
, NULL
, NULL
);
4056 /* Reset the escaped solution. */
4057 if (cfun
->gimple_df
)
4058 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4063 pointer_map_destroy (id
->debug_map
);
4064 id
->debug_map
= dst
;
4066 pointer_map_destroy (id
->decl_map
);
4069 /* Unlink the calls virtual operands before replacing it. */
4070 unlink_stmt_vdef (stmt
);
4072 /* If the inlined function returns a result that we care about,
4073 substitute the GIMPLE_CALL with an assignment of the return
4074 variable to the LHS of the call. That is, if STMT was
4075 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4076 if (use_retvar
&& gimple_call_lhs (stmt
))
4078 gimple old_stmt
= stmt
;
4079 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4080 gsi_replace (&stmt_gsi
, stmt
, false);
4081 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4085 /* Handle the case of inlining a function with no return
4086 statement, which causes the return value to become undefined. */
4087 if (gimple_call_lhs (stmt
)
4088 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4090 tree name
= gimple_call_lhs (stmt
);
4091 tree var
= SSA_NAME_VAR (name
);
4092 tree def
= ssa_default_def (cfun
, var
);
4096 /* If the variable is used undefined, make this name
4097 undefined via a move. */
4098 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4099 gsi_replace (&stmt_gsi
, stmt
, true);
4103 /* Otherwise make this variable undefined. */
4104 gsi_remove (&stmt_gsi
, true);
4105 set_ssa_default_def (cfun
, var
, name
);
4106 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4110 gsi_remove (&stmt_gsi
, true);
4113 if (purge_dead_abnormal_edges
)
4115 gimple_purge_dead_eh_edges (return_block
);
4116 gimple_purge_dead_abnormal_call_edges (return_block
);
4119 /* If the value of the new expression is ignored, that's OK. We
4120 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4121 the equivalent inlined version either. */
4122 if (is_gimple_assign (stmt
))
4124 gcc_assert (gimple_assign_single_p (stmt
)
4125 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4126 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4129 /* Output the inlining info for this abstract function, since it has been
4130 inlined. If we don't do this now, we can lose the information about the
4131 variables in the function when the blocks get blown away as soon as we
4132 remove the cgraph node. */
4133 if (gimple_block (stmt
))
4134 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->symbol
.decl
);
4136 /* Update callgraph if needed. */
4137 cgraph_remove_node (cg_edge
->callee
);
4139 id
->block
= NULL_TREE
;
4140 successfully_inlined
= TRUE
;
4143 input_location
= saved_location
;
4144 return successfully_inlined
;
4147 /* Expand call statements reachable from STMT_P.
4148 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4149 in a MODIFY_EXPR. */
4152 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4154 gimple_stmt_iterator gsi
;
4156 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4158 gimple stmt
= gsi_stmt (gsi
);
4160 if (is_gimple_call (stmt
)
4161 && expand_call_inline (bb
, stmt
, id
))
4169 /* Walk all basic blocks created after FIRST and try to fold every statement
4170 in the STATEMENTS pointer set. */
4173 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4175 for (; first
< n_basic_blocks
; first
++)
4176 if (BASIC_BLOCK (first
))
4178 gimple_stmt_iterator gsi
;
4180 for (gsi
= gsi_start_bb (BASIC_BLOCK (first
));
4183 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4185 gimple old_stmt
= gsi_stmt (gsi
);
4186 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4188 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4190 /* Folding builtins can create multiple instructions,
4191 we need to look at all of them. */
4192 gimple_stmt_iterator i2
= gsi
;
4194 if (fold_stmt (&gsi
))
4197 /* If a builtin at the end of a bb folded into nothing,
4198 the following loop won't work. */
4199 if (gsi_end_p (gsi
))
4201 cgraph_update_edges_for_call_stmt (old_stmt
,
4206 i2
= gsi_start_bb (BASIC_BLOCK (first
));
4211 new_stmt
= gsi_stmt (i2
);
4212 update_stmt (new_stmt
);
4213 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4216 if (new_stmt
== gsi_stmt (gsi
))
4218 /* It is okay to check only for the very last
4219 of these statements. If it is a throwing
4220 statement nothing will change. If it isn't
4221 this can remove EH edges. If that weren't
4222 correct then because some intermediate stmts
4223 throw, but not the last one. That would mean
4224 we'd have to split the block, which we can't
4225 here and we'd loose anyway. And as builtins
4226 probably never throw, this all
4228 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4230 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4237 else if (fold_stmt (&gsi
))
4239 /* Re-read the statement from GSI as fold_stmt() may
4241 gimple new_stmt
= gsi_stmt (gsi
);
4242 update_stmt (new_stmt
);
4244 if (is_gimple_call (old_stmt
)
4245 || is_gimple_call (new_stmt
))
4246 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4249 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4250 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4256 /* Return true if BB has at least one abnormal outgoing edge. */
4259 has_abnormal_outgoing_edge_p (basic_block bb
)
4264 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4265 if (e
->flags
& EDGE_ABNORMAL
)
4271 /* Expand calls to inline functions in the body of FN. */
4274 optimize_inline_calls (tree fn
)
4278 int last
= n_basic_blocks
;
4279 struct gimplify_ctx gctx
;
4280 bool inlined_p
= false;
4283 memset (&id
, 0, sizeof (id
));
4285 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4286 gcc_assert (id
.dst_node
->analyzed
);
4288 /* Or any functions that aren't finished yet. */
4289 if (current_function_decl
)
4290 id
.dst_fn
= current_function_decl
;
4292 id
.copy_decl
= copy_decl_maybe_to_var
;
4293 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4294 id
.transform_new_cfg
= false;
4295 id
.transform_return_to_modify
= true;
4296 id
.transform_lang_insert_block
= NULL
;
4297 id
.statements_to_fold
= pointer_set_create ();
4299 push_gimplify_context (&gctx
);
4301 /* We make no attempts to keep dominance info up-to-date. */
4302 free_dominance_info (CDI_DOMINATORS
);
4303 free_dominance_info (CDI_POST_DOMINATORS
);
4305 /* Register specific gimple functions. */
4306 gimple_register_cfg_hooks ();
4308 /* Reach the trees by walking over the CFG, and note the
4309 enclosing basic-blocks in the call edges. */
4310 /* We walk the blocks going forward, because inlined function bodies
4311 will split id->current_basic_block, and the new blocks will
4312 follow it; we'll trudge through them, processing their CALL_EXPRs
4315 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4317 pop_gimplify_context (NULL
);
4319 #ifdef ENABLE_CHECKING
4321 struct cgraph_edge
*e
;
4323 verify_cgraph_node (id
.dst_node
);
4325 /* Double check that we inlined everything we are supposed to inline. */
4326 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4327 gcc_assert (e
->inline_failed
);
4331 /* Fold queued statements. */
4332 fold_marked_statements (last
, id
.statements_to_fold
);
4333 pointer_set_destroy (id
.statements_to_fold
);
4335 gcc_assert (!id
.debug_stmts
.exists ());
4337 /* If we didn't inline into the function there is nothing to do. */
4341 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4344 delete_unreachable_blocks_update_callgraph (&id
);
4345 #ifdef ENABLE_CHECKING
4346 verify_cgraph_node (id
.dst_node
);
4349 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4350 not possible yet - the IPA passes might make various functions to not
4351 throw and they don't care to proactively update local EH info. This is
4352 done later in fixup_cfg pass that also execute the verification. */
4353 return (TODO_update_ssa
4355 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4356 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4357 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
4360 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4363 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4365 enum tree_code code
= TREE_CODE (*tp
);
4366 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4368 /* We make copies of most nodes. */
4369 if (IS_EXPR_CODE_CLASS (cl
)
4370 || code
== TREE_LIST
4372 || code
== TYPE_DECL
4373 || code
== OMP_CLAUSE
)
4375 /* Because the chain gets clobbered when we make a copy, we save it
4377 tree chain
= NULL_TREE
, new_tree
;
4379 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4380 chain
= TREE_CHAIN (*tp
);
4382 /* Copy the node. */
4383 new_tree
= copy_node (*tp
);
4385 /* Propagate mudflap marked-ness. */
4386 if (flag_mudflap
&& mf_marked_p (*tp
))
4391 /* Now, restore the chain, if appropriate. That will cause
4392 walk_tree to walk into the chain as well. */
4393 if (code
== PARM_DECL
4394 || code
== TREE_LIST
4395 || code
== OMP_CLAUSE
)
4396 TREE_CHAIN (*tp
) = chain
;
4398 /* For now, we don't update BLOCKs when we make copies. So, we
4399 have to nullify all BIND_EXPRs. */
4400 if (TREE_CODE (*tp
) == BIND_EXPR
)
4401 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4403 else if (code
== CONSTRUCTOR
)
4405 /* CONSTRUCTOR nodes need special handling because
4406 we need to duplicate the vector of elements. */
4409 new_tree
= copy_node (*tp
);
4411 /* Propagate mudflap marked-ness. */
4412 if (flag_mudflap
&& mf_marked_p (*tp
))
4415 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
4418 else if (code
== STATEMENT_LIST
)
4419 /* We used to just abort on STATEMENT_LIST, but we can run into them
4420 with statement-expressions (c++/40975). */
4421 copy_statement_list (tp
);
4422 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4424 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4426 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4431 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4432 information indicating to what new SAVE_EXPR this one should be mapped,
4433 use that one. Otherwise, create a new node and enter it in ST. FN is
4434 the function into which the copy will be placed. */
4437 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4439 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4443 /* See if we already encountered this SAVE_EXPR. */
4444 n
= (tree
*) pointer_map_contains (st
, *tp
);
4446 /* If we didn't already remap this SAVE_EXPR, do so now. */
4449 t
= copy_node (*tp
);
4451 /* Remember this SAVE_EXPR. */
4452 *pointer_map_insert (st
, *tp
) = t
;
4453 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4454 *pointer_map_insert (st
, t
) = t
;
4458 /* We've already walked into this SAVE_EXPR; don't do it again. */
4463 /* Replace this SAVE_EXPR with the copy. */
4467 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4468 copies the declaration and enters it in the splay_tree in DATA (which is
4469 really an `copy_body_data *'). */
4472 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
4475 copy_body_data
*id
= (copy_body_data
*) data
;
4477 /* Don't walk into types. */
4481 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
4483 tree decl
= TREE_OPERAND (*tp
, 0);
4485 /* Copy the decl and remember the copy. */
4486 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4492 /* Perform any modifications to EXPR required when it is unsaved. Does
4493 not recurse into EXPR's subtrees. */
4496 unsave_expr_1 (tree expr
)
4498 switch (TREE_CODE (expr
))
4501 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4502 It's OK for this to happen if it was part of a subtree that
4503 isn't immediately expanded, such as operand 2 of another
4505 if (TREE_OPERAND (expr
, 1))
4508 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4509 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4517 /* Called via walk_tree when an expression is unsaved. Using the
4518 splay_tree pointed to by ST (which is really a `splay_tree'),
4519 remaps all local declarations to appropriate replacements. */
4522 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
4524 copy_body_data
*id
= (copy_body_data
*) data
;
4525 struct pointer_map_t
*st
= id
->decl_map
;
4528 /* Only a local declaration (variable or label). */
4529 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
4530 || TREE_CODE (*tp
) == LABEL_DECL
)
4532 /* Lookup the declaration. */
4533 n
= (tree
*) pointer_map_contains (st
, *tp
);
4535 /* If it's there, remap it. */
4540 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
4542 else if (TREE_CODE (*tp
) == BIND_EXPR
)
4543 copy_bind_expr (tp
, walk_subtrees
, id
);
4544 else if (TREE_CODE (*tp
) == SAVE_EXPR
4545 || TREE_CODE (*tp
) == TARGET_EXPR
)
4546 remap_save_expr (tp
, st
, walk_subtrees
);
4549 copy_tree_r (tp
, walk_subtrees
, NULL
);
4551 /* Do whatever unsaving is required. */
4552 unsave_expr_1 (*tp
);
4555 /* Keep iterating. */
4559 /* Copies everything in EXPR and replaces variables, labels
4560 and SAVE_EXPRs local to EXPR. */
4563 unsave_expr_now (tree expr
)
4567 /* There's nothing to do for NULL_TREE. */
4572 memset (&id
, 0, sizeof (id
));
4573 id
.src_fn
= current_function_decl
;
4574 id
.dst_fn
= current_function_decl
;
4575 id
.decl_map
= pointer_map_create ();
4576 id
.debug_map
= NULL
;
4578 id
.copy_decl
= copy_decl_no_change
;
4579 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4580 id
.transform_new_cfg
= false;
4581 id
.transform_return_to_modify
= false;
4582 id
.transform_lang_insert_block
= NULL
;
4584 /* Walk the tree once to find local labels. */
4585 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
4587 /* Walk the tree again, copying, remapping, and unsaving. */
4588 walk_tree (&expr
, unsave_r
, &id
, NULL
);
4591 pointer_map_destroy (id
.decl_map
);
4593 pointer_map_destroy (id
.debug_map
);
4598 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4599 label, copies the declaration and enters it in the splay_tree in DATA (which
4600 is really a 'copy_body_data *'. */
4603 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4604 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4605 struct walk_stmt_info
*wi
)
4607 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4608 gimple stmt
= gsi_stmt (*gsip
);
4610 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4612 tree decl
= gimple_label_label (stmt
);
4614 /* Copy the decl and remember the copy. */
4615 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4622 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4623 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4624 remaps all local declarations to appropriate replacements in gimple
4628 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4630 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4631 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4632 struct pointer_map_t
*st
= id
->decl_map
;
4636 /* Only a local declaration (variable or label). */
4637 if ((TREE_CODE (expr
) == VAR_DECL
4638 && !TREE_STATIC (expr
))
4639 || TREE_CODE (expr
) == LABEL_DECL
)
4641 /* Lookup the declaration. */
4642 n
= (tree
*) pointer_map_contains (st
, expr
);
4644 /* If it's there, remap it. */
4649 else if (TREE_CODE (expr
) == STATEMENT_LIST
4650 || TREE_CODE (expr
) == BIND_EXPR
4651 || TREE_CODE (expr
) == SAVE_EXPR
)
4653 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4655 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4656 It's OK for this to happen if it was part of a subtree that
4657 isn't immediately expanded, such as operand 2 of another
4659 if (!TREE_OPERAND (expr
, 1))
4661 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4662 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4666 /* Keep iterating. */
4671 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4672 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4673 remaps all local declarations to appropriate replacements in gimple
4677 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4678 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4679 struct walk_stmt_info
*wi
)
4681 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4682 gimple stmt
= gsi_stmt (*gsip
);
4684 if (gimple_code (stmt
) == GIMPLE_BIND
)
4686 tree block
= gimple_bind_block (stmt
);
4690 remap_block (&block
, id
);
4691 gimple_bind_set_block (stmt
, block
);
4694 /* This will remap a lot of the same decls again, but this should be
4696 if (gimple_bind_vars (stmt
))
4697 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
4701 /* Keep iterating. */
4706 /* Copies everything in SEQ and replaces variables and labels local to
4707 current_function_decl. */
4710 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4713 struct walk_stmt_info wi
;
4714 struct pointer_set_t
*visited
;
4717 /* There's nothing to do for NULL_TREE. */
4722 memset (&id
, 0, sizeof (id
));
4723 id
.src_fn
= current_function_decl
;
4724 id
.dst_fn
= current_function_decl
;
4725 id
.decl_map
= pointer_map_create ();
4726 id
.debug_map
= NULL
;
4728 id
.copy_decl
= copy_decl_no_change
;
4729 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4730 id
.transform_new_cfg
= false;
4731 id
.transform_return_to_modify
= false;
4732 id
.transform_lang_insert_block
= NULL
;
4734 /* Walk the tree once to find local labels. */
4735 memset (&wi
, 0, sizeof (wi
));
4736 visited
= pointer_set_create ();
4739 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4740 pointer_set_destroy (visited
);
4742 copy
= gimple_seq_copy (seq
);
4744 /* Walk the copy, remapping decls. */
4745 memset (&wi
, 0, sizeof (wi
));
4747 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4750 pointer_map_destroy (id
.decl_map
);
4752 pointer_map_destroy (id
.debug_map
);
4758 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4761 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4770 debug_find_tree (tree top
, tree search
)
4772 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4776 /* Declare the variables created by the inliner. Add all the variables in
4777 VARS to BIND_EXPR. */
4780 declare_inline_vars (tree block
, tree vars
)
4783 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4785 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4786 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4787 add_local_decl (cfun
, t
);
4791 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4794 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4795 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4796 VAR_DECL translation. */
4799 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4801 /* Don't generate debug information for the copy if we wouldn't have
4802 generated it for the copy either. */
4803 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4804 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4806 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4807 declaration inspired this copy. */
4808 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4810 /* The new variable/label has no RTL, yet. */
4811 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4812 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4813 SET_DECL_RTL (copy
, 0);
4815 /* These args would always appear unused, if not for this. */
4816 TREE_USED (copy
) = 1;
4818 /* Set the context for the new declaration. */
4819 if (!DECL_CONTEXT (decl
))
4820 /* Globals stay global. */
4822 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4823 /* Things that weren't in the scope of the function we're inlining
4824 from aren't in the scope we're inlining to, either. */
4826 else if (TREE_STATIC (decl
))
4827 /* Function-scoped static variables should stay in the original
4831 /* Ordinary automatic local variables are now in the scope of the
4833 DECL_CONTEXT (copy
) = id
->dst_fn
;
4839 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4843 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4844 || TREE_CODE (decl
) == RESULT_DECL
);
4846 type
= TREE_TYPE (decl
);
4848 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4849 VAR_DECL
, DECL_NAME (decl
), type
);
4850 if (DECL_PT_UID_SET_P (decl
))
4851 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4852 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4853 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4854 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4855 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4857 return copy_decl_for_dup_finish (id
, decl
, copy
);
4860 /* Like copy_decl_to_var, but create a return slot object instead of a
4861 pointer variable for return by invisible reference. */
4864 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4868 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4869 || TREE_CODE (decl
) == RESULT_DECL
);
4871 type
= TREE_TYPE (decl
);
4872 if (DECL_BY_REFERENCE (decl
))
4873 type
= TREE_TYPE (type
);
4875 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4876 VAR_DECL
, DECL_NAME (decl
), type
);
4877 if (DECL_PT_UID_SET_P (decl
))
4878 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4879 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4880 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4881 if (!DECL_BY_REFERENCE (decl
))
4883 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4884 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4887 return copy_decl_for_dup_finish (id
, decl
, copy
);
4891 copy_decl_no_change (tree decl
, copy_body_data
*id
)
4895 copy
= copy_node (decl
);
4897 /* The COPY is not abstract; it will be generated in DST_FN. */
4898 DECL_ABSTRACT (copy
) = 0;
4899 lang_hooks
.dup_lang_specific_decl (copy
);
4901 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4902 been taken; it's for internal bookkeeping in expand_goto_internal. */
4903 if (TREE_CODE (copy
) == LABEL_DECL
)
4905 TREE_ADDRESSABLE (copy
) = 0;
4906 LABEL_DECL_UID (copy
) = -1;
4909 return copy_decl_for_dup_finish (id
, decl
, copy
);
4913 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
4915 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
4916 return copy_decl_to_var (decl
, id
);
4918 return copy_decl_no_change (decl
, id
);
4921 /* Return a copy of the function's argument tree. */
4923 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
4924 bitmap args_to_skip
, tree
*vars
)
4927 tree new_parm
= NULL
;
4932 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
4933 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
4935 tree new_tree
= remap_decl (arg
, id
);
4936 if (TREE_CODE (new_tree
) != PARM_DECL
)
4937 new_tree
= id
->copy_decl (arg
, id
);
4938 lang_hooks
.dup_lang_specific_decl (new_tree
);
4940 parg
= &DECL_CHAIN (new_tree
);
4942 else if (!pointer_map_contains (id
->decl_map
, arg
))
4944 /* Make an equivalent VAR_DECL. If the argument was used
4945 as temporary variable later in function, the uses will be
4946 replaced by local variable. */
4947 tree var
= copy_decl_to_var (arg
, id
);
4948 insert_decl_map (id
, arg
, var
);
4949 /* Declare this new variable. */
4950 DECL_CHAIN (var
) = *vars
;
4956 /* Return a copy of the function's static chain. */
4958 copy_static_chain (tree static_chain
, copy_body_data
* id
)
4960 tree
*chain_copy
, *pvar
;
4962 chain_copy
= &static_chain
;
4963 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
4965 tree new_tree
= remap_decl (*pvar
, id
);
4966 lang_hooks
.dup_lang_specific_decl (new_tree
);
4967 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
4970 return static_chain
;
4973 /* Return true if the function is allowed to be versioned.
4974 This is a guard for the versioning functionality. */
4977 tree_versionable_function_p (tree fndecl
)
4979 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
4980 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
4983 /* Delete all unreachable basic blocks and update callgraph.
4984 Doing so is somewhat nontrivial because we need to update all clones and
4985 remove inline function that become unreachable. */
4988 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
4990 bool changed
= false;
4991 basic_block b
, next_bb
;
4993 find_unreachable_blocks ();
4995 /* Delete all unreachable basic blocks. */
4997 for (b
= ENTRY_BLOCK_PTR
->next_bb
; b
!= EXIT_BLOCK_PTR
; b
= next_bb
)
4999 next_bb
= b
->next_bb
;
5001 if (!(b
->flags
& BB_REACHABLE
))
5003 gimple_stmt_iterator bsi
;
5005 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5006 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
)
5008 struct cgraph_edge
*e
;
5009 struct cgraph_node
*node
;
5011 if ((e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
5013 if (!e
->inline_failed
)
5014 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5016 cgraph_remove_edge (e
);
5018 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5019 && id
->dst_node
->clones
)
5020 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5022 if ((e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
5024 if (!e
->inline_failed
)
5025 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5027 cgraph_remove_edge (e
);
5031 node
= node
->clones
;
5032 else if (node
->next_sibling_clone
)
5033 node
= node
->next_sibling_clone
;
5036 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5037 node
= node
->clone_of
;
5038 if (node
!= id
->dst_node
)
5039 node
= node
->next_sibling_clone
;
5043 delete_basic_block (b
);
5051 /* Update clone info after duplication. */
5054 update_clone_info (copy_body_data
* id
)
5056 struct cgraph_node
*node
;
5057 if (!id
->dst_node
->clones
)
5059 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5061 /* First update replace maps to match the new body. */
5062 if (node
->clone
.tree_map
)
5065 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5067 struct ipa_replace_map
*replace_info
;
5068 replace_info
= (*node
->clone
.tree_map
)[i
];
5069 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5070 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5074 node
= node
->clones
;
5075 else if (node
->next_sibling_clone
)
5076 node
= node
->next_sibling_clone
;
5079 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5080 node
= node
->clone_of
;
5081 if (node
!= id
->dst_node
)
5082 node
= node
->next_sibling_clone
;
5087 /* Create a copy of a function's tree.
5088 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5089 of the original function and the new copied function
5090 respectively. In case we want to replace a DECL
5091 tree with another tree while duplicating the function's
5092 body, TREE_MAP represents the mapping between these
5093 trees. If UPDATE_CLONES is set, the call_stmt fields
5094 of edges of clones of the function will be updated.
5096 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5098 If SKIP_RETURN is true, the new version will return void.
5099 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5100 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5103 tree_function_versioning (tree old_decl
, tree new_decl
,
5104 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
5105 bool update_clones
, bitmap args_to_skip
,
5106 bool skip_return
, bitmap blocks_to_copy
,
5107 basic_block new_entry
)
5109 struct cgraph_node
*old_version_node
;
5110 struct cgraph_node
*new_version_node
;
5114 struct ipa_replace_map
*replace_info
;
5115 basic_block old_entry_block
, bb
;
5116 vec
<gimple
> init_stmts
;
5117 init_stmts
.create (10);
5118 tree vars
= NULL_TREE
;
5120 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5121 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5122 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5124 old_version_node
= cgraph_get_node (old_decl
);
5125 gcc_checking_assert (old_version_node
);
5126 new_version_node
= cgraph_get_node (new_decl
);
5127 gcc_checking_assert (new_version_node
);
5129 /* Copy over debug args. */
5130 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5132 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5133 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5134 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5135 old_debug_args
= decl_debug_args_lookup (old_decl
);
5138 new_debug_args
= decl_debug_args_insert (new_decl
);
5139 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5143 /* Output the inlining info for this abstract function, since it has been
5144 inlined. If we don't do this now, we can lose the information about the
5145 variables in the function when the blocks get blown away as soon as we
5146 remove the cgraph node. */
5147 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5149 DECL_ARTIFICIAL (new_decl
) = 1;
5150 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5151 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5153 /* Prepare the data structures for the tree copy. */
5154 memset (&id
, 0, sizeof (id
));
5156 /* Generate a new name for the new version. */
5157 id
.statements_to_fold
= pointer_set_create ();
5159 id
.decl_map
= pointer_map_create ();
5160 id
.debug_map
= NULL
;
5161 id
.src_fn
= old_decl
;
5162 id
.dst_fn
= new_decl
;
5163 id
.src_node
= old_version_node
;
5164 id
.dst_node
= new_version_node
;
5165 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5166 if (id
.src_node
->ipa_transforms_to_apply
.exists ())
5168 vec
<ipa_opt_pass
> old_transforms_to_apply
5169 = id
.dst_node
->ipa_transforms_to_apply
;
5172 id
.dst_node
->ipa_transforms_to_apply
5173 = id
.src_node
->ipa_transforms_to_apply
.copy ();
5174 for (i
= 0; i
< old_transforms_to_apply
.length (); i
++)
5175 id
.dst_node
->ipa_transforms_to_apply
.safe_push (old_transforms_to_apply
[i
]);
5176 old_transforms_to_apply
.release ();
5179 id
.copy_decl
= copy_decl_no_change
;
5180 id
.transform_call_graph_edges
5181 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5182 id
.transform_new_cfg
= true;
5183 id
.transform_return_to_modify
= false;
5184 id
.transform_lang_insert_block
= NULL
;
5186 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION
5187 (DECL_STRUCT_FUNCTION (old_decl
));
5188 initialize_cfun (new_decl
, old_decl
,
5189 old_entry_block
->count
);
5190 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5191 = id
.src_cfun
->gimple_df
->ipa_pta
;
5193 /* Copy the function's static chain. */
5194 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5196 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5197 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5200 /* If there's a tree_map, prepare for substitution. */
5202 for (i
= 0; i
< tree_map
->length (); i
++)
5205 replace_info
= (*tree_map
)[i
];
5206 if (replace_info
->replace_p
)
5208 if (!replace_info
->old_tree
)
5210 int i
= replace_info
->parm_num
;
5212 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5214 replace_info
->old_tree
= parm
;
5216 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5217 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5218 replace_info
->new_tree
, id
.src_fn
,
5222 init_stmts
.safe_push (init
);
5225 /* Copy the function's arguments. */
5226 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5227 DECL_ARGUMENTS (new_decl
) =
5228 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5229 args_to_skip
, &vars
);
5231 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5232 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5234 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5236 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5237 /* Add local vars. */
5238 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5240 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5242 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5244 DECL_RESULT (new_decl
)
5245 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5246 RESULT_DECL
, NULL_TREE
, void_type_node
);
5247 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5248 cfun
->returns_struct
= 0;
5249 cfun
->returns_pcc_struct
= 0;
5254 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5255 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5256 if (gimple_in_ssa_p (id
.src_cfun
)
5257 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5258 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5260 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5261 insert_decl_map (&id
, old_name
, new_name
);
5262 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5263 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5267 /* Copy the Function's body. */
5268 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5269 ENTRY_BLOCK_PTR
, EXIT_BLOCK_PTR
, blocks_to_copy
, new_entry
);
5271 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5272 number_blocks (new_decl
);
5274 /* We want to create the BB unconditionally, so that the addition of
5275 debug stmts doesn't affect BB count, which may in the end cause
5276 codegen differences. */
5277 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR
));
5278 while (init_stmts
.length ())
5279 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5280 update_clone_info (&id
);
5282 /* Remap the nonlocal_goto_save_area, if any. */
5283 if (cfun
->nonlocal_goto_save_area
)
5285 struct walk_stmt_info wi
;
5287 memset (&wi
, 0, sizeof (wi
));
5289 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5293 pointer_map_destroy (id
.decl_map
);
5295 pointer_map_destroy (id
.debug_map
);
5296 free_dominance_info (CDI_DOMINATORS
);
5297 free_dominance_info (CDI_POST_DOMINATORS
);
5299 fold_marked_statements (0, id
.statements_to_fold
);
5300 pointer_set_destroy (id
.statements_to_fold
);
5301 fold_cond_expr_cond ();
5302 delete_unreachable_blocks_update_callgraph (&id
);
5303 if (id
.dst_node
->analyzed
)
5304 cgraph_rebuild_references ();
5305 update_ssa (TODO_update_ssa
);
5307 /* After partial cloning we need to rescale frequencies, so they are
5308 within proper range in the cloned function. */
5311 struct cgraph_edge
*e
;
5312 rebuild_frequencies ();
5314 new_version_node
->count
= ENTRY_BLOCK_PTR
->count
;
5315 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5317 basic_block bb
= gimple_bb (e
->call_stmt
);
5318 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5320 e
->count
= bb
->count
;
5322 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5324 basic_block bb
= gimple_bb (e
->call_stmt
);
5325 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5327 e
->count
= bb
->count
;
5331 free_dominance_info (CDI_DOMINATORS
);
5332 free_dominance_info (CDI_POST_DOMINATORS
);
5334 gcc_assert (!id
.debug_stmts
.exists ());
5335 init_stmts
.release ();
5340 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5341 the callee and return the inlined body on success. */
5344 maybe_inline_call_in_expr (tree exp
)
5346 tree fn
= get_callee_fndecl (exp
);
5348 /* We can only try to inline "const" functions. */
5349 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5351 struct pointer_map_t
*decl_map
= pointer_map_create ();
5352 call_expr_arg_iterator iter
;
5356 /* Remap the parameters. */
5357 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5359 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5360 *pointer_map_insert (decl_map
, param
) = arg
;
5362 memset (&id
, 0, sizeof (id
));
5364 id
.dst_fn
= current_function_decl
;
5365 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5366 id
.decl_map
= decl_map
;
5368 id
.copy_decl
= copy_decl_no_change
;
5369 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5370 id
.transform_new_cfg
= false;
5371 id
.transform_return_to_modify
= true;
5372 id
.transform_lang_insert_block
= NULL
;
5374 /* Make sure not to unshare trees behind the front-end's back
5375 since front-end specific mechanisms may rely on sharing. */
5376 id
.regimplify
= false;
5377 id
.do_not_unshare
= true;
5379 /* We're not inside any EH region. */
5382 t
= copy_tree_body (&id
);
5383 pointer_map_destroy (decl_map
);
5385 /* We can only return something suitable for use in a GENERIC
5387 if (TREE_CODE (t
) == MODIFY_EXPR
)
5388 return TREE_OPERAND (t
, 1);
5394 /* Duplicate a type, fields and all. */
5397 build_duplicate_type (tree type
)
5399 struct copy_body_data id
;
5401 memset (&id
, 0, sizeof (id
));
5402 id
.src_fn
= current_function_decl
;
5403 id
.dst_fn
= current_function_decl
;
5405 id
.decl_map
= pointer_map_create ();
5406 id
.debug_map
= NULL
;
5407 id
.copy_decl
= copy_decl_no_change
;
5409 type
= remap_type_1 (type
, &id
);
5411 pointer_map_destroy (id
.decl_map
);
5413 pointer_map_destroy (id
.debug_map
);
5415 TYPE_CANONICAL (type
) = type
;