2 Copyright (C) 2001-2015 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"
29 #include "double-int.h"
36 #include "fold-const.h"
37 #include "stor-layout.h"
39 #include "tree-inline.h"
43 #include "insn-config.h"
45 #include "langhooks.h"
50 #include "hard-reg-set.h"
52 #include "dominance.h"
55 #include "basic-block.h"
56 #include "tree-iterator.h"
58 #include "tree-ssa-alias.h"
59 #include "internal-fn.h"
60 #include "gimple-fold.h"
62 #include "gimple-expr.h"
66 #include "gimple-iterator.h"
67 #include "gimplify-me.h"
68 #include "gimple-walk.h"
69 #include "gimple-ssa.h"
71 #include "tree-phinodes.h"
72 #include "ssa-iterators.h"
73 #include "stringpool.h"
74 #include "tree-ssanames.h"
75 #include "tree-into-ssa.h"
79 #include "tree-pretty-print.h"
83 #include "plugin-api.h"
86 #include "alloc-pool.h"
87 #include "symbol-summary.h"
89 #include "value-prof.h"
90 #include "tree-pass.h"
94 #include "tree-chkp.h"
96 #include "rtl.h" /* FIXME: For asm_str_count. */
98 /* I'm not real happy about this, but we need to handle gimple and
101 /* Inlining, Cloning, Versioning, Parallelization
103 Inlining: a function body is duplicated, but the PARM_DECLs are
104 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
105 MODIFY_EXPRs that store to a dedicated returned-value variable.
106 The duplicated eh_region info of the copy will later be appended
107 to the info for the caller; the eh_region info in copied throwing
108 statements and RESX statements are adjusted accordingly.
110 Cloning: (only in C++) We have one body for a con/de/structor, and
111 multiple function decls, each with a unique parameter list.
112 Duplicate the body, using the given splay tree; some parameters
113 will become constants (like 0 or 1).
115 Versioning: a function body is duplicated and the result is a new
116 function rather than into blocks of an existing function as with
117 inlining. Some parameters will become constants.
119 Parallelization: a region of a function is duplicated resulting in
120 a new function. Variables may be replaced with complex expressions
121 to enable shared variable semantics.
123 All of these will simultaneously lookup any callgraph edges. If
124 we're going to inline the duplicated function body, and the given
125 function has some cloned callgraph nodes (one for each place this
126 function will be inlined) those callgraph edges will be duplicated.
127 If we're cloning the body, those callgraph edges will be
128 updated to point into the new body. (Note that the original
129 callgraph node and edge list will not be altered.)
131 See the CALL_EXPR handling case in copy_tree_body_r (). */
135 o In order to make inlining-on-trees work, we pessimized
136 function-local static constants. In particular, they are now
137 always output, even when not addressed. Fix this by treating
138 function-local static constants just like global static
139 constants; the back-end already knows not to output them if they
142 o Provide heuristics to clamp inlining of recursive template
146 /* Weights that estimate_num_insns uses to estimate the size of the
149 eni_weights eni_size_weights
;
151 /* Weights that estimate_num_insns uses to estimate the time necessary
152 to execute the produced code. */
154 eni_weights eni_time_weights
;
158 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, tree
,
160 static void remap_block (tree
*, copy_body_data
*);
161 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
162 static void declare_inline_vars (tree
, tree
);
163 static void remap_save_expr (tree
*, hash_map
<tree
, tree
> *, int *);
164 static void prepend_lexical_block (tree current_block
, tree new_block
);
165 static tree
copy_decl_to_var (tree
, copy_body_data
*);
166 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
167 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
168 static gimple_seq
remap_gimple_stmt (gimple
, copy_body_data
*);
169 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
170 static void insert_init_stmt (copy_body_data
*, basic_block
, gimple
);
172 /* Insert a tree->tree mapping for ID. Despite the name suggests
173 that the trees should be variables, it is used for more than that. */
176 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
178 id
->decl_map
->put (key
, value
);
180 /* Always insert an identity map as well. If we see this same new
181 node again, we won't want to duplicate it a second time. */
183 id
->decl_map
->put (value
, value
);
186 /* Insert a tree->tree mapping for ID. This is only used for
190 insert_debug_decl_map (copy_body_data
*id
, tree key
, tree value
)
192 if (!gimple_in_ssa_p (id
->src_cfun
))
195 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
198 if (!target_for_debug_bind (key
))
201 gcc_assert (TREE_CODE (key
) == PARM_DECL
);
202 gcc_assert (TREE_CODE (value
) == VAR_DECL
);
205 id
->debug_map
= new hash_map
<tree
, tree
>;
207 id
->debug_map
->put (key
, value
);
210 /* If nonzero, we're remapping the contents of inlined debug
211 statements. If negative, an error has occurred, such as a
212 reference to a variable that isn't available in the inlined
214 static int processing_debug_stmt
= 0;
216 /* Construct new SSA name for old NAME. ID is the inline context. */
219 remap_ssa_name (tree name
, copy_body_data
*id
)
224 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
226 n
= id
->decl_map
->get (name
);
228 return unshare_expr (*n
);
230 if (processing_debug_stmt
)
232 if (SSA_NAME_IS_DEFAULT_DEF (name
)
233 && TREE_CODE (SSA_NAME_VAR (name
)) == PARM_DECL
234 && id
->entry_bb
== NULL
235 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)))
237 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
239 gimple_stmt_iterator gsi
;
240 tree val
= SSA_NAME_VAR (name
);
242 n
= id
->decl_map
->get (val
);
245 if (TREE_CODE (val
) != PARM_DECL
)
247 processing_debug_stmt
= -1;
250 def_temp
= gimple_build_debug_source_bind (vexpr
, val
, NULL
);
251 DECL_ARTIFICIAL (vexpr
) = 1;
252 TREE_TYPE (vexpr
) = TREE_TYPE (name
);
253 DECL_MODE (vexpr
) = DECL_MODE (SSA_NAME_VAR (name
));
254 gsi
= gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
255 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
259 processing_debug_stmt
= -1;
263 /* Remap anonymous SSA names or SSA names of anonymous decls. */
264 var
= SSA_NAME_VAR (name
);
266 || (!SSA_NAME_IS_DEFAULT_DEF (name
)
267 && TREE_CODE (var
) == VAR_DECL
268 && !VAR_DECL_IS_VIRTUAL_OPERAND (var
)
269 && DECL_ARTIFICIAL (var
)
270 && DECL_IGNORED_P (var
)
271 && !DECL_NAME (var
)))
273 struct ptr_info_def
*pi
;
274 new_tree
= make_ssa_name (remap_type (TREE_TYPE (name
), id
));
275 if (!var
&& SSA_NAME_IDENTIFIER (name
))
276 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree
, SSA_NAME_IDENTIFIER (name
));
277 insert_decl_map (id
, name
, new_tree
);
278 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
279 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
280 /* At least IPA points-to info can be directly transferred. */
281 if (id
->src_cfun
->gimple_df
282 && id
->src_cfun
->gimple_df
->ipa_pta
283 && (pi
= SSA_NAME_PTR_INFO (name
))
286 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
292 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
294 new_tree
= remap_decl (var
, id
);
296 /* We might've substituted constant or another SSA_NAME for
299 Replace the SSA name representing RESULT_DECL by variable during
300 inlining: this saves us from need to introduce PHI node in a case
301 return value is just partly initialized. */
302 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
303 && (!SSA_NAME_VAR (name
)
304 || TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
305 || !id
->transform_return_to_modify
))
307 struct ptr_info_def
*pi
;
308 new_tree
= make_ssa_name (new_tree
);
309 insert_decl_map (id
, name
, new_tree
);
310 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
311 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
312 /* At least IPA points-to info can be directly transferred. */
313 if (id
->src_cfun
->gimple_df
314 && id
->src_cfun
->gimple_df
->ipa_pta
315 && (pi
= SSA_NAME_PTR_INFO (name
))
318 struct ptr_info_def
*new_pi
= get_ptr_info (new_tree
);
321 if (SSA_NAME_IS_DEFAULT_DEF (name
))
323 /* By inlining function having uninitialized variable, we might
324 extend the lifetime (variable might get reused). This cause
325 ICE in the case we end up extending lifetime of SSA name across
326 abnormal edge, but also increase register pressure.
328 We simply initialize all uninitialized vars by 0 except
329 for case we are inlining to very first BB. We can avoid
330 this for all BBs that are not inside strongly connected
331 regions of the CFG, but this is expensive to test. */
333 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
)
334 && (!SSA_NAME_VAR (name
)
335 || TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
)
336 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
338 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
340 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
342 tree zero
= build_zero_cst (TREE_TYPE (new_tree
));
344 init_stmt
= gimple_build_assign (new_tree
, zero
);
345 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
346 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
350 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
351 set_ssa_default_def (cfun
, SSA_NAME_VAR (new_tree
), new_tree
);
356 insert_decl_map (id
, name
, new_tree
);
360 /* Remap DECL during the copying of the BLOCK tree for the function. */
363 remap_decl (tree decl
, copy_body_data
*id
)
367 /* We only remap local variables in the current function. */
369 /* See if we have remapped this declaration. */
371 n
= id
->decl_map
->get (decl
);
373 if (!n
&& processing_debug_stmt
)
375 processing_debug_stmt
= -1;
379 /* If we didn't already have an equivalent for this declaration,
383 /* Make a copy of the variable or label. */
384 tree t
= id
->copy_decl (decl
, id
);
386 /* Remember it, so that if we encounter this local entity again
387 we can reuse this copy. Do this early because remap_type may
388 need this decl for TYPE_STUB_DECL. */
389 insert_decl_map (id
, decl
, t
);
394 /* Remap types, if necessary. */
395 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
396 if (TREE_CODE (t
) == TYPE_DECL
)
397 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
399 /* Remap sizes as necessary. */
400 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
401 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
403 /* If fields, do likewise for offset and qualifier. */
404 if (TREE_CODE (t
) == FIELD_DECL
)
406 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
407 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
408 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
414 if (id
->do_not_unshare
)
417 return unshare_expr (*n
);
421 remap_type_1 (tree type
, copy_body_data
*id
)
425 /* We do need a copy. build and register it now. If this is a pointer or
426 reference type, remap the designated type and make a new pointer or
428 if (TREE_CODE (type
) == POINTER_TYPE
)
430 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
432 TYPE_REF_CAN_ALIAS_ALL (type
));
433 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
434 new_tree
= build_type_attribute_qual_variant (new_tree
,
435 TYPE_ATTRIBUTES (type
),
437 insert_decl_map (id
, type
, new_tree
);
440 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
442 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
444 TYPE_REF_CAN_ALIAS_ALL (type
));
445 if (TYPE_ATTRIBUTES (type
) || TYPE_QUALS (type
))
446 new_tree
= build_type_attribute_qual_variant (new_tree
,
447 TYPE_ATTRIBUTES (type
),
449 insert_decl_map (id
, type
, new_tree
);
453 new_tree
= copy_node (type
);
455 insert_decl_map (id
, type
, new_tree
);
457 /* This is a new type, not a copy of an old type. Need to reassociate
458 variants. We can handle everything except the main variant lazily. */
459 t
= TYPE_MAIN_VARIANT (type
);
462 t
= remap_type (t
, id
);
463 TYPE_MAIN_VARIANT (new_tree
) = t
;
464 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
465 TYPE_NEXT_VARIANT (t
) = new_tree
;
469 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
470 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
473 if (TYPE_STUB_DECL (type
))
474 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
476 /* Lazily create pointer and reference types. */
477 TYPE_POINTER_TO (new_tree
) = NULL
;
478 TYPE_REFERENCE_TO (new_tree
) = NULL
;
480 /* Copy all types that may contain references to local variables; be sure to
481 preserve sharing in between type and its main variant when possible. */
482 switch (TREE_CODE (new_tree
))
486 case FIXED_POINT_TYPE
:
489 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
491 gcc_checking_assert (TYPE_MIN_VALUE (type
) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type
)));
492 gcc_checking_assert (TYPE_MAX_VALUE (type
) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type
)));
494 TYPE_MIN_VALUE (new_tree
) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree
));
495 TYPE_MAX_VALUE (new_tree
) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree
));
499 t
= TYPE_MIN_VALUE (new_tree
);
500 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
501 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
503 t
= TYPE_MAX_VALUE (new_tree
);
504 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
505 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
510 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
511 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
512 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
514 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
515 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
516 && TYPE_ARG_TYPES (type
) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type
)))
517 TYPE_ARG_TYPES (new_tree
) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree
));
519 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
523 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
524 && TREE_TYPE (type
) == TREE_TYPE (TYPE_MAIN_VARIANT (type
)))
525 TREE_TYPE (new_tree
) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree
));
527 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
529 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
531 gcc_checking_assert (TYPE_DOMAIN (type
) == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)));
532 TYPE_DOMAIN (new_tree
) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree
));
535 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
540 case QUAL_UNION_TYPE
:
541 if (TYPE_MAIN_VARIANT (type
) != type
542 && TYPE_FIELDS (type
) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type
)))
543 TYPE_FIELDS (new_tree
) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree
));
548 for (f
= TYPE_FIELDS (new_tree
); f
; f
= DECL_CHAIN (f
))
550 t
= remap_decl (f
, id
);
551 DECL_CONTEXT (t
) = new_tree
;
555 TYPE_FIELDS (new_tree
) = nreverse (nf
);
561 /* Shouldn't have been thought variable sized. */
565 /* All variants of type share the same size, so use the already remaped data. */
566 if (TYPE_MAIN_VARIANT (new_tree
) != new_tree
)
568 gcc_checking_assert (TYPE_SIZE (type
) == TYPE_SIZE (TYPE_MAIN_VARIANT (type
)));
569 gcc_checking_assert (TYPE_SIZE_UNIT (type
) == TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type
)));
571 TYPE_SIZE (new_tree
) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree
));
572 TYPE_SIZE_UNIT (new_tree
) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree
));
576 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
577 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
584 remap_type (tree type
, copy_body_data
*id
)
592 /* See if we have remapped this type. */
593 node
= id
->decl_map
->get (type
);
597 /* The type only needs remapping if it's variably modified. */
598 if (! variably_modified_type_p (type
, id
->src_fn
))
600 insert_decl_map (id
, type
, type
);
604 id
->remapping_type_depth
++;
605 tmp
= remap_type_1 (type
, id
);
606 id
->remapping_type_depth
--;
611 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
614 can_be_nonlocal (tree decl
, copy_body_data
*id
)
616 /* We can not duplicate function decls. */
617 if (TREE_CODE (decl
) == FUNCTION_DECL
)
620 /* Local static vars must be non-local or we get multiple declaration
622 if (TREE_CODE (decl
) == VAR_DECL
623 && !auto_var_in_fn_p (decl
, id
->src_fn
))
630 remap_decls (tree decls
, vec
<tree
, va_gc
> **nonlocalized_list
,
634 tree new_decls
= NULL_TREE
;
636 /* Remap its variables. */
637 for (old_var
= decls
; old_var
; old_var
= DECL_CHAIN (old_var
))
641 if (can_be_nonlocal (old_var
, id
))
643 /* We need to add this variable to the local decls as otherwise
644 nothing else will do so. */
645 if (TREE_CODE (old_var
) == VAR_DECL
646 && ! DECL_EXTERNAL (old_var
))
647 add_local_decl (cfun
, old_var
);
648 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
649 && !DECL_IGNORED_P (old_var
)
650 && nonlocalized_list
)
651 vec_safe_push (*nonlocalized_list
, old_var
);
655 /* Remap the variable. */
656 new_var
= remap_decl (old_var
, id
);
658 /* If we didn't remap this variable, we can't mess with its
659 TREE_CHAIN. If we remapped this variable to the return slot, it's
660 already declared somewhere else, so don't declare it here. */
662 if (new_var
== id
->retvar
)
666 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
667 && !DECL_IGNORED_P (old_var
)
668 && nonlocalized_list
)
669 vec_safe_push (*nonlocalized_list
, old_var
);
673 gcc_assert (DECL_P (new_var
));
674 DECL_CHAIN (new_var
) = new_decls
;
677 /* Also copy value-expressions. */
678 if (TREE_CODE (new_var
) == VAR_DECL
679 && DECL_HAS_VALUE_EXPR_P (new_var
))
681 tree tem
= DECL_VALUE_EXPR (new_var
);
682 bool old_regimplify
= id
->regimplify
;
683 id
->remapping_type_depth
++;
684 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
685 id
->remapping_type_depth
--;
686 id
->regimplify
= old_regimplify
;
687 SET_DECL_VALUE_EXPR (new_var
, tem
);
692 return nreverse (new_decls
);
695 /* Copy the BLOCK to contain remapped versions of the variables
696 therein. And hook the new block into the block-tree. */
699 remap_block (tree
*block
, copy_body_data
*id
)
704 /* Make the new block. */
706 new_block
= make_node (BLOCK
);
707 TREE_USED (new_block
) = TREE_USED (old_block
);
708 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
709 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
710 BLOCK_NONLOCALIZED_VARS (new_block
)
711 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block
));
714 /* Remap its variables. */
715 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
716 &BLOCK_NONLOCALIZED_VARS (new_block
),
719 if (id
->transform_lang_insert_block
)
720 id
->transform_lang_insert_block (new_block
);
722 /* Remember the remapped block. */
723 insert_decl_map (id
, old_block
, new_block
);
726 /* Copy the whole block tree and root it in id->block. */
728 remap_blocks (tree block
, copy_body_data
*id
)
731 tree new_tree
= block
;
736 remap_block (&new_tree
, id
);
737 gcc_assert (new_tree
!= block
);
738 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
739 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
740 /* Blocks are in arbitrary order, but make things slightly prettier and do
741 not swap order when producing a copy. */
742 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
746 /* Remap the block tree rooted at BLOCK to nothing. */
748 remap_blocks_to_null (tree block
, copy_body_data
*id
)
751 insert_decl_map (id
, block
, NULL_TREE
);
752 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
753 remap_blocks_to_null (t
, id
);
757 copy_statement_list (tree
*tp
)
759 tree_stmt_iterator oi
, ni
;
762 new_tree
= alloc_stmt_list ();
763 ni
= tsi_start (new_tree
);
764 oi
= tsi_start (*tp
);
765 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
768 for (; !tsi_end_p (oi
); tsi_next (&oi
))
770 tree stmt
= tsi_stmt (oi
);
771 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
772 /* This copy is not redundant; tsi_link_after will smash this
773 STATEMENT_LIST into the end of the one we're building, and we
774 don't want to do that with the original. */
775 copy_statement_list (&stmt
);
776 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
781 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
783 tree block
= BIND_EXPR_BLOCK (*tp
);
784 /* Copy (and replace) the statement. */
785 copy_tree_r (tp
, walk_subtrees
, NULL
);
788 remap_block (&block
, id
);
789 BIND_EXPR_BLOCK (*tp
) = block
;
792 if (BIND_EXPR_VARS (*tp
))
793 /* This will remap a lot of the same decls again, but this should be
795 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
799 /* Create a new gimple_seq by remapping all the statements in BODY
800 using the inlining information in ID. */
803 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
805 gimple_stmt_iterator si
;
806 gimple_seq new_body
= NULL
;
808 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
810 gimple_seq new_stmts
= remap_gimple_stmt (gsi_stmt (si
), id
);
811 gimple_seq_add_seq (&new_body
, new_stmts
);
818 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
819 block using the mapping information in ID. */
822 copy_gimple_bind (gbind
*stmt
, copy_body_data
*id
)
825 tree new_block
, new_vars
;
826 gimple_seq body
, new_body
;
828 /* Copy the statement. Note that we purposely don't use copy_stmt
829 here because we need to remap statements as we copy. */
830 body
= gimple_bind_body (stmt
);
831 new_body
= remap_gimple_seq (body
, id
);
833 new_block
= gimple_bind_block (stmt
);
835 remap_block (&new_block
, id
);
837 /* This will remap a lot of the same decls again, but this should be
839 new_vars
= gimple_bind_vars (stmt
);
841 new_vars
= remap_decls (new_vars
, NULL
, id
);
843 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
848 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
853 if (TREE_CODE (decl
) == SSA_NAME
)
855 decl
= SSA_NAME_VAR (decl
);
860 return (TREE_CODE (decl
) == PARM_DECL
);
863 /* Remap the dependence CLIQUE from the source to the destination function
864 as specified in ID. */
866 static unsigned short
867 remap_dependence_clique (copy_body_data
*id
, unsigned short clique
)
871 if (!id
->dependence_map
)
873 = new hash_map
<unsigned short, unsigned short, dependence_hasher
>;
875 unsigned short &newc
= id
->dependence_map
->get_or_insert (clique
, &existed
);
877 newc
= ++cfun
->last_clique
;
881 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
882 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
883 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
884 recursing into the children nodes of *TP. */
887 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
889 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
890 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
891 tree fn
= id
->src_fn
;
893 if (TREE_CODE (*tp
) == SSA_NAME
)
895 *tp
= remap_ssa_name (*tp
, id
);
899 else if (auto_var_in_fn_p (*tp
, fn
))
901 /* Local variables and labels need to be replaced by equivalent
902 variables. We don't want to copy static variables; there's
903 only one of those, no matter how many times we inline the
904 containing function. Similarly for globals from an outer
908 /* Remap the declaration. */
909 new_decl
= remap_decl (*tp
, id
);
910 gcc_assert (new_decl
);
911 /* Replace this variable with the copy. */
912 STRIP_TYPE_NOPS (new_decl
);
913 /* ??? The C++ frontend uses void * pointer zero to initialize
914 any other type. This confuses the middle-end type verification.
915 As cloned bodies do not go through gimplification again the fixup
916 there doesn't trigger. */
917 if (TREE_CODE (new_decl
) == INTEGER_CST
918 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
919 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
923 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
925 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
927 else if (TREE_CODE (*tp
) == LABEL_DECL
928 && (!DECL_CONTEXT (*tp
)
929 || decl_function_context (*tp
) == id
->src_fn
))
930 /* These may need to be remapped for EH handling. */
931 *tp
= remap_decl (*tp
, id
);
932 else if (TREE_CODE (*tp
) == FIELD_DECL
)
934 /* If the enclosing record type is variably_modified_type_p, the field
935 has already been remapped. Otherwise, it need not be. */
936 tree
*n
= id
->decl_map
->get (*tp
);
941 else if (TYPE_P (*tp
))
942 /* Types may need remapping as well. */
943 *tp
= remap_type (*tp
, id
);
944 else if (CONSTANT_CLASS_P (*tp
))
946 /* If this is a constant, we have to copy the node iff the type
947 will be remapped. copy_tree_r will not copy a constant. */
948 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
950 if (new_type
== TREE_TYPE (*tp
))
953 else if (TREE_CODE (*tp
) == INTEGER_CST
)
954 *tp
= wide_int_to_tree (new_type
, *tp
);
957 *tp
= copy_node (*tp
);
958 TREE_TYPE (*tp
) = new_type
;
963 /* Otherwise, just copy the node. Note that copy_tree_r already
964 knows not to copy VAR_DECLs, etc., so this is safe. */
966 if (TREE_CODE (*tp
) == MEM_REF
)
968 /* We need to re-canonicalize MEM_REFs from inline substitutions
969 that can happen when a pointer argument is an ADDR_EXPR.
970 Recurse here manually to allow that. */
971 tree ptr
= TREE_OPERAND (*tp
, 0);
972 tree type
= remap_type (TREE_TYPE (*tp
), id
);
974 walk_tree (&ptr
, remap_gimple_op_r
, data
, NULL
);
975 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
976 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
977 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
978 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
979 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
981 MR_DEPENDENCE_CLIQUE (*tp
)
982 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
983 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
985 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
986 remapped a parameter as the property might be valid only
987 for the parameter itself. */
988 if (TREE_THIS_NOTRAP (old
)
989 && (!is_parm (TREE_OPERAND (old
, 0))
990 || (!id
->transform_parameter
&& is_parm (ptr
))))
991 TREE_THIS_NOTRAP (*tp
) = 1;
996 /* Here is the "usual case". Copy this tree node, and then
997 tweak some special cases. */
998 copy_tree_r (tp
, walk_subtrees
, NULL
);
1000 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1001 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1003 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1005 /* The copied TARGET_EXPR has never been expanded, even if the
1006 original node was expanded already. */
1007 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1008 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1010 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1012 /* Variable substitution need not be simple. In particular,
1013 the MEM_REF substitution above. Make sure that
1014 TREE_CONSTANT and friends are up-to-date. */
1015 int invariant
= is_gimple_min_invariant (*tp
);
1016 walk_tree (&TREE_OPERAND (*tp
, 0), remap_gimple_op_r
, data
, NULL
);
1017 recompute_tree_invariant_for_addr_expr (*tp
);
1019 /* If this used to be invariant, but is not any longer,
1020 then regimplification is probably needed. */
1021 if (invariant
&& !is_gimple_min_invariant (*tp
))
1022 id
->regimplify
= true;
1028 /* Update the TREE_BLOCK for the cloned expr. */
1031 tree new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1032 tree old_block
= TREE_BLOCK (*tp
);
1036 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1040 TREE_SET_BLOCK (*tp
, new_block
);
1043 /* Keep iterating. */
1048 /* Called from copy_body_id via walk_tree. DATA is really a
1049 `copy_body_data *'. */
1052 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
1054 copy_body_data
*id
= (copy_body_data
*) data
;
1055 tree fn
= id
->src_fn
;
1058 /* Begin by recognizing trees that we'll completely rewrite for the
1059 inlining context. Our output for these trees is completely
1060 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1061 into an edge). Further down, we'll handle trees that get
1062 duplicated and/or tweaked. */
1064 /* When requested, RETURN_EXPRs should be transformed to just the
1065 contained MODIFY_EXPR. The branch semantics of the return will
1066 be handled elsewhere by manipulating the CFG rather than a statement. */
1067 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
1069 tree assignment
= TREE_OPERAND (*tp
, 0);
1071 /* If we're returning something, just turn that into an
1072 assignment into the equivalent of the original RESULT_DECL.
1073 If the "assignment" is just the result decl, the result
1074 decl has already been set (e.g. a recent "foo (&result_decl,
1075 ...)"); just toss the entire RETURN_EXPR. */
1076 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
1078 /* Replace the RETURN_EXPR with (a copy of) the
1079 MODIFY_EXPR hanging underneath. */
1080 *tp
= copy_node (assignment
);
1082 else /* Else the RETURN_EXPR returns no value. */
1085 return (tree
) (void *)1;
1088 else if (TREE_CODE (*tp
) == SSA_NAME
)
1090 *tp
= remap_ssa_name (*tp
, id
);
1095 /* Local variables and labels need to be replaced by equivalent
1096 variables. We don't want to copy static variables; there's only
1097 one of those, no matter how many times we inline the containing
1098 function. Similarly for globals from an outer function. */
1099 else if (auto_var_in_fn_p (*tp
, fn
))
1103 /* Remap the declaration. */
1104 new_decl
= remap_decl (*tp
, id
);
1105 gcc_assert (new_decl
);
1106 /* Replace this variable with the copy. */
1107 STRIP_TYPE_NOPS (new_decl
);
1111 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
1112 copy_statement_list (tp
);
1113 else if (TREE_CODE (*tp
) == SAVE_EXPR
1114 || TREE_CODE (*tp
) == TARGET_EXPR
)
1115 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
1116 else if (TREE_CODE (*tp
) == LABEL_DECL
1117 && (! DECL_CONTEXT (*tp
)
1118 || decl_function_context (*tp
) == id
->src_fn
))
1119 /* These may need to be remapped for EH handling. */
1120 *tp
= remap_decl (*tp
, id
);
1121 else if (TREE_CODE (*tp
) == BIND_EXPR
)
1122 copy_bind_expr (tp
, walk_subtrees
, id
);
1123 /* Types may need remapping as well. */
1124 else if (TYPE_P (*tp
))
1125 *tp
= remap_type (*tp
, id
);
1127 /* If this is a constant, we have to copy the node iff the type will be
1128 remapped. copy_tree_r will not copy a constant. */
1129 else if (CONSTANT_CLASS_P (*tp
))
1131 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
1133 if (new_type
== TREE_TYPE (*tp
))
1136 else if (TREE_CODE (*tp
) == INTEGER_CST
)
1137 *tp
= wide_int_to_tree (new_type
, *tp
);
1140 *tp
= copy_node (*tp
);
1141 TREE_TYPE (*tp
) = new_type
;
1145 /* Otherwise, just copy the node. Note that copy_tree_r already
1146 knows not to copy VAR_DECLs, etc., so this is safe. */
1149 /* Here we handle trees that are not completely rewritten.
1150 First we detect some inlining-induced bogosities for
1152 if (TREE_CODE (*tp
) == MODIFY_EXPR
1153 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
1154 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
1156 /* Some assignments VAR = VAR; don't generate any rtl code
1157 and thus don't count as variable modification. Avoid
1158 keeping bogosities like 0 = 0. */
1159 tree decl
= TREE_OPERAND (*tp
, 0), value
;
1162 n
= id
->decl_map
->get (decl
);
1166 STRIP_TYPE_NOPS (value
);
1167 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1169 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
1170 return copy_tree_body_r (tp
, walk_subtrees
, data
);
1174 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
1176 /* Get rid of *& from inline substitutions that can happen when a
1177 pointer argument is an ADDR_EXPR. */
1178 tree decl
= TREE_OPERAND (*tp
, 0);
1179 tree
*n
= id
->decl_map
->get (decl
);
1182 /* If we happen to get an ADDR_EXPR in n->value, strip
1183 it manually here as we'll eventually get ADDR_EXPRs
1184 which lie about their types pointed to. In this case
1185 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1186 but we absolutely rely on that. As fold_indirect_ref
1187 does other useful transformations, try that first, though. */
1188 tree type
= TREE_TYPE (*tp
);
1189 tree ptr
= id
->do_not_unshare
? *n
: unshare_expr (*n
);
1191 *tp
= gimple_fold_indirect_ref (ptr
);
1194 if (TREE_CODE (ptr
) == ADDR_EXPR
)
1197 = fold_indirect_ref_1 (EXPR_LOCATION (ptr
), type
, ptr
);
1198 /* ??? We should either assert here or build
1199 a VIEW_CONVERT_EXPR instead of blindly leaking
1200 incompatible types to our IL. */
1202 *tp
= TREE_OPERAND (ptr
, 0);
1206 *tp
= build1 (INDIRECT_REF
, type
, ptr
);
1207 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1208 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1209 TREE_READONLY (*tp
) = TREE_READONLY (old
);
1210 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1211 have remapped a parameter as the property might be
1212 valid only for the parameter itself. */
1213 if (TREE_THIS_NOTRAP (old
)
1214 && (!is_parm (TREE_OPERAND (old
, 0))
1215 || (!id
->transform_parameter
&& is_parm (ptr
))))
1216 TREE_THIS_NOTRAP (*tp
) = 1;
1223 else if (TREE_CODE (*tp
) == MEM_REF
)
1225 /* We need to re-canonicalize MEM_REFs from inline substitutions
1226 that can happen when a pointer argument is an ADDR_EXPR.
1227 Recurse here manually to allow that. */
1228 tree ptr
= TREE_OPERAND (*tp
, 0);
1229 tree type
= remap_type (TREE_TYPE (*tp
), id
);
1231 walk_tree (&ptr
, copy_tree_body_r
, data
, NULL
);
1232 *tp
= fold_build2 (MEM_REF
, type
, ptr
, TREE_OPERAND (*tp
, 1));
1233 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1234 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1235 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
1236 if (MR_DEPENDENCE_CLIQUE (old
) != 0)
1238 MR_DEPENDENCE_CLIQUE (*tp
)
1239 = remap_dependence_clique (id
, MR_DEPENDENCE_CLIQUE (old
));
1240 MR_DEPENDENCE_BASE (*tp
) = MR_DEPENDENCE_BASE (old
);
1242 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1243 remapped a parameter as the property might be valid only
1244 for the parameter itself. */
1245 if (TREE_THIS_NOTRAP (old
)
1246 && (!is_parm (TREE_OPERAND (old
, 0))
1247 || (!id
->transform_parameter
&& is_parm (ptr
))))
1248 TREE_THIS_NOTRAP (*tp
) = 1;
1253 /* Here is the "usual case". Copy this tree node, and then
1254 tweak some special cases. */
1255 copy_tree_r (tp
, walk_subtrees
, NULL
);
1257 /* If EXPR has block defined, map it to newly constructed block.
1258 When inlining we want EXPRs without block appear in the block
1259 of function call if we are not remapping a type. */
1262 new_block
= id
->remapping_type_depth
== 0 ? id
->block
: NULL
;
1263 if (TREE_BLOCK (*tp
))
1266 n
= id
->decl_map
->get (TREE_BLOCK (*tp
));
1270 TREE_SET_BLOCK (*tp
, new_block
);
1273 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1274 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1276 /* The copied TARGET_EXPR has never been expanded, even if the
1277 original node was expanded already. */
1278 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1280 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1281 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1284 /* Variable substitution need not be simple. In particular, the
1285 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1286 and friends are up-to-date. */
1287 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1289 int invariant
= is_gimple_min_invariant (*tp
);
1290 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1292 /* Handle the case where we substituted an INDIRECT_REF
1293 into the operand of the ADDR_EXPR. */
1294 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1295 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1297 recompute_tree_invariant_for_addr_expr (*tp
);
1299 /* If this used to be invariant, but is not any longer,
1300 then regimplification is probably needed. */
1301 if (invariant
&& !is_gimple_min_invariant (*tp
))
1302 id
->regimplify
= true;
1308 /* Keep iterating. */
1312 /* Helper for remap_gimple_stmt. Given an EH region number for the
1313 source function, map that to the duplicate EH region number in
1314 the destination function. */
1317 remap_eh_region_nr (int old_nr
, copy_body_data
*id
)
1319 eh_region old_r
, new_r
;
1321 old_r
= get_eh_region_from_number_fn (id
->src_cfun
, old_nr
);
1322 new_r
= static_cast<eh_region
> (*id
->eh_map
->get (old_r
));
1324 return new_r
->index
;
1327 /* Similar, but operate on INTEGER_CSTs. */
1330 remap_eh_region_tree_nr (tree old_t_nr
, copy_body_data
*id
)
1334 old_nr
= tree_to_shwi (old_t_nr
);
1335 new_nr
= remap_eh_region_nr (old_nr
, id
);
1337 return build_int_cst (integer_type_node
, new_nr
);
1340 /* Helper for copy_bb. Remap statement STMT using the inlining
1341 information in ID. Return the new statement copy. */
1344 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1347 struct walk_stmt_info wi
;
1348 bool skip_first
= false;
1349 gimple_seq stmts
= NULL
;
1351 if (is_gimple_debug (stmt
)
1352 && !opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
1355 /* Begin by recognizing trees that we'll completely rewrite for the
1356 inlining context. Our output for these trees is completely
1357 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1358 into an edge). Further down, we'll handle trees that get
1359 duplicated and/or tweaked. */
1361 /* When requested, GIMPLE_RETURNs should be transformed to just the
1362 contained GIMPLE_ASSIGN. The branch semantics of the return will
1363 be handled elsewhere by manipulating the CFG rather than the
1365 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1367 tree retval
= gimple_return_retval (as_a
<greturn
*> (stmt
));
1368 tree retbnd
= gimple_return_retbnd (stmt
);
1369 tree bndslot
= id
->retbnd
;
1371 if (retbnd
&& bndslot
)
1373 gimple bndcopy
= gimple_build_assign (bndslot
, retbnd
);
1374 memset (&wi
, 0, sizeof (wi
));
1376 walk_gimple_op (bndcopy
, remap_gimple_op_r
, &wi
);
1377 gimple_seq_add_stmt (&stmts
, bndcopy
);
1380 /* If we're returning something, just turn that into an
1381 assignment into the equivalent of the original RESULT_DECL.
1382 If RETVAL is just the result decl, the result decl has
1383 already been set (e.g. a recent "foo (&result_decl, ...)");
1384 just toss the entire GIMPLE_RETURN. */
1386 && (TREE_CODE (retval
) != RESULT_DECL
1387 && (TREE_CODE (retval
) != SSA_NAME
1388 || ! SSA_NAME_VAR (retval
)
1389 || TREE_CODE (SSA_NAME_VAR (retval
)) != RESULT_DECL
)))
1391 copy
= gimple_build_assign (id
->do_not_unshare
1392 ? id
->retvar
: unshare_expr (id
->retvar
),
1394 /* id->retvar is already substituted. Skip it on later remapping. */
1397 /* We need to copy bounds if return structure with pointers into
1398 instrumented function. */
1399 if (chkp_function_instrumented_p (id
->dst_fn
)
1401 && !BOUNDED_P (id
->retvar
)
1402 && chkp_type_has_pointer (TREE_TYPE (id
->retvar
)))
1403 id
->assign_stmts
.safe_push (copy
);
1409 else if (gimple_has_substatements (stmt
))
1413 /* When cloning bodies from the C++ front end, we will be handed bodies
1414 in High GIMPLE form. Handle here all the High GIMPLE statements that
1415 have embedded statements. */
1416 switch (gimple_code (stmt
))
1419 copy
= copy_gimple_bind (as_a
<gbind
*> (stmt
), id
);
1424 gcatch
*catch_stmt
= as_a
<gcatch
*> (stmt
);
1425 s1
= remap_gimple_seq (gimple_catch_handler (catch_stmt
), id
);
1426 copy
= gimple_build_catch (gimple_catch_types (catch_stmt
), s1
);
1430 case GIMPLE_EH_FILTER
:
1431 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1432 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1436 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1437 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1438 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1441 case GIMPLE_WITH_CLEANUP_EXPR
:
1442 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1443 copy
= gimple_build_wce (s1
);
1446 case GIMPLE_OMP_PARALLEL
:
1448 gomp_parallel
*omp_par_stmt
= as_a
<gomp_parallel
*> (stmt
);
1449 s1
= remap_gimple_seq (gimple_omp_body (omp_par_stmt
), id
);
1450 copy
= gimple_build_omp_parallel
1452 gimple_omp_parallel_clauses (omp_par_stmt
),
1453 gimple_omp_parallel_child_fn (omp_par_stmt
),
1454 gimple_omp_parallel_data_arg (omp_par_stmt
));
1458 case GIMPLE_OMP_TASK
:
1459 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1460 copy
= gimple_build_omp_task
1462 gimple_omp_task_clauses (stmt
),
1463 gimple_omp_task_child_fn (stmt
),
1464 gimple_omp_task_data_arg (stmt
),
1465 gimple_omp_task_copy_fn (stmt
),
1466 gimple_omp_task_arg_size (stmt
),
1467 gimple_omp_task_arg_align (stmt
));
1470 case GIMPLE_OMP_FOR
:
1471 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1472 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1473 copy
= gimple_build_omp_for (s1
, gimple_omp_for_kind (stmt
),
1474 gimple_omp_for_clauses (stmt
),
1475 gimple_omp_for_collapse (stmt
), s2
);
1478 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1480 gimple_omp_for_set_index (copy
, i
,
1481 gimple_omp_for_index (stmt
, i
));
1482 gimple_omp_for_set_initial (copy
, i
,
1483 gimple_omp_for_initial (stmt
, i
));
1484 gimple_omp_for_set_final (copy
, i
,
1485 gimple_omp_for_final (stmt
, i
));
1486 gimple_omp_for_set_incr (copy
, i
,
1487 gimple_omp_for_incr (stmt
, i
));
1488 gimple_omp_for_set_cond (copy
, i
,
1489 gimple_omp_for_cond (stmt
, i
));
1494 case GIMPLE_OMP_MASTER
:
1495 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1496 copy
= gimple_build_omp_master (s1
);
1499 case GIMPLE_OMP_TASKGROUP
:
1500 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1501 copy
= gimple_build_omp_taskgroup (s1
);
1504 case GIMPLE_OMP_ORDERED
:
1505 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1506 copy
= gimple_build_omp_ordered (s1
);
1509 case GIMPLE_OMP_SECTION
:
1510 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1511 copy
= gimple_build_omp_section (s1
);
1514 case GIMPLE_OMP_SECTIONS
:
1515 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1516 copy
= gimple_build_omp_sections
1517 (s1
, gimple_omp_sections_clauses (stmt
));
1520 case GIMPLE_OMP_SINGLE
:
1521 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1522 copy
= gimple_build_omp_single
1523 (s1
, gimple_omp_single_clauses (stmt
));
1526 case GIMPLE_OMP_TARGET
:
1527 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1528 copy
= gimple_build_omp_target
1529 (s1
, gimple_omp_target_kind (stmt
),
1530 gimple_omp_target_clauses (stmt
));
1533 case GIMPLE_OMP_TEAMS
:
1534 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1535 copy
= gimple_build_omp_teams
1536 (s1
, gimple_omp_teams_clauses (stmt
));
1539 case GIMPLE_OMP_CRITICAL
:
1540 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1541 copy
= gimple_build_omp_critical (s1
,
1542 gimple_omp_critical_name (
1543 as_a
<gomp_critical
*> (stmt
)));
1546 case GIMPLE_TRANSACTION
:
1548 gtransaction
*old_trans_stmt
= as_a
<gtransaction
*> (stmt
);
1549 gtransaction
*new_trans_stmt
;
1550 s1
= remap_gimple_seq (gimple_transaction_body (old_trans_stmt
),
1552 copy
= new_trans_stmt
1553 = gimple_build_transaction (
1555 gimple_transaction_label (old_trans_stmt
));
1556 gimple_transaction_set_subcode (
1558 gimple_transaction_subcode (old_trans_stmt
));
1568 if (gimple_assign_copy_p (stmt
)
1569 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1570 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1572 /* Here we handle statements that are not completely rewritten.
1573 First we detect some inlining-induced bogosities for
1576 /* Some assignments VAR = VAR; don't generate any rtl code
1577 and thus don't count as variable modification. Avoid
1578 keeping bogosities like 0 = 0. */
1579 tree decl
= gimple_assign_lhs (stmt
), value
;
1582 n
= id
->decl_map
->get (decl
);
1586 STRIP_TYPE_NOPS (value
);
1587 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1592 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1593 in a block that we aren't copying during tree_function_versioning,
1594 just drop the clobber stmt. */
1595 if (id
->blocks_to_copy
&& gimple_clobber_p (stmt
))
1597 tree lhs
= gimple_assign_lhs (stmt
);
1598 if (TREE_CODE (lhs
) == MEM_REF
1599 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
1601 gimple def_stmt
= SSA_NAME_DEF_STMT (TREE_OPERAND (lhs
, 0));
1602 if (gimple_bb (def_stmt
)
1603 && !bitmap_bit_p (id
->blocks_to_copy
,
1604 gimple_bb (def_stmt
)->index
))
1609 if (gimple_debug_bind_p (stmt
))
1612 = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt
),
1613 gimple_debug_bind_get_value (stmt
),
1615 id
->debug_stmts
.safe_push (copy
);
1616 gimple_seq_add_stmt (&stmts
, copy
);
1619 if (gimple_debug_source_bind_p (stmt
))
1621 gdebug
*copy
= gimple_build_debug_source_bind
1622 (gimple_debug_source_bind_get_var (stmt
),
1623 gimple_debug_source_bind_get_value (stmt
),
1625 id
->debug_stmts
.safe_push (copy
);
1626 gimple_seq_add_stmt (&stmts
, copy
);
1630 /* Create a new deep copy of the statement. */
1631 copy
= gimple_copy (stmt
);
1633 /* Clear flags that need revisiting. */
1634 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (copy
))
1636 if (gimple_call_tail_p (call_stmt
))
1637 gimple_call_set_tail (call_stmt
, false);
1638 if (gimple_call_from_thunk_p (call_stmt
))
1639 gimple_call_set_from_thunk (call_stmt
, false);
1642 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1643 RESX and EH_DISPATCH. */
1645 switch (gimple_code (copy
))
1649 tree r
, fndecl
= gimple_call_fndecl (copy
);
1650 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
1651 switch (DECL_FUNCTION_CODE (fndecl
))
1653 case BUILT_IN_EH_COPY_VALUES
:
1654 r
= gimple_call_arg (copy
, 1);
1655 r
= remap_eh_region_tree_nr (r
, id
);
1656 gimple_call_set_arg (copy
, 1, r
);
1659 case BUILT_IN_EH_POINTER
:
1660 case BUILT_IN_EH_FILTER
:
1661 r
= gimple_call_arg (copy
, 0);
1662 r
= remap_eh_region_tree_nr (r
, id
);
1663 gimple_call_set_arg (copy
, 0, r
);
1670 /* Reset alias info if we didn't apply measures to
1671 keep it valid over inlining by setting DECL_PT_UID. */
1672 if (!id
->src_cfun
->gimple_df
1673 || !id
->src_cfun
->gimple_df
->ipa_pta
)
1674 gimple_call_reset_alias_info (as_a
<gcall
*> (copy
));
1680 gresx
*resx_stmt
= as_a
<gresx
*> (copy
);
1681 int r
= gimple_resx_region (resx_stmt
);
1682 r
= remap_eh_region_nr (r
, id
);
1683 gimple_resx_set_region (resx_stmt
, r
);
1687 case GIMPLE_EH_DISPATCH
:
1689 geh_dispatch
*eh_dispatch
= as_a
<geh_dispatch
*> (copy
);
1690 int r
= gimple_eh_dispatch_region (eh_dispatch
);
1691 r
= remap_eh_region_nr (r
, id
);
1692 gimple_eh_dispatch_set_region (eh_dispatch
, r
);
1701 /* If STMT has a block defined, map it to the newly constructed
1703 if (gimple_block (copy
))
1706 n
= id
->decl_map
->get (gimple_block (copy
));
1708 gimple_set_block (copy
, *n
);
1711 if (gimple_debug_bind_p (copy
) || gimple_debug_source_bind_p (copy
))
1713 gimple_seq_add_stmt (&stmts
, copy
);
1717 /* Remap all the operands in COPY. */
1718 memset (&wi
, 0, sizeof (wi
));
1721 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1723 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1725 /* Clear the copied virtual operands. We are not remapping them here
1726 but are going to recreate them from scratch. */
1727 if (gimple_has_mem_ops (copy
))
1729 gimple_set_vdef (copy
, NULL_TREE
);
1730 gimple_set_vuse (copy
, NULL_TREE
);
1733 gimple_seq_add_stmt (&stmts
, copy
);
1738 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1742 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1743 gcov_type count_scale
)
1745 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1746 basic_block copy_basic_block
;
1751 /* Search for previous copied basic block. */
1754 prev
= prev
->prev_bb
;
1756 /* create_basic_block() will append every new block to
1757 basic_block_info automatically. */
1758 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1759 (basic_block
) prev
->aux
);
1760 copy_basic_block
->count
= apply_scale (bb
->count
, count_scale
);
1762 /* We are going to rebuild frequencies from scratch. These values
1763 have just small importance to drive canonicalize_loop_headers. */
1764 freq
= apply_scale ((gcov_type
)bb
->frequency
, frequency_scale
);
1766 /* We recompute frequencies after inlining, so this is quite safe. */
1767 if (freq
> BB_FREQ_MAX
)
1769 copy_basic_block
->frequency
= freq
;
1771 copy_gsi
= gsi_start_bb (copy_basic_block
);
1773 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1776 gimple stmt
= gsi_stmt (gsi
);
1777 gimple orig_stmt
= stmt
;
1778 gimple_stmt_iterator stmts_gsi
;
1779 bool stmt_added
= false;
1781 id
->regimplify
= false;
1782 stmts
= remap_gimple_stmt (stmt
, id
);
1784 if (gimple_seq_empty_p (stmts
))
1789 for (stmts_gsi
= gsi_start (stmts
);
1790 !gsi_end_p (stmts_gsi
); )
1792 stmt
= gsi_stmt (stmts_gsi
);
1794 /* Advance iterator now before stmt is moved to seq_gsi. */
1795 gsi_next (&stmts_gsi
);
1797 if (gimple_nop_p (stmt
))
1800 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
,
1803 /* With return slot optimization we can end up with
1804 non-gimple (foo *)&this->m, fix that here. */
1805 if (is_gimple_assign (stmt
)
1806 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
))
1807 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1810 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1811 gimple_assign_rhs1 (stmt
),
1813 GSI_CONTINUE_LINKING
);
1814 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1815 id
->regimplify
= false;
1818 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1821 gimple_regimplify_operands (stmt
, &seq_gsi
);
1829 /* If copy_basic_block has been empty at the start of this iteration,
1830 call gsi_start_bb again to get at the newly added statements. */
1831 if (gsi_end_p (copy_gsi
))
1832 copy_gsi
= gsi_start_bb (copy_basic_block
);
1834 gsi_next (©_gsi
);
1836 /* Process the new statement. The call to gimple_regimplify_operands
1837 possibly turned the statement into multiple statements, we
1838 need to process all of them. */
1844 stmt
= gsi_stmt (copy_gsi
);
1845 call_stmt
= dyn_cast
<gcall
*> (stmt
);
1847 && gimple_call_va_arg_pack_p (call_stmt
)
1850 /* __builtin_va_arg_pack () should be replaced by
1851 all arguments corresponding to ... in the caller. */
1855 size_t nargs
= gimple_call_num_args (id
->call_stmt
);
1856 size_t n
, i
, nargs_to_copy
;
1857 bool remove_bounds
= false;
1859 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1862 /* Bounds should be removed from arg pack in case
1863 we handle not instrumented call in instrumented
1865 nargs_to_copy
= nargs
;
1866 if (gimple_call_with_bounds_p (id
->call_stmt
)
1867 && !gimple_call_with_bounds_p (stmt
))
1869 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1870 i
< gimple_call_num_args (id
->call_stmt
);
1872 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1874 remove_bounds
= true;
1877 /* Create the new array of arguments. */
1878 n
= nargs_to_copy
+ gimple_call_num_args (call_stmt
);
1879 argarray
.create (n
);
1880 argarray
.safe_grow_cleared (n
);
1882 /* Copy all the arguments before '...' */
1883 memcpy (argarray
.address (),
1884 gimple_call_arg_ptr (call_stmt
, 0),
1885 gimple_call_num_args (call_stmt
) * sizeof (tree
));
1889 /* Append the rest of arguments removing bounds. */
1890 unsigned cur
= gimple_call_num_args (call_stmt
);
1891 i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1892 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1893 i
< gimple_call_num_args (id
->call_stmt
);
1895 if (!POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1896 argarray
[cur
++] = gimple_call_arg (id
->call_stmt
, i
);
1897 gcc_assert (cur
== n
);
1901 /* Append the arguments passed in '...' */
1902 memcpy (argarray
.address () + gimple_call_num_args (call_stmt
),
1903 gimple_call_arg_ptr (id
->call_stmt
, 0)
1904 + (gimple_call_num_args (id
->call_stmt
) - nargs
),
1905 nargs
* sizeof (tree
));
1908 new_call
= gimple_build_call_vec (gimple_call_fn (call_stmt
),
1911 argarray
.release ();
1913 /* Copy all GIMPLE_CALL flags, location and block, except
1914 GF_CALL_VA_ARG_PACK. */
1915 gimple_call_copy_flags (new_call
, call_stmt
);
1916 gimple_call_set_va_arg_pack (new_call
, false);
1917 gimple_set_location (new_call
, gimple_location (stmt
));
1918 gimple_set_block (new_call
, gimple_block (stmt
));
1919 gimple_call_set_lhs (new_call
, gimple_call_lhs (call_stmt
));
1921 gsi_replace (©_gsi
, new_call
, false);
1926 && (decl
= gimple_call_fndecl (stmt
))
1927 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1928 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1930 /* __builtin_va_arg_pack_len () should be replaced by
1931 the number of anonymous arguments. */
1932 size_t nargs
= gimple_call_num_args (id
->call_stmt
), i
;
1936 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= DECL_CHAIN (p
))
1939 /* For instrumented calls we should ignore bounds. */
1940 for (i
= gimple_call_num_args (id
->call_stmt
) - nargs
;
1941 i
< gimple_call_num_args (id
->call_stmt
);
1943 if (POINTER_BOUNDS_P (gimple_call_arg (id
->call_stmt
, i
)))
1946 count
= build_int_cst (integer_type_node
, nargs
);
1947 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1948 gsi_replace (©_gsi
, new_stmt
, false);
1953 && gimple_call_internal_p (stmt
)
1954 && gimple_call_internal_fn (stmt
) == IFN_TSAN_FUNC_EXIT
)
1956 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
1957 gsi_remove (©_gsi
, false);
1961 /* Statements produced by inlining can be unfolded, especially
1962 when we constant propagated some operands. We can't fold
1963 them right now for two reasons:
1964 1) folding require SSA_NAME_DEF_STMTs to be correct
1965 2) we can't change function calls to builtins.
1966 So we just mark statement for later folding. We mark
1967 all new statements, instead just statements that has changed
1968 by some nontrivial substitution so even statements made
1969 foldable indirectly are updated. If this turns out to be
1970 expensive, copy_body can be told to watch for nontrivial
1972 if (id
->statements_to_fold
)
1973 id
->statements_to_fold
->add (stmt
);
1975 /* We're duplicating a CALL_EXPR. Find any corresponding
1976 callgraph edges and update or duplicate them. */
1977 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
1979 struct cgraph_edge
*edge
;
1981 switch (id
->transform_call_graph_edges
)
1983 case CB_CGE_DUPLICATE
:
1984 edge
= id
->src_node
->get_edge (orig_stmt
);
1987 int edge_freq
= edge
->frequency
;
1989 struct cgraph_edge
*old_edge
= edge
;
1990 edge
= edge
->clone (id
->dst_node
, call_stmt
,
1992 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
1994 /* We could also just rescale the frequency, but
1995 doing so would introduce roundoff errors and make
1996 verifier unhappy. */
1997 new_freq
= compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
2000 /* Speculative calls consist of two edges - direct and indirect.
2001 Duplicate the whole thing and distribute frequencies accordingly. */
2002 if (edge
->speculative
)
2004 struct cgraph_edge
*direct
, *indirect
;
2005 struct ipa_ref
*ref
;
2007 gcc_assert (!edge
->indirect_unknown_callee
);
2008 old_edge
->speculative_call_info (direct
, indirect
, ref
);
2009 indirect
= indirect
->clone (id
->dst_node
, call_stmt
,
2011 REG_BR_PROB_BASE
, CGRAPH_FREQ_BASE
,
2013 if (old_edge
->frequency
+ indirect
->frequency
)
2015 edge
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* old_edge
->frequency
,
2016 (old_edge
->frequency
+ indirect
->frequency
)),
2018 indirect
->frequency
= MIN (RDIV ((gcov_type
)new_freq
* indirect
->frequency
,
2019 (old_edge
->frequency
+ indirect
->frequency
)),
2022 id
->dst_node
->clone_reference (ref
, stmt
);
2026 edge
->frequency
= new_freq
;
2028 && profile_status_for_fn (cfun
) != PROFILE_ABSENT
2029 && (edge_freq
> edge
->frequency
+ 10
2030 || edge_freq
< edge
->frequency
- 10))
2032 fprintf (dump_file
, "Edge frequency estimated by "
2033 "cgraph %i diverge from inliner's estimate %i\n",
2037 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
2040 copy_basic_block
->frequency
);
2046 case CB_CGE_MOVE_CLONES
:
2047 id
->dst_node
->set_call_stmt_including_clones (orig_stmt
,
2049 edge
= id
->dst_node
->get_edge (stmt
);
2053 edge
= id
->dst_node
->get_edge (orig_stmt
);
2055 edge
->set_call_stmt (call_stmt
);
2062 /* Constant propagation on argument done during inlining
2063 may create new direct call. Produce an edge for it. */
2065 || (edge
->indirect_inlining_edge
2066 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
2067 && id
->dst_node
->definition
2068 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
2070 struct cgraph_node
*dest
= cgraph_node::get (fn
);
2072 /* We have missing edge in the callgraph. This can happen
2073 when previous inlining turned an indirect call into a
2074 direct call by constant propagating arguments or we are
2075 producing dead clone (for further cloning). In all
2076 other cases we hit a bug (incorrect node sharing is the
2077 most common reason for missing edges). */
2078 gcc_assert (!dest
->definition
2079 || dest
->address_taken
2080 || !id
->src_node
->definition
2081 || !id
->dst_node
->definition
);
2082 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
2083 id
->dst_node
->create_edge_including_clones
2084 (dest
, orig_stmt
, call_stmt
, bb
->count
,
2085 compute_call_stmt_bb_frequency (id
->dst_node
->decl
,
2087 CIF_ORIGINALLY_INDIRECT_CALL
);
2089 id
->dst_node
->create_edge (dest
, call_stmt
,
2091 compute_call_stmt_bb_frequency
2092 (id
->dst_node
->decl
,
2093 copy_basic_block
))->inline_failed
2094 = CIF_ORIGINALLY_INDIRECT_CALL
;
2097 fprintf (dump_file
, "Created new direct edge to %s\n",
2102 notice_special_calls (as_a
<gcall
*> (stmt
));
2105 maybe_duplicate_eh_stmt_fn (cfun
, stmt
, id
->src_cfun
, orig_stmt
,
2106 id
->eh_map
, id
->eh_lp_nr
);
2108 if (gimple_in_ssa_p (cfun
) && !is_gimple_debug (stmt
))
2113 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
2114 if (TREE_CODE (def
) == SSA_NAME
)
2115 SSA_NAME_DEF_STMT (def
) = stmt
;
2118 gsi_next (©_gsi
);
2120 while (!gsi_end_p (copy_gsi
));
2122 copy_gsi
= gsi_last_bb (copy_basic_block
);
2125 return copy_basic_block
;
2128 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2129 form is quite easy, since dominator relationship for old basic blocks does
2132 There is however exception where inlining might change dominator relation
2133 across EH edges from basic block within inlined functions destinating
2134 to landing pads in function we inline into.
2136 The function fills in PHI_RESULTs of such PHI nodes if they refer
2137 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2138 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2139 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2140 set, and this means that there will be no overlapping live ranges
2141 for the underlying symbol.
2143 This might change in future if we allow redirecting of EH edges and
2144 we might want to change way build CFG pre-inlining to include
2145 all the possible edges then. */
2147 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
2148 bool can_throw
, bool nonlocal_goto
)
2153 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2155 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
2161 gcc_assert (e
->flags
& EDGE_EH
);
2164 gcc_assert (!(e
->flags
& EDGE_EH
));
2166 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
2172 /* For abnormal goto/call edges the receiver can be the
2173 ENTRY_BLOCK. Do not assert this cannot happen. */
2175 gcc_assert ((e
->flags
& EDGE_EH
)
2176 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
2178 re
= find_edge (ret_bb
, e
->dest
);
2179 gcc_checking_assert (re
);
2180 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
2181 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
2183 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
2184 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
2190 /* Copy edges from BB into its copy constructed earlier, scale profile
2191 accordingly. Edges will be taken care of later. Assume aux
2192 pointers to point to the copies of each BB. Return true if any
2193 debug stmts are left after a statement that must end the basic block. */
2196 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
,
2197 basic_block abnormal_goto_dest
)
2199 basic_block new_bb
= (basic_block
) bb
->aux
;
2202 gimple_stmt_iterator si
;
2204 bool need_debug_cleanup
= false;
2206 /* Use the indices from the original blocks to create edges for the
2208 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
2209 if (!(old_edge
->flags
& EDGE_EH
))
2213 flags
= old_edge
->flags
;
2215 /* Return edges do get a FALLTHRU flag when the get inlined. */
2216 if (old_edge
->dest
->index
== EXIT_BLOCK
2217 && !(old_edge
->flags
& (EDGE_TRUE_VALUE
|EDGE_FALSE_VALUE
|EDGE_FAKE
))
2218 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
2219 flags
|= EDGE_FALLTHRU
;
2220 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
2221 new_edge
->count
= apply_scale (old_edge
->count
, count_scale
);
2222 new_edge
->probability
= old_edge
->probability
;
2225 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
2228 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
2231 bool can_throw
, nonlocal_goto
;
2233 copy_stmt
= gsi_stmt (si
);
2234 if (!is_gimple_debug (copy_stmt
))
2235 update_stmt (copy_stmt
);
2237 /* Do this before the possible split_block. */
2240 /* If this tree could throw an exception, there are two
2241 cases where we need to add abnormal edge(s): the
2242 tree wasn't in a region and there is a "current
2243 region" in the caller; or the original tree had
2244 EH edges. In both cases split the block after the tree,
2245 and add abnormal edge(s) as needed; we need both
2246 those from the callee and the caller.
2247 We check whether the copy can throw, because the const
2248 propagation can change an INDIRECT_REF which throws
2249 into a COMPONENT_REF which doesn't. If the copy
2250 can throw, the original could also throw. */
2251 can_throw
= stmt_can_throw_internal (copy_stmt
);
2253 = (stmt_can_make_abnormal_goto (copy_stmt
)
2254 && !computed_goto_p (copy_stmt
));
2256 if (can_throw
|| nonlocal_goto
)
2258 if (!gsi_end_p (si
))
2260 while (!gsi_end_p (si
) && is_gimple_debug (gsi_stmt (si
)))
2263 need_debug_cleanup
= true;
2265 if (!gsi_end_p (si
))
2266 /* Note that bb's predecessor edges aren't necessarily
2267 right at this point; split_block doesn't care. */
2269 edge e
= split_block (new_bb
, copy_stmt
);
2272 new_bb
->aux
= e
->src
->aux
;
2273 si
= gsi_start_bb (new_bb
);
2277 if (gimple_code (copy_stmt
) == GIMPLE_EH_DISPATCH
)
2278 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (copy_stmt
));
2280 make_eh_edges (copy_stmt
);
2282 /* If the call we inline cannot make abnormal goto do not add
2283 additional abnormal edges but only retain those already present
2284 in the original function body. */
2285 if (abnormal_goto_dest
== NULL
)
2286 nonlocal_goto
= false;
2289 basic_block copy_stmt_bb
= gimple_bb (copy_stmt
);
2291 if (get_abnormal_succ_dispatcher (copy_stmt_bb
))
2292 nonlocal_goto
= false;
2293 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2294 in OpenMP regions which aren't allowed to be left abnormally.
2295 So, no need to add abnormal edge in that case. */
2296 else if (is_gimple_call (copy_stmt
)
2297 && gimple_call_internal_p (copy_stmt
)
2298 && (gimple_call_internal_fn (copy_stmt
)
2299 == IFN_ABNORMAL_DISPATCHER
)
2300 && gimple_call_arg (copy_stmt
, 0) == boolean_true_node
)
2301 nonlocal_goto
= false;
2303 make_edge (copy_stmt_bb
, abnormal_goto_dest
, EDGE_ABNORMAL
);
2306 if ((can_throw
|| nonlocal_goto
)
2307 && gimple_in_ssa_p (cfun
))
2308 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
2309 can_throw
, nonlocal_goto
);
2311 return need_debug_cleanup
;
2314 /* Copy the PHIs. All blocks and edges are copied, some blocks
2315 was possibly split and new outgoing EH edges inserted.
2316 BB points to the block of original function and AUX pointers links
2317 the original and newly copied blocks. */
2320 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
2322 basic_block
const new_bb
= (basic_block
) bb
->aux
;
2327 bool inserted
= false;
2329 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
2335 res
= PHI_RESULT (phi
);
2337 if (!virtual_operand_p (res
))
2339 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
2340 new_phi
= create_phi_node (new_res
, new_bb
);
2341 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2343 edge old_edge
= find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
2349 /* When doing partial cloning, we allow PHIs on the entry block
2350 as long as all the arguments are the same. Find any input
2351 edge to see argument to copy. */
2353 FOR_EACH_EDGE (old_edge
, ei2
, bb
->preds
)
2354 if (!old_edge
->src
->aux
)
2357 arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
2359 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
2360 gcc_assert (new_arg
);
2361 /* With return slot optimization we can end up with
2362 non-gimple (foo *)&this->m, fix that here. */
2363 if (TREE_CODE (new_arg
) != SSA_NAME
2364 && TREE_CODE (new_arg
) != FUNCTION_DECL
2365 && !is_gimple_val (new_arg
))
2367 gimple_seq stmts
= NULL
;
2368 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
2369 gsi_insert_seq_on_edge (new_edge
, stmts
);
2372 locus
= gimple_phi_arg_location_from_edge (phi
, old_edge
);
2373 if (LOCATION_BLOCK (locus
))
2376 n
= id
->decl_map
->get (LOCATION_BLOCK (locus
));
2379 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, *n
);
2381 locus
= LOCATION_LOCUS (locus
);
2384 locus
= LOCATION_LOCUS (locus
);
2386 add_phi_arg (new_phi
, new_arg
, new_edge
, locus
);
2391 /* Commit the delayed edge insertions. */
2393 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
2394 gsi_commit_one_edge_insert (new_edge
, NULL
);
2398 /* Wrapper for remap_decl so it can be used as a callback. */
2401 remap_decl_1 (tree decl
, void *data
)
2403 return remap_decl (decl
, (copy_body_data
*) data
);
2406 /* Build struct function and associated datastructures for the new clone
2407 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2408 the cfun to the function of new_fndecl (and current_function_decl too). */
2411 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
)
2413 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2414 gcov_type count_scale
;
2416 if (!DECL_ARGUMENTS (new_fndecl
))
2417 DECL_ARGUMENTS (new_fndecl
) = DECL_ARGUMENTS (callee_fndecl
);
2418 if (!DECL_RESULT (new_fndecl
))
2419 DECL_RESULT (new_fndecl
) = DECL_RESULT (callee_fndecl
);
2421 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2423 = GCOV_COMPUTE_SCALE (count
,
2424 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2426 count_scale
= REG_BR_PROB_BASE
;
2428 /* Register specific tree functions. */
2429 gimple_register_cfg_hooks ();
2431 /* Get clean struct function. */
2432 push_struct_function (new_fndecl
);
2434 /* We will rebuild these, so just sanity check that they are empty. */
2435 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
2436 gcc_assert (cfun
->local_decls
== NULL
);
2437 gcc_assert (cfun
->cfg
== NULL
);
2438 gcc_assert (cfun
->decl
== new_fndecl
);
2440 /* Copy items we preserve during cloning. */
2441 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
2442 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
2443 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
2444 cfun
->curr_properties
= src_cfun
->curr_properties
;
2445 cfun
->last_verified
= src_cfun
->last_verified
;
2446 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
2447 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
2448 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
2449 cfun
->stdarg
= src_cfun
->stdarg
;
2450 cfun
->after_inlining
= src_cfun
->after_inlining
;
2451 cfun
->can_throw_non_call_exceptions
2452 = src_cfun
->can_throw_non_call_exceptions
;
2453 cfun
->can_delete_dead_exceptions
= src_cfun
->can_delete_dead_exceptions
;
2454 cfun
->returns_struct
= src_cfun
->returns_struct
;
2455 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
2457 init_empty_tree_cfg ();
2459 profile_status_for_fn (cfun
) = profile_status_for_fn (src_cfun
);
2460 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
2461 (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2463 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
2464 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2465 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
2466 (EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->count
* count_scale
/
2468 EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
=
2469 EXIT_BLOCK_PTR_FOR_FN (src_cfun
)->frequency
;
2471 init_eh_for_function ();
2473 if (src_cfun
->gimple_df
)
2475 init_tree_ssa (cfun
);
2476 cfun
->gimple_df
->in_ssa_p
= true;
2477 init_ssa_operands (cfun
);
2481 /* Helper function for copy_cfg_body. Move debug stmts from the end
2482 of NEW_BB to the beginning of successor basic blocks when needed. If the
2483 successor has multiple predecessors, reset them, otherwise keep
2487 maybe_move_debug_stmts_to_successors (copy_body_data
*id
, basic_block new_bb
)
2491 gimple_stmt_iterator si
= gsi_last_nondebug_bb (new_bb
);
2494 || gsi_one_before_end_p (si
)
2495 || !(stmt_can_throw_internal (gsi_stmt (si
))
2496 || stmt_can_make_abnormal_goto (gsi_stmt (si
))))
2499 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
2501 gimple_stmt_iterator ssi
= gsi_last_bb (new_bb
);
2502 gimple_stmt_iterator dsi
= gsi_after_labels (e
->dest
);
2503 while (is_gimple_debug (gsi_stmt (ssi
)))
2505 gimple stmt
= gsi_stmt (ssi
);
2510 /* For the last edge move the debug stmts instead of copying
2512 if (ei_one_before_end_p (ei
))
2516 if (!single_pred_p (e
->dest
) && gimple_debug_bind_p (stmt
))
2517 gimple_debug_bind_reset_value (stmt
);
2518 gsi_remove (&si
, false);
2519 gsi_insert_before (&dsi
, stmt
, GSI_SAME_STMT
);
2523 if (gimple_debug_bind_p (stmt
))
2525 var
= gimple_debug_bind_get_var (stmt
);
2526 if (single_pred_p (e
->dest
))
2528 value
= gimple_debug_bind_get_value (stmt
);
2529 value
= unshare_expr (value
);
2533 new_stmt
= gimple_build_debug_bind (var
, value
, stmt
);
2535 else if (gimple_debug_source_bind_p (stmt
))
2537 var
= gimple_debug_source_bind_get_var (stmt
);
2538 value
= gimple_debug_source_bind_get_value (stmt
);
2539 new_stmt
= gimple_build_debug_source_bind (var
, value
, stmt
);
2543 gsi_insert_before (&dsi
, new_stmt
, GSI_SAME_STMT
);
2544 id
->debug_stmts
.safe_push (new_stmt
);
2550 /* Make a copy of the sub-loops of SRC_PARENT and place them
2551 as siblings of DEST_PARENT. */
2554 copy_loops (copy_body_data
*id
,
2555 struct loop
*dest_parent
, struct loop
*src_parent
)
2557 struct loop
*src_loop
= src_parent
->inner
;
2560 if (!id
->blocks_to_copy
2561 || bitmap_bit_p (id
->blocks_to_copy
, src_loop
->header
->index
))
2563 struct loop
*dest_loop
= alloc_loop ();
2565 /* Assign the new loop its header and latch and associate
2566 those with the new loop. */
2567 dest_loop
->header
= (basic_block
)src_loop
->header
->aux
;
2568 dest_loop
->header
->loop_father
= dest_loop
;
2569 if (src_loop
->latch
!= NULL
)
2571 dest_loop
->latch
= (basic_block
)src_loop
->latch
->aux
;
2572 dest_loop
->latch
->loop_father
= dest_loop
;
2575 /* Copy loop meta-data. */
2576 copy_loop_info (src_loop
, dest_loop
);
2578 /* Finally place it into the loop array and the loop tree. */
2579 place_new_loop (cfun
, dest_loop
);
2580 flow_loop_tree_node_add (dest_parent
, dest_loop
);
2582 dest_loop
->safelen
= src_loop
->safelen
;
2583 dest_loop
->dont_vectorize
= src_loop
->dont_vectorize
;
2584 if (src_loop
->force_vectorize
)
2586 dest_loop
->force_vectorize
= true;
2587 cfun
->has_force_vectorize_loops
= true;
2589 if (src_loop
->simduid
)
2591 dest_loop
->simduid
= remap_decl (src_loop
->simduid
, id
);
2592 cfun
->has_simduid_loops
= true;
2596 copy_loops (id
, dest_loop
, src_loop
);
2598 src_loop
= src_loop
->next
;
2602 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2605 redirect_all_calls (copy_body_data
* id
, basic_block bb
)
2607 gimple_stmt_iterator si
;
2608 gimple last
= last_stmt (bb
);
2609 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
2611 gimple stmt
= gsi_stmt (si
);
2612 if (is_gimple_call (stmt
))
2614 struct cgraph_edge
*edge
= id
->dst_node
->get_edge (stmt
);
2617 edge
->redirect_call_stmt_to_callee ();
2618 if (stmt
== last
&& id
->call_stmt
&& maybe_clean_eh_stmt (stmt
))
2619 gimple_purge_dead_eh_edges (bb
);
2625 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2626 with each bb's frequency. Used when NODE has a 0-weight entry
2627 but we are about to inline it into a non-zero count call bb.
2628 See the comments for handle_missing_profiles() in predict.c for
2629 when this can happen for COMDATs. */
2632 freqs_to_counts (struct cgraph_node
*node
, gcov_type count
)
2637 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
2639 FOR_ALL_BB_FN(bb
, fn
)
2641 bb
->count
= apply_scale (count
,
2642 GCOV_COMPUTE_SCALE (bb
->frequency
, BB_FREQ_MAX
));
2643 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2644 e
->count
= apply_probability (e
->src
->count
, e
->probability
);
2648 /* Make a copy of the body of FN so that it can be inserted inline in
2649 another function. Walks FN via CFG, returns new fndecl. */
2652 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency_scale
,
2653 basic_block entry_block_map
, basic_block exit_block_map
,
2654 basic_block new_entry
)
2656 tree callee_fndecl
= id
->src_fn
;
2657 /* Original cfun for the callee, doesn't change. */
2658 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2659 struct function
*cfun_to_copy
;
2661 tree new_fndecl
= NULL
;
2662 bool need_debug_cleanup
= false;
2663 gcov_type count_scale
;
2665 int incoming_frequency
= 0;
2666 gcov_type incoming_count
= 0;
2668 /* This can happen for COMDAT routines that end up with 0 counts
2669 despite being called (see the comments for handle_missing_profiles()
2670 in predict.c as to why). Apply counts to the blocks in the callee
2671 before inlining, using the guessed edge frequencies, so that we don't
2672 end up with a 0-count inline body which can confuse downstream
2673 optimizations such as function splitting. */
2674 if (!ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
&& count
)
2676 /* Apply the larger of the call bb count and the total incoming
2677 call edge count to the callee. */
2678 gcov_type in_count
= 0;
2679 struct cgraph_edge
*in_edge
;
2680 for (in_edge
= id
->src_node
->callers
; in_edge
;
2681 in_edge
= in_edge
->next_caller
)
2682 in_count
+= in_edge
->count
;
2683 freqs_to_counts (id
->src_node
, count
> in_count
? count
: in_count
);
2686 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
)
2688 = GCOV_COMPUTE_SCALE (count
,
2689 ENTRY_BLOCK_PTR_FOR_FN (src_cfun
)->count
);
2691 count_scale
= REG_BR_PROB_BASE
;
2693 /* Register specific tree functions. */
2694 gimple_register_cfg_hooks ();
2696 /* If we are inlining just region of the function, make sure to connect
2697 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2698 part of loop, we must compute frequency and probability of
2699 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2700 probabilities of edges incoming from nonduplicated region. */
2706 FOR_EACH_EDGE (e
, ei
, new_entry
->preds
)
2709 incoming_frequency
+= EDGE_FREQUENCY (e
);
2710 incoming_count
+= e
->count
;
2712 incoming_count
= apply_scale (incoming_count
, count_scale
);
2714 = apply_scale ((gcov_type
)incoming_frequency
, frequency_scale
);
2715 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= incoming_count
;
2716 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
= incoming_frequency
;
2719 /* Must have a CFG here at this point. */
2720 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2721 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
2723 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
2725 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= entry_block_map
;
2726 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
)->aux
= exit_block_map
;
2727 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2728 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy
);
2730 /* Duplicate any exception-handling regions. */
2732 id
->eh_map
= duplicate_eh_regions (cfun_to_copy
, NULL
, id
->eh_lp_nr
,
2735 /* Use aux pointers to map the original blocks to copy. */
2736 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
2737 if (!id
->blocks_to_copy
|| bitmap_bit_p (id
->blocks_to_copy
, bb
->index
))
2739 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
2742 new_bb
->loop_father
= entry_block_map
->loop_father
;
2745 last
= last_basic_block_for_fn (cfun
);
2747 /* Now that we've duplicated the blocks, duplicate their edges. */
2748 basic_block abnormal_goto_dest
= NULL
;
2750 && stmt_can_make_abnormal_goto (id
->call_stmt
))
2752 gimple_stmt_iterator gsi
= gsi_for_stmt (id
->call_stmt
);
2754 bb
= gimple_bb (id
->call_stmt
);
2756 if (gsi_end_p (gsi
))
2757 abnormal_goto_dest
= get_abnormal_succ_dispatcher (bb
);
2759 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2760 if (!id
->blocks_to_copy
2761 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2762 need_debug_cleanup
|= copy_edges_for_bb (bb
, count_scale
, exit_block_map
,
2763 abnormal_goto_dest
);
2767 edge e
= make_edge (entry_block_map
, (basic_block
)new_entry
->aux
, EDGE_FALLTHRU
);
2768 e
->probability
= REG_BR_PROB_BASE
;
2769 e
->count
= incoming_count
;
2772 /* Duplicate the loop tree, if available and wanted. */
2773 if (loops_for_fn (src_cfun
) != NULL
2774 && current_loops
!= NULL
)
2776 copy_loops (id
, entry_block_map
->loop_father
,
2777 get_loop (src_cfun
, 0));
2778 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2779 loops_state_set (LOOPS_NEED_FIXUP
);
2782 /* If the loop tree in the source function needed fixup, mark the
2783 destination loop tree for fixup, too. */
2784 if (loops_for_fn (src_cfun
)->state
& LOOPS_NEED_FIXUP
)
2785 loops_state_set (LOOPS_NEED_FIXUP
);
2787 if (gimple_in_ssa_p (cfun
))
2788 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2789 if (!id
->blocks_to_copy
2790 || (bb
->index
> 0 && bitmap_bit_p (id
->blocks_to_copy
, bb
->index
)))
2791 copy_phis_for_bb (bb
, id
);
2793 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2796 if (need_debug_cleanup
2797 && bb
->index
!= ENTRY_BLOCK
2798 && bb
->index
!= EXIT_BLOCK
)
2799 maybe_move_debug_stmts_to_successors (id
, (basic_block
) bb
->aux
);
2800 /* Update call edge destinations. This can not be done before loop
2801 info is updated, because we may split basic blocks. */
2802 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2803 redirect_all_calls (id
, (basic_block
)bb
->aux
);
2804 ((basic_block
)bb
->aux
)->aux
= NULL
;
2808 /* Zero out AUX fields of newly created block during EH edge
2810 for (; last
< last_basic_block_for_fn (cfun
); last
++)
2812 if (need_debug_cleanup
)
2813 maybe_move_debug_stmts_to_successors (id
,
2814 BASIC_BLOCK_FOR_FN (cfun
, last
));
2815 BASIC_BLOCK_FOR_FN (cfun
, last
)->aux
= NULL
;
2816 /* Update call edge destinations. This can not be done before loop
2817 info is updated, because we may split basic blocks. */
2818 if (id
->transform_call_graph_edges
== CB_CGE_DUPLICATE
)
2819 redirect_all_calls (id
, BASIC_BLOCK_FOR_FN (cfun
, last
));
2821 entry_block_map
->aux
= NULL
;
2822 exit_block_map
->aux
= NULL
;
2829 if (id
->dependence_map
)
2831 delete id
->dependence_map
;
2832 id
->dependence_map
= NULL
;
2838 /* Copy the debug STMT using ID. We deal with these statements in a
2839 special way: if any variable in their VALUE expression wasn't
2840 remapped yet, we won't remap it, because that would get decl uids
2841 out of sync, causing codegen differences between -g and -g0. If
2842 this arises, we drop the VALUE expression altogether. */
2845 copy_debug_stmt (gdebug
*stmt
, copy_body_data
*id
)
2848 struct walk_stmt_info wi
;
2850 if (gimple_block (stmt
))
2852 n
= id
->decl_map
->get (gimple_block (stmt
));
2853 gimple_set_block (stmt
, n
? *n
: id
->block
);
2856 /* Remap all the operands in COPY. */
2857 memset (&wi
, 0, sizeof (wi
));
2860 processing_debug_stmt
= 1;
2862 if (gimple_debug_source_bind_p (stmt
))
2863 t
= gimple_debug_source_bind_get_var (stmt
);
2865 t
= gimple_debug_bind_get_var (stmt
);
2867 if (TREE_CODE (t
) == PARM_DECL
&& id
->debug_map
2868 && (n
= id
->debug_map
->get (t
)))
2870 gcc_assert (TREE_CODE (*n
) == VAR_DECL
);
2873 else if (TREE_CODE (t
) == VAR_DECL
2874 && !is_global_var (t
)
2875 && !id
->decl_map
->get (t
))
2876 /* T is a non-localized variable. */;
2878 walk_tree (&t
, remap_gimple_op_r
, &wi
, NULL
);
2880 if (gimple_debug_bind_p (stmt
))
2882 gimple_debug_bind_set_var (stmt
, t
);
2884 if (gimple_debug_bind_has_value_p (stmt
))
2885 walk_tree (gimple_debug_bind_get_value_ptr (stmt
),
2886 remap_gimple_op_r
, &wi
, NULL
);
2888 /* Punt if any decl couldn't be remapped. */
2889 if (processing_debug_stmt
< 0)
2890 gimple_debug_bind_reset_value (stmt
);
2892 else if (gimple_debug_source_bind_p (stmt
))
2894 gimple_debug_source_bind_set_var (stmt
, t
);
2895 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt
),
2896 remap_gimple_op_r
, &wi
, NULL
);
2897 /* When inlining and source bind refers to one of the optimized
2898 away parameters, change the source bind into normal debug bind
2899 referring to the corresponding DEBUG_EXPR_DECL that should have
2900 been bound before the call stmt. */
2901 t
= gimple_debug_source_bind_get_value (stmt
);
2903 && TREE_CODE (t
) == PARM_DECL
2906 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (id
->src_fn
);
2908 if (debug_args
!= NULL
)
2910 for (i
= 0; i
< vec_safe_length (*debug_args
); i
+= 2)
2911 if ((**debug_args
)[i
] == DECL_ORIGIN (t
)
2912 && TREE_CODE ((**debug_args
)[i
+ 1]) == DEBUG_EXPR_DECL
)
2914 t
= (**debug_args
)[i
+ 1];
2915 stmt
->subcode
= GIMPLE_DEBUG_BIND
;
2916 gimple_debug_bind_set_value (stmt
, t
);
2923 processing_debug_stmt
= 0;
2928 /* Process deferred debug stmts. In order to give values better odds
2929 of being successfully remapped, we delay the processing of debug
2930 stmts until all other stmts that might require remapping are
2934 copy_debug_stmts (copy_body_data
*id
)
2939 if (!id
->debug_stmts
.exists ())
2942 FOR_EACH_VEC_ELT (id
->debug_stmts
, i
, stmt
)
2943 copy_debug_stmt (stmt
, id
);
2945 id
->debug_stmts
.release ();
2948 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2949 another function. */
2952 copy_tree_body (copy_body_data
*id
)
2954 tree fndecl
= id
->src_fn
;
2955 tree body
= DECL_SAVED_TREE (fndecl
);
2957 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2962 /* Make a copy of the body of FN so that it can be inserted inline in
2963 another function. */
2966 copy_body (copy_body_data
*id
, gcov_type count
, int frequency_scale
,
2967 basic_block entry_block_map
, basic_block exit_block_map
,
2968 basic_block new_entry
)
2970 tree fndecl
= id
->src_fn
;
2973 /* If this body has a CFG, walk CFG and copy. */
2974 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl
)));
2975 body
= copy_cfg_body (id
, count
, frequency_scale
, entry_block_map
, exit_block_map
,
2977 copy_debug_stmts (id
);
2982 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2983 defined in function FN, or of a data member thereof. */
2986 self_inlining_addr_expr (tree value
, tree fn
)
2990 if (TREE_CODE (value
) != ADDR_EXPR
)
2993 var
= get_base_address (TREE_OPERAND (value
, 0));
2995 return var
&& auto_var_in_fn_p (var
, fn
);
2998 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2999 lexical block and line number information from base_stmt, if given,
3000 or from the last stmt of the block otherwise. */
3003 insert_init_debug_bind (copy_body_data
*id
,
3004 basic_block bb
, tree var
, tree value
,
3008 gimple_stmt_iterator gsi
;
3011 if (!gimple_in_ssa_p (id
->src_cfun
))
3014 if (!opt_for_fn (id
->dst_fn
, flag_var_tracking_assignments
))
3017 tracked_var
= target_for_debug_bind (var
);
3023 gsi
= gsi_last_bb (bb
);
3024 if (!base_stmt
&& !gsi_end_p (gsi
))
3025 base_stmt
= gsi_stmt (gsi
);
3028 note
= gimple_build_debug_bind (tracked_var
, value
, base_stmt
);
3032 if (!gsi_end_p (gsi
))
3033 gsi_insert_after (&gsi
, note
, GSI_SAME_STMT
);
3035 gsi_insert_before (&gsi
, note
, GSI_SAME_STMT
);
3042 insert_init_stmt (copy_body_data
*id
, basic_block bb
, gimple init_stmt
)
3044 /* If VAR represents a zero-sized variable, it's possible that the
3045 assignment statement may result in no gimple statements. */
3048 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3050 /* We can end up with init statements that store to a non-register
3051 from a rhs with a conversion. Handle that here by forcing the
3052 rhs into a temporary. gimple_regimplify_operands is not
3053 prepared to do this for us. */
3054 if (!is_gimple_debug (init_stmt
)
3055 && !is_gimple_reg (gimple_assign_lhs (init_stmt
))
3056 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
3057 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
3059 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
3060 gimple_expr_type (init_stmt
),
3061 gimple_assign_rhs1 (init_stmt
));
3062 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
3064 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
3065 gimple_assign_set_rhs1 (init_stmt
, rhs
);
3067 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
3068 gimple_regimplify_operands (init_stmt
, &si
);
3070 if (!is_gimple_debug (init_stmt
))
3072 tree def
= gimple_assign_lhs (init_stmt
);
3073 insert_init_debug_bind (id
, bb
, def
, def
, init_stmt
);
3078 /* Initialize parameter P with VALUE. If needed, produce init statement
3079 at the end of BB. When BB is NULL, we return init statement to be
3082 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
3083 basic_block bb
, tree
*vars
)
3085 gimple init_stmt
= NULL
;
3088 tree def
= (gimple_in_ssa_p (cfun
)
3089 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3092 && value
!= error_mark_node
3093 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
3095 /* If we can match up types by promotion/demotion do so. */
3096 if (fold_convertible_p (TREE_TYPE (p
), value
))
3097 rhs
= fold_convert (TREE_TYPE (p
), value
);
3100 /* ??? For valid programs we should not end up here.
3101 Still if we end up with truly mismatched types here, fall back
3102 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3103 GIMPLE to the following passes. */
3104 if (!is_gimple_reg_type (TREE_TYPE (value
))
3105 || TYPE_SIZE (TREE_TYPE (p
)) == TYPE_SIZE (TREE_TYPE (value
)))
3106 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
3108 rhs
= build_zero_cst (TREE_TYPE (p
));
3112 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3113 here since the type of this decl must be visible to the calling
3115 var
= copy_decl_to_var (p
, id
);
3117 /* Declare this new variable. */
3118 DECL_CHAIN (var
) = *vars
;
3121 /* Make gimplifier happy about this variable. */
3122 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3124 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3125 we would not need to create a new variable here at all, if it
3126 weren't for debug info. Still, we can just use the argument
3128 if (TREE_READONLY (p
)
3129 && !TREE_ADDRESSABLE (p
)
3130 && value
&& !TREE_SIDE_EFFECTS (value
)
3133 /* We may produce non-gimple trees by adding NOPs or introduce
3134 invalid sharing when operand is not really constant.
3135 It is not big deal to prohibit constant propagation here as
3136 we will constant propagate in DOM1 pass anyway. */
3137 if (is_gimple_min_invariant (value
)
3138 && useless_type_conversion_p (TREE_TYPE (p
),
3140 /* We have to be very careful about ADDR_EXPR. Make sure
3141 the base variable isn't a local variable of the inlined
3142 function, e.g., when doing recursive inlining, direct or
3143 mutually-recursive or whatever, which is why we don't
3144 just test whether fn == current_function_decl. */
3145 && ! self_inlining_addr_expr (value
, fn
))
3147 insert_decl_map (id
, p
, value
);
3148 insert_debug_decl_map (id
, p
, var
);
3149 return insert_init_debug_bind (id
, bb
, var
, value
, NULL
);
3153 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3154 that way, when the PARM_DECL is encountered, it will be
3155 automatically replaced by the VAR_DECL. */
3156 insert_decl_map (id
, p
, var
);
3158 /* Even if P was TREE_READONLY, the new VAR should not be.
3159 In the original code, we would have constructed a
3160 temporary, and then the function body would have never
3161 changed the value of P. However, now, we will be
3162 constructing VAR directly. The constructor body may
3163 change its value multiple times as it is being
3164 constructed. Therefore, it must not be TREE_READONLY;
3165 the back-end assumes that TREE_READONLY variable is
3166 assigned to only once. */
3167 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
3168 TREE_READONLY (var
) = 0;
3170 /* If there is no setup required and we are in SSA, take the easy route
3171 replacing all SSA names representing the function parameter by the
3172 SSA name passed to function.
3174 We need to construct map for the variable anyway as it might be used
3175 in different SSA names when parameter is set in function.
3177 Do replacement at -O0 for const arguments replaced by constant.
3178 This is important for builtin_constant_p and other construct requiring
3179 constant argument to be visible in inlined function body. */
3180 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
3182 || (TREE_READONLY (p
)
3183 && is_gimple_min_invariant (rhs
)))
3184 && (TREE_CODE (rhs
) == SSA_NAME
3185 || is_gimple_min_invariant (rhs
))
3186 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
3188 insert_decl_map (id
, def
, rhs
);
3189 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3192 /* If the value of argument is never used, don't care about initializing
3194 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
3196 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
3197 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3200 /* Initialize this VAR_DECL from the equivalent argument. Convert
3201 the argument to the proper type in case it was promoted. */
3204 if (rhs
== error_mark_node
)
3206 insert_decl_map (id
, p
, var
);
3207 return insert_init_debug_bind (id
, bb
, var
, rhs
, NULL
);
3210 STRIP_USELESS_TYPE_CONVERSION (rhs
);
3212 /* If we are in SSA form properly remap the default definition
3213 or assign to a dummy SSA name if the parameter is unused and
3214 we are not optimizing. */
3215 if (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
3219 def
= remap_ssa_name (def
, id
);
3220 init_stmt
= gimple_build_assign (def
, rhs
);
3221 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
3222 set_ssa_default_def (cfun
, var
, NULL
);
3226 def
= make_ssa_name (var
);
3227 init_stmt
= gimple_build_assign (def
, rhs
);
3231 init_stmt
= gimple_build_assign (var
, rhs
);
3233 if (bb
&& init_stmt
)
3234 insert_init_stmt (id
, bb
, init_stmt
);
3239 /* Generate code to initialize the parameters of the function at the
3240 top of the stack in ID from the GIMPLE_CALL STMT. */
3243 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
3244 tree fn
, basic_block bb
)
3249 tree vars
= NULL_TREE
;
3250 tree static_chain
= gimple_call_chain (stmt
);
3252 /* Figure out what the parameters are. */
3253 parms
= DECL_ARGUMENTS (fn
);
3255 /* Loop through the parameter declarations, replacing each with an
3256 equivalent VAR_DECL, appropriately initialized. */
3257 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3260 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
3261 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
3263 /* After remapping parameters remap their types. This has to be done
3264 in a second loop over all parameters to appropriately remap
3265 variable sized arrays when the size is specified in a
3266 parameter following the array. */
3267 for (p
= parms
, i
= 0; p
; p
= DECL_CHAIN (p
), i
++)
3269 tree
*varp
= id
->decl_map
->get (p
);
3271 && TREE_CODE (*varp
) == VAR_DECL
)
3273 tree def
= (gimple_in_ssa_p (cfun
) && is_gimple_reg (p
)
3274 ? ssa_default_def (id
->src_cfun
, p
) : NULL
);
3276 TREE_TYPE (var
) = remap_type (TREE_TYPE (var
), id
);
3277 /* Also remap the default definition if it was remapped
3278 to the default definition of the parameter replacement
3279 by the parameter setup. */
3282 tree
*defp
= id
->decl_map
->get (def
);
3284 && TREE_CODE (*defp
) == SSA_NAME
3285 && SSA_NAME_VAR (*defp
) == var
)
3286 TREE_TYPE (*defp
) = TREE_TYPE (var
);
3291 /* Initialize the static chain. */
3292 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
3293 gcc_assert (fn
!= current_function_decl
);
3296 /* No static chain? Seems like a bug in tree-nested.c. */
3297 gcc_assert (static_chain
);
3299 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
3302 declare_inline_vars (id
->block
, vars
);
3306 /* Declare a return variable to replace the RESULT_DECL for the
3307 function we are calling. An appropriate DECL_STMT is returned.
3308 The USE_STMT is filled to contain a use of the declaration to
3309 indicate the return value of the function.
3311 RETURN_SLOT, if non-null is place where to store the result. It
3312 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3313 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3315 RETURN_BOUNDS holds a destination for returned bounds.
3317 The return value is a (possibly null) value that holds the result
3318 as seen by the caller. */
3321 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
3322 tree return_bounds
, basic_block entry_bb
)
3324 tree callee
= id
->src_fn
;
3325 tree result
= DECL_RESULT (callee
);
3326 tree callee_type
= TREE_TYPE (result
);
3330 /* Handle type-mismatches in the function declaration return type
3331 vs. the call expression. */
3333 caller_type
= TREE_TYPE (modify_dest
);
3335 caller_type
= TREE_TYPE (TREE_TYPE (callee
));
3337 /* We don't need to do anything for functions that don't return anything. */
3338 if (VOID_TYPE_P (callee_type
))
3341 /* If there was a return slot, then the return value is the
3342 dereferenced address of that object. */
3345 /* The front end shouldn't have used both return_slot and
3346 a modify expression. */
3347 gcc_assert (!modify_dest
);
3348 if (DECL_BY_REFERENCE (result
))
3350 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
3351 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
3353 /* We are going to construct *&return_slot and we can't do that
3354 for variables believed to be not addressable.
3356 FIXME: This check possibly can match, because values returned
3357 via return slot optimization are not believed to have address
3358 taken by alias analysis. */
3359 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
3360 var
= return_slot_addr
;
3365 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
3366 if (TREE_ADDRESSABLE (result
))
3367 mark_addressable (var
);
3369 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3370 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3371 && !DECL_GIMPLE_REG_P (result
)
3373 DECL_GIMPLE_REG_P (var
) = 0;
3378 /* All types requiring non-trivial constructors should have been handled. */
3379 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
3381 /* Attempt to avoid creating a new temporary variable. */
3383 && TREE_CODE (modify_dest
) != SSA_NAME
)
3385 bool use_it
= false;
3387 /* We can't use MODIFY_DEST if there's type promotion involved. */
3388 if (!useless_type_conversion_p (callee_type
, caller_type
))
3391 /* ??? If we're assigning to a variable sized type, then we must
3392 reuse the destination variable, because we've no good way to
3393 create variable sized temporaries at this point. */
3394 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
3397 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3398 reuse it as the result of the call directly. Don't do this if
3399 it would promote MODIFY_DEST to addressable. */
3400 else if (TREE_ADDRESSABLE (result
))
3404 tree base_m
= get_base_address (modify_dest
);
3406 /* If the base isn't a decl, then it's a pointer, and we don't
3407 know where that's going to go. */
3408 if (!DECL_P (base_m
))
3410 else if (is_global_var (base_m
))
3412 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
3413 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
3414 && !DECL_GIMPLE_REG_P (result
)
3415 && DECL_GIMPLE_REG_P (base_m
))
3417 else if (!TREE_ADDRESSABLE (base_m
))
3429 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
3431 var
= copy_result_decl_to_var (result
, id
);
3432 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
3434 /* Do not have the rest of GCC warn about this variable as it should
3435 not be visible to the user. */
3436 TREE_NO_WARNING (var
) = 1;
3438 declare_inline_vars (id
->block
, var
);
3440 /* Build the use expr. If the return type of the function was
3441 promoted, convert it back to the expected type. */
3443 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
3445 /* If we can match up types by promotion/demotion do so. */
3446 if (fold_convertible_p (caller_type
, var
))
3447 use
= fold_convert (caller_type
, var
);
3450 /* ??? For valid programs we should not end up here.
3451 Still if we end up with truly mismatched types here, fall back
3452 to using a MEM_REF to not leak invalid GIMPLE to the following
3454 /* Prevent var from being written into SSA form. */
3455 if (TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
3456 || TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
)
3457 DECL_GIMPLE_REG_P (var
) = false;
3458 else if (is_gimple_reg_type (TREE_TYPE (var
)))
3459 TREE_ADDRESSABLE (var
) = true;
3460 use
= fold_build2 (MEM_REF
, caller_type
,
3461 build_fold_addr_expr (var
),
3462 build_int_cst (ptr_type_node
, 0));
3466 STRIP_USELESS_TYPE_CONVERSION (use
);
3468 if (DECL_BY_REFERENCE (result
))
3470 TREE_ADDRESSABLE (var
) = 1;
3471 var
= build_fold_addr_expr (var
);
3475 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3476 way, when the RESULT_DECL is encountered, it will be
3477 automatically replaced by the VAR_DECL.
3479 When returning by reference, ensure that RESULT_DECL remaps to
3481 if (DECL_BY_REFERENCE (result
)
3482 && !is_gimple_val (var
))
3484 tree temp
= create_tmp_var (TREE_TYPE (result
), "retvalptr");
3485 insert_decl_map (id
, result
, temp
);
3486 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3487 it's default_def SSA_NAME. */
3488 if (gimple_in_ssa_p (id
->src_cfun
)
3489 && is_gimple_reg (result
))
3491 temp
= make_ssa_name (temp
);
3492 insert_decl_map (id
, ssa_default_def (id
->src_cfun
, result
), temp
);
3494 insert_init_stmt (id
, entry_bb
, gimple_build_assign (temp
, var
));
3497 insert_decl_map (id
, result
, var
);
3499 /* Remember this so we can ignore it in remap_decls. */
3502 /* If returned bounds are used, then make var for them. */
3505 tree bndtemp
= create_tmp_var (pointer_bounds_type_node
, "retbnd");
3506 DECL_SEEN_IN_BIND_EXPR_P (bndtemp
) = 1;
3507 TREE_NO_WARNING (bndtemp
) = 1;
3508 declare_inline_vars (id
->block
, bndtemp
);
3510 id
->retbnd
= bndtemp
;
3511 insert_init_stmt (id
, entry_bb
,
3512 gimple_build_assign (bndtemp
, chkp_get_zero_bounds_var ()));
3518 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
3519 to a local label. */
3522 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
3525 tree fn
= (tree
) fnp
;
3527 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
3536 /* Determine if the function can be copied. If so return NULL. If
3537 not return a string describng the reason for failure. */
3540 copy_forbidden (struct function
*fun
, tree fndecl
)
3542 const char *reason
= fun
->cannot_be_copied_reason
;
3546 /* Only examine the function once. */
3547 if (fun
->cannot_be_copied_set
)
3550 /* We cannot copy a function that receives a non-local goto
3551 because we cannot remap the destination label used in the
3552 function that is performing the non-local goto. */
3553 /* ??? Actually, this should be possible, if we work at it.
3554 No doubt there's just a handful of places that simply
3555 assume it doesn't happen and don't substitute properly. */
3556 if (fun
->has_nonlocal_label
)
3558 reason
= G_("function %q+F can never be copied "
3559 "because it receives a non-local goto");
3563 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
3564 if (TREE_CODE (decl
) == VAR_DECL
3565 && TREE_STATIC (decl
)
3566 && !DECL_EXTERNAL (decl
)
3567 && DECL_INITIAL (decl
)
3568 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
3569 has_label_address_in_static_1
,
3572 reason
= G_("function %q+F can never be copied because it saves "
3573 "address of local label in a static variable");
3578 fun
->cannot_be_copied_reason
= reason
;
3579 fun
->cannot_be_copied_set
= true;
3584 static const char *inline_forbidden_reason
;
3586 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3587 iff a function can not be inlined. Also sets the reason why. */
3590 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
3591 struct walk_stmt_info
*wip
)
3593 tree fn
= (tree
) wip
->info
;
3595 gimple stmt
= gsi_stmt (*gsi
);
3597 switch (gimple_code (stmt
))
3600 /* Refuse to inline alloca call unless user explicitly forced so as
3601 this may change program's memory overhead drastically when the
3602 function using alloca is called in loop. In GCC present in
3603 SPEC2000 inlining into schedule_block cause it to require 2GB of
3604 RAM instead of 256MB. Don't do so for alloca calls emitted for
3605 VLA objects as those can't cause unbounded growth (they're always
3606 wrapped inside stack_save/stack_restore regions. */
3607 if (gimple_alloca_call_p (stmt
)
3608 && !gimple_call_alloca_for_var_p (as_a
<gcall
*> (stmt
))
3609 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
3611 inline_forbidden_reason
3612 = G_("function %q+F can never be inlined because it uses "
3613 "alloca (override using the always_inline attribute)");
3614 *handled_ops_p
= true;
3618 t
= gimple_call_fndecl (stmt
);
3622 /* We cannot inline functions that call setjmp. */
3623 if (setjmp_call_p (t
))
3625 inline_forbidden_reason
3626 = G_("function %q+F can never be inlined because it uses setjmp");
3627 *handled_ops_p
= true;
3631 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
3632 switch (DECL_FUNCTION_CODE (t
))
3634 /* We cannot inline functions that take a variable number of
3636 case BUILT_IN_VA_START
:
3637 case BUILT_IN_NEXT_ARG
:
3638 case BUILT_IN_VA_END
:
3639 inline_forbidden_reason
3640 = G_("function %q+F can never be inlined because it "
3641 "uses variable argument lists");
3642 *handled_ops_p
= true;
3645 case BUILT_IN_LONGJMP
:
3646 /* We can't inline functions that call __builtin_longjmp at
3647 all. The non-local goto machinery really requires the
3648 destination be in a different function. If we allow the
3649 function calling __builtin_longjmp to be inlined into the
3650 function calling __builtin_setjmp, Things will Go Awry. */
3651 inline_forbidden_reason
3652 = G_("function %q+F can never be inlined because "
3653 "it uses setjmp-longjmp exception handling");
3654 *handled_ops_p
= true;
3657 case BUILT_IN_NONLOCAL_GOTO
:
3659 inline_forbidden_reason
3660 = G_("function %q+F can never be inlined because "
3661 "it uses non-local goto");
3662 *handled_ops_p
= true;
3665 case BUILT_IN_RETURN
:
3666 case BUILT_IN_APPLY_ARGS
:
3667 /* If a __builtin_apply_args caller would be inlined,
3668 it would be saving arguments of the function it has
3669 been inlined into. Similarly __builtin_return would
3670 return from the function the inline has been inlined into. */
3671 inline_forbidden_reason
3672 = G_("function %q+F can never be inlined because "
3673 "it uses __builtin_return or __builtin_apply_args");
3674 *handled_ops_p
= true;
3683 t
= gimple_goto_dest (stmt
);
3685 /* We will not inline a function which uses computed goto. The
3686 addresses of its local labels, which may be tucked into
3687 global storage, are of course not constant across
3688 instantiations, which causes unexpected behavior. */
3689 if (TREE_CODE (t
) != LABEL_DECL
)
3691 inline_forbidden_reason
3692 = G_("function %q+F can never be inlined "
3693 "because it contains a computed goto");
3694 *handled_ops_p
= true;
3703 *handled_ops_p
= false;
3707 /* Return true if FNDECL is a function that cannot be inlined into
3711 inline_forbidden_p (tree fndecl
)
3713 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
3714 struct walk_stmt_info wi
;
3716 bool forbidden_p
= false;
3718 /* First check for shared reasons not to copy the code. */
3719 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
3720 if (inline_forbidden_reason
!= NULL
)
3723 /* Next, walk the statements of the function looking for
3724 constraucts we can't handle, or are non-optimal for inlining. */
3725 hash_set
<tree
> visited_nodes
;
3726 memset (&wi
, 0, sizeof (wi
));
3727 wi
.info
= (void *) fndecl
;
3728 wi
.pset
= &visited_nodes
;
3730 FOR_EACH_BB_FN (bb
, fun
)
3733 gimple_seq seq
= bb_seq (bb
);
3734 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
3735 forbidden_p
= (ret
!= NULL
);
3743 /* Return false if the function FNDECL cannot be inlined on account of its
3744 attributes, true otherwise. */
3746 function_attribute_inlinable_p (const_tree fndecl
)
3748 if (targetm
.attribute_table
)
3752 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
3754 const_tree name
= TREE_PURPOSE (a
);
3757 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
3758 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
3759 return targetm
.function_attribute_inlinable_p (fndecl
);
3766 /* Returns nonzero if FN is a function that does not have any
3767 fundamental inline blocking properties. */
3770 tree_inlinable_function_p (tree fn
)
3772 bool inlinable
= true;
3776 /* If we've already decided this function shouldn't be inlined,
3777 there's no need to check again. */
3778 if (DECL_UNINLINABLE (fn
))
3781 /* We only warn for functions declared `inline' by the user. */
3782 do_warning
= (warn_inline
3783 && DECL_DECLARED_INLINE_P (fn
)
3784 && !DECL_NO_INLINE_WARNING_P (fn
)
3785 && !DECL_IN_SYSTEM_HEADER (fn
));
3787 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
3790 && always_inline
== NULL
)
3793 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3794 "is suppressed using -fno-inline", fn
);
3798 else if (!function_attribute_inlinable_p (fn
))
3801 warning (OPT_Winline
, "function %q+F can never be inlined because it "
3802 "uses attributes conflicting with inlining", fn
);
3806 else if (inline_forbidden_p (fn
))
3808 /* See if we should warn about uninlinable functions. Previously,
3809 some of these warnings would be issued while trying to expand
3810 the function inline, but that would cause multiple warnings
3811 about functions that would for example call alloca. But since
3812 this a property of the function, just one warning is enough.
3813 As a bonus we can now give more details about the reason why a
3814 function is not inlinable. */
3816 error (inline_forbidden_reason
, fn
);
3817 else if (do_warning
)
3818 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
3823 /* Squirrel away the result so that we don't have to check again. */
3824 DECL_UNINLINABLE (fn
) = !inlinable
;
3829 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
3830 word size and take possible memcpy call into account and return
3831 cost based on whether optimizing for size or speed according to SPEED_P. */
3834 estimate_move_cost (tree type
, bool ARG_UNUSED (speed_p
))
3838 gcc_assert (!VOID_TYPE_P (type
));
3840 if (TREE_CODE (type
) == VECTOR_TYPE
)
3842 machine_mode inner
= TYPE_MODE (TREE_TYPE (type
));
3844 = targetm
.vectorize
.preferred_simd_mode (inner
);
3845 int simd_mode_size
= GET_MODE_SIZE (simd
);
3846 return ((GET_MODE_SIZE (TYPE_MODE (type
)) + simd_mode_size
- 1)
3850 size
= int_size_in_bytes (type
);
3852 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (speed_p
))
3853 /* Cost of a memcpy call, 3 arguments and the call. */
3856 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
3859 /* Returns cost of operation CODE, according to WEIGHTS */
3862 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
3863 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
3867 /* These are "free" conversions, or their presumed cost
3868 is folded into other operations. */
3873 case VIEW_CONVERT_EXPR
:
3876 /* Assign cost of 1 to usual operations.
3877 ??? We may consider mapping RTL costs to this. */
3883 case POINTER_PLUS_EXPR
:
3886 case MULT_HIGHPART_EXPR
:
3889 case ADDR_SPACE_CONVERT_EXPR
:
3890 case FIXED_CONVERT_EXPR
:
3891 case FIX_TRUNC_EXPR
:
3909 case TRUTH_ANDIF_EXPR
:
3910 case TRUTH_ORIF_EXPR
:
3911 case TRUTH_AND_EXPR
:
3913 case TRUTH_XOR_EXPR
:
3914 case TRUTH_NOT_EXPR
:
3923 case UNORDERED_EXPR
:
3934 case PREDECREMENT_EXPR
:
3935 case PREINCREMENT_EXPR
:
3936 case POSTDECREMENT_EXPR
:
3937 case POSTINCREMENT_EXPR
:
3939 case REALIGN_LOAD_EXPR
:
3941 case REDUC_MAX_EXPR
:
3942 case REDUC_MIN_EXPR
:
3943 case REDUC_PLUS_EXPR
:
3944 case WIDEN_SUM_EXPR
:
3945 case WIDEN_MULT_EXPR
:
3948 case WIDEN_MULT_PLUS_EXPR
:
3949 case WIDEN_MULT_MINUS_EXPR
:
3950 case WIDEN_LSHIFT_EXPR
:
3952 case VEC_WIDEN_MULT_HI_EXPR
:
3953 case VEC_WIDEN_MULT_LO_EXPR
:
3954 case VEC_WIDEN_MULT_EVEN_EXPR
:
3955 case VEC_WIDEN_MULT_ODD_EXPR
:
3956 case VEC_UNPACK_HI_EXPR
:
3957 case VEC_UNPACK_LO_EXPR
:
3958 case VEC_UNPACK_FLOAT_HI_EXPR
:
3959 case VEC_UNPACK_FLOAT_LO_EXPR
:
3960 case VEC_PACK_TRUNC_EXPR
:
3961 case VEC_PACK_SAT_EXPR
:
3962 case VEC_PACK_FIX_TRUNC_EXPR
:
3963 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3964 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3968 /* Few special cases of expensive operations. This is useful
3969 to avoid inlining on functions having too many of these. */
3970 case TRUNC_DIV_EXPR
:
3972 case FLOOR_DIV_EXPR
:
3973 case ROUND_DIV_EXPR
:
3974 case EXACT_DIV_EXPR
:
3975 case TRUNC_MOD_EXPR
:
3977 case FLOOR_MOD_EXPR
:
3978 case ROUND_MOD_EXPR
:
3980 if (TREE_CODE (op2
) != INTEGER_CST
)
3981 return weights
->div_mod_cost
;
3985 /* We expect a copy assignment with no operator. */
3986 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
3992 /* Estimate number of instructions that will be created by expanding
3993 the statements in the statement sequence STMTS.
3994 WEIGHTS contains weights attributed to various constructs. */
3997 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
4000 gimple_stmt_iterator gsi
;
4003 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4004 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4010 /* Estimate number of instructions that will be created by expanding STMT.
4011 WEIGHTS contains weights attributed to various constructs. */
4014 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
4017 enum gimple_code code
= gimple_code (stmt
);
4024 /* Try to estimate the cost of assignments. We have three cases to
4026 1) Simple assignments to registers;
4027 2) Stores to things that must live in memory. This includes
4028 "normal" stores to scalars, but also assignments of large
4029 structures, or constructors of big arrays;
4031 Let us look at the first two cases, assuming we have "a = b + C":
4032 <GIMPLE_ASSIGN <var_decl "a">
4033 <plus_expr <var_decl "b"> <constant C>>
4034 If "a" is a GIMPLE register, the assignment to it is free on almost
4035 any target, because "a" usually ends up in a real register. Hence
4036 the only cost of this expression comes from the PLUS_EXPR, and we
4037 can ignore the GIMPLE_ASSIGN.
4038 If "a" is not a GIMPLE register, the assignment to "a" will most
4039 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4040 of moving something into "a", which we compute using the function
4041 estimate_move_cost. */
4042 if (gimple_clobber_p (stmt
))
4043 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4045 lhs
= gimple_assign_lhs (stmt
);
4046 rhs
= gimple_assign_rhs1 (stmt
);
4050 /* Account for the cost of moving to / from memory. */
4051 if (gimple_store_p (stmt
))
4052 cost
+= estimate_move_cost (TREE_TYPE (lhs
), weights
->time_based
);
4053 if (gimple_assign_load_p (stmt
))
4054 cost
+= estimate_move_cost (TREE_TYPE (rhs
), weights
->time_based
);
4056 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
4057 gimple_assign_rhs1 (stmt
),
4058 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
4059 == GIMPLE_BINARY_RHS
4060 ? gimple_assign_rhs2 (stmt
) : NULL
);
4064 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
4065 gimple_op (stmt
, 0),
4066 gimple_op (stmt
, 1));
4071 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
4072 /* Take into account cost of the switch + guess 2 conditional jumps for
4075 TODO: once the switch expansion logic is sufficiently separated, we can
4076 do better job on estimating cost of the switch. */
4077 if (weights
->time_based
)
4078 cost
= floor_log2 (gimple_switch_num_labels (switch_stmt
)) * 2;
4080 cost
= gimple_switch_num_labels (switch_stmt
) * 2;
4088 if (gimple_call_internal_p (stmt
))
4090 else if ((decl
= gimple_call_fndecl (stmt
))
4091 && DECL_BUILT_IN (decl
))
4093 /* Do not special case builtins where we see the body.
4094 This just confuse inliner. */
4095 struct cgraph_node
*node
;
4096 if (!(node
= cgraph_node::get (decl
))
4097 || node
->definition
)
4099 /* For buitins that are likely expanded to nothing or
4100 inlined do not account operand costs. */
4101 else if (is_simple_builtin (decl
))
4103 else if (is_inexpensive_builtin (decl
))
4104 return weights
->target_builtin_call_cost
;
4105 else if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
4107 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4108 specialize the cheap expansion we do here.
4109 ??? This asks for a more general solution. */
4110 switch (DECL_FUNCTION_CODE (decl
))
4115 if (TREE_CODE (gimple_call_arg (stmt
, 1)) == REAL_CST
4116 && REAL_VALUES_EQUAL
4117 (TREE_REAL_CST (gimple_call_arg (stmt
, 1)), dconst2
))
4118 return estimate_operator_cost
4119 (MULT_EXPR
, weights
, gimple_call_arg (stmt
, 0),
4120 gimple_call_arg (stmt
, 0));
4129 cost
= decl
? weights
->call_cost
: weights
->indirect_call_cost
;
4130 if (gimple_call_lhs (stmt
))
4131 cost
+= estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt
)),
4132 weights
->time_based
);
4133 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4135 tree arg
= gimple_call_arg (stmt
, i
);
4136 cost
+= estimate_move_cost (TREE_TYPE (arg
),
4137 weights
->time_based
);
4143 return weights
->return_cost
;
4149 case GIMPLE_PREDICT
:
4155 int count
= asm_str_count (gimple_asm_string (as_a
<gasm
*> (stmt
)));
4156 /* 1000 means infinity. This avoids overflows later
4157 with very long asm statements. */
4164 /* This is either going to be an external function call with one
4165 argument, or two register copy statements plus a goto. */
4168 case GIMPLE_EH_DISPATCH
:
4169 /* ??? This is going to turn into a switch statement. Ideally
4170 we'd have a look at the eh region and estimate the number of
4175 return estimate_num_insns_seq (
4176 gimple_bind_body (as_a
<gbind
*> (stmt
)),
4179 case GIMPLE_EH_FILTER
:
4180 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
4183 return estimate_num_insns_seq (gimple_catch_handler (
4184 as_a
<gcatch
*> (stmt
)),
4188 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
4189 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
4191 /* OpenMP directives are generally very expensive. */
4193 case GIMPLE_OMP_RETURN
:
4194 case GIMPLE_OMP_SECTIONS_SWITCH
:
4195 case GIMPLE_OMP_ATOMIC_STORE
:
4196 case GIMPLE_OMP_CONTINUE
:
4197 /* ...except these, which are cheap. */
4200 case GIMPLE_OMP_ATOMIC_LOAD
:
4201 return weights
->omp_cost
;
4203 case GIMPLE_OMP_FOR
:
4204 return (weights
->omp_cost
4205 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
4206 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
4208 case GIMPLE_OMP_PARALLEL
:
4209 case GIMPLE_OMP_TASK
:
4210 case GIMPLE_OMP_CRITICAL
:
4211 case GIMPLE_OMP_MASTER
:
4212 case GIMPLE_OMP_TASKGROUP
:
4213 case GIMPLE_OMP_ORDERED
:
4214 case GIMPLE_OMP_SECTION
:
4215 case GIMPLE_OMP_SECTIONS
:
4216 case GIMPLE_OMP_SINGLE
:
4217 case GIMPLE_OMP_TARGET
:
4218 case GIMPLE_OMP_TEAMS
:
4219 return (weights
->omp_cost
4220 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
4222 case GIMPLE_TRANSACTION
:
4223 return (weights
->tm_cost
4224 + estimate_num_insns_seq (gimple_transaction_body (
4225 as_a
<gtransaction
*> (stmt
)),
4235 /* Estimate number of instructions that will be created by expanding
4236 function FNDECL. WEIGHTS contains weights attributed to various
4240 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
4242 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
4243 gimple_stmt_iterator bsi
;
4247 gcc_assert (my_function
&& my_function
->cfg
);
4248 FOR_EACH_BB_FN (bb
, my_function
)
4250 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4251 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
4258 /* Initializes weights used by estimate_num_insns. */
4261 init_inline_once (void)
4263 eni_size_weights
.call_cost
= 1;
4264 eni_size_weights
.indirect_call_cost
= 3;
4265 eni_size_weights
.target_builtin_call_cost
= 1;
4266 eni_size_weights
.div_mod_cost
= 1;
4267 eni_size_weights
.omp_cost
= 40;
4268 eni_size_weights
.tm_cost
= 10;
4269 eni_size_weights
.time_based
= false;
4270 eni_size_weights
.return_cost
= 1;
4272 /* Estimating time for call is difficult, since we have no idea what the
4273 called function does. In the current uses of eni_time_weights,
4274 underestimating the cost does less harm than overestimating it, so
4275 we choose a rather small value here. */
4276 eni_time_weights
.call_cost
= 10;
4277 eni_time_weights
.indirect_call_cost
= 15;
4278 eni_time_weights
.target_builtin_call_cost
= 1;
4279 eni_time_weights
.div_mod_cost
= 10;
4280 eni_time_weights
.omp_cost
= 40;
4281 eni_time_weights
.tm_cost
= 40;
4282 eni_time_weights
.time_based
= true;
4283 eni_time_weights
.return_cost
= 2;
4286 /* Estimate the number of instructions in a gimple_seq. */
4289 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
4291 gimple_stmt_iterator gsi
;
4293 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4294 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
4300 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4303 prepend_lexical_block (tree current_block
, tree new_block
)
4305 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
4306 BLOCK_SUBBLOCKS (current_block
) = new_block
;
4307 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
4310 /* Add local variables from CALLEE to CALLER. */
4313 add_local_variables (struct function
*callee
, struct function
*caller
,
4319 FOR_EACH_LOCAL_DECL (callee
, ix
, var
)
4320 if (!can_be_nonlocal (var
, id
))
4322 tree new_var
= remap_decl (var
, id
);
4324 /* Remap debug-expressions. */
4325 if (TREE_CODE (new_var
) == VAR_DECL
4326 && DECL_HAS_DEBUG_EXPR_P (var
)
4329 tree tem
= DECL_DEBUG_EXPR (var
);
4330 bool old_regimplify
= id
->regimplify
;
4331 id
->remapping_type_depth
++;
4332 walk_tree (&tem
, copy_tree_body_r
, id
, NULL
);
4333 id
->remapping_type_depth
--;
4334 id
->regimplify
= old_regimplify
;
4335 SET_DECL_DEBUG_EXPR (new_var
, tem
);
4336 DECL_HAS_DEBUG_EXPR_P (new_var
) = 1;
4338 add_local_decl (caller
, new_var
);
4342 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4345 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
4349 hash_map
<tree
, tree
> *dst
;
4350 hash_map
<tree
, tree
> *st
= NULL
;
4353 tree return_bounds
= NULL
;
4354 location_t saved_location
;
4355 struct cgraph_edge
*cg_edge
;
4356 cgraph_inline_failed_t reason
;
4357 basic_block return_block
;
4359 gimple_stmt_iterator gsi
, stmt_gsi
;
4360 bool successfully_inlined
= FALSE
;
4361 bool purge_dead_abnormal_edges
;
4365 /* Set input_location here so we get the right instantiation context
4366 if we call instantiate_decl from inlinable_function_p. */
4367 /* FIXME: instantiate_decl isn't called by inlinable_function_p. */
4368 saved_location
= input_location
;
4369 input_location
= gimple_location (stmt
);
4371 /* From here on, we're only interested in CALL_EXPRs. */
4372 call_stmt
= dyn_cast
<gcall
*> (stmt
);
4376 cg_edge
= id
->dst_node
->get_edge (stmt
);
4377 gcc_checking_assert (cg_edge
);
4378 /* First, see if we can figure out what function is being called.
4379 If we cannot, then there is no hope of inlining the function. */
4380 if (cg_edge
->indirect_unknown_callee
)
4382 fn
= cg_edge
->callee
->decl
;
4383 gcc_checking_assert (fn
);
4385 /* If FN is a declaration of a function in a nested scope that was
4386 globally declared inline, we don't set its DECL_INITIAL.
4387 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4388 C++ front-end uses it for cdtors to refer to their internal
4389 declarations, that are not real functions. Fortunately those
4390 don't have trees to be saved, so we can tell by checking their
4392 if (!DECL_INITIAL (fn
)
4393 && DECL_ABSTRACT_ORIGIN (fn
)
4394 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
4395 fn
= DECL_ABSTRACT_ORIGIN (fn
);
4397 /* Don't try to inline functions that are not well-suited to inlining. */
4398 if (cg_edge
->inline_failed
)
4400 reason
= cg_edge
->inline_failed
;
4401 /* If this call was originally indirect, we do not want to emit any
4402 inlining related warnings or sorry messages because there are no
4403 guarantees regarding those. */
4404 if (cg_edge
->indirect_inlining_edge
)
4407 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
4408 /* For extern inline functions that get redefined we always
4409 silently ignored always_inline flag. Better behaviour would
4410 be to be able to keep both bodies and use extern inline body
4411 for inlining, but we can't do that because frontends overwrite
4413 && !cg_edge
->callee
->local
.redefined_extern_inline
4414 /* During early inline pass, report only when optimization is
4416 && (symtab
->global_info_ready
4418 || cgraph_inline_failed_type (reason
) == CIF_FINAL_ERROR
)
4419 /* PR 20090218-1_0.c. Body can be provided by another module. */
4420 && (reason
!= CIF_BODY_NOT_AVAILABLE
|| !flag_generate_lto
))
4422 error ("inlining failed in call to always_inline %q+F: %s", fn
,
4423 cgraph_inline_failed_string (reason
));
4424 error ("called from here");
4426 else if (warn_inline
4427 && DECL_DECLARED_INLINE_P (fn
)
4428 && !DECL_NO_INLINE_WARNING_P (fn
)
4429 && !DECL_IN_SYSTEM_HEADER (fn
)
4430 && reason
!= CIF_UNSPECIFIED
4431 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
4432 /* Do not warn about not inlined recursive calls. */
4433 && !cg_edge
->recursive_p ()
4434 /* Avoid warnings during early inline pass. */
4435 && symtab
->global_info_ready
)
4437 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
4438 fn
, _(cgraph_inline_failed_string (reason
)));
4439 warning (OPT_Winline
, "called from here");
4443 fn
= cg_edge
->callee
->decl
;
4444 cg_edge
->callee
->get_untransformed_body ();
4446 #ifdef ENABLE_CHECKING
4447 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
4448 cg_edge
->callee
->verify ();
4451 /* We will be inlining this callee. */
4452 id
->eh_lp_nr
= lookup_stmt_eh_lp (stmt
);
4453 id
->assign_stmts
.create (0);
4455 /* Update the callers EH personality. */
4456 if (DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
))
4457 DECL_FUNCTION_PERSONALITY (cg_edge
->caller
->decl
)
4458 = DECL_FUNCTION_PERSONALITY (cg_edge
->callee
->decl
);
4460 /* Split the block holding the GIMPLE_CALL. */
4461 e
= split_block (bb
, stmt
);
4463 return_block
= e
->dest
;
4466 /* split_block splits after the statement; work around this by
4467 moving the call into the second block manually. Not pretty,
4468 but seems easier than doing the CFG manipulation by hand
4469 when the GIMPLE_CALL is in the last statement of BB. */
4470 stmt_gsi
= gsi_last_bb (bb
);
4471 gsi_remove (&stmt_gsi
, false);
4473 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4474 been the source of abnormal edges. In this case, schedule
4475 the removal of dead abnormal edges. */
4476 gsi
= gsi_start_bb (return_block
);
4477 if (gsi_end_p (gsi
))
4479 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
4480 purge_dead_abnormal_edges
= true;
4484 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
4485 purge_dead_abnormal_edges
= false;
4488 stmt_gsi
= gsi_start_bb (return_block
);
4490 /* Build a block containing code to initialize the arguments, the
4491 actual inline expansion of the body, and a label for the return
4492 statements within the function to jump to. The type of the
4493 statement expression is the return type of the function call.
4494 ??? If the call does not have an associated block then we will
4495 remap all callee blocks to NULL, effectively dropping most of
4496 its debug information. This should only happen for calls to
4497 artificial decls inserted by the compiler itself. We need to
4498 either link the inlined blocks into the caller block tree or
4499 not refer to them in any way to not break GC for locations. */
4500 if (gimple_block (stmt
))
4502 id
->block
= make_node (BLOCK
);
4503 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
4504 BLOCK_SOURCE_LOCATION (id
->block
) = LOCATION_LOCUS (input_location
);
4505 prepend_lexical_block (gimple_block (stmt
), id
->block
);
4508 /* Local declarations will be replaced by their equivalents in this
4511 id
->decl_map
= new hash_map
<tree
, tree
>;
4512 dst
= id
->debug_map
;
4513 id
->debug_map
= NULL
;
4515 /* Record the function we are about to inline. */
4517 id
->src_node
= cg_edge
->callee
;
4518 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4519 id
->call_stmt
= stmt
;
4521 gcc_assert (!id
->src_cfun
->after_inlining
);
4524 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
4526 gimple_stmt_iterator si
= gsi_last_bb (bb
);
4527 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
4531 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
4533 if (DECL_INITIAL (fn
))
4535 if (gimple_block (stmt
))
4539 prepend_lexical_block (id
->block
,
4540 remap_blocks (DECL_INITIAL (fn
), id
));
4541 gcc_checking_assert (BLOCK_SUBBLOCKS (id
->block
)
4542 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id
->block
))
4544 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4545 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4546 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4547 under it. The parameters can be then evaluated in the debugger,
4548 but don't show in backtraces. */
4549 for (var
= &BLOCK_VARS (BLOCK_SUBBLOCKS (id
->block
)); *var
; )
4550 if (TREE_CODE (DECL_ORIGIN (*var
)) == PARM_DECL
)
4553 *var
= TREE_CHAIN (v
);
4554 TREE_CHAIN (v
) = BLOCK_VARS (id
->block
);
4555 BLOCK_VARS (id
->block
) = v
;
4558 var
= &TREE_CHAIN (*var
);
4561 remap_blocks_to_null (DECL_INITIAL (fn
), id
);
4564 /* Return statements in the function body will be replaced by jumps
4565 to the RET_LABEL. */
4566 gcc_assert (DECL_INITIAL (fn
));
4567 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
4569 /* Find the LHS to which the result of this call is assigned. */
4571 if (gimple_call_lhs (stmt
))
4573 modify_dest
= gimple_call_lhs (stmt
);
4575 /* Remember where to copy returned bounds. */
4576 if (gimple_call_with_bounds_p (stmt
)
4577 && TREE_CODE (modify_dest
) == SSA_NAME
)
4579 gcall
*retbnd
= chkp_retbnd_call_by_val (modify_dest
);
4582 return_bounds
= gimple_call_lhs (retbnd
);
4583 /* If returned bounds are not used then just
4584 remove unused call. */
4587 gimple_stmt_iterator iter
= gsi_for_stmt (retbnd
);
4588 gsi_remove (&iter
, true);
4593 /* The function which we are inlining might not return a value,
4594 in which case we should issue a warning that the function
4595 does not return a value. In that case the optimizers will
4596 see that the variable to which the value is assigned was not
4597 initialized. We do not want to issue a warning about that
4598 uninitialized variable. */
4599 if (DECL_P (modify_dest
))
4600 TREE_NO_WARNING (modify_dest
) = 1;
4602 if (gimple_call_return_slot_opt_p (call_stmt
))
4604 return_slot
= modify_dest
;
4611 /* If we are inlining a call to the C++ operator new, we don't want
4612 to use type based alias analysis on the return value. Otherwise
4613 we may get confused if the compiler sees that the inlined new
4614 function returns a pointer which was just deleted. See bug
4616 if (DECL_IS_OPERATOR_NEW (fn
))
4622 /* Declare the return variable for the function. */
4623 use_retvar
= declare_return_variable (id
, return_slot
, modify_dest
,
4626 /* Add local vars in this inlined callee to caller. */
4627 add_local_variables (id
->src_cfun
, cfun
, id
);
4629 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4631 fprintf (dump_file
, "Inlining ");
4632 print_generic_expr (dump_file
, id
->src_fn
, 0);
4633 fprintf (dump_file
, " to ");
4634 print_generic_expr (dump_file
, id
->dst_fn
, 0);
4635 fprintf (dump_file
, " with frequency %i\n", cg_edge
->frequency
);
4638 /* This is it. Duplicate the callee body. Assume callee is
4639 pre-gimplified. Note that we must not alter the caller
4640 function in any way before this point, as this CALL_EXPR may be
4641 a self-referential call; if we're calling ourselves, we need to
4642 duplicate our body before altering anything. */
4643 copy_body (id
, cg_edge
->callee
->count
,
4644 GCOV_COMPUTE_SCALE (cg_edge
->frequency
, CGRAPH_FREQ_BASE
),
4645 bb
, return_block
, NULL
);
4647 /* Reset the escaped solution. */
4648 if (cfun
->gimple_df
)
4649 pt_solution_reset (&cfun
->gimple_df
->escaped
);
4654 delete id
->debug_map
;
4655 id
->debug_map
= dst
;
4657 delete id
->decl_map
;
4660 /* Unlink the calls virtual operands before replacing it. */
4661 unlink_stmt_vdef (stmt
);
4662 if (gimple_vdef (stmt
)
4663 && TREE_CODE (gimple_vdef (stmt
)) == SSA_NAME
)
4664 release_ssa_name (gimple_vdef (stmt
));
4666 /* If the inlined function returns a result that we care about,
4667 substitute the GIMPLE_CALL with an assignment of the return
4668 variable to the LHS of the call. That is, if STMT was
4669 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4670 if (use_retvar
&& gimple_call_lhs (stmt
))
4672 gimple old_stmt
= stmt
;
4673 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
4674 gsi_replace (&stmt_gsi
, stmt
, false);
4675 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
4677 /* Copy bounds if we copy structure with bounds. */
4678 if (chkp_function_instrumented_p (id
->dst_fn
)
4679 && !BOUNDED_P (use_retvar
)
4680 && chkp_type_has_pointer (TREE_TYPE (use_retvar
)))
4681 id
->assign_stmts
.safe_push (stmt
);
4685 /* Handle the case of inlining a function with no return
4686 statement, which causes the return value to become undefined. */
4687 if (gimple_call_lhs (stmt
)
4688 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
4690 tree name
= gimple_call_lhs (stmt
);
4691 tree var
= SSA_NAME_VAR (name
);
4692 tree def
= ssa_default_def (cfun
, var
);
4696 /* If the variable is used undefined, make this name
4697 undefined via a move. */
4698 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
4699 gsi_replace (&stmt_gsi
, stmt
, true);
4703 /* Otherwise make this variable undefined. */
4704 gsi_remove (&stmt_gsi
, true);
4705 set_ssa_default_def (cfun
, var
, name
);
4706 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
4710 gsi_remove (&stmt_gsi
, true);
4713 /* Put returned bounds into the correct place if required. */
4716 gimple old_stmt
= SSA_NAME_DEF_STMT (return_bounds
);
4717 gimple new_stmt
= gimple_build_assign (return_bounds
, id
->retbnd
);
4718 gimple_stmt_iterator bnd_gsi
= gsi_for_stmt (old_stmt
);
4719 unlink_stmt_vdef (old_stmt
);
4720 gsi_replace (&bnd_gsi
, new_stmt
, false);
4721 maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
);
4722 cgraph_update_edges_for_call_stmt (old_stmt
,
4723 gimple_call_fndecl (old_stmt
),
4727 if (purge_dead_abnormal_edges
)
4729 gimple_purge_dead_eh_edges (return_block
);
4730 gimple_purge_dead_abnormal_call_edges (return_block
);
4733 /* If the value of the new expression is ignored, that's OK. We
4734 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4735 the equivalent inlined version either. */
4736 if (is_gimple_assign (stmt
))
4738 gcc_assert (gimple_assign_single_p (stmt
)
4739 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
4740 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
4743 /* Copy bounds for all generated assigns that need it. */
4744 for (i
= 0; i
< id
->assign_stmts
.length (); i
++)
4745 chkp_copy_bounds_for_assign (id
->assign_stmts
[i
], cg_edge
);
4746 id
->assign_stmts
.release ();
4748 /* Output the inlining info for this abstract function, since it has been
4749 inlined. If we don't do this now, we can lose the information about the
4750 variables in the function when the blocks get blown away as soon as we
4751 remove the cgraph node. */
4752 if (gimple_block (stmt
))
4753 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
4755 /* Update callgraph if needed. */
4756 cg_edge
->callee
->remove ();
4758 id
->block
= NULL_TREE
;
4759 successfully_inlined
= TRUE
;
4762 input_location
= saved_location
;
4763 return successfully_inlined
;
4766 /* Expand call statements reachable from STMT_P.
4767 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4768 in a MODIFY_EXPR. */
4771 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
4773 gimple_stmt_iterator gsi
;
4775 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4777 gimple stmt
= gsi_stmt (gsi
);
4779 if (is_gimple_call (stmt
)
4780 && !gimple_call_internal_p (stmt
)
4781 && expand_call_inline (bb
, stmt
, id
))
4789 /* Walk all basic blocks created after FIRST and try to fold every statement
4790 in the STATEMENTS pointer set. */
4793 fold_marked_statements (int first
, hash_set
<gimple
> *statements
)
4795 for (; first
< n_basic_blocks_for_fn (cfun
); first
++)
4796 if (BASIC_BLOCK_FOR_FN (cfun
, first
))
4798 gimple_stmt_iterator gsi
;
4800 for (gsi
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4803 if (statements
->contains (gsi_stmt (gsi
)))
4805 gimple old_stmt
= gsi_stmt (gsi
);
4806 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
4808 if (old_decl
&& DECL_BUILT_IN (old_decl
))
4810 /* Folding builtins can create multiple instructions,
4811 we need to look at all of them. */
4812 gimple_stmt_iterator i2
= gsi
;
4814 if (fold_stmt (&gsi
))
4817 /* If a builtin at the end of a bb folded into nothing,
4818 the following loop won't work. */
4819 if (gsi_end_p (gsi
))
4821 cgraph_update_edges_for_call_stmt (old_stmt
,
4826 i2
= gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, first
));
4831 new_stmt
= gsi_stmt (i2
);
4832 update_stmt (new_stmt
);
4833 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4836 if (new_stmt
== gsi_stmt (gsi
))
4838 /* It is okay to check only for the very last
4839 of these statements. If it is a throwing
4840 statement nothing will change. If it isn't
4841 this can remove EH edges. If that weren't
4842 correct then because some intermediate stmts
4843 throw, but not the last one. That would mean
4844 we'd have to split the block, which we can't
4845 here and we'd loose anyway. And as builtins
4846 probably never throw, this all
4848 if (maybe_clean_or_replace_eh_stmt (old_stmt
,
4850 gimple_purge_dead_eh_edges (
4851 BASIC_BLOCK_FOR_FN (cfun
, first
));
4858 else if (fold_stmt (&gsi
))
4860 /* Re-read the statement from GSI as fold_stmt() may
4862 gimple new_stmt
= gsi_stmt (gsi
);
4863 update_stmt (new_stmt
);
4865 if (is_gimple_call (old_stmt
)
4866 || is_gimple_call (new_stmt
))
4867 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
,
4870 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
4871 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun
,
4878 /* Expand calls to inline functions in the body of FN. */
4881 optimize_inline_calls (tree fn
)
4885 int last
= n_basic_blocks_for_fn (cfun
);
4886 bool inlined_p
= false;
4889 memset (&id
, 0, sizeof (id
));
4891 id
.src_node
= id
.dst_node
= cgraph_node::get (fn
);
4892 gcc_assert (id
.dst_node
->definition
);
4894 /* Or any functions that aren't finished yet. */
4895 if (current_function_decl
)
4896 id
.dst_fn
= current_function_decl
;
4898 id
.copy_decl
= copy_decl_maybe_to_var
;
4899 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4900 id
.transform_new_cfg
= false;
4901 id
.transform_return_to_modify
= true;
4902 id
.transform_parameter
= true;
4903 id
.transform_lang_insert_block
= NULL
;
4904 id
.statements_to_fold
= new hash_set
<gimple
>;
4906 push_gimplify_context ();
4908 /* We make no attempts to keep dominance info up-to-date. */
4909 free_dominance_info (CDI_DOMINATORS
);
4910 free_dominance_info (CDI_POST_DOMINATORS
);
4912 /* Register specific gimple functions. */
4913 gimple_register_cfg_hooks ();
4915 /* Reach the trees by walking over the CFG, and note the
4916 enclosing basic-blocks in the call edges. */
4917 /* We walk the blocks going forward, because inlined function bodies
4918 will split id->current_basic_block, and the new blocks will
4919 follow it; we'll trudge through them, processing their CALL_EXPRs
4921 FOR_EACH_BB_FN (bb
, cfun
)
4922 inlined_p
|= gimple_expand_calls_inline (bb
, &id
);
4924 pop_gimplify_context (NULL
);
4926 #ifdef ENABLE_CHECKING
4928 struct cgraph_edge
*e
;
4930 id
.dst_node
->verify ();
4932 /* Double check that we inlined everything we are supposed to inline. */
4933 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
4934 gcc_assert (e
->inline_failed
);
4938 /* Fold queued statements. */
4939 fold_marked_statements (last
, id
.statements_to_fold
);
4940 delete id
.statements_to_fold
;
4942 gcc_assert (!id
.debug_stmts
.exists ());
4944 /* If we didn't inline into the function there is nothing to do. */
4948 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4951 delete_unreachable_blocks_update_callgraph (&id
);
4952 #ifdef ENABLE_CHECKING
4953 id
.dst_node
->verify ();
4956 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4957 not possible yet - the IPA passes might make various functions to not
4958 throw and they don't care to proactively update local EH info. This is
4959 done later in fixup_cfg pass that also execute the verification. */
4960 return (TODO_update_ssa
4962 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
4963 | (gimple_in_ssa_p (cfun
) ? TODO_update_address_taken
: 0)
4964 | (profile_status_for_fn (cfun
) != PROFILE_ABSENT
4965 ? TODO_rebuild_frequencies
: 0));
4968 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4971 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
4973 enum tree_code code
= TREE_CODE (*tp
);
4974 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
4976 /* We make copies of most nodes. */
4977 if (IS_EXPR_CODE_CLASS (cl
)
4978 || code
== TREE_LIST
4980 || code
== TYPE_DECL
4981 || code
== OMP_CLAUSE
)
4983 /* Because the chain gets clobbered when we make a copy, we save it
4985 tree chain
= NULL_TREE
, new_tree
;
4987 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
4988 chain
= TREE_CHAIN (*tp
);
4990 /* Copy the node. */
4991 new_tree
= copy_node (*tp
);
4995 /* Now, restore the chain, if appropriate. That will cause
4996 walk_tree to walk into the chain as well. */
4997 if (code
== PARM_DECL
4998 || code
== TREE_LIST
4999 || code
== OMP_CLAUSE
)
5000 TREE_CHAIN (*tp
) = chain
;
5002 /* For now, we don't update BLOCKs when we make copies. So, we
5003 have to nullify all BIND_EXPRs. */
5004 if (TREE_CODE (*tp
) == BIND_EXPR
)
5005 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
5007 else if (code
== CONSTRUCTOR
)
5009 /* CONSTRUCTOR nodes need special handling because
5010 we need to duplicate the vector of elements. */
5013 new_tree
= copy_node (*tp
);
5014 CONSTRUCTOR_ELTS (new_tree
) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp
));
5017 else if (code
== STATEMENT_LIST
)
5018 /* We used to just abort on STATEMENT_LIST, but we can run into them
5019 with statement-expressions (c++/40975). */
5020 copy_statement_list (tp
);
5021 else if (TREE_CODE_CLASS (code
) == tcc_type
)
5023 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
5025 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
5030 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5031 information indicating to what new SAVE_EXPR this one should be mapped,
5032 use that one. Otherwise, create a new node and enter it in ST. FN is
5033 the function into which the copy will be placed. */
5036 remap_save_expr (tree
*tp
, hash_map
<tree
, tree
> *st
, int *walk_subtrees
)
5041 /* See if we already encountered this SAVE_EXPR. */
5044 /* If we didn't already remap this SAVE_EXPR, do so now. */
5047 t
= copy_node (*tp
);
5049 /* Remember this SAVE_EXPR. */
5051 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5056 /* We've already walked into this SAVE_EXPR; don't do it again. */
5061 /* Replace this SAVE_EXPR with the copy. */
5065 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5066 label, copies the declaration and enters it in the splay_tree in DATA (which
5067 is really a 'copy_body_data *'. */
5070 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
5071 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5072 struct walk_stmt_info
*wi
)
5074 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5075 glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (*gsip
));
5079 tree decl
= gimple_label_label (stmt
);
5081 /* Copy the decl and remember the copy. */
5082 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
5089 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5090 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5091 remaps all local declarations to appropriate replacements in gimple
5095 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
5097 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5098 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5099 hash_map
<tree
, tree
> *st
= id
->decl_map
;
5103 /* Only a local declaration (variable or label). */
5104 if ((TREE_CODE (expr
) == VAR_DECL
5105 && !TREE_STATIC (expr
))
5106 || TREE_CODE (expr
) == LABEL_DECL
)
5108 /* Lookup the declaration. */
5111 /* If it's there, remap it. */
5116 else if (TREE_CODE (expr
) == STATEMENT_LIST
5117 || TREE_CODE (expr
) == BIND_EXPR
5118 || TREE_CODE (expr
) == SAVE_EXPR
)
5120 else if (TREE_CODE (expr
) == TARGET_EXPR
)
5122 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5123 It's OK for this to happen if it was part of a subtree that
5124 isn't immediately expanded, such as operand 2 of another
5126 if (!TREE_OPERAND (expr
, 1))
5128 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
5129 TREE_OPERAND (expr
, 3) = NULL_TREE
;
5133 /* Keep iterating. */
5138 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5139 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5140 remaps all local declarations to appropriate replacements in gimple
5144 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
5145 bool *handled_ops_p ATTRIBUTE_UNUSED
,
5146 struct walk_stmt_info
*wi
)
5148 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
5149 gimple gs
= gsi_stmt (*gsip
);
5151 if (gbind
*stmt
= dyn_cast
<gbind
*> (gs
))
5153 tree block
= gimple_bind_block (stmt
);
5157 remap_block (&block
, id
);
5158 gimple_bind_set_block (stmt
, block
);
5161 /* This will remap a lot of the same decls again, but this should be
5163 if (gimple_bind_vars (stmt
))
5164 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
),
5168 /* Keep iterating. */
5173 /* Copies everything in SEQ and replaces variables and labels local to
5174 current_function_decl. */
5177 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
5180 struct walk_stmt_info wi
;
5183 /* There's nothing to do for NULL_TREE. */
5188 memset (&id
, 0, sizeof (id
));
5189 id
.src_fn
= current_function_decl
;
5190 id
.dst_fn
= current_function_decl
;
5191 id
.decl_map
= new hash_map
<tree
, tree
>;
5192 id
.debug_map
= NULL
;
5194 id
.copy_decl
= copy_decl_no_change
;
5195 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5196 id
.transform_new_cfg
= false;
5197 id
.transform_return_to_modify
= false;
5198 id
.transform_parameter
= false;
5199 id
.transform_lang_insert_block
= NULL
;
5201 /* Walk the tree once to find local labels. */
5202 memset (&wi
, 0, sizeof (wi
));
5203 hash_set
<tree
> visited
;
5206 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
5208 copy
= gimple_seq_copy (seq
);
5210 /* Walk the copy, remapping decls. */
5211 memset (&wi
, 0, sizeof (wi
));
5213 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
5218 delete id
.debug_map
;
5219 if (id
.dependence_map
)
5221 delete id
.dependence_map
;
5222 id
.dependence_map
= NULL
;
5229 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5232 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
5241 debug_find_tree (tree top
, tree search
)
5243 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
5247 /* Declare the variables created by the inliner. Add all the variables in
5248 VARS to BIND_EXPR. */
5251 declare_inline_vars (tree block
, tree vars
)
5254 for (t
= vars
; t
; t
= DECL_CHAIN (t
))
5256 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
5257 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
5258 add_local_decl (cfun
, t
);
5262 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
5265 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5266 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5267 VAR_DECL translation. */
5270 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
5272 /* Don't generate debug information for the copy if we wouldn't have
5273 generated it for the copy either. */
5274 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
5275 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
5277 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5278 declaration inspired this copy. */
5279 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
5281 /* The new variable/label has no RTL, yet. */
5282 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
5283 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
5284 SET_DECL_RTL (copy
, 0);
5286 /* These args would always appear unused, if not for this. */
5287 TREE_USED (copy
) = 1;
5289 /* Set the context for the new declaration. */
5290 if (!DECL_CONTEXT (decl
))
5291 /* Globals stay global. */
5293 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
5294 /* Things that weren't in the scope of the function we're inlining
5295 from aren't in the scope we're inlining to, either. */
5297 else if (TREE_STATIC (decl
))
5298 /* Function-scoped static variables should stay in the original
5302 /* Ordinary automatic local variables are now in the scope of the
5304 DECL_CONTEXT (copy
) = id
->dst_fn
;
5310 copy_decl_to_var (tree decl
, copy_body_data
*id
)
5314 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5315 || TREE_CODE (decl
) == RESULT_DECL
);
5317 type
= TREE_TYPE (decl
);
5319 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5320 VAR_DECL
, DECL_NAME (decl
), type
);
5321 if (DECL_PT_UID_SET_P (decl
))
5322 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5323 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5324 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5325 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5326 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5328 return copy_decl_for_dup_finish (id
, decl
, copy
);
5331 /* Like copy_decl_to_var, but create a return slot object instead of a
5332 pointer variable for return by invisible reference. */
5335 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
5339 gcc_assert (TREE_CODE (decl
) == PARM_DECL
5340 || TREE_CODE (decl
) == RESULT_DECL
);
5342 type
= TREE_TYPE (decl
);
5343 if (DECL_BY_REFERENCE (decl
))
5344 type
= TREE_TYPE (type
);
5346 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
5347 VAR_DECL
, DECL_NAME (decl
), type
);
5348 if (DECL_PT_UID_SET_P (decl
))
5349 SET_DECL_PT_UID (copy
, DECL_PT_UID (decl
));
5350 TREE_READONLY (copy
) = TREE_READONLY (decl
);
5351 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
5352 if (!DECL_BY_REFERENCE (decl
))
5354 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
5355 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
5358 return copy_decl_for_dup_finish (id
, decl
, copy
);
5362 copy_decl_no_change (tree decl
, copy_body_data
*id
)
5366 copy
= copy_node (decl
);
5368 /* The COPY is not abstract; it will be generated in DST_FN. */
5369 DECL_ABSTRACT_P (copy
) = false;
5370 lang_hooks
.dup_lang_specific_decl (copy
);
5372 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5373 been taken; it's for internal bookkeeping in expand_goto_internal. */
5374 if (TREE_CODE (copy
) == LABEL_DECL
)
5376 TREE_ADDRESSABLE (copy
) = 0;
5377 LABEL_DECL_UID (copy
) = -1;
5380 return copy_decl_for_dup_finish (id
, decl
, copy
);
5384 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
5386 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
5387 return copy_decl_to_var (decl
, id
);
5389 return copy_decl_no_change (decl
, id
);
5392 /* Return a copy of the function's argument tree. */
5394 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
5395 bitmap args_to_skip
, tree
*vars
)
5398 tree new_parm
= NULL
;
5403 for (arg
= orig_parm
; arg
; arg
= DECL_CHAIN (arg
), i
++)
5404 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
5406 tree new_tree
= remap_decl (arg
, id
);
5407 if (TREE_CODE (new_tree
) != PARM_DECL
)
5408 new_tree
= id
->copy_decl (arg
, id
);
5409 lang_hooks
.dup_lang_specific_decl (new_tree
);
5411 parg
= &DECL_CHAIN (new_tree
);
5413 else if (!id
->decl_map
->get (arg
))
5415 /* Make an equivalent VAR_DECL. If the argument was used
5416 as temporary variable later in function, the uses will be
5417 replaced by local variable. */
5418 tree var
= copy_decl_to_var (arg
, id
);
5419 insert_decl_map (id
, arg
, var
);
5420 /* Declare this new variable. */
5421 DECL_CHAIN (var
) = *vars
;
5427 /* Return a copy of the function's static chain. */
5429 copy_static_chain (tree static_chain
, copy_body_data
* id
)
5431 tree
*chain_copy
, *pvar
;
5433 chain_copy
= &static_chain
;
5434 for (pvar
= chain_copy
; *pvar
; pvar
= &DECL_CHAIN (*pvar
))
5436 tree new_tree
= remap_decl (*pvar
, id
);
5437 lang_hooks
.dup_lang_specific_decl (new_tree
);
5438 DECL_CHAIN (new_tree
) = DECL_CHAIN (*pvar
);
5441 return static_chain
;
5444 /* Return true if the function is allowed to be versioned.
5445 This is a guard for the versioning functionality. */
5448 tree_versionable_function_p (tree fndecl
)
5450 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
5451 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
5454 /* Delete all unreachable basic blocks and update callgraph.
5455 Doing so is somewhat nontrivial because we need to update all clones and
5456 remove inline function that become unreachable. */
5459 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
5461 bool changed
= false;
5462 basic_block b
, next_bb
;
5464 find_unreachable_blocks ();
5466 /* Delete all unreachable basic blocks. */
5468 for (b
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
; b
5469 != EXIT_BLOCK_PTR_FOR_FN (cfun
); b
= next_bb
)
5471 next_bb
= b
->next_bb
;
5473 if (!(b
->flags
& BB_REACHABLE
))
5475 gimple_stmt_iterator bsi
;
5477 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
5479 struct cgraph_edge
*e
;
5480 struct cgraph_node
*node
;
5482 id
->dst_node
->remove_stmt_references (gsi_stmt (bsi
));
5484 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5485 &&(e
= id
->dst_node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5487 if (!e
->inline_failed
)
5488 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5492 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
5493 && id
->dst_node
->clones
)
5494 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5496 node
->remove_stmt_references (gsi_stmt (bsi
));
5497 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
5498 && (e
= node
->get_edge (gsi_stmt (bsi
))) != NULL
)
5500 if (!e
->inline_failed
)
5501 e
->callee
->remove_symbol_and_inline_clones (id
->dst_node
);
5507 node
= node
->clones
;
5508 else if (node
->next_sibling_clone
)
5509 node
= node
->next_sibling_clone
;
5512 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5513 node
= node
->clone_of
;
5514 if (node
!= id
->dst_node
)
5515 node
= node
->next_sibling_clone
;
5519 delete_basic_block (b
);
5527 /* Update clone info after duplication. */
5530 update_clone_info (copy_body_data
* id
)
5532 struct cgraph_node
*node
;
5533 if (!id
->dst_node
->clones
)
5535 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
5537 /* First update replace maps to match the new body. */
5538 if (node
->clone
.tree_map
)
5541 for (i
= 0; i
< vec_safe_length (node
->clone
.tree_map
); i
++)
5543 struct ipa_replace_map
*replace_info
;
5544 replace_info
= (*node
->clone
.tree_map
)[i
];
5545 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
5546 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
5550 node
= node
->clones
;
5551 else if (node
->next_sibling_clone
)
5552 node
= node
->next_sibling_clone
;
5555 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
5556 node
= node
->clone_of
;
5557 if (node
!= id
->dst_node
)
5558 node
= node
->next_sibling_clone
;
5563 /* Create a copy of a function's tree.
5564 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5565 of the original function and the new copied function
5566 respectively. In case we want to replace a DECL
5567 tree with another tree while duplicating the function's
5568 body, TREE_MAP represents the mapping between these
5569 trees. If UPDATE_CLONES is set, the call_stmt fields
5570 of edges of clones of the function will be updated.
5572 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5574 If SKIP_RETURN is true, the new version will return void.
5575 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5576 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5579 tree_function_versioning (tree old_decl
, tree new_decl
,
5580 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
5581 bool update_clones
, bitmap args_to_skip
,
5582 bool skip_return
, bitmap blocks_to_copy
,
5583 basic_block new_entry
)
5585 struct cgraph_node
*old_version_node
;
5586 struct cgraph_node
*new_version_node
;
5590 struct ipa_replace_map
*replace_info
;
5591 basic_block old_entry_block
, bb
;
5592 auto_vec
<gimple
, 10> init_stmts
;
5593 tree vars
= NULL_TREE
;
5595 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
5596 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
5597 DECL_POSSIBLY_INLINED (old_decl
) = 1;
5599 old_version_node
= cgraph_node::get (old_decl
);
5600 gcc_checking_assert (old_version_node
);
5601 new_version_node
= cgraph_node::get (new_decl
);
5602 gcc_checking_assert (new_version_node
);
5604 /* Copy over debug args. */
5605 if (DECL_HAS_DEBUG_ARGS_P (old_decl
))
5607 vec
<tree
, va_gc
> **new_debug_args
, **old_debug_args
;
5608 gcc_checking_assert (decl_debug_args_lookup (new_decl
) == NULL
);
5609 DECL_HAS_DEBUG_ARGS_P (new_decl
) = 0;
5610 old_debug_args
= decl_debug_args_lookup (old_decl
);
5613 new_debug_args
= decl_debug_args_insert (new_decl
);
5614 *new_debug_args
= vec_safe_copy (*old_debug_args
);
5618 /* Output the inlining info for this abstract function, since it has been
5619 inlined. If we don't do this now, we can lose the information about the
5620 variables in the function when the blocks get blown away as soon as we
5621 remove the cgraph node. */
5622 (*debug_hooks
->outlining_inline_function
) (old_decl
);
5624 DECL_ARTIFICIAL (new_decl
) = 1;
5625 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
5626 if (DECL_ORIGIN (old_decl
) == old_decl
)
5627 old_version_node
->used_as_abstract_origin
= true;
5628 DECL_FUNCTION_PERSONALITY (new_decl
) = DECL_FUNCTION_PERSONALITY (old_decl
);
5630 /* Prepare the data structures for the tree copy. */
5631 memset (&id
, 0, sizeof (id
));
5633 /* Generate a new name for the new version. */
5634 id
.statements_to_fold
= new hash_set
<gimple
>;
5636 id
.decl_map
= new hash_map
<tree
, tree
>;
5637 id
.debug_map
= NULL
;
5638 id
.src_fn
= old_decl
;
5639 id
.dst_fn
= new_decl
;
5640 id
.src_node
= old_version_node
;
5641 id
.dst_node
= new_version_node
;
5642 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
5643 id
.blocks_to_copy
= blocks_to_copy
;
5645 id
.copy_decl
= copy_decl_no_change
;
5646 id
.transform_call_graph_edges
5647 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
5648 id
.transform_new_cfg
= true;
5649 id
.transform_return_to_modify
= false;
5650 id
.transform_parameter
= false;
5651 id
.transform_lang_insert_block
= NULL
;
5653 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FN
5654 (DECL_STRUCT_FUNCTION (old_decl
));
5655 DECL_RESULT (new_decl
) = DECL_RESULT (old_decl
);
5656 DECL_ARGUMENTS (new_decl
) = DECL_ARGUMENTS (old_decl
);
5657 initialize_cfun (new_decl
, old_decl
,
5658 old_entry_block
->count
);
5659 if (DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
)
5660 DECL_STRUCT_FUNCTION (new_decl
)->gimple_df
->ipa_pta
5661 = id
.src_cfun
->gimple_df
->ipa_pta
;
5663 /* Copy the function's static chain. */
5664 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
5666 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
5667 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
5670 /* If there's a tree_map, prepare for substitution. */
5672 for (i
= 0; i
< tree_map
->length (); i
++)
5675 replace_info
= (*tree_map
)[i
];
5676 if (replace_info
->replace_p
)
5678 if (!replace_info
->old_tree
)
5680 int i
= replace_info
->parm_num
;
5684 for (parm
= DECL_ARGUMENTS (old_decl
); i
; parm
= DECL_CHAIN (parm
))
5686 replace_info
->old_tree
= parm
;
5687 req_type
= TREE_TYPE (parm
);
5688 if (!useless_type_conversion_p (req_type
, TREE_TYPE (replace_info
->new_tree
)))
5690 if (fold_convertible_p (req_type
, replace_info
->new_tree
))
5691 replace_info
->new_tree
= fold_build1 (NOP_EXPR
, req_type
, replace_info
->new_tree
);
5692 else if (TYPE_SIZE (req_type
) == TYPE_SIZE (TREE_TYPE (replace_info
->new_tree
)))
5693 replace_info
->new_tree
= fold_build1 (VIEW_CONVERT_EXPR
, req_type
, replace_info
->new_tree
);
5698 fprintf (dump_file
, " const ");
5699 print_generic_expr (dump_file
, replace_info
->new_tree
, 0);
5700 fprintf (dump_file
, " can't be converted to param ");
5701 print_generic_expr (dump_file
, parm
, 0);
5702 fprintf (dump_file
, "\n");
5704 replace_info
->old_tree
= NULL
;
5709 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
5710 if (replace_info
->old_tree
)
5712 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
5713 replace_info
->new_tree
, id
.src_fn
,
5717 init_stmts
.safe_push (init
);
5721 /* Copy the function's arguments. */
5722 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
5723 DECL_ARGUMENTS (new_decl
) =
5724 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
5725 args_to_skip
, &vars
);
5727 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
5728 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl
)) = new_decl
;
5730 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
5732 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
))
5733 /* Add local vars. */
5734 add_local_variables (DECL_STRUCT_FUNCTION (old_decl
), cfun
, &id
);
5736 if (DECL_RESULT (old_decl
) == NULL_TREE
)
5738 else if (skip_return
&& !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl
))))
5740 DECL_RESULT (new_decl
)
5741 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl
)),
5742 RESULT_DECL
, NULL_TREE
, void_type_node
);
5743 DECL_CONTEXT (DECL_RESULT (new_decl
)) = new_decl
;
5744 cfun
->returns_struct
= 0;
5745 cfun
->returns_pcc_struct
= 0;
5750 DECL_RESULT (new_decl
) = remap_decl (DECL_RESULT (old_decl
), &id
);
5751 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
5752 if (gimple_in_ssa_p (id
.src_cfun
)
5753 && DECL_BY_REFERENCE (DECL_RESULT (old_decl
))
5754 && (old_name
= ssa_default_def (id
.src_cfun
, DECL_RESULT (old_decl
))))
5756 tree new_name
= make_ssa_name (DECL_RESULT (new_decl
));
5757 insert_decl_map (&id
, old_name
, new_name
);
5758 SSA_NAME_DEF_STMT (new_name
) = gimple_build_nop ();
5759 set_ssa_default_def (cfun
, DECL_RESULT (new_decl
), new_name
);
5763 /* Set up the destination functions loop tree. */
5764 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl
)) != NULL
)
5766 cfun
->curr_properties
&= ~PROP_loops
;
5767 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
5768 cfun
->curr_properties
|= PROP_loops
;
5771 /* Copy the Function's body. */
5772 copy_body (&id
, old_entry_block
->count
, REG_BR_PROB_BASE
,
5773 ENTRY_BLOCK_PTR_FOR_FN (cfun
), EXIT_BLOCK_PTR_FOR_FN (cfun
),
5776 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5777 number_blocks (new_decl
);
5779 /* We want to create the BB unconditionally, so that the addition of
5780 debug stmts doesn't affect BB count, which may in the end cause
5781 codegen differences. */
5782 bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5783 while (init_stmts
.length ())
5784 insert_init_stmt (&id
, bb
, init_stmts
.pop ());
5785 update_clone_info (&id
);
5787 /* Remap the nonlocal_goto_save_area, if any. */
5788 if (cfun
->nonlocal_goto_save_area
)
5790 struct walk_stmt_info wi
;
5792 memset (&wi
, 0, sizeof (wi
));
5794 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
5800 delete id
.debug_map
;
5801 free_dominance_info (CDI_DOMINATORS
);
5802 free_dominance_info (CDI_POST_DOMINATORS
);
5804 fold_marked_statements (0, id
.statements_to_fold
);
5805 delete id
.statements_to_fold
;
5806 fold_cond_expr_cond ();
5807 delete_unreachable_blocks_update_callgraph (&id
);
5808 if (id
.dst_node
->definition
)
5809 cgraph_edge::rebuild_references ();
5810 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP
))
5812 calculate_dominance_info (CDI_DOMINATORS
);
5813 fix_loop_structure (NULL
);
5815 update_ssa (TODO_update_ssa
);
5817 /* After partial cloning we need to rescale frequencies, so they are
5818 within proper range in the cloned function. */
5821 struct cgraph_edge
*e
;
5822 rebuild_frequencies ();
5824 new_version_node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5825 for (e
= new_version_node
->callees
; e
; e
= e
->next_callee
)
5827 basic_block bb
= gimple_bb (e
->call_stmt
);
5828 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5830 e
->count
= bb
->count
;
5832 for (e
= new_version_node
->indirect_calls
; e
; e
= e
->next_callee
)
5834 basic_block bb
= gimple_bb (e
->call_stmt
);
5835 e
->frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
5837 e
->count
= bb
->count
;
5841 free_dominance_info (CDI_DOMINATORS
);
5842 free_dominance_info (CDI_POST_DOMINATORS
);
5844 gcc_assert (!id
.debug_stmts
.exists ());
5849 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5850 the callee and return the inlined body on success. */
5853 maybe_inline_call_in_expr (tree exp
)
5855 tree fn
= get_callee_fndecl (exp
);
5857 /* We can only try to inline "const" functions. */
5858 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
5860 call_expr_arg_iterator iter
;
5863 hash_map
<tree
, tree
> decl_map
;
5865 /* Remap the parameters. */
5866 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
5868 param
= DECL_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
5869 decl_map
.put (param
, arg
);
5871 memset (&id
, 0, sizeof (id
));
5873 id
.dst_fn
= current_function_decl
;
5874 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5875 id
.decl_map
= &decl_map
;
5877 id
.copy_decl
= copy_decl_no_change
;
5878 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5879 id
.transform_new_cfg
= false;
5880 id
.transform_return_to_modify
= true;
5881 id
.transform_parameter
= true;
5882 id
.transform_lang_insert_block
= NULL
;
5884 /* Make sure not to unshare trees behind the front-end's back
5885 since front-end specific mechanisms may rely on sharing. */
5886 id
.regimplify
= false;
5887 id
.do_not_unshare
= true;
5889 /* We're not inside any EH region. */
5892 t
= copy_tree_body (&id
);
5894 /* We can only return something suitable for use in a GENERIC
5896 if (TREE_CODE (t
) == MODIFY_EXPR
)
5897 return TREE_OPERAND (t
, 1);
5903 /* Duplicate a type, fields and all. */
5906 build_duplicate_type (tree type
)
5908 struct copy_body_data id
;
5910 memset (&id
, 0, sizeof (id
));
5911 id
.src_fn
= current_function_decl
;
5912 id
.dst_fn
= current_function_decl
;
5914 id
.decl_map
= new hash_map
<tree
, tree
>;
5915 id
.debug_map
= NULL
;
5916 id
.copy_decl
= copy_decl_no_change
;
5918 type
= remap_type_1 (type
, &id
);
5922 delete id
.debug_map
;
5924 TYPE_CANONICAL (type
) = type
;
5929 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
5930 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
5934 copy_fn (tree fn
, tree
& parms
, tree
& result
)
5938 hash_map
<tree
, tree
> decl_map
;
5943 memset (&id
, 0, sizeof (id
));
5945 id
.dst_fn
= current_function_decl
;
5946 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
5947 id
.decl_map
= &decl_map
;
5949 id
.copy_decl
= copy_decl_no_change
;
5950 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5951 id
.transform_new_cfg
= false;
5952 id
.transform_return_to_modify
= false;
5953 id
.transform_parameter
= true;
5954 id
.transform_lang_insert_block
= NULL
;
5956 /* Make sure not to unshare trees behind the front-end's back
5957 since front-end specific mechanisms may rely on sharing. */
5958 id
.regimplify
= false;
5959 id
.do_not_unshare
= true;
5961 /* We're not inside any EH region. */
5964 /* Remap the parameters and result and return them to the caller. */
5965 for (param
= DECL_ARGUMENTS (fn
);
5967 param
= DECL_CHAIN (param
))
5969 *p
= remap_decl (param
, &id
);
5970 p
= &DECL_CHAIN (*p
);
5973 if (DECL_RESULT (fn
))
5974 result
= remap_decl (DECL_RESULT (fn
), &id
);
5978 return copy_tree_body (&id
);