2 Copyright (C) 2001-2013 Free Software Foundation, Inc.
3 Contributed by Alexandre Oliva <aoliva@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
25 #include "diagnostic-core.h"
27 #include "tree-inline.h"
31 #include "insn-config.h"
33 #include "langhooks.h"
34 #include "basic-block.h"
35 #include "tree-iterator.h"
38 #include "tree-mudflap.h"
39 #include "tree-flow.h"
41 #include "tree-flow.h"
42 #include "tree-pretty-print.h"
45 #include "pointer-set.h"
47 #include "value-prof.h"
48 #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 void declare_inline_vars (tree
, tree
);
119 static void remap_save_expr (tree
*, void *, int *);
120 static void prepend_lexical_block (tree current_block
, tree new_block
);
121 static tree
copy_decl_to_var (tree
, copy_body_data
*);
122 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
123 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
124 static gimple
remap_gimple_stmt (gimple
, copy_body_data
*);
125 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
127 /* Insert a tree->tree mapping for ID. Despite the name suggests
128 that the trees should be variables, it is used for more than that. */
131 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
133 *pointer_map_insert (id
->decl_map
, key
) = value
;
135 /* Always insert an identity map as well. If we see this same new
136 node again, we won't want to duplicate it a second time. */
138 *pointer_map_insert (id
->decl_map
, value
) = value
;
141 /* Insert a tree->tree mapping for ID. This is only used for
145 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
147 if (!gimple_in_ssa_p (id
->src_cfun
))
150 if (!MAY_HAVE_DEBUG_STMTS
)
153 if (!target_for_debug_bind (key
))
156 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
157 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
160 id
->debug_map
= pointer_map_create ();
162 *pointer_map_insert (id
->debug_map
, key
) = value
;
165 /* If nonzero, we're remapping the contents of inlined debug
166 statements. If negative, an error has occurred, such as a
167 reference to a variable that isn't available in the inlined
169 static int processing_debug_stmt
= 0;
171 /* Construct new SSA name for old NAME. ID is the inline context. */
174 remap_ssa_name (tree name
, copy_body_data
*id
)
179 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
181 n
= (tree
*) pointer_map_contains (id
->decl_map
, name
);
183 return unshare_expr (*n
);
185 if (processing_debug_stmt
)
187 if (SSA_NAME_IS_DEFAULT_DEF (name
)
188 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
189 && id
->entry_bb
== NULL
190 && single_succ_p (ENTRY_BLOCK_PTR
))
192 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
194 gimple_stmt_iterator gsi
;
195 tree val
= SSA_NAME_VAR (name
);
197 n
= (tree
*) pointer_map_contains (id
->decl_map
, val
);
200 if (TREE_CODE (val
) != PARM_DECL
)
202 processing_debug_stmt
= -1;
205 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
206 DECL_ARTIFICIAL (vexpr
) = 1;
207 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
208 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
209 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR
));
210 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
214 processing_debug_stmt
= -1;
218 /* Remap anonymous SSA names or SSA names of anonymous decls. */
219 var
= SSA_NAME_VAR (name
);
221 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
222 && TREE_CODE (var
) == VAR_DECL
223 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
224 && DECL_ARTIFICIAL (var
)
225 && DECL_IGNORED_P (var
)
226 && !DECL_NAME (var
)))
228 struct ptr_info_def
*pi
;
229 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
), NULL
);
230 if (!var
&& SSA_NAME_IDENTIFIER (name
))
231 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
232 insert_decl_map (id
, name
, new_tree
);
233 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
234 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
235 /* At least IPA points-to info can be directly transferred. */
236 if (id
->src_cfun
->gimple_df
237 && id
->src_cfun
->gimple_df
->ipa_pta
238 && (pi
= SSA_NAME_PTR_INFO (name
))
241 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
247 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
249 new_tree
= remap_decl (var
, id
);
251 /* We might've substituted constant or another SSA_NAME for
254 Replace the SSA name representing RESULT_DECL by variable during
255 inlining: this saves us from need to introduce PHI node in a case
256 return value is just partly initialized. */
257 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
258 && (!SSA_NAME_VAR (name
)
259 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
260 || !id
->transform_return_to_modify
))
262 struct ptr_info_def
*pi
;
263 new_tree
= make_ssa_name (new_tree
, NULL
);
264 insert_decl_map (id
, name
, new_tree
);
265 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
266 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
267 /* At least IPA points-to info can be directly transferred. */
268 if (id
->src_cfun
->gimple_df
269 && id
->src_cfun
->gimple_df
->ipa_pta
270 && (pi
= SSA_NAME_PTR_INFO (name
))
273 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
276 if (SSA_NAME_IS_DEFAULT_DEF (name
))
278 /* By inlining function having uninitialized variable, we might
279 extend the lifetime (variable might get reused). This cause
280 ICE in the case we end up extending lifetime of SSA name across
281 abnormal edge, but also increase register pressure.
283 We simply initialize all uninitialized vars by 0 except
284 for case we are inlining to very first BB. We can avoid
285 this for all BBs that are not inside strongly connected
286 regions of the CFG, but this is expensive to test. */
288 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
289 && (!SSA_NAME_VAR (name
)
290 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
291 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR
, 0)->dest
292 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
294 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
296 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
298 init_stmt
= gimple_build_assign (new_tree
, zero
);
299 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
300 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
304 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
305 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
310 insert_decl_map (id
, name
, new_tree
);
314 /* Remap DECL during the copying of the BLOCK tree for the function. */
317 remap_decl (tree decl
, copy_body_data
*id
)
321 /* We only remap local variables in the current function. */
323 /* See if we have remapped this declaration. */
325 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
327 if (!n
&& processing_debug_stmt
)
329 processing_debug_stmt
= -1;
333 /* If we didn't already have an equivalent for this declaration,
337 /* Make a copy of the variable or label. */
338 tree t
= id
->copy_decl (decl
, id
);
340 /* Remember it, so that if we encounter this local entity again
341 we can reuse this copy. Do this early because remap_type may
342 need this decl for TYPE_STUB_DECL. */
343 insert_decl_map (id
, decl
, t
);
348 /* Remap types, if necessary. */
349 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
350 if (TREE_CODE (t
) == TYPE_DECL
)
351 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
353 /* Remap sizes as necessary. */
354 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
355 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
357 /* If fields, do likewise for offset and qualifier. */
358 if (TREE_CODE (t
) == FIELD_DECL
)
360 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
361 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
362 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
368 if (id
->do_not_unshare
)
371 return unshare_expr (*n
);
375 remap_type_1 (tree type
, copy_body_data
*id
)
379 /* We do need a copy. build and register it now. If this is a pointer or
380 reference type, remap the designated type and make a new pointer or
382 if (TREE_CODE (type
) == POINTER_TYPE
)
384 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
386 TYPE_REF_CAN_ALIAS_ALL (type
));
387 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
388 new_tree
= build_type_attribute_qual_variant (new_tree
,
389 TYPE_ATTRIBUTES (type
),
391 insert_decl_map (id
, type
, new_tree
);
394 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
396 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
398 TYPE_REF_CAN_ALIAS_ALL (type
));
399 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
400 new_tree
= build_type_attribute_qual_variant (new_tree
,
401 TYPE_ATTRIBUTES (type
),
403 insert_decl_map (id
, type
, new_tree
);
407 new_tree
= copy_node (type
);
409 insert_decl_map (id
, type
, new_tree
);
411 /* This is a new type, not a copy of an old type. Need to reassociate
412 variants. We can handle everything except the main variant lazily. */
413 t
= TYPE_MAIN_VARIANT (type
);
416 t
= remap_type (t
, id
);
417 TYPE_MAIN_VARIANT (new_tree
) = t
;
418 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
419 TYPE_NEXT_VARIANT (t
) = new_tree
;
423 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
424 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
427 if (TYPE_STUB_DECL (type
))
428 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
430 /* Lazily create pointer and reference types. */
431 TYPE_POINTER_TO (new_tree
) = NULL
;
432 TYPE_REFERENCE_TO (new_tree
) = NULL
;
434 switch (TREE_CODE (new_tree
))
438 case FIXED_POINT_TYPE
:
441 t
= TYPE_MIN_VALUE (new_tree
);
442 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
443 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
445 t
= TYPE_MAX_VALUE (new_tree
);
446 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
447 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
451 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
452 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
456 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
457 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
462 case QUAL_UNION_TYPE
:
466 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
468 t
= remap_decl (f
, id
);
469 DECL_CONTEXT (t
) = new_tree
;
473 TYPE_FIELDS (new_tree
) = nreverse (nf
);
479 /* Shouldn't have been thought variable sized. */
483 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
484 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
490 remap_type (tree type
, copy_body_data
*id
)
498 /* See if we have remapped this type. */
499 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
503 /* The type only needs remapping if it's variably modified. */
504 if (! variably_modified_type_p (type
, id
->src_fn
))
506 insert_decl_map (id
, type
, type
);
510 id
->remapping_type_depth
++;
511 tmp
= remap_type_1 (type
, id
);
512 id
->remapping_type_depth
--;
517 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
520 can_be_nonlocal (tree decl
, copy_body_data
*id
)
522 /* We can not duplicate function decls. */
523 if (TREE_CODE (decl
) == FUNCTION_DECL
)
526 /* Local static vars must be non-local or we get multiple declaration
528 if (TREE_CODE (decl
) == VAR_DECL
529 && !auto_var_in_fn_p (decl
, id
->src_fn
))
536 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
540 tree new_decls
= NULL_TREE
;
542 /* Remap its variables. */
543 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
547 if (can_be_nonlocal (old_var
, id
))
549 /* We need to add this variable to the local decls as otherwise
550 nothing else will do so. */
551 if (TREE_CODE (old_var
) == VAR_DECL
552 && ! DECL_EXTERNAL (old_var
))
553 add_local_decl (cfun
, old_var
);
554 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
555 && !DECL_IGNORED_P (old_var
)
556 && nonlocalized_list
)
557 vec_safe_push (*nonlocalized_list
, old_var
);
561 /* Remap the variable. */
562 new_var
= remap_decl (old_var
, id
);
564 /* If we didn't remap this variable, we can't mess with its
565 TREE_CHAIN. If we remapped this variable to the return slot, it's
566 already declared somewhere else, so don't declare it here. */
568 if (new_var
== id
->retvar
)
572 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
573 && !DECL_IGNORED_P (old_var
)
574 && nonlocalized_list
)
575 vec_safe_push (*nonlocalized_list
, old_var
);
579 gcc_assert (DECL_P (new_var
));
580 DECL_CHAIN (new_var
) = new_decls
;
583 /* Also copy value-expressions. */
584 if (TREE_CODE (new_var
) == VAR_DECL
585 && DECL_HAS_VALUE_EXPR_P (new_var
))
587 tree tem
= DECL_VALUE_EXPR (new_var
);
588 bool old_regimplify
= id
->regimplify
;
589 id
->remapping_type_depth
++;
590 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
591 id
->remapping_type_depth
--;
592 id
->regimplify
= old_regimplify
;
593 SET_DECL_VALUE_EXPR (new_var
, tem
);
598 return nreverse (new_decls
);
601 /* Copy the BLOCK to contain remapped versions of the variables
602 therein. And hook the new block into the block-tree. */
605 remap_block (tree
*block
, copy_body_data
*id
)
610 /* Make the new block. */
612 new_block
= make_node (BLOCK
);
613 TREE_USED (new_block
) = TREE_USED (old_block
);
614 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
615 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
616 BLOCK_NONLOCALIZED_VARS (new_block
)
617 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
620 /* Remap its variables. */
621 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
622 &BLOCK_NONLOCALIZED_VARS (new_block
),
625 if (id
->transform_lang_insert_block
)
626 id
->transform_lang_insert_block (new_block
);
628 /* Remember the remapped block. */
629 insert_decl_map (id
, old_block
, new_block
);
632 /* Copy the whole block tree and root it in id->block. */
634 remap_blocks (tree block
, copy_body_data
*id
)
637 tree new_tree
= block
;
642 remap_block (&new_tree
, id
);
643 gcc_assert (new_tree
!= block
);
644 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
645 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
646 /* Blocks are in arbitrary order, but make things slightly prettier and do
647 not swap order when producing a copy. */
648 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
652 /* Remap the block tree rooted at BLOCK to nothing. */
654 remap_blocks_to_null (tree block
, copy_body_data
*id
)
657 insert_decl_map (id
, block
, NULL_TREE
);
658 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
659 remap_blocks_to_null (t
, id
);
663 copy_statement_list (tree
*tp
)
665 tree_stmt_iterator oi
, ni
;
668 new_tree
= alloc_stmt_list ();
669 ni
= tsi_start (new_tree
);
670 oi
= tsi_start (*tp
);
671 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
674 for (; !tsi_end_p (oi
); tsi_next (&oi
))
676 tree stmt
= tsi_stmt (oi
);
677 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
678 /* This copy is not redundant; tsi_link_after will smash this
679 STATEMENT_LIST into the end of the one we're building, and we
680 don't want to do that with the original. */
681 copy_statement_list (&stmt
);
682 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
687 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
689 tree block
= BIND_EXPR_BLOCK (*tp
);
690 /* Copy (and replace) the statement. */
691 copy_tree_r (tp
, walk_subtrees
, NULL
);
694 remap_block (&block
, id
);
695 BIND_EXPR_BLOCK (*tp
) = block
;
698 if (BIND_EXPR_VARS (*tp
))
699 /* This will remap a lot of the same decls again, but this should be
701 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
705 /* Create a new gimple_seq by remapping all the statements in BODY
706 using the inlining information in ID. */
709 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
711 gimple_stmt_iterator si
;
712 gimple_seq new_body
= NULL
;
714 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
716 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
717 gimple_seq_add_stmt (&new_body
, new_stmt
);
724 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
725 block using the mapping information in ID. */
728 copy_gimple_bind (gimple stmt
, copy_body_data
*id
)
731 tree new_block
, new_vars
;
732 gimple_seq body
, new_body
;
734 /* Copy the statement. Note that we purposely don't use copy_stmt
735 here because we need to remap statements as we copy. */
736 body
= gimple_bind_body (stmt
);
737 new_body
= remap_gimple_seq (body
, id
);
739 new_block
= gimple_bind_block (stmt
);
741 remap_block (&new_block
, id
);
743 /* This will remap a lot of the same decls again, but this should be
745 new_vars
= gimple_bind_vars (stmt
);
747 new_vars
= remap_decls (new_vars
, NULL
, id
);
749 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
755 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
756 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
757 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
758 recursing into the children nodes of *TP. */
761 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
763 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
764 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
765 tree fn
= id
->src_fn
;
767 if (TREE_CODE (*tp
) == SSA_NAME
)
769 *tp
= remap_ssa_name (*tp
, id
);
773 else if (auto_var_in_fn_p (*tp
, fn
))
775 /* Local variables and labels need to be replaced by equivalent
776 variables. We don't want to copy static variables; there's
777 only one of those, no matter how many times we inline the
778 containing function. Similarly for globals from an outer
782 /* Remap the declaration. */
783 new_decl
= remap_decl (*tp
, id
);
784 gcc_assert (new_decl
);
785 /* Replace this variable with the copy. */
786 STRIP_TYPE_NOPS (new_decl
);
787 /* ??? The C++ frontend uses void * pointer zero to initialize
788 any other type. This confuses the middle-end type verification.
789 As cloned bodies do not go through gimplification again the fixup
790 there doesn't trigger. */
791 if (TREE_CODE (new_decl
) == INTEGER_CST
792 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
793 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
797 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
799 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
801 else if (TREE_CODE (*tp
) == LABEL_DECL
802 && (!DECL_CONTEXT (*tp
)
803 || decl_function_context (*tp
) == id
->src_fn
))
804 /* These may need to be remapped for EH handling. */
805 *tp
= remap_decl (*tp
, id
);
806 else if (TREE_CODE (*tp
) == FIELD_DECL
)
808 /* If the enclosing record type is variably_modified_type_p, the field
809 has already been remapped. Otherwise, it need not be. */
810 tree
*n
= (tree
*) pointer_map_contains (id
->decl_map
, *tp
);
815 else if (TYPE_P (*tp
))
816 /* Types may need remapping as well. */
817 *tp
= remap_type (*tp
, id
);
818 else if (CONSTANT_CLASS_P (*tp
))
820 /* If this is a constant, we have to copy the node iff the type
821 will be remapped. copy_tree_r will not copy a constant. */
822 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
824 if (new_type
== TREE_TYPE (*tp
))
827 else if (TREE_CODE (*tp
) == INTEGER_CST
)
828 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
829 TREE_INT_CST_HIGH (*tp
));
832 *tp
= copy_node (*tp
);
833 TREE_TYPE (*tp
) = new_type
;
838 /* Otherwise, just copy the node. Note that copy_tree_r already
839 knows not to copy VAR_DECLs, etc., so this is safe. */
841 if (TREE_CODE (*tp
) == MEM_REF
)
843 tree ptr
= TREE_OPERAND (*tp
, 0);
844 tree type
= remap_type (TREE_TYPE (*tp
), id
);
847 /* We need to re-canonicalize MEM_REFs from inline substitutions
848 that can happen when a pointer argument is an ADDR_EXPR.
849 Recurse here manually to allow that. */
850 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
851 *tp
= fold_build2 (MEM_REF
, type
,
852 ptr
, TREE_OPERAND (*tp
, 1));
853 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
854 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
855 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
856 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
861 /* Here is the "usual case". Copy this tree node, and then
862 tweak some special cases. */
863 copy_tree_r (tp
, walk_subtrees
, NULL
);
865 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
866 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
868 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
870 /* The copied TARGET_EXPR has never been expanded, even if the
871 original node was expanded already. */
872 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
873 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
875 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
877 /* Variable substitution need not be simple. In particular,
878 the MEM_REF substitution above. Make sure that
879 TREE_CONSTANT and friends are up-to-date. */
880 int invariant
= is_gimple_min_invariant (*tp
);
881 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
882 recompute_tree_invariant_for_addr_expr (*tp
);
884 /* If this used to be invariant, but is not any longer,
885 then regimplification is probably needed. */
886 if (invariant
&& !is_gimple_min_invariant (*tp
))
887 id
->regimplify
= true;
893 /* Update the TREE_BLOCK for the cloned expr. */
896 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
897 tree old_block
= TREE_BLOCK (*tp
);
901 n
= (tree
*) pointer_map_contains (id
->decl_map
,
906 TREE_SET_BLOCK (*tp
, new_block
);
909 /* Keep iterating. */
914 /* Called from copy_body_id via walk_tree. DATA is really a
915 `copy_body_data *'. */
918 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
920 copy_body_data
*id
= (copy_body_data
*) data
;
921 tree fn
= id
->src_fn
;
924 /* Begin by recognizing trees that we'll completely rewrite for the
925 inlining context. Our output for these trees is completely
926 different from out input (e.g. RETURN_EXPR is deleted, and morphs
927 into an edge). Further down, we'll handle trees that get
928 duplicated and/or tweaked. */
930 /* When requested, RETURN_EXPRs should be transformed to just the
931 contained MODIFY_EXPR. The branch semantics of the return will
932 be handled elsewhere by manipulating the CFG rather than a statement. */
933 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
935 tree assignment
= TREE_OPERAND (*tp
, 0);
937 /* If we're returning something, just turn that into an
938 assignment into the equivalent of the original RESULT_DECL.
939 If the "assignment" is just the result decl, the result
940 decl has already been set (e.g. a recent "foo (&result_decl,
941 ...)"); just toss the entire RETURN_EXPR. */
942 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
944 /* Replace the RETURN_EXPR with (a copy of) the
945 MODIFY_EXPR hanging underneath. */
946 *tp
= copy_node (assignment
);
948 else /* Else the RETURN_EXPR returns no value. */
951 return (tree
) (void *)1;
954 else if (TREE_CODE (*tp
) == SSA_NAME
)
956 *tp
= remap_ssa_name (*tp
, id
);
961 /* Local variables and labels need to be replaced by equivalent
962 variables. We don't want to copy static variables; there's only
963 one of those, no matter how many times we inline the containing
964 function. Similarly for globals from an outer function. */
965 else if (auto_var_in_fn_p (*tp
, fn
))
969 /* Remap the declaration. */
970 new_decl
= remap_decl (*tp
, id
);
971 gcc_assert (new_decl
);
972 /* Replace this variable with the copy. */
973 STRIP_TYPE_NOPS (new_decl
);
977 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
978 copy_statement_list (tp
);
979 else if (TREE_CODE (*tp
) == SAVE_EXPR
980 || TREE_CODE (*tp
) == TARGET_EXPR
)
981 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
982 else if (TREE_CODE (*tp
) == LABEL_DECL
983 && (! DECL_CONTEXT (*tp
)
984 || decl_function_context (*tp
) == id
->src_fn
))
985 /* These may need to be remapped for EH handling. */
986 *tp
= remap_decl (*tp
, id
);
987 else if (TREE_CODE (*tp
) == BIND_EXPR
)
988 copy_bind_expr (tp
, walk_subtrees
, id
);
989 /* Types may need remapping as well. */
990 else if (TYPE_P (*tp
))
991 *tp
= remap_type (*tp
, id
);
993 /* If this is a constant, we have to copy the node iff the type will be
994 remapped. copy_tree_r will not copy a constant. */
995 else if (CONSTANT_CLASS_P (*tp
))
997 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
999 if (new_type
== TREE_TYPE (*tp
))
1002 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1003 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
1004 TREE_INT_CST_HIGH (*tp
));
1007 *tp
= copy_node (*tp
);
1008 TREE_TYPE (*tp
) = new_type
;
1012 /* Otherwise, just copy the node. Note that copy_tree_r already
1013 knows not to copy VAR_DECLs, etc., so this is safe. */
1016 /* Here we handle trees that are not completely rewritten.
1017 First we detect some inlining-induced bogosities for
1019 if (TREE_CODE (*tp
) == MODIFY_EXPR
1020 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1021 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1023 /* Some assignments VAR = VAR; don't generate any rtl code
1024 and thus don't count as variable modification. Avoid
1025 keeping bogosities like 0 = 0. */
1026 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1029 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1033 STRIP_TYPE_NOPS (value
);
1034 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1036 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1037 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1041 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1043 /* Get rid of *& from inline substitutions that can happen when a
1044 pointer argument is an ADDR_EXPR. */
1045 tree decl
= TREE_OPERAND (*tp
, 0);
1048 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1053 /* If we happen to get an ADDR_EXPR in n->value, strip
1054 it manually here as we'll eventually get ADDR_EXPRs
1055 which lie about their types pointed to. In this case
1056 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1057 but we absolutely rely on that. As fold_indirect_ref
1058 does other useful transformations, try that first, though. */
1059 tree type
= TREE_TYPE (TREE_TYPE (*n
));
1060 if (id
->do_not_unshare
)
1063 new_tree
= unshare_expr (*n
);
1065 *tp
= gimple_fold_indirect_ref (new_tree
);
1068 if (TREE_CODE (new_tree
) == ADDR_EXPR
)
1070 *tp
= fold_indirect_ref_1 (EXPR_LOCATION (new_tree
),
1072 /* ??? We should either assert here or build
1073 a VIEW_CONVERT_EXPR instead of blindly leaking
1074 incompatible types to our IL. */
1076 *tp
= TREE_OPERAND (new_tree
, 0);
1080 *tp
= build1 (INDIRECT_REF
, type
, new_tree
);
1081 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1082 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1083 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1084 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
1091 else if (TREE_CODE (*tp
) == MEM_REF
)
1093 tree ptr
= TREE_OPERAND (*tp
, 0);
1094 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1097 /* We need to re-canonicalize MEM_REFs from inline substitutions
1098 that can happen when a pointer argument is an ADDR_EXPR.
1099 Recurse here manually to allow that. */
1100 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1101 *tp
= fold_build2 (MEM_REF
, type
,
1102 ptr
, TREE_OPERAND (*tp
, 1));
1103 TREE_THIS_NOTRAP (*tp
) = TREE_THIS_NOTRAP (old
);
1104 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1105 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1106 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1111 /* Here is the "usual case". Copy this tree node, and then
1112 tweak some special cases. */
1113 copy_tree_r (tp
, walk_subtrees
, NULL
);
1115 /* If EXPR has block defined, map it to newly constructed block.
1116 When inlining we want EXPRs without block appear in the block
1117 of function call if we are not remapping a type. */
1120 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1121 if (TREE_BLOCK (*tp
))
1124 n
= (tree
*) pointer_map_contains (id
->decl_map
,
1129 TREE_SET_BLOCK (*tp
, new_block
);
1132 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1133 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1135 /* The copied TARGET_EXPR has never been expanded, even if the
1136 original node was expanded already. */
1137 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1139 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1140 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1143 /* Variable substitution need not be simple. In particular, the
1144 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1145 and friends are up-to-date. */
1146 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1148 int invariant
= is_gimple_min_invariant (*tp
);
1149 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1151 /* Handle the case where we substituted an INDIRECT_REF
1152 into the operand of the ADDR_EXPR. */
1153 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1154 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1156 recompute_tree_invariant_for_addr_expr (*tp
);
1158 /* If this used to be invariant, but is not any longer,
1159 then regimplification is probably needed. */
1160 if (invariant
&& !is_gimple_min_invariant (*tp
))
1161 id
->regimplify
= true;
1167 /* Keep iterating. */
1171 /* Helper for remap_gimple_stmt. Given an EH region number for the
1172 source function, map that to the duplicate EH region number in
1173 the destination function. */
1176 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1178 eh_region old_r
, new_r
;
1181 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1182 slot
= pointer_map_contains (id
->eh_map
, old_r
);
1183 new_r
= (eh_region
) *slot
;
1185 return new_r
->index
;
1188 /* Similar, but operate on INTEGER_CSTs. */
1191 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1195 old_nr
= tree_low_cst (old_t_nr
, 0);
1196 new_nr
= remap_eh_region_nr (old_nr
, id
);
1198 return build_int_cst (integer_type_node
, new_nr
);
1201 /* Helper for copy_bb. Remap statement STMT using the inlining
1202 information in ID. Return the new statement copy. */
1205 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1208 struct walk_stmt_info wi
;
1209 bool skip_first
= false;
1211 /* Begin by recognizing trees that we'll completely rewrite for the
1212 inlining context. Our output for these trees is completely
1213 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1214 into an edge). Further down, we'll handle trees that get
1215 duplicated and/or tweaked. */
1217 /* When requested, GIMPLE_RETURNs should be transformed to just the
1218 contained GIMPLE_ASSIGN. The branch semantics of the return will
1219 be handled elsewhere by manipulating the CFG rather than the
1221 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1223 tree retval
= gimple_return_retval (stmt
);
1225 /* If we're returning something, just turn that into an
1226 assignment into the equivalent of the original RESULT_DECL.
1227 If RETVAL is just the result decl, the result decl has
1228 already been set (e.g. a recent "foo (&result_decl, ...)");
1229 just toss the entire GIMPLE_RETURN. */
1231 && (TREE_CODE (retval
) != RESULT_DECL
1232 && (TREE_CODE (retval
) != SSA_NAME
1233 || ! SSA_NAME_VAR (retval
)
1234 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1236 copy
= gimple_build_assign (id
->retvar
, retval
);
1237 /* id->retvar is already substituted. Skip it on later remapping. */
1241 return gimple_build_nop ();
1243 else if (gimple_has_substatements (stmt
))
1247 /* When cloning bodies from the C++ front end, we will be handed bodies
1248 in High GIMPLE form. Handle here all the High GIMPLE statements that
1249 have embedded statements. */
1250 switch (gimple_code (stmt
))
1253 copy
= copy_gimple_bind (stmt
, id
);
1257 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1258 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1261 case GIMPLE_EH_FILTER
:
1262 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1263 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1267 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1268 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1269 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1272 case GIMPLE_WITH_CLEANUP_EXPR
:
1273 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1274 copy
= gimple_build_wce (s1
);
1277 case GIMPLE_OMP_PARALLEL
:
1278 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1279 copy
= gimple_build_omp_parallel
1281 gimple_omp_parallel_clauses (stmt
),
1282 gimple_omp_parallel_child_fn (stmt
),
1283 gimple_omp_parallel_data_arg (stmt
));
1286 case GIMPLE_OMP_TASK
:
1287 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1288 copy
= gimple_build_omp_task
1290 gimple_omp_task_clauses (stmt
),
1291 gimple_omp_task_child_fn (stmt
),
1292 gimple_omp_task_data_arg (stmt
),
1293 gimple_omp_task_copy_fn (stmt
),
1294 gimple_omp_task_arg_size (stmt
),
1295 gimple_omp_task_arg_align (stmt
));
1298 case GIMPLE_OMP_FOR
:
1299 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1300 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1301 copy
= gimple_build_omp_for (s1
, gimple_omp_for_clauses (stmt
),
1302 gimple_omp_for_collapse (stmt
), s2
);
1305 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1307 gimple_omp_for_set_index (copy
, i
,
1308 gimple_omp_for_index (stmt
, i
));
1309 gimple_omp_for_set_initial (copy
, i
,
1310 gimple_omp_for_initial (stmt
, i
));
1311 gimple_omp_for_set_final (copy
, i
,
1312 gimple_omp_for_final (stmt
, i
));
1313 gimple_omp_for_set_incr (copy
, i
,
1314 gimple_omp_for_incr (stmt
, i
));
1315 gimple_omp_for_set_cond (copy
, i
,
1316 gimple_omp_for_cond (stmt
, i
));
1321 case GIMPLE_OMP_MASTER
:
1322 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1323 copy
= gimple_build_omp_master (s1
);
1326 case GIMPLE_OMP_ORDERED
:
1327 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1328 copy
= gimple_build_omp_ordered (s1
);
1331 case GIMPLE_OMP_SECTION
:
1332 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1333 copy
= gimple_build_omp_section (s1
);
1336 case GIMPLE_OMP_SECTIONS
:
1337 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1338 copy
= gimple_build_omp_sections
1339 (s1
, gimple_omp_sections_clauses (stmt
));
1342 case GIMPLE_OMP_SINGLE
:
1343 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1344 copy
= gimple_build_omp_single
1345 (s1
, gimple_omp_single_clauses (stmt
));
1348 case GIMPLE_OMP_CRITICAL
:
1349 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1351 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1354 case GIMPLE_TRANSACTION
:
1355 s1
= remap_gimple_seq (gimple_transaction_body (stmt
), id
);
1356 copy
= gimple_build_transaction (s1
, gimple_transaction_label (stmt
));
1357 gimple_transaction_set_subcode (copy
, gimple_transaction_subcode (stmt
));
1366 if (gimple_assign_copy_p (stmt
)
1367 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1368 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1370 /* Here we handle statements that are not completely rewritten.
1371 First we detect some inlining-induced bogosities for
1374 /* Some assignments VAR = VAR; don't generate any rtl code
1375 and thus don't count as variable modification. Avoid
1376 keeping bogosities like 0 = 0. */
1377 tree decl
= gimple_assign_lhs (stmt
), value
;
1380 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1384 STRIP_TYPE_NOPS (value
);
1385 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1386 return gimple_build_nop ();
1390 if (gimple_debug_bind_p (stmt
))
1392 copy
= gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1393 gimple_debug_bind_get_value (stmt
),
1395 id
->debug_stmts
.safe_push (copy
);
1398 if (gimple_debug_source_bind_p (stmt
))
1400 copy
= gimple_build_debug_source_bind
1401 (gimple_debug_source_bind_get_var (stmt
),
1402 gimple_debug_source_bind_get_value (stmt
), stmt
);
1403 id
->debug_stmts
.safe_push (copy
);
1407 /* Create a new deep copy of the statement. */
1408 copy
= gimple_copy (stmt
);
1410 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1411 RESX and EH_DISPATCH. */
1413 switch (gimple_code (copy
))
1417 tree r
, fndecl
= gimple_call_fndecl (copy
);
1418 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1419 switch (DECL_FUNCTION_CODE (fndecl
))
1421 case BUILT_IN_EH_COPY_VALUES
:
1422 r
= gimple_call_arg (copy
, 1);
1423 r
= remap_eh_region_tree_nr (r
, id
);
1424 gimple_call_set_arg (copy
, 1, r
);
1427 case BUILT_IN_EH_POINTER
:
1428 case BUILT_IN_EH_FILTER
:
1429 r
= gimple_call_arg (copy
, 0);
1430 r
= remap_eh_region_tree_nr (r
, id
);
1431 gimple_call_set_arg (copy
, 0, r
);
1438 /* Reset alias info if we didn't apply measures to
1439 keep it valid over inlining by setting DECL_PT_UID. */
1440 if (!id
->src_cfun
->gimple_df
1441 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1442 gimple_call_reset_alias_info (copy
);
1448 int r
= gimple_resx_region (copy
);
1449 r
= remap_eh_region_nr (r
, id
);
1450 gimple_resx_set_region (copy
, r
);
1454 case GIMPLE_EH_DISPATCH
:
1456 int r
= gimple_eh_dispatch_region (copy
);
1457 r
= remap_eh_region_nr (r
, id
);
1458 gimple_eh_dispatch_set_region (copy
, r
);
1467 /* If STMT has a block defined, map it to the newly constructed
1469 if (gimple_block (copy
))
1472 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1474 gimple_set_block (copy
, *n
);
1477 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1480 /* Remap all the operands in COPY. */
1481 memset (&wi
, 0, sizeof (wi
));
1484 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1486 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1488 /* Clear the copied virtual operands. We are not remapping them here
1489 but are going to recreate them from scratch. */
1490 if (gimple_has_mem_ops (copy
))
1492 gimple_set_vdef (copy
, NULL_TREE
);
1493 gimple_set_vuse (copy
, NULL_TREE
);
1500 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1504 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1505 gcov_type count_scale
)
1507 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1508 basic_block copy_basic_block
;
1513 /* Search for previous copied basic block. */
1516 prev
= prev
->prev_bb
;
1518 /* create_basic_block() will append every new block to
1519 basic_block_info automatically. */
1520 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1521 (basic_block
) prev
->aux
);
1522 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1524 /* We are going to rebuild frequencies from scratch. These values
1525 have just small importance to drive canonicalize_loop_headers. */
1526 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1528 /* We recompute frequencies after inlining, so this is quite safe. */
1529 if (freq
> BB_FREQ_MAX
)
1531 copy_basic_block
->frequency
= freq
;
1533 copy_gsi
= gsi_start_bb (copy_basic_block
);
1535 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1537 gimple stmt
= gsi_stmt (gsi
);
1538 gimple orig_stmt
= stmt
;
1540 id
->regimplify
= false;
1541 stmt
= remap_gimple_stmt (stmt
, id
);
1542 if (gimple_nop_p (stmt
))
1545 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1548 /* With return slot optimization we can end up with
1549 non-gimple (foo *)&this->m, fix that here. */
1550 if (is_gimple_assign (stmt
)
1551 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1552 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1555 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1556 gimple_assign_rhs1 (stmt
),
1558 GSI_CONTINUE_LINKING
);
1559 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1560 id
->regimplify
= false;
1563 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1566 gimple_regimplify_operands (stmt
, &seq_gsi
);
1568 /* If copy_basic_block has been empty at the start of this iteration,
1569 call gsi_start_bb again to get at the newly added statements. */
1570 if (gsi_end_p (copy_gsi
))
1571 copy_gsi
= gsi_start_bb (copy_basic_block
);
1573 gsi_next (©_gsi
);
1575 /* Process the new statement. The call to gimple_regimplify_operands
1576 possibly turned the statement into multiple statements, we
1577 need to process all of them. */
1582 stmt
= gsi_stmt (copy_gsi
);
1583 if (is_gimple_call (stmt
)
1584 && gimple_call_va_arg_pack_p (stmt
)
1587 /* __builtin_va_arg_pack () should be replaced by
1588 all arguments corresponding to ... in the caller. */
1592 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1595 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1598 /* Create the new array of arguments. */
1599 n
= nargs
+ gimple_call_num_args (stmt
);
1600 argarray
.create (n
);
1601 argarray
.safe_grow_cleared (n
);
1603 /* Copy all the arguments before '...' */
1604 memcpy (argarray
.address (),
1605 gimple_call_arg_ptr (stmt
, 0),
1606 gimple_call_num_args (stmt
) * sizeof (tree
));
1608 /* Append the arguments passed in '...' */
1609 memcpy (argarray
.address () + gimple_call_num_args (stmt
),
1610 gimple_call_arg_ptr (id
->gimple_call
, 0)
1611 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1612 nargs
* sizeof (tree
));
1614 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1617 argarray
.release ();
1619 /* Copy all GIMPLE_CALL flags, location and block, except
1620 GF_CALL_VA_ARG_PACK. */
1621 gimple_call_copy_flags (new_call
, stmt
);
1622 gimple_call_set_va_arg_pack (new_call
, false);
1623 gimple_set_location (new_call
, gimple_location (stmt
));
1624 gimple_set_block (new_call
, gimple_block (stmt
));
1625 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1627 gsi_replace (©_gsi
, new_call
, false);
1630 else if (is_gimple_call (stmt
)
1632 && (decl
= gimple_call_fndecl (stmt
))
1633 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1634 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1636 /* __builtin_va_arg_pack_len () should be replaced by
1637 the number of anonymous arguments. */
1638 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1642 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1645 count
= build_int_cst (integer_type_node
, nargs
);
1646 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1647 gsi_replace (©_gsi
, new_stmt
, false);
1651 /* Statements produced by inlining can be unfolded, especially
1652 when we constant propagated some operands. We can't fold
1653 them right now for two reasons:
1654 1) folding require SSA_NAME_DEF_STMTs to be correct
1655 2) we can't change function calls to builtins.
1656 So we just mark statement for later folding. We mark
1657 all new statements, instead just statements that has changed
1658 by some nontrivial substitution so even statements made
1659 foldable indirectly are updated. If this turns out to be
1660 expensive, copy_body can be told to watch for nontrivial
1662 if (id
->statements_to_fold
)
1663 pointer_set_insert (id
->statements_to_fold
, stmt
);
1665 /* We're duplicating a CALL_EXPR. Find any corresponding
1666 callgraph edges and update or duplicate them. */
1667 if (is_gimple_call (stmt
))
1669 struct cgraph_edge
*edge
;
1672 switch (id
->transform_call_graph_edges
)
1674 case CB_CGE_DUPLICATE
:
1675 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1678 int edge_freq
= edge
->frequency
;
1680 struct cgraph_edge
*old_edge
= edge
;
1681 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1683 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1685 /* We could also just rescale the frequency, but
1686 doing so would introduce roundoff errors and make
1687 verifier unhappy. */
1688 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1691 /* Speculative calls consist of two edges - direct and indirect.
1692 Duplicate the whole thing and distribute frequencies accordingly. */
1693 if (edge
->speculative
)
1695 struct cgraph_edge
*direct
, *indirect
;
1696 struct ipa_ref
*ref
;
1698 gcc_assert (!edge
->indirect_unknown_callee
);
1699 cgraph_speculative_call_info (old_edge
, direct
, indirect
, ref
);
1700 indirect
= cgraph_clone_edge (indirect
, id
->dst_node
, stmt
,
1702 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1704 if (old_edge
->frequency
+ indirect
->frequency
)
1706 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
1707 (old_edge
->frequency
+ indirect
->frequency
)),
1709 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
1710 (old_edge
->frequency
+ indirect
->frequency
)),
1713 ipa_clone_ref (ref
, (symtab_node
)id
->dst_node
, stmt
);
1717 edge
->frequency
= new_freq
;
1719 && profile_status_for_function (cfun
) != PROFILE_ABSENT
1720 && (edge_freq
> edge
->frequency
+ 10
1721 || edge_freq
< edge
->frequency
- 10))
1723 fprintf (dump_file
, "Edge frequency estimated by "
1724 "cgraph %i diverge from inliner's estimate %i\n",
1728 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1731 copy_basic_block
->frequency
);
1737 case CB_CGE_MOVE_CLONES
:
1738 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1740 edge
= cgraph_edge (id
->dst_node
, stmt
);
1744 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1746 cgraph_set_call_stmt (edge
, stmt
);
1753 /* Constant propagation on argument done during inlining
1754 may create new direct call. Produce an edge for it. */
1756 || (edge
->indirect_inlining_edge
1757 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1758 && id
->dst_node
->symbol
.definition
1759 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1761 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1763 /* We have missing edge in the callgraph. This can happen
1764 when previous inlining turned an indirect call into a
1765 direct call by constant propagating arguments or we are
1766 producing dead clone (for further cloning). In all
1767 other cases we hit a bug (incorrect node sharing is the
1768 most common reason for missing edges). */
1769 gcc_assert (!dest
->symbol
.definition
1770 || dest
->symbol
.address_taken
1771 || !id
->src_node
->symbol
.definition
1772 || !id
->dst_node
->symbol
.definition
);
1773 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1774 cgraph_create_edge_including_clones
1775 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1776 compute_call_stmt_bb_frequency (id
->dst_node
->symbol
.decl
,
1778 CIF_ORIGINALLY_INDIRECT_CALL
);
1780 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1782 compute_call_stmt_bb_frequency
1783 (id
->dst_node
->symbol
.decl
,
1784 copy_basic_block
))->inline_failed
1785 = CIF_ORIGINALLY_INDIRECT_CALL
;
1788 fprintf (dump_file
, "Created new direct edge to %s\n",
1789 cgraph_node_name (dest
));
1793 flags
= gimple_call_flags (stmt
);
1794 if (flags
& ECF_MAY_BE_ALLOCA
)
1795 cfun
->calls_alloca
= true;
1796 if (flags
& ECF_RETURNS_TWICE
)
1797 cfun
->calls_setjmp
= true;
1800 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1801 id
->eh_map
, id
->eh_lp_nr
);
1803 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1808 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1809 if (TREE_CODE (def
) == SSA_NAME
)
1810 SSA_NAME_DEF_STMT (def
) = stmt
;
1813 gsi_next (©_gsi
);
1815 while (!gsi_end_p (copy_gsi
));
1817 copy_gsi
= gsi_last_bb (copy_basic_block
);
1820 return copy_basic_block
;
1823 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1824 form is quite easy, since dominator relationship for old basic blocks does
1827 There is however exception where inlining might change dominator relation
1828 across EH edges from basic block within inlined functions destinating
1829 to landing pads in function we inline into.
1831 The function fills in PHI_RESULTs of such PHI nodes if they refer
1832 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1833 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1834 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1835 set, and this means that there will be no overlapping live ranges
1836 for the underlying symbol.
1838 This might change in future if we allow redirecting of EH edges and
1839 we might want to change way build CFG pre-inlining to include
1840 all the possible edges then. */
1842 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1843 bool can_throw
, bool nonlocal_goto
)
1848 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1850 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1853 gimple_stmt_iterator si
;
1856 gcc_assert (e
->flags
& EDGE_EH
);
1859 gcc_assert (!(e
->flags
& EDGE_EH
));
1861 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1865 phi
= gsi_stmt (si
);
1867 /* For abnormal goto/call edges the receiver can be the
1868 ENTRY_BLOCK. Do not assert this cannot happen. */
1870 gcc_assert ((e
->flags
& EDGE_EH
)
1871 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1873 re
= find_edge (ret_bb
, e
->dest
);
1874 gcc_checking_assert (re
);
1875 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1876 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1878 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1879 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1885 /* Copy edges from BB into its copy constructed earlier, scale profile
1886 accordingly. Edges will be taken care of later. Assume aux
1887 pointers to point to the copies of each BB. Return true if any
1888 debug stmts are left after a statement that must end the basic block. */
1891 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
1892 bool can_make_abnormal_goto
)
1894 basic_block new_bb
= (basic_block
) bb
->aux
;
1897 gimple_stmt_iterator si
;
1899 bool need_debug_cleanup
= false;
1901 /* Use the indices from the original blocks to create edges for the
1903 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1904 if (!(old_edge
->flags
& EDGE_EH
))
1908 flags
= old_edge
->flags
;
1910 /* Return edges do get a FALLTHRU flag when the get inlined. */
1911 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1912 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR
)
1913 flags
|= EDGE_FALLTHRU
;
1914 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1915 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
1916 new_edge
->probability
= old_edge
->probability
;
1919 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1922 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
1925 bool can_throw
, nonlocal_goto
;
1927 copy_stmt
= gsi_stmt (si
);
1928 if (!is_gimple_debug (copy_stmt
))
1929 update_stmt (copy_stmt
);
1931 /* Do this before the possible split_block. */
1934 /* If this tree could throw an exception, there are two
1935 cases where we need to add abnormal edge(s): the
1936 tree wasn't in a region and there is a "current
1937 region" in the caller; or the original tree had
1938 EH edges. In both cases split the block after the tree,
1939 and add abnormal edge(s) as needed; we need both
1940 those from the callee and the caller.
1941 We check whether the copy can throw, because the const
1942 propagation can change an INDIRECT_REF which throws
1943 into a COMPONENT_REF which doesn't. If the copy
1944 can throw, the original could also throw. */
1945 can_throw
= stmt_can_throw_internal (copy_stmt
);
1946 nonlocal_goto
= stmt_can_make_abnormal_goto (copy_stmt
);
1948 if (can_throw
|| nonlocal_goto
)
1950 if (!gsi_end_p (si
))
1952 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
1955 need_debug_cleanup
= true;
1957 if (!gsi_end_p (si
))
1958 /* Note that bb's predecessor edges aren't necessarily
1959 right at this point; split_block doesn't care. */
1961 edge e
= split_block (new_bb
, copy_stmt
);
1964 new_bb
->aux
= e
->src
->aux
;
1965 si
= gsi_start_bb (new_bb
);
1969 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
1970 make_eh_dispatch_edges (copy_stmt
);
1972 make_eh_edges (copy_stmt
);
1974 /* If the call we inline cannot make abnormal goto do not add
1975 additional abnormal edges but only retain those already present
1976 in the original function body. */
1977 nonlocal_goto
&= can_make_abnormal_goto
;
1979 make_abnormal_goto_edges (gimple_bb (copy_stmt
), true);
1981 if ((can_throw
|| nonlocal_goto
)
1982 && gimple_in_ssa_p (cfun
))
1983 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
1984 can_throw
, nonlocal_goto
);
1986 return need_debug_cleanup
;
1989 /* Copy the PHIs. All blocks and edges are copied, some blocks
1990 was possibly split and new outgoing EH edges inserted.
1991 BB points to the block of original function and AUX pointers links
1992 the original and newly copied blocks. */
1995 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
1997 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2000 gimple_stmt_iterator si
;
2002 bool inserted
= false;
2004 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2009 phi
= gsi_stmt (si
);
2010 res
= PHI_RESULT (phi
);
2012 if (!virtual_operand_p (res
))
2014 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2015 new_phi
= create_phi_node (new_res
, new_bb
);
2016 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2018 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2024 /* When doing partial cloning, we allow PHIs on the entry block
2025 as long as all the arguments are the same. Find any input
2026 edge to see argument to copy. */
2028 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2029 if (!old_edge
->src
->aux
)
2032 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2034 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2035 gcc_assert (new_arg
);
2036 /* With return slot optimization we can end up with
2037 non-gimple (foo *)&this->m, fix that here. */
2038 if (TREE_CODE (new_arg
) != SSA_NAME
2039 && TREE_CODE (new_arg
) != FUNCTION_DECL
2040 && !is_gimple_val (new_arg
))
2042 gimple_seq stmts
= NULL
;
2043 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2044 gsi_insert_seq_on_edge (new_edge
, stmts
);
2047 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2048 if (LOCATION_BLOCK (locus
))
2051 n
= (tree
*) pointer_map_contains (id
->decl_map
,
2052 LOCATION_BLOCK (locus
));
2054 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2057 locus
= LOCATION_LOCUS (locus
);
2059 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2064 /* Commit the delayed edge insertions. */
2066 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2067 gsi_commit_one_edge_insert (new_edge
, NULL
);
2071 /* Wrapper for remap_decl so it can be used as a callback. */
2074 remap_decl_1 (tree decl
, void *data
)
2076 return remap_decl (decl
, (copy_body_data
*) data
);
2079 /* Build struct function and associated datastructures for the new clone
2080 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2081 the cfun to the function of new_fndecl (and current_function_decl too). */
2084 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2086 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2087 gcov_type count_scale
;
2089 if (!DECL_ARGUMENTS (new_fndecl
))
2090 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2091 if (!DECL_RESULT (new_fndecl
))
2092 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2094 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2096 = GCOV_COMPUTE_SCALE (count
,
2097 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2099 count_scale
= REG_BR_PROB_BASE
;
2101 /* Register specific tree functions. */
2102 gimple_register_cfg_hooks ();
2104 /* Get clean struct function. */
2105 push_struct_function (new_fndecl
);
2107 /* We will rebuild these, so just sanity check that they are empty. */
2108 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2109 gcc_assert (cfun
->local_decls
== NULL
);
2110 gcc_assert (cfun
->cfg
== NULL
);
2111 gcc_assert (cfun
->decl
== new_fndecl
);
2113 /* Copy items we preserve during cloning. */
2114 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2115 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2116 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2117 cfun
->curr_properties
= src_cfun
->curr_properties
;
2118 cfun
->last_verified
= src_cfun
->last_verified
;
2119 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2120 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2121 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2122 cfun
->stdarg
= src_cfun
->stdarg
;
2123 cfun
->after_inlining
= src_cfun
->after_inlining
;
2124 cfun
->can_throw_non_call_exceptions
2125 = src_cfun
->can_throw_non_call_exceptions
;
2126 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2127 cfun
->returns_struct
= src_cfun
->returns_struct
;
2128 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2130 init_empty_tree_cfg ();
2132 profile_status_for_function (cfun
) = profile_status_for_function (src_cfun
);
2133 ENTRY_BLOCK_PTR
->count
=
2134 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2136 ENTRY_BLOCK_PTR
->frequency
2137 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2138 EXIT_BLOCK_PTR
->count
=
2139 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
2141 EXIT_BLOCK_PTR
->frequency
=
2142 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
;
2144 init_eh_for_function ();
2146 if (src_cfun
->gimple_df
)
2148 init_tree_ssa (cfun
);
2149 cfun
->gimple_df
->in_ssa_p
= true;
2150 init_ssa_operands (cfun
);
2154 /* Helper function for copy_cfg_body. Move debug stmts from the end
2155 of NEW_BB to the beginning of successor basic blocks when needed. If the
2156 successor has multiple predecessors, reset them, otherwise keep
2160 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2164 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2167 || gsi_one_before_end_p (si
)
2168 || !(stmt_can_throw_internal (gsi_stmt (si
))
2169 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2172 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2174 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2175 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2176 while (is_gimple_debug (gsi_stmt (ssi
)))
2178 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2182 /* For the last edge move the debug stmts instead of copying
2184 if (ei_one_before_end_p (ei
))
2188 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2189 gimple_debug_bind_reset_value (stmt
);
2190 gsi_remove (&si
, false);
2191 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2195 if (gimple_debug_bind_p (stmt
))
2197 var
= gimple_debug_bind_get_var (stmt
);
2198 if (single_pred_p (e
->dest
))
2200 value
= gimple_debug_bind_get_value (stmt
);
2201 value
= unshare_expr (value
);
2205 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2207 else if (gimple_debug_source_bind_p (stmt
))
2209 var
= gimple_debug_source_bind_get_var (stmt
);
2210 value
= gimple_debug_source_bind_get_value (stmt
);
2211 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2215 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2216 id
->debug_stmts
.safe_push (new_stmt
);
2222 /* Make a copy of the sub-loops of SRC_PARENT and place them
2223 as siblings of DEST_PARENT. */
2226 copy_loops (bitmap blocks_to_copy
,
2227 struct loop
*dest_parent
, struct loop
*src_parent
)
2229 struct loop
*src_loop
= src_parent
->inner
;
2233 || bitmap_bit_p (blocks_to_copy
, src_loop
->header
->index
))
2235 struct loop
*dest_loop
= alloc_loop ();
2237 /* Assign the new loop its header and latch and associate
2238 those with the new loop. */
2239 if (src_loop
->header
!= NULL
)
2241 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2242 dest_loop
->header
->loop_father
= dest_loop
;
2244 if (src_loop
->latch
!= NULL
)
2246 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2247 dest_loop
->latch
->loop_father
= dest_loop
;
2250 /* Copy loop meta-data. */
2251 copy_loop_info (src_loop
, dest_loop
);
2253 /* Finally place it into the loop array and the loop tree. */
2254 place_new_loop (cfun
, dest_loop
);
2255 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2258 copy_loops (blocks_to_copy
, dest_loop
, src_loop
);
2260 src_loop
= src_loop
->next
;
2264 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2267 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2269 gimple_stmt_iterator si
;
2270 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2272 if (is_gimple_call (gsi_stmt (si
)))
2274 struct cgraph_edge
*edge
= cgraph_edge (id
->dst_node
, gsi_stmt (si
));
2276 cgraph_redirect_edge_call_stmt_to_callee (edge
);
2281 /* Make a copy of the body of FN so that it can be inserted inline in
2282 another function. Walks FN via CFG, returns new fndecl. */
2285 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2286 basic_block entry_block_map
, basic_block exit_block_map
,
2287 bitmap blocks_to_copy
, basic_block new_entry
)
2289 tree callee_fndecl
= id
->src_fn
;
2290 /* Original cfun for the callee, doesn't change. */
2291 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2292 struct function
*cfun_to_copy
;
2294 tree new_fndecl
= NULL
;
2295 bool need_debug_cleanup
= false;
2296 gcov_type count_scale
;
2298 int incoming_frequency
= 0;
2299 gcov_type incoming_count
= 0;
2301 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
2303 = GCOV_COMPUTE_SCALE (count
,
2304 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
2306 count_scale
= REG_BR_PROB_BASE
;
2308 /* Register specific tree functions. */
2309 gimple_register_cfg_hooks ();
2311 /* If we are inlining just region of the function, make sure to connect new entry
2312 to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute
2313 frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and
2314 probabilities of edges incoming from nonduplicated region. */
2320 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2323 incoming_frequency
+= EDGE_FREQUENCY (e
);
2324 incoming_count
+= e
->count
;
2326 incoming_count
= apply_scale (incoming_count
, count_scale
);
2328 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2329 ENTRY_BLOCK_PTR
->count
= incoming_count
;
2330 ENTRY_BLOCK_PTR
->frequency
= incoming_frequency
;
2333 /* Must have a CFG here at this point. */
2334 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2335 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2337 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2339 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= entry_block_map
;
2340 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= exit_block_map
;
2341 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2342 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
2344 /* Duplicate any exception-handling regions. */
2346 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2349 /* Use aux pointers to map the original blocks to copy. */
2350 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2351 if (!blocks_to_copy
|| bitmap_bit_p (blocks_to_copy
, bb
->index
))
2353 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2356 new_bb
->loop_father
= entry_block_map
->loop_father
;
2359 last
= last_basic_block
;
2361 /* Now that we've duplicated the blocks, duplicate their edges. */
2362 bool can_make_abormal_goto
2363 = id
->gimple_call
&& stmt_can_make_abnormal_goto (id
->gimple_call
);
2364 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2366 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2367 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2368 can_make_abormal_goto
);
2372 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2373 e
->probability
= REG_BR_PROB_BASE
;
2374 e
->count
= incoming_count
;
2377 /* Duplicate the loop tree, if available and wanted. */
2378 if (loops_for_fn (src_cfun
) != NULL
2379 && current_loops
!= NULL
)
2381 copy_loops (blocks_to_copy
, entry_block_map
->loop_father
,
2382 get_loop (src_cfun
, 0));
2383 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2384 loops_state_set (LOOPS_NEED_FIXUP
);
2387 /* If the loop tree in the source function needed fixup, mark the
2388 destination loop tree for fixup, too. */
2389 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2390 loops_state_set (LOOPS_NEED_FIXUP
);
2392 if (gimple_in_ssa_p (cfun
))
2393 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2395 || (bb
->index
> 0 && bitmap_bit_p (blocks_to_copy
, bb
->index
)))
2396 copy_phis_for_bb (bb
, id
);
2398 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2401 if (need_debug_cleanup
2402 && bb
->index
!= ENTRY_BLOCK
2403 && bb
->index
!= EXIT_BLOCK
)
2404 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2405 /* Update call edge destinations. This can not be done before loop
2406 info is updated, because we may split basic blocks. */
2407 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2408 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2409 ((basic_block
)bb
->aux
)->aux
= NULL
;
2413 /* Zero out AUX fields of newly created block during EH edge
2415 for (; last
< last_basic_block
; last
++)
2417 if (need_debug_cleanup
)
2418 maybe_move_debug_stmts_to_successors (id
, BASIC_BLOCK (last
));
2419 BASIC_BLOCK (last
)->aux
= NULL
;
2420 /* Update call edge destinations. This can not be done before loop
2421 info is updated, because we may split basic blocks. */
2422 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2423 redirect_all_calls (id
, BASIC_BLOCK (last
));
2425 entry_block_map
->aux
= NULL
;
2426 exit_block_map
->aux
= NULL
;
2430 pointer_map_destroy (id
->eh_map
);
2437 /* Copy the debug STMT using ID. We deal with these statements in a
2438 special way: if any variable in their VALUE expression wasn't
2439 remapped yet, we won't remap it, because that would get decl uids
2440 out of sync, causing codegen differences between -g and -g0. If
2441 this arises, we drop the VALUE expression altogether. */
2444 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2447 struct walk_stmt_info wi
;
2449 if (gimple_block (stmt
))
2451 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2452 gimple_set_block (stmt
, n
? *n
: id
->block
);
2455 /* Remap all the operands in COPY. */
2456 memset (&wi
, 0, sizeof (wi
));
2459 processing_debug_stmt
= 1;
2461 if (gimple_debug_source_bind_p (stmt
))
2462 t
= gimple_debug_source_bind_get_var (stmt
);
2464 t
= gimple_debug_bind_get_var (stmt
);
2466 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2467 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2469 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2472 else if (TREE_CODE (t
) == VAR_DECL
2473 && !is_global_var (t
)
2474 && !pointer_map_contains (id
->decl_map
, t
))
2475 /* T is a non-localized variable. */;
2477 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2479 if (gimple_debug_bind_p (stmt
))
2481 gimple_debug_bind_set_var (stmt
, t
);
2483 if (gimple_debug_bind_has_value_p (stmt
))
2484 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2485 remap_gimple_op_r
, &wi
, NULL
);
2487 /* Punt if any decl couldn't be remapped. */
2488 if (processing_debug_stmt
< 0)
2489 gimple_debug_bind_reset_value (stmt
);
2491 else if (gimple_debug_source_bind_p (stmt
))
2493 gimple_debug_source_bind_set_var (stmt
, t
);
2494 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2495 remap_gimple_op_r
, &wi
, NULL
);
2496 /* When inlining and source bind refers to one of the optimized
2497 away parameters, change the source bind into normal debug bind
2498 referring to the corresponding DEBUG_EXPR_DECL that should have
2499 been bound before the call stmt. */
2500 t
= gimple_debug_source_bind_get_value (stmt
);
2502 && TREE_CODE (t
) == PARM_DECL
2505 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2507 if (debug_args
!= NULL
)
2509 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2510 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2511 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2513 t
= (**debug_args
)[i
+ 1];
2514 stmt
->gsbase
.subcode
= GIMPLE_DEBUG_BIND
;
2515 gimple_debug_bind_set_value (stmt
, t
);
2522 processing_debug_stmt
= 0;
2527 /* Process deferred debug stmts. In order to give values better odds
2528 of being successfully remapped, we delay the processing of debug
2529 stmts until all other stmts that might require remapping are
2533 copy_debug_stmts (copy_body_data
*id
)
2538 if (!id
->debug_stmts
.exists ())
2541 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2542 copy_debug_stmt (stmt
, id
);
2544 id
->debug_stmts
.release ();
2547 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2548 another function. */
2551 copy_tree_body (copy_body_data
*id
)
2553 tree fndecl
= id
->src_fn
;
2554 tree body
= DECL_SAVED_TREE (fndecl
);
2556 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2561 /* Make a copy of the body of FN so that it can be inserted inline in
2562 another function. */
2565 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2566 basic_block entry_block_map
, basic_block exit_block_map
,
2567 bitmap blocks_to_copy
, basic_block new_entry
)
2569 tree fndecl
= id
->src_fn
;
2572 /* If this body has a CFG, walk CFG and copy. */
2573 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl
)));
2574 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2575 blocks_to_copy
, new_entry
);
2576 copy_debug_stmts (id
);
2581 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2582 defined in function FN, or of a data member thereof. */
2585 self_inlining_addr_expr (tree value
, tree fn
)
2589 if (TREE_CODE (value
) != ADDR_EXPR
)
2592 var
= get_base_address (TREE_OPERAND (value
, 0));
2594 return var
&& auto_var_in_fn_p (var
, fn
);
2597 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2598 lexical block and line number information from base_stmt, if given,
2599 or from the last stmt of the block otherwise. */
2602 insert_init_debug_bind (copy_body_data
*id
,
2603 basic_block bb
, tree var
, tree value
,
2607 gimple_stmt_iterator gsi
;
2610 if (!gimple_in_ssa_p (id
->src_cfun
))
2613 if (!MAY_HAVE_DEBUG_STMTS
)
2616 tracked_var
= target_for_debug_bind (var
);
2622 gsi
= gsi_last_bb (bb
);
2623 if (!base_stmt
&& !gsi_end_p (gsi
))
2624 base_stmt
= gsi_stmt (gsi
);
2627 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2631 if (!gsi_end_p (gsi
))
2632 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2634 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2641 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2643 /* If VAR represents a zero-sized variable, it's possible that the
2644 assignment statement may result in no gimple statements. */
2647 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2649 /* We can end up with init statements that store to a non-register
2650 from a rhs with a conversion. Handle that here by forcing the
2651 rhs into a temporary. gimple_regimplify_operands is not
2652 prepared to do this for us. */
2653 if (!is_gimple_debug (init_stmt
)
2654 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2655 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2656 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2658 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2659 gimple_expr_type (init_stmt
),
2660 gimple_assign_rhs1 (init_stmt
));
2661 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2663 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2664 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2666 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2667 gimple_regimplify_operands (init_stmt
, &si
);
2669 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2671 tree def
= gimple_assign_lhs (init_stmt
);
2672 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2677 /* Initialize parameter P with VALUE. If needed, produce init statement
2678 at the end of BB. When BB is NULL, we return init statement to be
2681 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2682 basic_block bb
, tree
*vars
)
2684 gimple init_stmt
= NULL
;
2687 tree def
= (gimple_in_ssa_p (cfun
)
2688 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2691 && value
!= error_mark_node
2692 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2694 /* If we can match up types by promotion/demotion do so. */
2695 if (fold_convertible_p (TREE_TYPE (p
), value
))
2696 rhs
= fold_convert (TREE_TYPE (p
), value
);
2699 /* ??? For valid programs we should not end up here.
2700 Still if we end up with truly mismatched types here, fall back
2701 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2702 GIMPLE to the following passes. */
2703 if (!is_gimple_reg_type (TREE_TYPE (value
))
2704 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2705 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2707 rhs
= build_zero_cst (TREE_TYPE (p
));
2711 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2712 here since the type of this decl must be visible to the calling
2714 var
= copy_decl_to_var (p
, id
);
2716 /* Declare this new variable. */
2717 DECL_CHAIN (var
) = *vars
;
2720 /* Make gimplifier happy about this variable. */
2721 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2723 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2724 we would not need to create a new variable here at all, if it
2725 weren't for debug info. Still, we can just use the argument
2727 if (TREE_READONLY (p
)
2728 && !TREE_ADDRESSABLE (p
)
2729 && value
&& !TREE_SIDE_EFFECTS (value
)
2732 /* We may produce non-gimple trees by adding NOPs or introduce
2733 invalid sharing when operand is not really constant.
2734 It is not big deal to prohibit constant propagation here as
2735 we will constant propagate in DOM1 pass anyway. */
2736 if (is_gimple_min_invariant (value
)
2737 && useless_type_conversion_p (TREE_TYPE (p
),
2739 /* We have to be very careful about ADDR_EXPR. Make sure
2740 the base variable isn't a local variable of the inlined
2741 function, e.g., when doing recursive inlining, direct or
2742 mutually-recursive or whatever, which is why we don't
2743 just test whether fn == current_function_decl. */
2744 && ! self_inlining_addr_expr (value
, fn
))
2746 insert_decl_map (id
, p
, value
);
2747 insert_debug_decl_map (id
, p
, var
);
2748 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2752 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2753 that way, when the PARM_DECL is encountered, it will be
2754 automatically replaced by the VAR_DECL. */
2755 insert_decl_map (id
, p
, var
);
2757 /* Even if P was TREE_READONLY, the new VAR should not be.
2758 In the original code, we would have constructed a
2759 temporary, and then the function body would have never
2760 changed the value of P. However, now, we will be
2761 constructing VAR directly. The constructor body may
2762 change its value multiple times as it is being
2763 constructed. Therefore, it must not be TREE_READONLY;
2764 the back-end assumes that TREE_READONLY variable is
2765 assigned to only once. */
2766 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2767 TREE_READONLY (var
) = 0;
2769 /* If there is no setup required and we are in SSA, take the easy route
2770 replacing all SSA names representing the function parameter by the
2771 SSA name passed to function.
2773 We need to construct map for the variable anyway as it might be used
2774 in different SSA names when parameter is set in function.
2776 Do replacement at -O0 for const arguments replaced by constant.
2777 This is important for builtin_constant_p and other construct requiring
2778 constant argument to be visible in inlined function body. */
2779 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2781 || (TREE_READONLY (p
)
2782 && is_gimple_min_invariant (rhs
)))
2783 && (TREE_CODE (rhs
) == SSA_NAME
2784 || is_gimple_min_invariant (rhs
))
2785 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2787 insert_decl_map (id
, def
, rhs
);
2788 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2791 /* If the value of argument is never used, don't care about initializing
2793 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2795 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2796 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2799 /* Initialize this VAR_DECL from the equivalent argument. Convert
2800 the argument to the proper type in case it was promoted. */
2803 if (rhs
== error_mark_node
)
2805 insert_decl_map (id
, p
, var
);
2806 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2809 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2811 /* If we are in SSA form properly remap the default definition
2812 or assign to a dummy SSA name if the parameter is unused and
2813 we are not optimizing. */
2814 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2818 def
= remap_ssa_name (def
, id
);
2819 init_stmt
= gimple_build_assign (def
, rhs
);
2820 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2821 set_ssa_default_def (cfun
, var
, NULL
);
2825 def
= make_ssa_name (var
, NULL
);
2826 init_stmt
= gimple_build_assign (def
, rhs
);
2830 init_stmt
= gimple_build_assign (var
, rhs
);
2832 if (bb
&& init_stmt
)
2833 insert_init_stmt (id
, bb
, init_stmt
);
2838 /* Generate code to initialize the parameters of the function at the
2839 top of the stack in ID from the GIMPLE_CALL STMT. */
2842 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2843 tree fn
, basic_block bb
)
2848 tree vars
= NULL_TREE
;
2849 tree static_chain
= gimple_call_chain (stmt
);
2851 /* Figure out what the parameters are. */
2852 parms
= DECL_ARGUMENTS (fn
);
2854 /* Loop through the parameter declarations, replacing each with an
2855 equivalent VAR_DECL, appropriately initialized. */
2856 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2859 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2860 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2862 /* After remapping parameters remap their types. This has to be done
2863 in a second loop over all parameters to appropriately remap
2864 variable sized arrays when the size is specified in a
2865 parameter following the array. */
2866 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2868 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
2870 && TREE_CODE (*varp
) == VAR_DECL
)
2872 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
2873 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2875 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
2876 /* Also remap the default definition if it was remapped
2877 to the default definition of the parameter replacement
2878 by the parameter setup. */
2881 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
2883 && TREE_CODE (*defp
) == SSA_NAME
2884 && SSA_NAME_VAR (*defp
) == var
)
2885 TREE_TYPE (*defp
) = TREE_TYPE (var
);
2890 /* Initialize the static chain. */
2891 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
2892 gcc_assert (fn
!= current_function_decl
);
2895 /* No static chain? Seems like a bug in tree-nested.c. */
2896 gcc_assert (static_chain
);
2898 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
2901 declare_inline_vars (id
->block
, vars
);
2905 /* Declare a return variable to replace the RESULT_DECL for the
2906 function we are calling. An appropriate DECL_STMT is returned.
2907 The USE_STMT is filled to contain a use of the declaration to
2908 indicate the return value of the function.
2910 RETURN_SLOT, if non-null is place where to store the result. It
2911 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2912 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2914 The return value is a (possibly null) value that holds the result
2915 as seen by the caller. */
2918 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
2919 basic_block entry_bb
)
2921 tree callee
= id
->src_fn
;
2922 tree result
= DECL_RESULT (callee
);
2923 tree callee_type
= TREE_TYPE (result
);
2927 /* Handle type-mismatches in the function declaration return type
2928 vs. the call expression. */
2930 caller_type
= TREE_TYPE (modify_dest
);
2932 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
2934 /* We don't need to do anything for functions that don't return anything. */
2935 if (VOID_TYPE_P (callee_type
))
2938 /* If there was a return slot, then the return value is the
2939 dereferenced address of that object. */
2942 /* The front end shouldn't have used both return_slot and
2943 a modify expression. */
2944 gcc_assert (!modify_dest
);
2945 if (DECL_BY_REFERENCE (result
))
2947 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
2948 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
2950 /* We are going to construct *&return_slot and we can't do that
2951 for variables believed to be not addressable.
2953 FIXME: This check possibly can match, because values returned
2954 via return slot optimization are not believed to have address
2955 taken by alias analysis. */
2956 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
2957 var
= return_slot_addr
;
2962 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
2963 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
2965 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2966 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2967 && !DECL_GIMPLE_REG_P (result
)
2969 DECL_GIMPLE_REG_P (var
) = 0;
2974 /* All types requiring non-trivial constructors should have been handled. */
2975 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
2977 /* Attempt to avoid creating a new temporary variable. */
2979 && TREE_CODE (modify_dest
) != SSA_NAME
)
2981 bool use_it
= false;
2983 /* We can't use MODIFY_DEST if there's type promotion involved. */
2984 if (!useless_type_conversion_p (callee_type
, caller_type
))
2987 /* ??? If we're assigning to a variable sized type, then we must
2988 reuse the destination variable, because we've no good way to
2989 create variable sized temporaries at this point. */
2990 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
2993 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2994 reuse it as the result of the call directly. Don't do this if
2995 it would promote MODIFY_DEST to addressable. */
2996 else if (TREE_ADDRESSABLE (result
))
3000 tree base_m
= get_base_address (modify_dest
);
3002 /* If the base isn't a decl, then it's a pointer, and we don't
3003 know where that's going to go. */
3004 if (!DECL_P (base_m
))
3006 else if (is_global_var (base_m
))
3008 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3009 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3010 && !DECL_GIMPLE_REG_P (result
)
3011 && DECL_GIMPLE_REG_P (base_m
))
3013 else if (!TREE_ADDRESSABLE (base_m
))
3025 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3027 var
= copy_result_decl_to_var (result
, id
);
3028 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3030 /* Do not have the rest of GCC warn about this variable as it should
3031 not be visible to the user. */
3032 TREE_NO_WARNING (var
) = 1;
3034 declare_inline_vars (id
->block
, var
);
3036 /* Build the use expr. If the return type of the function was
3037 promoted, convert it back to the expected type. */
3039 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3041 /* If we can match up types by promotion/demotion do so. */
3042 if (fold_convertible_p (caller_type
, var
))
3043 use
= fold_convert (caller_type
, var
);
3046 /* ??? For valid programs we should not end up here.
3047 Still if we end up with truly mismatched types here, fall back
3048 to using a MEM_REF to not leak invalid GIMPLE to the following
3050 /* Prevent var from being written into SSA form. */
3051 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3052 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3053 DECL_GIMPLE_REG_P (var
) = false;
3054 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3055 TREE_ADDRESSABLE (var
) = true;
3056 use
= fold_build2 (MEM_REF
, caller_type
,
3057 build_fold_addr_expr (var
),
3058 build_int_cst (ptr_type_node
, 0));
3062 STRIP_USELESS_TYPE_CONVERSION (use
);
3064 if (DECL_BY_REFERENCE (result
))
3066 TREE_ADDRESSABLE (var
) = 1;
3067 var
= build_fold_addr_expr (var
);
3071 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3072 way, when the RESULT_DECL is encountered, it will be
3073 automatically replaced by the VAR_DECL.
3075 When returning by reference, ensure that RESULT_DECL remaps to
3077 if (DECL_BY_REFERENCE (result
)
3078 && !is_gimple_val (var
))
3080 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3081 insert_decl_map (id
, result
, temp
);
3082 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3083 it's default_def SSA_NAME. */
3084 if (gimple_in_ssa_p (id
->src_cfun
)
3085 && is_gimple_reg (result
))
3087 temp
= make_ssa_name (temp
, NULL
);
3088 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3090 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3093 insert_decl_map (id
, result
, var
);
3095 /* Remember this so we can ignore it in remap_decls. */
3101 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3102 to a local label. */
3105 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3108 tree fn
= (tree
) fnp
;
3110 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3119 /* Determine if the function can be copied. If so return NULL. If
3120 not return a string describng the reason for failure. */
3123 copy_forbidden (struct function
*fun
, tree fndecl
)
3125 const char *reason
= fun
->cannot_be_copied_reason
;
3129 /* Only examine the function once. */
3130 if (fun
->cannot_be_copied_set
)
3133 /* We cannot copy a function that receives a non-local goto
3134 because we cannot remap the destination label used in the
3135 function that is performing the non-local goto. */
3136 /* ??? Actually, this should be possible, if we work at it.
3137 No doubt there's just a handful of places that simply
3138 assume it doesn't happen and don't substitute properly. */
3139 if (fun
->has_nonlocal_label
)
3141 reason
= G_("function %q+F can never be copied "
3142 "because it receives a non-local goto");
3146 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3147 if (TREE_CODE (decl
) == VAR_DECL
3148 && TREE_STATIC (decl
)
3149 && !DECL_EXTERNAL (decl
)
3150 && DECL_INITIAL (decl
)
3151 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3152 has_label_address_in_static_1
,
3155 reason
= G_("function %q+F can never be copied because it saves "
3156 "address of local label in a static variable");
3161 fun
->cannot_be_copied_reason
= reason
;
3162 fun
->cannot_be_copied_set
= true;
3167 static const char *inline_forbidden_reason
;
3169 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3170 iff a function can not be inlined. Also sets the reason why. */
3173 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3174 struct walk_stmt_info
*wip
)
3176 tree fn
= (tree
) wip
->info
;
3178 gimple stmt
= gsi_stmt (*gsi
);
3180 switch (gimple_code (stmt
))
3183 /* Refuse to inline alloca call unless user explicitly forced so as
3184 this may change program's memory overhead drastically when the
3185 function using alloca is called in loop. In GCC present in
3186 SPEC2000 inlining into schedule_block cause it to require 2GB of
3187 RAM instead of 256MB. Don't do so for alloca calls emitted for
3188 VLA objects as those can't cause unbounded growth (they're always
3189 wrapped inside stack_save/stack_restore regions. */
3190 if (gimple_alloca_call_p (stmt
)
3191 && !gimple_call_alloca_for_var_p (stmt
)
3192 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3194 inline_forbidden_reason
3195 = G_("function %q+F can never be inlined because it uses "
3196 "alloca (override using the always_inline attribute)");
3197 *handled_ops_p
= true;
3201 t
= gimple_call_fndecl (stmt
);
3205 /* We cannot inline functions that call setjmp. */
3206 if (setjmp_call_p (t
))
3208 inline_forbidden_reason
3209 = G_("function %q+F can never be inlined because it uses setjmp");
3210 *handled_ops_p
= true;
3214 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3215 switch (DECL_FUNCTION_CODE (t
))
3217 /* We cannot inline functions that take a variable number of
3219 case BUILT_IN_VA_START
:
3220 case BUILT_IN_NEXT_ARG
:
3221 case BUILT_IN_VA_END
:
3222 inline_forbidden_reason
3223 = G_("function %q+F can never be inlined because it "
3224 "uses variable argument lists");
3225 *handled_ops_p
= true;
3228 case BUILT_IN_LONGJMP
:
3229 /* We can't inline functions that call __builtin_longjmp at
3230 all. The non-local goto machinery really requires the
3231 destination be in a different function. If we allow the
3232 function calling __builtin_longjmp to be inlined into the
3233 function calling __builtin_setjmp, Things will Go Awry. */
3234 inline_forbidden_reason
3235 = G_("function %q+F can never be inlined because "
3236 "it uses setjmp-longjmp exception handling");
3237 *handled_ops_p
= true;
3240 case BUILT_IN_NONLOCAL_GOTO
:
3242 inline_forbidden_reason
3243 = G_("function %q+F can never be inlined because "
3244 "it uses non-local goto");
3245 *handled_ops_p
= true;
3248 case BUILT_IN_RETURN
:
3249 case BUILT_IN_APPLY_ARGS
:
3250 /* If a __builtin_apply_args caller would be inlined,
3251 it would be saving arguments of the function it has
3252 been inlined into. Similarly __builtin_return would
3253 return from the function the inline has been inlined into. */
3254 inline_forbidden_reason
3255 = G_("function %q+F can never be inlined because "
3256 "it uses __builtin_return or __builtin_apply_args");
3257 *handled_ops_p
= true;
3266 t
= gimple_goto_dest (stmt
);
3268 /* We will not inline a function which uses computed goto. The
3269 addresses of its local labels, which may be tucked into
3270 global storage, are of course not constant across
3271 instantiations, which causes unexpected behavior. */
3272 if (TREE_CODE (t
) != LABEL_DECL
)
3274 inline_forbidden_reason
3275 = G_("function %q+F can never be inlined "
3276 "because it contains a computed goto");
3277 *handled_ops_p
= true;
3286 *handled_ops_p
= false;
3290 /* Return true if FNDECL is a function that cannot be inlined into
3294 inline_forbidden_p (tree fndecl
)
3296 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3297 struct walk_stmt_info wi
;
3298 struct pointer_set_t
*visited_nodes
;
3300 bool forbidden_p
= false;
3302 /* First check for shared reasons not to copy the code. */
3303 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3304 if (inline_forbidden_reason
!= NULL
)
3307 /* Next, walk the statements of the function looking for
3308 constraucts we can't handle, or are non-optimal for inlining. */
3309 visited_nodes
= pointer_set_create ();
3310 memset (&wi
, 0, sizeof (wi
));
3311 wi
.info
= (void *) fndecl
;
3312 wi
.pset
= visited_nodes
;
3314 FOR_EACH_BB_FN (bb
, fun
)
3317 gimple_seq seq
= bb_seq (bb
);
3318 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3319 forbidden_p
= (ret
!= NULL
);
3324 pointer_set_destroy (visited_nodes
);
3328 /* Return false if the function FNDECL cannot be inlined on account of its
3329 attributes, true otherwise. */
3331 function_attribute_inlinable_p (const_tree fndecl
)
3333 if (targetm
.attribute_table
)
3337 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3339 const_tree name
= TREE_PURPOSE (a
);
3342 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3343 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3344 return targetm
.function_attribute_inlinable_p (fndecl
);
3351 /* Returns nonzero if FN is a function that does not have any
3352 fundamental inline blocking properties. */
3355 tree_inlinable_function_p (tree fn
)
3357 bool inlinable
= true;
3361 /* If we've already decided this function shouldn't be inlined,
3362 there's no need to check again. */
3363 if (DECL_UNINLINABLE (fn
))
3366 /* We only warn for functions declared `inline' by the user. */
3367 do_warning
= (warn_inline
3368 && DECL_DECLARED_INLINE_P (fn
)
3369 && !DECL_NO_INLINE_WARNING_P (fn
)
3370 && !DECL_IN_SYSTEM_HEADER (fn
));
3372 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3375 && always_inline
== NULL
)
3378 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3379 "is suppressed using -fno-inline", fn
);
3383 else if (!function_attribute_inlinable_p (fn
))
3386 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3387 "uses attributes conflicting with inlining", fn
);
3391 else if (inline_forbidden_p (fn
))
3393 /* See if we should warn about uninlinable functions. Previously,
3394 some of these warnings would be issued while trying to expand
3395 the function inline, but that would cause multiple warnings
3396 about functions that would for example call alloca. But since
3397 this a property of the function, just one warning is enough.
3398 As a bonus we can now give more details about the reason why a
3399 function is not inlinable. */
3401 error (inline_forbidden_reason
, fn
);
3402 else if (do_warning
)
3403 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3408 /* Squirrel away the result so that we don't have to check again. */
3409 DECL_UNINLINABLE (fn
) = !inlinable
;
3414 /* Estimate the cost of a memory move. Use machine dependent
3415 word size and take possible memcpy call into account. */
3418 estimate_move_cost (tree type
)
3422 gcc_assert (!VOID_TYPE_P (type
));
3424 if (TREE_CODE (type
) == VECTOR_TYPE
)
3426 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3427 enum machine_mode simd
3428 = targetm
.vectorize
.preferred_simd_mode (inner
);
3429 int simd_mode_size
= GET_MODE_SIZE (simd
);
3430 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3434 size
= int_size_in_bytes (type
);
3436 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3437 /* Cost of a memcpy call, 3 arguments and the call. */
3440 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3443 /* Returns cost of operation CODE, according to WEIGHTS */
3446 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3447 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3451 /* These are "free" conversions, or their presumed cost
3452 is folded into other operations. */
3457 case VIEW_CONVERT_EXPR
:
3460 /* Assign cost of 1 to usual operations.
3461 ??? We may consider mapping RTL costs to this. */
3467 case POINTER_PLUS_EXPR
:
3470 case MULT_HIGHPART_EXPR
:
3473 case ADDR_SPACE_CONVERT_EXPR
:
3474 case FIXED_CONVERT_EXPR
:
3475 case FIX_TRUNC_EXPR
:
3487 case VEC_LSHIFT_EXPR
:
3488 case VEC_RSHIFT_EXPR
:
3495 case TRUTH_ANDIF_EXPR
:
3496 case TRUTH_ORIF_EXPR
:
3497 case TRUTH_AND_EXPR
:
3499 case TRUTH_XOR_EXPR
:
3500 case TRUTH_NOT_EXPR
:
3509 case UNORDERED_EXPR
:
3520 case PREDECREMENT_EXPR
:
3521 case PREINCREMENT_EXPR
:
3522 case POSTDECREMENT_EXPR
:
3523 case POSTINCREMENT_EXPR
:
3525 case REALIGN_LOAD_EXPR
:
3527 case REDUC_MAX_EXPR
:
3528 case REDUC_MIN_EXPR
:
3529 case REDUC_PLUS_EXPR
:
3530 case WIDEN_SUM_EXPR
:
3531 case WIDEN_MULT_EXPR
:
3533 case WIDEN_MULT_PLUS_EXPR
:
3534 case WIDEN_MULT_MINUS_EXPR
:
3535 case WIDEN_LSHIFT_EXPR
:
3537 case VEC_WIDEN_MULT_HI_EXPR
:
3538 case VEC_WIDEN_MULT_LO_EXPR
:
3539 case VEC_WIDEN_MULT_EVEN_EXPR
:
3540 case VEC_WIDEN_MULT_ODD_EXPR
:
3541 case VEC_UNPACK_HI_EXPR
:
3542 case VEC_UNPACK_LO_EXPR
:
3543 case VEC_UNPACK_FLOAT_HI_EXPR
:
3544 case VEC_UNPACK_FLOAT_LO_EXPR
:
3545 case VEC_PACK_TRUNC_EXPR
:
3546 case VEC_PACK_SAT_EXPR
:
3547 case VEC_PACK_FIX_TRUNC_EXPR
:
3548 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3549 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3553 /* Few special cases of expensive operations. This is useful
3554 to avoid inlining on functions having too many of these. */
3555 case TRUNC_DIV_EXPR
:
3557 case FLOOR_DIV_EXPR
:
3558 case ROUND_DIV_EXPR
:
3559 case EXACT_DIV_EXPR
:
3560 case TRUNC_MOD_EXPR
:
3562 case FLOOR_MOD_EXPR
:
3563 case ROUND_MOD_EXPR
:
3565 if (TREE_CODE (op2
) != INTEGER_CST
)
3566 return weights
->div_mod_cost
;
3570 /* We expect a copy assignment with no operator. */
3571 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3577 /* Estimate number of instructions that will be created by expanding
3578 the statements in the statement sequence STMTS.
3579 WEIGHTS contains weights attributed to various constructs. */
3582 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3585 gimple_stmt_iterator gsi
;
3588 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3589 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3595 /* Estimate number of instructions that will be created by expanding STMT.
3596 WEIGHTS contains weights attributed to various constructs. */
3599 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3602 enum gimple_code code
= gimple_code (stmt
);
3609 /* Try to estimate the cost of assignments. We have three cases to
3611 1) Simple assignments to registers;
3612 2) Stores to things that must live in memory. This includes
3613 "normal" stores to scalars, but also assignments of large
3614 structures, or constructors of big arrays;
3616 Let us look at the first two cases, assuming we have "a = b + C":
3617 <GIMPLE_ASSIGN <var_decl "a">
3618 <plus_expr <var_decl "b"> <constant C>>
3619 If "a" is a GIMPLE register, the assignment to it is free on almost
3620 any target, because "a" usually ends up in a real register. Hence
3621 the only cost of this expression comes from the PLUS_EXPR, and we
3622 can ignore the GIMPLE_ASSIGN.
3623 If "a" is not a GIMPLE register, the assignment to "a" will most
3624 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3625 of moving something into "a", which we compute using the function
3626 estimate_move_cost. */
3627 if (gimple_clobber_p (stmt
))
3628 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3630 lhs
= gimple_assign_lhs (stmt
);
3631 rhs
= gimple_assign_rhs1 (stmt
);
3635 /* Account for the cost of moving to / from memory. */
3636 if (gimple_store_p (stmt
))
3637 cost
+= estimate_move_cost (TREE_TYPE (lhs
));
3638 if (gimple_assign_load_p (stmt
))
3639 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3641 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3642 gimple_assign_rhs1 (stmt
),
3643 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3644 == GIMPLE_BINARY_RHS
3645 ? gimple_assign_rhs2 (stmt
) : NULL
);
3649 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3650 gimple_op (stmt
, 0),
3651 gimple_op (stmt
, 1));
3655 /* Take into account cost of the switch + guess 2 conditional jumps for
3658 TODO: once the switch expansion logic is sufficiently separated, we can
3659 do better job on estimating cost of the switch. */
3660 if (weights
->time_based
)
3661 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3663 cost
= gimple_switch_num_labels (stmt
) * 2;
3668 tree decl
= gimple_call_fndecl (stmt
);
3669 struct cgraph_node
*node
= NULL
;
3671 /* Do not special case builtins where we see the body.
3672 This just confuse inliner. */
3673 if (!decl
|| !(node
= cgraph_get_node (decl
)) || node
->symbol
.definition
)
3675 /* For buitins that are likely expanded to nothing or
3676 inlined do not account operand costs. */
3677 else if (is_simple_builtin (decl
))
3679 else if (is_inexpensive_builtin (decl
))
3680 return weights
->target_builtin_call_cost
;
3681 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3683 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3684 specialize the cheap expansion we do here.
3685 ??? This asks for a more general solution. */
3686 switch (DECL_FUNCTION_CODE (decl
))
3691 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3692 && REAL_VALUES_EQUAL
3693 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3694 return estimate_operator_cost (MULT_EXPR
, weights
,
3695 gimple_call_arg (stmt
, 0),
3696 gimple_call_arg (stmt
, 0));
3704 cost
= node
? weights
->call_cost
: weights
->indirect_call_cost
;
3705 if (gimple_call_lhs (stmt
))
3706 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3707 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3709 tree arg
= gimple_call_arg (stmt
, i
);
3710 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3716 return weights
->return_cost
;
3722 case GIMPLE_PREDICT
:
3727 return asm_str_count (gimple_asm_string (stmt
));
3730 /* This is either going to be an external function call with one
3731 argument, or two register copy statements plus a goto. */
3734 case GIMPLE_EH_DISPATCH
:
3735 /* ??? This is going to turn into a switch statement. Ideally
3736 we'd have a look at the eh region and estimate the number of
3741 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3743 case GIMPLE_EH_FILTER
:
3744 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3747 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3750 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3751 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3753 /* OpenMP directives are generally very expensive. */
3755 case GIMPLE_OMP_RETURN
:
3756 case GIMPLE_OMP_SECTIONS_SWITCH
:
3757 case GIMPLE_OMP_ATOMIC_STORE
:
3758 case GIMPLE_OMP_CONTINUE
:
3759 /* ...except these, which are cheap. */
3762 case GIMPLE_OMP_ATOMIC_LOAD
:
3763 return weights
->omp_cost
;
3765 case GIMPLE_OMP_FOR
:
3766 return (weights
->omp_cost
3767 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3768 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3770 case GIMPLE_OMP_PARALLEL
:
3771 case GIMPLE_OMP_TASK
:
3772 case GIMPLE_OMP_CRITICAL
:
3773 case GIMPLE_OMP_MASTER
:
3774 case GIMPLE_OMP_ORDERED
:
3775 case GIMPLE_OMP_SECTION
:
3776 case GIMPLE_OMP_SECTIONS
:
3777 case GIMPLE_OMP_SINGLE
:
3778 return (weights
->omp_cost
3779 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3781 case GIMPLE_TRANSACTION
:
3782 return (weights
->tm_cost
3783 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3793 /* Estimate number of instructions that will be created by expanding
3794 function FNDECL. WEIGHTS contains weights attributed to various
3798 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3800 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3801 gimple_stmt_iterator bsi
;
3805 gcc_assert (my_function
&& my_function
->cfg
);
3806 FOR_EACH_BB_FN (bb
, my_function
)
3808 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3809 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3816 /* Initializes weights used by estimate_num_insns. */
3819 init_inline_once (void)
3821 eni_size_weights
.call_cost
= 1;
3822 eni_size_weights
.indirect_call_cost
= 3;
3823 eni_size_weights
.target_builtin_call_cost
= 1;
3824 eni_size_weights
.div_mod_cost
= 1;
3825 eni_size_weights
.omp_cost
= 40;
3826 eni_size_weights
.tm_cost
= 10;
3827 eni_size_weights
.time_based
= false;
3828 eni_size_weights
.return_cost
= 1;
3830 /* Estimating time for call is difficult, since we have no idea what the
3831 called function does. In the current uses of eni_time_weights,
3832 underestimating the cost does less harm than overestimating it, so
3833 we choose a rather small value here. */
3834 eni_time_weights
.call_cost
= 10;
3835 eni_time_weights
.indirect_call_cost
= 15;
3836 eni_time_weights
.target_builtin_call_cost
= 1;
3837 eni_time_weights
.div_mod_cost
= 10;
3838 eni_time_weights
.omp_cost
= 40;
3839 eni_time_weights
.tm_cost
= 40;
3840 eni_time_weights
.time_based
= true;
3841 eni_time_weights
.return_cost
= 2;
3844 /* Estimate the number of instructions in a gimple_seq. */
3847 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3849 gimple_stmt_iterator gsi
;
3851 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3852 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3858 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3861 prepend_lexical_block (tree current_block
, tree new_block
)
3863 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
3864 BLOCK_SUBBLOCKS (current_block
) = new_block
;
3865 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
3868 /* Add local variables from CALLEE to CALLER. */
3871 add_local_variables (struct function
*callee
, struct function
*caller
,
3877 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
3878 if (!can_be_nonlocal (var
, id
))
3880 tree new_var
= remap_decl (var
, id
);
3882 /* Remap debug-expressions. */
3883 if (TREE_CODE (new_var
) == VAR_DECL
3884 && DECL_HAS_DEBUG_EXPR_P (var
)
3887 tree tem
= DECL_DEBUG_EXPR (var
);
3888 bool old_regimplify
= id
->regimplify
;
3889 id
->remapping_type_depth
++;
3890 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
3891 id
->remapping_type_depth
--;
3892 id
->regimplify
= old_regimplify
;
3893 SET_DECL_DEBUG_EXPR (new_var
, tem
);
3894 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
3896 add_local_decl (caller
, new_var
);
3900 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3903 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
3907 struct pointer_map_t
*st
, *dst
;
3910 location_t saved_location
;
3911 struct cgraph_edge
*cg_edge
;
3912 cgraph_inline_failed_t reason
;
3913 basic_block return_block
;
3915 gimple_stmt_iterator gsi
, stmt_gsi
;
3916 bool successfully_inlined
= FALSE
;
3917 bool purge_dead_abnormal_edges
;
3919 /* Set input_location here so we get the right instantiation context
3920 if we call instantiate_decl from inlinable_function_p. */
3921 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
3922 saved_location
= input_location
;
3923 input_location
= gimple_location (stmt
);
3925 /* From here on, we're only interested in CALL_EXPRs. */
3926 if (gimple_code (stmt
) != GIMPLE_CALL
)
3929 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
3930 gcc_checking_assert (cg_edge
);
3931 /* First, see if we can figure out what function is being called.
3932 If we cannot, then there is no hope of inlining the function. */
3933 if (cg_edge
->indirect_unknown_callee
)
3935 fn
= cg_edge
->callee
->symbol
.decl
;
3936 gcc_checking_assert (fn
);
3938 /* If FN is a declaration of a function in a nested scope that was
3939 globally declared inline, we don't set its DECL_INITIAL.
3940 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3941 C++ front-end uses it for cdtors to refer to their internal
3942 declarations, that are not real functions. Fortunately those
3943 don't have trees to be saved, so we can tell by checking their
3945 if (!DECL_INITIAL (fn
)
3946 && DECL_ABSTRACT_ORIGIN (fn
)
3947 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
3948 fn
= DECL_ABSTRACT_ORIGIN (fn
);
3950 /* Don't try to inline functions that are not well-suited to inlining. */
3951 if (cg_edge
->inline_failed
)
3953 reason
= cg_edge
->inline_failed
;
3954 /* If this call was originally indirect, we do not want to emit any
3955 inlining related warnings or sorry messages because there are no
3956 guarantees regarding those. */
3957 if (cg_edge
->indirect_inlining_edge
)
3960 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
3961 /* For extern inline functions that get redefined we always
3962 silently ignored always_inline flag. Better behaviour would
3963 be to be able to keep both bodies and use extern inline body
3964 for inlining, but we can't do that because frontends overwrite
3966 && !cg_edge
->callee
->local
.redefined_extern_inline
3967 /* During early inline pass, report only when optimization is
3969 && (cgraph_global_info_ready
3971 /* PR 20090218-1_0.c. Body can be provided by another module. */
3972 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
3974 error ("inlining failed in call to always_inline %q+F: %s", fn
,
3975 cgraph_inline_failed_string (reason
));
3976 error ("called from here");
3978 else if (warn_inline
3979 && DECL_DECLARED_INLINE_P (fn
)
3980 && !DECL_NO_INLINE_WARNING_P (fn
)
3981 && !DECL_IN_SYSTEM_HEADER (fn
)
3982 && reason
!= CIF_UNSPECIFIED
3983 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
3984 /* Do not warn about not inlined recursive calls. */
3985 && !cgraph_edge_recursive_p (cg_edge
)
3986 /* Avoid warnings during early inline pass. */
3987 && cgraph_global_info_ready
)
3989 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
3990 fn
, _(cgraph_inline_failed_string (reason
)));
3991 warning (OPT_Winline
, "called from here");
3995 fn
= cg_edge
->callee
->symbol
.decl
;
3996 cgraph_get_body (cg_edge
->callee
);
3998 #ifdef ENABLE_CHECKING
3999 if (cg_edge
->callee
->symbol
.decl
!= id
->dst_node
->symbol
.decl
)
4000 verify_cgraph_node (cg_edge
->callee
);
4003 /* We will be inlining this callee. */
4004 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4006 /* Update the callers EH personality. */
4007 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
))
4008 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->symbol
.decl
)
4009 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->symbol
.decl
);
4011 /* Split the block holding the GIMPLE_CALL. */
4012 e
= split_block (bb
, stmt
);
4014 return_block
= e
->dest
;
4017 /* split_block splits after the statement; work around this by
4018 moving the call into the second block manually. Not pretty,
4019 but seems easier than doing the CFG manipulation by hand
4020 when the GIMPLE_CALL is in the last statement of BB. */
4021 stmt_gsi
= gsi_last_bb (bb
);
4022 gsi_remove (&stmt_gsi
, false);
4024 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4025 been the source of abnormal edges. In this case, schedule
4026 the removal of dead abnormal edges. */
4027 gsi
= gsi_start_bb (return_block
);
4028 if (gsi_end_p (gsi
))
4030 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4031 purge_dead_abnormal_edges
= true;
4035 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4036 purge_dead_abnormal_edges
= false;
4039 stmt_gsi
= gsi_start_bb (return_block
);
4041 /* Build a block containing code to initialize the arguments, the
4042 actual inline expansion of the body, and a label for the return
4043 statements within the function to jump to. The type of the
4044 statement expression is the return type of the function call.
4045 ??? If the call does not have an associated block then we will
4046 remap all callee blocks to NULL, effectively dropping most of
4047 its debug information. This should only happen for calls to
4048 artificial decls inserted by the compiler itself. We need to
4049 either link the inlined blocks into the caller block tree or
4050 not refer to them in any way to not break GC for locations. */
4051 if (gimple_block (stmt
))
4053 id
->block
= make_node (BLOCK
);
4054 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4055 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
4056 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4059 /* Local declarations will be replaced by their equivalents in this
4062 id
->decl_map
= pointer_map_create ();
4063 dst
= id
->debug_map
;
4064 id
->debug_map
= NULL
;
4066 /* Record the function we are about to inline. */
4068 id
->src_node
= cg_edge
->callee
;
4069 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4070 id
->gimple_call
= stmt
;
4072 gcc_assert (!id
->src_cfun
->after_inlining
);
4075 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4077 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4078 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4082 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4084 if (DECL_INITIAL (fn
))
4086 if (gimple_block (stmt
))
4090 prepend_lexical_block (id
->block
,
4091 remap_blocks (DECL_INITIAL (fn
), id
));
4092 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4093 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4095 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4096 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4097 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4098 under it. The parameters can be then evaluated in the debugger,
4099 but don't show in backtraces. */
4100 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4101 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4104 *var
= TREE_CHAIN (v
);
4105 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4106 BLOCK_VARS (id
->block
) = v
;
4109 var
= &TREE_CHAIN (*var
);
4112 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4115 /* Return statements in the function body will be replaced by jumps
4116 to the RET_LABEL. */
4117 gcc_assert (DECL_INITIAL (fn
));
4118 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4120 /* Find the LHS to which the result of this call is assigned. */
4122 if (gimple_call_lhs (stmt
))
4124 modify_dest
= gimple_call_lhs (stmt
);
4126 /* The function which we are inlining might not return a value,
4127 in which case we should issue a warning that the function
4128 does not return a value. In that case the optimizers will
4129 see that the variable to which the value is assigned was not
4130 initialized. We do not want to issue a warning about that
4131 uninitialized variable. */
4132 if (DECL_P (modify_dest
))
4133 TREE_NO_WARNING (modify_dest
) = 1;
4135 if (gimple_call_return_slot_opt_p (stmt
))
4137 return_slot
= modify_dest
;
4144 /* If we are inlining a call to the C++ operator new, we don't want
4145 to use type based alias analysis on the return value. Otherwise
4146 we may get confused if the compiler sees that the inlined new
4147 function returns a pointer which was just deleted. See bug
4149 if (DECL_IS_OPERATOR_NEW (fn
))
4155 /* Declare the return variable for the function. */
4156 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4158 /* Add local vars in this inlined callee to caller. */
4159 add_local_variables (id
->src_cfun
, cfun
, id
);
4161 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4163 fprintf (dump_file
, "Inlining ");
4164 print_generic_expr (dump_file
, id
->src_fn
, 0);
4165 fprintf (dump_file
, " to ");
4166 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4167 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4170 /* This is it. Duplicate the callee body. Assume callee is
4171 pre-gimplified. Note that we must not alter the caller
4172 function in any way before this point, as this CALL_EXPR may be
4173 a self-referential call; if we're calling ourselves, we need to
4174 duplicate our body before altering anything. */
4175 copy_body (id
, bb
->count
,
4176 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4177 bb
, return_block
, NULL
, NULL
);
4179 /* Reset the escaped solution. */
4180 if (cfun
->gimple_df
)
4181 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4186 pointer_map_destroy (id
->debug_map
);
4187 id
->debug_map
= dst
;
4189 pointer_map_destroy (id
->decl_map
);
4192 /* Unlink the calls virtual operands before replacing it. */
4193 unlink_stmt_vdef (stmt
);
4195 /* If the inlined function returns a result that we care about,
4196 substitute the GIMPLE_CALL with an assignment of the return
4197 variable to the LHS of the call. That is, if STMT was
4198 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4199 if (use_retvar
&& gimple_call_lhs (stmt
))
4201 gimple old_stmt
= stmt
;
4202 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4203 gsi_replace (&stmt_gsi
, stmt
, false);
4204 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4208 /* Handle the case of inlining a function with no return
4209 statement, which causes the return value to become undefined. */
4210 if (gimple_call_lhs (stmt
)
4211 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4213 tree name
= gimple_call_lhs (stmt
);
4214 tree var
= SSA_NAME_VAR (name
);
4215 tree def
= ssa_default_def (cfun
, var
);
4219 /* If the variable is used undefined, make this name
4220 undefined via a move. */
4221 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4222 gsi_replace (&stmt_gsi
, stmt
, true);
4226 /* Otherwise make this variable undefined. */
4227 gsi_remove (&stmt_gsi
, true);
4228 set_ssa_default_def (cfun
, var
, name
);
4229 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4233 gsi_remove (&stmt_gsi
, true);
4236 if (purge_dead_abnormal_edges
)
4238 gimple_purge_dead_eh_edges (return_block
);
4239 gimple_purge_dead_abnormal_call_edges (return_block
);
4242 /* If the value of the new expression is ignored, that's OK. We
4243 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4244 the equivalent inlined version either. */
4245 if (is_gimple_assign (stmt
))
4247 gcc_assert (gimple_assign_single_p (stmt
)
4248 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4249 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4252 /* Output the inlining info for this abstract function, since it has been
4253 inlined. If we don't do this now, we can lose the information about the
4254 variables in the function when the blocks get blown away as soon as we
4255 remove the cgraph node. */
4256 if (gimple_block (stmt
))
4257 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->symbol
.decl
);
4259 /* Update callgraph if needed. */
4260 cgraph_remove_node (cg_edge
->callee
);
4262 id
->block
= NULL_TREE
;
4263 successfully_inlined
= TRUE
;
4266 input_location
= saved_location
;
4267 return successfully_inlined
;
4270 /* Expand call statements reachable from STMT_P.
4271 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4272 in a MODIFY_EXPR. */
4275 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4277 gimple_stmt_iterator gsi
;
4279 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4281 gimple stmt
= gsi_stmt (gsi
);
4283 if (is_gimple_call (stmt
)
4284 && expand_call_inline (bb
, stmt
, id
))
4292 /* Walk all basic blocks created after FIRST and try to fold every statement
4293 in the STATEMENTS pointer set. */
4296 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4298 for (; first
< n_basic_blocks
; first
++)
4299 if (BASIC_BLOCK (first
))
4301 gimple_stmt_iterator gsi
;
4303 for (gsi
= gsi_start_bb (BASIC_BLOCK (first
));
4306 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4308 gimple old_stmt
= gsi_stmt (gsi
);
4309 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4311 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4313 /* Folding builtins can create multiple instructions,
4314 we need to look at all of them. */
4315 gimple_stmt_iterator i2
= gsi
;
4317 if (fold_stmt (&gsi
))
4320 /* If a builtin at the end of a bb folded into nothing,
4321 the following loop won't work. */
4322 if (gsi_end_p (gsi
))
4324 cgraph_update_edges_for_call_stmt (old_stmt
,
4329 i2
= gsi_start_bb (BASIC_BLOCK (first
));
4334 new_stmt
= gsi_stmt (i2
);
4335 update_stmt (new_stmt
);
4336 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4339 if (new_stmt
== gsi_stmt (gsi
))
4341 /* It is okay to check only for the very last
4342 of these statements. If it is a throwing
4343 statement nothing will change. If it isn't
4344 this can remove EH edges. If that weren't
4345 correct then because some intermediate stmts
4346 throw, but not the last one. That would mean
4347 we'd have to split the block, which we can't
4348 here and we'd loose anyway. And as builtins
4349 probably never throw, this all
4351 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4353 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4360 else if (fold_stmt (&gsi
))
4362 /* Re-read the statement from GSI as fold_stmt() may
4364 gimple new_stmt
= gsi_stmt (gsi
);
4365 update_stmt (new_stmt
);
4367 if (is_gimple_call (old_stmt
)
4368 || is_gimple_call (new_stmt
))
4369 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4372 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4373 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4379 /* Return true if BB has at least one abnormal outgoing edge. */
4382 has_abnormal_outgoing_edge_p (basic_block bb
)
4387 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4388 if (e
->flags
& EDGE_ABNORMAL
)
4394 /* Expand calls to inline functions in the body of FN. */
4397 optimize_inline_calls (tree fn
)
4401 int last
= n_basic_blocks
;
4402 struct gimplify_ctx gctx
;
4403 bool inlined_p
= false;
4406 memset (&id
, 0, sizeof (id
));
4408 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4409 gcc_assert (id
.dst_node
->symbol
.definition
);
4411 /* Or any functions that aren't finished yet. */
4412 if (current_function_decl
)
4413 id
.dst_fn
= current_function_decl
;
4415 id
.copy_decl
= copy_decl_maybe_to_var
;
4416 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4417 id
.transform_new_cfg
= false;
4418 id
.transform_return_to_modify
= true;
4419 id
.transform_lang_insert_block
= NULL
;
4420 id
.statements_to_fold
= pointer_set_create ();
4422 push_gimplify_context (&gctx
);
4424 /* We make no attempts to keep dominance info up-to-date. */
4425 free_dominance_info (CDI_DOMINATORS
);
4426 free_dominance_info (CDI_POST_DOMINATORS
);
4428 /* Register specific gimple functions. */
4429 gimple_register_cfg_hooks ();
4431 /* Reach the trees by walking over the CFG, and note the
4432 enclosing basic-blocks in the call edges. */
4433 /* We walk the blocks going forward, because inlined function bodies
4434 will split id->current_basic_block, and the new blocks will
4435 follow it; we'll trudge through them, processing their CALL_EXPRs
4438 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4440 pop_gimplify_context (NULL
);
4442 #ifdef ENABLE_CHECKING
4444 struct cgraph_edge
*e
;
4446 verify_cgraph_node (id
.dst_node
);
4448 /* Double check that we inlined everything we are supposed to inline. */
4449 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4450 gcc_assert (e
->inline_failed
);
4454 /* Fold queued statements. */
4455 fold_marked_statements (last
, id
.statements_to_fold
);
4456 pointer_set_destroy (id
.statements_to_fold
);
4458 gcc_assert (!id
.debug_stmts
.exists ());
4460 /* If we didn't inline into the function there is nothing to do. */
4464 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4467 delete_unreachable_blocks_update_callgraph (&id
);
4468 #ifdef ENABLE_CHECKING
4469 verify_cgraph_node (id
.dst_node
);
4472 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4473 not possible yet - the IPA passes might make various functions to not
4474 throw and they don't care to proactively update local EH info. This is
4475 done later in fixup_cfg pass that also execute the verification. */
4476 return (TODO_update_ssa
4478 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4479 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4480 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
4483 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4486 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4488 enum tree_code code
= TREE_CODE (*tp
);
4489 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4491 /* We make copies of most nodes. */
4492 if (IS_EXPR_CODE_CLASS (cl
)
4493 || code
== TREE_LIST
4495 || code
== TYPE_DECL
4496 || code
== OMP_CLAUSE
)
4498 /* Because the chain gets clobbered when we make a copy, we save it
4500 tree chain
= NULL_TREE
, new_tree
;
4502 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4503 chain
= TREE_CHAIN (*tp
);
4505 /* Copy the node. */
4506 new_tree
= copy_node (*tp
);
4508 /* Propagate mudflap marked-ness. */
4509 if (flag_mudflap
&& mf_marked_p (*tp
))
4514 /* Now, restore the chain, if appropriate. That will cause
4515 walk_tree to walk into the chain as well. */
4516 if (code
== PARM_DECL
4517 || code
== TREE_LIST
4518 || code
== OMP_CLAUSE
)
4519 TREE_CHAIN (*tp
) = chain
;
4521 /* For now, we don't update BLOCKs when we make copies. So, we
4522 have to nullify all BIND_EXPRs. */
4523 if (TREE_CODE (*tp
) == BIND_EXPR
)
4524 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4526 else if (code
== CONSTRUCTOR
)
4528 /* CONSTRUCTOR nodes need special handling because
4529 we need to duplicate the vector of elements. */
4532 new_tree
= copy_node (*tp
);
4534 /* Propagate mudflap marked-ness. */
4535 if (flag_mudflap
&& mf_marked_p (*tp
))
4538 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
4541 else if (code
== STATEMENT_LIST
)
4542 /* We used to just abort on STATEMENT_LIST, but we can run into them
4543 with statement-expressions (c++/40975). */
4544 copy_statement_list (tp
);
4545 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4547 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4549 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4554 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4555 information indicating to what new SAVE_EXPR this one should be mapped,
4556 use that one. Otherwise, create a new node and enter it in ST. FN is
4557 the function into which the copy will be placed. */
4560 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4562 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4566 /* See if we already encountered this SAVE_EXPR. */
4567 n
= (tree
*) pointer_map_contains (st
, *tp
);
4569 /* If we didn't already remap this SAVE_EXPR, do so now. */
4572 t
= copy_node (*tp
);
4574 /* Remember this SAVE_EXPR. */
4575 *pointer_map_insert (st
, *tp
) = t
;
4576 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4577 *pointer_map_insert (st
, t
) = t
;
4581 /* We've already walked into this SAVE_EXPR; don't do it again. */
4586 /* Replace this SAVE_EXPR with the copy. */
4590 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4591 label, copies the declaration and enters it in the splay_tree in DATA (which
4592 is really a 'copy_body_data *'. */
4595 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4596 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4597 struct walk_stmt_info
*wi
)
4599 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4600 gimple stmt
= gsi_stmt (*gsip
);
4602 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4604 tree decl
= gimple_label_label (stmt
);
4606 /* Copy the decl and remember the copy. */
4607 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4614 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4615 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4616 remaps all local declarations to appropriate replacements in gimple
4620 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4622 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4623 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4624 struct pointer_map_t
*st
= id
->decl_map
;
4628 /* Only a local declaration (variable or label). */
4629 if ((TREE_CODE (expr
) == VAR_DECL
4630 && !TREE_STATIC (expr
))
4631 || TREE_CODE (expr
) == LABEL_DECL
)
4633 /* Lookup the declaration. */
4634 n
= (tree
*) pointer_map_contains (st
, expr
);
4636 /* If it's there, remap it. */
4641 else if (TREE_CODE (expr
) == STATEMENT_LIST
4642 || TREE_CODE (expr
) == BIND_EXPR
4643 || TREE_CODE (expr
) == SAVE_EXPR
)
4645 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4647 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4648 It's OK for this to happen if it was part of a subtree that
4649 isn't immediately expanded, such as operand 2 of another
4651 if (!TREE_OPERAND (expr
, 1))
4653 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4654 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4658 /* Keep iterating. */
4663 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4664 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4665 remaps all local declarations to appropriate replacements in gimple
4669 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4670 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4671 struct walk_stmt_info
*wi
)
4673 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4674 gimple stmt
= gsi_stmt (*gsip
);
4676 if (gimple_code (stmt
) == GIMPLE_BIND
)
4678 tree block
= gimple_bind_block (stmt
);
4682 remap_block (&block
, id
);
4683 gimple_bind_set_block (stmt
, block
);
4686 /* This will remap a lot of the same decls again, but this should be
4688 if (gimple_bind_vars (stmt
))
4689 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
4693 /* Keep iterating. */
4698 /* Copies everything in SEQ and replaces variables and labels local to
4699 current_function_decl. */
4702 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4705 struct walk_stmt_info wi
;
4706 struct pointer_set_t
*visited
;
4709 /* There's nothing to do for NULL_TREE. */
4714 memset (&id
, 0, sizeof (id
));
4715 id
.src_fn
= current_function_decl
;
4716 id
.dst_fn
= current_function_decl
;
4717 id
.decl_map
= pointer_map_create ();
4718 id
.debug_map
= NULL
;
4720 id
.copy_decl
= copy_decl_no_change
;
4721 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4722 id
.transform_new_cfg
= false;
4723 id
.transform_return_to_modify
= false;
4724 id
.transform_lang_insert_block
= NULL
;
4726 /* Walk the tree once to find local labels. */
4727 memset (&wi
, 0, sizeof (wi
));
4728 visited
= pointer_set_create ();
4731 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4732 pointer_set_destroy (visited
);
4734 copy
= gimple_seq_copy (seq
);
4736 /* Walk the copy, remapping decls. */
4737 memset (&wi
, 0, sizeof (wi
));
4739 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4742 pointer_map_destroy (id
.decl_map
);
4744 pointer_map_destroy (id
.debug_map
);
4750 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4753 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4762 debug_find_tree (tree top
, tree search
)
4764 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4768 /* Declare the variables created by the inliner. Add all the variables in
4769 VARS to BIND_EXPR. */
4772 declare_inline_vars (tree block
, tree vars
)
4775 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4777 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4778 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4779 add_local_decl (cfun
, t
);
4783 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4786 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4787 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4788 VAR_DECL translation. */
4791 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4793 /* Don't generate debug information for the copy if we wouldn't have
4794 generated it for the copy either. */
4795 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4796 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4798 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4799 declaration inspired this copy. */
4800 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4802 /* The new variable/label has no RTL, yet. */
4803 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4804 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4805 SET_DECL_RTL (copy
, 0);
4807 /* These args would always appear unused, if not for this. */
4808 TREE_USED (copy
) = 1;
4810 /* Set the context for the new declaration. */
4811 if (!DECL_CONTEXT (decl
))
4812 /* Globals stay global. */
4814 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4815 /* Things that weren't in the scope of the function we're inlining
4816 from aren't in the scope we're inlining to, either. */
4818 else if (TREE_STATIC (decl
))
4819 /* Function-scoped static variables should stay in the original
4823 /* Ordinary automatic local variables are now in the scope of the
4825 DECL_CONTEXT (copy
) = id
->dst_fn
;
4831 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4835 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4836 || TREE_CODE (decl
) == RESULT_DECL
);
4838 type
= TREE_TYPE (decl
);
4840 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4841 VAR_DECL
, DECL_NAME (decl
), type
);
4842 if (DECL_PT_UID_SET_P (decl
))
4843 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4844 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4845 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4846 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4847 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4849 return copy_decl_for_dup_finish (id
, decl
, copy
);
4852 /* Like copy_decl_to_var, but create a return slot object instead of a
4853 pointer variable for return by invisible reference. */
4856 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4860 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4861 || TREE_CODE (decl
) == RESULT_DECL
);
4863 type
= TREE_TYPE (decl
);
4864 if (DECL_BY_REFERENCE (decl
))
4865 type
= TREE_TYPE (type
);
4867 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4868 VAR_DECL
, DECL_NAME (decl
), type
);
4869 if (DECL_PT_UID_SET_P (decl
))
4870 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4871 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4872 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4873 if (!DECL_BY_REFERENCE (decl
))
4875 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4876 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4879 return copy_decl_for_dup_finish (id
, decl
, copy
);
4883 copy_decl_no_change (tree decl
, copy_body_data
*id
)
4887 copy
= copy_node (decl
);
4889 /* The COPY is not abstract; it will be generated in DST_FN. */
4890 DECL_ABSTRACT (copy
) = 0;
4891 lang_hooks
.dup_lang_specific_decl (copy
);
4893 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4894 been taken; it's for internal bookkeeping in expand_goto_internal. */
4895 if (TREE_CODE (copy
) == LABEL_DECL
)
4897 TREE_ADDRESSABLE (copy
) = 0;
4898 LABEL_DECL_UID (copy
) = -1;
4901 return copy_decl_for_dup_finish (id
, decl
, copy
);
4905 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
4907 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
4908 return copy_decl_to_var (decl
, id
);
4910 return copy_decl_no_change (decl
, id
);
4913 /* Return a copy of the function's argument tree. */
4915 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
4916 bitmap args_to_skip
, tree
*vars
)
4919 tree new_parm
= NULL
;
4924 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
4925 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
4927 tree new_tree
= remap_decl (arg
, id
);
4928 if (TREE_CODE (new_tree
) != PARM_DECL
)
4929 new_tree
= id
->copy_decl (arg
, id
);
4930 lang_hooks
.dup_lang_specific_decl (new_tree
);
4932 parg
= &DECL_CHAIN (new_tree
);
4934 else if (!pointer_map_contains (id
->decl_map
, arg
))
4936 /* Make an equivalent VAR_DECL. If the argument was used
4937 as temporary variable later in function, the uses will be
4938 replaced by local variable. */
4939 tree var
= copy_decl_to_var (arg
, id
);
4940 insert_decl_map (id
, arg
, var
);
4941 /* Declare this new variable. */
4942 DECL_CHAIN (var
) = *vars
;
4948 /* Return a copy of the function's static chain. */
4950 copy_static_chain (tree static_chain
, copy_body_data
* id
)
4952 tree
*chain_copy
, *pvar
;
4954 chain_copy
= &static_chain
;
4955 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
4957 tree new_tree
= remap_decl (*pvar
, id
);
4958 lang_hooks
.dup_lang_specific_decl (new_tree
);
4959 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
4962 return static_chain
;
4965 /* Return true if the function is allowed to be versioned.
4966 This is a guard for the versioning functionality. */
4969 tree_versionable_function_p (tree fndecl
)
4971 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
4972 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
4975 /* Delete all unreachable basic blocks and update callgraph.
4976 Doing so is somewhat nontrivial because we need to update all clones and
4977 remove inline function that become unreachable. */
4980 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
4982 bool changed
= false;
4983 basic_block b
, next_bb
;
4985 find_unreachable_blocks ();
4987 /* Delete all unreachable basic blocks. */
4989 for (b
= ENTRY_BLOCK_PTR
->next_bb
; b
!= EXIT_BLOCK_PTR
; b
= next_bb
)
4991 next_bb
= b
->next_bb
;
4993 if (!(b
->flags
& BB_REACHABLE
))
4995 gimple_stmt_iterator bsi
;
4997 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4999 struct cgraph_edge
*e
;
5000 struct cgraph_node
*node
;
5002 ipa_remove_stmt_references ((symtab_node
)id
->dst_node
, gsi_stmt (bsi
));
5004 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5005 &&(e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
5007 if (!e
->inline_failed
)
5008 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5010 cgraph_remove_edge (e
);
5012 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5013 && id
->dst_node
->clones
)
5014 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5016 ipa_remove_stmt_references ((symtab_node
)node
, gsi_stmt (bsi
));
5017 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5018 && (e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
5020 if (!e
->inline_failed
)
5021 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5023 cgraph_remove_edge (e
);
5027 node
= node
->clones
;
5028 else if (node
->next_sibling_clone
)
5029 node
= node
->next_sibling_clone
;
5032 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5033 node
= node
->clone_of
;
5034 if (node
!= id
->dst_node
)
5035 node
= node
->next_sibling_clone
;
5039 delete_basic_block (b
);
5047 /* Update clone info after duplication. */
5050 update_clone_info (copy_body_data
* id
)
5052 struct cgraph_node
*node
;
5053 if (!id
->dst_node
->clones
)
5055 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5057 /* First update replace maps to match the new body. */
5058 if (node
->clone
.tree_map
)
5061 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5063 struct ipa_replace_map
*replace_info
;
5064 replace_info
= (*node
->clone
.tree_map
)[i
];
5065 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5066 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5070 node
= node
->clones
;
5071 else if (node
->next_sibling_clone
)
5072 node
= node
->next_sibling_clone
;
5075 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5076 node
= node
->clone_of
;
5077 if (node
!= id
->dst_node
)
5078 node
= node
->next_sibling_clone
;
5083 /* Create a copy of a function's tree.
5084 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5085 of the original function and the new copied function
5086 respectively. In case we want to replace a DECL
5087 tree with another tree while duplicating the function's
5088 body, TREE_MAP represents the mapping between these
5089 trees. If UPDATE_CLONES is set, the call_stmt fields
5090 of edges of clones of the function will be updated.
5092 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5094 If SKIP_RETURN is true, the new version will return void.
5095 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5096 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5099 tree_function_versioning (tree old_decl
, tree new_decl
,
5100 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
5101 bool update_clones
, bitmap args_to_skip
,
5102 bool skip_return
, bitmap blocks_to_copy
,
5103 basic_block new_entry
)
5105 struct cgraph_node
*old_version_node
;
5106 struct cgraph_node
*new_version_node
;
5110 struct ipa_replace_map
*replace_info
;
5111 basic_block old_entry_block
, bb
;
5112 vec
<gimple
> init_stmts
;
5113 init_stmts
.create (10);
5114 tree vars
= NULL_TREE
;
5116 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5117 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5118 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5120 old_version_node
= cgraph_get_node (old_decl
);
5121 gcc_checking_assert (old_version_node
);
5122 new_version_node
= cgraph_get_node (new_decl
);
5123 gcc_checking_assert (new_version_node
);
5125 /* Copy over debug args. */
5126 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5128 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5129 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5130 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5131 old_debug_args
= decl_debug_args_lookup (old_decl
);
5134 new_debug_args
= decl_debug_args_insert (new_decl
);
5135 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5139 /* Output the inlining info for this abstract function, since it has been
5140 inlined. If we don't do this now, we can lose the information about the
5141 variables in the function when the blocks get blown away as soon as we
5142 remove the cgraph node. */
5143 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5145 DECL_ARTIFICIAL (new_decl
) = 1;
5146 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5147 if (DECL_ORIGIN (old_decl
) == old_decl
)
5148 old_version_node
->used_as_abstract_origin
= true;
5149 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5151 /* Prepare the data structures for the tree copy. */
5152 memset (&id
, 0, sizeof (id
));
5154 /* Generate a new name for the new version. */
5155 id
.statements_to_fold
= pointer_set_create ();
5157 id
.decl_map
= pointer_map_create ();
5158 id
.debug_map
= NULL
;
5159 id
.src_fn
= old_decl
;
5160 id
.dst_fn
= new_decl
;
5161 id
.src_node
= old_version_node
;
5162 id
.dst_node
= new_version_node
;
5163 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5164 if (id
.src_node
->ipa_transforms_to_apply
.exists ())
5166 vec
<ipa_opt_pass
> old_transforms_to_apply
5167 = id
.dst_node
->ipa_transforms_to_apply
;
5170 id
.dst_node
->ipa_transforms_to_apply
5171 = id
.src_node
->ipa_transforms_to_apply
.copy ();
5172 for (i
= 0; i
< old_transforms_to_apply
.length (); i
++)
5173 id
.dst_node
->ipa_transforms_to_apply
.safe_push (old_transforms_to_apply
[i
]);
5174 old_transforms_to_apply
.release ();
5177 id
.copy_decl
= copy_decl_no_change
;
5178 id
.transform_call_graph_edges
5179 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5180 id
.transform_new_cfg
= true;
5181 id
.transform_return_to_modify
= false;
5182 id
.transform_lang_insert_block
= NULL
;
5184 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION
5185 (DECL_STRUCT_FUNCTION (old_decl
));
5186 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5187 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5188 initialize_cfun (new_decl
, old_decl
,
5189 old_entry_block
->count
);
5190 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5191 = id
.src_cfun
->gimple_df
->ipa_pta
;
5193 /* Copy the function's static chain. */
5194 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5196 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5197 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5200 /* If there's a tree_map, prepare for substitution. */
5202 for (i
= 0; i
< tree_map
->length (); i
++)
5205 replace_info
= (*tree_map
)[i
];
5206 if (replace_info
->replace_p
)
5208 if (!replace_info
->old_tree
)
5210 int i
= replace_info
->parm_num
;
5214 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5216 replace_info
->old_tree
= parm
;
5217 req_type
= TREE_TYPE (parm
);
5218 if (!useless_type_conversion_p (req_type
, TREE_TYPE (replace_info
->new_tree
)))
5220 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5221 replace_info
->new_tree
= fold_build1 (NOP_EXPR
, req_type
, replace_info
->new_tree
);
5222 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (TREE_TYPE (replace_info
->new_tree
)))
5223 replace_info
->new_tree
= fold_build1 (VIEW_CONVERT_EXPR
, req_type
, replace_info
->new_tree
);
5228 fprintf (dump_file
, " const ");
5229 print_generic_expr (dump_file
, replace_info
->new_tree
, 0);
5230 fprintf (dump_file
, " can't be converted to param ");
5231 print_generic_expr (dump_file
, parm
, 0);
5232 fprintf (dump_file
, "\n");
5234 replace_info
->old_tree
= NULL
;
5239 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5240 if (replace_info
->old_tree
)
5242 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5243 replace_info
->new_tree
, id
.src_fn
,
5247 init_stmts
.safe_push (init
);
5251 /* Copy the function's arguments. */
5252 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5253 DECL_ARGUMENTS (new_decl
) =
5254 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5255 args_to_skip
, &vars
);
5257 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5258 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5260 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5262 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5263 /* Add local vars. */
5264 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5266 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5268 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5270 DECL_RESULT (new_decl
)
5271 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5272 RESULT_DECL
, NULL_TREE
, void_type_node
);
5273 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5274 cfun
->returns_struct
= 0;
5275 cfun
->returns_pcc_struct
= 0;
5280 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5281 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5282 if (gimple_in_ssa_p (id
.src_cfun
)
5283 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5284 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5286 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5287 insert_decl_map (&id
, old_name
, new_name
);
5288 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5289 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5293 /* Set up the destination functions loop tree. */
5294 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5296 cfun
->curr_properties
&= ~PROP_loops
;
5297 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5298 cfun
->curr_properties
|= PROP_loops
;
5301 /* Copy the Function's body. */
5302 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5303 ENTRY_BLOCK_PTR
, EXIT_BLOCK_PTR
, blocks_to_copy
, new_entry
);
5305 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5306 number_blocks (new_decl
);
5308 /* We want to create the BB unconditionally, so that the addition of
5309 debug stmts doesn't affect BB count, which may in the end cause
5310 codegen differences. */
5311 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR
));
5312 while (init_stmts
.length ())
5313 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5314 update_clone_info (&id
);
5316 /* Remap the nonlocal_goto_save_area, if any. */
5317 if (cfun
->nonlocal_goto_save_area
)
5319 struct walk_stmt_info wi
;
5321 memset (&wi
, 0, sizeof (wi
));
5323 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5327 pointer_map_destroy (id
.decl_map
);
5329 pointer_map_destroy (id
.debug_map
);
5330 free_dominance_info (CDI_DOMINATORS
);
5331 free_dominance_info (CDI_POST_DOMINATORS
);
5333 fold_marked_statements (0, id
.statements_to_fold
);
5334 pointer_set_destroy (id
.statements_to_fold
);
5335 fold_cond_expr_cond ();
5336 delete_unreachable_blocks_update_callgraph (&id
);
5337 if (id
.dst_node
->symbol
.definition
)
5338 cgraph_rebuild_references ();
5339 update_ssa (TODO_update_ssa
);
5341 /* After partial cloning we need to rescale frequencies, so they are
5342 within proper range in the cloned function. */
5345 struct cgraph_edge
*e
;
5346 rebuild_frequencies ();
5348 new_version_node
->count
= ENTRY_BLOCK_PTR
->count
;
5349 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5351 basic_block bb
= gimple_bb (e
->call_stmt
);
5352 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5354 e
->count
= bb
->count
;
5356 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5358 basic_block bb
= gimple_bb (e
->call_stmt
);
5359 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5361 e
->count
= bb
->count
;
5365 free_dominance_info (CDI_DOMINATORS
);
5366 free_dominance_info (CDI_POST_DOMINATORS
);
5368 gcc_assert (!id
.debug_stmts
.exists ());
5369 init_stmts
.release ();
5374 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5375 the callee and return the inlined body on success. */
5378 maybe_inline_call_in_expr (tree exp
)
5380 tree fn
= get_callee_fndecl (exp
);
5382 /* We can only try to inline "const" functions. */
5383 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5385 struct pointer_map_t
*decl_map
= pointer_map_create ();
5386 call_expr_arg_iterator iter
;
5390 /* Remap the parameters. */
5391 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5393 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5394 *pointer_map_insert (decl_map
, param
) = arg
;
5396 memset (&id
, 0, sizeof (id
));
5398 id
.dst_fn
= current_function_decl
;
5399 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5400 id
.decl_map
= decl_map
;
5402 id
.copy_decl
= copy_decl_no_change
;
5403 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5404 id
.transform_new_cfg
= false;
5405 id
.transform_return_to_modify
= true;
5406 id
.transform_lang_insert_block
= NULL
;
5408 /* Make sure not to unshare trees behind the front-end's back
5409 since front-end specific mechanisms may rely on sharing. */
5410 id
.regimplify
= false;
5411 id
.do_not_unshare
= true;
5413 /* We're not inside any EH region. */
5416 t
= copy_tree_body (&id
);
5417 pointer_map_destroy (decl_map
);
5419 /* We can only return something suitable for use in a GENERIC
5421 if (TREE_CODE (t
) == MODIFY_EXPR
)
5422 return TREE_OPERAND (t
, 1);
5428 /* Duplicate a type, fields and all. */
5431 build_duplicate_type (tree type
)
5433 struct copy_body_data id
;
5435 memset (&id
, 0, sizeof (id
));
5436 id
.src_fn
= current_function_decl
;
5437 id
.dst_fn
= current_function_decl
;
5439 id
.decl_map
= pointer_map_create ();
5440 id
.debug_map
= NULL
;
5441 id
.copy_decl
= copy_decl_no_change
;
5443 type
= remap_type_1 (type
, &id
);
5445 pointer_map_destroy (id
.decl_map
);
5447 pointer_map_destroy (id
.debug_map
);
5449 TYPE_CANONICAL (type
) = type
;