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 "stor-layout.h"
29 #include "tree-inline.h"
33 #include "insn-config.h"
35 #include "langhooks.h"
36 #include "basic-block.h"
37 #include "tree-iterator.h"
41 #include "gimple-iterator.h"
42 #include "gimplify-me.h"
43 #include "gimple-walk.h"
44 #include "gimple-ssa.h"
46 #include "tree-phinodes.h"
47 #include "ssa-iterators.h"
48 #include "stringpool.h"
49 #include "tree-ssanames.h"
50 #include "tree-into-ssa.h"
55 #include "tree-pretty-print.h"
58 #include "pointer-set.h"
60 #include "value-prof.h"
61 #include "tree-pass.h"
65 #include "rtl.h" /* FIXME: For asm_str_count. */
67 /* I'm not real happy about this, but we need to handle gimple and
70 /* Inlining, Cloning, Versioning, Parallelization
72 Inlining: a function body is duplicated, but the PARM_DECLs are
73 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
74 MODIFY_EXPRs that store to a dedicated returned-value variable.
75 The duplicated eh_region info of the copy will later be appended
76 to the info for the caller; the eh_region info in copied throwing
77 statements and RESX statements are adjusted accordingly.
79 Cloning: (only in C++) We have one body for a con/de/structor, and
80 multiple function decls, each with a unique parameter list.
81 Duplicate the body, using the given splay tree; some parameters
82 will become constants (like 0 or 1).
84 Versioning: a function body is duplicated and the result is a new
85 function rather than into blocks of an existing function as with
86 inlining. Some parameters will become constants.
88 Parallelization: a region of a function is duplicated resulting in
89 a new function. Variables may be replaced with complex expressions
90 to enable shared variable semantics.
92 All of these will simultaneously lookup any callgraph edges. If
93 we're going to inline the duplicated function body, and the given
94 function has some cloned callgraph nodes (one for each place this
95 function will be inlined) those callgraph edges will be duplicated.
96 If we're cloning the body, those callgraph edges will be
97 updated to point into the new body. (Note that the original
98 callgraph node and edge list will not be altered.)
100 See the CALL_EXPR handling case in copy_tree_body_r (). */
104 o In order to make inlining-on-trees work, we pessimized
105 function-local static constants. In particular, they are now
106 always output, even when not addressed. Fix this by treating
107 function-local static constants just like global static
108 constants; the back-end already knows not to output them if they
111 o Provide heuristics to clamp inlining of recursive template
115 /* Weights that estimate_num_insns uses to estimate the size of the
118 eni_weights eni_size_weights
;
120 /* Weights that estimate_num_insns uses to estimate the time necessary
121 to execute the produced code. */
123 eni_weights eni_time_weights
;
127 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, basic_block
);
128 static void remap_block (tree
*, copy_body_data
*);
129 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
130 static void declare_inline_vars (tree
, tree
);
131 static void remap_save_expr (tree
*, void *, int *);
132 static void prepend_lexical_block (tree current_block
, tree new_block
);
133 static tree
copy_decl_to_var (tree
, copy_body_data
*);
134 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
135 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
136 static gimple
remap_gimple_stmt (gimple
, copy_body_data
*);
137 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
139 /* Insert a tree->tree mapping for ID. Despite the name suggests
140 that the trees should be variables, it is used for more than that. */
143 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
145 *pointer_map_insert (id
->decl_map
, key
) = value
;
147 /* Always insert an identity map as well. If we see this same new
148 node again, we won't want to duplicate it a second time. */
150 *pointer_map_insert (id
->decl_map
, value
) = value
;
153 /* Insert a tree->tree mapping for ID. This is only used for
157 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
159 if (!gimple_in_ssa_p (id
->src_cfun
))
162 if (!MAY_HAVE_DEBUG_STMTS
)
165 if (!target_for_debug_bind (key
))
168 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
169 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
172 id
->debug_map
= pointer_map_create ();
174 *pointer_map_insert (id
->debug_map
, key
) = value
;
177 /* If nonzero, we're remapping the contents of inlined debug
178 statements. If negative, an error has occurred, such as a
179 reference to a variable that isn't available in the inlined
181 static int processing_debug_stmt
= 0;
183 /* Construct new SSA name for old NAME. ID is the inline context. */
186 remap_ssa_name (tree name
, copy_body_data
*id
)
191 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
193 n
= (tree
*) pointer_map_contains (id
->decl_map
, name
);
195 return unshare_expr (*n
);
197 if (processing_debug_stmt
)
199 if (SSA_NAME_IS_DEFAULT_DEF (name
)
200 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
201 && id
->entry_bb
== NULL
202 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
204 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
206 gimple_stmt_iterator gsi
;
207 tree val
= SSA_NAME_VAR (name
);
209 n
= (tree
*) pointer_map_contains (id
->decl_map
, val
);
212 if (TREE_CODE (val
) != PARM_DECL
)
214 processing_debug_stmt
= -1;
217 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
218 DECL_ARTIFICIAL (vexpr
) = 1;
219 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
220 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
221 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
222 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
226 processing_debug_stmt
= -1;
230 /* Remap anonymous SSA names or SSA names of anonymous decls. */
231 var
= SSA_NAME_VAR (name
);
233 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
234 && TREE_CODE (var
) == VAR_DECL
235 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
236 && DECL_ARTIFICIAL (var
)
237 && DECL_IGNORED_P (var
)
238 && !DECL_NAME (var
)))
240 struct ptr_info_def
*pi
;
241 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
), NULL
);
242 if (!var
&& SSA_NAME_IDENTIFIER (name
))
243 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
244 insert_decl_map (id
, name
, new_tree
);
245 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
246 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
247 /* At least IPA points-to info can be directly transferred. */
248 if (id
->src_cfun
->gimple_df
249 && id
->src_cfun
->gimple_df
->ipa_pta
250 && (pi
= SSA_NAME_PTR_INFO (name
))
253 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
259 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
261 new_tree
= remap_decl (var
, id
);
263 /* We might've substituted constant or another SSA_NAME for
266 Replace the SSA name representing RESULT_DECL by variable during
267 inlining: this saves us from need to introduce PHI node in a case
268 return value is just partly initialized. */
269 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
270 && (!SSA_NAME_VAR (name
)
271 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
272 || !id
->transform_return_to_modify
))
274 struct ptr_info_def
*pi
;
275 new_tree
= make_ssa_name (new_tree
, NULL
);
276 insert_decl_map (id
, name
, new_tree
);
277 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
278 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
279 /* At least IPA points-to info can be directly transferred. */
280 if (id
->src_cfun
->gimple_df
281 && id
->src_cfun
->gimple_df
->ipa_pta
282 && (pi
= SSA_NAME_PTR_INFO (name
))
285 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
288 if (SSA_NAME_IS_DEFAULT_DEF (name
))
290 /* By inlining function having uninitialized variable, we might
291 extend the lifetime (variable might get reused). This cause
292 ICE in the case we end up extending lifetime of SSA name across
293 abnormal edge, but also increase register pressure.
295 We simply initialize all uninitialized vars by 0 except
296 for case we are inlining to very first BB. We can avoid
297 this for all BBs that are not inside strongly connected
298 regions of the CFG, but this is expensive to test. */
300 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
301 && (!SSA_NAME_VAR (name
)
302 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
303 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
305 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
307 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
309 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
311 init_stmt
= gimple_build_assign (new_tree
, zero
);
312 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
313 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
317 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
318 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
323 insert_decl_map (id
, name
, new_tree
);
327 /* Remap DECL during the copying of the BLOCK tree for the function. */
330 remap_decl (tree decl
, copy_body_data
*id
)
334 /* We only remap local variables in the current function. */
336 /* See if we have remapped this declaration. */
338 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
340 if (!n
&& processing_debug_stmt
)
342 processing_debug_stmt
= -1;
346 /* If we didn't already have an equivalent for this declaration,
350 /* Make a copy of the variable or label. */
351 tree t
= id
->copy_decl (decl
, id
);
353 /* Remember it, so that if we encounter this local entity again
354 we can reuse this copy. Do this early because remap_type may
355 need this decl for TYPE_STUB_DECL. */
356 insert_decl_map (id
, decl
, t
);
361 /* Remap types, if necessary. */
362 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
363 if (TREE_CODE (t
) == TYPE_DECL
)
364 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
366 /* Remap sizes as necessary. */
367 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
368 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
370 /* If fields, do likewise for offset and qualifier. */
371 if (TREE_CODE (t
) == FIELD_DECL
)
373 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
374 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
375 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
381 if (id
->do_not_unshare
)
384 return unshare_expr (*n
);
388 remap_type_1 (tree type
, copy_body_data
*id
)
392 /* We do need a copy. build and register it now. If this is a pointer or
393 reference type, remap the designated type and make a new pointer or
395 if (TREE_CODE (type
) == POINTER_TYPE
)
397 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
399 TYPE_REF_CAN_ALIAS_ALL (type
));
400 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
401 new_tree
= build_type_attribute_qual_variant (new_tree
,
402 TYPE_ATTRIBUTES (type
),
404 insert_decl_map (id
, type
, new_tree
);
407 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
409 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
411 TYPE_REF_CAN_ALIAS_ALL (type
));
412 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
413 new_tree
= build_type_attribute_qual_variant (new_tree
,
414 TYPE_ATTRIBUTES (type
),
416 insert_decl_map (id
, type
, new_tree
);
420 new_tree
= copy_node (type
);
422 insert_decl_map (id
, type
, new_tree
);
424 /* This is a new type, not a copy of an old type. Need to reassociate
425 variants. We can handle everything except the main variant lazily. */
426 t
= TYPE_MAIN_VARIANT (type
);
429 t
= remap_type (t
, id
);
430 TYPE_MAIN_VARIANT (new_tree
) = t
;
431 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
432 TYPE_NEXT_VARIANT (t
) = new_tree
;
436 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
437 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
440 if (TYPE_STUB_DECL (type
))
441 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
443 /* Lazily create pointer and reference types. */
444 TYPE_POINTER_TO (new_tree
) = NULL
;
445 TYPE_REFERENCE_TO (new_tree
) = NULL
;
447 switch (TREE_CODE (new_tree
))
451 case FIXED_POINT_TYPE
:
454 t
= TYPE_MIN_VALUE (new_tree
);
455 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
456 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
458 t
= TYPE_MAX_VALUE (new_tree
);
459 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
460 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
464 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
465 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
469 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
470 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
475 case QUAL_UNION_TYPE
:
479 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
481 t
= remap_decl (f
, id
);
482 DECL_CONTEXT (t
) = new_tree
;
486 TYPE_FIELDS (new_tree
) = nreverse (nf
);
492 /* Shouldn't have been thought variable sized. */
496 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
497 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
503 remap_type (tree type
, copy_body_data
*id
)
511 /* See if we have remapped this type. */
512 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
516 /* The type only needs remapping if it's variably modified. */
517 if (! variably_modified_type_p (type
, id
->src_fn
))
519 insert_decl_map (id
, type
, type
);
523 id
->remapping_type_depth
++;
524 tmp
= remap_type_1 (type
, id
);
525 id
->remapping_type_depth
--;
530 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
533 can_be_nonlocal (tree decl
, copy_body_data
*id
)
535 /* We can not duplicate function decls. */
536 if (TREE_CODE (decl
) == FUNCTION_DECL
)
539 /* Local static vars must be non-local or we get multiple declaration
541 if (TREE_CODE (decl
) == VAR_DECL
542 && !auto_var_in_fn_p (decl
, id
->src_fn
))
549 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
553 tree new_decls
= NULL_TREE
;
555 /* Remap its variables. */
556 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
560 if (can_be_nonlocal (old_var
, id
))
562 /* We need to add this variable to the local decls as otherwise
563 nothing else will do so. */
564 if (TREE_CODE (old_var
) == VAR_DECL
565 && ! DECL_EXTERNAL (old_var
))
566 add_local_decl (cfun
, old_var
);
567 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
568 && !DECL_IGNORED_P (old_var
)
569 && nonlocalized_list
)
570 vec_safe_push (*nonlocalized_list
, old_var
);
574 /* Remap the variable. */
575 new_var
= remap_decl (old_var
, id
);
577 /* If we didn't remap this variable, we can't mess with its
578 TREE_CHAIN. If we remapped this variable to the return slot, it's
579 already declared somewhere else, so don't declare it here. */
581 if (new_var
== id
->retvar
)
585 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
586 && !DECL_IGNORED_P (old_var
)
587 && nonlocalized_list
)
588 vec_safe_push (*nonlocalized_list
, old_var
);
592 gcc_assert (DECL_P (new_var
));
593 DECL_CHAIN (new_var
) = new_decls
;
596 /* Also copy value-expressions. */
597 if (TREE_CODE (new_var
) == VAR_DECL
598 && DECL_HAS_VALUE_EXPR_P (new_var
))
600 tree tem
= DECL_VALUE_EXPR (new_var
);
601 bool old_regimplify
= id
->regimplify
;
602 id
->remapping_type_depth
++;
603 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
604 id
->remapping_type_depth
--;
605 id
->regimplify
= old_regimplify
;
606 SET_DECL_VALUE_EXPR (new_var
, tem
);
611 return nreverse (new_decls
);
614 /* Copy the BLOCK to contain remapped versions of the variables
615 therein. And hook the new block into the block-tree. */
618 remap_block (tree
*block
, copy_body_data
*id
)
623 /* Make the new block. */
625 new_block
= make_node (BLOCK
);
626 TREE_USED (new_block
) = TREE_USED (old_block
);
627 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
628 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
629 BLOCK_NONLOCALIZED_VARS (new_block
)
630 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
633 /* Remap its variables. */
634 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
635 &BLOCK_NONLOCALIZED_VARS (new_block
),
638 if (id
->transform_lang_insert_block
)
639 id
->transform_lang_insert_block (new_block
);
641 /* Remember the remapped block. */
642 insert_decl_map (id
, old_block
, new_block
);
645 /* Copy the whole block tree and root it in id->block. */
647 remap_blocks (tree block
, copy_body_data
*id
)
650 tree new_tree
= block
;
655 remap_block (&new_tree
, id
);
656 gcc_assert (new_tree
!= block
);
657 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
658 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
659 /* Blocks are in arbitrary order, but make things slightly prettier and do
660 not swap order when producing a copy. */
661 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
665 /* Remap the block tree rooted at BLOCK to nothing. */
667 remap_blocks_to_null (tree block
, copy_body_data
*id
)
670 insert_decl_map (id
, block
, NULL_TREE
);
671 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
672 remap_blocks_to_null (t
, id
);
676 copy_statement_list (tree
*tp
)
678 tree_stmt_iterator oi
, ni
;
681 new_tree
= alloc_stmt_list ();
682 ni
= tsi_start (new_tree
);
683 oi
= tsi_start (*tp
);
684 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
687 for (; !tsi_end_p (oi
); tsi_next (&oi
))
689 tree stmt
= tsi_stmt (oi
);
690 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
691 /* This copy is not redundant; tsi_link_after will smash this
692 STATEMENT_LIST into the end of the one we're building, and we
693 don't want to do that with the original. */
694 copy_statement_list (&stmt
);
695 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
700 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
702 tree block
= BIND_EXPR_BLOCK (*tp
);
703 /* Copy (and replace) the statement. */
704 copy_tree_r (tp
, walk_subtrees
, NULL
);
707 remap_block (&block
, id
);
708 BIND_EXPR_BLOCK (*tp
) = block
;
711 if (BIND_EXPR_VARS (*tp
))
712 /* This will remap a lot of the same decls again, but this should be
714 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
718 /* Create a new gimple_seq by remapping all the statements in BODY
719 using the inlining information in ID. */
722 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
724 gimple_stmt_iterator si
;
725 gimple_seq new_body
= NULL
;
727 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
729 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
730 gimple_seq_add_stmt (&new_body
, new_stmt
);
737 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
738 block using the mapping information in ID. */
741 copy_gimple_bind (gimple stmt
, copy_body_data
*id
)
744 tree new_block
, new_vars
;
745 gimple_seq body
, new_body
;
747 /* Copy the statement. Note that we purposely don't use copy_stmt
748 here because we need to remap statements as we copy. */
749 body
= gimple_bind_body (stmt
);
750 new_body
= remap_gimple_seq (body
, id
);
752 new_block
= gimple_bind_block (stmt
);
754 remap_block (&new_block
, id
);
756 /* This will remap a lot of the same decls again, but this should be
758 new_vars
= gimple_bind_vars (stmt
);
760 new_vars
= remap_decls (new_vars
, NULL
, id
);
762 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
767 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
772 if (TREE_CODE (decl
) == SSA_NAME
)
774 decl
= SSA_NAME_VAR (decl
);
779 return (TREE_CODE (decl
) == PARM_DECL
);
782 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
783 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
784 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
785 recursing into the children nodes of *TP. */
788 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
790 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
791 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
792 tree fn
= id
->src_fn
;
794 if (TREE_CODE (*tp
) == SSA_NAME
)
796 *tp
= remap_ssa_name (*tp
, id
);
800 else if (auto_var_in_fn_p (*tp
, fn
))
802 /* Local variables and labels need to be replaced by equivalent
803 variables. We don't want to copy static variables; there's
804 only one of those, no matter how many times we inline the
805 containing function. Similarly for globals from an outer
809 /* Remap the declaration. */
810 new_decl
= remap_decl (*tp
, id
);
811 gcc_assert (new_decl
);
812 /* Replace this variable with the copy. */
813 STRIP_TYPE_NOPS (new_decl
);
814 /* ??? The C++ frontend uses void * pointer zero to initialize
815 any other type. This confuses the middle-end type verification.
816 As cloned bodies do not go through gimplification again the fixup
817 there doesn't trigger. */
818 if (TREE_CODE (new_decl
) == INTEGER_CST
819 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
820 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
824 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
826 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
828 else if (TREE_CODE (*tp
) == LABEL_DECL
829 && (!DECL_CONTEXT (*tp
)
830 || decl_function_context (*tp
) == id
->src_fn
))
831 /* These may need to be remapped for EH handling. */
832 *tp
= remap_decl (*tp
, id
);
833 else if (TREE_CODE (*tp
) == FIELD_DECL
)
835 /* If the enclosing record type is variably_modified_type_p, the field
836 has already been remapped. Otherwise, it need not be. */
837 tree
*n
= (tree
*) pointer_map_contains (id
->decl_map
, *tp
);
842 else if (TYPE_P (*tp
))
843 /* Types may need remapping as well. */
844 *tp
= remap_type (*tp
, id
);
845 else if (CONSTANT_CLASS_P (*tp
))
847 /* If this is a constant, we have to copy the node iff the type
848 will be remapped. copy_tree_r will not copy a constant. */
849 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
851 if (new_type
== TREE_TYPE (*tp
))
854 else if (TREE_CODE (*tp
) == INTEGER_CST
)
855 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
856 TREE_INT_CST_HIGH (*tp
));
859 *tp
= copy_node (*tp
);
860 TREE_TYPE (*tp
) = new_type
;
865 /* Otherwise, just copy the node. Note that copy_tree_r already
866 knows not to copy VAR_DECLs, etc., so this is safe. */
868 if (TREE_CODE (*tp
) == MEM_REF
)
870 /* We need to re-canonicalize MEM_REFs from inline substitutions
871 that can happen when a pointer argument is an ADDR_EXPR.
872 Recurse here manually to allow that. */
873 tree ptr
= TREE_OPERAND (*tp
, 0);
874 tree type
= remap_type (TREE_TYPE (*tp
), id
);
876 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
877 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
878 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
879 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
880 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
881 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
882 remapped a parameter as the property might be valid only
883 for the parameter itself. */
884 if (TREE_THIS_NOTRAP (old
)
885 && (!is_parm (TREE_OPERAND (old
, 0))
886 || (!id
->transform_parameter
&& is_parm (ptr
))))
887 TREE_THIS_NOTRAP (*tp
) = 1;
892 /* Here is the "usual case". Copy this tree node, and then
893 tweak some special cases. */
894 copy_tree_r (tp
, walk_subtrees
, NULL
);
896 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
897 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
899 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
901 /* The copied TARGET_EXPR has never been expanded, even if the
902 original node was expanded already. */
903 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
904 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
906 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
908 /* Variable substitution need not be simple. In particular,
909 the MEM_REF substitution above. Make sure that
910 TREE_CONSTANT and friends are up-to-date. */
911 int invariant
= is_gimple_min_invariant (*tp
);
912 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
913 recompute_tree_invariant_for_addr_expr (*tp
);
915 /* If this used to be invariant, but is not any longer,
916 then regimplification is probably needed. */
917 if (invariant
&& !is_gimple_min_invariant (*tp
))
918 id
->regimplify
= true;
924 /* Update the TREE_BLOCK for the cloned expr. */
927 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
928 tree old_block
= TREE_BLOCK (*tp
);
932 n
= (tree
*) pointer_map_contains (id
->decl_map
,
937 TREE_SET_BLOCK (*tp
, new_block
);
940 /* Keep iterating. */
945 /* Called from copy_body_id via walk_tree. DATA is really a
946 `copy_body_data *'. */
949 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
951 copy_body_data
*id
= (copy_body_data
*) data
;
952 tree fn
= id
->src_fn
;
955 /* Begin by recognizing trees that we'll completely rewrite for the
956 inlining context. Our output for these trees is completely
957 different from out input (e.g. RETURN_EXPR is deleted, and morphs
958 into an edge). Further down, we'll handle trees that get
959 duplicated and/or tweaked. */
961 /* When requested, RETURN_EXPRs should be transformed to just the
962 contained MODIFY_EXPR. The branch semantics of the return will
963 be handled elsewhere by manipulating the CFG rather than a statement. */
964 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
966 tree assignment
= TREE_OPERAND (*tp
, 0);
968 /* If we're returning something, just turn that into an
969 assignment into the equivalent of the original RESULT_DECL.
970 If the "assignment" is just the result decl, the result
971 decl has already been set (e.g. a recent "foo (&result_decl,
972 ...)"); just toss the entire RETURN_EXPR. */
973 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
975 /* Replace the RETURN_EXPR with (a copy of) the
976 MODIFY_EXPR hanging underneath. */
977 *tp
= copy_node (assignment
);
979 else /* Else the RETURN_EXPR returns no value. */
982 return (tree
) (void *)1;
985 else if (TREE_CODE (*tp
) == SSA_NAME
)
987 *tp
= remap_ssa_name (*tp
, id
);
992 /* Local variables and labels need to be replaced by equivalent
993 variables. We don't want to copy static variables; there's only
994 one of those, no matter how many times we inline the containing
995 function. Similarly for globals from an outer function. */
996 else if (auto_var_in_fn_p (*tp
, fn
))
1000 /* Remap the declaration. */
1001 new_decl
= remap_decl (*tp
, id
);
1002 gcc_assert (new_decl
);
1003 /* Replace this variable with the copy. */
1004 STRIP_TYPE_NOPS (new_decl
);
1008 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1009 copy_statement_list (tp
);
1010 else if (TREE_CODE (*tp
) == SAVE_EXPR
1011 || TREE_CODE (*tp
) == TARGET_EXPR
)
1012 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1013 else if (TREE_CODE (*tp
) == LABEL_DECL
1014 && (! DECL_CONTEXT (*tp
)
1015 || decl_function_context (*tp
) == id
->src_fn
))
1016 /* These may need to be remapped for EH handling. */
1017 *tp
= remap_decl (*tp
, id
);
1018 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1019 copy_bind_expr (tp
, walk_subtrees
, id
);
1020 /* Types may need remapping as well. */
1021 else if (TYPE_P (*tp
))
1022 *tp
= remap_type (*tp
, id
);
1024 /* If this is a constant, we have to copy the node iff the type will be
1025 remapped. copy_tree_r will not copy a constant. */
1026 else if (CONSTANT_CLASS_P (*tp
))
1028 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1030 if (new_type
== TREE_TYPE (*tp
))
1033 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1034 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
1035 TREE_INT_CST_HIGH (*tp
));
1038 *tp
= copy_node (*tp
);
1039 TREE_TYPE (*tp
) = new_type
;
1043 /* Otherwise, just copy the node. Note that copy_tree_r already
1044 knows not to copy VAR_DECLs, etc., so this is safe. */
1047 /* Here we handle trees that are not completely rewritten.
1048 First we detect some inlining-induced bogosities for
1050 if (TREE_CODE (*tp
) == MODIFY_EXPR
1051 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1052 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1054 /* Some assignments VAR = VAR; don't generate any rtl code
1055 and thus don't count as variable modification. Avoid
1056 keeping bogosities like 0 = 0. */
1057 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1060 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1064 STRIP_TYPE_NOPS (value
);
1065 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1067 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1068 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1072 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1074 /* Get rid of *& from inline substitutions that can happen when a
1075 pointer argument is an ADDR_EXPR. */
1076 tree decl
= TREE_OPERAND (*tp
, 0);
1077 tree
*n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1080 /* If we happen to get an ADDR_EXPR in n->value, strip
1081 it manually here as we'll eventually get ADDR_EXPRs
1082 which lie about their types pointed to. In this case
1083 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1084 but we absolutely rely on that. As fold_indirect_ref
1085 does other useful transformations, try that first, though. */
1086 tree type
= TREE_TYPE (*tp
);
1087 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1089 *tp
= gimple_fold_indirect_ref (ptr
);
1092 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1095 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1096 /* ??? We should either assert here or build
1097 a VIEW_CONVERT_EXPR instead of blindly leaking
1098 incompatible types to our IL. */
1100 *tp
= TREE_OPERAND (ptr
, 0);
1104 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1105 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1106 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1107 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1108 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1109 have remapped a parameter as the property might be
1110 valid only for the parameter itself. */
1111 if (TREE_THIS_NOTRAP (old
)
1112 && (!is_parm (TREE_OPERAND (old
, 0))
1113 || (!id
->transform_parameter
&& is_parm (ptr
))))
1114 TREE_THIS_NOTRAP (*tp
) = 1;
1121 else if (TREE_CODE (*tp
) == MEM_REF
)
1123 /* We need to re-canonicalize MEM_REFs from inline substitutions
1124 that can happen when a pointer argument is an ADDR_EXPR.
1125 Recurse here manually to allow that. */
1126 tree ptr
= TREE_OPERAND (*tp
, 0);
1127 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1129 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1130 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1131 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1132 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1133 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1134 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1135 remapped a parameter as the property might be valid only
1136 for the parameter itself. */
1137 if (TREE_THIS_NOTRAP (old
)
1138 && (!is_parm (TREE_OPERAND (old
, 0))
1139 || (!id
->transform_parameter
&& is_parm (ptr
))))
1140 TREE_THIS_NOTRAP (*tp
) = 1;
1145 /* Here is the "usual case". Copy this tree node, and then
1146 tweak some special cases. */
1147 copy_tree_r (tp
, walk_subtrees
, NULL
);
1149 /* If EXPR has block defined, map it to newly constructed block.
1150 When inlining we want EXPRs without block appear in the block
1151 of function call if we are not remapping a type. */
1154 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1155 if (TREE_BLOCK (*tp
))
1158 n
= (tree
*) pointer_map_contains (id
->decl_map
,
1163 TREE_SET_BLOCK (*tp
, new_block
);
1166 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1167 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1169 /* The copied TARGET_EXPR has never been expanded, even if the
1170 original node was expanded already. */
1171 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1173 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1174 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1177 /* Variable substitution need not be simple. In particular, the
1178 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1179 and friends are up-to-date. */
1180 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1182 int invariant
= is_gimple_min_invariant (*tp
);
1183 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1185 /* Handle the case where we substituted an INDIRECT_REF
1186 into the operand of the ADDR_EXPR. */
1187 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1188 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1190 recompute_tree_invariant_for_addr_expr (*tp
);
1192 /* If this used to be invariant, but is not any longer,
1193 then regimplification is probably needed. */
1194 if (invariant
&& !is_gimple_min_invariant (*tp
))
1195 id
->regimplify
= true;
1201 /* Keep iterating. */
1205 /* Helper for remap_gimple_stmt. Given an EH region number for the
1206 source function, map that to the duplicate EH region number in
1207 the destination function. */
1210 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1212 eh_region old_r
, new_r
;
1215 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1216 slot
= pointer_map_contains (id
->eh_map
, old_r
);
1217 new_r
= (eh_region
) *slot
;
1219 return new_r
->index
;
1222 /* Similar, but operate on INTEGER_CSTs. */
1225 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1229 old_nr
= tree_to_shwi (old_t_nr
);
1230 new_nr
= remap_eh_region_nr (old_nr
, id
);
1232 return build_int_cst (integer_type_node
, new_nr
);
1235 /* Helper for copy_bb. Remap statement STMT using the inlining
1236 information in ID. Return the new statement copy. */
1239 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1242 struct walk_stmt_info wi
;
1243 bool skip_first
= false;
1245 /* Begin by recognizing trees that we'll completely rewrite for the
1246 inlining context. Our output for these trees is completely
1247 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1248 into an edge). Further down, we'll handle trees that get
1249 duplicated and/or tweaked. */
1251 /* When requested, GIMPLE_RETURNs should be transformed to just the
1252 contained GIMPLE_ASSIGN. The branch semantics of the return will
1253 be handled elsewhere by manipulating the CFG rather than the
1255 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1257 tree retval
= gimple_return_retval (stmt
);
1259 /* If we're returning something, just turn that into an
1260 assignment into the equivalent of the original RESULT_DECL.
1261 If RETVAL is just the result decl, the result decl has
1262 already been set (e.g. a recent "foo (&result_decl, ...)");
1263 just toss the entire GIMPLE_RETURN. */
1265 && (TREE_CODE (retval
) != RESULT_DECL
1266 && (TREE_CODE (retval
) != SSA_NAME
1267 || ! SSA_NAME_VAR (retval
)
1268 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1270 copy
= gimple_build_assign (id
->retvar
, retval
);
1271 /* id->retvar is already substituted. Skip it on later remapping. */
1275 return gimple_build_nop ();
1277 else if (gimple_has_substatements (stmt
))
1281 /* When cloning bodies from the C++ front end, we will be handed bodies
1282 in High GIMPLE form. Handle here all the High GIMPLE statements that
1283 have embedded statements. */
1284 switch (gimple_code (stmt
))
1287 copy
= copy_gimple_bind (stmt
, id
);
1291 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1292 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1295 case GIMPLE_EH_FILTER
:
1296 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1297 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1301 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1302 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1303 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1306 case GIMPLE_WITH_CLEANUP_EXPR
:
1307 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1308 copy
= gimple_build_wce (s1
);
1311 case GIMPLE_OMP_PARALLEL
:
1312 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1313 copy
= gimple_build_omp_parallel
1315 gimple_omp_parallel_clauses (stmt
),
1316 gimple_omp_parallel_child_fn (stmt
),
1317 gimple_omp_parallel_data_arg (stmt
));
1320 case GIMPLE_OMP_TASK
:
1321 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1322 copy
= gimple_build_omp_task
1324 gimple_omp_task_clauses (stmt
),
1325 gimple_omp_task_child_fn (stmt
),
1326 gimple_omp_task_data_arg (stmt
),
1327 gimple_omp_task_copy_fn (stmt
),
1328 gimple_omp_task_arg_size (stmt
),
1329 gimple_omp_task_arg_align (stmt
));
1332 case GIMPLE_OMP_FOR
:
1333 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1334 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1335 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1336 gimple_omp_for_clauses (stmt
),
1337 gimple_omp_for_collapse (stmt
), s2
);
1340 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1342 gimple_omp_for_set_index (copy
, i
,
1343 gimple_omp_for_index (stmt
, i
));
1344 gimple_omp_for_set_initial (copy
, i
,
1345 gimple_omp_for_initial (stmt
, i
));
1346 gimple_omp_for_set_final (copy
, i
,
1347 gimple_omp_for_final (stmt
, i
));
1348 gimple_omp_for_set_incr (copy
, i
,
1349 gimple_omp_for_incr (stmt
, i
));
1350 gimple_omp_for_set_cond (copy
, i
,
1351 gimple_omp_for_cond (stmt
, i
));
1356 case GIMPLE_OMP_MASTER
:
1357 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1358 copy
= gimple_build_omp_master (s1
);
1361 case GIMPLE_OMP_TASKGROUP
:
1362 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1363 copy
= gimple_build_omp_taskgroup (s1
);
1366 case GIMPLE_OMP_ORDERED
:
1367 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1368 copy
= gimple_build_omp_ordered (s1
);
1371 case GIMPLE_OMP_SECTION
:
1372 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1373 copy
= gimple_build_omp_section (s1
);
1376 case GIMPLE_OMP_SECTIONS
:
1377 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1378 copy
= gimple_build_omp_sections
1379 (s1
, gimple_omp_sections_clauses (stmt
));
1382 case GIMPLE_OMP_SINGLE
:
1383 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1384 copy
= gimple_build_omp_single
1385 (s1
, gimple_omp_single_clauses (stmt
));
1388 case GIMPLE_OMP_TARGET
:
1389 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1390 copy
= gimple_build_omp_target
1391 (s1
, gimple_omp_target_kind (stmt
),
1392 gimple_omp_target_clauses (stmt
));
1395 case GIMPLE_OMP_TEAMS
:
1396 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1397 copy
= gimple_build_omp_teams
1398 (s1
, gimple_omp_teams_clauses (stmt
));
1401 case GIMPLE_OMP_CRITICAL
:
1402 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1404 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1407 case GIMPLE_TRANSACTION
:
1408 s1
= remap_gimple_seq (gimple_transaction_body (stmt
), id
);
1409 copy
= gimple_build_transaction (s1
, gimple_transaction_label (stmt
));
1410 gimple_transaction_set_subcode (copy
, gimple_transaction_subcode (stmt
));
1419 if (gimple_assign_copy_p (stmt
)
1420 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1421 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1423 /* Here we handle statements that are not completely rewritten.
1424 First we detect some inlining-induced bogosities for
1427 /* Some assignments VAR = VAR; don't generate any rtl code
1428 and thus don't count as variable modification. Avoid
1429 keeping bogosities like 0 = 0. */
1430 tree decl
= gimple_assign_lhs (stmt
), value
;
1433 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1437 STRIP_TYPE_NOPS (value
);
1438 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1439 return gimple_build_nop ();
1443 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1444 in a block that we aren't copying during tree_function_versioning,
1445 just drop the clobber stmt. */
1446 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1448 tree lhs
= gimple_assign_lhs (stmt
);
1449 if (TREE_CODE (lhs
) == MEM_REF
1450 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1452 gimple def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1453 if (gimple_bb (def_stmt
)
1454 && !bitmap_bit_p (id
->blocks_to_copy
,
1455 gimple_bb (def_stmt
)->index
))
1456 return gimple_build_nop ();
1460 if (gimple_debug_bind_p (stmt
))
1462 copy
= gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1463 gimple_debug_bind_get_value (stmt
),
1465 id
->debug_stmts
.safe_push (copy
);
1468 if (gimple_debug_source_bind_p (stmt
))
1470 copy
= gimple_build_debug_source_bind
1471 (gimple_debug_source_bind_get_var (stmt
),
1472 gimple_debug_source_bind_get_value (stmt
), stmt
);
1473 id
->debug_stmts
.safe_push (copy
);
1477 /* Create a new deep copy of the statement. */
1478 copy
= gimple_copy (stmt
);
1480 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1481 RESX and EH_DISPATCH. */
1483 switch (gimple_code (copy
))
1487 tree r
, fndecl
= gimple_call_fndecl (copy
);
1488 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1489 switch (DECL_FUNCTION_CODE (fndecl
))
1491 case BUILT_IN_EH_COPY_VALUES
:
1492 r
= gimple_call_arg (copy
, 1);
1493 r
= remap_eh_region_tree_nr (r
, id
);
1494 gimple_call_set_arg (copy
, 1, r
);
1497 case BUILT_IN_EH_POINTER
:
1498 case BUILT_IN_EH_FILTER
:
1499 r
= gimple_call_arg (copy
, 0);
1500 r
= remap_eh_region_tree_nr (r
, id
);
1501 gimple_call_set_arg (copy
, 0, r
);
1508 /* Reset alias info if we didn't apply measures to
1509 keep it valid over inlining by setting DECL_PT_UID. */
1510 if (!id
->src_cfun
->gimple_df
1511 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1512 gimple_call_reset_alias_info (copy
);
1518 int r
= gimple_resx_region (copy
);
1519 r
= remap_eh_region_nr (r
, id
);
1520 gimple_resx_set_region (copy
, r
);
1524 case GIMPLE_EH_DISPATCH
:
1526 int r
= gimple_eh_dispatch_region (copy
);
1527 r
= remap_eh_region_nr (r
, id
);
1528 gimple_eh_dispatch_set_region (copy
, r
);
1537 /* If STMT has a block defined, map it to the newly constructed
1539 if (gimple_block (copy
))
1542 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1544 gimple_set_block (copy
, *n
);
1547 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1550 /* Remap all the operands in COPY. */
1551 memset (&wi
, 0, sizeof (wi
));
1554 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1556 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1558 /* Clear the copied virtual operands. We are not remapping them here
1559 but are going to recreate them from scratch. */
1560 if (gimple_has_mem_ops (copy
))
1562 gimple_set_vdef (copy
, NULL_TREE
);
1563 gimple_set_vuse (copy
, NULL_TREE
);
1570 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1574 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1575 gcov_type count_scale
)
1577 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1578 basic_block copy_basic_block
;
1583 /* Search for previous copied basic block. */
1586 prev
= prev
->prev_bb
;
1588 /* create_basic_block() will append every new block to
1589 basic_block_info automatically. */
1590 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1591 (basic_block
) prev
->aux
);
1592 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1594 /* We are going to rebuild frequencies from scratch. These values
1595 have just small importance to drive canonicalize_loop_headers. */
1596 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1598 /* We recompute frequencies after inlining, so this is quite safe. */
1599 if (freq
> BB_FREQ_MAX
)
1601 copy_basic_block
->frequency
= freq
;
1603 copy_gsi
= gsi_start_bb (copy_basic_block
);
1605 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1607 gimple stmt
= gsi_stmt (gsi
);
1608 gimple orig_stmt
= stmt
;
1610 id
->regimplify
= false;
1611 stmt
= remap_gimple_stmt (stmt
, id
);
1612 if (gimple_nop_p (stmt
))
1615 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1618 /* With return slot optimization we can end up with
1619 non-gimple (foo *)&this->m, fix that here. */
1620 if (is_gimple_assign (stmt
)
1621 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1622 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1625 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1626 gimple_assign_rhs1 (stmt
),
1628 GSI_CONTINUE_LINKING
);
1629 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1630 id
->regimplify
= false;
1633 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1636 gimple_regimplify_operands (stmt
, &seq_gsi
);
1638 /* If copy_basic_block has been empty at the start of this iteration,
1639 call gsi_start_bb again to get at the newly added statements. */
1640 if (gsi_end_p (copy_gsi
))
1641 copy_gsi
= gsi_start_bb (copy_basic_block
);
1643 gsi_next (©_gsi
);
1645 /* Process the new statement. The call to gimple_regimplify_operands
1646 possibly turned the statement into multiple statements, we
1647 need to process all of them. */
1652 stmt
= gsi_stmt (copy_gsi
);
1653 if (is_gimple_call (stmt
)
1654 && gimple_call_va_arg_pack_p (stmt
)
1657 /* __builtin_va_arg_pack () should be replaced by
1658 all arguments corresponding to ... in the caller. */
1662 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1665 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1668 /* Create the new array of arguments. */
1669 n
= nargs
+ gimple_call_num_args (stmt
);
1670 argarray
.create (n
);
1671 argarray
.safe_grow_cleared (n
);
1673 /* Copy all the arguments before '...' */
1674 memcpy (argarray
.address (),
1675 gimple_call_arg_ptr (stmt
, 0),
1676 gimple_call_num_args (stmt
) * sizeof (tree
));
1678 /* Append the arguments passed in '...' */
1679 memcpy (argarray
.address () + gimple_call_num_args (stmt
),
1680 gimple_call_arg_ptr (id
->gimple_call
, 0)
1681 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1682 nargs
* sizeof (tree
));
1684 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1687 argarray
.release ();
1689 /* Copy all GIMPLE_CALL flags, location and block, except
1690 GF_CALL_VA_ARG_PACK. */
1691 gimple_call_copy_flags (new_call
, stmt
);
1692 gimple_call_set_va_arg_pack (new_call
, false);
1693 gimple_set_location (new_call
, gimple_location (stmt
));
1694 gimple_set_block (new_call
, gimple_block (stmt
));
1695 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1697 gsi_replace (©_gsi
, new_call
, false);
1700 else if (is_gimple_call (stmt
)
1702 && (decl
= gimple_call_fndecl (stmt
))
1703 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1704 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1706 /* __builtin_va_arg_pack_len () should be replaced by
1707 the number of anonymous arguments. */
1708 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1712 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1715 count
= build_int_cst (integer_type_node
, nargs
);
1716 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1717 gsi_replace (©_gsi
, new_stmt
, false);
1721 /* Statements produced by inlining can be unfolded, especially
1722 when we constant propagated some operands. We can't fold
1723 them right now for two reasons:
1724 1) folding require SSA_NAME_DEF_STMTs to be correct
1725 2) we can't change function calls to builtins.
1726 So we just mark statement for later folding. We mark
1727 all new statements, instead just statements that has changed
1728 by some nontrivial substitution so even statements made
1729 foldable indirectly are updated. If this turns out to be
1730 expensive, copy_body can be told to watch for nontrivial
1732 if (id
->statements_to_fold
)
1733 pointer_set_insert (id
->statements_to_fold
, stmt
);
1735 /* We're duplicating a CALL_EXPR. Find any corresponding
1736 callgraph edges and update or duplicate them. */
1737 if (is_gimple_call (stmt
))
1739 struct cgraph_edge
*edge
;
1742 switch (id
->transform_call_graph_edges
)
1744 case CB_CGE_DUPLICATE
:
1745 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1748 int edge_freq
= edge
->frequency
;
1750 struct cgraph_edge
*old_edge
= edge
;
1751 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1753 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1755 /* We could also just rescale the frequency, but
1756 doing so would introduce roundoff errors and make
1757 verifier unhappy. */
1758 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1761 /* Speculative calls consist of two edges - direct and indirect.
1762 Duplicate the whole thing and distribute frequencies accordingly. */
1763 if (edge
->speculative
)
1765 struct cgraph_edge
*direct
, *indirect
;
1766 struct ipa_ref
*ref
;
1768 gcc_assert (!edge
->indirect_unknown_callee
);
1769 cgraph_speculative_call_info (old_edge
, direct
, indirect
, ref
);
1770 indirect
= cgraph_clone_edge (indirect
, id
->dst_node
, stmt
,
1772 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1774 if (old_edge
->frequency
+ indirect
->frequency
)
1776 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
1777 (old_edge
->frequency
+ indirect
->frequency
)),
1779 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
1780 (old_edge
->frequency
+ indirect
->frequency
)),
1783 ipa_clone_ref (ref
, id
->dst_node
, stmt
);
1787 edge
->frequency
= new_freq
;
1789 && profile_status_for_function (cfun
) != PROFILE_ABSENT
1790 && (edge_freq
> edge
->frequency
+ 10
1791 || edge_freq
< edge
->frequency
- 10))
1793 fprintf (dump_file
, "Edge frequency estimated by "
1794 "cgraph %i diverge from inliner's estimate %i\n",
1798 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1801 copy_basic_block
->frequency
);
1807 case CB_CGE_MOVE_CLONES
:
1808 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1810 edge
= cgraph_edge (id
->dst_node
, stmt
);
1814 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1816 cgraph_set_call_stmt (edge
, stmt
);
1823 /* Constant propagation on argument done during inlining
1824 may create new direct call. Produce an edge for it. */
1826 || (edge
->indirect_inlining_edge
1827 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1828 && id
->dst_node
->definition
1829 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1831 struct cgraph_node
*dest
= cgraph_get_node (fn
);
1833 /* We have missing edge in the callgraph. This can happen
1834 when previous inlining turned an indirect call into a
1835 direct call by constant propagating arguments or we are
1836 producing dead clone (for further cloning). In all
1837 other cases we hit a bug (incorrect node sharing is the
1838 most common reason for missing edges). */
1839 gcc_assert (!dest
->definition
1840 || dest
->address_taken
1841 || !id
->src_node
->definition
1842 || !id
->dst_node
->definition
);
1843 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1844 cgraph_create_edge_including_clones
1845 (id
->dst_node
, dest
, orig_stmt
, stmt
, bb
->count
,
1846 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1848 CIF_ORIGINALLY_INDIRECT_CALL
);
1850 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1852 compute_call_stmt_bb_frequency
1853 (id
->dst_node
->decl
,
1854 copy_basic_block
))->inline_failed
1855 = CIF_ORIGINALLY_INDIRECT_CALL
;
1858 fprintf (dump_file
, "Created new direct edge to %s\n",
1863 flags
= gimple_call_flags (stmt
);
1864 if (flags
& ECF_MAY_BE_ALLOCA
)
1865 cfun
->calls_alloca
= true;
1866 if (flags
& ECF_RETURNS_TWICE
)
1867 cfun
->calls_setjmp
= true;
1870 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1871 id
->eh_map
, id
->eh_lp_nr
);
1873 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1878 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1879 if (TREE_CODE (def
) == SSA_NAME
)
1880 SSA_NAME_DEF_STMT (def
) = stmt
;
1883 gsi_next (©_gsi
);
1885 while (!gsi_end_p (copy_gsi
));
1887 copy_gsi
= gsi_last_bb (copy_basic_block
);
1890 return copy_basic_block
;
1893 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1894 form is quite easy, since dominator relationship for old basic blocks does
1897 There is however exception where inlining might change dominator relation
1898 across EH edges from basic block within inlined functions destinating
1899 to landing pads in function we inline into.
1901 The function fills in PHI_RESULTs of such PHI nodes if they refer
1902 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1903 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1904 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1905 set, and this means that there will be no overlapping live ranges
1906 for the underlying symbol.
1908 This might change in future if we allow redirecting of EH edges and
1909 we might want to change way build CFG pre-inlining to include
1910 all the possible edges then. */
1912 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1913 bool can_throw
, bool nonlocal_goto
)
1918 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1920 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1923 gimple_stmt_iterator si
;
1926 gcc_assert (e
->flags
& EDGE_EH
);
1929 gcc_assert (!(e
->flags
& EDGE_EH
));
1931 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1935 phi
= gsi_stmt (si
);
1937 /* For abnormal goto/call edges the receiver can be the
1938 ENTRY_BLOCK. Do not assert this cannot happen. */
1940 gcc_assert ((e
->flags
& EDGE_EH
)
1941 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1943 re
= find_edge (ret_bb
, e
->dest
);
1944 gcc_checking_assert (re
);
1945 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1946 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1948 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1949 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1955 /* Copy edges from BB into its copy constructed earlier, scale profile
1956 accordingly. Edges will be taken care of later. Assume aux
1957 pointers to point to the copies of each BB. Return true if any
1958 debug stmts are left after a statement that must end the basic block. */
1961 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
1962 bool can_make_abnormal_goto
)
1964 basic_block new_bb
= (basic_block
) bb
->aux
;
1967 gimple_stmt_iterator si
;
1969 bool need_debug_cleanup
= false;
1971 /* Use the indices from the original blocks to create edges for the
1973 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1974 if (!(old_edge
->flags
& EDGE_EH
))
1978 flags
= old_edge
->flags
;
1980 /* Return edges do get a FALLTHRU flag when the get inlined. */
1981 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1982 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
1983 flags
|= EDGE_FALLTHRU
;
1984 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1985 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
1986 new_edge
->probability
= old_edge
->probability
;
1989 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1992 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
1995 bool can_throw
, nonlocal_goto
;
1997 copy_stmt
= gsi_stmt (si
);
1998 if (!is_gimple_debug (copy_stmt
))
1999 update_stmt (copy_stmt
);
2001 /* Do this before the possible split_block. */
2004 /* If this tree could throw an exception, there are two
2005 cases where we need to add abnormal edge(s): the
2006 tree wasn't in a region and there is a "current
2007 region" in the caller; or the original tree had
2008 EH edges. In both cases split the block after the tree,
2009 and add abnormal edge(s) as needed; we need both
2010 those from the callee and the caller.
2011 We check whether the copy can throw, because the const
2012 propagation can change an INDIRECT_REF which throws
2013 into a COMPONENT_REF which doesn't. If the copy
2014 can throw, the original could also throw. */
2015 can_throw
= stmt_can_throw_internal (copy_stmt
);
2016 nonlocal_goto
= stmt_can_make_abnormal_goto (copy_stmt
);
2018 if (can_throw
|| nonlocal_goto
)
2020 if (!gsi_end_p (si
))
2022 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2025 need_debug_cleanup
= true;
2027 if (!gsi_end_p (si
))
2028 /* Note that bb's predecessor edges aren't necessarily
2029 right at this point; split_block doesn't care. */
2031 edge e
= split_block (new_bb
, copy_stmt
);
2034 new_bb
->aux
= e
->src
->aux
;
2035 si
= gsi_start_bb (new_bb
);
2039 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2040 make_eh_dispatch_edges (copy_stmt
);
2042 make_eh_edges (copy_stmt
);
2044 /* If the call we inline cannot make abnormal goto do not add
2045 additional abnormal edges but only retain those already present
2046 in the original function body. */
2047 nonlocal_goto
&= can_make_abnormal_goto
;
2049 make_abnormal_goto_edges (gimple_bb (copy_stmt
), true);
2051 if ((can_throw
|| nonlocal_goto
)
2052 && gimple_in_ssa_p (cfun
))
2053 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2054 can_throw
, nonlocal_goto
);
2056 return need_debug_cleanup
;
2059 /* Copy the PHIs. All blocks and edges are copied, some blocks
2060 was possibly split and new outgoing EH edges inserted.
2061 BB points to the block of original function and AUX pointers links
2062 the original and newly copied blocks. */
2065 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2067 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2070 gimple_stmt_iterator si
;
2072 bool inserted
= false;
2074 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2079 phi
= gsi_stmt (si
);
2080 res
= PHI_RESULT (phi
);
2082 if (!virtual_operand_p (res
))
2084 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2085 new_phi
= create_phi_node (new_res
, new_bb
);
2086 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2088 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2094 /* When doing partial cloning, we allow PHIs on the entry block
2095 as long as all the arguments are the same. Find any input
2096 edge to see argument to copy. */
2098 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2099 if (!old_edge
->src
->aux
)
2102 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2104 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2105 gcc_assert (new_arg
);
2106 /* With return slot optimization we can end up with
2107 non-gimple (foo *)&this->m, fix that here. */
2108 if (TREE_CODE (new_arg
) != SSA_NAME
2109 && TREE_CODE (new_arg
) != FUNCTION_DECL
2110 && !is_gimple_val (new_arg
))
2112 gimple_seq stmts
= NULL
;
2113 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2114 gsi_insert_seq_on_edge (new_edge
, stmts
);
2117 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2118 if (LOCATION_BLOCK (locus
))
2121 n
= (tree
*) pointer_map_contains (id
->decl_map
,
2122 LOCATION_BLOCK (locus
));
2125 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2127 locus
= LOCATION_LOCUS (locus
);
2130 locus
= LOCATION_LOCUS (locus
);
2132 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2137 /* Commit the delayed edge insertions. */
2139 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2140 gsi_commit_one_edge_insert (new_edge
, NULL
);
2144 /* Wrapper for remap_decl so it can be used as a callback. */
2147 remap_decl_1 (tree decl
, void *data
)
2149 return remap_decl (decl
, (copy_body_data
*) data
);
2152 /* Build struct function and associated datastructures for the new clone
2153 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2154 the cfun to the function of new_fndecl (and current_function_decl too). */
2157 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2159 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2160 gcov_type count_scale
;
2162 if (!DECL_ARGUMENTS (new_fndecl
))
2163 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2164 if (!DECL_RESULT (new_fndecl
))
2165 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2167 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2169 = GCOV_COMPUTE_SCALE (count
,
2170 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2172 count_scale
= REG_BR_PROB_BASE
;
2174 /* Register specific tree functions. */
2175 gimple_register_cfg_hooks ();
2177 /* Get clean struct function. */
2178 push_struct_function (new_fndecl
);
2180 /* We will rebuild these, so just sanity check that they are empty. */
2181 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2182 gcc_assert (cfun
->local_decls
== NULL
);
2183 gcc_assert (cfun
->cfg
== NULL
);
2184 gcc_assert (cfun
->decl
== new_fndecl
);
2186 /* Copy items we preserve during cloning. */
2187 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2188 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2189 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2190 cfun
->curr_properties
= src_cfun
->curr_properties
;
2191 cfun
->last_verified
= src_cfun
->last_verified
;
2192 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2193 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2194 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2195 cfun
->stdarg
= src_cfun
->stdarg
;
2196 cfun
->after_inlining
= src_cfun
->after_inlining
;
2197 cfun
->can_throw_non_call_exceptions
2198 = src_cfun
->can_throw_non_call_exceptions
;
2199 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2200 cfun
->returns_struct
= src_cfun
->returns_struct
;
2201 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2203 init_empty_tree_cfg ();
2205 profile_status_for_function (cfun
) = profile_status_for_function (src_cfun
);
2206 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2207 (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2209 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2210 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2211 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2212 (EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2214 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2215 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2217 init_eh_for_function ();
2219 if (src_cfun
->gimple_df
)
2221 init_tree_ssa (cfun
);
2222 cfun
->gimple_df
->in_ssa_p
= true;
2223 init_ssa_operands (cfun
);
2227 /* Helper function for copy_cfg_body. Move debug stmts from the end
2228 of NEW_BB to the beginning of successor basic blocks when needed. If the
2229 successor has multiple predecessors, reset them, otherwise keep
2233 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2237 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2240 || gsi_one_before_end_p (si
)
2241 || !(stmt_can_throw_internal (gsi_stmt (si
))
2242 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2245 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2247 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2248 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2249 while (is_gimple_debug (gsi_stmt (ssi
)))
2251 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2255 /* For the last edge move the debug stmts instead of copying
2257 if (ei_one_before_end_p (ei
))
2261 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2262 gimple_debug_bind_reset_value (stmt
);
2263 gsi_remove (&si
, false);
2264 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2268 if (gimple_debug_bind_p (stmt
))
2270 var
= gimple_debug_bind_get_var (stmt
);
2271 if (single_pred_p (e
->dest
))
2273 value
= gimple_debug_bind_get_value (stmt
);
2274 value
= unshare_expr (value
);
2278 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2280 else if (gimple_debug_source_bind_p (stmt
))
2282 var
= gimple_debug_source_bind_get_var (stmt
);
2283 value
= gimple_debug_source_bind_get_value (stmt
);
2284 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2288 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2289 id
->debug_stmts
.safe_push (new_stmt
);
2295 /* Make a copy of the sub-loops of SRC_PARENT and place them
2296 as siblings of DEST_PARENT. */
2299 copy_loops (copy_body_data
*id
,
2300 struct loop
*dest_parent
, struct loop
*src_parent
)
2302 struct loop
*src_loop
= src_parent
->inner
;
2305 if (!id
->blocks_to_copy
2306 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2308 struct loop
*dest_loop
= alloc_loop ();
2310 /* Assign the new loop its header and latch and associate
2311 those with the new loop. */
2312 if (src_loop
->header
!= NULL
)
2314 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2315 dest_loop
->header
->loop_father
= dest_loop
;
2317 if (src_loop
->latch
!= NULL
)
2319 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2320 dest_loop
->latch
->loop_father
= dest_loop
;
2323 /* Copy loop meta-data. */
2324 copy_loop_info (src_loop
, dest_loop
);
2326 /* Finally place it into the loop array and the loop tree. */
2327 place_new_loop (cfun
, dest_loop
);
2328 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2330 if (src_loop
->simduid
)
2332 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2333 cfun
->has_simduid_loops
= true;
2335 if (src_loop
->force_vect
)
2337 dest_loop
->force_vect
= true;
2338 cfun
->has_force_vect_loops
= true;
2342 copy_loops (id
, dest_loop
, src_loop
);
2344 src_loop
= src_loop
->next
;
2348 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2351 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2353 gimple_stmt_iterator si
;
2354 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2356 if (is_gimple_call (gsi_stmt (si
)))
2358 struct cgraph_edge
*edge
= cgraph_edge (id
->dst_node
, gsi_stmt (si
));
2360 cgraph_redirect_edge_call_stmt_to_callee (edge
);
2365 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2366 with each bb's frequency. Used when NODE has a 0-weight entry
2367 but we are about to inline it into a non-zero count call bb.
2368 See the comments for handle_missing_profiles() in predict.c for
2369 when this can happen for COMDATs. */
2372 freqs_to_counts (struct cgraph_node
*node
, gcov_type count
)
2377 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2379 FOR_ALL_BB_FN(bb
, fn
)
2381 bb
->count
= apply_scale (count
,
2382 GCOV_COMPUTE_SCALE (bb
->frequency
, BB_FREQ_MAX
));
2383 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2384 e
->count
= apply_probability (e
->src
->count
, e
->probability
);
2388 /* Make a copy of the body of FN so that it can be inserted inline in
2389 another function. Walks FN via CFG, returns new fndecl. */
2392 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2393 basic_block entry_block_map
, basic_block exit_block_map
,
2394 basic_block new_entry
)
2396 tree callee_fndecl
= id
->src_fn
;
2397 /* Original cfun for the callee, doesn't change. */
2398 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2399 struct function
*cfun_to_copy
;
2401 tree new_fndecl
= NULL
;
2402 bool need_debug_cleanup
= false;
2403 gcov_type count_scale
;
2405 int incoming_frequency
= 0;
2406 gcov_type incoming_count
= 0;
2408 /* This can happen for COMDAT routines that end up with 0 counts
2409 despite being called (see the comments for handle_missing_profiles()
2410 in predict.c as to why). Apply counts to the blocks in the callee
2411 before inlining, using the guessed edge frequencies, so that we don't
2412 end up with a 0-count inline body which can confuse downstream
2413 optimizations such as function splitting. */
2414 if (!ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
&& count
)
2416 /* Apply the larger of the call bb count and the total incoming
2417 call edge count to the callee. */
2418 gcov_type in_count
= 0;
2419 struct cgraph_edge
*in_edge
;
2420 for (in_edge
= id
->src_node
->callers
; in_edge
;
2421 in_edge
= in_edge
->next_caller
)
2422 in_count
+= in_edge
->count
;
2423 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2426 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2428 = GCOV_COMPUTE_SCALE (count
,
2429 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2431 count_scale
= REG_BR_PROB_BASE
;
2433 /* Register specific tree functions. */
2434 gimple_register_cfg_hooks ();
2436 /* If we are inlining just region of the function, make sure to connect new entry
2437 to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute
2438 frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and
2439 probabilities of edges incoming from nonduplicated region. */
2445 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2448 incoming_frequency
+= EDGE_FREQUENCY (e
);
2449 incoming_count
+= e
->count
;
2451 incoming_count
= apply_scale (incoming_count
, count_scale
);
2453 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2454 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2455 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2458 /* Must have a CFG here at this point. */
2459 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2460 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2462 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2464 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2465 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2466 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2467 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2469 /* Duplicate any exception-handling regions. */
2471 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2474 /* Use aux pointers to map the original blocks to copy. */
2475 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2476 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2478 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2481 new_bb
->loop_father
= entry_block_map
->loop_father
;
2484 last
= last_basic_block
;
2486 /* Now that we've duplicated the blocks, duplicate their edges. */
2487 bool can_make_abormal_goto
2488 = id
->gimple_call
&& stmt_can_make_abnormal_goto (id
->gimple_call
);
2489 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2490 if (!id
->blocks_to_copy
2491 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2492 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2493 can_make_abormal_goto
);
2497 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2498 e
->probability
= REG_BR_PROB_BASE
;
2499 e
->count
= incoming_count
;
2502 /* Duplicate the loop tree, if available and wanted. */
2503 if (loops_for_fn (src_cfun
) != NULL
2504 && current_loops
!= NULL
)
2506 copy_loops (id
, entry_block_map
->loop_father
,
2507 get_loop (src_cfun
, 0));
2508 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2509 loops_state_set (LOOPS_NEED_FIXUP
);
2512 /* If the loop tree in the source function needed fixup, mark the
2513 destination loop tree for fixup, too. */
2514 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2515 loops_state_set (LOOPS_NEED_FIXUP
);
2517 if (gimple_in_ssa_p (cfun
))
2518 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2519 if (!id
->blocks_to_copy
2520 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2521 copy_phis_for_bb (bb
, id
);
2523 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2526 if (need_debug_cleanup
2527 && bb
->index
!= ENTRY_BLOCK
2528 && bb
->index
!= EXIT_BLOCK
)
2529 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2530 /* Update call edge destinations. This can not be done before loop
2531 info is updated, because we may split basic blocks. */
2532 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2533 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2534 ((basic_block
)bb
->aux
)->aux
= NULL
;
2538 /* Zero out AUX fields of newly created block during EH edge
2540 for (; last
< last_basic_block
; last
++)
2542 if (need_debug_cleanup
)
2543 maybe_move_debug_stmts_to_successors (id
, BASIC_BLOCK (last
));
2544 BASIC_BLOCK (last
)->aux
= NULL
;
2545 /* Update call edge destinations. This can not be done before loop
2546 info is updated, because we may split basic blocks. */
2547 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2548 redirect_all_calls (id
, BASIC_BLOCK (last
));
2550 entry_block_map
->aux
= NULL
;
2551 exit_block_map
->aux
= NULL
;
2555 pointer_map_destroy (id
->eh_map
);
2562 /* Copy the debug STMT using ID. We deal with these statements in a
2563 special way: if any variable in their VALUE expression wasn't
2564 remapped yet, we won't remap it, because that would get decl uids
2565 out of sync, causing codegen differences between -g and -g0. If
2566 this arises, we drop the VALUE expression altogether. */
2569 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2572 struct walk_stmt_info wi
;
2574 if (gimple_block (stmt
))
2576 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (stmt
));
2577 gimple_set_block (stmt
, n
? *n
: id
->block
);
2580 /* Remap all the operands in COPY. */
2581 memset (&wi
, 0, sizeof (wi
));
2584 processing_debug_stmt
= 1;
2586 if (gimple_debug_source_bind_p (stmt
))
2587 t
= gimple_debug_source_bind_get_var (stmt
);
2589 t
= gimple_debug_bind_get_var (stmt
);
2591 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2592 && (n
= (tree
*) pointer_map_contains (id
->debug_map
, t
)))
2594 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2597 else if (TREE_CODE (t
) == VAR_DECL
2598 && !is_global_var (t
)
2599 && !pointer_map_contains (id
->decl_map
, t
))
2600 /* T is a non-localized variable. */;
2602 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2604 if (gimple_debug_bind_p (stmt
))
2606 gimple_debug_bind_set_var (stmt
, t
);
2608 if (gimple_debug_bind_has_value_p (stmt
))
2609 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2610 remap_gimple_op_r
, &wi
, NULL
);
2612 /* Punt if any decl couldn't be remapped. */
2613 if (processing_debug_stmt
< 0)
2614 gimple_debug_bind_reset_value (stmt
);
2616 else if (gimple_debug_source_bind_p (stmt
))
2618 gimple_debug_source_bind_set_var (stmt
, t
);
2619 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2620 remap_gimple_op_r
, &wi
, NULL
);
2621 /* When inlining and source bind refers to one of the optimized
2622 away parameters, change the source bind into normal debug bind
2623 referring to the corresponding DEBUG_EXPR_DECL that should have
2624 been bound before the call stmt. */
2625 t
= gimple_debug_source_bind_get_value (stmt
);
2627 && TREE_CODE (t
) == PARM_DECL
2630 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2632 if (debug_args
!= NULL
)
2634 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2635 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2636 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2638 t
= (**debug_args
)[i
+ 1];
2639 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2640 gimple_debug_bind_set_value (stmt
, t
);
2647 processing_debug_stmt
= 0;
2652 /* Process deferred debug stmts. In order to give values better odds
2653 of being successfully remapped, we delay the processing of debug
2654 stmts until all other stmts that might require remapping are
2658 copy_debug_stmts (copy_body_data
*id
)
2663 if (!id
->debug_stmts
.exists ())
2666 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2667 copy_debug_stmt (stmt
, id
);
2669 id
->debug_stmts
.release ();
2672 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2673 another function. */
2676 copy_tree_body (copy_body_data
*id
)
2678 tree fndecl
= id
->src_fn
;
2679 tree body
= DECL_SAVED_TREE (fndecl
);
2681 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2686 /* Make a copy of the body of FN so that it can be inserted inline in
2687 another function. */
2690 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2691 basic_block entry_block_map
, basic_block exit_block_map
,
2692 basic_block new_entry
)
2694 tree fndecl
= id
->src_fn
;
2697 /* If this body has a CFG, walk CFG and copy. */
2698 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2699 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2701 copy_debug_stmts (id
);
2706 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2707 defined in function FN, or of a data member thereof. */
2710 self_inlining_addr_expr (tree value
, tree fn
)
2714 if (TREE_CODE (value
) != ADDR_EXPR
)
2717 var
= get_base_address (TREE_OPERAND (value
, 0));
2719 return var
&& auto_var_in_fn_p (var
, fn
);
2722 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2723 lexical block and line number information from base_stmt, if given,
2724 or from the last stmt of the block otherwise. */
2727 insert_init_debug_bind (copy_body_data
*id
,
2728 basic_block bb
, tree var
, tree value
,
2732 gimple_stmt_iterator gsi
;
2735 if (!gimple_in_ssa_p (id
->src_cfun
))
2738 if (!MAY_HAVE_DEBUG_STMTS
)
2741 tracked_var
= target_for_debug_bind (var
);
2747 gsi
= gsi_last_bb (bb
);
2748 if (!base_stmt
&& !gsi_end_p (gsi
))
2749 base_stmt
= gsi_stmt (gsi
);
2752 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2756 if (!gsi_end_p (gsi
))
2757 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2759 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2766 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2768 /* If VAR represents a zero-sized variable, it's possible that the
2769 assignment statement may result in no gimple statements. */
2772 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2774 /* We can end up with init statements that store to a non-register
2775 from a rhs with a conversion. Handle that here by forcing the
2776 rhs into a temporary. gimple_regimplify_operands is not
2777 prepared to do this for us. */
2778 if (!is_gimple_debug (init_stmt
)
2779 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2780 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2781 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2783 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2784 gimple_expr_type (init_stmt
),
2785 gimple_assign_rhs1 (init_stmt
));
2786 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2788 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2789 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2791 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2792 gimple_regimplify_operands (init_stmt
, &si
);
2794 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2796 tree def
= gimple_assign_lhs (init_stmt
);
2797 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2802 /* Initialize parameter P with VALUE. If needed, produce init statement
2803 at the end of BB. When BB is NULL, we return init statement to be
2806 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2807 basic_block bb
, tree
*vars
)
2809 gimple init_stmt
= NULL
;
2812 tree def
= (gimple_in_ssa_p (cfun
)
2813 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2816 && value
!= error_mark_node
2817 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2819 /* If we can match up types by promotion/demotion do so. */
2820 if (fold_convertible_p (TREE_TYPE (p
), value
))
2821 rhs
= fold_convert (TREE_TYPE (p
), value
);
2824 /* ??? For valid programs we should not end up here.
2825 Still if we end up with truly mismatched types here, fall back
2826 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2827 GIMPLE to the following passes. */
2828 if (!is_gimple_reg_type (TREE_TYPE (value
))
2829 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2830 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2832 rhs
= build_zero_cst (TREE_TYPE (p
));
2836 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2837 here since the type of this decl must be visible to the calling
2839 var
= copy_decl_to_var (p
, id
);
2841 /* Declare this new variable. */
2842 DECL_CHAIN (var
) = *vars
;
2845 /* Make gimplifier happy about this variable. */
2846 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2848 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2849 we would not need to create a new variable here at all, if it
2850 weren't for debug info. Still, we can just use the argument
2852 if (TREE_READONLY (p
)
2853 && !TREE_ADDRESSABLE (p
)
2854 && value
&& !TREE_SIDE_EFFECTS (value
)
2857 /* We may produce non-gimple trees by adding NOPs or introduce
2858 invalid sharing when operand is not really constant.
2859 It is not big deal to prohibit constant propagation here as
2860 we will constant propagate in DOM1 pass anyway. */
2861 if (is_gimple_min_invariant (value
)
2862 && useless_type_conversion_p (TREE_TYPE (p
),
2864 /* We have to be very careful about ADDR_EXPR. Make sure
2865 the base variable isn't a local variable of the inlined
2866 function, e.g., when doing recursive inlining, direct or
2867 mutually-recursive or whatever, which is why we don't
2868 just test whether fn == current_function_decl. */
2869 && ! self_inlining_addr_expr (value
, fn
))
2871 insert_decl_map (id
, p
, value
);
2872 insert_debug_decl_map (id
, p
, var
);
2873 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2877 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2878 that way, when the PARM_DECL is encountered, it will be
2879 automatically replaced by the VAR_DECL. */
2880 insert_decl_map (id
, p
, var
);
2882 /* Even if P was TREE_READONLY, the new VAR should not be.
2883 In the original code, we would have constructed a
2884 temporary, and then the function body would have never
2885 changed the value of P. However, now, we will be
2886 constructing VAR directly. The constructor body may
2887 change its value multiple times as it is being
2888 constructed. Therefore, it must not be TREE_READONLY;
2889 the back-end assumes that TREE_READONLY variable is
2890 assigned to only once. */
2891 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2892 TREE_READONLY (var
) = 0;
2894 /* If there is no setup required and we are in SSA, take the easy route
2895 replacing all SSA names representing the function parameter by the
2896 SSA name passed to function.
2898 We need to construct map for the variable anyway as it might be used
2899 in different SSA names when parameter is set in function.
2901 Do replacement at -O0 for const arguments replaced by constant.
2902 This is important for builtin_constant_p and other construct requiring
2903 constant argument to be visible in inlined function body. */
2904 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2906 || (TREE_READONLY (p
)
2907 && is_gimple_min_invariant (rhs
)))
2908 && (TREE_CODE (rhs
) == SSA_NAME
2909 || is_gimple_min_invariant (rhs
))
2910 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2912 insert_decl_map (id
, def
, rhs
);
2913 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2916 /* If the value of argument is never used, don't care about initializing
2918 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2920 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2921 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2924 /* Initialize this VAR_DECL from the equivalent argument. Convert
2925 the argument to the proper type in case it was promoted. */
2928 if (rhs
== error_mark_node
)
2930 insert_decl_map (id
, p
, var
);
2931 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
2934 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2936 /* If we are in SSA form properly remap the default definition
2937 or assign to a dummy SSA name if the parameter is unused and
2938 we are not optimizing. */
2939 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2943 def
= remap_ssa_name (def
, id
);
2944 init_stmt
= gimple_build_assign (def
, rhs
);
2945 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2946 set_ssa_default_def (cfun
, var
, NULL
);
2950 def
= make_ssa_name (var
, NULL
);
2951 init_stmt
= gimple_build_assign (def
, rhs
);
2955 init_stmt
= gimple_build_assign (var
, rhs
);
2957 if (bb
&& init_stmt
)
2958 insert_init_stmt (id
, bb
, init_stmt
);
2963 /* Generate code to initialize the parameters of the function at the
2964 top of the stack in ID from the GIMPLE_CALL STMT. */
2967 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2968 tree fn
, basic_block bb
)
2973 tree vars
= NULL_TREE
;
2974 tree static_chain
= gimple_call_chain (stmt
);
2976 /* Figure out what the parameters are. */
2977 parms
= DECL_ARGUMENTS (fn
);
2979 /* Loop through the parameter declarations, replacing each with an
2980 equivalent VAR_DECL, appropriately initialized. */
2981 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2984 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2985 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2987 /* After remapping parameters remap their types. This has to be done
2988 in a second loop over all parameters to appropriately remap
2989 variable sized arrays when the size is specified in a
2990 parameter following the array. */
2991 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
2993 tree
*varp
= (tree
*) pointer_map_contains (id
->decl_map
, p
);
2995 && TREE_CODE (*varp
) == VAR_DECL
)
2997 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
2998 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3000 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3001 /* Also remap the default definition if it was remapped
3002 to the default definition of the parameter replacement
3003 by the parameter setup. */
3006 tree
*defp
= (tree
*) pointer_map_contains (id
->decl_map
, def
);
3008 && TREE_CODE (*defp
) == SSA_NAME
3009 && SSA_NAME_VAR (*defp
) == var
)
3010 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3015 /* Initialize the static chain. */
3016 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3017 gcc_assert (fn
!= current_function_decl
);
3020 /* No static chain? Seems like a bug in tree-nested.c. */
3021 gcc_assert (static_chain
);
3023 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3026 declare_inline_vars (id
->block
, vars
);
3030 /* Declare a return variable to replace the RESULT_DECL for the
3031 function we are calling. An appropriate DECL_STMT is returned.
3032 The USE_STMT is filled to contain a use of the declaration to
3033 indicate the return value of the function.
3035 RETURN_SLOT, if non-null is place where to store the result. It
3036 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3037 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3039 The return value is a (possibly null) value that holds the result
3040 as seen by the caller. */
3043 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3044 basic_block entry_bb
)
3046 tree callee
= id
->src_fn
;
3047 tree result
= DECL_RESULT (callee
);
3048 tree callee_type
= TREE_TYPE (result
);
3052 /* Handle type-mismatches in the function declaration return type
3053 vs. the call expression. */
3055 caller_type
= TREE_TYPE (modify_dest
);
3057 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3059 /* We don't need to do anything for functions that don't return anything. */
3060 if (VOID_TYPE_P (callee_type
))
3063 /* If there was a return slot, then the return value is the
3064 dereferenced address of that object. */
3067 /* The front end shouldn't have used both return_slot and
3068 a modify expression. */
3069 gcc_assert (!modify_dest
);
3070 if (DECL_BY_REFERENCE (result
))
3072 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3073 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3075 /* We are going to construct *&return_slot and we can't do that
3076 for variables believed to be not addressable.
3078 FIXME: This check possibly can match, because values returned
3079 via return slot optimization are not believed to have address
3080 taken by alias analysis. */
3081 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3082 var
= return_slot_addr
;
3087 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3088 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
3090 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3091 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3092 && !DECL_GIMPLE_REG_P (result
)
3094 DECL_GIMPLE_REG_P (var
) = 0;
3099 /* All types requiring non-trivial constructors should have been handled. */
3100 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3102 /* Attempt to avoid creating a new temporary variable. */
3104 && TREE_CODE (modify_dest
) != SSA_NAME
)
3106 bool use_it
= false;
3108 /* We can't use MODIFY_DEST if there's type promotion involved. */
3109 if (!useless_type_conversion_p (callee_type
, caller_type
))
3112 /* ??? If we're assigning to a variable sized type, then we must
3113 reuse the destination variable, because we've no good way to
3114 create variable sized temporaries at this point. */
3115 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3118 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3119 reuse it as the result of the call directly. Don't do this if
3120 it would promote MODIFY_DEST to addressable. */
3121 else if (TREE_ADDRESSABLE (result
))
3125 tree base_m
= get_base_address (modify_dest
);
3127 /* If the base isn't a decl, then it's a pointer, and we don't
3128 know where that's going to go. */
3129 if (!DECL_P (base_m
))
3131 else if (is_global_var (base_m
))
3133 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3134 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3135 && !DECL_GIMPLE_REG_P (result
)
3136 && DECL_GIMPLE_REG_P (base_m
))
3138 else if (!TREE_ADDRESSABLE (base_m
))
3150 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3152 var
= copy_result_decl_to_var (result
, id
);
3153 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3155 /* Do not have the rest of GCC warn about this variable as it should
3156 not be visible to the user. */
3157 TREE_NO_WARNING (var
) = 1;
3159 declare_inline_vars (id
->block
, var
);
3161 /* Build the use expr. If the return type of the function was
3162 promoted, convert it back to the expected type. */
3164 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3166 /* If we can match up types by promotion/demotion do so. */
3167 if (fold_convertible_p (caller_type
, var
))
3168 use
= fold_convert (caller_type
, var
);
3171 /* ??? For valid programs we should not end up here.
3172 Still if we end up with truly mismatched types here, fall back
3173 to using a MEM_REF to not leak invalid GIMPLE to the following
3175 /* Prevent var from being written into SSA form. */
3176 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3177 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3178 DECL_GIMPLE_REG_P (var
) = false;
3179 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3180 TREE_ADDRESSABLE (var
) = true;
3181 use
= fold_build2 (MEM_REF
, caller_type
,
3182 build_fold_addr_expr (var
),
3183 build_int_cst (ptr_type_node
, 0));
3187 STRIP_USELESS_TYPE_CONVERSION (use
);
3189 if (DECL_BY_REFERENCE (result
))
3191 TREE_ADDRESSABLE (var
) = 1;
3192 var
= build_fold_addr_expr (var
);
3196 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3197 way, when the RESULT_DECL is encountered, it will be
3198 automatically replaced by the VAR_DECL.
3200 When returning by reference, ensure that RESULT_DECL remaps to
3202 if (DECL_BY_REFERENCE (result
)
3203 && !is_gimple_val (var
))
3205 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3206 insert_decl_map (id
, result
, temp
);
3207 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3208 it's default_def SSA_NAME. */
3209 if (gimple_in_ssa_p (id
->src_cfun
)
3210 && is_gimple_reg (result
))
3212 temp
= make_ssa_name (temp
, NULL
);
3213 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3215 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3218 insert_decl_map (id
, result
, var
);
3220 /* Remember this so we can ignore it in remap_decls. */
3226 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3227 to a local label. */
3230 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3233 tree fn
= (tree
) fnp
;
3235 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3244 /* Determine if the function can be copied. If so return NULL. If
3245 not return a string describng the reason for failure. */
3248 copy_forbidden (struct function
*fun
, tree fndecl
)
3250 const char *reason
= fun
->cannot_be_copied_reason
;
3254 /* Only examine the function once. */
3255 if (fun
->cannot_be_copied_set
)
3258 /* We cannot copy a function that receives a non-local goto
3259 because we cannot remap the destination label used in the
3260 function that is performing the non-local goto. */
3261 /* ??? Actually, this should be possible, if we work at it.
3262 No doubt there's just a handful of places that simply
3263 assume it doesn't happen and don't substitute properly. */
3264 if (fun
->has_nonlocal_label
)
3266 reason
= G_("function %q+F can never be copied "
3267 "because it receives a non-local goto");
3271 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3272 if (TREE_CODE (decl
) == VAR_DECL
3273 && TREE_STATIC (decl
)
3274 && !DECL_EXTERNAL (decl
)
3275 && DECL_INITIAL (decl
)
3276 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3277 has_label_address_in_static_1
,
3280 reason
= G_("function %q+F can never be copied because it saves "
3281 "address of local label in a static variable");
3286 fun
->cannot_be_copied_reason
= reason
;
3287 fun
->cannot_be_copied_set
= true;
3292 static const char *inline_forbidden_reason
;
3294 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3295 iff a function can not be inlined. Also sets the reason why. */
3298 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3299 struct walk_stmt_info
*wip
)
3301 tree fn
= (tree
) wip
->info
;
3303 gimple stmt
= gsi_stmt (*gsi
);
3305 switch (gimple_code (stmt
))
3308 /* Refuse to inline alloca call unless user explicitly forced so as
3309 this may change program's memory overhead drastically when the
3310 function using alloca is called in loop. In GCC present in
3311 SPEC2000 inlining into schedule_block cause it to require 2GB of
3312 RAM instead of 256MB. Don't do so for alloca calls emitted for
3313 VLA objects as those can't cause unbounded growth (they're always
3314 wrapped inside stack_save/stack_restore regions. */
3315 if (gimple_alloca_call_p (stmt
)
3316 && !gimple_call_alloca_for_var_p (stmt
)
3317 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3319 inline_forbidden_reason
3320 = G_("function %q+F can never be inlined because it uses "
3321 "alloca (override using the always_inline attribute)");
3322 *handled_ops_p
= true;
3326 t
= gimple_call_fndecl (stmt
);
3330 /* We cannot inline functions that call setjmp. */
3331 if (setjmp_call_p (t
))
3333 inline_forbidden_reason
3334 = G_("function %q+F can never be inlined because it uses setjmp");
3335 *handled_ops_p
= true;
3339 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3340 switch (DECL_FUNCTION_CODE (t
))
3342 /* We cannot inline functions that take a variable number of
3344 case BUILT_IN_VA_START
:
3345 case BUILT_IN_NEXT_ARG
:
3346 case BUILT_IN_VA_END
:
3347 inline_forbidden_reason
3348 = G_("function %q+F can never be inlined because it "
3349 "uses variable argument lists");
3350 *handled_ops_p
= true;
3353 case BUILT_IN_LONGJMP
:
3354 /* We can't inline functions that call __builtin_longjmp at
3355 all. The non-local goto machinery really requires the
3356 destination be in a different function. If we allow the
3357 function calling __builtin_longjmp to be inlined into the
3358 function calling __builtin_setjmp, Things will Go Awry. */
3359 inline_forbidden_reason
3360 = G_("function %q+F can never be inlined because "
3361 "it uses setjmp-longjmp exception handling");
3362 *handled_ops_p
= true;
3365 case BUILT_IN_NONLOCAL_GOTO
:
3367 inline_forbidden_reason
3368 = G_("function %q+F can never be inlined because "
3369 "it uses non-local goto");
3370 *handled_ops_p
= true;
3373 case BUILT_IN_RETURN
:
3374 case BUILT_IN_APPLY_ARGS
:
3375 /* If a __builtin_apply_args caller would be inlined,
3376 it would be saving arguments of the function it has
3377 been inlined into. Similarly __builtin_return would
3378 return from the function the inline has been inlined into. */
3379 inline_forbidden_reason
3380 = G_("function %q+F can never be inlined because "
3381 "it uses __builtin_return or __builtin_apply_args");
3382 *handled_ops_p
= true;
3391 t
= gimple_goto_dest (stmt
);
3393 /* We will not inline a function which uses computed goto. The
3394 addresses of its local labels, which may be tucked into
3395 global storage, are of course not constant across
3396 instantiations, which causes unexpected behavior. */
3397 if (TREE_CODE (t
) != LABEL_DECL
)
3399 inline_forbidden_reason
3400 = G_("function %q+F can never be inlined "
3401 "because it contains a computed goto");
3402 *handled_ops_p
= true;
3411 *handled_ops_p
= false;
3415 /* Return true if FNDECL is a function that cannot be inlined into
3419 inline_forbidden_p (tree fndecl
)
3421 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3422 struct walk_stmt_info wi
;
3423 struct pointer_set_t
*visited_nodes
;
3425 bool forbidden_p
= false;
3427 /* First check for shared reasons not to copy the code. */
3428 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3429 if (inline_forbidden_reason
!= NULL
)
3432 /* Next, walk the statements of the function looking for
3433 constraucts we can't handle, or are non-optimal for inlining. */
3434 visited_nodes
= pointer_set_create ();
3435 memset (&wi
, 0, sizeof (wi
));
3436 wi
.info
= (void *) fndecl
;
3437 wi
.pset
= visited_nodes
;
3439 FOR_EACH_BB_FN (bb
, fun
)
3442 gimple_seq seq
= bb_seq (bb
);
3443 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3444 forbidden_p
= (ret
!= NULL
);
3449 pointer_set_destroy (visited_nodes
);
3453 /* Return false if the function FNDECL cannot be inlined on account of its
3454 attributes, true otherwise. */
3456 function_attribute_inlinable_p (const_tree fndecl
)
3458 if (targetm
.attribute_table
)
3462 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3464 const_tree name
= TREE_PURPOSE (a
);
3467 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3468 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3469 return targetm
.function_attribute_inlinable_p (fndecl
);
3476 /* Returns nonzero if FN is a function that does not have any
3477 fundamental inline blocking properties. */
3480 tree_inlinable_function_p (tree fn
)
3482 bool inlinable
= true;
3486 /* If we've already decided this function shouldn't be inlined,
3487 there's no need to check again. */
3488 if (DECL_UNINLINABLE (fn
))
3491 /* We only warn for functions declared `inline' by the user. */
3492 do_warning
= (warn_inline
3493 && DECL_DECLARED_INLINE_P (fn
)
3494 && !DECL_NO_INLINE_WARNING_P (fn
)
3495 && !DECL_IN_SYSTEM_HEADER (fn
));
3497 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3500 && always_inline
== NULL
)
3503 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3504 "is suppressed using -fno-inline", fn
);
3508 else if (!function_attribute_inlinable_p (fn
))
3511 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3512 "uses attributes conflicting with inlining", fn
);
3516 else if (inline_forbidden_p (fn
))
3518 /* See if we should warn about uninlinable functions. Previously,
3519 some of these warnings would be issued while trying to expand
3520 the function inline, but that would cause multiple warnings
3521 about functions that would for example call alloca. But since
3522 this a property of the function, just one warning is enough.
3523 As a bonus we can now give more details about the reason why a
3524 function is not inlinable. */
3526 error (inline_forbidden_reason
, fn
);
3527 else if (do_warning
)
3528 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3533 /* Squirrel away the result so that we don't have to check again. */
3534 DECL_UNINLINABLE (fn
) = !inlinable
;
3539 /* Estimate the cost of a memory move. Use machine dependent
3540 word size and take possible memcpy call into account. */
3543 estimate_move_cost (tree type
)
3547 gcc_assert (!VOID_TYPE_P (type
));
3549 if (TREE_CODE (type
) == VECTOR_TYPE
)
3551 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3552 enum machine_mode simd
3553 = targetm
.vectorize
.preferred_simd_mode (inner
);
3554 int simd_mode_size
= GET_MODE_SIZE (simd
);
3555 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3559 size
= int_size_in_bytes (type
);
3561 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
3562 /* Cost of a memcpy call, 3 arguments and the call. */
3565 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3568 /* Returns cost of operation CODE, according to WEIGHTS */
3571 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3572 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3576 /* These are "free" conversions, or their presumed cost
3577 is folded into other operations. */
3582 case VIEW_CONVERT_EXPR
:
3585 /* Assign cost of 1 to usual operations.
3586 ??? We may consider mapping RTL costs to this. */
3592 case POINTER_PLUS_EXPR
:
3595 case MULT_HIGHPART_EXPR
:
3598 case ADDR_SPACE_CONVERT_EXPR
:
3599 case FIXED_CONVERT_EXPR
:
3600 case FIX_TRUNC_EXPR
:
3612 case VEC_LSHIFT_EXPR
:
3613 case VEC_RSHIFT_EXPR
:
3620 case TRUTH_ANDIF_EXPR
:
3621 case TRUTH_ORIF_EXPR
:
3622 case TRUTH_AND_EXPR
:
3624 case TRUTH_XOR_EXPR
:
3625 case TRUTH_NOT_EXPR
:
3634 case UNORDERED_EXPR
:
3645 case PREDECREMENT_EXPR
:
3646 case PREINCREMENT_EXPR
:
3647 case POSTDECREMENT_EXPR
:
3648 case POSTINCREMENT_EXPR
:
3650 case REALIGN_LOAD_EXPR
:
3652 case REDUC_MAX_EXPR
:
3653 case REDUC_MIN_EXPR
:
3654 case REDUC_PLUS_EXPR
:
3655 case WIDEN_SUM_EXPR
:
3656 case WIDEN_MULT_EXPR
:
3658 case WIDEN_MULT_PLUS_EXPR
:
3659 case WIDEN_MULT_MINUS_EXPR
:
3660 case WIDEN_LSHIFT_EXPR
:
3662 case VEC_WIDEN_MULT_HI_EXPR
:
3663 case VEC_WIDEN_MULT_LO_EXPR
:
3664 case VEC_WIDEN_MULT_EVEN_EXPR
:
3665 case VEC_WIDEN_MULT_ODD_EXPR
:
3666 case VEC_UNPACK_HI_EXPR
:
3667 case VEC_UNPACK_LO_EXPR
:
3668 case VEC_UNPACK_FLOAT_HI_EXPR
:
3669 case VEC_UNPACK_FLOAT_LO_EXPR
:
3670 case VEC_PACK_TRUNC_EXPR
:
3671 case VEC_PACK_SAT_EXPR
:
3672 case VEC_PACK_FIX_TRUNC_EXPR
:
3673 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3674 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3678 /* Few special cases of expensive operations. This is useful
3679 to avoid inlining on functions having too many of these. */
3680 case TRUNC_DIV_EXPR
:
3682 case FLOOR_DIV_EXPR
:
3683 case ROUND_DIV_EXPR
:
3684 case EXACT_DIV_EXPR
:
3685 case TRUNC_MOD_EXPR
:
3687 case FLOOR_MOD_EXPR
:
3688 case ROUND_MOD_EXPR
:
3690 if (TREE_CODE (op2
) != INTEGER_CST
)
3691 return weights
->div_mod_cost
;
3695 /* We expect a copy assignment with no operator. */
3696 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3702 /* Estimate number of instructions that will be created by expanding
3703 the statements in the statement sequence STMTS.
3704 WEIGHTS contains weights attributed to various constructs. */
3707 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3710 gimple_stmt_iterator gsi
;
3713 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3714 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3720 /* Estimate number of instructions that will be created by expanding STMT.
3721 WEIGHTS contains weights attributed to various constructs. */
3724 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3727 enum gimple_code code
= gimple_code (stmt
);
3734 /* Try to estimate the cost of assignments. We have three cases to
3736 1) Simple assignments to registers;
3737 2) Stores to things that must live in memory. This includes
3738 "normal" stores to scalars, but also assignments of large
3739 structures, or constructors of big arrays;
3741 Let us look at the first two cases, assuming we have "a = b + C":
3742 <GIMPLE_ASSIGN <var_decl "a">
3743 <plus_expr <var_decl "b"> <constant C>>
3744 If "a" is a GIMPLE register, the assignment to it is free on almost
3745 any target, because "a" usually ends up in a real register. Hence
3746 the only cost of this expression comes from the PLUS_EXPR, and we
3747 can ignore the GIMPLE_ASSIGN.
3748 If "a" is not a GIMPLE register, the assignment to "a" will most
3749 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3750 of moving something into "a", which we compute using the function
3751 estimate_move_cost. */
3752 if (gimple_clobber_p (stmt
))
3753 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3755 lhs
= gimple_assign_lhs (stmt
);
3756 rhs
= gimple_assign_rhs1 (stmt
);
3760 /* Account for the cost of moving to / from memory. */
3761 if (gimple_store_p (stmt
))
3762 cost
+= estimate_move_cost (TREE_TYPE (lhs
));
3763 if (gimple_assign_load_p (stmt
))
3764 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3766 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3767 gimple_assign_rhs1 (stmt
),
3768 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3769 == GIMPLE_BINARY_RHS
3770 ? gimple_assign_rhs2 (stmt
) : NULL
);
3774 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3775 gimple_op (stmt
, 0),
3776 gimple_op (stmt
, 1));
3780 /* Take into account cost of the switch + guess 2 conditional jumps for
3783 TODO: once the switch expansion logic is sufficiently separated, we can
3784 do better job on estimating cost of the switch. */
3785 if (weights
->time_based
)
3786 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3788 cost
= gimple_switch_num_labels (stmt
) * 2;
3793 tree decl
= gimple_call_fndecl (stmt
);
3794 struct cgraph_node
*node
= NULL
;
3796 /* Do not special case builtins where we see the body.
3797 This just confuse inliner. */
3798 if (!decl
|| !(node
= cgraph_get_node (decl
)) || node
->definition
)
3800 /* For buitins that are likely expanded to nothing or
3801 inlined do not account operand costs. */
3802 else if (is_simple_builtin (decl
))
3804 else if (is_inexpensive_builtin (decl
))
3805 return weights
->target_builtin_call_cost
;
3806 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3808 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3809 specialize the cheap expansion we do here.
3810 ??? This asks for a more general solution. */
3811 switch (DECL_FUNCTION_CODE (decl
))
3816 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3817 && REAL_VALUES_EQUAL
3818 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3819 return estimate_operator_cost (MULT_EXPR
, weights
,
3820 gimple_call_arg (stmt
, 0),
3821 gimple_call_arg (stmt
, 0));
3829 cost
= node
? weights
->call_cost
: weights
->indirect_call_cost
;
3830 if (gimple_call_lhs (stmt
))
3831 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)));
3832 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3834 tree arg
= gimple_call_arg (stmt
, i
);
3835 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3841 return weights
->return_cost
;
3847 case GIMPLE_PREDICT
:
3853 int count
= asm_str_count (gimple_asm_string (stmt
));
3854 /* 1000 means infinity. This avoids overflows later
3855 with very long asm statements. */
3862 /* This is either going to be an external function call with one
3863 argument, or two register copy statements plus a goto. */
3866 case GIMPLE_EH_DISPATCH
:
3867 /* ??? This is going to turn into a switch statement. Ideally
3868 we'd have a look at the eh region and estimate the number of
3873 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3875 case GIMPLE_EH_FILTER
:
3876 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3879 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3882 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3883 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3885 /* OpenMP directives are generally very expensive. */
3887 case GIMPLE_OMP_RETURN
:
3888 case GIMPLE_OMP_SECTIONS_SWITCH
:
3889 case GIMPLE_OMP_ATOMIC_STORE
:
3890 case GIMPLE_OMP_CONTINUE
:
3891 /* ...except these, which are cheap. */
3894 case GIMPLE_OMP_ATOMIC_LOAD
:
3895 return weights
->omp_cost
;
3897 case GIMPLE_OMP_FOR
:
3898 return (weights
->omp_cost
3899 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3900 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3902 case GIMPLE_OMP_PARALLEL
:
3903 case GIMPLE_OMP_TASK
:
3904 case GIMPLE_OMP_CRITICAL
:
3905 case GIMPLE_OMP_MASTER
:
3906 case GIMPLE_OMP_TASKGROUP
:
3907 case GIMPLE_OMP_ORDERED
:
3908 case GIMPLE_OMP_SECTION
:
3909 case GIMPLE_OMP_SECTIONS
:
3910 case GIMPLE_OMP_SINGLE
:
3911 case GIMPLE_OMP_TARGET
:
3912 case GIMPLE_OMP_TEAMS
:
3913 return (weights
->omp_cost
3914 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3916 case GIMPLE_TRANSACTION
:
3917 return (weights
->tm_cost
3918 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
3928 /* Estimate number of instructions that will be created by expanding
3929 function FNDECL. WEIGHTS contains weights attributed to various
3933 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3935 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3936 gimple_stmt_iterator bsi
;
3940 gcc_assert (my_function
&& my_function
->cfg
);
3941 FOR_EACH_BB_FN (bb
, my_function
)
3943 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3944 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3951 /* Initializes weights used by estimate_num_insns. */
3954 init_inline_once (void)
3956 eni_size_weights
.call_cost
= 1;
3957 eni_size_weights
.indirect_call_cost
= 3;
3958 eni_size_weights
.target_builtin_call_cost
= 1;
3959 eni_size_weights
.div_mod_cost
= 1;
3960 eni_size_weights
.omp_cost
= 40;
3961 eni_size_weights
.tm_cost
= 10;
3962 eni_size_weights
.time_based
= false;
3963 eni_size_weights
.return_cost
= 1;
3965 /* Estimating time for call is difficult, since we have no idea what the
3966 called function does. In the current uses of eni_time_weights,
3967 underestimating the cost does less harm than overestimating it, so
3968 we choose a rather small value here. */
3969 eni_time_weights
.call_cost
= 10;
3970 eni_time_weights
.indirect_call_cost
= 15;
3971 eni_time_weights
.target_builtin_call_cost
= 1;
3972 eni_time_weights
.div_mod_cost
= 10;
3973 eni_time_weights
.omp_cost
= 40;
3974 eni_time_weights
.tm_cost
= 40;
3975 eni_time_weights
.time_based
= true;
3976 eni_time_weights
.return_cost
= 2;
3979 /* Estimate the number of instructions in a gimple_seq. */
3982 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3984 gimple_stmt_iterator gsi
;
3986 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3987 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3993 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3996 prepend_lexical_block (tree current_block
, tree new_block
)
3998 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
3999 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4000 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4003 /* Add local variables from CALLEE to CALLER. */
4006 add_local_variables (struct function
*callee
, struct function
*caller
,
4012 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4013 if (!can_be_nonlocal (var
, id
))
4015 tree new_var
= remap_decl (var
, id
);
4017 /* Remap debug-expressions. */
4018 if (TREE_CODE (new_var
) == VAR_DECL
4019 && DECL_HAS_DEBUG_EXPR_P (var
)
4022 tree tem
= DECL_DEBUG_EXPR (var
);
4023 bool old_regimplify
= id
->regimplify
;
4024 id
->remapping_type_depth
++;
4025 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4026 id
->remapping_type_depth
--;
4027 id
->regimplify
= old_regimplify
;
4028 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4029 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4031 add_local_decl (caller
, new_var
);
4035 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4038 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
4042 struct pointer_map_t
*st
, *dst
;
4045 location_t saved_location
;
4046 struct cgraph_edge
*cg_edge
;
4047 cgraph_inline_failed_t reason
;
4048 basic_block return_block
;
4050 gimple_stmt_iterator gsi
, stmt_gsi
;
4051 bool successfully_inlined
= FALSE
;
4052 bool purge_dead_abnormal_edges
;
4054 /* Set input_location here so we get the right instantiation context
4055 if we call instantiate_decl from inlinable_function_p. */
4056 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
4057 saved_location
= input_location
;
4058 input_location
= gimple_location (stmt
);
4060 /* From here on, we're only interested in CALL_EXPRs. */
4061 if (gimple_code (stmt
) != GIMPLE_CALL
)
4064 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
4065 gcc_checking_assert (cg_edge
);
4066 /* First, see if we can figure out what function is being called.
4067 If we cannot, then there is no hope of inlining the function. */
4068 if (cg_edge
->indirect_unknown_callee
)
4070 fn
= cg_edge
->callee
->decl
;
4071 gcc_checking_assert (fn
);
4073 /* If FN is a declaration of a function in a nested scope that was
4074 globally declared inline, we don't set its DECL_INITIAL.
4075 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4076 C++ front-end uses it for cdtors to refer to their internal
4077 declarations, that are not real functions. Fortunately those
4078 don't have trees to be saved, so we can tell by checking their
4080 if (!DECL_INITIAL (fn
)
4081 && DECL_ABSTRACT_ORIGIN (fn
)
4082 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4083 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4085 /* Don't try to inline functions that are not well-suited to inlining. */
4086 if (cg_edge
->inline_failed
)
4088 reason
= cg_edge
->inline_failed
;
4089 /* If this call was originally indirect, we do not want to emit any
4090 inlining related warnings or sorry messages because there are no
4091 guarantees regarding those. */
4092 if (cg_edge
->indirect_inlining_edge
)
4095 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4096 /* For extern inline functions that get redefined we always
4097 silently ignored always_inline flag. Better behaviour would
4098 be to be able to keep both bodies and use extern inline body
4099 for inlining, but we can't do that because frontends overwrite
4101 && !cg_edge
->callee
->local
.redefined_extern_inline
4102 /* During early inline pass, report only when optimization is
4104 && (cgraph_global_info_ready
4106 /* PR 20090218-1_0.c. Body can be provided by another module. */
4107 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4109 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4110 cgraph_inline_failed_string (reason
));
4111 error ("called from here");
4113 else if (warn_inline
4114 && DECL_DECLARED_INLINE_P (fn
)
4115 && !DECL_NO_INLINE_WARNING_P (fn
)
4116 && !DECL_IN_SYSTEM_HEADER (fn
)
4117 && reason
!= CIF_UNSPECIFIED
4118 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4119 /* Do not warn about not inlined recursive calls. */
4120 && !cgraph_edge_recursive_p (cg_edge
)
4121 /* Avoid warnings during early inline pass. */
4122 && cgraph_global_info_ready
)
4124 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4125 fn
, _(cgraph_inline_failed_string (reason
)));
4126 warning (OPT_Winline
, "called from here");
4130 fn
= cg_edge
->callee
->decl
;
4131 cgraph_get_body (cg_edge
->callee
);
4133 #ifdef ENABLE_CHECKING
4134 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4135 verify_cgraph_node (cg_edge
->callee
);
4138 /* We will be inlining this callee. */
4139 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4141 /* Update the callers EH personality. */
4142 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4143 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4144 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4146 /* Split the block holding the GIMPLE_CALL. */
4147 e
= split_block (bb
, stmt
);
4149 return_block
= e
->dest
;
4152 /* split_block splits after the statement; work around this by
4153 moving the call into the second block manually. Not pretty,
4154 but seems easier than doing the CFG manipulation by hand
4155 when the GIMPLE_CALL is in the last statement of BB. */
4156 stmt_gsi
= gsi_last_bb (bb
);
4157 gsi_remove (&stmt_gsi
, false);
4159 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4160 been the source of abnormal edges. In this case, schedule
4161 the removal of dead abnormal edges. */
4162 gsi
= gsi_start_bb (return_block
);
4163 if (gsi_end_p (gsi
))
4165 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4166 purge_dead_abnormal_edges
= true;
4170 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4171 purge_dead_abnormal_edges
= false;
4174 stmt_gsi
= gsi_start_bb (return_block
);
4176 /* Build a block containing code to initialize the arguments, the
4177 actual inline expansion of the body, and a label for the return
4178 statements within the function to jump to. The type of the
4179 statement expression is the return type of the function call.
4180 ??? If the call does not have an associated block then we will
4181 remap all callee blocks to NULL, effectively dropping most of
4182 its debug information. This should only happen for calls to
4183 artificial decls inserted by the compiler itself. We need to
4184 either link the inlined blocks into the caller block tree or
4185 not refer to them in any way to not break GC for locations. */
4186 if (gimple_block (stmt
))
4188 id
->block
= make_node (BLOCK
);
4189 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4190 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
4191 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4194 /* Local declarations will be replaced by their equivalents in this
4197 id
->decl_map
= pointer_map_create ();
4198 dst
= id
->debug_map
;
4199 id
->debug_map
= NULL
;
4201 /* Record the function we are about to inline. */
4203 id
->src_node
= cg_edge
->callee
;
4204 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4205 id
->gimple_call
= stmt
;
4207 gcc_assert (!id
->src_cfun
->after_inlining
);
4210 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4212 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4213 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4217 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4219 if (DECL_INITIAL (fn
))
4221 if (gimple_block (stmt
))
4225 prepend_lexical_block (id
->block
,
4226 remap_blocks (DECL_INITIAL (fn
), id
));
4227 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4228 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4230 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4231 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4232 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4233 under it. The parameters can be then evaluated in the debugger,
4234 but don't show in backtraces. */
4235 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4236 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4239 *var
= TREE_CHAIN (v
);
4240 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4241 BLOCK_VARS (id
->block
) = v
;
4244 var
= &TREE_CHAIN (*var
);
4247 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4250 /* Return statements in the function body will be replaced by jumps
4251 to the RET_LABEL. */
4252 gcc_assert (DECL_INITIAL (fn
));
4253 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4255 /* Find the LHS to which the result of this call is assigned. */
4257 if (gimple_call_lhs (stmt
))
4259 modify_dest
= gimple_call_lhs (stmt
);
4261 /* The function which we are inlining might not return a value,
4262 in which case we should issue a warning that the function
4263 does not return a value. In that case the optimizers will
4264 see that the variable to which the value is assigned was not
4265 initialized. We do not want to issue a warning about that
4266 uninitialized variable. */
4267 if (DECL_P (modify_dest
))
4268 TREE_NO_WARNING (modify_dest
) = 1;
4270 if (gimple_call_return_slot_opt_p (stmt
))
4272 return_slot
= modify_dest
;
4279 /* If we are inlining a call to the C++ operator new, we don't want
4280 to use type based alias analysis on the return value. Otherwise
4281 we may get confused if the compiler sees that the inlined new
4282 function returns a pointer which was just deleted. See bug
4284 if (DECL_IS_OPERATOR_NEW (fn
))
4290 /* Declare the return variable for the function. */
4291 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4293 /* Add local vars in this inlined callee to caller. */
4294 add_local_variables (id
->src_cfun
, cfun
, id
);
4296 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4298 fprintf (dump_file
, "Inlining ");
4299 print_generic_expr (dump_file
, id
->src_fn
, 0);
4300 fprintf (dump_file
, " to ");
4301 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4302 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4305 /* This is it. Duplicate the callee body. Assume callee is
4306 pre-gimplified. Note that we must not alter the caller
4307 function in any way before this point, as this CALL_EXPR may be
4308 a self-referential call; if we're calling ourselves, we need to
4309 duplicate our body before altering anything. */
4310 copy_body (id
, bb
->count
,
4311 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4312 bb
, return_block
, NULL
);
4314 /* Reset the escaped solution. */
4315 if (cfun
->gimple_df
)
4316 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4321 pointer_map_destroy (id
->debug_map
);
4322 id
->debug_map
= dst
;
4324 pointer_map_destroy (id
->decl_map
);
4327 /* Unlink the calls virtual operands before replacing it. */
4328 unlink_stmt_vdef (stmt
);
4330 /* If the inlined function returns a result that we care about,
4331 substitute the GIMPLE_CALL with an assignment of the return
4332 variable to the LHS of the call. That is, if STMT was
4333 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4334 if (use_retvar
&& gimple_call_lhs (stmt
))
4336 gimple old_stmt
= stmt
;
4337 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4338 gsi_replace (&stmt_gsi
, stmt
, false);
4339 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4343 /* Handle the case of inlining a function with no return
4344 statement, which causes the return value to become undefined. */
4345 if (gimple_call_lhs (stmt
)
4346 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4348 tree name
= gimple_call_lhs (stmt
);
4349 tree var
= SSA_NAME_VAR (name
);
4350 tree def
= ssa_default_def (cfun
, var
);
4354 /* If the variable is used undefined, make this name
4355 undefined via a move. */
4356 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4357 gsi_replace (&stmt_gsi
, stmt
, true);
4361 /* Otherwise make this variable undefined. */
4362 gsi_remove (&stmt_gsi
, true);
4363 set_ssa_default_def (cfun
, var
, name
);
4364 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4368 gsi_remove (&stmt_gsi
, true);
4371 if (purge_dead_abnormal_edges
)
4373 gimple_purge_dead_eh_edges (return_block
);
4374 gimple_purge_dead_abnormal_call_edges (return_block
);
4377 /* If the value of the new expression is ignored, that's OK. We
4378 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4379 the equivalent inlined version either. */
4380 if (is_gimple_assign (stmt
))
4382 gcc_assert (gimple_assign_single_p (stmt
)
4383 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4384 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4387 /* Output the inlining info for this abstract function, since it has been
4388 inlined. If we don't do this now, we can lose the information about the
4389 variables in the function when the blocks get blown away as soon as we
4390 remove the cgraph node. */
4391 if (gimple_block (stmt
))
4392 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4394 /* Update callgraph if needed. */
4395 cgraph_remove_node (cg_edge
->callee
);
4397 id
->block
= NULL_TREE
;
4398 successfully_inlined
= TRUE
;
4401 input_location
= saved_location
;
4402 return successfully_inlined
;
4405 /* Expand call statements reachable from STMT_P.
4406 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4407 in a MODIFY_EXPR. */
4410 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4412 gimple_stmt_iterator gsi
;
4414 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4416 gimple stmt
= gsi_stmt (gsi
);
4418 if (is_gimple_call (stmt
)
4419 && expand_call_inline (bb
, stmt
, id
))
4427 /* Walk all basic blocks created after FIRST and try to fold every statement
4428 in the STATEMENTS pointer set. */
4431 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
4433 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4434 if (BASIC_BLOCK (first
))
4436 gimple_stmt_iterator gsi
;
4438 for (gsi
= gsi_start_bb (BASIC_BLOCK (first
));
4441 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
4443 gimple old_stmt
= gsi_stmt (gsi
);
4444 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4446 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4448 /* Folding builtins can create multiple instructions,
4449 we need to look at all of them. */
4450 gimple_stmt_iterator i2
= gsi
;
4452 if (fold_stmt (&gsi
))
4455 /* If a builtin at the end of a bb folded into nothing,
4456 the following loop won't work. */
4457 if (gsi_end_p (gsi
))
4459 cgraph_update_edges_for_call_stmt (old_stmt
,
4464 i2
= gsi_start_bb (BASIC_BLOCK (first
));
4469 new_stmt
= gsi_stmt (i2
);
4470 update_stmt (new_stmt
);
4471 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4474 if (new_stmt
== gsi_stmt (gsi
))
4476 /* It is okay to check only for the very last
4477 of these statements. If it is a throwing
4478 statement nothing will change. If it isn't
4479 this can remove EH edges. If that weren't
4480 correct then because some intermediate stmts
4481 throw, but not the last one. That would mean
4482 we'd have to split the block, which we can't
4483 here and we'd loose anyway. And as builtins
4484 probably never throw, this all
4486 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4488 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4495 else if (fold_stmt (&gsi
))
4497 /* Re-read the statement from GSI as fold_stmt() may
4499 gimple new_stmt
= gsi_stmt (gsi
);
4500 update_stmt (new_stmt
);
4502 if (is_gimple_call (old_stmt
)
4503 || is_gimple_call (new_stmt
))
4504 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4507 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4508 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
4514 /* Expand calls to inline functions in the body of FN. */
4517 optimize_inline_calls (tree fn
)
4521 int last
= n_basic_blocks_for_fn (cfun
);
4522 struct gimplify_ctx gctx
;
4523 bool inlined_p
= false;
4526 memset (&id
, 0, sizeof (id
));
4528 id
.src_node
= id
.dst_node
= cgraph_get_node (fn
);
4529 gcc_assert (id
.dst_node
->definition
);
4531 /* Or any functions that aren't finished yet. */
4532 if (current_function_decl
)
4533 id
.dst_fn
= current_function_decl
;
4535 id
.copy_decl
= copy_decl_maybe_to_var
;
4536 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4537 id
.transform_new_cfg
= false;
4538 id
.transform_return_to_modify
= true;
4539 id
.transform_parameter
= true;
4540 id
.transform_lang_insert_block
= NULL
;
4541 id
.statements_to_fold
= pointer_set_create ();
4543 push_gimplify_context (&gctx
);
4545 /* We make no attempts to keep dominance info up-to-date. */
4546 free_dominance_info (CDI_DOMINATORS
);
4547 free_dominance_info (CDI_POST_DOMINATORS
);
4549 /* Register specific gimple functions. */
4550 gimple_register_cfg_hooks ();
4552 /* Reach the trees by walking over the CFG, and note the
4553 enclosing basic-blocks in the call edges. */
4554 /* We walk the blocks going forward, because inlined function bodies
4555 will split id->current_basic_block, and the new blocks will
4556 follow it; we'll trudge through them, processing their CALL_EXPRs
4559 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4561 pop_gimplify_context (NULL
);
4563 #ifdef ENABLE_CHECKING
4565 struct cgraph_edge
*e
;
4567 verify_cgraph_node (id
.dst_node
);
4569 /* Double check that we inlined everything we are supposed to inline. */
4570 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4571 gcc_assert (e
->inline_failed
);
4575 /* Fold queued statements. */
4576 fold_marked_statements (last
, id
.statements_to_fold
);
4577 pointer_set_destroy (id
.statements_to_fold
);
4579 gcc_assert (!id
.debug_stmts
.exists ());
4581 /* If we didn't inline into the function there is nothing to do. */
4585 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4588 delete_unreachable_blocks_update_callgraph (&id
);
4589 #ifdef ENABLE_CHECKING
4590 verify_cgraph_node (id
.dst_node
);
4593 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4594 not possible yet - the IPA passes might make various functions to not
4595 throw and they don't care to proactively update local EH info. This is
4596 done later in fixup_cfg pass that also execute the verification. */
4597 return (TODO_update_ssa
4599 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4600 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4601 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
4604 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4607 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4609 enum tree_code code
= TREE_CODE (*tp
);
4610 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4612 /* We make copies of most nodes. */
4613 if (IS_EXPR_CODE_CLASS (cl
)
4614 || code
== TREE_LIST
4616 || code
== TYPE_DECL
4617 || code
== OMP_CLAUSE
)
4619 /* Because the chain gets clobbered when we make a copy, we save it
4621 tree chain
= NULL_TREE
, new_tree
;
4623 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4624 chain
= TREE_CHAIN (*tp
);
4626 /* Copy the node. */
4627 new_tree
= copy_node (*tp
);
4631 /* Now, restore the chain, if appropriate. That will cause
4632 walk_tree to walk into the chain as well. */
4633 if (code
== PARM_DECL
4634 || code
== TREE_LIST
4635 || code
== OMP_CLAUSE
)
4636 TREE_CHAIN (*tp
) = chain
;
4638 /* For now, we don't update BLOCKs when we make copies. So, we
4639 have to nullify all BIND_EXPRs. */
4640 if (TREE_CODE (*tp
) == BIND_EXPR
)
4641 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4643 else if (code
== CONSTRUCTOR
)
4645 /* CONSTRUCTOR nodes need special handling because
4646 we need to duplicate the vector of elements. */
4649 new_tree
= copy_node (*tp
);
4650 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
4653 else if (code
== STATEMENT_LIST
)
4654 /* We used to just abort on STATEMENT_LIST, but we can run into them
4655 with statement-expressions (c++/40975). */
4656 copy_statement_list (tp
);
4657 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4659 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4661 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4666 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4667 information indicating to what new SAVE_EXPR this one should be mapped,
4668 use that one. Otherwise, create a new node and enter it in ST. FN is
4669 the function into which the copy will be placed. */
4672 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
4674 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
4678 /* See if we already encountered this SAVE_EXPR. */
4679 n
= (tree
*) pointer_map_contains (st
, *tp
);
4681 /* If we didn't already remap this SAVE_EXPR, do so now. */
4684 t
= copy_node (*tp
);
4686 /* Remember this SAVE_EXPR. */
4687 *pointer_map_insert (st
, *tp
) = t
;
4688 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4689 *pointer_map_insert (st
, t
) = t
;
4693 /* We've already walked into this SAVE_EXPR; don't do it again. */
4698 /* Replace this SAVE_EXPR with the copy. */
4702 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4703 label, copies the declaration and enters it in the splay_tree in DATA (which
4704 is really a 'copy_body_data *'. */
4707 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4708 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4709 struct walk_stmt_info
*wi
)
4711 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4712 gimple stmt
= gsi_stmt (*gsip
);
4714 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4716 tree decl
= gimple_label_label (stmt
);
4718 /* Copy the decl and remember the copy. */
4719 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4726 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4727 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4728 remaps all local declarations to appropriate replacements in gimple
4732 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4734 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4735 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4736 struct pointer_map_t
*st
= id
->decl_map
;
4740 /* Only a local declaration (variable or label). */
4741 if ((TREE_CODE (expr
) == VAR_DECL
4742 && !TREE_STATIC (expr
))
4743 || TREE_CODE (expr
) == LABEL_DECL
)
4745 /* Lookup the declaration. */
4746 n
= (tree
*) pointer_map_contains (st
, expr
);
4748 /* If it's there, remap it. */
4753 else if (TREE_CODE (expr
) == STATEMENT_LIST
4754 || TREE_CODE (expr
) == BIND_EXPR
4755 || TREE_CODE (expr
) == SAVE_EXPR
)
4757 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4759 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4760 It's OK for this to happen if it was part of a subtree that
4761 isn't immediately expanded, such as operand 2 of another
4763 if (!TREE_OPERAND (expr
, 1))
4765 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4766 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4770 /* Keep iterating. */
4775 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4776 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4777 remaps all local declarations to appropriate replacements in gimple
4781 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4782 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4783 struct walk_stmt_info
*wi
)
4785 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4786 gimple stmt
= gsi_stmt (*gsip
);
4788 if (gimple_code (stmt
) == GIMPLE_BIND
)
4790 tree block
= gimple_bind_block (stmt
);
4794 remap_block (&block
, id
);
4795 gimple_bind_set_block (stmt
, block
);
4798 /* This will remap a lot of the same decls again, but this should be
4800 if (gimple_bind_vars (stmt
))
4801 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
4805 /* Keep iterating. */
4810 /* Copies everything in SEQ and replaces variables and labels local to
4811 current_function_decl. */
4814 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4817 struct walk_stmt_info wi
;
4818 struct pointer_set_t
*visited
;
4821 /* There's nothing to do for NULL_TREE. */
4826 memset (&id
, 0, sizeof (id
));
4827 id
.src_fn
= current_function_decl
;
4828 id
.dst_fn
= current_function_decl
;
4829 id
.decl_map
= pointer_map_create ();
4830 id
.debug_map
= NULL
;
4832 id
.copy_decl
= copy_decl_no_change
;
4833 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4834 id
.transform_new_cfg
= false;
4835 id
.transform_return_to_modify
= false;
4836 id
.transform_parameter
= false;
4837 id
.transform_lang_insert_block
= NULL
;
4839 /* Walk the tree once to find local labels. */
4840 memset (&wi
, 0, sizeof (wi
));
4841 visited
= pointer_set_create ();
4844 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4845 pointer_set_destroy (visited
);
4847 copy
= gimple_seq_copy (seq
);
4849 /* Walk the copy, remapping decls. */
4850 memset (&wi
, 0, sizeof (wi
));
4852 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4855 pointer_map_destroy (id
.decl_map
);
4857 pointer_map_destroy (id
.debug_map
);
4863 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4866 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4875 debug_find_tree (tree top
, tree search
)
4877 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4881 /* Declare the variables created by the inliner. Add all the variables in
4882 VARS to BIND_EXPR. */
4885 declare_inline_vars (tree block
, tree vars
)
4888 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
4890 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4891 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4892 add_local_decl (cfun
, t
);
4896 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4899 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4900 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4901 VAR_DECL translation. */
4904 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4906 /* Don't generate debug information for the copy if we wouldn't have
4907 generated it for the copy either. */
4908 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4909 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4911 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4912 declaration inspired this copy. */
4913 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4915 /* The new variable/label has no RTL, yet. */
4916 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4917 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4918 SET_DECL_RTL (copy
, 0);
4920 /* These args would always appear unused, if not for this. */
4921 TREE_USED (copy
) = 1;
4923 /* Set the context for the new declaration. */
4924 if (!DECL_CONTEXT (decl
))
4925 /* Globals stay global. */
4927 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4928 /* Things that weren't in the scope of the function we're inlining
4929 from aren't in the scope we're inlining to, either. */
4931 else if (TREE_STATIC (decl
))
4932 /* Function-scoped static variables should stay in the original
4936 /* Ordinary automatic local variables are now in the scope of the
4938 DECL_CONTEXT (copy
) = id
->dst_fn
;
4944 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4948 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4949 || TREE_CODE (decl
) == RESULT_DECL
);
4951 type
= TREE_TYPE (decl
);
4953 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4954 VAR_DECL
, DECL_NAME (decl
), type
);
4955 if (DECL_PT_UID_SET_P (decl
))
4956 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4957 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4958 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4959 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4960 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4962 return copy_decl_for_dup_finish (id
, decl
, copy
);
4965 /* Like copy_decl_to_var, but create a return slot object instead of a
4966 pointer variable for return by invisible reference. */
4969 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4973 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4974 || TREE_CODE (decl
) == RESULT_DECL
);
4976 type
= TREE_TYPE (decl
);
4977 if (DECL_BY_REFERENCE (decl
))
4978 type
= TREE_TYPE (type
);
4980 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4981 VAR_DECL
, DECL_NAME (decl
), type
);
4982 if (DECL_PT_UID_SET_P (decl
))
4983 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
4984 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4985 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4986 if (!DECL_BY_REFERENCE (decl
))
4988 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4989 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4992 return copy_decl_for_dup_finish (id
, decl
, copy
);
4996 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5000 copy
= copy_node (decl
);
5002 /* The COPY is not abstract; it will be generated in DST_FN. */
5003 DECL_ABSTRACT (copy
) = 0;
5004 lang_hooks
.dup_lang_specific_decl (copy
);
5006 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5007 been taken; it's for internal bookkeeping in expand_goto_internal. */
5008 if (TREE_CODE (copy
) == LABEL_DECL
)
5010 TREE_ADDRESSABLE (copy
) = 0;
5011 LABEL_DECL_UID (copy
) = -1;
5014 return copy_decl_for_dup_finish (id
, decl
, copy
);
5018 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5020 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5021 return copy_decl_to_var (decl
, id
);
5023 return copy_decl_no_change (decl
, id
);
5026 /* Return a copy of the function's argument tree. */
5028 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5029 bitmap args_to_skip
, tree
*vars
)
5032 tree new_parm
= NULL
;
5037 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5038 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5040 tree new_tree
= remap_decl (arg
, id
);
5041 if (TREE_CODE (new_tree
) != PARM_DECL
)
5042 new_tree
= id
->copy_decl (arg
, id
);
5043 lang_hooks
.dup_lang_specific_decl (new_tree
);
5045 parg
= &DECL_CHAIN (new_tree
);
5047 else if (!pointer_map_contains (id
->decl_map
, arg
))
5049 /* Make an equivalent VAR_DECL. If the argument was used
5050 as temporary variable later in function, the uses will be
5051 replaced by local variable. */
5052 tree var
= copy_decl_to_var (arg
, id
);
5053 insert_decl_map (id
, arg
, var
);
5054 /* Declare this new variable. */
5055 DECL_CHAIN (var
) = *vars
;
5061 /* Return a copy of the function's static chain. */
5063 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5065 tree
*chain_copy
, *pvar
;
5067 chain_copy
= &static_chain
;
5068 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5070 tree new_tree
= remap_decl (*pvar
, id
);
5071 lang_hooks
.dup_lang_specific_decl (new_tree
);
5072 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5075 return static_chain
;
5078 /* Return true if the function is allowed to be versioned.
5079 This is a guard for the versioning functionality. */
5082 tree_versionable_function_p (tree fndecl
)
5084 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5085 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
5088 /* Delete all unreachable basic blocks and update callgraph.
5089 Doing so is somewhat nontrivial because we need to update all clones and
5090 remove inline function that become unreachable. */
5093 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5095 bool changed
= false;
5096 basic_block b
, next_bb
;
5098 find_unreachable_blocks ();
5100 /* Delete all unreachable basic blocks. */
5102 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5103 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5105 next_bb
= b
->next_bb
;
5107 if (!(b
->flags
& BB_REACHABLE
))
5109 gimple_stmt_iterator bsi
;
5111 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5113 struct cgraph_edge
*e
;
5114 struct cgraph_node
*node
;
5116 ipa_remove_stmt_references (id
->dst_node
, gsi_stmt (bsi
));
5118 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5119 &&(e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
5121 if (!e
->inline_failed
)
5122 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5124 cgraph_remove_edge (e
);
5126 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5127 && id
->dst_node
->clones
)
5128 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5130 ipa_remove_stmt_references (node
, gsi_stmt (bsi
));
5131 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5132 && (e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
5134 if (!e
->inline_failed
)
5135 cgraph_remove_node_and_inline_clones (e
->callee
, id
->dst_node
);
5137 cgraph_remove_edge (e
);
5141 node
= node
->clones
;
5142 else if (node
->next_sibling_clone
)
5143 node
= node
->next_sibling_clone
;
5146 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5147 node
= node
->clone_of
;
5148 if (node
!= id
->dst_node
)
5149 node
= node
->next_sibling_clone
;
5153 delete_basic_block (b
);
5161 /* Update clone info after duplication. */
5164 update_clone_info (copy_body_data
* id
)
5166 struct cgraph_node
*node
;
5167 if (!id
->dst_node
->clones
)
5169 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5171 /* First update replace maps to match the new body. */
5172 if (node
->clone
.tree_map
)
5175 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5177 struct ipa_replace_map
*replace_info
;
5178 replace_info
= (*node
->clone
.tree_map
)[i
];
5179 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5180 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5184 node
= node
->clones
;
5185 else if (node
->next_sibling_clone
)
5186 node
= node
->next_sibling_clone
;
5189 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5190 node
= node
->clone_of
;
5191 if (node
!= id
->dst_node
)
5192 node
= node
->next_sibling_clone
;
5197 /* Create a copy of a function's tree.
5198 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5199 of the original function and the new copied function
5200 respectively. In case we want to replace a DECL
5201 tree with another tree while duplicating the function's
5202 body, TREE_MAP represents the mapping between these
5203 trees. If UPDATE_CLONES is set, the call_stmt fields
5204 of edges of clones of the function will be updated.
5206 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5208 If SKIP_RETURN is true, the new version will return void.
5209 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5210 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5213 tree_function_versioning (tree old_decl
, tree new_decl
,
5214 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
5215 bool update_clones
, bitmap args_to_skip
,
5216 bool skip_return
, bitmap blocks_to_copy
,
5217 basic_block new_entry
)
5219 struct cgraph_node
*old_version_node
;
5220 struct cgraph_node
*new_version_node
;
5224 struct ipa_replace_map
*replace_info
;
5225 basic_block old_entry_block
, bb
;
5226 stack_vec
<gimple
, 10> init_stmts
;
5227 tree vars
= NULL_TREE
;
5229 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5230 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5231 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5233 old_version_node
= cgraph_get_node (old_decl
);
5234 gcc_checking_assert (old_version_node
);
5235 new_version_node
= cgraph_get_node (new_decl
);
5236 gcc_checking_assert (new_version_node
);
5238 /* Copy over debug args. */
5239 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5241 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5242 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5243 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5244 old_debug_args
= decl_debug_args_lookup (old_decl
);
5247 new_debug_args
= decl_debug_args_insert (new_decl
);
5248 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5252 /* Output the inlining info for this abstract function, since it has been
5253 inlined. If we don't do this now, we can lose the information about the
5254 variables in the function when the blocks get blown away as soon as we
5255 remove the cgraph node. */
5256 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5258 DECL_ARTIFICIAL (new_decl
) = 1;
5259 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5260 if (DECL_ORIGIN (old_decl
) == old_decl
)
5261 old_version_node
->used_as_abstract_origin
= true;
5262 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5264 /* Prepare the data structures for the tree copy. */
5265 memset (&id
, 0, sizeof (id
));
5267 /* Generate a new name for the new version. */
5268 id
.statements_to_fold
= pointer_set_create ();
5270 id
.decl_map
= pointer_map_create ();
5271 id
.debug_map
= NULL
;
5272 id
.src_fn
= old_decl
;
5273 id
.dst_fn
= new_decl
;
5274 id
.src_node
= old_version_node
;
5275 id
.dst_node
= new_version_node
;
5276 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5277 id
.blocks_to_copy
= blocks_to_copy
;
5278 if (id
.src_node
->ipa_transforms_to_apply
.exists ())
5280 vec
<ipa_opt_pass
> old_transforms_to_apply
5281 = id
.dst_node
->ipa_transforms_to_apply
;
5284 id
.dst_node
->ipa_transforms_to_apply
5285 = id
.src_node
->ipa_transforms_to_apply
.copy ();
5286 for (i
= 0; i
< old_transforms_to_apply
.length (); i
++)
5287 id
.dst_node
->ipa_transforms_to_apply
.safe_push (old_transforms_to_apply
[i
]);
5288 old_transforms_to_apply
.release ();
5291 id
.copy_decl
= copy_decl_no_change
;
5292 id
.transform_call_graph_edges
5293 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5294 id
.transform_new_cfg
= true;
5295 id
.transform_return_to_modify
= false;
5296 id
.transform_parameter
= false;
5297 id
.transform_lang_insert_block
= NULL
;
5299 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5300 (DECL_STRUCT_FUNCTION (old_decl
));
5301 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5302 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5303 initialize_cfun (new_decl
, old_decl
,
5304 old_entry_block
->count
);
5305 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5306 = id
.src_cfun
->gimple_df
->ipa_pta
;
5308 /* Copy the function's static chain. */
5309 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5311 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5312 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5315 /* If there's a tree_map, prepare for substitution. */
5317 for (i
= 0; i
< tree_map
->length (); i
++)
5320 replace_info
= (*tree_map
)[i
];
5321 if (replace_info
->replace_p
)
5323 if (!replace_info
->old_tree
)
5325 int i
= replace_info
->parm_num
;
5329 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5331 replace_info
->old_tree
= parm
;
5332 req_type
= TREE_TYPE (parm
);
5333 if (!useless_type_conversion_p (req_type
, TREE_TYPE (replace_info
->new_tree
)))
5335 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5336 replace_info
->new_tree
= fold_build1 (NOP_EXPR
, req_type
, replace_info
->new_tree
);
5337 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (TREE_TYPE (replace_info
->new_tree
)))
5338 replace_info
->new_tree
= fold_build1 (VIEW_CONVERT_EXPR
, req_type
, replace_info
->new_tree
);
5343 fprintf (dump_file
, " const ");
5344 print_generic_expr (dump_file
, replace_info
->new_tree
, 0);
5345 fprintf (dump_file
, " can't be converted to param ");
5346 print_generic_expr (dump_file
, parm
, 0);
5347 fprintf (dump_file
, "\n");
5349 replace_info
->old_tree
= NULL
;
5354 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5355 if (replace_info
->old_tree
)
5357 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5358 replace_info
->new_tree
, id
.src_fn
,
5362 init_stmts
.safe_push (init
);
5366 /* Copy the function's arguments. */
5367 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5368 DECL_ARGUMENTS (new_decl
) =
5369 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5370 args_to_skip
, &vars
);
5372 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5373 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5375 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5377 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5378 /* Add local vars. */
5379 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5381 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5383 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5385 DECL_RESULT (new_decl
)
5386 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5387 RESULT_DECL
, NULL_TREE
, void_type_node
);
5388 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5389 cfun
->returns_struct
= 0;
5390 cfun
->returns_pcc_struct
= 0;
5395 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5396 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5397 if (gimple_in_ssa_p (id
.src_cfun
)
5398 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5399 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5401 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5402 insert_decl_map (&id
, old_name
, new_name
);
5403 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5404 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5408 /* Set up the destination functions loop tree. */
5409 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5411 cfun
->curr_properties
&= ~PROP_loops
;
5412 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5413 cfun
->curr_properties
|= PROP_loops
;
5416 /* Copy the Function's body. */
5417 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5418 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
5421 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5422 number_blocks (new_decl
);
5424 /* We want to create the BB unconditionally, so that the addition of
5425 debug stmts doesn't affect BB count, which may in the end cause
5426 codegen differences. */
5427 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5428 while (init_stmts
.length ())
5429 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5430 update_clone_info (&id
);
5432 /* Remap the nonlocal_goto_save_area, if any. */
5433 if (cfun
->nonlocal_goto_save_area
)
5435 struct walk_stmt_info wi
;
5437 memset (&wi
, 0, sizeof (wi
));
5439 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5443 pointer_map_destroy (id
.decl_map
);
5445 pointer_map_destroy (id
.debug_map
);
5446 free_dominance_info (CDI_DOMINATORS
);
5447 free_dominance_info (CDI_POST_DOMINATORS
);
5449 fold_marked_statements (0, id
.statements_to_fold
);
5450 pointer_set_destroy (id
.statements_to_fold
);
5451 fold_cond_expr_cond ();
5452 delete_unreachable_blocks_update_callgraph (&id
);
5453 if (id
.dst_node
->definition
)
5454 cgraph_rebuild_references ();
5455 update_ssa (TODO_update_ssa
);
5457 /* After partial cloning we need to rescale frequencies, so they are
5458 within proper range in the cloned function. */
5461 struct cgraph_edge
*e
;
5462 rebuild_frequencies ();
5464 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5465 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5467 basic_block bb
= gimple_bb (e
->call_stmt
);
5468 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5470 e
->count
= bb
->count
;
5472 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5474 basic_block bb
= gimple_bb (e
->call_stmt
);
5475 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5477 e
->count
= bb
->count
;
5481 free_dominance_info (CDI_DOMINATORS
);
5482 free_dominance_info (CDI_POST_DOMINATORS
);
5484 gcc_assert (!id
.debug_stmts
.exists ());
5489 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5490 the callee and return the inlined body on success. */
5493 maybe_inline_call_in_expr (tree exp
)
5495 tree fn
= get_callee_fndecl (exp
);
5497 /* We can only try to inline "const" functions. */
5498 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5500 struct pointer_map_t
*decl_map
= pointer_map_create ();
5501 call_expr_arg_iterator iter
;
5505 /* Remap the parameters. */
5506 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5508 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5509 *pointer_map_insert (decl_map
, param
) = arg
;
5511 memset (&id
, 0, sizeof (id
));
5513 id
.dst_fn
= current_function_decl
;
5514 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5515 id
.decl_map
= decl_map
;
5517 id
.copy_decl
= copy_decl_no_change
;
5518 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5519 id
.transform_new_cfg
= false;
5520 id
.transform_return_to_modify
= true;
5521 id
.transform_parameter
= true;
5522 id
.transform_lang_insert_block
= NULL
;
5524 /* Make sure not to unshare trees behind the front-end's back
5525 since front-end specific mechanisms may rely on sharing. */
5526 id
.regimplify
= false;
5527 id
.do_not_unshare
= true;
5529 /* We're not inside any EH region. */
5532 t
= copy_tree_body (&id
);
5533 pointer_map_destroy (decl_map
);
5535 /* We can only return something suitable for use in a GENERIC
5537 if (TREE_CODE (t
) == MODIFY_EXPR
)
5538 return TREE_OPERAND (t
, 1);
5544 /* Duplicate a type, fields and all. */
5547 build_duplicate_type (tree type
)
5549 struct copy_body_data id
;
5551 memset (&id
, 0, sizeof (id
));
5552 id
.src_fn
= current_function_decl
;
5553 id
.dst_fn
= current_function_decl
;
5555 id
.decl_map
= pointer_map_create ();
5556 id
.debug_map
= NULL
;
5557 id
.copy_decl
= copy_decl_no_change
;
5559 type
= remap_type_1 (type
, &id
);
5561 pointer_map_destroy (id
.decl_map
);
5563 pointer_map_destroy (id
.debug_map
);
5565 TYPE_CANONICAL (type
) = type
;