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
;
2113 cfun
->after_tree_profile
= src_cfun
->after_tree_profile
;
2115 init_empty_tree_cfg ();
2117 profile_status_for_function (cfun
) = profile_status_for_function (src_cfun
);
2118 ENTRY_BLOCK_PTR
->count
=
2119 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2121 ENTRY_BLOCK_PTR
->frequency
2122 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2123 EXIT_BLOCK_PTR
->count
=
2124 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2126 EXIT_BLOCK_PTR
->frequency
=
2127 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2129 init_eh_for_function ();
2131 if (src_cfun
->gimple_df
)
2133 init_tree_ssa (cfun
);
2134 cfun
->gimple_df
->in_ssa_p
= true;
2135 init_ssa_operands (cfun
);
2140 /* Helper function for copy_cfg_body. Move debug stmts from the end
2141 of NEW_BB to the beginning of successor basic blocks when needed. If the
2142 successor has multiple predecessors, reset them, otherwise keep
2146 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2150 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2153 || gsi_one_before_end_p (si
)
2154 || !(stmt_can_throw_internal (gsi_stmt (si
))
2155 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2158 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2160 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2161 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2162 while (is_gimple_debug (gsi_stmt (ssi
)))
2164 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2168 /* For the last edge move the debug stmts instead of copying
2170 if (ei_one_before_end_p (ei
))
2174 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2175 gimple_debug_bind_reset_value (stmt
);
2176 gsi_remove (&si
, false);
2177 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2181 if (gimple_debug_bind_p (stmt
))
2183 var
= gimple_debug_bind_get_var (stmt
);
2184 if (single_pred_p (e
->dest
))
2186 value
= gimple_debug_bind_get_value (stmt
);
2187 value
= unshare_expr (value
);
2191 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2193 else if (gimple_debug_source_bind_p (stmt
))
2195 var
= gimple_debug_source_bind_get_var (stmt
);
2196 value
= gimple_debug_source_bind_get_value (stmt
);
2197 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2201 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2202 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, new_stmt
);
2208 /* Make a copy of the body of FN so that it can be inserted inline in
2209 another function. Walks FN via CFG, returns new fndecl. */
2212 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2213 basic_block entry_block_map
, basic_block exit_block_map
,
2214 bitmap blocks_to_copy
, basic_block new_entry
)
2216 tree callee_fndecl
= id
->src_fn
;
2217 /* Original cfun for the callee, doesn't change. */
2218 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2219 struct function
*cfun_to_copy
;
2221 tree new_fndecl
= NULL
;
2222 bool need_debug_cleanup
= false;
2223 gcov_type count_scale
;
2225 int incoming_frequency
= 0;
2226 gcov_type incoming_count
= 0;
2228 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2229 count_scale
= (REG_BR_PROB_BASE
* count
2230 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2232 count_scale
= REG_BR_PROB_BASE
;
2234 /* Register specific tree functions. */
2235 gimple_register_cfg_hooks ();
2237 /* If we are inlining just region of the function, make sure to connect new entry
2238 to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute
2239 frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and
2240 probabilities of edges incoming from nonduplicated region. */
2246 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2249 incoming_frequency
+= EDGE_FREQUENCY (e
);
2250 incoming_count
+= e
->count
;
2252 incoming_count
= incoming_count
* count_scale
/ REG_BR_PROB_BASE
;
2254 = incoming_frequency
* frequency_scale
/ REG_BR_PROB_BASE
;
2255 ENTRY_BLOCK_PTR
->count
= incoming_count
;
2256 ENTRY_BLOCK_PTR
->frequency
= incoming_frequency
;
2259 /* Must have a CFG here at this point. */
2260 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2261 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2263 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2265 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= entry_block_map
;
2266 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= exit_block_map
;
2267 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2268 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2270 /* Duplicate any exception-handling regions. */
2272 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2275 /* Use aux pointers to map the original blocks to copy. */
2276 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2277 if (!blocks_to_copy
|| bitmap_bit_p (blocks_to_copy
, bb
->index
))
2279 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2284 last
= last_basic_block
;
2286 /* Now that we've duplicated the blocks, duplicate their edges. */
2287 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2289 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2290 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
);
2294 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2295 e
->probability
= REG_BR_PROB_BASE
;
2296 e
->count
= incoming_count
;
2299 if (gimple_in_ssa_p (cfun
))
2300 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2302 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2303 copy_phis_for_bb (bb
, id
);
2305 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2308 if (need_debug_cleanup
2309 && bb
->index
!= ENTRY_BLOCK
2310 && bb
->index
!= EXIT_BLOCK
)
2311 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2312 ((basic_block
)bb
->aux
)->aux
= NULL
;
2316 /* Zero out AUX fields of newly created block during EH edge
2318 for (; last
< last_basic_block
; last
++)
2320 if (need_debug_cleanup
)
2321 maybe_move_debug_stmts_to_successors (id
, BASIC_BLOCK (last
));
2322 BASIC_BLOCK (last
)->aux
= NULL
;
2324 entry_block_map
->aux
= NULL
;
2325 exit_block_map
->aux
= NULL
;
2329 pointer_map_destroy (id
->eh_map
);
2336 /* Copy the debug STMT using ID. We deal with these statements in a
2337 special way: if any variable in their VALUE expression wasn't
2338 remapped yet, we won't remap it, because that would get decl uids
2339 out of sync, causing codegen differences between -g and -g0. If
2340 this arises, we drop the VALUE expression altogether. */
2343 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2346 struct walk_stmt_info wi
;
2349 if (gimple_block (stmt
))
2351 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2355 gimple_set_block (stmt
, t
);
2357 /* Remap all the operands in COPY. */
2358 memset (&wi
, 0, sizeof (wi
));
2361 processing_debug_stmt
= 1;
2363 if (gimple_debug_source_bind_p (stmt
))
2364 t
= gimple_debug_source_bind_get_var (stmt
);
2366 t
= gimple_debug_bind_get_var (stmt
);
2368 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2369 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2371 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2374 else if (TREE_CODE (t
) == VAR_DECL
2376 && gimple_in_ssa_p (cfun
)
2377 && !pointer_map_contains (id
->decl_map
, t
)
2379 /* T is a non-localized variable. */;
2381 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2383 if (gimple_debug_bind_p (stmt
))
2385 gimple_debug_bind_set_var (stmt
, t
);
2387 if (gimple_debug_bind_has_value_p (stmt
))
2388 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2389 remap_gimple_op_r
, &wi
, NULL
);
2391 /* Punt if any decl couldn't be remapped. */
2392 if (processing_debug_stmt
< 0)
2393 gimple_debug_bind_reset_value (stmt
);
2395 else if (gimple_debug_source_bind_p (stmt
))
2397 gimple_debug_source_bind_set_var (stmt
, t
);
2398 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2399 remap_gimple_op_r
, &wi
, NULL
);
2402 processing_debug_stmt
= 0;
2407 /* Process deferred debug stmts. In order to give values better odds
2408 of being successfully remapped, we delay the processing of debug
2409 stmts until all other stmts that might require remapping are
2413 copy_debug_stmts (copy_body_data
*id
)
2418 if (!id
->debug_stmts
)
2421 FOR_EACH_VEC_ELT (gimple
, id
->debug_stmts
, i
, stmt
)
2422 copy_debug_stmt (stmt
, id
);
2424 VEC_free (gimple
, heap
, id
->debug_stmts
);
2427 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2428 another function. */
2431 copy_tree_body (copy_body_data
*id
)
2433 tree fndecl
= id
->src_fn
;
2434 tree body
= DECL_SAVED_TREE (fndecl
);
2436 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2441 /* Make a copy of the body of FN so that it can be inserted inline in
2442 another function. */
2445 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2446 basic_block entry_block_map
, basic_block exit_block_map
,
2447 bitmap blocks_to_copy
, basic_block new_entry
)
2449 tree fndecl
= id
->src_fn
;
2452 /* If this body has a CFG, walk CFG and copy. */
2453 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl
)));
2454 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2455 blocks_to_copy
, new_entry
);
2456 copy_debug_stmts (id
);
2461 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2462 defined in function FN, or of a data member thereof. */
2465 self_inlining_addr_expr (tree value
, tree fn
)
2469 if (TREE_CODE (value
) != ADDR_EXPR
)
2472 var
= get_base_address (TREE_OPERAND (value
, 0));
2474 return var
&& auto_var_in_fn_p (var
, fn
);
2477 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2478 lexical block and line number information from base_stmt, if given,
2479 or from the last stmt of the block otherwise. */
2482 insert_init_debug_bind (copy_body_data
*id
,
2483 basic_block bb
, tree var
, tree value
,
2487 gimple_stmt_iterator gsi
;
2490 if (!gimple_in_ssa_p (id
->src_cfun
))
2493 if (!MAY_HAVE_DEBUG_STMTS
)
2496 tracked_var
= target_for_debug_bind (var
);
2502 gsi
= gsi_last_bb (bb
);
2503 if (!base_stmt
&& !gsi_end_p (gsi
))
2504 base_stmt
= gsi_stmt (gsi
);
2507 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2511 if (!gsi_end_p (gsi
))
2512 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2514 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2521 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2523 /* If VAR represents a zero-sized variable, it's possible that the
2524 assignment statement may result in no gimple statements. */
2527 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2529 /* We can end up with init statements that store to a non-register
2530 from a rhs with a conversion. Handle that here by forcing the
2531 rhs into a temporary. gimple_regimplify_operands is not
2532 prepared to do this for us. */
2533 if (!is_gimple_debug (init_stmt
)
2534 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2535 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2536 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2538 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2539 gimple_expr_type (init_stmt
),
2540 gimple_assign_rhs1 (init_stmt
));
2541 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2543 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2544 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2546 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2547 gimple_regimplify_operands (init_stmt
, &si
);
2549 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2551 tree var
, def
= gimple_assign_lhs (init_stmt
);
2553 if (TREE_CODE (def
) == SSA_NAME
)
2554 var
= SSA_NAME_VAR (def
);
2558 insert_init_debug_bind (id
, bb
, var
, def
, init_stmt
);
2563 /* Initialize parameter P with VALUE. If needed, produce init statement
2564 at the end of BB. When BB is NULL, we return init statement to be
2567 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2568 basic_block bb
, tree
*vars
)
2570 gimple init_stmt
= NULL
;
2573 tree def
= (gimple_in_ssa_p (cfun
)
2574 ? gimple_default_def (id
->src_cfun
, p
) : NULL
);
2577 && value
!= error_mark_node
2578 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2580 /* If we can match up types by promotion/demotion do so. */
2581 if (fold_convertible_p (TREE_TYPE (p
), value
))
2582 rhs
= fold_convert (TREE_TYPE (p
), value
);
2585 /* ??? For valid programs we should not end up here.
2586 Still if we end up with truly mismatched types here, fall back
2587 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2588 GIMPLE to the following passes. */
2589 if (!is_gimple_reg_type (TREE_TYPE (value
))
2590 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2591 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2593 rhs
= build_zero_cst (TREE_TYPE (p
));
2597 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2598 here since the type of this decl must be visible to the calling
2600 var
= copy_decl_to_var (p
, id
);
2602 /* We're actually using the newly-created var. */
2603 if (gimple_in_ssa_p (cfun
) && TREE_CODE (var
) == VAR_DECL
)
2604 add_referenced_var (var
);
2606 /* Declare this new variable. */
2607 DECL_CHAIN (var
) = *vars
;
2610 /* Make gimplifier happy about this variable. */
2611 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2613 /* We are eventually using the value - make sure all variables
2614 referenced therein are properly recorded. */
2616 && gimple_referenced_vars (cfun
)
2617 && TREE_CODE (value
) == ADDR_EXPR
)
2619 tree base
= get_base_address (TREE_OPERAND (value
, 0));
2620 if (base
&& TREE_CODE (base
) == VAR_DECL
&& !is_global_var (base
))
2621 add_referenced_var (base
);
2624 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2625 we would not need to create a new variable here at all, if it
2626 weren't for debug info. Still, we can just use the argument
2628 if (TREE_READONLY (p
)
2629 && !TREE_ADDRESSABLE (p
)
2630 && value
&& !TREE_SIDE_EFFECTS (value
)
2633 /* We may produce non-gimple trees by adding NOPs or introduce
2634 invalid sharing when operand is not really constant.
2635 It is not big deal to prohibit constant propagation here as
2636 we will constant propagate in DOM1 pass anyway. */
2637 if (is_gimple_min_invariant (value
)
2638 && useless_type_conversion_p (TREE_TYPE (p
),
2640 /* We have to be very careful about ADDR_EXPR. Make sure
2641 the base variable isn't a local variable of the inlined
2642 function, e.g., when doing recursive inlining, direct or
2643 mutually-recursive or whatever, which is why we don't
2644 just test whether fn == current_function_decl. */
2645 && ! self_inlining_addr_expr (value
, fn
))
2647 insert_decl_map (id
, p
, value
);
2648 insert_debug_decl_map (id
, p
, var
);
2649 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2653 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2654 that way, when the PARM_DECL is encountered, it will be
2655 automatically replaced by the VAR_DECL. */
2656 insert_decl_map (id
, p
, var
);
2658 /* Even if P was TREE_READONLY, the new VAR should not be.
2659 In the original code, we would have constructed a
2660 temporary, and then the function body would have never
2661 changed the value of P. However, now, we will be
2662 constructing VAR directly. The constructor body may
2663 change its value multiple times as it is being
2664 constructed. Therefore, it must not be TREE_READONLY;
2665 the back-end assumes that TREE_READONLY variable is
2666 assigned to only once. */
2667 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2668 TREE_READONLY (var
) = 0;
2670 /* If there is no setup required and we are in SSA, take the easy route
2671 replacing all SSA names representing the function parameter by the
2672 SSA name passed to function.
2674 We need to construct map for the variable anyway as it might be used
2675 in different SSA names when parameter is set in function.
2677 Do replacement at -O0 for const arguments replaced by constant.
2678 This is important for builtin_constant_p and other construct requiring
2679 constant argument to be visible in inlined function body. */
2680 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2682 || (TREE_READONLY (p
)
2683 && is_gimple_min_invariant (rhs
)))
2684 && (TREE_CODE (rhs
) == SSA_NAME
2685 || is_gimple_min_invariant (rhs
))
2686 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2688 insert_decl_map (id
, def
, rhs
);
2689 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2692 /* If the value of argument is never used, don't care about initializing
2694 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2696 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2697 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2700 /* Initialize this VAR_DECL from the equivalent argument. Convert
2701 the argument to the proper type in case it was promoted. */
2704 if (rhs
== error_mark_node
)
2706 insert_decl_map (id
, p
, var
);
2707 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2710 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2712 /* If we are in SSA form properly remap the default definition
2713 or assign to a dummy SSA name if the parameter is unused and
2714 we are not optimizing. */
2715 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2719 def
= remap_ssa_name (def
, id
);
2720 init_stmt
= gimple_build_assign (def
, rhs
);
2721 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2722 set_default_def (var
, NULL
);
2726 def
= make_ssa_name (var
, NULL
);
2727 init_stmt
= gimple_build_assign (def
, rhs
);
2731 init_stmt
= gimple_build_assign (var
, rhs
);
2733 if (bb
&& init_stmt
)
2734 insert_init_stmt (id
, bb
, init_stmt
);
2739 /* Generate code to initialize the parameters of the function at the
2740 top of the stack in ID from the GIMPLE_CALL STMT. */
2743 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2744 tree fn
, basic_block bb
)
2749 tree vars
= NULL_TREE
;
2750 tree static_chain
= gimple_call_chain (stmt
);
2752 /* Figure out what the parameters are. */
2753 parms
= DECL_ARGUMENTS (fn
);
2755 /* Loop through the parameter declarations, replacing each with an
2756 equivalent VAR_DECL, appropriately initialized. */
2757 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2760 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2761 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2763 /* After remapping parameters remap their types. This has to be done
2764 in a second loop over all parameters to appropriately remap
2765 variable sized arrays when the size is specified in a
2766 parameter following the array. */
2767 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2769 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
2771 && TREE_CODE (*varp
) == VAR_DECL
)
2773 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
2774 ? gimple_default_def (id
->src_cfun
, p
) : NULL
);
2776 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
2777 /* Also remap the default definition if it was remapped
2778 to the default definition of the parameter replacement
2779 by the parameter setup. */
2782 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
2784 && TREE_CODE (*defp
) == SSA_NAME
2785 && SSA_NAME_VAR (*defp
) == var
)
2786 TREE_TYPE (*defp
) = TREE_TYPE (var
);
2791 /* Initialize the static chain. */
2792 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
2793 gcc_assert (fn
!= current_function_decl
);
2796 /* No static chain? Seems like a bug in tree-nested.c. */
2797 gcc_assert (static_chain
);
2799 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
2802 declare_inline_vars (id
->block
, vars
);
2806 /* Declare a return variable to replace the RESULT_DECL for the
2807 function we are calling. An appropriate DECL_STMT is returned.
2808 The USE_STMT is filled to contain a use of the declaration to
2809 indicate the return value of the function.
2811 RETURN_SLOT, if non-null is place where to store the result. It
2812 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2813 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2815 The return value is a (possibly null) value that holds the result
2816 as seen by the caller. */
2819 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
2820 basic_block entry_bb
)
2822 tree callee
= id
->src_fn
;
2823 tree result
= DECL_RESULT (callee
);
2824 tree callee_type
= TREE_TYPE (result
);
2828 /* Handle type-mismatches in the function declaration return type
2829 vs. the call expression. */
2831 caller_type
= TREE_TYPE (modify_dest
);
2833 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
2835 /* We don't need to do anything for functions that don't return anything. */
2836 if (VOID_TYPE_P (callee_type
))
2839 /* If there was a return slot, then the return value is the
2840 dereferenced address of that object. */
2843 /* The front end shouldn't have used both return_slot and
2844 a modify expression. */
2845 gcc_assert (!modify_dest
);
2846 if (DECL_BY_REFERENCE (result
))
2848 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
2849 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
2851 /* We are going to construct *&return_slot and we can't do that
2852 for variables believed to be not addressable.
2854 FIXME: This check possibly can match, because values returned
2855 via return slot optimization are not believed to have address
2856 taken by alias analysis. */
2857 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
2858 var
= return_slot_addr
;
2863 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
2864 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
2866 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2867 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2868 && !DECL_GIMPLE_REG_P (result
)
2870 DECL_GIMPLE_REG_P (var
) = 0;
2875 /* All types requiring non-trivial constructors should have been handled. */
2876 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
2878 /* Attempt to avoid creating a new temporary variable. */
2880 && TREE_CODE (modify_dest
) != SSA_NAME
)
2882 bool use_it
= false;
2884 /* We can't use MODIFY_DEST if there's type promotion involved. */
2885 if (!useless_type_conversion_p (callee_type
, caller_type
))
2888 /* ??? If we're assigning to a variable sized type, then we must
2889 reuse the destination variable, because we've no good way to
2890 create variable sized temporaries at this point. */
2891 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
2894 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2895 reuse it as the result of the call directly. Don't do this if
2896 it would promote MODIFY_DEST to addressable. */
2897 else if (TREE_ADDRESSABLE (result
))
2901 tree base_m
= get_base_address (modify_dest
);
2903 /* If the base isn't a decl, then it's a pointer, and we don't
2904 know where that's going to go. */
2905 if (!DECL_P (base_m
))
2907 else if (is_global_var (base_m
))
2909 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2910 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2911 && !DECL_GIMPLE_REG_P (result
)
2912 && DECL_GIMPLE_REG_P (base_m
))
2914 else if (!TREE_ADDRESSABLE (base_m
))
2926 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
2928 var
= copy_result_decl_to_var (result
, id
);
2929 if (gimple_referenced_vars (cfun
))
2930 add_referenced_var (var
);
2932 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2934 /* Do not have the rest of GCC warn about this variable as it should
2935 not be visible to the user. */
2936 TREE_NO_WARNING (var
) = 1;
2938 declare_inline_vars (id
->block
, var
);
2940 /* Build the use expr. If the return type of the function was
2941 promoted, convert it back to the expected type. */
2943 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
2945 /* If we can match up types by promotion/demotion do so. */
2946 if (fold_convertible_p (caller_type
, var
))
2947 use
= fold_convert (caller_type
, var
);
2950 /* ??? For valid programs we should not end up here.
2951 Still if we end up with truly mismatched types here, fall back
2952 to using a MEM_REF to not leak invalid GIMPLE to the following
2954 /* Prevent var from being written into SSA form. */
2955 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
2956 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
2957 DECL_GIMPLE_REG_P (var
) = false;
2958 else if (is_gimple_reg_type (TREE_TYPE (var
)))
2959 TREE_ADDRESSABLE (var
) = true;
2960 use
= fold_build2 (MEM_REF
, caller_type
,
2961 build_fold_addr_expr (var
),
2962 build_int_cst (ptr_type_node
, 0));
2966 STRIP_USELESS_TYPE_CONVERSION (use
);
2968 if (DECL_BY_REFERENCE (result
))
2970 TREE_ADDRESSABLE (var
) = 1;
2971 var
= build_fold_addr_expr (var
);
2973 else if (gimple_in_ssa_p (cfun
)
2974 && is_gimple_reg (var
))
2975 /* ??? Re-org id->retval and its special handling so that we can
2976 record an SSA name directly and not need to invoke the SSA renamer. */
2977 mark_sym_for_renaming (var
);
2980 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2981 way, when the RESULT_DECL is encountered, it will be
2982 automatically replaced by the VAR_DECL.
2984 When returning by reference, ensure that RESULT_DECL remaps to
2986 if (DECL_BY_REFERENCE (result
)
2987 && !is_gimple_val (var
))
2989 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
2990 if (gimple_referenced_vars (cfun
))
2991 add_referenced_var (temp
);
2992 insert_decl_map (id
, result
, temp
);
2993 /* When RESULT_DECL is in SSA form, we need to remap and initialize
2994 it's default_def SSA_NAME. */
2995 if (gimple_in_ssa_p (id
->src_cfun
)
2996 && is_gimple_reg (result
))
2998 temp
= make_ssa_name (temp
, NULL
);
2999 insert_decl_map (id
, gimple_default_def (id
->src_cfun
, result
),
3002 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3005 insert_decl_map (id
, result
, var
);
3007 /* Remember this so we can ignore it in remap_decls. */
3013 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3014 to a local label. */
3017 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3020 tree fn
= (tree
) fnp
;
3022 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3031 /* Determine if the function can be copied. If so return NULL. If
3032 not return a string describng the reason for failure. */
3035 copy_forbidden (struct function
*fun
, tree fndecl
)
3037 const char *reason
= fun
->cannot_be_copied_reason
;
3041 /* Only examine the function once. */
3042 if (fun
->cannot_be_copied_set
)
3045 /* We cannot copy a function that receives a non-local goto
3046 because we cannot remap the destination label used in the
3047 function that is performing the non-local goto. */
3048 /* ??? Actually, this should be possible, if we work at it.
3049 No doubt there's just a handful of places that simply
3050 assume it doesn't happen and don't substitute properly. */
3051 if (fun
->has_nonlocal_label
)
3053 reason
= G_("function %q+F can never be copied "
3054 "because it receives a non-local goto");
3058 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3059 if (TREE_CODE (decl
) == VAR_DECL
3060 && TREE_STATIC (decl
)
3061 && !DECL_EXTERNAL (decl
)
3062 && DECL_INITIAL (decl
)
3063 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3064 has_label_address_in_static_1
,
3067 reason
= G_("function %q+F can never be copied because it saves "
3068 "address of local label in a static variable");
3073 fun
->cannot_be_copied_reason
= reason
;
3074 fun
->cannot_be_copied_set
= true;
3079 static const char *inline_forbidden_reason
;
3081 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3082 iff a function can not be inlined. Also sets the reason why. */
3085 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3086 struct walk_stmt_info
*wip
)
3088 tree fn
= (tree
) wip
->info
;
3090 gimple stmt
= gsi_stmt (*gsi
);
3092 switch (gimple_code (stmt
))
3095 /* Refuse to inline alloca call unless user explicitly forced so as
3096 this may change program's memory overhead drastically when the
3097 function using alloca is called in loop. In GCC present in
3098 SPEC2000 inlining into schedule_block cause it to require 2GB of
3099 RAM instead of 256MB. Don't do so for alloca calls emitted for
3100 VLA objects as those can't cause unbounded growth (they're always
3101 wrapped inside stack_save/stack_restore regions. */
3102 if (gimple_alloca_call_p (stmt
)
3103 && !gimple_call_alloca_for_var_p (stmt
)
3104 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3106 inline_forbidden_reason
3107 = G_("function %q+F can never be inlined because it uses "
3108 "alloca (override using the always_inline attribute)");
3109 *handled_ops_p
= true;
3113 t
= gimple_call_fndecl (stmt
);
3117 /* We cannot inline functions that call setjmp. */
3118 if (setjmp_call_p (t
))
3120 inline_forbidden_reason
3121 = G_("function %q+F can never be inlined because it uses setjmp");
3122 *handled_ops_p
= true;
3126 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3127 switch (DECL_FUNCTION_CODE (t
))
3129 /* We cannot inline functions that take a variable number of
3131 case BUILT_IN_VA_START
:
3132 case BUILT_IN_NEXT_ARG
:
3133 case BUILT_IN_VA_END
:
3134 inline_forbidden_reason
3135 = G_("function %q+F can never be inlined because it "
3136 "uses variable argument lists");
3137 *handled_ops_p
= true;
3140 case BUILT_IN_LONGJMP
:
3141 /* We can't inline functions that call __builtin_longjmp at
3142 all. The non-local goto machinery really requires the
3143 destination be in a different function. If we allow the
3144 function calling __builtin_longjmp to be inlined into the
3145 function calling __builtin_setjmp, Things will Go Awry. */
3146 inline_forbidden_reason
3147 = G_("function %q+F can never be inlined because "
3148 "it uses setjmp-longjmp exception handling");
3149 *handled_ops_p
= true;
3152 case BUILT_IN_NONLOCAL_GOTO
:
3154 inline_forbidden_reason
3155 = G_("function %q+F can never be inlined because "
3156 "it uses non-local goto");
3157 *handled_ops_p
= true;
3160 case BUILT_IN_RETURN
:
3161 case BUILT_IN_APPLY_ARGS
:
3162 /* If a __builtin_apply_args caller would be inlined,
3163 it would be saving arguments of the function it has
3164 been inlined into. Similarly __builtin_return would
3165 return from the function the inline has been inlined into. */
3166 inline_forbidden_reason
3167 = G_("function %q+F can never be inlined because "
3168 "it uses __builtin_return or __builtin_apply_args");
3169 *handled_ops_p
= true;
3178 t
= gimple_goto_dest (stmt
);
3180 /* We will not inline a function which uses computed goto. The
3181 addresses of its local labels, which may be tucked into
3182 global storage, are of course not constant across
3183 instantiations, which causes unexpected behavior. */
3184 if (TREE_CODE (t
) != LABEL_DECL
)
3186 inline_forbidden_reason
3187 = G_("function %q+F can never be inlined "
3188 "because it contains a computed goto");
3189 *handled_ops_p
= true;
3198 *handled_ops_p
= false;
3202 /* Return true if FNDECL is a function that cannot be inlined into
3206 inline_forbidden_p (tree fndecl
)
3208 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3209 struct walk_stmt_info wi
;
3210 struct pointer_set_t
*visited_nodes
;
3212 bool forbidden_p
= false;
3214 /* First check for shared reasons not to copy the code. */
3215 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3216 if (inline_forbidden_reason
!= NULL
)
3219 /* Next, walk the statements of the function looking for
3220 constraucts we can't handle, or are non-optimal for inlining. */
3221 visited_nodes
= pointer_set_create ();
3222 memset (&wi
, 0, sizeof (wi
));
3223 wi
.info
= (void *) fndecl
;
3224 wi
.pset
= visited_nodes
;
3226 FOR_EACH_BB_FN (bb
, fun
)
3229 gimple_seq seq
= bb_seq (bb
);
3230 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3231 forbidden_p
= (ret
!= NULL
);
3236 pointer_set_destroy (visited_nodes
);
3240 /* Return false if the function FNDECL cannot be inlined on account of its
3241 attributes, true otherwise. */
3243 function_attribute_inlinable_p (const_tree fndecl
)
3245 if (targetm
.attribute_table
)
3249 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3251 const_tree name
= TREE_PURPOSE (a
);
3254 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3255 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3256 return targetm
.function_attribute_inlinable_p (fndecl
);
3263 /* Returns nonzero if FN is a function that does not have any
3264 fundamental inline blocking properties. */
3267 tree_inlinable_function_p (tree fn
)
3269 bool inlinable
= true;
3273 /* If we've already decided this function shouldn't be inlined,
3274 there's no need to check again. */
3275 if (DECL_UNINLINABLE (fn
))
3278 /* We only warn for functions declared `inline' by the user. */
3279 do_warning
= (warn_inline
3280 && DECL_DECLARED_INLINE_P (fn
)
3281 && !DECL_NO_INLINE_WARNING_P (fn
)
3282 && !DECL_IN_SYSTEM_HEADER (fn
));
3284 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3287 && always_inline
== NULL
)
3290 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3291 "is suppressed using -fno-inline", fn
);
3295 else if (!function_attribute_inlinable_p (fn
))
3298 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3299 "uses attributes conflicting with inlining", fn
);
3303 else if (inline_forbidden_p (fn
))
3305 /* See if we should warn about uninlinable functions. Previously,
3306 some of these warnings would be issued while trying to expand
3307 the function inline, but that would cause multiple warnings
3308 about functions that would for example call alloca. But since
3309 this a property of the function, just one warning is enough.
3310 As a bonus we can now give more details about the reason why a
3311 function is not inlinable. */
3313 error (inline_forbidden_reason
, fn
);
3314 else if (do_warning
)
3315 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3320 /* Squirrel away the result so that we don't have to check again. */
3321 DECL_UNINLINABLE (fn
) = !inlinable
;
3326 /* Estimate the cost of a memory move. Use machine dependent
3327 word size and take possible memcpy call into account. */
3330 estimate_move_cost (tree type
)
3334 gcc_assert (!VOID_TYPE_P (type
));
3336 if (TREE_CODE (type
) == VECTOR_TYPE
)
3338 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3339 enum machine_mode simd
3340 = targetm
.vectorize
.preferred_simd_mode (inner
);
3341 int simd_mode_size
= GET_MODE_SIZE (simd
);
3342 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3346 size
= int_size_in_bytes (type
);
3348 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3349 /* Cost of a memcpy call, 3 arguments and the call. */
3352 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3355 /* Returns cost of operation CODE, according to WEIGHTS */
3358 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3359 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3363 /* These are "free" conversions, or their presumed cost
3364 is folded into other operations. */
3369 case VIEW_CONVERT_EXPR
:
3372 /* Assign cost of 1 to usual operations.
3373 ??? We may consider mapping RTL costs to this. */
3379 case POINTER_PLUS_EXPR
:
3382 case MULT_HIGHPART_EXPR
:
3385 case ADDR_SPACE_CONVERT_EXPR
:
3386 case FIXED_CONVERT_EXPR
:
3387 case FIX_TRUNC_EXPR
:
3399 case VEC_LSHIFT_EXPR
:
3400 case VEC_RSHIFT_EXPR
:
3407 case TRUTH_ANDIF_EXPR
:
3408 case TRUTH_ORIF_EXPR
:
3409 case TRUTH_AND_EXPR
:
3411 case TRUTH_XOR_EXPR
:
3412 case TRUTH_NOT_EXPR
:
3421 case UNORDERED_EXPR
:
3432 case PREDECREMENT_EXPR
:
3433 case PREINCREMENT_EXPR
:
3434 case POSTDECREMENT_EXPR
:
3435 case POSTINCREMENT_EXPR
:
3437 case REALIGN_LOAD_EXPR
:
3439 case REDUC_MAX_EXPR
:
3440 case REDUC_MIN_EXPR
:
3441 case REDUC_PLUS_EXPR
:
3442 case WIDEN_SUM_EXPR
:
3443 case WIDEN_MULT_EXPR
:
3445 case WIDEN_MULT_PLUS_EXPR
:
3446 case WIDEN_MULT_MINUS_EXPR
:
3447 case WIDEN_LSHIFT_EXPR
:
3449 case VEC_WIDEN_MULT_HI_EXPR
:
3450 case VEC_WIDEN_MULT_LO_EXPR
:
3451 case VEC_UNPACK_HI_EXPR
:
3452 case VEC_UNPACK_LO_EXPR
:
3453 case VEC_UNPACK_FLOAT_HI_EXPR
:
3454 case VEC_UNPACK_FLOAT_LO_EXPR
:
3455 case VEC_PACK_TRUNC_EXPR
:
3456 case VEC_PACK_SAT_EXPR
:
3457 case VEC_PACK_FIX_TRUNC_EXPR
:
3458 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3459 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3463 /* Few special cases of expensive operations. This is useful
3464 to avoid inlining on functions having too many of these. */
3465 case TRUNC_DIV_EXPR
:
3467 case FLOOR_DIV_EXPR
:
3468 case ROUND_DIV_EXPR
:
3469 case EXACT_DIV_EXPR
:
3470 case TRUNC_MOD_EXPR
:
3472 case FLOOR_MOD_EXPR
:
3473 case ROUND_MOD_EXPR
:
3475 if (TREE_CODE (op2
) != INTEGER_CST
)
3476 return weights
->div_mod_cost
;
3480 /* We expect a copy assignment with no operator. */
3481 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3487 /* Estimate number of instructions that will be created by expanding
3488 the statements in the statement sequence STMTS.
3489 WEIGHTS contains weights attributed to various constructs. */
3492 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3495 gimple_stmt_iterator gsi
;
3498 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3499 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3505 /* Estimate number of instructions that will be created by expanding STMT.
3506 WEIGHTS contains weights attributed to various constructs. */
3509 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3512 enum gimple_code code
= gimple_code (stmt
);
3519 /* Try to estimate the cost of assignments. We have three cases to
3521 1) Simple assignments to registers;
3522 2) Stores to things that must live in memory. This includes
3523 "normal" stores to scalars, but also assignments of large
3524 structures, or constructors of big arrays;
3526 Let us look at the first two cases, assuming we have "a = b + C":
3527 <GIMPLE_ASSIGN <var_decl "a">
3528 <plus_expr <var_decl "b"> <constant C>>
3529 If "a" is a GIMPLE register, the assignment to it is free on almost
3530 any target, because "a" usually ends up in a real register. Hence
3531 the only cost of this expression comes from the PLUS_EXPR, and we
3532 can ignore the GIMPLE_ASSIGN.
3533 If "a" is not a GIMPLE register, the assignment to "a" will most
3534 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3535 of moving something into "a", which we compute using the function
3536 estimate_move_cost. */
3537 if (gimple_clobber_p (stmt
))
3538 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3540 lhs
= gimple_assign_lhs (stmt
);
3541 rhs
= gimple_assign_rhs1 (stmt
);
3543 if (is_gimple_reg (lhs
))
3546 cost
= estimate_move_cost (TREE_TYPE (lhs
));
3548 if (!is_gimple_reg (rhs
) && !is_gimple_min_invariant (rhs
))
3549 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3551 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3552 gimple_assign_rhs1 (stmt
),
3553 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3554 == GIMPLE_BINARY_RHS
3555 ? gimple_assign_rhs2 (stmt
) : NULL
);
3559 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3560 gimple_op (stmt
, 0),
3561 gimple_op (stmt
, 1));
3565 /* Take into account cost of the switch + guess 2 conditional jumps for
3568 TODO: once the switch expansion logic is sufficiently separated, we can
3569 do better job on estimating cost of the switch. */
3570 if (weights
->time_based
)
3571 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3573 cost
= gimple_switch_num_labels (stmt
) * 2;
3578 tree decl
= gimple_call_fndecl (stmt
);
3579 struct cgraph_node
*node
= NULL
;
3581 /* Do not special case builtins where we see the body.
3582 This just confuse inliner. */
3583 if (!decl
|| !(node
= cgraph_get_node (decl
)) || node
->analyzed
)
3585 /* For buitins that are likely expanded to nothing or
3586 inlined do not account operand costs. */
3587 else if (is_simple_builtin (decl
))
3589 else if (is_inexpensive_builtin (decl
))
3590 return weights
->target_builtin_call_cost
;
3591 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3593 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3594 specialize the cheap expansion we do here.
3595 ??? This asks for a more general solution. */
3596 switch (DECL_FUNCTION_CODE (decl
))
3601 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3602 && REAL_VALUES_EQUAL
3603 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3604 return estimate_operator_cost (MULT_EXPR
, weights
,
3605 gimple_call_arg (stmt
, 0),
3606 gimple_call_arg (stmt
, 0));
3614 cost
= node
? weights
->call_cost
: weights
->indirect_call_cost
;
3615 if (gimple_call_lhs (stmt
))
3616 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3617 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3619 tree arg
= gimple_call_arg (stmt
, i
);
3620 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3626 return weights
->return_cost
;
3632 case GIMPLE_PREDICT
:
3637 return asm_str_count (gimple_asm_string (stmt
));
3640 /* This is either going to be an external function call with one
3641 argument, or two register copy statements plus a goto. */
3644 case GIMPLE_EH_DISPATCH
:
3645 /* ??? This is going to turn into a switch statement. Ideally
3646 we'd have a look at the eh region and estimate the number of
3651 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3653 case GIMPLE_EH_FILTER
:
3654 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3657 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3660 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3661 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3663 /* OpenMP directives are generally very expensive. */
3665 case GIMPLE_OMP_RETURN
:
3666 case GIMPLE_OMP_SECTIONS_SWITCH
:
3667 case GIMPLE_OMP_ATOMIC_STORE
:
3668 case GIMPLE_OMP_CONTINUE
:
3669 /* ...except these, which are cheap. */
3672 case GIMPLE_OMP_ATOMIC_LOAD
:
3673 return weights
->omp_cost
;
3675 case GIMPLE_OMP_FOR
:
3676 return (weights
->omp_cost
3677 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3678 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3680 case GIMPLE_OMP_PARALLEL
:
3681 case GIMPLE_OMP_TASK
:
3682 case GIMPLE_OMP_CRITICAL
:
3683 case GIMPLE_OMP_MASTER
:
3684 case GIMPLE_OMP_ORDERED
:
3685 case GIMPLE_OMP_SECTION
:
3686 case GIMPLE_OMP_SECTIONS
:
3687 case GIMPLE_OMP_SINGLE
:
3688 return (weights
->omp_cost
3689 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3691 case GIMPLE_TRANSACTION
:
3692 return (weights
->tm_cost
3693 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3703 /* Estimate number of instructions that will be created by expanding
3704 function FNDECL. WEIGHTS contains weights attributed to various
3708 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3710 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3711 gimple_stmt_iterator bsi
;
3715 gcc_assert (my_function
&& my_function
->cfg
);
3716 FOR_EACH_BB_FN (bb
, my_function
)
3718 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3719 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3726 /* Initializes weights used by estimate_num_insns. */
3729 init_inline_once (void)
3731 eni_size_weights
.call_cost
= 1;
3732 eni_size_weights
.indirect_call_cost
= 3;
3733 eni_size_weights
.target_builtin_call_cost
= 1;
3734 eni_size_weights
.div_mod_cost
= 1;
3735 eni_size_weights
.omp_cost
= 40;
3736 eni_size_weights
.tm_cost
= 10;
3737 eni_size_weights
.time_based
= false;
3738 eni_size_weights
.return_cost
= 1;
3740 /* Estimating time for call is difficult, since we have no idea what the
3741 called function does. In the current uses of eni_time_weights,
3742 underestimating the cost does less harm than overestimating it, so
3743 we choose a rather small value here. */
3744 eni_time_weights
.call_cost
= 10;
3745 eni_time_weights
.indirect_call_cost
= 15;
3746 eni_time_weights
.target_builtin_call_cost
= 1;
3747 eni_time_weights
.div_mod_cost
= 10;
3748 eni_time_weights
.omp_cost
= 40;
3749 eni_time_weights
.tm_cost
= 40;
3750 eni_time_weights
.time_based
= true;
3751 eni_time_weights
.return_cost
= 2;
3754 /* Estimate the number of instructions in a gimple_seq. */
3757 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3759 gimple_stmt_iterator gsi
;
3761 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3762 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3768 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3771 prepend_lexical_block (tree current_block
, tree new_block
)
3773 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
3774 BLOCK_SUBBLOCKS (current_block
) = new_block
;
3775 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
3778 /* Add local variables from CALLEE to CALLER. */
3781 add_local_variables (struct function
*callee
, struct function
*caller
,
3782 copy_body_data
*id
, bool check_var_ann
)
3787 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
3788 if (TREE_STATIC (var
) && !TREE_ASM_WRITTEN (var
))
3791 || (var_ann (var
) && add_referenced_var (var
)))
3792 add_local_decl (caller
, var
);
3794 else if (!can_be_nonlocal (var
, id
))
3796 tree new_var
= remap_decl (var
, id
);
3798 /* Remap debug-expressions. */
3799 if (TREE_CODE (new_var
) == VAR_DECL
3800 && DECL_DEBUG_EXPR_IS_FROM (new_var
)
3803 tree tem
= DECL_DEBUG_EXPR (var
);
3804 bool old_regimplify
= id
->regimplify
;
3805 id
->remapping_type_depth
++;
3806 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
3807 id
->remapping_type_depth
--;
3808 id
->regimplify
= old_regimplify
;
3809 SET_DECL_DEBUG_EXPR (new_var
, tem
);
3811 add_local_decl (caller
, new_var
);
3815 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3818 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
3822 struct pointer_map_t
*st
, *dst
;
3825 location_t saved_location
;
3826 struct cgraph_edge
*cg_edge
;
3827 cgraph_inline_failed_t reason
;
3828 basic_block return_block
;
3830 gimple_stmt_iterator gsi
, stmt_gsi
;
3831 bool successfully_inlined
= FALSE
;
3832 bool purge_dead_abnormal_edges
;
3834 /* Set input_location here so we get the right instantiation context
3835 if we call instantiate_decl from inlinable_function_p. */
3836 saved_location
= input_location
;
3837 input_location
= gimple_location (stmt
);
3839 /* From here on, we're only interested in CALL_EXPRs. */
3840 if (gimple_code (stmt
) != GIMPLE_CALL
)
3843 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
3844 gcc_checking_assert (cg_edge
);
3845 /* First, see if we can figure out what function is being called.
3846 If we cannot, then there is no hope of inlining the function. */
3847 if (cg_edge
->indirect_unknown_callee
)
3849 fn
= cg_edge
->callee
->symbol
.decl
;
3850 gcc_checking_assert (fn
);
3852 /* If FN is a declaration of a function in a nested scope that was
3853 globally declared inline, we don't set its DECL_INITIAL.
3854 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3855 C++ front-end uses it for cdtors to refer to their internal
3856 declarations, that are not real functions. Fortunately those
3857 don't have trees to be saved, so we can tell by checking their
3859 if (!DECL_INITIAL (fn
)
3860 && DECL_ABSTRACT_ORIGIN (fn
)
3861 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
3862 fn
= DECL_ABSTRACT_ORIGIN (fn
);
3864 /* Don't try to inline functions that are not well-suited to inlining. */
3865 if (cg_edge
->inline_failed
)
3867 reason
= cg_edge
->inline_failed
;
3868 /* If this call was originally indirect, we do not want to emit any
3869 inlining related warnings or sorry messages because there are no
3870 guarantees regarding those. */
3871 if (cg_edge
->indirect_inlining_edge
)
3874 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
3875 /* Avoid warnings during early inline pass. */
3876 && cgraph_global_info_ready
3877 /* PR 20090218-1_0.c. Body can be provided by another module. */
3878 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
3880 error ("inlining failed in call to always_inline %q+F: %s", fn
,
3881 cgraph_inline_failed_string (reason
));
3882 error ("called from here");
3884 else if (warn_inline
3885 && DECL_DECLARED_INLINE_P (fn
)
3886 && !DECL_NO_INLINE_WARNING_P (fn
)
3887 && !DECL_IN_SYSTEM_HEADER (fn
)
3888 && reason
!= CIF_UNSPECIFIED
3889 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
3890 /* Do not warn about not inlined recursive calls. */
3891 && !cgraph_edge_recursive_p (cg_edge
)
3892 /* Avoid warnings during early inline pass. */
3893 && cgraph_global_info_ready
)
3895 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
3896 fn
, _(cgraph_inline_failed_string (reason
)));
3897 warning (OPT_Winline
, "called from here");
3901 fn
= cg_edge
->callee
->symbol
.decl
;
3903 #ifdef ENABLE_CHECKING
3904 if (cg_edge
->callee
->symbol
.decl
!= id
->dst_node
->symbol
.decl
)
3905 verify_cgraph_node (cg_edge
->callee
);
3908 /* We will be inlining this callee. */
3909 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
3911 /* Update the callers EH personality. */
3912 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
))
3913 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->symbol
.decl
)
3914 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
);
3916 /* Split the block holding the GIMPLE_CALL. */
3917 e
= split_block (bb
, stmt
);
3919 return_block
= e
->dest
;
3922 /* split_block splits after the statement; work around this by
3923 moving the call into the second block manually. Not pretty,
3924 but seems easier than doing the CFG manipulation by hand
3925 when the GIMPLE_CALL is in the last statement of BB. */
3926 stmt_gsi
= gsi_last_bb (bb
);
3927 gsi_remove (&stmt_gsi
, false);
3929 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3930 been the source of abnormal edges. In this case, schedule
3931 the removal of dead abnormal edges. */
3932 gsi
= gsi_start_bb (return_block
);
3933 if (gsi_end_p (gsi
))
3935 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
3936 purge_dead_abnormal_edges
= true;
3940 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
3941 purge_dead_abnormal_edges
= false;
3944 stmt_gsi
= gsi_start_bb (return_block
);
3946 /* Build a block containing code to initialize the arguments, the
3947 actual inline expansion of the body, and a label for the return
3948 statements within the function to jump to. The type of the
3949 statement expression is the return type of the function call. */
3950 id
->block
= make_node (BLOCK
);
3951 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
3952 BLOCK_SOURCE_LOCATION (id
->block
) = input_location
;
3953 prepend_lexical_block (gimple_block (stmt
), id
->block
);
3955 /* Local declarations will be replaced by their equivalents in this
3958 id
->decl_map
= pointer_map_create ();
3959 dst
= id
->debug_map
;
3960 id
->debug_map
= NULL
;
3962 /* Record the function we are about to inline. */
3964 id
->src_node
= cg_edge
->callee
;
3965 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
3966 id
->gimple_call
= stmt
;
3968 gcc_assert (!id
->src_cfun
->after_inlining
);
3971 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
3973 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3974 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
3978 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
3980 if (DECL_INITIAL (fn
))
3981 prepend_lexical_block (id
->block
, remap_blocks (DECL_INITIAL (fn
), id
));
3983 /* Return statements in the function body will be replaced by jumps
3984 to the RET_LABEL. */
3985 gcc_assert (DECL_INITIAL (fn
));
3986 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
3988 /* Find the LHS to which the result of this call is assigned. */
3990 if (gimple_call_lhs (stmt
))
3992 modify_dest
= gimple_call_lhs (stmt
);
3994 /* The function which we are inlining might not return a value,
3995 in which case we should issue a warning that the function
3996 does not return a value. In that case the optimizers will
3997 see that the variable to which the value is assigned was not
3998 initialized. We do not want to issue a warning about that
3999 uninitialized variable. */
4000 if (DECL_P (modify_dest
))
4001 TREE_NO_WARNING (modify_dest
) = 1;
4003 if (gimple_call_return_slot_opt_p (stmt
))
4005 return_slot
= modify_dest
;
4012 /* If we are inlining a call to the C++ operator new, we don't want
4013 to use type based alias analysis on the return value. Otherwise
4014 we may get confused if the compiler sees that the inlined new
4015 function returns a pointer which was just deleted. See bug
4017 if (DECL_IS_OPERATOR_NEW (fn
))
4023 /* Declare the return variable for the function. */
4024 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4026 /* Add local vars in this inlined callee to caller. */
4027 add_local_variables (id
->src_cfun
, cfun
, id
, true);
4029 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4031 fprintf (dump_file
, "Inlining ");
4032 print_generic_expr (dump_file
, id
->src_fn
, 0);
4033 fprintf (dump_file
, " to ");
4034 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4035 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4038 /* This is it. Duplicate the callee body. Assume callee is
4039 pre-gimplified. Note that we must not alter the caller
4040 function in any way before this point, as this CALL_EXPR may be
4041 a self-referential call; if we're calling ourselves, we need to
4042 duplicate our body before altering anything. */
4043 copy_body (id
, bb
->count
,
4044 cg_edge
->frequency
* REG_BR_PROB_BASE
/ CGRAPH_FREQ_BASE
,
4045 bb
, return_block
, NULL
, NULL
);
4047 /* Reset the escaped solution. */
4048 if (cfun
->gimple_df
)
4049 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4054 pointer_map_destroy (id
->debug_map
);
4055 id
->debug_map
= dst
;
4057 pointer_map_destroy (id
->decl_map
);
4060 /* Unlink the calls virtual operands before replacing it. */
4061 unlink_stmt_vdef (stmt
);
4063 /* If the inlined function returns a result that we care about,
4064 substitute the GIMPLE_CALL with an assignment of the return
4065 variable to the LHS of the call. That is, if STMT was
4066 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4067 if (use_retvar
&& gimple_call_lhs (stmt
))
4069 gimple old_stmt
= stmt
;
4070 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4071 gsi_replace (&stmt_gsi
, stmt
, false);
4072 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4076 /* Handle the case of inlining a function with no return
4077 statement, which causes the return value to become undefined. */
4078 if (gimple_call_lhs (stmt
)
4079 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4081 tree name
= gimple_call_lhs (stmt
);
4082 tree var
= SSA_NAME_VAR (name
);
4083 tree def
= gimple_default_def (cfun
, var
);
4087 /* If the variable is used undefined, make this name
4088 undefined via a move. */
4089 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4090 gsi_replace (&stmt_gsi
, stmt
, true);
4094 /* Otherwise make this variable undefined. */
4095 gsi_remove (&stmt_gsi
, true);
4096 set_default_def (var
, name
);
4097 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4101 gsi_remove (&stmt_gsi
, true);
4104 if (purge_dead_abnormal_edges
)
4106 gimple_purge_dead_eh_edges (return_block
);
4107 gimple_purge_dead_abnormal_call_edges (return_block
);
4110 /* If the value of the new expression is ignored, that's OK. We
4111 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4112 the equivalent inlined version either. */
4113 if (is_gimple_assign (stmt
))
4115 gcc_assert (gimple_assign_single_p (stmt
)
4116 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4117 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4120 /* Output the inlining info for this abstract function, since it has been
4121 inlined. If we don't do this now, we can lose the information about the
4122 variables in the function when the blocks get blown away as soon as we
4123 remove the cgraph node. */
4124 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->symbol
.decl
);
4126 /* Update callgraph if needed. */
4127 cgraph_remove_node (cg_edge
->callee
);
4129 id
->block
= NULL_TREE
;
4130 successfully_inlined
= TRUE
;
4133 input_location
= saved_location
;
4134 return successfully_inlined
;
4137 /* Expand call statements reachable from STMT_P.
4138 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4139 in a MODIFY_EXPR. */
4142 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4144 gimple_stmt_iterator gsi
;
4146 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4148 gimple stmt
= gsi_stmt (gsi
);
4150 if (is_gimple_call (stmt
)
4151 && expand_call_inline (bb
, stmt
, id
))
4159 /* Walk all basic blocks created after FIRST and try to fold every statement
4160 in the STATEMENTS pointer set. */
4163 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4165 for (; first
< n_basic_blocks
; first
++)
4166 if (BASIC_BLOCK (first
))
4168 gimple_stmt_iterator gsi
;
4170 for (gsi
= gsi_start_bb (BASIC_BLOCK (first
));
4173 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4175 gimple old_stmt
= gsi_stmt (gsi
);
4176 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4178 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4180 /* Folding builtins can create multiple instructions,
4181 we need to look at all of them. */
4182 gimple_stmt_iterator i2
= gsi
;
4184 if (fold_stmt (&gsi
))
4187 /* If a builtin at the end of a bb folded into nothing,
4188 the following loop won't work. */
4189 if (gsi_end_p (gsi
))
4191 cgraph_update_edges_for_call_stmt (old_stmt
,
4196 i2
= gsi_start_bb (BASIC_BLOCK (first
));
4201 new_stmt
= gsi_stmt (i2
);
4202 update_stmt (new_stmt
);
4203 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4206 if (new_stmt
== gsi_stmt (gsi
))
4208 /* It is okay to check only for the very last
4209 of these statements. If it is a throwing
4210 statement nothing will change. If it isn't
4211 this can remove EH edges. If that weren't
4212 correct then because some intermediate stmts
4213 throw, but not the last one. That would mean
4214 we'd have to split the block, which we can't
4215 here and we'd loose anyway. And as builtins
4216 probably never throw, this all
4218 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4220 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4227 else if (fold_stmt (&gsi
))
4229 /* Re-read the statement from GSI as fold_stmt() may
4231 gimple new_stmt
= gsi_stmt (gsi
);
4232 update_stmt (new_stmt
);
4234 if (is_gimple_call (old_stmt
)
4235 || is_gimple_call (new_stmt
))
4236 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4239 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4240 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4246 /* Return true if BB has at least one abnormal outgoing edge. */
4249 has_abnormal_outgoing_edge_p (basic_block bb
)
4254 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4255 if (e
->flags
& EDGE_ABNORMAL
)
4261 /* Expand calls to inline functions in the body of FN. */
4264 optimize_inline_calls (tree fn
)
4268 int last
= n_basic_blocks
;
4269 struct gimplify_ctx gctx
;
4270 bool inlined_p
= false;
4273 memset (&id
, 0, sizeof (id
));
4275 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4276 gcc_assert (id
.dst_node
->analyzed
);
4278 /* Or any functions that aren't finished yet. */
4279 if (current_function_decl
)
4280 id
.dst_fn
= current_function_decl
;
4282 id
.copy_decl
= copy_decl_maybe_to_var
;
4283 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4284 id
.transform_new_cfg
= false;
4285 id
.transform_return_to_modify
= true;
4286 id
.transform_lang_insert_block
= NULL
;
4287 id
.statements_to_fold
= pointer_set_create ();
4289 push_gimplify_context (&gctx
);
4291 /* We make no attempts to keep dominance info up-to-date. */
4292 free_dominance_info (CDI_DOMINATORS
);
4293 free_dominance_info (CDI_POST_DOMINATORS
);
4295 /* Register specific gimple functions. */
4296 gimple_register_cfg_hooks ();
4298 /* Reach the trees by walking over the CFG, and note the
4299 enclosing basic-blocks in the call edges. */
4300 /* We walk the blocks going forward, because inlined function bodies
4301 will split id->current_basic_block, and the new blocks will
4302 follow it; we'll trudge through them, processing their CALL_EXPRs
4305 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4307 pop_gimplify_context (NULL
);
4309 #ifdef ENABLE_CHECKING
4311 struct cgraph_edge
*e
;
4313 verify_cgraph_node (id
.dst_node
);
4315 /* Double check that we inlined everything we are supposed to inline. */
4316 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4317 gcc_assert (e
->inline_failed
);
4321 /* Fold queued statements. */
4322 fold_marked_statements (last
, id
.statements_to_fold
);
4323 pointer_set_destroy (id
.statements_to_fold
);
4325 gcc_assert (!id
.debug_stmts
);
4327 /* If we didn't inline into the function there is nothing to do. */
4331 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4334 delete_unreachable_blocks_update_callgraph (&id
);
4335 #ifdef ENABLE_CHECKING
4336 verify_cgraph_node (id
.dst_node
);
4339 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4340 not possible yet - the IPA passes might make various functions to not
4341 throw and they don't care to proactively update local EH info. This is
4342 done later in fixup_cfg pass that also execute the verification. */
4343 return (TODO_update_ssa
4345 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4346 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4347 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
4350 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4353 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4355 enum tree_code code
= TREE_CODE (*tp
);
4356 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4358 /* We make copies of most nodes. */
4359 if (IS_EXPR_CODE_CLASS (cl
)
4360 || code
== TREE_LIST
4362 || code
== TYPE_DECL
4363 || code
== OMP_CLAUSE
)
4365 /* Because the chain gets clobbered when we make a copy, we save it
4367 tree chain
= NULL_TREE
, new_tree
;
4369 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4370 chain
= TREE_CHAIN (*tp
);
4372 /* Copy the node. */
4373 new_tree
= copy_node (*tp
);
4375 /* Propagate mudflap marked-ness. */
4376 if (flag_mudflap
&& mf_marked_p (*tp
))
4381 /* Now, restore the chain, if appropriate. That will cause
4382 walk_tree to walk into the chain as well. */
4383 if (code
== PARM_DECL
4384 || code
== TREE_LIST
4385 || code
== OMP_CLAUSE
)
4386 TREE_CHAIN (*tp
) = chain
;
4388 /* For now, we don't update BLOCKs when we make copies. So, we
4389 have to nullify all BIND_EXPRs. */
4390 if (TREE_CODE (*tp
) == BIND_EXPR
)
4391 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4393 else if (code
== CONSTRUCTOR
)
4395 /* CONSTRUCTOR nodes need special handling because
4396 we need to duplicate the vector of elements. */
4399 new_tree
= copy_node (*tp
);
4401 /* Propagate mudflap marked-ness. */
4402 if (flag_mudflap
&& mf_marked_p (*tp
))
4405 CONSTRUCTOR_ELTS (new_tree
) = VEC_copy (constructor_elt
, gc
,
4406 CONSTRUCTOR_ELTS (*tp
));
4409 else if (code
== STATEMENT_LIST
)
4410 /* We used to just abort on STATEMENT_LIST, but we can run into them
4411 with statement-expressions (c++/40975). */
4412 copy_statement_list (tp
);
4413 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4415 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4417 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4422 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4423 information indicating to what new SAVE_EXPR this one should be mapped,
4424 use that one. Otherwise, create a new node and enter it in ST. FN is
4425 the function into which the copy will be placed. */
4428 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4430 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4434 /* See if we already encountered this SAVE_EXPR. */
4435 n
= (tree
*) pointer_map_contains (st
, *tp
);
4437 /* If we didn't already remap this SAVE_EXPR, do so now. */
4440 t
= copy_node (*tp
);
4442 /* Remember this SAVE_EXPR. */
4443 *pointer_map_insert (st
, *tp
) = t
;
4444 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4445 *pointer_map_insert (st
, t
) = t
;
4449 /* We've already walked into this SAVE_EXPR; don't do it again. */
4454 /* Replace this SAVE_EXPR with the copy. */
4458 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4459 copies the declaration and enters it in the splay_tree in DATA (which is
4460 really an `copy_body_data *'). */
4463 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
4466 copy_body_data
*id
= (copy_body_data
*) data
;
4468 /* Don't walk into types. */
4472 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
4474 tree decl
= TREE_OPERAND (*tp
, 0);
4476 /* Copy the decl and remember the copy. */
4477 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4483 /* Perform any modifications to EXPR required when it is unsaved. Does
4484 not recurse into EXPR's subtrees. */
4487 unsave_expr_1 (tree expr
)
4489 switch (TREE_CODE (expr
))
4492 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4493 It's OK for this to happen if it was part of a subtree that
4494 isn't immediately expanded, such as operand 2 of another
4496 if (TREE_OPERAND (expr
, 1))
4499 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4500 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4508 /* Called via walk_tree when an expression is unsaved. Using the
4509 splay_tree pointed to by ST (which is really a `splay_tree'),
4510 remaps all local declarations to appropriate replacements. */
4513 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
4515 copy_body_data
*id
= (copy_body_data
*) data
;
4516 struct pointer_map_t
*st
= id
->decl_map
;
4519 /* Only a local declaration (variable or label). */
4520 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
4521 || TREE_CODE (*tp
) == LABEL_DECL
)
4523 /* Lookup the declaration. */
4524 n
= (tree
*) pointer_map_contains (st
, *tp
);
4526 /* If it's there, remap it. */
4531 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
4533 else if (TREE_CODE (*tp
) == BIND_EXPR
)
4534 copy_bind_expr (tp
, walk_subtrees
, id
);
4535 else if (TREE_CODE (*tp
) == SAVE_EXPR
4536 || TREE_CODE (*tp
) == TARGET_EXPR
)
4537 remap_save_expr (tp
, st
, walk_subtrees
);
4540 copy_tree_r (tp
, walk_subtrees
, NULL
);
4542 /* Do whatever unsaving is required. */
4543 unsave_expr_1 (*tp
);
4546 /* Keep iterating. */
4550 /* Copies everything in EXPR and replaces variables, labels
4551 and SAVE_EXPRs local to EXPR. */
4554 unsave_expr_now (tree expr
)
4558 /* There's nothing to do for NULL_TREE. */
4563 memset (&id
, 0, sizeof (id
));
4564 id
.src_fn
= current_function_decl
;
4565 id
.dst_fn
= current_function_decl
;
4566 id
.decl_map
= pointer_map_create ();
4567 id
.debug_map
= NULL
;
4569 id
.copy_decl
= copy_decl_no_change
;
4570 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4571 id
.transform_new_cfg
= false;
4572 id
.transform_return_to_modify
= false;
4573 id
.transform_lang_insert_block
= NULL
;
4575 /* Walk the tree once to find local labels. */
4576 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
4578 /* Walk the tree again, copying, remapping, and unsaving. */
4579 walk_tree (&expr
, unsave_r
, &id
, NULL
);
4582 pointer_map_destroy (id
.decl_map
);
4584 pointer_map_destroy (id
.debug_map
);
4589 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4590 label, copies the declaration and enters it in the splay_tree in DATA (which
4591 is really a 'copy_body_data *'. */
4594 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4595 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4596 struct walk_stmt_info
*wi
)
4598 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4599 gimple stmt
= gsi_stmt (*gsip
);
4601 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4603 tree decl
= gimple_label_label (stmt
);
4605 /* Copy the decl and remember the copy. */
4606 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4613 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4614 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4615 remaps all local declarations to appropriate replacements in gimple
4619 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4621 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4622 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4623 struct pointer_map_t
*st
= id
->decl_map
;
4627 /* Only a local declaration (variable or label). */
4628 if ((TREE_CODE (expr
) == VAR_DECL
4629 && !TREE_STATIC (expr
))
4630 || TREE_CODE (expr
) == LABEL_DECL
)
4632 /* Lookup the declaration. */
4633 n
= (tree
*) pointer_map_contains (st
, expr
);
4635 /* If it's there, remap it. */
4640 else if (TREE_CODE (expr
) == STATEMENT_LIST
4641 || TREE_CODE (expr
) == BIND_EXPR
4642 || TREE_CODE (expr
) == SAVE_EXPR
)
4644 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4646 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4647 It's OK for this to happen if it was part of a subtree that
4648 isn't immediately expanded, such as operand 2 of another
4650 if (!TREE_OPERAND (expr
, 1))
4652 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4653 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4657 /* Keep iterating. */
4662 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4663 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4664 remaps all local declarations to appropriate replacements in gimple
4668 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4669 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4670 struct walk_stmt_info
*wi
)
4672 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4673 gimple stmt
= gsi_stmt (*gsip
);
4675 if (gimple_code (stmt
) == GIMPLE_BIND
)
4677 tree block
= gimple_bind_block (stmt
);
4681 remap_block (&block
, id
);
4682 gimple_bind_set_block (stmt
, block
);
4685 /* This will remap a lot of the same decls again, but this should be
4687 if (gimple_bind_vars (stmt
))
4688 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
), NULL
, id
));
4691 /* Keep iterating. */
4696 /* Copies everything in SEQ and replaces variables and labels local to
4697 current_function_decl. */
4700 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4703 struct walk_stmt_info wi
;
4704 struct pointer_set_t
*visited
;
4707 /* There's nothing to do for NULL_TREE. */
4712 memset (&id
, 0, sizeof (id
));
4713 id
.src_fn
= current_function_decl
;
4714 id
.dst_fn
= current_function_decl
;
4715 id
.decl_map
= pointer_map_create ();
4716 id
.debug_map
= NULL
;
4718 id
.copy_decl
= copy_decl_no_change
;
4719 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4720 id
.transform_new_cfg
= false;
4721 id
.transform_return_to_modify
= false;
4722 id
.transform_lang_insert_block
= NULL
;
4724 /* Walk the tree once to find local labels. */
4725 memset (&wi
, 0, sizeof (wi
));
4726 visited
= pointer_set_create ();
4729 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4730 pointer_set_destroy (visited
);
4732 copy
= gimple_seq_copy (seq
);
4734 /* Walk the copy, remapping decls. */
4735 memset (&wi
, 0, sizeof (wi
));
4737 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4740 pointer_map_destroy (id
.decl_map
);
4742 pointer_map_destroy (id
.debug_map
);
4748 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4751 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4760 debug_find_tree (tree top
, tree search
)
4762 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4766 /* Declare the variables created by the inliner. Add all the variables in
4767 VARS to BIND_EXPR. */
4770 declare_inline_vars (tree block
, tree vars
)
4773 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4775 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4776 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4777 add_local_decl (cfun
, t
);
4781 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4784 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4785 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4786 VAR_DECL translation. */
4789 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4791 /* Don't generate debug information for the copy if we wouldn't have
4792 generated it for the copy either. */
4793 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4794 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4796 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4797 declaration inspired this copy. */
4798 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4800 /* The new variable/label has no RTL, yet. */
4801 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4802 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4803 SET_DECL_RTL (copy
, 0);
4805 /* These args would always appear unused, if not for this. */
4806 TREE_USED (copy
) = 1;
4808 /* Set the context for the new declaration. */
4809 if (!DECL_CONTEXT (decl
))
4810 /* Globals stay global. */
4812 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4813 /* Things that weren't in the scope of the function we're inlining
4814 from aren't in the scope we're inlining to, either. */
4816 else if (TREE_STATIC (decl
))
4817 /* Function-scoped static variables should stay in the original
4821 /* Ordinary automatic local variables are now in the scope of the
4823 DECL_CONTEXT (copy
) = id
->dst_fn
;
4825 if (TREE_CODE (decl
) == VAR_DECL
4826 /* C++ clones functions during parsing, before
4828 && gimple_referenced_vars (DECL_STRUCT_FUNCTION (id
->src_fn
))
4829 && referenced_var_lookup (DECL_STRUCT_FUNCTION (id
->src_fn
),
4831 add_referenced_var (copy
);
4837 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4841 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4842 || TREE_CODE (decl
) == RESULT_DECL
);
4844 type
= TREE_TYPE (decl
);
4846 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4847 VAR_DECL
, DECL_NAME (decl
), type
);
4848 if (DECL_PT_UID_SET_P (decl
))
4849 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4850 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4851 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4852 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4853 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4855 return copy_decl_for_dup_finish (id
, decl
, copy
);
4858 /* Like copy_decl_to_var, but create a return slot object instead of a
4859 pointer variable for return by invisible reference. */
4862 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4866 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4867 || TREE_CODE (decl
) == RESULT_DECL
);
4869 type
= TREE_TYPE (decl
);
4870 if (DECL_BY_REFERENCE (decl
))
4871 type
= TREE_TYPE (type
);
4873 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4874 VAR_DECL
, DECL_NAME (decl
), type
);
4875 if (DECL_PT_UID_SET_P (decl
))
4876 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4877 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4878 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4879 if (!DECL_BY_REFERENCE (decl
))
4881 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4882 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4885 return copy_decl_for_dup_finish (id
, decl
, copy
);
4889 copy_decl_no_change (tree decl
, copy_body_data
*id
)
4893 copy
= copy_node (decl
);
4895 /* The COPY is not abstract; it will be generated in DST_FN. */
4896 DECL_ABSTRACT (copy
) = 0;
4897 lang_hooks
.dup_lang_specific_decl (copy
);
4899 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4900 been taken; it's for internal bookkeeping in expand_goto_internal. */
4901 if (TREE_CODE (copy
) == LABEL_DECL
)
4903 TREE_ADDRESSABLE (copy
) = 0;
4904 LABEL_DECL_UID (copy
) = -1;
4907 return copy_decl_for_dup_finish (id
, decl
, copy
);
4911 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
4913 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
4914 return copy_decl_to_var (decl
, id
);
4916 return copy_decl_no_change (decl
, id
);
4919 /* Return a copy of the function's argument tree. */
4921 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
4922 bitmap args_to_skip
, tree
*vars
)
4925 tree new_parm
= NULL
;
4930 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
4931 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
4933 tree new_tree
= remap_decl (arg
, id
);
4934 if (TREE_CODE (new_tree
) != PARM_DECL
)
4935 new_tree
= id
->copy_decl (arg
, id
);
4936 lang_hooks
.dup_lang_specific_decl (new_tree
);
4938 parg
= &DECL_CHAIN (new_tree
);
4940 else if (!pointer_map_contains (id
->decl_map
, arg
))
4942 /* Make an equivalent VAR_DECL. If the argument was used
4943 as temporary variable later in function, the uses will be
4944 replaced by local variable. */
4945 tree var
= copy_decl_to_var (arg
, id
);
4946 add_referenced_var (var
);
4947 insert_decl_map (id
, arg
, var
);
4948 /* Declare this new variable. */
4949 DECL_CHAIN (var
) = *vars
;
4955 /* Return a copy of the function's static chain. */
4957 copy_static_chain (tree static_chain
, copy_body_data
* id
)
4959 tree
*chain_copy
, *pvar
;
4961 chain_copy
= &static_chain
;
4962 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
4964 tree new_tree
= remap_decl (*pvar
, id
);
4965 lang_hooks
.dup_lang_specific_decl (new_tree
);
4966 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
4969 return static_chain
;
4972 /* Return true if the function is allowed to be versioned.
4973 This is a guard for the versioning functionality. */
4976 tree_versionable_function_p (tree fndecl
)
4978 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
4979 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
4982 /* Delete all unreachable basic blocks and update callgraph.
4983 Doing so is somewhat nontrivial because we need to update all clones and
4984 remove inline function that become unreachable. */
4987 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
4989 bool changed
= false;
4990 basic_block b
, next_bb
;
4992 find_unreachable_blocks ();
4994 /* Delete all unreachable basic blocks. */
4996 for (b
= ENTRY_BLOCK_PTR
->next_bb
; b
!= EXIT_BLOCK_PTR
; b
= next_bb
)
4998 next_bb
= b
->next_bb
;
5000 if (!(b
->flags
& BB_REACHABLE
))
5002 gimple_stmt_iterator bsi
;
5004 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5005 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
)
5007 struct cgraph_edge
*e
;
5008 struct cgraph_node
*node
;
5010 if ((e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
5012 if (!e
->inline_failed
)
5013 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5015 cgraph_remove_edge (e
);
5017 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5018 && id
->dst_node
->clones
)
5019 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5021 if ((e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
5023 if (!e
->inline_failed
)
5024 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5026 cgraph_remove_edge (e
);
5030 node
= node
->clones
;
5031 else if (node
->next_sibling_clone
)
5032 node
= node
->next_sibling_clone
;
5035 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5036 node
= node
->clone_of
;
5037 if (node
!= id
->dst_node
)
5038 node
= node
->next_sibling_clone
;
5042 delete_basic_block (b
);
5050 /* Update clone info after duplication. */
5053 update_clone_info (copy_body_data
* id
)
5055 struct cgraph_node
*node
;
5056 if (!id
->dst_node
->clones
)
5058 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5060 /* First update replace maps to match the new body. */
5061 if (node
->clone
.tree_map
)
5064 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, node
->clone
.tree_map
); i
++)
5066 struct ipa_replace_map
*replace_info
;
5067 replace_info
= VEC_index (ipa_replace_map_p
, node
->clone
.tree_map
, i
);
5068 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5069 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5073 node
= node
->clones
;
5074 else if (node
->next_sibling_clone
)
5075 node
= node
->next_sibling_clone
;
5078 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5079 node
= node
->clone_of
;
5080 if (node
!= id
->dst_node
)
5081 node
= node
->next_sibling_clone
;
5086 /* Create a copy of a function's tree.
5087 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5088 of the original function and the new copied function
5089 respectively. In case we want to replace a DECL
5090 tree with another tree while duplicating the function's
5091 body, TREE_MAP represents the mapping between these
5092 trees. If UPDATE_CLONES is set, the call_stmt fields
5093 of edges of clones of the function will be updated.
5095 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5097 If SKIP_RETURN is true, the new version will return void.
5098 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5099 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5102 tree_function_versioning (tree old_decl
, tree new_decl
,
5103 VEC(ipa_replace_map_p
,gc
)* tree_map
,
5104 bool update_clones
, bitmap args_to_skip
,
5105 bool skip_return
, bitmap blocks_to_copy
,
5106 basic_block new_entry
)
5108 struct cgraph_node
*old_version_node
;
5109 struct cgraph_node
*new_version_node
;
5113 struct ipa_replace_map
*replace_info
;
5114 basic_block old_entry_block
, bb
;
5115 VEC (gimple
, heap
) *init_stmts
= VEC_alloc (gimple
, heap
, 10);
5117 tree old_current_function_decl
= current_function_decl
;
5118 tree vars
= NULL_TREE
;
5120 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5121 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5122 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5124 old_version_node
= cgraph_get_node (old_decl
);
5125 gcc_checking_assert (old_version_node
);
5126 new_version_node
= cgraph_get_node (new_decl
);
5127 gcc_checking_assert (new_version_node
);
5129 /* Copy over debug args. */
5130 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5132 VEC(tree
, gc
) **new_debug_args
, **old_debug_args
;
5133 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5134 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5135 old_debug_args
= decl_debug_args_lookup (old_decl
);
5138 new_debug_args
= decl_debug_args_insert (new_decl
);
5139 *new_debug_args
= VEC_copy (tree
, gc
, *old_debug_args
);
5143 /* Output the inlining info for this abstract function, since it has been
5144 inlined. If we don't do this now, we can lose the information about the
5145 variables in the function when the blocks get blown away as soon as we
5146 remove the cgraph node. */
5147 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5149 DECL_ARTIFICIAL (new_decl
) = 1;
5150 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5151 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5153 /* Prepare the data structures for the tree copy. */
5154 memset (&id
, 0, sizeof (id
));
5156 /* Generate a new name for the new version. */
5157 id
.statements_to_fold
= pointer_set_create ();
5159 id
.decl_map
= pointer_map_create ();
5160 id
.debug_map
= NULL
;
5161 id
.src_fn
= old_decl
;
5162 id
.dst_fn
= new_decl
;
5163 id
.src_node
= old_version_node
;
5164 id
.dst_node
= new_version_node
;
5165 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5166 if (id
.src_node
->ipa_transforms_to_apply
)
5168 VEC(ipa_opt_pass
,heap
) * old_transforms_to_apply
= id
.dst_node
->ipa_transforms_to_apply
;
5171 id
.dst_node
->ipa_transforms_to_apply
= VEC_copy (ipa_opt_pass
, heap
,
5172 id
.src_node
->ipa_transforms_to_apply
);
5173 for (i
= 0; i
< VEC_length (ipa_opt_pass
, old_transforms_to_apply
); i
++)
5174 VEC_safe_push (ipa_opt_pass
, heap
, id
.dst_node
->ipa_transforms_to_apply
,
5175 VEC_index (ipa_opt_pass
,
5176 old_transforms_to_apply
,
5180 id
.copy_decl
= copy_decl_no_change
;
5181 id
.transform_call_graph_edges
5182 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5183 id
.transform_new_cfg
= true;
5184 id
.transform_return_to_modify
= false;
5185 id
.transform_lang_insert_block
= NULL
;
5187 current_function_decl
= new_decl
;
5188 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION
5189 (DECL_STRUCT_FUNCTION (old_decl
));
5190 initialize_cfun (new_decl
, old_decl
,
5191 old_entry_block
->count
);
5192 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5193 = id
.src_cfun
->gimple_df
->ipa_pta
;
5194 push_cfun (DECL_STRUCT_FUNCTION (new_decl
));
5196 /* Copy the function's static chain. */
5197 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5199 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5200 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5203 /* If there's a tree_map, prepare for substitution. */
5205 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, tree_map
); i
++)
5208 replace_info
= VEC_index (ipa_replace_map_p
, tree_map
, i
);
5209 if (replace_info
->replace_p
)
5211 tree op
= replace_info
->new_tree
;
5212 if (!replace_info
->old_tree
)
5214 int i
= replace_info
->parm_num
;
5216 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5218 replace_info
->old_tree
= parm
;
5224 if (TREE_CODE (op
) == VIEW_CONVERT_EXPR
)
5225 op
= TREE_OPERAND (op
, 0);
5227 if (TREE_CODE (op
) == ADDR_EXPR
)
5229 op
= get_base_address (TREE_OPERAND (op
, 0));
5230 if (op
&& TREE_CODE (op
) == VAR_DECL
&& !is_global_var (op
))
5231 add_referenced_var (op
);
5233 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5234 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5235 replace_info
->new_tree
, id
.src_fn
,
5239 VEC_safe_push (gimple
, heap
, init_stmts
, init
);
5242 /* Copy the function's arguments. */
5243 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5244 DECL_ARGUMENTS (new_decl
) =
5245 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5246 args_to_skip
, &vars
);
5248 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5249 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5251 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5253 if (!VEC_empty (tree
, DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5254 /* Add local vars. */
5255 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
, false);
5257 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5259 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5261 DECL_RESULT (new_decl
)
5262 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5263 RESULT_DECL
, NULL_TREE
, void_type_node
);
5264 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5265 cfun
->returns_struct
= 0;
5266 cfun
->returns_pcc_struct
= 0;
5271 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5272 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5273 if (gimple_in_ssa_p (id
.src_cfun
)
5274 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5276 = gimple_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5278 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5279 insert_decl_map (&id
, old_name
, new_name
);
5280 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5281 set_default_def (DECL_RESULT (new_decl
), new_name
);
5285 /* Copy the Function's body. */
5286 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5287 ENTRY_BLOCK_PTR
, EXIT_BLOCK_PTR
, blocks_to_copy
, new_entry
);
5289 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5290 number_blocks (new_decl
);
5292 /* We want to create the BB unconditionally, so that the addition of
5293 debug stmts doesn't affect BB count, which may in the end cause
5294 codegen differences. */
5295 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR
));
5296 while (VEC_length (gimple
, init_stmts
))
5297 insert_init_stmt (&id
, bb
, VEC_pop (gimple
, init_stmts
));
5298 update_clone_info (&id
);
5300 /* Remap the nonlocal_goto_save_area, if any. */
5301 if (cfun
->nonlocal_goto_save_area
)
5303 struct walk_stmt_info wi
;
5305 memset (&wi
, 0, sizeof (wi
));
5307 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5311 pointer_map_destroy (id
.decl_map
);
5313 pointer_map_destroy (id
.debug_map
);
5314 free_dominance_info (CDI_DOMINATORS
);
5315 free_dominance_info (CDI_POST_DOMINATORS
);
5317 fold_marked_statements (0, id
.statements_to_fold
);
5318 pointer_set_destroy (id
.statements_to_fold
);
5319 fold_cond_expr_cond ();
5320 delete_unreachable_blocks_update_callgraph (&id
);
5321 if (id
.dst_node
->analyzed
)
5322 cgraph_rebuild_references ();
5323 update_ssa (TODO_update_ssa
);
5325 /* After partial cloning we need to rescale frequencies, so they are
5326 within proper range in the cloned function. */
5329 struct cgraph_edge
*e
;
5330 rebuild_frequencies ();
5332 new_version_node
->count
= ENTRY_BLOCK_PTR
->count
;
5333 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5335 basic_block bb
= gimple_bb (e
->call_stmt
);
5336 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5338 e
->count
= bb
->count
;
5340 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5342 basic_block bb
= gimple_bb (e
->call_stmt
);
5343 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5345 e
->count
= bb
->count
;
5349 free_dominance_info (CDI_DOMINATORS
);
5350 free_dominance_info (CDI_POST_DOMINATORS
);
5352 gcc_assert (!id
.debug_stmts
);
5353 VEC_free (gimple
, heap
, init_stmts
);
5355 current_function_decl
= old_current_function_decl
;
5356 gcc_assert (!current_function_decl
5357 || DECL_STRUCT_FUNCTION (current_function_decl
) == cfun
);
5361 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5362 the callee and return the inlined body on success. */
5365 maybe_inline_call_in_expr (tree exp
)
5367 tree fn
= get_callee_fndecl (exp
);
5369 /* We can only try to inline "const" functions. */
5370 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5372 struct pointer_map_t
*decl_map
= pointer_map_create ();
5373 call_expr_arg_iterator iter
;
5377 /* Remap the parameters. */
5378 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5380 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5381 *pointer_map_insert (decl_map
, param
) = arg
;
5383 memset (&id
, 0, sizeof (id
));
5385 id
.dst_fn
= current_function_decl
;
5386 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5387 id
.decl_map
= decl_map
;
5389 id
.copy_decl
= copy_decl_no_change
;
5390 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5391 id
.transform_new_cfg
= false;
5392 id
.transform_return_to_modify
= true;
5393 id
.transform_lang_insert_block
= NULL
;
5395 /* Make sure not to unshare trees behind the front-end's back
5396 since front-end specific mechanisms may rely on sharing. */
5397 id
.regimplify
= false;
5398 id
.do_not_unshare
= true;
5400 /* We're not inside any EH region. */
5403 t
= copy_tree_body (&id
);
5404 pointer_map_destroy (decl_map
);
5406 /* We can only return something suitable for use in a GENERIC
5408 if (TREE_CODE (t
) == MODIFY_EXPR
)
5409 return TREE_OPERAND (t
, 1);
5415 /* Duplicate a type, fields and all. */
5418 build_duplicate_type (tree type
)
5420 struct copy_body_data id
;
5422 memset (&id
, 0, sizeof (id
));
5423 id
.src_fn
= current_function_decl
;
5424 id
.dst_fn
= current_function_decl
;
5426 id
.decl_map
= pointer_map_create ();
5427 id
.debug_map
= NULL
;
5428 id
.copy_decl
= copy_decl_no_change
;
5430 type
= remap_type_1 (type
, &id
);
5432 pointer_map_destroy (id
.decl_map
);
5434 pointer_map_destroy (id
.debug_map
);
5436 TYPE_CANONICAL (type
) = type
;