2 Copyright (C) 2001-2014 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"
40 #include "hard-reg-set.h"
42 #include "dominance.h"
45 #include "basic-block.h"
46 #include "tree-iterator.h"
48 #include "tree-ssa-alias.h"
49 #include "internal-fn.h"
50 #include "gimple-fold.h"
52 #include "gimple-expr.h"
56 #include "gimple-iterator.h"
57 #include "gimplify-me.h"
58 #include "gimple-walk.h"
59 #include "gimple-ssa.h"
61 #include "tree-phinodes.h"
62 #include "ssa-iterators.h"
63 #include "stringpool.h"
64 #include "tree-ssanames.h"
65 #include "tree-into-ssa.h"
69 #include "tree-pretty-print.h"
73 #include "value-prof.h"
74 #include "tree-pass.h"
79 #include "rtl.h" /* FIXME: For asm_str_count. */
81 /* I'm not real happy about this, but we need to handle gimple and
84 /* Inlining, Cloning, Versioning, Parallelization
86 Inlining: a function body is duplicated, but the PARM_DECLs are
87 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
88 MODIFY_EXPRs that store to a dedicated returned-value variable.
89 The duplicated eh_region info of the copy will later be appended
90 to the info for the caller; the eh_region info in copied throwing
91 statements and RESX statements are adjusted accordingly.
93 Cloning: (only in C++) We have one body for a con/de/structor, and
94 multiple function decls, each with a unique parameter list.
95 Duplicate the body, using the given splay tree; some parameters
96 will become constants (like 0 or 1).
98 Versioning: a function body is duplicated and the result is a new
99 function rather than into blocks of an existing function as with
100 inlining. Some parameters will become constants.
102 Parallelization: a region of a function is duplicated resulting in
103 a new function. Variables may be replaced with complex expressions
104 to enable shared variable semantics.
106 All of these will simultaneously lookup any callgraph edges. If
107 we're going to inline the duplicated function body, and the given
108 function has some cloned callgraph nodes (one for each place this
109 function will be inlined) those callgraph edges will be duplicated.
110 If we're cloning the body, those callgraph edges will be
111 updated to point into the new body. (Note that the original
112 callgraph node and edge list will not be altered.)
114 See the CALL_EXPR handling case in copy_tree_body_r (). */
118 o In order to make inlining-on-trees work, we pessimized
119 function-local static constants. In particular, they are now
120 always output, even when not addressed. Fix this by treating
121 function-local static constants just like global static
122 constants; the back-end already knows not to output them if they
125 o Provide heuristics to clamp inlining of recursive template
129 /* Weights that estimate_num_insns uses to estimate the size of the
132 eni_weights eni_size_weights
;
134 /* Weights that estimate_num_insns uses to estimate the time necessary
135 to execute the produced code. */
137 eni_weights eni_time_weights
;
141 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, basic_block
);
142 static void remap_block (tree
*, copy_body_data
*);
143 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
144 static void declare_inline_vars (tree
, tree
);
145 static void remap_save_expr (tree
*, hash_map
<tree
, tree
> *, int *);
146 static void prepend_lexical_block (tree current_block
, tree new_block
);
147 static tree
copy_decl_to_var (tree
, copy_body_data
*);
148 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
149 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
150 static gimple
remap_gimple_stmt (gimple
, copy_body_data
*);
151 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
153 /* Insert a tree->tree mapping for ID. Despite the name suggests
154 that the trees should be variables, it is used for more than that. */
157 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
159 id
->decl_map
->put (key
, value
);
161 /* Always insert an identity map as well. If we see this same new
162 node again, we won't want to duplicate it a second time. */
164 id
->decl_map
->put (value
, value
);
167 /* Insert a tree->tree mapping for ID. This is only used for
171 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
173 if (!gimple_in_ssa_p (id
->src_cfun
))
176 if (!MAY_HAVE_DEBUG_STMTS
)
179 if (!target_for_debug_bind (key
))
182 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
183 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
186 id
->debug_map
= new hash_map
<tree
, tree
>;
188 id
->debug_map
->put (key
, value
);
191 /* If nonzero, we're remapping the contents of inlined debug
192 statements. If negative, an error has occurred, such as a
193 reference to a variable that isn't available in the inlined
195 static int processing_debug_stmt
= 0;
197 /* Construct new SSA name for old NAME. ID is the inline context. */
200 remap_ssa_name (tree name
, copy_body_data
*id
)
205 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
207 n
= id
->decl_map
->get (name
);
209 return unshare_expr (*n
);
211 if (processing_debug_stmt
)
213 if (SSA_NAME_IS_DEFAULT_DEF (name
)
214 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
215 && id
->entry_bb
== NULL
216 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
218 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
220 gimple_stmt_iterator gsi
;
221 tree val
= SSA_NAME_VAR (name
);
223 n
= id
->decl_map
->get (val
);
226 if (TREE_CODE (val
) != PARM_DECL
)
228 processing_debug_stmt
= -1;
231 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
232 DECL_ARTIFICIAL (vexpr
) = 1;
233 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
234 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
235 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
236 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
240 processing_debug_stmt
= -1;
244 /* Remap anonymous SSA names or SSA names of anonymous decls. */
245 var
= SSA_NAME_VAR (name
);
247 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
248 && TREE_CODE (var
) == VAR_DECL
249 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
250 && DECL_ARTIFICIAL (var
)
251 && DECL_IGNORED_P (var
)
252 && !DECL_NAME (var
)))
254 struct ptr_info_def
*pi
;
255 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
), NULL
);
256 if (!var
&& SSA_NAME_IDENTIFIER (name
))
257 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
258 insert_decl_map (id
, name
, new_tree
);
259 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
260 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
261 /* At least IPA points-to info can be directly transferred. */
262 if (id
->src_cfun
->gimple_df
263 && id
->src_cfun
->gimple_df
->ipa_pta
264 && (pi
= SSA_NAME_PTR_INFO (name
))
267 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
273 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
275 new_tree
= remap_decl (var
, id
);
277 /* We might've substituted constant or another SSA_NAME for
280 Replace the SSA name representing RESULT_DECL by variable during
281 inlining: this saves us from need to introduce PHI node in a case
282 return value is just partly initialized. */
283 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
284 && (!SSA_NAME_VAR (name
)
285 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
286 || !id
->transform_return_to_modify
))
288 struct ptr_info_def
*pi
;
289 new_tree
= make_ssa_name (new_tree
, NULL
);
290 insert_decl_map (id
, name
, new_tree
);
291 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
292 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
293 /* At least IPA points-to info can be directly transferred. */
294 if (id
->src_cfun
->gimple_df
295 && id
->src_cfun
->gimple_df
->ipa_pta
296 && (pi
= SSA_NAME_PTR_INFO (name
))
299 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
302 if (SSA_NAME_IS_DEFAULT_DEF (name
))
304 /* By inlining function having uninitialized variable, we might
305 extend the lifetime (variable might get reused). This cause
306 ICE in the case we end up extending lifetime of SSA name across
307 abnormal edge, but also increase register pressure.
309 We simply initialize all uninitialized vars by 0 except
310 for case we are inlining to very first BB. We can avoid
311 this for all BBs that are not inside strongly connected
312 regions of the CFG, but this is expensive to test. */
314 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
315 && (!SSA_NAME_VAR (name
)
316 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
317 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
319 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
321 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
323 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
325 init_stmt
= gimple_build_assign (new_tree
, zero
);
326 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
327 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
331 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
332 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
337 insert_decl_map (id
, name
, new_tree
);
341 /* Remap DECL during the copying of the BLOCK tree for the function. */
344 remap_decl (tree decl
, copy_body_data
*id
)
348 /* We only remap local variables in the current function. */
350 /* See if we have remapped this declaration. */
352 n
= id
->decl_map
->get (decl
);
354 if (!n
&& processing_debug_stmt
)
356 processing_debug_stmt
= -1;
360 /* If we didn't already have an equivalent for this declaration,
364 /* Make a copy of the variable or label. */
365 tree t
= id
->copy_decl (decl
, id
);
367 /* Remember it, so that if we encounter this local entity again
368 we can reuse this copy. Do this early because remap_type may
369 need this decl for TYPE_STUB_DECL. */
370 insert_decl_map (id
, decl
, t
);
375 /* Remap types, if necessary. */
376 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
377 if (TREE_CODE (t
) == TYPE_DECL
)
378 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
380 /* Remap sizes as necessary. */
381 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
382 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
384 /* If fields, do likewise for offset and qualifier. */
385 if (TREE_CODE (t
) == FIELD_DECL
)
387 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
388 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
389 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
395 if (id
->do_not_unshare
)
398 return unshare_expr (*n
);
402 remap_type_1 (tree type
, copy_body_data
*id
)
406 /* We do need a copy. build and register it now. If this is a pointer or
407 reference type, remap the designated type and make a new pointer or
409 if (TREE_CODE (type
) == POINTER_TYPE
)
411 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
413 TYPE_REF_CAN_ALIAS_ALL (type
));
414 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
415 new_tree
= build_type_attribute_qual_variant (new_tree
,
416 TYPE_ATTRIBUTES (type
),
418 insert_decl_map (id
, type
, new_tree
);
421 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
423 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
425 TYPE_REF_CAN_ALIAS_ALL (type
));
426 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
427 new_tree
= build_type_attribute_qual_variant (new_tree
,
428 TYPE_ATTRIBUTES (type
),
430 insert_decl_map (id
, type
, new_tree
);
434 new_tree
= copy_node (type
);
436 insert_decl_map (id
, type
, new_tree
);
438 /* This is a new type, not a copy of an old type. Need to reassociate
439 variants. We can handle everything except the main variant lazily. */
440 t
= TYPE_MAIN_VARIANT (type
);
443 t
= remap_type (t
, id
);
444 TYPE_MAIN_VARIANT (new_tree
) = t
;
445 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
446 TYPE_NEXT_VARIANT (t
) = new_tree
;
450 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
451 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
454 if (TYPE_STUB_DECL (type
))
455 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
457 /* Lazily create pointer and reference types. */
458 TYPE_POINTER_TO (new_tree
) = NULL
;
459 TYPE_REFERENCE_TO (new_tree
) = NULL
;
461 /* Copy all types that may contain references to local variables; be sure to
462 preserve sharing in between type and its main variant when possible. */
463 switch (TREE_CODE (new_tree
))
467 case FIXED_POINT_TYPE
:
470 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
472 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
473 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
475 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
476 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
480 t
= TYPE_MIN_VALUE (new_tree
);
481 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
482 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
484 t
= TYPE_MAX_VALUE (new_tree
);
485 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
486 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
491 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
492 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
493 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
495 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
496 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
497 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
498 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
500 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
504 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
505 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
506 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
508 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
510 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
512 gcc_checking_assert (TYPE_DOMAIN (type
) == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
513 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
516 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
521 case QUAL_UNION_TYPE
:
522 if (TYPE_MAIN_VARIANT (type
) != type
523 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
524 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
529 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
531 t
= remap_decl (f
, id
);
532 DECL_CONTEXT (t
) = new_tree
;
536 TYPE_FIELDS (new_tree
) = nreverse (nf
);
542 /* Shouldn't have been thought variable sized. */
546 /* All variants of type share the same size, so use the already remaped data. */
547 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
549 gcc_checking_assert (TYPE_SIZE (type
) == TYPE_SIZE (TYPE_MAIN_VARIANT (type
)));
550 gcc_checking_assert (TYPE_SIZE_UNIT (type
) == TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
)));
552 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
553 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
557 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
558 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
565 remap_type (tree type
, copy_body_data
*id
)
573 /* See if we have remapped this type. */
574 node
= id
->decl_map
->get (type
);
578 /* The type only needs remapping if it's variably modified. */
579 if (! variably_modified_type_p (type
, id
->src_fn
))
581 insert_decl_map (id
, type
, type
);
585 id
->remapping_type_depth
++;
586 tmp
= remap_type_1 (type
, id
);
587 id
->remapping_type_depth
--;
592 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
595 can_be_nonlocal (tree decl
, copy_body_data
*id
)
597 /* We can not duplicate function decls. */
598 if (TREE_CODE (decl
) == FUNCTION_DECL
)
601 /* Local static vars must be non-local or we get multiple declaration
603 if (TREE_CODE (decl
) == VAR_DECL
604 && !auto_var_in_fn_p (decl
, id
->src_fn
))
611 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
615 tree new_decls
= NULL_TREE
;
617 /* Remap its variables. */
618 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
622 if (can_be_nonlocal (old_var
, id
))
624 /* We need to add this variable to the local decls as otherwise
625 nothing else will do so. */
626 if (TREE_CODE (old_var
) == VAR_DECL
627 && ! DECL_EXTERNAL (old_var
))
628 add_local_decl (cfun
, old_var
);
629 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
630 && !DECL_IGNORED_P (old_var
)
631 && nonlocalized_list
)
632 vec_safe_push (*nonlocalized_list
, old_var
);
636 /* Remap the variable. */
637 new_var
= remap_decl (old_var
, id
);
639 /* If we didn't remap this variable, we can't mess with its
640 TREE_CHAIN. If we remapped this variable to the return slot, it's
641 already declared somewhere else, so don't declare it here. */
643 if (new_var
== id
->retvar
)
647 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
648 && !DECL_IGNORED_P (old_var
)
649 && nonlocalized_list
)
650 vec_safe_push (*nonlocalized_list
, old_var
);
654 gcc_assert (DECL_P (new_var
));
655 DECL_CHAIN (new_var
) = new_decls
;
658 /* Also copy value-expressions. */
659 if (TREE_CODE (new_var
) == VAR_DECL
660 && DECL_HAS_VALUE_EXPR_P (new_var
))
662 tree tem
= DECL_VALUE_EXPR (new_var
);
663 bool old_regimplify
= id
->regimplify
;
664 id
->remapping_type_depth
++;
665 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
666 id
->remapping_type_depth
--;
667 id
->regimplify
= old_regimplify
;
668 SET_DECL_VALUE_EXPR (new_var
, tem
);
673 return nreverse (new_decls
);
676 /* Copy the BLOCK to contain remapped versions of the variables
677 therein. And hook the new block into the block-tree. */
680 remap_block (tree
*block
, copy_body_data
*id
)
685 /* Make the new block. */
687 new_block
= make_node (BLOCK
);
688 TREE_USED (new_block
) = TREE_USED (old_block
);
689 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
690 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
691 BLOCK_NONLOCALIZED_VARS (new_block
)
692 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
695 /* Remap its variables. */
696 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
697 &BLOCK_NONLOCALIZED_VARS (new_block
),
700 if (id
->transform_lang_insert_block
)
701 id
->transform_lang_insert_block (new_block
);
703 /* Remember the remapped block. */
704 insert_decl_map (id
, old_block
, new_block
);
707 /* Copy the whole block tree and root it in id->block. */
709 remap_blocks (tree block
, copy_body_data
*id
)
712 tree new_tree
= block
;
717 remap_block (&new_tree
, id
);
718 gcc_assert (new_tree
!= block
);
719 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
720 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
721 /* Blocks are in arbitrary order, but make things slightly prettier and do
722 not swap order when producing a copy. */
723 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
727 /* Remap the block tree rooted at BLOCK to nothing. */
729 remap_blocks_to_null (tree block
, copy_body_data
*id
)
732 insert_decl_map (id
, block
, NULL_TREE
);
733 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
734 remap_blocks_to_null (t
, id
);
738 copy_statement_list (tree
*tp
)
740 tree_stmt_iterator oi
, ni
;
743 new_tree
= alloc_stmt_list ();
744 ni
= tsi_start (new_tree
);
745 oi
= tsi_start (*tp
);
746 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
749 for (; !tsi_end_p (oi
); tsi_next (&oi
))
751 tree stmt
= tsi_stmt (oi
);
752 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
753 /* This copy is not redundant; tsi_link_after will smash this
754 STATEMENT_LIST into the end of the one we're building, and we
755 don't want to do that with the original. */
756 copy_statement_list (&stmt
);
757 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
762 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
764 tree block
= BIND_EXPR_BLOCK (*tp
);
765 /* Copy (and replace) the statement. */
766 copy_tree_r (tp
, walk_subtrees
, NULL
);
769 remap_block (&block
, id
);
770 BIND_EXPR_BLOCK (*tp
) = block
;
773 if (BIND_EXPR_VARS (*tp
))
774 /* This will remap a lot of the same decls again, but this should be
776 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
780 /* Create a new gimple_seq by remapping all the statements in BODY
781 using the inlining information in ID. */
784 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
786 gimple_stmt_iterator si
;
787 gimple_seq new_body
= NULL
;
789 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
791 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
792 gimple_seq_add_stmt (&new_body
, new_stmt
);
799 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
800 block using the mapping information in ID. */
803 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
806 tree new_block
, new_vars
;
807 gimple_seq body
, new_body
;
809 /* Copy the statement. Note that we purposely don't use copy_stmt
810 here because we need to remap statements as we copy. */
811 body
= gimple_bind_body (stmt
);
812 new_body
= remap_gimple_seq (body
, id
);
814 new_block
= gimple_bind_block (stmt
);
816 remap_block (&new_block
, id
);
818 /* This will remap a lot of the same decls again, but this should be
820 new_vars
= gimple_bind_vars (stmt
);
822 new_vars
= remap_decls (new_vars
, NULL
, id
);
824 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
829 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
834 if (TREE_CODE (decl
) == SSA_NAME
)
836 decl
= SSA_NAME_VAR (decl
);
841 return (TREE_CODE (decl
) == PARM_DECL
);
844 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
845 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
846 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
847 recursing into the children nodes of *TP. */
850 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
852 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
853 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
854 tree fn
= id
->src_fn
;
856 if (TREE_CODE (*tp
) == SSA_NAME
)
858 *tp
= remap_ssa_name (*tp
, id
);
862 else if (auto_var_in_fn_p (*tp
, fn
))
864 /* Local variables and labels need to be replaced by equivalent
865 variables. We don't want to copy static variables; there's
866 only one of those, no matter how many times we inline the
867 containing function. Similarly for globals from an outer
871 /* Remap the declaration. */
872 new_decl
= remap_decl (*tp
, id
);
873 gcc_assert (new_decl
);
874 /* Replace this variable with the copy. */
875 STRIP_TYPE_NOPS (new_decl
);
876 /* ??? The C++ frontend uses void * pointer zero to initialize
877 any other type. This confuses the middle-end type verification.
878 As cloned bodies do not go through gimplification again the fixup
879 there doesn't trigger. */
880 if (TREE_CODE (new_decl
) == INTEGER_CST
881 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
882 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
886 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
888 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
890 else if (TREE_CODE (*tp
) == LABEL_DECL
891 && (!DECL_CONTEXT (*tp
)
892 || decl_function_context (*tp
) == id
->src_fn
))
893 /* These may need to be remapped for EH handling. */
894 *tp
= remap_decl (*tp
, id
);
895 else if (TREE_CODE (*tp
) == FIELD_DECL
)
897 /* If the enclosing record type is variably_modified_type_p, the field
898 has already been remapped. Otherwise, it need not be. */
899 tree
*n
= id
->decl_map
->get (*tp
);
904 else if (TYPE_P (*tp
))
905 /* Types may need remapping as well. */
906 *tp
= remap_type (*tp
, id
);
907 else if (CONSTANT_CLASS_P (*tp
))
909 /* If this is a constant, we have to copy the node iff the type
910 will be remapped. copy_tree_r will not copy a constant. */
911 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
913 if (new_type
== TREE_TYPE (*tp
))
916 else if (TREE_CODE (*tp
) == INTEGER_CST
)
917 *tp
= wide_int_to_tree (new_type
, *tp
);
920 *tp
= copy_node (*tp
);
921 TREE_TYPE (*tp
) = new_type
;
926 /* Otherwise, just copy the node. Note that copy_tree_r already
927 knows not to copy VAR_DECLs, etc., so this is safe. */
929 if (TREE_CODE (*tp
) == MEM_REF
)
931 /* We need to re-canonicalize MEM_REFs from inline substitutions
932 that can happen when a pointer argument is an ADDR_EXPR.
933 Recurse here manually to allow that. */
934 tree ptr
= TREE_OPERAND (*tp
, 0);
935 tree type
= remap_type (TREE_TYPE (*tp
), id
);
937 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
938 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
939 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
940 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
941 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
942 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
943 remapped a parameter as the property might be valid only
944 for the parameter itself. */
945 if (TREE_THIS_NOTRAP (old
)
946 && (!is_parm (TREE_OPERAND (old
, 0))
947 || (!id
->transform_parameter
&& is_parm (ptr
))))
948 TREE_THIS_NOTRAP (*tp
) = 1;
953 /* Here is the "usual case". Copy this tree node, and then
954 tweak some special cases. */
955 copy_tree_r (tp
, walk_subtrees
, NULL
);
957 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
958 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
960 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
962 /* The copied TARGET_EXPR has never been expanded, even if the
963 original node was expanded already. */
964 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
965 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
967 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
969 /* Variable substitution need not be simple. In particular,
970 the MEM_REF substitution above. Make sure that
971 TREE_CONSTANT and friends are up-to-date. */
972 int invariant
= is_gimple_min_invariant (*tp
);
973 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
974 recompute_tree_invariant_for_addr_expr (*tp
);
976 /* If this used to be invariant, but is not any longer,
977 then regimplification is probably needed. */
978 if (invariant
&& !is_gimple_min_invariant (*tp
))
979 id
->regimplify
= true;
985 /* Update the TREE_BLOCK for the cloned expr. */
988 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
989 tree old_block
= TREE_BLOCK (*tp
);
993 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
997 TREE_SET_BLOCK (*tp
, new_block
);
1000 /* Keep iterating. */
1005 /* Called from copy_body_id via walk_tree. DATA is really a
1006 `copy_body_data *'. */
1009 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1011 copy_body_data
*id
= (copy_body_data
*) data
;
1012 tree fn
= id
->src_fn
;
1015 /* Begin by recognizing trees that we'll completely rewrite for the
1016 inlining context. Our output for these trees is completely
1017 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1018 into an edge). Further down, we'll handle trees that get
1019 duplicated and/or tweaked. */
1021 /* When requested, RETURN_EXPRs should be transformed to just the
1022 contained MODIFY_EXPR. The branch semantics of the return will
1023 be handled elsewhere by manipulating the CFG rather than a statement. */
1024 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1026 tree assignment
= TREE_OPERAND (*tp
, 0);
1028 /* If we're returning something, just turn that into an
1029 assignment into the equivalent of the original RESULT_DECL.
1030 If the "assignment" is just the result decl, the result
1031 decl has already been set (e.g. a recent "foo (&result_decl,
1032 ...)"); just toss the entire RETURN_EXPR. */
1033 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1035 /* Replace the RETURN_EXPR with (a copy of) the
1036 MODIFY_EXPR hanging underneath. */
1037 *tp
= copy_node (assignment
);
1039 else /* Else the RETURN_EXPR returns no value. */
1042 return (tree
) (void *)1;
1045 else if (TREE_CODE (*tp
) == SSA_NAME
)
1047 *tp
= remap_ssa_name (*tp
, id
);
1052 /* Local variables and labels need to be replaced by equivalent
1053 variables. We don't want to copy static variables; there's only
1054 one of those, no matter how many times we inline the containing
1055 function. Similarly for globals from an outer function. */
1056 else if (auto_var_in_fn_p (*tp
, fn
))
1060 /* Remap the declaration. */
1061 new_decl
= remap_decl (*tp
, id
);
1062 gcc_assert (new_decl
);
1063 /* Replace this variable with the copy. */
1064 STRIP_TYPE_NOPS (new_decl
);
1068 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1069 copy_statement_list (tp
);
1070 else if (TREE_CODE (*tp
) == SAVE_EXPR
1071 || TREE_CODE (*tp
) == TARGET_EXPR
)
1072 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1073 else if (TREE_CODE (*tp
) == LABEL_DECL
1074 && (! DECL_CONTEXT (*tp
)
1075 || decl_function_context (*tp
) == id
->src_fn
))
1076 /* These may need to be remapped for EH handling. */
1077 *tp
= remap_decl (*tp
, id
);
1078 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1079 copy_bind_expr (tp
, walk_subtrees
, id
);
1080 /* Types may need remapping as well. */
1081 else if (TYPE_P (*tp
))
1082 *tp
= remap_type (*tp
, id
);
1084 /* If this is a constant, we have to copy the node iff the type will be
1085 remapped. copy_tree_r will not copy a constant. */
1086 else if (CONSTANT_CLASS_P (*tp
))
1088 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1090 if (new_type
== TREE_TYPE (*tp
))
1093 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1094 *tp
= wide_int_to_tree (new_type
, *tp
);
1097 *tp
= copy_node (*tp
);
1098 TREE_TYPE (*tp
) = new_type
;
1102 /* Otherwise, just copy the node. Note that copy_tree_r already
1103 knows not to copy VAR_DECLs, etc., so this is safe. */
1106 /* Here we handle trees that are not completely rewritten.
1107 First we detect some inlining-induced bogosities for
1109 if (TREE_CODE (*tp
) == MODIFY_EXPR
1110 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1111 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1113 /* Some assignments VAR = VAR; don't generate any rtl code
1114 and thus don't count as variable modification. Avoid
1115 keeping bogosities like 0 = 0. */
1116 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1119 n
= id
->decl_map
->get (decl
);
1123 STRIP_TYPE_NOPS (value
);
1124 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1126 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1127 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1131 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1133 /* Get rid of *& from inline substitutions that can happen when a
1134 pointer argument is an ADDR_EXPR. */
1135 tree decl
= TREE_OPERAND (*tp
, 0);
1136 tree
*n
= id
->decl_map
->get (decl
);
1139 /* If we happen to get an ADDR_EXPR in n->value, strip
1140 it manually here as we'll eventually get ADDR_EXPRs
1141 which lie about their types pointed to. In this case
1142 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1143 but we absolutely rely on that. As fold_indirect_ref
1144 does other useful transformations, try that first, though. */
1145 tree type
= TREE_TYPE (*tp
);
1146 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1148 *tp
= gimple_fold_indirect_ref (ptr
);
1151 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1154 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1155 /* ??? We should either assert here or build
1156 a VIEW_CONVERT_EXPR instead of blindly leaking
1157 incompatible types to our IL. */
1159 *tp
= TREE_OPERAND (ptr
, 0);
1163 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1164 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1165 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1166 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1167 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1168 have remapped a parameter as the property might be
1169 valid only for the parameter itself. */
1170 if (TREE_THIS_NOTRAP (old
)
1171 && (!is_parm (TREE_OPERAND (old
, 0))
1172 || (!id
->transform_parameter
&& is_parm (ptr
))))
1173 TREE_THIS_NOTRAP (*tp
) = 1;
1180 else if (TREE_CODE (*tp
) == MEM_REF
)
1182 /* We need to re-canonicalize MEM_REFs from inline substitutions
1183 that can happen when a pointer argument is an ADDR_EXPR.
1184 Recurse here manually to allow that. */
1185 tree ptr
= TREE_OPERAND (*tp
, 0);
1186 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1188 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1189 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1190 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1191 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1192 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1193 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1194 remapped a parameter as the property might be valid only
1195 for the parameter itself. */
1196 if (TREE_THIS_NOTRAP (old
)
1197 && (!is_parm (TREE_OPERAND (old
, 0))
1198 || (!id
->transform_parameter
&& is_parm (ptr
))))
1199 TREE_THIS_NOTRAP (*tp
) = 1;
1204 /* Here is the "usual case". Copy this tree node, and then
1205 tweak some special cases. */
1206 copy_tree_r (tp
, walk_subtrees
, NULL
);
1208 /* If EXPR has block defined, map it to newly constructed block.
1209 When inlining we want EXPRs without block appear in the block
1210 of function call if we are not remapping a type. */
1213 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1214 if (TREE_BLOCK (*tp
))
1217 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1221 TREE_SET_BLOCK (*tp
, new_block
);
1224 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1225 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1227 /* The copied TARGET_EXPR has never been expanded, even if the
1228 original node was expanded already. */
1229 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1231 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1232 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1235 /* Variable substitution need not be simple. In particular, the
1236 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1237 and friends are up-to-date. */
1238 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1240 int invariant
= is_gimple_min_invariant (*tp
);
1241 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1243 /* Handle the case where we substituted an INDIRECT_REF
1244 into the operand of the ADDR_EXPR. */
1245 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1246 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1248 recompute_tree_invariant_for_addr_expr (*tp
);
1250 /* If this used to be invariant, but is not any longer,
1251 then regimplification is probably needed. */
1252 if (invariant
&& !is_gimple_min_invariant (*tp
))
1253 id
->regimplify
= true;
1259 /* Keep iterating. */
1263 /* Helper for remap_gimple_stmt. Given an EH region number for the
1264 source function, map that to the duplicate EH region number in
1265 the destination function. */
1268 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1270 eh_region old_r
, new_r
;
1272 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1273 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1275 return new_r
->index
;
1278 /* Similar, but operate on INTEGER_CSTs. */
1281 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1285 old_nr
= tree_to_shwi (old_t_nr
);
1286 new_nr
= remap_eh_region_nr (old_nr
, id
);
1288 return build_int_cst (integer_type_node
, new_nr
);
1291 /* Helper for copy_bb. Remap statement STMT using the inlining
1292 information in ID. Return the new statement copy. */
1295 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1298 struct walk_stmt_info wi
;
1299 bool skip_first
= false;
1301 /* Begin by recognizing trees that we'll completely rewrite for the
1302 inlining context. Our output for these trees is completely
1303 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1304 into an edge). Further down, we'll handle trees that get
1305 duplicated and/or tweaked. */
1307 /* When requested, GIMPLE_RETURNs should be transformed to just the
1308 contained GIMPLE_ASSIGN. The branch semantics of the return will
1309 be handled elsewhere by manipulating the CFG rather than the
1311 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1313 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1315 /* If we're returning something, just turn that into an
1316 assignment into the equivalent of the original RESULT_DECL.
1317 If RETVAL is just the result decl, the result decl has
1318 already been set (e.g. a recent "foo (&result_decl, ...)");
1319 just toss the entire GIMPLE_RETURN. */
1321 && (TREE_CODE (retval
) != RESULT_DECL
1322 && (TREE_CODE (retval
) != SSA_NAME
1323 || ! SSA_NAME_VAR (retval
)
1324 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1326 copy
= gimple_build_assign (id
->do_not_unshare
1327 ? id
->retvar
: unshare_expr (id
->retvar
),
1329 /* id->retvar is already substituted. Skip it on later remapping. */
1333 return gimple_build_nop ();
1335 else if (gimple_has_substatements (stmt
))
1339 /* When cloning bodies from the C++ front end, we will be handed bodies
1340 in High GIMPLE form. Handle here all the High GIMPLE statements that
1341 have embedded statements. */
1342 switch (gimple_code (stmt
))
1345 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1350 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1351 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1352 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1356 case GIMPLE_EH_FILTER
:
1357 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1358 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1363 gtry
*try_stmt
= as_a
<gtry
*> (stmt
);
1364 s1
= remap_gimple_seq (gimple_try_eval (try_stmt
), id
);
1365 s2
= remap_gimple_seq (gimple_try_cleanup (try_stmt
), id
);
1366 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (try_stmt
));
1370 case GIMPLE_WITH_CLEANUP_EXPR
:
1371 s1
= remap_gimple_seq (gimple_wce_cleanup (as_a
<gwce
*> (stmt
)),
1373 copy
= gimple_build_wce (s1
);
1376 case GIMPLE_OMP_PARALLEL
:
1378 gomp_parallel
*omp_par_stmt
=
1379 as_a
<gomp_parallel
*> (stmt
);
1380 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1381 copy
= gimple_build_omp_parallel
1383 gimple_omp_parallel_clauses (omp_par_stmt
),
1384 gimple_omp_parallel_child_fn (omp_par_stmt
),
1385 gimple_omp_parallel_data_arg (omp_par_stmt
));
1389 case GIMPLE_OMP_TASK
:
1391 gomp_task
*omp_task_stmt
= as_a
<gomp_task
*> (stmt
);
1392 s1
= remap_gimple_seq (gimple_omp_body (omp_task_stmt
), id
);
1393 copy
= gimple_build_omp_task
1395 gimple_omp_task_clauses (omp_task_stmt
),
1396 gimple_omp_task_child_fn (omp_task_stmt
),
1397 gimple_omp_task_data_arg (omp_task_stmt
),
1398 gimple_omp_task_copy_fn (omp_task_stmt
),
1399 gimple_omp_task_arg_size (omp_task_stmt
),
1400 gimple_omp_task_arg_align (omp_task_stmt
));
1404 case GIMPLE_OMP_FOR
:
1406 gomp_for
*omp_for_stmt
= as_a
<gomp_for
*> (stmt
);
1407 gomp_for
*omp_for_copy
;
1409 s1
= remap_gimple_seq (gimple_omp_body (omp_for_stmt
), id
);
1410 s2
= remap_gimple_seq (gimple_omp_for_pre_body (omp_for_stmt
), id
);
1411 copy
= omp_for_copy
=
1412 gimple_build_omp_for (s1
, gimple_omp_for_kind (omp_for_stmt
),
1413 gimple_omp_for_clauses (omp_for_stmt
),
1414 gimple_omp_for_collapse (omp_for_stmt
),
1416 for (i
= 0; i
< gimple_omp_for_collapse (omp_for_stmt
); i
++)
1418 gimple_omp_for_set_index (omp_for_copy
, i
,
1419 gimple_omp_for_index (omp_for_stmt
,
1421 gimple_omp_for_set_initial (omp_for_copy
, i
,
1422 gimple_omp_for_initial (
1424 gimple_omp_for_set_final (omp_for_copy
, i
,
1425 gimple_omp_for_final (omp_for_stmt
,
1427 gimple_omp_for_set_incr (omp_for_copy
, i
,
1428 gimple_omp_for_incr (omp_for_stmt
,
1430 gimple_omp_for_set_cond (omp_for_copy
, i
,
1431 gimple_omp_for_cond (omp_for_stmt
,
1437 case GIMPLE_OMP_MASTER
:
1438 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1439 copy
= gimple_build_omp_master (s1
);
1442 case GIMPLE_OMP_TASKGROUP
:
1443 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1444 copy
= gimple_build_omp_taskgroup (s1
);
1447 case GIMPLE_OMP_ORDERED
:
1448 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1449 copy
= gimple_build_omp_ordered (s1
);
1452 case GIMPLE_OMP_SECTION
:
1453 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1454 copy
= gimple_build_omp_section (s1
);
1457 case GIMPLE_OMP_SECTIONS
:
1459 gomp_sections
*omp_sections_stmt
= as_a
<gomp_sections
*> (stmt
);
1460 s1
= remap_gimple_seq (gimple_omp_body (omp_sections_stmt
), id
);
1461 copy
= gimple_build_omp_sections (
1462 s1
, gimple_omp_sections_clauses (omp_sections_stmt
));
1466 case GIMPLE_OMP_SINGLE
:
1468 gomp_single
*omp_single_stmt
= as_a
<gomp_single
*> (stmt
);
1469 s1
= remap_gimple_seq (gimple_omp_body (omp_single_stmt
), id
);
1470 copy
= gimple_build_omp_single (
1471 s1
, gimple_omp_single_clauses (omp_single_stmt
));
1475 case GIMPLE_OMP_TARGET
:
1476 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1477 copy
= gimple_build_omp_target
1478 (s1
, gimple_omp_target_kind (stmt
),
1479 gimple_omp_target_clauses (stmt
));
1482 case GIMPLE_OMP_TEAMS
:
1484 gomp_teams
*omp_teams_stmt
= as_a
<gomp_teams
*> (stmt
);
1485 s1
= remap_gimple_seq (gimple_omp_body (omp_teams_stmt
), id
);
1486 copy
= gimple_build_omp_teams
1487 (s1
, gimple_omp_teams_clauses (omp_teams_stmt
));
1491 case GIMPLE_OMP_CRITICAL
:
1492 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1494 gimple_build_omp_critical (s1
,
1495 gimple_omp_critical_name (
1496 as_a
<gomp_critical
*> (stmt
)));
1499 case GIMPLE_TRANSACTION
:
1501 gtransaction
*old_trans_stmt
=
1502 as_a
<gtransaction
*> (stmt
);
1503 gtransaction
*new_trans_stmt
;
1504 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1506 copy
= new_trans_stmt
=
1507 gimple_build_transaction (s1
,
1508 gimple_transaction_label (old_trans_stmt
));
1509 gimple_transaction_set_subcode (
1511 gimple_transaction_subcode (old_trans_stmt
));
1521 if (gimple_assign_copy_p (stmt
)
1522 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1523 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1525 /* Here we handle statements that are not completely rewritten.
1526 First we detect some inlining-induced bogosities for
1529 /* Some assignments VAR = VAR; don't generate any rtl code
1530 and thus don't count as variable modification. Avoid
1531 keeping bogosities like 0 = 0. */
1532 tree decl
= gimple_assign_lhs (stmt
), value
;
1535 n
= id
->decl_map
->get (decl
);
1539 STRIP_TYPE_NOPS (value
);
1540 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1541 return gimple_build_nop ();
1545 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1546 in a block that we aren't copying during tree_function_versioning,
1547 just drop the clobber stmt. */
1548 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1550 tree lhs
= gimple_assign_lhs (stmt
);
1551 if (TREE_CODE (lhs
) == MEM_REF
1552 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1554 gimple def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1555 if (gimple_bb (def_stmt
)
1556 && !bitmap_bit_p (id
->blocks_to_copy
,
1557 gimple_bb (def_stmt
)->index
))
1558 return gimple_build_nop ();
1562 if (gimple_debug_bind_p (stmt
))
1565 gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1566 gimple_debug_bind_get_value (stmt
),
1568 id
->debug_stmts
.safe_push (copy
);
1571 if (gimple_debug_source_bind_p (stmt
))
1573 gdebug
*copy
= gimple_build_debug_source_bind
1574 (gimple_debug_source_bind_get_var (stmt
),
1575 gimple_debug_source_bind_get_value (stmt
), stmt
);
1576 id
->debug_stmts
.safe_push (copy
);
1580 /* Create a new deep copy of the statement. */
1581 copy
= gimple_copy (stmt
);
1583 /* Clear flags that need revisiting. */
1584 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1585 if (gimple_call_tail_p (call_stmt
))
1586 gimple_call_set_tail (call_stmt
, false);
1588 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1589 RESX and EH_DISPATCH. */
1591 switch (gimple_code (copy
))
1595 tree r
, fndecl
= gimple_call_fndecl (copy
);
1596 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1597 switch (DECL_FUNCTION_CODE (fndecl
))
1599 case BUILT_IN_EH_COPY_VALUES
:
1600 r
= gimple_call_arg (copy
, 1);
1601 r
= remap_eh_region_tree_nr (r
, id
);
1602 gimple_call_set_arg (copy
, 1, r
);
1605 case BUILT_IN_EH_POINTER
:
1606 case BUILT_IN_EH_FILTER
:
1607 r
= gimple_call_arg (copy
, 0);
1608 r
= remap_eh_region_tree_nr (r
, id
);
1609 gimple_call_set_arg (copy
, 0, r
);
1616 /* Reset alias info if we didn't apply measures to
1617 keep it valid over inlining by setting DECL_PT_UID. */
1618 if (!id
->src_cfun
->gimple_df
1619 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1620 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1626 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1627 int r
= gimple_resx_region (resx_stmt
);
1628 r
= remap_eh_region_nr (r
, id
);
1629 gimple_resx_set_region (resx_stmt
, r
);
1633 case GIMPLE_EH_DISPATCH
:
1635 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1636 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1637 r
= remap_eh_region_nr (r
, id
);
1638 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1647 /* If STMT has a block defined, map it to the newly constructed
1649 if (gimple_block (copy
))
1652 n
= id
->decl_map
->get (gimple_block (copy
));
1654 gimple_set_block (copy
, *n
);
1657 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1660 /* Remap all the operands in COPY. */
1661 memset (&wi
, 0, sizeof (wi
));
1664 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1666 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1668 /* Clear the copied virtual operands. We are not remapping them here
1669 but are going to recreate them from scratch. */
1670 if (gimple_has_mem_ops (copy
))
1672 gimple_set_vdef (copy
, NULL_TREE
);
1673 gimple_set_vuse (copy
, NULL_TREE
);
1680 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1684 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1685 gcov_type count_scale
)
1687 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1688 basic_block copy_basic_block
;
1693 /* Search for previous copied basic block. */
1696 prev
= prev
->prev_bb
;
1698 /* create_basic_block() will append every new block to
1699 basic_block_info automatically. */
1700 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1701 (basic_block
) prev
->aux
);
1702 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1704 /* We are going to rebuild frequencies from scratch. These values
1705 have just small importance to drive canonicalize_loop_headers. */
1706 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1708 /* We recompute frequencies after inlining, so this is quite safe. */
1709 if (freq
> BB_FREQ_MAX
)
1711 copy_basic_block
->frequency
= freq
;
1713 copy_gsi
= gsi_start_bb (copy_basic_block
);
1715 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1717 gimple stmt
= gsi_stmt (gsi
);
1718 gimple orig_stmt
= stmt
;
1720 id
->regimplify
= false;
1721 stmt
= remap_gimple_stmt (stmt
, id
);
1722 if (gimple_nop_p (stmt
))
1725 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1728 /* With return slot optimization we can end up with
1729 non-gimple (foo *)&this->m, fix that here. */
1730 if (is_gimple_assign (stmt
)
1731 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1732 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1735 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1736 gimple_assign_rhs1 (stmt
),
1738 GSI_CONTINUE_LINKING
);
1739 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1740 id
->regimplify
= false;
1743 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1746 gimple_regimplify_operands (stmt
, &seq_gsi
);
1748 /* If copy_basic_block has been empty at the start of this iteration,
1749 call gsi_start_bb again to get at the newly added statements. */
1750 if (gsi_end_p (copy_gsi
))
1751 copy_gsi
= gsi_start_bb (copy_basic_block
);
1753 gsi_next (©_gsi
);
1755 /* Process the new statement. The call to gimple_regimplify_operands
1756 possibly turned the statement into multiple statements, we
1757 need to process all of them. */
1763 stmt
= gsi_stmt (copy_gsi
);
1764 call_stmt
= dyn_cast
<gcall
*> (stmt
);
1766 && gimple_call_va_arg_pack_p (call_stmt
)
1769 /* __builtin_va_arg_pack () should be replaced by
1770 all arguments corresponding to ... in the caller. */
1774 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
1777 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1780 /* Create the new array of arguments. */
1781 n
= nargs
+ gimple_call_num_args (call_stmt
);
1782 argarray
.create (n
);
1783 argarray
.safe_grow_cleared (n
);
1785 /* Copy all the arguments before '...' */
1786 memcpy (argarray
.address (),
1787 gimple_call_arg_ptr (call_stmt
, 0),
1788 gimple_call_num_args (call_stmt
) * sizeof (tree
));
1790 /* Append the arguments passed in '...' */
1791 memcpy (argarray
.address () + gimple_call_num_args (call_stmt
),
1792 gimple_call_arg_ptr (id
->call_stmt
, 0)
1793 + (gimple_call_num_args (id
->call_stmt
) - nargs
),
1794 nargs
* sizeof (tree
));
1796 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
1799 argarray
.release ();
1801 /* Copy all GIMPLE_CALL flags, location and block, except
1802 GF_CALL_VA_ARG_PACK. */
1803 gimple_call_copy_flags (new_call
, call_stmt
);
1804 gimple_call_set_va_arg_pack (new_call
, false);
1805 gimple_set_location (new_call
, gimple_location (stmt
));
1806 gimple_set_block (new_call
, gimple_block (stmt
));
1807 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
1809 gsi_replace (©_gsi
, new_call
, false);
1812 else if (is_gimple_call (stmt
)
1814 && (decl
= gimple_call_fndecl (stmt
))
1815 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1816 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1818 /* __builtin_va_arg_pack_len () should be replaced by
1819 the number of anonymous arguments. */
1820 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
1824 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1827 count
= build_int_cst (integer_type_node
, nargs
);
1828 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1829 gsi_replace (©_gsi
, new_stmt
, false);
1833 /* Statements produced by inlining can be unfolded, especially
1834 when we constant propagated some operands. We can't fold
1835 them right now for two reasons:
1836 1) folding require SSA_NAME_DEF_STMTs to be correct
1837 2) we can't change function calls to builtins.
1838 So we just mark statement for later folding. We mark
1839 all new statements, instead just statements that has changed
1840 by some nontrivial substitution so even statements made
1841 foldable indirectly are updated. If this turns out to be
1842 expensive, copy_body can be told to watch for nontrivial
1844 if (id
->statements_to_fold
)
1845 id
->statements_to_fold
->add (stmt
);
1847 /* We're duplicating a CALL_EXPR. Find any corresponding
1848 callgraph edges and update or duplicate them. */
1849 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
1851 struct cgraph_edge
*edge
;
1853 switch (id
->transform_call_graph_edges
)
1855 case CB_CGE_DUPLICATE
:
1856 edge
= id
->src_node
->get_edge (orig_stmt
);
1859 int edge_freq
= edge
->frequency
;
1861 struct cgraph_edge
*old_edge
= edge
;
1862 edge
= edge
->clone (id
->dst_node
, call_stmt
,
1864 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1866 /* We could also just rescale the frequency, but
1867 doing so would introduce roundoff errors and make
1868 verifier unhappy. */
1869 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1872 /* Speculative calls consist of two edges - direct and indirect.
1873 Duplicate the whole thing and distribute frequencies accordingly. */
1874 if (edge
->speculative
)
1876 struct cgraph_edge
*direct
, *indirect
;
1877 struct ipa_ref
*ref
;
1879 gcc_assert (!edge
->indirect_unknown_callee
);
1880 old_edge
->speculative_call_info (direct
, indirect
, ref
);
1881 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
1883 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1885 if (old_edge
->frequency
+ indirect
->frequency
)
1887 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
1888 (old_edge
->frequency
+ indirect
->frequency
)),
1890 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
1891 (old_edge
->frequency
+ indirect
->frequency
)),
1894 id
->dst_node
->clone_reference (ref
, stmt
);
1898 edge
->frequency
= new_freq
;
1900 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
1901 && (edge_freq
> edge
->frequency
+ 10
1902 || edge_freq
< edge
->frequency
- 10))
1904 fprintf (dump_file
, "Edge frequency estimated by "
1905 "cgraph %i diverge from inliner's estimate %i\n",
1909 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1912 copy_basic_block
->frequency
);
1918 case CB_CGE_MOVE_CLONES
:
1919 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
1921 edge
= id
->dst_node
->get_edge (stmt
);
1925 edge
= id
->dst_node
->get_edge (orig_stmt
);
1927 edge
->set_call_stmt (call_stmt
);
1934 /* Constant propagation on argument done during inlining
1935 may create new direct call. Produce an edge for it. */
1937 || (edge
->indirect_inlining_edge
1938 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1939 && id
->dst_node
->definition
1940 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1942 struct cgraph_node
*dest
= cgraph_node::get (fn
);
1944 /* We have missing edge in the callgraph. This can happen
1945 when previous inlining turned an indirect call into a
1946 direct call by constant propagating arguments or we are
1947 producing dead clone (for further cloning). In all
1948 other cases we hit a bug (incorrect node sharing is the
1949 most common reason for missing edges). */
1950 gcc_assert (!dest
->definition
1951 || dest
->address_taken
1952 || !id
->src_node
->definition
1953 || !id
->dst_node
->definition
);
1954 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1955 id
->dst_node
->create_edge_including_clones
1956 (dest
, orig_stmt
, call_stmt
, bb
->count
,
1957 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1959 CIF_ORIGINALLY_INDIRECT_CALL
);
1961 id
->dst_node
->create_edge (dest
, call_stmt
,
1963 compute_call_stmt_bb_frequency
1964 (id
->dst_node
->decl
,
1965 copy_basic_block
))->inline_failed
1966 = CIF_ORIGINALLY_INDIRECT_CALL
;
1969 fprintf (dump_file
, "Created new direct edge to %s\n",
1974 notice_special_calls (as_a
<gcall
*> (stmt
));
1977 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1978 id
->eh_map
, id
->eh_lp_nr
);
1980 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1985 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1986 if (TREE_CODE (def
) == SSA_NAME
)
1987 SSA_NAME_DEF_STMT (def
) = stmt
;
1990 gsi_next (©_gsi
);
1992 while (!gsi_end_p (copy_gsi
));
1994 copy_gsi
= gsi_last_bb (copy_basic_block
);
1997 return copy_basic_block
;
2000 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2001 form is quite easy, since dominator relationship for old basic blocks does
2004 There is however exception where inlining might change dominator relation
2005 across EH edges from basic block within inlined functions destinating
2006 to landing pads in function we inline into.
2008 The function fills in PHI_RESULTs of such PHI nodes if they refer
2009 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2010 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2011 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2012 set, and this means that there will be no overlapping live ranges
2013 for the underlying symbol.
2015 This might change in future if we allow redirecting of EH edges and
2016 we might want to change way build CFG pre-inlining to include
2017 all the possible edges then. */
2019 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2020 bool can_throw
, bool nonlocal_goto
)
2025 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2027 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2033 gcc_assert (e
->flags
& EDGE_EH
);
2036 gcc_assert (!(e
->flags
& EDGE_EH
));
2038 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2044 /* For abnormal goto/call edges the receiver can be the
2045 ENTRY_BLOCK. Do not assert this cannot happen. */
2047 gcc_assert ((e
->flags
& EDGE_EH
)
2048 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2050 re
= find_edge (ret_bb
, e
->dest
);
2051 gcc_checking_assert (re
);
2052 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2053 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2055 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2056 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2062 /* Copy edges from BB into its copy constructed earlier, scale profile
2063 accordingly. Edges will be taken care of later. Assume aux
2064 pointers to point to the copies of each BB. Return true if any
2065 debug stmts are left after a statement that must end the basic block. */
2068 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
2069 basic_block abnormal_goto_dest
)
2071 basic_block new_bb
= (basic_block
) bb
->aux
;
2074 gimple_stmt_iterator si
;
2076 bool need_debug_cleanup
= false;
2078 /* Use the indices from the original blocks to create edges for the
2080 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2081 if (!(old_edge
->flags
& EDGE_EH
))
2085 flags
= old_edge
->flags
;
2087 /* Return edges do get a FALLTHRU flag when the get inlined. */
2088 if (old_edge
->dest
->index
== EXIT_BLOCK
2089 && !(old_edge
->flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2090 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2091 flags
|= EDGE_FALLTHRU
;
2092 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2093 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
2094 new_edge
->probability
= old_edge
->probability
;
2097 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2100 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2103 bool can_throw
, nonlocal_goto
;
2105 copy_stmt
= gsi_stmt (si
);
2106 if (!is_gimple_debug (copy_stmt
))
2107 update_stmt (copy_stmt
);
2109 /* Do this before the possible split_block. */
2112 /* If this tree could throw an exception, there are two
2113 cases where we need to add abnormal edge(s): the
2114 tree wasn't in a region and there is a "current
2115 region" in the caller; or the original tree had
2116 EH edges. In both cases split the block after the tree,
2117 and add abnormal edge(s) as needed; we need both
2118 those from the callee and the caller.
2119 We check whether the copy can throw, because the const
2120 propagation can change an INDIRECT_REF which throws
2121 into a COMPONENT_REF which doesn't. If the copy
2122 can throw, the original could also throw. */
2123 can_throw
= stmt_can_throw_internal (copy_stmt
);
2125 = (stmt_can_make_abnormal_goto (copy_stmt
)
2126 && !computed_goto_p (copy_stmt
));
2128 if (can_throw
|| nonlocal_goto
)
2130 if (!gsi_end_p (si
))
2132 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2135 need_debug_cleanup
= true;
2137 if (!gsi_end_p (si
))
2138 /* Note that bb's predecessor edges aren't necessarily
2139 right at this point; split_block doesn't care. */
2141 edge e
= split_block (new_bb
, copy_stmt
);
2144 new_bb
->aux
= e
->src
->aux
;
2145 si
= gsi_start_bb (new_bb
);
2149 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2150 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2152 make_eh_edges (copy_stmt
);
2154 /* If the call we inline cannot make abnormal goto do not add
2155 additional abnormal edges but only retain those already present
2156 in the original function body. */
2157 if (abnormal_goto_dest
== NULL
)
2158 nonlocal_goto
= false;
2161 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2163 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2164 nonlocal_goto
= false;
2165 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2166 in OpenMP regions which aren't allowed to be left abnormally.
2167 So, no need to add abnormal edge in that case. */
2168 else if (is_gimple_call (copy_stmt
)
2169 && gimple_call_internal_p (copy_stmt
)
2170 && (gimple_call_internal_fn (copy_stmt
)
2171 == IFN_ABNORMAL_DISPATCHER
)
2172 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2173 nonlocal_goto
= false;
2175 make_edge (copy_stmt_bb
, abnormal_goto_dest
, EDGE_ABNORMAL
);
2178 if ((can_throw
|| nonlocal_goto
)
2179 && gimple_in_ssa_p (cfun
))
2180 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2181 can_throw
, nonlocal_goto
);
2183 return need_debug_cleanup
;
2186 /* Copy the PHIs. All blocks and edges are copied, some blocks
2187 was possibly split and new outgoing EH edges inserted.
2188 BB points to the block of original function and AUX pointers links
2189 the original and newly copied blocks. */
2192 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2194 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2199 bool inserted
= false;
2201 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2207 res
= PHI_RESULT (phi
);
2209 if (!virtual_operand_p (res
))
2211 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2212 new_phi
= create_phi_node (new_res
, new_bb
);
2213 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2215 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2221 /* When doing partial cloning, we allow PHIs on the entry block
2222 as long as all the arguments are the same. Find any input
2223 edge to see argument to copy. */
2225 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2226 if (!old_edge
->src
->aux
)
2229 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2231 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2232 gcc_assert (new_arg
);
2233 /* With return slot optimization we can end up with
2234 non-gimple (foo *)&this->m, fix that here. */
2235 if (TREE_CODE (new_arg
) != SSA_NAME
2236 && TREE_CODE (new_arg
) != FUNCTION_DECL
2237 && !is_gimple_val (new_arg
))
2239 gimple_seq stmts
= NULL
;
2240 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2241 gsi_insert_seq_on_edge (new_edge
, stmts
);
2244 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2245 if (LOCATION_BLOCK (locus
))
2248 n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
2251 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2253 locus
= LOCATION_LOCUS (locus
);
2256 locus
= LOCATION_LOCUS (locus
);
2258 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2263 /* Commit the delayed edge insertions. */
2265 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2266 gsi_commit_one_edge_insert (new_edge
, NULL
);
2270 /* Wrapper for remap_decl so it can be used as a callback. */
2273 remap_decl_1 (tree decl
, void *data
)
2275 return remap_decl (decl
, (copy_body_data
*) data
);
2278 /* Build struct function and associated datastructures for the new clone
2279 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2280 the cfun to the function of new_fndecl (and current_function_decl too). */
2283 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2285 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2286 gcov_type count_scale
;
2288 if (!DECL_ARGUMENTS (new_fndecl
))
2289 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2290 if (!DECL_RESULT (new_fndecl
))
2291 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2293 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2295 = GCOV_COMPUTE_SCALE (count
,
2296 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2298 count_scale
= REG_BR_PROB_BASE
;
2300 /* Register specific tree functions. */
2301 gimple_register_cfg_hooks ();
2303 /* Get clean struct function. */
2304 push_struct_function (new_fndecl
);
2306 /* We will rebuild these, so just sanity check that they are empty. */
2307 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2308 gcc_assert (cfun
->local_decls
== NULL
);
2309 gcc_assert (cfun
->cfg
== NULL
);
2310 gcc_assert (cfun
->decl
== new_fndecl
);
2312 /* Copy items we preserve during cloning. */
2313 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2314 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2315 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2316 cfun
->curr_properties
= src_cfun
->curr_properties
;
2317 cfun
->last_verified
= src_cfun
->last_verified
;
2318 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2319 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2320 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2321 cfun
->stdarg
= src_cfun
->stdarg
;
2322 cfun
->after_inlining
= src_cfun
->after_inlining
;
2323 cfun
->can_throw_non_call_exceptions
2324 = src_cfun
->can_throw_non_call_exceptions
;
2325 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2326 cfun
->returns_struct
= src_cfun
->returns_struct
;
2327 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2329 init_empty_tree_cfg ();
2331 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2332 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2333 (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2335 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2336 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2337 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2338 (EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2340 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2341 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2343 init_eh_for_function ();
2345 if (src_cfun
->gimple_df
)
2347 init_tree_ssa (cfun
);
2348 cfun
->gimple_df
->in_ssa_p
= true;
2349 init_ssa_operands (cfun
);
2353 /* Helper function for copy_cfg_body. Move debug stmts from the end
2354 of NEW_BB to the beginning of successor basic blocks when needed. If the
2355 successor has multiple predecessors, reset them, otherwise keep
2359 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2363 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2366 || gsi_one_before_end_p (si
)
2367 || !(stmt_can_throw_internal (gsi_stmt (si
))
2368 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2371 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2373 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2374 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2375 while (is_gimple_debug (gsi_stmt (ssi
)))
2377 gimple stmt
= gsi_stmt (ssi
);
2382 /* For the last edge move the debug stmts instead of copying
2384 if (ei_one_before_end_p (ei
))
2388 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2389 gimple_debug_bind_reset_value (stmt
);
2390 gsi_remove (&si
, false);
2391 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2395 if (gimple_debug_bind_p (stmt
))
2397 var
= gimple_debug_bind_get_var (stmt
);
2398 if (single_pred_p (e
->dest
))
2400 value
= gimple_debug_bind_get_value (stmt
);
2401 value
= unshare_expr (value
);
2405 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2407 else if (gimple_debug_source_bind_p (stmt
))
2409 var
= gimple_debug_source_bind_get_var (stmt
);
2410 value
= gimple_debug_source_bind_get_value (stmt
);
2411 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2415 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2416 id
->debug_stmts
.safe_push (new_stmt
);
2422 /* Make a copy of the sub-loops of SRC_PARENT and place them
2423 as siblings of DEST_PARENT. */
2426 copy_loops (copy_body_data
*id
,
2427 struct loop
*dest_parent
, struct loop
*src_parent
)
2429 struct loop
*src_loop
= src_parent
->inner
;
2432 if (!id
->blocks_to_copy
2433 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2435 struct loop
*dest_loop
= alloc_loop ();
2437 /* Assign the new loop its header and latch and associate
2438 those with the new loop. */
2439 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2440 dest_loop
->header
->loop_father
= dest_loop
;
2441 if (src_loop
->latch
!= NULL
)
2443 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2444 dest_loop
->latch
->loop_father
= dest_loop
;
2447 /* Copy loop meta-data. */
2448 copy_loop_info (src_loop
, dest_loop
);
2450 /* Finally place it into the loop array and the loop tree. */
2451 place_new_loop (cfun
, dest_loop
);
2452 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2454 dest_loop
->safelen
= src_loop
->safelen
;
2455 dest_loop
->dont_vectorize
= src_loop
->dont_vectorize
;
2456 if (src_loop
->force_vectorize
)
2458 dest_loop
->force_vectorize
= true;
2459 cfun
->has_force_vectorize_loops
= true;
2461 if (src_loop
->simduid
)
2463 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2464 cfun
->has_simduid_loops
= true;
2468 copy_loops (id
, dest_loop
, src_loop
);
2470 src_loop
= src_loop
->next
;
2474 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2477 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2479 gimple_stmt_iterator si
;
2480 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2482 if (is_gimple_call (gsi_stmt (si
)))
2484 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (gsi_stmt (si
));
2486 edge
->redirect_call_stmt_to_callee ();
2491 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2492 with each bb's frequency. Used when NODE has a 0-weight entry
2493 but we are about to inline it into a non-zero count call bb.
2494 See the comments for handle_missing_profiles() in predict.c for
2495 when this can happen for COMDATs. */
2498 freqs_to_counts (struct cgraph_node
*node
, gcov_type count
)
2503 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2505 FOR_ALL_BB_FN(bb
, fn
)
2507 bb
->count
= apply_scale (count
,
2508 GCOV_COMPUTE_SCALE (bb
->frequency
, BB_FREQ_MAX
));
2509 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2510 e
->count
= apply_probability (e
->src
->count
, e
->probability
);
2514 /* Make a copy of the body of FN so that it can be inserted inline in
2515 another function. Walks FN via CFG, returns new fndecl. */
2518 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2519 basic_block entry_block_map
, basic_block exit_block_map
,
2520 basic_block new_entry
)
2522 tree callee_fndecl
= id
->src_fn
;
2523 /* Original cfun for the callee, doesn't change. */
2524 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2525 struct function
*cfun_to_copy
;
2527 tree new_fndecl
= NULL
;
2528 bool need_debug_cleanup
= false;
2529 gcov_type count_scale
;
2531 int incoming_frequency
= 0;
2532 gcov_type incoming_count
= 0;
2534 /* This can happen for COMDAT routines that end up with 0 counts
2535 despite being called (see the comments for handle_missing_profiles()
2536 in predict.c as to why). Apply counts to the blocks in the callee
2537 before inlining, using the guessed edge frequencies, so that we don't
2538 end up with a 0-count inline body which can confuse downstream
2539 optimizations such as function splitting. */
2540 if (!ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
&& count
)
2542 /* Apply the larger of the call bb count and the total incoming
2543 call edge count to the callee. */
2544 gcov_type in_count
= 0;
2545 struct cgraph_edge
*in_edge
;
2546 for (in_edge
= id
->src_node
->callers
; in_edge
;
2547 in_edge
= in_edge
->next_caller
)
2548 in_count
+= in_edge
->count
;
2549 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2552 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2554 = GCOV_COMPUTE_SCALE (count
,
2555 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2557 count_scale
= REG_BR_PROB_BASE
;
2559 /* Register specific tree functions. */
2560 gimple_register_cfg_hooks ();
2562 /* If we are inlining just region of the function, make sure to connect
2563 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2564 part of loop, we must compute frequency and probability of
2565 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2566 probabilities of edges incoming from nonduplicated region. */
2572 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2575 incoming_frequency
+= EDGE_FREQUENCY (e
);
2576 incoming_count
+= e
->count
;
2578 incoming_count
= apply_scale (incoming_count
, count_scale
);
2580 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2581 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2582 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2585 /* Must have a CFG here at this point. */
2586 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2587 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2589 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2591 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2592 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2593 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2594 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2596 /* Duplicate any exception-handling regions. */
2598 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2601 /* Use aux pointers to map the original blocks to copy. */
2602 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2603 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2605 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2608 new_bb
->loop_father
= entry_block_map
->loop_father
;
2611 last
= last_basic_block_for_fn (cfun
);
2613 /* Now that we've duplicated the blocks, duplicate their edges. */
2614 basic_block abnormal_goto_dest
= NULL
;
2616 && stmt_can_make_abnormal_goto (id
->call_stmt
))
2618 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
2620 bb
= gimple_bb (id
->call_stmt
);
2622 if (gsi_end_p (gsi
))
2623 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2625 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2626 if (!id
->blocks_to_copy
2627 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2628 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2629 abnormal_goto_dest
);
2633 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2634 e
->probability
= REG_BR_PROB_BASE
;
2635 e
->count
= incoming_count
;
2638 /* Duplicate the loop tree, if available and wanted. */
2639 if (loops_for_fn (src_cfun
) != NULL
2640 && current_loops
!= NULL
)
2642 copy_loops (id
, entry_block_map
->loop_father
,
2643 get_loop (src_cfun
, 0));
2644 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2645 loops_state_set (LOOPS_NEED_FIXUP
);
2648 /* If the loop tree in the source function needed fixup, mark the
2649 destination loop tree for fixup, too. */
2650 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2651 loops_state_set (LOOPS_NEED_FIXUP
);
2653 if (gimple_in_ssa_p (cfun
))
2654 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2655 if (!id
->blocks_to_copy
2656 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2657 copy_phis_for_bb (bb
, id
);
2659 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2662 if (need_debug_cleanup
2663 && bb
->index
!= ENTRY_BLOCK
2664 && bb
->index
!= EXIT_BLOCK
)
2665 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2666 /* Update call edge destinations. This can not be done before loop
2667 info is updated, because we may split basic blocks. */
2668 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2669 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2670 ((basic_block
)bb
->aux
)->aux
= NULL
;
2674 /* Zero out AUX fields of newly created block during EH edge
2676 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2678 if (need_debug_cleanup
)
2679 maybe_move_debug_stmts_to_successors (id
,
2680 BASIC_BLOCK_FOR_FN (cfun
, last
));
2681 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2682 /* Update call edge destinations. This can not be done before loop
2683 info is updated, because we may split basic blocks. */
2684 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2685 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2687 entry_block_map
->aux
= NULL
;
2688 exit_block_map
->aux
= NULL
;
2699 /* Copy the debug STMT using ID. We deal with these statements in a
2700 special way: if any variable in their VALUE expression wasn't
2701 remapped yet, we won't remap it, because that would get decl uids
2702 out of sync, causing codegen differences between -g and -g0. If
2703 this arises, we drop the VALUE expression altogether. */
2706 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
2709 struct walk_stmt_info wi
;
2711 if (gimple_block (stmt
))
2713 n
= id
->decl_map
->get (gimple_block (stmt
));
2714 gimple_set_block (stmt
, n
? *n
: id
->block
);
2717 /* Remap all the operands in COPY. */
2718 memset (&wi
, 0, sizeof (wi
));
2721 processing_debug_stmt
= 1;
2723 if (gimple_debug_source_bind_p (stmt
))
2724 t
= gimple_debug_source_bind_get_var (stmt
);
2726 t
= gimple_debug_bind_get_var (stmt
);
2728 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2729 && (n
= id
->debug_map
->get (t
)))
2731 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2734 else if (TREE_CODE (t
) == VAR_DECL
2735 && !is_global_var (t
)
2736 && !id
->decl_map
->get (t
))
2737 /* T is a non-localized variable. */;
2739 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2741 if (gimple_debug_bind_p (stmt
))
2743 gimple_debug_bind_set_var (stmt
, t
);
2745 if (gimple_debug_bind_has_value_p (stmt
))
2746 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2747 remap_gimple_op_r
, &wi
, NULL
);
2749 /* Punt if any decl couldn't be remapped. */
2750 if (processing_debug_stmt
< 0)
2751 gimple_debug_bind_reset_value (stmt
);
2753 else if (gimple_debug_source_bind_p (stmt
))
2755 gimple_debug_source_bind_set_var (stmt
, t
);
2756 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2757 remap_gimple_op_r
, &wi
, NULL
);
2758 /* When inlining and source bind refers to one of the optimized
2759 away parameters, change the source bind into normal debug bind
2760 referring to the corresponding DEBUG_EXPR_DECL that should have
2761 been bound before the call stmt. */
2762 t
= gimple_debug_source_bind_get_value (stmt
);
2764 && TREE_CODE (t
) == PARM_DECL
2767 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2769 if (debug_args
!= NULL
)
2771 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2772 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2773 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2775 t
= (**debug_args
)[i
+ 1];
2776 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2777 gimple_debug_bind_set_value (stmt
, t
);
2784 processing_debug_stmt
= 0;
2789 /* Process deferred debug stmts. In order to give values better odds
2790 of being successfully remapped, we delay the processing of debug
2791 stmts until all other stmts that might require remapping are
2795 copy_debug_stmts (copy_body_data
*id
)
2800 if (!id
->debug_stmts
.exists ())
2803 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2804 copy_debug_stmt (stmt
, id
);
2806 id
->debug_stmts
.release ();
2809 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2810 another function. */
2813 copy_tree_body (copy_body_data
*id
)
2815 tree fndecl
= id
->src_fn
;
2816 tree body
= DECL_SAVED_TREE (fndecl
);
2818 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2823 /* Make a copy of the body of FN so that it can be inserted inline in
2824 another function. */
2827 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2828 basic_block entry_block_map
, basic_block exit_block_map
,
2829 basic_block new_entry
)
2831 tree fndecl
= id
->src_fn
;
2834 /* If this body has a CFG, walk CFG and copy. */
2835 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2836 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2838 copy_debug_stmts (id
);
2843 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2844 defined in function FN, or of a data member thereof. */
2847 self_inlining_addr_expr (tree value
, tree fn
)
2851 if (TREE_CODE (value
) != ADDR_EXPR
)
2854 var
= get_base_address (TREE_OPERAND (value
, 0));
2856 return var
&& auto_var_in_fn_p (var
, fn
);
2859 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2860 lexical block and line number information from base_stmt, if given,
2861 or from the last stmt of the block otherwise. */
2864 insert_init_debug_bind (copy_body_data
*id
,
2865 basic_block bb
, tree var
, tree value
,
2869 gimple_stmt_iterator gsi
;
2872 if (!gimple_in_ssa_p (id
->src_cfun
))
2875 if (!MAY_HAVE_DEBUG_STMTS
)
2878 tracked_var
= target_for_debug_bind (var
);
2884 gsi
= gsi_last_bb (bb
);
2885 if (!base_stmt
&& !gsi_end_p (gsi
))
2886 base_stmt
= gsi_stmt (gsi
);
2889 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2893 if (!gsi_end_p (gsi
))
2894 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2896 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2903 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2905 /* If VAR represents a zero-sized variable, it's possible that the
2906 assignment statement may result in no gimple statements. */
2909 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2911 /* We can end up with init statements that store to a non-register
2912 from a rhs with a conversion. Handle that here by forcing the
2913 rhs into a temporary. gimple_regimplify_operands is not
2914 prepared to do this for us. */
2915 if (!is_gimple_debug (init_stmt
)
2916 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2917 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2918 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2920 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2921 gimple_expr_type (init_stmt
),
2922 gimple_assign_rhs1 (init_stmt
));
2923 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2925 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2926 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2928 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2929 gimple_regimplify_operands (init_stmt
, &si
);
2931 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2933 tree def
= gimple_assign_lhs (init_stmt
);
2934 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2939 /* Initialize parameter P with VALUE. If needed, produce init statement
2940 at the end of BB. When BB is NULL, we return init statement to be
2943 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2944 basic_block bb
, tree
*vars
)
2946 gimple init_stmt
= NULL
;
2949 tree def
= (gimple_in_ssa_p (cfun
)
2950 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2953 && value
!= error_mark_node
2954 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2956 /* If we can match up types by promotion/demotion do so. */
2957 if (fold_convertible_p (TREE_TYPE (p
), value
))
2958 rhs
= fold_convert (TREE_TYPE (p
), value
);
2961 /* ??? For valid programs we should not end up here.
2962 Still if we end up with truly mismatched types here, fall back
2963 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2964 GIMPLE to the following passes. */
2965 if (!is_gimple_reg_type (TREE_TYPE (value
))
2966 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2967 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2969 rhs
= build_zero_cst (TREE_TYPE (p
));
2973 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2974 here since the type of this decl must be visible to the calling
2976 var
= copy_decl_to_var (p
, id
);
2978 /* Declare this new variable. */
2979 DECL_CHAIN (var
) = *vars
;
2982 /* Make gimplifier happy about this variable. */
2983 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2985 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2986 we would not need to create a new variable here at all, if it
2987 weren't for debug info. Still, we can just use the argument
2989 if (TREE_READONLY (p
)
2990 && !TREE_ADDRESSABLE (p
)
2991 && value
&& !TREE_SIDE_EFFECTS (value
)
2994 /* We may produce non-gimple trees by adding NOPs or introduce
2995 invalid sharing when operand is not really constant.
2996 It is not big deal to prohibit constant propagation here as
2997 we will constant propagate in DOM1 pass anyway. */
2998 if (is_gimple_min_invariant (value
)
2999 && useless_type_conversion_p (TREE_TYPE (p
),
3001 /* We have to be very careful about ADDR_EXPR. Make sure
3002 the base variable isn't a local variable of the inlined
3003 function, e.g., when doing recursive inlining, direct or
3004 mutually-recursive or whatever, which is why we don't
3005 just test whether fn == current_function_decl. */
3006 && ! self_inlining_addr_expr (value
, fn
))
3008 insert_decl_map (id
, p
, value
);
3009 insert_debug_decl_map (id
, p
, var
);
3010 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3014 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3015 that way, when the PARM_DECL is encountered, it will be
3016 automatically replaced by the VAR_DECL. */
3017 insert_decl_map (id
, p
, var
);
3019 /* Even if P was TREE_READONLY, the new VAR should not be.
3020 In the original code, we would have constructed a
3021 temporary, and then the function body would have never
3022 changed the value of P. However, now, we will be
3023 constructing VAR directly. The constructor body may
3024 change its value multiple times as it is being
3025 constructed. Therefore, it must not be TREE_READONLY;
3026 the back-end assumes that TREE_READONLY variable is
3027 assigned to only once. */
3028 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
3029 TREE_READONLY (var
) = 0;
3031 /* If there is no setup required and we are in SSA, take the easy route
3032 replacing all SSA names representing the function parameter by the
3033 SSA name passed to function.
3035 We need to construct map for the variable anyway as it might be used
3036 in different SSA names when parameter is set in function.
3038 Do replacement at -O0 for const arguments replaced by constant.
3039 This is important for builtin_constant_p and other construct requiring
3040 constant argument to be visible in inlined function body. */
3041 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3043 || (TREE_READONLY (p
)
3044 && is_gimple_min_invariant (rhs
)))
3045 && (TREE_CODE (rhs
) == SSA_NAME
3046 || is_gimple_min_invariant (rhs
))
3047 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3049 insert_decl_map (id
, def
, rhs
);
3050 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3053 /* If the value of argument is never used, don't care about initializing
3055 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3057 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3058 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3061 /* Initialize this VAR_DECL from the equivalent argument. Convert
3062 the argument to the proper type in case it was promoted. */
3065 if (rhs
== error_mark_node
)
3067 insert_decl_map (id
, p
, var
);
3068 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3071 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3073 /* If we are in SSA form properly remap the default definition
3074 or assign to a dummy SSA name if the parameter is unused and
3075 we are not optimizing. */
3076 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3080 def
= remap_ssa_name (def
, id
);
3081 init_stmt
= gimple_build_assign (def
, rhs
);
3082 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3083 set_ssa_default_def (cfun
, var
, NULL
);
3087 def
= make_ssa_name (var
, NULL
);
3088 init_stmt
= gimple_build_assign (def
, rhs
);
3092 init_stmt
= gimple_build_assign (var
, rhs
);
3094 if (bb
&& init_stmt
)
3095 insert_init_stmt (id
, bb
, init_stmt
);
3100 /* Generate code to initialize the parameters of the function at the
3101 top of the stack in ID from the GIMPLE_CALL STMT. */
3104 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
3105 tree fn
, basic_block bb
)
3110 tree vars
= NULL_TREE
;
3111 tree static_chain
= gimple_call_chain (stmt
);
3113 /* Figure out what the parameters are. */
3114 parms
= DECL_ARGUMENTS (fn
);
3116 /* Loop through the parameter declarations, replacing each with an
3117 equivalent VAR_DECL, appropriately initialized. */
3118 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3121 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3122 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3124 /* After remapping parameters remap their types. This has to be done
3125 in a second loop over all parameters to appropriately remap
3126 variable sized arrays when the size is specified in a
3127 parameter following the array. */
3128 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3130 tree
*varp
= id
->decl_map
->get (p
);
3132 && TREE_CODE (*varp
) == VAR_DECL
)
3134 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3135 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3137 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3138 /* Also remap the default definition if it was remapped
3139 to the default definition of the parameter replacement
3140 by the parameter setup. */
3143 tree
*defp
= id
->decl_map
->get (def
);
3145 && TREE_CODE (*defp
) == SSA_NAME
3146 && SSA_NAME_VAR (*defp
) == var
)
3147 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3152 /* Initialize the static chain. */
3153 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3154 gcc_assert (fn
!= current_function_decl
);
3157 /* No static chain? Seems like a bug in tree-nested.c. */
3158 gcc_assert (static_chain
);
3160 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3163 declare_inline_vars (id
->block
, vars
);
3167 /* Declare a return variable to replace the RESULT_DECL for the
3168 function we are calling. An appropriate DECL_STMT is returned.
3169 The USE_STMT is filled to contain a use of the declaration to
3170 indicate the return value of the function.
3172 RETURN_SLOT, if non-null is place where to store the result. It
3173 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3174 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3176 The return value is a (possibly null) value that holds the result
3177 as seen by the caller. */
3180 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3181 basic_block entry_bb
)
3183 tree callee
= id
->src_fn
;
3184 tree result
= DECL_RESULT (callee
);
3185 tree callee_type
= TREE_TYPE (result
);
3189 /* Handle type-mismatches in the function declaration return type
3190 vs. the call expression. */
3192 caller_type
= TREE_TYPE (modify_dest
);
3194 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3196 /* We don't need to do anything for functions that don't return anything. */
3197 if (VOID_TYPE_P (callee_type
))
3200 /* If there was a return slot, then the return value is the
3201 dereferenced address of that object. */
3204 /* The front end shouldn't have used both return_slot and
3205 a modify expression. */
3206 gcc_assert (!modify_dest
);
3207 if (DECL_BY_REFERENCE (result
))
3209 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3210 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3212 /* We are going to construct *&return_slot and we can't do that
3213 for variables believed to be not addressable.
3215 FIXME: This check possibly can match, because values returned
3216 via return slot optimization are not believed to have address
3217 taken by alias analysis. */
3218 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3219 var
= return_slot_addr
;
3224 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3225 if (TREE_ADDRESSABLE (result
))
3226 mark_addressable (var
);
3228 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3229 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3230 && !DECL_GIMPLE_REG_P (result
)
3232 DECL_GIMPLE_REG_P (var
) = 0;
3237 /* All types requiring non-trivial constructors should have been handled. */
3238 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3240 /* Attempt to avoid creating a new temporary variable. */
3242 && TREE_CODE (modify_dest
) != SSA_NAME
)
3244 bool use_it
= false;
3246 /* We can't use MODIFY_DEST if there's type promotion involved. */
3247 if (!useless_type_conversion_p (callee_type
, caller_type
))
3250 /* ??? If we're assigning to a variable sized type, then we must
3251 reuse the destination variable, because we've no good way to
3252 create variable sized temporaries at this point. */
3253 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3256 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3257 reuse it as the result of the call directly. Don't do this if
3258 it would promote MODIFY_DEST to addressable. */
3259 else if (TREE_ADDRESSABLE (result
))
3263 tree base_m
= get_base_address (modify_dest
);
3265 /* If the base isn't a decl, then it's a pointer, and we don't
3266 know where that's going to go. */
3267 if (!DECL_P (base_m
))
3269 else if (is_global_var (base_m
))
3271 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3272 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3273 && !DECL_GIMPLE_REG_P (result
)
3274 && DECL_GIMPLE_REG_P (base_m
))
3276 else if (!TREE_ADDRESSABLE (base_m
))
3288 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3290 var
= copy_result_decl_to_var (result
, id
);
3291 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3293 /* Do not have the rest of GCC warn about this variable as it should
3294 not be visible to the user. */
3295 TREE_NO_WARNING (var
) = 1;
3297 declare_inline_vars (id
->block
, var
);
3299 /* Build the use expr. If the return type of the function was
3300 promoted, convert it back to the expected type. */
3302 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3304 /* If we can match up types by promotion/demotion do so. */
3305 if (fold_convertible_p (caller_type
, var
))
3306 use
= fold_convert (caller_type
, var
);
3309 /* ??? For valid programs we should not end up here.
3310 Still if we end up with truly mismatched types here, fall back
3311 to using a MEM_REF to not leak invalid GIMPLE to the following
3313 /* Prevent var from being written into SSA form. */
3314 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3315 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3316 DECL_GIMPLE_REG_P (var
) = false;
3317 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3318 TREE_ADDRESSABLE (var
) = true;
3319 use
= fold_build2 (MEM_REF
, caller_type
,
3320 build_fold_addr_expr (var
),
3321 build_int_cst (ptr_type_node
, 0));
3325 STRIP_USELESS_TYPE_CONVERSION (use
);
3327 if (DECL_BY_REFERENCE (result
))
3329 TREE_ADDRESSABLE (var
) = 1;
3330 var
= build_fold_addr_expr (var
);
3334 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3335 way, when the RESULT_DECL is encountered, it will be
3336 automatically replaced by the VAR_DECL.
3338 When returning by reference, ensure that RESULT_DECL remaps to
3340 if (DECL_BY_REFERENCE (result
)
3341 && !is_gimple_val (var
))
3343 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3344 insert_decl_map (id
, result
, temp
);
3345 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3346 it's default_def SSA_NAME. */
3347 if (gimple_in_ssa_p (id
->src_cfun
)
3348 && is_gimple_reg (result
))
3350 temp
= make_ssa_name (temp
, NULL
);
3351 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3353 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3356 insert_decl_map (id
, result
, var
);
3358 /* Remember this so we can ignore it in remap_decls. */
3364 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3365 to a local label. */
3368 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3371 tree fn
= (tree
) fnp
;
3373 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3382 /* Determine if the function can be copied. If so return NULL. If
3383 not return a string describng the reason for failure. */
3386 copy_forbidden (struct function
*fun
, tree fndecl
)
3388 const char *reason
= fun
->cannot_be_copied_reason
;
3392 /* Only examine the function once. */
3393 if (fun
->cannot_be_copied_set
)
3396 /* We cannot copy a function that receives a non-local goto
3397 because we cannot remap the destination label used in the
3398 function that is performing the non-local goto. */
3399 /* ??? Actually, this should be possible, if we work at it.
3400 No doubt there's just a handful of places that simply
3401 assume it doesn't happen and don't substitute properly. */
3402 if (fun
->has_nonlocal_label
)
3404 reason
= G_("function %q+F can never be copied "
3405 "because it receives a non-local goto");
3409 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3410 if (TREE_CODE (decl
) == VAR_DECL
3411 && TREE_STATIC (decl
)
3412 && !DECL_EXTERNAL (decl
)
3413 && DECL_INITIAL (decl
)
3414 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3415 has_label_address_in_static_1
,
3418 reason
= G_("function %q+F can never be copied because it saves "
3419 "address of local label in a static variable");
3424 fun
->cannot_be_copied_reason
= reason
;
3425 fun
->cannot_be_copied_set
= true;
3430 static const char *inline_forbidden_reason
;
3432 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3433 iff a function can not be inlined. Also sets the reason why. */
3436 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3437 struct walk_stmt_info
*wip
)
3439 tree fn
= (tree
) wip
->info
;
3441 gimple stmt
= gsi_stmt (*gsi
);
3443 switch (gimple_code (stmt
))
3446 /* Refuse to inline alloca call unless user explicitly forced so as
3447 this may change program's memory overhead drastically when the
3448 function using alloca is called in loop. In GCC present in
3449 SPEC2000 inlining into schedule_block cause it to require 2GB of
3450 RAM instead of 256MB. Don't do so for alloca calls emitted for
3451 VLA objects as those can't cause unbounded growth (they're always
3452 wrapped inside stack_save/stack_restore regions. */
3453 if (gimple_alloca_call_p (stmt
)
3454 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3455 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3457 inline_forbidden_reason
3458 = G_("function %q+F can never be inlined because it uses "
3459 "alloca (override using the always_inline attribute)");
3460 *handled_ops_p
= true;
3464 t
= gimple_call_fndecl (stmt
);
3468 /* We cannot inline functions that call setjmp. */
3469 if (setjmp_call_p (t
))
3471 inline_forbidden_reason
3472 = G_("function %q+F can never be inlined because it uses setjmp");
3473 *handled_ops_p
= true;
3477 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3478 switch (DECL_FUNCTION_CODE (t
))
3480 /* We cannot inline functions that take a variable number of
3482 case BUILT_IN_VA_START
:
3483 case BUILT_IN_NEXT_ARG
:
3484 case BUILT_IN_VA_END
:
3485 inline_forbidden_reason
3486 = G_("function %q+F can never be inlined because it "
3487 "uses variable argument lists");
3488 *handled_ops_p
= true;
3491 case BUILT_IN_LONGJMP
:
3492 /* We can't inline functions that call __builtin_longjmp at
3493 all. The non-local goto machinery really requires the
3494 destination be in a different function. If we allow the
3495 function calling __builtin_longjmp to be inlined into the
3496 function calling __builtin_setjmp, Things will Go Awry. */
3497 inline_forbidden_reason
3498 = G_("function %q+F can never be inlined because "
3499 "it uses setjmp-longjmp exception handling");
3500 *handled_ops_p
= true;
3503 case BUILT_IN_NONLOCAL_GOTO
:
3505 inline_forbidden_reason
3506 = G_("function %q+F can never be inlined because "
3507 "it uses non-local goto");
3508 *handled_ops_p
= true;
3511 case BUILT_IN_RETURN
:
3512 case BUILT_IN_APPLY_ARGS
:
3513 /* If a __builtin_apply_args caller would be inlined,
3514 it would be saving arguments of the function it has
3515 been inlined into. Similarly __builtin_return would
3516 return from the function the inline has been inlined into. */
3517 inline_forbidden_reason
3518 = G_("function %q+F can never be inlined because "
3519 "it uses __builtin_return or __builtin_apply_args");
3520 *handled_ops_p
= true;
3529 t
= gimple_goto_dest (as_a
<ggoto
*> (stmt
));
3531 /* We will not inline a function which uses computed goto. The
3532 addresses of its local labels, which may be tucked into
3533 global storage, are of course not constant across
3534 instantiations, which causes unexpected behavior. */
3535 if (TREE_CODE (t
) != LABEL_DECL
)
3537 inline_forbidden_reason
3538 = G_("function %q+F can never be inlined "
3539 "because it contains a computed goto");
3540 *handled_ops_p
= true;
3549 *handled_ops_p
= false;
3553 /* Return true if FNDECL is a function that cannot be inlined into
3557 inline_forbidden_p (tree fndecl
)
3559 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3560 struct walk_stmt_info wi
;
3562 bool forbidden_p
= false;
3564 /* First check for shared reasons not to copy the code. */
3565 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3566 if (inline_forbidden_reason
!= NULL
)
3569 /* Next, walk the statements of the function looking for
3570 constraucts we can't handle, or are non-optimal for inlining. */
3571 hash_set
<tree
> visited_nodes
;
3572 memset (&wi
, 0, sizeof (wi
));
3573 wi
.info
= (void *) fndecl
;
3574 wi
.pset
= &visited_nodes
;
3576 FOR_EACH_BB_FN (bb
, fun
)
3579 gimple_seq seq
= bb_seq (bb
);
3580 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3581 forbidden_p
= (ret
!= NULL
);
3589 /* Return false if the function FNDECL cannot be inlined on account of its
3590 attributes, true otherwise. */
3592 function_attribute_inlinable_p (const_tree fndecl
)
3594 if (targetm
.attribute_table
)
3598 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3600 const_tree name
= TREE_PURPOSE (a
);
3603 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3604 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3605 return targetm
.function_attribute_inlinable_p (fndecl
);
3612 /* Returns nonzero if FN is a function that does not have any
3613 fundamental inline blocking properties. */
3616 tree_inlinable_function_p (tree fn
)
3618 bool inlinable
= true;
3622 /* If we've already decided this function shouldn't be inlined,
3623 there's no need to check again. */
3624 if (DECL_UNINLINABLE (fn
))
3627 /* We only warn for functions declared `inline' by the user. */
3628 do_warning
= (warn_inline
3629 && DECL_DECLARED_INLINE_P (fn
)
3630 && !DECL_NO_INLINE_WARNING_P (fn
)
3631 && !DECL_IN_SYSTEM_HEADER (fn
));
3633 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3636 && always_inline
== NULL
)
3639 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3640 "is suppressed using -fno-inline", fn
);
3644 else if (!function_attribute_inlinable_p (fn
))
3647 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3648 "uses attributes conflicting with inlining", fn
);
3652 else if (inline_forbidden_p (fn
))
3654 /* See if we should warn about uninlinable functions. Previously,
3655 some of these warnings would be issued while trying to expand
3656 the function inline, but that would cause multiple warnings
3657 about functions that would for example call alloca. But since
3658 this a property of the function, just one warning is enough.
3659 As a bonus we can now give more details about the reason why a
3660 function is not inlinable. */
3662 error (inline_forbidden_reason
, fn
);
3663 else if (do_warning
)
3664 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3669 /* Squirrel away the result so that we don't have to check again. */
3670 DECL_UNINLINABLE (fn
) = !inlinable
;
3675 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
3676 word size and take possible memcpy call into account and return
3677 cost based on whether optimizing for size or speed according to SPEED_P. */
3680 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
3684 gcc_assert (!VOID_TYPE_P (type
));
3686 if (TREE_CODE (type
) == VECTOR_TYPE
)
3688 enum machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3689 enum machine_mode simd
3690 = targetm
.vectorize
.preferred_simd_mode (inner
);
3691 int simd_mode_size
= GET_MODE_SIZE (simd
);
3692 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3696 size
= int_size_in_bytes (type
);
3698 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
3699 /* Cost of a memcpy call, 3 arguments and the call. */
3702 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3705 /* Returns cost of operation CODE, according to WEIGHTS */
3708 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3709 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3713 /* These are "free" conversions, or their presumed cost
3714 is folded into other operations. */
3719 case VIEW_CONVERT_EXPR
:
3722 /* Assign cost of 1 to usual operations.
3723 ??? We may consider mapping RTL costs to this. */
3729 case POINTER_PLUS_EXPR
:
3732 case MULT_HIGHPART_EXPR
:
3735 case ADDR_SPACE_CONVERT_EXPR
:
3736 case FIXED_CONVERT_EXPR
:
3737 case FIX_TRUNC_EXPR
:
3749 case VEC_LSHIFT_EXPR
:
3750 case VEC_RSHIFT_EXPR
:
3757 case TRUTH_ANDIF_EXPR
:
3758 case TRUTH_ORIF_EXPR
:
3759 case TRUTH_AND_EXPR
:
3761 case TRUTH_XOR_EXPR
:
3762 case TRUTH_NOT_EXPR
:
3771 case UNORDERED_EXPR
:
3782 case PREDECREMENT_EXPR
:
3783 case PREINCREMENT_EXPR
:
3784 case POSTDECREMENT_EXPR
:
3785 case POSTINCREMENT_EXPR
:
3787 case REALIGN_LOAD_EXPR
:
3789 case REDUC_MAX_EXPR
:
3790 case REDUC_MIN_EXPR
:
3791 case REDUC_PLUS_EXPR
:
3792 case WIDEN_SUM_EXPR
:
3793 case WIDEN_MULT_EXPR
:
3796 case WIDEN_MULT_PLUS_EXPR
:
3797 case WIDEN_MULT_MINUS_EXPR
:
3798 case WIDEN_LSHIFT_EXPR
:
3800 case VEC_WIDEN_MULT_HI_EXPR
:
3801 case VEC_WIDEN_MULT_LO_EXPR
:
3802 case VEC_WIDEN_MULT_EVEN_EXPR
:
3803 case VEC_WIDEN_MULT_ODD_EXPR
:
3804 case VEC_UNPACK_HI_EXPR
:
3805 case VEC_UNPACK_LO_EXPR
:
3806 case VEC_UNPACK_FLOAT_HI_EXPR
:
3807 case VEC_UNPACK_FLOAT_LO_EXPR
:
3808 case VEC_PACK_TRUNC_EXPR
:
3809 case VEC_PACK_SAT_EXPR
:
3810 case VEC_PACK_FIX_TRUNC_EXPR
:
3811 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3812 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3816 /* Few special cases of expensive operations. This is useful
3817 to avoid inlining on functions having too many of these. */
3818 case TRUNC_DIV_EXPR
:
3820 case FLOOR_DIV_EXPR
:
3821 case ROUND_DIV_EXPR
:
3822 case EXACT_DIV_EXPR
:
3823 case TRUNC_MOD_EXPR
:
3825 case FLOOR_MOD_EXPR
:
3826 case ROUND_MOD_EXPR
:
3828 if (TREE_CODE (op2
) != INTEGER_CST
)
3829 return weights
->div_mod_cost
;
3833 /* We expect a copy assignment with no operator. */
3834 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3840 /* Estimate number of instructions that will be created by expanding
3841 the statements in the statement sequence STMTS.
3842 WEIGHTS contains weights attributed to various constructs. */
3845 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3848 gimple_stmt_iterator gsi
;
3851 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3852 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3858 /* Estimate number of instructions that will be created by expanding STMT.
3859 WEIGHTS contains weights attributed to various constructs. */
3862 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3865 enum gimple_code code
= gimple_code (stmt
);
3872 /* Try to estimate the cost of assignments. We have three cases to
3874 1) Simple assignments to registers;
3875 2) Stores to things that must live in memory. This includes
3876 "normal" stores to scalars, but also assignments of large
3877 structures, or constructors of big arrays;
3879 Let us look at the first two cases, assuming we have "a = b + C":
3880 <GIMPLE_ASSIGN <var_decl "a">
3881 <plus_expr <var_decl "b"> <constant C>>
3882 If "a" is a GIMPLE register, the assignment to it is free on almost
3883 any target, because "a" usually ends up in a real register. Hence
3884 the only cost of this expression comes from the PLUS_EXPR, and we
3885 can ignore the GIMPLE_ASSIGN.
3886 If "a" is not a GIMPLE register, the assignment to "a" will most
3887 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3888 of moving something into "a", which we compute using the function
3889 estimate_move_cost. */
3890 if (gimple_clobber_p (stmt
))
3891 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3893 lhs
= gimple_assign_lhs (stmt
);
3894 rhs
= gimple_assign_rhs1 (stmt
);
3898 /* Account for the cost of moving to / from memory. */
3899 if (gimple_store_p (stmt
))
3900 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
3901 if (gimple_assign_load_p (stmt
))
3902 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
3904 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3905 gimple_assign_rhs1 (stmt
),
3906 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3907 == GIMPLE_BINARY_RHS
3908 ? gimple_assign_rhs2 (stmt
) : NULL
);
3912 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3913 gimple_op (stmt
, 0),
3914 gimple_op (stmt
, 1));
3919 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
3920 /* Take into account cost of the switch + guess 2 conditional jumps for
3923 TODO: once the switch expansion logic is sufficiently separated, we can
3924 do better job on estimating cost of the switch. */
3925 if (weights
->time_based
)
3926 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
3928 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
3936 if (gimple_call_internal_p (stmt
))
3938 else if ((decl
= gimple_call_fndecl (stmt
))
3939 && DECL_BUILT_IN (decl
))
3941 /* Do not special case builtins where we see the body.
3942 This just confuse inliner. */
3943 struct cgraph_node
*node
;
3944 if (!(node
= cgraph_node::get (decl
))
3945 || node
->definition
)
3947 /* For buitins that are likely expanded to nothing or
3948 inlined do not account operand costs. */
3949 else if (is_simple_builtin (decl
))
3951 else if (is_inexpensive_builtin (decl
))
3952 return weights
->target_builtin_call_cost
;
3953 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3955 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3956 specialize the cheap expansion we do here.
3957 ??? This asks for a more general solution. */
3958 switch (DECL_FUNCTION_CODE (decl
))
3963 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3964 && REAL_VALUES_EQUAL
3965 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3966 return estimate_operator_cost
3967 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
3968 gimple_call_arg (stmt
, 0));
3977 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
3978 if (gimple_call_lhs (stmt
))
3979 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
3980 weights
->time_based
);
3981 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3983 tree arg
= gimple_call_arg (stmt
, i
);
3984 cost
+= estimate_move_cost (TREE_TYPE (arg
),
3985 weights
->time_based
);
3991 return weights
->return_cost
;
3997 case GIMPLE_PREDICT
:
4004 asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4005 /* 1000 means infinity. This avoids overflows later
4006 with very long asm statements. */
4013 /* This is either going to be an external function call with one
4014 argument, or two register copy statements plus a goto. */
4017 case GIMPLE_EH_DISPATCH
:
4018 /* ??? This is going to turn into a switch statement. Ideally
4019 we'd have a look at the eh region and estimate the number of
4024 return estimate_num_insns_seq (
4025 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4028 case GIMPLE_EH_FILTER
:
4029 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4032 return estimate_num_insns_seq (gimple_catch_handler (
4033 as_a
<gcatch
*> (stmt
)),
4038 gtry
*try_stmt
= as_a
<gtry
*> (stmt
);
4039 return (estimate_num_insns_seq (gimple_try_eval (try_stmt
), weights
)
4040 + estimate_num_insns_seq (gimple_try_cleanup (try_stmt
),
4044 /* OpenMP directives are generally very expensive. */
4046 case GIMPLE_OMP_RETURN
:
4047 case GIMPLE_OMP_SECTIONS_SWITCH
:
4048 case GIMPLE_OMP_ATOMIC_STORE
:
4049 case GIMPLE_OMP_CONTINUE
:
4050 /* ...except these, which are cheap. */
4053 case GIMPLE_OMP_ATOMIC_LOAD
:
4054 return weights
->omp_cost
;
4056 case GIMPLE_OMP_FOR
:
4058 gomp_for
*omp_for_stmt
= as_a
<gomp_for
*> (stmt
);
4059 return (weights
->omp_cost
4060 + estimate_num_insns_seq (gimple_omp_body (omp_for_stmt
),
4062 + estimate_num_insns_seq (gimple_omp_for_pre_body (omp_for_stmt
),
4066 case GIMPLE_OMP_PARALLEL
:
4067 case GIMPLE_OMP_TASK
:
4068 case GIMPLE_OMP_CRITICAL
:
4069 case GIMPLE_OMP_MASTER
:
4070 case GIMPLE_OMP_TASKGROUP
:
4071 case GIMPLE_OMP_ORDERED
:
4072 case GIMPLE_OMP_SECTION
:
4073 case GIMPLE_OMP_SECTIONS
:
4074 case GIMPLE_OMP_SINGLE
:
4075 case GIMPLE_OMP_TARGET
:
4076 case GIMPLE_OMP_TEAMS
:
4077 return (weights
->omp_cost
4078 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4080 case GIMPLE_TRANSACTION
:
4081 return (weights
->tm_cost
4082 + estimate_num_insns_seq (gimple_transaction_body (
4083 as_a
<gtransaction
*> (stmt
)),
4093 /* Estimate number of instructions that will be created by expanding
4094 function FNDECL. WEIGHTS contains weights attributed to various
4098 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4100 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4101 gimple_stmt_iterator bsi
;
4105 gcc_assert (my_function
&& my_function
->cfg
);
4106 FOR_EACH_BB_FN (bb
, my_function
)
4108 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4109 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4116 /* Initializes weights used by estimate_num_insns. */
4119 init_inline_once (void)
4121 eni_size_weights
.call_cost
= 1;
4122 eni_size_weights
.indirect_call_cost
= 3;
4123 eni_size_weights
.target_builtin_call_cost
= 1;
4124 eni_size_weights
.div_mod_cost
= 1;
4125 eni_size_weights
.omp_cost
= 40;
4126 eni_size_weights
.tm_cost
= 10;
4127 eni_size_weights
.time_based
= false;
4128 eni_size_weights
.return_cost
= 1;
4130 /* Estimating time for call is difficult, since we have no idea what the
4131 called function does. In the current uses of eni_time_weights,
4132 underestimating the cost does less harm than overestimating it, so
4133 we choose a rather small value here. */
4134 eni_time_weights
.call_cost
= 10;
4135 eni_time_weights
.indirect_call_cost
= 15;
4136 eni_time_weights
.target_builtin_call_cost
= 1;
4137 eni_time_weights
.div_mod_cost
= 10;
4138 eni_time_weights
.omp_cost
= 40;
4139 eni_time_weights
.tm_cost
= 40;
4140 eni_time_weights
.time_based
= true;
4141 eni_time_weights
.return_cost
= 2;
4144 /* Estimate the number of instructions in a gimple_seq. */
4147 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
4149 gimple_stmt_iterator gsi
;
4151 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4152 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4158 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4161 prepend_lexical_block (tree current_block
, tree new_block
)
4163 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4164 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4165 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4168 /* Add local variables from CALLEE to CALLER. */
4171 add_local_variables (struct function
*callee
, struct function
*caller
,
4177 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4178 if (!can_be_nonlocal (var
, id
))
4180 tree new_var
= remap_decl (var
, id
);
4182 /* Remap debug-expressions. */
4183 if (TREE_CODE (new_var
) == VAR_DECL
4184 && DECL_HAS_DEBUG_EXPR_P (var
)
4187 tree tem
= DECL_DEBUG_EXPR (var
);
4188 bool old_regimplify
= id
->regimplify
;
4189 id
->remapping_type_depth
++;
4190 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4191 id
->remapping_type_depth
--;
4192 id
->regimplify
= old_regimplify
;
4193 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4194 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4196 add_local_decl (caller
, new_var
);
4200 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4203 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
4207 hash_map
<tree
, tree
> *dst
;
4208 hash_map
<tree
, tree
> *st
= NULL
;
4211 location_t saved_location
;
4212 struct cgraph_edge
*cg_edge
;
4213 cgraph_inline_failed_t reason
;
4214 basic_block return_block
;
4216 gimple_stmt_iterator gsi
, stmt_gsi
;
4217 bool successfully_inlined
= FALSE
;
4218 bool purge_dead_abnormal_edges
;
4221 /* Set input_location here so we get the right instantiation context
4222 if we call instantiate_decl from inlinable_function_p. */
4223 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
4224 saved_location
= input_location
;
4225 input_location
= gimple_location (stmt
);
4227 /* From here on, we're only interested in CALL_EXPRs. */
4228 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4232 cg_edge
= id
->dst_node
->get_edge (stmt
);
4233 gcc_checking_assert (cg_edge
);
4234 /* First, see if we can figure out what function is being called.
4235 If we cannot, then there is no hope of inlining the function. */
4236 if (cg_edge
->indirect_unknown_callee
)
4238 fn
= cg_edge
->callee
->decl
;
4239 gcc_checking_assert (fn
);
4241 /* If FN is a declaration of a function in a nested scope that was
4242 globally declared inline, we don't set its DECL_INITIAL.
4243 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4244 C++ front-end uses it for cdtors to refer to their internal
4245 declarations, that are not real functions. Fortunately those
4246 don't have trees to be saved, so we can tell by checking their
4248 if (!DECL_INITIAL (fn
)
4249 && DECL_ABSTRACT_ORIGIN (fn
)
4250 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4251 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4253 /* Don't try to inline functions that are not well-suited to inlining. */
4254 if (cg_edge
->inline_failed
)
4256 reason
= cg_edge
->inline_failed
;
4257 /* If this call was originally indirect, we do not want to emit any
4258 inlining related warnings or sorry messages because there are no
4259 guarantees regarding those. */
4260 if (cg_edge
->indirect_inlining_edge
)
4263 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4264 /* For extern inline functions that get redefined we always
4265 silently ignored always_inline flag. Better behaviour would
4266 be to be able to keep both bodies and use extern inline body
4267 for inlining, but we can't do that because frontends overwrite
4269 && !cg_edge
->callee
->local
.redefined_extern_inline
4270 /* During early inline pass, report only when optimization is
4272 && (symtab
->global_info_ready
4274 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4275 /* PR 20090218-1_0.c. Body can be provided by another module. */
4276 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4278 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4279 cgraph_inline_failed_string (reason
));
4280 error ("called from here");
4282 else if (warn_inline
4283 && DECL_DECLARED_INLINE_P (fn
)
4284 && !DECL_NO_INLINE_WARNING_P (fn
)
4285 && !DECL_IN_SYSTEM_HEADER (fn
)
4286 && reason
!= CIF_UNSPECIFIED
4287 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4288 /* Do not warn about not inlined recursive calls. */
4289 && !cg_edge
->recursive_p ()
4290 /* Avoid warnings during early inline pass. */
4291 && symtab
->global_info_ready
)
4293 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4294 fn
, _(cgraph_inline_failed_string (reason
)));
4295 warning (OPT_Winline
, "called from here");
4299 fn
= cg_edge
->callee
->decl
;
4300 cg_edge
->callee
->get_body ();
4302 #ifdef ENABLE_CHECKING
4303 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4304 cg_edge
->callee
->verify ();
4307 /* We will be inlining this callee. */
4308 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4310 /* Update the callers EH personality. */
4311 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4312 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4313 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4315 /* Split the block holding the GIMPLE_CALL. */
4316 e
= split_block (bb
, stmt
);
4318 return_block
= e
->dest
;
4321 /* split_block splits after the statement; work around this by
4322 moving the call into the second block manually. Not pretty,
4323 but seems easier than doing the CFG manipulation by hand
4324 when the GIMPLE_CALL is in the last statement of BB. */
4325 stmt_gsi
= gsi_last_bb (bb
);
4326 gsi_remove (&stmt_gsi
, false);
4328 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4329 been the source of abnormal edges. In this case, schedule
4330 the removal of dead abnormal edges. */
4331 gsi
= gsi_start_bb (return_block
);
4332 if (gsi_end_p (gsi
))
4334 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4335 purge_dead_abnormal_edges
= true;
4339 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4340 purge_dead_abnormal_edges
= false;
4343 stmt_gsi
= gsi_start_bb (return_block
);
4345 /* Build a block containing code to initialize the arguments, the
4346 actual inline expansion of the body, and a label for the return
4347 statements within the function to jump to. The type of the
4348 statement expression is the return type of the function call.
4349 ??? If the call does not have an associated block then we will
4350 remap all callee blocks to NULL, effectively dropping most of
4351 its debug information. This should only happen for calls to
4352 artificial decls inserted by the compiler itself. We need to
4353 either link the inlined blocks into the caller block tree or
4354 not refer to them in any way to not break GC for locations. */
4355 if (gimple_block (stmt
))
4357 id
->block
= make_node (BLOCK
);
4358 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4359 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
4360 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4363 /* Local declarations will be replaced by their equivalents in this
4366 id
->decl_map
= new hash_map
<tree
, tree
>;
4367 dst
= id
->debug_map
;
4368 id
->debug_map
= NULL
;
4370 /* Record the function we are about to inline. */
4372 id
->src_node
= cg_edge
->callee
;
4373 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4374 id
->call_stmt
= stmt
;
4376 gcc_assert (!id
->src_cfun
->after_inlining
);
4379 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4381 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4382 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4386 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4388 if (DECL_INITIAL (fn
))
4390 if (gimple_block (stmt
))
4394 prepend_lexical_block (id
->block
,
4395 remap_blocks (DECL_INITIAL (fn
), id
));
4396 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4397 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4399 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4400 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4401 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4402 under it. The parameters can be then evaluated in the debugger,
4403 but don't show in backtraces. */
4404 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4405 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4408 *var
= TREE_CHAIN (v
);
4409 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4410 BLOCK_VARS (id
->block
) = v
;
4413 var
= &TREE_CHAIN (*var
);
4416 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4419 /* Return statements in the function body will be replaced by jumps
4420 to the RET_LABEL. */
4421 gcc_assert (DECL_INITIAL (fn
));
4422 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4424 /* Find the LHS to which the result of this call is assigned. */
4426 if (gimple_call_lhs (stmt
))
4428 modify_dest
= gimple_call_lhs (stmt
);
4430 /* The function which we are inlining might not return a value,
4431 in which case we should issue a warning that the function
4432 does not return a value. In that case the optimizers will
4433 see that the variable to which the value is assigned was not
4434 initialized. We do not want to issue a warning about that
4435 uninitialized variable. */
4436 if (DECL_P (modify_dest
))
4437 TREE_NO_WARNING (modify_dest
) = 1;
4439 if (gimple_call_return_slot_opt_p (call_stmt
))
4441 return_slot
= modify_dest
;
4448 /* If we are inlining a call to the C++ operator new, we don't want
4449 to use type based alias analysis on the return value. Otherwise
4450 we may get confused if the compiler sees that the inlined new
4451 function returns a pointer which was just deleted. See bug
4453 if (DECL_IS_OPERATOR_NEW (fn
))
4459 /* Declare the return variable for the function. */
4460 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4462 /* Add local vars in this inlined callee to caller. */
4463 add_local_variables (id
->src_cfun
, cfun
, id
);
4465 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4467 fprintf (dump_file
, "Inlining ");
4468 print_generic_expr (dump_file
, id
->src_fn
, 0);
4469 fprintf (dump_file
, " to ");
4470 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4471 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4474 /* This is it. Duplicate the callee body. Assume callee is
4475 pre-gimplified. Note that we must not alter the caller
4476 function in any way before this point, as this CALL_EXPR may be
4477 a self-referential call; if we're calling ourselves, we need to
4478 duplicate our body before altering anything. */
4479 copy_body (id
, cg_edge
->callee
->count
,
4480 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4481 bb
, return_block
, NULL
);
4483 /* Reset the escaped solution. */
4484 if (cfun
->gimple_df
)
4485 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4490 delete id
->debug_map
;
4491 id
->debug_map
= dst
;
4493 delete id
->decl_map
;
4496 /* Unlink the calls virtual operands before replacing it. */
4497 unlink_stmt_vdef (stmt
);
4498 if (gimple_vdef (stmt
)
4499 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4500 release_ssa_name (gimple_vdef (stmt
));
4502 /* If the inlined function returns a result that we care about,
4503 substitute the GIMPLE_CALL with an assignment of the return
4504 variable to the LHS of the call. That is, if STMT was
4505 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4506 if (use_retvar
&& gimple_call_lhs (stmt
))
4508 gimple old_stmt
= stmt
;
4509 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4510 gsi_replace (&stmt_gsi
, stmt
, false);
4511 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4515 /* Handle the case of inlining a function with no return
4516 statement, which causes the return value to become undefined. */
4517 if (gimple_call_lhs (stmt
)
4518 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4520 tree name
= gimple_call_lhs (stmt
);
4521 tree var
= SSA_NAME_VAR (name
);
4522 tree def
= ssa_default_def (cfun
, var
);
4526 /* If the variable is used undefined, make this name
4527 undefined via a move. */
4528 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4529 gsi_replace (&stmt_gsi
, stmt
, true);
4533 /* Otherwise make this variable undefined. */
4534 gsi_remove (&stmt_gsi
, true);
4535 set_ssa_default_def (cfun
, var
, name
);
4536 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4540 gsi_remove (&stmt_gsi
, true);
4543 if (purge_dead_abnormal_edges
)
4545 gimple_purge_dead_eh_edges (return_block
);
4546 gimple_purge_dead_abnormal_call_edges (return_block
);
4549 /* If the value of the new expression is ignored, that's OK. We
4550 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4551 the equivalent inlined version either. */
4552 if (is_gimple_assign (stmt
))
4554 gcc_assert (gimple_assign_single_p (stmt
)
4555 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4556 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4559 /* Output the inlining info for this abstract function, since it has been
4560 inlined. If we don't do this now, we can lose the information about the
4561 variables in the function when the blocks get blown away as soon as we
4562 remove the cgraph node. */
4563 if (gimple_block (stmt
))
4564 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4566 /* Update callgraph if needed. */
4567 cg_edge
->callee
->remove ();
4569 id
->block
= NULL_TREE
;
4570 successfully_inlined
= TRUE
;
4573 input_location
= saved_location
;
4574 return successfully_inlined
;
4577 /* Expand call statements reachable from STMT_P.
4578 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4579 in a MODIFY_EXPR. */
4582 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4584 gimple_stmt_iterator gsi
;
4586 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4588 gimple stmt
= gsi_stmt (gsi
);
4590 if (is_gimple_call (stmt
)
4591 && !gimple_call_internal_p (stmt
)
4592 && expand_call_inline (bb
, stmt
, id
))
4600 /* Walk all basic blocks created after FIRST and try to fold every statement
4601 in the STATEMENTS pointer set. */
4604 fold_marked_statements (int first
, hash_set
<gimple
> *statements
)
4606 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4607 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4609 gimple_stmt_iterator gsi
;
4611 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4614 if (statements
->contains (gsi_stmt (gsi
)))
4616 gimple old_stmt
= gsi_stmt (gsi
);
4617 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4619 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4621 /* Folding builtins can create multiple instructions,
4622 we need to look at all of them. */
4623 gimple_stmt_iterator i2
= gsi
;
4625 if (fold_stmt (&gsi
))
4628 /* If a builtin at the end of a bb folded into nothing,
4629 the following loop won't work. */
4630 if (gsi_end_p (gsi
))
4632 cgraph_update_edges_for_call_stmt (old_stmt
,
4637 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4642 new_stmt
= gsi_stmt (i2
);
4643 update_stmt (new_stmt
);
4644 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4647 if (new_stmt
== gsi_stmt (gsi
))
4649 /* It is okay to check only for the very last
4650 of these statements. If it is a throwing
4651 statement nothing will change. If it isn't
4652 this can remove EH edges. If that weren't
4653 correct then because some intermediate stmts
4654 throw, but not the last one. That would mean
4655 we'd have to split the block, which we can't
4656 here and we'd loose anyway. And as builtins
4657 probably never throw, this all
4659 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4661 gimple_purge_dead_eh_edges (
4662 BASIC_BLOCK_FOR_FN (cfun
, first
));
4669 else if (fold_stmt (&gsi
))
4671 /* Re-read the statement from GSI as fold_stmt() may
4673 gimple new_stmt
= gsi_stmt (gsi
);
4674 update_stmt (new_stmt
);
4676 if (is_gimple_call (old_stmt
)
4677 || is_gimple_call (new_stmt
))
4678 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4681 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4682 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
4689 /* Expand calls to inline functions in the body of FN. */
4692 optimize_inline_calls (tree fn
)
4696 int last
= n_basic_blocks_for_fn (cfun
);
4697 bool inlined_p
= false;
4700 memset (&id
, 0, sizeof (id
));
4702 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
4703 gcc_assert (id
.dst_node
->definition
);
4705 /* Or any functions that aren't finished yet. */
4706 if (current_function_decl
)
4707 id
.dst_fn
= current_function_decl
;
4709 id
.copy_decl
= copy_decl_maybe_to_var
;
4710 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4711 id
.transform_new_cfg
= false;
4712 id
.transform_return_to_modify
= true;
4713 id
.transform_parameter
= true;
4714 id
.transform_lang_insert_block
= NULL
;
4715 id
.statements_to_fold
= new hash_set
<gimple
>;
4717 push_gimplify_context ();
4719 /* We make no attempts to keep dominance info up-to-date. */
4720 free_dominance_info (CDI_DOMINATORS
);
4721 free_dominance_info (CDI_POST_DOMINATORS
);
4723 /* Register specific gimple functions. */
4724 gimple_register_cfg_hooks ();
4726 /* Reach the trees by walking over the CFG, and note the
4727 enclosing basic-blocks in the call edges. */
4728 /* We walk the blocks going forward, because inlined function bodies
4729 will split id->current_basic_block, and the new blocks will
4730 follow it; we'll trudge through them, processing their CALL_EXPRs
4732 FOR_EACH_BB_FN (bb
, cfun
)
4733 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4735 pop_gimplify_context (NULL
);
4737 #ifdef ENABLE_CHECKING
4739 struct cgraph_edge
*e
;
4741 id
.dst_node
->verify ();
4743 /* Double check that we inlined everything we are supposed to inline. */
4744 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4745 gcc_assert (e
->inline_failed
);
4749 /* Fold queued statements. */
4750 fold_marked_statements (last
, id
.statements_to_fold
);
4751 delete id
.statements_to_fold
;
4753 gcc_assert (!id
.debug_stmts
.exists ());
4755 /* If we didn't inline into the function there is nothing to do. */
4759 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4762 delete_unreachable_blocks_update_callgraph (&id
);
4763 #ifdef ENABLE_CHECKING
4764 id
.dst_node
->verify ();
4767 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4768 not possible yet - the IPA passes might make various functions to not
4769 throw and they don't care to proactively update local EH info. This is
4770 done later in fixup_cfg pass that also execute the verification. */
4771 return (TODO_update_ssa
4773 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4774 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4775 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
4776 ? TODO_rebuild_frequencies
: 0));
4779 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4782 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4784 enum tree_code code
= TREE_CODE (*tp
);
4785 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4787 /* We make copies of most nodes. */
4788 if (IS_EXPR_CODE_CLASS (cl
)
4789 || code
== TREE_LIST
4791 || code
== TYPE_DECL
4792 || code
== OMP_CLAUSE
)
4794 /* Because the chain gets clobbered when we make a copy, we save it
4796 tree chain
= NULL_TREE
, new_tree
;
4798 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4799 chain
= TREE_CHAIN (*tp
);
4801 /* Copy the node. */
4802 new_tree
= copy_node (*tp
);
4806 /* Now, restore the chain, if appropriate. That will cause
4807 walk_tree to walk into the chain as well. */
4808 if (code
== PARM_DECL
4809 || code
== TREE_LIST
4810 || code
== OMP_CLAUSE
)
4811 TREE_CHAIN (*tp
) = chain
;
4813 /* For now, we don't update BLOCKs when we make copies. So, we
4814 have to nullify all BIND_EXPRs. */
4815 if (TREE_CODE (*tp
) == BIND_EXPR
)
4816 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4818 else if (code
== CONSTRUCTOR
)
4820 /* CONSTRUCTOR nodes need special handling because
4821 we need to duplicate the vector of elements. */
4824 new_tree
= copy_node (*tp
);
4825 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
4828 else if (code
== STATEMENT_LIST
)
4829 /* We used to just abort on STATEMENT_LIST, but we can run into them
4830 with statement-expressions (c++/40975). */
4831 copy_statement_list (tp
);
4832 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4834 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4836 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4841 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4842 information indicating to what new SAVE_EXPR this one should be mapped,
4843 use that one. Otherwise, create a new node and enter it in ST. FN is
4844 the function into which the copy will be placed. */
4847 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
4852 /* See if we already encountered this SAVE_EXPR. */
4855 /* If we didn't already remap this SAVE_EXPR, do so now. */
4858 t
= copy_node (*tp
);
4860 /* Remember this SAVE_EXPR. */
4862 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4867 /* We've already walked into this SAVE_EXPR; don't do it again. */
4872 /* Replace this SAVE_EXPR with the copy. */
4876 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4877 label, copies the declaration and enters it in the splay_tree in DATA (which
4878 is really a 'copy_body_data *'. */
4881 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4882 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4883 struct walk_stmt_info
*wi
)
4885 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4886 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
4890 tree decl
= gimple_label_label (stmt
);
4892 /* Copy the decl and remember the copy. */
4893 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4900 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4901 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4902 remaps all local declarations to appropriate replacements in gimple
4906 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4908 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4909 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4910 hash_map
<tree
, tree
> *st
= id
->decl_map
;
4914 /* Only a local declaration (variable or label). */
4915 if ((TREE_CODE (expr
) == VAR_DECL
4916 && !TREE_STATIC (expr
))
4917 || TREE_CODE (expr
) == LABEL_DECL
)
4919 /* Lookup the declaration. */
4922 /* If it's there, remap it. */
4927 else if (TREE_CODE (expr
) == STATEMENT_LIST
4928 || TREE_CODE (expr
) == BIND_EXPR
4929 || TREE_CODE (expr
) == SAVE_EXPR
)
4931 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4933 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4934 It's OK for this to happen if it was part of a subtree that
4935 isn't immediately expanded, such as operand 2 of another
4937 if (!TREE_OPERAND (expr
, 1))
4939 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4940 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4944 /* Keep iterating. */
4949 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4950 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4951 remaps all local declarations to appropriate replacements in gimple
4955 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4956 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4957 struct walk_stmt_info
*wi
)
4959 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4960 gimple gs
= gsi_stmt (*gsip
);
4962 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
4964 tree block
= gimple_bind_block (stmt
);
4968 remap_block (&block
, id
);
4969 gimple_bind_set_block (stmt
, block
);
4972 /* This will remap a lot of the same decls again, but this should be
4974 if (gimple_bind_vars (stmt
))
4975 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
4979 /* Keep iterating. */
4984 /* Copies everything in SEQ and replaces variables and labels local to
4985 current_function_decl. */
4988 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4991 struct walk_stmt_info wi
;
4994 /* There's nothing to do for NULL_TREE. */
4999 memset (&id
, 0, sizeof (id
));
5000 id
.src_fn
= current_function_decl
;
5001 id
.dst_fn
= current_function_decl
;
5002 id
.decl_map
= new hash_map
<tree
, tree
>;
5003 id
.debug_map
= NULL
;
5005 id
.copy_decl
= copy_decl_no_change
;
5006 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5007 id
.transform_new_cfg
= false;
5008 id
.transform_return_to_modify
= false;
5009 id
.transform_parameter
= false;
5010 id
.transform_lang_insert_block
= NULL
;
5012 /* Walk the tree once to find local labels. */
5013 memset (&wi
, 0, sizeof (wi
));
5014 hash_set
<tree
> visited
;
5017 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5019 copy
= gimple_seq_copy (seq
);
5021 /* Walk the copy, remapping decls. */
5022 memset (&wi
, 0, sizeof (wi
));
5024 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5029 delete id
.debug_map
;
5035 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5038 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5047 debug_find_tree (tree top
, tree search
)
5049 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5053 /* Declare the variables created by the inliner. Add all the variables in
5054 VARS to BIND_EXPR. */
5057 declare_inline_vars (tree block
, tree vars
)
5060 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5062 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5063 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5064 add_local_decl (cfun
, t
);
5068 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5071 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5072 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5073 VAR_DECL translation. */
5076 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5078 /* Don't generate debug information for the copy if we wouldn't have
5079 generated it for the copy either. */
5080 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5081 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5083 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5084 declaration inspired this copy. */
5085 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5087 /* The new variable/label has no RTL, yet. */
5088 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5089 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5090 SET_DECL_RTL (copy
, 0);
5092 /* These args would always appear unused, if not for this. */
5093 TREE_USED (copy
) = 1;
5095 /* Set the context for the new declaration. */
5096 if (!DECL_CONTEXT (decl
))
5097 /* Globals stay global. */
5099 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5100 /* Things that weren't in the scope of the function we're inlining
5101 from aren't in the scope we're inlining to, either. */
5103 else if (TREE_STATIC (decl
))
5104 /* Function-scoped static variables should stay in the original
5108 /* Ordinary automatic local variables are now in the scope of the
5110 DECL_CONTEXT (copy
) = id
->dst_fn
;
5116 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5120 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5121 || TREE_CODE (decl
) == RESULT_DECL
);
5123 type
= TREE_TYPE (decl
);
5125 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5126 VAR_DECL
, DECL_NAME (decl
), type
);
5127 if (DECL_PT_UID_SET_P (decl
))
5128 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5129 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5130 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5131 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5132 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5134 return copy_decl_for_dup_finish (id
, decl
, copy
);
5137 /* Like copy_decl_to_var, but create a return slot object instead of a
5138 pointer variable for return by invisible reference. */
5141 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5145 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5146 || TREE_CODE (decl
) == RESULT_DECL
);
5148 type
= TREE_TYPE (decl
);
5149 if (DECL_BY_REFERENCE (decl
))
5150 type
= TREE_TYPE (type
);
5152 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5153 VAR_DECL
, DECL_NAME (decl
), type
);
5154 if (DECL_PT_UID_SET_P (decl
))
5155 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5156 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5157 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5158 if (!DECL_BY_REFERENCE (decl
))
5160 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5161 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5164 return copy_decl_for_dup_finish (id
, decl
, copy
);
5168 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5172 copy
= copy_node (decl
);
5174 /* The COPY is not abstract; it will be generated in DST_FN. */
5175 DECL_ABSTRACT_P (copy
) = false;
5176 lang_hooks
.dup_lang_specific_decl (copy
);
5178 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5179 been taken; it's for internal bookkeeping in expand_goto_internal. */
5180 if (TREE_CODE (copy
) == LABEL_DECL
)
5182 TREE_ADDRESSABLE (copy
) = 0;
5183 LABEL_DECL_UID (copy
) = -1;
5186 return copy_decl_for_dup_finish (id
, decl
, copy
);
5190 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5192 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5193 return copy_decl_to_var (decl
, id
);
5195 return copy_decl_no_change (decl
, id
);
5198 /* Return a copy of the function's argument tree. */
5200 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5201 bitmap args_to_skip
, tree
*vars
)
5204 tree new_parm
= NULL
;
5209 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5210 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5212 tree new_tree
= remap_decl (arg
, id
);
5213 if (TREE_CODE (new_tree
) != PARM_DECL
)
5214 new_tree
= id
->copy_decl (arg
, id
);
5215 lang_hooks
.dup_lang_specific_decl (new_tree
);
5217 parg
= &DECL_CHAIN (new_tree
);
5219 else if (!id
->decl_map
->get (arg
))
5221 /* Make an equivalent VAR_DECL. If the argument was used
5222 as temporary variable later in function, the uses will be
5223 replaced by local variable. */
5224 tree var
= copy_decl_to_var (arg
, id
);
5225 insert_decl_map (id
, arg
, var
);
5226 /* Declare this new variable. */
5227 DECL_CHAIN (var
) = *vars
;
5233 /* Return a copy of the function's static chain. */
5235 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5237 tree
*chain_copy
, *pvar
;
5239 chain_copy
= &static_chain
;
5240 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5242 tree new_tree
= remap_decl (*pvar
, id
);
5243 lang_hooks
.dup_lang_specific_decl (new_tree
);
5244 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5247 return static_chain
;
5250 /* Return true if the function is allowed to be versioned.
5251 This is a guard for the versioning functionality. */
5254 tree_versionable_function_p (tree fndecl
)
5256 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5257 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
5260 /* Delete all unreachable basic blocks and update callgraph.
5261 Doing so is somewhat nontrivial because we need to update all clones and
5262 remove inline function that become unreachable. */
5265 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5267 bool changed
= false;
5268 basic_block b
, next_bb
;
5270 find_unreachable_blocks ();
5272 /* Delete all unreachable basic blocks. */
5274 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5275 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5277 next_bb
= b
->next_bb
;
5279 if (!(b
->flags
& BB_REACHABLE
))
5281 gimple_stmt_iterator bsi
;
5283 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5285 struct cgraph_edge
*e
;
5286 struct cgraph_node
*node
;
5288 id
->dst_node
->remove_stmt_references (gsi_stmt (bsi
));
5290 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5291 &&(e
= id
->dst_node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5293 if (!e
->inline_failed
)
5294 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5298 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5299 && id
->dst_node
->clones
)
5300 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5302 node
->remove_stmt_references (gsi_stmt (bsi
));
5303 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5304 && (e
= node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5306 if (!e
->inline_failed
)
5307 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5313 node
= node
->clones
;
5314 else if (node
->next_sibling_clone
)
5315 node
= node
->next_sibling_clone
;
5318 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5319 node
= node
->clone_of
;
5320 if (node
!= id
->dst_node
)
5321 node
= node
->next_sibling_clone
;
5325 delete_basic_block (b
);
5333 /* Update clone info after duplication. */
5336 update_clone_info (copy_body_data
* id
)
5338 struct cgraph_node
*node
;
5339 if (!id
->dst_node
->clones
)
5341 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5343 /* First update replace maps to match the new body. */
5344 if (node
->clone
.tree_map
)
5347 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5349 struct ipa_replace_map
*replace_info
;
5350 replace_info
= (*node
->clone
.tree_map
)[i
];
5351 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5352 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5356 node
= node
->clones
;
5357 else if (node
->next_sibling_clone
)
5358 node
= node
->next_sibling_clone
;
5361 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5362 node
= node
->clone_of
;
5363 if (node
!= id
->dst_node
)
5364 node
= node
->next_sibling_clone
;
5369 /* Create a copy of a function's tree.
5370 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5371 of the original function and the new copied function
5372 respectively. In case we want to replace a DECL
5373 tree with another tree while duplicating the function's
5374 body, TREE_MAP represents the mapping between these
5375 trees. If UPDATE_CLONES is set, the call_stmt fields
5376 of edges of clones of the function will be updated.
5378 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5380 If SKIP_RETURN is true, the new version will return void.
5381 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5382 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5385 tree_function_versioning (tree old_decl
, tree new_decl
,
5386 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
5387 bool update_clones
, bitmap args_to_skip
,
5388 bool skip_return
, bitmap blocks_to_copy
,
5389 basic_block new_entry
)
5391 struct cgraph_node
*old_version_node
;
5392 struct cgraph_node
*new_version_node
;
5396 struct ipa_replace_map
*replace_info
;
5397 basic_block old_entry_block
, bb
;
5398 auto_vec
<gimple
, 10> init_stmts
;
5399 tree vars
= NULL_TREE
;
5401 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5402 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5403 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5405 old_version_node
= cgraph_node::get (old_decl
);
5406 gcc_checking_assert (old_version_node
);
5407 new_version_node
= cgraph_node::get (new_decl
);
5408 gcc_checking_assert (new_version_node
);
5410 /* Copy over debug args. */
5411 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5413 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5414 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5415 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5416 old_debug_args
= decl_debug_args_lookup (old_decl
);
5419 new_debug_args
= decl_debug_args_insert (new_decl
);
5420 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5424 /* Output the inlining info for this abstract function, since it has been
5425 inlined. If we don't do this now, we can lose the information about the
5426 variables in the function when the blocks get blown away as soon as we
5427 remove the cgraph node. */
5428 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5430 DECL_ARTIFICIAL (new_decl
) = 1;
5431 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5432 if (DECL_ORIGIN (old_decl
) == old_decl
)
5433 old_version_node
->used_as_abstract_origin
= true;
5434 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5436 /* Prepare the data structures for the tree copy. */
5437 memset (&id
, 0, sizeof (id
));
5439 /* Generate a new name for the new version. */
5440 id
.statements_to_fold
= new hash_set
<gimple
>;
5442 id
.decl_map
= new hash_map
<tree
, tree
>;
5443 id
.debug_map
= NULL
;
5444 id
.src_fn
= old_decl
;
5445 id
.dst_fn
= new_decl
;
5446 id
.src_node
= old_version_node
;
5447 id
.dst_node
= new_version_node
;
5448 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5449 id
.blocks_to_copy
= blocks_to_copy
;
5451 id
.copy_decl
= copy_decl_no_change
;
5452 id
.transform_call_graph_edges
5453 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5454 id
.transform_new_cfg
= true;
5455 id
.transform_return_to_modify
= false;
5456 id
.transform_parameter
= false;
5457 id
.transform_lang_insert_block
= NULL
;
5459 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5460 (DECL_STRUCT_FUNCTION (old_decl
));
5461 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5462 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5463 initialize_cfun (new_decl
, old_decl
,
5464 old_entry_block
->count
);
5465 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
5466 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5467 = id
.src_cfun
->gimple_df
->ipa_pta
;
5469 /* Copy the function's static chain. */
5470 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5472 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5473 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5476 /* If there's a tree_map, prepare for substitution. */
5478 for (i
= 0; i
< tree_map
->length (); i
++)
5481 replace_info
= (*tree_map
)[i
];
5482 if (replace_info
->replace_p
)
5484 if (!replace_info
->old_tree
)
5486 int i
= replace_info
->parm_num
;
5490 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5492 replace_info
->old_tree
= parm
;
5493 req_type
= TREE_TYPE (parm
);
5494 if (!useless_type_conversion_p (req_type
, TREE_TYPE (replace_info
->new_tree
)))
5496 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5497 replace_info
->new_tree
= fold_build1 (NOP_EXPR
, req_type
, replace_info
->new_tree
);
5498 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (TREE_TYPE (replace_info
->new_tree
)))
5499 replace_info
->new_tree
= fold_build1 (VIEW_CONVERT_EXPR
, req_type
, replace_info
->new_tree
);
5504 fprintf (dump_file
, " const ");
5505 print_generic_expr (dump_file
, replace_info
->new_tree
, 0);
5506 fprintf (dump_file
, " can't be converted to param ");
5507 print_generic_expr (dump_file
, parm
, 0);
5508 fprintf (dump_file
, "\n");
5510 replace_info
->old_tree
= NULL
;
5515 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5516 if (replace_info
->old_tree
)
5518 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5519 replace_info
->new_tree
, id
.src_fn
,
5523 init_stmts
.safe_push (init
);
5527 /* Copy the function's arguments. */
5528 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5529 DECL_ARGUMENTS (new_decl
) =
5530 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5531 args_to_skip
, &vars
);
5533 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5534 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5536 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5538 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5539 /* Add local vars. */
5540 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5542 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5544 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5546 DECL_RESULT (new_decl
)
5547 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5548 RESULT_DECL
, NULL_TREE
, void_type_node
);
5549 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5550 cfun
->returns_struct
= 0;
5551 cfun
->returns_pcc_struct
= 0;
5556 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5557 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5558 if (gimple_in_ssa_p (id
.src_cfun
)
5559 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5560 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5562 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5563 insert_decl_map (&id
, old_name
, new_name
);
5564 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5565 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5569 /* Set up the destination functions loop tree. */
5570 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5572 cfun
->curr_properties
&= ~PROP_loops
;
5573 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5574 cfun
->curr_properties
|= PROP_loops
;
5577 /* Copy the Function's body. */
5578 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5579 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
5582 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5583 number_blocks (new_decl
);
5585 /* We want to create the BB unconditionally, so that the addition of
5586 debug stmts doesn't affect BB count, which may in the end cause
5587 codegen differences. */
5588 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5589 while (init_stmts
.length ())
5590 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5591 update_clone_info (&id
);
5593 /* Remap the nonlocal_goto_save_area, if any. */
5594 if (cfun
->nonlocal_goto_save_area
)
5596 struct walk_stmt_info wi
;
5598 memset (&wi
, 0, sizeof (wi
));
5600 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5606 delete id
.debug_map
;
5607 free_dominance_info (CDI_DOMINATORS
);
5608 free_dominance_info (CDI_POST_DOMINATORS
);
5610 fold_marked_statements (0, id
.statements_to_fold
);
5611 delete id
.statements_to_fold
;
5612 fold_cond_expr_cond ();
5613 delete_unreachable_blocks_update_callgraph (&id
);
5614 if (id
.dst_node
->definition
)
5615 cgraph_edge::rebuild_references ();
5616 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
5618 calculate_dominance_info (CDI_DOMINATORS
);
5619 fix_loop_structure (NULL
);
5621 update_ssa (TODO_update_ssa
);
5623 /* After partial cloning we need to rescale frequencies, so they are
5624 within proper range in the cloned function. */
5627 struct cgraph_edge
*e
;
5628 rebuild_frequencies ();
5630 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5631 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5633 basic_block bb
= gimple_bb (e
->call_stmt
);
5634 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5636 e
->count
= bb
->count
;
5638 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5640 basic_block bb
= gimple_bb (e
->call_stmt
);
5641 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5643 e
->count
= bb
->count
;
5647 free_dominance_info (CDI_DOMINATORS
);
5648 free_dominance_info (CDI_POST_DOMINATORS
);
5650 gcc_assert (!id
.debug_stmts
.exists ());
5655 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5656 the callee and return the inlined body on success. */
5659 maybe_inline_call_in_expr (tree exp
)
5661 tree fn
= get_callee_fndecl (exp
);
5663 /* We can only try to inline "const" functions. */
5664 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5666 call_expr_arg_iterator iter
;
5669 hash_map
<tree
, tree
> decl_map
;
5671 /* Remap the parameters. */
5672 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5674 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5675 decl_map
.put (param
, arg
);
5677 memset (&id
, 0, sizeof (id
));
5679 id
.dst_fn
= current_function_decl
;
5680 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5681 id
.decl_map
= &decl_map
;
5683 id
.copy_decl
= copy_decl_no_change
;
5684 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5685 id
.transform_new_cfg
= false;
5686 id
.transform_return_to_modify
= true;
5687 id
.transform_parameter
= true;
5688 id
.transform_lang_insert_block
= NULL
;
5690 /* Make sure not to unshare trees behind the front-end's back
5691 since front-end specific mechanisms may rely on sharing. */
5692 id
.regimplify
= false;
5693 id
.do_not_unshare
= true;
5695 /* We're not inside any EH region. */
5698 t
= copy_tree_body (&id
);
5700 /* We can only return something suitable for use in a GENERIC
5702 if (TREE_CODE (t
) == MODIFY_EXPR
)
5703 return TREE_OPERAND (t
, 1);
5709 /* Duplicate a type, fields and all. */
5712 build_duplicate_type (tree type
)
5714 struct copy_body_data id
;
5716 memset (&id
, 0, sizeof (id
));
5717 id
.src_fn
= current_function_decl
;
5718 id
.dst_fn
= current_function_decl
;
5720 id
.decl_map
= new hash_map
<tree
, tree
>;
5721 id
.debug_map
= NULL
;
5722 id
.copy_decl
= copy_decl_no_change
;
5724 type
= remap_type_1 (type
, &id
);
5728 delete id
.debug_map
;
5730 TYPE_CANONICAL (type
) = type
;