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 (SSA_NAME_IS_DEFAULT_DEF (name
)
191 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
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 /* Remap anonymous SSA names or SSA names of anonymous decls. */
222 var
= SSA_NAME_VAR (name
);
224 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
225 && TREE_CODE (var
) == VAR_DECL
226 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
227 && DECL_ARTIFICIAL (var
)
228 && DECL_IGNORED_P (var
)
229 && !DECL_NAME (var
)))
231 struct ptr_info_def
*pi
;
232 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
), NULL
);
233 if (!var
&& SSA_NAME_IDENTIFIER (name
))
234 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
235 insert_decl_map (id
, name
, new_tree
);
236 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
237 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
238 /* At least IPA points-to info can be directly transferred. */
239 if (id
->src_cfun
->gimple_df
240 && id
->src_cfun
->gimple_df
->ipa_pta
241 && (pi
= SSA_NAME_PTR_INFO (name
))
244 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
250 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
252 new_tree
= remap_decl (var
, id
);
254 /* We might've substituted constant or another SSA_NAME for
257 Replace the SSA name representing RESULT_DECL by variable during
258 inlining: this saves us from need to introduce PHI node in a case
259 return value is just partly initialized. */
260 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
261 && (!SSA_NAME_VAR (name
)
262 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
263 || !id
->transform_return_to_modify
))
265 struct ptr_info_def
*pi
;
266 new_tree
= make_ssa_name (new_tree
, NULL
);
267 insert_decl_map (id
, name
, new_tree
);
268 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
269 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
270 /* At least IPA points-to info can be directly transferred. */
271 if (id
->src_cfun
->gimple_df
272 && id
->src_cfun
->gimple_df
->ipa_pta
273 && (pi
= SSA_NAME_PTR_INFO (name
))
276 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
279 if (SSA_NAME_IS_DEFAULT_DEF (name
))
281 /* By inlining function having uninitialized variable, we might
282 extend the lifetime (variable might get reused). This cause
283 ICE in the case we end up extending lifetime of SSA name across
284 abnormal edge, but also increase register pressure.
286 We simply initialize all uninitialized vars by 0 except
287 for case we are inlining to very first BB. We can avoid
288 this for all BBs that are not inside strongly connected
289 regions of the CFG, but this is expensive to test. */
291 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
292 && (!SSA_NAME_VAR (name
)
293 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
294 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR
, 0)->dest
295 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
297 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
299 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
301 init_stmt
= gimple_build_assign (new_tree
, zero
);
302 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
303 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
307 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
308 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
313 insert_decl_map (id
, name
, new_tree
);
317 /* Remap DECL during the copying of the BLOCK tree for the function. */
320 remap_decl (tree decl
, copy_body_data
*id
)
324 /* We only remap local variables in the current function. */
326 /* See if we have remapped this declaration. */
328 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
330 if (!n
&& processing_debug_stmt
)
332 processing_debug_stmt
= -1;
336 /* If we didn't already have an equivalent for this declaration,
340 /* Make a copy of the variable or label. */
341 tree t
= id
->copy_decl (decl
, id
);
343 /* Remember it, so that if we encounter this local entity again
344 we can reuse this copy. Do this early because remap_type may
345 need this decl for TYPE_STUB_DECL. */
346 insert_decl_map (id
, decl
, t
);
351 /* Remap types, if necessary. */
352 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
353 if (TREE_CODE (t
) == TYPE_DECL
)
354 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
356 /* Remap sizes as necessary. */
357 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
358 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
360 /* If fields, do likewise for offset and qualifier. */
361 if (TREE_CODE (t
) == FIELD_DECL
)
363 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
364 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
365 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
371 if (id
->do_not_unshare
)
374 return unshare_expr (*n
);
378 remap_type_1 (tree type
, copy_body_data
*id
)
382 /* We do need a copy. build and register it now. If this is a pointer or
383 reference type, remap the designated type and make a new pointer or
385 if (TREE_CODE (type
) == POINTER_TYPE
)
387 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
389 TYPE_REF_CAN_ALIAS_ALL (type
));
390 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
391 new_tree
= build_type_attribute_qual_variant (new_tree
,
392 TYPE_ATTRIBUTES (type
),
394 insert_decl_map (id
, type
, new_tree
);
397 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
399 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
401 TYPE_REF_CAN_ALIAS_ALL (type
));
402 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
403 new_tree
= build_type_attribute_qual_variant (new_tree
,
404 TYPE_ATTRIBUTES (type
),
406 insert_decl_map (id
, type
, new_tree
);
410 new_tree
= copy_node (type
);
412 insert_decl_map (id
, type
, new_tree
);
414 /* This is a new type, not a copy of an old type. Need to reassociate
415 variants. We can handle everything except the main variant lazily. */
416 t
= TYPE_MAIN_VARIANT (type
);
419 t
= remap_type (t
, id
);
420 TYPE_MAIN_VARIANT (new_tree
) = t
;
421 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
422 TYPE_NEXT_VARIANT (t
) = new_tree
;
426 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
427 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
430 if (TYPE_STUB_DECL (type
))
431 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
433 /* Lazily create pointer and reference types. */
434 TYPE_POINTER_TO (new_tree
) = NULL
;
435 TYPE_REFERENCE_TO (new_tree
) = NULL
;
437 switch (TREE_CODE (new_tree
))
441 case FIXED_POINT_TYPE
:
444 t
= TYPE_MIN_VALUE (new_tree
);
445 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
446 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
448 t
= TYPE_MAX_VALUE (new_tree
);
449 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
450 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
454 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
455 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
459 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
460 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
465 case QUAL_UNION_TYPE
:
469 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
471 t
= remap_decl (f
, id
);
472 DECL_CONTEXT (t
) = new_tree
;
476 TYPE_FIELDS (new_tree
) = nreverse (nf
);
482 /* Shouldn't have been thought variable sized. */
486 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
487 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
493 remap_type (tree type
, copy_body_data
*id
)
501 /* See if we have remapped this type. */
502 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
506 /* The type only needs remapping if it's variably modified. */
507 if (! variably_modified_type_p (type
, id
->src_fn
))
509 insert_decl_map (id
, type
, type
);
513 id
->remapping_type_depth
++;
514 tmp
= remap_type_1 (type
, id
);
515 id
->remapping_type_depth
--;
520 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
523 can_be_nonlocal (tree decl
, copy_body_data
*id
)
525 /* We can not duplicate function decls. */
526 if (TREE_CODE (decl
) == FUNCTION_DECL
)
529 /* Local static vars must be non-local or we get multiple declaration
531 if (TREE_CODE (decl
) == VAR_DECL
532 && !auto_var_in_fn_p (decl
, id
->src_fn
))
539 remap_decls (tree decls
, VEC(tree
,gc
) **nonlocalized_list
, copy_body_data
*id
)
542 tree new_decls
= NULL_TREE
;
544 /* Remap its variables. */
545 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
549 if (can_be_nonlocal (old_var
, id
))
551 /* We need to add this variable to the local decls as otherwise
552 nothing else will do so. */
553 if (TREE_CODE (old_var
) == VAR_DECL
554 && ! DECL_EXTERNAL (old_var
))
555 add_local_decl (cfun
, old_var
);
556 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
557 && !DECL_IGNORED_P (old_var
)
558 && nonlocalized_list
)
559 VEC_safe_push (tree
, gc
, *nonlocalized_list
, old_var
);
563 /* Remap the variable. */
564 new_var
= remap_decl (old_var
, id
);
566 /* If we didn't remap this variable, we can't mess with its
567 TREE_CHAIN. If we remapped this variable to the return slot, it's
568 already declared somewhere else, so don't declare it here. */
570 if (new_var
== id
->retvar
)
574 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
575 && !DECL_IGNORED_P (old_var
)
576 && nonlocalized_list
)
577 VEC_safe_push (tree
, gc
, *nonlocalized_list
, old_var
);
581 gcc_assert (DECL_P (new_var
));
582 DECL_CHAIN (new_var
) = new_decls
;
585 /* Also copy value-expressions. */
586 if (TREE_CODE (new_var
) == VAR_DECL
587 && DECL_HAS_VALUE_EXPR_P (new_var
))
589 tree tem
= DECL_VALUE_EXPR (new_var
);
590 bool old_regimplify
= id
->regimplify
;
591 id
->remapping_type_depth
++;
592 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
593 id
->remapping_type_depth
--;
594 id
->regimplify
= old_regimplify
;
595 SET_DECL_VALUE_EXPR (new_var
, tem
);
600 return nreverse (new_decls
);
603 /* Copy the BLOCK to contain remapped versions of the variables
604 therein. And hook the new block into the block-tree. */
607 remap_block (tree
*block
, copy_body_data
*id
)
612 /* Make the new block. */
614 new_block
= make_node (BLOCK
);
615 TREE_USED (new_block
) = TREE_USED (old_block
);
616 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
617 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
618 BLOCK_NONLOCALIZED_VARS (new_block
)
619 = VEC_copy (tree
, gc
, BLOCK_NONLOCALIZED_VARS (old_block
));
622 /* Remap its variables. */
623 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
624 &BLOCK_NONLOCALIZED_VARS (new_block
),
627 if (id
->transform_lang_insert_block
)
628 id
->transform_lang_insert_block (new_block
);
630 /* Remember the remapped block. */
631 insert_decl_map (id
, old_block
, new_block
);
634 /* Copy the whole block tree and root it in id->block. */
636 remap_blocks (tree block
, copy_body_data
*id
)
639 tree new_tree
= block
;
644 remap_block (&new_tree
, id
);
645 gcc_assert (new_tree
!= block
);
646 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
647 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
648 /* Blocks are in arbitrary order, but make things slightly prettier and do
649 not swap order when producing a copy. */
650 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
655 copy_statement_list (tree
*tp
)
657 tree_stmt_iterator oi
, ni
;
660 new_tree
= alloc_stmt_list ();
661 ni
= tsi_start (new_tree
);
662 oi
= tsi_start (*tp
);
663 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
666 for (; !tsi_end_p (oi
); tsi_next (&oi
))
668 tree stmt
= tsi_stmt (oi
);
669 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
670 /* This copy is not redundant; tsi_link_after will smash this
671 STATEMENT_LIST into the end of the one we're building, and we
672 don't want to do that with the original. */
673 copy_statement_list (&stmt
);
674 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
679 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
681 tree block
= BIND_EXPR_BLOCK (*tp
);
682 /* Copy (and replace) the statement. */
683 copy_tree_r (tp
, walk_subtrees
, NULL
);
686 remap_block (&block
, id
);
687 BIND_EXPR_BLOCK (*tp
) = block
;
690 if (BIND_EXPR_VARS (*tp
))
691 /* This will remap a lot of the same decls again, but this should be
693 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
697 /* Create a new gimple_seq by remapping all the statements in BODY
698 using the inlining information in ID. */
701 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
703 gimple_stmt_iterator si
;
704 gimple_seq new_body
= NULL
;
706 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
708 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
709 gimple_seq_add_stmt (&new_body
, new_stmt
);
716 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
717 block using the mapping information in ID. */
720 copy_gimple_bind (gimple stmt
, copy_body_data
*id
)
723 tree new_block
, new_vars
;
724 gimple_seq body
, new_body
;
726 /* Copy the statement. Note that we purposely don't use copy_stmt
727 here because we need to remap statements as we copy. */
728 body
= gimple_bind_body (stmt
);
729 new_body
= remap_gimple_seq (body
, id
);
731 new_block
= gimple_bind_block (stmt
);
733 remap_block (&new_block
, id
);
735 /* This will remap a lot of the same decls again, but this should be
737 new_vars
= gimple_bind_vars (stmt
);
739 new_vars
= remap_decls (new_vars
, NULL
, id
);
741 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
747 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
748 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
749 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
750 recursing into the children nodes of *TP. */
753 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
755 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
756 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
757 tree fn
= id
->src_fn
;
759 if (TREE_CODE (*tp
) == SSA_NAME
)
761 *tp
= remap_ssa_name (*tp
, id
);
765 else if (auto_var_in_fn_p (*tp
, fn
))
767 /* Local variables and labels need to be replaced by equivalent
768 variables. We don't want to copy static variables; there's
769 only one of those, no matter how many times we inline the
770 containing function. Similarly for globals from an outer
774 /* Remap the declaration. */
775 new_decl
= remap_decl (*tp
, id
);
776 gcc_assert (new_decl
);
777 /* Replace this variable with the copy. */
778 STRIP_TYPE_NOPS (new_decl
);
779 /* ??? The C++ frontend uses void * pointer zero to initialize
780 any other type. This confuses the middle-end type verification.
781 As cloned bodies do not go through gimplification again the fixup
782 there doesn't trigger. */
783 if (TREE_CODE (new_decl
) == INTEGER_CST
784 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
785 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
789 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
791 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
793 else if (TREE_CODE (*tp
) == LABEL_DECL
794 && (!DECL_CONTEXT (*tp
)
795 || decl_function_context (*tp
) == id
->src_fn
))
796 /* These may need to be remapped for EH handling. */
797 *tp
= remap_decl (*tp
, id
);
798 else if (TREE_CODE (*tp
) == FIELD_DECL
)
800 /* If the enclosing record type is variably_modified_type_p, the field
801 has already been remapped. Otherwise, it need not be. */
802 tree
*n
= (tree
*) pointer_map_contains (id
->decl_map
, *tp
);
807 else if (TYPE_P (*tp
))
808 /* Types may need remapping as well. */
809 *tp
= remap_type (*tp
, id
);
810 else if (CONSTANT_CLASS_P (*tp
))
812 /* If this is a constant, we have to copy the node iff the type
813 will be remapped. copy_tree_r will not copy a constant. */
814 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
816 if (new_type
== TREE_TYPE (*tp
))
819 else if (TREE_CODE (*tp
) == INTEGER_CST
)
820 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
821 TREE_INT_CST_HIGH (*tp
));
824 *tp
= copy_node (*tp
);
825 TREE_TYPE (*tp
) = new_type
;
830 /* Otherwise, just copy the node. Note that copy_tree_r already
831 knows not to copy VAR_DECLs, etc., so this is safe. */
833 /* We should never have TREE_BLOCK set on non-statements. */
835 gcc_assert (!TREE_BLOCK (*tp
));
837 if (TREE_CODE (*tp
) == MEM_REF
)
839 tree ptr
= TREE_OPERAND (*tp
, 0);
840 tree type
= remap_type (TREE_TYPE (*tp
), id
);
843 /* We need to re-canonicalize MEM_REFs from inline substitutions
844 that can happen when a pointer argument is an ADDR_EXPR.
845 Recurse here manually to allow that. */
846 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
847 *tp
= fold_build2 (MEM_REF
, type
,
848 ptr
, TREE_OPERAND (*tp
, 1));
849 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
850 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
851 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
852 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
857 /* Here is the "usual case". Copy this tree node, and then
858 tweak some special cases. */
859 copy_tree_r (tp
, walk_subtrees
, NULL
);
861 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
862 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
864 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
866 /* The copied TARGET_EXPR has never been expanded, even if the
867 original node was expanded already. */
868 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
869 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
871 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
873 /* Variable substitution need not be simple. In particular,
874 the MEM_REF substitution above. Make sure that
875 TREE_CONSTANT and friends are up-to-date. But make sure
876 to not improperly set TREE_BLOCK on some sub-expressions. */
877 int invariant
= is_gimple_min_invariant (*tp
);
878 tree block
= id
->block
;
879 id
->block
= NULL_TREE
;
880 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
882 recompute_tree_invariant_for_addr_expr (*tp
);
884 /* If this used to be invariant, but is not any longer,
885 then regimplification is probably needed. */
886 if (invariant
&& !is_gimple_min_invariant (*tp
))
887 id
->regimplify
= true;
893 /* Keep iterating. */
898 /* Called from copy_body_id via walk_tree. DATA is really a
899 `copy_body_data *'. */
902 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
904 copy_body_data
*id
= (copy_body_data
*) data
;
905 tree fn
= id
->src_fn
;
908 /* Begin by recognizing trees that we'll completely rewrite for the
909 inlining context. Our output for these trees is completely
910 different from out input (e.g. RETURN_EXPR is deleted, and morphs
911 into an edge). Further down, we'll handle trees that get
912 duplicated and/or tweaked. */
914 /* When requested, RETURN_EXPRs should be transformed to just the
915 contained MODIFY_EXPR. The branch semantics of the return will
916 be handled elsewhere by manipulating the CFG rather than a statement. */
917 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
919 tree assignment
= TREE_OPERAND (*tp
, 0);
921 /* If we're returning something, just turn that into an
922 assignment into the equivalent of the original RESULT_DECL.
923 If the "assignment" is just the result decl, the result
924 decl has already been set (e.g. a recent "foo (&result_decl,
925 ...)"); just toss the entire RETURN_EXPR. */
926 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
928 /* Replace the RETURN_EXPR with (a copy of) the
929 MODIFY_EXPR hanging underneath. */
930 *tp
= copy_node (assignment
);
932 else /* Else the RETURN_EXPR returns no value. */
935 return (tree
) (void *)1;
938 else if (TREE_CODE (*tp
) == SSA_NAME
)
940 *tp
= remap_ssa_name (*tp
, id
);
945 /* Local variables and labels need to be replaced by equivalent
946 variables. We don't want to copy static variables; there's only
947 one of those, no matter how many times we inline the containing
948 function. Similarly for globals from an outer function. */
949 else if (auto_var_in_fn_p (*tp
, fn
))
953 /* Remap the declaration. */
954 new_decl
= remap_decl (*tp
, id
);
955 gcc_assert (new_decl
);
956 /* Replace this variable with the copy. */
957 STRIP_TYPE_NOPS (new_decl
);
961 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
962 copy_statement_list (tp
);
963 else if (TREE_CODE (*tp
) == SAVE_EXPR
964 || TREE_CODE (*tp
) == TARGET_EXPR
)
965 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
966 else if (TREE_CODE (*tp
) == LABEL_DECL
967 && (! DECL_CONTEXT (*tp
)
968 || decl_function_context (*tp
) == id
->src_fn
))
969 /* These may need to be remapped for EH handling. */
970 *tp
= remap_decl (*tp
, id
);
971 else if (TREE_CODE (*tp
) == BIND_EXPR
)
972 copy_bind_expr (tp
, walk_subtrees
, id
);
973 /* Types may need remapping as well. */
974 else if (TYPE_P (*tp
))
975 *tp
= remap_type (*tp
, id
);
977 /* If this is a constant, we have to copy the node iff the type will be
978 remapped. copy_tree_r will not copy a constant. */
979 else if (CONSTANT_CLASS_P (*tp
))
981 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
983 if (new_type
== TREE_TYPE (*tp
))
986 else if (TREE_CODE (*tp
) == INTEGER_CST
)
987 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
988 TREE_INT_CST_HIGH (*tp
));
991 *tp
= copy_node (*tp
);
992 TREE_TYPE (*tp
) = new_type
;
996 /* Otherwise, just copy the node. Note that copy_tree_r already
997 knows not to copy VAR_DECLs, etc., so this is safe. */
1000 /* Here we handle trees that are not completely rewritten.
1001 First we detect some inlining-induced bogosities for
1003 if (TREE_CODE (*tp
) == MODIFY_EXPR
1004 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1005 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1007 /* Some assignments VAR = VAR; don't generate any rtl code
1008 and thus don't count as variable modification. Avoid
1009 keeping bogosities like 0 = 0. */
1010 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1013 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1017 STRIP_TYPE_NOPS (value
);
1018 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1020 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1021 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1025 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1027 /* Get rid of *& from inline substitutions that can happen when a
1028 pointer argument is an ADDR_EXPR. */
1029 tree decl
= TREE_OPERAND (*tp
, 0);
1032 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1037 /* If we happen to get an ADDR_EXPR in n->value, strip
1038 it manually here as we'll eventually get ADDR_EXPRs
1039 which lie about their types pointed to. In this case
1040 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1041 but we absolutely rely on that. As fold_indirect_ref
1042 does other useful transformations, try that first, though. */
1043 tree type
= TREE_TYPE (TREE_TYPE (*n
));
1044 if (id
->do_not_unshare
)
1047 new_tree
= unshare_expr (*n
);
1049 *tp
= gimple_fold_indirect_ref (new_tree
);
1052 if (TREE_CODE (new_tree
) == ADDR_EXPR
)
1054 *tp
= fold_indirect_ref_1 (EXPR_LOCATION (new_tree
),
1056 /* ??? We should either assert here or build
1057 a VIEW_CONVERT_EXPR instead of blindly leaking
1058 incompatible types to our IL. */
1060 *tp
= TREE_OPERAND (new_tree
, 0);
1064 *tp
= build1 (INDIRECT_REF
, type
, new_tree
);
1065 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1066 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1067 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1068 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
1075 else if (TREE_CODE (*tp
) == MEM_REF
)
1077 /* We need to re-canonicalize MEM_REFs from inline substitutions
1078 that can happen when a pointer argument is an ADDR_EXPR. */
1079 tree decl
= TREE_OPERAND (*tp
, 0);
1082 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1086 *tp
= fold_build2 (MEM_REF
, TREE_TYPE (*tp
),
1087 unshare_expr (*n
), TREE_OPERAND (*tp
, 1));
1088 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1089 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1095 /* Here is the "usual case". Copy this tree node, and then
1096 tweak some special cases. */
1097 copy_tree_r (tp
, walk_subtrees
, NULL
);
1099 /* If EXPR has block defined, map it to newly constructed block.
1100 When inlining we want EXPRs without block appear in the block
1101 of function call if we are not remapping a type. */
1104 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1105 if (TREE_BLOCK (*tp
))
1108 n
= (tree
*) pointer_map_contains (id
->decl_map
,
1110 gcc_assert (n
|| id
->remapping_type_depth
!= 0);
1114 TREE_BLOCK (*tp
) = new_block
;
1117 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1118 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1120 /* The copied TARGET_EXPR has never been expanded, even if the
1121 original node was expanded already. */
1122 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1124 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1125 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1128 /* Variable substitution need not be simple. In particular, the
1129 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1130 and friends are up-to-date. */
1131 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1133 int invariant
= is_gimple_min_invariant (*tp
);
1134 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1136 /* Handle the case where we substituted an INDIRECT_REF
1137 into the operand of the ADDR_EXPR. */
1138 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1139 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1141 recompute_tree_invariant_for_addr_expr (*tp
);
1143 /* If this used to be invariant, but is not any longer,
1144 then regimplification is probably needed. */
1145 if (invariant
&& !is_gimple_min_invariant (*tp
))
1146 id
->regimplify
= true;
1152 /* Keep iterating. */
1156 /* Helper for remap_gimple_stmt. Given an EH region number for the
1157 source function, map that to the duplicate EH region number in
1158 the destination function. */
1161 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1163 eh_region old_r
, new_r
;
1166 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1167 slot
= pointer_map_contains (id
->eh_map
, old_r
);
1168 new_r
= (eh_region
) *slot
;
1170 return new_r
->index
;
1173 /* Similar, but operate on INTEGER_CSTs. */
1176 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1180 old_nr
= tree_low_cst (old_t_nr
, 0);
1181 new_nr
= remap_eh_region_nr (old_nr
, id
);
1183 return build_int_cst (integer_type_node
, new_nr
);
1186 /* Helper for copy_bb. Remap statement STMT using the inlining
1187 information in ID. Return the new statement copy. */
1190 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1193 struct walk_stmt_info wi
;
1195 bool skip_first
= false;
1197 /* Begin by recognizing trees that we'll completely rewrite for the
1198 inlining context. Our output for these trees is completely
1199 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1200 into an edge). Further down, we'll handle trees that get
1201 duplicated and/or tweaked. */
1203 /* When requested, GIMPLE_RETURNs should be transformed to just the
1204 contained GIMPLE_ASSIGN. The branch semantics of the return will
1205 be handled elsewhere by manipulating the CFG rather than the
1207 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1209 tree retval
= gimple_return_retval (stmt
);
1211 /* If we're returning something, just turn that into an
1212 assignment into the equivalent of the original RESULT_DECL.
1213 If RETVAL is just the result decl, the result decl has
1214 already been set (e.g. a recent "foo (&result_decl, ...)");
1215 just toss the entire GIMPLE_RETURN. */
1217 && (TREE_CODE (retval
) != RESULT_DECL
1218 && (TREE_CODE (retval
) != SSA_NAME
1219 || ! SSA_NAME_VAR (retval
)
1220 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1222 copy
= gimple_build_assign (id
->retvar
, retval
);
1223 /* id->retvar is already substituted. Skip it on later remapping. */
1227 return gimple_build_nop ();
1229 else if (gimple_has_substatements (stmt
))
1233 /* When cloning bodies from the C++ front end, we will be handed bodies
1234 in High GIMPLE form. Handle here all the High GIMPLE statements that
1235 have embedded statements. */
1236 switch (gimple_code (stmt
))
1239 copy
= copy_gimple_bind (stmt
, id
);
1243 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1244 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1247 case GIMPLE_EH_FILTER
:
1248 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1249 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1253 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1254 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1255 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1258 case GIMPLE_WITH_CLEANUP_EXPR
:
1259 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1260 copy
= gimple_build_wce (s1
);
1263 case GIMPLE_OMP_PARALLEL
:
1264 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1265 copy
= gimple_build_omp_parallel
1267 gimple_omp_parallel_clauses (stmt
),
1268 gimple_omp_parallel_child_fn (stmt
),
1269 gimple_omp_parallel_data_arg (stmt
));
1272 case GIMPLE_OMP_TASK
:
1273 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1274 copy
= gimple_build_omp_task
1276 gimple_omp_task_clauses (stmt
),
1277 gimple_omp_task_child_fn (stmt
),
1278 gimple_omp_task_data_arg (stmt
),
1279 gimple_omp_task_copy_fn (stmt
),
1280 gimple_omp_task_arg_size (stmt
),
1281 gimple_omp_task_arg_align (stmt
));
1284 case GIMPLE_OMP_FOR
:
1285 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1286 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1287 copy
= gimple_build_omp_for (s1
, gimple_omp_for_clauses (stmt
),
1288 gimple_omp_for_collapse (stmt
), s2
);
1291 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1293 gimple_omp_for_set_index (copy
, i
,
1294 gimple_omp_for_index (stmt
, i
));
1295 gimple_omp_for_set_initial (copy
, i
,
1296 gimple_omp_for_initial (stmt
, i
));
1297 gimple_omp_for_set_final (copy
, i
,
1298 gimple_omp_for_final (stmt
, i
));
1299 gimple_omp_for_set_incr (copy
, i
,
1300 gimple_omp_for_incr (stmt
, i
));
1301 gimple_omp_for_set_cond (copy
, i
,
1302 gimple_omp_for_cond (stmt
, i
));
1307 case GIMPLE_OMP_MASTER
:
1308 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1309 copy
= gimple_build_omp_master (s1
);
1312 case GIMPLE_OMP_ORDERED
:
1313 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1314 copy
= gimple_build_omp_ordered (s1
);
1317 case GIMPLE_OMP_SECTION
:
1318 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1319 copy
= gimple_build_omp_section (s1
);
1322 case GIMPLE_OMP_SECTIONS
:
1323 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1324 copy
= gimple_build_omp_sections
1325 (s1
, gimple_omp_sections_clauses (stmt
));
1328 case GIMPLE_OMP_SINGLE
:
1329 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1330 copy
= gimple_build_omp_single
1331 (s1
, gimple_omp_single_clauses (stmt
));
1334 case GIMPLE_OMP_CRITICAL
:
1335 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1337 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1340 case GIMPLE_TRANSACTION
:
1341 s1
= remap_gimple_seq (gimple_transaction_body (stmt
), id
);
1342 copy
= gimple_build_transaction (s1
, gimple_transaction_label (stmt
));
1343 gimple_transaction_set_subcode (copy
, gimple_transaction_subcode (stmt
));
1352 if (gimple_assign_copy_p (stmt
)
1353 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1354 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1356 /* Here we handle statements that are not completely rewritten.
1357 First we detect some inlining-induced bogosities for
1360 /* Some assignments VAR = VAR; don't generate any rtl code
1361 and thus don't count as variable modification. Avoid
1362 keeping bogosities like 0 = 0. */
1363 tree decl
= gimple_assign_lhs (stmt
), value
;
1366 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1370 STRIP_TYPE_NOPS (value
);
1371 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1372 return gimple_build_nop ();
1376 if (gimple_debug_bind_p (stmt
))
1378 copy
= gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1379 gimple_debug_bind_get_value (stmt
),
1381 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, copy
);
1384 if (gimple_debug_source_bind_p (stmt
))
1386 copy
= gimple_build_debug_source_bind
1387 (gimple_debug_source_bind_get_var (stmt
),
1388 gimple_debug_source_bind_get_value (stmt
), stmt
);
1389 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, copy
);
1393 /* Create a new deep copy of the statement. */
1394 copy
= gimple_copy (stmt
);
1396 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1397 RESX and EH_DISPATCH. */
1399 switch (gimple_code (copy
))
1403 tree r
, fndecl
= gimple_call_fndecl (copy
);
1404 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1405 switch (DECL_FUNCTION_CODE (fndecl
))
1407 case BUILT_IN_EH_COPY_VALUES
:
1408 r
= gimple_call_arg (copy
, 1);
1409 r
= remap_eh_region_tree_nr (r
, id
);
1410 gimple_call_set_arg (copy
, 1, r
);
1413 case BUILT_IN_EH_POINTER
:
1414 case BUILT_IN_EH_FILTER
:
1415 r
= gimple_call_arg (copy
, 0);
1416 r
= remap_eh_region_tree_nr (r
, id
);
1417 gimple_call_set_arg (copy
, 0, r
);
1424 /* Reset alias info if we didn't apply measures to
1425 keep it valid over inlining by setting DECL_PT_UID. */
1426 if (!id
->src_cfun
->gimple_df
1427 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1428 gimple_call_reset_alias_info (copy
);
1434 int r
= gimple_resx_region (copy
);
1435 r
= remap_eh_region_nr (r
, id
);
1436 gimple_resx_set_region (copy
, r
);
1440 case GIMPLE_EH_DISPATCH
:
1442 int r
= gimple_eh_dispatch_region (copy
);
1443 r
= remap_eh_region_nr (r
, id
);
1444 gimple_eh_dispatch_set_region (copy
, r
);
1453 /* If STMT has a block defined, map it to the newly constructed
1454 block. When inlining we want statements without a block to
1455 appear in the block of the function call. */
1456 new_block
= id
->block
;
1457 if (gimple_block (copy
))
1460 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1465 gimple_set_block (copy
, new_block
);
1467 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1470 /* Remap all the operands in COPY. */
1471 memset (&wi
, 0, sizeof (wi
));
1474 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1476 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1478 /* Clear the copied virtual operands. We are not remapping them here
1479 but are going to recreate them from scratch. */
1480 if (gimple_has_mem_ops (copy
))
1482 gimple_set_vdef (copy
, NULL_TREE
);
1483 gimple_set_vuse (copy
, NULL_TREE
);
1490 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1494 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1495 gcov_type count_scale
)
1497 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1498 basic_block copy_basic_block
;
1503 /* Search for previous copied basic block. */
1506 prev
= prev
->prev_bb
;
1508 /* create_basic_block() will append every new block to
1509 basic_block_info automatically. */
1510 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1511 (basic_block
) prev
->aux
);
1512 copy_basic_block
->count
= bb
->count
* count_scale
/ REG_BR_PROB_BASE
;
1514 /* We are going to rebuild frequencies from scratch. These values
1515 have just small importance to drive canonicalize_loop_headers. */
1516 freq
= ((gcov_type
)bb
->frequency
* frequency_scale
/ REG_BR_PROB_BASE
);
1518 /* We recompute frequencies after inlining, so this is quite safe. */
1519 if (freq
> BB_FREQ_MAX
)
1521 copy_basic_block
->frequency
= freq
;
1523 copy_gsi
= gsi_start_bb (copy_basic_block
);
1525 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1527 gimple stmt
= gsi_stmt (gsi
);
1528 gimple orig_stmt
= stmt
;
1530 id
->regimplify
= false;
1531 stmt
= remap_gimple_stmt (stmt
, id
);
1532 if (gimple_nop_p (stmt
))
1535 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1538 /* With return slot optimization we can end up with
1539 non-gimple (foo *)&this->m, fix that here. */
1540 if (is_gimple_assign (stmt
)
1541 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1542 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1545 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1546 gimple_assign_rhs1 (stmt
),
1548 GSI_CONTINUE_LINKING
);
1549 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1550 id
->regimplify
= false;
1553 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1556 gimple_regimplify_operands (stmt
, &seq_gsi
);
1558 /* If copy_basic_block has been empty at the start of this iteration,
1559 call gsi_start_bb again to get at the newly added statements. */
1560 if (gsi_end_p (copy_gsi
))
1561 copy_gsi
= gsi_start_bb (copy_basic_block
);
1563 gsi_next (©_gsi
);
1565 /* Process the new statement. The call to gimple_regimplify_operands
1566 possibly turned the statement into multiple statements, we
1567 need to process all of them. */
1572 stmt
= gsi_stmt (copy_gsi
);
1573 if (is_gimple_call (stmt
)
1574 && gimple_call_va_arg_pack_p (stmt
)
1577 /* __builtin_va_arg_pack () should be replaced by
1578 all arguments corresponding to ... in the caller. */
1581 VEC(tree
, heap
) *argarray
;
1582 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1585 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1588 /* Create the new array of arguments. */
1589 n
= nargs
+ gimple_call_num_args (stmt
);
1590 argarray
= VEC_alloc (tree
, heap
, n
);
1591 VEC_safe_grow (tree
, heap
, argarray
, n
);
1593 /* Copy all the arguments before '...' */
1594 memcpy (VEC_address (tree
, argarray
),
1595 gimple_call_arg_ptr (stmt
, 0),
1596 gimple_call_num_args (stmt
) * sizeof (tree
));
1598 /* Append the arguments passed in '...' */
1599 memcpy (VEC_address(tree
, argarray
) + gimple_call_num_args (stmt
),
1600 gimple_call_arg_ptr (id
->gimple_call
, 0)
1601 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1602 nargs
* sizeof (tree
));
1604 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1607 VEC_free (tree
, heap
, argarray
);
1609 /* Copy all GIMPLE_CALL flags, location and block, except
1610 GF_CALL_VA_ARG_PACK. */
1611 gimple_call_copy_flags (new_call
, stmt
);
1612 gimple_call_set_va_arg_pack (new_call
, false);
1613 gimple_set_location (new_call
, gimple_location (stmt
));
1614 gimple_set_block (new_call
, gimple_block (stmt
));
1615 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1617 gsi_replace (©_gsi
, new_call
, false);
1620 else if (is_gimple_call (stmt
)
1622 && (decl
= gimple_call_fndecl (stmt
))
1623 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1624 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1626 /* __builtin_va_arg_pack_len () should be replaced by
1627 the number of anonymous arguments. */
1628 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1632 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1635 count
= build_int_cst (integer_type_node
, nargs
);
1636 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1637 gsi_replace (©_gsi
, new_stmt
, false);
1641 /* Statements produced by inlining can be unfolded, especially
1642 when we constant propagated some operands. We can't fold
1643 them right now for two reasons:
1644 1) folding require SSA_NAME_DEF_STMTs to be correct
1645 2) we can't change function calls to builtins.
1646 So we just mark statement for later folding. We mark
1647 all new statements, instead just statements that has changed
1648 by some nontrivial substitution so even statements made
1649 foldable indirectly are updated. If this turns out to be
1650 expensive, copy_body can be told to watch for nontrivial
1652 if (id
->statements_to_fold
)
1653 pointer_set_insert (id
->statements_to_fold
, stmt
);
1655 /* We're duplicating a CALL_EXPR. Find any corresponding
1656 callgraph edges and update or duplicate them. */
1657 if (is_gimple_call (stmt
))
1659 struct cgraph_edge
*edge
;
1662 switch (id
->transform_call_graph_edges
)
1664 case CB_CGE_DUPLICATE
:
1665 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1668 int edge_freq
= edge
->frequency
;
1669 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1671 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1673 /* We could also just rescale the frequency, but
1674 doing so would introduce roundoff errors and make
1675 verifier unhappy. */
1677 = compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1680 && profile_status_for_function (cfun
) != PROFILE_ABSENT
1681 && (edge_freq
> edge
->frequency
+ 10
1682 || edge_freq
< edge
->frequency
- 10))
1684 fprintf (dump_file
, "Edge frequency estimated by "
1685 "cgraph %i diverge from inliner's estimate %i\n",
1689 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1692 copy_basic_block
->frequency
);
1694 stmt
= cgraph_redirect_edge_call_stmt_to_callee (edge
);
1698 case CB_CGE_MOVE_CLONES
:
1699 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1701 edge
= cgraph_edge (id
->dst_node
, stmt
);
1705 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1707 cgraph_set_call_stmt (edge
, stmt
);
1714 /* Constant propagation on argument done during inlining
1715 may create new direct call. Produce an edge for it. */
1717 || (edge
->indirect_inlining_edge
1718 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1719 && id
->dst_node
->analyzed
1720 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1722 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1724 /* We have missing edge in the callgraph. This can happen
1725 when previous inlining turned an indirect call into a
1726 direct call by constant propagating arguments or we are
1727 producing dead clone (for further cloning). In all
1728 other cases we hit a bug (incorrect node sharing is the
1729 most common reason for missing edges). */
1730 gcc_assert (!dest
->analyzed
1731 || dest
->symbol
.address_taken
1732 || !id
->src_node
->analyzed
1733 || !id
->dst_node
->analyzed
);
1734 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1735 cgraph_create_edge_including_clones
1736 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1737 compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1739 CIF_ORIGINALLY_INDIRECT_CALL
);
1741 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1743 compute_call_stmt_bb_frequency
1744 (id
->dst_node
->symbol
.decl
,
1745 copy_basic_block
))->inline_failed
1746 = CIF_ORIGINALLY_INDIRECT_CALL
;
1749 fprintf (dump_file
, "Created new direct edge to %s\n",
1750 cgraph_node_name (dest
));
1754 flags
= gimple_call_flags (stmt
);
1755 if (flags
& ECF_MAY_BE_ALLOCA
)
1756 cfun
->calls_alloca
= true;
1757 if (flags
& ECF_RETURNS_TWICE
)
1758 cfun
->calls_setjmp
= true;
1761 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1762 id
->eh_map
, id
->eh_lp_nr
);
1764 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1769 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1770 if (TREE_CODE (def
) == SSA_NAME
)
1771 SSA_NAME_DEF_STMT (def
) = stmt
;
1774 gsi_next (©_gsi
);
1776 while (!gsi_end_p (copy_gsi
));
1778 copy_gsi
= gsi_last_bb (copy_basic_block
);
1781 return copy_basic_block
;
1784 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1785 form is quite easy, since dominator relationship for old basic blocks does
1788 There is however exception where inlining might change dominator relation
1789 across EH edges from basic block within inlined functions destinating
1790 to landing pads in function we inline into.
1792 The function fills in PHI_RESULTs of such PHI nodes if they refer
1793 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1794 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1795 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1796 set, and this means that there will be no overlapping live ranges
1797 for the underlying symbol.
1799 This might change in future if we allow redirecting of EH edges and
1800 we might want to change way build CFG pre-inlining to include
1801 all the possible edges then. */
1803 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1804 bool can_throw
, bool nonlocal_goto
)
1809 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1811 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1814 gimple_stmt_iterator si
;
1817 gcc_assert (e
->flags
& EDGE_EH
);
1820 gcc_assert (!(e
->flags
& EDGE_EH
));
1822 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1826 phi
= gsi_stmt (si
);
1828 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1829 gcc_assert (!e
->dest
->aux
);
1831 gcc_assert ((e
->flags
& EDGE_EH
)
1832 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1834 if (virtual_operand_p (PHI_RESULT (phi
)))
1836 mark_virtual_operands_for_renaming (cfun
);
1840 re
= find_edge (ret_bb
, e
->dest
);
1842 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1843 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1845 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1846 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1852 /* Copy edges from BB into its copy constructed earlier, scale profile
1853 accordingly. Edges will be taken care of later. Assume aux
1854 pointers to point to the copies of each BB. Return true if any
1855 debug stmts are left after a statement that must end the basic block. */
1858 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
)
1860 basic_block new_bb
= (basic_block
) bb
->aux
;
1863 gimple_stmt_iterator si
;
1865 bool need_debug_cleanup
= false;
1867 /* Use the indices from the original blocks to create edges for the
1869 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1870 if (!(old_edge
->flags
& EDGE_EH
))
1874 flags
= old_edge
->flags
;
1876 /* Return edges do get a FALLTHRU flag when the get inlined. */
1877 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1878 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR
)
1879 flags
|= EDGE_FALLTHRU
;
1880 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1881 new_edge
->count
= old_edge
->count
* count_scale
/ REG_BR_PROB_BASE
;
1882 new_edge
->probability
= old_edge
->probability
;
1885 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1888 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
1891 bool can_throw
, nonlocal_goto
;
1893 copy_stmt
= gsi_stmt (si
);
1894 if (!is_gimple_debug (copy_stmt
))
1895 update_stmt (copy_stmt
);
1897 /* Do this before the possible split_block. */
1900 /* If this tree could throw an exception, there are two
1901 cases where we need to add abnormal edge(s): the
1902 tree wasn't in a region and there is a "current
1903 region" in the caller; or the original tree had
1904 EH edges. In both cases split the block after the tree,
1905 and add abnormal edge(s) as needed; we need both
1906 those from the callee and the caller.
1907 We check whether the copy can throw, because the const
1908 propagation can change an INDIRECT_REF which throws
1909 into a COMPONENT_REF which doesn't. If the copy
1910 can throw, the original could also throw. */
1911 can_throw
= stmt_can_throw_internal (copy_stmt
);
1912 nonlocal_goto
= stmt_can_make_abnormal_goto (copy_stmt
);
1914 if (can_throw
|| nonlocal_goto
)
1916 if (!gsi_end_p (si
))
1918 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
1921 need_debug_cleanup
= true;
1923 if (!gsi_end_p (si
))
1924 /* Note that bb's predecessor edges aren't necessarily
1925 right at this point; split_block doesn't care. */
1927 edge e
= split_block (new_bb
, copy_stmt
);
1930 new_bb
->aux
= e
->src
->aux
;
1931 si
= gsi_start_bb (new_bb
);
1935 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
1936 make_eh_dispatch_edges (copy_stmt
);
1938 make_eh_edges (copy_stmt
);
1941 make_abnormal_goto_edges (gimple_bb (copy_stmt
), true);
1943 if ((can_throw
|| nonlocal_goto
)
1944 && gimple_in_ssa_p (cfun
))
1945 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
1946 can_throw
, nonlocal_goto
);
1948 return need_debug_cleanup
;
1951 /* Copy the PHIs. All blocks and edges are copied, some blocks
1952 was possibly split and new outgoing EH edges inserted.
1953 BB points to the block of original function and AUX pointers links
1954 the original and newly copied blocks. */
1957 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
1959 basic_block
const new_bb
= (basic_block
) bb
->aux
;
1962 gimple_stmt_iterator si
;
1964 bool inserted
= false;
1966 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
1971 phi
= gsi_stmt (si
);
1972 res
= PHI_RESULT (phi
);
1974 if (!virtual_operand_p (res
))
1976 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
1977 new_phi
= create_phi_node (new_res
, new_bb
);
1978 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
1980 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
1983 tree block
= id
->block
;
1986 /* When doing partial cloning, we allow PHIs on the entry block
1987 as long as all the arguments are the same. Find any input
1988 edge to see argument to copy. */
1990 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
1991 if (!old_edge
->src
->aux
)
1994 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
1996 id
->block
= NULL_TREE
;
1997 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
1999 gcc_assert (new_arg
);
2000 /* With return slot optimization we can end up with
2001 non-gimple (foo *)&this->m, fix that here. */
2002 if (TREE_CODE (new_arg
) != SSA_NAME
2003 && TREE_CODE (new_arg
) != FUNCTION_DECL
2004 && !is_gimple_val (new_arg
))
2006 gimple_seq stmts
= NULL
;
2007 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2008 gsi_insert_seq_on_edge (new_edge
, stmts
);
2011 add_phi_arg (new_phi
, new_arg
, new_edge
,
2012 gimple_phi_arg_location_from_edge (phi
, old_edge
));
2017 /* Commit the delayed edge insertions. */
2019 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2020 gsi_commit_one_edge_insert (new_edge
, NULL
);
2024 /* Wrapper for remap_decl so it can be used as a callback. */
2027 remap_decl_1 (tree decl
, void *data
)
2029 return remap_decl (decl
, (copy_body_data
*) data
);
2032 /* Build struct function and associated datastructures for the new clone
2033 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
2036 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2038 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2039 gcov_type count_scale
;
2041 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2042 count_scale
= (REG_BR_PROB_BASE
* count
2043 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2045 count_scale
= REG_BR_PROB_BASE
;
2047 /* Register specific tree functions. */
2048 gimple_register_cfg_hooks ();
2050 /* Get clean struct function. */
2051 push_struct_function (new_fndecl
);
2053 /* We will rebuild these, so just sanity check that they are empty. */
2054 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2055 gcc_assert (cfun
->local_decls
== NULL
);
2056 gcc_assert (cfun
->cfg
== NULL
);
2057 gcc_assert (cfun
->decl
== new_fndecl
);
2059 /* Copy items we preserve during cloning. */
2060 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2061 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2062 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2063 cfun
->curr_properties
= src_cfun
->curr_properties
& ~PROP_loops
;
2064 cfun
->last_verified
= src_cfun
->last_verified
;
2065 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2066 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2067 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2068 cfun
->stdarg
= src_cfun
->stdarg
;
2069 cfun
->after_inlining
= src_cfun
->after_inlining
;
2070 cfun
->can_throw_non_call_exceptions
2071 = src_cfun
->can_throw_non_call_exceptions
;
2072 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2073 cfun
->returns_struct
= src_cfun
->returns_struct
;
2074 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2076 init_empty_tree_cfg ();
2078 profile_status_for_function (cfun
) = profile_status_for_function (src_cfun
);
2079 ENTRY_BLOCK_PTR
->count
=
2080 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2082 ENTRY_BLOCK_PTR
->frequency
2083 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2084 EXIT_BLOCK_PTR
->count
=
2085 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2087 EXIT_BLOCK_PTR
->frequency
=
2088 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2090 init_eh_for_function ();
2092 if (src_cfun
->gimple_df
)
2094 init_tree_ssa (cfun
);
2095 cfun
->gimple_df
->in_ssa_p
= true;
2096 init_ssa_operands (cfun
);
2101 /* Helper function for copy_cfg_body. Move debug stmts from the end
2102 of NEW_BB to the beginning of successor basic blocks when needed. If the
2103 successor has multiple predecessors, reset them, otherwise keep
2107 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2111 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2114 || gsi_one_before_end_p (si
)
2115 || !(stmt_can_throw_internal (gsi_stmt (si
))
2116 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2119 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2121 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2122 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2123 while (is_gimple_debug (gsi_stmt (ssi
)))
2125 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2129 /* For the last edge move the debug stmts instead of copying
2131 if (ei_one_before_end_p (ei
))
2135 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2136 gimple_debug_bind_reset_value (stmt
);
2137 gsi_remove (&si
, false);
2138 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2142 if (gimple_debug_bind_p (stmt
))
2144 var
= gimple_debug_bind_get_var (stmt
);
2145 if (single_pred_p (e
->dest
))
2147 value
= gimple_debug_bind_get_value (stmt
);
2148 value
= unshare_expr (value
);
2152 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2154 else if (gimple_debug_source_bind_p (stmt
))
2156 var
= gimple_debug_source_bind_get_var (stmt
);
2157 value
= gimple_debug_source_bind_get_value (stmt
);
2158 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2162 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2163 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, new_stmt
);
2169 /* Make a copy of the body of FN so that it can be inserted inline in
2170 another function. Walks FN via CFG, returns new fndecl. */
2173 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2174 basic_block entry_block_map
, basic_block exit_block_map
,
2175 bitmap blocks_to_copy
, basic_block new_entry
)
2177 tree callee_fndecl
= id
->src_fn
;
2178 /* Original cfun for the callee, doesn't change. */
2179 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2180 struct function
*cfun_to_copy
;
2182 tree new_fndecl
= NULL
;
2183 bool need_debug_cleanup
= false;
2184 gcov_type count_scale
;
2186 int incoming_frequency
= 0;
2187 gcov_type incoming_count
= 0;
2189 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2190 count_scale
= (REG_BR_PROB_BASE
* count
2191 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2193 count_scale
= REG_BR_PROB_BASE
;
2195 /* Register specific tree functions. */
2196 gimple_register_cfg_hooks ();
2198 /* If we are inlining just region of the function, make sure to connect new entry
2199 to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute
2200 frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and
2201 probabilities of edges incoming from nonduplicated region. */
2207 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2210 incoming_frequency
+= EDGE_FREQUENCY (e
);
2211 incoming_count
+= e
->count
;
2213 incoming_count
= incoming_count
* count_scale
/ REG_BR_PROB_BASE
;
2215 = incoming_frequency
* frequency_scale
/ REG_BR_PROB_BASE
;
2216 ENTRY_BLOCK_PTR
->count
= incoming_count
;
2217 ENTRY_BLOCK_PTR
->frequency
= incoming_frequency
;
2220 /* Must have a CFG here at this point. */
2221 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2222 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2224 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2226 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= entry_block_map
;
2227 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= exit_block_map
;
2228 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2229 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2231 /* Duplicate any exception-handling regions. */
2233 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2236 /* Use aux pointers to map the original blocks to copy. */
2237 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2238 if (!blocks_to_copy
|| bitmap_bit_p (blocks_to_copy
, bb
->index
))
2240 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2245 last
= last_basic_block
;
2247 /* Now that we've duplicated the blocks, duplicate their edges. */
2248 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2250 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2251 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
);
2255 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2256 e
->probability
= REG_BR_PROB_BASE
;
2257 e
->count
= incoming_count
;
2260 if (gimple_in_ssa_p (cfun
))
2261 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2263 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2264 copy_phis_for_bb (bb
, id
);
2266 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2269 if (need_debug_cleanup
2270 && bb
->index
!= ENTRY_BLOCK
2271 && bb
->index
!= EXIT_BLOCK
)
2272 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2273 ((basic_block
)bb
->aux
)->aux
= NULL
;
2277 /* Zero out AUX fields of newly created block during EH edge
2279 for (; last
< last_basic_block
; last
++)
2281 if (need_debug_cleanup
)
2282 maybe_move_debug_stmts_to_successors (id
, BASIC_BLOCK (last
));
2283 BASIC_BLOCK (last
)->aux
= NULL
;
2285 entry_block_map
->aux
= NULL
;
2286 exit_block_map
->aux
= NULL
;
2290 pointer_map_destroy (id
->eh_map
);
2297 /* Copy the debug STMT using ID. We deal with these statements in a
2298 special way: if any variable in their VALUE expression wasn't
2299 remapped yet, we won't remap it, because that would get decl uids
2300 out of sync, causing codegen differences between -g and -g0. If
2301 this arises, we drop the VALUE expression altogether. */
2304 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2307 struct walk_stmt_info wi
;
2310 if (gimple_block (stmt
))
2312 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2316 gimple_set_block (stmt
, t
);
2318 /* Remap all the operands in COPY. */
2319 memset (&wi
, 0, sizeof (wi
));
2322 processing_debug_stmt
= 1;
2324 if (gimple_debug_source_bind_p (stmt
))
2325 t
= gimple_debug_source_bind_get_var (stmt
);
2327 t
= gimple_debug_bind_get_var (stmt
);
2329 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2330 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2332 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2335 else if (TREE_CODE (t
) == VAR_DECL
2336 && !is_global_var (t
)
2337 && !pointer_map_contains (id
->decl_map
, t
))
2338 /* T is a non-localized variable. */;
2340 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2342 if (gimple_debug_bind_p (stmt
))
2344 gimple_debug_bind_set_var (stmt
, t
);
2346 if (gimple_debug_bind_has_value_p (stmt
))
2347 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2348 remap_gimple_op_r
, &wi
, NULL
);
2350 /* Punt if any decl couldn't be remapped. */
2351 if (processing_debug_stmt
< 0)
2352 gimple_debug_bind_reset_value (stmt
);
2354 else if (gimple_debug_source_bind_p (stmt
))
2356 gimple_debug_source_bind_set_var (stmt
, t
);
2357 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2358 remap_gimple_op_r
, &wi
, NULL
);
2361 processing_debug_stmt
= 0;
2366 /* Process deferred debug stmts. In order to give values better odds
2367 of being successfully remapped, we delay the processing of debug
2368 stmts until all other stmts that might require remapping are
2372 copy_debug_stmts (copy_body_data
*id
)
2377 if (!id
->debug_stmts
)
2380 FOR_EACH_VEC_ELT (gimple
, id
->debug_stmts
, i
, stmt
)
2381 copy_debug_stmt (stmt
, id
);
2383 VEC_free (gimple
, heap
, id
->debug_stmts
);
2386 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2387 another function. */
2390 copy_tree_body (copy_body_data
*id
)
2392 tree fndecl
= id
->src_fn
;
2393 tree body
= DECL_SAVED_TREE (fndecl
);
2395 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2400 /* Make a copy of the body of FN so that it can be inserted inline in
2401 another function. */
2404 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2405 basic_block entry_block_map
, basic_block exit_block_map
,
2406 bitmap blocks_to_copy
, basic_block new_entry
)
2408 tree fndecl
= id
->src_fn
;
2411 /* If this body has a CFG, walk CFG and copy. */
2412 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl
)));
2413 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2414 blocks_to_copy
, new_entry
);
2415 copy_debug_stmts (id
);
2420 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2421 defined in function FN, or of a data member thereof. */
2424 self_inlining_addr_expr (tree value
, tree fn
)
2428 if (TREE_CODE (value
) != ADDR_EXPR
)
2431 var
= get_base_address (TREE_OPERAND (value
, 0));
2433 return var
&& auto_var_in_fn_p (var
, fn
);
2436 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2437 lexical block and line number information from base_stmt, if given,
2438 or from the last stmt of the block otherwise. */
2441 insert_init_debug_bind (copy_body_data
*id
,
2442 basic_block bb
, tree var
, tree value
,
2446 gimple_stmt_iterator gsi
;
2449 if (!gimple_in_ssa_p (id
->src_cfun
))
2452 if (!MAY_HAVE_DEBUG_STMTS
)
2455 tracked_var
= target_for_debug_bind (var
);
2461 gsi
= gsi_last_bb (bb
);
2462 if (!base_stmt
&& !gsi_end_p (gsi
))
2463 base_stmt
= gsi_stmt (gsi
);
2466 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2470 if (!gsi_end_p (gsi
))
2471 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2473 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2480 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2482 /* If VAR represents a zero-sized variable, it's possible that the
2483 assignment statement may result in no gimple statements. */
2486 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2488 /* We can end up with init statements that store to a non-register
2489 from a rhs with a conversion. Handle that here by forcing the
2490 rhs into a temporary. gimple_regimplify_operands is not
2491 prepared to do this for us. */
2492 if (!is_gimple_debug (init_stmt
)
2493 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2494 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2495 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2497 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2498 gimple_expr_type (init_stmt
),
2499 gimple_assign_rhs1 (init_stmt
));
2500 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2502 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2503 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2505 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2506 gimple_regimplify_operands (init_stmt
, &si
);
2508 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2510 tree def
= gimple_assign_lhs (init_stmt
);
2511 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2516 /* Initialize parameter P with VALUE. If needed, produce init statement
2517 at the end of BB. When BB is NULL, we return init statement to be
2520 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2521 basic_block bb
, tree
*vars
)
2523 gimple init_stmt
= NULL
;
2526 tree def
= (gimple_in_ssa_p (cfun
)
2527 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2530 && value
!= error_mark_node
2531 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2533 /* If we can match up types by promotion/demotion do so. */
2534 if (fold_convertible_p (TREE_TYPE (p
), value
))
2535 rhs
= fold_convert (TREE_TYPE (p
), value
);
2538 /* ??? For valid programs we should not end up here.
2539 Still if we end up with truly mismatched types here, fall back
2540 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2541 GIMPLE to the following passes. */
2542 if (!is_gimple_reg_type (TREE_TYPE (value
))
2543 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2544 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2546 rhs
= build_zero_cst (TREE_TYPE (p
));
2550 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2551 here since the type of this decl must be visible to the calling
2553 var
= copy_decl_to_var (p
, id
);
2555 /* Declare this new variable. */
2556 DECL_CHAIN (var
) = *vars
;
2559 /* Make gimplifier happy about this variable. */
2560 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2562 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2563 we would not need to create a new variable here at all, if it
2564 weren't for debug info. Still, we can just use the argument
2566 if (TREE_READONLY (p
)
2567 && !TREE_ADDRESSABLE (p
)
2568 && value
&& !TREE_SIDE_EFFECTS (value
)
2571 /* We may produce non-gimple trees by adding NOPs or introduce
2572 invalid sharing when operand is not really constant.
2573 It is not big deal to prohibit constant propagation here as
2574 we will constant propagate in DOM1 pass anyway. */
2575 if (is_gimple_min_invariant (value
)
2576 && useless_type_conversion_p (TREE_TYPE (p
),
2578 /* We have to be very careful about ADDR_EXPR. Make sure
2579 the base variable isn't a local variable of the inlined
2580 function, e.g., when doing recursive inlining, direct or
2581 mutually-recursive or whatever, which is why we don't
2582 just test whether fn == current_function_decl. */
2583 && ! self_inlining_addr_expr (value
, fn
))
2585 insert_decl_map (id
, p
, value
);
2586 insert_debug_decl_map (id
, p
, var
);
2587 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2591 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2592 that way, when the PARM_DECL is encountered, it will be
2593 automatically replaced by the VAR_DECL. */
2594 insert_decl_map (id
, p
, var
);
2596 /* Even if P was TREE_READONLY, the new VAR should not be.
2597 In the original code, we would have constructed a
2598 temporary, and then the function body would have never
2599 changed the value of P. However, now, we will be
2600 constructing VAR directly. The constructor body may
2601 change its value multiple times as it is being
2602 constructed. Therefore, it must not be TREE_READONLY;
2603 the back-end assumes that TREE_READONLY variable is
2604 assigned to only once. */
2605 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2606 TREE_READONLY (var
) = 0;
2608 /* If there is no setup required and we are in SSA, take the easy route
2609 replacing all SSA names representing the function parameter by the
2610 SSA name passed to function.
2612 We need to construct map for the variable anyway as it might be used
2613 in different SSA names when parameter is set in function.
2615 Do replacement at -O0 for const arguments replaced by constant.
2616 This is important for builtin_constant_p and other construct requiring
2617 constant argument to be visible in inlined function body. */
2618 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2620 || (TREE_READONLY (p
)
2621 && is_gimple_min_invariant (rhs
)))
2622 && (TREE_CODE (rhs
) == SSA_NAME
2623 || is_gimple_min_invariant (rhs
))
2624 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2626 insert_decl_map (id
, def
, rhs
);
2627 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2630 /* If the value of argument is never used, don't care about initializing
2632 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2634 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2635 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2638 /* Initialize this VAR_DECL from the equivalent argument. Convert
2639 the argument to the proper type in case it was promoted. */
2642 if (rhs
== error_mark_node
)
2644 insert_decl_map (id
, p
, var
);
2645 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2648 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2650 /* If we are in SSA form properly remap the default definition
2651 or assign to a dummy SSA name if the parameter is unused and
2652 we are not optimizing. */
2653 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2657 def
= remap_ssa_name (def
, id
);
2658 init_stmt
= gimple_build_assign (def
, rhs
);
2659 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2660 set_ssa_default_def (cfun
, var
, NULL
);
2664 def
= make_ssa_name (var
, NULL
);
2665 init_stmt
= gimple_build_assign (def
, rhs
);
2669 init_stmt
= gimple_build_assign (var
, rhs
);
2671 if (bb
&& init_stmt
)
2672 insert_init_stmt (id
, bb
, init_stmt
);
2677 /* Generate code to initialize the parameters of the function at the
2678 top of the stack in ID from the GIMPLE_CALL STMT. */
2681 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2682 tree fn
, basic_block bb
)
2687 tree vars
= NULL_TREE
;
2688 tree static_chain
= gimple_call_chain (stmt
);
2690 /* Figure out what the parameters are. */
2691 parms
= DECL_ARGUMENTS (fn
);
2693 /* Loop through the parameter declarations, replacing each with an
2694 equivalent VAR_DECL, appropriately initialized. */
2695 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2698 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2699 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2701 /* After remapping parameters remap their types. This has to be done
2702 in a second loop over all parameters to appropriately remap
2703 variable sized arrays when the size is specified in a
2704 parameter following the array. */
2705 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2707 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
2709 && TREE_CODE (*varp
) == VAR_DECL
)
2711 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
2712 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2714 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
2715 /* Also remap the default definition if it was remapped
2716 to the default definition of the parameter replacement
2717 by the parameter setup. */
2720 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
2722 && TREE_CODE (*defp
) == SSA_NAME
2723 && SSA_NAME_VAR (*defp
) == var
)
2724 TREE_TYPE (*defp
) = TREE_TYPE (var
);
2729 /* Initialize the static chain. */
2730 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
2731 gcc_assert (fn
!= current_function_decl
);
2734 /* No static chain? Seems like a bug in tree-nested.c. */
2735 gcc_assert (static_chain
);
2737 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
2740 declare_inline_vars (id
->block
, vars
);
2744 /* Declare a return variable to replace the RESULT_DECL for the
2745 function we are calling. An appropriate DECL_STMT is returned.
2746 The USE_STMT is filled to contain a use of the declaration to
2747 indicate the return value of the function.
2749 RETURN_SLOT, if non-null is place where to store the result. It
2750 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2751 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2753 The return value is a (possibly null) value that holds the result
2754 as seen by the caller. */
2757 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
2758 basic_block entry_bb
)
2760 tree callee
= id
->src_fn
;
2761 tree result
= DECL_RESULT (callee
);
2762 tree callee_type
= TREE_TYPE (result
);
2766 /* Handle type-mismatches in the function declaration return type
2767 vs. the call expression. */
2769 caller_type
= TREE_TYPE (modify_dest
);
2771 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
2773 /* We don't need to do anything for functions that don't return anything. */
2774 if (VOID_TYPE_P (callee_type
))
2777 /* If there was a return slot, then the return value is the
2778 dereferenced address of that object. */
2781 /* The front end shouldn't have used both return_slot and
2782 a modify expression. */
2783 gcc_assert (!modify_dest
);
2784 if (DECL_BY_REFERENCE (result
))
2786 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
2787 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
2789 /* We are going to construct *&return_slot and we can't do that
2790 for variables believed to be not addressable.
2792 FIXME: This check possibly can match, because values returned
2793 via return slot optimization are not believed to have address
2794 taken by alias analysis. */
2795 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
2796 var
= return_slot_addr
;
2801 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
2802 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
2804 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2805 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2806 && !DECL_GIMPLE_REG_P (result
)
2808 DECL_GIMPLE_REG_P (var
) = 0;
2813 /* All types requiring non-trivial constructors should have been handled. */
2814 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
2816 /* Attempt to avoid creating a new temporary variable. */
2818 && TREE_CODE (modify_dest
) != SSA_NAME
)
2820 bool use_it
= false;
2822 /* We can't use MODIFY_DEST if there's type promotion involved. */
2823 if (!useless_type_conversion_p (callee_type
, caller_type
))
2826 /* ??? If we're assigning to a variable sized type, then we must
2827 reuse the destination variable, because we've no good way to
2828 create variable sized temporaries at this point. */
2829 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
2832 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2833 reuse it as the result of the call directly. Don't do this if
2834 it would promote MODIFY_DEST to addressable. */
2835 else if (TREE_ADDRESSABLE (result
))
2839 tree base_m
= get_base_address (modify_dest
);
2841 /* If the base isn't a decl, then it's a pointer, and we don't
2842 know where that's going to go. */
2843 if (!DECL_P (base_m
))
2845 else if (is_global_var (base_m
))
2847 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2848 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2849 && !DECL_GIMPLE_REG_P (result
)
2850 && DECL_GIMPLE_REG_P (base_m
))
2852 else if (!TREE_ADDRESSABLE (base_m
))
2864 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
2866 var
= copy_result_decl_to_var (result
, id
);
2867 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2869 /* Do not have the rest of GCC warn about this variable as it should
2870 not be visible to the user. */
2871 TREE_NO_WARNING (var
) = 1;
2873 declare_inline_vars (id
->block
, var
);
2875 /* Build the use expr. If the return type of the function was
2876 promoted, convert it back to the expected type. */
2878 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
2880 /* If we can match up types by promotion/demotion do so. */
2881 if (fold_convertible_p (caller_type
, var
))
2882 use
= fold_convert (caller_type
, var
);
2885 /* ??? For valid programs we should not end up here.
2886 Still if we end up with truly mismatched types here, fall back
2887 to using a MEM_REF to not leak invalid GIMPLE to the following
2889 /* Prevent var from being written into SSA form. */
2890 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
2891 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
2892 DECL_GIMPLE_REG_P (var
) = false;
2893 else if (is_gimple_reg_type (TREE_TYPE (var
)))
2894 TREE_ADDRESSABLE (var
) = true;
2895 use
= fold_build2 (MEM_REF
, caller_type
,
2896 build_fold_addr_expr (var
),
2897 build_int_cst (ptr_type_node
, 0));
2901 STRIP_USELESS_TYPE_CONVERSION (use
);
2903 if (DECL_BY_REFERENCE (result
))
2905 TREE_ADDRESSABLE (var
) = 1;
2906 var
= build_fold_addr_expr (var
);
2910 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2911 way, when the RESULT_DECL is encountered, it will be
2912 automatically replaced by the VAR_DECL.
2914 When returning by reference, ensure that RESULT_DECL remaps to
2916 if (DECL_BY_REFERENCE (result
)
2917 && !is_gimple_val (var
))
2919 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
2920 insert_decl_map (id
, result
, temp
);
2921 /* When RESULT_DECL is in SSA form, we need to remap and initialize
2922 it's default_def SSA_NAME. */
2923 if (gimple_in_ssa_p (id
->src_cfun
)
2924 && is_gimple_reg (result
))
2926 temp
= make_ssa_name (temp
, NULL
);
2927 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
2929 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
2932 insert_decl_map (id
, result
, var
);
2934 /* Remember this so we can ignore it in remap_decls. */
2940 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2941 to a local label. */
2944 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
2947 tree fn
= (tree
) fnp
;
2949 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
2958 /* Determine if the function can be copied. If so return NULL. If
2959 not return a string describng the reason for failure. */
2962 copy_forbidden (struct function
*fun
, tree fndecl
)
2964 const char *reason
= fun
->cannot_be_copied_reason
;
2968 /* Only examine the function once. */
2969 if (fun
->cannot_be_copied_set
)
2972 /* We cannot copy a function that receives a non-local goto
2973 because we cannot remap the destination label used in the
2974 function that is performing the non-local goto. */
2975 /* ??? Actually, this should be possible, if we work at it.
2976 No doubt there's just a handful of places that simply
2977 assume it doesn't happen and don't substitute properly. */
2978 if (fun
->has_nonlocal_label
)
2980 reason
= G_("function %q+F can never be copied "
2981 "because it receives a non-local goto");
2985 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
2986 if (TREE_CODE (decl
) == VAR_DECL
2987 && TREE_STATIC (decl
)
2988 && !DECL_EXTERNAL (decl
)
2989 && DECL_INITIAL (decl
)
2990 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
2991 has_label_address_in_static_1
,
2994 reason
= G_("function %q+F can never be copied because it saves "
2995 "address of local label in a static variable");
3000 fun
->cannot_be_copied_reason
= reason
;
3001 fun
->cannot_be_copied_set
= true;
3006 static const char *inline_forbidden_reason
;
3008 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3009 iff a function can not be inlined. Also sets the reason why. */
3012 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3013 struct walk_stmt_info
*wip
)
3015 tree fn
= (tree
) wip
->info
;
3017 gimple stmt
= gsi_stmt (*gsi
);
3019 switch (gimple_code (stmt
))
3022 /* Refuse to inline alloca call unless user explicitly forced so as
3023 this may change program's memory overhead drastically when the
3024 function using alloca is called in loop. In GCC present in
3025 SPEC2000 inlining into schedule_block cause it to require 2GB of
3026 RAM instead of 256MB. Don't do so for alloca calls emitted for
3027 VLA objects as those can't cause unbounded growth (they're always
3028 wrapped inside stack_save/stack_restore regions. */
3029 if (gimple_alloca_call_p (stmt
)
3030 && !gimple_call_alloca_for_var_p (stmt
)
3031 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3033 inline_forbidden_reason
3034 = G_("function %q+F can never be inlined because it uses "
3035 "alloca (override using the always_inline attribute)");
3036 *handled_ops_p
= true;
3040 t
= gimple_call_fndecl (stmt
);
3044 /* We cannot inline functions that call setjmp. */
3045 if (setjmp_call_p (t
))
3047 inline_forbidden_reason
3048 = G_("function %q+F can never be inlined because it uses setjmp");
3049 *handled_ops_p
= true;
3053 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3054 switch (DECL_FUNCTION_CODE (t
))
3056 /* We cannot inline functions that take a variable number of
3058 case BUILT_IN_VA_START
:
3059 case BUILT_IN_NEXT_ARG
:
3060 case BUILT_IN_VA_END
:
3061 inline_forbidden_reason
3062 = G_("function %q+F can never be inlined because it "
3063 "uses variable argument lists");
3064 *handled_ops_p
= true;
3067 case BUILT_IN_LONGJMP
:
3068 /* We can't inline functions that call __builtin_longjmp at
3069 all. The non-local goto machinery really requires the
3070 destination be in a different function. If we allow the
3071 function calling __builtin_longjmp to be inlined into the
3072 function calling __builtin_setjmp, Things will Go Awry. */
3073 inline_forbidden_reason
3074 = G_("function %q+F can never be inlined because "
3075 "it uses setjmp-longjmp exception handling");
3076 *handled_ops_p
= true;
3079 case BUILT_IN_NONLOCAL_GOTO
:
3081 inline_forbidden_reason
3082 = G_("function %q+F can never be inlined because "
3083 "it uses non-local goto");
3084 *handled_ops_p
= true;
3087 case BUILT_IN_RETURN
:
3088 case BUILT_IN_APPLY_ARGS
:
3089 /* If a __builtin_apply_args caller would be inlined,
3090 it would be saving arguments of the function it has
3091 been inlined into. Similarly __builtin_return would
3092 return from the function the inline has been inlined into. */
3093 inline_forbidden_reason
3094 = G_("function %q+F can never be inlined because "
3095 "it uses __builtin_return or __builtin_apply_args");
3096 *handled_ops_p
= true;
3105 t
= gimple_goto_dest (stmt
);
3107 /* We will not inline a function which uses computed goto. The
3108 addresses of its local labels, which may be tucked into
3109 global storage, are of course not constant across
3110 instantiations, which causes unexpected behavior. */
3111 if (TREE_CODE (t
) != LABEL_DECL
)
3113 inline_forbidden_reason
3114 = G_("function %q+F can never be inlined "
3115 "because it contains a computed goto");
3116 *handled_ops_p
= true;
3125 *handled_ops_p
= false;
3129 /* Return true if FNDECL is a function that cannot be inlined into
3133 inline_forbidden_p (tree fndecl
)
3135 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3136 struct walk_stmt_info wi
;
3137 struct pointer_set_t
*visited_nodes
;
3139 bool forbidden_p
= false;
3141 /* First check for shared reasons not to copy the code. */
3142 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3143 if (inline_forbidden_reason
!= NULL
)
3146 /* Next, walk the statements of the function looking for
3147 constraucts we can't handle, or are non-optimal for inlining. */
3148 visited_nodes
= pointer_set_create ();
3149 memset (&wi
, 0, sizeof (wi
));
3150 wi
.info
= (void *) fndecl
;
3151 wi
.pset
= visited_nodes
;
3153 FOR_EACH_BB_FN (bb
, fun
)
3156 gimple_seq seq
= bb_seq (bb
);
3157 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3158 forbidden_p
= (ret
!= NULL
);
3163 pointer_set_destroy (visited_nodes
);
3167 /* Return false if the function FNDECL cannot be inlined on account of its
3168 attributes, true otherwise. */
3170 function_attribute_inlinable_p (const_tree fndecl
)
3172 if (targetm
.attribute_table
)
3176 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3178 const_tree name
= TREE_PURPOSE (a
);
3181 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3182 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3183 return targetm
.function_attribute_inlinable_p (fndecl
);
3190 /* Returns nonzero if FN is a function that does not have any
3191 fundamental inline blocking properties. */
3194 tree_inlinable_function_p (tree fn
)
3196 bool inlinable
= true;
3200 /* If we've already decided this function shouldn't be inlined,
3201 there's no need to check again. */
3202 if (DECL_UNINLINABLE (fn
))
3205 /* We only warn for functions declared `inline' by the user. */
3206 do_warning
= (warn_inline
3207 && DECL_DECLARED_INLINE_P (fn
)
3208 && !DECL_NO_INLINE_WARNING_P (fn
)
3209 && !DECL_IN_SYSTEM_HEADER (fn
));
3211 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3214 && always_inline
== NULL
)
3217 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3218 "is suppressed using -fno-inline", fn
);
3222 else if (!function_attribute_inlinable_p (fn
))
3225 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3226 "uses attributes conflicting with inlining", fn
);
3230 else if (inline_forbidden_p (fn
))
3232 /* See if we should warn about uninlinable functions. Previously,
3233 some of these warnings would be issued while trying to expand
3234 the function inline, but that would cause multiple warnings
3235 about functions that would for example call alloca. But since
3236 this a property of the function, just one warning is enough.
3237 As a bonus we can now give more details about the reason why a
3238 function is not inlinable. */
3240 error (inline_forbidden_reason
, fn
);
3241 else if (do_warning
)
3242 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3247 /* Squirrel away the result so that we don't have to check again. */
3248 DECL_UNINLINABLE (fn
) = !inlinable
;
3253 /* Estimate the cost of a memory move. Use machine dependent
3254 word size and take possible memcpy call into account. */
3257 estimate_move_cost (tree type
)
3261 gcc_assert (!VOID_TYPE_P (type
));
3263 if (TREE_CODE (type
) == VECTOR_TYPE
)
3265 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3266 enum machine_mode simd
3267 = targetm
.vectorize
.preferred_simd_mode (inner
);
3268 int simd_mode_size
= GET_MODE_SIZE (simd
);
3269 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3273 size
= int_size_in_bytes (type
);
3275 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3276 /* Cost of a memcpy call, 3 arguments and the call. */
3279 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3282 /* Returns cost of operation CODE, according to WEIGHTS */
3285 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3286 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3290 /* These are "free" conversions, or their presumed cost
3291 is folded into other operations. */
3296 case VIEW_CONVERT_EXPR
:
3299 /* Assign cost of 1 to usual operations.
3300 ??? We may consider mapping RTL costs to this. */
3306 case POINTER_PLUS_EXPR
:
3309 case MULT_HIGHPART_EXPR
:
3312 case ADDR_SPACE_CONVERT_EXPR
:
3313 case FIXED_CONVERT_EXPR
:
3314 case FIX_TRUNC_EXPR
:
3326 case VEC_LSHIFT_EXPR
:
3327 case VEC_RSHIFT_EXPR
:
3334 case TRUTH_ANDIF_EXPR
:
3335 case TRUTH_ORIF_EXPR
:
3336 case TRUTH_AND_EXPR
:
3338 case TRUTH_XOR_EXPR
:
3339 case TRUTH_NOT_EXPR
:
3348 case UNORDERED_EXPR
:
3359 case PREDECREMENT_EXPR
:
3360 case PREINCREMENT_EXPR
:
3361 case POSTDECREMENT_EXPR
:
3362 case POSTINCREMENT_EXPR
:
3364 case REALIGN_LOAD_EXPR
:
3366 case REDUC_MAX_EXPR
:
3367 case REDUC_MIN_EXPR
:
3368 case REDUC_PLUS_EXPR
:
3369 case WIDEN_SUM_EXPR
:
3370 case WIDEN_MULT_EXPR
:
3372 case WIDEN_MULT_PLUS_EXPR
:
3373 case WIDEN_MULT_MINUS_EXPR
:
3374 case WIDEN_LSHIFT_EXPR
:
3376 case VEC_WIDEN_MULT_HI_EXPR
:
3377 case VEC_WIDEN_MULT_LO_EXPR
:
3378 case VEC_WIDEN_MULT_EVEN_EXPR
:
3379 case VEC_WIDEN_MULT_ODD_EXPR
:
3380 case VEC_UNPACK_HI_EXPR
:
3381 case VEC_UNPACK_LO_EXPR
:
3382 case VEC_UNPACK_FLOAT_HI_EXPR
:
3383 case VEC_UNPACK_FLOAT_LO_EXPR
:
3384 case VEC_PACK_TRUNC_EXPR
:
3385 case VEC_PACK_SAT_EXPR
:
3386 case VEC_PACK_FIX_TRUNC_EXPR
:
3387 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3388 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3392 /* Few special cases of expensive operations. This is useful
3393 to avoid inlining on functions having too many of these. */
3394 case TRUNC_DIV_EXPR
:
3396 case FLOOR_DIV_EXPR
:
3397 case ROUND_DIV_EXPR
:
3398 case EXACT_DIV_EXPR
:
3399 case TRUNC_MOD_EXPR
:
3401 case FLOOR_MOD_EXPR
:
3402 case ROUND_MOD_EXPR
:
3404 if (TREE_CODE (op2
) != INTEGER_CST
)
3405 return weights
->div_mod_cost
;
3409 /* We expect a copy assignment with no operator. */
3410 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3416 /* Estimate number of instructions that will be created by expanding
3417 the statements in the statement sequence STMTS.
3418 WEIGHTS contains weights attributed to various constructs. */
3421 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3424 gimple_stmt_iterator gsi
;
3427 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3428 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3434 /* Estimate number of instructions that will be created by expanding STMT.
3435 WEIGHTS contains weights attributed to various constructs. */
3438 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3441 enum gimple_code code
= gimple_code (stmt
);
3448 /* Try to estimate the cost of assignments. We have three cases to
3450 1) Simple assignments to registers;
3451 2) Stores to things that must live in memory. This includes
3452 "normal" stores to scalars, but also assignments of large
3453 structures, or constructors of big arrays;
3455 Let us look at the first two cases, assuming we have "a = b + C":
3456 <GIMPLE_ASSIGN <var_decl "a">
3457 <plus_expr <var_decl "b"> <constant C>>
3458 If "a" is a GIMPLE register, the assignment to it is free on almost
3459 any target, because "a" usually ends up in a real register. Hence
3460 the only cost of this expression comes from the PLUS_EXPR, and we
3461 can ignore the GIMPLE_ASSIGN.
3462 If "a" is not a GIMPLE register, the assignment to "a" will most
3463 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3464 of moving something into "a", which we compute using the function
3465 estimate_move_cost. */
3466 if (gimple_clobber_p (stmt
))
3467 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3469 lhs
= gimple_assign_lhs (stmt
);
3470 rhs
= gimple_assign_rhs1 (stmt
);
3472 if (is_gimple_reg (lhs
))
3475 cost
= estimate_move_cost (TREE_TYPE (lhs
));
3477 if (!is_gimple_reg (rhs
) && !is_gimple_min_invariant (rhs
))
3478 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3480 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3481 gimple_assign_rhs1 (stmt
),
3482 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3483 == GIMPLE_BINARY_RHS
3484 ? gimple_assign_rhs2 (stmt
) : NULL
);
3488 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3489 gimple_op (stmt
, 0),
3490 gimple_op (stmt
, 1));
3494 /* Take into account cost of the switch + guess 2 conditional jumps for
3497 TODO: once the switch expansion logic is sufficiently separated, we can
3498 do better job on estimating cost of the switch. */
3499 if (weights
->time_based
)
3500 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3502 cost
= gimple_switch_num_labels (stmt
) * 2;
3507 tree decl
= gimple_call_fndecl (stmt
);
3508 struct cgraph_node
*node
= NULL
;
3510 /* Do not special case builtins where we see the body.
3511 This just confuse inliner. */
3512 if (!decl
|| !(node
= cgraph_get_node (decl
)) || node
->analyzed
)
3514 /* For buitins that are likely expanded to nothing or
3515 inlined do not account operand costs. */
3516 else if (is_simple_builtin (decl
))
3518 else if (is_inexpensive_builtin (decl
))
3519 return weights
->target_builtin_call_cost
;
3520 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3522 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3523 specialize the cheap expansion we do here.
3524 ??? This asks for a more general solution. */
3525 switch (DECL_FUNCTION_CODE (decl
))
3530 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3531 && REAL_VALUES_EQUAL
3532 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3533 return estimate_operator_cost (MULT_EXPR
, weights
,
3534 gimple_call_arg (stmt
, 0),
3535 gimple_call_arg (stmt
, 0));
3543 cost
= node
? weights
->call_cost
: weights
->indirect_call_cost
;
3544 if (gimple_call_lhs (stmt
))
3545 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3546 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3548 tree arg
= gimple_call_arg (stmt
, i
);
3549 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3555 return weights
->return_cost
;
3561 case GIMPLE_PREDICT
:
3566 return asm_str_count (gimple_asm_string (stmt
));
3569 /* This is either going to be an external function call with one
3570 argument, or two register copy statements plus a goto. */
3573 case GIMPLE_EH_DISPATCH
:
3574 /* ??? This is going to turn into a switch statement. Ideally
3575 we'd have a look at the eh region and estimate the number of
3580 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3582 case GIMPLE_EH_FILTER
:
3583 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3586 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3589 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3590 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3592 /* OpenMP directives are generally very expensive. */
3594 case GIMPLE_OMP_RETURN
:
3595 case GIMPLE_OMP_SECTIONS_SWITCH
:
3596 case GIMPLE_OMP_ATOMIC_STORE
:
3597 case GIMPLE_OMP_CONTINUE
:
3598 /* ...except these, which are cheap. */
3601 case GIMPLE_OMP_ATOMIC_LOAD
:
3602 return weights
->omp_cost
;
3604 case GIMPLE_OMP_FOR
:
3605 return (weights
->omp_cost
3606 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3607 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3609 case GIMPLE_OMP_PARALLEL
:
3610 case GIMPLE_OMP_TASK
:
3611 case GIMPLE_OMP_CRITICAL
:
3612 case GIMPLE_OMP_MASTER
:
3613 case GIMPLE_OMP_ORDERED
:
3614 case GIMPLE_OMP_SECTION
:
3615 case GIMPLE_OMP_SECTIONS
:
3616 case GIMPLE_OMP_SINGLE
:
3617 return (weights
->omp_cost
3618 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3620 case GIMPLE_TRANSACTION
:
3621 return (weights
->tm_cost
3622 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3632 /* Estimate number of instructions that will be created by expanding
3633 function FNDECL. WEIGHTS contains weights attributed to various
3637 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3639 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3640 gimple_stmt_iterator bsi
;
3644 gcc_assert (my_function
&& my_function
->cfg
);
3645 FOR_EACH_BB_FN (bb
, my_function
)
3647 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3648 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3655 /* Initializes weights used by estimate_num_insns. */
3658 init_inline_once (void)
3660 eni_size_weights
.call_cost
= 1;
3661 eni_size_weights
.indirect_call_cost
= 3;
3662 eni_size_weights
.target_builtin_call_cost
= 1;
3663 eni_size_weights
.div_mod_cost
= 1;
3664 eni_size_weights
.omp_cost
= 40;
3665 eni_size_weights
.tm_cost
= 10;
3666 eni_size_weights
.time_based
= false;
3667 eni_size_weights
.return_cost
= 1;
3669 /* Estimating time for call is difficult, since we have no idea what the
3670 called function does. In the current uses of eni_time_weights,
3671 underestimating the cost does less harm than overestimating it, so
3672 we choose a rather small value here. */
3673 eni_time_weights
.call_cost
= 10;
3674 eni_time_weights
.indirect_call_cost
= 15;
3675 eni_time_weights
.target_builtin_call_cost
= 1;
3676 eni_time_weights
.div_mod_cost
= 10;
3677 eni_time_weights
.omp_cost
= 40;
3678 eni_time_weights
.tm_cost
= 40;
3679 eni_time_weights
.time_based
= true;
3680 eni_time_weights
.return_cost
= 2;
3683 /* Estimate the number of instructions in a gimple_seq. */
3686 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3688 gimple_stmt_iterator gsi
;
3690 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3691 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3697 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3700 prepend_lexical_block (tree current_block
, tree new_block
)
3702 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
3703 BLOCK_SUBBLOCKS (current_block
) = new_block
;
3704 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
3707 /* Add local variables from CALLEE to CALLER. */
3710 add_local_variables (struct function
*callee
, struct function
*caller
,
3716 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
3717 if (!can_be_nonlocal (var
, id
))
3719 tree new_var
= remap_decl (var
, id
);
3721 /* Remap debug-expressions. */
3722 if (TREE_CODE (new_var
) == VAR_DECL
3723 && DECL_DEBUG_EXPR_IS_FROM (new_var
)
3726 tree tem
= DECL_DEBUG_EXPR (var
);
3727 bool old_regimplify
= id
->regimplify
;
3728 id
->remapping_type_depth
++;
3729 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
3730 id
->remapping_type_depth
--;
3731 id
->regimplify
= old_regimplify
;
3732 SET_DECL_DEBUG_EXPR (new_var
, tem
);
3734 add_local_decl (caller
, new_var
);
3738 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3741 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
3745 struct pointer_map_t
*st
, *dst
;
3748 location_t saved_location
;
3749 struct cgraph_edge
*cg_edge
;
3750 cgraph_inline_failed_t reason
;
3751 basic_block return_block
;
3753 gimple_stmt_iterator gsi
, stmt_gsi
;
3754 bool successfully_inlined
= FALSE
;
3755 bool purge_dead_abnormal_edges
;
3757 /* Set input_location here so we get the right instantiation context
3758 if we call instantiate_decl from inlinable_function_p. */
3759 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
3760 saved_location
= input_location
;
3761 input_location
= gimple_location (stmt
);
3763 /* From here on, we're only interested in CALL_EXPRs. */
3764 if (gimple_code (stmt
) != GIMPLE_CALL
)
3767 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
3768 gcc_checking_assert (cg_edge
);
3769 /* First, see if we can figure out what function is being called.
3770 If we cannot, then there is no hope of inlining the function. */
3771 if (cg_edge
->indirect_unknown_callee
)
3773 fn
= cg_edge
->callee
->symbol
.decl
;
3774 gcc_checking_assert (fn
);
3776 /* If FN is a declaration of a function in a nested scope that was
3777 globally declared inline, we don't set its DECL_INITIAL.
3778 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3779 C++ front-end uses it for cdtors to refer to their internal
3780 declarations, that are not real functions. Fortunately those
3781 don't have trees to be saved, so we can tell by checking their
3783 if (!DECL_INITIAL (fn
)
3784 && DECL_ABSTRACT_ORIGIN (fn
)
3785 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
3786 fn
= DECL_ABSTRACT_ORIGIN (fn
);
3788 /* Don't try to inline functions that are not well-suited to inlining. */
3789 if (cg_edge
->inline_failed
)
3791 reason
= cg_edge
->inline_failed
;
3792 /* If this call was originally indirect, we do not want to emit any
3793 inlining related warnings or sorry messages because there are no
3794 guarantees regarding those. */
3795 if (cg_edge
->indirect_inlining_edge
)
3798 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
3799 /* Avoid warnings during early inline pass. */
3800 && cgraph_global_info_ready
3801 /* PR 20090218-1_0.c. Body can be provided by another module. */
3802 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
3804 error ("inlining failed in call to always_inline %q+F: %s", fn
,
3805 cgraph_inline_failed_string (reason
));
3806 error ("called from here");
3808 else if (warn_inline
3809 && DECL_DECLARED_INLINE_P (fn
)
3810 && !DECL_NO_INLINE_WARNING_P (fn
)
3811 && !DECL_IN_SYSTEM_HEADER (fn
)
3812 && reason
!= CIF_UNSPECIFIED
3813 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
3814 /* Do not warn about not inlined recursive calls. */
3815 && !cgraph_edge_recursive_p (cg_edge
)
3816 /* Avoid warnings during early inline pass. */
3817 && cgraph_global_info_ready
)
3819 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
3820 fn
, _(cgraph_inline_failed_string (reason
)));
3821 warning (OPT_Winline
, "called from here");
3825 fn
= cg_edge
->callee
->symbol
.decl
;
3827 #ifdef ENABLE_CHECKING
3828 if (cg_edge
->callee
->symbol
.decl
!= id
->dst_node
->symbol
.decl
)
3829 verify_cgraph_node (cg_edge
->callee
);
3832 /* We will be inlining this callee. */
3833 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
3835 /* Update the callers EH personality. */
3836 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
))
3837 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->symbol
.decl
)
3838 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
);
3840 /* Split the block holding the GIMPLE_CALL. */
3841 e
= split_block (bb
, stmt
);
3843 return_block
= e
->dest
;
3846 /* split_block splits after the statement; work around this by
3847 moving the call into the second block manually. Not pretty,
3848 but seems easier than doing the CFG manipulation by hand
3849 when the GIMPLE_CALL is in the last statement of BB. */
3850 stmt_gsi
= gsi_last_bb (bb
);
3851 gsi_remove (&stmt_gsi
, false);
3853 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3854 been the source of abnormal edges. In this case, schedule
3855 the removal of dead abnormal edges. */
3856 gsi
= gsi_start_bb (return_block
);
3857 if (gsi_end_p (gsi
))
3859 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
3860 purge_dead_abnormal_edges
= true;
3864 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
3865 purge_dead_abnormal_edges
= false;
3868 stmt_gsi
= gsi_start_bb (return_block
);
3870 /* Build a block containing code to initialize the arguments, the
3871 actual inline expansion of the body, and a label for the return
3872 statements within the function to jump to. The type of the
3873 statement expression is the return type of the function call. */
3874 id
->block
= make_node (BLOCK
);
3875 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
3876 BLOCK_SOURCE_LOCATION (id
->block
) = input_location
;
3877 prepend_lexical_block (gimple_block (stmt
), id
->block
);
3879 /* Local declarations will be replaced by their equivalents in this
3882 id
->decl_map
= pointer_map_create ();
3883 dst
= id
->debug_map
;
3884 id
->debug_map
= NULL
;
3886 /* Record the function we are about to inline. */
3888 id
->src_node
= cg_edge
->callee
;
3889 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
3890 id
->gimple_call
= stmt
;
3892 gcc_assert (!id
->src_cfun
->after_inlining
);
3895 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
3897 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3898 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
3902 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
3904 if (DECL_INITIAL (fn
))
3905 prepend_lexical_block (id
->block
, remap_blocks (DECL_INITIAL (fn
), id
));
3907 /* Return statements in the function body will be replaced by jumps
3908 to the RET_LABEL. */
3909 gcc_assert (DECL_INITIAL (fn
));
3910 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
3912 /* Find the LHS to which the result of this call is assigned. */
3914 if (gimple_call_lhs (stmt
))
3916 modify_dest
= gimple_call_lhs (stmt
);
3918 /* The function which we are inlining might not return a value,
3919 in which case we should issue a warning that the function
3920 does not return a value. In that case the optimizers will
3921 see that the variable to which the value is assigned was not
3922 initialized. We do not want to issue a warning about that
3923 uninitialized variable. */
3924 if (DECL_P (modify_dest
))
3925 TREE_NO_WARNING (modify_dest
) = 1;
3927 if (gimple_call_return_slot_opt_p (stmt
))
3929 return_slot
= modify_dest
;
3936 /* If we are inlining a call to the C++ operator new, we don't want
3937 to use type based alias analysis on the return value. Otherwise
3938 we may get confused if the compiler sees that the inlined new
3939 function returns a pointer which was just deleted. See bug
3941 if (DECL_IS_OPERATOR_NEW (fn
))
3947 /* Declare the return variable for the function. */
3948 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
3950 /* Add local vars in this inlined callee to caller. */
3951 add_local_variables (id
->src_cfun
, cfun
, id
);
3953 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
3955 fprintf (dump_file
, "Inlining ");
3956 print_generic_expr (dump_file
, id
->src_fn
, 0);
3957 fprintf (dump_file
, " to ");
3958 print_generic_expr (dump_file
, id
->dst_fn
, 0);
3959 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
3962 /* This is it. Duplicate the callee body. Assume callee is
3963 pre-gimplified. Note that we must not alter the caller
3964 function in any way before this point, as this CALL_EXPR may be
3965 a self-referential call; if we're calling ourselves, we need to
3966 duplicate our body before altering anything. */
3967 copy_body (id
, bb
->count
,
3968 cg_edge
->frequency
* REG_BR_PROB_BASE
/ CGRAPH_FREQ_BASE
,
3969 bb
, return_block
, NULL
, NULL
);
3971 /* Reset the escaped solution. */
3972 if (cfun
->gimple_df
)
3973 pt_solution_reset (&cfun
->gimple_df
->escaped
);
3978 pointer_map_destroy (id
->debug_map
);
3979 id
->debug_map
= dst
;
3981 pointer_map_destroy (id
->decl_map
);
3984 /* Unlink the calls virtual operands before replacing it. */
3985 unlink_stmt_vdef (stmt
);
3987 /* If the inlined function returns a result that we care about,
3988 substitute the GIMPLE_CALL with an assignment of the return
3989 variable to the LHS of the call. That is, if STMT was
3990 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3991 if (use_retvar
&& gimple_call_lhs (stmt
))
3993 gimple old_stmt
= stmt
;
3994 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
3995 gsi_replace (&stmt_gsi
, stmt
, false);
3996 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4000 /* Handle the case of inlining a function with no return
4001 statement, which causes the return value to become undefined. */
4002 if (gimple_call_lhs (stmt
)
4003 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4005 tree name
= gimple_call_lhs (stmt
);
4006 tree var
= SSA_NAME_VAR (name
);
4007 tree def
= ssa_default_def (cfun
, var
);
4011 /* If the variable is used undefined, make this name
4012 undefined via a move. */
4013 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4014 gsi_replace (&stmt_gsi
, stmt
, true);
4018 /* Otherwise make this variable undefined. */
4019 gsi_remove (&stmt_gsi
, true);
4020 set_ssa_default_def (cfun
, var
, name
);
4021 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4025 gsi_remove (&stmt_gsi
, true);
4028 if (purge_dead_abnormal_edges
)
4030 gimple_purge_dead_eh_edges (return_block
);
4031 gimple_purge_dead_abnormal_call_edges (return_block
);
4034 /* If the value of the new expression is ignored, that's OK. We
4035 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4036 the equivalent inlined version either. */
4037 if (is_gimple_assign (stmt
))
4039 gcc_assert (gimple_assign_single_p (stmt
)
4040 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4041 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4044 /* Output the inlining info for this abstract function, since it has been
4045 inlined. If we don't do this now, we can lose the information about the
4046 variables in the function when the blocks get blown away as soon as we
4047 remove the cgraph node. */
4048 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->symbol
.decl
);
4050 /* Update callgraph if needed. */
4051 cgraph_remove_node (cg_edge
->callee
);
4053 id
->block
= NULL_TREE
;
4054 successfully_inlined
= TRUE
;
4057 input_location
= saved_location
;
4058 return successfully_inlined
;
4061 /* Expand call statements reachable from STMT_P.
4062 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4063 in a MODIFY_EXPR. */
4066 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4068 gimple_stmt_iterator gsi
;
4070 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4072 gimple stmt
= gsi_stmt (gsi
);
4074 if (is_gimple_call (stmt
)
4075 && expand_call_inline (bb
, stmt
, id
))
4083 /* Walk all basic blocks created after FIRST and try to fold every statement
4084 in the STATEMENTS pointer set. */
4087 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4089 for (; first
< n_basic_blocks
; first
++)
4090 if (BASIC_BLOCK (first
))
4092 gimple_stmt_iterator gsi
;
4094 for (gsi
= gsi_start_bb (BASIC_BLOCK (first
));
4097 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4099 gimple old_stmt
= gsi_stmt (gsi
);
4100 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4102 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4104 /* Folding builtins can create multiple instructions,
4105 we need to look at all of them. */
4106 gimple_stmt_iterator i2
= gsi
;
4108 if (fold_stmt (&gsi
))
4111 /* If a builtin at the end of a bb folded into nothing,
4112 the following loop won't work. */
4113 if (gsi_end_p (gsi
))
4115 cgraph_update_edges_for_call_stmt (old_stmt
,
4120 i2
= gsi_start_bb (BASIC_BLOCK (first
));
4125 new_stmt
= gsi_stmt (i2
);
4126 update_stmt (new_stmt
);
4127 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4130 if (new_stmt
== gsi_stmt (gsi
))
4132 /* It is okay to check only for the very last
4133 of these statements. If it is a throwing
4134 statement nothing will change. If it isn't
4135 this can remove EH edges. If that weren't
4136 correct then because some intermediate stmts
4137 throw, but not the last one. That would mean
4138 we'd have to split the block, which we can't
4139 here and we'd loose anyway. And as builtins
4140 probably never throw, this all
4142 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4144 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4151 else if (fold_stmt (&gsi
))
4153 /* Re-read the statement from GSI as fold_stmt() may
4155 gimple new_stmt
= gsi_stmt (gsi
);
4156 update_stmt (new_stmt
);
4158 if (is_gimple_call (old_stmt
)
4159 || is_gimple_call (new_stmt
))
4160 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4163 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4164 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4170 /* Return true if BB has at least one abnormal outgoing edge. */
4173 has_abnormal_outgoing_edge_p (basic_block bb
)
4178 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4179 if (e
->flags
& EDGE_ABNORMAL
)
4185 /* Expand calls to inline functions in the body of FN. */
4188 optimize_inline_calls (tree fn
)
4192 int last
= n_basic_blocks
;
4193 struct gimplify_ctx gctx
;
4194 bool inlined_p
= false;
4197 memset (&id
, 0, sizeof (id
));
4199 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4200 gcc_assert (id
.dst_node
->analyzed
);
4202 /* Or any functions that aren't finished yet. */
4203 if (current_function_decl
)
4204 id
.dst_fn
= current_function_decl
;
4206 id
.copy_decl
= copy_decl_maybe_to_var
;
4207 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4208 id
.transform_new_cfg
= false;
4209 id
.transform_return_to_modify
= true;
4210 id
.transform_lang_insert_block
= NULL
;
4211 id
.statements_to_fold
= pointer_set_create ();
4213 push_gimplify_context (&gctx
);
4215 /* We make no attempts to keep dominance info up-to-date. */
4216 free_dominance_info (CDI_DOMINATORS
);
4217 free_dominance_info (CDI_POST_DOMINATORS
);
4219 /* Register specific gimple functions. */
4220 gimple_register_cfg_hooks ();
4222 /* Reach the trees by walking over the CFG, and note the
4223 enclosing basic-blocks in the call edges. */
4224 /* We walk the blocks going forward, because inlined function bodies
4225 will split id->current_basic_block, and the new blocks will
4226 follow it; we'll trudge through them, processing their CALL_EXPRs
4229 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4231 pop_gimplify_context (NULL
);
4233 #ifdef ENABLE_CHECKING
4235 struct cgraph_edge
*e
;
4237 verify_cgraph_node (id
.dst_node
);
4239 /* Double check that we inlined everything we are supposed to inline. */
4240 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4241 gcc_assert (e
->inline_failed
);
4245 /* Fold queued statements. */
4246 fold_marked_statements (last
, id
.statements_to_fold
);
4247 pointer_set_destroy (id
.statements_to_fold
);
4249 gcc_assert (!id
.debug_stmts
);
4251 /* If we didn't inline into the function there is nothing to do. */
4255 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4258 delete_unreachable_blocks_update_callgraph (&id
);
4259 #ifdef ENABLE_CHECKING
4260 verify_cgraph_node (id
.dst_node
);
4263 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4264 not possible yet - the IPA passes might make various functions to not
4265 throw and they don't care to proactively update local EH info. This is
4266 done later in fixup_cfg pass that also execute the verification. */
4267 return (TODO_update_ssa
4269 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4270 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4271 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
4274 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4277 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4279 enum tree_code code
= TREE_CODE (*tp
);
4280 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4282 /* We make copies of most nodes. */
4283 if (IS_EXPR_CODE_CLASS (cl
)
4284 || code
== TREE_LIST
4286 || code
== TYPE_DECL
4287 || code
== OMP_CLAUSE
)
4289 /* Because the chain gets clobbered when we make a copy, we save it
4291 tree chain
= NULL_TREE
, new_tree
;
4293 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4294 chain
= TREE_CHAIN (*tp
);
4296 /* Copy the node. */
4297 new_tree
= copy_node (*tp
);
4299 /* Propagate mudflap marked-ness. */
4300 if (flag_mudflap
&& mf_marked_p (*tp
))
4305 /* Now, restore the chain, if appropriate. That will cause
4306 walk_tree to walk into the chain as well. */
4307 if (code
== PARM_DECL
4308 || code
== TREE_LIST
4309 || code
== OMP_CLAUSE
)
4310 TREE_CHAIN (*tp
) = chain
;
4312 /* For now, we don't update BLOCKs when we make copies. So, we
4313 have to nullify all BIND_EXPRs. */
4314 if (TREE_CODE (*tp
) == BIND_EXPR
)
4315 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4317 else if (code
== CONSTRUCTOR
)
4319 /* CONSTRUCTOR nodes need special handling because
4320 we need to duplicate the vector of elements. */
4323 new_tree
= copy_node (*tp
);
4325 /* Propagate mudflap marked-ness. */
4326 if (flag_mudflap
&& mf_marked_p (*tp
))
4329 CONSTRUCTOR_ELTS (new_tree
) = VEC_copy (constructor_elt
, gc
,
4330 CONSTRUCTOR_ELTS (*tp
));
4333 else if (code
== STATEMENT_LIST
)
4334 /* We used to just abort on STATEMENT_LIST, but we can run into them
4335 with statement-expressions (c++/40975). */
4336 copy_statement_list (tp
);
4337 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4339 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4341 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4346 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4347 information indicating to what new SAVE_EXPR this one should be mapped,
4348 use that one. Otherwise, create a new node and enter it in ST. FN is
4349 the function into which the copy will be placed. */
4352 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4354 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4358 /* See if we already encountered this SAVE_EXPR. */
4359 n
= (tree
*) pointer_map_contains (st
, *tp
);
4361 /* If we didn't already remap this SAVE_EXPR, do so now. */
4364 t
= copy_node (*tp
);
4366 /* Remember this SAVE_EXPR. */
4367 *pointer_map_insert (st
, *tp
) = t
;
4368 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4369 *pointer_map_insert (st
, t
) = t
;
4373 /* We've already walked into this SAVE_EXPR; don't do it again. */
4378 /* Replace this SAVE_EXPR with the copy. */
4382 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4383 copies the declaration and enters it in the splay_tree in DATA (which is
4384 really an `copy_body_data *'). */
4387 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
4390 copy_body_data
*id
= (copy_body_data
*) data
;
4392 /* Don't walk into types. */
4396 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
4398 tree decl
= TREE_OPERAND (*tp
, 0);
4400 /* Copy the decl and remember the copy. */
4401 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4407 /* Perform any modifications to EXPR required when it is unsaved. Does
4408 not recurse into EXPR's subtrees. */
4411 unsave_expr_1 (tree expr
)
4413 switch (TREE_CODE (expr
))
4416 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4417 It's OK for this to happen if it was part of a subtree that
4418 isn't immediately expanded, such as operand 2 of another
4420 if (TREE_OPERAND (expr
, 1))
4423 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4424 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4432 /* Called via walk_tree when an expression is unsaved. Using the
4433 splay_tree pointed to by ST (which is really a `splay_tree'),
4434 remaps all local declarations to appropriate replacements. */
4437 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
4439 copy_body_data
*id
= (copy_body_data
*) data
;
4440 struct pointer_map_t
*st
= id
->decl_map
;
4443 /* Only a local declaration (variable or label). */
4444 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
4445 || TREE_CODE (*tp
) == LABEL_DECL
)
4447 /* Lookup the declaration. */
4448 n
= (tree
*) pointer_map_contains (st
, *tp
);
4450 /* If it's there, remap it. */
4455 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
4457 else if (TREE_CODE (*tp
) == BIND_EXPR
)
4458 copy_bind_expr (tp
, walk_subtrees
, id
);
4459 else if (TREE_CODE (*tp
) == SAVE_EXPR
4460 || TREE_CODE (*tp
) == TARGET_EXPR
)
4461 remap_save_expr (tp
, st
, walk_subtrees
);
4464 copy_tree_r (tp
, walk_subtrees
, NULL
);
4466 /* Do whatever unsaving is required. */
4467 unsave_expr_1 (*tp
);
4470 /* Keep iterating. */
4474 /* Copies everything in EXPR and replaces variables, labels
4475 and SAVE_EXPRs local to EXPR. */
4478 unsave_expr_now (tree expr
)
4482 /* There's nothing to do for NULL_TREE. */
4487 memset (&id
, 0, sizeof (id
));
4488 id
.src_fn
= current_function_decl
;
4489 id
.dst_fn
= current_function_decl
;
4490 id
.decl_map
= pointer_map_create ();
4491 id
.debug_map
= NULL
;
4493 id
.copy_decl
= copy_decl_no_change
;
4494 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4495 id
.transform_new_cfg
= false;
4496 id
.transform_return_to_modify
= false;
4497 id
.transform_lang_insert_block
= NULL
;
4499 /* Walk the tree once to find local labels. */
4500 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
4502 /* Walk the tree again, copying, remapping, and unsaving. */
4503 walk_tree (&expr
, unsave_r
, &id
, NULL
);
4506 pointer_map_destroy (id
.decl_map
);
4508 pointer_map_destroy (id
.debug_map
);
4513 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4514 label, copies the declaration and enters it in the splay_tree in DATA (which
4515 is really a 'copy_body_data *'. */
4518 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4519 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4520 struct walk_stmt_info
*wi
)
4522 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4523 gimple stmt
= gsi_stmt (*gsip
);
4525 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4527 tree decl
= gimple_label_label (stmt
);
4529 /* Copy the decl and remember the copy. */
4530 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4537 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4538 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4539 remaps all local declarations to appropriate replacements in gimple
4543 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4545 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4546 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4547 struct pointer_map_t
*st
= id
->decl_map
;
4551 /* Only a local declaration (variable or label). */
4552 if ((TREE_CODE (expr
) == VAR_DECL
4553 && !TREE_STATIC (expr
))
4554 || TREE_CODE (expr
) == LABEL_DECL
)
4556 /* Lookup the declaration. */
4557 n
= (tree
*) pointer_map_contains (st
, expr
);
4559 /* If it's there, remap it. */
4564 else if (TREE_CODE (expr
) == STATEMENT_LIST
4565 || TREE_CODE (expr
) == BIND_EXPR
4566 || TREE_CODE (expr
) == SAVE_EXPR
)
4568 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4570 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4571 It's OK for this to happen if it was part of a subtree that
4572 isn't immediately expanded, such as operand 2 of another
4574 if (!TREE_OPERAND (expr
, 1))
4576 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4577 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4581 /* Keep iterating. */
4586 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4587 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4588 remaps all local declarations to appropriate replacements in gimple
4592 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4593 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4594 struct walk_stmt_info
*wi
)
4596 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4597 gimple stmt
= gsi_stmt (*gsip
);
4599 if (gimple_code (stmt
) == GIMPLE_BIND
)
4601 tree block
= gimple_bind_block (stmt
);
4605 remap_block (&block
, id
);
4606 gimple_bind_set_block (stmt
, block
);
4609 /* This will remap a lot of the same decls again, but this should be
4611 if (gimple_bind_vars (stmt
))
4612 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
), NULL
, id
));
4615 /* Keep iterating. */
4620 /* Copies everything in SEQ and replaces variables and labels local to
4621 current_function_decl. */
4624 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4627 struct walk_stmt_info wi
;
4628 struct pointer_set_t
*visited
;
4631 /* There's nothing to do for NULL_TREE. */
4636 memset (&id
, 0, sizeof (id
));
4637 id
.src_fn
= current_function_decl
;
4638 id
.dst_fn
= current_function_decl
;
4639 id
.decl_map
= pointer_map_create ();
4640 id
.debug_map
= NULL
;
4642 id
.copy_decl
= copy_decl_no_change
;
4643 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4644 id
.transform_new_cfg
= false;
4645 id
.transform_return_to_modify
= false;
4646 id
.transform_lang_insert_block
= NULL
;
4648 /* Walk the tree once to find local labels. */
4649 memset (&wi
, 0, sizeof (wi
));
4650 visited
= pointer_set_create ();
4653 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4654 pointer_set_destroy (visited
);
4656 copy
= gimple_seq_copy (seq
);
4658 /* Walk the copy, remapping decls. */
4659 memset (&wi
, 0, sizeof (wi
));
4661 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4664 pointer_map_destroy (id
.decl_map
);
4666 pointer_map_destroy (id
.debug_map
);
4672 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4675 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4684 debug_find_tree (tree top
, tree search
)
4686 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4690 /* Declare the variables created by the inliner. Add all the variables in
4691 VARS to BIND_EXPR. */
4694 declare_inline_vars (tree block
, tree vars
)
4697 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4699 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4700 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4701 add_local_decl (cfun
, t
);
4705 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4708 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4709 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4710 VAR_DECL translation. */
4713 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4715 /* Don't generate debug information for the copy if we wouldn't have
4716 generated it for the copy either. */
4717 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4718 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4720 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4721 declaration inspired this copy. */
4722 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4724 /* The new variable/label has no RTL, yet. */
4725 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4726 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4727 SET_DECL_RTL (copy
, 0);
4729 /* These args would always appear unused, if not for this. */
4730 TREE_USED (copy
) = 1;
4732 /* Set the context for the new declaration. */
4733 if (!DECL_CONTEXT (decl
))
4734 /* Globals stay global. */
4736 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4737 /* Things that weren't in the scope of the function we're inlining
4738 from aren't in the scope we're inlining to, either. */
4740 else if (TREE_STATIC (decl
))
4741 /* Function-scoped static variables should stay in the original
4745 /* Ordinary automatic local variables are now in the scope of the
4747 DECL_CONTEXT (copy
) = id
->dst_fn
;
4753 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4757 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4758 || TREE_CODE (decl
) == RESULT_DECL
);
4760 type
= TREE_TYPE (decl
);
4762 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4763 VAR_DECL
, DECL_NAME (decl
), type
);
4764 if (DECL_PT_UID_SET_P (decl
))
4765 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4766 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4767 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4768 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4769 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4771 return copy_decl_for_dup_finish (id
, decl
, copy
);
4774 /* Like copy_decl_to_var, but create a return slot object instead of a
4775 pointer variable for return by invisible reference. */
4778 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4782 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4783 || TREE_CODE (decl
) == RESULT_DECL
);
4785 type
= TREE_TYPE (decl
);
4786 if (DECL_BY_REFERENCE (decl
))
4787 type
= TREE_TYPE (type
);
4789 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4790 VAR_DECL
, DECL_NAME (decl
), type
);
4791 if (DECL_PT_UID_SET_P (decl
))
4792 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4793 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4794 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4795 if (!DECL_BY_REFERENCE (decl
))
4797 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4798 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4801 return copy_decl_for_dup_finish (id
, decl
, copy
);
4805 copy_decl_no_change (tree decl
, copy_body_data
*id
)
4809 copy
= copy_node (decl
);
4811 /* The COPY is not abstract; it will be generated in DST_FN. */
4812 DECL_ABSTRACT (copy
) = 0;
4813 lang_hooks
.dup_lang_specific_decl (copy
);
4815 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4816 been taken; it's for internal bookkeeping in expand_goto_internal. */
4817 if (TREE_CODE (copy
) == LABEL_DECL
)
4819 TREE_ADDRESSABLE (copy
) = 0;
4820 LABEL_DECL_UID (copy
) = -1;
4823 return copy_decl_for_dup_finish (id
, decl
, copy
);
4827 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
4829 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
4830 return copy_decl_to_var (decl
, id
);
4832 return copy_decl_no_change (decl
, id
);
4835 /* Return a copy of the function's argument tree. */
4837 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
4838 bitmap args_to_skip
, tree
*vars
)
4841 tree new_parm
= NULL
;
4846 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
4847 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
4849 tree new_tree
= remap_decl (arg
, id
);
4850 if (TREE_CODE (new_tree
) != PARM_DECL
)
4851 new_tree
= id
->copy_decl (arg
, id
);
4852 lang_hooks
.dup_lang_specific_decl (new_tree
);
4854 parg
= &DECL_CHAIN (new_tree
);
4856 else if (!pointer_map_contains (id
->decl_map
, arg
))
4858 /* Make an equivalent VAR_DECL. If the argument was used
4859 as temporary variable later in function, the uses will be
4860 replaced by local variable. */
4861 tree var
= copy_decl_to_var (arg
, id
);
4862 insert_decl_map (id
, arg
, var
);
4863 /* Declare this new variable. */
4864 DECL_CHAIN (var
) = *vars
;
4870 /* Return a copy of the function's static chain. */
4872 copy_static_chain (tree static_chain
, copy_body_data
* id
)
4874 tree
*chain_copy
, *pvar
;
4876 chain_copy
= &static_chain
;
4877 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
4879 tree new_tree
= remap_decl (*pvar
, id
);
4880 lang_hooks
.dup_lang_specific_decl (new_tree
);
4881 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
4884 return static_chain
;
4887 /* Return true if the function is allowed to be versioned.
4888 This is a guard for the versioning functionality. */
4891 tree_versionable_function_p (tree fndecl
)
4893 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
4894 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
4897 /* Delete all unreachable basic blocks and update callgraph.
4898 Doing so is somewhat nontrivial because we need to update all clones and
4899 remove inline function that become unreachable. */
4902 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
4904 bool changed
= false;
4905 basic_block b
, next_bb
;
4907 find_unreachable_blocks ();
4909 /* Delete all unreachable basic blocks. */
4911 for (b
= ENTRY_BLOCK_PTR
->next_bb
; b
!= EXIT_BLOCK_PTR
; b
= next_bb
)
4913 next_bb
= b
->next_bb
;
4915 if (!(b
->flags
& BB_REACHABLE
))
4917 gimple_stmt_iterator bsi
;
4919 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4920 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
)
4922 struct cgraph_edge
*e
;
4923 struct cgraph_node
*node
;
4925 if ((e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
4927 if (!e
->inline_failed
)
4928 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
4930 cgraph_remove_edge (e
);
4932 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
4933 && id
->dst_node
->clones
)
4934 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
4936 if ((e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
4938 if (!e
->inline_failed
)
4939 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
4941 cgraph_remove_edge (e
);
4945 node
= node
->clones
;
4946 else if (node
->next_sibling_clone
)
4947 node
= node
->next_sibling_clone
;
4950 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
4951 node
= node
->clone_of
;
4952 if (node
!= id
->dst_node
)
4953 node
= node
->next_sibling_clone
;
4957 delete_basic_block (b
);
4965 /* Update clone info after duplication. */
4968 update_clone_info (copy_body_data
* id
)
4970 struct cgraph_node
*node
;
4971 if (!id
->dst_node
->clones
)
4973 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
4975 /* First update replace maps to match the new body. */
4976 if (node
->clone
.tree_map
)
4979 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, node
->clone
.tree_map
); i
++)
4981 struct ipa_replace_map
*replace_info
;
4982 replace_info
= VEC_index (ipa_replace_map_p
, node
->clone
.tree_map
, i
);
4983 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
4984 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
4988 node
= node
->clones
;
4989 else if (node
->next_sibling_clone
)
4990 node
= node
->next_sibling_clone
;
4993 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
4994 node
= node
->clone_of
;
4995 if (node
!= id
->dst_node
)
4996 node
= node
->next_sibling_clone
;
5001 /* Create a copy of a function's tree.
5002 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5003 of the original function and the new copied function
5004 respectively. In case we want to replace a DECL
5005 tree with another tree while duplicating the function's
5006 body, TREE_MAP represents the mapping between these
5007 trees. If UPDATE_CLONES is set, the call_stmt fields
5008 of edges of clones of the function will be updated.
5010 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5012 If SKIP_RETURN is true, the new version will return void.
5013 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5014 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5017 tree_function_versioning (tree old_decl
, tree new_decl
,
5018 VEC(ipa_replace_map_p
,gc
)* tree_map
,
5019 bool update_clones
, bitmap args_to_skip
,
5020 bool skip_return
, bitmap blocks_to_copy
,
5021 basic_block new_entry
)
5023 struct cgraph_node
*old_version_node
;
5024 struct cgraph_node
*new_version_node
;
5028 struct ipa_replace_map
*replace_info
;
5029 basic_block old_entry_block
, bb
;
5030 VEC (gimple
, heap
) *init_stmts
= VEC_alloc (gimple
, heap
, 10);
5032 tree old_current_function_decl
= current_function_decl
;
5033 tree vars
= NULL_TREE
;
5035 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5036 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5037 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5039 old_version_node
= cgraph_get_node (old_decl
);
5040 gcc_checking_assert (old_version_node
);
5041 new_version_node
= cgraph_get_node (new_decl
);
5042 gcc_checking_assert (new_version_node
);
5044 /* Copy over debug args. */
5045 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5047 VEC(tree
, gc
) **new_debug_args
, **old_debug_args
;
5048 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5049 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5050 old_debug_args
= decl_debug_args_lookup (old_decl
);
5053 new_debug_args
= decl_debug_args_insert (new_decl
);
5054 *new_debug_args
= VEC_copy (tree
, gc
, *old_debug_args
);
5058 /* Output the inlining info for this abstract function, since it has been
5059 inlined. If we don't do this now, we can lose the information about the
5060 variables in the function when the blocks get blown away as soon as we
5061 remove the cgraph node. */
5062 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5064 DECL_ARTIFICIAL (new_decl
) = 1;
5065 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5066 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5068 /* Prepare the data structures for the tree copy. */
5069 memset (&id
, 0, sizeof (id
));
5071 /* Generate a new name for the new version. */
5072 id
.statements_to_fold
= pointer_set_create ();
5074 id
.decl_map
= pointer_map_create ();
5075 id
.debug_map
= NULL
;
5076 id
.src_fn
= old_decl
;
5077 id
.dst_fn
= new_decl
;
5078 id
.src_node
= old_version_node
;
5079 id
.dst_node
= new_version_node
;
5080 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5081 if (id
.src_node
->ipa_transforms_to_apply
)
5083 VEC(ipa_opt_pass
,heap
) * old_transforms_to_apply
= id
.dst_node
->ipa_transforms_to_apply
;
5086 id
.dst_node
->ipa_transforms_to_apply
= VEC_copy (ipa_opt_pass
, heap
,
5087 id
.src_node
->ipa_transforms_to_apply
);
5088 for (i
= 0; i
< VEC_length (ipa_opt_pass
, old_transforms_to_apply
); i
++)
5089 VEC_safe_push (ipa_opt_pass
, heap
, id
.dst_node
->ipa_transforms_to_apply
,
5090 VEC_index (ipa_opt_pass
,
5091 old_transforms_to_apply
,
5093 VEC_free (ipa_opt_pass
, heap
, old_transforms_to_apply
);
5096 id
.copy_decl
= copy_decl_no_change
;
5097 id
.transform_call_graph_edges
5098 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5099 id
.transform_new_cfg
= true;
5100 id
.transform_return_to_modify
= false;
5101 id
.transform_lang_insert_block
= NULL
;
5103 current_function_decl
= new_decl
;
5104 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION
5105 (DECL_STRUCT_FUNCTION (old_decl
));
5106 initialize_cfun (new_decl
, old_decl
,
5107 old_entry_block
->count
);
5108 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5109 = id
.src_cfun
->gimple_df
->ipa_pta
;
5110 push_cfun (DECL_STRUCT_FUNCTION (new_decl
));
5112 /* Copy the function's static chain. */
5113 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5115 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5116 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5119 /* If there's a tree_map, prepare for substitution. */
5121 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, tree_map
); i
++)
5124 replace_info
= VEC_index (ipa_replace_map_p
, tree_map
, i
);
5125 if (replace_info
->replace_p
)
5127 tree op
= replace_info
->new_tree
;
5128 if (!replace_info
->old_tree
)
5130 int i
= replace_info
->parm_num
;
5132 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5134 replace_info
->old_tree
= parm
;
5140 if (TREE_CODE (op
) == VIEW_CONVERT_EXPR
)
5141 op
= TREE_OPERAND (op
, 0);
5143 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5144 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5145 replace_info
->new_tree
, id
.src_fn
,
5149 VEC_safe_push (gimple
, heap
, init_stmts
, init
);
5152 /* Copy the function's arguments. */
5153 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5154 DECL_ARGUMENTS (new_decl
) =
5155 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5156 args_to_skip
, &vars
);
5158 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5159 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5161 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5163 if (!VEC_empty (tree
, DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5164 /* Add local vars. */
5165 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5167 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5169 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5171 DECL_RESULT (new_decl
)
5172 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5173 RESULT_DECL
, NULL_TREE
, void_type_node
);
5174 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5175 cfun
->returns_struct
= 0;
5176 cfun
->returns_pcc_struct
= 0;
5181 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5182 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5183 if (gimple_in_ssa_p (id
.src_cfun
)
5184 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5185 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5187 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5188 insert_decl_map (&id
, old_name
, new_name
);
5189 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5190 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5194 /* Copy the Function's body. */
5195 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5196 ENTRY_BLOCK_PTR
, EXIT_BLOCK_PTR
, blocks_to_copy
, new_entry
);
5198 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5199 number_blocks (new_decl
);
5201 /* We want to create the BB unconditionally, so that the addition of
5202 debug stmts doesn't affect BB count, which may in the end cause
5203 codegen differences. */
5204 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR
));
5205 while (VEC_length (gimple
, init_stmts
))
5206 insert_init_stmt (&id
, bb
, VEC_pop (gimple
, init_stmts
));
5207 update_clone_info (&id
);
5209 /* Remap the nonlocal_goto_save_area, if any. */
5210 if (cfun
->nonlocal_goto_save_area
)
5212 struct walk_stmt_info wi
;
5214 memset (&wi
, 0, sizeof (wi
));
5216 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5220 pointer_map_destroy (id
.decl_map
);
5222 pointer_map_destroy (id
.debug_map
);
5223 free_dominance_info (CDI_DOMINATORS
);
5224 free_dominance_info (CDI_POST_DOMINATORS
);
5226 fold_marked_statements (0, id
.statements_to_fold
);
5227 pointer_set_destroy (id
.statements_to_fold
);
5228 fold_cond_expr_cond ();
5229 delete_unreachable_blocks_update_callgraph (&id
);
5230 if (id
.dst_node
->analyzed
)
5231 cgraph_rebuild_references ();
5232 update_ssa (TODO_update_ssa
);
5234 /* After partial cloning we need to rescale frequencies, so they are
5235 within proper range in the cloned function. */
5238 struct cgraph_edge
*e
;
5239 rebuild_frequencies ();
5241 new_version_node
->count
= ENTRY_BLOCK_PTR
->count
;
5242 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5244 basic_block bb
= gimple_bb (e
->call_stmt
);
5245 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5247 e
->count
= bb
->count
;
5249 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5251 basic_block bb
= gimple_bb (e
->call_stmt
);
5252 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5254 e
->count
= bb
->count
;
5258 free_dominance_info (CDI_DOMINATORS
);
5259 free_dominance_info (CDI_POST_DOMINATORS
);
5261 gcc_assert (!id
.debug_stmts
);
5262 VEC_free (gimple
, heap
, init_stmts
);
5264 current_function_decl
= old_current_function_decl
;
5265 gcc_assert (!current_function_decl
5266 || DECL_STRUCT_FUNCTION (current_function_decl
) == cfun
);
5270 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5271 the callee and return the inlined body on success. */
5274 maybe_inline_call_in_expr (tree exp
)
5276 tree fn
= get_callee_fndecl (exp
);
5278 /* We can only try to inline "const" functions. */
5279 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5281 struct pointer_map_t
*decl_map
= pointer_map_create ();
5282 call_expr_arg_iterator iter
;
5286 /* Remap the parameters. */
5287 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5289 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5290 *pointer_map_insert (decl_map
, param
) = arg
;
5292 memset (&id
, 0, sizeof (id
));
5294 id
.dst_fn
= current_function_decl
;
5295 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5296 id
.decl_map
= decl_map
;
5298 id
.copy_decl
= copy_decl_no_change
;
5299 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5300 id
.transform_new_cfg
= false;
5301 id
.transform_return_to_modify
= true;
5302 id
.transform_lang_insert_block
= NULL
;
5304 /* Make sure not to unshare trees behind the front-end's back
5305 since front-end specific mechanisms may rely on sharing. */
5306 id
.regimplify
= false;
5307 id
.do_not_unshare
= true;
5309 /* We're not inside any EH region. */
5312 t
= copy_tree_body (&id
);
5313 pointer_map_destroy (decl_map
);
5315 /* We can only return something suitable for use in a GENERIC
5317 if (TREE_CODE (t
) == MODIFY_EXPR
)
5318 return TREE_OPERAND (t
, 1);
5324 /* Duplicate a type, fields and all. */
5327 build_duplicate_type (tree type
)
5329 struct copy_body_data id
;
5331 memset (&id
, 0, sizeof (id
));
5332 id
.src_fn
= current_function_decl
;
5333 id
.dst_fn
= current_function_decl
;
5335 id
.decl_map
= pointer_map_create ();
5336 id
.debug_map
= NULL
;
5337 id
.copy_decl
= copy_decl_no_change
;
5339 type
= remap_type_1 (type
, &id
);
5341 pointer_map_destroy (id
.decl_map
);
5343 pointer_map_destroy (id
.debug_map
);
5345 TYPE_CANONICAL (type
) = type
;