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 "plugin-api.h"
76 #include "alloc-pool.h"
78 #include "value-prof.h"
79 #include "tree-pass.h"
84 #include "rtl.h" /* FIXME: For asm_str_count. */
86 /* I'm not real happy about this, but we need to handle gimple and
89 /* Inlining, Cloning, Versioning, Parallelization
91 Inlining: a function body is duplicated, but the PARM_DECLs are
92 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
93 MODIFY_EXPRs that store to a dedicated returned-value variable.
94 The duplicated eh_region info of the copy will later be appended
95 to the info for the caller; the eh_region info in copied throwing
96 statements and RESX statements are adjusted accordingly.
98 Cloning: (only in C++) We have one body for a con/de/structor, and
99 multiple function decls, each with a unique parameter list.
100 Duplicate the body, using the given splay tree; some parameters
101 will become constants (like 0 or 1).
103 Versioning: a function body is duplicated and the result is a new
104 function rather than into blocks of an existing function as with
105 inlining. Some parameters will become constants.
107 Parallelization: a region of a function is duplicated resulting in
108 a new function. Variables may be replaced with complex expressions
109 to enable shared variable semantics.
111 All of these will simultaneously lookup any callgraph edges. If
112 we're going to inline the duplicated function body, and the given
113 function has some cloned callgraph nodes (one for each place this
114 function will be inlined) those callgraph edges will be duplicated.
115 If we're cloning the body, those callgraph edges will be
116 updated to point into the new body. (Note that the original
117 callgraph node and edge list will not be altered.)
119 See the CALL_EXPR handling case in copy_tree_body_r (). */
123 o In order to make inlining-on-trees work, we pessimized
124 function-local static constants. In particular, they are now
125 always output, even when not addressed. Fix this by treating
126 function-local static constants just like global static
127 constants; the back-end already knows not to output them if they
130 o Provide heuristics to clamp inlining of recursive template
134 /* Weights that estimate_num_insns uses to estimate the size of the
137 eni_weights eni_size_weights
;
139 /* Weights that estimate_num_insns uses to estimate the time necessary
140 to execute the produced code. */
142 eni_weights eni_time_weights
;
146 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, basic_block
);
147 static void remap_block (tree
*, copy_body_data
*);
148 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
149 static void declare_inline_vars (tree
, tree
);
150 static void remap_save_expr (tree
*, hash_map
<tree
, tree
> *, int *);
151 static void prepend_lexical_block (tree current_block
, tree new_block
);
152 static tree
copy_decl_to_var (tree
, copy_body_data
*);
153 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
154 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
155 static gimple
remap_gimple_stmt (gimple
, copy_body_data
*);
156 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
158 /* Insert a tree->tree mapping for ID. Despite the name suggests
159 that the trees should be variables, it is used for more than that. */
162 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
164 id
->decl_map
->put (key
, value
);
166 /* Always insert an identity map as well. If we see this same new
167 node again, we won't want to duplicate it a second time. */
169 id
->decl_map
->put (value
, value
);
172 /* Insert a tree->tree mapping for ID. This is only used for
176 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
178 if (!gimple_in_ssa_p (id
->src_cfun
))
181 if (!MAY_HAVE_DEBUG_STMTS
)
184 if (!target_for_debug_bind (key
))
187 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
188 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
191 id
->debug_map
= new hash_map
<tree
, tree
>;
193 id
->debug_map
->put (key
, value
);
196 /* If nonzero, we're remapping the contents of inlined debug
197 statements. If negative, an error has occurred, such as a
198 reference to a variable that isn't available in the inlined
200 static int processing_debug_stmt
= 0;
202 /* Construct new SSA name for old NAME. ID is the inline context. */
205 remap_ssa_name (tree name
, copy_body_data
*id
)
210 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
212 n
= id
->decl_map
->get (name
);
214 return unshare_expr (*n
);
216 if (processing_debug_stmt
)
218 if (SSA_NAME_IS_DEFAULT_DEF (name
)
219 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
220 && id
->entry_bb
== NULL
221 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
223 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
225 gimple_stmt_iterator gsi
;
226 tree val
= SSA_NAME_VAR (name
);
228 n
= id
->decl_map
->get (val
);
231 if (TREE_CODE (val
) != PARM_DECL
)
233 processing_debug_stmt
= -1;
236 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
237 DECL_ARTIFICIAL (vexpr
) = 1;
238 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
239 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
240 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
241 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
245 processing_debug_stmt
= -1;
249 /* Remap anonymous SSA names or SSA names of anonymous decls. */
250 var
= SSA_NAME_VAR (name
);
252 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
253 && TREE_CODE (var
) == VAR_DECL
254 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
255 && DECL_ARTIFICIAL (var
)
256 && DECL_IGNORED_P (var
)
257 && !DECL_NAME (var
)))
259 struct ptr_info_def
*pi
;
260 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
), NULL
);
261 if (!var
&& SSA_NAME_IDENTIFIER (name
))
262 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
263 insert_decl_map (id
, name
, new_tree
);
264 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
265 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
266 /* At least IPA points-to info can be directly transferred. */
267 if (id
->src_cfun
->gimple_df
268 && id
->src_cfun
->gimple_df
->ipa_pta
269 && (pi
= SSA_NAME_PTR_INFO (name
))
272 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
278 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
280 new_tree
= remap_decl (var
, id
);
282 /* We might've substituted constant or another SSA_NAME for
285 Replace the SSA name representing RESULT_DECL by variable during
286 inlining: this saves us from need to introduce PHI node in a case
287 return value is just partly initialized. */
288 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
289 && (!SSA_NAME_VAR (name
)
290 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
291 || !id
->transform_return_to_modify
))
293 struct ptr_info_def
*pi
;
294 new_tree
= make_ssa_name (new_tree
, NULL
);
295 insert_decl_map (id
, name
, new_tree
);
296 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
297 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
298 /* At least IPA points-to info can be directly transferred. */
299 if (id
->src_cfun
->gimple_df
300 && id
->src_cfun
->gimple_df
->ipa_pta
301 && (pi
= SSA_NAME_PTR_INFO (name
))
304 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
307 if (SSA_NAME_IS_DEFAULT_DEF (name
))
309 /* By inlining function having uninitialized variable, we might
310 extend the lifetime (variable might get reused). This cause
311 ICE in the case we end up extending lifetime of SSA name across
312 abnormal edge, but also increase register pressure.
314 We simply initialize all uninitialized vars by 0 except
315 for case we are inlining to very first BB. We can avoid
316 this for all BBs that are not inside strongly connected
317 regions of the CFG, but this is expensive to test. */
319 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
320 && (!SSA_NAME_VAR (name
)
321 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
322 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
324 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
326 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
328 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
330 init_stmt
= gimple_build_assign (new_tree
, zero
);
331 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
332 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
336 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
337 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
342 insert_decl_map (id
, name
, new_tree
);
346 /* Remap DECL during the copying of the BLOCK tree for the function. */
349 remap_decl (tree decl
, copy_body_data
*id
)
353 /* We only remap local variables in the current function. */
355 /* See if we have remapped this declaration. */
357 n
= id
->decl_map
->get (decl
);
359 if (!n
&& processing_debug_stmt
)
361 processing_debug_stmt
= -1;
365 /* If we didn't already have an equivalent for this declaration,
369 /* Make a copy of the variable or label. */
370 tree t
= id
->copy_decl (decl
, id
);
372 /* Remember it, so that if we encounter this local entity again
373 we can reuse this copy. Do this early because remap_type may
374 need this decl for TYPE_STUB_DECL. */
375 insert_decl_map (id
, decl
, t
);
380 /* Remap types, if necessary. */
381 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
382 if (TREE_CODE (t
) == TYPE_DECL
)
383 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
385 /* Remap sizes as necessary. */
386 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
387 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
389 /* If fields, do likewise for offset and qualifier. */
390 if (TREE_CODE (t
) == FIELD_DECL
)
392 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
393 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
394 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
400 if (id
->do_not_unshare
)
403 return unshare_expr (*n
);
407 remap_type_1 (tree type
, copy_body_data
*id
)
411 /* We do need a copy. build and register it now. If this is a pointer or
412 reference type, remap the designated type and make a new pointer or
414 if (TREE_CODE (type
) == POINTER_TYPE
)
416 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
418 TYPE_REF_CAN_ALIAS_ALL (type
));
419 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
420 new_tree
= build_type_attribute_qual_variant (new_tree
,
421 TYPE_ATTRIBUTES (type
),
423 insert_decl_map (id
, type
, new_tree
);
426 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
428 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
430 TYPE_REF_CAN_ALIAS_ALL (type
));
431 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
432 new_tree
= build_type_attribute_qual_variant (new_tree
,
433 TYPE_ATTRIBUTES (type
),
435 insert_decl_map (id
, type
, new_tree
);
439 new_tree
= copy_node (type
);
441 insert_decl_map (id
, type
, new_tree
);
443 /* This is a new type, not a copy of an old type. Need to reassociate
444 variants. We can handle everything except the main variant lazily. */
445 t
= TYPE_MAIN_VARIANT (type
);
448 t
= remap_type (t
, id
);
449 TYPE_MAIN_VARIANT (new_tree
) = t
;
450 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
451 TYPE_NEXT_VARIANT (t
) = new_tree
;
455 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
456 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
459 if (TYPE_STUB_DECL (type
))
460 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
462 /* Lazily create pointer and reference types. */
463 TYPE_POINTER_TO (new_tree
) = NULL
;
464 TYPE_REFERENCE_TO (new_tree
) = NULL
;
466 /* Copy all types that may contain references to local variables; be sure to
467 preserve sharing in between type and its main variant when possible. */
468 switch (TREE_CODE (new_tree
))
472 case FIXED_POINT_TYPE
:
475 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
477 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
478 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
480 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
481 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
485 t
= TYPE_MIN_VALUE (new_tree
);
486 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
487 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
489 t
= TYPE_MAX_VALUE (new_tree
);
490 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
491 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
496 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
497 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
498 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
500 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
501 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
502 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
503 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
505 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
509 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
510 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
511 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
513 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
515 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
517 gcc_checking_assert (TYPE_DOMAIN (type
) == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
518 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
521 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
526 case QUAL_UNION_TYPE
:
527 if (TYPE_MAIN_VARIANT (type
) != type
528 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
529 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
534 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
536 t
= remap_decl (f
, id
);
537 DECL_CONTEXT (t
) = new_tree
;
541 TYPE_FIELDS (new_tree
) = nreverse (nf
);
547 /* Shouldn't have been thought variable sized. */
551 /* All variants of type share the same size, so use the already remaped data. */
552 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
554 gcc_checking_assert (TYPE_SIZE (type
) == TYPE_SIZE (TYPE_MAIN_VARIANT (type
)));
555 gcc_checking_assert (TYPE_SIZE_UNIT (type
) == TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
)));
557 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
558 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
562 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
563 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
570 remap_type (tree type
, copy_body_data
*id
)
578 /* See if we have remapped this type. */
579 node
= id
->decl_map
->get (type
);
583 /* The type only needs remapping if it's variably modified. */
584 if (! variably_modified_type_p (type
, id
->src_fn
))
586 insert_decl_map (id
, type
, type
);
590 id
->remapping_type_depth
++;
591 tmp
= remap_type_1 (type
, id
);
592 id
->remapping_type_depth
--;
597 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
600 can_be_nonlocal (tree decl
, copy_body_data
*id
)
602 /* We can not duplicate function decls. */
603 if (TREE_CODE (decl
) == FUNCTION_DECL
)
606 /* Local static vars must be non-local or we get multiple declaration
608 if (TREE_CODE (decl
) == VAR_DECL
609 && !auto_var_in_fn_p (decl
, id
->src_fn
))
616 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
620 tree new_decls
= NULL_TREE
;
622 /* Remap its variables. */
623 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
627 if (can_be_nonlocal (old_var
, id
))
629 /* We need to add this variable to the local decls as otherwise
630 nothing else will do so. */
631 if (TREE_CODE (old_var
) == VAR_DECL
632 && ! DECL_EXTERNAL (old_var
))
633 add_local_decl (cfun
, old_var
);
634 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
635 && !DECL_IGNORED_P (old_var
)
636 && nonlocalized_list
)
637 vec_safe_push (*nonlocalized_list
, old_var
);
641 /* Remap the variable. */
642 new_var
= remap_decl (old_var
, id
);
644 /* If we didn't remap this variable, we can't mess with its
645 TREE_CHAIN. If we remapped this variable to the return slot, it's
646 already declared somewhere else, so don't declare it here. */
648 if (new_var
== id
->retvar
)
652 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
653 && !DECL_IGNORED_P (old_var
)
654 && nonlocalized_list
)
655 vec_safe_push (*nonlocalized_list
, old_var
);
659 gcc_assert (DECL_P (new_var
));
660 DECL_CHAIN (new_var
) = new_decls
;
663 /* Also copy value-expressions. */
664 if (TREE_CODE (new_var
) == VAR_DECL
665 && DECL_HAS_VALUE_EXPR_P (new_var
))
667 tree tem
= DECL_VALUE_EXPR (new_var
);
668 bool old_regimplify
= id
->regimplify
;
669 id
->remapping_type_depth
++;
670 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
671 id
->remapping_type_depth
--;
672 id
->regimplify
= old_regimplify
;
673 SET_DECL_VALUE_EXPR (new_var
, tem
);
678 return nreverse (new_decls
);
681 /* Copy the BLOCK to contain remapped versions of the variables
682 therein. And hook the new block into the block-tree. */
685 remap_block (tree
*block
, copy_body_data
*id
)
690 /* Make the new block. */
692 new_block
= make_node (BLOCK
);
693 TREE_USED (new_block
) = TREE_USED (old_block
);
694 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
695 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
696 BLOCK_NONLOCALIZED_VARS (new_block
)
697 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
700 /* Remap its variables. */
701 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
702 &BLOCK_NONLOCALIZED_VARS (new_block
),
705 if (id
->transform_lang_insert_block
)
706 id
->transform_lang_insert_block (new_block
);
708 /* Remember the remapped block. */
709 insert_decl_map (id
, old_block
, new_block
);
712 /* Copy the whole block tree and root it in id->block. */
714 remap_blocks (tree block
, copy_body_data
*id
)
717 tree new_tree
= block
;
722 remap_block (&new_tree
, id
);
723 gcc_assert (new_tree
!= block
);
724 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
725 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
726 /* Blocks are in arbitrary order, but make things slightly prettier and do
727 not swap order when producing a copy. */
728 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
732 /* Remap the block tree rooted at BLOCK to nothing. */
734 remap_blocks_to_null (tree block
, copy_body_data
*id
)
737 insert_decl_map (id
, block
, NULL_TREE
);
738 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
739 remap_blocks_to_null (t
, id
);
743 copy_statement_list (tree
*tp
)
745 tree_stmt_iterator oi
, ni
;
748 new_tree
= alloc_stmt_list ();
749 ni
= tsi_start (new_tree
);
750 oi
= tsi_start (*tp
);
751 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
754 for (; !tsi_end_p (oi
); tsi_next (&oi
))
756 tree stmt
= tsi_stmt (oi
);
757 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
758 /* This copy is not redundant; tsi_link_after will smash this
759 STATEMENT_LIST into the end of the one we're building, and we
760 don't want to do that with the original. */
761 copy_statement_list (&stmt
);
762 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
767 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
769 tree block
= BIND_EXPR_BLOCK (*tp
);
770 /* Copy (and replace) the statement. */
771 copy_tree_r (tp
, walk_subtrees
, NULL
);
774 remap_block (&block
, id
);
775 BIND_EXPR_BLOCK (*tp
) = block
;
778 if (BIND_EXPR_VARS (*tp
))
779 /* This will remap a lot of the same decls again, but this should be
781 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
785 /* Create a new gimple_seq by remapping all the statements in BODY
786 using the inlining information in ID. */
789 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
791 gimple_stmt_iterator si
;
792 gimple_seq new_body
= NULL
;
794 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
796 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
797 gimple_seq_add_stmt (&new_body
, new_stmt
);
804 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
805 block using the mapping information in ID. */
808 copy_gimple_bind (gimple stmt
, copy_body_data
*id
)
811 tree new_block
, new_vars
;
812 gimple_seq body
, new_body
;
814 /* Copy the statement. Note that we purposely don't use copy_stmt
815 here because we need to remap statements as we copy. */
816 body
= gimple_bind_body (stmt
);
817 new_body
= remap_gimple_seq (body
, id
);
819 new_block
= gimple_bind_block (stmt
);
821 remap_block (&new_block
, id
);
823 /* This will remap a lot of the same decls again, but this should be
825 new_vars
= gimple_bind_vars (stmt
);
827 new_vars
= remap_decls (new_vars
, NULL
, id
);
829 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
834 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
839 if (TREE_CODE (decl
) == SSA_NAME
)
841 decl
= SSA_NAME_VAR (decl
);
846 return (TREE_CODE (decl
) == PARM_DECL
);
849 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
850 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
851 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
852 recursing into the children nodes of *TP. */
855 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
857 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
858 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
859 tree fn
= id
->src_fn
;
861 if (TREE_CODE (*tp
) == SSA_NAME
)
863 *tp
= remap_ssa_name (*tp
, id
);
867 else if (auto_var_in_fn_p (*tp
, fn
))
869 /* Local variables and labels need to be replaced by equivalent
870 variables. We don't want to copy static variables; there's
871 only one of those, no matter how many times we inline the
872 containing function. Similarly for globals from an outer
876 /* Remap the declaration. */
877 new_decl
= remap_decl (*tp
, id
);
878 gcc_assert (new_decl
);
879 /* Replace this variable with the copy. */
880 STRIP_TYPE_NOPS (new_decl
);
881 /* ??? The C++ frontend uses void * pointer zero to initialize
882 any other type. This confuses the middle-end type verification.
883 As cloned bodies do not go through gimplification again the fixup
884 there doesn't trigger. */
885 if (TREE_CODE (new_decl
) == INTEGER_CST
886 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
887 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
891 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
893 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
895 else if (TREE_CODE (*tp
) == LABEL_DECL
896 && (!DECL_CONTEXT (*tp
)
897 || decl_function_context (*tp
) == id
->src_fn
))
898 /* These may need to be remapped for EH handling. */
899 *tp
= remap_decl (*tp
, id
);
900 else if (TREE_CODE (*tp
) == FIELD_DECL
)
902 /* If the enclosing record type is variably_modified_type_p, the field
903 has already been remapped. Otherwise, it need not be. */
904 tree
*n
= id
->decl_map
->get (*tp
);
909 else if (TYPE_P (*tp
))
910 /* Types may need remapping as well. */
911 *tp
= remap_type (*tp
, id
);
912 else if (CONSTANT_CLASS_P (*tp
))
914 /* If this is a constant, we have to copy the node iff the type
915 will be remapped. copy_tree_r will not copy a constant. */
916 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
918 if (new_type
== TREE_TYPE (*tp
))
921 else if (TREE_CODE (*tp
) == INTEGER_CST
)
922 *tp
= wide_int_to_tree (new_type
, *tp
);
925 *tp
= copy_node (*tp
);
926 TREE_TYPE (*tp
) = new_type
;
931 /* Otherwise, just copy the node. Note that copy_tree_r already
932 knows not to copy VAR_DECLs, etc., so this is safe. */
934 if (TREE_CODE (*tp
) == MEM_REF
)
936 /* We need to re-canonicalize MEM_REFs from inline substitutions
937 that can happen when a pointer argument is an ADDR_EXPR.
938 Recurse here manually to allow that. */
939 tree ptr
= TREE_OPERAND (*tp
, 0);
940 tree type
= remap_type (TREE_TYPE (*tp
), id
);
942 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
943 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
944 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
945 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
946 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
947 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
948 remapped a parameter as the property might be valid only
949 for the parameter itself. */
950 if (TREE_THIS_NOTRAP (old
)
951 && (!is_parm (TREE_OPERAND (old
, 0))
952 || (!id
->transform_parameter
&& is_parm (ptr
))))
953 TREE_THIS_NOTRAP (*tp
) = 1;
958 /* Here is the "usual case". Copy this tree node, and then
959 tweak some special cases. */
960 copy_tree_r (tp
, walk_subtrees
, NULL
);
962 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
963 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
965 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
967 /* The copied TARGET_EXPR has never been expanded, even if the
968 original node was expanded already. */
969 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
970 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
972 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
974 /* Variable substitution need not be simple. In particular,
975 the MEM_REF substitution above. Make sure that
976 TREE_CONSTANT and friends are up-to-date. */
977 int invariant
= is_gimple_min_invariant (*tp
);
978 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
979 recompute_tree_invariant_for_addr_expr (*tp
);
981 /* If this used to be invariant, but is not any longer,
982 then regimplification is probably needed. */
983 if (invariant
&& !is_gimple_min_invariant (*tp
))
984 id
->regimplify
= true;
990 /* Update the TREE_BLOCK for the cloned expr. */
993 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
994 tree old_block
= TREE_BLOCK (*tp
);
998 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1002 TREE_SET_BLOCK (*tp
, new_block
);
1005 /* Keep iterating. */
1010 /* Called from copy_body_id via walk_tree. DATA is really a
1011 `copy_body_data *'. */
1014 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1016 copy_body_data
*id
= (copy_body_data
*) data
;
1017 tree fn
= id
->src_fn
;
1020 /* Begin by recognizing trees that we'll completely rewrite for the
1021 inlining context. Our output for these trees is completely
1022 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1023 into an edge). Further down, we'll handle trees that get
1024 duplicated and/or tweaked. */
1026 /* When requested, RETURN_EXPRs should be transformed to just the
1027 contained MODIFY_EXPR. The branch semantics of the return will
1028 be handled elsewhere by manipulating the CFG rather than a statement. */
1029 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1031 tree assignment
= TREE_OPERAND (*tp
, 0);
1033 /* If we're returning something, just turn that into an
1034 assignment into the equivalent of the original RESULT_DECL.
1035 If the "assignment" is just the result decl, the result
1036 decl has already been set (e.g. a recent "foo (&result_decl,
1037 ...)"); just toss the entire RETURN_EXPR. */
1038 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1040 /* Replace the RETURN_EXPR with (a copy of) the
1041 MODIFY_EXPR hanging underneath. */
1042 *tp
= copy_node (assignment
);
1044 else /* Else the RETURN_EXPR returns no value. */
1047 return (tree
) (void *)1;
1050 else if (TREE_CODE (*tp
) == SSA_NAME
)
1052 *tp
= remap_ssa_name (*tp
, id
);
1057 /* Local variables and labels need to be replaced by equivalent
1058 variables. We don't want to copy static variables; there's only
1059 one of those, no matter how many times we inline the containing
1060 function. Similarly for globals from an outer function. */
1061 else if (auto_var_in_fn_p (*tp
, fn
))
1065 /* Remap the declaration. */
1066 new_decl
= remap_decl (*tp
, id
);
1067 gcc_assert (new_decl
);
1068 /* Replace this variable with the copy. */
1069 STRIP_TYPE_NOPS (new_decl
);
1073 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1074 copy_statement_list (tp
);
1075 else if (TREE_CODE (*tp
) == SAVE_EXPR
1076 || TREE_CODE (*tp
) == TARGET_EXPR
)
1077 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1078 else if (TREE_CODE (*tp
) == LABEL_DECL
1079 && (! DECL_CONTEXT (*tp
)
1080 || decl_function_context (*tp
) == id
->src_fn
))
1081 /* These may need to be remapped for EH handling. */
1082 *tp
= remap_decl (*tp
, id
);
1083 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1084 copy_bind_expr (tp
, walk_subtrees
, id
);
1085 /* Types may need remapping as well. */
1086 else if (TYPE_P (*tp
))
1087 *tp
= remap_type (*tp
, id
);
1089 /* If this is a constant, we have to copy the node iff the type will be
1090 remapped. copy_tree_r will not copy a constant. */
1091 else if (CONSTANT_CLASS_P (*tp
))
1093 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1095 if (new_type
== TREE_TYPE (*tp
))
1098 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1099 *tp
= wide_int_to_tree (new_type
, *tp
);
1102 *tp
= copy_node (*tp
);
1103 TREE_TYPE (*tp
) = new_type
;
1107 /* Otherwise, just copy the node. Note that copy_tree_r already
1108 knows not to copy VAR_DECLs, etc., so this is safe. */
1111 /* Here we handle trees that are not completely rewritten.
1112 First we detect some inlining-induced bogosities for
1114 if (TREE_CODE (*tp
) == MODIFY_EXPR
1115 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1116 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1118 /* Some assignments VAR = VAR; don't generate any rtl code
1119 and thus don't count as variable modification. Avoid
1120 keeping bogosities like 0 = 0. */
1121 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1124 n
= id
->decl_map
->get (decl
);
1128 STRIP_TYPE_NOPS (value
);
1129 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1131 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1132 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1136 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1138 /* Get rid of *& from inline substitutions that can happen when a
1139 pointer argument is an ADDR_EXPR. */
1140 tree decl
= TREE_OPERAND (*tp
, 0);
1141 tree
*n
= id
->decl_map
->get (decl
);
1144 /* If we happen to get an ADDR_EXPR in n->value, strip
1145 it manually here as we'll eventually get ADDR_EXPRs
1146 which lie about their types pointed to. In this case
1147 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1148 but we absolutely rely on that. As fold_indirect_ref
1149 does other useful transformations, try that first, though. */
1150 tree type
= TREE_TYPE (*tp
);
1151 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1153 *tp
= gimple_fold_indirect_ref (ptr
);
1156 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1159 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1160 /* ??? We should either assert here or build
1161 a VIEW_CONVERT_EXPR instead of blindly leaking
1162 incompatible types to our IL. */
1164 *tp
= TREE_OPERAND (ptr
, 0);
1168 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1169 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1170 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1171 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1172 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1173 have remapped a parameter as the property might be
1174 valid only for the parameter itself. */
1175 if (TREE_THIS_NOTRAP (old
)
1176 && (!is_parm (TREE_OPERAND (old
, 0))
1177 || (!id
->transform_parameter
&& is_parm (ptr
))))
1178 TREE_THIS_NOTRAP (*tp
) = 1;
1185 else if (TREE_CODE (*tp
) == MEM_REF
)
1187 /* We need to re-canonicalize MEM_REFs from inline substitutions
1188 that can happen when a pointer argument is an ADDR_EXPR.
1189 Recurse here manually to allow that. */
1190 tree ptr
= TREE_OPERAND (*tp
, 0);
1191 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1193 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1194 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1195 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1196 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1197 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1198 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1199 remapped a parameter as the property might be valid only
1200 for the parameter itself. */
1201 if (TREE_THIS_NOTRAP (old
)
1202 && (!is_parm (TREE_OPERAND (old
, 0))
1203 || (!id
->transform_parameter
&& is_parm (ptr
))))
1204 TREE_THIS_NOTRAP (*tp
) = 1;
1209 /* Here is the "usual case". Copy this tree node, and then
1210 tweak some special cases. */
1211 copy_tree_r (tp
, walk_subtrees
, NULL
);
1213 /* If EXPR has block defined, map it to newly constructed block.
1214 When inlining we want EXPRs without block appear in the block
1215 of function call if we are not remapping a type. */
1218 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1219 if (TREE_BLOCK (*tp
))
1222 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1226 TREE_SET_BLOCK (*tp
, new_block
);
1229 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1230 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1232 /* The copied TARGET_EXPR has never been expanded, even if the
1233 original node was expanded already. */
1234 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1236 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1237 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1240 /* Variable substitution need not be simple. In particular, the
1241 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1242 and friends are up-to-date. */
1243 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1245 int invariant
= is_gimple_min_invariant (*tp
);
1246 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1248 /* Handle the case where we substituted an INDIRECT_REF
1249 into the operand of the ADDR_EXPR. */
1250 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1251 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1253 recompute_tree_invariant_for_addr_expr (*tp
);
1255 /* If this used to be invariant, but is not any longer,
1256 then regimplification is probably needed. */
1257 if (invariant
&& !is_gimple_min_invariant (*tp
))
1258 id
->regimplify
= true;
1264 /* Keep iterating. */
1268 /* Helper for remap_gimple_stmt. Given an EH region number for the
1269 source function, map that to the duplicate EH region number in
1270 the destination function. */
1273 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1275 eh_region old_r
, new_r
;
1277 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1278 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1280 return new_r
->index
;
1283 /* Similar, but operate on INTEGER_CSTs. */
1286 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1290 old_nr
= tree_to_shwi (old_t_nr
);
1291 new_nr
= remap_eh_region_nr (old_nr
, id
);
1293 return build_int_cst (integer_type_node
, new_nr
);
1296 /* Helper for copy_bb. Remap statement STMT using the inlining
1297 information in ID. Return the new statement copy. */
1300 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1303 struct walk_stmt_info wi
;
1304 bool skip_first
= false;
1306 /* Begin by recognizing trees that we'll completely rewrite for the
1307 inlining context. Our output for these trees is completely
1308 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1309 into an edge). Further down, we'll handle trees that get
1310 duplicated and/or tweaked. */
1312 /* When requested, GIMPLE_RETURNs should be transformed to just the
1313 contained GIMPLE_ASSIGN. The branch semantics of the return will
1314 be handled elsewhere by manipulating the CFG rather than the
1316 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1318 tree retval
= gimple_return_retval (stmt
);
1320 /* If we're returning something, just turn that into an
1321 assignment into the equivalent of the original RESULT_DECL.
1322 If RETVAL is just the result decl, the result decl has
1323 already been set (e.g. a recent "foo (&result_decl, ...)");
1324 just toss the entire GIMPLE_RETURN. */
1326 && (TREE_CODE (retval
) != RESULT_DECL
1327 && (TREE_CODE (retval
) != SSA_NAME
1328 || ! SSA_NAME_VAR (retval
)
1329 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1331 copy
= gimple_build_assign (id
->do_not_unshare
1332 ? id
->retvar
: unshare_expr (id
->retvar
),
1334 /* id->retvar is already substituted. Skip it on later remapping. */
1338 return gimple_build_nop ();
1340 else if (gimple_has_substatements (stmt
))
1344 /* When cloning bodies from the C++ front end, we will be handed bodies
1345 in High GIMPLE form. Handle here all the High GIMPLE statements that
1346 have embedded statements. */
1347 switch (gimple_code (stmt
))
1350 copy
= copy_gimple_bind (stmt
, id
);
1354 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1355 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1358 case GIMPLE_EH_FILTER
:
1359 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1360 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1364 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1365 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1366 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1369 case GIMPLE_WITH_CLEANUP_EXPR
:
1370 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1371 copy
= gimple_build_wce (s1
);
1374 case GIMPLE_OACC_KERNELS
:
1375 case GIMPLE_OACC_PARALLEL
:
1378 case GIMPLE_OMP_PARALLEL
:
1379 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1380 copy
= gimple_build_omp_parallel
1382 gimple_omp_parallel_clauses (stmt
),
1383 gimple_omp_parallel_child_fn (stmt
),
1384 gimple_omp_parallel_data_arg (stmt
));
1387 case GIMPLE_OMP_TASK
:
1388 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1389 copy
= gimple_build_omp_task
1391 gimple_omp_task_clauses (stmt
),
1392 gimple_omp_task_child_fn (stmt
),
1393 gimple_omp_task_data_arg (stmt
),
1394 gimple_omp_task_copy_fn (stmt
),
1395 gimple_omp_task_arg_size (stmt
),
1396 gimple_omp_task_arg_align (stmt
));
1399 case GIMPLE_OMP_FOR
:
1400 gcc_assert (!is_gimple_omp_oacc_specifically (stmt
));
1401 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1402 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1403 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1404 gimple_omp_for_clauses (stmt
),
1405 gimple_omp_for_collapse (stmt
), s2
);
1408 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1410 gimple_omp_for_set_index (copy
, i
,
1411 gimple_omp_for_index (stmt
, i
));
1412 gimple_omp_for_set_initial (copy
, i
,
1413 gimple_omp_for_initial (stmt
, i
));
1414 gimple_omp_for_set_final (copy
, i
,
1415 gimple_omp_for_final (stmt
, i
));
1416 gimple_omp_for_set_incr (copy
, i
,
1417 gimple_omp_for_incr (stmt
, i
));
1418 gimple_omp_for_set_cond (copy
, i
,
1419 gimple_omp_for_cond (stmt
, i
));
1424 case GIMPLE_OMP_MASTER
:
1425 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1426 copy
= gimple_build_omp_master (s1
);
1429 case GIMPLE_OMP_TASKGROUP
:
1430 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1431 copy
= gimple_build_omp_taskgroup (s1
);
1434 case GIMPLE_OMP_ORDERED
:
1435 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1436 copy
= gimple_build_omp_ordered (s1
);
1439 case GIMPLE_OMP_SECTION
:
1440 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1441 copy
= gimple_build_omp_section (s1
);
1444 case GIMPLE_OMP_SECTIONS
:
1445 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1446 copy
= gimple_build_omp_sections
1447 (s1
, gimple_omp_sections_clauses (stmt
));
1450 case GIMPLE_OMP_SINGLE
:
1451 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1452 copy
= gimple_build_omp_single
1453 (s1
, gimple_omp_single_clauses (stmt
));
1456 case GIMPLE_OMP_TARGET
:
1457 gcc_assert (!is_gimple_omp_oacc_specifically (stmt
));
1458 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1459 copy
= gimple_build_omp_target
1460 (s1
, gimple_omp_target_kind (stmt
),
1461 gimple_omp_target_clauses (stmt
));
1464 case GIMPLE_OMP_TEAMS
:
1465 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1466 copy
= gimple_build_omp_teams
1467 (s1
, gimple_omp_teams_clauses (stmt
));
1470 case GIMPLE_OMP_CRITICAL
:
1471 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1473 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1476 case GIMPLE_TRANSACTION
:
1477 s1
= remap_gimple_seq (gimple_transaction_body (stmt
), id
);
1478 copy
= gimple_build_transaction (s1
, gimple_transaction_label (stmt
));
1479 gimple_transaction_set_subcode (copy
, gimple_transaction_subcode (stmt
));
1488 if (gimple_assign_copy_p (stmt
)
1489 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1490 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1492 /* Here we handle statements that are not completely rewritten.
1493 First we detect some inlining-induced bogosities for
1496 /* Some assignments VAR = VAR; don't generate any rtl code
1497 and thus don't count as variable modification. Avoid
1498 keeping bogosities like 0 = 0. */
1499 tree decl
= gimple_assign_lhs (stmt
), value
;
1502 n
= id
->decl_map
->get (decl
);
1506 STRIP_TYPE_NOPS (value
);
1507 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1508 return gimple_build_nop ();
1512 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1513 in a block that we aren't copying during tree_function_versioning,
1514 just drop the clobber stmt. */
1515 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1517 tree lhs
= gimple_assign_lhs (stmt
);
1518 if (TREE_CODE (lhs
) == MEM_REF
1519 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1521 gimple def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1522 if (gimple_bb (def_stmt
)
1523 && !bitmap_bit_p (id
->blocks_to_copy
,
1524 gimple_bb (def_stmt
)->index
))
1525 return gimple_build_nop ();
1529 if (gimple_debug_bind_p (stmt
))
1531 copy
= gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1532 gimple_debug_bind_get_value (stmt
),
1534 id
->debug_stmts
.safe_push (copy
);
1537 if (gimple_debug_source_bind_p (stmt
))
1539 copy
= gimple_build_debug_source_bind
1540 (gimple_debug_source_bind_get_var (stmt
),
1541 gimple_debug_source_bind_get_value (stmt
), stmt
);
1542 id
->debug_stmts
.safe_push (copy
);
1546 /* Create a new deep copy of the statement. */
1547 copy
= gimple_copy (stmt
);
1549 /* Clear flags that need revisiting. */
1550 if (is_gimple_call (copy
)
1551 && gimple_call_tail_p (copy
))
1552 gimple_call_set_tail (copy
, false);
1554 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1555 RESX and EH_DISPATCH. */
1557 switch (gimple_code (copy
))
1561 tree r
, fndecl
= gimple_call_fndecl (copy
);
1562 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1563 switch (DECL_FUNCTION_CODE (fndecl
))
1565 case BUILT_IN_EH_COPY_VALUES
:
1566 r
= gimple_call_arg (copy
, 1);
1567 r
= remap_eh_region_tree_nr (r
, id
);
1568 gimple_call_set_arg (copy
, 1, r
);
1571 case BUILT_IN_EH_POINTER
:
1572 case BUILT_IN_EH_FILTER
:
1573 r
= gimple_call_arg (copy
, 0);
1574 r
= remap_eh_region_tree_nr (r
, id
);
1575 gimple_call_set_arg (copy
, 0, r
);
1582 /* Reset alias info if we didn't apply measures to
1583 keep it valid over inlining by setting DECL_PT_UID. */
1584 if (!id
->src_cfun
->gimple_df
1585 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1586 gimple_call_reset_alias_info (copy
);
1592 int r
= gimple_resx_region (copy
);
1593 r
= remap_eh_region_nr (r
, id
);
1594 gimple_resx_set_region (copy
, r
);
1598 case GIMPLE_EH_DISPATCH
:
1600 int r
= gimple_eh_dispatch_region (copy
);
1601 r
= remap_eh_region_nr (r
, id
);
1602 gimple_eh_dispatch_set_region (copy
, r
);
1611 /* If STMT has a block defined, map it to the newly constructed
1613 if (gimple_block (copy
))
1616 n
= id
->decl_map
->get (gimple_block (copy
));
1618 gimple_set_block (copy
, *n
);
1621 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1624 /* Remap all the operands in COPY. */
1625 memset (&wi
, 0, sizeof (wi
));
1628 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1630 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1632 /* Clear the copied virtual operands. We are not remapping them here
1633 but are going to recreate them from scratch. */
1634 if (gimple_has_mem_ops (copy
))
1636 gimple_set_vdef (copy
, NULL_TREE
);
1637 gimple_set_vuse (copy
, NULL_TREE
);
1644 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1648 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1649 gcov_type count_scale
)
1651 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1652 basic_block copy_basic_block
;
1657 /* Search for previous copied basic block. */
1660 prev
= prev
->prev_bb
;
1662 /* create_basic_block() will append every new block to
1663 basic_block_info automatically. */
1664 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1665 (basic_block
) prev
->aux
);
1666 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1668 /* We are going to rebuild frequencies from scratch. These values
1669 have just small importance to drive canonicalize_loop_headers. */
1670 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1672 /* We recompute frequencies after inlining, so this is quite safe. */
1673 if (freq
> BB_FREQ_MAX
)
1675 copy_basic_block
->frequency
= freq
;
1677 copy_gsi
= gsi_start_bb (copy_basic_block
);
1679 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1681 gimple stmt
= gsi_stmt (gsi
);
1682 gimple orig_stmt
= stmt
;
1684 id
->regimplify
= false;
1685 stmt
= remap_gimple_stmt (stmt
, id
);
1686 if (gimple_nop_p (stmt
))
1689 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1692 /* With return slot optimization we can end up with
1693 non-gimple (foo *)&this->m, fix that here. */
1694 if (is_gimple_assign (stmt
)
1695 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1696 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1699 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1700 gimple_assign_rhs1 (stmt
),
1702 GSI_CONTINUE_LINKING
);
1703 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1704 id
->regimplify
= false;
1707 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1710 gimple_regimplify_operands (stmt
, &seq_gsi
);
1712 /* If copy_basic_block has been empty at the start of this iteration,
1713 call gsi_start_bb again to get at the newly added statements. */
1714 if (gsi_end_p (copy_gsi
))
1715 copy_gsi
= gsi_start_bb (copy_basic_block
);
1717 gsi_next (©_gsi
);
1719 /* Process the new statement. The call to gimple_regimplify_operands
1720 possibly turned the statement into multiple statements, we
1721 need to process all of them. */
1726 stmt
= gsi_stmt (copy_gsi
);
1727 if (is_gimple_call (stmt
)
1728 && gimple_call_va_arg_pack_p (stmt
)
1731 /* __builtin_va_arg_pack () should be replaced by
1732 all arguments corresponding to ... in the caller. */
1736 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1739 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1742 /* Create the new array of arguments. */
1743 n
= nargs
+ gimple_call_num_args (stmt
);
1744 argarray
.create (n
);
1745 argarray
.safe_grow_cleared (n
);
1747 /* Copy all the arguments before '...' */
1748 memcpy (argarray
.address (),
1749 gimple_call_arg_ptr (stmt
, 0),
1750 gimple_call_num_args (stmt
) * sizeof (tree
));
1752 /* Append the arguments passed in '...' */
1753 memcpy (argarray
.address () + gimple_call_num_args (stmt
),
1754 gimple_call_arg_ptr (id
->gimple_call
, 0)
1755 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1756 nargs
* sizeof (tree
));
1758 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1761 argarray
.release ();
1763 /* Copy all GIMPLE_CALL flags, location and block, except
1764 GF_CALL_VA_ARG_PACK. */
1765 gimple_call_copy_flags (new_call
, stmt
);
1766 gimple_call_set_va_arg_pack (new_call
, false);
1767 gimple_set_location (new_call
, gimple_location (stmt
));
1768 gimple_set_block (new_call
, gimple_block (stmt
));
1769 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1771 gsi_replace (©_gsi
, new_call
, false);
1774 else if (is_gimple_call (stmt
)
1776 && (decl
= gimple_call_fndecl (stmt
))
1777 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1778 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1780 /* __builtin_va_arg_pack_len () should be replaced by
1781 the number of anonymous arguments. */
1782 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1786 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1789 count
= build_int_cst (integer_type_node
, nargs
);
1790 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1791 gsi_replace (©_gsi
, new_stmt
, false);
1795 /* Statements produced by inlining can be unfolded, especially
1796 when we constant propagated some operands. We can't fold
1797 them right now for two reasons:
1798 1) folding require SSA_NAME_DEF_STMTs to be correct
1799 2) we can't change function calls to builtins.
1800 So we just mark statement for later folding. We mark
1801 all new statements, instead just statements that has changed
1802 by some nontrivial substitution so even statements made
1803 foldable indirectly are updated. If this turns out to be
1804 expensive, copy_body can be told to watch for nontrivial
1806 if (id
->statements_to_fold
)
1807 id
->statements_to_fold
->add (stmt
);
1809 /* We're duplicating a CALL_EXPR. Find any corresponding
1810 callgraph edges and update or duplicate them. */
1811 if (is_gimple_call (stmt
))
1813 struct cgraph_edge
*edge
;
1815 switch (id
->transform_call_graph_edges
)
1817 case CB_CGE_DUPLICATE
:
1818 edge
= id
->src_node
->get_edge (orig_stmt
);
1821 int edge_freq
= edge
->frequency
;
1823 struct cgraph_edge
*old_edge
= edge
;
1824 edge
= edge
->clone (id
->dst_node
, stmt
,
1826 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1828 /* We could also just rescale the frequency, but
1829 doing so would introduce roundoff errors and make
1830 verifier unhappy. */
1831 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1834 /* Speculative calls consist of two edges - direct and indirect.
1835 Duplicate the whole thing and distribute frequencies accordingly. */
1836 if (edge
->speculative
)
1838 struct cgraph_edge
*direct
, *indirect
;
1839 struct ipa_ref
*ref
;
1841 gcc_assert (!edge
->indirect_unknown_callee
);
1842 old_edge
->speculative_call_info (direct
, indirect
, ref
);
1843 indirect
= indirect
->clone (id
->dst_node
, stmt
,
1845 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1847 if (old_edge
->frequency
+ indirect
->frequency
)
1849 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
1850 (old_edge
->frequency
+ indirect
->frequency
)),
1852 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
1853 (old_edge
->frequency
+ indirect
->frequency
)),
1856 id
->dst_node
->clone_reference (ref
, stmt
);
1860 edge
->frequency
= new_freq
;
1862 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
1863 && (edge_freq
> edge
->frequency
+ 10
1864 || edge_freq
< edge
->frequency
- 10))
1866 fprintf (dump_file
, "Edge frequency estimated by "
1867 "cgraph %i diverge from inliner's estimate %i\n",
1871 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1874 copy_basic_block
->frequency
);
1880 case CB_CGE_MOVE_CLONES
:
1881 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
1883 edge
= id
->dst_node
->get_edge (stmt
);
1887 edge
= id
->dst_node
->get_edge (orig_stmt
);
1889 edge
->set_call_stmt (stmt
);
1896 /* Constant propagation on argument done during inlining
1897 may create new direct call. Produce an edge for it. */
1899 || (edge
->indirect_inlining_edge
1900 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1901 && id
->dst_node
->definition
1902 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1904 struct cgraph_node
*dest
= cgraph_node::get (fn
);
1906 /* We have missing edge in the callgraph. This can happen
1907 when previous inlining turned an indirect call into a
1908 direct call by constant propagating arguments or we are
1909 producing dead clone (for further cloning). In all
1910 other cases we hit a bug (incorrect node sharing is the
1911 most common reason for missing edges). */
1912 gcc_assert (!dest
->definition
1913 || dest
->address_taken
1914 || !id
->src_node
->definition
1915 || !id
->dst_node
->definition
);
1916 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1917 id
->dst_node
->create_edge_including_clones
1918 (dest
, orig_stmt
, stmt
, bb
->count
,
1919 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
1921 CIF_ORIGINALLY_INDIRECT_CALL
);
1923 id
->dst_node
->create_edge (dest
, stmt
,
1925 compute_call_stmt_bb_frequency
1926 (id
->dst_node
->decl
,
1927 copy_basic_block
))->inline_failed
1928 = CIF_ORIGINALLY_INDIRECT_CALL
;
1931 fprintf (dump_file
, "Created new direct edge to %s\n",
1936 notice_special_calls (stmt
);
1939 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
1940 id
->eh_map
, id
->eh_lp_nr
);
1942 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
1947 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1948 if (TREE_CODE (def
) == SSA_NAME
)
1949 SSA_NAME_DEF_STMT (def
) = stmt
;
1952 gsi_next (©_gsi
);
1954 while (!gsi_end_p (copy_gsi
));
1956 copy_gsi
= gsi_last_bb (copy_basic_block
);
1959 return copy_basic_block
;
1962 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1963 form is quite easy, since dominator relationship for old basic blocks does
1966 There is however exception where inlining might change dominator relation
1967 across EH edges from basic block within inlined functions destinating
1968 to landing pads in function we inline into.
1970 The function fills in PHI_RESULTs of such PHI nodes if they refer
1971 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1972 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1973 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1974 set, and this means that there will be no overlapping live ranges
1975 for the underlying symbol.
1977 This might change in future if we allow redirecting of EH edges and
1978 we might want to change way build CFG pre-inlining to include
1979 all the possible edges then. */
1981 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1982 bool can_throw
, bool nonlocal_goto
)
1987 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1989 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1992 gimple_stmt_iterator si
;
1995 gcc_assert (e
->flags
& EDGE_EH
);
1998 gcc_assert (!(e
->flags
& EDGE_EH
));
2000 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2004 phi
= gsi_stmt (si
);
2006 /* For abnormal goto/call edges the receiver can be the
2007 ENTRY_BLOCK. Do not assert this cannot happen. */
2009 gcc_assert ((e
->flags
& EDGE_EH
)
2010 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2012 re
= find_edge (ret_bb
, e
->dest
);
2013 gcc_checking_assert (re
);
2014 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2015 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2017 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2018 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2024 /* Copy edges from BB into its copy constructed earlier, scale profile
2025 accordingly. Edges will be taken care of later. Assume aux
2026 pointers to point to the copies of each BB. Return true if any
2027 debug stmts are left after a statement that must end the basic block. */
2030 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
2031 basic_block abnormal_goto_dest
)
2033 basic_block new_bb
= (basic_block
) bb
->aux
;
2036 gimple_stmt_iterator si
;
2038 bool need_debug_cleanup
= false;
2040 /* Use the indices from the original blocks to create edges for the
2042 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2043 if (!(old_edge
->flags
& EDGE_EH
))
2047 flags
= old_edge
->flags
;
2049 /* Return edges do get a FALLTHRU flag when the get inlined. */
2050 if (old_edge
->dest
->index
== EXIT_BLOCK
2051 && !(old_edge
->flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2052 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2053 flags
|= EDGE_FALLTHRU
;
2054 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2055 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
2056 new_edge
->probability
= old_edge
->probability
;
2059 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2062 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2065 bool can_throw
, nonlocal_goto
;
2067 copy_stmt
= gsi_stmt (si
);
2068 if (!is_gimple_debug (copy_stmt
))
2069 update_stmt (copy_stmt
);
2071 /* Do this before the possible split_block. */
2074 /* If this tree could throw an exception, there are two
2075 cases where we need to add abnormal edge(s): the
2076 tree wasn't in a region and there is a "current
2077 region" in the caller; or the original tree had
2078 EH edges. In both cases split the block after the tree,
2079 and add abnormal edge(s) as needed; we need both
2080 those from the callee and the caller.
2081 We check whether the copy can throw, because the const
2082 propagation can change an INDIRECT_REF which throws
2083 into a COMPONENT_REF which doesn't. If the copy
2084 can throw, the original could also throw. */
2085 can_throw
= stmt_can_throw_internal (copy_stmt
);
2087 = (stmt_can_make_abnormal_goto (copy_stmt
)
2088 && !computed_goto_p (copy_stmt
));
2090 if (can_throw
|| nonlocal_goto
)
2092 if (!gsi_end_p (si
))
2094 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2097 need_debug_cleanup
= true;
2099 if (!gsi_end_p (si
))
2100 /* Note that bb's predecessor edges aren't necessarily
2101 right at this point; split_block doesn't care. */
2103 edge e
= split_block (new_bb
, copy_stmt
);
2106 new_bb
->aux
= e
->src
->aux
;
2107 si
= gsi_start_bb (new_bb
);
2111 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2112 make_eh_dispatch_edges (copy_stmt
);
2114 make_eh_edges (copy_stmt
);
2116 /* If the call we inline cannot make abnormal goto do not add
2117 additional abnormal edges but only retain those already present
2118 in the original function body. */
2119 if (abnormal_goto_dest
== NULL
)
2120 nonlocal_goto
= false;
2123 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2125 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2126 nonlocal_goto
= false;
2127 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2128 in OpenMP regions which aren't allowed to be left abnormally.
2129 So, no need to add abnormal edge in that case. */
2130 else if (is_gimple_call (copy_stmt
)
2131 && gimple_call_internal_p (copy_stmt
)
2132 && (gimple_call_internal_fn (copy_stmt
)
2133 == IFN_ABNORMAL_DISPATCHER
)
2134 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2135 nonlocal_goto
= false;
2137 make_edge (copy_stmt_bb
, abnormal_goto_dest
, EDGE_ABNORMAL
);
2140 if ((can_throw
|| nonlocal_goto
)
2141 && gimple_in_ssa_p (cfun
))
2142 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2143 can_throw
, nonlocal_goto
);
2145 return need_debug_cleanup
;
2148 /* Copy the PHIs. All blocks and edges are copied, some blocks
2149 was possibly split and new outgoing EH edges inserted.
2150 BB points to the block of original function and AUX pointers links
2151 the original and newly copied blocks. */
2154 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2156 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2159 gimple_stmt_iterator si
;
2161 bool inserted
= false;
2163 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2168 phi
= gsi_stmt (si
);
2169 res
= PHI_RESULT (phi
);
2171 if (!virtual_operand_p (res
))
2173 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2174 new_phi
= create_phi_node (new_res
, new_bb
);
2175 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2177 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2183 /* When doing partial cloning, we allow PHIs on the entry block
2184 as long as all the arguments are the same. Find any input
2185 edge to see argument to copy. */
2187 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2188 if (!old_edge
->src
->aux
)
2191 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2193 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2194 gcc_assert (new_arg
);
2195 /* With return slot optimization we can end up with
2196 non-gimple (foo *)&this->m, fix that here. */
2197 if (TREE_CODE (new_arg
) != SSA_NAME
2198 && TREE_CODE (new_arg
) != FUNCTION_DECL
2199 && !is_gimple_val (new_arg
))
2201 gimple_seq stmts
= NULL
;
2202 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2203 gsi_insert_seq_on_edge (new_edge
, stmts
);
2206 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2207 if (LOCATION_BLOCK (locus
))
2210 n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
2213 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2215 locus
= LOCATION_LOCUS (locus
);
2218 locus
= LOCATION_LOCUS (locus
);
2220 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2225 /* Commit the delayed edge insertions. */
2227 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2228 gsi_commit_one_edge_insert (new_edge
, NULL
);
2232 /* Wrapper for remap_decl so it can be used as a callback. */
2235 remap_decl_1 (tree decl
, void *data
)
2237 return remap_decl (decl
, (copy_body_data
*) data
);
2240 /* Build struct function and associated datastructures for the new clone
2241 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2242 the cfun to the function of new_fndecl (and current_function_decl too). */
2245 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2247 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2248 gcov_type count_scale
;
2250 if (!DECL_ARGUMENTS (new_fndecl
))
2251 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2252 if (!DECL_RESULT (new_fndecl
))
2253 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2255 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2257 = GCOV_COMPUTE_SCALE (count
,
2258 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2260 count_scale
= REG_BR_PROB_BASE
;
2262 /* Register specific tree functions. */
2263 gimple_register_cfg_hooks ();
2265 /* Get clean struct function. */
2266 push_struct_function (new_fndecl
);
2268 /* We will rebuild these, so just sanity check that they are empty. */
2269 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2270 gcc_assert (cfun
->local_decls
== NULL
);
2271 gcc_assert (cfun
->cfg
== NULL
);
2272 gcc_assert (cfun
->decl
== new_fndecl
);
2274 /* Copy items we preserve during cloning. */
2275 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2276 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2277 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2278 cfun
->curr_properties
= src_cfun
->curr_properties
;
2279 cfun
->last_verified
= src_cfun
->last_verified
;
2280 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2281 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2282 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2283 cfun
->stdarg
= src_cfun
->stdarg
;
2284 cfun
->after_inlining
= src_cfun
->after_inlining
;
2285 cfun
->can_throw_non_call_exceptions
2286 = src_cfun
->can_throw_non_call_exceptions
;
2287 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2288 cfun
->returns_struct
= src_cfun
->returns_struct
;
2289 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2291 init_empty_tree_cfg ();
2293 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2294 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2295 (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2297 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2298 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2299 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2300 (EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2302 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2303 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2305 init_eh_for_function ();
2307 if (src_cfun
->gimple_df
)
2309 init_tree_ssa (cfun
);
2310 cfun
->gimple_df
->in_ssa_p
= true;
2311 init_ssa_operands (cfun
);
2315 /* Helper function for copy_cfg_body. Move debug stmts from the end
2316 of NEW_BB to the beginning of successor basic blocks when needed. If the
2317 successor has multiple predecessors, reset them, otherwise keep
2321 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2325 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2328 || gsi_one_before_end_p (si
)
2329 || !(stmt_can_throw_internal (gsi_stmt (si
))
2330 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2333 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2335 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2336 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2337 while (is_gimple_debug (gsi_stmt (ssi
)))
2339 gimple stmt
= gsi_stmt (ssi
), new_stmt
;
2343 /* For the last edge move the debug stmts instead of copying
2345 if (ei_one_before_end_p (ei
))
2349 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2350 gimple_debug_bind_reset_value (stmt
);
2351 gsi_remove (&si
, false);
2352 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2356 if (gimple_debug_bind_p (stmt
))
2358 var
= gimple_debug_bind_get_var (stmt
);
2359 if (single_pred_p (e
->dest
))
2361 value
= gimple_debug_bind_get_value (stmt
);
2362 value
= unshare_expr (value
);
2366 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2368 else if (gimple_debug_source_bind_p (stmt
))
2370 var
= gimple_debug_source_bind_get_var (stmt
);
2371 value
= gimple_debug_source_bind_get_value (stmt
);
2372 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2376 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2377 id
->debug_stmts
.safe_push (new_stmt
);
2383 /* Make a copy of the sub-loops of SRC_PARENT and place them
2384 as siblings of DEST_PARENT. */
2387 copy_loops (copy_body_data
*id
,
2388 struct loop
*dest_parent
, struct loop
*src_parent
)
2390 struct loop
*src_loop
= src_parent
->inner
;
2393 if (!id
->blocks_to_copy
2394 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2396 struct loop
*dest_loop
= alloc_loop ();
2398 /* Assign the new loop its header and latch and associate
2399 those with the new loop. */
2400 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2401 dest_loop
->header
->loop_father
= dest_loop
;
2402 if (src_loop
->latch
!= NULL
)
2404 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2405 dest_loop
->latch
->loop_father
= dest_loop
;
2408 /* Copy loop meta-data. */
2409 copy_loop_info (src_loop
, dest_loop
);
2411 /* Finally place it into the loop array and the loop tree. */
2412 place_new_loop (cfun
, dest_loop
);
2413 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2415 dest_loop
->safelen
= src_loop
->safelen
;
2416 dest_loop
->dont_vectorize
= src_loop
->dont_vectorize
;
2417 if (src_loop
->force_vectorize
)
2419 dest_loop
->force_vectorize
= true;
2420 cfun
->has_force_vectorize_loops
= true;
2422 if (src_loop
->simduid
)
2424 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2425 cfun
->has_simduid_loops
= true;
2429 copy_loops (id
, dest_loop
, src_loop
);
2431 src_loop
= src_loop
->next
;
2435 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2438 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2440 gimple_stmt_iterator si
;
2441 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2443 if (is_gimple_call (gsi_stmt (si
)))
2445 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (gsi_stmt (si
));
2447 edge
->redirect_call_stmt_to_callee ();
2452 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2453 with each bb's frequency. Used when NODE has a 0-weight entry
2454 but we are about to inline it into a non-zero count call bb.
2455 See the comments for handle_missing_profiles() in predict.c for
2456 when this can happen for COMDATs. */
2459 freqs_to_counts (struct cgraph_node
*node
, gcov_type count
)
2464 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2466 FOR_ALL_BB_FN(bb
, fn
)
2468 bb
->count
= apply_scale (count
,
2469 GCOV_COMPUTE_SCALE (bb
->frequency
, BB_FREQ_MAX
));
2470 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2471 e
->count
= apply_probability (e
->src
->count
, e
->probability
);
2475 /* Make a copy of the body of FN so that it can be inserted inline in
2476 another function. Walks FN via CFG, returns new fndecl. */
2479 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2480 basic_block entry_block_map
, basic_block exit_block_map
,
2481 basic_block new_entry
)
2483 tree callee_fndecl
= id
->src_fn
;
2484 /* Original cfun for the callee, doesn't change. */
2485 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2486 struct function
*cfun_to_copy
;
2488 tree new_fndecl
= NULL
;
2489 bool need_debug_cleanup
= false;
2490 gcov_type count_scale
;
2492 int incoming_frequency
= 0;
2493 gcov_type incoming_count
= 0;
2495 /* This can happen for COMDAT routines that end up with 0 counts
2496 despite being called (see the comments for handle_missing_profiles()
2497 in predict.c as to why). Apply counts to the blocks in the callee
2498 before inlining, using the guessed edge frequencies, so that we don't
2499 end up with a 0-count inline body which can confuse downstream
2500 optimizations such as function splitting. */
2501 if (!ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
&& count
)
2503 /* Apply the larger of the call bb count and the total incoming
2504 call edge count to the callee. */
2505 gcov_type in_count
= 0;
2506 struct cgraph_edge
*in_edge
;
2507 for (in_edge
= id
->src_node
->callers
; in_edge
;
2508 in_edge
= in_edge
->next_caller
)
2509 in_count
+= in_edge
->count
;
2510 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2513 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2515 = GCOV_COMPUTE_SCALE (count
,
2516 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2518 count_scale
= REG_BR_PROB_BASE
;
2520 /* Register specific tree functions. */
2521 gimple_register_cfg_hooks ();
2523 /* If we are inlining just region of the function, make sure to connect
2524 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2525 part of loop, we must compute frequency and probability of
2526 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2527 probabilities of edges incoming from nonduplicated region. */
2533 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2536 incoming_frequency
+= EDGE_FREQUENCY (e
);
2537 incoming_count
+= e
->count
;
2539 incoming_count
= apply_scale (incoming_count
, count_scale
);
2541 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2542 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2543 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2546 /* Must have a CFG here at this point. */
2547 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2548 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2550 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2552 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2553 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2554 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2555 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2557 /* Duplicate any exception-handling regions. */
2559 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2562 /* Use aux pointers to map the original blocks to copy. */
2563 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2564 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2566 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2569 new_bb
->loop_father
= entry_block_map
->loop_father
;
2572 last
= last_basic_block_for_fn (cfun
);
2574 /* Now that we've duplicated the blocks, duplicate their edges. */
2575 basic_block abnormal_goto_dest
= NULL
;
2577 && stmt_can_make_abnormal_goto (id
->gimple_call
))
2579 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->gimple_call
);
2581 bb
= gimple_bb (id
->gimple_call
);
2583 if (gsi_end_p (gsi
))
2584 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2586 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2587 if (!id
->blocks_to_copy
2588 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2589 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2590 abnormal_goto_dest
);
2594 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2595 e
->probability
= REG_BR_PROB_BASE
;
2596 e
->count
= incoming_count
;
2599 /* Duplicate the loop tree, if available and wanted. */
2600 if (loops_for_fn (src_cfun
) != NULL
2601 && current_loops
!= NULL
)
2603 copy_loops (id
, entry_block_map
->loop_father
,
2604 get_loop (src_cfun
, 0));
2605 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2606 loops_state_set (LOOPS_NEED_FIXUP
);
2609 /* If the loop tree in the source function needed fixup, mark the
2610 destination loop tree for fixup, too. */
2611 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2612 loops_state_set (LOOPS_NEED_FIXUP
);
2614 if (gimple_in_ssa_p (cfun
))
2615 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2616 if (!id
->blocks_to_copy
2617 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2618 copy_phis_for_bb (bb
, id
);
2620 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2623 if (need_debug_cleanup
2624 && bb
->index
!= ENTRY_BLOCK
2625 && bb
->index
!= EXIT_BLOCK
)
2626 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2627 /* Update call edge destinations. This can not be done before loop
2628 info is updated, because we may split basic blocks. */
2629 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2630 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2631 ((basic_block
)bb
->aux
)->aux
= NULL
;
2635 /* Zero out AUX fields of newly created block during EH edge
2637 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2639 if (need_debug_cleanup
)
2640 maybe_move_debug_stmts_to_successors (id
,
2641 BASIC_BLOCK_FOR_FN (cfun
, last
));
2642 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2643 /* Update call edge destinations. This can not be done before loop
2644 info is updated, because we may split basic blocks. */
2645 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2646 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2648 entry_block_map
->aux
= NULL
;
2649 exit_block_map
->aux
= NULL
;
2660 /* Copy the debug STMT using ID. We deal with these statements in a
2661 special way: if any variable in their VALUE expression wasn't
2662 remapped yet, we won't remap it, because that would get decl uids
2663 out of sync, causing codegen differences between -g and -g0. If
2664 this arises, we drop the VALUE expression altogether. */
2667 copy_debug_stmt (gimple stmt
, copy_body_data
*id
)
2670 struct walk_stmt_info wi
;
2672 if (gimple_block (stmt
))
2674 n
= id
->decl_map
->get (gimple_block (stmt
));
2675 gimple_set_block (stmt
, n
? *n
: id
->block
);
2678 /* Remap all the operands in COPY. */
2679 memset (&wi
, 0, sizeof (wi
));
2682 processing_debug_stmt
= 1;
2684 if (gimple_debug_source_bind_p (stmt
))
2685 t
= gimple_debug_source_bind_get_var (stmt
);
2687 t
= gimple_debug_bind_get_var (stmt
);
2689 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2690 && (n
= id
->debug_map
->get (t
)))
2692 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2695 else if (TREE_CODE (t
) == VAR_DECL
2696 && !is_global_var (t
)
2697 && !id
->decl_map
->get (t
))
2698 /* T is a non-localized variable. */;
2700 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2702 if (gimple_debug_bind_p (stmt
))
2704 gimple_debug_bind_set_var (stmt
, t
);
2706 if (gimple_debug_bind_has_value_p (stmt
))
2707 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2708 remap_gimple_op_r
, &wi
, NULL
);
2710 /* Punt if any decl couldn't be remapped. */
2711 if (processing_debug_stmt
< 0)
2712 gimple_debug_bind_reset_value (stmt
);
2714 else if (gimple_debug_source_bind_p (stmt
))
2716 gimple_debug_source_bind_set_var (stmt
, t
);
2717 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2718 remap_gimple_op_r
, &wi
, NULL
);
2719 /* When inlining and source bind refers to one of the optimized
2720 away parameters, change the source bind into normal debug bind
2721 referring to the corresponding DEBUG_EXPR_DECL that should have
2722 been bound before the call stmt. */
2723 t
= gimple_debug_source_bind_get_value (stmt
);
2725 && TREE_CODE (t
) == PARM_DECL
2728 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2730 if (debug_args
!= NULL
)
2732 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2733 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2734 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2736 t
= (**debug_args
)[i
+ 1];
2737 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2738 gimple_debug_bind_set_value (stmt
, t
);
2745 processing_debug_stmt
= 0;
2750 /* Process deferred debug stmts. In order to give values better odds
2751 of being successfully remapped, we delay the processing of debug
2752 stmts until all other stmts that might require remapping are
2756 copy_debug_stmts (copy_body_data
*id
)
2761 if (!id
->debug_stmts
.exists ())
2764 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2765 copy_debug_stmt (stmt
, id
);
2767 id
->debug_stmts
.release ();
2770 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2771 another function. */
2774 copy_tree_body (copy_body_data
*id
)
2776 tree fndecl
= id
->src_fn
;
2777 tree body
= DECL_SAVED_TREE (fndecl
);
2779 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2784 /* Make a copy of the body of FN so that it can be inserted inline in
2785 another function. */
2788 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2789 basic_block entry_block_map
, basic_block exit_block_map
,
2790 basic_block new_entry
)
2792 tree fndecl
= id
->src_fn
;
2795 /* If this body has a CFG, walk CFG and copy. */
2796 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2797 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2799 copy_debug_stmts (id
);
2804 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2805 defined in function FN, or of a data member thereof. */
2808 self_inlining_addr_expr (tree value
, tree fn
)
2812 if (TREE_CODE (value
) != ADDR_EXPR
)
2815 var
= get_base_address (TREE_OPERAND (value
, 0));
2817 return var
&& auto_var_in_fn_p (var
, fn
);
2820 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2821 lexical block and line number information from base_stmt, if given,
2822 or from the last stmt of the block otherwise. */
2825 insert_init_debug_bind (copy_body_data
*id
,
2826 basic_block bb
, tree var
, tree value
,
2830 gimple_stmt_iterator gsi
;
2833 if (!gimple_in_ssa_p (id
->src_cfun
))
2836 if (!MAY_HAVE_DEBUG_STMTS
)
2839 tracked_var
= target_for_debug_bind (var
);
2845 gsi
= gsi_last_bb (bb
);
2846 if (!base_stmt
&& !gsi_end_p (gsi
))
2847 base_stmt
= gsi_stmt (gsi
);
2850 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
2854 if (!gsi_end_p (gsi
))
2855 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
2857 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
2864 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
2866 /* If VAR represents a zero-sized variable, it's possible that the
2867 assignment statement may result in no gimple statements. */
2870 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2872 /* We can end up with init statements that store to a non-register
2873 from a rhs with a conversion. Handle that here by forcing the
2874 rhs into a temporary. gimple_regimplify_operands is not
2875 prepared to do this for us. */
2876 if (!is_gimple_debug (init_stmt
)
2877 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
2878 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2879 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2881 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2882 gimple_expr_type (init_stmt
),
2883 gimple_assign_rhs1 (init_stmt
));
2884 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2886 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2887 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2889 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2890 gimple_regimplify_operands (init_stmt
, &si
);
2892 if (!is_gimple_debug (init_stmt
) && MAY_HAVE_DEBUG_STMTS
)
2894 tree def
= gimple_assign_lhs (init_stmt
);
2895 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
2900 /* Initialize parameter P with VALUE. If needed, produce init statement
2901 at the end of BB. When BB is NULL, we return init statement to be
2904 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2905 basic_block bb
, tree
*vars
)
2907 gimple init_stmt
= NULL
;
2910 tree def
= (gimple_in_ssa_p (cfun
)
2911 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
2914 && value
!= error_mark_node
2915 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2917 /* If we can match up types by promotion/demotion do so. */
2918 if (fold_convertible_p (TREE_TYPE (p
), value
))
2919 rhs
= fold_convert (TREE_TYPE (p
), value
);
2922 /* ??? For valid programs we should not end up here.
2923 Still if we end up with truly mismatched types here, fall back
2924 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
2925 GIMPLE to the following passes. */
2926 if (!is_gimple_reg_type (TREE_TYPE (value
))
2927 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
2928 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2930 rhs
= build_zero_cst (TREE_TYPE (p
));
2934 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2935 here since the type of this decl must be visible to the calling
2937 var
= copy_decl_to_var (p
, id
);
2939 /* Declare this new variable. */
2940 DECL_CHAIN (var
) = *vars
;
2943 /* Make gimplifier happy about this variable. */
2944 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2946 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2947 we would not need to create a new variable here at all, if it
2948 weren't for debug info. Still, we can just use the argument
2950 if (TREE_READONLY (p
)
2951 && !TREE_ADDRESSABLE (p
)
2952 && value
&& !TREE_SIDE_EFFECTS (value
)
2955 /* We may produce non-gimple trees by adding NOPs or introduce
2956 invalid sharing when operand is not really constant.
2957 It is not big deal to prohibit constant propagation here as
2958 we will constant propagate in DOM1 pass anyway. */
2959 if (is_gimple_min_invariant (value
)
2960 && useless_type_conversion_p (TREE_TYPE (p
),
2962 /* We have to be very careful about ADDR_EXPR. Make sure
2963 the base variable isn't a local variable of the inlined
2964 function, e.g., when doing recursive inlining, direct or
2965 mutually-recursive or whatever, which is why we don't
2966 just test whether fn == current_function_decl. */
2967 && ! self_inlining_addr_expr (value
, fn
))
2969 insert_decl_map (id
, p
, value
);
2970 insert_debug_decl_map (id
, p
, var
);
2971 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
2975 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2976 that way, when the PARM_DECL is encountered, it will be
2977 automatically replaced by the VAR_DECL. */
2978 insert_decl_map (id
, p
, var
);
2980 /* Even if P was TREE_READONLY, the new VAR should not be.
2981 In the original code, we would have constructed a
2982 temporary, and then the function body would have never
2983 changed the value of P. However, now, we will be
2984 constructing VAR directly. The constructor body may
2985 change its value multiple times as it is being
2986 constructed. Therefore, it must not be TREE_READONLY;
2987 the back-end assumes that TREE_READONLY variable is
2988 assigned to only once. */
2989 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2990 TREE_READONLY (var
) = 0;
2992 /* If there is no setup required and we are in SSA, take the easy route
2993 replacing all SSA names representing the function parameter by the
2994 SSA name passed to function.
2996 We need to construct map for the variable anyway as it might be used
2997 in different SSA names when parameter is set in function.
2999 Do replacement at -O0 for const arguments replaced by constant.
3000 This is important for builtin_constant_p and other construct requiring
3001 constant argument to be visible in inlined function body. */
3002 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3004 || (TREE_READONLY (p
)
3005 && is_gimple_min_invariant (rhs
)))
3006 && (TREE_CODE (rhs
) == SSA_NAME
3007 || is_gimple_min_invariant (rhs
))
3008 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3010 insert_decl_map (id
, def
, rhs
);
3011 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3014 /* If the value of argument is never used, don't care about initializing
3016 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3018 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3019 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3022 /* Initialize this VAR_DECL from the equivalent argument. Convert
3023 the argument to the proper type in case it was promoted. */
3026 if (rhs
== error_mark_node
)
3028 insert_decl_map (id
, p
, var
);
3029 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3032 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3034 /* If we are in SSA form properly remap the default definition
3035 or assign to a dummy SSA name if the parameter is unused and
3036 we are not optimizing. */
3037 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3041 def
= remap_ssa_name (def
, id
);
3042 init_stmt
= gimple_build_assign (def
, rhs
);
3043 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3044 set_ssa_default_def (cfun
, var
, NULL
);
3048 def
= make_ssa_name (var
, NULL
);
3049 init_stmt
= gimple_build_assign (def
, rhs
);
3053 init_stmt
= gimple_build_assign (var
, rhs
);
3055 if (bb
&& init_stmt
)
3056 insert_init_stmt (id
, bb
, init_stmt
);
3061 /* Generate code to initialize the parameters of the function at the
3062 top of the stack in ID from the GIMPLE_CALL STMT. */
3065 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
3066 tree fn
, basic_block bb
)
3071 tree vars
= NULL_TREE
;
3072 tree static_chain
= gimple_call_chain (stmt
);
3074 /* Figure out what the parameters are. */
3075 parms
= DECL_ARGUMENTS (fn
);
3077 /* Loop through the parameter declarations, replacing each with an
3078 equivalent VAR_DECL, appropriately initialized. */
3079 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3082 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3083 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3085 /* After remapping parameters remap their types. This has to be done
3086 in a second loop over all parameters to appropriately remap
3087 variable sized arrays when the size is specified in a
3088 parameter following the array. */
3089 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3091 tree
*varp
= id
->decl_map
->get (p
);
3093 && TREE_CODE (*varp
) == VAR_DECL
)
3095 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3096 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3098 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3099 /* Also remap the default definition if it was remapped
3100 to the default definition of the parameter replacement
3101 by the parameter setup. */
3104 tree
*defp
= id
->decl_map
->get (def
);
3106 && TREE_CODE (*defp
) == SSA_NAME
3107 && SSA_NAME_VAR (*defp
) == var
)
3108 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3113 /* Initialize the static chain. */
3114 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3115 gcc_assert (fn
!= current_function_decl
);
3118 /* No static chain? Seems like a bug in tree-nested.c. */
3119 gcc_assert (static_chain
);
3121 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3124 declare_inline_vars (id
->block
, vars
);
3128 /* Declare a return variable to replace the RESULT_DECL for the
3129 function we are calling. An appropriate DECL_STMT is returned.
3130 The USE_STMT is filled to contain a use of the declaration to
3131 indicate the return value of the function.
3133 RETURN_SLOT, if non-null is place where to store the result. It
3134 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3135 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3137 The return value is a (possibly null) value that holds the result
3138 as seen by the caller. */
3141 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3142 basic_block entry_bb
)
3144 tree callee
= id
->src_fn
;
3145 tree result
= DECL_RESULT (callee
);
3146 tree callee_type
= TREE_TYPE (result
);
3150 /* Handle type-mismatches in the function declaration return type
3151 vs. the call expression. */
3153 caller_type
= TREE_TYPE (modify_dest
);
3155 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3157 /* We don't need to do anything for functions that don't return anything. */
3158 if (VOID_TYPE_P (callee_type
))
3161 /* If there was a return slot, then the return value is the
3162 dereferenced address of that object. */
3165 /* The front end shouldn't have used both return_slot and
3166 a modify expression. */
3167 gcc_assert (!modify_dest
);
3168 if (DECL_BY_REFERENCE (result
))
3170 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3171 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3173 /* We are going to construct *&return_slot and we can't do that
3174 for variables believed to be not addressable.
3176 FIXME: This check possibly can match, because values returned
3177 via return slot optimization are not believed to have address
3178 taken by alias analysis. */
3179 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3180 var
= return_slot_addr
;
3185 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3186 if (TREE_ADDRESSABLE (result
))
3187 mark_addressable (var
);
3189 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3190 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3191 && !DECL_GIMPLE_REG_P (result
)
3193 DECL_GIMPLE_REG_P (var
) = 0;
3198 /* All types requiring non-trivial constructors should have been handled. */
3199 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3201 /* Attempt to avoid creating a new temporary variable. */
3203 && TREE_CODE (modify_dest
) != SSA_NAME
)
3205 bool use_it
= false;
3207 /* We can't use MODIFY_DEST if there's type promotion involved. */
3208 if (!useless_type_conversion_p (callee_type
, caller_type
))
3211 /* ??? If we're assigning to a variable sized type, then we must
3212 reuse the destination variable, because we've no good way to
3213 create variable sized temporaries at this point. */
3214 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3217 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3218 reuse it as the result of the call directly. Don't do this if
3219 it would promote MODIFY_DEST to addressable. */
3220 else if (TREE_ADDRESSABLE (result
))
3224 tree base_m
= get_base_address (modify_dest
);
3226 /* If the base isn't a decl, then it's a pointer, and we don't
3227 know where that's going to go. */
3228 if (!DECL_P (base_m
))
3230 else if (is_global_var (base_m
))
3232 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3233 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3234 && !DECL_GIMPLE_REG_P (result
)
3235 && DECL_GIMPLE_REG_P (base_m
))
3237 else if (!TREE_ADDRESSABLE (base_m
))
3249 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3251 var
= copy_result_decl_to_var (result
, id
);
3252 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3254 /* Do not have the rest of GCC warn about this variable as it should
3255 not be visible to the user. */
3256 TREE_NO_WARNING (var
) = 1;
3258 declare_inline_vars (id
->block
, var
);
3260 /* Build the use expr. If the return type of the function was
3261 promoted, convert it back to the expected type. */
3263 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3265 /* If we can match up types by promotion/demotion do so. */
3266 if (fold_convertible_p (caller_type
, var
))
3267 use
= fold_convert (caller_type
, var
);
3270 /* ??? For valid programs we should not end up here.
3271 Still if we end up with truly mismatched types here, fall back
3272 to using a MEM_REF to not leak invalid GIMPLE to the following
3274 /* Prevent var from being written into SSA form. */
3275 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3276 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3277 DECL_GIMPLE_REG_P (var
) = false;
3278 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3279 TREE_ADDRESSABLE (var
) = true;
3280 use
= fold_build2 (MEM_REF
, caller_type
,
3281 build_fold_addr_expr (var
),
3282 build_int_cst (ptr_type_node
, 0));
3286 STRIP_USELESS_TYPE_CONVERSION (use
);
3288 if (DECL_BY_REFERENCE (result
))
3290 TREE_ADDRESSABLE (var
) = 1;
3291 var
= build_fold_addr_expr (var
);
3295 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3296 way, when the RESULT_DECL is encountered, it will be
3297 automatically replaced by the VAR_DECL.
3299 When returning by reference, ensure that RESULT_DECL remaps to
3301 if (DECL_BY_REFERENCE (result
)
3302 && !is_gimple_val (var
))
3304 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3305 insert_decl_map (id
, result
, temp
);
3306 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3307 it's default_def SSA_NAME. */
3308 if (gimple_in_ssa_p (id
->src_cfun
)
3309 && is_gimple_reg (result
))
3311 temp
= make_ssa_name (temp
, NULL
);
3312 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3314 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3317 insert_decl_map (id
, result
, var
);
3319 /* Remember this so we can ignore it in remap_decls. */
3325 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3326 to a local label. */
3329 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3332 tree fn
= (tree
) fnp
;
3334 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3343 /* Determine if the function can be copied. If so return NULL. If
3344 not return a string describng the reason for failure. */
3347 copy_forbidden (struct function
*fun
, tree fndecl
)
3349 const char *reason
= fun
->cannot_be_copied_reason
;
3353 /* Only examine the function once. */
3354 if (fun
->cannot_be_copied_set
)
3357 /* We cannot copy a function that receives a non-local goto
3358 because we cannot remap the destination label used in the
3359 function that is performing the non-local goto. */
3360 /* ??? Actually, this should be possible, if we work at it.
3361 No doubt there's just a handful of places that simply
3362 assume it doesn't happen and don't substitute properly. */
3363 if (fun
->has_nonlocal_label
)
3365 reason
= G_("function %q+F can never be copied "
3366 "because it receives a non-local goto");
3370 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3371 if (TREE_CODE (decl
) == VAR_DECL
3372 && TREE_STATIC (decl
)
3373 && !DECL_EXTERNAL (decl
)
3374 && DECL_INITIAL (decl
)
3375 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3376 has_label_address_in_static_1
,
3379 reason
= G_("function %q+F can never be copied because it saves "
3380 "address of local label in a static variable");
3385 fun
->cannot_be_copied_reason
= reason
;
3386 fun
->cannot_be_copied_set
= true;
3391 static const char *inline_forbidden_reason
;
3393 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3394 iff a function can not be inlined. Also sets the reason why. */
3397 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3398 struct walk_stmt_info
*wip
)
3400 tree fn
= (tree
) wip
->info
;
3402 gimple stmt
= gsi_stmt (*gsi
);
3404 switch (gimple_code (stmt
))
3407 /* Refuse to inline alloca call unless user explicitly forced so as
3408 this may change program's memory overhead drastically when the
3409 function using alloca is called in loop. In GCC present in
3410 SPEC2000 inlining into schedule_block cause it to require 2GB of
3411 RAM instead of 256MB. Don't do so for alloca calls emitted for
3412 VLA objects as those can't cause unbounded growth (they're always
3413 wrapped inside stack_save/stack_restore regions. */
3414 if (gimple_alloca_call_p (stmt
)
3415 && !gimple_call_alloca_for_var_p (stmt
)
3416 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3418 inline_forbidden_reason
3419 = G_("function %q+F can never be inlined because it uses "
3420 "alloca (override using the always_inline attribute)");
3421 *handled_ops_p
= true;
3425 t
= gimple_call_fndecl (stmt
);
3429 /* We cannot inline functions that call setjmp. */
3430 if (setjmp_call_p (t
))
3432 inline_forbidden_reason
3433 = G_("function %q+F can never be inlined because it uses setjmp");
3434 *handled_ops_p
= true;
3438 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3439 switch (DECL_FUNCTION_CODE (t
))
3441 /* We cannot inline functions that take a variable number of
3443 case BUILT_IN_VA_START
:
3444 case BUILT_IN_NEXT_ARG
:
3445 case BUILT_IN_VA_END
:
3446 inline_forbidden_reason
3447 = G_("function %q+F can never be inlined because it "
3448 "uses variable argument lists");
3449 *handled_ops_p
= true;
3452 case BUILT_IN_LONGJMP
:
3453 /* We can't inline functions that call __builtin_longjmp at
3454 all. The non-local goto machinery really requires the
3455 destination be in a different function. If we allow the
3456 function calling __builtin_longjmp to be inlined into the
3457 function calling __builtin_setjmp, Things will Go Awry. */
3458 inline_forbidden_reason
3459 = G_("function %q+F can never be inlined because "
3460 "it uses setjmp-longjmp exception handling");
3461 *handled_ops_p
= true;
3464 case BUILT_IN_NONLOCAL_GOTO
:
3466 inline_forbidden_reason
3467 = G_("function %q+F can never be inlined because "
3468 "it uses non-local goto");
3469 *handled_ops_p
= true;
3472 case BUILT_IN_RETURN
:
3473 case BUILT_IN_APPLY_ARGS
:
3474 /* If a __builtin_apply_args caller would be inlined,
3475 it would be saving arguments of the function it has
3476 been inlined into. Similarly __builtin_return would
3477 return from the function the inline has been inlined into. */
3478 inline_forbidden_reason
3479 = G_("function %q+F can never be inlined because "
3480 "it uses __builtin_return or __builtin_apply_args");
3481 *handled_ops_p
= true;
3490 t
= gimple_goto_dest (stmt
);
3492 /* We will not inline a function which uses computed goto. The
3493 addresses of its local labels, which may be tucked into
3494 global storage, are of course not constant across
3495 instantiations, which causes unexpected behavior. */
3496 if (TREE_CODE (t
) != LABEL_DECL
)
3498 inline_forbidden_reason
3499 = G_("function %q+F can never be inlined "
3500 "because it contains a computed goto");
3501 *handled_ops_p
= true;
3510 *handled_ops_p
= false;
3514 /* Return true if FNDECL is a function that cannot be inlined into
3518 inline_forbidden_p (tree fndecl
)
3520 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3521 struct walk_stmt_info wi
;
3523 bool forbidden_p
= false;
3525 /* First check for shared reasons not to copy the code. */
3526 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3527 if (inline_forbidden_reason
!= NULL
)
3530 /* Next, walk the statements of the function looking for
3531 constraucts we can't handle, or are non-optimal for inlining. */
3532 hash_set
<tree
> visited_nodes
;
3533 memset (&wi
, 0, sizeof (wi
));
3534 wi
.info
= (void *) fndecl
;
3535 wi
.pset
= &visited_nodes
;
3537 FOR_EACH_BB_FN (bb
, fun
)
3540 gimple_seq seq
= bb_seq (bb
);
3541 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3542 forbidden_p
= (ret
!= NULL
);
3550 /* Return false if the function FNDECL cannot be inlined on account of its
3551 attributes, true otherwise. */
3553 function_attribute_inlinable_p (const_tree fndecl
)
3555 if (targetm
.attribute_table
)
3559 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3561 const_tree name
= TREE_PURPOSE (a
);
3564 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3565 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3566 return targetm
.function_attribute_inlinable_p (fndecl
);
3573 /* Returns nonzero if FN is a function that does not have any
3574 fundamental inline blocking properties. */
3577 tree_inlinable_function_p (tree fn
)
3579 bool inlinable
= true;
3583 /* If we've already decided this function shouldn't be inlined,
3584 there's no need to check again. */
3585 if (DECL_UNINLINABLE (fn
))
3588 /* We only warn for functions declared `inline' by the user. */
3589 do_warning
= (warn_inline
3590 && DECL_DECLARED_INLINE_P (fn
)
3591 && !DECL_NO_INLINE_WARNING_P (fn
)
3592 && !DECL_IN_SYSTEM_HEADER (fn
));
3594 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3597 && always_inline
== NULL
)
3600 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3601 "is suppressed using -fno-inline", fn
);
3605 else if (!function_attribute_inlinable_p (fn
))
3608 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3609 "uses attributes conflicting with inlining", fn
);
3613 else if (inline_forbidden_p (fn
))
3615 /* See if we should warn about uninlinable functions. Previously,
3616 some of these warnings would be issued while trying to expand
3617 the function inline, but that would cause multiple warnings
3618 about functions that would for example call alloca. But since
3619 this a property of the function, just one warning is enough.
3620 As a bonus we can now give more details about the reason why a
3621 function is not inlinable. */
3623 error (inline_forbidden_reason
, fn
);
3624 else if (do_warning
)
3625 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3630 /* Squirrel away the result so that we don't have to check again. */
3631 DECL_UNINLINABLE (fn
) = !inlinable
;
3636 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
3637 word size and take possible memcpy call into account and return
3638 cost based on whether optimizing for size or speed according to SPEED_P. */
3641 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
3645 gcc_assert (!VOID_TYPE_P (type
));
3647 if (TREE_CODE (type
) == VECTOR_TYPE
)
3649 machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3651 = targetm
.vectorize
.preferred_simd_mode (inner
);
3652 int simd_mode_size
= GET_MODE_SIZE (simd
);
3653 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3657 size
= int_size_in_bytes (type
);
3659 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
3660 /* Cost of a memcpy call, 3 arguments and the call. */
3663 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3666 /* Returns cost of operation CODE, according to WEIGHTS */
3669 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3670 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3674 /* These are "free" conversions, or their presumed cost
3675 is folded into other operations. */
3680 case VIEW_CONVERT_EXPR
:
3683 /* Assign cost of 1 to usual operations.
3684 ??? We may consider mapping RTL costs to this. */
3690 case POINTER_PLUS_EXPR
:
3693 case MULT_HIGHPART_EXPR
:
3696 case ADDR_SPACE_CONVERT_EXPR
:
3697 case FIXED_CONVERT_EXPR
:
3698 case FIX_TRUNC_EXPR
:
3710 case VEC_RSHIFT_EXPR
:
3717 case TRUTH_ANDIF_EXPR
:
3718 case TRUTH_ORIF_EXPR
:
3719 case TRUTH_AND_EXPR
:
3721 case TRUTH_XOR_EXPR
:
3722 case TRUTH_NOT_EXPR
:
3731 case UNORDERED_EXPR
:
3742 case PREDECREMENT_EXPR
:
3743 case PREINCREMENT_EXPR
:
3744 case POSTDECREMENT_EXPR
:
3745 case POSTINCREMENT_EXPR
:
3747 case REALIGN_LOAD_EXPR
:
3749 case REDUC_MAX_EXPR
:
3750 case REDUC_MIN_EXPR
:
3751 case REDUC_PLUS_EXPR
:
3752 case WIDEN_SUM_EXPR
:
3753 case WIDEN_MULT_EXPR
:
3756 case WIDEN_MULT_PLUS_EXPR
:
3757 case WIDEN_MULT_MINUS_EXPR
:
3758 case WIDEN_LSHIFT_EXPR
:
3760 case VEC_WIDEN_MULT_HI_EXPR
:
3761 case VEC_WIDEN_MULT_LO_EXPR
:
3762 case VEC_WIDEN_MULT_EVEN_EXPR
:
3763 case VEC_WIDEN_MULT_ODD_EXPR
:
3764 case VEC_UNPACK_HI_EXPR
:
3765 case VEC_UNPACK_LO_EXPR
:
3766 case VEC_UNPACK_FLOAT_HI_EXPR
:
3767 case VEC_UNPACK_FLOAT_LO_EXPR
:
3768 case VEC_PACK_TRUNC_EXPR
:
3769 case VEC_PACK_SAT_EXPR
:
3770 case VEC_PACK_FIX_TRUNC_EXPR
:
3771 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3772 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3776 /* Few special cases of expensive operations. This is useful
3777 to avoid inlining on functions having too many of these. */
3778 case TRUNC_DIV_EXPR
:
3780 case FLOOR_DIV_EXPR
:
3781 case ROUND_DIV_EXPR
:
3782 case EXACT_DIV_EXPR
:
3783 case TRUNC_MOD_EXPR
:
3785 case FLOOR_MOD_EXPR
:
3786 case ROUND_MOD_EXPR
:
3788 if (TREE_CODE (op2
) != INTEGER_CST
)
3789 return weights
->div_mod_cost
;
3793 /* We expect a copy assignment with no operator. */
3794 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3800 /* Estimate number of instructions that will be created by expanding
3801 the statements in the statement sequence STMTS.
3802 WEIGHTS contains weights attributed to various constructs. */
3805 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
3808 gimple_stmt_iterator gsi
;
3811 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3812 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3818 /* Estimate number of instructions that will be created by expanding STMT.
3819 WEIGHTS contains weights attributed to various constructs. */
3822 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
3825 enum gimple_code code
= gimple_code (stmt
);
3832 /* Try to estimate the cost of assignments. We have three cases to
3834 1) Simple assignments to registers;
3835 2) Stores to things that must live in memory. This includes
3836 "normal" stores to scalars, but also assignments of large
3837 structures, or constructors of big arrays;
3839 Let us look at the first two cases, assuming we have "a = b + C":
3840 <GIMPLE_ASSIGN <var_decl "a">
3841 <plus_expr <var_decl "b"> <constant C>>
3842 If "a" is a GIMPLE register, the assignment to it is free on almost
3843 any target, because "a" usually ends up in a real register. Hence
3844 the only cost of this expression comes from the PLUS_EXPR, and we
3845 can ignore the GIMPLE_ASSIGN.
3846 If "a" is not a GIMPLE register, the assignment to "a" will most
3847 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3848 of moving something into "a", which we compute using the function
3849 estimate_move_cost. */
3850 if (gimple_clobber_p (stmt
))
3851 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
3853 lhs
= gimple_assign_lhs (stmt
);
3854 rhs
= gimple_assign_rhs1 (stmt
);
3858 /* Account for the cost of moving to / from memory. */
3859 if (gimple_store_p (stmt
))
3860 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
3861 if (gimple_assign_load_p (stmt
))
3862 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
3864 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3865 gimple_assign_rhs1 (stmt
),
3866 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3867 == GIMPLE_BINARY_RHS
3868 ? gimple_assign_rhs2 (stmt
) : NULL
);
3872 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3873 gimple_op (stmt
, 0),
3874 gimple_op (stmt
, 1));
3878 /* Take into account cost of the switch + guess 2 conditional jumps for
3881 TODO: once the switch expansion logic is sufficiently separated, we can
3882 do better job on estimating cost of the switch. */
3883 if (weights
->time_based
)
3884 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3886 cost
= gimple_switch_num_labels (stmt
) * 2;
3893 if (gimple_call_internal_p (stmt
))
3895 else if ((decl
= gimple_call_fndecl (stmt
))
3896 && DECL_BUILT_IN (decl
))
3898 /* Do not special case builtins where we see the body.
3899 This just confuse inliner. */
3900 struct cgraph_node
*node
;
3901 if (!(node
= cgraph_node::get (decl
))
3902 || node
->definition
)
3904 /* For buitins that are likely expanded to nothing or
3905 inlined do not account operand costs. */
3906 else if (is_simple_builtin (decl
))
3908 else if (is_inexpensive_builtin (decl
))
3909 return weights
->target_builtin_call_cost
;
3910 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3912 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3913 specialize the cheap expansion we do here.
3914 ??? This asks for a more general solution. */
3915 switch (DECL_FUNCTION_CODE (decl
))
3920 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
3921 && REAL_VALUES_EQUAL
3922 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
3923 return estimate_operator_cost
3924 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
3925 gimple_call_arg (stmt
, 0));
3934 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
3935 if (gimple_call_lhs (stmt
))
3936 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
3937 weights
->time_based
);
3938 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3940 tree arg
= gimple_call_arg (stmt
, i
);
3941 cost
+= estimate_move_cost (TREE_TYPE (arg
),
3942 weights
->time_based
);
3948 return weights
->return_cost
;
3954 case GIMPLE_PREDICT
:
3960 int count
= asm_str_count (gimple_asm_string (stmt
));
3961 /* 1000 means infinity. This avoids overflows later
3962 with very long asm statements. */
3969 /* This is either going to be an external function call with one
3970 argument, or two register copy statements plus a goto. */
3973 case GIMPLE_EH_DISPATCH
:
3974 /* ??? This is going to turn into a switch statement. Ideally
3975 we'd have a look at the eh region and estimate the number of
3980 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3982 case GIMPLE_EH_FILTER
:
3983 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3986 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3989 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3990 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3992 /* OpenMP directives are generally very expensive. */
3994 case GIMPLE_OMP_RETURN
:
3995 case GIMPLE_OMP_SECTIONS_SWITCH
:
3996 case GIMPLE_OMP_ATOMIC_STORE
:
3997 case GIMPLE_OMP_CONTINUE
:
3998 /* ...except these, which are cheap. */
4001 case GIMPLE_OMP_ATOMIC_LOAD
:
4002 return weights
->omp_cost
;
4004 case GIMPLE_OMP_FOR
:
4005 return (weights
->omp_cost
4006 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4007 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4009 case GIMPLE_OACC_KERNELS
:
4010 case GIMPLE_OACC_PARALLEL
:
4011 case GIMPLE_OMP_PARALLEL
:
4012 case GIMPLE_OMP_TASK
:
4013 case GIMPLE_OMP_CRITICAL
:
4014 case GIMPLE_OMP_MASTER
:
4015 case GIMPLE_OMP_TASKGROUP
:
4016 case GIMPLE_OMP_ORDERED
:
4017 case GIMPLE_OMP_SECTION
:
4018 case GIMPLE_OMP_SECTIONS
:
4019 case GIMPLE_OMP_SINGLE
:
4020 case GIMPLE_OMP_TARGET
:
4021 case GIMPLE_OMP_TEAMS
:
4022 return (weights
->omp_cost
4023 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4025 case GIMPLE_TRANSACTION
:
4026 return (weights
->tm_cost
4027 + estimate_num_insns_seq (gimple_transaction_body (stmt
),
4037 /* Estimate number of instructions that will be created by expanding
4038 function FNDECL. WEIGHTS contains weights attributed to various
4042 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4044 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4045 gimple_stmt_iterator bsi
;
4049 gcc_assert (my_function
&& my_function
->cfg
);
4050 FOR_EACH_BB_FN (bb
, my_function
)
4052 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4053 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4060 /* Initializes weights used by estimate_num_insns. */
4063 init_inline_once (void)
4065 eni_size_weights
.call_cost
= 1;
4066 eni_size_weights
.indirect_call_cost
= 3;
4067 eni_size_weights
.target_builtin_call_cost
= 1;
4068 eni_size_weights
.div_mod_cost
= 1;
4069 eni_size_weights
.omp_cost
= 40;
4070 eni_size_weights
.tm_cost
= 10;
4071 eni_size_weights
.time_based
= false;
4072 eni_size_weights
.return_cost
= 1;
4074 /* Estimating time for call is difficult, since we have no idea what the
4075 called function does. In the current uses of eni_time_weights,
4076 underestimating the cost does less harm than overestimating it, so
4077 we choose a rather small value here. */
4078 eni_time_weights
.call_cost
= 10;
4079 eni_time_weights
.indirect_call_cost
= 15;
4080 eni_time_weights
.target_builtin_call_cost
= 1;
4081 eni_time_weights
.div_mod_cost
= 10;
4082 eni_time_weights
.omp_cost
= 40;
4083 eni_time_weights
.tm_cost
= 40;
4084 eni_time_weights
.time_based
= true;
4085 eni_time_weights
.return_cost
= 2;
4088 /* Estimate the number of instructions in a gimple_seq. */
4091 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
4093 gimple_stmt_iterator gsi
;
4095 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4096 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4102 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4105 prepend_lexical_block (tree current_block
, tree new_block
)
4107 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4108 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4109 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4112 /* Add local variables from CALLEE to CALLER. */
4115 add_local_variables (struct function
*callee
, struct function
*caller
,
4121 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4122 if (!can_be_nonlocal (var
, id
))
4124 tree new_var
= remap_decl (var
, id
);
4126 /* Remap debug-expressions. */
4127 if (TREE_CODE (new_var
) == VAR_DECL
4128 && DECL_HAS_DEBUG_EXPR_P (var
)
4131 tree tem
= DECL_DEBUG_EXPR (var
);
4132 bool old_regimplify
= id
->regimplify
;
4133 id
->remapping_type_depth
++;
4134 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4135 id
->remapping_type_depth
--;
4136 id
->regimplify
= old_regimplify
;
4137 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4138 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4140 add_local_decl (caller
, new_var
);
4144 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4147 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
4151 hash_map
<tree
, tree
> *dst
;
4152 hash_map
<tree
, tree
> *st
= NULL
;
4155 location_t saved_location
;
4156 struct cgraph_edge
*cg_edge
;
4157 cgraph_inline_failed_t reason
;
4158 basic_block return_block
;
4160 gimple_stmt_iterator gsi
, stmt_gsi
;
4161 bool successfully_inlined
= FALSE
;
4162 bool purge_dead_abnormal_edges
;
4164 /* Set input_location here so we get the right instantiation context
4165 if we call instantiate_decl from inlinable_function_p. */
4166 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
4167 saved_location
= input_location
;
4168 input_location
= gimple_location (stmt
);
4170 /* From here on, we're only interested in CALL_EXPRs. */
4171 if (gimple_code (stmt
) != GIMPLE_CALL
)
4174 cg_edge
= id
->dst_node
->get_edge (stmt
);
4175 gcc_checking_assert (cg_edge
);
4176 /* First, see if we can figure out what function is being called.
4177 If we cannot, then there is no hope of inlining the function. */
4178 if (cg_edge
->indirect_unknown_callee
)
4180 fn
= cg_edge
->callee
->decl
;
4181 gcc_checking_assert (fn
);
4183 /* If FN is a declaration of a function in a nested scope that was
4184 globally declared inline, we don't set its DECL_INITIAL.
4185 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4186 C++ front-end uses it for cdtors to refer to their internal
4187 declarations, that are not real functions. Fortunately those
4188 don't have trees to be saved, so we can tell by checking their
4190 if (!DECL_INITIAL (fn
)
4191 && DECL_ABSTRACT_ORIGIN (fn
)
4192 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4193 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4195 /* Don't try to inline functions that are not well-suited to inlining. */
4196 if (cg_edge
->inline_failed
)
4198 reason
= cg_edge
->inline_failed
;
4199 /* If this call was originally indirect, we do not want to emit any
4200 inlining related warnings or sorry messages because there are no
4201 guarantees regarding those. */
4202 if (cg_edge
->indirect_inlining_edge
)
4205 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4206 /* For extern inline functions that get redefined we always
4207 silently ignored always_inline flag. Better behaviour would
4208 be to be able to keep both bodies and use extern inline body
4209 for inlining, but we can't do that because frontends overwrite
4211 && !cg_edge
->callee
->local
.redefined_extern_inline
4212 /* During early inline pass, report only when optimization is
4214 && (symtab
->global_info_ready
4216 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4217 /* PR 20090218-1_0.c. Body can be provided by another module. */
4218 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4220 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4221 cgraph_inline_failed_string (reason
));
4222 error ("called from here");
4224 else if (warn_inline
4225 && DECL_DECLARED_INLINE_P (fn
)
4226 && !DECL_NO_INLINE_WARNING_P (fn
)
4227 && !DECL_IN_SYSTEM_HEADER (fn
)
4228 && reason
!= CIF_UNSPECIFIED
4229 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4230 /* Do not warn about not inlined recursive calls. */
4231 && !cg_edge
->recursive_p ()
4232 /* Avoid warnings during early inline pass. */
4233 && symtab
->global_info_ready
)
4235 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4236 fn
, _(cgraph_inline_failed_string (reason
)));
4237 warning (OPT_Winline
, "called from here");
4241 fn
= cg_edge
->callee
->decl
;
4242 cg_edge
->callee
->get_body ();
4244 #ifdef ENABLE_CHECKING
4245 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4246 cg_edge
->callee
->verify ();
4249 /* We will be inlining this callee. */
4250 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4252 /* Update the callers EH personality. */
4253 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4254 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4255 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4257 /* Split the block holding the GIMPLE_CALL. */
4258 e
= split_block (bb
, stmt
);
4260 return_block
= e
->dest
;
4263 /* split_block splits after the statement; work around this by
4264 moving the call into the second block manually. Not pretty,
4265 but seems easier than doing the CFG manipulation by hand
4266 when the GIMPLE_CALL is in the last statement of BB. */
4267 stmt_gsi
= gsi_last_bb (bb
);
4268 gsi_remove (&stmt_gsi
, false);
4270 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4271 been the source of abnormal edges. In this case, schedule
4272 the removal of dead abnormal edges. */
4273 gsi
= gsi_start_bb (return_block
);
4274 if (gsi_end_p (gsi
))
4276 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4277 purge_dead_abnormal_edges
= true;
4281 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4282 purge_dead_abnormal_edges
= false;
4285 stmt_gsi
= gsi_start_bb (return_block
);
4287 /* Build a block containing code to initialize the arguments, the
4288 actual inline expansion of the body, and a label for the return
4289 statements within the function to jump to. The type of the
4290 statement expression is the return type of the function call.
4291 ??? If the call does not have an associated block then we will
4292 remap all callee blocks to NULL, effectively dropping most of
4293 its debug information. This should only happen for calls to
4294 artificial decls inserted by the compiler itself. We need to
4295 either link the inlined blocks into the caller block tree or
4296 not refer to them in any way to not break GC for locations. */
4297 if (gimple_block (stmt
))
4299 id
->block
= make_node (BLOCK
);
4300 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4301 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
4302 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4305 /* Local declarations will be replaced by their equivalents in this
4308 id
->decl_map
= new hash_map
<tree
, tree
>;
4309 dst
= id
->debug_map
;
4310 id
->debug_map
= NULL
;
4312 /* Record the function we are about to inline. */
4314 id
->src_node
= cg_edge
->callee
;
4315 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4316 id
->gimple_call
= stmt
;
4318 gcc_assert (!id
->src_cfun
->after_inlining
);
4321 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4323 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4324 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4328 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4330 if (DECL_INITIAL (fn
))
4332 if (gimple_block (stmt
))
4336 prepend_lexical_block (id
->block
,
4337 remap_blocks (DECL_INITIAL (fn
), id
));
4338 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4339 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4341 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4342 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4343 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4344 under it. The parameters can be then evaluated in the debugger,
4345 but don't show in backtraces. */
4346 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4347 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4350 *var
= TREE_CHAIN (v
);
4351 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4352 BLOCK_VARS (id
->block
) = v
;
4355 var
= &TREE_CHAIN (*var
);
4358 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4361 /* Return statements in the function body will be replaced by jumps
4362 to the RET_LABEL. */
4363 gcc_assert (DECL_INITIAL (fn
));
4364 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4366 /* Find the LHS to which the result of this call is assigned. */
4368 if (gimple_call_lhs (stmt
))
4370 modify_dest
= gimple_call_lhs (stmt
);
4372 /* The function which we are inlining might not return a value,
4373 in which case we should issue a warning that the function
4374 does not return a value. In that case the optimizers will
4375 see that the variable to which the value is assigned was not
4376 initialized. We do not want to issue a warning about that
4377 uninitialized variable. */
4378 if (DECL_P (modify_dest
))
4379 TREE_NO_WARNING (modify_dest
) = 1;
4381 if (gimple_call_return_slot_opt_p (stmt
))
4383 return_slot
= modify_dest
;
4390 /* If we are inlining a call to the C++ operator new, we don't want
4391 to use type based alias analysis on the return value. Otherwise
4392 we may get confused if the compiler sees that the inlined new
4393 function returns a pointer which was just deleted. See bug
4395 if (DECL_IS_OPERATOR_NEW (fn
))
4401 /* Declare the return variable for the function. */
4402 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
, bb
);
4404 /* Add local vars in this inlined callee to caller. */
4405 add_local_variables (id
->src_cfun
, cfun
, id
);
4407 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4409 fprintf (dump_file
, "Inlining ");
4410 print_generic_expr (dump_file
, id
->src_fn
, 0);
4411 fprintf (dump_file
, " to ");
4412 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4413 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4416 /* This is it. Duplicate the callee body. Assume callee is
4417 pre-gimplified. Note that we must not alter the caller
4418 function in any way before this point, as this CALL_EXPR may be
4419 a self-referential call; if we're calling ourselves, we need to
4420 duplicate our body before altering anything. */
4421 copy_body (id
, cg_edge
->callee
->count
,
4422 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4423 bb
, return_block
, NULL
);
4425 /* Reset the escaped solution. */
4426 if (cfun
->gimple_df
)
4427 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4432 delete id
->debug_map
;
4433 id
->debug_map
= dst
;
4435 delete id
->decl_map
;
4438 /* Unlink the calls virtual operands before replacing it. */
4439 unlink_stmt_vdef (stmt
);
4440 if (gimple_vdef (stmt
)
4441 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4442 release_ssa_name (gimple_vdef (stmt
));
4444 /* If the inlined function returns a result that we care about,
4445 substitute the GIMPLE_CALL with an assignment of the return
4446 variable to the LHS of the call. That is, if STMT was
4447 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4448 if (use_retvar
&& gimple_call_lhs (stmt
))
4450 gimple old_stmt
= stmt
;
4451 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4452 gsi_replace (&stmt_gsi
, stmt
, false);
4453 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4457 /* Handle the case of inlining a function with no return
4458 statement, which causes the return value to become undefined. */
4459 if (gimple_call_lhs (stmt
)
4460 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4462 tree name
= gimple_call_lhs (stmt
);
4463 tree var
= SSA_NAME_VAR (name
);
4464 tree def
= ssa_default_def (cfun
, var
);
4468 /* If the variable is used undefined, make this name
4469 undefined via a move. */
4470 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4471 gsi_replace (&stmt_gsi
, stmt
, true);
4475 /* Otherwise make this variable undefined. */
4476 gsi_remove (&stmt_gsi
, true);
4477 set_ssa_default_def (cfun
, var
, name
);
4478 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4482 gsi_remove (&stmt_gsi
, true);
4485 if (purge_dead_abnormal_edges
)
4487 gimple_purge_dead_eh_edges (return_block
);
4488 gimple_purge_dead_abnormal_call_edges (return_block
);
4491 /* If the value of the new expression is ignored, that's OK. We
4492 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4493 the equivalent inlined version either. */
4494 if (is_gimple_assign (stmt
))
4496 gcc_assert (gimple_assign_single_p (stmt
)
4497 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4498 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4501 /* Output the inlining info for this abstract function, since it has been
4502 inlined. If we don't do this now, we can lose the information about the
4503 variables in the function when the blocks get blown away as soon as we
4504 remove the cgraph node. */
4505 if (gimple_block (stmt
))
4506 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4508 /* Update callgraph if needed. */
4509 cg_edge
->callee
->remove ();
4511 id
->block
= NULL_TREE
;
4512 successfully_inlined
= TRUE
;
4515 input_location
= saved_location
;
4516 return successfully_inlined
;
4519 /* Expand call statements reachable from STMT_P.
4520 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4521 in a MODIFY_EXPR. */
4524 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4526 gimple_stmt_iterator gsi
;
4528 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4530 gimple stmt
= gsi_stmt (gsi
);
4532 if (is_gimple_call (stmt
)
4533 && !gimple_call_internal_p (stmt
)
4534 && expand_call_inline (bb
, stmt
, id
))
4542 /* Walk all basic blocks created after FIRST and try to fold every statement
4543 in the STATEMENTS pointer set. */
4546 fold_marked_statements (int first
, hash_set
<gimple
> *statements
)
4548 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4549 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4551 gimple_stmt_iterator gsi
;
4553 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4556 if (statements
->contains (gsi_stmt (gsi
)))
4558 gimple old_stmt
= gsi_stmt (gsi
);
4559 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4561 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4563 /* Folding builtins can create multiple instructions,
4564 we need to look at all of them. */
4565 gimple_stmt_iterator i2
= gsi
;
4567 if (fold_stmt (&gsi
))
4570 /* If a builtin at the end of a bb folded into nothing,
4571 the following loop won't work. */
4572 if (gsi_end_p (gsi
))
4574 cgraph_update_edges_for_call_stmt (old_stmt
,
4579 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4584 new_stmt
= gsi_stmt (i2
);
4585 update_stmt (new_stmt
);
4586 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4589 if (new_stmt
== gsi_stmt (gsi
))
4591 /* It is okay to check only for the very last
4592 of these statements. If it is a throwing
4593 statement nothing will change. If it isn't
4594 this can remove EH edges. If that weren't
4595 correct then because some intermediate stmts
4596 throw, but not the last one. That would mean
4597 we'd have to split the block, which we can't
4598 here and we'd loose anyway. And as builtins
4599 probably never throw, this all
4601 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4603 gimple_purge_dead_eh_edges (
4604 BASIC_BLOCK_FOR_FN (cfun
, first
));
4611 else if (fold_stmt (&gsi
))
4613 /* Re-read the statement from GSI as fold_stmt() may
4615 gimple new_stmt
= gsi_stmt (gsi
);
4616 update_stmt (new_stmt
);
4618 if (is_gimple_call (old_stmt
)
4619 || is_gimple_call (new_stmt
))
4620 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4623 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4624 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
4631 /* Expand calls to inline functions in the body of FN. */
4634 optimize_inline_calls (tree fn
)
4638 int last
= n_basic_blocks_for_fn (cfun
);
4639 bool inlined_p
= false;
4642 memset (&id
, 0, sizeof (id
));
4644 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
4645 gcc_assert (id
.dst_node
->definition
);
4647 /* Or any functions that aren't finished yet. */
4648 if (current_function_decl
)
4649 id
.dst_fn
= current_function_decl
;
4651 id
.copy_decl
= copy_decl_maybe_to_var
;
4652 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4653 id
.transform_new_cfg
= false;
4654 id
.transform_return_to_modify
= true;
4655 id
.transform_parameter
= true;
4656 id
.transform_lang_insert_block
= NULL
;
4657 id
.statements_to_fold
= new hash_set
<gimple
>;
4659 push_gimplify_context ();
4661 /* We make no attempts to keep dominance info up-to-date. */
4662 free_dominance_info (CDI_DOMINATORS
);
4663 free_dominance_info (CDI_POST_DOMINATORS
);
4665 /* Register specific gimple functions. */
4666 gimple_register_cfg_hooks ();
4668 /* Reach the trees by walking over the CFG, and note the
4669 enclosing basic-blocks in the call edges. */
4670 /* We walk the blocks going forward, because inlined function bodies
4671 will split id->current_basic_block, and the new blocks will
4672 follow it; we'll trudge through them, processing their CALL_EXPRs
4674 FOR_EACH_BB_FN (bb
, cfun
)
4675 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4677 pop_gimplify_context (NULL
);
4679 #ifdef ENABLE_CHECKING
4681 struct cgraph_edge
*e
;
4683 id
.dst_node
->verify ();
4685 /* Double check that we inlined everything we are supposed to inline. */
4686 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4687 gcc_assert (e
->inline_failed
);
4691 /* Fold queued statements. */
4692 fold_marked_statements (last
, id
.statements_to_fold
);
4693 delete id
.statements_to_fold
;
4695 gcc_assert (!id
.debug_stmts
.exists ());
4697 /* If we didn't inline into the function there is nothing to do. */
4701 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4704 delete_unreachable_blocks_update_callgraph (&id
);
4705 #ifdef ENABLE_CHECKING
4706 id
.dst_node
->verify ();
4709 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4710 not possible yet - the IPA passes might make various functions to not
4711 throw and they don't care to proactively update local EH info. This is
4712 done later in fixup_cfg pass that also execute the verification. */
4713 return (TODO_update_ssa
4715 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4716 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4717 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
4718 ? TODO_rebuild_frequencies
: 0));
4721 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4724 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4726 enum tree_code code
= TREE_CODE (*tp
);
4727 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4729 /* We make copies of most nodes. */
4730 if (IS_EXPR_CODE_CLASS (cl
)
4731 || code
== TREE_LIST
4733 || code
== TYPE_DECL
4734 || code
== OMP_CLAUSE
)
4736 /* Because the chain gets clobbered when we make a copy, we save it
4738 tree chain
= NULL_TREE
, new_tree
;
4740 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4741 chain
= TREE_CHAIN (*tp
);
4743 /* Copy the node. */
4744 new_tree
= copy_node (*tp
);
4748 /* Now, restore the chain, if appropriate. That will cause
4749 walk_tree to walk into the chain as well. */
4750 if (code
== PARM_DECL
4751 || code
== TREE_LIST
4752 || code
== OMP_CLAUSE
)
4753 TREE_CHAIN (*tp
) = chain
;
4755 /* For now, we don't update BLOCKs when we make copies. So, we
4756 have to nullify all BIND_EXPRs. */
4757 if (TREE_CODE (*tp
) == BIND_EXPR
)
4758 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
4760 else if (code
== CONSTRUCTOR
)
4762 /* CONSTRUCTOR nodes need special handling because
4763 we need to duplicate the vector of elements. */
4766 new_tree
= copy_node (*tp
);
4767 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
4770 else if (code
== STATEMENT_LIST
)
4771 /* We used to just abort on STATEMENT_LIST, but we can run into them
4772 with statement-expressions (c++/40975). */
4773 copy_statement_list (tp
);
4774 else if (TREE_CODE_CLASS (code
) == tcc_type
)
4776 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
4778 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
4783 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4784 information indicating to what new SAVE_EXPR this one should be mapped,
4785 use that one. Otherwise, create a new node and enter it in ST. FN is
4786 the function into which the copy will be placed. */
4789 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
4794 /* See if we already encountered this SAVE_EXPR. */
4797 /* If we didn't already remap this SAVE_EXPR, do so now. */
4800 t
= copy_node (*tp
);
4802 /* Remember this SAVE_EXPR. */
4804 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4809 /* We've already walked into this SAVE_EXPR; don't do it again. */
4814 /* Replace this SAVE_EXPR with the copy. */
4818 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4819 label, copies the declaration and enters it in the splay_tree in DATA (which
4820 is really a 'copy_body_data *'. */
4823 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
4824 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4825 struct walk_stmt_info
*wi
)
4827 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4828 gimple stmt
= gsi_stmt (*gsip
);
4830 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4832 tree decl
= gimple_label_label (stmt
);
4834 /* Copy the decl and remember the copy. */
4835 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4842 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4843 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4844 remaps all local declarations to appropriate replacements in gimple
4848 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4850 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4851 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4852 hash_map
<tree
, tree
> *st
= id
->decl_map
;
4856 /* Only a local declaration (variable or label). */
4857 if ((TREE_CODE (expr
) == VAR_DECL
4858 && !TREE_STATIC (expr
))
4859 || TREE_CODE (expr
) == LABEL_DECL
)
4861 /* Lookup the declaration. */
4864 /* If it's there, remap it. */
4869 else if (TREE_CODE (expr
) == STATEMENT_LIST
4870 || TREE_CODE (expr
) == BIND_EXPR
4871 || TREE_CODE (expr
) == SAVE_EXPR
)
4873 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4875 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4876 It's OK for this to happen if it was part of a subtree that
4877 isn't immediately expanded, such as operand 2 of another
4879 if (!TREE_OPERAND (expr
, 1))
4881 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4882 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4886 /* Keep iterating. */
4891 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4892 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4893 remaps all local declarations to appropriate replacements in gimple
4897 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4898 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4899 struct walk_stmt_info
*wi
)
4901 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4902 gimple stmt
= gsi_stmt (*gsip
);
4904 if (gimple_code (stmt
) == GIMPLE_BIND
)
4906 tree block
= gimple_bind_block (stmt
);
4910 remap_block (&block
, id
);
4911 gimple_bind_set_block (stmt
, block
);
4914 /* This will remap a lot of the same decls again, but this should be
4916 if (gimple_bind_vars (stmt
))
4917 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
4921 /* Keep iterating. */
4926 /* Copies everything in SEQ and replaces variables and labels local to
4927 current_function_decl. */
4930 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4933 struct walk_stmt_info wi
;
4936 /* There's nothing to do for NULL_TREE. */
4941 memset (&id
, 0, sizeof (id
));
4942 id
.src_fn
= current_function_decl
;
4943 id
.dst_fn
= current_function_decl
;
4944 id
.decl_map
= new hash_map
<tree
, tree
>;
4945 id
.debug_map
= NULL
;
4947 id
.copy_decl
= copy_decl_no_change
;
4948 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4949 id
.transform_new_cfg
= false;
4950 id
.transform_return_to_modify
= false;
4951 id
.transform_parameter
= false;
4952 id
.transform_lang_insert_block
= NULL
;
4954 /* Walk the tree once to find local labels. */
4955 memset (&wi
, 0, sizeof (wi
));
4956 hash_set
<tree
> visited
;
4959 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4961 copy
= gimple_seq_copy (seq
);
4963 /* Walk the copy, remapping decls. */
4964 memset (&wi
, 0, sizeof (wi
));
4966 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4971 delete id
.debug_map
;
4977 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4980 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4989 debug_find_tree (tree top
, tree search
)
4991 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4995 /* Declare the variables created by the inliner. Add all the variables in
4996 VARS to BIND_EXPR. */
4999 declare_inline_vars (tree block
, tree vars
)
5002 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5004 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5005 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5006 add_local_decl (cfun
, t
);
5010 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5013 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5014 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5015 VAR_DECL translation. */
5018 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5020 /* Don't generate debug information for the copy if we wouldn't have
5021 generated it for the copy either. */
5022 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5023 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5025 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5026 declaration inspired this copy. */
5027 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5029 /* The new variable/label has no RTL, yet. */
5030 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5031 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5032 SET_DECL_RTL (copy
, 0);
5034 /* These args would always appear unused, if not for this. */
5035 TREE_USED (copy
) = 1;
5037 /* Set the context for the new declaration. */
5038 if (!DECL_CONTEXT (decl
))
5039 /* Globals stay global. */
5041 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5042 /* Things that weren't in the scope of the function we're inlining
5043 from aren't in the scope we're inlining to, either. */
5045 else if (TREE_STATIC (decl
))
5046 /* Function-scoped static variables should stay in the original
5050 /* Ordinary automatic local variables are now in the scope of the
5052 DECL_CONTEXT (copy
) = id
->dst_fn
;
5058 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5062 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5063 || TREE_CODE (decl
) == RESULT_DECL
);
5065 type
= TREE_TYPE (decl
);
5067 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5068 VAR_DECL
, DECL_NAME (decl
), type
);
5069 if (DECL_PT_UID_SET_P (decl
))
5070 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5071 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5072 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5073 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5074 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5076 return copy_decl_for_dup_finish (id
, decl
, copy
);
5079 /* Like copy_decl_to_var, but create a return slot object instead of a
5080 pointer variable for return by invisible reference. */
5083 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5087 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5088 || TREE_CODE (decl
) == RESULT_DECL
);
5090 type
= TREE_TYPE (decl
);
5091 if (DECL_BY_REFERENCE (decl
))
5092 type
= TREE_TYPE (type
);
5094 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5095 VAR_DECL
, DECL_NAME (decl
), type
);
5096 if (DECL_PT_UID_SET_P (decl
))
5097 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5098 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5099 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5100 if (!DECL_BY_REFERENCE (decl
))
5102 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5103 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5106 return copy_decl_for_dup_finish (id
, decl
, copy
);
5110 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5114 copy
= copy_node (decl
);
5116 /* The COPY is not abstract; it will be generated in DST_FN. */
5117 DECL_ABSTRACT_P (copy
) = false;
5118 lang_hooks
.dup_lang_specific_decl (copy
);
5120 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5121 been taken; it's for internal bookkeeping in expand_goto_internal. */
5122 if (TREE_CODE (copy
) == LABEL_DECL
)
5124 TREE_ADDRESSABLE (copy
) = 0;
5125 LABEL_DECL_UID (copy
) = -1;
5128 return copy_decl_for_dup_finish (id
, decl
, copy
);
5132 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5134 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5135 return copy_decl_to_var (decl
, id
);
5137 return copy_decl_no_change (decl
, id
);
5140 /* Return a copy of the function's argument tree. */
5142 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5143 bitmap args_to_skip
, tree
*vars
)
5146 tree new_parm
= NULL
;
5151 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5152 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5154 tree new_tree
= remap_decl (arg
, id
);
5155 if (TREE_CODE (new_tree
) != PARM_DECL
)
5156 new_tree
= id
->copy_decl (arg
, id
);
5157 lang_hooks
.dup_lang_specific_decl (new_tree
);
5159 parg
= &DECL_CHAIN (new_tree
);
5161 else if (!id
->decl_map
->get (arg
))
5163 /* Make an equivalent VAR_DECL. If the argument was used
5164 as temporary variable later in function, the uses will be
5165 replaced by local variable. */
5166 tree var
= copy_decl_to_var (arg
, id
);
5167 insert_decl_map (id
, arg
, var
);
5168 /* Declare this new variable. */
5169 DECL_CHAIN (var
) = *vars
;
5175 /* Return a copy of the function's static chain. */
5177 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5179 tree
*chain_copy
, *pvar
;
5181 chain_copy
= &static_chain
;
5182 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5184 tree new_tree
= remap_decl (*pvar
, id
);
5185 lang_hooks
.dup_lang_specific_decl (new_tree
);
5186 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5189 return static_chain
;
5192 /* Return true if the function is allowed to be versioned.
5193 This is a guard for the versioning functionality. */
5196 tree_versionable_function_p (tree fndecl
)
5198 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5199 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
5202 /* Delete all unreachable basic blocks and update callgraph.
5203 Doing so is somewhat nontrivial because we need to update all clones and
5204 remove inline function that become unreachable. */
5207 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5209 bool changed
= false;
5210 basic_block b
, next_bb
;
5212 find_unreachable_blocks ();
5214 /* Delete all unreachable basic blocks. */
5216 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5217 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5219 next_bb
= b
->next_bb
;
5221 if (!(b
->flags
& BB_REACHABLE
))
5223 gimple_stmt_iterator bsi
;
5225 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5227 struct cgraph_edge
*e
;
5228 struct cgraph_node
*node
;
5230 id
->dst_node
->remove_stmt_references (gsi_stmt (bsi
));
5232 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5233 &&(e
= id
->dst_node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5235 if (!e
->inline_failed
)
5236 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5240 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5241 && id
->dst_node
->clones
)
5242 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5244 node
->remove_stmt_references (gsi_stmt (bsi
));
5245 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5246 && (e
= node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5248 if (!e
->inline_failed
)
5249 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5255 node
= node
->clones
;
5256 else if (node
->next_sibling_clone
)
5257 node
= node
->next_sibling_clone
;
5260 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5261 node
= node
->clone_of
;
5262 if (node
!= id
->dst_node
)
5263 node
= node
->next_sibling_clone
;
5267 delete_basic_block (b
);
5275 /* Update clone info after duplication. */
5278 update_clone_info (copy_body_data
* id
)
5280 struct cgraph_node
*node
;
5281 if (!id
->dst_node
->clones
)
5283 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5285 /* First update replace maps to match the new body. */
5286 if (node
->clone
.tree_map
)
5289 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5291 struct ipa_replace_map
*replace_info
;
5292 replace_info
= (*node
->clone
.tree_map
)[i
];
5293 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5294 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5298 node
= node
->clones
;
5299 else if (node
->next_sibling_clone
)
5300 node
= node
->next_sibling_clone
;
5303 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5304 node
= node
->clone_of
;
5305 if (node
!= id
->dst_node
)
5306 node
= node
->next_sibling_clone
;
5311 /* Create a copy of a function's tree.
5312 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5313 of the original function and the new copied function
5314 respectively. In case we want to replace a DECL
5315 tree with another tree while duplicating the function's
5316 body, TREE_MAP represents the mapping between these
5317 trees. If UPDATE_CLONES is set, the call_stmt fields
5318 of edges of clones of the function will be updated.
5320 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5322 If SKIP_RETURN is true, the new version will return void.
5323 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5324 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5327 tree_function_versioning (tree old_decl
, tree new_decl
,
5328 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
5329 bool update_clones
, bitmap args_to_skip
,
5330 bool skip_return
, bitmap blocks_to_copy
,
5331 basic_block new_entry
)
5333 struct cgraph_node
*old_version_node
;
5334 struct cgraph_node
*new_version_node
;
5338 struct ipa_replace_map
*replace_info
;
5339 basic_block old_entry_block
, bb
;
5340 auto_vec
<gimple
, 10> init_stmts
;
5341 tree vars
= NULL_TREE
;
5343 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5344 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5345 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5347 old_version_node
= cgraph_node::get (old_decl
);
5348 gcc_checking_assert (old_version_node
);
5349 new_version_node
= cgraph_node::get (new_decl
);
5350 gcc_checking_assert (new_version_node
);
5352 /* Copy over debug args. */
5353 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5355 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5356 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5357 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5358 old_debug_args
= decl_debug_args_lookup (old_decl
);
5361 new_debug_args
= decl_debug_args_insert (new_decl
);
5362 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5366 /* Output the inlining info for this abstract function, since it has been
5367 inlined. If we don't do this now, we can lose the information about the
5368 variables in the function when the blocks get blown away as soon as we
5369 remove the cgraph node. */
5370 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5372 DECL_ARTIFICIAL (new_decl
) = 1;
5373 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5374 if (DECL_ORIGIN (old_decl
) == old_decl
)
5375 old_version_node
->used_as_abstract_origin
= true;
5376 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5378 /* Prepare the data structures for the tree copy. */
5379 memset (&id
, 0, sizeof (id
));
5381 /* Generate a new name for the new version. */
5382 id
.statements_to_fold
= new hash_set
<gimple
>;
5384 id
.decl_map
= new hash_map
<tree
, tree
>;
5385 id
.debug_map
= NULL
;
5386 id
.src_fn
= old_decl
;
5387 id
.dst_fn
= new_decl
;
5388 id
.src_node
= old_version_node
;
5389 id
.dst_node
= new_version_node
;
5390 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5391 id
.blocks_to_copy
= blocks_to_copy
;
5393 id
.copy_decl
= copy_decl_no_change
;
5394 id
.transform_call_graph_edges
5395 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5396 id
.transform_new_cfg
= true;
5397 id
.transform_return_to_modify
= false;
5398 id
.transform_parameter
= false;
5399 id
.transform_lang_insert_block
= NULL
;
5401 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5402 (DECL_STRUCT_FUNCTION (old_decl
));
5403 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5404 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5405 initialize_cfun (new_decl
, old_decl
,
5406 old_entry_block
->count
);
5407 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
5408 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5409 = id
.src_cfun
->gimple_df
->ipa_pta
;
5411 /* Copy the function's static chain. */
5412 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5414 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5415 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5418 /* If there's a tree_map, prepare for substitution. */
5420 for (i
= 0; i
< tree_map
->length (); i
++)
5423 replace_info
= (*tree_map
)[i
];
5424 if (replace_info
->replace_p
)
5426 if (!replace_info
->old_tree
)
5428 int i
= replace_info
->parm_num
;
5432 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5434 replace_info
->old_tree
= parm
;
5435 req_type
= TREE_TYPE (parm
);
5436 if (!useless_type_conversion_p (req_type
, TREE_TYPE (replace_info
->new_tree
)))
5438 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5439 replace_info
->new_tree
= fold_build1 (NOP_EXPR
, req_type
, replace_info
->new_tree
);
5440 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (TREE_TYPE (replace_info
->new_tree
)))
5441 replace_info
->new_tree
= fold_build1 (VIEW_CONVERT_EXPR
, req_type
, replace_info
->new_tree
);
5446 fprintf (dump_file
, " const ");
5447 print_generic_expr (dump_file
, replace_info
->new_tree
, 0);
5448 fprintf (dump_file
, " can't be converted to param ");
5449 print_generic_expr (dump_file
, parm
, 0);
5450 fprintf (dump_file
, "\n");
5452 replace_info
->old_tree
= NULL
;
5457 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5458 if (replace_info
->old_tree
)
5460 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5461 replace_info
->new_tree
, id
.src_fn
,
5465 init_stmts
.safe_push (init
);
5469 /* Copy the function's arguments. */
5470 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5471 DECL_ARGUMENTS (new_decl
) =
5472 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5473 args_to_skip
, &vars
);
5475 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5476 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5478 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5480 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5481 /* Add local vars. */
5482 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5484 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5486 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5488 DECL_RESULT (new_decl
)
5489 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5490 RESULT_DECL
, NULL_TREE
, void_type_node
);
5491 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5492 cfun
->returns_struct
= 0;
5493 cfun
->returns_pcc_struct
= 0;
5498 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5499 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5500 if (gimple_in_ssa_p (id
.src_cfun
)
5501 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5502 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5504 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
), NULL
);
5505 insert_decl_map (&id
, old_name
, new_name
);
5506 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5507 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5511 /* Set up the destination functions loop tree. */
5512 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5514 cfun
->curr_properties
&= ~PROP_loops
;
5515 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5516 cfun
->curr_properties
|= PROP_loops
;
5519 /* Copy the Function's body. */
5520 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5521 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
5524 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5525 number_blocks (new_decl
);
5527 /* We want to create the BB unconditionally, so that the addition of
5528 debug stmts doesn't affect BB count, which may in the end cause
5529 codegen differences. */
5530 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5531 while (init_stmts
.length ())
5532 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5533 update_clone_info (&id
);
5535 /* Remap the nonlocal_goto_save_area, if any. */
5536 if (cfun
->nonlocal_goto_save_area
)
5538 struct walk_stmt_info wi
;
5540 memset (&wi
, 0, sizeof (wi
));
5542 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5548 delete id
.debug_map
;
5549 free_dominance_info (CDI_DOMINATORS
);
5550 free_dominance_info (CDI_POST_DOMINATORS
);
5552 fold_marked_statements (0, id
.statements_to_fold
);
5553 delete id
.statements_to_fold
;
5554 fold_cond_expr_cond ();
5555 delete_unreachable_blocks_update_callgraph (&id
);
5556 if (id
.dst_node
->definition
)
5557 cgraph_edge::rebuild_references ();
5558 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
5560 calculate_dominance_info (CDI_DOMINATORS
);
5561 fix_loop_structure (NULL
);
5563 update_ssa (TODO_update_ssa
);
5565 /* After partial cloning we need to rescale frequencies, so they are
5566 within proper range in the cloned function. */
5569 struct cgraph_edge
*e
;
5570 rebuild_frequencies ();
5572 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5573 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5575 basic_block bb
= gimple_bb (e
->call_stmt
);
5576 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5578 e
->count
= bb
->count
;
5580 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5582 basic_block bb
= gimple_bb (e
->call_stmt
);
5583 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5585 e
->count
= bb
->count
;
5589 free_dominance_info (CDI_DOMINATORS
);
5590 free_dominance_info (CDI_POST_DOMINATORS
);
5592 gcc_assert (!id
.debug_stmts
.exists ());
5597 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5598 the callee and return the inlined body on success. */
5601 maybe_inline_call_in_expr (tree exp
)
5603 tree fn
= get_callee_fndecl (exp
);
5605 /* We can only try to inline "const" functions. */
5606 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5608 call_expr_arg_iterator iter
;
5611 hash_map
<tree
, tree
> decl_map
;
5613 /* Remap the parameters. */
5614 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5616 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5617 decl_map
.put (param
, arg
);
5619 memset (&id
, 0, sizeof (id
));
5621 id
.dst_fn
= current_function_decl
;
5622 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5623 id
.decl_map
= &decl_map
;
5625 id
.copy_decl
= copy_decl_no_change
;
5626 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5627 id
.transform_new_cfg
= false;
5628 id
.transform_return_to_modify
= true;
5629 id
.transform_parameter
= true;
5630 id
.transform_lang_insert_block
= NULL
;
5632 /* Make sure not to unshare trees behind the front-end's back
5633 since front-end specific mechanisms may rely on sharing. */
5634 id
.regimplify
= false;
5635 id
.do_not_unshare
= true;
5637 /* We're not inside any EH region. */
5640 t
= copy_tree_body (&id
);
5642 /* We can only return something suitable for use in a GENERIC
5644 if (TREE_CODE (t
) == MODIFY_EXPR
)
5645 return TREE_OPERAND (t
, 1);
5651 /* Duplicate a type, fields and all. */
5654 build_duplicate_type (tree type
)
5656 struct copy_body_data id
;
5658 memset (&id
, 0, sizeof (id
));
5659 id
.src_fn
= current_function_decl
;
5660 id
.dst_fn
= current_function_decl
;
5662 id
.decl_map
= new hash_map
<tree
, tree
>;
5663 id
.debug_map
= NULL
;
5664 id
.copy_decl
= copy_decl_no_change
;
5666 type
= remap_type_1 (type
, &id
);
5670 delete id
.debug_map
;
5672 TYPE_CANONICAL (type
) = type
;