2 Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011,
3 2012 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"
52 #include "rtl.h" /* FIXME: For asm_str_count. */
54 /* I'm not real happy about this, but we need to handle gimple and
58 /* Inlining, Cloning, Versioning, Parallelization
60 Inlining: a function body is duplicated, but the PARM_DECLs are
61 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
62 MODIFY_EXPRs that store to a dedicated returned-value variable.
63 The duplicated eh_region info of the copy will later be appended
64 to the info for the caller; the eh_region info in copied throwing
65 statements and RESX statements are adjusted accordingly.
67 Cloning: (only in C++) We have one body for a con/de/structor, and
68 multiple function decls, each with a unique parameter list.
69 Duplicate the body, using the given splay tree; some parameters
70 will become constants (like 0 or 1).
72 Versioning: a function body is duplicated and the result is a new
73 function rather than into blocks of an existing function as with
74 inlining. Some parameters will become constants.
76 Parallelization: a region of a function is duplicated resulting in
77 a new function. Variables may be replaced with complex expressions
78 to enable shared variable semantics.
80 All of these will simultaneously lookup any callgraph edges. If
81 we're going to inline the duplicated function body, and the given
82 function has some cloned callgraph nodes (one for each place this
83 function will be inlined) those callgraph edges will be duplicated.
84 If we're cloning the body, those callgraph edges will be
85 updated to point into the new body. (Note that the original
86 callgraph node and edge list will not be altered.)
88 See the CALL_EXPR handling case in copy_tree_body_r (). */
92 o In order to make inlining-on-trees work, we pessimized
93 function-local static constants. In particular, they are now
94 always output, even when not addressed. Fix this by treating
95 function-local static constants just like global static
96 constants; the back-end already knows not to output them if they
99 o Provide heuristics to clamp inlining of recursive template
103 /* Weights that estimate_num_insns uses to estimate the size of the
106 eni_weights eni_size_weights
;
108 /* Weights that estimate_num_insns uses to estimate the time necessary
109 to execute the produced code. */
111 eni_weights eni_time_weights
;
115 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, basic_block
);
116 static void remap_block (tree
*, copy_body_data
*);
117 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
118 static tree
mark_local_for_remap_r (tree
*, int *, void *);
119 static void unsave_expr_1 (tree
);
120 static tree
unsave_r (tree
*, int *, void *);
121 static void declare_inline_vars (tree
, tree
);
122 static void remap_save_expr (tree
*, void *, int *);
123 static void prepend_lexical_block (tree current_block
, tree new_block
);
124 static tree
copy_decl_to_var (tree
, copy_body_data
*);
125 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
126 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
127 static gimple
remap_gimple_stmt (gimple
, copy_body_data
*);
128 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
130 /* Insert a tree->tree mapping for ID. Despite the name suggests
131 that the trees should be variables, it is used for more than that. */
134 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
136 *pointer_map_insert (id
->decl_map
, key
) = value
;
138 /* Always insert an identity map as well. If we see this same new
139 node again, we won't want to duplicate it a second time. */
141 *pointer_map_insert (id
->decl_map
, value
) = value
;
144 /* Insert a tree->tree mapping for ID. This is only used for
148 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
150 if (!gimple_in_ssa_p (id
->src_cfun
))
153 if (!MAY_HAVE_DEBUG_STMTS
)
156 if (!target_for_debug_bind (key
))
159 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
160 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
163 id
->debug_map
= pointer_map_create ();
165 *pointer_map_insert (id
->debug_map
, key
) = value
;
168 /* If nonzero, we're remapping the contents of inlined debug
169 statements. If negative, an error has occurred, such as a
170 reference to a variable that isn't available in the inlined
172 static int processing_debug_stmt
= 0;
174 /* Construct new SSA name for old NAME. ID is the inline context. */
177 remap_ssa_name (tree name
, copy_body_data
*id
)
182 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
184 n
= (tree
*) pointer_map_contains (id
->decl_map
, name
);
186 return unshare_expr (*n
);
188 if (processing_debug_stmt
)
190 if (TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
191 && SSA_NAME_IS_DEFAULT_DEF (name
)
192 && id
->entry_bb
== NULL
193 && single_succ_p (ENTRY_BLOCK_PTR
))
195 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
197 gimple_stmt_iterator gsi
;
198 tree val
= SSA_NAME_VAR (name
);
200 n
= (tree
*) pointer_map_contains (id
->decl_map
, val
);
203 if (TREE_CODE (val
) != PARM_DECL
)
205 processing_debug_stmt
= -1;
208 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
209 DECL_ARTIFICIAL (vexpr
) = 1;
210 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
211 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
212 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR
));
213 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
217 processing_debug_stmt
= -1;
221 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
223 new_tree
= remap_decl (SSA_NAME_VAR (name
), id
);
225 /* We might've substituted constant or another SSA_NAME for
228 Replace the SSA name representing RESULT_DECL by variable during
229 inlining: this saves us from need to introduce PHI node in a case
230 return value is just partly initialized. */
231 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
232 && (TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
233 || !id
->transform_return_to_modify
))
235 struct ptr_info_def
*pi
;
236 new_tree
= make_ssa_name (new_tree
, NULL
);
237 insert_decl_map (id
, name
, new_tree
);
238 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
239 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
240 TREE_TYPE (new_tree
) = TREE_TYPE (SSA_NAME_VAR (new_tree
));
241 /* At least IPA points-to info can be directly transferred. */
242 if (id
->src_cfun
->gimple_df
243 && id
->src_cfun
->gimple_df
->ipa_pta
244 && (pi
= SSA_NAME_PTR_INFO (name
))
247 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
250 if (gimple_nop_p (SSA_NAME_DEF_STMT (name
)))
252 /* By inlining function having uninitialized variable, we might
253 extend the lifetime (variable might get reused). This cause
254 ICE in the case we end up extending lifetime of SSA name across
255 abnormal edge, but also increase register pressure.
257 We simply initialize all uninitialized vars by 0 except
258 for case we are inlining to very first BB. We can avoid
259 this for all BBs that are not inside strongly connected
260 regions of the CFG, but this is expensive to test. */
262 && is_gimple_reg (SSA_NAME_VAR (name
))
263 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
264 && TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
265 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR
, 0)->dest
266 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
268 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
270 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
272 init_stmt
= gimple_build_assign (new_tree
, zero
);
273 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
274 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
278 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
279 if (gimple_default_def (id
->src_cfun
, SSA_NAME_VAR (name
))
281 set_default_def (SSA_NAME_VAR (new_tree
), new_tree
);
286 insert_decl_map (id
, name
, new_tree
);
290 /* Remap DECL during the copying of the BLOCK tree for the function. */
293 remap_decl (tree decl
, copy_body_data
*id
)
297 /* We only remap local variables in the current function. */
299 /* See if we have remapped this declaration. */
301 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
303 if (!n
&& processing_debug_stmt
)
305 processing_debug_stmt
= -1;
309 /* If we didn't already have an equivalent for this declaration,
313 /* Make a copy of the variable or label. */
314 tree t
= id
->copy_decl (decl
, id
);
316 /* Remember it, so that if we encounter this local entity again
317 we can reuse this copy. Do this early because remap_type may
318 need this decl for TYPE_STUB_DECL. */
319 insert_decl_map (id
, decl
, t
);
324 /* Remap types, if necessary. */
325 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
326 if (TREE_CODE (t
) == TYPE_DECL
)
327 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
329 /* Remap sizes as necessary. */
330 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
331 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
333 /* If fields, do likewise for offset and qualifier. */
334 if (TREE_CODE (t
) == FIELD_DECL
)
336 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
337 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
338 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
341 if ((TREE_CODE (t
) == VAR_DECL
342 || TREE_CODE (t
) == RESULT_DECL
343 || TREE_CODE (t
) == PARM_DECL
)
344 && id
->src_fn
&& DECL_STRUCT_FUNCTION (id
->src_fn
)
345 && gimple_referenced_vars (DECL_STRUCT_FUNCTION (id
->src_fn
))
346 /* We don't want to mark as referenced VAR_DECLs that were
347 not marked as such in the src function. */
348 && (TREE_CODE (decl
) != VAR_DECL
349 || referenced_var_lookup (DECL_STRUCT_FUNCTION (id
->src_fn
),
351 add_referenced_var (t
);
355 if (id
->do_not_unshare
)
358 return unshare_expr (*n
);
362 remap_type_1 (tree type
, copy_body_data
*id
)
366 /* We do need a copy. build and register it now. If this is a pointer or
367 reference type, remap the designated type and make a new pointer or
369 if (TREE_CODE (type
) == POINTER_TYPE
)
371 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
373 TYPE_REF_CAN_ALIAS_ALL (type
));
374 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
375 new_tree
= build_type_attribute_qual_variant (new_tree
,
376 TYPE_ATTRIBUTES (type
),
378 insert_decl_map (id
, type
, new_tree
);
381 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
383 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
385 TYPE_REF_CAN_ALIAS_ALL (type
));
386 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
387 new_tree
= build_type_attribute_qual_variant (new_tree
,
388 TYPE_ATTRIBUTES (type
),
390 insert_decl_map (id
, type
, new_tree
);
394 new_tree
= copy_node (type
);
396 insert_decl_map (id
, type
, new_tree
);
398 /* This is a new type, not a copy of an old type. Need to reassociate
399 variants. We can handle everything except the main variant lazily. */
400 t
= TYPE_MAIN_VARIANT (type
);
403 t
= remap_type (t
, id
);
404 TYPE_MAIN_VARIANT (new_tree
) = t
;
405 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
406 TYPE_NEXT_VARIANT (t
) = new_tree
;
410 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
411 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
414 if (TYPE_STUB_DECL (type
))
415 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
417 /* Lazily create pointer and reference types. */
418 TYPE_POINTER_TO (new_tree
) = NULL
;
419 TYPE_REFERENCE_TO (new_tree
) = NULL
;
421 switch (TREE_CODE (new_tree
))
425 case FIXED_POINT_TYPE
:
428 t
= TYPE_MIN_VALUE (new_tree
);
429 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
430 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
432 t
= TYPE_MAX_VALUE (new_tree
);
433 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
434 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
438 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
439 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
443 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
444 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
449 case QUAL_UNION_TYPE
:
453 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
455 t
= remap_decl (f
, id
);
456 DECL_CONTEXT (t
) = new_tree
;
460 TYPE_FIELDS (new_tree
) = nreverse (nf
);
466 /* Shouldn't have been thought variable sized. */
470 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
471 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
477 remap_type (tree type
, copy_body_data
*id
)
485 /* See if we have remapped this type. */
486 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
490 /* The type only needs remapping if it's variably modified. */
491 if (! variably_modified_type_p (type
, id
->src_fn
))
493 insert_decl_map (id
, type
, type
);
497 id
->remapping_type_depth
++;
498 tmp
= remap_type_1 (type
, id
);
499 id
->remapping_type_depth
--;
504 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
505 is NULL or TYPE has not been remapped before. */
508 remapped_type (tree type
, copy_body_data
*id
)
515 /* See if we have remapped this type. */
516 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
523 /* The type only needs remapping if it's variably modified. */
524 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
527 can_be_nonlocal (tree decl
, copy_body_data
*id
)
529 /* We can not duplicate function decls. */
530 if (TREE_CODE (decl
) == FUNCTION_DECL
)
533 /* Local static vars must be non-local or we get multiple declaration
535 if (TREE_CODE (decl
) == VAR_DECL
536 && !auto_var_in_fn_p (decl
, id
->src_fn
))
539 /* At the moment dwarf2out can handle only these types of nodes. We
540 can support more later. */
541 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != PARM_DECL
)
544 /* We must use global type. We call remapped_type instead of
545 remap_type since we don't want to remap this type here if it
546 hasn't been remapped before. */
547 if (TREE_TYPE (decl
) != remapped_type (TREE_TYPE (decl
), id
))
550 /* Wihtout SSA we can't tell if variable is used. */
551 if (!gimple_in_ssa_p (cfun
))
554 /* Live variables must be copied so we can attach DECL_RTL. */
562 remap_decls (tree decls
, VEC(tree
,gc
) **nonlocalized_list
, copy_body_data
*id
)
565 tree new_decls
= NULL_TREE
;
567 /* Remap its variables. */
568 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
572 if (can_be_nonlocal (old_var
, id
))
574 if (TREE_CODE (old_var
) == VAR_DECL
575 && ! DECL_EXTERNAL (old_var
)
576 && (var_ann (old_var
) || !gimple_in_ssa_p (cfun
)))
577 add_local_decl (cfun
, old_var
);
578 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
579 && !DECL_IGNORED_P (old_var
)
580 && nonlocalized_list
)
581 VEC_safe_push (tree
, gc
, *nonlocalized_list
, old_var
);
585 /* Remap the variable. */
586 new_var
= remap_decl (old_var
, id
);
588 /* If we didn't remap this variable, we can't mess with its
589 TREE_CHAIN. If we remapped this variable to the return slot, it's
590 already declared somewhere else, so don't declare it here. */
592 if (new_var
== id
->retvar
)
596 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
597 && !DECL_IGNORED_P (old_var
)
598 && nonlocalized_list
)
599 VEC_safe_push (tree
, gc
, *nonlocalized_list
, old_var
);
603 gcc_assert (DECL_P (new_var
));
604 DECL_CHAIN (new_var
) = new_decls
;
607 /* Also copy value-expressions. */
608 if (TREE_CODE (new_var
) == VAR_DECL
609 && DECL_HAS_VALUE_EXPR_P (new_var
))
611 tree tem
= DECL_VALUE_EXPR (new_var
);
612 bool old_regimplify
= id
->regimplify
;
613 id
->remapping_type_depth
++;
614 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
615 id
->remapping_type_depth
--;
616 id
->regimplify
= old_regimplify
;
617 SET_DECL_VALUE_EXPR (new_var
, tem
);
622 return nreverse (new_decls
);
625 /* Copy the BLOCK to contain remapped versions of the variables
626 therein. And hook the new block into the block-tree. */
629 remap_block (tree
*block
, copy_body_data
*id
)
634 /* Make the new block. */
636 new_block
= make_node (BLOCK
);
637 TREE_USED (new_block
) = TREE_USED (old_block
);
638 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
639 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
640 BLOCK_NONLOCALIZED_VARS (new_block
)
641 = VEC_copy (tree
, gc
, BLOCK_NONLOCALIZED_VARS (old_block
));
644 /* Remap its variables. */
645 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
646 &BLOCK_NONLOCALIZED_VARS (new_block
),
649 if (id
->transform_lang_insert_block
)
650 id
->transform_lang_insert_block (new_block
);
652 /* Remember the remapped block. */
653 insert_decl_map (id
, old_block
, new_block
);
656 /* Copy the whole block tree and root it in id->block. */
658 remap_blocks (tree block
, copy_body_data
*id
)
661 tree new_tree
= block
;
666 remap_block (&new_tree
, id
);
667 gcc_assert (new_tree
!= block
);
668 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
669 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
670 /* Blocks are in arbitrary order, but make things slightly prettier and do
671 not swap order when producing a copy. */
672 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
677 copy_statement_list (tree
*tp
)
679 tree_stmt_iterator oi
, ni
;
682 new_tree
= alloc_stmt_list ();
683 ni
= tsi_start (new_tree
);
684 oi
= tsi_start (*tp
);
685 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
688 for (; !tsi_end_p (oi
); tsi_next (&oi
))
690 tree stmt
= tsi_stmt (oi
);
691 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
692 /* This copy is not redundant; tsi_link_after will smash this
693 STATEMENT_LIST into the end of the one we're building, and we
694 don't want to do that with the original. */
695 copy_statement_list (&stmt
);
696 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
701 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
703 tree block
= BIND_EXPR_BLOCK (*tp
);
704 /* Copy (and replace) the statement. */
705 copy_tree_r (tp
, walk_subtrees
, NULL
);
708 remap_block (&block
, id
);
709 BIND_EXPR_BLOCK (*tp
) = block
;
712 if (BIND_EXPR_VARS (*tp
))
713 /* This will remap a lot of the same decls again, but this should be
715 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
719 /* Create a new gimple_seq by remapping all the statements in BODY
720 using the inlining information in ID. */
723 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
725 gimple_stmt_iterator si
;
726 gimple_seq new_body
= NULL
;
728 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
730 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
731 gimple_seq_add_stmt (&new_body
, new_stmt
);
738 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
739 block using the mapping information in ID. */
742 copy_gimple_bind (gimple stmt
, copy_body_data
*id
)
745 tree new_block
, new_vars
;
746 gimple_seq body
, new_body
;
748 /* Copy the statement. Note that we purposely don't use copy_stmt
749 here because we need to remap statements as we copy. */
750 body
= gimple_bind_body (stmt
);
751 new_body
= remap_gimple_seq (body
, id
);
753 new_block
= gimple_bind_block (stmt
);
755 remap_block (&new_block
, id
);
757 /* This will remap a lot of the same decls again, but this should be
759 new_vars
= gimple_bind_vars (stmt
);
761 new_vars
= remap_decls (new_vars
, NULL
, id
);
763 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
769 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
770 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
771 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
772 recursing into the children nodes of *TP. */
775 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
777 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
778 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
779 tree fn
= id
->src_fn
;
781 if (TREE_CODE (*tp
) == SSA_NAME
)
783 *tp
= remap_ssa_name (*tp
, id
);
787 else if (auto_var_in_fn_p (*tp
, fn
))
789 /* Local variables and labels need to be replaced by equivalent
790 variables. We don't want to copy static variables; there's
791 only one of those, no matter how many times we inline the
792 containing function. Similarly for globals from an outer
796 /* Remap the declaration. */
797 new_decl
= remap_decl (*tp
, id
);
798 gcc_assert (new_decl
);
799 /* Replace this variable with the copy. */
800 STRIP_TYPE_NOPS (new_decl
);
801 /* ??? The C++ frontend uses void * pointer zero to initialize
802 any other type. This confuses the middle-end type verification.
803 As cloned bodies do not go through gimplification again the fixup
804 there doesn't trigger. */
805 if (TREE_CODE (new_decl
) == INTEGER_CST
806 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
807 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
811 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
813 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
815 else if (TREE_CODE (*tp
) == LABEL_DECL
816 && (!DECL_CONTEXT (*tp
)
817 || decl_function_context (*tp
) == id
->src_fn
))
818 /* These may need to be remapped for EH handling. */
819 *tp
= remap_decl (*tp
, id
);
820 else if (TREE_CODE (*tp
) == FIELD_DECL
)
822 /* If the enclosing record type is variably_modified_type_p, the field
823 has already been remapped. Otherwise, it need not be. */
824 tree
*n
= (tree
*) pointer_map_contains (id
->decl_map
, *tp
);
829 else if (TYPE_P (*tp
))
830 /* Types may need remapping as well. */
831 *tp
= remap_type (*tp
, id
);
832 else if (CONSTANT_CLASS_P (*tp
))
834 /* If this is a constant, we have to copy the node iff the type
835 will be remapped. copy_tree_r will not copy a constant. */
836 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
838 if (new_type
== TREE_TYPE (*tp
))
841 else if (TREE_CODE (*tp
) == INTEGER_CST
)
842 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
843 TREE_INT_CST_HIGH (*tp
));
846 *tp
= copy_node (*tp
);
847 TREE_TYPE (*tp
) = new_type
;
852 /* Otherwise, just copy the node. Note that copy_tree_r already
853 knows not to copy VAR_DECLs, etc., so this is safe. */
855 /* We should never have TREE_BLOCK set on non-statements. */
857 gcc_assert (!TREE_BLOCK (*tp
));
859 if (TREE_CODE (*tp
) == MEM_REF
)
861 tree ptr
= TREE_OPERAND (*tp
, 0);
862 tree type
= remap_type (TREE_TYPE (*tp
), id
);
865 /* We need to re-canonicalize MEM_REFs from inline substitutions
866 that can happen when a pointer argument is an ADDR_EXPR.
867 Recurse here manually to allow that. */
868 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
869 *tp
= fold_build2 (MEM_REF
, type
,
870 ptr
, TREE_OPERAND (*tp
, 1));
871 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
872 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
873 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
878 /* Here is the "usual case". Copy this tree node, and then
879 tweak some special cases. */
880 copy_tree_r (tp
, walk_subtrees
, NULL
);
882 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
883 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
885 /* Global variables we haven't seen yet need to go into referenced
886 vars. If not referenced from types only. */
887 if (gimple_referenced_vars (cfun
)
888 && TREE_CODE (*tp
) == VAR_DECL
&& !is_global_var (*tp
)
889 && id
->remapping_type_depth
== 0
890 && !processing_debug_stmt
)
891 add_referenced_var (*tp
);
893 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
895 /* The copied TARGET_EXPR has never been expanded, even if the
896 original node was expanded already. */
897 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
898 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
900 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
902 /* Variable substitution need not be simple. In particular,
903 the MEM_REF substitution above. Make sure that
904 TREE_CONSTANT and friends are up-to-date. But make sure
905 to not improperly set TREE_BLOCK on some sub-expressions. */
906 int invariant
= is_gimple_min_invariant (*tp
);
907 tree block
= id
->block
;
908 id
->block
= NULL_TREE
;
909 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
911 recompute_tree_invariant_for_addr_expr (*tp
);
913 /* If this used to be invariant, but is not any longer,
914 then regimplification is probably needed. */
915 if (invariant
&& !is_gimple_min_invariant (*tp
))
916 id
->regimplify
= true;
922 /* Keep iterating. */
927 /* Called from copy_body_id via walk_tree. DATA is really a
928 `copy_body_data *'. */
931 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
933 copy_body_data
*id
= (copy_body_data
*) data
;
934 tree fn
= id
->src_fn
;
937 /* Begin by recognizing trees that we'll completely rewrite for the
938 inlining context. Our output for these trees is completely
939 different from out input (e.g. RETURN_EXPR is deleted, and morphs
940 into an edge). Further down, we'll handle trees that get
941 duplicated and/or tweaked. */
943 /* When requested, RETURN_EXPRs should be transformed to just the
944 contained MODIFY_EXPR. The branch semantics of the return will
945 be handled elsewhere by manipulating the CFG rather than a statement. */
946 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
948 tree assignment
= TREE_OPERAND (*tp
, 0);
950 /* If we're returning something, just turn that into an
951 assignment into the equivalent of the original RESULT_DECL.
952 If the "assignment" is just the result decl, the result
953 decl has already been set (e.g. a recent "foo (&result_decl,
954 ...)"); just toss the entire RETURN_EXPR. */
955 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
957 /* Replace the RETURN_EXPR with (a copy of) the
958 MODIFY_EXPR hanging underneath. */
959 *tp
= copy_node (assignment
);
961 else /* Else the RETURN_EXPR returns no value. */
964 return (tree
) (void *)1;
967 else if (TREE_CODE (*tp
) == SSA_NAME
)
969 *tp
= remap_ssa_name (*tp
, id
);
974 /* Local variables and labels need to be replaced by equivalent
975 variables. We don't want to copy static variables; there's only
976 one of those, no matter how many times we inline the containing
977 function. Similarly for globals from an outer function. */
978 else if (auto_var_in_fn_p (*tp
, fn
))
982 /* Remap the declaration. */
983 new_decl
= remap_decl (*tp
, id
);
984 gcc_assert (new_decl
);
985 /* Replace this variable with the copy. */
986 STRIP_TYPE_NOPS (new_decl
);
990 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
991 copy_statement_list (tp
);
992 else if (TREE_CODE (*tp
) == SAVE_EXPR
993 || TREE_CODE (*tp
) == TARGET_EXPR
)
994 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
995 else if (TREE_CODE (*tp
) == LABEL_DECL
996 && (! DECL_CONTEXT (*tp
)
997 || decl_function_context (*tp
) == id
->src_fn
))
998 /* These may need to be remapped for EH handling. */
999 *tp
= remap_decl (*tp
, id
);
1000 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1001 copy_bind_expr (tp
, walk_subtrees
, id
);
1002 /* Types may need remapping as well. */
1003 else if (TYPE_P (*tp
))
1004 *tp
= remap_type (*tp
, id
);
1006 /* If this is a constant, we have to copy the node iff the type will be
1007 remapped. copy_tree_r will not copy a constant. */
1008 else if (CONSTANT_CLASS_P (*tp
))
1010 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1012 if (new_type
== TREE_TYPE (*tp
))
1015 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1016 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
1017 TREE_INT_CST_HIGH (*tp
));
1020 *tp
= copy_node (*tp
);
1021 TREE_TYPE (*tp
) = new_type
;
1025 /* Otherwise, just copy the node. Note that copy_tree_r already
1026 knows not to copy VAR_DECLs, etc., so this is safe. */
1029 /* Here we handle trees that are not completely rewritten.
1030 First we detect some inlining-induced bogosities for
1032 if (TREE_CODE (*tp
) == MODIFY_EXPR
1033 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1034 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1036 /* Some assignments VAR = VAR; don't generate any rtl code
1037 and thus don't count as variable modification. Avoid
1038 keeping bogosities like 0 = 0. */
1039 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1042 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1046 STRIP_TYPE_NOPS (value
);
1047 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1049 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1050 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1054 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1056 /* Get rid of *& from inline substitutions that can happen when a
1057 pointer argument is an ADDR_EXPR. */
1058 tree decl
= TREE_OPERAND (*tp
, 0);
1061 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1066 /* If we happen to get an ADDR_EXPR in n->value, strip
1067 it manually here as we'll eventually get ADDR_EXPRs
1068 which lie about their types pointed to. In this case
1069 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1070 but we absolutely rely on that. As fold_indirect_ref
1071 does other useful transformations, try that first, though. */
1072 tree type
= TREE_TYPE (TREE_TYPE (*n
));
1073 if (id
->do_not_unshare
)
1076 new_tree
= unshare_expr (*n
);
1078 *tp
= gimple_fold_indirect_ref (new_tree
);
1081 if (TREE_CODE (new_tree
) == ADDR_EXPR
)
1083 *tp
= fold_indirect_ref_1 (EXPR_LOCATION (new_tree
),
1085 /* ??? We should either assert here or build
1086 a VIEW_CONVERT_EXPR instead of blindly leaking
1087 incompatible types to our IL. */
1089 *tp
= TREE_OPERAND (new_tree
, 0);
1093 *tp
= build1 (INDIRECT_REF
, type
, new_tree
);
1094 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1095 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1096 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1097 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
1104 else if (TREE_CODE (*tp
) == MEM_REF
)
1106 /* We need to re-canonicalize MEM_REFs from inline substitutions
1107 that can happen when a pointer argument is an ADDR_EXPR. */
1108 tree decl
= TREE_OPERAND (*tp
, 0);
1111 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1115 *tp
= fold_build2 (MEM_REF
, TREE_TYPE (*tp
),
1116 unshare_expr (*n
), TREE_OPERAND (*tp
, 1));
1117 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1118 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1124 /* Here is the "usual case". Copy this tree node, and then
1125 tweak some special cases. */
1126 copy_tree_r (tp
, walk_subtrees
, NULL
);
1128 /* Global variables we haven't seen yet needs to go into referenced
1129 vars. If not referenced from types or debug stmts only. */
1130 if (gimple_referenced_vars (cfun
)
1131 && TREE_CODE (*tp
) == VAR_DECL
&& !is_global_var (*tp
)
1132 && id
->remapping_type_depth
== 0
1133 && !processing_debug_stmt
)
1134 add_referenced_var (*tp
);
1136 /* If EXPR has block defined, map it to newly constructed block.
1137 When inlining we want EXPRs without block appear in the block
1138 of function call if we are not remapping a type. */
1141 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1142 if (TREE_BLOCK (*tp
))
1145 n
= (tree
*) pointer_map_contains (id
->decl_map
,
1147 gcc_assert (n
|| id
->remapping_type_depth
!= 0);
1151 TREE_BLOCK (*tp
) = new_block
;
1154 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1155 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1157 /* The copied TARGET_EXPR has never been expanded, even if the
1158 original node was expanded already. */
1159 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1161 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1162 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1165 /* Variable substitution need not be simple. In particular, the
1166 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1167 and friends are up-to-date. */
1168 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1170 int invariant
= is_gimple_min_invariant (*tp
);
1171 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1173 /* Handle the case where we substituted an INDIRECT_REF
1174 into the operand of the ADDR_EXPR. */
1175 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1176 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1178 recompute_tree_invariant_for_addr_expr (*tp
);
1180 /* If this used to be invariant, but is not any longer,
1181 then regimplification is probably needed. */
1182 if (invariant
&& !is_gimple_min_invariant (*tp
))
1183 id
->regimplify
= true;
1189 /* Keep iterating. */
1193 /* Helper for remap_gimple_stmt. Given an EH region number for the
1194 source function, map that to the duplicate EH region number in
1195 the destination function. */
1198 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1200 eh_region old_r
, new_r
;
1203 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1204 slot
= pointer_map_contains (id
->eh_map
, old_r
);
1205 new_r
= (eh_region
) *slot
;
1207 return new_r
->index
;
1210 /* Similar, but operate on INTEGER_CSTs. */
1213 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1217 old_nr
= tree_low_cst (old_t_nr
, 0);
1218 new_nr
= remap_eh_region_nr (old_nr
, id
);
1220 return build_int_cst (integer_type_node
, new_nr
);
1223 /* Helper for copy_bb. Remap statement STMT using the inlining
1224 information in ID. Return the new statement copy. */
1227 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1230 struct walk_stmt_info wi
;
1232 bool skip_first
= false;
1234 /* Begin by recognizing trees that we'll completely rewrite for the
1235 inlining context. Our output for these trees is completely
1236 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1237 into an edge). Further down, we'll handle trees that get
1238 duplicated and/or tweaked. */
1240 /* When requested, GIMPLE_RETURNs should be transformed to just the
1241 contained GIMPLE_ASSIGN. The branch semantics of the return will
1242 be handled elsewhere by manipulating the CFG rather than the
1244 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1246 tree retval
= gimple_return_retval (stmt
);
1248 /* If we're returning something, just turn that into an
1249 assignment into the equivalent of the original RESULT_DECL.
1250 If RETVAL is just the result decl, the result decl has
1251 already been set (e.g. a recent "foo (&result_decl, ...)");
1252 just toss the entire GIMPLE_RETURN. */
1254 && (TREE_CODE (retval
) != RESULT_DECL
1255 && (TREE_CODE (retval
) != SSA_NAME
1256 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1258 copy
= gimple_build_assign (id
->retvar
, retval
);
1259 /* id->retvar is already substituted. Skip it on later remapping. */
1263 return gimple_build_nop ();
1265 else if (gimple_has_substatements (stmt
))
1269 /* When cloning bodies from the C++ front end, we will be handed bodies
1270 in High GIMPLE form. Handle here all the High GIMPLE statements that
1271 have embedded statements. */
1272 switch (gimple_code (stmt
))
1275 copy
= copy_gimple_bind (stmt
, id
);
1279 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1280 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1283 case GIMPLE_EH_FILTER
:
1284 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1285 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1289 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1290 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1291 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1294 case GIMPLE_WITH_CLEANUP_EXPR
:
1295 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1296 copy
= gimple_build_wce (s1
);
1299 case GIMPLE_OMP_PARALLEL
:
1300 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1301 copy
= gimple_build_omp_parallel
1303 gimple_omp_parallel_clauses (stmt
),
1304 gimple_omp_parallel_child_fn (stmt
),
1305 gimple_omp_parallel_data_arg (stmt
));
1308 case GIMPLE_OMP_TASK
:
1309 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1310 copy
= gimple_build_omp_task
1312 gimple_omp_task_clauses (stmt
),
1313 gimple_omp_task_child_fn (stmt
),
1314 gimple_omp_task_data_arg (stmt
),
1315 gimple_omp_task_copy_fn (stmt
),
1316 gimple_omp_task_arg_size (stmt
),
1317 gimple_omp_task_arg_align (stmt
));
1320 case GIMPLE_OMP_FOR
:
1321 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1322 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1323 copy
= gimple_build_omp_for (s1
, gimple_omp_for_clauses (stmt
),
1324 gimple_omp_for_collapse (stmt
), s2
);
1327 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1329 gimple_omp_for_set_index (copy
, i
,
1330 gimple_omp_for_index (stmt
, i
));
1331 gimple_omp_for_set_initial (copy
, i
,
1332 gimple_omp_for_initial (stmt
, i
));
1333 gimple_omp_for_set_final (copy
, i
,
1334 gimple_omp_for_final (stmt
, i
));
1335 gimple_omp_for_set_incr (copy
, i
,
1336 gimple_omp_for_incr (stmt
, i
));
1337 gimple_omp_for_set_cond (copy
, i
,
1338 gimple_omp_for_cond (stmt
, i
));
1343 case GIMPLE_OMP_MASTER
:
1344 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1345 copy
= gimple_build_omp_master (s1
);
1348 case GIMPLE_OMP_ORDERED
:
1349 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1350 copy
= gimple_build_omp_ordered (s1
);
1353 case GIMPLE_OMP_SECTION
:
1354 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1355 copy
= gimple_build_omp_section (s1
);
1358 case GIMPLE_OMP_SECTIONS
:
1359 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1360 copy
= gimple_build_omp_sections
1361 (s1
, gimple_omp_sections_clauses (stmt
));
1364 case GIMPLE_OMP_SINGLE
:
1365 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1366 copy
= gimple_build_omp_single
1367 (s1
, gimple_omp_single_clauses (stmt
));
1370 case GIMPLE_OMP_CRITICAL
:
1371 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1373 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1376 case GIMPLE_TRANSACTION
:
1377 s1
= remap_gimple_seq (gimple_transaction_body (stmt
), id
);
1378 copy
= gimple_build_transaction (s1
, gimple_transaction_label (stmt
));
1379 gimple_transaction_set_subcode (copy
, gimple_transaction_subcode (stmt
));
1388 if (gimple_assign_copy_p (stmt
)
1389 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1390 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1392 /* Here we handle statements that are not completely rewritten.
1393 First we detect some inlining-induced bogosities for
1396 /* Some assignments VAR = VAR; don't generate any rtl code
1397 and thus don't count as variable modification. Avoid
1398 keeping bogosities like 0 = 0. */
1399 tree decl
= gimple_assign_lhs (stmt
), value
;
1402 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1406 STRIP_TYPE_NOPS (value
);
1407 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1408 return gimple_build_nop ();
1412 if (gimple_debug_bind_p (stmt
))
1414 copy
= gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1415 gimple_debug_bind_get_value (stmt
),
1417 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, copy
);
1420 if (gimple_debug_source_bind_p (stmt
))
1422 copy
= gimple_build_debug_source_bind
1423 (gimple_debug_source_bind_get_var (stmt
),
1424 gimple_debug_source_bind_get_value (stmt
), stmt
);
1425 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, copy
);
1429 /* Create a new deep copy of the statement. */
1430 copy
= gimple_copy (stmt
);
1432 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1433 RESX and EH_DISPATCH. */
1435 switch (gimple_code (copy
))
1439 tree r
, fndecl
= gimple_call_fndecl (copy
);
1440 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1441 switch (DECL_FUNCTION_CODE (fndecl
))
1443 case BUILT_IN_EH_COPY_VALUES
:
1444 r
= gimple_call_arg (copy
, 1);
1445 r
= remap_eh_region_tree_nr (r
, id
);
1446 gimple_call_set_arg (copy
, 1, r
);
1449 case BUILT_IN_EH_POINTER
:
1450 case BUILT_IN_EH_FILTER
:
1451 r
= gimple_call_arg (copy
, 0);
1452 r
= remap_eh_region_tree_nr (r
, id
);
1453 gimple_call_set_arg (copy
, 0, r
);
1460 /* Reset alias info if we didn't apply measures to
1461 keep it valid over inlining by setting DECL_PT_UID. */
1462 if (!id
->src_cfun
->gimple_df
1463 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1464 gimple_call_reset_alias_info (copy
);
1470 int r
= gimple_resx_region (copy
);
1471 r
= remap_eh_region_nr (r
, id
);
1472 gimple_resx_set_region (copy
, r
);
1476 case GIMPLE_EH_DISPATCH
:
1478 int r
= gimple_eh_dispatch_region (copy
);
1479 r
= remap_eh_region_nr (r
, id
);
1480 gimple_eh_dispatch_set_region (copy
, r
);
1489 /* If STMT has a block defined, map it to the newly constructed
1490 block. When inlining we want statements without a block to
1491 appear in the block of the function call. */
1492 new_block
= id
->block
;
1493 if (gimple_block (copy
))
1496 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1501 gimple_set_block (copy
, new_block
);
1503 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1506 /* Remap all the operands in COPY. */
1507 memset (&wi
, 0, sizeof (wi
));
1510 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1512 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1514 /* Clear the copied virtual operands. We are not remapping them here
1515 but are going to recreate them from scratch. */
1516 if (gimple_has_mem_ops (copy
))
1518 gimple_set_vdef (copy
, NULL_TREE
);
1519 gimple_set_vuse (copy
, NULL_TREE
);
1526 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1530 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1531 gcov_type count_scale
)
1533 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1534 basic_block copy_basic_block
;
1539 /* Search for previous copied basic block. */
1542 prev
= prev
->prev_bb
;
1544 /* create_basic_block() will append every new block to
1545 basic_block_info automatically. */
1546 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1547 (basic_block
) prev
->aux
);
1548 copy_basic_block
->count
= bb
->count
* count_scale
/ REG_BR_PROB_BASE
;
1550 /* We are going to rebuild frequencies from scratch. These values
1551 have just small importance to drive canonicalize_loop_headers. */
1552 freq
= ((gcov_type
)bb
->frequency
* frequency_scale
/ REG_BR_PROB_BASE
);
1554 /* We recompute frequencies after inlining, so this is quite safe. */
1555 if (freq
> BB_FREQ_MAX
)
1557 copy_basic_block
->frequency
= freq
;
1559 copy_gsi
= gsi_start_bb (copy_basic_block
);
1561 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1563 gimple stmt
= gsi_stmt (gsi
);
1564 gimple orig_stmt
= stmt
;
1566 id
->regimplify
= false;
1567 stmt
= remap_gimple_stmt (stmt
, id
);
1568 if (gimple_nop_p (stmt
))
1571 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1574 /* With return slot optimization we can end up with
1575 non-gimple (foo *)&this->m, fix that here. */
1576 if (is_gimple_assign (stmt
)
1577 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1578 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1581 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1582 gimple_assign_rhs1 (stmt
),
1584 GSI_CONTINUE_LINKING
);
1585 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1586 id
->regimplify
= false;
1589 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1592 gimple_regimplify_operands (stmt
, &seq_gsi
);
1594 /* If copy_basic_block has been empty at the start of this iteration,
1595 call gsi_start_bb again to get at the newly added statements. */
1596 if (gsi_end_p (copy_gsi
))
1597 copy_gsi
= gsi_start_bb (copy_basic_block
);
1599 gsi_next (©_gsi
);
1601 /* Process the new statement. The call to gimple_regimplify_operands
1602 possibly turned the statement into multiple statements, we
1603 need to process all of them. */
1608 stmt
= gsi_stmt (copy_gsi
);
1609 if (is_gimple_call (stmt
)
1610 && gimple_call_va_arg_pack_p (stmt
)
1613 /* __builtin_va_arg_pack () should be replaced by
1614 all arguments corresponding to ... in the caller. */
1617 VEC(tree
, heap
) *argarray
;
1618 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1621 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1624 /* Create the new array of arguments. */
1625 n
= nargs
+ gimple_call_num_args (stmt
);
1626 argarray
= VEC_alloc (tree
, heap
, n
);
1627 VEC_safe_grow (tree
, heap
, argarray
, n
);
1629 /* Copy all the arguments before '...' */
1630 memcpy (VEC_address (tree
, argarray
),
1631 gimple_call_arg_ptr (stmt
, 0),
1632 gimple_call_num_args (stmt
) * sizeof (tree
));
1634 /* Append the arguments passed in '...' */
1635 memcpy (VEC_address(tree
, argarray
) + gimple_call_num_args (stmt
),
1636 gimple_call_arg_ptr (id
->gimple_call
, 0)
1637 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1638 nargs
* sizeof (tree
));
1640 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1643 VEC_free (tree
, heap
, argarray
);
1645 /* Copy all GIMPLE_CALL flags, location and block, except
1646 GF_CALL_VA_ARG_PACK. */
1647 gimple_call_copy_flags (new_call
, stmt
);
1648 gimple_call_set_va_arg_pack (new_call
, false);
1649 gimple_set_location (new_call
, gimple_location (stmt
));
1650 gimple_set_block (new_call
, gimple_block (stmt
));
1651 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1653 gsi_replace (©_gsi
, new_call
, false);
1656 else if (is_gimple_call (stmt
)
1658 && (decl
= gimple_call_fndecl (stmt
))
1659 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1660 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1662 /* __builtin_va_arg_pack_len () should be replaced by
1663 the number of anonymous arguments. */
1664 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1668 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1671 count
= build_int_cst (integer_type_node
, nargs
);
1672 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1673 gsi_replace (©_gsi
, new_stmt
, false);
1677 /* Statements produced by inlining can be unfolded, especially
1678 when we constant propagated some operands. We can't fold
1679 them right now for two reasons:
1680 1) folding require SSA_NAME_DEF_STMTs to be correct
1681 2) we can't change function calls to builtins.
1682 So we just mark statement for later folding. We mark
1683 all new statements, instead just statements that has changed
1684 by some nontrivial substitution so even statements made
1685 foldable indirectly are updated. If this turns out to be
1686 expensive, copy_body can be told to watch for nontrivial
1688 if (id
->statements_to_fold
)
1689 pointer_set_insert (id
->statements_to_fold
, stmt
);
1691 /* We're duplicating a CALL_EXPR. Find any corresponding
1692 callgraph edges and update or duplicate them. */
1693 if (is_gimple_call (stmt
))
1695 struct cgraph_edge
*edge
;
1698 switch (id
->transform_call_graph_edges
)
1700 case CB_CGE_DUPLICATE
:
1701 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1704 int edge_freq
= edge
->frequency
;
1705 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1707 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1709 /* We could also just rescale the frequency, but
1710 doing so would introduce roundoff errors and make
1711 verifier unhappy. */
1713 = compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1716 && profile_status_for_function (cfun
) != PROFILE_ABSENT
1717 && (edge_freq
> edge
->frequency
+ 10
1718 || edge_freq
< edge
->frequency
- 10))
1720 fprintf (dump_file
, "Edge frequency estimated by "
1721 "cgraph %i diverge from inliner's estimate %i\n",
1725 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1728 copy_basic_block
->frequency
);
1730 stmt
= cgraph_redirect_edge_call_stmt_to_callee (edge
);
1734 case CB_CGE_MOVE_CLONES
:
1735 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1737 edge
= cgraph_edge (id
->dst_node
, stmt
);
1741 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1743 cgraph_set_call_stmt (edge
, stmt
);
1750 /* Constant propagation on argument done during inlining
1751 may create new direct call. Produce an edge for it. */
1753 || (edge
->indirect_inlining_edge
1754 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1755 && id
->dst_node
->analyzed
1756 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1758 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1760 /* We have missing edge in the callgraph. This can happen
1761 when previous inlining turned an indirect call into a
1762 direct call by constant propagating arguments or we are
1763 producing dead clone (for further cloning). In all
1764 other cases we hit a bug (incorrect node sharing is the
1765 most common reason for missing edges). */
1766 gcc_assert (!dest
->analyzed
1767 || dest
->symbol
.address_taken
1768 || !id
->src_node
->analyzed
1769 || !id
->dst_node
->analyzed
);
1770 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1771 cgraph_create_edge_including_clones
1772 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1773 compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1775 CIF_ORIGINALLY_INDIRECT_CALL
);
1777 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1779 compute_call_stmt_bb_frequency
1780 (id
->dst_node
->symbol
.decl
,
1781 copy_basic_block
))->inline_failed
1782 = CIF_ORIGINALLY_INDIRECT_CALL
;
1785 fprintf (dump_file
, "Created new direct edge to %s\n",
1786 cgraph_node_name (dest
));
1790 flags
= gimple_call_flags (stmt
);
1791 if (flags
& ECF_MAY_BE_ALLOCA
)
1792 cfun
->calls_alloca
= true;
1793 if (flags
& ECF_RETURNS_TWICE
)
1794 cfun
->calls_setjmp
= true;
1797 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1798 id
->eh_map
, id
->eh_lp_nr
);
1800 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1805 find_referenced_vars_in (gsi_stmt (copy_gsi
));
1806 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1807 if (TREE_CODE (def
) == SSA_NAME
)
1808 SSA_NAME_DEF_STMT (def
) = stmt
;
1811 gsi_next (©_gsi
);
1813 while (!gsi_end_p (copy_gsi
));
1815 copy_gsi
= gsi_last_bb (copy_basic_block
);
1818 return copy_basic_block
;
1821 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1822 form is quite easy, since dominator relationship for old basic blocks does
1825 There is however exception where inlining might change dominator relation
1826 across EH edges from basic block within inlined functions destinating
1827 to landing pads in function we inline into.
1829 The function fills in PHI_RESULTs of such PHI nodes if they refer
1830 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1831 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1832 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1833 set, and this means that there will be no overlapping live ranges
1834 for the underlying symbol.
1836 This might change in future if we allow redirecting of EH edges and
1837 we might want to change way build CFG pre-inlining to include
1838 all the possible edges then. */
1840 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1841 bool can_throw
, bool nonlocal_goto
)
1846 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1848 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1851 gimple_stmt_iterator si
;
1854 gcc_assert (e
->flags
& EDGE_EH
);
1857 gcc_assert (!(e
->flags
& EDGE_EH
));
1859 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1863 phi
= gsi_stmt (si
);
1865 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1866 gcc_assert (!e
->dest
->aux
);
1868 gcc_assert ((e
->flags
& EDGE_EH
)
1869 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1871 if (!is_gimple_reg (PHI_RESULT (phi
)))
1873 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi
)));
1877 re
= find_edge (ret_bb
, e
->dest
);
1879 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1880 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1882 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1883 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1889 /* Copy edges from BB into its copy constructed earlier, scale profile
1890 accordingly. Edges will be taken care of later. Assume aux
1891 pointers to point to the copies of each BB. Return true if any
1892 debug stmts are left after a statement that must end the basic block. */
1895 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
)
1897 basic_block new_bb
= (basic_block
) bb
->aux
;
1900 gimple_stmt_iterator si
;
1902 bool need_debug_cleanup
= false;
1904 /* Use the indices from the original blocks to create edges for the
1906 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1907 if (!(old_edge
->flags
& EDGE_EH
))
1911 flags
= old_edge
->flags
;
1913 /* Return edges do get a FALLTHRU flag when the get inlined. */
1914 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1915 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR
)
1916 flags
|= EDGE_FALLTHRU
;
1917 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1918 new_edge
->count
= old_edge
->count
* count_scale
/ REG_BR_PROB_BASE
;
1919 new_edge
->probability
= old_edge
->probability
;
1922 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1925 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
1928 bool can_throw
, nonlocal_goto
;
1930 copy_stmt
= gsi_stmt (si
);
1931 if (!is_gimple_debug (copy_stmt
))
1932 update_stmt (copy_stmt
);
1934 /* Do this before the possible split_block. */
1937 /* If this tree could throw an exception, there are two
1938 cases where we need to add abnormal edge(s): the
1939 tree wasn't in a region and there is a "current
1940 region" in the caller; or the original tree had
1941 EH edges. In both cases split the block after the tree,
1942 and add abnormal edge(s) as needed; we need both
1943 those from the callee and the caller.
1944 We check whether the copy can throw, because the const
1945 propagation can change an INDIRECT_REF which throws
1946 into a COMPONENT_REF which doesn't. If the copy
1947 can throw, the original could also throw. */
1948 can_throw
= stmt_can_throw_internal (copy_stmt
);
1949 nonlocal_goto
= stmt_can_make_abnormal_goto (copy_stmt
);
1951 if (can_throw
|| nonlocal_goto
)
1953 if (!gsi_end_p (si
))
1955 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
1958 need_debug_cleanup
= true;
1960 if (!gsi_end_p (si
))
1961 /* Note that bb's predecessor edges aren't necessarily
1962 right at this point; split_block doesn't care. */
1964 edge e
= split_block (new_bb
, copy_stmt
);
1967 new_bb
->aux
= e
->src
->aux
;
1968 si
= gsi_start_bb (new_bb
);
1972 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
1973 make_eh_dispatch_edges (copy_stmt
);
1975 make_eh_edges (copy_stmt
);
1978 make_abnormal_goto_edges (gimple_bb (copy_stmt
), true);
1980 if ((can_throw
|| nonlocal_goto
)
1981 && gimple_in_ssa_p (cfun
))
1982 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
1983 can_throw
, nonlocal_goto
);
1985 return need_debug_cleanup
;
1988 /* Copy the PHIs. All blocks and edges are copied, some blocks
1989 was possibly split and new outgoing EH edges inserted.
1990 BB points to the block of original function and AUX pointers links
1991 the original and newly copied blocks. */
1994 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
1996 basic_block
const new_bb
= (basic_block
) bb
->aux
;
1999 gimple_stmt_iterator si
;
2001 bool inserted
= false;
2003 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2008 phi
= gsi_stmt (si
);
2009 res
= PHI_RESULT (phi
);
2011 if (is_gimple_reg (res
))
2013 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2014 SSA_NAME_DEF_STMT (new_res
)
2015 = new_phi
= create_phi_node (new_res
, new_bb
);
2016 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2018 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2021 tree block
= id
->block
;
2024 /* When doing partial cloning, we allow PHIs on the entry block
2025 as long as all the arguments are the same. Find any input
2026 edge to see argument to copy. */
2028 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2029 if (!old_edge
->src
->aux
)
2032 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2034 id
->block
= NULL_TREE
;
2035 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2037 gcc_assert (new_arg
);
2038 /* With return slot optimization we can end up with
2039 non-gimple (foo *)&this->m, fix that here. */
2040 if (TREE_CODE (new_arg
) != SSA_NAME
2041 && TREE_CODE (new_arg
) != FUNCTION_DECL
2042 && !is_gimple_val (new_arg
))
2044 gimple_seq stmts
= NULL
;
2045 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2046 gsi_insert_seq_on_edge (new_edge
, stmts
);
2049 add_phi_arg (new_phi
, new_arg
, new_edge
,
2050 gimple_phi_arg_location_from_edge (phi
, old_edge
));
2055 /* Commit the delayed edge insertions. */
2057 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2058 gsi_commit_one_edge_insert (new_edge
, NULL
);
2062 /* Wrapper for remap_decl so it can be used as a callback. */
2065 remap_decl_1 (tree decl
, void *data
)
2067 return remap_decl (decl
, (copy_body_data
*) data
);
2070 /* Build struct function and associated datastructures for the new clone
2071 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
2074 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2076 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2077 gcov_type count_scale
;
2079 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2080 count_scale
= (REG_BR_PROB_BASE
* count
2081 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2083 count_scale
= REG_BR_PROB_BASE
;
2085 /* Register specific tree functions. */
2086 gimple_register_cfg_hooks ();
2088 /* Get clean struct function. */
2089 push_struct_function (new_fndecl
);
2091 /* We will rebuild these, so just sanity check that they are empty. */
2092 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2093 gcc_assert (cfun
->local_decls
== NULL
);
2094 gcc_assert (cfun
->cfg
== NULL
);
2095 gcc_assert (cfun
->decl
== new_fndecl
);
2097 /* Copy items we preserve during cloning. */
2098 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2099 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2100 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2101 cfun
->curr_properties
= src_cfun
->curr_properties
& ~PROP_loops
;
2102 cfun
->last_verified
= src_cfun
->last_verified
;
2103 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2104 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2105 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2106 cfun
->stdarg
= src_cfun
->stdarg
;
2107 cfun
->after_inlining
= src_cfun
->after_inlining
;
2108 cfun
->can_throw_non_call_exceptions
2109 = src_cfun
->can_throw_non_call_exceptions
;
2110 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2111 cfun
->returns_struct
= src_cfun
->returns_struct
;
2112 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2114 init_empty_tree_cfg ();
2116 profile_status_for_function (cfun
) = profile_status_for_function (src_cfun
);
2117 ENTRY_BLOCK_PTR
->count
=
2118 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2120 ENTRY_BLOCK_PTR
->frequency
2121 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2122 EXIT_BLOCK_PTR
->count
=
2123 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2125 EXIT_BLOCK_PTR
->frequency
=
2126 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2128 init_eh_for_function ();
2130 if (src_cfun
->gimple_df
)
2132 init_tree_ssa (cfun
);
2133 cfun
->gimple_df
->in_ssa_p
= true;
2134 init_ssa_operands (cfun
);
2139 /* Helper function for copy_cfg_body. Move debug stmts from the end
2140 of NEW_BB to the beginning of successor basic blocks when needed. If the
2141 successor has multiple predecessors, reset them, otherwise keep
2145 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2149 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2152 || gsi_one_before_end_p (si
)
2153 || !(stmt_can_throw_internal (gsi_stmt (si
))
2154 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2157 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2159 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2160 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2161 while (is_gimple_debug (gsi_stmt (ssi
)))
2163 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2167 /* For the last edge move the debug stmts instead of copying
2169 if (ei_one_before_end_p (ei
))
2173 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2174 gimple_debug_bind_reset_value (stmt
);
2175 gsi_remove (&si
, false);
2176 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2180 if (gimple_debug_bind_p (stmt
))
2182 var
= gimple_debug_bind_get_var (stmt
);
2183 if (single_pred_p (e
->dest
))
2185 value
= gimple_debug_bind_get_value (stmt
);
2186 value
= unshare_expr (value
);
2190 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2192 else if (gimple_debug_source_bind_p (stmt
))
2194 var
= gimple_debug_source_bind_get_var (stmt
);
2195 value
= gimple_debug_source_bind_get_value (stmt
);
2196 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2200 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2201 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, new_stmt
);
2207 /* Make a copy of the body of FN so that it can be inserted inline in
2208 another function. Walks FN via CFG, returns new fndecl. */
2211 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2212 basic_block entry_block_map
, basic_block exit_block_map
,
2213 bitmap blocks_to_copy
, basic_block new_entry
)
2215 tree callee_fndecl
= id
->src_fn
;
2216 /* Original cfun for the callee, doesn't change. */
2217 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2218 struct function
*cfun_to_copy
;
2220 tree new_fndecl
= NULL
;
2221 bool need_debug_cleanup
= false;
2222 gcov_type count_scale
;
2224 int incoming_frequency
= 0;
2225 gcov_type incoming_count
= 0;
2227 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2228 count_scale
= (REG_BR_PROB_BASE
* count
2229 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2231 count_scale
= REG_BR_PROB_BASE
;
2233 /* Register specific tree functions. */
2234 gimple_register_cfg_hooks ();
2236 /* If we are inlining just region of the function, make sure to connect new entry
2237 to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute
2238 frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and
2239 probabilities of edges incoming from nonduplicated region. */
2245 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2248 incoming_frequency
+= EDGE_FREQUENCY (e
);
2249 incoming_count
+= e
->count
;
2251 incoming_count
= incoming_count
* count_scale
/ REG_BR_PROB_BASE
;
2253 = incoming_frequency
* frequency_scale
/ REG_BR_PROB_BASE
;
2254 ENTRY_BLOCK_PTR
->count
= incoming_count
;
2255 ENTRY_BLOCK_PTR
->frequency
= incoming_frequency
;
2258 /* Must have a CFG here at this point. */
2259 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2260 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2262 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2264 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= entry_block_map
;
2265 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= exit_block_map
;
2266 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2267 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2269 /* Duplicate any exception-handling regions. */
2271 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2274 /* Use aux pointers to map the original blocks to copy. */
2275 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2276 if (!blocks_to_copy
|| bitmap_bit_p (blocks_to_copy
, bb
->index
))
2278 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2283 last
= last_basic_block
;
2285 /* Now that we've duplicated the blocks, duplicate their edges. */
2286 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2288 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2289 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
);
2293 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2294 e
->probability
= REG_BR_PROB_BASE
;
2295 e
->count
= incoming_count
;
2298 if (gimple_in_ssa_p (cfun
))
2299 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2301 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2302 copy_phis_for_bb (bb
, id
);
2304 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2307 if (need_debug_cleanup
2308 && bb
->index
!= ENTRY_BLOCK
2309 && bb
->index
!= EXIT_BLOCK
)
2310 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2311 ((basic_block
)bb
->aux
)->aux
= NULL
;
2315 /* Zero out AUX fields of newly created block during EH edge
2317 for (; last
< last_basic_block
; last
++)
2319 if (need_debug_cleanup
)
2320 maybe_move_debug_stmts_to_successors (id
, BASIC_BLOCK (last
));
2321 BASIC_BLOCK (last
)->aux
= NULL
;
2323 entry_block_map
->aux
= NULL
;
2324 exit_block_map
->aux
= NULL
;
2328 pointer_map_destroy (id
->eh_map
);
2335 /* Copy the debug STMT using ID. We deal with these statements in a
2336 special way: if any variable in their VALUE expression wasn't
2337 remapped yet, we won't remap it, because that would get decl uids
2338 out of sync, causing codegen differences between -g and -g0. If
2339 this arises, we drop the VALUE expression altogether. */
2342 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2345 struct walk_stmt_info wi
;
2348 if (gimple_block (stmt
))
2350 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2354 gimple_set_block (stmt
, t
);
2356 /* Remap all the operands in COPY. */
2357 memset (&wi
, 0, sizeof (wi
));
2360 processing_debug_stmt
= 1;
2362 if (gimple_debug_source_bind_p (stmt
))
2363 t
= gimple_debug_source_bind_get_var (stmt
);
2365 t
= gimple_debug_bind_get_var (stmt
);
2367 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2368 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2370 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2373 else if (TREE_CODE (t
) == VAR_DECL
2375 && gimple_in_ssa_p (cfun
)
2376 && !pointer_map_contains (id
->decl_map
, t
)
2378 /* T is a non-localized variable. */;
2380 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2382 if (gimple_debug_bind_p (stmt
))
2384 gimple_debug_bind_set_var (stmt
, t
);
2386 if (gimple_debug_bind_has_value_p (stmt
))
2387 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2388 remap_gimple_op_r
, &wi
, NULL
);
2390 /* Punt if any decl couldn't be remapped. */
2391 if (processing_debug_stmt
< 0)
2392 gimple_debug_bind_reset_value (stmt
);
2394 else if (gimple_debug_source_bind_p (stmt
))
2396 gimple_debug_source_bind_set_var (stmt
, t
);
2397 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2398 remap_gimple_op_r
, &wi
, NULL
);
2401 processing_debug_stmt
= 0;
2406 /* Process deferred debug stmts. In order to give values better odds
2407 of being successfully remapped, we delay the processing of debug
2408 stmts until all other stmts that might require remapping are
2412 copy_debug_stmts (copy_body_data
*id
)
2417 if (!id
->debug_stmts
)
2420 FOR_EACH_VEC_ELT (gimple
, id
->debug_stmts
, i
, stmt
)
2421 copy_debug_stmt (stmt
, id
);
2423 VEC_free (gimple
, heap
, id
->debug_stmts
);
2426 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2427 another function. */
2430 copy_tree_body (copy_body_data
*id
)
2432 tree fndecl
= id
->src_fn
;
2433 tree body
= DECL_SAVED_TREE (fndecl
);
2435 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2440 /* Make a copy of the body of FN so that it can be inserted inline in
2441 another function. */
2444 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2445 basic_block entry_block_map
, basic_block exit_block_map
,
2446 bitmap blocks_to_copy
, basic_block new_entry
)
2448 tree fndecl
= id
->src_fn
;
2451 /* If this body has a CFG, walk CFG and copy. */
2452 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl
)));
2453 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2454 blocks_to_copy
, new_entry
);
2455 copy_debug_stmts (id
);
2460 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2461 defined in function FN, or of a data member thereof. */
2464 self_inlining_addr_expr (tree value
, tree fn
)
2468 if (TREE_CODE (value
) != ADDR_EXPR
)
2471 var
= get_base_address (TREE_OPERAND (value
, 0));
2473 return var
&& auto_var_in_fn_p (var
, fn
);
2476 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2477 lexical block and line number information from base_stmt, if given,
2478 or from the last stmt of the block otherwise. */
2481 insert_init_debug_bind (copy_body_data
*id
,
2482 basic_block bb
, tree var
, tree value
,
2486 gimple_stmt_iterator gsi
;
2489 if (!gimple_in_ssa_p (id
->src_cfun
))
2492 if (!MAY_HAVE_DEBUG_STMTS
)
2495 tracked_var
= target_for_debug_bind (var
);
2501 gsi
= gsi_last_bb (bb
);
2502 if (!base_stmt
&& !gsi_end_p (gsi
))
2503 base_stmt
= gsi_stmt (gsi
);
2506 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2510 if (!gsi_end_p (gsi
))
2511 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2513 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2520 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2522 /* If VAR represents a zero-sized variable, it's possible that the
2523 assignment statement may result in no gimple statements. */
2526 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2528 /* We can end up with init statements that store to a non-register
2529 from a rhs with a conversion. Handle that here by forcing the
2530 rhs into a temporary. gimple_regimplify_operands is not
2531 prepared to do this for us. */
2532 if (!is_gimple_debug (init_stmt
)
2533 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2534 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2535 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2537 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2538 gimple_expr_type (init_stmt
),
2539 gimple_assign_rhs1 (init_stmt
));
2540 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2542 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2543 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2545 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2546 gimple_regimplify_operands (init_stmt
, &si
);
2548 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2550 tree var
, def
= gimple_assign_lhs (init_stmt
);
2552 if (TREE_CODE (def
) == SSA_NAME
)
2553 var
= SSA_NAME_VAR (def
);
2557 insert_init_debug_bind (id
, bb
, var
, def
, init_stmt
);
2562 /* Initialize parameter P with VALUE. If needed, produce init statement
2563 at the end of BB. When BB is NULL, we return init statement to be
2566 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2567 basic_block bb
, tree
*vars
)
2569 gimple init_stmt
= NULL
;
2572 tree def
= (gimple_in_ssa_p (cfun
)
2573 ? gimple_default_def (id
->src_cfun
, p
) : NULL
);
2576 && value
!= error_mark_node
2577 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2579 /* If we can match up types by promotion/demotion do so. */
2580 if (fold_convertible_p (TREE_TYPE (p
), value
))
2581 rhs
= fold_convert (TREE_TYPE (p
), value
);
2584 /* ??? For valid programs we should not end up here.
2585 Still if we end up with truly mismatched types here, fall back
2586 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2587 GIMPLE to the following passes. */
2588 if (!is_gimple_reg_type (TREE_TYPE (value
))
2589 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2590 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2592 rhs
= build_zero_cst (TREE_TYPE (p
));
2596 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2597 here since the type of this decl must be visible to the calling
2599 var
= copy_decl_to_var (p
, id
);
2601 /* We're actually using the newly-created var. */
2602 if (gimple_in_ssa_p (cfun
) && TREE_CODE (var
) == VAR_DECL
)
2603 add_referenced_var (var
);
2605 /* Declare this new variable. */
2606 DECL_CHAIN (var
) = *vars
;
2609 /* Make gimplifier happy about this variable. */
2610 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2612 /* We are eventually using the value - make sure all variables
2613 referenced therein are properly recorded. */
2615 && gimple_referenced_vars (cfun
)
2616 && TREE_CODE (value
) == ADDR_EXPR
)
2618 tree base
= get_base_address (TREE_OPERAND (value
, 0));
2619 if (base
&& TREE_CODE (base
) == VAR_DECL
&& !is_global_var (base
))
2620 add_referenced_var (base
);
2623 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2624 we would not need to create a new variable here at all, if it
2625 weren't for debug info. Still, we can just use the argument
2627 if (TREE_READONLY (p
)
2628 && !TREE_ADDRESSABLE (p
)
2629 && value
&& !TREE_SIDE_EFFECTS (value
)
2632 /* We may produce non-gimple trees by adding NOPs or introduce
2633 invalid sharing when operand is not really constant.
2634 It is not big deal to prohibit constant propagation here as
2635 we will constant propagate in DOM1 pass anyway. */
2636 if (is_gimple_min_invariant (value
)
2637 && useless_type_conversion_p (TREE_TYPE (p
),
2639 /* We have to be very careful about ADDR_EXPR. Make sure
2640 the base variable isn't a local variable of the inlined
2641 function, e.g., when doing recursive inlining, direct or
2642 mutually-recursive or whatever, which is why we don't
2643 just test whether fn == current_function_decl. */
2644 && ! self_inlining_addr_expr (value
, fn
))
2646 insert_decl_map (id
, p
, value
);
2647 insert_debug_decl_map (id
, p
, var
);
2648 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2652 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2653 that way, when the PARM_DECL is encountered, it will be
2654 automatically replaced by the VAR_DECL. */
2655 insert_decl_map (id
, p
, var
);
2657 /* Even if P was TREE_READONLY, the new VAR should not be.
2658 In the original code, we would have constructed a
2659 temporary, and then the function body would have never
2660 changed the value of P. However, now, we will be
2661 constructing VAR directly. The constructor body may
2662 change its value multiple times as it is being
2663 constructed. Therefore, it must not be TREE_READONLY;
2664 the back-end assumes that TREE_READONLY variable is
2665 assigned to only once. */
2666 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2667 TREE_READONLY (var
) = 0;
2669 /* If there is no setup required and we are in SSA, take the easy route
2670 replacing all SSA names representing the function parameter by the
2671 SSA name passed to function.
2673 We need to construct map for the variable anyway as it might be used
2674 in different SSA names when parameter is set in function.
2676 Do replacement at -O0 for const arguments replaced by constant.
2677 This is important for builtin_constant_p and other construct requiring
2678 constant argument to be visible in inlined function body. */
2679 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2681 || (TREE_READONLY (p
)
2682 && is_gimple_min_invariant (rhs
)))
2683 && (TREE_CODE (rhs
) == SSA_NAME
2684 || is_gimple_min_invariant (rhs
))
2685 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2687 insert_decl_map (id
, def
, rhs
);
2688 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2691 /* If the value of argument is never used, don't care about initializing
2693 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2695 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2696 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2699 /* Initialize this VAR_DECL from the equivalent argument. Convert
2700 the argument to the proper type in case it was promoted. */
2703 if (rhs
== error_mark_node
)
2705 insert_decl_map (id
, p
, var
);
2706 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2709 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2711 /* If we are in SSA form properly remap the default definition
2712 or assign to a dummy SSA name if the parameter is unused and
2713 we are not optimizing. */
2714 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2718 def
= remap_ssa_name (def
, id
);
2719 init_stmt
= gimple_build_assign (def
, rhs
);
2720 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2721 set_default_def (var
, NULL
);
2725 def
= make_ssa_name (var
, NULL
);
2726 init_stmt
= gimple_build_assign (def
, rhs
);
2730 init_stmt
= gimple_build_assign (var
, rhs
);
2732 if (bb
&& init_stmt
)
2733 insert_init_stmt (id
, bb
, init_stmt
);
2738 /* Generate code to initialize the parameters of the function at the
2739 top of the stack in ID from the GIMPLE_CALL STMT. */
2742 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2743 tree fn
, basic_block bb
)
2748 tree vars
= NULL_TREE
;
2749 tree static_chain
= gimple_call_chain (stmt
);
2751 /* Figure out what the parameters are. */
2752 parms
= DECL_ARGUMENTS (fn
);
2754 /* Loop through the parameter declarations, replacing each with an
2755 equivalent VAR_DECL, appropriately initialized. */
2756 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2759 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2760 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2762 /* After remapping parameters remap their types. This has to be done
2763 in a second loop over all parameters to appropriately remap
2764 variable sized arrays when the size is specified in a
2765 parameter following the array. */
2766 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2768 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
2770 && TREE_CODE (*varp
) == VAR_DECL
)
2772 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
2773 ? gimple_default_def (id
->src_cfun
, p
) : NULL
);
2775 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
2776 /* Also remap the default definition if it was remapped
2777 to the default definition of the parameter replacement
2778 by the parameter setup. */
2781 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
2783 && TREE_CODE (*defp
) == SSA_NAME
2784 && SSA_NAME_VAR (*defp
) == var
)
2785 TREE_TYPE (*defp
) = TREE_TYPE (var
);
2790 /* Initialize the static chain. */
2791 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
2792 gcc_assert (fn
!= current_function_decl
);
2795 /* No static chain? Seems like a bug in tree-nested.c. */
2796 gcc_assert (static_chain
);
2798 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
2801 declare_inline_vars (id
->block
, vars
);
2805 /* Declare a return variable to replace the RESULT_DECL for the
2806 function we are calling. An appropriate DECL_STMT is returned.
2807 The USE_STMT is filled to contain a use of the declaration to
2808 indicate the return value of the function.
2810 RETURN_SLOT, if non-null is place where to store the result. It
2811 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2812 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2814 The return value is a (possibly null) value that holds the result
2815 as seen by the caller. */
2818 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
2819 basic_block entry_bb
)
2821 tree callee
= id
->src_fn
;
2822 tree result
= DECL_RESULT (callee
);
2823 tree callee_type
= TREE_TYPE (result
);
2827 /* Handle type-mismatches in the function declaration return type
2828 vs. the call expression. */
2830 caller_type
= TREE_TYPE (modify_dest
);
2832 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
2834 /* We don't need to do anything for functions that don't return anything. */
2835 if (VOID_TYPE_P (callee_type
))
2838 /* If there was a return slot, then the return value is the
2839 dereferenced address of that object. */
2842 /* The front end shouldn't have used both return_slot and
2843 a modify expression. */
2844 gcc_assert (!modify_dest
);
2845 if (DECL_BY_REFERENCE (result
))
2847 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
2848 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
2850 /* We are going to construct *&return_slot and we can't do that
2851 for variables believed to be not addressable.
2853 FIXME: This check possibly can match, because values returned
2854 via return slot optimization are not believed to have address
2855 taken by alias analysis. */
2856 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
2857 var
= return_slot_addr
;
2862 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
2863 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
2865 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2866 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2867 && !DECL_GIMPLE_REG_P (result
)
2869 DECL_GIMPLE_REG_P (var
) = 0;
2874 /* All types requiring non-trivial constructors should have been handled. */
2875 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
2877 /* Attempt to avoid creating a new temporary variable. */
2879 && TREE_CODE (modify_dest
) != SSA_NAME
)
2881 bool use_it
= false;
2883 /* We can't use MODIFY_DEST if there's type promotion involved. */
2884 if (!useless_type_conversion_p (callee_type
, caller_type
))
2887 /* ??? If we're assigning to a variable sized type, then we must
2888 reuse the destination variable, because we've no good way to
2889 create variable sized temporaries at this point. */
2890 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
2893 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2894 reuse it as the result of the call directly. Don't do this if
2895 it would promote MODIFY_DEST to addressable. */
2896 else if (TREE_ADDRESSABLE (result
))
2900 tree base_m
= get_base_address (modify_dest
);
2902 /* If the base isn't a decl, then it's a pointer, and we don't
2903 know where that's going to go. */
2904 if (!DECL_P (base_m
))
2906 else if (is_global_var (base_m
))
2908 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2909 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2910 && !DECL_GIMPLE_REG_P (result
)
2911 && DECL_GIMPLE_REG_P (base_m
))
2913 else if (!TREE_ADDRESSABLE (base_m
))
2925 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
2927 var
= copy_result_decl_to_var (result
, id
);
2928 if (gimple_referenced_vars (cfun
))
2929 add_referenced_var (var
);
2931 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2933 /* Do not have the rest of GCC warn about this variable as it should
2934 not be visible to the user. */
2935 TREE_NO_WARNING (var
) = 1;
2937 declare_inline_vars (id
->block
, var
);
2939 /* Build the use expr. If the return type of the function was
2940 promoted, convert it back to the expected type. */
2942 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
2944 /* If we can match up types by promotion/demotion do so. */
2945 if (fold_convertible_p (caller_type
, var
))
2946 use
= fold_convert (caller_type
, var
);
2949 /* ??? For valid programs we should not end up here.
2950 Still if we end up with truly mismatched types here, fall back
2951 to using a MEM_REF to not leak invalid GIMPLE to the following
2953 /* Prevent var from being written into SSA form. */
2954 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
2955 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
2956 DECL_GIMPLE_REG_P (var
) = false;
2957 else if (is_gimple_reg_type (TREE_TYPE (var
)))
2958 TREE_ADDRESSABLE (var
) = true;
2959 use
= fold_build2 (MEM_REF
, caller_type
,
2960 build_fold_addr_expr (var
),
2961 build_int_cst (ptr_type_node
, 0));
2965 STRIP_USELESS_TYPE_CONVERSION (use
);
2967 if (DECL_BY_REFERENCE (result
))
2969 TREE_ADDRESSABLE (var
) = 1;
2970 var
= build_fold_addr_expr (var
);
2972 else if (gimple_in_ssa_p (cfun
)
2973 && is_gimple_reg (var
))
2974 /* ??? Re-org id->retval and its special handling so that we can
2975 record an SSA name directly and not need to invoke the SSA renamer. */
2976 mark_sym_for_renaming (var
);
2979 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2980 way, when the RESULT_DECL is encountered, it will be
2981 automatically replaced by the VAR_DECL.
2983 When returning by reference, ensure that RESULT_DECL remaps to
2985 if (DECL_BY_REFERENCE (result
)
2986 && !is_gimple_val (var
))
2988 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
2989 if (gimple_referenced_vars (cfun
))
2990 add_referenced_var (temp
);
2991 insert_decl_map (id
, result
, temp
);
2992 /* When RESULT_DECL is in SSA form, we need to remap and initialize
2993 it's default_def SSA_NAME. */
2994 if (gimple_in_ssa_p (id
->src_cfun
)
2995 && is_gimple_reg (result
))
2997 temp
= make_ssa_name (temp
, NULL
);
2998 insert_decl_map (id
, gimple_default_def (id
->src_cfun
, result
),
3001 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3004 insert_decl_map (id
, result
, var
);
3006 /* Remember this so we can ignore it in remap_decls. */
3012 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3013 to a local label. */
3016 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3019 tree fn
= (tree
) fnp
;
3021 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3030 /* Determine if the function can be copied. If so return NULL. If
3031 not return a string describng the reason for failure. */
3034 copy_forbidden (struct function
*fun
, tree fndecl
)
3036 const char *reason
= fun
->cannot_be_copied_reason
;
3040 /* Only examine the function once. */
3041 if (fun
->cannot_be_copied_set
)
3044 /* We cannot copy a function that receives a non-local goto
3045 because we cannot remap the destination label used in the
3046 function that is performing the non-local goto. */
3047 /* ??? Actually, this should be possible, if we work at it.
3048 No doubt there's just a handful of places that simply
3049 assume it doesn't happen and don't substitute properly. */
3050 if (fun
->has_nonlocal_label
)
3052 reason
= G_("function %q+F can never be copied "
3053 "because it receives a non-local goto");
3057 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3058 if (TREE_CODE (decl
) == VAR_DECL
3059 && TREE_STATIC (decl
)
3060 && !DECL_EXTERNAL (decl
)
3061 && DECL_INITIAL (decl
)
3062 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3063 has_label_address_in_static_1
,
3066 reason
= G_("function %q+F can never be copied because it saves "
3067 "address of local label in a static variable");
3072 fun
->cannot_be_copied_reason
= reason
;
3073 fun
->cannot_be_copied_set
= true;
3078 static const char *inline_forbidden_reason
;
3080 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3081 iff a function can not be inlined. Also sets the reason why. */
3084 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3085 struct walk_stmt_info
*wip
)
3087 tree fn
= (tree
) wip
->info
;
3089 gimple stmt
= gsi_stmt (*gsi
);
3091 switch (gimple_code (stmt
))
3094 /* Refuse to inline alloca call unless user explicitly forced so as
3095 this may change program's memory overhead drastically when the
3096 function using alloca is called in loop. In GCC present in
3097 SPEC2000 inlining into schedule_block cause it to require 2GB of
3098 RAM instead of 256MB. Don't do so for alloca calls emitted for
3099 VLA objects as those can't cause unbounded growth (they're always
3100 wrapped inside stack_save/stack_restore regions. */
3101 if (gimple_alloca_call_p (stmt
)
3102 && !gimple_call_alloca_for_var_p (stmt
)
3103 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3105 inline_forbidden_reason
3106 = G_("function %q+F can never be inlined because it uses "
3107 "alloca (override using the always_inline attribute)");
3108 *handled_ops_p
= true;
3112 t
= gimple_call_fndecl (stmt
);
3116 /* We cannot inline functions that call setjmp. */
3117 if (setjmp_call_p (t
))
3119 inline_forbidden_reason
3120 = G_("function %q+F can never be inlined because it uses setjmp");
3121 *handled_ops_p
= true;
3125 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3126 switch (DECL_FUNCTION_CODE (t
))
3128 /* We cannot inline functions that take a variable number of
3130 case BUILT_IN_VA_START
:
3131 case BUILT_IN_NEXT_ARG
:
3132 case BUILT_IN_VA_END
:
3133 inline_forbidden_reason
3134 = G_("function %q+F can never be inlined because it "
3135 "uses variable argument lists");
3136 *handled_ops_p
= true;
3139 case BUILT_IN_LONGJMP
:
3140 /* We can't inline functions that call __builtin_longjmp at
3141 all. The non-local goto machinery really requires the
3142 destination be in a different function. If we allow the
3143 function calling __builtin_longjmp to be inlined into the
3144 function calling __builtin_setjmp, Things will Go Awry. */
3145 inline_forbidden_reason
3146 = G_("function %q+F can never be inlined because "
3147 "it uses setjmp-longjmp exception handling");
3148 *handled_ops_p
= true;
3151 case BUILT_IN_NONLOCAL_GOTO
:
3153 inline_forbidden_reason
3154 = G_("function %q+F can never be inlined because "
3155 "it uses non-local goto");
3156 *handled_ops_p
= true;
3159 case BUILT_IN_RETURN
:
3160 case BUILT_IN_APPLY_ARGS
:
3161 /* If a __builtin_apply_args caller would be inlined,
3162 it would be saving arguments of the function it has
3163 been inlined into. Similarly __builtin_return would
3164 return from the function the inline has been inlined into. */
3165 inline_forbidden_reason
3166 = G_("function %q+F can never be inlined because "
3167 "it uses __builtin_return or __builtin_apply_args");
3168 *handled_ops_p
= true;
3177 t
= gimple_goto_dest (stmt
);
3179 /* We will not inline a function which uses computed goto. The
3180 addresses of its local labels, which may be tucked into
3181 global storage, are of course not constant across
3182 instantiations, which causes unexpected behavior. */
3183 if (TREE_CODE (t
) != LABEL_DECL
)
3185 inline_forbidden_reason
3186 = G_("function %q+F can never be inlined "
3187 "because it contains a computed goto");
3188 *handled_ops_p
= true;
3197 *handled_ops_p
= false;
3201 /* Return true if FNDECL is a function that cannot be inlined into
3205 inline_forbidden_p (tree fndecl
)
3207 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3208 struct walk_stmt_info wi
;
3209 struct pointer_set_t
*visited_nodes
;
3211 bool forbidden_p
= false;
3213 /* First check for shared reasons not to copy the code. */
3214 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3215 if (inline_forbidden_reason
!= NULL
)
3218 /* Next, walk the statements of the function looking for
3219 constraucts we can't handle, or are non-optimal for inlining. */
3220 visited_nodes
= pointer_set_create ();
3221 memset (&wi
, 0, sizeof (wi
));
3222 wi
.info
= (void *) fndecl
;
3223 wi
.pset
= visited_nodes
;
3225 FOR_EACH_BB_FN (bb
, fun
)
3228 gimple_seq seq
= bb_seq (bb
);
3229 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3230 forbidden_p
= (ret
!= NULL
);
3235 pointer_set_destroy (visited_nodes
);
3239 /* Return false if the function FNDECL cannot be inlined on account of its
3240 attributes, true otherwise. */
3242 function_attribute_inlinable_p (const_tree fndecl
)
3244 if (targetm
.attribute_table
)
3248 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3250 const_tree name
= TREE_PURPOSE (a
);
3253 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3254 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3255 return targetm
.function_attribute_inlinable_p (fndecl
);
3262 /* Returns nonzero if FN is a function that does not have any
3263 fundamental inline blocking properties. */
3266 tree_inlinable_function_p (tree fn
)
3268 bool inlinable
= true;
3272 /* If we've already decided this function shouldn't be inlined,
3273 there's no need to check again. */
3274 if (DECL_UNINLINABLE (fn
))
3277 /* We only warn for functions declared `inline' by the user. */
3278 do_warning
= (warn_inline
3279 && DECL_DECLARED_INLINE_P (fn
)
3280 && !DECL_NO_INLINE_WARNING_P (fn
)
3281 && !DECL_IN_SYSTEM_HEADER (fn
));
3283 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3286 && always_inline
== NULL
)
3289 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3290 "is suppressed using -fno-inline", fn
);
3294 else if (!function_attribute_inlinable_p (fn
))
3297 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3298 "uses attributes conflicting with inlining", fn
);
3302 else if (inline_forbidden_p (fn
))
3304 /* See if we should warn about uninlinable functions. Previously,
3305 some of these warnings would be issued while trying to expand
3306 the function inline, but that would cause multiple warnings
3307 about functions that would for example call alloca. But since
3308 this a property of the function, just one warning is enough.
3309 As a bonus we can now give more details about the reason why a
3310 function is not inlinable. */
3312 error (inline_forbidden_reason
, fn
);
3313 else if (do_warning
)
3314 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3319 /* Squirrel away the result so that we don't have to check again. */
3320 DECL_UNINLINABLE (fn
) = !inlinable
;
3325 /* Estimate the cost of a memory move. Use machine dependent
3326 word size and take possible memcpy call into account. */
3329 estimate_move_cost (tree type
)
3333 gcc_assert (!VOID_TYPE_P (type
));
3335 if (TREE_CODE (type
) == VECTOR_TYPE
)
3337 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3338 enum machine_mode simd
3339 = targetm
.vectorize
.preferred_simd_mode (inner
);
3340 int simd_mode_size
= GET_MODE_SIZE (simd
);
3341 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3345 size
= int_size_in_bytes (type
);
3347 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3348 /* Cost of a memcpy call, 3 arguments and the call. */
3351 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3354 /* Returns cost of operation CODE, according to WEIGHTS */
3357 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3358 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3362 /* These are "free" conversions, or their presumed cost
3363 is folded into other operations. */
3368 case VIEW_CONVERT_EXPR
:
3371 /* Assign cost of 1 to usual operations.
3372 ??? We may consider mapping RTL costs to this. */
3378 case POINTER_PLUS_EXPR
:
3381 case MULT_HIGHPART_EXPR
:
3384 case ADDR_SPACE_CONVERT_EXPR
:
3385 case FIXED_CONVERT_EXPR
:
3386 case FIX_TRUNC_EXPR
:
3398 case VEC_LSHIFT_EXPR
:
3399 case VEC_RSHIFT_EXPR
:
3406 case TRUTH_ANDIF_EXPR
:
3407 case TRUTH_ORIF_EXPR
:
3408 case TRUTH_AND_EXPR
:
3410 case TRUTH_XOR_EXPR
:
3411 case TRUTH_NOT_EXPR
:
3420 case UNORDERED_EXPR
:
3431 case PREDECREMENT_EXPR
:
3432 case PREINCREMENT_EXPR
:
3433 case POSTDECREMENT_EXPR
:
3434 case POSTINCREMENT_EXPR
:
3436 case REALIGN_LOAD_EXPR
:
3438 case REDUC_MAX_EXPR
:
3439 case REDUC_MIN_EXPR
:
3440 case REDUC_PLUS_EXPR
:
3441 case WIDEN_SUM_EXPR
:
3442 case WIDEN_MULT_EXPR
:
3444 case WIDEN_MULT_PLUS_EXPR
:
3445 case WIDEN_MULT_MINUS_EXPR
:
3446 case WIDEN_LSHIFT_EXPR
:
3448 case VEC_WIDEN_MULT_HI_EXPR
:
3449 case VEC_WIDEN_MULT_LO_EXPR
:
3450 case VEC_WIDEN_MULT_EVEN_EXPR
:
3451 case VEC_WIDEN_MULT_ODD_EXPR
:
3452 case VEC_UNPACK_HI_EXPR
:
3453 case VEC_UNPACK_LO_EXPR
:
3454 case VEC_UNPACK_FLOAT_HI_EXPR
:
3455 case VEC_UNPACK_FLOAT_LO_EXPR
:
3456 case VEC_PACK_TRUNC_EXPR
:
3457 case VEC_PACK_SAT_EXPR
:
3458 case VEC_PACK_FIX_TRUNC_EXPR
:
3459 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3460 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3464 /* Few special cases of expensive operations. This is useful
3465 to avoid inlining on functions having too many of these. */
3466 case TRUNC_DIV_EXPR
:
3468 case FLOOR_DIV_EXPR
:
3469 case ROUND_DIV_EXPR
:
3470 case EXACT_DIV_EXPR
:
3471 case TRUNC_MOD_EXPR
:
3473 case FLOOR_MOD_EXPR
:
3474 case ROUND_MOD_EXPR
:
3476 if (TREE_CODE (op2
) != INTEGER_CST
)
3477 return weights
->div_mod_cost
;
3481 /* We expect a copy assignment with no operator. */
3482 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3488 /* Estimate number of instructions that will be created by expanding
3489 the statements in the statement sequence STMTS.
3490 WEIGHTS contains weights attributed to various constructs. */
3493 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3496 gimple_stmt_iterator gsi
;
3499 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3500 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3506 /* Estimate number of instructions that will be created by expanding STMT.
3507 WEIGHTS contains weights attributed to various constructs. */
3510 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3513 enum gimple_code code
= gimple_code (stmt
);
3520 /* Try to estimate the cost of assignments. We have three cases to
3522 1) Simple assignments to registers;
3523 2) Stores to things that must live in memory. This includes
3524 "normal" stores to scalars, but also assignments of large
3525 structures, or constructors of big arrays;
3527 Let us look at the first two cases, assuming we have "a = b + C":
3528 <GIMPLE_ASSIGN <var_decl "a">
3529 <plus_expr <var_decl "b"> <constant C>>
3530 If "a" is a GIMPLE register, the assignment to it is free on almost
3531 any target, because "a" usually ends up in a real register. Hence
3532 the only cost of this expression comes from the PLUS_EXPR, and we
3533 can ignore the GIMPLE_ASSIGN.
3534 If "a" is not a GIMPLE register, the assignment to "a" will most
3535 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3536 of moving something into "a", which we compute using the function
3537 estimate_move_cost. */
3538 if (gimple_clobber_p (stmt
))
3539 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3541 lhs
= gimple_assign_lhs (stmt
);
3542 rhs
= gimple_assign_rhs1 (stmt
);
3544 if (is_gimple_reg (lhs
))
3547 cost
= estimate_move_cost (TREE_TYPE (lhs
));
3549 if (!is_gimple_reg (rhs
) && !is_gimple_min_invariant (rhs
))
3550 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3552 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3553 gimple_assign_rhs1 (stmt
),
3554 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3555 == GIMPLE_BINARY_RHS
3556 ? gimple_assign_rhs2 (stmt
) : NULL
);
3560 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3561 gimple_op (stmt
, 0),
3562 gimple_op (stmt
, 1));
3566 /* Take into account cost of the switch + guess 2 conditional jumps for
3569 TODO: once the switch expansion logic is sufficiently separated, we can
3570 do better job on estimating cost of the switch. */
3571 if (weights
->time_based
)
3572 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3574 cost
= gimple_switch_num_labels (stmt
) * 2;
3579 tree decl
= gimple_call_fndecl (stmt
);
3580 struct cgraph_node
*node
= NULL
;
3582 /* Do not special case builtins where we see the body.
3583 This just confuse inliner. */
3584 if (!decl
|| !(node
= cgraph_get_node (decl
)) || node
->analyzed
)
3586 /* For buitins that are likely expanded to nothing or
3587 inlined do not account operand costs. */
3588 else if (is_simple_builtin (decl
))
3590 else if (is_inexpensive_builtin (decl
))
3591 return weights
->target_builtin_call_cost
;
3592 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3594 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3595 specialize the cheap expansion we do here.
3596 ??? This asks for a more general solution. */
3597 switch (DECL_FUNCTION_CODE (decl
))
3602 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3603 && REAL_VALUES_EQUAL
3604 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3605 return estimate_operator_cost (MULT_EXPR
, weights
,
3606 gimple_call_arg (stmt
, 0),
3607 gimple_call_arg (stmt
, 0));
3615 cost
= node
? weights
->call_cost
: weights
->indirect_call_cost
;
3616 if (gimple_call_lhs (stmt
))
3617 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3618 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3620 tree arg
= gimple_call_arg (stmt
, i
);
3621 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3627 return weights
->return_cost
;
3633 case GIMPLE_PREDICT
:
3638 return asm_str_count (gimple_asm_string (stmt
));
3641 /* This is either going to be an external function call with one
3642 argument, or two register copy statements plus a goto. */
3645 case GIMPLE_EH_DISPATCH
:
3646 /* ??? This is going to turn into a switch statement. Ideally
3647 we'd have a look at the eh region and estimate the number of
3652 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3654 case GIMPLE_EH_FILTER
:
3655 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3658 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3661 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3662 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3664 /* OpenMP directives are generally very expensive. */
3666 case GIMPLE_OMP_RETURN
:
3667 case GIMPLE_OMP_SECTIONS_SWITCH
:
3668 case GIMPLE_OMP_ATOMIC_STORE
:
3669 case GIMPLE_OMP_CONTINUE
:
3670 /* ...except these, which are cheap. */
3673 case GIMPLE_OMP_ATOMIC_LOAD
:
3674 return weights
->omp_cost
;
3676 case GIMPLE_OMP_FOR
:
3677 return (weights
->omp_cost
3678 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3679 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3681 case GIMPLE_OMP_PARALLEL
:
3682 case GIMPLE_OMP_TASK
:
3683 case GIMPLE_OMP_CRITICAL
:
3684 case GIMPLE_OMP_MASTER
:
3685 case GIMPLE_OMP_ORDERED
:
3686 case GIMPLE_OMP_SECTION
:
3687 case GIMPLE_OMP_SECTIONS
:
3688 case GIMPLE_OMP_SINGLE
:
3689 return (weights
->omp_cost
3690 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3692 case GIMPLE_TRANSACTION
:
3693 return (weights
->tm_cost
3694 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3704 /* Estimate number of instructions that will be created by expanding
3705 function FNDECL. WEIGHTS contains weights attributed to various
3709 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3711 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3712 gimple_stmt_iterator bsi
;
3716 gcc_assert (my_function
&& my_function
->cfg
);
3717 FOR_EACH_BB_FN (bb
, my_function
)
3719 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3720 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3727 /* Initializes weights used by estimate_num_insns. */
3730 init_inline_once (void)
3732 eni_size_weights
.call_cost
= 1;
3733 eni_size_weights
.indirect_call_cost
= 3;
3734 eni_size_weights
.target_builtin_call_cost
= 1;
3735 eni_size_weights
.div_mod_cost
= 1;
3736 eni_size_weights
.omp_cost
= 40;
3737 eni_size_weights
.tm_cost
= 10;
3738 eni_size_weights
.time_based
= false;
3739 eni_size_weights
.return_cost
= 1;
3741 /* Estimating time for call is difficult, since we have no idea what the
3742 called function does. In the current uses of eni_time_weights,
3743 underestimating the cost does less harm than overestimating it, so
3744 we choose a rather small value here. */
3745 eni_time_weights
.call_cost
= 10;
3746 eni_time_weights
.indirect_call_cost
= 15;
3747 eni_time_weights
.target_builtin_call_cost
= 1;
3748 eni_time_weights
.div_mod_cost
= 10;
3749 eni_time_weights
.omp_cost
= 40;
3750 eni_time_weights
.tm_cost
= 40;
3751 eni_time_weights
.time_based
= true;
3752 eni_time_weights
.return_cost
= 2;
3755 /* Estimate the number of instructions in a gimple_seq. */
3758 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3760 gimple_stmt_iterator gsi
;
3762 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3763 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3769 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3772 prepend_lexical_block (tree current_block
, tree new_block
)
3774 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
3775 BLOCK_SUBBLOCKS (current_block
) = new_block
;
3776 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
3779 /* Add local variables from CALLEE to CALLER. */
3782 add_local_variables (struct function
*callee
, struct function
*caller
,
3788 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
3789 if (!can_be_nonlocal (var
, id
))
3791 tree new_var
= remap_decl (var
, id
);
3793 /* Remap debug-expressions. */
3794 if (TREE_CODE (new_var
) == VAR_DECL
3795 && DECL_DEBUG_EXPR_IS_FROM (new_var
)
3798 tree tem
= DECL_DEBUG_EXPR (var
);
3799 bool old_regimplify
= id
->regimplify
;
3800 id
->remapping_type_depth
++;
3801 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
3802 id
->remapping_type_depth
--;
3803 id
->regimplify
= old_regimplify
;
3804 SET_DECL_DEBUG_EXPR (new_var
, tem
);
3806 add_local_decl (caller
, new_var
);
3810 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3813 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
3817 struct pointer_map_t
*st
, *dst
;
3820 location_t saved_location
;
3821 struct cgraph_edge
*cg_edge
;
3822 cgraph_inline_failed_t reason
;
3823 basic_block return_block
;
3825 gimple_stmt_iterator gsi
, stmt_gsi
;
3826 bool successfully_inlined
= FALSE
;
3827 bool purge_dead_abnormal_edges
;
3829 /* Set input_location here so we get the right instantiation context
3830 if we call instantiate_decl from inlinable_function_p. */
3831 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
3832 saved_location
= input_location
;
3833 input_location
= gimple_location (stmt
);
3835 /* From here on, we're only interested in CALL_EXPRs. */
3836 if (gimple_code (stmt
) != GIMPLE_CALL
)
3839 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
3840 gcc_checking_assert (cg_edge
);
3841 /* First, see if we can figure out what function is being called.
3842 If we cannot, then there is no hope of inlining the function. */
3843 if (cg_edge
->indirect_unknown_callee
)
3845 fn
= cg_edge
->callee
->symbol
.decl
;
3846 gcc_checking_assert (fn
);
3848 /* If FN is a declaration of a function in a nested scope that was
3849 globally declared inline, we don't set its DECL_INITIAL.
3850 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3851 C++ front-end uses it for cdtors to refer to their internal
3852 declarations, that are not real functions. Fortunately those
3853 don't have trees to be saved, so we can tell by checking their
3855 if (!DECL_INITIAL (fn
)
3856 && DECL_ABSTRACT_ORIGIN (fn
)
3857 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
3858 fn
= DECL_ABSTRACT_ORIGIN (fn
);
3860 /* Don't try to inline functions that are not well-suited to inlining. */
3861 if (cg_edge
->inline_failed
)
3863 reason
= cg_edge
->inline_failed
;
3864 /* If this call was originally indirect, we do not want to emit any
3865 inlining related warnings or sorry messages because there are no
3866 guarantees regarding those. */
3867 if (cg_edge
->indirect_inlining_edge
)
3870 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
3871 /* Avoid warnings during early inline pass. */
3872 && cgraph_global_info_ready
3873 /* PR 20090218-1_0.c. Body can be provided by another module. */
3874 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
3876 error ("inlining failed in call to always_inline %q+F: %s", fn
,
3877 cgraph_inline_failed_string (reason
));
3878 error ("called from here");
3880 else if (warn_inline
3881 && DECL_DECLARED_INLINE_P (fn
)
3882 && !DECL_NO_INLINE_WARNING_P (fn
)
3883 && !DECL_IN_SYSTEM_HEADER (fn
)
3884 && reason
!= CIF_UNSPECIFIED
3885 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
3886 /* Do not warn about not inlined recursive calls. */
3887 && !cgraph_edge_recursive_p (cg_edge
)
3888 /* Avoid warnings during early inline pass. */
3889 && cgraph_global_info_ready
)
3891 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
3892 fn
, _(cgraph_inline_failed_string (reason
)));
3893 warning (OPT_Winline
, "called from here");
3897 fn
= cg_edge
->callee
->symbol
.decl
;
3899 #ifdef ENABLE_CHECKING
3900 if (cg_edge
->callee
->symbol
.decl
!= id
->dst_node
->symbol
.decl
)
3901 verify_cgraph_node (cg_edge
->callee
);
3904 /* We will be inlining this callee. */
3905 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
3907 /* Update the callers EH personality. */
3908 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
))
3909 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->symbol
.decl
)
3910 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
);
3912 /* Split the block holding the GIMPLE_CALL. */
3913 e
= split_block (bb
, stmt
);
3915 return_block
= e
->dest
;
3918 /* split_block splits after the statement; work around this by
3919 moving the call into the second block manually. Not pretty,
3920 but seems easier than doing the CFG manipulation by hand
3921 when the GIMPLE_CALL is in the last statement of BB. */
3922 stmt_gsi
= gsi_last_bb (bb
);
3923 gsi_remove (&stmt_gsi
, false);
3925 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3926 been the source of abnormal edges. In this case, schedule
3927 the removal of dead abnormal edges. */
3928 gsi
= gsi_start_bb (return_block
);
3929 if (gsi_end_p (gsi
))
3931 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
3932 purge_dead_abnormal_edges
= true;
3936 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
3937 purge_dead_abnormal_edges
= false;
3940 stmt_gsi
= gsi_start_bb (return_block
);
3942 /* Build a block containing code to initialize the arguments, the
3943 actual inline expansion of the body, and a label for the return
3944 statements within the function to jump to. The type of the
3945 statement expression is the return type of the function call. */
3946 id
->block
= make_node (BLOCK
);
3947 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
3948 BLOCK_SOURCE_LOCATION (id
->block
) = input_location
;
3949 prepend_lexical_block (gimple_block (stmt
), id
->block
);
3951 /* Local declarations will be replaced by their equivalents in this
3954 id
->decl_map
= pointer_map_create ();
3955 dst
= id
->debug_map
;
3956 id
->debug_map
= NULL
;
3958 /* Record the function we are about to inline. */
3960 id
->src_node
= cg_edge
->callee
;
3961 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
3962 id
->gimple_call
= stmt
;
3964 gcc_assert (!id
->src_cfun
->after_inlining
);
3967 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
3969 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3970 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
3974 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
3976 if (DECL_INITIAL (fn
))
3977 prepend_lexical_block (id
->block
, remap_blocks (DECL_INITIAL (fn
), id
));
3979 /* Return statements in the function body will be replaced by jumps
3980 to the RET_LABEL. */
3981 gcc_assert (DECL_INITIAL (fn
));
3982 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
3984 /* Find the LHS to which the result of this call is assigned. */
3986 if (gimple_call_lhs (stmt
))
3988 modify_dest
= gimple_call_lhs (stmt
);
3990 /* The function which we are inlining might not return a value,
3991 in which case we should issue a warning that the function
3992 does not return a value. In that case the optimizers will
3993 see that the variable to which the value is assigned was not
3994 initialized. We do not want to issue a warning about that
3995 uninitialized variable. */
3996 if (DECL_P (modify_dest
))
3997 TREE_NO_WARNING (modify_dest
) = 1;
3999 if (gimple_call_return_slot_opt_p (stmt
))
4001 return_slot
= modify_dest
;
4008 /* If we are inlining a call to the C++ operator new, we don't want
4009 to use type based alias analysis on the return value. Otherwise
4010 we may get confused if the compiler sees that the inlined new
4011 function returns a pointer which was just deleted. See bug
4013 if (DECL_IS_OPERATOR_NEW (fn
))
4019 /* Declare the return variable for the function. */
4020 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4022 /* Add local vars in this inlined callee to caller. */
4023 add_local_variables (id
->src_cfun
, cfun
, id
);
4025 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4027 fprintf (dump_file
, "Inlining ");
4028 print_generic_expr (dump_file
, id
->src_fn
, 0);
4029 fprintf (dump_file
, " to ");
4030 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4031 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4034 /* This is it. Duplicate the callee body. Assume callee is
4035 pre-gimplified. Note that we must not alter the caller
4036 function in any way before this point, as this CALL_EXPR may be
4037 a self-referential call; if we're calling ourselves, we need to
4038 duplicate our body before altering anything. */
4039 copy_body (id
, bb
->count
,
4040 cg_edge
->frequency
* REG_BR_PROB_BASE
/ CGRAPH_FREQ_BASE
,
4041 bb
, return_block
, NULL
, NULL
);
4043 /* Reset the escaped solution. */
4044 if (cfun
->gimple_df
)
4045 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4050 pointer_map_destroy (id
->debug_map
);
4051 id
->debug_map
= dst
;
4053 pointer_map_destroy (id
->decl_map
);
4056 /* Unlink the calls virtual operands before replacing it. */
4057 unlink_stmt_vdef (stmt
);
4059 /* If the inlined function returns a result that we care about,
4060 substitute the GIMPLE_CALL with an assignment of the return
4061 variable to the LHS of the call. That is, if STMT was
4062 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4063 if (use_retvar
&& gimple_call_lhs (stmt
))
4065 gimple old_stmt
= stmt
;
4066 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4067 gsi_replace (&stmt_gsi
, stmt
, false);
4068 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4072 /* Handle the case of inlining a function with no return
4073 statement, which causes the return value to become undefined. */
4074 if (gimple_call_lhs (stmt
)
4075 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4077 tree name
= gimple_call_lhs (stmt
);
4078 tree var
= SSA_NAME_VAR (name
);
4079 tree def
= gimple_default_def (cfun
, var
);
4083 /* If the variable is used undefined, make this name
4084 undefined via a move. */
4085 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4086 gsi_replace (&stmt_gsi
, stmt
, true);
4090 /* Otherwise make this variable undefined. */
4091 gsi_remove (&stmt_gsi
, true);
4092 set_default_def (var
, name
);
4093 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4097 gsi_remove (&stmt_gsi
, true);
4100 if (purge_dead_abnormal_edges
)
4102 gimple_purge_dead_eh_edges (return_block
);
4103 gimple_purge_dead_abnormal_call_edges (return_block
);
4106 /* If the value of the new expression is ignored, that's OK. We
4107 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4108 the equivalent inlined version either. */
4109 if (is_gimple_assign (stmt
))
4111 gcc_assert (gimple_assign_single_p (stmt
)
4112 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4113 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4116 /* Output the inlining info for this abstract function, since it has been
4117 inlined. If we don't do this now, we can lose the information about the
4118 variables in the function when the blocks get blown away as soon as we
4119 remove the cgraph node. */
4120 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->symbol
.decl
);
4122 /* Update callgraph if needed. */
4123 cgraph_remove_node (cg_edge
->callee
);
4125 id
->block
= NULL_TREE
;
4126 successfully_inlined
= TRUE
;
4129 input_location
= saved_location
;
4130 return successfully_inlined
;
4133 /* Expand call statements reachable from STMT_P.
4134 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4135 in a MODIFY_EXPR. */
4138 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4140 gimple_stmt_iterator gsi
;
4142 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4144 gimple stmt
= gsi_stmt (gsi
);
4146 if (is_gimple_call (stmt
)
4147 && expand_call_inline (bb
, stmt
, id
))
4155 /* Walk all basic blocks created after FIRST and try to fold every statement
4156 in the STATEMENTS pointer set. */
4159 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4161 for (; first
< n_basic_blocks
; first
++)
4162 if (BASIC_BLOCK (first
))
4164 gimple_stmt_iterator gsi
;
4166 for (gsi
= gsi_start_bb (BASIC_BLOCK (first
));
4169 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4171 gimple old_stmt
= gsi_stmt (gsi
);
4172 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4174 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4176 /* Folding builtins can create multiple instructions,
4177 we need to look at all of them. */
4178 gimple_stmt_iterator i2
= gsi
;
4180 if (fold_stmt (&gsi
))
4183 /* If a builtin at the end of a bb folded into nothing,
4184 the following loop won't work. */
4185 if (gsi_end_p (gsi
))
4187 cgraph_update_edges_for_call_stmt (old_stmt
,
4192 i2
= gsi_start_bb (BASIC_BLOCK (first
));
4197 new_stmt
= gsi_stmt (i2
);
4198 update_stmt (new_stmt
);
4199 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4202 if (new_stmt
== gsi_stmt (gsi
))
4204 /* It is okay to check only for the very last
4205 of these statements. If it is a throwing
4206 statement nothing will change. If it isn't
4207 this can remove EH edges. If that weren't
4208 correct then because some intermediate stmts
4209 throw, but not the last one. That would mean
4210 we'd have to split the block, which we can't
4211 here and we'd loose anyway. And as builtins
4212 probably never throw, this all
4214 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4216 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4223 else if (fold_stmt (&gsi
))
4225 /* Re-read the statement from GSI as fold_stmt() may
4227 gimple new_stmt
= gsi_stmt (gsi
);
4228 update_stmt (new_stmt
);
4230 if (is_gimple_call (old_stmt
)
4231 || is_gimple_call (new_stmt
))
4232 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4235 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4236 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4242 /* Return true if BB has at least one abnormal outgoing edge. */
4245 has_abnormal_outgoing_edge_p (basic_block bb
)
4250 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4251 if (e
->flags
& EDGE_ABNORMAL
)
4257 /* Expand calls to inline functions in the body of FN. */
4260 optimize_inline_calls (tree fn
)
4264 int last
= n_basic_blocks
;
4265 struct gimplify_ctx gctx
;
4266 bool inlined_p
= false;
4269 memset (&id
, 0, sizeof (id
));
4271 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4272 gcc_assert (id
.dst_node
->analyzed
);
4274 /* Or any functions that aren't finished yet. */
4275 if (current_function_decl
)
4276 id
.dst_fn
= current_function_decl
;
4278 id
.copy_decl
= copy_decl_maybe_to_var
;
4279 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4280 id
.transform_new_cfg
= false;
4281 id
.transform_return_to_modify
= true;
4282 id
.transform_lang_insert_block
= NULL
;
4283 id
.statements_to_fold
= pointer_set_create ();
4285 push_gimplify_context (&gctx
);
4287 /* We make no attempts to keep dominance info up-to-date. */
4288 free_dominance_info (CDI_DOMINATORS
);
4289 free_dominance_info (CDI_POST_DOMINATORS
);
4291 /* Register specific gimple functions. */
4292 gimple_register_cfg_hooks ();
4294 /* Reach the trees by walking over the CFG, and note the
4295 enclosing basic-blocks in the call edges. */
4296 /* We walk the blocks going forward, because inlined function bodies
4297 will split id->current_basic_block, and the new blocks will
4298 follow it; we'll trudge through them, processing their CALL_EXPRs
4301 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4303 pop_gimplify_context (NULL
);
4305 #ifdef ENABLE_CHECKING
4307 struct cgraph_edge
*e
;
4309 verify_cgraph_node (id
.dst_node
);
4311 /* Double check that we inlined everything we are supposed to inline. */
4312 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4313 gcc_assert (e
->inline_failed
);
4317 /* Fold queued statements. */
4318 fold_marked_statements (last
, id
.statements_to_fold
);
4319 pointer_set_destroy (id
.statements_to_fold
);
4321 gcc_assert (!id
.debug_stmts
);
4323 /* If we didn't inline into the function there is nothing to do. */
4327 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4330 delete_unreachable_blocks_update_callgraph (&id
);
4331 #ifdef ENABLE_CHECKING
4332 verify_cgraph_node (id
.dst_node
);
4335 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4336 not possible yet - the IPA passes might make various functions to not
4337 throw and they don't care to proactively update local EH info. This is
4338 done later in fixup_cfg pass that also execute the verification. */
4339 return (TODO_update_ssa
4341 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4342 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4343 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
4346 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4349 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4351 enum tree_code code
= TREE_CODE (*tp
);
4352 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4354 /* We make copies of most nodes. */
4355 if (IS_EXPR_CODE_CLASS (cl
)
4356 || code
== TREE_LIST
4358 || code
== TYPE_DECL
4359 || code
== OMP_CLAUSE
)
4361 /* Because the chain gets clobbered when we make a copy, we save it
4363 tree chain
= NULL_TREE
, new_tree
;
4365 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4366 chain
= TREE_CHAIN (*tp
);
4368 /* Copy the node. */
4369 new_tree
= copy_node (*tp
);
4371 /* Propagate mudflap marked-ness. */
4372 if (flag_mudflap
&& mf_marked_p (*tp
))
4377 /* Now, restore the chain, if appropriate. That will cause
4378 walk_tree to walk into the chain as well. */
4379 if (code
== PARM_DECL
4380 || code
== TREE_LIST
4381 || code
== OMP_CLAUSE
)
4382 TREE_CHAIN (*tp
) = chain
;
4384 /* For now, we don't update BLOCKs when we make copies. So, we
4385 have to nullify all BIND_EXPRs. */
4386 if (TREE_CODE (*tp
) == BIND_EXPR
)
4387 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4389 else if (code
== CONSTRUCTOR
)
4391 /* CONSTRUCTOR nodes need special handling because
4392 we need to duplicate the vector of elements. */
4395 new_tree
= copy_node (*tp
);
4397 /* Propagate mudflap marked-ness. */
4398 if (flag_mudflap
&& mf_marked_p (*tp
))
4401 CONSTRUCTOR_ELTS (new_tree
) = VEC_copy (constructor_elt
, gc
,
4402 CONSTRUCTOR_ELTS (*tp
));
4405 else if (code
== STATEMENT_LIST
)
4406 /* We used to just abort on STATEMENT_LIST, but we can run into them
4407 with statement-expressions (c++/40975). */
4408 copy_statement_list (tp
);
4409 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4411 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4413 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4418 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4419 information indicating to what new SAVE_EXPR this one should be mapped,
4420 use that one. Otherwise, create a new node and enter it in ST. FN is
4421 the function into which the copy will be placed. */
4424 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4426 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4430 /* See if we already encountered this SAVE_EXPR. */
4431 n
= (tree
*) pointer_map_contains (st
, *tp
);
4433 /* If we didn't already remap this SAVE_EXPR, do so now. */
4436 t
= copy_node (*tp
);
4438 /* Remember this SAVE_EXPR. */
4439 *pointer_map_insert (st
, *tp
) = t
;
4440 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4441 *pointer_map_insert (st
, t
) = t
;
4445 /* We've already walked into this SAVE_EXPR; don't do it again. */
4450 /* Replace this SAVE_EXPR with the copy. */
4454 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4455 copies the declaration and enters it in the splay_tree in DATA (which is
4456 really an `copy_body_data *'). */
4459 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
4462 copy_body_data
*id
= (copy_body_data
*) data
;
4464 /* Don't walk into types. */
4468 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
4470 tree decl
= TREE_OPERAND (*tp
, 0);
4472 /* Copy the decl and remember the copy. */
4473 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4479 /* Perform any modifications to EXPR required when it is unsaved. Does
4480 not recurse into EXPR's subtrees. */
4483 unsave_expr_1 (tree expr
)
4485 switch (TREE_CODE (expr
))
4488 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4489 It's OK for this to happen if it was part of a subtree that
4490 isn't immediately expanded, such as operand 2 of another
4492 if (TREE_OPERAND (expr
, 1))
4495 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4496 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4504 /* Called via walk_tree when an expression is unsaved. Using the
4505 splay_tree pointed to by ST (which is really a `splay_tree'),
4506 remaps all local declarations to appropriate replacements. */
4509 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
4511 copy_body_data
*id
= (copy_body_data
*) data
;
4512 struct pointer_map_t
*st
= id
->decl_map
;
4515 /* Only a local declaration (variable or label). */
4516 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
4517 || TREE_CODE (*tp
) == LABEL_DECL
)
4519 /* Lookup the declaration. */
4520 n
= (tree
*) pointer_map_contains (st
, *tp
);
4522 /* If it's there, remap it. */
4527 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
4529 else if (TREE_CODE (*tp
) == BIND_EXPR
)
4530 copy_bind_expr (tp
, walk_subtrees
, id
);
4531 else if (TREE_CODE (*tp
) == SAVE_EXPR
4532 || TREE_CODE (*tp
) == TARGET_EXPR
)
4533 remap_save_expr (tp
, st
, walk_subtrees
);
4536 copy_tree_r (tp
, walk_subtrees
, NULL
);
4538 /* Do whatever unsaving is required. */
4539 unsave_expr_1 (*tp
);
4542 /* Keep iterating. */
4546 /* Copies everything in EXPR and replaces variables, labels
4547 and SAVE_EXPRs local to EXPR. */
4550 unsave_expr_now (tree expr
)
4554 /* There's nothing to do for NULL_TREE. */
4559 memset (&id
, 0, sizeof (id
));
4560 id
.src_fn
= current_function_decl
;
4561 id
.dst_fn
= current_function_decl
;
4562 id
.decl_map
= pointer_map_create ();
4563 id
.debug_map
= NULL
;
4565 id
.copy_decl
= copy_decl_no_change
;
4566 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4567 id
.transform_new_cfg
= false;
4568 id
.transform_return_to_modify
= false;
4569 id
.transform_lang_insert_block
= NULL
;
4571 /* Walk the tree once to find local labels. */
4572 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
4574 /* Walk the tree again, copying, remapping, and unsaving. */
4575 walk_tree (&expr
, unsave_r
, &id
, NULL
);
4578 pointer_map_destroy (id
.decl_map
);
4580 pointer_map_destroy (id
.debug_map
);
4585 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4586 label, copies the declaration and enters it in the splay_tree in DATA (which
4587 is really a 'copy_body_data *'. */
4590 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4591 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4592 struct walk_stmt_info
*wi
)
4594 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4595 gimple stmt
= gsi_stmt (*gsip
);
4597 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4599 tree decl
= gimple_label_label (stmt
);
4601 /* Copy the decl and remember the copy. */
4602 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4609 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4610 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4611 remaps all local declarations to appropriate replacements in gimple
4615 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4617 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4618 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4619 struct pointer_map_t
*st
= id
->decl_map
;
4623 /* Only a local declaration (variable or label). */
4624 if ((TREE_CODE (expr
) == VAR_DECL
4625 && !TREE_STATIC (expr
))
4626 || TREE_CODE (expr
) == LABEL_DECL
)
4628 /* Lookup the declaration. */
4629 n
= (tree
*) pointer_map_contains (st
, expr
);
4631 /* If it's there, remap it. */
4636 else if (TREE_CODE (expr
) == STATEMENT_LIST
4637 || TREE_CODE (expr
) == BIND_EXPR
4638 || TREE_CODE (expr
) == SAVE_EXPR
)
4640 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4642 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4643 It's OK for this to happen if it was part of a subtree that
4644 isn't immediately expanded, such as operand 2 of another
4646 if (!TREE_OPERAND (expr
, 1))
4648 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4649 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4653 /* Keep iterating. */
4658 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4659 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4660 remaps all local declarations to appropriate replacements in gimple
4664 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4665 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4666 struct walk_stmt_info
*wi
)
4668 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4669 gimple stmt
= gsi_stmt (*gsip
);
4671 if (gimple_code (stmt
) == GIMPLE_BIND
)
4673 tree block
= gimple_bind_block (stmt
);
4677 remap_block (&block
, id
);
4678 gimple_bind_set_block (stmt
, block
);
4681 /* This will remap a lot of the same decls again, but this should be
4683 if (gimple_bind_vars (stmt
))
4684 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
), NULL
, id
));
4687 /* Keep iterating. */
4692 /* Copies everything in SEQ and replaces variables and labels local to
4693 current_function_decl. */
4696 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4699 struct walk_stmt_info wi
;
4700 struct pointer_set_t
*visited
;
4703 /* There's nothing to do for NULL_TREE. */
4708 memset (&id
, 0, sizeof (id
));
4709 id
.src_fn
= current_function_decl
;
4710 id
.dst_fn
= current_function_decl
;
4711 id
.decl_map
= pointer_map_create ();
4712 id
.debug_map
= NULL
;
4714 id
.copy_decl
= copy_decl_no_change
;
4715 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4716 id
.transform_new_cfg
= false;
4717 id
.transform_return_to_modify
= false;
4718 id
.transform_lang_insert_block
= NULL
;
4720 /* Walk the tree once to find local labels. */
4721 memset (&wi
, 0, sizeof (wi
));
4722 visited
= pointer_set_create ();
4725 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4726 pointer_set_destroy (visited
);
4728 copy
= gimple_seq_copy (seq
);
4730 /* Walk the copy, remapping decls. */
4731 memset (&wi
, 0, sizeof (wi
));
4733 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4736 pointer_map_destroy (id
.decl_map
);
4738 pointer_map_destroy (id
.debug_map
);
4744 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4747 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4756 debug_find_tree (tree top
, tree search
)
4758 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4762 /* Declare the variables created by the inliner. Add all the variables in
4763 VARS to BIND_EXPR. */
4766 declare_inline_vars (tree block
, tree vars
)
4769 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4771 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4772 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4773 add_local_decl (cfun
, t
);
4777 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4780 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4781 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4782 VAR_DECL translation. */
4785 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4787 /* Don't generate debug information for the copy if we wouldn't have
4788 generated it for the copy either. */
4789 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4790 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4792 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4793 declaration inspired this copy. */
4794 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4796 /* The new variable/label has no RTL, yet. */
4797 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4798 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4799 SET_DECL_RTL (copy
, 0);
4801 /* These args would always appear unused, if not for this. */
4802 TREE_USED (copy
) = 1;
4804 /* Set the context for the new declaration. */
4805 if (!DECL_CONTEXT (decl
))
4806 /* Globals stay global. */
4808 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4809 /* Things that weren't in the scope of the function we're inlining
4810 from aren't in the scope we're inlining to, either. */
4812 else if (TREE_STATIC (decl
))
4813 /* Function-scoped static variables should stay in the original
4817 /* Ordinary automatic local variables are now in the scope of the
4819 DECL_CONTEXT (copy
) = id
->dst_fn
;
4821 if (TREE_CODE (decl
) == VAR_DECL
4822 /* C++ clones functions during parsing, before
4824 && gimple_referenced_vars (DECL_STRUCT_FUNCTION (id
->src_fn
))
4825 && referenced_var_lookup (DECL_STRUCT_FUNCTION (id
->src_fn
),
4827 add_referenced_var (copy
);
4833 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4837 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4838 || TREE_CODE (decl
) == RESULT_DECL
);
4840 type
= TREE_TYPE (decl
);
4842 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4843 VAR_DECL
, DECL_NAME (decl
), type
);
4844 if (DECL_PT_UID_SET_P (decl
))
4845 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4846 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4847 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4848 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4849 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4851 return copy_decl_for_dup_finish (id
, decl
, copy
);
4854 /* Like copy_decl_to_var, but create a return slot object instead of a
4855 pointer variable for return by invisible reference. */
4858 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4862 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4863 || TREE_CODE (decl
) == RESULT_DECL
);
4865 type
= TREE_TYPE (decl
);
4866 if (DECL_BY_REFERENCE (decl
))
4867 type
= TREE_TYPE (type
);
4869 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4870 VAR_DECL
, DECL_NAME (decl
), type
);
4871 if (DECL_PT_UID_SET_P (decl
))
4872 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4873 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4874 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4875 if (!DECL_BY_REFERENCE (decl
))
4877 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4878 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4881 return copy_decl_for_dup_finish (id
, decl
, copy
);
4885 copy_decl_no_change (tree decl
, copy_body_data
*id
)
4889 copy
= copy_node (decl
);
4891 /* The COPY is not abstract; it will be generated in DST_FN. */
4892 DECL_ABSTRACT (copy
) = 0;
4893 lang_hooks
.dup_lang_specific_decl (copy
);
4895 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4896 been taken; it's for internal bookkeeping in expand_goto_internal. */
4897 if (TREE_CODE (copy
) == LABEL_DECL
)
4899 TREE_ADDRESSABLE (copy
) = 0;
4900 LABEL_DECL_UID (copy
) = -1;
4903 return copy_decl_for_dup_finish (id
, decl
, copy
);
4907 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
4909 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
4910 return copy_decl_to_var (decl
, id
);
4912 return copy_decl_no_change (decl
, id
);
4915 /* Return a copy of the function's argument tree. */
4917 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
4918 bitmap args_to_skip
, tree
*vars
)
4921 tree new_parm
= NULL
;
4926 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
4927 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
4929 tree new_tree
= remap_decl (arg
, id
);
4930 if (TREE_CODE (new_tree
) != PARM_DECL
)
4931 new_tree
= id
->copy_decl (arg
, id
);
4932 lang_hooks
.dup_lang_specific_decl (new_tree
);
4934 parg
= &DECL_CHAIN (new_tree
);
4936 else if (!pointer_map_contains (id
->decl_map
, arg
))
4938 /* Make an equivalent VAR_DECL. If the argument was used
4939 as temporary variable later in function, the uses will be
4940 replaced by local variable. */
4941 tree var
= copy_decl_to_var (arg
, id
);
4942 add_referenced_var (var
);
4943 insert_decl_map (id
, arg
, var
);
4944 /* Declare this new variable. */
4945 DECL_CHAIN (var
) = *vars
;
4951 /* Return a copy of the function's static chain. */
4953 copy_static_chain (tree static_chain
, copy_body_data
* id
)
4955 tree
*chain_copy
, *pvar
;
4957 chain_copy
= &static_chain
;
4958 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
4960 tree new_tree
= remap_decl (*pvar
, id
);
4961 lang_hooks
.dup_lang_specific_decl (new_tree
);
4962 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
4965 return static_chain
;
4968 /* Return true if the function is allowed to be versioned.
4969 This is a guard for the versioning functionality. */
4972 tree_versionable_function_p (tree fndecl
)
4974 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
4975 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
4978 /* Delete all unreachable basic blocks and update callgraph.
4979 Doing so is somewhat nontrivial because we need to update all clones and
4980 remove inline function that become unreachable. */
4983 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
4985 bool changed
= false;
4986 basic_block b
, next_bb
;
4988 find_unreachable_blocks ();
4990 /* Delete all unreachable basic blocks. */
4992 for (b
= ENTRY_BLOCK_PTR
->next_bb
; b
!= EXIT_BLOCK_PTR
; b
= next_bb
)
4994 next_bb
= b
->next_bb
;
4996 if (!(b
->flags
& BB_REACHABLE
))
4998 gimple_stmt_iterator bsi
;
5000 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5001 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
)
5003 struct cgraph_edge
*e
;
5004 struct cgraph_node
*node
;
5006 if ((e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
5008 if (!e
->inline_failed
)
5009 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5011 cgraph_remove_edge (e
);
5013 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5014 && id
->dst_node
->clones
)
5015 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5017 if ((e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
5019 if (!e
->inline_failed
)
5020 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5022 cgraph_remove_edge (e
);
5026 node
= node
->clones
;
5027 else if (node
->next_sibling_clone
)
5028 node
= node
->next_sibling_clone
;
5031 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5032 node
= node
->clone_of
;
5033 if (node
!= id
->dst_node
)
5034 node
= node
->next_sibling_clone
;
5038 delete_basic_block (b
);
5046 /* Update clone info after duplication. */
5049 update_clone_info (copy_body_data
* id
)
5051 struct cgraph_node
*node
;
5052 if (!id
->dst_node
->clones
)
5054 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5056 /* First update replace maps to match the new body. */
5057 if (node
->clone
.tree_map
)
5060 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, node
->clone
.tree_map
); i
++)
5062 struct ipa_replace_map
*replace_info
;
5063 replace_info
= VEC_index (ipa_replace_map_p
, node
->clone
.tree_map
, i
);
5064 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5065 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5069 node
= node
->clones
;
5070 else if (node
->next_sibling_clone
)
5071 node
= node
->next_sibling_clone
;
5074 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5075 node
= node
->clone_of
;
5076 if (node
!= id
->dst_node
)
5077 node
= node
->next_sibling_clone
;
5082 /* Create a copy of a function's tree.
5083 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5084 of the original function and the new copied function
5085 respectively. In case we want to replace a DECL
5086 tree with another tree while duplicating the function's
5087 body, TREE_MAP represents the mapping between these
5088 trees. If UPDATE_CLONES is set, the call_stmt fields
5089 of edges of clones of the function will be updated.
5091 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5093 If SKIP_RETURN is true, the new version will return void.
5094 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5095 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5098 tree_function_versioning (tree old_decl
, tree new_decl
,
5099 VEC(ipa_replace_map_p
,gc
)* tree_map
,
5100 bool update_clones
, bitmap args_to_skip
,
5101 bool skip_return
, bitmap blocks_to_copy
,
5102 basic_block new_entry
)
5104 struct cgraph_node
*old_version_node
;
5105 struct cgraph_node
*new_version_node
;
5109 struct ipa_replace_map
*replace_info
;
5110 basic_block old_entry_block
, bb
;
5111 VEC (gimple
, heap
) *init_stmts
= VEC_alloc (gimple
, heap
, 10);
5113 tree old_current_function_decl
= current_function_decl
;
5114 tree vars
= NULL_TREE
;
5116 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5117 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5118 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5120 old_version_node
= cgraph_get_node (old_decl
);
5121 gcc_checking_assert (old_version_node
);
5122 new_version_node
= cgraph_get_node (new_decl
);
5123 gcc_checking_assert (new_version_node
);
5125 /* Copy over debug args. */
5126 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5128 VEC(tree
, gc
) **new_debug_args
, **old_debug_args
;
5129 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5130 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5131 old_debug_args
= decl_debug_args_lookup (old_decl
);
5134 new_debug_args
= decl_debug_args_insert (new_decl
);
5135 *new_debug_args
= VEC_copy (tree
, gc
, *old_debug_args
);
5139 /* Output the inlining info for this abstract function, since it has been
5140 inlined. If we don't do this now, we can lose the information about the
5141 variables in the function when the blocks get blown away as soon as we
5142 remove the cgraph node. */
5143 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5145 DECL_ARTIFICIAL (new_decl
) = 1;
5146 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5147 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5149 /* Prepare the data structures for the tree copy. */
5150 memset (&id
, 0, sizeof (id
));
5152 /* Generate a new name for the new version. */
5153 id
.statements_to_fold
= pointer_set_create ();
5155 id
.decl_map
= pointer_map_create ();
5156 id
.debug_map
= NULL
;
5157 id
.src_fn
= old_decl
;
5158 id
.dst_fn
= new_decl
;
5159 id
.src_node
= old_version_node
;
5160 id
.dst_node
= new_version_node
;
5161 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5162 if (id
.src_node
->ipa_transforms_to_apply
)
5164 VEC(ipa_opt_pass
,heap
) * old_transforms_to_apply
= id
.dst_node
->ipa_transforms_to_apply
;
5167 id
.dst_node
->ipa_transforms_to_apply
= VEC_copy (ipa_opt_pass
, heap
,
5168 id
.src_node
->ipa_transforms_to_apply
);
5169 for (i
= 0; i
< VEC_length (ipa_opt_pass
, old_transforms_to_apply
); i
++)
5170 VEC_safe_push (ipa_opt_pass
, heap
, id
.dst_node
->ipa_transforms_to_apply
,
5171 VEC_index (ipa_opt_pass
,
5172 old_transforms_to_apply
,
5176 id
.copy_decl
= copy_decl_no_change
;
5177 id
.transform_call_graph_edges
5178 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5179 id
.transform_new_cfg
= true;
5180 id
.transform_return_to_modify
= false;
5181 id
.transform_lang_insert_block
= NULL
;
5183 current_function_decl
= new_decl
;
5184 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION
5185 (DECL_STRUCT_FUNCTION (old_decl
));
5186 initialize_cfun (new_decl
, old_decl
,
5187 old_entry_block
->count
);
5188 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5189 = id
.src_cfun
->gimple_df
->ipa_pta
;
5190 push_cfun (DECL_STRUCT_FUNCTION (new_decl
));
5192 /* Copy the function's static chain. */
5193 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5195 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5196 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5199 /* If there's a tree_map, prepare for substitution. */
5201 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, tree_map
); i
++)
5204 replace_info
= VEC_index (ipa_replace_map_p
, tree_map
, i
);
5205 if (replace_info
->replace_p
)
5207 tree op
= replace_info
->new_tree
;
5208 if (!replace_info
->old_tree
)
5210 int i
= replace_info
->parm_num
;
5212 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5214 replace_info
->old_tree
= parm
;
5220 if (TREE_CODE (op
) == VIEW_CONVERT_EXPR
)
5221 op
= TREE_OPERAND (op
, 0);
5223 if (TREE_CODE (op
) == ADDR_EXPR
)
5225 op
= get_base_address (TREE_OPERAND (op
, 0));
5226 if (op
&& TREE_CODE (op
) == VAR_DECL
&& !is_global_var (op
))
5227 add_referenced_var (op
);
5229 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5230 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5231 replace_info
->new_tree
, id
.src_fn
,
5235 VEC_safe_push (gimple
, heap
, init_stmts
, init
);
5238 /* Copy the function's arguments. */
5239 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5240 DECL_ARGUMENTS (new_decl
) =
5241 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5242 args_to_skip
, &vars
);
5244 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5245 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5247 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5249 if (!VEC_empty (tree
, DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5250 /* Add local vars. */
5251 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5253 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5255 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5257 DECL_RESULT (new_decl
)
5258 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5259 RESULT_DECL
, NULL_TREE
, void_type_node
);
5260 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5261 cfun
->returns_struct
= 0;
5262 cfun
->returns_pcc_struct
= 0;
5267 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5268 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5269 if (gimple_in_ssa_p (id
.src_cfun
)
5270 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5272 = gimple_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5274 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5275 insert_decl_map (&id
, old_name
, new_name
);
5276 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5277 set_default_def (DECL_RESULT (new_decl
), new_name
);
5281 /* Copy the Function's body. */
5282 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5283 ENTRY_BLOCK_PTR
, EXIT_BLOCK_PTR
, blocks_to_copy
, new_entry
);
5285 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5286 number_blocks (new_decl
);
5288 /* We want to create the BB unconditionally, so that the addition of
5289 debug stmts doesn't affect BB count, which may in the end cause
5290 codegen differences. */
5291 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR
));
5292 while (VEC_length (gimple
, init_stmts
))
5293 insert_init_stmt (&id
, bb
, VEC_pop (gimple
, init_stmts
));
5294 update_clone_info (&id
);
5296 /* Remap the nonlocal_goto_save_area, if any. */
5297 if (cfun
->nonlocal_goto_save_area
)
5299 struct walk_stmt_info wi
;
5301 memset (&wi
, 0, sizeof (wi
));
5303 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5307 pointer_map_destroy (id
.decl_map
);
5309 pointer_map_destroy (id
.debug_map
);
5310 free_dominance_info (CDI_DOMINATORS
);
5311 free_dominance_info (CDI_POST_DOMINATORS
);
5313 fold_marked_statements (0, id
.statements_to_fold
);
5314 pointer_set_destroy (id
.statements_to_fold
);
5315 fold_cond_expr_cond ();
5316 delete_unreachable_blocks_update_callgraph (&id
);
5317 if (id
.dst_node
->analyzed
)
5318 cgraph_rebuild_references ();
5319 update_ssa (TODO_update_ssa
);
5321 /* After partial cloning we need to rescale frequencies, so they are
5322 within proper range in the cloned function. */
5325 struct cgraph_edge
*e
;
5326 rebuild_frequencies ();
5328 new_version_node
->count
= ENTRY_BLOCK_PTR
->count
;
5329 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5331 basic_block bb
= gimple_bb (e
->call_stmt
);
5332 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5334 e
->count
= bb
->count
;
5336 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5338 basic_block bb
= gimple_bb (e
->call_stmt
);
5339 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5341 e
->count
= bb
->count
;
5345 free_dominance_info (CDI_DOMINATORS
);
5346 free_dominance_info (CDI_POST_DOMINATORS
);
5348 gcc_assert (!id
.debug_stmts
);
5349 VEC_free (gimple
, heap
, init_stmts
);
5351 current_function_decl
= old_current_function_decl
;
5352 gcc_assert (!current_function_decl
5353 || DECL_STRUCT_FUNCTION (current_function_decl
) == cfun
);
5357 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5358 the callee and return the inlined body on success. */
5361 maybe_inline_call_in_expr (tree exp
)
5363 tree fn
= get_callee_fndecl (exp
);
5365 /* We can only try to inline "const" functions. */
5366 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5368 struct pointer_map_t
*decl_map
= pointer_map_create ();
5369 call_expr_arg_iterator iter
;
5373 /* Remap the parameters. */
5374 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5376 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5377 *pointer_map_insert (decl_map
, param
) = arg
;
5379 memset (&id
, 0, sizeof (id
));
5381 id
.dst_fn
= current_function_decl
;
5382 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5383 id
.decl_map
= decl_map
;
5385 id
.copy_decl
= copy_decl_no_change
;
5386 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5387 id
.transform_new_cfg
= false;
5388 id
.transform_return_to_modify
= true;
5389 id
.transform_lang_insert_block
= NULL
;
5391 /* Make sure not to unshare trees behind the front-end's back
5392 since front-end specific mechanisms may rely on sharing. */
5393 id
.regimplify
= false;
5394 id
.do_not_unshare
= true;
5396 /* We're not inside any EH region. */
5399 t
= copy_tree_body (&id
);
5400 pointer_map_destroy (decl_map
);
5402 /* We can only return something suitable for use in a GENERIC
5404 if (TREE_CODE (t
) == MODIFY_EXPR
)
5405 return TREE_OPERAND (t
, 1);
5411 /* Duplicate a type, fields and all. */
5414 build_duplicate_type (tree type
)
5416 struct copy_body_data id
;
5418 memset (&id
, 0, sizeof (id
));
5419 id
.src_fn
= current_function_decl
;
5420 id
.dst_fn
= current_function_decl
;
5422 id
.decl_map
= pointer_map_create ();
5423 id
.debug_map
= NULL
;
5424 id
.copy_decl
= copy_decl_no_change
;
5426 type
= remap_type_1 (type
, &id
);
5428 pointer_map_destroy (id
.decl_map
);
5430 pointer_map_destroy (id
.debug_map
);
5432 TYPE_CANONICAL (type
) = type
;