2 Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
3 Free Software Foundation, Inc.
4 Contributed by Alexandre Oliva <aoliva@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
26 #include "diagnostic-core.h"
28 #include "tree-inline.h"
32 #include "insn-config.h"
34 #include "langhooks.h"
35 #include "basic-block.h"
36 #include "tree-iterator.h"
39 #include "tree-mudflap.h"
40 #include "tree-flow.h"
42 #include "tree-flow.h"
43 #include "tree-pretty-print.h"
46 #include "pointer-set.h"
48 #include "value-prof.h"
49 #include "tree-pass.h"
51 #include "integrate.h"
53 #include "rtl.h" /* FIXME: For asm_str_count. */
55 /* I'm not real happy about this, but we need to handle gimple and
59 /* Inlining, Cloning, Versioning, Parallelization
61 Inlining: a function body is duplicated, but the PARM_DECLs are
62 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
63 MODIFY_EXPRs that store to a dedicated returned-value variable.
64 The duplicated eh_region info of the copy will later be appended
65 to the info for the caller; the eh_region info in copied throwing
66 statements and RESX statements are adjusted accordingly.
68 Cloning: (only in C++) We have one body for a con/de/structor, and
69 multiple function decls, each with a unique parameter list.
70 Duplicate the body, using the given splay tree; some parameters
71 will become constants (like 0 or 1).
73 Versioning: a function body is duplicated and the result is a new
74 function rather than into blocks of an existing function as with
75 inlining. Some parameters will become constants.
77 Parallelization: a region of a function is duplicated resulting in
78 a new function. Variables may be replaced with complex expressions
79 to enable shared variable semantics.
81 All of these will simultaneously lookup any callgraph edges. If
82 we're going to inline the duplicated function body, and the given
83 function has some cloned callgraph nodes (one for each place this
84 function will be inlined) those callgraph edges will be duplicated.
85 If we're cloning the body, those callgraph edges will be
86 updated to point into the new body. (Note that the original
87 callgraph node and edge list will not be altered.)
89 See the CALL_EXPR handling case in copy_tree_body_r (). */
93 o In order to make inlining-on-trees work, we pessimized
94 function-local static constants. In particular, they are now
95 always output, even when not addressed. Fix this by treating
96 function-local static constants just like global static
97 constants; the back-end already knows not to output them if they
100 o Provide heuristics to clamp inlining of recursive template
104 /* Weights that estimate_num_insns uses to estimate the size of the
107 eni_weights eni_size_weights
;
109 /* Weights that estimate_num_insns uses to estimate the time necessary
110 to execute the produced code. */
112 eni_weights eni_time_weights
;
116 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, basic_block
);
117 static void remap_block (tree
*, copy_body_data
*);
118 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
119 static tree
mark_local_for_remap_r (tree
*, int *, void *);
120 static void unsave_expr_1 (tree
);
121 static tree
unsave_r (tree
*, int *, void *);
122 static void declare_inline_vars (tree
, tree
);
123 static void remap_save_expr (tree
*, void *, int *);
124 static void prepend_lexical_block (tree current_block
, tree new_block
);
125 static tree
copy_decl_to_var (tree
, copy_body_data
*);
126 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
127 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
128 static gimple
remap_gimple_stmt (gimple
, copy_body_data
*);
129 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
131 /* Insert a tree->tree mapping for ID. Despite the name suggests
132 that the trees should be variables, it is used for more than that. */
135 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
137 *pointer_map_insert (id
->decl_map
, key
) = value
;
139 /* Always insert an identity map as well. If we see this same new
140 node again, we won't want to duplicate it a second time. */
142 *pointer_map_insert (id
->decl_map
, value
) = value
;
145 /* Insert a tree->tree mapping for ID. This is only used for
149 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
151 if (!gimple_in_ssa_p (id
->src_cfun
))
154 if (!MAY_HAVE_DEBUG_STMTS
)
157 if (!target_for_debug_bind (key
))
160 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
161 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
164 id
->debug_map
= pointer_map_create ();
166 *pointer_map_insert (id
->debug_map
, key
) = value
;
169 /* If nonzero, we're remapping the contents of inlined debug
170 statements. If negative, an error has occurred, such as a
171 reference to a variable that isn't available in the inlined
173 static int processing_debug_stmt
= 0;
175 /* Construct new SSA name for old NAME. ID is the inline context. */
178 remap_ssa_name (tree name
, copy_body_data
*id
)
183 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
185 n
= (tree
*) pointer_map_contains (id
->decl_map
, name
);
187 return unshare_expr (*n
);
189 if (processing_debug_stmt
)
191 if (TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
192 && SSA_NAME_IS_DEFAULT_DEF (name
)
193 && id
->entry_bb
== NULL
194 && single_succ_p (ENTRY_BLOCK_PTR
))
196 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
198 gimple_stmt_iterator gsi
;
199 tree val
= SSA_NAME_VAR (name
);
201 n
= (tree
*) pointer_map_contains (id
->decl_map
, val
);
204 if (TREE_CODE (val
) != PARM_DECL
)
206 processing_debug_stmt
= -1;
209 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
210 DECL_ARTIFICIAL (vexpr
) = 1;
211 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
212 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
213 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR
));
214 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
218 processing_debug_stmt
= -1;
222 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
224 new_tree
= remap_decl (SSA_NAME_VAR (name
), id
);
226 /* We might've substituted constant or another SSA_NAME for
229 Replace the SSA name representing RESULT_DECL by variable during
230 inlining: this saves us from need to introduce PHI node in a case
231 return value is just partly initialized. */
232 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
233 && (TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
234 || !id
->transform_return_to_modify
))
236 struct ptr_info_def
*pi
;
237 new_tree
= make_ssa_name (new_tree
, NULL
);
238 insert_decl_map (id
, name
, new_tree
);
239 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
240 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
241 TREE_TYPE (new_tree
) = TREE_TYPE (SSA_NAME_VAR (new_tree
));
242 /* At least IPA points-to info can be directly transferred. */
243 if (id
->src_cfun
->gimple_df
244 && id
->src_cfun
->gimple_df
->ipa_pta
245 && (pi
= SSA_NAME_PTR_INFO (name
))
248 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
251 if (gimple_nop_p (SSA_NAME_DEF_STMT (name
)))
253 /* By inlining function having uninitialized variable, we might
254 extend the lifetime (variable might get reused). This cause
255 ICE in the case we end up extending lifetime of SSA name across
256 abnormal edge, but also increase register pressure.
258 We simply initialize all uninitialized vars by 0 except
259 for case we are inlining to very first BB. We can avoid
260 this for all BBs that are not inside strongly connected
261 regions of the CFG, but this is expensive to test. */
263 && is_gimple_reg (SSA_NAME_VAR (name
))
264 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
265 && TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
266 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR
, 0)->dest
267 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
269 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
271 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
273 init_stmt
= gimple_build_assign (new_tree
, zero
);
274 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
275 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
279 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
280 if (gimple_default_def (id
->src_cfun
, SSA_NAME_VAR (name
))
282 set_default_def (SSA_NAME_VAR (new_tree
), new_tree
);
287 insert_decl_map (id
, name
, new_tree
);
291 /* Remap DECL during the copying of the BLOCK tree for the function. */
294 remap_decl (tree decl
, copy_body_data
*id
)
298 /* We only remap local variables in the current function. */
300 /* See if we have remapped this declaration. */
302 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
304 if (!n
&& processing_debug_stmt
)
306 processing_debug_stmt
= -1;
310 /* If we didn't already have an equivalent for this declaration,
314 /* Make a copy of the variable or label. */
315 tree t
= id
->copy_decl (decl
, id
);
317 /* Remember it, so that if we encounter this local entity again
318 we can reuse this copy. Do this early because remap_type may
319 need this decl for TYPE_STUB_DECL. */
320 insert_decl_map (id
, decl
, t
);
325 /* Remap types, if necessary. */
326 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
327 if (TREE_CODE (t
) == TYPE_DECL
)
328 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
330 /* Remap sizes as necessary. */
331 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
332 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
334 /* If fields, do likewise for offset and qualifier. */
335 if (TREE_CODE (t
) == FIELD_DECL
)
337 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
338 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
339 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
342 if ((TREE_CODE (t
) == VAR_DECL
343 || TREE_CODE (t
) == RESULT_DECL
344 || TREE_CODE (t
) == PARM_DECL
)
345 && id
->src_fn
&& DECL_STRUCT_FUNCTION (id
->src_fn
)
346 && gimple_referenced_vars (DECL_STRUCT_FUNCTION (id
->src_fn
))
347 /* We don't want to mark as referenced VAR_DECLs that were
348 not marked as such in the src function. */
349 && (TREE_CODE (decl
) != VAR_DECL
350 || referenced_var_lookup (DECL_STRUCT_FUNCTION (id
->src_fn
),
352 add_referenced_var (t
);
356 if (id
->do_not_unshare
)
359 return unshare_expr (*n
);
363 remap_type_1 (tree type
, copy_body_data
*id
)
367 /* We do need a copy. build and register it now. If this is a pointer or
368 reference type, remap the designated type and make a new pointer or
370 if (TREE_CODE (type
) == POINTER_TYPE
)
372 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
374 TYPE_REF_CAN_ALIAS_ALL (type
));
375 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
376 new_tree
= build_type_attribute_qual_variant (new_tree
,
377 TYPE_ATTRIBUTES (type
),
379 insert_decl_map (id
, type
, new_tree
);
382 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
384 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
386 TYPE_REF_CAN_ALIAS_ALL (type
));
387 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
388 new_tree
= build_type_attribute_qual_variant (new_tree
,
389 TYPE_ATTRIBUTES (type
),
391 insert_decl_map (id
, type
, new_tree
);
395 new_tree
= copy_node (type
);
397 insert_decl_map (id
, type
, new_tree
);
399 /* This is a new type, not a copy of an old type. Need to reassociate
400 variants. We can handle everything except the main variant lazily. */
401 t
= TYPE_MAIN_VARIANT (type
);
404 t
= remap_type (t
, id
);
405 TYPE_MAIN_VARIANT (new_tree
) = t
;
406 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
407 TYPE_NEXT_VARIANT (t
) = new_tree
;
411 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
412 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
415 if (TYPE_STUB_DECL (type
))
416 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
418 /* Lazily create pointer and reference types. */
419 TYPE_POINTER_TO (new_tree
) = NULL
;
420 TYPE_REFERENCE_TO (new_tree
) = NULL
;
422 switch (TREE_CODE (new_tree
))
426 case FIXED_POINT_TYPE
:
429 t
= TYPE_MIN_VALUE (new_tree
);
430 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
431 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
433 t
= TYPE_MAX_VALUE (new_tree
);
434 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
435 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
439 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
440 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
444 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
445 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
450 case QUAL_UNION_TYPE
:
454 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
456 t
= remap_decl (f
, id
);
457 DECL_CONTEXT (t
) = new_tree
;
461 TYPE_FIELDS (new_tree
) = nreverse (nf
);
467 /* Shouldn't have been thought variable sized. */
471 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
472 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
478 remap_type (tree type
, copy_body_data
*id
)
486 /* See if we have remapped this type. */
487 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
491 /* The type only needs remapping if it's variably modified. */
492 if (! variably_modified_type_p (type
, id
->src_fn
))
494 insert_decl_map (id
, type
, type
);
498 id
->remapping_type_depth
++;
499 tmp
= remap_type_1 (type
, id
);
500 id
->remapping_type_depth
--;
505 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
506 is NULL or TYPE has not been remapped before. */
509 remapped_type (tree type
, copy_body_data
*id
)
516 /* See if we have remapped this type. */
517 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
524 /* The type only needs remapping if it's variably modified. */
525 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
528 can_be_nonlocal (tree decl
, copy_body_data
*id
)
530 /* We can not duplicate function decls. */
531 if (TREE_CODE (decl
) == FUNCTION_DECL
)
534 /* Local static vars must be non-local or we get multiple declaration
536 if (TREE_CODE (decl
) == VAR_DECL
537 && !auto_var_in_fn_p (decl
, id
->src_fn
))
540 /* At the moment dwarf2out can handle only these types of nodes. We
541 can support more later. */
542 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != PARM_DECL
)
545 /* We must use global type. We call remapped_type instead of
546 remap_type since we don't want to remap this type here if it
547 hasn't been remapped before. */
548 if (TREE_TYPE (decl
) != remapped_type (TREE_TYPE (decl
), id
))
551 /* Wihtout SSA we can't tell if variable is used. */
552 if (!gimple_in_ssa_p (cfun
))
555 /* Live variables must be copied so we can attach DECL_RTL. */
563 remap_decls (tree decls
, VEC(tree
,gc
) **nonlocalized_list
, copy_body_data
*id
)
566 tree new_decls
= NULL_TREE
;
568 /* Remap its variables. */
569 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
573 if (can_be_nonlocal (old_var
, id
))
575 if (TREE_CODE (old_var
) == VAR_DECL
576 && ! DECL_EXTERNAL (old_var
)
577 && (var_ann (old_var
) || !gimple_in_ssa_p (cfun
)))
578 add_local_decl (cfun
, old_var
);
579 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
580 && !DECL_IGNORED_P (old_var
)
581 && nonlocalized_list
)
582 VEC_safe_push (tree
, gc
, *nonlocalized_list
, old_var
);
586 /* Remap the variable. */
587 new_var
= remap_decl (old_var
, id
);
589 /* If we didn't remap this variable, we can't mess with its
590 TREE_CHAIN. If we remapped this variable to the return slot, it's
591 already declared somewhere else, so don't declare it here. */
593 if (new_var
== id
->retvar
)
597 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
598 && !DECL_IGNORED_P (old_var
)
599 && nonlocalized_list
)
600 VEC_safe_push (tree
, gc
, *nonlocalized_list
, old_var
);
604 gcc_assert (DECL_P (new_var
));
605 DECL_CHAIN (new_var
) = new_decls
;
608 /* Also copy value-expressions. */
609 if (TREE_CODE (new_var
) == VAR_DECL
610 && DECL_HAS_VALUE_EXPR_P (new_var
))
612 tree tem
= DECL_VALUE_EXPR (new_var
);
613 bool old_regimplify
= id
->regimplify
;
614 id
->remapping_type_depth
++;
615 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
616 id
->remapping_type_depth
--;
617 id
->regimplify
= old_regimplify
;
618 SET_DECL_VALUE_EXPR (new_var
, tem
);
623 return nreverse (new_decls
);
626 /* Copy the BLOCK to contain remapped versions of the variables
627 therein. And hook the new block into the block-tree. */
630 remap_block (tree
*block
, copy_body_data
*id
)
635 /* Make the new block. */
637 new_block
= make_node (BLOCK
);
638 TREE_USED (new_block
) = TREE_USED (old_block
);
639 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
640 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
641 BLOCK_NONLOCALIZED_VARS (new_block
)
642 = VEC_copy (tree
, gc
, BLOCK_NONLOCALIZED_VARS (old_block
));
645 /* Remap its variables. */
646 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
647 &BLOCK_NONLOCALIZED_VARS (new_block
),
650 if (id
->transform_lang_insert_block
)
651 id
->transform_lang_insert_block (new_block
);
653 /* Remember the remapped block. */
654 insert_decl_map (id
, old_block
, new_block
);
657 /* Copy the whole block tree and root it in id->block. */
659 remap_blocks (tree block
, copy_body_data
*id
)
662 tree new_tree
= block
;
667 remap_block (&new_tree
, id
);
668 gcc_assert (new_tree
!= block
);
669 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
670 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
671 /* Blocks are in arbitrary order, but make things slightly prettier and do
672 not swap order when producing a copy. */
673 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
678 copy_statement_list (tree
*tp
)
680 tree_stmt_iterator oi
, ni
;
683 new_tree
= alloc_stmt_list ();
684 ni
= tsi_start (new_tree
);
685 oi
= tsi_start (*tp
);
686 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
689 for (; !tsi_end_p (oi
); tsi_next (&oi
))
691 tree stmt
= tsi_stmt (oi
);
692 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
693 /* This copy is not redundant; tsi_link_after will smash this
694 STATEMENT_LIST into the end of the one we're building, and we
695 don't want to do that with the original. */
696 copy_statement_list (&stmt
);
697 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
702 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
704 tree block
= BIND_EXPR_BLOCK (*tp
);
705 /* Copy (and replace) the statement. */
706 copy_tree_r (tp
, walk_subtrees
, NULL
);
709 remap_block (&block
, id
);
710 BIND_EXPR_BLOCK (*tp
) = block
;
713 if (BIND_EXPR_VARS (*tp
))
714 /* This will remap a lot of the same decls again, but this should be
716 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
720 /* Create a new gimple_seq by remapping all the statements in BODY
721 using the inlining information in ID. */
724 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
726 gimple_stmt_iterator si
;
727 gimple_seq new_body
= NULL
;
729 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
731 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
732 gimple_seq_add_stmt (&new_body
, new_stmt
);
739 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
740 block using the mapping information in ID. */
743 copy_gimple_bind (gimple stmt
, copy_body_data
*id
)
746 tree new_block
, new_vars
;
747 gimple_seq body
, new_body
;
749 /* Copy the statement. Note that we purposely don't use copy_stmt
750 here because we need to remap statements as we copy. */
751 body
= gimple_bind_body (stmt
);
752 new_body
= remap_gimple_seq (body
, id
);
754 new_block
= gimple_bind_block (stmt
);
756 remap_block (&new_block
, id
);
758 /* This will remap a lot of the same decls again, but this should be
760 new_vars
= gimple_bind_vars (stmt
);
762 new_vars
= remap_decls (new_vars
, NULL
, id
);
764 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
770 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
771 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
772 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
773 recursing into the children nodes of *TP. */
776 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
778 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
779 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
780 tree fn
= id
->src_fn
;
782 if (TREE_CODE (*tp
) == SSA_NAME
)
784 *tp
= remap_ssa_name (*tp
, id
);
788 else if (auto_var_in_fn_p (*tp
, fn
))
790 /* Local variables and labels need to be replaced by equivalent
791 variables. We don't want to copy static variables; there's
792 only one of those, no matter how many times we inline the
793 containing function. Similarly for globals from an outer
797 /* Remap the declaration. */
798 new_decl
= remap_decl (*tp
, id
);
799 gcc_assert (new_decl
);
800 /* Replace this variable with the copy. */
801 STRIP_TYPE_NOPS (new_decl
);
802 /* ??? The C++ frontend uses void * pointer zero to initialize
803 any other type. This confuses the middle-end type verification.
804 As cloned bodies do not go through gimplification again the fixup
805 there doesn't trigger. */
806 if (TREE_CODE (new_decl
) == INTEGER_CST
807 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
808 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
812 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
814 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
816 else if (TREE_CODE (*tp
) == LABEL_DECL
817 && (!DECL_CONTEXT (*tp
)
818 || decl_function_context (*tp
) == id
->src_fn
))
819 /* These may need to be remapped for EH handling. */
820 *tp
= remap_decl (*tp
, id
);
821 else if (TYPE_P (*tp
))
822 /* Types may need remapping as well. */
823 *tp
= remap_type (*tp
, id
);
824 else if (CONSTANT_CLASS_P (*tp
))
826 /* If this is a constant, we have to copy the node iff the type
827 will be remapped. copy_tree_r will not copy a constant. */
828 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
830 if (new_type
== TREE_TYPE (*tp
))
833 else if (TREE_CODE (*tp
) == INTEGER_CST
)
834 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
835 TREE_INT_CST_HIGH (*tp
));
838 *tp
= copy_node (*tp
);
839 TREE_TYPE (*tp
) = new_type
;
844 /* Otherwise, just copy the node. Note that copy_tree_r already
845 knows not to copy VAR_DECLs, etc., so this is safe. */
847 /* We should never have TREE_BLOCK set on non-statements. */
849 gcc_assert (!TREE_BLOCK (*tp
));
851 if (TREE_CODE (*tp
) == MEM_REF
)
853 tree ptr
= TREE_OPERAND (*tp
, 0);
854 tree type
= remap_type (TREE_TYPE (*tp
), id
);
857 /* We need to re-canonicalize MEM_REFs from inline substitutions
858 that can happen when a pointer argument is an ADDR_EXPR.
859 Recurse here manually to allow that. */
860 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
861 *tp
= fold_build2 (MEM_REF
, type
,
862 ptr
, TREE_OPERAND (*tp
, 1));
863 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
864 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
865 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
870 /* Here is the "usual case". Copy this tree node, and then
871 tweak some special cases. */
872 copy_tree_r (tp
, walk_subtrees
, NULL
);
874 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
875 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
877 /* Global variables we haven't seen yet need to go into referenced
878 vars. If not referenced from types only. */
879 if (gimple_in_ssa_p (cfun
)
880 && TREE_CODE (*tp
) == VAR_DECL
881 && id
->remapping_type_depth
== 0
882 && !processing_debug_stmt
)
883 add_referenced_var (*tp
);
885 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
887 /* The copied TARGET_EXPR has never been expanded, even if the
888 original node was expanded already. */
889 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
890 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
892 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
894 /* Variable substitution need not be simple. In particular,
895 the MEM_REF substitution above. Make sure that
896 TREE_CONSTANT and friends are up-to-date. But make sure
897 to not improperly set TREE_BLOCK on some sub-expressions. */
898 int invariant
= is_gimple_min_invariant (*tp
);
899 tree block
= id
->block
;
900 id
->block
= NULL_TREE
;
901 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
903 recompute_tree_invariant_for_addr_expr (*tp
);
905 /* If this used to be invariant, but is not any longer,
906 then regimplification is probably needed. */
907 if (invariant
&& !is_gimple_min_invariant (*tp
))
908 id
->regimplify
= true;
914 /* Keep iterating. */
919 /* Called from copy_body_id via walk_tree. DATA is really a
920 `copy_body_data *'. */
923 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
925 copy_body_data
*id
= (copy_body_data
*) data
;
926 tree fn
= id
->src_fn
;
929 /* Begin by recognizing trees that we'll completely rewrite for the
930 inlining context. Our output for these trees is completely
931 different from out input (e.g. RETURN_EXPR is deleted, and morphs
932 into an edge). Further down, we'll handle trees that get
933 duplicated and/or tweaked. */
935 /* When requested, RETURN_EXPRs should be transformed to just the
936 contained MODIFY_EXPR. The branch semantics of the return will
937 be handled elsewhere by manipulating the CFG rather than a statement. */
938 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
940 tree assignment
= TREE_OPERAND (*tp
, 0);
942 /* If we're returning something, just turn that into an
943 assignment into the equivalent of the original RESULT_DECL.
944 If the "assignment" is just the result decl, the result
945 decl has already been set (e.g. a recent "foo (&result_decl,
946 ...)"); just toss the entire RETURN_EXPR. */
947 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
949 /* Replace the RETURN_EXPR with (a copy of) the
950 MODIFY_EXPR hanging underneath. */
951 *tp
= copy_node (assignment
);
953 else /* Else the RETURN_EXPR returns no value. */
956 return (tree
) (void *)1;
959 else if (TREE_CODE (*tp
) == SSA_NAME
)
961 *tp
= remap_ssa_name (*tp
, id
);
966 /* Local variables and labels need to be replaced by equivalent
967 variables. We don't want to copy static variables; there's only
968 one of those, no matter how many times we inline the containing
969 function. Similarly for globals from an outer function. */
970 else if (auto_var_in_fn_p (*tp
, fn
))
974 /* Remap the declaration. */
975 new_decl
= remap_decl (*tp
, id
);
976 gcc_assert (new_decl
);
977 /* Replace this variable with the copy. */
978 STRIP_TYPE_NOPS (new_decl
);
982 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
983 copy_statement_list (tp
);
984 else if (TREE_CODE (*tp
) == SAVE_EXPR
985 || TREE_CODE (*tp
) == TARGET_EXPR
)
986 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
987 else if (TREE_CODE (*tp
) == LABEL_DECL
988 && (! DECL_CONTEXT (*tp
)
989 || decl_function_context (*tp
) == id
->src_fn
))
990 /* These may need to be remapped for EH handling. */
991 *tp
= remap_decl (*tp
, id
);
992 else if (TREE_CODE (*tp
) == BIND_EXPR
)
993 copy_bind_expr (tp
, walk_subtrees
, id
);
994 /* Types may need remapping as well. */
995 else if (TYPE_P (*tp
))
996 *tp
= remap_type (*tp
, id
);
998 /* If this is a constant, we have to copy the node iff the type will be
999 remapped. copy_tree_r will not copy a constant. */
1000 else if (CONSTANT_CLASS_P (*tp
))
1002 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1004 if (new_type
== TREE_TYPE (*tp
))
1007 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1008 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
1009 TREE_INT_CST_HIGH (*tp
));
1012 *tp
= copy_node (*tp
);
1013 TREE_TYPE (*tp
) = new_type
;
1017 /* Otherwise, just copy the node. Note that copy_tree_r already
1018 knows not to copy VAR_DECLs, etc., so this is safe. */
1021 /* Here we handle trees that are not completely rewritten.
1022 First we detect some inlining-induced bogosities for
1024 if (TREE_CODE (*tp
) == MODIFY_EXPR
1025 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1026 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1028 /* Some assignments VAR = VAR; don't generate any rtl code
1029 and thus don't count as variable modification. Avoid
1030 keeping bogosities like 0 = 0. */
1031 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1034 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1038 STRIP_TYPE_NOPS (value
);
1039 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1041 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1042 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1046 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1048 /* Get rid of *& from inline substitutions that can happen when a
1049 pointer argument is an ADDR_EXPR. */
1050 tree decl
= TREE_OPERAND (*tp
, 0);
1053 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1058 /* If we happen to get an ADDR_EXPR in n->value, strip
1059 it manually here as we'll eventually get ADDR_EXPRs
1060 which lie about their types pointed to. In this case
1061 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1062 but we absolutely rely on that. As fold_indirect_ref
1063 does other useful transformations, try that first, though. */
1064 tree type
= TREE_TYPE (TREE_TYPE (*n
));
1065 if (id
->do_not_unshare
)
1068 new_tree
= unshare_expr (*n
);
1070 *tp
= gimple_fold_indirect_ref (new_tree
);
1073 if (TREE_CODE (new_tree
) == ADDR_EXPR
)
1075 *tp
= fold_indirect_ref_1 (EXPR_LOCATION (new_tree
),
1077 /* ??? We should either assert here or build
1078 a VIEW_CONVERT_EXPR instead of blindly leaking
1079 incompatible types to our IL. */
1081 *tp
= TREE_OPERAND (new_tree
, 0);
1085 *tp
= build1 (INDIRECT_REF
, type
, new_tree
);
1086 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1087 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1088 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1089 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
1096 else if (TREE_CODE (*tp
) == MEM_REF
)
1098 /* We need to re-canonicalize MEM_REFs from inline substitutions
1099 that can happen when a pointer argument is an ADDR_EXPR. */
1100 tree decl
= TREE_OPERAND (*tp
, 0);
1103 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1107 *tp
= fold_build2 (MEM_REF
, TREE_TYPE (*tp
),
1108 unshare_expr (*n
), TREE_OPERAND (*tp
, 1));
1109 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1110 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1116 /* Here is the "usual case". Copy this tree node, and then
1117 tweak some special cases. */
1118 copy_tree_r (tp
, walk_subtrees
, NULL
);
1120 /* Global variables we haven't seen yet needs to go into referenced
1121 vars. If not referenced from types or debug stmts only. */
1122 if (gimple_in_ssa_p (cfun
)
1123 && TREE_CODE (*tp
) == VAR_DECL
1124 && id
->remapping_type_depth
== 0
1125 && !processing_debug_stmt
)
1126 add_referenced_var (*tp
);
1128 /* If EXPR has block defined, map it to newly constructed block.
1129 When inlining we want EXPRs without block appear in the block
1130 of function call if we are not remapping a type. */
1133 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1134 if (TREE_BLOCK (*tp
))
1137 n
= (tree
*) pointer_map_contains (id
->decl_map
,
1139 gcc_assert (n
|| id
->remapping_type_depth
!= 0);
1143 TREE_BLOCK (*tp
) = new_block
;
1146 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1147 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1149 /* The copied TARGET_EXPR has never been expanded, even if the
1150 original node was expanded already. */
1151 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1153 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1154 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1157 /* Variable substitution need not be simple. In particular, the
1158 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1159 and friends are up-to-date. */
1160 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1162 int invariant
= is_gimple_min_invariant (*tp
);
1163 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1165 /* Handle the case where we substituted an INDIRECT_REF
1166 into the operand of the ADDR_EXPR. */
1167 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1168 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1170 recompute_tree_invariant_for_addr_expr (*tp
);
1172 /* If this used to be invariant, but is not any longer,
1173 then regimplification is probably needed. */
1174 if (invariant
&& !is_gimple_min_invariant (*tp
))
1175 id
->regimplify
= true;
1181 /* Keep iterating. */
1185 /* Helper for remap_gimple_stmt. Given an EH region number for the
1186 source function, map that to the duplicate EH region number in
1187 the destination function. */
1190 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1192 eh_region old_r
, new_r
;
1195 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1196 slot
= pointer_map_contains (id
->eh_map
, old_r
);
1197 new_r
= (eh_region
) *slot
;
1199 return new_r
->index
;
1202 /* Similar, but operate on INTEGER_CSTs. */
1205 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1209 old_nr
= tree_low_cst (old_t_nr
, 0);
1210 new_nr
= remap_eh_region_nr (old_nr
, id
);
1212 return build_int_cst (integer_type_node
, new_nr
);
1215 /* Helper for copy_bb. Remap statement STMT using the inlining
1216 information in ID. Return the new statement copy. */
1219 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1222 struct walk_stmt_info wi
;
1224 bool skip_first
= false;
1226 /* Begin by recognizing trees that we'll completely rewrite for the
1227 inlining context. Our output for these trees is completely
1228 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1229 into an edge). Further down, we'll handle trees that get
1230 duplicated and/or tweaked. */
1232 /* When requested, GIMPLE_RETURNs should be transformed to just the
1233 contained GIMPLE_ASSIGN. The branch semantics of the return will
1234 be handled elsewhere by manipulating the CFG rather than the
1236 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1238 tree retval
= gimple_return_retval (stmt
);
1240 /* If we're returning something, just turn that into an
1241 assignment into the equivalent of the original RESULT_DECL.
1242 If RETVAL is just the result decl, the result decl has
1243 already been set (e.g. a recent "foo (&result_decl, ...)");
1244 just toss the entire GIMPLE_RETURN. */
1246 && (TREE_CODE (retval
) != RESULT_DECL
1247 && (TREE_CODE (retval
) != SSA_NAME
1248 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1250 copy
= gimple_build_assign (id
->retvar
, retval
);
1251 /* id->retvar is already substituted. Skip it on later remapping. */
1255 return gimple_build_nop ();
1257 else if (gimple_has_substatements (stmt
))
1261 /* When cloning bodies from the C++ front end, we will be handed bodies
1262 in High GIMPLE form. Handle here all the High GIMPLE statements that
1263 have embedded statements. */
1264 switch (gimple_code (stmt
))
1267 copy
= copy_gimple_bind (stmt
, id
);
1271 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1272 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1275 case GIMPLE_EH_FILTER
:
1276 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1277 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1281 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1282 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1283 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1286 case GIMPLE_WITH_CLEANUP_EXPR
:
1287 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1288 copy
= gimple_build_wce (s1
);
1291 case GIMPLE_OMP_PARALLEL
:
1292 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1293 copy
= gimple_build_omp_parallel
1295 gimple_omp_parallel_clauses (stmt
),
1296 gimple_omp_parallel_child_fn (stmt
),
1297 gimple_omp_parallel_data_arg (stmt
));
1300 case GIMPLE_OMP_TASK
:
1301 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1302 copy
= gimple_build_omp_task
1304 gimple_omp_task_clauses (stmt
),
1305 gimple_omp_task_child_fn (stmt
),
1306 gimple_omp_task_data_arg (stmt
),
1307 gimple_omp_task_copy_fn (stmt
),
1308 gimple_omp_task_arg_size (stmt
),
1309 gimple_omp_task_arg_align (stmt
));
1312 case GIMPLE_OMP_FOR
:
1313 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1314 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1315 copy
= gimple_build_omp_for (s1
, gimple_omp_for_clauses (stmt
),
1316 gimple_omp_for_collapse (stmt
), s2
);
1319 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1321 gimple_omp_for_set_index (copy
, i
,
1322 gimple_omp_for_index (stmt
, i
));
1323 gimple_omp_for_set_initial (copy
, i
,
1324 gimple_omp_for_initial (stmt
, i
));
1325 gimple_omp_for_set_final (copy
, i
,
1326 gimple_omp_for_final (stmt
, i
));
1327 gimple_omp_for_set_incr (copy
, i
,
1328 gimple_omp_for_incr (stmt
, i
));
1329 gimple_omp_for_set_cond (copy
, i
,
1330 gimple_omp_for_cond (stmt
, i
));
1335 case GIMPLE_OMP_MASTER
:
1336 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1337 copy
= gimple_build_omp_master (s1
);
1340 case GIMPLE_OMP_ORDERED
:
1341 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1342 copy
= gimple_build_omp_ordered (s1
);
1345 case GIMPLE_OMP_SECTION
:
1346 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1347 copy
= gimple_build_omp_section (s1
);
1350 case GIMPLE_OMP_SECTIONS
:
1351 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1352 copy
= gimple_build_omp_sections
1353 (s1
, gimple_omp_sections_clauses (stmt
));
1356 case GIMPLE_OMP_SINGLE
:
1357 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1358 copy
= gimple_build_omp_single
1359 (s1
, gimple_omp_single_clauses (stmt
));
1362 case GIMPLE_OMP_CRITICAL
:
1363 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1365 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1368 case GIMPLE_TRANSACTION
:
1369 s1
= remap_gimple_seq (gimple_transaction_body (stmt
), id
);
1370 copy
= gimple_build_transaction (s1
, gimple_transaction_label (stmt
));
1371 gimple_transaction_set_subcode (copy
, gimple_transaction_subcode (stmt
));
1380 if (gimple_assign_copy_p (stmt
)
1381 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1382 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1384 /* Here we handle statements that are not completely rewritten.
1385 First we detect some inlining-induced bogosities for
1388 /* Some assignments VAR = VAR; don't generate any rtl code
1389 and thus don't count as variable modification. Avoid
1390 keeping bogosities like 0 = 0. */
1391 tree decl
= gimple_assign_lhs (stmt
), value
;
1394 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1398 STRIP_TYPE_NOPS (value
);
1399 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1400 return gimple_build_nop ();
1404 if (gimple_debug_bind_p (stmt
))
1406 copy
= gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1407 gimple_debug_bind_get_value (stmt
),
1409 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, copy
);
1412 if (gimple_debug_source_bind_p (stmt
))
1414 copy
= gimple_build_debug_source_bind
1415 (gimple_debug_source_bind_get_var (stmt
),
1416 gimple_debug_source_bind_get_value (stmt
), stmt
);
1417 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, copy
);
1421 /* Create a new deep copy of the statement. */
1422 copy
= gimple_copy (stmt
);
1424 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1425 RESX and EH_DISPATCH. */
1427 switch (gimple_code (copy
))
1431 tree r
, fndecl
= gimple_call_fndecl (copy
);
1432 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1433 switch (DECL_FUNCTION_CODE (fndecl
))
1435 case BUILT_IN_EH_COPY_VALUES
:
1436 r
= gimple_call_arg (copy
, 1);
1437 r
= remap_eh_region_tree_nr (r
, id
);
1438 gimple_call_set_arg (copy
, 1, r
);
1441 case BUILT_IN_EH_POINTER
:
1442 case BUILT_IN_EH_FILTER
:
1443 r
= gimple_call_arg (copy
, 0);
1444 r
= remap_eh_region_tree_nr (r
, id
);
1445 gimple_call_set_arg (copy
, 0, r
);
1452 /* Reset alias info if we didn't apply measures to
1453 keep it valid over inlining by setting DECL_PT_UID. */
1454 if (!id
->src_cfun
->gimple_df
1455 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1456 gimple_call_reset_alias_info (copy
);
1462 int r
= gimple_resx_region (copy
);
1463 r
= remap_eh_region_nr (r
, id
);
1464 gimple_resx_set_region (copy
, r
);
1468 case GIMPLE_EH_DISPATCH
:
1470 int r
= gimple_eh_dispatch_region (copy
);
1471 r
= remap_eh_region_nr (r
, id
);
1472 gimple_eh_dispatch_set_region (copy
, r
);
1481 /* If STMT has a block defined, map it to the newly constructed
1482 block. When inlining we want statements without a block to
1483 appear in the block of the function call. */
1484 new_block
= id
->block
;
1485 if (gimple_block (copy
))
1488 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1493 gimple_set_block (copy
, new_block
);
1495 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1498 /* Remap all the operands in COPY. */
1499 memset (&wi
, 0, sizeof (wi
));
1502 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1504 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1506 /* Clear the copied virtual operands. We are not remapping them here
1507 but are going to recreate them from scratch. */
1508 if (gimple_has_mem_ops (copy
))
1510 gimple_set_vdef (copy
, NULL_TREE
);
1511 gimple_set_vuse (copy
, NULL_TREE
);
1518 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1522 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1523 gcov_type count_scale
)
1525 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1526 basic_block copy_basic_block
;
1531 /* Search for previous copied basic block. */
1534 prev
= prev
->prev_bb
;
1536 /* create_basic_block() will append every new block to
1537 basic_block_info automatically. */
1538 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1539 (basic_block
) prev
->aux
);
1540 copy_basic_block
->count
= bb
->count
* count_scale
/ REG_BR_PROB_BASE
;
1542 /* We are going to rebuild frequencies from scratch. These values
1543 have just small importance to drive canonicalize_loop_headers. */
1544 freq
= ((gcov_type
)bb
->frequency
* frequency_scale
/ REG_BR_PROB_BASE
);
1546 /* We recompute frequencies after inlining, so this is quite safe. */
1547 if (freq
> BB_FREQ_MAX
)
1549 copy_basic_block
->frequency
= freq
;
1551 copy_gsi
= gsi_start_bb (copy_basic_block
);
1553 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1555 gimple stmt
= gsi_stmt (gsi
);
1556 gimple orig_stmt
= stmt
;
1558 id
->regimplify
= false;
1559 stmt
= remap_gimple_stmt (stmt
, id
);
1560 if (gimple_nop_p (stmt
))
1563 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1566 /* With return slot optimization we can end up with
1567 non-gimple (foo *)&this->m, fix that here. */
1568 if (is_gimple_assign (stmt
)
1569 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1570 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1573 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1574 gimple_assign_rhs1 (stmt
),
1576 GSI_CONTINUE_LINKING
);
1577 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1578 id
->regimplify
= false;
1581 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1584 gimple_regimplify_operands (stmt
, &seq_gsi
);
1586 /* If copy_basic_block has been empty at the start of this iteration,
1587 call gsi_start_bb again to get at the newly added statements. */
1588 if (gsi_end_p (copy_gsi
))
1589 copy_gsi
= gsi_start_bb (copy_basic_block
);
1591 gsi_next (©_gsi
);
1593 /* Process the new statement. The call to gimple_regimplify_operands
1594 possibly turned the statement into multiple statements, we
1595 need to process all of them. */
1600 stmt
= gsi_stmt (copy_gsi
);
1601 if (is_gimple_call (stmt
)
1602 && gimple_call_va_arg_pack_p (stmt
)
1605 /* __builtin_va_arg_pack () should be replaced by
1606 all arguments corresponding to ... in the caller. */
1609 VEC(tree
, heap
) *argarray
;
1610 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1613 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1616 /* Create the new array of arguments. */
1617 n
= nargs
+ gimple_call_num_args (stmt
);
1618 argarray
= VEC_alloc (tree
, heap
, n
);
1619 VEC_safe_grow (tree
, heap
, argarray
, n
);
1621 /* Copy all the arguments before '...' */
1622 memcpy (VEC_address (tree
, argarray
),
1623 gimple_call_arg_ptr (stmt
, 0),
1624 gimple_call_num_args (stmt
) * sizeof (tree
));
1626 /* Append the arguments passed in '...' */
1627 memcpy (VEC_address(tree
, argarray
) + gimple_call_num_args (stmt
),
1628 gimple_call_arg_ptr (id
->gimple_call
, 0)
1629 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1630 nargs
* sizeof (tree
));
1632 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1635 VEC_free (tree
, heap
, argarray
);
1637 /* Copy all GIMPLE_CALL flags, location and block, except
1638 GF_CALL_VA_ARG_PACK. */
1639 gimple_call_copy_flags (new_call
, stmt
);
1640 gimple_call_set_va_arg_pack (new_call
, false);
1641 gimple_set_location (new_call
, gimple_location (stmt
));
1642 gimple_set_block (new_call
, gimple_block (stmt
));
1643 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1645 gsi_replace (©_gsi
, new_call
, false);
1648 else if (is_gimple_call (stmt
)
1650 && (decl
= gimple_call_fndecl (stmt
))
1651 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1652 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1654 /* __builtin_va_arg_pack_len () should be replaced by
1655 the number of anonymous arguments. */
1656 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1660 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1663 count
= build_int_cst (integer_type_node
, nargs
);
1664 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1665 gsi_replace (©_gsi
, new_stmt
, false);
1669 /* Statements produced by inlining can be unfolded, especially
1670 when we constant propagated some operands. We can't fold
1671 them right now for two reasons:
1672 1) folding require SSA_NAME_DEF_STMTs to be correct
1673 2) we can't change function calls to builtins.
1674 So we just mark statement for later folding. We mark
1675 all new statements, instead just statements that has changed
1676 by some nontrivial substitution so even statements made
1677 foldable indirectly are updated. If this turns out to be
1678 expensive, copy_body can be told to watch for nontrivial
1680 if (id
->statements_to_fold
)
1681 pointer_set_insert (id
->statements_to_fold
, stmt
);
1683 /* We're duplicating a CALL_EXPR. Find any corresponding
1684 callgraph edges and update or duplicate them. */
1685 if (is_gimple_call (stmt
))
1687 struct cgraph_edge
*edge
;
1690 switch (id
->transform_call_graph_edges
)
1692 case CB_CGE_DUPLICATE
:
1693 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1696 int edge_freq
= edge
->frequency
;
1697 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1699 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1701 /* We could also just rescale the frequency, but
1702 doing so would introduce roundoff errors and make
1703 verifier unhappy. */
1705 = compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1708 && profile_status_for_function (cfun
) != PROFILE_ABSENT
1709 && (edge_freq
> edge
->frequency
+ 10
1710 || edge_freq
< edge
->frequency
- 10))
1712 fprintf (dump_file
, "Edge frequency estimated by "
1713 "cgraph %i diverge from inliner's estimate %i\n",
1717 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1720 copy_basic_block
->frequency
);
1722 stmt
= cgraph_redirect_edge_call_stmt_to_callee (edge
);
1726 case CB_CGE_MOVE_CLONES
:
1727 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1729 edge
= cgraph_edge (id
->dst_node
, stmt
);
1733 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1735 cgraph_set_call_stmt (edge
, stmt
);
1742 /* Constant propagation on argument done during inlining
1743 may create new direct call. Produce an edge for it. */
1745 || (edge
->indirect_inlining_edge
1746 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1747 && id
->dst_node
->analyzed
1748 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1750 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1752 /* We have missing edge in the callgraph. This can happen
1753 when previous inlining turned an indirect call into a
1754 direct call by constant propagating arguments or we are
1755 producing dead clone (for further cloning). In all
1756 other cases we hit a bug (incorrect node sharing is the
1757 most common reason for missing edges). */
1758 gcc_assert (dest
->needed
|| !dest
->analyzed
1759 || dest
->address_taken
1760 || !id
->src_node
->analyzed
1761 || !id
->dst_node
->analyzed
);
1762 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1763 cgraph_create_edge_including_clones
1764 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1765 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1767 CIF_ORIGINALLY_INDIRECT_CALL
);
1769 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1771 compute_call_stmt_bb_frequency
1772 (id
->dst_node
->decl
, copy_basic_block
))->inline_failed
1773 = CIF_ORIGINALLY_INDIRECT_CALL
;
1776 fprintf (dump_file
, "Created new direct edge to %s\n",
1777 cgraph_node_name (dest
));
1781 flags
= gimple_call_flags (stmt
);
1782 if (flags
& ECF_MAY_BE_ALLOCA
)
1783 cfun
->calls_alloca
= true;
1784 if (flags
& ECF_RETURNS_TWICE
)
1785 cfun
->calls_setjmp
= true;
1788 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1789 id
->eh_map
, id
->eh_lp_nr
);
1791 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1796 find_new_referenced_vars (gsi_stmt (copy_gsi
));
1797 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1798 if (TREE_CODE (def
) == SSA_NAME
)
1799 SSA_NAME_DEF_STMT (def
) = stmt
;
1802 gsi_next (©_gsi
);
1804 while (!gsi_end_p (copy_gsi
));
1806 copy_gsi
= gsi_last_bb (copy_basic_block
);
1809 return copy_basic_block
;
1812 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1813 form is quite easy, since dominator relationship for old basic blocks does
1816 There is however exception where inlining might change dominator relation
1817 across EH edges from basic block within inlined functions destinating
1818 to landing pads in function we inline into.
1820 The function fills in PHI_RESULTs of such PHI nodes if they refer
1821 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1822 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1823 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1824 set, and this means that there will be no overlapping live ranges
1825 for the underlying symbol.
1827 This might change in future if we allow redirecting of EH edges and
1828 we might want to change way build CFG pre-inlining to include
1829 all the possible edges then. */
1831 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1832 bool can_throw
, bool nonlocal_goto
)
1837 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1839 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1842 gimple_stmt_iterator si
;
1845 gcc_assert (e
->flags
& EDGE_EH
);
1848 gcc_assert (!(e
->flags
& EDGE_EH
));
1850 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1854 phi
= gsi_stmt (si
);
1856 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1857 gcc_assert (!e
->dest
->aux
);
1859 gcc_assert ((e
->flags
& EDGE_EH
)
1860 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1862 if (!is_gimple_reg (PHI_RESULT (phi
)))
1864 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi
)));
1868 re
= find_edge (ret_bb
, e
->dest
);
1870 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1871 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1873 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1874 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1880 /* Copy edges from BB into its copy constructed earlier, scale profile
1881 accordingly. Edges will be taken care of later. Assume aux
1882 pointers to point to the copies of each BB. Return true if any
1883 debug stmts are left after a statement that must end the basic block. */
1886 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
)
1888 basic_block new_bb
= (basic_block
) bb
->aux
;
1891 gimple_stmt_iterator si
;
1893 bool need_debug_cleanup
= false;
1895 /* Use the indices from the original blocks to create edges for the
1897 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1898 if (!(old_edge
->flags
& EDGE_EH
))
1902 flags
= old_edge
->flags
;
1904 /* Return edges do get a FALLTHRU flag when the get inlined. */
1905 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1906 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR
)
1907 flags
|= EDGE_FALLTHRU
;
1908 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1909 new_edge
->count
= old_edge
->count
* count_scale
/ REG_BR_PROB_BASE
;
1910 new_edge
->probability
= old_edge
->probability
;
1913 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1916 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
1919 bool can_throw
, nonlocal_goto
;
1921 copy_stmt
= gsi_stmt (si
);
1922 if (!is_gimple_debug (copy_stmt
))
1924 update_stmt (copy_stmt
);
1925 if (gimple_in_ssa_p (cfun
))
1926 mark_symbols_for_renaming (copy_stmt
);
1929 /* Do this before the possible split_block. */
1932 /* If this tree could throw an exception, there are two
1933 cases where we need to add abnormal edge(s): the
1934 tree wasn't in a region and there is a "current
1935 region" in the caller; or the original tree had
1936 EH edges. In both cases split the block after the tree,
1937 and add abnormal edge(s) as needed; we need both
1938 those from the callee and the caller.
1939 We check whether the copy can throw, because the const
1940 propagation can change an INDIRECT_REF which throws
1941 into a COMPONENT_REF which doesn't. If the copy
1942 can throw, the original could also throw. */
1943 can_throw
= stmt_can_throw_internal (copy_stmt
);
1944 nonlocal_goto
= stmt_can_make_abnormal_goto (copy_stmt
);
1946 if (can_throw
|| nonlocal_goto
)
1948 if (!gsi_end_p (si
))
1950 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
1953 need_debug_cleanup
= true;
1955 if (!gsi_end_p (si
))
1956 /* Note that bb's predecessor edges aren't necessarily
1957 right at this point; split_block doesn't care. */
1959 edge e
= split_block (new_bb
, copy_stmt
);
1962 new_bb
->aux
= e
->src
->aux
;
1963 si
= gsi_start_bb (new_bb
);
1967 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
1968 make_eh_dispatch_edges (copy_stmt
);
1970 make_eh_edges (copy_stmt
);
1973 make_abnormal_goto_edges (gimple_bb (copy_stmt
), true);
1975 if ((can_throw
|| nonlocal_goto
)
1976 && gimple_in_ssa_p (cfun
))
1977 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
1978 can_throw
, nonlocal_goto
);
1980 return need_debug_cleanup
;
1983 /* Copy the PHIs. All blocks and edges are copied, some blocks
1984 was possibly split and new outgoing EH edges inserted.
1985 BB points to the block of original function and AUX pointers links
1986 the original and newly copied blocks. */
1989 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
1991 basic_block
const new_bb
= (basic_block
) bb
->aux
;
1994 gimple_stmt_iterator si
;
1996 bool inserted
= false;
1998 for (si
= gsi_start (phi_nodes (bb
)); !gsi_end_p (si
); gsi_next (&si
))
2003 phi
= gsi_stmt (si
);
2004 res
= PHI_RESULT (phi
);
2006 if (is_gimple_reg (res
))
2008 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2009 SSA_NAME_DEF_STMT (new_res
)
2010 = new_phi
= create_phi_node (new_res
, new_bb
);
2011 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2013 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2016 tree block
= id
->block
;
2019 /* When doing partial cloning, we allow PHIs on the entry block
2020 as long as all the arguments are the same. Find any input
2021 edge to see argument to copy. */
2023 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2024 if (!old_edge
->src
->aux
)
2027 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2029 id
->block
= NULL_TREE
;
2030 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2032 gcc_assert (new_arg
);
2033 /* With return slot optimization we can end up with
2034 non-gimple (foo *)&this->m, fix that here. */
2035 if (TREE_CODE (new_arg
) != SSA_NAME
2036 && TREE_CODE (new_arg
) != FUNCTION_DECL
2037 && !is_gimple_val (new_arg
))
2039 gimple_seq stmts
= NULL
;
2040 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2041 gsi_insert_seq_on_edge (new_edge
, stmts
);
2044 add_phi_arg (new_phi
, new_arg
, new_edge
,
2045 gimple_phi_arg_location_from_edge (phi
, old_edge
));
2050 /* Commit the delayed edge insertions. */
2052 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2053 gsi_commit_one_edge_insert (new_edge
, NULL
);
2057 /* Wrapper for remap_decl so it can be used as a callback. */
2060 remap_decl_1 (tree decl
, void *data
)
2062 return remap_decl (decl
, (copy_body_data
*) data
);
2065 /* Build struct function and associated datastructures for the new clone
2066 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
2069 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2071 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2072 gcov_type count_scale
;
2074 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2075 count_scale
= (REG_BR_PROB_BASE
* count
2076 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2078 count_scale
= REG_BR_PROB_BASE
;
2080 /* Register specific tree functions. */
2081 gimple_register_cfg_hooks ();
2083 /* Get clean struct function. */
2084 push_struct_function (new_fndecl
);
2086 /* We will rebuild these, so just sanity check that they are empty. */
2087 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2088 gcc_assert (cfun
->local_decls
== NULL
);
2089 gcc_assert (cfun
->cfg
== NULL
);
2090 gcc_assert (cfun
->decl
== new_fndecl
);
2092 /* Copy items we preserve during cloning. */
2093 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2094 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2095 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2096 cfun
->curr_properties
= src_cfun
->curr_properties
;
2097 cfun
->last_verified
= src_cfun
->last_verified
;
2098 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2099 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2100 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2101 cfun
->stdarg
= src_cfun
->stdarg
;
2102 cfun
->after_inlining
= src_cfun
->after_inlining
;
2103 cfun
->can_throw_non_call_exceptions
2104 = src_cfun
->can_throw_non_call_exceptions
;
2105 cfun
->returns_struct
= src_cfun
->returns_struct
;
2106 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2107 cfun
->after_tree_profile
= src_cfun
->after_tree_profile
;
2109 init_empty_tree_cfg ();
2111 profile_status_for_function (cfun
) = profile_status_for_function (src_cfun
);
2112 ENTRY_BLOCK_PTR
->count
=
2113 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2115 ENTRY_BLOCK_PTR
->frequency
2116 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2117 EXIT_BLOCK_PTR
->count
=
2118 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2120 EXIT_BLOCK_PTR
->frequency
=
2121 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2123 init_eh_for_function ();
2125 if (src_cfun
->gimple_df
)
2127 init_tree_ssa (cfun
);
2128 cfun
->gimple_df
->in_ssa_p
= true;
2129 init_ssa_operands ();
2134 /* Helper function for copy_cfg_body. Move debug stmts from the end
2135 of NEW_BB to the beginning of successor basic blocks when needed. If the
2136 successor has multiple predecessors, reset them, otherwise keep
2140 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2144 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2147 || gsi_one_before_end_p (si
)
2148 || !(stmt_can_throw_internal (gsi_stmt (si
))
2149 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2152 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2154 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2155 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2156 while (is_gimple_debug (gsi_stmt (ssi
)))
2158 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2162 /* For the last edge move the debug stmts instead of copying
2164 if (ei_one_before_end_p (ei
))
2168 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2169 gimple_debug_bind_reset_value (stmt
);
2170 gsi_remove (&si
, false);
2171 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2175 if (gimple_debug_bind_p (stmt
))
2177 var
= gimple_debug_bind_get_var (stmt
);
2178 if (single_pred_p (e
->dest
))
2180 value
= gimple_debug_bind_get_value (stmt
);
2181 value
= unshare_expr (value
);
2185 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2187 else if (gimple_debug_source_bind_p (stmt
))
2189 var
= gimple_debug_source_bind_get_var (stmt
);
2190 value
= gimple_debug_source_bind_get_value (stmt
);
2191 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2195 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2196 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, new_stmt
);
2202 /* Make a copy of the body of FN so that it can be inserted inline in
2203 another function. Walks FN via CFG, returns new fndecl. */
2206 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2207 basic_block entry_block_map
, basic_block exit_block_map
,
2208 bitmap blocks_to_copy
, basic_block new_entry
)
2210 tree callee_fndecl
= id
->src_fn
;
2211 /* Original cfun for the callee, doesn't change. */
2212 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2213 struct function
*cfun_to_copy
;
2215 tree new_fndecl
= NULL
;
2216 bool need_debug_cleanup
= false;
2217 gcov_type count_scale
;
2219 int incoming_frequency
= 0;
2220 gcov_type incoming_count
= 0;
2222 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2223 count_scale
= (REG_BR_PROB_BASE
* count
2224 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2226 count_scale
= REG_BR_PROB_BASE
;
2228 /* Register specific tree functions. */
2229 gimple_register_cfg_hooks ();
2231 /* If we are inlining just region of the function, make sure to connect new entry
2232 to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute
2233 frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and
2234 probabilities of edges incoming from nonduplicated region. */
2240 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2243 incoming_frequency
+= EDGE_FREQUENCY (e
);
2244 incoming_count
+= e
->count
;
2246 incoming_count
= incoming_count
* count_scale
/ REG_BR_PROB_BASE
;
2248 = incoming_frequency
* frequency_scale
/ REG_BR_PROB_BASE
;
2249 ENTRY_BLOCK_PTR
->count
= incoming_count
;
2250 ENTRY_BLOCK_PTR
->frequency
= incoming_frequency
;
2253 /* Must have a CFG here at this point. */
2254 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2255 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2257 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2259 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= entry_block_map
;
2260 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= exit_block_map
;
2261 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2262 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2264 /* Duplicate any exception-handling regions. */
2266 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2269 /* Use aux pointers to map the original blocks to copy. */
2270 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2271 if (!blocks_to_copy
|| bitmap_bit_p (blocks_to_copy
, bb
->index
))
2273 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2278 last
= last_basic_block
;
2280 /* Now that we've duplicated the blocks, duplicate their edges. */
2281 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2283 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2284 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
);
2288 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2289 e
->probability
= REG_BR_PROB_BASE
;
2290 e
->count
= incoming_count
;
2293 if (gimple_in_ssa_p (cfun
))
2294 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2296 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2297 copy_phis_for_bb (bb
, id
);
2299 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2302 if (need_debug_cleanup
2303 && bb
->index
!= ENTRY_BLOCK
2304 && bb
->index
!= EXIT_BLOCK
)
2305 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2306 ((basic_block
)bb
->aux
)->aux
= NULL
;
2310 /* Zero out AUX fields of newly created block during EH edge
2312 for (; last
< last_basic_block
; last
++)
2314 if (need_debug_cleanup
)
2315 maybe_move_debug_stmts_to_successors (id
, BASIC_BLOCK (last
));
2316 BASIC_BLOCK (last
)->aux
= NULL
;
2318 entry_block_map
->aux
= NULL
;
2319 exit_block_map
->aux
= NULL
;
2323 pointer_map_destroy (id
->eh_map
);
2330 /* Copy the debug STMT using ID. We deal with these statements in a
2331 special way: if any variable in their VALUE expression wasn't
2332 remapped yet, we won't remap it, because that would get decl uids
2333 out of sync, causing codegen differences between -g and -g0. If
2334 this arises, we drop the VALUE expression altogether. */
2337 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2340 struct walk_stmt_info wi
;
2343 if (gimple_block (stmt
))
2345 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2349 gimple_set_block (stmt
, t
);
2351 /* Remap all the operands in COPY. */
2352 memset (&wi
, 0, sizeof (wi
));
2355 processing_debug_stmt
= 1;
2357 if (gimple_debug_source_bind_p (stmt
))
2358 t
= gimple_debug_source_bind_get_var (stmt
);
2360 t
= gimple_debug_bind_get_var (stmt
);
2362 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2363 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2365 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2368 else if (TREE_CODE (t
) == VAR_DECL
2370 && gimple_in_ssa_p (cfun
)
2371 && !pointer_map_contains (id
->decl_map
, t
)
2373 /* T is a non-localized variable. */;
2375 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2377 if (gimple_debug_bind_p (stmt
))
2379 gimple_debug_bind_set_var (stmt
, t
);
2381 if (gimple_debug_bind_has_value_p (stmt
))
2382 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2383 remap_gimple_op_r
, &wi
, NULL
);
2385 /* Punt if any decl couldn't be remapped. */
2386 if (processing_debug_stmt
< 0)
2387 gimple_debug_bind_reset_value (stmt
);
2389 else if (gimple_debug_source_bind_p (stmt
))
2391 gimple_debug_source_bind_set_var (stmt
, t
);
2392 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2393 remap_gimple_op_r
, &wi
, NULL
);
2396 processing_debug_stmt
= 0;
2399 if (gimple_in_ssa_p (cfun
))
2400 mark_symbols_for_renaming (stmt
);
2403 /* Process deferred debug stmts. In order to give values better odds
2404 of being successfully remapped, we delay the processing of debug
2405 stmts until all other stmts that might require remapping are
2409 copy_debug_stmts (copy_body_data
*id
)
2414 if (!id
->debug_stmts
)
2417 FOR_EACH_VEC_ELT (gimple
, id
->debug_stmts
, i
, stmt
)
2418 copy_debug_stmt (stmt
, id
);
2420 VEC_free (gimple
, heap
, id
->debug_stmts
);
2423 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2424 another function. */
2427 copy_tree_body (copy_body_data
*id
)
2429 tree fndecl
= id
->src_fn
;
2430 tree body
= DECL_SAVED_TREE (fndecl
);
2432 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2437 /* Make a copy of the body of FN so that it can be inserted inline in
2438 another function. */
2441 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2442 basic_block entry_block_map
, basic_block exit_block_map
,
2443 bitmap blocks_to_copy
, basic_block new_entry
)
2445 tree fndecl
= id
->src_fn
;
2448 /* If this body has a CFG, walk CFG and copy. */
2449 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl
)));
2450 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2451 blocks_to_copy
, new_entry
);
2452 copy_debug_stmts (id
);
2457 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2458 defined in function FN, or of a data member thereof. */
2461 self_inlining_addr_expr (tree value
, tree fn
)
2465 if (TREE_CODE (value
) != ADDR_EXPR
)
2468 var
= get_base_address (TREE_OPERAND (value
, 0));
2470 return var
&& auto_var_in_fn_p (var
, fn
);
2473 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2474 lexical block and line number information from base_stmt, if given,
2475 or from the last stmt of the block otherwise. */
2478 insert_init_debug_bind (copy_body_data
*id
,
2479 basic_block bb
, tree var
, tree value
,
2483 gimple_stmt_iterator gsi
;
2486 if (!gimple_in_ssa_p (id
->src_cfun
))
2489 if (!MAY_HAVE_DEBUG_STMTS
)
2492 tracked_var
= target_for_debug_bind (var
);
2498 gsi
= gsi_last_bb (bb
);
2499 if (!base_stmt
&& !gsi_end_p (gsi
))
2500 base_stmt
= gsi_stmt (gsi
);
2503 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2507 if (!gsi_end_p (gsi
))
2508 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2510 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2517 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2519 /* If VAR represents a zero-sized variable, it's possible that the
2520 assignment statement may result in no gimple statements. */
2523 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2525 /* We can end up with init statements that store to a non-register
2526 from a rhs with a conversion. Handle that here by forcing the
2527 rhs into a temporary. gimple_regimplify_operands is not
2528 prepared to do this for us. */
2529 if (!is_gimple_debug (init_stmt
)
2530 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2531 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2532 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2534 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2535 gimple_expr_type (init_stmt
),
2536 gimple_assign_rhs1 (init_stmt
));
2537 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2539 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2540 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2542 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2543 gimple_regimplify_operands (init_stmt
, &si
);
2544 mark_symbols_for_renaming (init_stmt
);
2546 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2548 tree var
, def
= gimple_assign_lhs (init_stmt
);
2550 if (TREE_CODE (def
) == SSA_NAME
)
2551 var
= SSA_NAME_VAR (def
);
2555 insert_init_debug_bind (id
, bb
, var
, def
, init_stmt
);
2560 /* Initialize parameter P with VALUE. If needed, produce init statement
2561 at the end of BB. When BB is NULL, we return init statement to be
2564 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2565 basic_block bb
, tree
*vars
)
2567 gimple init_stmt
= NULL
;
2570 tree def
= (gimple_in_ssa_p (cfun
)
2571 ? gimple_default_def (id
->src_cfun
, p
) : NULL
);
2574 && value
!= error_mark_node
2575 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2577 /* If we can match up types by promotion/demotion do so. */
2578 if (fold_convertible_p (TREE_TYPE (p
), value
))
2579 rhs
= fold_convert (TREE_TYPE (p
), value
);
2582 /* ??? For valid programs we should not end up here.
2583 Still if we end up with truly mismatched types here, fall back
2584 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2585 GIMPLE to the following passes. */
2586 if (!is_gimple_reg_type (TREE_TYPE (value
))
2587 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2588 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2590 rhs
= build_zero_cst (TREE_TYPE (p
));
2594 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2595 here since the type of this decl must be visible to the calling
2597 var
= copy_decl_to_var (p
, id
);
2599 /* We're actually using the newly-created var. */
2600 if (gimple_in_ssa_p (cfun
) && TREE_CODE (var
) == VAR_DECL
)
2601 add_referenced_var (var
);
2603 /* Declare this new variable. */
2604 DECL_CHAIN (var
) = *vars
;
2607 /* Make gimplifier happy about this variable. */
2608 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2610 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2611 we would not need to create a new variable here at all, if it
2612 weren't for debug info. Still, we can just use the argument
2614 if (TREE_READONLY (p
)
2615 && !TREE_ADDRESSABLE (p
)
2616 && value
&& !TREE_SIDE_EFFECTS (value
)
2619 /* We may produce non-gimple trees by adding NOPs or introduce
2620 invalid sharing when operand is not really constant.
2621 It is not big deal to prohibit constant propagation here as
2622 we will constant propagate in DOM1 pass anyway. */
2623 if (is_gimple_min_invariant (value
)
2624 && useless_type_conversion_p (TREE_TYPE (p
),
2626 /* We have to be very careful about ADDR_EXPR. Make sure
2627 the base variable isn't a local variable of the inlined
2628 function, e.g., when doing recursive inlining, direct or
2629 mutually-recursive or whatever, which is why we don't
2630 just test whether fn == current_function_decl. */
2631 && ! self_inlining_addr_expr (value
, fn
))
2633 insert_decl_map (id
, p
, value
);
2634 insert_debug_decl_map (id
, p
, var
);
2635 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2639 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2640 that way, when the PARM_DECL is encountered, it will be
2641 automatically replaced by the VAR_DECL. */
2642 insert_decl_map (id
, p
, var
);
2644 /* Even if P was TREE_READONLY, the new VAR should not be.
2645 In the original code, we would have constructed a
2646 temporary, and then the function body would have never
2647 changed the value of P. However, now, we will be
2648 constructing VAR directly. The constructor body may
2649 change its value multiple times as it is being
2650 constructed. Therefore, it must not be TREE_READONLY;
2651 the back-end assumes that TREE_READONLY variable is
2652 assigned to only once. */
2653 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2654 TREE_READONLY (var
) = 0;
2656 /* If there is no setup required and we are in SSA, take the easy route
2657 replacing all SSA names representing the function parameter by the
2658 SSA name passed to function.
2660 We need to construct map for the variable anyway as it might be used
2661 in different SSA names when parameter is set in function.
2663 Do replacement at -O0 for const arguments replaced by constant.
2664 This is important for builtin_constant_p and other construct requiring
2665 constant argument to be visible in inlined function body. */
2666 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2668 || (TREE_READONLY (p
)
2669 && is_gimple_min_invariant (rhs
)))
2670 && (TREE_CODE (rhs
) == SSA_NAME
2671 || is_gimple_min_invariant (rhs
))
2672 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2674 insert_decl_map (id
, def
, rhs
);
2675 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2678 /* If the value of argument is never used, don't care about initializing
2680 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2682 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2683 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2686 /* Initialize this VAR_DECL from the equivalent argument. Convert
2687 the argument to the proper type in case it was promoted. */
2690 if (rhs
== error_mark_node
)
2692 insert_decl_map (id
, p
, var
);
2693 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2696 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2698 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2699 keep our trees in gimple form. */
2700 if (def
&& gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2702 def
= remap_ssa_name (def
, id
);
2703 init_stmt
= gimple_build_assign (def
, rhs
);
2704 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2705 set_default_def (var
, NULL
);
2708 init_stmt
= gimple_build_assign (var
, rhs
);
2710 if (bb
&& init_stmt
)
2711 insert_init_stmt (id
, bb
, init_stmt
);
2716 /* Generate code to initialize the parameters of the function at the
2717 top of the stack in ID from the GIMPLE_CALL STMT. */
2720 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2721 tree fn
, basic_block bb
)
2726 tree vars
= NULL_TREE
;
2727 tree static_chain
= gimple_call_chain (stmt
);
2729 /* Figure out what the parameters are. */
2730 parms
= DECL_ARGUMENTS (fn
);
2732 /* Loop through the parameter declarations, replacing each with an
2733 equivalent VAR_DECL, appropriately initialized. */
2734 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2737 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2738 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2740 /* After remapping parameters remap their types. This has to be done
2741 in a second loop over all parameters to appropriately remap
2742 variable sized arrays when the size is specified in a
2743 parameter following the array. */
2744 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2746 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
2748 && TREE_CODE (*varp
) == VAR_DECL
)
2750 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
2751 ? gimple_default_def (id
->src_cfun
, p
) : NULL
);
2753 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
2754 /* Also remap the default definition if it was remapped
2755 to the default definition of the parameter replacement
2756 by the parameter setup. */
2759 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
2761 && TREE_CODE (*defp
) == SSA_NAME
2762 && SSA_NAME_VAR (*defp
) == var
)
2763 TREE_TYPE (*defp
) = TREE_TYPE (var
);
2768 /* Initialize the static chain. */
2769 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
2770 gcc_assert (fn
!= current_function_decl
);
2773 /* No static chain? Seems like a bug in tree-nested.c. */
2774 gcc_assert (static_chain
);
2776 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
2779 declare_inline_vars (id
->block
, vars
);
2783 /* Declare a return variable to replace the RESULT_DECL for the
2784 function we are calling. An appropriate DECL_STMT is returned.
2785 The USE_STMT is filled to contain a use of the declaration to
2786 indicate the return value of the function.
2788 RETURN_SLOT, if non-null is place where to store the result. It
2789 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2790 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2792 The return value is a (possibly null) value that holds the result
2793 as seen by the caller. */
2796 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
2797 basic_block entry_bb
)
2799 tree callee
= id
->src_fn
;
2800 tree result
= DECL_RESULT (callee
);
2801 tree callee_type
= TREE_TYPE (result
);
2805 /* Handle type-mismatches in the function declaration return type
2806 vs. the call expression. */
2808 caller_type
= TREE_TYPE (modify_dest
);
2810 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
2812 /* We don't need to do anything for functions that don't return
2814 if (!result
|| VOID_TYPE_P (callee_type
))
2817 /* If there was a return slot, then the return value is the
2818 dereferenced address of that object. */
2821 /* The front end shouldn't have used both return_slot and
2822 a modify expression. */
2823 gcc_assert (!modify_dest
);
2824 if (DECL_BY_REFERENCE (result
))
2826 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
2827 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
2829 /* We are going to construct *&return_slot and we can't do that
2830 for variables believed to be not addressable.
2832 FIXME: This check possibly can match, because values returned
2833 via return slot optimization are not believed to have address
2834 taken by alias analysis. */
2835 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
2836 var
= return_slot_addr
;
2841 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
2842 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
2844 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2845 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2846 && !DECL_GIMPLE_REG_P (result
)
2848 DECL_GIMPLE_REG_P (var
) = 0;
2853 /* All types requiring non-trivial constructors should have been handled. */
2854 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
2856 /* Attempt to avoid creating a new temporary variable. */
2858 && TREE_CODE (modify_dest
) != SSA_NAME
)
2860 bool use_it
= false;
2862 /* We can't use MODIFY_DEST if there's type promotion involved. */
2863 if (!useless_type_conversion_p (callee_type
, caller_type
))
2866 /* ??? If we're assigning to a variable sized type, then we must
2867 reuse the destination variable, because we've no good way to
2868 create variable sized temporaries at this point. */
2869 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
2872 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2873 reuse it as the result of the call directly. Don't do this if
2874 it would promote MODIFY_DEST to addressable. */
2875 else if (TREE_ADDRESSABLE (result
))
2879 tree base_m
= get_base_address (modify_dest
);
2881 /* If the base isn't a decl, then it's a pointer, and we don't
2882 know where that's going to go. */
2883 if (!DECL_P (base_m
))
2885 else if (is_global_var (base_m
))
2887 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2888 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2889 && !DECL_GIMPLE_REG_P (result
)
2890 && DECL_GIMPLE_REG_P (base_m
))
2892 else if (!TREE_ADDRESSABLE (base_m
))
2904 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
2906 var
= copy_result_decl_to_var (result
, id
);
2907 if (gimple_in_ssa_p (cfun
))
2908 add_referenced_var (var
);
2910 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2912 /* Do not have the rest of GCC warn about this variable as it should
2913 not be visible to the user. */
2914 TREE_NO_WARNING (var
) = 1;
2916 declare_inline_vars (id
->block
, var
);
2918 /* Build the use expr. If the return type of the function was
2919 promoted, convert it back to the expected type. */
2921 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
2923 /* If we can match up types by promotion/demotion do so. */
2924 if (fold_convertible_p (caller_type
, var
))
2925 use
= fold_convert (caller_type
, var
);
2928 /* ??? For valid programs we should not end up here.
2929 Still if we end up with truly mismatched types here, fall back
2930 to using a MEM_REF to not leak invalid GIMPLE to the following
2932 /* Prevent var from being written into SSA form. */
2933 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
2934 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
2935 DECL_GIMPLE_REG_P (var
) = false;
2936 else if (is_gimple_reg_type (TREE_TYPE (var
)))
2937 TREE_ADDRESSABLE (var
) = true;
2938 use
= fold_build2 (MEM_REF
, caller_type
,
2939 build_fold_addr_expr (var
),
2940 build_int_cst (ptr_type_node
, 0));
2944 STRIP_USELESS_TYPE_CONVERSION (use
);
2946 if (DECL_BY_REFERENCE (result
))
2948 TREE_ADDRESSABLE (var
) = 1;
2949 var
= build_fold_addr_expr (var
);
2953 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2954 way, when the RESULT_DECL is encountered, it will be
2955 automatically replaced by the VAR_DECL.
2957 When returning by reference, ensure that RESULT_DECL remaps to
2959 if (DECL_BY_REFERENCE (result
)
2960 && !is_gimple_val (var
))
2962 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
2963 if (gimple_in_ssa_p (id
->src_cfun
))
2964 add_referenced_var (temp
);
2965 insert_decl_map (id
, result
, temp
);
2966 /* When RESULT_DECL is in SSA form, we need to use it's default_def
2968 if (gimple_in_ssa_p (id
->src_cfun
) && gimple_default_def (id
->src_cfun
, result
))
2969 temp
= remap_ssa_name (gimple_default_def (id
->src_cfun
, result
), id
);
2970 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
2973 insert_decl_map (id
, result
, var
);
2975 /* Remember this so we can ignore it in remap_decls. */
2981 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2982 to a local label. */
2985 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
2988 tree fn
= (tree
) fnp
;
2990 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
2999 /* Determine if the function can be copied. If so return NULL. If
3000 not return a string describng the reason for failure. */
3003 copy_forbidden (struct function
*fun
, tree fndecl
)
3005 const char *reason
= fun
->cannot_be_copied_reason
;
3009 /* Only examine the function once. */
3010 if (fun
->cannot_be_copied_set
)
3013 /* We cannot copy a function that receives a non-local goto
3014 because we cannot remap the destination label used in the
3015 function that is performing the non-local goto. */
3016 /* ??? Actually, this should be possible, if we work at it.
3017 No doubt there's just a handful of places that simply
3018 assume it doesn't happen and don't substitute properly. */
3019 if (fun
->has_nonlocal_label
)
3021 reason
= G_("function %q+F can never be copied "
3022 "because it receives a non-local goto");
3026 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3027 if (TREE_CODE (decl
) == VAR_DECL
3028 && TREE_STATIC (decl
)
3029 && !DECL_EXTERNAL (decl
)
3030 && DECL_INITIAL (decl
)
3031 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3032 has_label_address_in_static_1
,
3035 reason
= G_("function %q+F can never be copied because it saves "
3036 "address of local label in a static variable");
3041 fun
->cannot_be_copied_reason
= reason
;
3042 fun
->cannot_be_copied_set
= true;
3047 static const char *inline_forbidden_reason
;
3049 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3050 iff a function can not be inlined. Also sets the reason why. */
3053 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3054 struct walk_stmt_info
*wip
)
3056 tree fn
= (tree
) wip
->info
;
3058 gimple stmt
= gsi_stmt (*gsi
);
3060 switch (gimple_code (stmt
))
3063 /* Refuse to inline alloca call unless user explicitly forced so as
3064 this may change program's memory overhead drastically when the
3065 function using alloca is called in loop. In GCC present in
3066 SPEC2000 inlining into schedule_block cause it to require 2GB of
3067 RAM instead of 256MB. Don't do so for alloca calls emitted for
3068 VLA objects as those can't cause unbounded growth (they're always
3069 wrapped inside stack_save/stack_restore regions. */
3070 if (gimple_alloca_call_p (stmt
)
3071 && !gimple_call_alloca_for_var_p (stmt
)
3072 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3074 inline_forbidden_reason
3075 = G_("function %q+F can never be inlined because it uses "
3076 "alloca (override using the always_inline attribute)");
3077 *handled_ops_p
= true;
3081 t
= gimple_call_fndecl (stmt
);
3085 /* We cannot inline functions that call setjmp. */
3086 if (setjmp_call_p (t
))
3088 inline_forbidden_reason
3089 = G_("function %q+F can never be inlined because it uses setjmp");
3090 *handled_ops_p
= true;
3094 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3095 switch (DECL_FUNCTION_CODE (t
))
3097 /* We cannot inline functions that take a variable number of
3099 case BUILT_IN_VA_START
:
3100 case BUILT_IN_NEXT_ARG
:
3101 case BUILT_IN_VA_END
:
3102 inline_forbidden_reason
3103 = G_("function %q+F can never be inlined because it "
3104 "uses variable argument lists");
3105 *handled_ops_p
= true;
3108 case BUILT_IN_LONGJMP
:
3109 /* We can't inline functions that call __builtin_longjmp at
3110 all. The non-local goto machinery really requires the
3111 destination be in a different function. If we allow the
3112 function calling __builtin_longjmp to be inlined into the
3113 function calling __builtin_setjmp, Things will Go Awry. */
3114 inline_forbidden_reason
3115 = G_("function %q+F can never be inlined because "
3116 "it uses setjmp-longjmp exception handling");
3117 *handled_ops_p
= true;
3120 case BUILT_IN_NONLOCAL_GOTO
:
3122 inline_forbidden_reason
3123 = G_("function %q+F can never be inlined because "
3124 "it uses non-local goto");
3125 *handled_ops_p
= true;
3128 case BUILT_IN_RETURN
:
3129 case BUILT_IN_APPLY_ARGS
:
3130 /* If a __builtin_apply_args caller would be inlined,
3131 it would be saving arguments of the function it has
3132 been inlined into. Similarly __builtin_return would
3133 return from the function the inline has been inlined into. */
3134 inline_forbidden_reason
3135 = G_("function %q+F can never be inlined because "
3136 "it uses __builtin_return or __builtin_apply_args");
3137 *handled_ops_p
= true;
3146 t
= gimple_goto_dest (stmt
);
3148 /* We will not inline a function which uses computed goto. The
3149 addresses of its local labels, which may be tucked into
3150 global storage, are of course not constant across
3151 instantiations, which causes unexpected behavior. */
3152 if (TREE_CODE (t
) != LABEL_DECL
)
3154 inline_forbidden_reason
3155 = G_("function %q+F can never be inlined "
3156 "because it contains a computed goto");
3157 *handled_ops_p
= true;
3166 *handled_ops_p
= false;
3170 /* Return true if FNDECL is a function that cannot be inlined into
3174 inline_forbidden_p (tree fndecl
)
3176 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3177 struct walk_stmt_info wi
;
3178 struct pointer_set_t
*visited_nodes
;
3180 bool forbidden_p
= false;
3182 /* First check for shared reasons not to copy the code. */
3183 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3184 if (inline_forbidden_reason
!= NULL
)
3187 /* Next, walk the statements of the function looking for
3188 constraucts we can't handle, or are non-optimal for inlining. */
3189 visited_nodes
= pointer_set_create ();
3190 memset (&wi
, 0, sizeof (wi
));
3191 wi
.info
= (void *) fndecl
;
3192 wi
.pset
= visited_nodes
;
3194 FOR_EACH_BB_FN (bb
, fun
)
3197 gimple_seq seq
= bb_seq (bb
);
3198 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3199 forbidden_p
= (ret
!= NULL
);
3204 pointer_set_destroy (visited_nodes
);
3208 /* Returns nonzero if FN is a function that does not have any
3209 fundamental inline blocking properties. */
3212 tree_inlinable_function_p (tree fn
)
3214 bool inlinable
= true;
3218 /* If we've already decided this function shouldn't be inlined,
3219 there's no need to check again. */
3220 if (DECL_UNINLINABLE (fn
))
3223 /* We only warn for functions declared `inline' by the user. */
3224 do_warning
= (warn_inline
3225 && DECL_DECLARED_INLINE_P (fn
)
3226 && !DECL_NO_INLINE_WARNING_P (fn
)
3227 && !DECL_IN_SYSTEM_HEADER (fn
));
3229 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3232 && always_inline
== NULL
)
3235 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3236 "is suppressed using -fno-inline", fn
);
3240 else if (!function_attribute_inlinable_p (fn
))
3243 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3244 "uses attributes conflicting with inlining", fn
);
3248 else if (inline_forbidden_p (fn
))
3250 /* See if we should warn about uninlinable functions. Previously,
3251 some of these warnings would be issued while trying to expand
3252 the function inline, but that would cause multiple warnings
3253 about functions that would for example call alloca. But since
3254 this a property of the function, just one warning is enough.
3255 As a bonus we can now give more details about the reason why a
3256 function is not inlinable. */
3258 error (inline_forbidden_reason
, fn
);
3259 else if (do_warning
)
3260 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3265 /* Squirrel away the result so that we don't have to check again. */
3266 DECL_UNINLINABLE (fn
) = !inlinable
;
3271 /* Estimate the cost of a memory move. Use machine dependent
3272 word size and take possible memcpy call into account. */
3275 estimate_move_cost (tree type
)
3279 gcc_assert (!VOID_TYPE_P (type
));
3281 if (TREE_CODE (type
) == VECTOR_TYPE
)
3283 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3284 enum machine_mode simd
3285 = targetm
.vectorize
.preferred_simd_mode (inner
);
3286 int simd_mode_size
= GET_MODE_SIZE (simd
);
3287 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3291 size
= int_size_in_bytes (type
);
3293 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3294 /* Cost of a memcpy call, 3 arguments and the call. */
3297 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3300 /* Returns cost of operation CODE, according to WEIGHTS */
3303 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3304 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3308 /* These are "free" conversions, or their presumed cost
3309 is folded into other operations. */
3314 case VIEW_CONVERT_EXPR
:
3317 /* Assign cost of 1 to usual operations.
3318 ??? We may consider mapping RTL costs to this. */
3324 case POINTER_PLUS_EXPR
:
3329 case ADDR_SPACE_CONVERT_EXPR
:
3330 case FIXED_CONVERT_EXPR
:
3331 case FIX_TRUNC_EXPR
:
3343 case VEC_LSHIFT_EXPR
:
3344 case VEC_RSHIFT_EXPR
:
3351 case TRUTH_ANDIF_EXPR
:
3352 case TRUTH_ORIF_EXPR
:
3353 case TRUTH_AND_EXPR
:
3355 case TRUTH_XOR_EXPR
:
3356 case TRUTH_NOT_EXPR
:
3365 case UNORDERED_EXPR
:
3376 case PREDECREMENT_EXPR
:
3377 case PREINCREMENT_EXPR
:
3378 case POSTDECREMENT_EXPR
:
3379 case POSTINCREMENT_EXPR
:
3381 case REALIGN_LOAD_EXPR
:
3383 case REDUC_MAX_EXPR
:
3384 case REDUC_MIN_EXPR
:
3385 case REDUC_PLUS_EXPR
:
3386 case WIDEN_SUM_EXPR
:
3387 case WIDEN_MULT_EXPR
:
3389 case WIDEN_MULT_PLUS_EXPR
:
3390 case WIDEN_MULT_MINUS_EXPR
:
3391 case WIDEN_LSHIFT_EXPR
:
3393 case VEC_WIDEN_MULT_HI_EXPR
:
3394 case VEC_WIDEN_MULT_LO_EXPR
:
3395 case VEC_UNPACK_HI_EXPR
:
3396 case VEC_UNPACK_LO_EXPR
:
3397 case VEC_UNPACK_FLOAT_HI_EXPR
:
3398 case VEC_UNPACK_FLOAT_LO_EXPR
:
3399 case VEC_PACK_TRUNC_EXPR
:
3400 case VEC_PACK_SAT_EXPR
:
3401 case VEC_PACK_FIX_TRUNC_EXPR
:
3402 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3403 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3407 /* Few special cases of expensive operations. This is useful
3408 to avoid inlining on functions having too many of these. */
3409 case TRUNC_DIV_EXPR
:
3411 case FLOOR_DIV_EXPR
:
3412 case ROUND_DIV_EXPR
:
3413 case EXACT_DIV_EXPR
:
3414 case TRUNC_MOD_EXPR
:
3416 case FLOOR_MOD_EXPR
:
3417 case ROUND_MOD_EXPR
:
3419 if (TREE_CODE (op2
) != INTEGER_CST
)
3420 return weights
->div_mod_cost
;
3424 /* We expect a copy assignment with no operator. */
3425 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3431 /* Estimate number of instructions that will be created by expanding
3432 the statements in the statement sequence STMTS.
3433 WEIGHTS contains weights attributed to various constructs. */
3436 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3439 gimple_stmt_iterator gsi
;
3442 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3443 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3449 /* Estimate number of instructions that will be created by expanding STMT.
3450 WEIGHTS contains weights attributed to various constructs. */
3453 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3456 enum gimple_code code
= gimple_code (stmt
);
3463 /* Try to estimate the cost of assignments. We have three cases to
3465 1) Simple assignments to registers;
3466 2) Stores to things that must live in memory. This includes
3467 "normal" stores to scalars, but also assignments of large
3468 structures, or constructors of big arrays;
3470 Let us look at the first two cases, assuming we have "a = b + C":
3471 <GIMPLE_ASSIGN <var_decl "a">
3472 <plus_expr <var_decl "b"> <constant C>>
3473 If "a" is a GIMPLE register, the assignment to it is free on almost
3474 any target, because "a" usually ends up in a real register. Hence
3475 the only cost of this expression comes from the PLUS_EXPR, and we
3476 can ignore the GIMPLE_ASSIGN.
3477 If "a" is not a GIMPLE register, the assignment to "a" will most
3478 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3479 of moving something into "a", which we compute using the function
3480 estimate_move_cost. */
3481 if (gimple_clobber_p (stmt
))
3482 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3484 lhs
= gimple_assign_lhs (stmt
);
3485 rhs
= gimple_assign_rhs1 (stmt
);
3487 if (is_gimple_reg (lhs
))
3490 cost
= estimate_move_cost (TREE_TYPE (lhs
));
3492 if (!is_gimple_reg (rhs
) && !is_gimple_min_invariant (rhs
))
3493 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3495 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3496 gimple_assign_rhs1 (stmt
),
3497 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3498 == GIMPLE_BINARY_RHS
3499 ? gimple_assign_rhs2 (stmt
) : NULL
);
3503 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3504 gimple_op (stmt
, 0),
3505 gimple_op (stmt
, 1));
3509 /* Take into account cost of the switch + guess 2 conditional jumps for
3512 TODO: once the switch expansion logic is sufficiently separated, we can
3513 do better job on estimating cost of the switch. */
3514 if (weights
->time_based
)
3515 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3517 cost
= gimple_switch_num_labels (stmt
) * 2;
3522 tree decl
= gimple_call_fndecl (stmt
);
3523 struct cgraph_node
*node
= NULL
;
3525 /* Do not special case builtins where we see the body.
3526 This just confuse inliner. */
3527 if (!decl
|| !(node
= cgraph_get_node (decl
)) || node
->analyzed
)
3529 /* For buitins that are likely expanded to nothing or
3530 inlined do not account operand costs. */
3531 else if (is_simple_builtin (decl
))
3533 else if (is_inexpensive_builtin (decl
))
3534 return weights
->target_builtin_call_cost
;
3535 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3537 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3538 specialize the cheap expansion we do here.
3539 ??? This asks for a more general solution. */
3540 switch (DECL_FUNCTION_CODE (decl
))
3545 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3546 && REAL_VALUES_EQUAL
3547 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3548 return estimate_operator_cost (MULT_EXPR
, weights
,
3549 gimple_call_arg (stmt
, 0),
3550 gimple_call_arg (stmt
, 0));
3558 cost
= node
? weights
->call_cost
: weights
->indirect_call_cost
;
3559 if (gimple_call_lhs (stmt
))
3560 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3561 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3563 tree arg
= gimple_call_arg (stmt
, i
);
3564 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3570 return weights
->return_cost
;
3576 case GIMPLE_PREDICT
:
3581 return asm_str_count (gimple_asm_string (stmt
));
3584 /* This is either going to be an external function call with one
3585 argument, or two register copy statements plus a goto. */
3588 case GIMPLE_EH_DISPATCH
:
3589 /* ??? This is going to turn into a switch statement. Ideally
3590 we'd have a look at the eh region and estimate the number of
3595 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3597 case GIMPLE_EH_FILTER
:
3598 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3601 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3604 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3605 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3607 /* OpenMP directives are generally very expensive. */
3609 case GIMPLE_OMP_RETURN
:
3610 case GIMPLE_OMP_SECTIONS_SWITCH
:
3611 case GIMPLE_OMP_ATOMIC_STORE
:
3612 case GIMPLE_OMP_CONTINUE
:
3613 /* ...except these, which are cheap. */
3616 case GIMPLE_OMP_ATOMIC_LOAD
:
3617 return weights
->omp_cost
;
3619 case GIMPLE_OMP_FOR
:
3620 return (weights
->omp_cost
3621 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3622 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3624 case GIMPLE_OMP_PARALLEL
:
3625 case GIMPLE_OMP_TASK
:
3626 case GIMPLE_OMP_CRITICAL
:
3627 case GIMPLE_OMP_MASTER
:
3628 case GIMPLE_OMP_ORDERED
:
3629 case GIMPLE_OMP_SECTION
:
3630 case GIMPLE_OMP_SECTIONS
:
3631 case GIMPLE_OMP_SINGLE
:
3632 return (weights
->omp_cost
3633 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3635 case GIMPLE_TRANSACTION
:
3636 return (weights
->tm_cost
3637 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3647 /* Estimate number of instructions that will be created by expanding
3648 function FNDECL. WEIGHTS contains weights attributed to various
3652 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3654 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3655 gimple_stmt_iterator bsi
;
3659 gcc_assert (my_function
&& my_function
->cfg
);
3660 FOR_EACH_BB_FN (bb
, my_function
)
3662 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3663 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3670 /* Initializes weights used by estimate_num_insns. */
3673 init_inline_once (void)
3675 eni_size_weights
.call_cost
= 1;
3676 eni_size_weights
.indirect_call_cost
= 3;
3677 eni_size_weights
.target_builtin_call_cost
= 1;
3678 eni_size_weights
.div_mod_cost
= 1;
3679 eni_size_weights
.omp_cost
= 40;
3680 eni_size_weights
.tm_cost
= 10;
3681 eni_size_weights
.time_based
= false;
3682 eni_size_weights
.return_cost
= 1;
3684 /* Estimating time for call is difficult, since we have no idea what the
3685 called function does. In the current uses of eni_time_weights,
3686 underestimating the cost does less harm than overestimating it, so
3687 we choose a rather small value here. */
3688 eni_time_weights
.call_cost
= 10;
3689 eni_time_weights
.indirect_call_cost
= 15;
3690 eni_time_weights
.target_builtin_call_cost
= 1;
3691 eni_time_weights
.div_mod_cost
= 10;
3692 eni_time_weights
.omp_cost
= 40;
3693 eni_time_weights
.tm_cost
= 40;
3694 eni_time_weights
.time_based
= true;
3695 eni_time_weights
.return_cost
= 2;
3698 /* Estimate the number of instructions in a gimple_seq. */
3701 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3703 gimple_stmt_iterator gsi
;
3705 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3706 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3712 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3715 prepend_lexical_block (tree current_block
, tree new_block
)
3717 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
3718 BLOCK_SUBBLOCKS (current_block
) = new_block
;
3719 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
3722 /* Add local variables from CALLEE to CALLER. */
3725 add_local_variables (struct function
*callee
, struct function
*caller
,
3726 copy_body_data
*id
, bool check_var_ann
)
3731 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
3732 if (TREE_STATIC (var
) && !TREE_ASM_WRITTEN (var
))
3735 || (var_ann (var
) && add_referenced_var (var
)))
3736 add_local_decl (caller
, var
);
3738 else if (!can_be_nonlocal (var
, id
))
3740 tree new_var
= remap_decl (var
, id
);
3742 /* Remap debug-expressions. */
3743 if (TREE_CODE (new_var
) == VAR_DECL
3744 && DECL_DEBUG_EXPR_IS_FROM (new_var
)
3747 tree tem
= DECL_DEBUG_EXPR (var
);
3748 bool old_regimplify
= id
->regimplify
;
3749 id
->remapping_type_depth
++;
3750 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
3751 id
->remapping_type_depth
--;
3752 id
->regimplify
= old_regimplify
;
3753 SET_DECL_DEBUG_EXPR (new_var
, tem
);
3755 add_local_decl (caller
, new_var
);
3759 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3762 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
3766 struct pointer_map_t
*st
, *dst
;
3769 location_t saved_location
;
3770 struct cgraph_edge
*cg_edge
;
3771 cgraph_inline_failed_t reason
;
3772 basic_block return_block
;
3774 gimple_stmt_iterator gsi
, stmt_gsi
;
3775 bool successfully_inlined
= FALSE
;
3776 bool purge_dead_abnormal_edges
;
3778 /* Set input_location here so we get the right instantiation context
3779 if we call instantiate_decl from inlinable_function_p. */
3780 saved_location
= input_location
;
3781 if (gimple_has_location (stmt
))
3782 input_location
= gimple_location (stmt
);
3784 /* From here on, we're only interested in CALL_EXPRs. */
3785 if (gimple_code (stmt
) != GIMPLE_CALL
)
3788 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
3789 gcc_checking_assert (cg_edge
);
3790 /* First, see if we can figure out what function is being called.
3791 If we cannot, then there is no hope of inlining the function. */
3792 if (cg_edge
->indirect_unknown_callee
)
3794 fn
= cg_edge
->callee
->decl
;
3795 gcc_checking_assert (fn
);
3797 /* If FN is a declaration of a function in a nested scope that was
3798 globally declared inline, we don't set its DECL_INITIAL.
3799 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3800 C++ front-end uses it for cdtors to refer to their internal
3801 declarations, that are not real functions. Fortunately those
3802 don't have trees to be saved, so we can tell by checking their
3804 if (!DECL_INITIAL (fn
)
3805 && DECL_ABSTRACT_ORIGIN (fn
)
3806 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
3807 fn
= DECL_ABSTRACT_ORIGIN (fn
);
3809 /* Don't try to inline functions that are not well-suited to inlining. */
3810 if (!cgraph_inline_p (cg_edge
, &reason
))
3812 /* If this call was originally indirect, we do not want to emit any
3813 inlining related warnings or sorry messages because there are no
3814 guarantees regarding those. */
3815 if (cg_edge
->indirect_inlining_edge
)
3818 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
3819 /* Avoid warnings during early inline pass. */
3820 && cgraph_global_info_ready
3821 /* PR 20090218-1_0.c. Body can be provided by another module. */
3822 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
3824 error ("inlining failed in call to always_inline %q+F: %s", fn
,
3825 cgraph_inline_failed_string (reason
));
3826 error ("called from here");
3828 else if (warn_inline
3829 && DECL_DECLARED_INLINE_P (fn
)
3830 && !DECL_NO_INLINE_WARNING_P (fn
)
3831 && !DECL_IN_SYSTEM_HEADER (fn
)
3832 && reason
!= CIF_UNSPECIFIED
3833 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
3834 /* Do not warn about not inlined recursive calls. */
3835 && !cgraph_edge_recursive_p (cg_edge
)
3836 /* Avoid warnings during early inline pass. */
3837 && cgraph_global_info_ready
)
3839 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
3840 fn
, _(cgraph_inline_failed_string (reason
)));
3841 warning (OPT_Winline
, "called from here");
3845 fn
= cg_edge
->callee
->decl
;
3847 #ifdef ENABLE_CHECKING
3848 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
3849 verify_cgraph_node (cg_edge
->callee
);
3852 /* We will be inlining this callee. */
3853 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
3855 /* Update the callers EH personality. */
3856 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
3857 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
3858 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
3860 /* Split the block holding the GIMPLE_CALL. */
3861 e
= split_block (bb
, stmt
);
3863 return_block
= e
->dest
;
3866 /* split_block splits after the statement; work around this by
3867 moving the call into the second block manually. Not pretty,
3868 but seems easier than doing the CFG manipulation by hand
3869 when the GIMPLE_CALL is in the last statement of BB. */
3870 stmt_gsi
= gsi_last_bb (bb
);
3871 gsi_remove (&stmt_gsi
, false);
3873 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3874 been the source of abnormal edges. In this case, schedule
3875 the removal of dead abnormal edges. */
3876 gsi
= gsi_start_bb (return_block
);
3877 if (gsi_end_p (gsi
))
3879 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
3880 purge_dead_abnormal_edges
= true;
3884 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
3885 purge_dead_abnormal_edges
= false;
3888 stmt_gsi
= gsi_start_bb (return_block
);
3890 /* Build a block containing code to initialize the arguments, the
3891 actual inline expansion of the body, and a label for the return
3892 statements within the function to jump to. The type of the
3893 statement expression is the return type of the function call. */
3894 id
->block
= make_node (BLOCK
);
3895 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
3896 BLOCK_SOURCE_LOCATION (id
->block
) = input_location
;
3897 prepend_lexical_block (gimple_block (stmt
), id
->block
);
3899 /* Local declarations will be replaced by their equivalents in this
3902 id
->decl_map
= pointer_map_create ();
3903 dst
= id
->debug_map
;
3904 id
->debug_map
= NULL
;
3906 /* Record the function we are about to inline. */
3908 id
->src_node
= cg_edge
->callee
;
3909 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
3910 id
->gimple_call
= stmt
;
3912 gcc_assert (!id
->src_cfun
->after_inlining
);
3915 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
3917 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3918 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
3922 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
3924 if (DECL_INITIAL (fn
))
3925 prepend_lexical_block (id
->block
, remap_blocks (DECL_INITIAL (fn
), id
));
3927 /* Return statements in the function body will be replaced by jumps
3928 to the RET_LABEL. */
3929 gcc_assert (DECL_INITIAL (fn
));
3930 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
3932 /* Find the LHS to which the result of this call is assigned. */
3934 if (gimple_call_lhs (stmt
))
3936 modify_dest
= gimple_call_lhs (stmt
);
3938 /* The function which we are inlining might not return a value,
3939 in which case we should issue a warning that the function
3940 does not return a value. In that case the optimizers will
3941 see that the variable to which the value is assigned was not
3942 initialized. We do not want to issue a warning about that
3943 uninitialized variable. */
3944 if (DECL_P (modify_dest
))
3945 TREE_NO_WARNING (modify_dest
) = 1;
3947 if (gimple_call_return_slot_opt_p (stmt
))
3949 return_slot
= modify_dest
;
3956 /* If we are inlining a call to the C++ operator new, we don't want
3957 to use type based alias analysis on the return value. Otherwise
3958 we may get confused if the compiler sees that the inlined new
3959 function returns a pointer which was just deleted. See bug
3961 if (DECL_IS_OPERATOR_NEW (fn
))
3967 /* Declare the return variable for the function. */
3968 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
3970 /* Add local vars in this inlined callee to caller. */
3971 add_local_variables (id
->src_cfun
, cfun
, id
, true);
3973 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
3975 fprintf (dump_file
, "Inlining ");
3976 print_generic_expr (dump_file
, id
->src_fn
, 0);
3977 fprintf (dump_file
, " to ");
3978 print_generic_expr (dump_file
, id
->dst_fn
, 0);
3979 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
3982 /* This is it. Duplicate the callee body. Assume callee is
3983 pre-gimplified. Note that we must not alter the caller
3984 function in any way before this point, as this CALL_EXPR may be
3985 a self-referential call; if we're calling ourselves, we need to
3986 duplicate our body before altering anything. */
3987 copy_body (id
, bb
->count
,
3988 cg_edge
->frequency
* REG_BR_PROB_BASE
/ CGRAPH_FREQ_BASE
,
3989 bb
, return_block
, NULL
, NULL
);
3991 /* Reset the escaped solution. */
3992 if (cfun
->gimple_df
)
3993 pt_solution_reset (&cfun
->gimple_df
->escaped
);
3998 pointer_map_destroy (id
->debug_map
);
3999 id
->debug_map
= dst
;
4001 pointer_map_destroy (id
->decl_map
);
4004 /* Unlink the calls virtual operands before replacing it. */
4005 unlink_stmt_vdef (stmt
);
4007 /* If the inlined function returns a result that we care about,
4008 substitute the GIMPLE_CALL with an assignment of the return
4009 variable to the LHS of the call. That is, if STMT was
4010 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4011 if (use_retvar
&& gimple_call_lhs (stmt
))
4013 gimple old_stmt
= stmt
;
4014 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4015 gsi_replace (&stmt_gsi
, stmt
, false);
4016 if (gimple_in_ssa_p (cfun
))
4017 mark_symbols_for_renaming (stmt
);
4018 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4022 /* Handle the case of inlining a function with no return
4023 statement, which causes the return value to become undefined. */
4024 if (gimple_call_lhs (stmt
)
4025 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4027 tree name
= gimple_call_lhs (stmt
);
4028 tree var
= SSA_NAME_VAR (name
);
4029 tree def
= gimple_default_def (cfun
, var
);
4033 /* If the variable is used undefined, make this name
4034 undefined via a move. */
4035 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4036 gsi_replace (&stmt_gsi
, stmt
, true);
4040 /* Otherwise make this variable undefined. */
4041 gsi_remove (&stmt_gsi
, true);
4042 set_default_def (var
, name
);
4043 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4047 gsi_remove (&stmt_gsi
, true);
4050 if (purge_dead_abnormal_edges
)
4052 gimple_purge_dead_eh_edges (return_block
);
4053 gimple_purge_dead_abnormal_call_edges (return_block
);
4056 /* If the value of the new expression is ignored, that's OK. We
4057 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4058 the equivalent inlined version either. */
4059 if (is_gimple_assign (stmt
))
4061 gcc_assert (gimple_assign_single_p (stmt
)
4062 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4063 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4066 /* Output the inlining info for this abstract function, since it has been
4067 inlined. If we don't do this now, we can lose the information about the
4068 variables in the function when the blocks get blown away as soon as we
4069 remove the cgraph node. */
4070 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4072 /* Update callgraph if needed. */
4073 cgraph_remove_node (cg_edge
->callee
);
4075 id
->block
= NULL_TREE
;
4076 successfully_inlined
= TRUE
;
4079 input_location
= saved_location
;
4080 return successfully_inlined
;
4083 /* Expand call statements reachable from STMT_P.
4084 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4085 in a MODIFY_EXPR. */
4088 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4090 gimple_stmt_iterator gsi
;
4092 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4094 gimple stmt
= gsi_stmt (gsi
);
4096 if (is_gimple_call (stmt
)
4097 && expand_call_inline (bb
, stmt
, id
))
4105 /* Walk all basic blocks created after FIRST and try to fold every statement
4106 in the STATEMENTS pointer set. */
4109 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4111 for (; first
< n_basic_blocks
; first
++)
4112 if (BASIC_BLOCK (first
))
4114 gimple_stmt_iterator gsi
;
4116 for (gsi
= gsi_start_bb (BASIC_BLOCK (first
));
4119 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4121 gimple old_stmt
= gsi_stmt (gsi
);
4122 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4124 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4126 /* Folding builtins can create multiple instructions,
4127 we need to look at all of them. */
4128 gimple_stmt_iterator i2
= gsi
;
4130 if (fold_stmt (&gsi
))
4133 /* If a builtin at the end of a bb folded into nothing,
4134 the following loop won't work. */
4135 if (gsi_end_p (gsi
))
4137 cgraph_update_edges_for_call_stmt (old_stmt
,
4142 i2
= gsi_start_bb (BASIC_BLOCK (first
));
4147 new_stmt
= gsi_stmt (i2
);
4148 update_stmt (new_stmt
);
4149 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4152 if (new_stmt
== gsi_stmt (gsi
))
4154 /* It is okay to check only for the very last
4155 of these statements. If it is a throwing
4156 statement nothing will change. If it isn't
4157 this can remove EH edges. If that weren't
4158 correct then because some intermediate stmts
4159 throw, but not the last one. That would mean
4160 we'd have to split the block, which we can't
4161 here and we'd loose anyway. And as builtins
4162 probably never throw, this all
4164 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4166 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4173 else if (fold_stmt (&gsi
))
4175 /* Re-read the statement from GSI as fold_stmt() may
4177 gimple new_stmt
= gsi_stmt (gsi
);
4178 update_stmt (new_stmt
);
4180 if (is_gimple_call (old_stmt
)
4181 || is_gimple_call (new_stmt
))
4182 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4185 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4186 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4192 /* Return true if BB has at least one abnormal outgoing edge. */
4195 has_abnormal_outgoing_edge_p (basic_block bb
)
4200 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4201 if (e
->flags
& EDGE_ABNORMAL
)
4207 /* Expand calls to inline functions in the body of FN. */
4210 optimize_inline_calls (tree fn
)
4214 int last
= n_basic_blocks
;
4215 struct gimplify_ctx gctx
;
4216 bool inlined_p
= false;
4219 memset (&id
, 0, sizeof (id
));
4221 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4222 gcc_assert (id
.dst_node
->analyzed
);
4224 /* Or any functions that aren't finished yet. */
4225 if (current_function_decl
)
4226 id
.dst_fn
= current_function_decl
;
4228 id
.copy_decl
= copy_decl_maybe_to_var
;
4229 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4230 id
.transform_new_cfg
= false;
4231 id
.transform_return_to_modify
= true;
4232 id
.transform_lang_insert_block
= NULL
;
4233 id
.statements_to_fold
= pointer_set_create ();
4235 push_gimplify_context (&gctx
);
4237 /* We make no attempts to keep dominance info up-to-date. */
4238 free_dominance_info (CDI_DOMINATORS
);
4239 free_dominance_info (CDI_POST_DOMINATORS
);
4241 /* Register specific gimple functions. */
4242 gimple_register_cfg_hooks ();
4244 /* Reach the trees by walking over the CFG, and note the
4245 enclosing basic-blocks in the call edges. */
4246 /* We walk the blocks going forward, because inlined function bodies
4247 will split id->current_basic_block, and the new blocks will
4248 follow it; we'll trudge through them, processing their CALL_EXPRs
4251 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4253 pop_gimplify_context (NULL
);
4255 #ifdef ENABLE_CHECKING
4257 struct cgraph_edge
*e
;
4259 verify_cgraph_node (id
.dst_node
);
4261 /* Double check that we inlined everything we are supposed to inline. */
4262 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4263 gcc_assert (e
->inline_failed
);
4267 /* Fold queued statements. */
4268 fold_marked_statements (last
, id
.statements_to_fold
);
4269 pointer_set_destroy (id
.statements_to_fold
);
4271 gcc_assert (!id
.debug_stmts
);
4273 /* If we didn't inline into the function there is nothing to do. */
4277 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4280 delete_unreachable_blocks_update_callgraph (&id
);
4281 #ifdef ENABLE_CHECKING
4282 verify_cgraph_node (id
.dst_node
);
4285 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4286 not possible yet - the IPA passes might make various functions to not
4287 throw and they don't care to proactively update local EH info. This is
4288 done later in fixup_cfg pass that also execute the verification. */
4289 return (TODO_update_ssa
4291 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4292 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4293 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
4296 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4299 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4301 enum tree_code code
= TREE_CODE (*tp
);
4302 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4304 /* We make copies of most nodes. */
4305 if (IS_EXPR_CODE_CLASS (cl
)
4306 || code
== TREE_LIST
4308 || code
== TYPE_DECL
4309 || code
== OMP_CLAUSE
)
4311 /* Because the chain gets clobbered when we make a copy, we save it
4313 tree chain
= NULL_TREE
, new_tree
;
4315 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4316 chain
= TREE_CHAIN (*tp
);
4318 /* Copy the node. */
4319 new_tree
= copy_node (*tp
);
4321 /* Propagate mudflap marked-ness. */
4322 if (flag_mudflap
&& mf_marked_p (*tp
))
4327 /* Now, restore the chain, if appropriate. That will cause
4328 walk_tree to walk into the chain as well. */
4329 if (code
== PARM_DECL
4330 || code
== TREE_LIST
4331 || code
== OMP_CLAUSE
)
4332 TREE_CHAIN (*tp
) = chain
;
4334 /* For now, we don't update BLOCKs when we make copies. So, we
4335 have to nullify all BIND_EXPRs. */
4336 if (TREE_CODE (*tp
) == BIND_EXPR
)
4337 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4339 else if (code
== CONSTRUCTOR
)
4341 /* CONSTRUCTOR nodes need special handling because
4342 we need to duplicate the vector of elements. */
4345 new_tree
= copy_node (*tp
);
4347 /* Propagate mudflap marked-ness. */
4348 if (flag_mudflap
&& mf_marked_p (*tp
))
4351 CONSTRUCTOR_ELTS (new_tree
) = VEC_copy (constructor_elt
, gc
,
4352 CONSTRUCTOR_ELTS (*tp
));
4355 else if (code
== STATEMENT_LIST
)
4356 /* We used to just abort on STATEMENT_LIST, but we can run into them
4357 with statement-expressions (c++/40975). */
4358 copy_statement_list (tp
);
4359 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4361 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4363 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4368 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4369 information indicating to what new SAVE_EXPR this one should be mapped,
4370 use that one. Otherwise, create a new node and enter it in ST. FN is
4371 the function into which the copy will be placed. */
4374 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4376 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4380 /* See if we already encountered this SAVE_EXPR. */
4381 n
= (tree
*) pointer_map_contains (st
, *tp
);
4383 /* If we didn't already remap this SAVE_EXPR, do so now. */
4386 t
= copy_node (*tp
);
4388 /* Remember this SAVE_EXPR. */
4389 *pointer_map_insert (st
, *tp
) = t
;
4390 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4391 *pointer_map_insert (st
, t
) = t
;
4395 /* We've already walked into this SAVE_EXPR; don't do it again. */
4400 /* Replace this SAVE_EXPR with the copy. */
4404 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4405 copies the declaration and enters it in the splay_tree in DATA (which is
4406 really an `copy_body_data *'). */
4409 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
4412 copy_body_data
*id
= (copy_body_data
*) data
;
4414 /* Don't walk into types. */
4418 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
4420 tree decl
= TREE_OPERAND (*tp
, 0);
4422 /* Copy the decl and remember the copy. */
4423 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4429 /* Perform any modifications to EXPR required when it is unsaved. Does
4430 not recurse into EXPR's subtrees. */
4433 unsave_expr_1 (tree expr
)
4435 switch (TREE_CODE (expr
))
4438 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4439 It's OK for this to happen if it was part of a subtree that
4440 isn't immediately expanded, such as operand 2 of another
4442 if (TREE_OPERAND (expr
, 1))
4445 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4446 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4454 /* Called via walk_tree when an expression is unsaved. Using the
4455 splay_tree pointed to by ST (which is really a `splay_tree'),
4456 remaps all local declarations to appropriate replacements. */
4459 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
4461 copy_body_data
*id
= (copy_body_data
*) data
;
4462 struct pointer_map_t
*st
= id
->decl_map
;
4465 /* Only a local declaration (variable or label). */
4466 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
4467 || TREE_CODE (*tp
) == LABEL_DECL
)
4469 /* Lookup the declaration. */
4470 n
= (tree
*) pointer_map_contains (st
, *tp
);
4472 /* If it's there, remap it. */
4477 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
4479 else if (TREE_CODE (*tp
) == BIND_EXPR
)
4480 copy_bind_expr (tp
, walk_subtrees
, id
);
4481 else if (TREE_CODE (*tp
) == SAVE_EXPR
4482 || TREE_CODE (*tp
) == TARGET_EXPR
)
4483 remap_save_expr (tp
, st
, walk_subtrees
);
4486 copy_tree_r (tp
, walk_subtrees
, NULL
);
4488 /* Do whatever unsaving is required. */
4489 unsave_expr_1 (*tp
);
4492 /* Keep iterating. */
4496 /* Copies everything in EXPR and replaces variables, labels
4497 and SAVE_EXPRs local to EXPR. */
4500 unsave_expr_now (tree expr
)
4504 /* There's nothing to do for NULL_TREE. */
4509 memset (&id
, 0, sizeof (id
));
4510 id
.src_fn
= current_function_decl
;
4511 id
.dst_fn
= current_function_decl
;
4512 id
.decl_map
= pointer_map_create ();
4513 id
.debug_map
= NULL
;
4515 id
.copy_decl
= copy_decl_no_change
;
4516 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4517 id
.transform_new_cfg
= false;
4518 id
.transform_return_to_modify
= false;
4519 id
.transform_lang_insert_block
= NULL
;
4521 /* Walk the tree once to find local labels. */
4522 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
4524 /* Walk the tree again, copying, remapping, and unsaving. */
4525 walk_tree (&expr
, unsave_r
, &id
, NULL
);
4528 pointer_map_destroy (id
.decl_map
);
4530 pointer_map_destroy (id
.debug_map
);
4535 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4536 label, copies the declaration and enters it in the splay_tree in DATA (which
4537 is really a 'copy_body_data *'. */
4540 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4541 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4542 struct walk_stmt_info
*wi
)
4544 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4545 gimple stmt
= gsi_stmt (*gsip
);
4547 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4549 tree decl
= gimple_label_label (stmt
);
4551 /* Copy the decl and remember the copy. */
4552 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4559 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4560 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4561 remaps all local declarations to appropriate replacements in gimple
4565 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4567 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4568 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4569 struct pointer_map_t
*st
= id
->decl_map
;
4573 /* Only a local declaration (variable or label). */
4574 if ((TREE_CODE (expr
) == VAR_DECL
4575 && !TREE_STATIC (expr
))
4576 || TREE_CODE (expr
) == LABEL_DECL
)
4578 /* Lookup the declaration. */
4579 n
= (tree
*) pointer_map_contains (st
, expr
);
4581 /* If it's there, remap it. */
4586 else if (TREE_CODE (expr
) == STATEMENT_LIST
4587 || TREE_CODE (expr
) == BIND_EXPR
4588 || TREE_CODE (expr
) == SAVE_EXPR
)
4590 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4592 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4593 It's OK for this to happen if it was part of a subtree that
4594 isn't immediately expanded, such as operand 2 of another
4596 if (!TREE_OPERAND (expr
, 1))
4598 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4599 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4603 /* Keep iterating. */
4608 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4609 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4610 remaps all local declarations to appropriate replacements in gimple
4614 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4615 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4616 struct walk_stmt_info
*wi
)
4618 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4619 gimple stmt
= gsi_stmt (*gsip
);
4621 if (gimple_code (stmt
) == GIMPLE_BIND
)
4623 tree block
= gimple_bind_block (stmt
);
4627 remap_block (&block
, id
);
4628 gimple_bind_set_block (stmt
, block
);
4631 /* This will remap a lot of the same decls again, but this should be
4633 if (gimple_bind_vars (stmt
))
4634 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
), NULL
, id
));
4637 /* Keep iterating. */
4642 /* Copies everything in SEQ and replaces variables and labels local to
4643 current_function_decl. */
4646 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4649 struct walk_stmt_info wi
;
4650 struct pointer_set_t
*visited
;
4653 /* There's nothing to do for NULL_TREE. */
4658 memset (&id
, 0, sizeof (id
));
4659 id
.src_fn
= current_function_decl
;
4660 id
.dst_fn
= current_function_decl
;
4661 id
.decl_map
= pointer_map_create ();
4662 id
.debug_map
= NULL
;
4664 id
.copy_decl
= copy_decl_no_change
;
4665 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4666 id
.transform_new_cfg
= false;
4667 id
.transform_return_to_modify
= false;
4668 id
.transform_lang_insert_block
= NULL
;
4670 /* Walk the tree once to find local labels. */
4671 memset (&wi
, 0, sizeof (wi
));
4672 visited
= pointer_set_create ();
4675 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4676 pointer_set_destroy (visited
);
4678 copy
= gimple_seq_copy (seq
);
4680 /* Walk the copy, remapping decls. */
4681 memset (&wi
, 0, sizeof (wi
));
4683 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4686 pointer_map_destroy (id
.decl_map
);
4688 pointer_map_destroy (id
.debug_map
);
4694 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4697 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4706 debug_find_tree (tree top
, tree search
)
4708 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4712 /* Declare the variables created by the inliner. Add all the variables in
4713 VARS to BIND_EXPR. */
4716 declare_inline_vars (tree block
, tree vars
)
4719 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4721 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4722 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4723 add_local_decl (cfun
, t
);
4727 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4730 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4731 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4732 VAR_DECL translation. */
4735 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4737 /* Don't generate debug information for the copy if we wouldn't have
4738 generated it for the copy either. */
4739 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4740 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4742 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4743 declaration inspired this copy. */
4744 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4746 /* The new variable/label has no RTL, yet. */
4747 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4748 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4749 SET_DECL_RTL (copy
, 0);
4751 /* These args would always appear unused, if not for this. */
4752 TREE_USED (copy
) = 1;
4754 /* Set the context for the new declaration. */
4755 if (!DECL_CONTEXT (decl
))
4756 /* Globals stay global. */
4758 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4759 /* Things that weren't in the scope of the function we're inlining
4760 from aren't in the scope we're inlining to, either. */
4762 else if (TREE_STATIC (decl
))
4763 /* Function-scoped static variables should stay in the original
4767 /* Ordinary automatic local variables are now in the scope of the
4769 DECL_CONTEXT (copy
) = id
->dst_fn
;
4771 if (TREE_CODE (decl
) == VAR_DECL
4772 /* C++ clones functions during parsing, before
4774 && gimple_referenced_vars (DECL_STRUCT_FUNCTION (id
->src_fn
))
4775 && referenced_var_lookup (DECL_STRUCT_FUNCTION (id
->src_fn
),
4777 add_referenced_var (copy
);
4783 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4787 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4788 || TREE_CODE (decl
) == RESULT_DECL
);
4790 type
= TREE_TYPE (decl
);
4792 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4793 VAR_DECL
, DECL_NAME (decl
), type
);
4794 if (DECL_PT_UID_SET_P (decl
))
4795 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4796 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4797 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4798 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4799 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4801 return copy_decl_for_dup_finish (id
, decl
, copy
);
4804 /* Like copy_decl_to_var, but create a return slot object instead of a
4805 pointer variable for return by invisible reference. */
4808 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4812 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4813 || TREE_CODE (decl
) == RESULT_DECL
);
4815 type
= TREE_TYPE (decl
);
4816 if (DECL_BY_REFERENCE (decl
))
4817 type
= TREE_TYPE (type
);
4819 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4820 VAR_DECL
, DECL_NAME (decl
), type
);
4821 if (DECL_PT_UID_SET_P (decl
))
4822 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4823 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4824 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4825 if (!DECL_BY_REFERENCE (decl
))
4827 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4828 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4831 return copy_decl_for_dup_finish (id
, decl
, copy
);
4835 copy_decl_no_change (tree decl
, copy_body_data
*id
)
4839 copy
= copy_node (decl
);
4841 /* The COPY is not abstract; it will be generated in DST_FN. */
4842 DECL_ABSTRACT (copy
) = 0;
4843 lang_hooks
.dup_lang_specific_decl (copy
);
4845 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4846 been taken; it's for internal bookkeeping in expand_goto_internal. */
4847 if (TREE_CODE (copy
) == LABEL_DECL
)
4849 TREE_ADDRESSABLE (copy
) = 0;
4850 LABEL_DECL_UID (copy
) = -1;
4853 return copy_decl_for_dup_finish (id
, decl
, copy
);
4857 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
4859 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
4860 return copy_decl_to_var (decl
, id
);
4862 return copy_decl_no_change (decl
, id
);
4865 /* Return a copy of the function's argument tree. */
4867 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
4868 bitmap args_to_skip
, tree
*vars
)
4871 tree new_parm
= NULL
;
4876 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
4877 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
4879 tree new_tree
= remap_decl (arg
, id
);
4880 if (TREE_CODE (new_tree
) != PARM_DECL
)
4881 new_tree
= id
->copy_decl (arg
, id
);
4882 lang_hooks
.dup_lang_specific_decl (new_tree
);
4884 parg
= &DECL_CHAIN (new_tree
);
4886 else if (!pointer_map_contains (id
->decl_map
, arg
))
4888 /* Make an equivalent VAR_DECL. If the argument was used
4889 as temporary variable later in function, the uses will be
4890 replaced by local variable. */
4891 tree var
= copy_decl_to_var (arg
, id
);
4892 add_referenced_var (var
);
4893 insert_decl_map (id
, arg
, var
);
4894 /* Declare this new variable. */
4895 DECL_CHAIN (var
) = *vars
;
4901 /* Return a copy of the function's static chain. */
4903 copy_static_chain (tree static_chain
, copy_body_data
* id
)
4905 tree
*chain_copy
, *pvar
;
4907 chain_copy
= &static_chain
;
4908 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
4910 tree new_tree
= remap_decl (*pvar
, id
);
4911 lang_hooks
.dup_lang_specific_decl (new_tree
);
4912 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
4915 return static_chain
;
4918 /* Return true if the function is allowed to be versioned.
4919 This is a guard for the versioning functionality. */
4922 tree_versionable_function_p (tree fndecl
)
4924 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
4925 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
4928 /* Delete all unreachable basic blocks and update callgraph.
4929 Doing so is somewhat nontrivial because we need to update all clones and
4930 remove inline function that become unreachable. */
4933 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
4935 bool changed
= false;
4936 basic_block b
, next_bb
;
4938 find_unreachable_blocks ();
4940 /* Delete all unreachable basic blocks. */
4942 for (b
= ENTRY_BLOCK_PTR
->next_bb
; b
!= EXIT_BLOCK_PTR
; b
= next_bb
)
4944 next_bb
= b
->next_bb
;
4946 if (!(b
->flags
& BB_REACHABLE
))
4948 gimple_stmt_iterator bsi
;
4950 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4951 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
)
4953 struct cgraph_edge
*e
;
4954 struct cgraph_node
*node
;
4956 if ((e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
4958 if (!e
->inline_failed
)
4959 cgraph_remove_node_and_inline_clones (e
->callee
);
4961 cgraph_remove_edge (e
);
4963 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
4964 && id
->dst_node
->clones
)
4965 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
4967 if ((e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
4969 if (!e
->inline_failed
)
4970 cgraph_remove_node_and_inline_clones (e
->callee
);
4972 cgraph_remove_edge (e
);
4976 node
= node
->clones
;
4977 else if (node
->next_sibling_clone
)
4978 node
= node
->next_sibling_clone
;
4981 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
4982 node
= node
->clone_of
;
4983 if (node
!= id
->dst_node
)
4984 node
= node
->next_sibling_clone
;
4988 delete_basic_block (b
);
4996 /* Update clone info after duplication. */
4999 update_clone_info (copy_body_data
* id
)
5001 struct cgraph_node
*node
;
5002 if (!id
->dst_node
->clones
)
5004 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5006 /* First update replace maps to match the new body. */
5007 if (node
->clone
.tree_map
)
5010 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, node
->clone
.tree_map
); i
++)
5012 struct ipa_replace_map
*replace_info
;
5013 replace_info
= VEC_index (ipa_replace_map_p
, node
->clone
.tree_map
, i
);
5014 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5015 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5019 node
= node
->clones
;
5020 else if (node
->next_sibling_clone
)
5021 node
= node
->next_sibling_clone
;
5024 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5025 node
= node
->clone_of
;
5026 if (node
!= id
->dst_node
)
5027 node
= node
->next_sibling_clone
;
5032 /* Create a copy of a function's tree.
5033 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5034 of the original function and the new copied function
5035 respectively. In case we want to replace a DECL
5036 tree with another tree while duplicating the function's
5037 body, TREE_MAP represents the mapping between these
5038 trees. If UPDATE_CLONES is set, the call_stmt fields
5039 of edges of clones of the function will be updated.
5041 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5043 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5044 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5047 tree_function_versioning (tree old_decl
, tree new_decl
,
5048 VEC(ipa_replace_map_p
,gc
)* tree_map
,
5049 bool update_clones
, bitmap args_to_skip
,
5050 bitmap blocks_to_copy
, basic_block new_entry
)
5052 struct cgraph_node
*old_version_node
;
5053 struct cgraph_node
*new_version_node
;
5057 struct ipa_replace_map
*replace_info
;
5058 basic_block old_entry_block
, bb
;
5059 VEC (gimple
, heap
) *init_stmts
= VEC_alloc (gimple
, heap
, 10);
5061 tree old_current_function_decl
= current_function_decl
;
5062 tree vars
= NULL_TREE
;
5064 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5065 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5066 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5068 old_version_node
= cgraph_get_node (old_decl
);
5069 gcc_checking_assert (old_version_node
);
5070 new_version_node
= cgraph_get_node (new_decl
);
5071 gcc_checking_assert (new_version_node
);
5073 /* Copy over debug args. */
5074 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5076 VEC(tree
, gc
) **new_debug_args
, **old_debug_args
;
5077 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5078 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5079 old_debug_args
= decl_debug_args_lookup (old_decl
);
5082 new_debug_args
= decl_debug_args_insert (new_decl
);
5083 *new_debug_args
= VEC_copy (tree
, gc
, *old_debug_args
);
5087 /* Output the inlining info for this abstract function, since it has been
5088 inlined. If we don't do this now, we can lose the information about the
5089 variables in the function when the blocks get blown away as soon as we
5090 remove the cgraph node. */
5091 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5093 DECL_ARTIFICIAL (new_decl
) = 1;
5094 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5095 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5097 /* Prepare the data structures for the tree copy. */
5098 memset (&id
, 0, sizeof (id
));
5100 /* Generate a new name for the new version. */
5101 id
.statements_to_fold
= pointer_set_create ();
5103 id
.decl_map
= pointer_map_create ();
5104 id
.debug_map
= NULL
;
5105 id
.src_fn
= old_decl
;
5106 id
.dst_fn
= new_decl
;
5107 id
.src_node
= old_version_node
;
5108 id
.dst_node
= new_version_node
;
5109 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5110 if (id
.src_node
->ipa_transforms_to_apply
)
5112 VEC(ipa_opt_pass
,heap
) * old_transforms_to_apply
= id
.dst_node
->ipa_transforms_to_apply
;
5115 id
.dst_node
->ipa_transforms_to_apply
= VEC_copy (ipa_opt_pass
, heap
,
5116 id
.src_node
->ipa_transforms_to_apply
);
5117 for (i
= 0; i
< VEC_length (ipa_opt_pass
, old_transforms_to_apply
); i
++)
5118 VEC_safe_push (ipa_opt_pass
, heap
, id
.dst_node
->ipa_transforms_to_apply
,
5119 VEC_index (ipa_opt_pass
,
5120 old_transforms_to_apply
,
5124 id
.copy_decl
= copy_decl_no_change
;
5125 id
.transform_call_graph_edges
5126 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5127 id
.transform_new_cfg
= true;
5128 id
.transform_return_to_modify
= false;
5129 id
.transform_lang_insert_block
= NULL
;
5131 current_function_decl
= new_decl
;
5132 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION
5133 (DECL_STRUCT_FUNCTION (old_decl
));
5134 initialize_cfun (new_decl
, old_decl
,
5135 old_entry_block
->count
);
5136 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5137 = id
.src_cfun
->gimple_df
->ipa_pta
;
5138 push_cfun (DECL_STRUCT_FUNCTION (new_decl
));
5140 /* Copy the function's static chain. */
5141 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5143 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5144 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5147 /* If there's a tree_map, prepare for substitution. */
5149 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, tree_map
); i
++)
5152 replace_info
= VEC_index (ipa_replace_map_p
, tree_map
, i
);
5153 if (replace_info
->replace_p
)
5155 tree op
= replace_info
->new_tree
;
5156 if (!replace_info
->old_tree
)
5158 int i
= replace_info
->parm_num
;
5160 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5162 replace_info
->old_tree
= parm
;
5168 if (TREE_CODE (op
) == VIEW_CONVERT_EXPR
)
5169 op
= TREE_OPERAND (op
, 0);
5171 if (TREE_CODE (op
) == ADDR_EXPR
)
5173 op
= TREE_OPERAND (op
, 0);
5174 while (handled_component_p (op
))
5175 op
= TREE_OPERAND (op
, 0);
5176 if (TREE_CODE (op
) == VAR_DECL
)
5177 add_referenced_var (op
);
5179 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5180 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5181 replace_info
->new_tree
, id
.src_fn
,
5185 VEC_safe_push (gimple
, heap
, init_stmts
, init
);
5188 /* Copy the function's arguments. */
5189 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5190 DECL_ARGUMENTS (new_decl
) =
5191 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5192 args_to_skip
, &vars
);
5194 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5195 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5197 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5199 if (!VEC_empty (tree
, DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5200 /* Add local vars. */
5201 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
, false);
5203 if (DECL_RESULT (old_decl
) != NULL_TREE
)
5206 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5207 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5208 if (gimple_in_ssa_p (id
.src_cfun
)
5209 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5211 = gimple_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5213 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5214 insert_decl_map (&id
, old_name
, new_name
);
5215 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5216 set_default_def (DECL_RESULT (new_decl
), new_name
);
5220 /* Copy the Function's body. */
5221 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5222 ENTRY_BLOCK_PTR
, EXIT_BLOCK_PTR
, blocks_to_copy
, new_entry
);
5224 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5225 number_blocks (new_decl
);
5227 /* We want to create the BB unconditionally, so that the addition of
5228 debug stmts doesn't affect BB count, which may in the end cause
5229 codegen differences. */
5230 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR
));
5231 while (VEC_length (gimple
, init_stmts
))
5232 insert_init_stmt (&id
, bb
, VEC_pop (gimple
, init_stmts
));
5233 update_clone_info (&id
);
5235 /* Remap the nonlocal_goto_save_area, if any. */
5236 if (cfun
->nonlocal_goto_save_area
)
5238 struct walk_stmt_info wi
;
5240 memset (&wi
, 0, sizeof (wi
));
5242 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5246 pointer_map_destroy (id
.decl_map
);
5248 pointer_map_destroy (id
.debug_map
);
5249 free_dominance_info (CDI_DOMINATORS
);
5250 free_dominance_info (CDI_POST_DOMINATORS
);
5252 fold_marked_statements (0, id
.statements_to_fold
);
5253 pointer_set_destroy (id
.statements_to_fold
);
5254 fold_cond_expr_cond ();
5255 delete_unreachable_blocks_update_callgraph (&id
);
5256 if (id
.dst_node
->analyzed
)
5257 cgraph_rebuild_references ();
5258 update_ssa (TODO_update_ssa
);
5260 /* After partial cloning we need to rescale frequencies, so they are
5261 within proper range in the cloned function. */
5264 struct cgraph_edge
*e
;
5265 rebuild_frequencies ();
5267 new_version_node
->count
= ENTRY_BLOCK_PTR
->count
;
5268 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5270 basic_block bb
= gimple_bb (e
->call_stmt
);
5271 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5273 e
->count
= bb
->count
;
5275 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5277 basic_block bb
= gimple_bb (e
->call_stmt
);
5278 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5280 e
->count
= bb
->count
;
5284 free_dominance_info (CDI_DOMINATORS
);
5285 free_dominance_info (CDI_POST_DOMINATORS
);
5287 gcc_assert (!id
.debug_stmts
);
5288 VEC_free (gimple
, heap
, init_stmts
);
5290 current_function_decl
= old_current_function_decl
;
5291 gcc_assert (!current_function_decl
5292 || DECL_STRUCT_FUNCTION (current_function_decl
) == cfun
);
5296 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5297 the callee and return the inlined body on success. */
5300 maybe_inline_call_in_expr (tree exp
)
5302 tree fn
= get_callee_fndecl (exp
);
5304 /* We can only try to inline "const" functions. */
5305 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5307 struct pointer_map_t
*decl_map
= pointer_map_create ();
5308 call_expr_arg_iterator iter
;
5312 /* Remap the parameters. */
5313 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5315 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5316 *pointer_map_insert (decl_map
, param
) = arg
;
5318 memset (&id
, 0, sizeof (id
));
5320 id
.dst_fn
= current_function_decl
;
5321 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5322 id
.decl_map
= decl_map
;
5324 id
.copy_decl
= copy_decl_no_change
;
5325 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5326 id
.transform_new_cfg
= false;
5327 id
.transform_return_to_modify
= true;
5328 id
.transform_lang_insert_block
= NULL
;
5330 /* Make sure not to unshare trees behind the front-end's back
5331 since front-end specific mechanisms may rely on sharing. */
5332 id
.regimplify
= false;
5333 id
.do_not_unshare
= true;
5335 /* We're not inside any EH region. */
5338 t
= copy_tree_body (&id
);
5339 pointer_map_destroy (decl_map
);
5341 /* We can only return something suitable for use in a GENERIC
5343 if (TREE_CODE (t
) == MODIFY_EXPR
)
5344 return TREE_OPERAND (t
, 1);
5350 /* Duplicate a type, fields and all. */
5353 build_duplicate_type (tree type
)
5355 struct copy_body_data id
;
5357 memset (&id
, 0, sizeof (id
));
5358 id
.src_fn
= current_function_decl
;
5359 id
.dst_fn
= current_function_decl
;
5361 id
.decl_map
= pointer_map_create ();
5362 id
.debug_map
= NULL
;
5363 id
.copy_decl
= copy_decl_no_change
;
5365 type
= remap_type_1 (type
, &id
);
5367 pointer_map_destroy (id
.decl_map
);
5369 pointer_map_destroy (id
.debug_map
);
5371 TYPE_CANONICAL (type
) = type
;