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 if (TREE_CODE (*tp
) == MEM_REF
)
835 tree ptr
= TREE_OPERAND (*tp
, 0);
836 tree type
= remap_type (TREE_TYPE (*tp
), id
);
839 /* We need to re-canonicalize MEM_REFs from inline substitutions
840 that can happen when a pointer argument is an ADDR_EXPR.
841 Recurse here manually to allow that. */
842 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
843 *tp
= fold_build2 (MEM_REF
, type
,
844 ptr
, TREE_OPERAND (*tp
, 1));
845 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
846 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
847 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
848 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
853 /* Here is the "usual case". Copy this tree node, and then
854 tweak some special cases. */
855 copy_tree_r (tp
, walk_subtrees
, NULL
);
857 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
858 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
860 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
862 /* The copied TARGET_EXPR has never been expanded, even if the
863 original node was expanded already. */
864 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
865 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
867 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
869 /* Variable substitution need not be simple. In particular,
870 the MEM_REF substitution above. Make sure that
871 TREE_CONSTANT and friends are up-to-date. */
872 int invariant
= is_gimple_min_invariant (*tp
);
873 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
874 recompute_tree_invariant_for_addr_expr (*tp
);
876 /* If this used to be invariant, but is not any longer,
877 then regimplification is probably needed. */
878 if (invariant
&& !is_gimple_min_invariant (*tp
))
879 id
->regimplify
= true;
885 /* Update the TREE_BLOCK for the cloned expr. */
888 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
889 tree old_block
= TREE_BLOCK (*tp
);
893 n
= (tree
*) pointer_map_contains (id
->decl_map
,
898 TREE_SET_BLOCK (*tp
, new_block
);
901 /* Keep iterating. */
906 /* Called from copy_body_id via walk_tree. DATA is really a
907 `copy_body_data *'. */
910 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
912 copy_body_data
*id
= (copy_body_data
*) data
;
913 tree fn
= id
->src_fn
;
916 /* Begin by recognizing trees that we'll completely rewrite for the
917 inlining context. Our output for these trees is completely
918 different from out input (e.g. RETURN_EXPR is deleted, and morphs
919 into an edge). Further down, we'll handle trees that get
920 duplicated and/or tweaked. */
922 /* When requested, RETURN_EXPRs should be transformed to just the
923 contained MODIFY_EXPR. The branch semantics of the return will
924 be handled elsewhere by manipulating the CFG rather than a statement. */
925 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
927 tree assignment
= TREE_OPERAND (*tp
, 0);
929 /* If we're returning something, just turn that into an
930 assignment into the equivalent of the original RESULT_DECL.
931 If the "assignment" is just the result decl, the result
932 decl has already been set (e.g. a recent "foo (&result_decl,
933 ...)"); just toss the entire RETURN_EXPR. */
934 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
936 /* Replace the RETURN_EXPR with (a copy of) the
937 MODIFY_EXPR hanging underneath. */
938 *tp
= copy_node (assignment
);
940 else /* Else the RETURN_EXPR returns no value. */
943 return (tree
) (void *)1;
946 else if (TREE_CODE (*tp
) == SSA_NAME
)
948 *tp
= remap_ssa_name (*tp
, id
);
953 /* Local variables and labels need to be replaced by equivalent
954 variables. We don't want to copy static variables; there's only
955 one of those, no matter how many times we inline the containing
956 function. Similarly for globals from an outer function. */
957 else if (auto_var_in_fn_p (*tp
, fn
))
961 /* Remap the declaration. */
962 new_decl
= remap_decl (*tp
, id
);
963 gcc_assert (new_decl
);
964 /* Replace this variable with the copy. */
965 STRIP_TYPE_NOPS (new_decl
);
969 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
970 copy_statement_list (tp
);
971 else if (TREE_CODE (*tp
) == SAVE_EXPR
972 || TREE_CODE (*tp
) == TARGET_EXPR
)
973 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
974 else if (TREE_CODE (*tp
) == LABEL_DECL
975 && (! DECL_CONTEXT (*tp
)
976 || decl_function_context (*tp
) == id
->src_fn
))
977 /* These may need to be remapped for EH handling. */
978 *tp
= remap_decl (*tp
, id
);
979 else if (TREE_CODE (*tp
) == BIND_EXPR
)
980 copy_bind_expr (tp
, walk_subtrees
, id
);
981 /* Types may need remapping as well. */
982 else if (TYPE_P (*tp
))
983 *tp
= remap_type (*tp
, id
);
985 /* If this is a constant, we have to copy the node iff the type will be
986 remapped. copy_tree_r will not copy a constant. */
987 else if (CONSTANT_CLASS_P (*tp
))
989 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
991 if (new_type
== TREE_TYPE (*tp
))
994 else if (TREE_CODE (*tp
) == INTEGER_CST
)
995 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
996 TREE_INT_CST_HIGH (*tp
));
999 *tp
= copy_node (*tp
);
1000 TREE_TYPE (*tp
) = new_type
;
1004 /* Otherwise, just copy the node. Note that copy_tree_r already
1005 knows not to copy VAR_DECLs, etc., so this is safe. */
1008 /* Here we handle trees that are not completely rewritten.
1009 First we detect some inlining-induced bogosities for
1011 if (TREE_CODE (*tp
) == MODIFY_EXPR
1012 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1013 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1015 /* Some assignments VAR = VAR; don't generate any rtl code
1016 and thus don't count as variable modification. Avoid
1017 keeping bogosities like 0 = 0. */
1018 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1021 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1025 STRIP_TYPE_NOPS (value
);
1026 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1028 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1029 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1033 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1035 /* Get rid of *& from inline substitutions that can happen when a
1036 pointer argument is an ADDR_EXPR. */
1037 tree decl
= TREE_OPERAND (*tp
, 0);
1040 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1045 /* If we happen to get an ADDR_EXPR in n->value, strip
1046 it manually here as we'll eventually get ADDR_EXPRs
1047 which lie about their types pointed to. In this case
1048 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1049 but we absolutely rely on that. As fold_indirect_ref
1050 does other useful transformations, try that first, though. */
1051 tree type
= TREE_TYPE (TREE_TYPE (*n
));
1052 if (id
->do_not_unshare
)
1055 new_tree
= unshare_expr (*n
);
1057 *tp
= gimple_fold_indirect_ref (new_tree
);
1060 if (TREE_CODE (new_tree
) == ADDR_EXPR
)
1062 *tp
= fold_indirect_ref_1 (EXPR_LOCATION (new_tree
),
1064 /* ??? We should either assert here or build
1065 a VIEW_CONVERT_EXPR instead of blindly leaking
1066 incompatible types to our IL. */
1068 *tp
= TREE_OPERAND (new_tree
, 0);
1072 *tp
= build1 (INDIRECT_REF
, type
, new_tree
);
1073 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1074 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1075 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1076 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
1083 else if (TREE_CODE (*tp
) == MEM_REF
)
1085 /* We need to re-canonicalize MEM_REFs from inline substitutions
1086 that can happen when a pointer argument is an ADDR_EXPR. */
1087 tree decl
= TREE_OPERAND (*tp
, 0);
1090 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1094 *tp
= fold_build2 (MEM_REF
, TREE_TYPE (*tp
),
1095 unshare_expr (*n
), TREE_OPERAND (*tp
, 1));
1096 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1097 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1103 /* Here is the "usual case". Copy this tree node, and then
1104 tweak some special cases. */
1105 copy_tree_r (tp
, walk_subtrees
, NULL
);
1107 /* If EXPR has block defined, map it to newly constructed block.
1108 When inlining we want EXPRs without block appear in the block
1109 of function call if we are not remapping a type. */
1112 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1113 if (TREE_BLOCK (*tp
))
1116 n
= (tree
*) pointer_map_contains (id
->decl_map
,
1121 TREE_SET_BLOCK (*tp
, new_block
);
1124 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1125 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1127 /* The copied TARGET_EXPR has never been expanded, even if the
1128 original node was expanded already. */
1129 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1131 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1132 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1135 /* Variable substitution need not be simple. In particular, the
1136 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1137 and friends are up-to-date. */
1138 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1140 int invariant
= is_gimple_min_invariant (*tp
);
1141 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1143 /* Handle the case where we substituted an INDIRECT_REF
1144 into the operand of the ADDR_EXPR. */
1145 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1146 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1148 recompute_tree_invariant_for_addr_expr (*tp
);
1150 /* If this used to be invariant, but is not any longer,
1151 then regimplification is probably needed. */
1152 if (invariant
&& !is_gimple_min_invariant (*tp
))
1153 id
->regimplify
= true;
1159 /* Keep iterating. */
1163 /* Helper for remap_gimple_stmt. Given an EH region number for the
1164 source function, map that to the duplicate EH region number in
1165 the destination function. */
1168 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1170 eh_region old_r
, new_r
;
1173 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1174 slot
= pointer_map_contains (id
->eh_map
, old_r
);
1175 new_r
= (eh_region
) *slot
;
1177 return new_r
->index
;
1180 /* Similar, but operate on INTEGER_CSTs. */
1183 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1187 old_nr
= tree_low_cst (old_t_nr
, 0);
1188 new_nr
= remap_eh_region_nr (old_nr
, id
);
1190 return build_int_cst (integer_type_node
, new_nr
);
1193 /* Helper for copy_bb. Remap statement STMT using the inlining
1194 information in ID. Return the new statement copy. */
1197 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1200 struct walk_stmt_info wi
;
1202 bool skip_first
= false;
1204 /* Begin by recognizing trees that we'll completely rewrite for the
1205 inlining context. Our output for these trees is completely
1206 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1207 into an edge). Further down, we'll handle trees that get
1208 duplicated and/or tweaked. */
1210 /* When requested, GIMPLE_RETURNs should be transformed to just the
1211 contained GIMPLE_ASSIGN. The branch semantics of the return will
1212 be handled elsewhere by manipulating the CFG rather than the
1214 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1216 tree retval
= gimple_return_retval (stmt
);
1218 /* If we're returning something, just turn that into an
1219 assignment into the equivalent of the original RESULT_DECL.
1220 If RETVAL is just the result decl, the result decl has
1221 already been set (e.g. a recent "foo (&result_decl, ...)");
1222 just toss the entire GIMPLE_RETURN. */
1224 && (TREE_CODE (retval
) != RESULT_DECL
1225 && (TREE_CODE (retval
) != SSA_NAME
1226 || ! SSA_NAME_VAR (retval
)
1227 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1229 copy
= gimple_build_assign (id
->retvar
, retval
);
1230 /* id->retvar is already substituted. Skip it on later remapping. */
1234 return gimple_build_nop ();
1236 else if (gimple_has_substatements (stmt
))
1240 /* When cloning bodies from the C++ front end, we will be handed bodies
1241 in High GIMPLE form. Handle here all the High GIMPLE statements that
1242 have embedded statements. */
1243 switch (gimple_code (stmt
))
1246 copy
= copy_gimple_bind (stmt
, id
);
1250 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1251 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1254 case GIMPLE_EH_FILTER
:
1255 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1256 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1260 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1261 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1262 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1265 case GIMPLE_WITH_CLEANUP_EXPR
:
1266 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1267 copy
= gimple_build_wce (s1
);
1270 case GIMPLE_OMP_PARALLEL
:
1271 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1272 copy
= gimple_build_omp_parallel
1274 gimple_omp_parallel_clauses (stmt
),
1275 gimple_omp_parallel_child_fn (stmt
),
1276 gimple_omp_parallel_data_arg (stmt
));
1279 case GIMPLE_OMP_TASK
:
1280 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1281 copy
= gimple_build_omp_task
1283 gimple_omp_task_clauses (stmt
),
1284 gimple_omp_task_child_fn (stmt
),
1285 gimple_omp_task_data_arg (stmt
),
1286 gimple_omp_task_copy_fn (stmt
),
1287 gimple_omp_task_arg_size (stmt
),
1288 gimple_omp_task_arg_align (stmt
));
1291 case GIMPLE_OMP_FOR
:
1292 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1293 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1294 copy
= gimple_build_omp_for (s1
, gimple_omp_for_clauses (stmt
),
1295 gimple_omp_for_collapse (stmt
), s2
);
1298 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1300 gimple_omp_for_set_index (copy
, i
,
1301 gimple_omp_for_index (stmt
, i
));
1302 gimple_omp_for_set_initial (copy
, i
,
1303 gimple_omp_for_initial (stmt
, i
));
1304 gimple_omp_for_set_final (copy
, i
,
1305 gimple_omp_for_final (stmt
, i
));
1306 gimple_omp_for_set_incr (copy
, i
,
1307 gimple_omp_for_incr (stmt
, i
));
1308 gimple_omp_for_set_cond (copy
, i
,
1309 gimple_omp_for_cond (stmt
, i
));
1314 case GIMPLE_OMP_MASTER
:
1315 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1316 copy
= gimple_build_omp_master (s1
);
1319 case GIMPLE_OMP_ORDERED
:
1320 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1321 copy
= gimple_build_omp_ordered (s1
);
1324 case GIMPLE_OMP_SECTION
:
1325 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1326 copy
= gimple_build_omp_section (s1
);
1329 case GIMPLE_OMP_SECTIONS
:
1330 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1331 copy
= gimple_build_omp_sections
1332 (s1
, gimple_omp_sections_clauses (stmt
));
1335 case GIMPLE_OMP_SINGLE
:
1336 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1337 copy
= gimple_build_omp_single
1338 (s1
, gimple_omp_single_clauses (stmt
));
1341 case GIMPLE_OMP_CRITICAL
:
1342 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1344 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1347 case GIMPLE_TRANSACTION
:
1348 s1
= remap_gimple_seq (gimple_transaction_body (stmt
), id
);
1349 copy
= gimple_build_transaction (s1
, gimple_transaction_label (stmt
));
1350 gimple_transaction_set_subcode (copy
, gimple_transaction_subcode (stmt
));
1359 if (gimple_assign_copy_p (stmt
)
1360 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1361 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1363 /* Here we handle statements that are not completely rewritten.
1364 First we detect some inlining-induced bogosities for
1367 /* Some assignments VAR = VAR; don't generate any rtl code
1368 and thus don't count as variable modification. Avoid
1369 keeping bogosities like 0 = 0. */
1370 tree decl
= gimple_assign_lhs (stmt
), value
;
1373 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1377 STRIP_TYPE_NOPS (value
);
1378 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1379 return gimple_build_nop ();
1383 if (gimple_debug_bind_p (stmt
))
1385 copy
= gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1386 gimple_debug_bind_get_value (stmt
),
1388 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, copy
);
1391 if (gimple_debug_source_bind_p (stmt
))
1393 copy
= gimple_build_debug_source_bind
1394 (gimple_debug_source_bind_get_var (stmt
),
1395 gimple_debug_source_bind_get_value (stmt
), stmt
);
1396 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, copy
);
1400 /* Create a new deep copy of the statement. */
1401 copy
= gimple_copy (stmt
);
1403 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1404 RESX and EH_DISPATCH. */
1406 switch (gimple_code (copy
))
1410 tree r
, fndecl
= gimple_call_fndecl (copy
);
1411 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1412 switch (DECL_FUNCTION_CODE (fndecl
))
1414 case BUILT_IN_EH_COPY_VALUES
:
1415 r
= gimple_call_arg (copy
, 1);
1416 r
= remap_eh_region_tree_nr (r
, id
);
1417 gimple_call_set_arg (copy
, 1, r
);
1420 case BUILT_IN_EH_POINTER
:
1421 case BUILT_IN_EH_FILTER
:
1422 r
= gimple_call_arg (copy
, 0);
1423 r
= remap_eh_region_tree_nr (r
, id
);
1424 gimple_call_set_arg (copy
, 0, r
);
1431 /* Reset alias info if we didn't apply measures to
1432 keep it valid over inlining by setting DECL_PT_UID. */
1433 if (!id
->src_cfun
->gimple_df
1434 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1435 gimple_call_reset_alias_info (copy
);
1441 int r
= gimple_resx_region (copy
);
1442 r
= remap_eh_region_nr (r
, id
);
1443 gimple_resx_set_region (copy
, r
);
1447 case GIMPLE_EH_DISPATCH
:
1449 int r
= gimple_eh_dispatch_region (copy
);
1450 r
= remap_eh_region_nr (r
, id
);
1451 gimple_eh_dispatch_set_region (copy
, r
);
1460 /* If STMT has a block defined, map it to the newly constructed
1461 block. When inlining we want statements without a block to
1462 appear in the block of the function call. */
1463 new_block
= id
->block
;
1464 if (gimple_block (copy
))
1467 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1472 gimple_set_block (copy
, new_block
);
1474 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1477 /* Remap all the operands in COPY. */
1478 memset (&wi
, 0, sizeof (wi
));
1481 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1483 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1485 /* Clear the copied virtual operands. We are not remapping them here
1486 but are going to recreate them from scratch. */
1487 if (gimple_has_mem_ops (copy
))
1489 gimple_set_vdef (copy
, NULL_TREE
);
1490 gimple_set_vuse (copy
, NULL_TREE
);
1497 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1501 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1502 gcov_type count_scale
)
1504 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1505 basic_block copy_basic_block
;
1510 /* Search for previous copied basic block. */
1513 prev
= prev
->prev_bb
;
1515 /* create_basic_block() will append every new block to
1516 basic_block_info automatically. */
1517 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1518 (basic_block
) prev
->aux
);
1519 copy_basic_block
->count
= bb
->count
* count_scale
/ REG_BR_PROB_BASE
;
1521 /* We are going to rebuild frequencies from scratch. These values
1522 have just small importance to drive canonicalize_loop_headers. */
1523 freq
= ((gcov_type
)bb
->frequency
* frequency_scale
/ REG_BR_PROB_BASE
);
1525 /* We recompute frequencies after inlining, so this is quite safe. */
1526 if (freq
> BB_FREQ_MAX
)
1528 copy_basic_block
->frequency
= freq
;
1530 copy_gsi
= gsi_start_bb (copy_basic_block
);
1532 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1534 gimple stmt
= gsi_stmt (gsi
);
1535 gimple orig_stmt
= stmt
;
1537 id
->regimplify
= false;
1538 stmt
= remap_gimple_stmt (stmt
, id
);
1539 if (gimple_nop_p (stmt
))
1542 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1545 /* With return slot optimization we can end up with
1546 non-gimple (foo *)&this->m, fix that here. */
1547 if (is_gimple_assign (stmt
)
1548 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1549 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1552 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1553 gimple_assign_rhs1 (stmt
),
1555 GSI_CONTINUE_LINKING
);
1556 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1557 id
->regimplify
= false;
1560 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1563 gimple_regimplify_operands (stmt
, &seq_gsi
);
1565 /* If copy_basic_block has been empty at the start of this iteration,
1566 call gsi_start_bb again to get at the newly added statements. */
1567 if (gsi_end_p (copy_gsi
))
1568 copy_gsi
= gsi_start_bb (copy_basic_block
);
1570 gsi_next (©_gsi
);
1572 /* Process the new statement. The call to gimple_regimplify_operands
1573 possibly turned the statement into multiple statements, we
1574 need to process all of them. */
1579 stmt
= gsi_stmt (copy_gsi
);
1580 if (is_gimple_call (stmt
)
1581 && gimple_call_va_arg_pack_p (stmt
)
1584 /* __builtin_va_arg_pack () should be replaced by
1585 all arguments corresponding to ... in the caller. */
1588 VEC(tree
, heap
) *argarray
;
1589 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1592 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1595 /* Create the new array of arguments. */
1596 n
= nargs
+ gimple_call_num_args (stmt
);
1597 argarray
= VEC_alloc (tree
, heap
, n
);
1598 VEC_safe_grow (tree
, heap
, argarray
, n
);
1600 /* Copy all the arguments before '...' */
1601 memcpy (VEC_address (tree
, argarray
),
1602 gimple_call_arg_ptr (stmt
, 0),
1603 gimple_call_num_args (stmt
) * sizeof (tree
));
1605 /* Append the arguments passed in '...' */
1606 memcpy (VEC_address(tree
, argarray
) + gimple_call_num_args (stmt
),
1607 gimple_call_arg_ptr (id
->gimple_call
, 0)
1608 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1609 nargs
* sizeof (tree
));
1611 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1614 VEC_free (tree
, heap
, argarray
);
1616 /* Copy all GIMPLE_CALL flags, location and block, except
1617 GF_CALL_VA_ARG_PACK. */
1618 gimple_call_copy_flags (new_call
, stmt
);
1619 gimple_call_set_va_arg_pack (new_call
, false);
1620 gimple_set_location (new_call
, gimple_location (stmt
));
1621 gimple_set_block (new_call
, gimple_block (stmt
));
1622 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1624 gsi_replace (©_gsi
, new_call
, false);
1627 else if (is_gimple_call (stmt
)
1629 && (decl
= gimple_call_fndecl (stmt
))
1630 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1631 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1633 /* __builtin_va_arg_pack_len () should be replaced by
1634 the number of anonymous arguments. */
1635 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1639 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1642 count
= build_int_cst (integer_type_node
, nargs
);
1643 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1644 gsi_replace (©_gsi
, new_stmt
, false);
1648 /* Statements produced by inlining can be unfolded, especially
1649 when we constant propagated some operands. We can't fold
1650 them right now for two reasons:
1651 1) folding require SSA_NAME_DEF_STMTs to be correct
1652 2) we can't change function calls to builtins.
1653 So we just mark statement for later folding. We mark
1654 all new statements, instead just statements that has changed
1655 by some nontrivial substitution so even statements made
1656 foldable indirectly are updated. If this turns out to be
1657 expensive, copy_body can be told to watch for nontrivial
1659 if (id
->statements_to_fold
)
1660 pointer_set_insert (id
->statements_to_fold
, stmt
);
1662 /* We're duplicating a CALL_EXPR. Find any corresponding
1663 callgraph edges and update or duplicate them. */
1664 if (is_gimple_call (stmt
))
1666 struct cgraph_edge
*edge
;
1669 switch (id
->transform_call_graph_edges
)
1671 case CB_CGE_DUPLICATE
:
1672 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1675 int edge_freq
= edge
->frequency
;
1676 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1678 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1680 /* We could also just rescale the frequency, but
1681 doing so would introduce roundoff errors and make
1682 verifier unhappy. */
1684 = compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1687 && profile_status_for_function (cfun
) != PROFILE_ABSENT
1688 && (edge_freq
> edge
->frequency
+ 10
1689 || edge_freq
< edge
->frequency
- 10))
1691 fprintf (dump_file
, "Edge frequency estimated by "
1692 "cgraph %i diverge from inliner's estimate %i\n",
1696 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1699 copy_basic_block
->frequency
);
1701 stmt
= cgraph_redirect_edge_call_stmt_to_callee (edge
);
1705 case CB_CGE_MOVE_CLONES
:
1706 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1708 edge
= cgraph_edge (id
->dst_node
, stmt
);
1712 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1714 cgraph_set_call_stmt (edge
, stmt
);
1721 /* Constant propagation on argument done during inlining
1722 may create new direct call. Produce an edge for it. */
1724 || (edge
->indirect_inlining_edge
1725 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1726 && id
->dst_node
->analyzed
1727 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1729 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1731 /* We have missing edge in the callgraph. This can happen
1732 when previous inlining turned an indirect call into a
1733 direct call by constant propagating arguments or we are
1734 producing dead clone (for further cloning). In all
1735 other cases we hit a bug (incorrect node sharing is the
1736 most common reason for missing edges). */
1737 gcc_assert (!dest
->analyzed
1738 || dest
->symbol
.address_taken
1739 || !id
->src_node
->analyzed
1740 || !id
->dst_node
->analyzed
);
1741 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1742 cgraph_create_edge_including_clones
1743 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1744 compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1746 CIF_ORIGINALLY_INDIRECT_CALL
);
1748 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1750 compute_call_stmt_bb_frequency
1751 (id
->dst_node
->symbol
.decl
,
1752 copy_basic_block
))->inline_failed
1753 = CIF_ORIGINALLY_INDIRECT_CALL
;
1756 fprintf (dump_file
, "Created new direct edge to %s\n",
1757 cgraph_node_name (dest
));
1761 flags
= gimple_call_flags (stmt
);
1762 if (flags
& ECF_MAY_BE_ALLOCA
)
1763 cfun
->calls_alloca
= true;
1764 if (flags
& ECF_RETURNS_TWICE
)
1765 cfun
->calls_setjmp
= true;
1768 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1769 id
->eh_map
, id
->eh_lp_nr
);
1771 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1776 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1777 if (TREE_CODE (def
) == SSA_NAME
)
1778 SSA_NAME_DEF_STMT (def
) = stmt
;
1781 gsi_next (©_gsi
);
1783 while (!gsi_end_p (copy_gsi
));
1785 copy_gsi
= gsi_last_bb (copy_basic_block
);
1788 return copy_basic_block
;
1791 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1792 form is quite easy, since dominator relationship for old basic blocks does
1795 There is however exception where inlining might change dominator relation
1796 across EH edges from basic block within inlined functions destinating
1797 to landing pads in function we inline into.
1799 The function fills in PHI_RESULTs of such PHI nodes if they refer
1800 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1801 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1802 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1803 set, and this means that there will be no overlapping live ranges
1804 for the underlying symbol.
1806 This might change in future if we allow redirecting of EH edges and
1807 we might want to change way build CFG pre-inlining to include
1808 all the possible edges then. */
1810 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1811 bool can_throw
, bool nonlocal_goto
)
1816 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1818 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1821 gimple_stmt_iterator si
;
1824 gcc_assert (e
->flags
& EDGE_EH
);
1827 gcc_assert (!(e
->flags
& EDGE_EH
));
1829 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1833 phi
= gsi_stmt (si
);
1835 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1836 gcc_assert (!e
->dest
->aux
);
1838 gcc_assert ((e
->flags
& EDGE_EH
)
1839 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1841 if (virtual_operand_p (PHI_RESULT (phi
)))
1843 mark_virtual_operands_for_renaming (cfun
);
1847 re
= find_edge (ret_bb
, e
->dest
);
1849 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1850 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1852 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1853 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1859 /* Copy edges from BB into its copy constructed earlier, scale profile
1860 accordingly. Edges will be taken care of later. Assume aux
1861 pointers to point to the copies of each BB. Return true if any
1862 debug stmts are left after a statement that must end the basic block. */
1865 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
)
1867 basic_block new_bb
= (basic_block
) bb
->aux
;
1870 gimple_stmt_iterator si
;
1872 bool need_debug_cleanup
= false;
1874 /* Use the indices from the original blocks to create edges for the
1876 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1877 if (!(old_edge
->flags
& EDGE_EH
))
1881 flags
= old_edge
->flags
;
1883 /* Return edges do get a FALLTHRU flag when the get inlined. */
1884 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1885 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR
)
1886 flags
|= EDGE_FALLTHRU
;
1887 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1888 new_edge
->count
= old_edge
->count
* count_scale
/ REG_BR_PROB_BASE
;
1889 new_edge
->probability
= old_edge
->probability
;
1892 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1895 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
1898 bool can_throw
, nonlocal_goto
;
1900 copy_stmt
= gsi_stmt (si
);
1901 if (!is_gimple_debug (copy_stmt
))
1902 update_stmt (copy_stmt
);
1904 /* Do this before the possible split_block. */
1907 /* If this tree could throw an exception, there are two
1908 cases where we need to add abnormal edge(s): the
1909 tree wasn't in a region and there is a "current
1910 region" in the caller; or the original tree had
1911 EH edges. In both cases split the block after the tree,
1912 and add abnormal edge(s) as needed; we need both
1913 those from the callee and the caller.
1914 We check whether the copy can throw, because the const
1915 propagation can change an INDIRECT_REF which throws
1916 into a COMPONENT_REF which doesn't. If the copy
1917 can throw, the original could also throw. */
1918 can_throw
= stmt_can_throw_internal (copy_stmt
);
1919 nonlocal_goto
= stmt_can_make_abnormal_goto (copy_stmt
);
1921 if (can_throw
|| nonlocal_goto
)
1923 if (!gsi_end_p (si
))
1925 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
1928 need_debug_cleanup
= true;
1930 if (!gsi_end_p (si
))
1931 /* Note that bb's predecessor edges aren't necessarily
1932 right at this point; split_block doesn't care. */
1934 edge e
= split_block (new_bb
, copy_stmt
);
1937 new_bb
->aux
= e
->src
->aux
;
1938 si
= gsi_start_bb (new_bb
);
1942 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
1943 make_eh_dispatch_edges (copy_stmt
);
1945 make_eh_edges (copy_stmt
);
1948 make_abnormal_goto_edges (gimple_bb (copy_stmt
), true);
1950 if ((can_throw
|| nonlocal_goto
)
1951 && gimple_in_ssa_p (cfun
))
1952 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
1953 can_throw
, nonlocal_goto
);
1955 return need_debug_cleanup
;
1958 /* Copy the PHIs. All blocks and edges are copied, some blocks
1959 was possibly split and new outgoing EH edges inserted.
1960 BB points to the block of original function and AUX pointers links
1961 the original and newly copied blocks. */
1964 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
1966 basic_block
const new_bb
= (basic_block
) bb
->aux
;
1969 gimple_stmt_iterator si
;
1971 bool inserted
= false;
1973 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
1978 phi
= gsi_stmt (si
);
1979 res
= PHI_RESULT (phi
);
1981 if (!virtual_operand_p (res
))
1983 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
1984 new_phi
= create_phi_node (new_res
, new_bb
);
1985 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
1987 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
1990 tree block
= id
->block
;
1994 /* When doing partial cloning, we allow PHIs on the entry block
1995 as long as all the arguments are the same. Find any input
1996 edge to see argument to copy. */
1998 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
1999 if (!old_edge
->src
->aux
)
2002 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2004 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2005 gcc_assert (new_arg
);
2006 /* With return slot optimization we can end up with
2007 non-gimple (foo *)&this->m, fix that here. */
2008 if (TREE_CODE (new_arg
) != SSA_NAME
2009 && TREE_CODE (new_arg
) != FUNCTION_DECL
2010 && !is_gimple_val (new_arg
))
2012 gimple_seq stmts
= NULL
;
2013 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2014 gsi_insert_seq_on_edge (new_edge
, stmts
);
2017 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2019 if (LOCATION_BLOCK (locus
))
2022 n
= (tree
*) pointer_map_contains (id
->decl_map
,
2023 LOCATION_BLOCK (locus
));
2028 add_phi_arg (new_phi
, new_arg
, new_edge
, block
?
2029 COMBINE_LOCATION_DATA (line_table
, locus
, block
) :
2030 LOCATION_LOCUS (locus
));
2035 /* Commit the delayed edge insertions. */
2037 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2038 gsi_commit_one_edge_insert (new_edge
, NULL
);
2042 /* Wrapper for remap_decl so it can be used as a callback. */
2045 remap_decl_1 (tree decl
, void *data
)
2047 return remap_decl (decl
, (copy_body_data
*) data
);
2050 /* Build struct function and associated datastructures for the new clone
2051 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2052 the cfun to the function of new_fndecl (and current_function_decl too). */
2055 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2057 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2058 gcov_type count_scale
;
2060 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2061 count_scale
= (REG_BR_PROB_BASE
* count
2062 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2064 count_scale
= REG_BR_PROB_BASE
;
2066 /* Register specific tree functions. */
2067 gimple_register_cfg_hooks ();
2069 /* Get clean struct function. */
2070 push_struct_function (new_fndecl
);
2072 /* We will rebuild these, so just sanity check that they are empty. */
2073 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2074 gcc_assert (cfun
->local_decls
== NULL
);
2075 gcc_assert (cfun
->cfg
== NULL
);
2076 gcc_assert (cfun
->decl
== new_fndecl
);
2078 /* Copy items we preserve during cloning. */
2079 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2080 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2081 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2082 cfun
->curr_properties
= src_cfun
->curr_properties
& ~PROP_loops
;
2083 cfun
->last_verified
= src_cfun
->last_verified
;
2084 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2085 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2086 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2087 cfun
->stdarg
= src_cfun
->stdarg
;
2088 cfun
->after_inlining
= src_cfun
->after_inlining
;
2089 cfun
->can_throw_non_call_exceptions
2090 = src_cfun
->can_throw_non_call_exceptions
;
2091 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2092 cfun
->returns_struct
= src_cfun
->returns_struct
;
2093 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2095 init_empty_tree_cfg ();
2097 profile_status_for_function (cfun
) = profile_status_for_function (src_cfun
);
2098 ENTRY_BLOCK_PTR
->count
=
2099 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2101 ENTRY_BLOCK_PTR
->frequency
2102 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2103 EXIT_BLOCK_PTR
->count
=
2104 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2106 EXIT_BLOCK_PTR
->frequency
=
2107 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2109 init_eh_for_function ();
2111 if (src_cfun
->gimple_df
)
2113 init_tree_ssa (cfun
);
2114 cfun
->gimple_df
->in_ssa_p
= true;
2115 init_ssa_operands (cfun
);
2119 /* Helper function for copy_cfg_body. Move debug stmts from the end
2120 of NEW_BB to the beginning of successor basic blocks when needed. If the
2121 successor has multiple predecessors, reset them, otherwise keep
2125 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2129 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2132 || gsi_one_before_end_p (si
)
2133 || !(stmt_can_throw_internal (gsi_stmt (si
))
2134 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2137 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2139 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2140 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2141 while (is_gimple_debug (gsi_stmt (ssi
)))
2143 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2147 /* For the last edge move the debug stmts instead of copying
2149 if (ei_one_before_end_p (ei
))
2153 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2154 gimple_debug_bind_reset_value (stmt
);
2155 gsi_remove (&si
, false);
2156 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2160 if (gimple_debug_bind_p (stmt
))
2162 var
= gimple_debug_bind_get_var (stmt
);
2163 if (single_pred_p (e
->dest
))
2165 value
= gimple_debug_bind_get_value (stmt
);
2166 value
= unshare_expr (value
);
2170 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2172 else if (gimple_debug_source_bind_p (stmt
))
2174 var
= gimple_debug_source_bind_get_var (stmt
);
2175 value
= gimple_debug_source_bind_get_value (stmt
);
2176 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2180 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2181 VEC_safe_push (gimple
, heap
, id
->debug_stmts
, new_stmt
);
2187 /* Make a copy of the body of FN so that it can be inserted inline in
2188 another function. Walks FN via CFG, returns new fndecl. */
2191 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2192 basic_block entry_block_map
, basic_block exit_block_map
,
2193 bitmap blocks_to_copy
, basic_block new_entry
)
2195 tree callee_fndecl
= id
->src_fn
;
2196 /* Original cfun for the callee, doesn't change. */
2197 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2198 struct function
*cfun_to_copy
;
2200 tree new_fndecl
= NULL
;
2201 bool need_debug_cleanup
= false;
2202 gcov_type count_scale
;
2204 int incoming_frequency
= 0;
2205 gcov_type incoming_count
= 0;
2207 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2208 count_scale
= (REG_BR_PROB_BASE
* count
2209 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2211 count_scale
= REG_BR_PROB_BASE
;
2213 /* Register specific tree functions. */
2214 gimple_register_cfg_hooks ();
2216 /* If we are inlining just region of the function, make sure to connect new entry
2217 to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute
2218 frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and
2219 probabilities of edges incoming from nonduplicated region. */
2225 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2228 incoming_frequency
+= EDGE_FREQUENCY (e
);
2229 incoming_count
+= e
->count
;
2231 incoming_count
= incoming_count
* count_scale
/ REG_BR_PROB_BASE
;
2233 = incoming_frequency
* frequency_scale
/ REG_BR_PROB_BASE
;
2234 ENTRY_BLOCK_PTR
->count
= incoming_count
;
2235 ENTRY_BLOCK_PTR
->frequency
= incoming_frequency
;
2238 /* Must have a CFG here at this point. */
2239 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2240 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2242 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2244 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= entry_block_map
;
2245 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= exit_block_map
;
2246 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2247 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2249 /* Duplicate any exception-handling regions. */
2251 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2254 /* Use aux pointers to map the original blocks to copy. */
2255 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2256 if (!blocks_to_copy
|| bitmap_bit_p (blocks_to_copy
, bb
->index
))
2258 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2263 last
= last_basic_block
;
2265 /* Now that we've duplicated the blocks, duplicate their edges. */
2266 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2268 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2269 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
);
2273 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2274 e
->probability
= REG_BR_PROB_BASE
;
2275 e
->count
= incoming_count
;
2278 if (gimple_in_ssa_p (cfun
))
2279 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2281 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2282 copy_phis_for_bb (bb
, id
);
2284 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2287 if (need_debug_cleanup
2288 && bb
->index
!= ENTRY_BLOCK
2289 && bb
->index
!= EXIT_BLOCK
)
2290 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2291 ((basic_block
)bb
->aux
)->aux
= NULL
;
2295 /* Zero out AUX fields of newly created block during EH edge
2297 for (; last
< last_basic_block
; last
++)
2299 if (need_debug_cleanup
)
2300 maybe_move_debug_stmts_to_successors (id
, BASIC_BLOCK (last
));
2301 BASIC_BLOCK (last
)->aux
= NULL
;
2303 entry_block_map
->aux
= NULL
;
2304 exit_block_map
->aux
= NULL
;
2308 pointer_map_destroy (id
->eh_map
);
2315 /* Copy the debug STMT using ID. We deal with these statements in a
2316 special way: if any variable in their VALUE expression wasn't
2317 remapped yet, we won't remap it, because that would get decl uids
2318 out of sync, causing codegen differences between -g and -g0. If
2319 this arises, we drop the VALUE expression altogether. */
2322 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2325 struct walk_stmt_info wi
;
2328 if (gimple_block (stmt
))
2330 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2334 gimple_set_block (stmt
, t
);
2336 /* Remap all the operands in COPY. */
2337 memset (&wi
, 0, sizeof (wi
));
2340 processing_debug_stmt
= 1;
2342 if (gimple_debug_source_bind_p (stmt
))
2343 t
= gimple_debug_source_bind_get_var (stmt
);
2345 t
= gimple_debug_bind_get_var (stmt
);
2347 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2348 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2350 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2353 else if (TREE_CODE (t
) == VAR_DECL
2354 && !is_global_var (t
)
2355 && !pointer_map_contains (id
->decl_map
, t
))
2356 /* T is a non-localized variable. */;
2358 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2360 if (gimple_debug_bind_p (stmt
))
2362 gimple_debug_bind_set_var (stmt
, t
);
2364 if (gimple_debug_bind_has_value_p (stmt
))
2365 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2366 remap_gimple_op_r
, &wi
, NULL
);
2368 /* Punt if any decl couldn't be remapped. */
2369 if (processing_debug_stmt
< 0)
2370 gimple_debug_bind_reset_value (stmt
);
2372 else if (gimple_debug_source_bind_p (stmt
))
2374 gimple_debug_source_bind_set_var (stmt
, t
);
2375 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2376 remap_gimple_op_r
, &wi
, NULL
);
2379 processing_debug_stmt
= 0;
2384 /* Process deferred debug stmts. In order to give values better odds
2385 of being successfully remapped, we delay the processing of debug
2386 stmts until all other stmts that might require remapping are
2390 copy_debug_stmts (copy_body_data
*id
)
2395 if (!id
->debug_stmts
)
2398 FOR_EACH_VEC_ELT (gimple
, id
->debug_stmts
, i
, stmt
)
2399 copy_debug_stmt (stmt
, id
);
2401 VEC_free (gimple
, heap
, id
->debug_stmts
);
2404 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2405 another function. */
2408 copy_tree_body (copy_body_data
*id
)
2410 tree fndecl
= id
->src_fn
;
2411 tree body
= DECL_SAVED_TREE (fndecl
);
2413 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2418 /* Make a copy of the body of FN so that it can be inserted inline in
2419 another function. */
2422 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2423 basic_block entry_block_map
, basic_block exit_block_map
,
2424 bitmap blocks_to_copy
, basic_block new_entry
)
2426 tree fndecl
= id
->src_fn
;
2429 /* If this body has a CFG, walk CFG and copy. */
2430 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl
)));
2431 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2432 blocks_to_copy
, new_entry
);
2433 copy_debug_stmts (id
);
2438 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2439 defined in function FN, or of a data member thereof. */
2442 self_inlining_addr_expr (tree value
, tree fn
)
2446 if (TREE_CODE (value
) != ADDR_EXPR
)
2449 var
= get_base_address (TREE_OPERAND (value
, 0));
2451 return var
&& auto_var_in_fn_p (var
, fn
);
2454 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2455 lexical block and line number information from base_stmt, if given,
2456 or from the last stmt of the block otherwise. */
2459 insert_init_debug_bind (copy_body_data
*id
,
2460 basic_block bb
, tree var
, tree value
,
2464 gimple_stmt_iterator gsi
;
2467 if (!gimple_in_ssa_p (id
->src_cfun
))
2470 if (!MAY_HAVE_DEBUG_STMTS
)
2473 tracked_var
= target_for_debug_bind (var
);
2479 gsi
= gsi_last_bb (bb
);
2480 if (!base_stmt
&& !gsi_end_p (gsi
))
2481 base_stmt
= gsi_stmt (gsi
);
2484 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2488 if (!gsi_end_p (gsi
))
2489 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2491 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2498 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2500 /* If VAR represents a zero-sized variable, it's possible that the
2501 assignment statement may result in no gimple statements. */
2504 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2506 /* We can end up with init statements that store to a non-register
2507 from a rhs with a conversion. Handle that here by forcing the
2508 rhs into a temporary. gimple_regimplify_operands is not
2509 prepared to do this for us. */
2510 if (!is_gimple_debug (init_stmt
)
2511 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2512 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2513 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2515 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2516 gimple_expr_type (init_stmt
),
2517 gimple_assign_rhs1 (init_stmt
));
2518 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2520 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2521 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2523 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2524 gimple_regimplify_operands (init_stmt
, &si
);
2526 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2528 tree def
= gimple_assign_lhs (init_stmt
);
2529 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2534 /* Initialize parameter P with VALUE. If needed, produce init statement
2535 at the end of BB. When BB is NULL, we return init statement to be
2538 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2539 basic_block bb
, tree
*vars
)
2541 gimple init_stmt
= NULL
;
2544 tree def
= (gimple_in_ssa_p (cfun
)
2545 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2548 && value
!= error_mark_node
2549 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2551 /* If we can match up types by promotion/demotion do so. */
2552 if (fold_convertible_p (TREE_TYPE (p
), value
))
2553 rhs
= fold_convert (TREE_TYPE (p
), value
);
2556 /* ??? For valid programs we should not end up here.
2557 Still if we end up with truly mismatched types here, fall back
2558 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2559 GIMPLE to the following passes. */
2560 if (!is_gimple_reg_type (TREE_TYPE (value
))
2561 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2562 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2564 rhs
= build_zero_cst (TREE_TYPE (p
));
2568 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2569 here since the type of this decl must be visible to the calling
2571 var
= copy_decl_to_var (p
, id
);
2573 /* Declare this new variable. */
2574 DECL_CHAIN (var
) = *vars
;
2577 /* Make gimplifier happy about this variable. */
2578 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2580 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2581 we would not need to create a new variable here at all, if it
2582 weren't for debug info. Still, we can just use the argument
2584 if (TREE_READONLY (p
)
2585 && !TREE_ADDRESSABLE (p
)
2586 && value
&& !TREE_SIDE_EFFECTS (value
)
2589 /* We may produce non-gimple trees by adding NOPs or introduce
2590 invalid sharing when operand is not really constant.
2591 It is not big deal to prohibit constant propagation here as
2592 we will constant propagate in DOM1 pass anyway. */
2593 if (is_gimple_min_invariant (value
)
2594 && useless_type_conversion_p (TREE_TYPE (p
),
2596 /* We have to be very careful about ADDR_EXPR. Make sure
2597 the base variable isn't a local variable of the inlined
2598 function, e.g., when doing recursive inlining, direct or
2599 mutually-recursive or whatever, which is why we don't
2600 just test whether fn == current_function_decl. */
2601 && ! self_inlining_addr_expr (value
, fn
))
2603 insert_decl_map (id
, p
, value
);
2604 insert_debug_decl_map (id
, p
, var
);
2605 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2609 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2610 that way, when the PARM_DECL is encountered, it will be
2611 automatically replaced by the VAR_DECL. */
2612 insert_decl_map (id
, p
, var
);
2614 /* Even if P was TREE_READONLY, the new VAR should not be.
2615 In the original code, we would have constructed a
2616 temporary, and then the function body would have never
2617 changed the value of P. However, now, we will be
2618 constructing VAR directly. The constructor body may
2619 change its value multiple times as it is being
2620 constructed. Therefore, it must not be TREE_READONLY;
2621 the back-end assumes that TREE_READONLY variable is
2622 assigned to only once. */
2623 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2624 TREE_READONLY (var
) = 0;
2626 /* If there is no setup required and we are in SSA, take the easy route
2627 replacing all SSA names representing the function parameter by the
2628 SSA name passed to function.
2630 We need to construct map for the variable anyway as it might be used
2631 in different SSA names when parameter is set in function.
2633 Do replacement at -O0 for const arguments replaced by constant.
2634 This is important for builtin_constant_p and other construct requiring
2635 constant argument to be visible in inlined function body. */
2636 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2638 || (TREE_READONLY (p
)
2639 && is_gimple_min_invariant (rhs
)))
2640 && (TREE_CODE (rhs
) == SSA_NAME
2641 || is_gimple_min_invariant (rhs
))
2642 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2644 insert_decl_map (id
, def
, rhs
);
2645 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2648 /* If the value of argument is never used, don't care about initializing
2650 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2652 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2653 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2656 /* Initialize this VAR_DECL from the equivalent argument. Convert
2657 the argument to the proper type in case it was promoted. */
2660 if (rhs
== error_mark_node
)
2662 insert_decl_map (id
, p
, var
);
2663 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2666 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2668 /* If we are in SSA form properly remap the default definition
2669 or assign to a dummy SSA name if the parameter is unused and
2670 we are not optimizing. */
2671 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2675 def
= remap_ssa_name (def
, id
);
2676 init_stmt
= gimple_build_assign (def
, rhs
);
2677 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2678 set_ssa_default_def (cfun
, var
, NULL
);
2682 def
= make_ssa_name (var
, NULL
);
2683 init_stmt
= gimple_build_assign (def
, rhs
);
2687 init_stmt
= gimple_build_assign (var
, rhs
);
2689 if (bb
&& init_stmt
)
2690 insert_init_stmt (id
, bb
, init_stmt
);
2695 /* Generate code to initialize the parameters of the function at the
2696 top of the stack in ID from the GIMPLE_CALL STMT. */
2699 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2700 tree fn
, basic_block bb
)
2705 tree vars
= NULL_TREE
;
2706 tree static_chain
= gimple_call_chain (stmt
);
2708 /* Figure out what the parameters are. */
2709 parms
= DECL_ARGUMENTS (fn
);
2711 /* Loop through the parameter declarations, replacing each with an
2712 equivalent VAR_DECL, appropriately initialized. */
2713 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2716 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2717 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2719 /* After remapping parameters remap their types. This has to be done
2720 in a second loop over all parameters to appropriately remap
2721 variable sized arrays when the size is specified in a
2722 parameter following the array. */
2723 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2725 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
2727 && TREE_CODE (*varp
) == VAR_DECL
)
2729 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
2730 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2732 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
2733 /* Also remap the default definition if it was remapped
2734 to the default definition of the parameter replacement
2735 by the parameter setup. */
2738 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
2740 && TREE_CODE (*defp
) == SSA_NAME
2741 && SSA_NAME_VAR (*defp
) == var
)
2742 TREE_TYPE (*defp
) = TREE_TYPE (var
);
2747 /* Initialize the static chain. */
2748 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
2749 gcc_assert (fn
!= current_function_decl
);
2752 /* No static chain? Seems like a bug in tree-nested.c. */
2753 gcc_assert (static_chain
);
2755 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
2758 declare_inline_vars (id
->block
, vars
);
2762 /* Declare a return variable to replace the RESULT_DECL for the
2763 function we are calling. An appropriate DECL_STMT is returned.
2764 The USE_STMT is filled to contain a use of the declaration to
2765 indicate the return value of the function.
2767 RETURN_SLOT, if non-null is place where to store the result. It
2768 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2769 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2771 The return value is a (possibly null) value that holds the result
2772 as seen by the caller. */
2775 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
2776 basic_block entry_bb
)
2778 tree callee
= id
->src_fn
;
2779 tree result
= DECL_RESULT (callee
);
2780 tree callee_type
= TREE_TYPE (result
);
2784 /* Handle type-mismatches in the function declaration return type
2785 vs. the call expression. */
2787 caller_type
= TREE_TYPE (modify_dest
);
2789 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
2791 /* We don't need to do anything for functions that don't return anything. */
2792 if (VOID_TYPE_P (callee_type
))
2795 /* If there was a return slot, then the return value is the
2796 dereferenced address of that object. */
2799 /* The front end shouldn't have used both return_slot and
2800 a modify expression. */
2801 gcc_assert (!modify_dest
);
2802 if (DECL_BY_REFERENCE (result
))
2804 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
2805 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
2807 /* We are going to construct *&return_slot and we can't do that
2808 for variables believed to be not addressable.
2810 FIXME: This check possibly can match, because values returned
2811 via return slot optimization are not believed to have address
2812 taken by alias analysis. */
2813 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
2814 var
= return_slot_addr
;
2819 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
2820 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
2822 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2823 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2824 && !DECL_GIMPLE_REG_P (result
)
2826 DECL_GIMPLE_REG_P (var
) = 0;
2831 /* All types requiring non-trivial constructors should have been handled. */
2832 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
2834 /* Attempt to avoid creating a new temporary variable. */
2836 && TREE_CODE (modify_dest
) != SSA_NAME
)
2838 bool use_it
= false;
2840 /* We can't use MODIFY_DEST if there's type promotion involved. */
2841 if (!useless_type_conversion_p (callee_type
, caller_type
))
2844 /* ??? If we're assigning to a variable sized type, then we must
2845 reuse the destination variable, because we've no good way to
2846 create variable sized temporaries at this point. */
2847 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
2850 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2851 reuse it as the result of the call directly. Don't do this if
2852 it would promote MODIFY_DEST to addressable. */
2853 else if (TREE_ADDRESSABLE (result
))
2857 tree base_m
= get_base_address (modify_dest
);
2859 /* If the base isn't a decl, then it's a pointer, and we don't
2860 know where that's going to go. */
2861 if (!DECL_P (base_m
))
2863 else if (is_global_var (base_m
))
2865 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2866 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2867 && !DECL_GIMPLE_REG_P (result
)
2868 && DECL_GIMPLE_REG_P (base_m
))
2870 else if (!TREE_ADDRESSABLE (base_m
))
2882 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
2884 var
= copy_result_decl_to_var (result
, id
);
2885 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2887 /* Do not have the rest of GCC warn about this variable as it should
2888 not be visible to the user. */
2889 TREE_NO_WARNING (var
) = 1;
2891 declare_inline_vars (id
->block
, var
);
2893 /* Build the use expr. If the return type of the function was
2894 promoted, convert it back to the expected type. */
2896 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
2898 /* If we can match up types by promotion/demotion do so. */
2899 if (fold_convertible_p (caller_type
, var
))
2900 use
= fold_convert (caller_type
, var
);
2903 /* ??? For valid programs we should not end up here.
2904 Still if we end up with truly mismatched types here, fall back
2905 to using a MEM_REF to not leak invalid GIMPLE to the following
2907 /* Prevent var from being written into SSA form. */
2908 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
2909 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
2910 DECL_GIMPLE_REG_P (var
) = false;
2911 else if (is_gimple_reg_type (TREE_TYPE (var
)))
2912 TREE_ADDRESSABLE (var
) = true;
2913 use
= fold_build2 (MEM_REF
, caller_type
,
2914 build_fold_addr_expr (var
),
2915 build_int_cst (ptr_type_node
, 0));
2919 STRIP_USELESS_TYPE_CONVERSION (use
);
2921 if (DECL_BY_REFERENCE (result
))
2923 TREE_ADDRESSABLE (var
) = 1;
2924 var
= build_fold_addr_expr (var
);
2928 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2929 way, when the RESULT_DECL is encountered, it will be
2930 automatically replaced by the VAR_DECL.
2932 When returning by reference, ensure that RESULT_DECL remaps to
2934 if (DECL_BY_REFERENCE (result
)
2935 && !is_gimple_val (var
))
2937 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
2938 insert_decl_map (id
, result
, temp
);
2939 /* When RESULT_DECL is in SSA form, we need to remap and initialize
2940 it's default_def SSA_NAME. */
2941 if (gimple_in_ssa_p (id
->src_cfun
)
2942 && is_gimple_reg (result
))
2944 temp
= make_ssa_name (temp
, NULL
);
2945 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
2947 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
2950 insert_decl_map (id
, result
, var
);
2952 /* Remember this so we can ignore it in remap_decls. */
2958 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2959 to a local label. */
2962 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
2965 tree fn
= (tree
) fnp
;
2967 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
2976 /* Determine if the function can be copied. If so return NULL. If
2977 not return a string describng the reason for failure. */
2980 copy_forbidden (struct function
*fun
, tree fndecl
)
2982 const char *reason
= fun
->cannot_be_copied_reason
;
2986 /* Only examine the function once. */
2987 if (fun
->cannot_be_copied_set
)
2990 /* We cannot copy a function that receives a non-local goto
2991 because we cannot remap the destination label used in the
2992 function that is performing the non-local goto. */
2993 /* ??? Actually, this should be possible, if we work at it.
2994 No doubt there's just a handful of places that simply
2995 assume it doesn't happen and don't substitute properly. */
2996 if (fun
->has_nonlocal_label
)
2998 reason
= G_("function %q+F can never be copied "
2999 "because it receives a non-local goto");
3003 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3004 if (TREE_CODE (decl
) == VAR_DECL
3005 && TREE_STATIC (decl
)
3006 && !DECL_EXTERNAL (decl
)
3007 && DECL_INITIAL (decl
)
3008 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3009 has_label_address_in_static_1
,
3012 reason
= G_("function %q+F can never be copied because it saves "
3013 "address of local label in a static variable");
3018 fun
->cannot_be_copied_reason
= reason
;
3019 fun
->cannot_be_copied_set
= true;
3024 static const char *inline_forbidden_reason
;
3026 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3027 iff a function can not be inlined. Also sets the reason why. */
3030 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3031 struct walk_stmt_info
*wip
)
3033 tree fn
= (tree
) wip
->info
;
3035 gimple stmt
= gsi_stmt (*gsi
);
3037 switch (gimple_code (stmt
))
3040 /* Refuse to inline alloca call unless user explicitly forced so as
3041 this may change program's memory overhead drastically when the
3042 function using alloca is called in loop. In GCC present in
3043 SPEC2000 inlining into schedule_block cause it to require 2GB of
3044 RAM instead of 256MB. Don't do so for alloca calls emitted for
3045 VLA objects as those can't cause unbounded growth (they're always
3046 wrapped inside stack_save/stack_restore regions. */
3047 if (gimple_alloca_call_p (stmt
)
3048 && !gimple_call_alloca_for_var_p (stmt
)
3049 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3051 inline_forbidden_reason
3052 = G_("function %q+F can never be inlined because it uses "
3053 "alloca (override using the always_inline attribute)");
3054 *handled_ops_p
= true;
3058 t
= gimple_call_fndecl (stmt
);
3062 /* We cannot inline functions that call setjmp. */
3063 if (setjmp_call_p (t
))
3065 inline_forbidden_reason
3066 = G_("function %q+F can never be inlined because it uses setjmp");
3067 *handled_ops_p
= true;
3071 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3072 switch (DECL_FUNCTION_CODE (t
))
3074 /* We cannot inline functions that take a variable number of
3076 case BUILT_IN_VA_START
:
3077 case BUILT_IN_NEXT_ARG
:
3078 case BUILT_IN_VA_END
:
3079 inline_forbidden_reason
3080 = G_("function %q+F can never be inlined because it "
3081 "uses variable argument lists");
3082 *handled_ops_p
= true;
3085 case BUILT_IN_LONGJMP
:
3086 /* We can't inline functions that call __builtin_longjmp at
3087 all. The non-local goto machinery really requires the
3088 destination be in a different function. If we allow the
3089 function calling __builtin_longjmp to be inlined into the
3090 function calling __builtin_setjmp, Things will Go Awry. */
3091 inline_forbidden_reason
3092 = G_("function %q+F can never be inlined because "
3093 "it uses setjmp-longjmp exception handling");
3094 *handled_ops_p
= true;
3097 case BUILT_IN_NONLOCAL_GOTO
:
3099 inline_forbidden_reason
3100 = G_("function %q+F can never be inlined because "
3101 "it uses non-local goto");
3102 *handled_ops_p
= true;
3105 case BUILT_IN_RETURN
:
3106 case BUILT_IN_APPLY_ARGS
:
3107 /* If a __builtin_apply_args caller would be inlined,
3108 it would be saving arguments of the function it has
3109 been inlined into. Similarly __builtin_return would
3110 return from the function the inline has been inlined into. */
3111 inline_forbidden_reason
3112 = G_("function %q+F can never be inlined because "
3113 "it uses __builtin_return or __builtin_apply_args");
3114 *handled_ops_p
= true;
3123 t
= gimple_goto_dest (stmt
);
3125 /* We will not inline a function which uses computed goto. The
3126 addresses of its local labels, which may be tucked into
3127 global storage, are of course not constant across
3128 instantiations, which causes unexpected behavior. */
3129 if (TREE_CODE (t
) != LABEL_DECL
)
3131 inline_forbidden_reason
3132 = G_("function %q+F can never be inlined "
3133 "because it contains a computed goto");
3134 *handled_ops_p
= true;
3143 *handled_ops_p
= false;
3147 /* Return true if FNDECL is a function that cannot be inlined into
3151 inline_forbidden_p (tree fndecl
)
3153 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3154 struct walk_stmt_info wi
;
3155 struct pointer_set_t
*visited_nodes
;
3157 bool forbidden_p
= false;
3159 /* First check for shared reasons not to copy the code. */
3160 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3161 if (inline_forbidden_reason
!= NULL
)
3164 /* Next, walk the statements of the function looking for
3165 constraucts we can't handle, or are non-optimal for inlining. */
3166 visited_nodes
= pointer_set_create ();
3167 memset (&wi
, 0, sizeof (wi
));
3168 wi
.info
= (void *) fndecl
;
3169 wi
.pset
= visited_nodes
;
3171 FOR_EACH_BB_FN (bb
, fun
)
3174 gimple_seq seq
= bb_seq (bb
);
3175 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3176 forbidden_p
= (ret
!= NULL
);
3181 pointer_set_destroy (visited_nodes
);
3185 /* Return false if the function FNDECL cannot be inlined on account of its
3186 attributes, true otherwise. */
3188 function_attribute_inlinable_p (const_tree fndecl
)
3190 if (targetm
.attribute_table
)
3194 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3196 const_tree name
= TREE_PURPOSE (a
);
3199 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3200 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3201 return targetm
.function_attribute_inlinable_p (fndecl
);
3208 /* Returns nonzero if FN is a function that does not have any
3209 fundamental inline blocking properties. */
3212 tree_inlinable_function_p (tree fn
)
3214 bool inlinable
= true;
3218 /* If we've already decided this function shouldn't be inlined,
3219 there's no need to check again. */
3220 if (DECL_UNINLINABLE (fn
))
3223 /* We only warn for functions declared `inline' by the user. */
3224 do_warning
= (warn_inline
3225 && DECL_DECLARED_INLINE_P (fn
)
3226 && !DECL_NO_INLINE_WARNING_P (fn
)
3227 && !DECL_IN_SYSTEM_HEADER (fn
));
3229 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3232 && always_inline
== NULL
)
3235 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3236 "is suppressed using -fno-inline", fn
);
3240 else if (!function_attribute_inlinable_p (fn
))
3243 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3244 "uses attributes conflicting with inlining", fn
);
3248 else if (inline_forbidden_p (fn
))
3250 /* See if we should warn about uninlinable functions. Previously,
3251 some of these warnings would be issued while trying to expand
3252 the function inline, but that would cause multiple warnings
3253 about functions that would for example call alloca. But since
3254 this a property of the function, just one warning is enough.
3255 As a bonus we can now give more details about the reason why a
3256 function is not inlinable. */
3258 error (inline_forbidden_reason
, fn
);
3259 else if (do_warning
)
3260 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3265 /* Squirrel away the result so that we don't have to check again. */
3266 DECL_UNINLINABLE (fn
) = !inlinable
;
3271 /* Estimate the cost of a memory move. Use machine dependent
3272 word size and take possible memcpy call into account. */
3275 estimate_move_cost (tree type
)
3279 gcc_assert (!VOID_TYPE_P (type
));
3281 if (TREE_CODE (type
) == VECTOR_TYPE
)
3283 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3284 enum machine_mode simd
3285 = targetm
.vectorize
.preferred_simd_mode (inner
);
3286 int simd_mode_size
= GET_MODE_SIZE (simd
);
3287 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3291 size
= int_size_in_bytes (type
);
3293 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3294 /* Cost of a memcpy call, 3 arguments and the call. */
3297 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3300 /* Returns cost of operation CODE, according to WEIGHTS */
3303 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3304 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3308 /* These are "free" conversions, or their presumed cost
3309 is folded into other operations. */
3314 case VIEW_CONVERT_EXPR
:
3317 /* Assign cost of 1 to usual operations.
3318 ??? We may consider mapping RTL costs to this. */
3324 case POINTER_PLUS_EXPR
:
3327 case MULT_HIGHPART_EXPR
:
3330 case ADDR_SPACE_CONVERT_EXPR
:
3331 case FIXED_CONVERT_EXPR
:
3332 case FIX_TRUNC_EXPR
:
3344 case VEC_LSHIFT_EXPR
:
3345 case VEC_RSHIFT_EXPR
:
3352 case TRUTH_ANDIF_EXPR
:
3353 case TRUTH_ORIF_EXPR
:
3354 case TRUTH_AND_EXPR
:
3356 case TRUTH_XOR_EXPR
:
3357 case TRUTH_NOT_EXPR
:
3366 case UNORDERED_EXPR
:
3377 case PREDECREMENT_EXPR
:
3378 case PREINCREMENT_EXPR
:
3379 case POSTDECREMENT_EXPR
:
3380 case POSTINCREMENT_EXPR
:
3382 case REALIGN_LOAD_EXPR
:
3384 case REDUC_MAX_EXPR
:
3385 case REDUC_MIN_EXPR
:
3386 case REDUC_PLUS_EXPR
:
3387 case WIDEN_SUM_EXPR
:
3388 case WIDEN_MULT_EXPR
:
3390 case WIDEN_MULT_PLUS_EXPR
:
3391 case WIDEN_MULT_MINUS_EXPR
:
3392 case WIDEN_LSHIFT_EXPR
:
3394 case VEC_WIDEN_MULT_HI_EXPR
:
3395 case VEC_WIDEN_MULT_LO_EXPR
:
3396 case VEC_WIDEN_MULT_EVEN_EXPR
:
3397 case VEC_WIDEN_MULT_ODD_EXPR
:
3398 case VEC_UNPACK_HI_EXPR
:
3399 case VEC_UNPACK_LO_EXPR
:
3400 case VEC_UNPACK_FLOAT_HI_EXPR
:
3401 case VEC_UNPACK_FLOAT_LO_EXPR
:
3402 case VEC_PACK_TRUNC_EXPR
:
3403 case VEC_PACK_SAT_EXPR
:
3404 case VEC_PACK_FIX_TRUNC_EXPR
:
3405 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3406 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3410 /* Few special cases of expensive operations. This is useful
3411 to avoid inlining on functions having too many of these. */
3412 case TRUNC_DIV_EXPR
:
3414 case FLOOR_DIV_EXPR
:
3415 case ROUND_DIV_EXPR
:
3416 case EXACT_DIV_EXPR
:
3417 case TRUNC_MOD_EXPR
:
3419 case FLOOR_MOD_EXPR
:
3420 case ROUND_MOD_EXPR
:
3422 if (TREE_CODE (op2
) != INTEGER_CST
)
3423 return weights
->div_mod_cost
;
3427 /* We expect a copy assignment with no operator. */
3428 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3434 /* Estimate number of instructions that will be created by expanding
3435 the statements in the statement sequence STMTS.
3436 WEIGHTS contains weights attributed to various constructs. */
3439 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3442 gimple_stmt_iterator gsi
;
3445 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3446 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3452 /* Estimate number of instructions that will be created by expanding STMT.
3453 WEIGHTS contains weights attributed to various constructs. */
3456 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3459 enum gimple_code code
= gimple_code (stmt
);
3466 /* Try to estimate the cost of assignments. We have three cases to
3468 1) Simple assignments to registers;
3469 2) Stores to things that must live in memory. This includes
3470 "normal" stores to scalars, but also assignments of large
3471 structures, or constructors of big arrays;
3473 Let us look at the first two cases, assuming we have "a = b + C":
3474 <GIMPLE_ASSIGN <var_decl "a">
3475 <plus_expr <var_decl "b"> <constant C>>
3476 If "a" is a GIMPLE register, the assignment to it is free on almost
3477 any target, because "a" usually ends up in a real register. Hence
3478 the only cost of this expression comes from the PLUS_EXPR, and we
3479 can ignore the GIMPLE_ASSIGN.
3480 If "a" is not a GIMPLE register, the assignment to "a" will most
3481 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3482 of moving something into "a", which we compute using the function
3483 estimate_move_cost. */
3484 if (gimple_clobber_p (stmt
))
3485 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3487 lhs
= gimple_assign_lhs (stmt
);
3488 rhs
= gimple_assign_rhs1 (stmt
);
3490 if (is_gimple_reg (lhs
))
3493 cost
= estimate_move_cost (TREE_TYPE (lhs
));
3495 if (!is_gimple_reg (rhs
) && !is_gimple_min_invariant (rhs
))
3496 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3498 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3499 gimple_assign_rhs1 (stmt
),
3500 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3501 == GIMPLE_BINARY_RHS
3502 ? gimple_assign_rhs2 (stmt
) : NULL
);
3506 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3507 gimple_op (stmt
, 0),
3508 gimple_op (stmt
, 1));
3512 /* Take into account cost of the switch + guess 2 conditional jumps for
3515 TODO: once the switch expansion logic is sufficiently separated, we can
3516 do better job on estimating cost of the switch. */
3517 if (weights
->time_based
)
3518 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3520 cost
= gimple_switch_num_labels (stmt
) * 2;
3525 tree decl
= gimple_call_fndecl (stmt
);
3526 struct cgraph_node
*node
= NULL
;
3528 /* Do not special case builtins where we see the body.
3529 This just confuse inliner. */
3530 if (!decl
|| !(node
= cgraph_get_node (decl
)) || node
->analyzed
)
3532 /* For buitins that are likely expanded to nothing or
3533 inlined do not account operand costs. */
3534 else if (is_simple_builtin (decl
))
3536 else if (is_inexpensive_builtin (decl
))
3537 return weights
->target_builtin_call_cost
;
3538 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3540 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3541 specialize the cheap expansion we do here.
3542 ??? This asks for a more general solution. */
3543 switch (DECL_FUNCTION_CODE (decl
))
3548 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3549 && REAL_VALUES_EQUAL
3550 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3551 return estimate_operator_cost (MULT_EXPR
, weights
,
3552 gimple_call_arg (stmt
, 0),
3553 gimple_call_arg (stmt
, 0));
3561 cost
= node
? weights
->call_cost
: weights
->indirect_call_cost
;
3562 if (gimple_call_lhs (stmt
))
3563 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3564 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3566 tree arg
= gimple_call_arg (stmt
, i
);
3567 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3573 return weights
->return_cost
;
3579 case GIMPLE_PREDICT
:
3584 return asm_str_count (gimple_asm_string (stmt
));
3587 /* This is either going to be an external function call with one
3588 argument, or two register copy statements plus a goto. */
3591 case GIMPLE_EH_DISPATCH
:
3592 /* ??? This is going to turn into a switch statement. Ideally
3593 we'd have a look at the eh region and estimate the number of
3598 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3600 case GIMPLE_EH_FILTER
:
3601 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3604 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3607 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3608 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3610 /* OpenMP directives are generally very expensive. */
3612 case GIMPLE_OMP_RETURN
:
3613 case GIMPLE_OMP_SECTIONS_SWITCH
:
3614 case GIMPLE_OMP_ATOMIC_STORE
:
3615 case GIMPLE_OMP_CONTINUE
:
3616 /* ...except these, which are cheap. */
3619 case GIMPLE_OMP_ATOMIC_LOAD
:
3620 return weights
->omp_cost
;
3622 case GIMPLE_OMP_FOR
:
3623 return (weights
->omp_cost
3624 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3625 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3627 case GIMPLE_OMP_PARALLEL
:
3628 case GIMPLE_OMP_TASK
:
3629 case GIMPLE_OMP_CRITICAL
:
3630 case GIMPLE_OMP_MASTER
:
3631 case GIMPLE_OMP_ORDERED
:
3632 case GIMPLE_OMP_SECTION
:
3633 case GIMPLE_OMP_SECTIONS
:
3634 case GIMPLE_OMP_SINGLE
:
3635 return (weights
->omp_cost
3636 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3638 case GIMPLE_TRANSACTION
:
3639 return (weights
->tm_cost
3640 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3650 /* Estimate number of instructions that will be created by expanding
3651 function FNDECL. WEIGHTS contains weights attributed to various
3655 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3657 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3658 gimple_stmt_iterator bsi
;
3662 gcc_assert (my_function
&& my_function
->cfg
);
3663 FOR_EACH_BB_FN (bb
, my_function
)
3665 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3666 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3673 /* Initializes weights used by estimate_num_insns. */
3676 init_inline_once (void)
3678 eni_size_weights
.call_cost
= 1;
3679 eni_size_weights
.indirect_call_cost
= 3;
3680 eni_size_weights
.target_builtin_call_cost
= 1;
3681 eni_size_weights
.div_mod_cost
= 1;
3682 eni_size_weights
.omp_cost
= 40;
3683 eni_size_weights
.tm_cost
= 10;
3684 eni_size_weights
.time_based
= false;
3685 eni_size_weights
.return_cost
= 1;
3687 /* Estimating time for call is difficult, since we have no idea what the
3688 called function does. In the current uses of eni_time_weights,
3689 underestimating the cost does less harm than overestimating it, so
3690 we choose a rather small value here. */
3691 eni_time_weights
.call_cost
= 10;
3692 eni_time_weights
.indirect_call_cost
= 15;
3693 eni_time_weights
.target_builtin_call_cost
= 1;
3694 eni_time_weights
.div_mod_cost
= 10;
3695 eni_time_weights
.omp_cost
= 40;
3696 eni_time_weights
.tm_cost
= 40;
3697 eni_time_weights
.time_based
= true;
3698 eni_time_weights
.return_cost
= 2;
3701 /* Estimate the number of instructions in a gimple_seq. */
3704 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3706 gimple_stmt_iterator gsi
;
3708 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3709 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3715 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3718 prepend_lexical_block (tree current_block
, tree new_block
)
3720 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
3721 BLOCK_SUBBLOCKS (current_block
) = new_block
;
3722 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
3725 /* Add local variables from CALLEE to CALLER. */
3728 add_local_variables (struct function
*callee
, struct function
*caller
,
3734 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
3735 if (!can_be_nonlocal (var
, id
))
3737 tree new_var
= remap_decl (var
, id
);
3739 /* Remap debug-expressions. */
3740 if (TREE_CODE (new_var
) == VAR_DECL
3741 && DECL_DEBUG_EXPR_IS_FROM (new_var
)
3744 tree tem
= DECL_DEBUG_EXPR (var
);
3745 bool old_regimplify
= id
->regimplify
;
3746 id
->remapping_type_depth
++;
3747 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
3748 id
->remapping_type_depth
--;
3749 id
->regimplify
= old_regimplify
;
3750 SET_DECL_DEBUG_EXPR (new_var
, tem
);
3752 add_local_decl (caller
, new_var
);
3756 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3759 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
3763 struct pointer_map_t
*st
, *dst
;
3766 location_t saved_location
;
3767 struct cgraph_edge
*cg_edge
;
3768 cgraph_inline_failed_t reason
;
3769 basic_block return_block
;
3771 gimple_stmt_iterator gsi
, stmt_gsi
;
3772 bool successfully_inlined
= FALSE
;
3773 bool purge_dead_abnormal_edges
;
3775 /* Set input_location here so we get the right instantiation context
3776 if we call instantiate_decl from inlinable_function_p. */
3777 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
3778 saved_location
= input_location
;
3779 input_location
= gimple_location (stmt
);
3781 /* From here on, we're only interested in CALL_EXPRs. */
3782 if (gimple_code (stmt
) != GIMPLE_CALL
)
3785 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
3786 gcc_checking_assert (cg_edge
);
3787 /* First, see if we can figure out what function is being called.
3788 If we cannot, then there is no hope of inlining the function. */
3789 if (cg_edge
->indirect_unknown_callee
)
3791 fn
= cg_edge
->callee
->symbol
.decl
;
3792 gcc_checking_assert (fn
);
3794 /* If FN is a declaration of a function in a nested scope that was
3795 globally declared inline, we don't set its DECL_INITIAL.
3796 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3797 C++ front-end uses it for cdtors to refer to their internal
3798 declarations, that are not real functions. Fortunately those
3799 don't have trees to be saved, so we can tell by checking their
3801 if (!DECL_INITIAL (fn
)
3802 && DECL_ABSTRACT_ORIGIN (fn
)
3803 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
3804 fn
= DECL_ABSTRACT_ORIGIN (fn
);
3806 /* Don't try to inline functions that are not well-suited to inlining. */
3807 if (cg_edge
->inline_failed
)
3809 reason
= cg_edge
->inline_failed
;
3810 /* If this call was originally indirect, we do not want to emit any
3811 inlining related warnings or sorry messages because there are no
3812 guarantees regarding those. */
3813 if (cg_edge
->indirect_inlining_edge
)
3816 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
3817 /* For extern inline functions that get redefined we always
3818 silently ignored always_inline flag. Better behaviour would
3819 be to be able to keep both bodies and use extern inline body
3820 for inlining, but we can't do that because frontends overwrite
3822 && !cg_edge
->callee
->local
.redefined_extern_inline
3823 /* Avoid warnings during early inline pass. */
3824 && cgraph_global_info_ready
3825 /* PR 20090218-1_0.c. Body can be provided by another module. */
3826 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
3828 error ("inlining failed in call to always_inline %q+F: %s", fn
,
3829 cgraph_inline_failed_string (reason
));
3830 error ("called from here");
3832 else if (warn_inline
3833 && DECL_DECLARED_INLINE_P (fn
)
3834 && !DECL_NO_INLINE_WARNING_P (fn
)
3835 && !DECL_IN_SYSTEM_HEADER (fn
)
3836 && reason
!= CIF_UNSPECIFIED
3837 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
3838 /* Do not warn about not inlined recursive calls. */
3839 && !cgraph_edge_recursive_p (cg_edge
)
3840 /* Avoid warnings during early inline pass. */
3841 && cgraph_global_info_ready
)
3843 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
3844 fn
, _(cgraph_inline_failed_string (reason
)));
3845 warning (OPT_Winline
, "called from here");
3849 fn
= cg_edge
->callee
->symbol
.decl
;
3851 #ifdef ENABLE_CHECKING
3852 if (cg_edge
->callee
->symbol
.decl
!= id
->dst_node
->symbol
.decl
)
3853 verify_cgraph_node (cg_edge
->callee
);
3856 /* We will be inlining this callee. */
3857 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
3859 /* Update the callers EH personality. */
3860 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
))
3861 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->symbol
.decl
)
3862 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
);
3864 /* Split the block holding the GIMPLE_CALL. */
3865 e
= split_block (bb
, stmt
);
3867 return_block
= e
->dest
;
3870 /* split_block splits after the statement; work around this by
3871 moving the call into the second block manually. Not pretty,
3872 but seems easier than doing the CFG manipulation by hand
3873 when the GIMPLE_CALL is in the last statement of BB. */
3874 stmt_gsi
= gsi_last_bb (bb
);
3875 gsi_remove (&stmt_gsi
, false);
3877 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3878 been the source of abnormal edges. In this case, schedule
3879 the removal of dead abnormal edges. */
3880 gsi
= gsi_start_bb (return_block
);
3881 if (gsi_end_p (gsi
))
3883 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
3884 purge_dead_abnormal_edges
= true;
3888 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
3889 purge_dead_abnormal_edges
= false;
3892 stmt_gsi
= gsi_start_bb (return_block
);
3894 /* Build a block containing code to initialize the arguments, the
3895 actual inline expansion of the body, and a label for the return
3896 statements within the function to jump to. The type of the
3897 statement expression is the return type of the function call. */
3898 id
->block
= make_node (BLOCK
);
3899 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
3900 BLOCK_SOURCE_LOCATION (id
->block
) = input_location
;
3901 if (gimple_block (stmt
))
3902 prepend_lexical_block (gimple_block (stmt
), id
->block
);
3904 /* Local declarations will be replaced by their equivalents in this
3907 id
->decl_map
= pointer_map_create ();
3908 dst
= id
->debug_map
;
3909 id
->debug_map
= NULL
;
3911 /* Record the function we are about to inline. */
3913 id
->src_node
= cg_edge
->callee
;
3914 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
3915 id
->gimple_call
= stmt
;
3917 gcc_assert (!id
->src_cfun
->after_inlining
);
3920 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
3922 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3923 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
3927 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
3929 if (DECL_INITIAL (fn
))
3930 prepend_lexical_block (id
->block
, remap_blocks (DECL_INITIAL (fn
), id
));
3932 /* Return statements in the function body will be replaced by jumps
3933 to the RET_LABEL. */
3934 gcc_assert (DECL_INITIAL (fn
));
3935 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
3937 /* Find the LHS to which the result of this call is assigned. */
3939 if (gimple_call_lhs (stmt
))
3941 modify_dest
= gimple_call_lhs (stmt
);
3943 /* The function which we are inlining might not return a value,
3944 in which case we should issue a warning that the function
3945 does not return a value. In that case the optimizers will
3946 see that the variable to which the value is assigned was not
3947 initialized. We do not want to issue a warning about that
3948 uninitialized variable. */
3949 if (DECL_P (modify_dest
))
3950 TREE_NO_WARNING (modify_dest
) = 1;
3952 if (gimple_call_return_slot_opt_p (stmt
))
3954 return_slot
= modify_dest
;
3961 /* If we are inlining a call to the C++ operator new, we don't want
3962 to use type based alias analysis on the return value. Otherwise
3963 we may get confused if the compiler sees that the inlined new
3964 function returns a pointer which was just deleted. See bug
3966 if (DECL_IS_OPERATOR_NEW (fn
))
3972 /* Declare the return variable for the function. */
3973 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
3975 /* Add local vars in this inlined callee to caller. */
3976 add_local_variables (id
->src_cfun
, cfun
, id
);
3978 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
3980 fprintf (dump_file
, "Inlining ");
3981 print_generic_expr (dump_file
, id
->src_fn
, 0);
3982 fprintf (dump_file
, " to ");
3983 print_generic_expr (dump_file
, id
->dst_fn
, 0);
3984 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
3987 /* This is it. Duplicate the callee body. Assume callee is
3988 pre-gimplified. Note that we must not alter the caller
3989 function in any way before this point, as this CALL_EXPR may be
3990 a self-referential call; if we're calling ourselves, we need to
3991 duplicate our body before altering anything. */
3992 copy_body (id
, bb
->count
,
3993 cg_edge
->frequency
* REG_BR_PROB_BASE
/ CGRAPH_FREQ_BASE
,
3994 bb
, return_block
, NULL
, NULL
);
3996 /* Reset the escaped solution. */
3997 if (cfun
->gimple_df
)
3998 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4003 pointer_map_destroy (id
->debug_map
);
4004 id
->debug_map
= dst
;
4006 pointer_map_destroy (id
->decl_map
);
4009 /* Unlink the calls virtual operands before replacing it. */
4010 unlink_stmt_vdef (stmt
);
4012 /* If the inlined function returns a result that we care about,
4013 substitute the GIMPLE_CALL with an assignment of the return
4014 variable to the LHS of the call. That is, if STMT was
4015 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4016 if (use_retvar
&& gimple_call_lhs (stmt
))
4018 gimple old_stmt
= stmt
;
4019 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4020 gsi_replace (&stmt_gsi
, stmt
, false);
4021 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4025 /* Handle the case of inlining a function with no return
4026 statement, which causes the return value to become undefined. */
4027 if (gimple_call_lhs (stmt
)
4028 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4030 tree name
= gimple_call_lhs (stmt
);
4031 tree var
= SSA_NAME_VAR (name
);
4032 tree def
= ssa_default_def (cfun
, var
);
4036 /* If the variable is used undefined, make this name
4037 undefined via a move. */
4038 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4039 gsi_replace (&stmt_gsi
, stmt
, true);
4043 /* Otherwise make this variable undefined. */
4044 gsi_remove (&stmt_gsi
, true);
4045 set_ssa_default_def (cfun
, var
, name
);
4046 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4050 gsi_remove (&stmt_gsi
, true);
4053 if (purge_dead_abnormal_edges
)
4055 gimple_purge_dead_eh_edges (return_block
);
4056 gimple_purge_dead_abnormal_call_edges (return_block
);
4059 /* If the value of the new expression is ignored, that's OK. We
4060 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4061 the equivalent inlined version either. */
4062 if (is_gimple_assign (stmt
))
4064 gcc_assert (gimple_assign_single_p (stmt
)
4065 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4066 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4069 /* Output the inlining info for this abstract function, since it has been
4070 inlined. If we don't do this now, we can lose the information about the
4071 variables in the function when the blocks get blown away as soon as we
4072 remove the cgraph node. */
4073 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->symbol
.decl
);
4075 /* Update callgraph if needed. */
4076 cgraph_remove_node (cg_edge
->callee
);
4078 id
->block
= NULL_TREE
;
4079 successfully_inlined
= TRUE
;
4082 input_location
= saved_location
;
4083 return successfully_inlined
;
4086 /* Expand call statements reachable from STMT_P.
4087 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4088 in a MODIFY_EXPR. */
4091 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4093 gimple_stmt_iterator gsi
;
4095 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4097 gimple stmt
= gsi_stmt (gsi
);
4099 if (is_gimple_call (stmt
)
4100 && expand_call_inline (bb
, stmt
, id
))
4108 /* Walk all basic blocks created after FIRST and try to fold every statement
4109 in the STATEMENTS pointer set. */
4112 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4114 for (; first
< n_basic_blocks
; first
++)
4115 if (BASIC_BLOCK (first
))
4117 gimple_stmt_iterator gsi
;
4119 for (gsi
= gsi_start_bb (BASIC_BLOCK (first
));
4122 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4124 gimple old_stmt
= gsi_stmt (gsi
);
4125 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4127 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4129 /* Folding builtins can create multiple instructions,
4130 we need to look at all of them. */
4131 gimple_stmt_iterator i2
= gsi
;
4133 if (fold_stmt (&gsi
))
4136 /* If a builtin at the end of a bb folded into nothing,
4137 the following loop won't work. */
4138 if (gsi_end_p (gsi
))
4140 cgraph_update_edges_for_call_stmt (old_stmt
,
4145 i2
= gsi_start_bb (BASIC_BLOCK (first
));
4150 new_stmt
= gsi_stmt (i2
);
4151 update_stmt (new_stmt
);
4152 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4155 if (new_stmt
== gsi_stmt (gsi
))
4157 /* It is okay to check only for the very last
4158 of these statements. If it is a throwing
4159 statement nothing will change. If it isn't
4160 this can remove EH edges. If that weren't
4161 correct then because some intermediate stmts
4162 throw, but not the last one. That would mean
4163 we'd have to split the block, which we can't
4164 here and we'd loose anyway. And as builtins
4165 probably never throw, this all
4167 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4169 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4176 else if (fold_stmt (&gsi
))
4178 /* Re-read the statement from GSI as fold_stmt() may
4180 gimple new_stmt
= gsi_stmt (gsi
);
4181 update_stmt (new_stmt
);
4183 if (is_gimple_call (old_stmt
)
4184 || is_gimple_call (new_stmt
))
4185 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4188 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4189 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4195 /* Return true if BB has at least one abnormal outgoing edge. */
4198 has_abnormal_outgoing_edge_p (basic_block bb
)
4203 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4204 if (e
->flags
& EDGE_ABNORMAL
)
4210 /* Expand calls to inline functions in the body of FN. */
4213 optimize_inline_calls (tree fn
)
4217 int last
= n_basic_blocks
;
4218 struct gimplify_ctx gctx
;
4219 bool inlined_p
= false;
4222 memset (&id
, 0, sizeof (id
));
4224 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4225 gcc_assert (id
.dst_node
->analyzed
);
4227 /* Or any functions that aren't finished yet. */
4228 if (current_function_decl
)
4229 id
.dst_fn
= current_function_decl
;
4231 id
.copy_decl
= copy_decl_maybe_to_var
;
4232 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4233 id
.transform_new_cfg
= false;
4234 id
.transform_return_to_modify
= true;
4235 id
.transform_lang_insert_block
= NULL
;
4236 id
.statements_to_fold
= pointer_set_create ();
4238 push_gimplify_context (&gctx
);
4240 /* We make no attempts to keep dominance info up-to-date. */
4241 free_dominance_info (CDI_DOMINATORS
);
4242 free_dominance_info (CDI_POST_DOMINATORS
);
4244 /* Register specific gimple functions. */
4245 gimple_register_cfg_hooks ();
4247 /* Reach the trees by walking over the CFG, and note the
4248 enclosing basic-blocks in the call edges. */
4249 /* We walk the blocks going forward, because inlined function bodies
4250 will split id->current_basic_block, and the new blocks will
4251 follow it; we'll trudge through them, processing their CALL_EXPRs
4254 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4256 pop_gimplify_context (NULL
);
4258 #ifdef ENABLE_CHECKING
4260 struct cgraph_edge
*e
;
4262 verify_cgraph_node (id
.dst_node
);
4264 /* Double check that we inlined everything we are supposed to inline. */
4265 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4266 gcc_assert (e
->inline_failed
);
4270 /* Fold queued statements. */
4271 fold_marked_statements (last
, id
.statements_to_fold
);
4272 pointer_set_destroy (id
.statements_to_fold
);
4274 gcc_assert (!id
.debug_stmts
);
4276 /* If we didn't inline into the function there is nothing to do. */
4280 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4283 delete_unreachable_blocks_update_callgraph (&id
);
4284 #ifdef ENABLE_CHECKING
4285 verify_cgraph_node (id
.dst_node
);
4288 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4289 not possible yet - the IPA passes might make various functions to not
4290 throw and they don't care to proactively update local EH info. This is
4291 done later in fixup_cfg pass that also execute the verification. */
4292 return (TODO_update_ssa
4294 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4295 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4296 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
4299 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4302 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4304 enum tree_code code
= TREE_CODE (*tp
);
4305 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4307 /* We make copies of most nodes. */
4308 if (IS_EXPR_CODE_CLASS (cl
)
4309 || code
== TREE_LIST
4311 || code
== TYPE_DECL
4312 || code
== OMP_CLAUSE
)
4314 /* Because the chain gets clobbered when we make a copy, we save it
4316 tree chain
= NULL_TREE
, new_tree
;
4318 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4319 chain
= TREE_CHAIN (*tp
);
4321 /* Copy the node. */
4322 new_tree
= copy_node (*tp
);
4324 /* Propagate mudflap marked-ness. */
4325 if (flag_mudflap
&& mf_marked_p (*tp
))
4330 /* Now, restore the chain, if appropriate. That will cause
4331 walk_tree to walk into the chain as well. */
4332 if (code
== PARM_DECL
4333 || code
== TREE_LIST
4334 || code
== OMP_CLAUSE
)
4335 TREE_CHAIN (*tp
) = chain
;
4337 /* For now, we don't update BLOCKs when we make copies. So, we
4338 have to nullify all BIND_EXPRs. */
4339 if (TREE_CODE (*tp
) == BIND_EXPR
)
4340 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4342 else if (code
== CONSTRUCTOR
)
4344 /* CONSTRUCTOR nodes need special handling because
4345 we need to duplicate the vector of elements. */
4348 new_tree
= copy_node (*tp
);
4350 /* Propagate mudflap marked-ness. */
4351 if (flag_mudflap
&& mf_marked_p (*tp
))
4354 CONSTRUCTOR_ELTS (new_tree
) = VEC_copy (constructor_elt
, gc
,
4355 CONSTRUCTOR_ELTS (*tp
));
4358 else if (code
== STATEMENT_LIST
)
4359 /* We used to just abort on STATEMENT_LIST, but we can run into them
4360 with statement-expressions (c++/40975). */
4361 copy_statement_list (tp
);
4362 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4364 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4366 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4371 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4372 information indicating to what new SAVE_EXPR this one should be mapped,
4373 use that one. Otherwise, create a new node and enter it in ST. FN is
4374 the function into which the copy will be placed. */
4377 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4379 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4383 /* See if we already encountered this SAVE_EXPR. */
4384 n
= (tree
*) pointer_map_contains (st
, *tp
);
4386 /* If we didn't already remap this SAVE_EXPR, do so now. */
4389 t
= copy_node (*tp
);
4391 /* Remember this SAVE_EXPR. */
4392 *pointer_map_insert (st
, *tp
) = t
;
4393 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4394 *pointer_map_insert (st
, t
) = t
;
4398 /* We've already walked into this SAVE_EXPR; don't do it again. */
4403 /* Replace this SAVE_EXPR with the copy. */
4407 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4408 copies the declaration and enters it in the splay_tree in DATA (which is
4409 really an `copy_body_data *'). */
4412 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
4415 copy_body_data
*id
= (copy_body_data
*) data
;
4417 /* Don't walk into types. */
4421 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
4423 tree decl
= TREE_OPERAND (*tp
, 0);
4425 /* Copy the decl and remember the copy. */
4426 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4432 /* Perform any modifications to EXPR required when it is unsaved. Does
4433 not recurse into EXPR's subtrees. */
4436 unsave_expr_1 (tree expr
)
4438 switch (TREE_CODE (expr
))
4441 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4442 It's OK for this to happen if it was part of a subtree that
4443 isn't immediately expanded, such as operand 2 of another
4445 if (TREE_OPERAND (expr
, 1))
4448 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4449 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4457 /* Called via walk_tree when an expression is unsaved. Using the
4458 splay_tree pointed to by ST (which is really a `splay_tree'),
4459 remaps all local declarations to appropriate replacements. */
4462 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
4464 copy_body_data
*id
= (copy_body_data
*) data
;
4465 struct pointer_map_t
*st
= id
->decl_map
;
4468 /* Only a local declaration (variable or label). */
4469 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
4470 || TREE_CODE (*tp
) == LABEL_DECL
)
4472 /* Lookup the declaration. */
4473 n
= (tree
*) pointer_map_contains (st
, *tp
);
4475 /* If it's there, remap it. */
4480 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
4482 else if (TREE_CODE (*tp
) == BIND_EXPR
)
4483 copy_bind_expr (tp
, walk_subtrees
, id
);
4484 else if (TREE_CODE (*tp
) == SAVE_EXPR
4485 || TREE_CODE (*tp
) == TARGET_EXPR
)
4486 remap_save_expr (tp
, st
, walk_subtrees
);
4489 copy_tree_r (tp
, walk_subtrees
, NULL
);
4491 /* Do whatever unsaving is required. */
4492 unsave_expr_1 (*tp
);
4495 /* Keep iterating. */
4499 /* Copies everything in EXPR and replaces variables, labels
4500 and SAVE_EXPRs local to EXPR. */
4503 unsave_expr_now (tree expr
)
4507 /* There's nothing to do for NULL_TREE. */
4512 memset (&id
, 0, sizeof (id
));
4513 id
.src_fn
= current_function_decl
;
4514 id
.dst_fn
= current_function_decl
;
4515 id
.decl_map
= pointer_map_create ();
4516 id
.debug_map
= NULL
;
4518 id
.copy_decl
= copy_decl_no_change
;
4519 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4520 id
.transform_new_cfg
= false;
4521 id
.transform_return_to_modify
= false;
4522 id
.transform_lang_insert_block
= NULL
;
4524 /* Walk the tree once to find local labels. */
4525 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
4527 /* Walk the tree again, copying, remapping, and unsaving. */
4528 walk_tree (&expr
, unsave_r
, &id
, NULL
);
4531 pointer_map_destroy (id
.decl_map
);
4533 pointer_map_destroy (id
.debug_map
);
4538 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4539 label, copies the declaration and enters it in the splay_tree in DATA (which
4540 is really a 'copy_body_data *'. */
4543 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4544 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4545 struct walk_stmt_info
*wi
)
4547 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4548 gimple stmt
= gsi_stmt (*gsip
);
4550 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4552 tree decl
= gimple_label_label (stmt
);
4554 /* Copy the decl and remember the copy. */
4555 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4562 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4563 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4564 remaps all local declarations to appropriate replacements in gimple
4568 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4570 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4571 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4572 struct pointer_map_t
*st
= id
->decl_map
;
4576 /* Only a local declaration (variable or label). */
4577 if ((TREE_CODE (expr
) == VAR_DECL
4578 && !TREE_STATIC (expr
))
4579 || TREE_CODE (expr
) == LABEL_DECL
)
4581 /* Lookup the declaration. */
4582 n
= (tree
*) pointer_map_contains (st
, expr
);
4584 /* If it's there, remap it. */
4589 else if (TREE_CODE (expr
) == STATEMENT_LIST
4590 || TREE_CODE (expr
) == BIND_EXPR
4591 || TREE_CODE (expr
) == SAVE_EXPR
)
4593 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4595 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4596 It's OK for this to happen if it was part of a subtree that
4597 isn't immediately expanded, such as operand 2 of another
4599 if (!TREE_OPERAND (expr
, 1))
4601 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4602 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4606 /* Keep iterating. */
4611 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4612 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4613 remaps all local declarations to appropriate replacements in gimple
4617 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4618 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4619 struct walk_stmt_info
*wi
)
4621 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4622 gimple stmt
= gsi_stmt (*gsip
);
4624 if (gimple_code (stmt
) == GIMPLE_BIND
)
4626 tree block
= gimple_bind_block (stmt
);
4630 remap_block (&block
, id
);
4631 gimple_bind_set_block (stmt
, block
);
4634 /* This will remap a lot of the same decls again, but this should be
4636 if (gimple_bind_vars (stmt
))
4637 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
), NULL
, id
));
4640 /* Keep iterating. */
4645 /* Copies everything in SEQ and replaces variables and labels local to
4646 current_function_decl. */
4649 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4652 struct walk_stmt_info wi
;
4653 struct pointer_set_t
*visited
;
4656 /* There's nothing to do for NULL_TREE. */
4661 memset (&id
, 0, sizeof (id
));
4662 id
.src_fn
= current_function_decl
;
4663 id
.dst_fn
= current_function_decl
;
4664 id
.decl_map
= pointer_map_create ();
4665 id
.debug_map
= NULL
;
4667 id
.copy_decl
= copy_decl_no_change
;
4668 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4669 id
.transform_new_cfg
= false;
4670 id
.transform_return_to_modify
= false;
4671 id
.transform_lang_insert_block
= NULL
;
4673 /* Walk the tree once to find local labels. */
4674 memset (&wi
, 0, sizeof (wi
));
4675 visited
= pointer_set_create ();
4678 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4679 pointer_set_destroy (visited
);
4681 copy
= gimple_seq_copy (seq
);
4683 /* Walk the copy, remapping decls. */
4684 memset (&wi
, 0, sizeof (wi
));
4686 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4689 pointer_map_destroy (id
.decl_map
);
4691 pointer_map_destroy (id
.debug_map
);
4697 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4700 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4709 debug_find_tree (tree top
, tree search
)
4711 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4715 /* Declare the variables created by the inliner. Add all the variables in
4716 VARS to BIND_EXPR. */
4719 declare_inline_vars (tree block
, tree vars
)
4722 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4724 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4725 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4726 add_local_decl (cfun
, t
);
4730 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4733 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4734 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4735 VAR_DECL translation. */
4738 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4740 /* Don't generate debug information for the copy if we wouldn't have
4741 generated it for the copy either. */
4742 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4743 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4745 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4746 declaration inspired this copy. */
4747 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4749 /* The new variable/label has no RTL, yet. */
4750 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4751 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4752 SET_DECL_RTL (copy
, 0);
4754 /* These args would always appear unused, if not for this. */
4755 TREE_USED (copy
) = 1;
4757 /* Set the context for the new declaration. */
4758 if (!DECL_CONTEXT (decl
))
4759 /* Globals stay global. */
4761 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4762 /* Things that weren't in the scope of the function we're inlining
4763 from aren't in the scope we're inlining to, either. */
4765 else if (TREE_STATIC (decl
))
4766 /* Function-scoped static variables should stay in the original
4770 /* Ordinary automatic local variables are now in the scope of the
4772 DECL_CONTEXT (copy
) = id
->dst_fn
;
4778 copy_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
);
4787 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4788 VAR_DECL
, DECL_NAME (decl
), type
);
4789 if (DECL_PT_UID_SET_P (decl
))
4790 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4791 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4792 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4793 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4794 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4796 return copy_decl_for_dup_finish (id
, decl
, copy
);
4799 /* Like copy_decl_to_var, but create a return slot object instead of a
4800 pointer variable for return by invisible reference. */
4803 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4807 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4808 || TREE_CODE (decl
) == RESULT_DECL
);
4810 type
= TREE_TYPE (decl
);
4811 if (DECL_BY_REFERENCE (decl
))
4812 type
= TREE_TYPE (type
);
4814 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4815 VAR_DECL
, DECL_NAME (decl
), type
);
4816 if (DECL_PT_UID_SET_P (decl
))
4817 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4818 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4819 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4820 if (!DECL_BY_REFERENCE (decl
))
4822 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4823 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4826 return copy_decl_for_dup_finish (id
, decl
, copy
);
4830 copy_decl_no_change (tree decl
, copy_body_data
*id
)
4834 copy
= copy_node (decl
);
4836 /* The COPY is not abstract; it will be generated in DST_FN. */
4837 DECL_ABSTRACT (copy
) = 0;
4838 lang_hooks
.dup_lang_specific_decl (copy
);
4840 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4841 been taken; it's for internal bookkeeping in expand_goto_internal. */
4842 if (TREE_CODE (copy
) == LABEL_DECL
)
4844 TREE_ADDRESSABLE (copy
) = 0;
4845 LABEL_DECL_UID (copy
) = -1;
4848 return copy_decl_for_dup_finish (id
, decl
, copy
);
4852 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
4854 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
4855 return copy_decl_to_var (decl
, id
);
4857 return copy_decl_no_change (decl
, id
);
4860 /* Return a copy of the function's argument tree. */
4862 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
4863 bitmap args_to_skip
, tree
*vars
)
4866 tree new_parm
= NULL
;
4871 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
4872 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
4874 tree new_tree
= remap_decl (arg
, id
);
4875 if (TREE_CODE (new_tree
) != PARM_DECL
)
4876 new_tree
= id
->copy_decl (arg
, id
);
4877 lang_hooks
.dup_lang_specific_decl (new_tree
);
4879 parg
= &DECL_CHAIN (new_tree
);
4881 else if (!pointer_map_contains (id
->decl_map
, arg
))
4883 /* Make an equivalent VAR_DECL. If the argument was used
4884 as temporary variable later in function, the uses will be
4885 replaced by local variable. */
4886 tree var
= copy_decl_to_var (arg
, id
);
4887 insert_decl_map (id
, arg
, var
);
4888 /* Declare this new variable. */
4889 DECL_CHAIN (var
) = *vars
;
4895 /* Return a copy of the function's static chain. */
4897 copy_static_chain (tree static_chain
, copy_body_data
* id
)
4899 tree
*chain_copy
, *pvar
;
4901 chain_copy
= &static_chain
;
4902 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
4904 tree new_tree
= remap_decl (*pvar
, id
);
4905 lang_hooks
.dup_lang_specific_decl (new_tree
);
4906 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
4909 return static_chain
;
4912 /* Return true if the function is allowed to be versioned.
4913 This is a guard for the versioning functionality. */
4916 tree_versionable_function_p (tree fndecl
)
4918 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
4919 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
4922 /* Delete all unreachable basic blocks and update callgraph.
4923 Doing so is somewhat nontrivial because we need to update all clones and
4924 remove inline function that become unreachable. */
4927 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
4929 bool changed
= false;
4930 basic_block b
, next_bb
;
4932 find_unreachable_blocks ();
4934 /* Delete all unreachable basic blocks. */
4936 for (b
= ENTRY_BLOCK_PTR
->next_bb
; b
!= EXIT_BLOCK_PTR
; b
= next_bb
)
4938 next_bb
= b
->next_bb
;
4940 if (!(b
->flags
& BB_REACHABLE
))
4942 gimple_stmt_iterator bsi
;
4944 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4945 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
)
4947 struct cgraph_edge
*e
;
4948 struct cgraph_node
*node
;
4950 if ((e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
4952 if (!e
->inline_failed
)
4953 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
4955 cgraph_remove_edge (e
);
4957 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
4958 && id
->dst_node
->clones
)
4959 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
4961 if ((e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
4963 if (!e
->inline_failed
)
4964 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
4966 cgraph_remove_edge (e
);
4970 node
= node
->clones
;
4971 else if (node
->next_sibling_clone
)
4972 node
= node
->next_sibling_clone
;
4975 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
4976 node
= node
->clone_of
;
4977 if (node
!= id
->dst_node
)
4978 node
= node
->next_sibling_clone
;
4982 delete_basic_block (b
);
4990 /* Update clone info after duplication. */
4993 update_clone_info (copy_body_data
* id
)
4995 struct cgraph_node
*node
;
4996 if (!id
->dst_node
->clones
)
4998 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5000 /* First update replace maps to match the new body. */
5001 if (node
->clone
.tree_map
)
5004 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, node
->clone
.tree_map
); i
++)
5006 struct ipa_replace_map
*replace_info
;
5007 replace_info
= VEC_index (ipa_replace_map_p
, node
->clone
.tree_map
, i
);
5008 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5009 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5013 node
= node
->clones
;
5014 else if (node
->next_sibling_clone
)
5015 node
= node
->next_sibling_clone
;
5018 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5019 node
= node
->clone_of
;
5020 if (node
!= id
->dst_node
)
5021 node
= node
->next_sibling_clone
;
5026 /* Create a copy of a function's tree.
5027 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5028 of the original function and the new copied function
5029 respectively. In case we want to replace a DECL
5030 tree with another tree while duplicating the function's
5031 body, TREE_MAP represents the mapping between these
5032 trees. If UPDATE_CLONES is set, the call_stmt fields
5033 of edges of clones of the function will be updated.
5035 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5037 If SKIP_RETURN is true, the new version will return void.
5038 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5039 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5042 tree_function_versioning (tree old_decl
, tree new_decl
,
5043 VEC(ipa_replace_map_p
,gc
)* tree_map
,
5044 bool update_clones
, bitmap args_to_skip
,
5045 bool skip_return
, bitmap blocks_to_copy
,
5046 basic_block new_entry
)
5048 struct cgraph_node
*old_version_node
;
5049 struct cgraph_node
*new_version_node
;
5053 struct ipa_replace_map
*replace_info
;
5054 basic_block old_entry_block
, bb
;
5055 VEC (gimple
, heap
) *init_stmts
= VEC_alloc (gimple
, heap
, 10);
5056 tree vars
= NULL_TREE
;
5058 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5059 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5060 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5062 old_version_node
= cgraph_get_node (old_decl
);
5063 gcc_checking_assert (old_version_node
);
5064 new_version_node
= cgraph_get_node (new_decl
);
5065 gcc_checking_assert (new_version_node
);
5067 /* Copy over debug args. */
5068 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5070 VEC(tree
, gc
) **new_debug_args
, **old_debug_args
;
5071 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5072 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5073 old_debug_args
= decl_debug_args_lookup (old_decl
);
5076 new_debug_args
= decl_debug_args_insert (new_decl
);
5077 *new_debug_args
= VEC_copy (tree
, gc
, *old_debug_args
);
5081 /* Output the inlining info for this abstract function, since it has been
5082 inlined. If we don't do this now, we can lose the information about the
5083 variables in the function when the blocks get blown away as soon as we
5084 remove the cgraph node. */
5085 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5087 DECL_ARTIFICIAL (new_decl
) = 1;
5088 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5089 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5091 /* Prepare the data structures for the tree copy. */
5092 memset (&id
, 0, sizeof (id
));
5094 /* Generate a new name for the new version. */
5095 id
.statements_to_fold
= pointer_set_create ();
5097 id
.decl_map
= pointer_map_create ();
5098 id
.debug_map
= NULL
;
5099 id
.src_fn
= old_decl
;
5100 id
.dst_fn
= new_decl
;
5101 id
.src_node
= old_version_node
;
5102 id
.dst_node
= new_version_node
;
5103 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5104 if (id
.src_node
->ipa_transforms_to_apply
)
5106 VEC(ipa_opt_pass
,heap
) * old_transforms_to_apply
= id
.dst_node
->ipa_transforms_to_apply
;
5109 id
.dst_node
->ipa_transforms_to_apply
= VEC_copy (ipa_opt_pass
, heap
,
5110 id
.src_node
->ipa_transforms_to_apply
);
5111 for (i
= 0; i
< VEC_length (ipa_opt_pass
, old_transforms_to_apply
); i
++)
5112 VEC_safe_push (ipa_opt_pass
, heap
, id
.dst_node
->ipa_transforms_to_apply
,
5113 VEC_index (ipa_opt_pass
,
5114 old_transforms_to_apply
,
5116 VEC_free (ipa_opt_pass
, heap
, old_transforms_to_apply
);
5119 id
.copy_decl
= copy_decl_no_change
;
5120 id
.transform_call_graph_edges
5121 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5122 id
.transform_new_cfg
= true;
5123 id
.transform_return_to_modify
= false;
5124 id
.transform_lang_insert_block
= NULL
;
5126 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION
5127 (DECL_STRUCT_FUNCTION (old_decl
));
5128 initialize_cfun (new_decl
, old_decl
,
5129 old_entry_block
->count
);
5130 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5131 = id
.src_cfun
->gimple_df
->ipa_pta
;
5133 /* Copy the function's static chain. */
5134 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5136 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5137 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5140 /* If there's a tree_map, prepare for substitution. */
5142 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, tree_map
); i
++)
5145 replace_info
= VEC_index (ipa_replace_map_p
, tree_map
, i
);
5146 if (replace_info
->replace_p
)
5148 tree op
= replace_info
->new_tree
;
5149 if (!replace_info
->old_tree
)
5151 int i
= replace_info
->parm_num
;
5153 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5155 replace_info
->old_tree
= parm
;
5161 if (TREE_CODE (op
) == VIEW_CONVERT_EXPR
)
5162 op
= TREE_OPERAND (op
, 0);
5164 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5165 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5166 replace_info
->new_tree
, id
.src_fn
,
5170 VEC_safe_push (gimple
, heap
, init_stmts
, init
);
5173 /* Copy the function's arguments. */
5174 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5175 DECL_ARGUMENTS (new_decl
) =
5176 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5177 args_to_skip
, &vars
);
5179 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5180 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5182 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5184 if (!VEC_empty (tree
, DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5185 /* Add local vars. */
5186 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5188 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5190 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5192 DECL_RESULT (new_decl
)
5193 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5194 RESULT_DECL
, NULL_TREE
, void_type_node
);
5195 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5196 cfun
->returns_struct
= 0;
5197 cfun
->returns_pcc_struct
= 0;
5202 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5203 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5204 if (gimple_in_ssa_p (id
.src_cfun
)
5205 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5206 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5208 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5209 insert_decl_map (&id
, old_name
, new_name
);
5210 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5211 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5215 /* Copy the Function's body. */
5216 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5217 ENTRY_BLOCK_PTR
, EXIT_BLOCK_PTR
, blocks_to_copy
, new_entry
);
5219 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5220 number_blocks (new_decl
);
5222 /* We want to create the BB unconditionally, so that the addition of
5223 debug stmts doesn't affect BB count, which may in the end cause
5224 codegen differences. */
5225 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR
));
5226 while (VEC_length (gimple
, init_stmts
))
5227 insert_init_stmt (&id
, bb
, VEC_pop (gimple
, init_stmts
));
5228 update_clone_info (&id
);
5230 /* Remap the nonlocal_goto_save_area, if any. */
5231 if (cfun
->nonlocal_goto_save_area
)
5233 struct walk_stmt_info wi
;
5235 memset (&wi
, 0, sizeof (wi
));
5237 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5241 pointer_map_destroy (id
.decl_map
);
5243 pointer_map_destroy (id
.debug_map
);
5244 free_dominance_info (CDI_DOMINATORS
);
5245 free_dominance_info (CDI_POST_DOMINATORS
);
5247 fold_marked_statements (0, id
.statements_to_fold
);
5248 pointer_set_destroy (id
.statements_to_fold
);
5249 fold_cond_expr_cond ();
5250 delete_unreachable_blocks_update_callgraph (&id
);
5251 if (id
.dst_node
->analyzed
)
5252 cgraph_rebuild_references ();
5253 update_ssa (TODO_update_ssa
);
5255 /* After partial cloning we need to rescale frequencies, so they are
5256 within proper range in the cloned function. */
5259 struct cgraph_edge
*e
;
5260 rebuild_frequencies ();
5262 new_version_node
->count
= ENTRY_BLOCK_PTR
->count
;
5263 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5265 basic_block bb
= gimple_bb (e
->call_stmt
);
5266 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5268 e
->count
= bb
->count
;
5270 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5272 basic_block bb
= gimple_bb (e
->call_stmt
);
5273 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5275 e
->count
= bb
->count
;
5279 free_dominance_info (CDI_DOMINATORS
);
5280 free_dominance_info (CDI_POST_DOMINATORS
);
5282 gcc_assert (!id
.debug_stmts
);
5283 VEC_free (gimple
, heap
, init_stmts
);
5288 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5289 the callee and return the inlined body on success. */
5292 maybe_inline_call_in_expr (tree exp
)
5294 tree fn
= get_callee_fndecl (exp
);
5296 /* We can only try to inline "const" functions. */
5297 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5299 struct pointer_map_t
*decl_map
= pointer_map_create ();
5300 call_expr_arg_iterator iter
;
5304 /* Remap the parameters. */
5305 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5307 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5308 *pointer_map_insert (decl_map
, param
) = arg
;
5310 memset (&id
, 0, sizeof (id
));
5312 id
.dst_fn
= current_function_decl
;
5313 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5314 id
.decl_map
= decl_map
;
5316 id
.copy_decl
= copy_decl_no_change
;
5317 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5318 id
.transform_new_cfg
= false;
5319 id
.transform_return_to_modify
= true;
5320 id
.transform_lang_insert_block
= NULL
;
5322 /* Make sure not to unshare trees behind the front-end's back
5323 since front-end specific mechanisms may rely on sharing. */
5324 id
.regimplify
= false;
5325 id
.do_not_unshare
= true;
5327 /* We're not inside any EH region. */
5330 t
= copy_tree_body (&id
);
5331 pointer_map_destroy (decl_map
);
5333 /* We can only return something suitable for use in a GENERIC
5335 if (TREE_CODE (t
) == MODIFY_EXPR
)
5336 return TREE_OPERAND (t
, 1);
5342 /* Duplicate a type, fields and all. */
5345 build_duplicate_type (tree type
)
5347 struct copy_body_data id
;
5349 memset (&id
, 0, sizeof (id
));
5350 id
.src_fn
= current_function_decl
;
5351 id
.dst_fn
= current_function_decl
;
5353 id
.decl_map
= pointer_map_create ();
5354 id
.debug_map
= NULL
;
5355 id
.copy_decl
= copy_decl_no_change
;
5357 type
= remap_type_1 (type
, &id
);
5359 pointer_map_destroy (id
.decl_map
);
5361 pointer_map_destroy (id
.debug_map
);
5363 TYPE_CANONICAL (type
) = type
;