2 Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
4 Contributed by Alexandre Oliva <aoliva@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
26 #include "diagnostic-core.h"
28 #include "tree-inline.h"
32 #include "insn-config.h"
34 #include "langhooks.h"
35 #include "basic-block.h"
36 #include "tree-iterator.h"
39 #include "tree-mudflap.h"
40 #include "tree-flow.h"
42 #include "tree-flow.h"
43 #include "tree-pretty-print.h"
46 #include "pointer-set.h"
48 #include "value-prof.h"
49 #include "tree-pass.h"
51 #include "integrate.h"
53 #include "rtl.h" /* FIXME: For asm_str_count. */
55 /* I'm not real happy about this, but we need to handle gimple and
59 /* Inlining, Cloning, Versioning, Parallelization
61 Inlining: a function body is duplicated, but the PARM_DECLs are
62 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
63 MODIFY_EXPRs that store to a dedicated returned-value variable.
64 The duplicated eh_region info of the copy will later be appended
65 to the info for the caller; the eh_region info in copied throwing
66 statements and RESX statements are adjusted accordingly.
68 Cloning: (only in C++) We have one body for a con/de/structor, and
69 multiple function decls, each with a unique parameter list.
70 Duplicate the body, using the given splay tree; some parameters
71 will become constants (like 0 or 1).
73 Versioning: a function body is duplicated and the result is a new
74 function rather than into blocks of an existing function as with
75 inlining. Some parameters will become constants.
77 Parallelization: a region of a function is duplicated resulting in
78 a new function. Variables may be replaced with complex expressions
79 to enable shared variable semantics.
81 All of these will simultaneously lookup any callgraph edges. If
82 we're going to inline the duplicated function body, and the given
83 function has some cloned callgraph nodes (one for each place this
84 function will be inlined) those callgraph edges will be duplicated.
85 If we're cloning the body, those callgraph edges will be
86 updated to point into the new body. (Note that the original
87 callgraph node and edge list will not be altered.)
89 See the CALL_EXPR handling case in copy_tree_body_r (). */
93 o In order to make inlining-on-trees work, we pessimized
94 function-local static constants. In particular, they are now
95 always output, even when not addressed. Fix this by treating
96 function-local static constants just like global static
97 constants; the back-end already knows not to output them if they
100 o Provide heuristics to clamp inlining of recursive template
104 /* Weights that estimate_num_insns uses to estimate the size of the
107 eni_weights eni_size_weights;
109 /* Weights that estimate_num_insns uses to estimate the time necessary
110 to execute the produced code. */
112 eni_weights eni_time_weights;
116 static tree declare_return_variable (copy_body_data *, tree, tree, basic_block);
117 static void remap_block (tree *, copy_body_data *);
118 static void copy_bind_expr (tree *, int *, copy_body_data *);
119 static tree mark_local_for_remap_r (tree *, int *, void *);
120 static void unsave_expr_1 (tree);
121 static tree unsave_r (tree *, int *, void *);
122 static void declare_inline_vars (tree, tree);
123 static void remap_save_expr (tree *, void *, int *);
124 static void prepend_lexical_block (tree current_block, tree new_block);
125 static tree copy_decl_to_var (tree, copy_body_data *);
126 static tree copy_result_decl_to_var (tree, copy_body_data *);
127 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
128 static gimple remap_gimple_stmt (gimple, copy_body_data *);
129 static bool delete_unreachable_blocks_update_callgraph (copy_body_data *id);
131 /* Insert a tree->tree mapping for ID. Despite the name suggests
132 that the trees should be variables, it is used for more than that. */
135 insert_decl_map (copy_body_data *id, tree key, tree value)
137 *pointer_map_insert (id->decl_map, key) = value;
139 /* Always insert an identity map as well. If we see this same new
140 node again, we won't want to duplicate it a second time. */
142 *pointer_map_insert (id->decl_map, value) = value;
145 /* Insert a tree->tree mapping for ID. This is only used for
149 insert_debug_decl_map (copy_body_data *id, tree key, tree value)
151 if (!gimple_in_ssa_p (id->src_cfun))
154 if (!MAY_HAVE_DEBUG_STMTS)
157 if (!target_for_debug_bind (key))
160 gcc_assert (TREE_CODE (key) == PARM_DECL);
161 gcc_assert (TREE_CODE (value) == VAR_DECL);
164 id->debug_map = pointer_map_create ();
166 *pointer_map_insert (id->debug_map, key) = value;
169 /* If nonzero, we're remapping the contents of inlined debug
170 statements. If negative, an error has occurred, such as a
171 reference to a variable that isn't available in the inlined
173 static int processing_debug_stmt = 0;
175 /* Construct new SSA name for old NAME. ID is the inline context. */
178 remap_ssa_name (tree name, copy_body_data *id)
183 gcc_assert (TREE_CODE (name) == SSA_NAME);
185 n = (tree *) pointer_map_contains (id->decl_map, name);
187 return unshare_expr (*n);
189 if (processing_debug_stmt)
191 processing_debug_stmt = -1;
195 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
197 new_tree = remap_decl (SSA_NAME_VAR (name), id);
199 /* We might've substituted constant or another SSA_NAME for
202 Replace the SSA name representing RESULT_DECL by variable during
203 inlining: this saves us from need to introduce PHI node in a case
204 return value is just partly initialized. */
205 if ((TREE_CODE (new_tree) == VAR_DECL || TREE_CODE (new_tree) == PARM_DECL)
206 && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
207 || !id->transform_return_to_modify))
209 struct ptr_info_def *pi;
210 new_tree = make_ssa_name (new_tree, NULL);
211 insert_decl_map (id, name, new_tree);
212 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree)
213 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
214 TREE_TYPE (new_tree) = TREE_TYPE (SSA_NAME_VAR (new_tree));
215 /* At least IPA points-to info can be directly transferred. */
216 if (id->src_cfun->gimple_df
217 && id->src_cfun->gimple_df->ipa_pta
218 && (pi = SSA_NAME_PTR_INFO (name))
221 struct ptr_info_def *new_pi = get_ptr_info (new_tree);
224 if (gimple_nop_p (SSA_NAME_DEF_STMT (name)))
226 /* By inlining function having uninitialized variable, we might
227 extend the lifetime (variable might get reused). This cause
228 ICE in the case we end up extending lifetime of SSA name across
229 abnormal edge, but also increase register pressure.
231 We simply initialize all uninitialized vars by 0 except
232 for case we are inlining to very first BB. We can avoid
233 this for all BBs that are not inside strongly connected
234 regions of the CFG, but this is expensive to test. */
236 && is_gimple_reg (SSA_NAME_VAR (name))
237 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name)
238 && TREE_CODE (SSA_NAME_VAR (name)) != PARM_DECL
239 && (id->entry_bb != EDGE_SUCC (ENTRY_BLOCK_PTR, 0)->dest
240 || EDGE_COUNT (id->entry_bb->preds) != 1))
242 gimple_stmt_iterator gsi = gsi_last_bb (id->entry_bb);
244 tree zero = build_zero_cst (TREE_TYPE (new_tree));
246 init_stmt = gimple_build_assign (new_tree, zero);
247 gsi_insert_after (&gsi, init_stmt, GSI_NEW_STMT);
248 SSA_NAME_IS_DEFAULT_DEF (new_tree) = 0;
252 SSA_NAME_DEF_STMT (new_tree) = gimple_build_nop ();
253 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name))
255 set_default_def (SSA_NAME_VAR (new_tree), new_tree);
260 insert_decl_map (id, name, new_tree);
264 /* Remap DECL during the copying of the BLOCK tree for the function. */
267 remap_decl (tree decl, copy_body_data *id)
271 /* We only remap local variables in the current function. */
273 /* See if we have remapped this declaration. */
275 n = (tree *) pointer_map_contains (id->decl_map, decl);
277 if (!n && processing_debug_stmt)
279 processing_debug_stmt = -1;
283 /* If we didn't already have an equivalent for this declaration,
287 /* Make a copy of the variable or label. */
288 tree t = id->copy_decl (decl, id);
290 /* Remember it, so that if we encounter this local entity again
291 we can reuse this copy. Do this early because remap_type may
292 need this decl for TYPE_STUB_DECL. */
293 insert_decl_map (id, decl, t);
298 /* Remap types, if necessary. */
299 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
300 if (TREE_CODE (t) == TYPE_DECL)
301 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
303 /* Remap sizes as necessary. */
304 walk_tree (&DECL_SIZE (t), copy_tree_body_r, id, NULL);
305 walk_tree (&DECL_SIZE_UNIT (t), copy_tree_body_r, id, NULL);
307 /* If fields, do likewise for offset and qualifier. */
308 if (TREE_CODE (t) == FIELD_DECL)
310 walk_tree (&DECL_FIELD_OFFSET (t), copy_tree_body_r, id, NULL);
311 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
312 walk_tree (&DECL_QUALIFIER (t), copy_tree_body_r, id, NULL);
315 if (cfun && gimple_in_ssa_p (cfun)
316 && (TREE_CODE (t) == VAR_DECL
317 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
320 add_referenced_var (t);
325 if (id->do_not_unshare)
328 return unshare_expr (*n);
332 remap_type_1 (tree type, copy_body_data *id)
336 /* We do need a copy. build and register it now. If this is a pointer or
337 reference type, remap the designated type and make a new pointer or
339 if (TREE_CODE (type) == POINTER_TYPE)
341 new_tree = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
343 TYPE_REF_CAN_ALIAS_ALL (type));
344 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
345 new_tree = build_type_attribute_qual_variant (new_tree,
346 TYPE_ATTRIBUTES (type),
348 insert_decl_map (id, type, new_tree);
351 else if (TREE_CODE (type) == REFERENCE_TYPE)
353 new_tree = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
355 TYPE_REF_CAN_ALIAS_ALL (type));
356 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
357 new_tree = build_type_attribute_qual_variant (new_tree,
358 TYPE_ATTRIBUTES (type),
360 insert_decl_map (id, type, new_tree);
364 new_tree = copy_node (type);
366 insert_decl_map (id, type, new_tree);
368 /* This is a new type, not a copy of an old type. Need to reassociate
369 variants. We can handle everything except the main variant lazily. */
370 t = TYPE_MAIN_VARIANT (type);
373 t = remap_type (t, id);
374 TYPE_MAIN_VARIANT (new_tree) = t;
375 TYPE_NEXT_VARIANT (new_tree) = TYPE_NEXT_VARIANT (t);
376 TYPE_NEXT_VARIANT (t) = new_tree;
380 TYPE_MAIN_VARIANT (new_tree) = new_tree;
381 TYPE_NEXT_VARIANT (new_tree) = NULL;
384 if (TYPE_STUB_DECL (type))
385 TYPE_STUB_DECL (new_tree) = remap_decl (TYPE_STUB_DECL (type), id);
387 /* Lazily create pointer and reference types. */
388 TYPE_POINTER_TO (new_tree) = NULL;
389 TYPE_REFERENCE_TO (new_tree) = NULL;
391 switch (TREE_CODE (new_tree))
395 case FIXED_POINT_TYPE:
398 t = TYPE_MIN_VALUE (new_tree);
399 if (t && TREE_CODE (t) != INTEGER_CST)
400 walk_tree (&TYPE_MIN_VALUE (new_tree), copy_tree_body_r, id, NULL);
402 t = TYPE_MAX_VALUE (new_tree);
403 if (t && TREE_CODE (t) != INTEGER_CST)
404 walk_tree (&TYPE_MAX_VALUE (new_tree), copy_tree_body_r, id, NULL);
408 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
409 walk_tree (&TYPE_ARG_TYPES (new_tree), copy_tree_body_r, id, NULL);
413 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
414 TYPE_DOMAIN (new_tree) = remap_type (TYPE_DOMAIN (new_tree), id);
419 case QUAL_UNION_TYPE:
423 for (f = TYPE_FIELDS (new_tree); f ; f = DECL_CHAIN (f))
425 t = remap_decl (f, id);
426 DECL_CONTEXT (t) = new_tree;
430 TYPE_FIELDS (new_tree) = nreverse (nf);
436 /* Shouldn't have been thought variable sized. */
440 walk_tree (&TYPE_SIZE (new_tree), copy_tree_body_r, id, NULL);
441 walk_tree (&TYPE_SIZE_UNIT (new_tree), copy_tree_body_r, id, NULL);
447 remap_type (tree type, copy_body_data *id)
455 /* See if we have remapped this type. */
456 node = (tree *) pointer_map_contains (id->decl_map, type);
460 /* The type only needs remapping if it's variably modified. */
461 if (! variably_modified_type_p (type, id->src_fn))
463 insert_decl_map (id, type, type);
467 id->remapping_type_depth++;
468 tmp = remap_type_1 (type, id);
469 id->remapping_type_depth--;
474 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
475 is NULL or TYPE has not been remapped before. */
478 remapped_type (tree type, copy_body_data *id)
485 /* See if we have remapped this type. */
486 node = (tree *) pointer_map_contains (id->decl_map, type);
493 /* The type only needs remapping if it's variably modified. */
494 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
497 can_be_nonlocal (tree decl, copy_body_data *id)
499 /* We can not duplicate function decls. */
500 if (TREE_CODE (decl) == FUNCTION_DECL)
503 /* Local static vars must be non-local or we get multiple declaration
505 if (TREE_CODE (decl) == VAR_DECL
506 && !auto_var_in_fn_p (decl, id->src_fn))
509 /* At the moment dwarf2out can handle only these types of nodes. We
510 can support more later. */
511 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != PARM_DECL)
514 /* We must use global type. We call remapped_type instead of
515 remap_type since we don't want to remap this type here if it
516 hasn't been remapped before. */
517 if (TREE_TYPE (decl) != remapped_type (TREE_TYPE (decl), id))
520 /* Wihtout SSA we can't tell if variable is used. */
521 if (!gimple_in_ssa_p (cfun))
524 /* Live variables must be copied so we can attach DECL_RTL. */
532 remap_decls (tree decls, VEC(tree,gc) **nonlocalized_list, copy_body_data *id)
535 tree new_decls = NULL_TREE;
537 /* Remap its variables. */
538 for (old_var = decls; old_var; old_var = DECL_CHAIN (old_var))
542 if (can_be_nonlocal (old_var, id))
544 if (TREE_CODE (old_var) == VAR_DECL
545 && ! DECL_EXTERNAL (old_var)
546 && (var_ann (old_var) || !gimple_in_ssa_p (cfun)))
547 add_local_decl (cfun, old_var);
548 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
549 && !DECL_IGNORED_P (old_var)
550 && nonlocalized_list)
551 VEC_safe_push (tree, gc, *nonlocalized_list, old_var);
555 /* Remap the variable. */
556 new_var = remap_decl (old_var, id);
558 /* If we didn't remap this variable, we can't mess with its
559 TREE_CHAIN. If we remapped this variable to the return slot, it's
560 already declared somewhere else, so don't declare it here. */
562 if (new_var == id->retvar)
566 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
567 && !DECL_IGNORED_P (old_var)
568 && nonlocalized_list)
569 VEC_safe_push (tree, gc, *nonlocalized_list, old_var);
573 gcc_assert (DECL_P (new_var));
574 DECL_CHAIN (new_var) = new_decls;
577 /* Also copy value-expressions. */
578 if (TREE_CODE (new_var) == VAR_DECL
579 && DECL_HAS_VALUE_EXPR_P (new_var))
581 tree tem = DECL_VALUE_EXPR (new_var);
582 bool old_regimplify = id->regimplify;
583 id->remapping_type_depth++;
584 walk_tree (&tem, copy_tree_body_r, id, NULL);
585 id->remapping_type_depth--;
586 id->regimplify = old_regimplify;
587 SET_DECL_VALUE_EXPR (new_var, tem);
592 return nreverse (new_decls);
595 /* Copy the BLOCK to contain remapped versions of the variables
596 therein. And hook the new block into the block-tree. */
599 remap_block (tree *block, copy_body_data *id)
604 /* Make the new block. */
606 new_block = make_node (BLOCK);
607 TREE_USED (new_block) = TREE_USED (old_block);
608 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
609 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
610 BLOCK_NONLOCALIZED_VARS (new_block)
611 = VEC_copy (tree, gc, BLOCK_NONLOCALIZED_VARS (old_block));
614 /* Remap its variables. */
615 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block),
616 &BLOCK_NONLOCALIZED_VARS (new_block),
619 if (id->transform_lang_insert_block)
620 id->transform_lang_insert_block (new_block);
622 /* Remember the remapped block. */
623 insert_decl_map (id, old_block, new_block);
626 /* Copy the whole block tree and root it in id->block. */
628 remap_blocks (tree block, copy_body_data *id)
631 tree new_tree = block;
636 remap_block (&new_tree, id);
637 gcc_assert (new_tree != block);
638 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
639 prepend_lexical_block (new_tree, remap_blocks (t, id));
640 /* Blocks are in arbitrary order, but make things slightly prettier and do
641 not swap order when producing a copy. */
642 BLOCK_SUBBLOCKS (new_tree) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree));
647 copy_statement_list (tree *tp)
649 tree_stmt_iterator oi, ni;
652 new_tree = alloc_stmt_list ();
653 ni = tsi_start (new_tree);
654 oi = tsi_start (*tp);
655 TREE_TYPE (new_tree) = TREE_TYPE (*tp);
658 for (; !tsi_end_p (oi); tsi_next (&oi))
660 tree stmt = tsi_stmt (oi);
661 if (TREE_CODE (stmt) == STATEMENT_LIST)
662 copy_statement_list (&stmt);
663 tsi_link_after (&ni, stmt, TSI_CONTINUE_LINKING);
668 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
670 tree block = BIND_EXPR_BLOCK (*tp);
671 /* Copy (and replace) the statement. */
672 copy_tree_r (tp, walk_subtrees, NULL);
675 remap_block (&block, id);
676 BIND_EXPR_BLOCK (*tp) = block;
679 if (BIND_EXPR_VARS (*tp))
680 /* This will remap a lot of the same decls again, but this should be
682 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), NULL, id);
686 /* Create a new gimple_seq by remapping all the statements in BODY
687 using the inlining information in ID. */
690 remap_gimple_seq (gimple_seq body, copy_body_data *id)
692 gimple_stmt_iterator si;
693 gimple_seq new_body = NULL;
695 for (si = gsi_start (body); !gsi_end_p (si); gsi_next (&si))
697 gimple new_stmt = remap_gimple_stmt (gsi_stmt (si), id);
698 gimple_seq_add_stmt (&new_body, new_stmt);
705 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
706 block using the mapping information in ID. */
709 copy_gimple_bind (gimple stmt, copy_body_data *id)
712 tree new_block, new_vars;
713 gimple_seq body, new_body;
715 /* Copy the statement. Note that we purposely don't use copy_stmt
716 here because we need to remap statements as we copy. */
717 body = gimple_bind_body (stmt);
718 new_body = remap_gimple_seq (body, id);
720 new_block = gimple_bind_block (stmt);
722 remap_block (&new_block, id);
724 /* This will remap a lot of the same decls again, but this should be
726 new_vars = gimple_bind_vars (stmt);
728 new_vars = remap_decls (new_vars, NULL, id);
730 new_bind = gimple_build_bind (new_vars, new_body, new_block);
736 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
737 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
738 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
739 recursing into the children nodes of *TP. */
742 remap_gimple_op_r (tree *tp, int *walk_subtrees, void *data)
744 struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
745 copy_body_data *id = (copy_body_data *) wi_p->info;
746 tree fn = id->src_fn;
748 if (TREE_CODE (*tp) == SSA_NAME)
750 *tp = remap_ssa_name (*tp, id);
754 else if (auto_var_in_fn_p (*tp, fn))
756 /* Local variables and labels need to be replaced by equivalent
757 variables. We don't want to copy static variables; there's
758 only one of those, no matter how many times we inline the
759 containing function. Similarly for globals from an outer
763 /* Remap the declaration. */
764 new_decl = remap_decl (*tp, id);
765 gcc_assert (new_decl);
766 /* Replace this variable with the copy. */
767 STRIP_TYPE_NOPS (new_decl);
768 /* ??? The C++ frontend uses void * pointer zero to initialize
769 any other type. This confuses the middle-end type verification.
770 As cloned bodies do not go through gimplification again the fixup
771 there doesn't trigger. */
772 if (TREE_CODE (new_decl) == INTEGER_CST
773 && !useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (new_decl)))
774 new_decl = fold_convert (TREE_TYPE (*tp), new_decl);
778 else if (TREE_CODE (*tp) == STATEMENT_LIST)
780 else if (TREE_CODE (*tp) == SAVE_EXPR)
782 else if (TREE_CODE (*tp) == LABEL_DECL
783 && (!DECL_CONTEXT (*tp)
784 || decl_function_context (*tp) == id->src_fn))
785 /* These may need to be remapped for EH handling. */
786 *tp = remap_decl (*tp, id);
787 else if (TYPE_P (*tp))
788 /* Types may need remapping as well. */
789 *tp = remap_type (*tp, id);
790 else if (CONSTANT_CLASS_P (*tp))
792 /* If this is a constant, we have to copy the node iff the type
793 will be remapped. copy_tree_r will not copy a constant. */
794 tree new_type = remap_type (TREE_TYPE (*tp), id);
796 if (new_type == TREE_TYPE (*tp))
799 else if (TREE_CODE (*tp) == INTEGER_CST)
800 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
801 TREE_INT_CST_HIGH (*tp));
804 *tp = copy_node (*tp);
805 TREE_TYPE (*tp) = new_type;
810 /* Otherwise, just copy the node. Note that copy_tree_r already
811 knows not to copy VAR_DECLs, etc., so this is safe. */
812 if (TREE_CODE (*tp) == MEM_REF)
814 /* We need to re-canonicalize MEM_REFs from inline substitutions
815 that can happen when a pointer argument is an ADDR_EXPR. */
816 tree decl = TREE_OPERAND (*tp, 0);
819 /* See remap_ssa_name. */
820 if (TREE_CODE (decl) == SSA_NAME
821 && TREE_CODE (SSA_NAME_VAR (decl)) == RESULT_DECL
822 && id->transform_return_to_modify)
823 decl = SSA_NAME_VAR (decl);
825 n = (tree *) pointer_map_contains (id->decl_map, decl);
829 tree ptr = unshare_expr (*n);
831 if ((tem = maybe_fold_offset_to_reference (EXPR_LOCATION (*tp),
833 TREE_OPERAND (*tp, 1),
835 && TREE_THIS_VOLATILE (tem) == TREE_THIS_VOLATILE (old))
837 tree *tem_basep = &tem;
838 while (handled_component_p (*tem_basep))
839 tem_basep = &TREE_OPERAND (*tem_basep, 0);
840 if (TREE_CODE (*tem_basep) == MEM_REF)
842 = build2 (MEM_REF, TREE_TYPE (*tem_basep),
843 TREE_OPERAND (*tem_basep, 0),
844 fold_convert (TREE_TYPE (TREE_OPERAND (*tp, 1)),
845 TREE_OPERAND (*tem_basep, 1)));
848 = build2 (MEM_REF, TREE_TYPE (*tem_basep),
849 build_fold_addr_expr (*tem_basep),
851 (TREE_TYPE (TREE_OPERAND (*tp, 1)), 0));
856 *tp = fold_build2 (MEM_REF, TREE_TYPE (*tp),
857 ptr, TREE_OPERAND (*tp, 1));
858 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
859 TREE_THIS_NOTRAP (*tp) = TREE_THIS_NOTRAP (old);
861 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
867 /* Here is the "usual case". Copy this tree node, and then
868 tweak some special cases. */
869 copy_tree_r (tp, walk_subtrees, NULL);
871 /* Global variables we haven't seen yet need to go into referenced
872 vars. If not referenced from types only. */
873 if (gimple_in_ssa_p (cfun)
874 && TREE_CODE (*tp) == VAR_DECL
875 && id->remapping_type_depth == 0
876 && !processing_debug_stmt)
877 add_referenced_var (*tp);
879 /* We should never have TREE_BLOCK set on non-statements. */
881 gcc_assert (!TREE_BLOCK (*tp));
883 if (TREE_CODE (*tp) != OMP_CLAUSE)
884 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
886 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
888 /* The copied TARGET_EXPR has never been expanded, even if the
889 original node was expanded already. */
890 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
891 TREE_OPERAND (*tp, 3) = NULL_TREE;
893 else if (TREE_CODE (*tp) == ADDR_EXPR)
895 /* Variable substitution need not be simple. In particular,
896 the MEM_REF substitution above. Make sure that
897 TREE_CONSTANT and friends are up-to-date. But make sure
898 to not improperly set TREE_BLOCK on some sub-expressions. */
899 int invariant = is_gimple_min_invariant (*tp);
900 tree block = id->block;
901 id->block = NULL_TREE;
902 walk_tree (&TREE_OPERAND (*tp, 0), remap_gimple_op_r, data, NULL);
904 recompute_tree_invariant_for_addr_expr (*tp);
906 /* If this used to be invariant, but is not any longer,
907 then regimplification is probably needed. */
908 if (invariant && !is_gimple_min_invariant (*tp))
909 id->regimplify = true;
915 /* Keep iterating. */
920 /* Called from copy_body_id via walk_tree. DATA is really a
921 `copy_body_data *'. */
924 copy_tree_body_r (tree *tp, int *walk_subtrees, void *data)
926 copy_body_data *id = (copy_body_data *) data;
927 tree fn = id->src_fn;
930 /* Begin by recognizing trees that we'll completely rewrite for the
931 inlining context. Our output for these trees is completely
932 different from out input (e.g. RETURN_EXPR is deleted, and morphs
933 into an edge). Further down, we'll handle trees that get
934 duplicated and/or tweaked. */
936 /* When requested, RETURN_EXPRs should be transformed to just the
937 contained MODIFY_EXPR. The branch semantics of the return will
938 be handled elsewhere by manipulating the CFG rather than a statement. */
939 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
941 tree assignment = TREE_OPERAND (*tp, 0);
943 /* If we're returning something, just turn that into an
944 assignment into the equivalent of the original RESULT_DECL.
945 If the "assignment" is just the result decl, the result
946 decl has already been set (e.g. a recent "foo (&result_decl,
947 ...)"); just toss the entire RETURN_EXPR. */
948 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
950 /* Replace the RETURN_EXPR with (a copy of) the
951 MODIFY_EXPR hanging underneath. */
952 *tp = copy_node (assignment);
954 else /* Else the RETURN_EXPR returns no value. */
957 return (tree) (void *)1;
960 else if (TREE_CODE (*tp) == SSA_NAME)
962 *tp = remap_ssa_name (*tp, id);
967 /* Local variables and labels need to be replaced by equivalent
968 variables. We don't want to copy static variables; there's only
969 one of those, no matter how many times we inline the containing
970 function. Similarly for globals from an outer function. */
971 else if (auto_var_in_fn_p (*tp, fn))
975 /* Remap the declaration. */
976 new_decl = remap_decl (*tp, id);
977 gcc_assert (new_decl);
978 /* Replace this variable with the copy. */
979 STRIP_TYPE_NOPS (new_decl);
983 else if (TREE_CODE (*tp) == STATEMENT_LIST)
984 copy_statement_list (tp);
985 else if (TREE_CODE (*tp) == SAVE_EXPR
986 || TREE_CODE (*tp) == TARGET_EXPR)
987 remap_save_expr (tp, id->decl_map, walk_subtrees);
988 else if (TREE_CODE (*tp) == LABEL_DECL
989 && (! DECL_CONTEXT (*tp)
990 || decl_function_context (*tp) == id->src_fn))
991 /* These may need to be remapped for EH handling. */
992 *tp = remap_decl (*tp, id);
993 else if (TREE_CODE (*tp) == BIND_EXPR)
994 copy_bind_expr (tp, walk_subtrees, id);
995 /* Types may need remapping as well. */
996 else if (TYPE_P (*tp))
997 *tp = remap_type (*tp, id);
999 /* If this is a constant, we have to copy the node iff the type will be
1000 remapped. copy_tree_r will not copy a constant. */
1001 else if (CONSTANT_CLASS_P (*tp))
1003 tree new_type = remap_type (TREE_TYPE (*tp), id);
1005 if (new_type == TREE_TYPE (*tp))
1008 else if (TREE_CODE (*tp) == INTEGER_CST)
1009 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
1010 TREE_INT_CST_HIGH (*tp));
1013 *tp = copy_node (*tp);
1014 TREE_TYPE (*tp) = new_type;
1018 /* Otherwise, just copy the node. Note that copy_tree_r already
1019 knows not to copy VAR_DECLs, etc., so this is safe. */
1022 /* Here we handle trees that are not completely rewritten.
1023 First we detect some inlining-induced bogosities for
1025 if (TREE_CODE (*tp) == MODIFY_EXPR
1026 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
1027 && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn)))
1029 /* Some assignments VAR = VAR; don't generate any rtl code
1030 and thus don't count as variable modification. Avoid
1031 keeping bogosities like 0 = 0. */
1032 tree decl = TREE_OPERAND (*tp, 0), value;
1035 n = (tree *) pointer_map_contains (id->decl_map, decl);
1039 STRIP_TYPE_NOPS (value);
1040 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1042 *tp = build_empty_stmt (EXPR_LOCATION (*tp));
1043 return copy_tree_body_r (tp, walk_subtrees, data);
1047 else if (TREE_CODE (*tp) == INDIRECT_REF)
1049 /* Get rid of *& from inline substitutions that can happen when a
1050 pointer argument is an ADDR_EXPR. */
1051 tree decl = TREE_OPERAND (*tp, 0);
1054 n = (tree *) pointer_map_contains (id->decl_map, decl);
1059 /* If we happen to get an ADDR_EXPR in n->value, strip
1060 it manually here as we'll eventually get ADDR_EXPRs
1061 which lie about their types pointed to. In this case
1062 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1063 but we absolutely rely on that. As fold_indirect_ref
1064 does other useful transformations, try that first, though. */
1065 tree type = TREE_TYPE (TREE_TYPE (*n));
1066 if (id->do_not_unshare)
1069 new_tree = unshare_expr (*n);
1071 *tp = gimple_fold_indirect_ref (new_tree);
1074 if (TREE_CODE (new_tree) == ADDR_EXPR)
1076 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
1078 /* ??? We should either assert here or build
1079 a VIEW_CONVERT_EXPR instead of blindly leaking
1080 incompatible types to our IL. */
1082 *tp = TREE_OPERAND (new_tree, 0);
1086 *tp = build1 (INDIRECT_REF, type, new_tree);
1087 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1088 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1089 TREE_READONLY (*tp) = TREE_READONLY (old);
1090 TREE_THIS_NOTRAP (*tp) = TREE_THIS_NOTRAP (old);
1097 else if (TREE_CODE (*tp) == MEM_REF)
1099 /* We need to re-canonicalize MEM_REFs from inline substitutions
1100 that can happen when a pointer argument is an ADDR_EXPR. */
1101 tree decl = TREE_OPERAND (*tp, 0);
1104 n = (tree *) pointer_map_contains (id->decl_map, decl);
1108 *tp = fold_build2 (MEM_REF, TREE_TYPE (*tp),
1109 unshare_expr (*n), TREE_OPERAND (*tp, 1));
1110 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1111 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
1117 /* Here is the "usual case". Copy this tree node, and then
1118 tweak some special cases. */
1119 copy_tree_r (tp, walk_subtrees, NULL);
1121 /* Global variables we haven't seen yet needs to go into referenced
1122 vars. If not referenced from types or debug stmts only. */
1123 if (gimple_in_ssa_p (cfun)
1124 && TREE_CODE (*tp) == VAR_DECL
1125 && id->remapping_type_depth == 0
1126 && !processing_debug_stmt)
1127 add_referenced_var (*tp);
1129 /* If EXPR has block defined, map it to newly constructed block.
1130 When inlining we want EXPRs without block appear in the block
1131 of function call if we are not remapping a type. */
1134 new_block = id->remapping_type_depth == 0 ? id->block : NULL;
1135 if (TREE_BLOCK (*tp))
1138 n = (tree *) pointer_map_contains (id->decl_map,
1140 gcc_assert (n || id->remapping_type_depth != 0);
1144 TREE_BLOCK (*tp) = new_block;
1147 if (TREE_CODE (*tp) != OMP_CLAUSE)
1148 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
1150 /* The copied TARGET_EXPR has never been expanded, even if the
1151 original node was expanded already. */
1152 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
1154 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
1155 TREE_OPERAND (*tp, 3) = NULL_TREE;
1158 /* Variable substitution need not be simple. In particular, the
1159 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1160 and friends are up-to-date. */
1161 else if (TREE_CODE (*tp) == ADDR_EXPR)
1163 int invariant = is_gimple_min_invariant (*tp);
1164 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
1166 /* Handle the case where we substituted an INDIRECT_REF
1167 into the operand of the ADDR_EXPR. */
1168 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
1169 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
1171 recompute_tree_invariant_for_addr_expr (*tp);
1173 /* If this used to be invariant, but is not any longer,
1174 then regimplification is probably needed. */
1175 if (invariant && !is_gimple_min_invariant (*tp))
1176 id->regimplify = true;
1182 /* Keep iterating. */
1186 /* Helper for remap_gimple_stmt. Given an EH region number for the
1187 source function, map that to the duplicate EH region number in
1188 the destination function. */
1191 remap_eh_region_nr (int old_nr, copy_body_data *id)
1193 eh_region old_r, new_r;
1196 old_r = get_eh_region_from_number_fn (id->src_cfun, old_nr);
1197 slot = pointer_map_contains (id->eh_map, old_r);
1198 new_r = (eh_region) *slot;
1200 return new_r->index;
1203 /* Similar, but operate on INTEGER_CSTs. */
1206 remap_eh_region_tree_nr (tree old_t_nr, copy_body_data *id)
1210 old_nr = tree_low_cst (old_t_nr, 0);
1211 new_nr = remap_eh_region_nr (old_nr, id);
1213 return build_int_cst (NULL, new_nr);
1216 /* Helper for copy_bb. Remap statement STMT using the inlining
1217 information in ID. Return the new statement copy. */
1220 remap_gimple_stmt (gimple stmt, copy_body_data *id)
1223 struct walk_stmt_info wi;
1225 bool skip_first = false;
1227 /* Begin by recognizing trees that we'll completely rewrite for the
1228 inlining context. Our output for these trees is completely
1229 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1230 into an edge). Further down, we'll handle trees that get
1231 duplicated and/or tweaked. */
1233 /* When requested, GIMPLE_RETURNs should be transformed to just the
1234 contained GIMPLE_ASSIGN. The branch semantics of the return will
1235 be handled elsewhere by manipulating the CFG rather than the
1237 if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify)
1239 tree retval = gimple_return_retval (stmt);
1241 /* If we're returning something, just turn that into an
1242 assignment into the equivalent of the original RESULT_DECL.
1243 If RETVAL is just the result decl, the result decl has
1244 already been set (e.g. a recent "foo (&result_decl, ...)");
1245 just toss the entire GIMPLE_RETURN. */
1247 && (TREE_CODE (retval) != RESULT_DECL
1248 && (TREE_CODE (retval) != SSA_NAME
1249 || TREE_CODE (SSA_NAME_VAR (retval)) != RESULT_DECL)))
1251 copy = gimple_build_assign (id->retvar, retval);
1252 /* id->retvar is already substituted. Skip it on later remapping. */
1256 return gimple_build_nop ();
1258 else if (gimple_has_substatements (stmt))
1262 /* When cloning bodies from the C++ front end, we will be handed bodies
1263 in High GIMPLE form. Handle here all the High GIMPLE statements that
1264 have embedded statements. */
1265 switch (gimple_code (stmt))
1268 copy = copy_gimple_bind (stmt, id);
1272 s1 = remap_gimple_seq (gimple_catch_handler (stmt), id);
1273 copy = gimple_build_catch (gimple_catch_types (stmt), s1);
1276 case GIMPLE_EH_FILTER:
1277 s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id);
1278 copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1);
1282 s1 = remap_gimple_seq (gimple_try_eval (stmt), id);
1283 s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id);
1284 copy = gimple_build_try (s1, s2, gimple_try_kind (stmt));
1287 case GIMPLE_WITH_CLEANUP_EXPR:
1288 s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id);
1289 copy = gimple_build_wce (s1);
1292 case GIMPLE_OMP_PARALLEL:
1293 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1294 copy = gimple_build_omp_parallel
1296 gimple_omp_parallel_clauses (stmt),
1297 gimple_omp_parallel_child_fn (stmt),
1298 gimple_omp_parallel_data_arg (stmt));
1301 case GIMPLE_OMP_TASK:
1302 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1303 copy = gimple_build_omp_task
1305 gimple_omp_task_clauses (stmt),
1306 gimple_omp_task_child_fn (stmt),
1307 gimple_omp_task_data_arg (stmt),
1308 gimple_omp_task_copy_fn (stmt),
1309 gimple_omp_task_arg_size (stmt),
1310 gimple_omp_task_arg_align (stmt));
1313 case GIMPLE_OMP_FOR:
1314 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1315 s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id);
1316 copy = gimple_build_omp_for (s1, gimple_omp_for_clauses (stmt),
1317 gimple_omp_for_collapse (stmt), s2);
1320 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1322 gimple_omp_for_set_index (copy, i,
1323 gimple_omp_for_index (stmt, i));
1324 gimple_omp_for_set_initial (copy, i,
1325 gimple_omp_for_initial (stmt, i));
1326 gimple_omp_for_set_final (copy, i,
1327 gimple_omp_for_final (stmt, i));
1328 gimple_omp_for_set_incr (copy, i,
1329 gimple_omp_for_incr (stmt, i));
1330 gimple_omp_for_set_cond (copy, i,
1331 gimple_omp_for_cond (stmt, i));
1336 case GIMPLE_OMP_MASTER:
1337 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1338 copy = gimple_build_omp_master (s1);
1341 case GIMPLE_OMP_ORDERED:
1342 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1343 copy = gimple_build_omp_ordered (s1);
1346 case GIMPLE_OMP_SECTION:
1347 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1348 copy = gimple_build_omp_section (s1);
1351 case GIMPLE_OMP_SECTIONS:
1352 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1353 copy = gimple_build_omp_sections
1354 (s1, gimple_omp_sections_clauses (stmt));
1357 case GIMPLE_OMP_SINGLE:
1358 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1359 copy = gimple_build_omp_single
1360 (s1, gimple_omp_single_clauses (stmt));
1363 case GIMPLE_OMP_CRITICAL:
1364 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1366 = gimple_build_omp_critical (s1, gimple_omp_critical_name (stmt));
1375 if (gimple_assign_copy_p (stmt)
1376 && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt)
1377 && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn))
1379 /* Here we handle statements that are not completely rewritten.
1380 First we detect some inlining-induced bogosities for
1383 /* Some assignments VAR = VAR; don't generate any rtl code
1384 and thus don't count as variable modification. Avoid
1385 keeping bogosities like 0 = 0. */
1386 tree decl = gimple_assign_lhs (stmt), value;
1389 n = (tree *) pointer_map_contains (id->decl_map, decl);
1393 STRIP_TYPE_NOPS (value);
1394 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1395 return gimple_build_nop ();
1399 if (gimple_debug_bind_p (stmt))
1401 copy = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt),
1402 gimple_debug_bind_get_value (stmt),
1404 VEC_safe_push (gimple, heap, id->debug_stmts, copy);
1408 /* Create a new deep copy of the statement. */
1409 copy = gimple_copy (stmt);
1411 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1412 RESX and EH_DISPATCH. */
1414 switch (gimple_code (copy))
1418 tree r, fndecl = gimple_call_fndecl (copy);
1419 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
1420 switch (DECL_FUNCTION_CODE (fndecl))
1422 case BUILT_IN_EH_COPY_VALUES:
1423 r = gimple_call_arg (copy, 1);
1424 r = remap_eh_region_tree_nr (r, id);
1425 gimple_call_set_arg (copy, 1, r);
1428 case BUILT_IN_EH_POINTER:
1429 case BUILT_IN_EH_FILTER:
1430 r = gimple_call_arg (copy, 0);
1431 r = remap_eh_region_tree_nr (r, id);
1432 gimple_call_set_arg (copy, 0, r);
1439 /* Reset alias info if we didn't apply measures to
1440 keep it valid over inlining by setting DECL_PT_UID. */
1441 if (!id->src_cfun->gimple_df
1442 || !id->src_cfun->gimple_df->ipa_pta)
1443 gimple_call_reset_alias_info (copy);
1449 int r = gimple_resx_region (copy);
1450 r = remap_eh_region_nr (r, id);
1451 gimple_resx_set_region (copy, r);
1455 case GIMPLE_EH_DISPATCH:
1457 int r = gimple_eh_dispatch_region (copy);
1458 r = remap_eh_region_nr (r, id);
1459 gimple_eh_dispatch_set_region (copy, r);
1468 /* If STMT has a block defined, map it to the newly constructed
1469 block. When inlining we want statements without a block to
1470 appear in the block of the function call. */
1471 new_block = id->block;
1472 if (gimple_block (copy))
1475 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (copy));
1480 gimple_set_block (copy, new_block);
1482 if (gimple_debug_bind_p (copy))
1485 /* Remap all the operands in COPY. */
1486 memset (&wi, 0, sizeof (wi));
1489 walk_tree (gimple_op_ptr (copy, 1), remap_gimple_op_r, &wi, NULL);
1491 walk_gimple_op (copy, remap_gimple_op_r, &wi);
1493 /* Clear the copied virtual operands. We are not remapping them here
1494 but are going to recreate them from scratch. */
1495 if (gimple_has_mem_ops (copy))
1497 gimple_set_vdef (copy, NULL_TREE);
1498 gimple_set_vuse (copy, NULL_TREE);
1505 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1509 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale,
1510 gcov_type count_scale)
1512 gimple_stmt_iterator gsi, copy_gsi, seq_gsi;
1513 basic_block copy_basic_block;
1518 /* Search for previous copied basic block. */
1521 prev = prev->prev_bb;
1523 /* create_basic_block() will append every new block to
1524 basic_block_info automatically. */
1525 copy_basic_block = create_basic_block (NULL, (void *) 0,
1526 (basic_block) prev->aux);
1527 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
1529 /* We are going to rebuild frequencies from scratch. These values
1530 have just small importance to drive canonicalize_loop_headers. */
1531 freq = ((gcov_type)bb->frequency * frequency_scale / REG_BR_PROB_BASE);
1533 /* We recompute frequencies after inlining, so this is quite safe. */
1534 if (freq > BB_FREQ_MAX)
1536 copy_basic_block->frequency = freq;
1538 copy_gsi = gsi_start_bb (copy_basic_block);
1540 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1542 gimple stmt = gsi_stmt (gsi);
1543 gimple orig_stmt = stmt;
1545 id->regimplify = false;
1546 stmt = remap_gimple_stmt (stmt, id);
1547 if (gimple_nop_p (stmt))
1550 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
1553 /* With return slot optimization we can end up with
1554 non-gimple (foo *)&this->m, fix that here. */
1555 if (is_gimple_assign (stmt)
1556 && gimple_assign_rhs_code (stmt) == NOP_EXPR
1557 && !is_gimple_val (gimple_assign_rhs1 (stmt)))
1560 new_rhs = force_gimple_operand_gsi (&seq_gsi,
1561 gimple_assign_rhs1 (stmt),
1563 GSI_CONTINUE_LINKING);
1564 gimple_assign_set_rhs1 (stmt, new_rhs);
1565 id->regimplify = false;
1568 gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT);
1571 gimple_regimplify_operands (stmt, &seq_gsi);
1573 /* If copy_basic_block has been empty at the start of this iteration,
1574 call gsi_start_bb again to get at the newly added statements. */
1575 if (gsi_end_p (copy_gsi))
1576 copy_gsi = gsi_start_bb (copy_basic_block);
1578 gsi_next (©_gsi);
1580 /* Process the new statement. The call to gimple_regimplify_operands
1581 possibly turned the statement into multiple statements, we
1582 need to process all of them. */
1587 stmt = gsi_stmt (copy_gsi);
1588 if (is_gimple_call (stmt)
1589 && gimple_call_va_arg_pack_p (stmt)
1592 /* __builtin_va_arg_pack () should be replaced by
1593 all arguments corresponding to ... in the caller. */
1596 VEC(tree, heap) *argarray;
1597 size_t nargs = gimple_call_num_args (id->gimple_call);
1600 for (p = DECL_ARGUMENTS (id->src_fn); p; p = DECL_CHAIN (p))
1603 /* Create the new array of arguments. */
1604 n = nargs + gimple_call_num_args (stmt);
1605 argarray = VEC_alloc (tree, heap, n);
1606 VEC_safe_grow (tree, heap, argarray, n);
1608 /* Copy all the arguments before '...' */
1609 memcpy (VEC_address (tree, argarray),
1610 gimple_call_arg_ptr (stmt, 0),
1611 gimple_call_num_args (stmt) * sizeof (tree));
1613 /* Append the arguments passed in '...' */
1614 memcpy (VEC_address(tree, argarray) + gimple_call_num_args (stmt),
1615 gimple_call_arg_ptr (id->gimple_call, 0)
1616 + (gimple_call_num_args (id->gimple_call) - nargs),
1617 nargs * sizeof (tree));
1619 new_call = gimple_build_call_vec (gimple_call_fn (stmt),
1622 VEC_free (tree, heap, argarray);
1624 /* Copy all GIMPLE_CALL flags, location and block, except
1625 GF_CALL_VA_ARG_PACK. */
1626 gimple_call_copy_flags (new_call, stmt);
1627 gimple_call_set_va_arg_pack (new_call, false);
1628 gimple_set_location (new_call, gimple_location (stmt));
1629 gimple_set_block (new_call, gimple_block (stmt));
1630 gimple_call_set_lhs (new_call, gimple_call_lhs (stmt));
1632 gsi_replace (©_gsi, new_call, false);
1635 else if (is_gimple_call (stmt)
1637 && (decl = gimple_call_fndecl (stmt))
1638 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1639 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN)
1641 /* __builtin_va_arg_pack_len () should be replaced by
1642 the number of anonymous arguments. */
1643 size_t nargs = gimple_call_num_args (id->gimple_call);
1647 for (p = DECL_ARGUMENTS (id->src_fn); p; p = DECL_CHAIN (p))
1650 count = build_int_cst (integer_type_node, nargs);
1651 new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count);
1652 gsi_replace (©_gsi, new_stmt, false);
1656 /* Statements produced by inlining can be unfolded, especially
1657 when we constant propagated some operands. We can't fold
1658 them right now for two reasons:
1659 1) folding require SSA_NAME_DEF_STMTs to be correct
1660 2) we can't change function calls to builtins.
1661 So we just mark statement for later folding. We mark
1662 all new statements, instead just statements that has changed
1663 by some nontrivial substitution so even statements made
1664 foldable indirectly are updated. If this turns out to be
1665 expensive, copy_body can be told to watch for nontrivial
1667 if (id->statements_to_fold)
1668 pointer_set_insert (id->statements_to_fold, stmt);
1670 /* We're duplicating a CALL_EXPR. Find any corresponding
1671 callgraph edges and update or duplicate them. */
1672 if (is_gimple_call (stmt))
1674 struct cgraph_edge *edge;
1677 switch (id->transform_call_graph_edges)
1679 case CB_CGE_DUPLICATE:
1680 edge = cgraph_edge (id->src_node, orig_stmt);
1683 int edge_freq = edge->frequency;
1684 edge = cgraph_clone_edge (edge, id->dst_node, stmt,
1686 REG_BR_PROB_BASE, CGRAPH_FREQ_BASE,
1687 edge->frequency, true);
1688 /* We could also just rescale the frequency, but
1689 doing so would introduce roundoff errors and make
1690 verifier unhappy. */
1692 = compute_call_stmt_bb_frequency (id->dst_node->decl,
1695 && profile_status_for_function (cfun) != PROFILE_ABSENT
1696 && (edge_freq > edge->frequency + 10
1697 || edge_freq < edge->frequency - 10))
1699 fprintf (dump_file, "Edge frequency estimated by "
1700 "cgraph %i diverge from inliner's estimate %i\n",
1704 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1707 copy_basic_block->frequency);
1709 stmt = cgraph_redirect_edge_call_stmt_to_callee (edge);
1713 case CB_CGE_MOVE_CLONES:
1714 cgraph_set_call_stmt_including_clones (id->dst_node,
1716 edge = cgraph_edge (id->dst_node, stmt);
1720 edge = cgraph_edge (id->dst_node, orig_stmt);
1722 cgraph_set_call_stmt (edge, stmt);
1729 /* Constant propagation on argument done during inlining
1730 may create new direct call. Produce an edge for it. */
1732 || (edge->indirect_inlining_edge
1733 && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES))
1734 && (fn = gimple_call_fndecl (stmt)) != NULL)
1736 struct cgraph_node *dest = cgraph_node (fn);
1738 /* We have missing edge in the callgraph. This can happen
1739 when previous inlining turned an indirect call into a
1740 direct call by constant propagating arguments or we are
1741 producing dead clone (for further cloning). In all
1742 other cases we hit a bug (incorrect node sharing is the
1743 most common reason for missing edges). */
1744 gcc_assert (dest->needed || !dest->analyzed
1745 || dest->address_taken
1746 || !id->src_node->analyzed
1747 || !id->dst_node->analyzed);
1748 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)
1749 cgraph_create_edge_including_clones
1750 (id->dst_node, dest, orig_stmt, stmt, bb->count,
1751 compute_call_stmt_bb_frequency (id->dst_node->decl,
1753 bb->loop_depth, CIF_ORIGINALLY_INDIRECT_CALL);
1755 cgraph_create_edge (id->dst_node, dest, stmt,
1757 compute_call_stmt_bb_frequency
1758 (id->dst_node->decl, copy_basic_block),
1759 bb->loop_depth)->inline_failed
1760 = CIF_ORIGINALLY_INDIRECT_CALL;
1763 fprintf (dump_file, "Created new direct edge to %s\n",
1764 cgraph_node_name (dest));
1768 flags = gimple_call_flags (stmt);
1769 if (flags & ECF_MAY_BE_ALLOCA)
1770 cfun->calls_alloca = true;
1771 if (flags & ECF_RETURNS_TWICE)
1772 cfun->calls_setjmp = true;
1775 maybe_duplicate_eh_stmt_fn (cfun, stmt, id->src_cfun, orig_stmt,
1776 id->eh_map, id->eh_lp_nr);
1778 if (gimple_in_ssa_p (cfun) && !is_gimple_debug (stmt))
1783 find_new_referenced_vars (gsi_stmt (copy_gsi));
1784 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1785 if (TREE_CODE (def) == SSA_NAME)
1786 SSA_NAME_DEF_STMT (def) = stmt;
1789 gsi_next (©_gsi);
1791 while (!gsi_end_p (copy_gsi));
1793 copy_gsi = gsi_last_bb (copy_basic_block);
1796 return copy_basic_block;
1799 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1800 form is quite easy, since dominator relationship for old basic blocks does
1803 There is however exception where inlining might change dominator relation
1804 across EH edges from basic block within inlined functions destinating
1805 to landing pads in function we inline into.
1807 The function fills in PHI_RESULTs of such PHI nodes if they refer
1808 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1809 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1810 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1811 set, and this means that there will be no overlapping live ranges
1812 for the underlying symbol.
1814 This might change in future if we allow redirecting of EH edges and
1815 we might want to change way build CFG pre-inlining to include
1816 all the possible edges then. */
1818 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1819 bool can_throw, bool nonlocal_goto)
1824 FOR_EACH_EDGE (e, ei, bb->succs)
1826 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1829 gimple_stmt_iterator si;
1832 gcc_assert (e->flags & EDGE_EH);
1835 gcc_assert (!(e->flags & EDGE_EH));
1837 for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
1841 phi = gsi_stmt (si);
1843 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1844 gcc_assert (!e->dest->aux);
1846 gcc_assert ((e->flags & EDGE_EH)
1847 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
1849 if (!is_gimple_reg (PHI_RESULT (phi)))
1851 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi)));
1855 re = find_edge (ret_bb, e->dest);
1857 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1858 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1860 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1861 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1867 /* Copy edges from BB into its copy constructed earlier, scale profile
1868 accordingly. Edges will be taken care of later. Assume aux
1869 pointers to point to the copies of each BB. Return true if any
1870 debug stmts are left after a statement that must end the basic block. */
1873 copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb)
1875 basic_block new_bb = (basic_block) bb->aux;
1878 gimple_stmt_iterator si;
1880 bool need_debug_cleanup = false;
1882 /* Use the indices from the original blocks to create edges for the
1884 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1885 if (!(old_edge->flags & EDGE_EH))
1889 flags = old_edge->flags;
1891 /* Return edges do get a FALLTHRU flag when the get inlined. */
1892 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1893 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1894 flags |= EDGE_FALLTHRU;
1895 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1896 new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1897 new_edge->probability = old_edge->probability;
1900 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1903 for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
1906 bool can_throw, nonlocal_goto;
1908 copy_stmt = gsi_stmt (si);
1909 if (!is_gimple_debug (copy_stmt))
1911 update_stmt (copy_stmt);
1912 if (gimple_in_ssa_p (cfun))
1913 mark_symbols_for_renaming (copy_stmt);
1916 /* Do this before the possible split_block. */
1919 /* If this tree could throw an exception, there are two
1920 cases where we need to add abnormal edge(s): the
1921 tree wasn't in a region and there is a "current
1922 region" in the caller; or the original tree had
1923 EH edges. In both cases split the block after the tree,
1924 and add abnormal edge(s) as needed; we need both
1925 those from the callee and the caller.
1926 We check whether the copy can throw, because the const
1927 propagation can change an INDIRECT_REF which throws
1928 into a COMPONENT_REF which doesn't. If the copy
1929 can throw, the original could also throw. */
1930 can_throw = stmt_can_throw_internal (copy_stmt);
1931 nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt);
1933 if (can_throw || nonlocal_goto)
1935 if (!gsi_end_p (si))
1937 while (!gsi_end_p (si) && is_gimple_debug (gsi_stmt (si)))
1940 need_debug_cleanup = true;
1942 if (!gsi_end_p (si))
1943 /* Note that bb's predecessor edges aren't necessarily
1944 right at this point; split_block doesn't care. */
1946 edge e = split_block (new_bb, copy_stmt);
1949 new_bb->aux = e->src->aux;
1950 si = gsi_start_bb (new_bb);
1954 if (gimple_code (copy_stmt) == GIMPLE_EH_DISPATCH)
1955 make_eh_dispatch_edges (copy_stmt);
1957 make_eh_edges (copy_stmt);
1960 make_abnormal_goto_edges (gimple_bb (copy_stmt), true);
1962 if ((can_throw || nonlocal_goto)
1963 && gimple_in_ssa_p (cfun))
1964 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
1965 can_throw, nonlocal_goto);
1967 return need_debug_cleanup;
1970 /* Copy the PHIs. All blocks and edges are copied, some blocks
1971 was possibly split and new outgoing EH edges inserted.
1972 BB points to the block of original function and AUX pointers links
1973 the original and newly copied blocks. */
1976 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1978 basic_block const new_bb = (basic_block) bb->aux;
1981 gimple_stmt_iterator si;
1983 bool inserted = false;
1985 for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si))
1990 phi = gsi_stmt (si);
1991 res = PHI_RESULT (phi);
1993 if (is_gimple_reg (res))
1995 walk_tree (&new_res, copy_tree_body_r, id, NULL);
1996 SSA_NAME_DEF_STMT (new_res)
1997 = new_phi = create_phi_node (new_res, new_bb);
1998 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
2000 edge old_edge = find_edge ((basic_block) new_edge->src->aux, bb);
2003 tree block = id->block;
2006 /* When doing partial cloning, we allow PHIs on the entry block
2007 as long as all the arguments are the same. Find any input
2008 edge to see argument to copy. */
2010 FOR_EACH_EDGE (old_edge, ei2, bb->preds)
2011 if (!old_edge->src->aux)
2014 arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
2016 id->block = NULL_TREE;
2017 walk_tree (&new_arg, copy_tree_body_r, id, NULL);
2019 gcc_assert (new_arg);
2020 /* With return slot optimization we can end up with
2021 non-gimple (foo *)&this->m, fix that here. */
2022 if (TREE_CODE (new_arg) != SSA_NAME
2023 && TREE_CODE (new_arg) != FUNCTION_DECL
2024 && !is_gimple_val (new_arg))
2026 gimple_seq stmts = NULL;
2027 new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
2028 gsi_insert_seq_on_edge (new_edge, stmts);
2031 add_phi_arg (new_phi, new_arg, new_edge,
2032 gimple_phi_arg_location_from_edge (phi, old_edge));
2037 /* Commit the delayed edge insertions. */
2039 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
2040 gsi_commit_one_edge_insert (new_edge, NULL);
2044 /* Wrapper for remap_decl so it can be used as a callback. */
2047 remap_decl_1 (tree decl, void *data)
2049 return remap_decl (decl, (copy_body_data *) data);
2052 /* Build struct function and associated datastructures for the new clone
2053 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
2056 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count)
2058 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2059 gcov_type count_scale;
2061 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
2062 count_scale = (REG_BR_PROB_BASE * count
2063 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
2065 count_scale = REG_BR_PROB_BASE;
2067 /* Register specific tree functions. */
2068 gimple_register_cfg_hooks ();
2070 /* Get clean struct function. */
2071 push_struct_function (new_fndecl);
2073 /* We will rebuild these, so just sanity check that they are empty. */
2074 gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
2075 gcc_assert (cfun->local_decls == NULL);
2076 gcc_assert (cfun->cfg == NULL);
2077 gcc_assert (cfun->decl == new_fndecl);
2079 /* Copy items we preserve during cloning. */
2080 cfun->static_chain_decl = src_cfun->static_chain_decl;
2081 cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
2082 cfun->function_end_locus = src_cfun->function_end_locus;
2083 cfun->curr_properties = src_cfun->curr_properties;
2084 cfun->last_verified = src_cfun->last_verified;
2085 cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
2086 cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
2087 cfun->has_nonlocal_label = src_cfun->has_nonlocal_label;
2088 cfun->stdarg = src_cfun->stdarg;
2089 cfun->dont_save_pending_sizes_p = src_cfun->dont_save_pending_sizes_p;
2090 cfun->after_inlining = src_cfun->after_inlining;
2091 cfun->can_throw_non_call_exceptions
2092 = src_cfun->can_throw_non_call_exceptions;
2093 cfun->returns_struct = src_cfun->returns_struct;
2094 cfun->returns_pcc_struct = src_cfun->returns_pcc_struct;
2095 cfun->after_tree_profile = src_cfun->after_tree_profile;
2097 init_empty_tree_cfg ();
2099 profile_status_for_function (cfun) = profile_status_for_function (src_cfun);
2100 ENTRY_BLOCK_PTR->count =
2101 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2103 ENTRY_BLOCK_PTR->frequency
2104 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2105 EXIT_BLOCK_PTR->count =
2106 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2108 EXIT_BLOCK_PTR->frequency =
2109 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2111 init_eh_for_function ();
2113 if (src_cfun->gimple_df)
2115 init_tree_ssa (cfun);
2116 cfun->gimple_df->in_ssa_p = true;
2117 init_ssa_operands ();
2122 /* Helper function for copy_cfg_body. Move debug stmts from the end
2123 of NEW_BB to the beginning of successor basic blocks when needed. If the
2124 successor has multiple predecessors, reset them, otherwise keep
2128 maybe_move_debug_stmts_to_successors (copy_body_data *id, basic_block new_bb)
2132 gimple_stmt_iterator si = gsi_last_nondebug_bb (new_bb);
2135 || gsi_one_before_end_p (si)
2136 || !(stmt_can_throw_internal (gsi_stmt (si))
2137 || stmt_can_make_abnormal_goto (gsi_stmt (si))))
2140 FOR_EACH_EDGE (e, ei, new_bb->succs)
2142 gimple_stmt_iterator ssi = gsi_last_bb (new_bb);
2143 gimple_stmt_iterator dsi = gsi_after_labels (e->dest);
2144 while (is_gimple_debug (gsi_stmt (ssi)))
2146 gimple stmt = gsi_stmt (ssi), new_stmt;
2150 /* For the last edge move the debug stmts instead of copying
2152 if (ei_one_before_end_p (ei))
2156 if (!single_pred_p (e->dest))
2157 gimple_debug_bind_reset_value (stmt);
2158 gsi_remove (&si, false);
2159 gsi_insert_before (&dsi, stmt, GSI_SAME_STMT);
2163 var = gimple_debug_bind_get_var (stmt);
2164 if (single_pred_p (e->dest))
2166 value = gimple_debug_bind_get_value (stmt);
2167 value = unshare_expr (value);
2171 new_stmt = gimple_build_debug_bind (var, value, stmt);
2172 gsi_insert_before (&dsi, new_stmt, GSI_SAME_STMT);
2173 VEC_safe_push (gimple, heap, id->debug_stmts, new_stmt);
2179 /* Make a copy of the body of FN so that it can be inserted inline in
2180 another function. Walks FN via CFG, returns new fndecl. */
2183 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency_scale,
2184 basic_block entry_block_map, basic_block exit_block_map,
2185 bitmap blocks_to_copy, basic_block new_entry)
2187 tree callee_fndecl = id->src_fn;
2188 /* Original cfun for the callee, doesn't change. */
2189 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2190 struct function *cfun_to_copy;
2192 tree new_fndecl = NULL;
2193 bool need_debug_cleanup = false;
2194 gcov_type count_scale;
2196 int incoming_frequency = 0;
2197 gcov_type incoming_count = 0;
2199 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
2200 count_scale = (REG_BR_PROB_BASE * count
2201 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
2203 count_scale = REG_BR_PROB_BASE;
2205 /* Register specific tree functions. */
2206 gimple_register_cfg_hooks ();
2208 /* If we are inlining just region of the function, make sure to connect new entry
2209 to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute
2210 frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and
2211 probabilities of edges incoming from nonduplicated region. */
2217 FOR_EACH_EDGE (e, ei, new_entry->preds)
2220 incoming_frequency += EDGE_FREQUENCY (e);
2221 incoming_count += e->count;
2223 incoming_count = incoming_count * count_scale / REG_BR_PROB_BASE;
2225 = incoming_frequency * frequency_scale / REG_BR_PROB_BASE;
2226 ENTRY_BLOCK_PTR->count = incoming_count;
2227 ENTRY_BLOCK_PTR->frequency = incoming_frequency;
2230 /* Must have a CFG here at this point. */
2231 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2232 (DECL_STRUCT_FUNCTION (callee_fndecl)));
2234 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2236 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
2237 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
2238 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2239 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2241 /* Duplicate any exception-handling regions. */
2243 id->eh_map = duplicate_eh_regions (cfun_to_copy, NULL, id->eh_lp_nr,
2246 /* Use aux pointers to map the original blocks to copy. */
2247 FOR_EACH_BB_FN (bb, cfun_to_copy)
2248 if (!blocks_to_copy || bitmap_bit_p (blocks_to_copy, bb->index))
2250 basic_block new_bb = copy_bb (id, bb, frequency_scale, count_scale);
2255 last = last_basic_block;
2257 /* Now that we've duplicated the blocks, duplicate their edges. */
2258 FOR_ALL_BB_FN (bb, cfun_to_copy)
2260 || (bb->index > 0 && bitmap_bit_p (blocks_to_copy, bb->index)))
2261 need_debug_cleanup |= copy_edges_for_bb (bb, count_scale, exit_block_map);
2265 edge e = make_edge (entry_block_map, (basic_block)new_entry->aux, EDGE_FALLTHRU);
2266 e->probability = REG_BR_PROB_BASE;
2267 e->count = incoming_count;
2270 if (gimple_in_ssa_p (cfun))
2271 FOR_ALL_BB_FN (bb, cfun_to_copy)
2273 || (bb->index > 0 && bitmap_bit_p (blocks_to_copy, bb->index)))
2274 copy_phis_for_bb (bb, id);
2276 FOR_ALL_BB_FN (bb, cfun_to_copy)
2279 if (need_debug_cleanup
2280 && bb->index != ENTRY_BLOCK
2281 && bb->index != EXIT_BLOCK)
2282 maybe_move_debug_stmts_to_successors (id, (basic_block) bb->aux);
2283 ((basic_block)bb->aux)->aux = NULL;
2287 /* Zero out AUX fields of newly created block during EH edge
2289 for (; last < last_basic_block; last++)
2291 if (need_debug_cleanup)
2292 maybe_move_debug_stmts_to_successors (id, BASIC_BLOCK (last));
2293 BASIC_BLOCK (last)->aux = NULL;
2295 entry_block_map->aux = NULL;
2296 exit_block_map->aux = NULL;
2300 pointer_map_destroy (id->eh_map);
2307 /* Copy the debug STMT using ID. We deal with these statements in a
2308 special way: if any variable in their VALUE expression wasn't
2309 remapped yet, we won't remap it, because that would get decl uids
2310 out of sync, causing codegen differences between -g and -g0. If
2311 this arises, we drop the VALUE expression altogether. */
2314 copy_debug_stmt (gimple stmt, copy_body_data *id)
2317 struct walk_stmt_info wi;
2320 if (gimple_block (stmt))
2323 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (stmt));
2327 gimple_set_block (stmt, t);
2329 /* Remap all the operands in COPY. */
2330 memset (&wi, 0, sizeof (wi));
2333 processing_debug_stmt = 1;
2335 t = gimple_debug_bind_get_var (stmt);
2337 if (TREE_CODE (t) == PARM_DECL && id->debug_map
2338 && (n = (tree *) pointer_map_contains (id->debug_map, t)))
2340 gcc_assert (TREE_CODE (*n) == VAR_DECL);
2343 else if (TREE_CODE (t) == VAR_DECL
2345 && gimple_in_ssa_p (cfun)
2346 && !pointer_map_contains (id->decl_map, t)
2348 /* T is a non-localized variable. */;
2350 walk_tree (&t, remap_gimple_op_r, &wi, NULL);
2352 gimple_debug_bind_set_var (stmt, t);
2354 if (gimple_debug_bind_has_value_p (stmt))
2355 walk_tree (gimple_debug_bind_get_value_ptr (stmt),
2356 remap_gimple_op_r, &wi, NULL);
2358 /* Punt if any decl couldn't be remapped. */
2359 if (processing_debug_stmt < 0)
2360 gimple_debug_bind_reset_value (stmt);
2362 processing_debug_stmt = 0;
2365 if (gimple_in_ssa_p (cfun))
2366 mark_symbols_for_renaming (stmt);
2369 /* Process deferred debug stmts. In order to give values better odds
2370 of being successfully remapped, we delay the processing of debug
2371 stmts until all other stmts that might require remapping are
2375 copy_debug_stmts (copy_body_data *id)
2380 if (!id->debug_stmts)
2383 FOR_EACH_VEC_ELT (gimple, id->debug_stmts, i, stmt)
2384 copy_debug_stmt (stmt, id);
2386 VEC_free (gimple, heap, id->debug_stmts);
2389 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2390 another function. */
2393 copy_tree_body (copy_body_data *id)
2395 tree fndecl = id->src_fn;
2396 tree body = DECL_SAVED_TREE (fndecl);
2398 walk_tree (&body, copy_tree_body_r, id, NULL);
2403 /* Make a copy of the body of FN so that it can be inserted inline in
2404 another function. */
2407 copy_body (copy_body_data *id, gcov_type count, int frequency_scale,
2408 basic_block entry_block_map, basic_block exit_block_map,
2409 bitmap blocks_to_copy, basic_block new_entry)
2411 tree fndecl = id->src_fn;
2414 /* If this body has a CFG, walk CFG and copy. */
2415 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
2416 body = copy_cfg_body (id, count, frequency_scale, entry_block_map, exit_block_map,
2417 blocks_to_copy, new_entry);
2418 copy_debug_stmts (id);
2423 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2424 defined in function FN, or of a data member thereof. */
2427 self_inlining_addr_expr (tree value, tree fn)
2431 if (TREE_CODE (value) != ADDR_EXPR)
2434 var = get_base_address (TREE_OPERAND (value, 0));
2436 return var && auto_var_in_fn_p (var, fn);
2439 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2440 lexical block and line number information from base_stmt, if given,
2441 or from the last stmt of the block otherwise. */
2444 insert_init_debug_bind (copy_body_data *id,
2445 basic_block bb, tree var, tree value,
2449 gimple_stmt_iterator gsi;
2452 if (!gimple_in_ssa_p (id->src_cfun))
2455 if (!MAY_HAVE_DEBUG_STMTS)
2458 tracked_var = target_for_debug_bind (var);
2464 gsi = gsi_last_bb (bb);
2465 if (!base_stmt && !gsi_end_p (gsi))
2466 base_stmt = gsi_stmt (gsi);
2469 note = gimple_build_debug_bind (tracked_var, value, base_stmt);
2473 if (!gsi_end_p (gsi))
2474 gsi_insert_after (&gsi, note, GSI_SAME_STMT);
2476 gsi_insert_before (&gsi, note, GSI_SAME_STMT);
2483 insert_init_stmt (copy_body_data *id, basic_block bb, gimple init_stmt)
2485 /* If VAR represents a zero-sized variable, it's possible that the
2486 assignment statement may result in no gimple statements. */
2489 gimple_stmt_iterator si = gsi_last_bb (bb);
2491 /* We can end up with init statements that store to a non-register
2492 from a rhs with a conversion. Handle that here by forcing the
2493 rhs into a temporary. gimple_regimplify_operands is not
2494 prepared to do this for us. */
2495 if (!is_gimple_debug (init_stmt)
2496 && !is_gimple_reg (gimple_assign_lhs (init_stmt))
2497 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt)))
2498 && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS)
2500 tree rhs = build1 (gimple_assign_rhs_code (init_stmt),
2501 gimple_expr_type (init_stmt),
2502 gimple_assign_rhs1 (init_stmt));
2503 rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false,
2505 gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs));
2506 gimple_assign_set_rhs1 (init_stmt, rhs);
2508 gsi_insert_after (&si, init_stmt, GSI_NEW_STMT);
2509 gimple_regimplify_operands (init_stmt, &si);
2510 mark_symbols_for_renaming (init_stmt);
2512 if (!is_gimple_debug (init_stmt) && MAY_HAVE_DEBUG_STMTS)
2514 tree var, def = gimple_assign_lhs (init_stmt);
2516 if (TREE_CODE (def) == SSA_NAME)
2517 var = SSA_NAME_VAR (def);
2521 insert_init_debug_bind (id, bb, var, def, init_stmt);
2526 /* Initialize parameter P with VALUE. If needed, produce init statement
2527 at the end of BB. When BB is NULL, we return init statement to be
2530 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
2531 basic_block bb, tree *vars)
2533 gimple init_stmt = NULL;
2536 tree def = (gimple_in_ssa_p (cfun)
2537 ? gimple_default_def (id->src_cfun, p) : NULL);
2540 && value != error_mark_node
2541 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
2543 if (fold_convertible_p (TREE_TYPE (p), value))
2544 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
2546 /* ??? For valid (GIMPLE) programs we should not end up here.
2547 Still if something has gone wrong and we end up with truly
2548 mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2549 to not leak invalid GIMPLE to the following passes. */
2550 rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value);
2553 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2554 here since the type of this decl must be visible to the calling
2556 var = copy_decl_to_var (p, id);
2558 /* We're actually using the newly-created var. */
2559 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
2562 add_referenced_var (var);
2565 /* Declare this new variable. */
2566 DECL_CHAIN (var) = *vars;
2569 /* Make gimplifier happy about this variable. */
2570 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2572 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2573 we would not need to create a new variable here at all, if it
2574 weren't for debug info. Still, we can just use the argument
2576 if (TREE_READONLY (p)
2577 && !TREE_ADDRESSABLE (p)
2578 && value && !TREE_SIDE_EFFECTS (value)
2581 /* We may produce non-gimple trees by adding NOPs or introduce
2582 invalid sharing when operand is not really constant.
2583 It is not big deal to prohibit constant propagation here as
2584 we will constant propagate in DOM1 pass anyway. */
2585 if (is_gimple_min_invariant (value)
2586 && useless_type_conversion_p (TREE_TYPE (p),
2588 /* We have to be very careful about ADDR_EXPR. Make sure
2589 the base variable isn't a local variable of the inlined
2590 function, e.g., when doing recursive inlining, direct or
2591 mutually-recursive or whatever, which is why we don't
2592 just test whether fn == current_function_decl. */
2593 && ! self_inlining_addr_expr (value, fn))
2595 insert_decl_map (id, p, value);
2596 insert_debug_decl_map (id, p, var);
2597 return insert_init_debug_bind (id, bb, var, value, NULL);
2601 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2602 that way, when the PARM_DECL is encountered, it will be
2603 automatically replaced by the VAR_DECL. */
2604 insert_decl_map (id, p, var);
2606 /* Even if P was TREE_READONLY, the new VAR should not be.
2607 In the original code, we would have constructed a
2608 temporary, and then the function body would have never
2609 changed the value of P. However, now, we will be
2610 constructing VAR directly. The constructor body may
2611 change its value multiple times as it is being
2612 constructed. Therefore, it must not be TREE_READONLY;
2613 the back-end assumes that TREE_READONLY variable is
2614 assigned to only once. */
2615 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
2616 TREE_READONLY (var) = 0;
2618 /* If there is no setup required and we are in SSA, take the easy route
2619 replacing all SSA names representing the function parameter by the
2620 SSA name passed to function.
2622 We need to construct map for the variable anyway as it might be used
2623 in different SSA names when parameter is set in function.
2625 Do replacement at -O0 for const arguments replaced by constant.
2626 This is important for builtin_constant_p and other construct requiring
2627 constant argument to be visible in inlined function body. */
2628 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
2630 || (TREE_READONLY (p)
2631 && is_gimple_min_invariant (rhs)))
2632 && (TREE_CODE (rhs) == SSA_NAME
2633 || is_gimple_min_invariant (rhs))
2634 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
2636 insert_decl_map (id, def, rhs);
2637 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2640 /* If the value of argument is never used, don't care about initializing
2642 if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
2644 gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
2645 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2648 /* Initialize this VAR_DECL from the equivalent argument. Convert
2649 the argument to the proper type in case it was promoted. */
2652 if (rhs == error_mark_node)
2654 insert_decl_map (id, p, var);
2655 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2658 STRIP_USELESS_TYPE_CONVERSION (rhs);
2660 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2661 keep our trees in gimple form. */
2662 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
2664 def = remap_ssa_name (def, id);
2665 init_stmt = gimple_build_assign (def, rhs);
2666 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
2667 set_default_def (var, NULL);
2670 init_stmt = gimple_build_assign (var, rhs);
2672 if (bb && init_stmt)
2673 insert_init_stmt (id, bb, init_stmt);
2678 /* Generate code to initialize the parameters of the function at the
2679 top of the stack in ID from the GIMPLE_CALL STMT. */
2682 initialize_inlined_parameters (copy_body_data *id, gimple stmt,
2683 tree fn, basic_block bb)
2688 tree vars = NULL_TREE;
2689 tree static_chain = gimple_call_chain (stmt);
2691 /* Figure out what the parameters are. */
2692 parms = DECL_ARGUMENTS (fn);
2694 /* Loop through the parameter declarations, replacing each with an
2695 equivalent VAR_DECL, appropriately initialized. */
2696 for (p = parms, i = 0; p; p = DECL_CHAIN (p), i++)
2699 val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL;
2700 setup_one_parameter (id, p, val, fn, bb, &vars);
2702 /* After remapping parameters remap their types. This has to be done
2703 in a second loop over all parameters to appropriately remap
2704 variable sized arrays when the size is specified in a
2705 parameter following the array. */
2706 for (p = parms, i = 0; p; p = DECL_CHAIN (p), i++)
2708 tree *varp = (tree *) pointer_map_contains (id->decl_map, p);
2710 && TREE_CODE (*varp) == VAR_DECL)
2712 tree def = (gimple_in_ssa_p (cfun) && is_gimple_reg (p)
2713 ? gimple_default_def (id->src_cfun, p) : NULL);
2715 TREE_TYPE (var) = remap_type (TREE_TYPE (var), id);
2716 /* Also remap the default definition if it was remapped
2717 to the default definition of the parameter replacement
2718 by the parameter setup. */
2721 tree *defp = (tree *) pointer_map_contains (id->decl_map, def);
2723 && TREE_CODE (*defp) == SSA_NAME
2724 && SSA_NAME_VAR (*defp) == var)
2725 TREE_TYPE (*defp) = TREE_TYPE (var);
2730 /* Initialize the static chain. */
2731 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
2732 gcc_assert (fn != current_function_decl);
2735 /* No static chain? Seems like a bug in tree-nested.c. */
2736 gcc_assert (static_chain);
2738 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
2741 declare_inline_vars (id->block, vars);
2745 /* Declare a return variable to replace the RESULT_DECL for the
2746 function we are calling. An appropriate DECL_STMT is returned.
2747 The USE_STMT is filled to contain a use of the declaration to
2748 indicate the return value of the function.
2750 RETURN_SLOT, if non-null is place where to store the result. It
2751 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2752 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2754 The return value is a (possibly null) value that holds the result
2755 as seen by the caller. */
2758 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
2759 basic_block entry_bb)
2761 tree callee = id->src_fn;
2762 tree caller = id->dst_fn;
2763 tree result = DECL_RESULT (callee);
2764 tree callee_type = TREE_TYPE (result);
2768 /* Handle type-mismatches in the function declaration return type
2769 vs. the call expression. */
2771 caller_type = TREE_TYPE (modify_dest);
2773 caller_type = TREE_TYPE (TREE_TYPE (callee));
2775 /* We don't need to do anything for functions that don't return
2777 if (!result || VOID_TYPE_P (callee_type))
2780 /* If there was a return slot, then the return value is the
2781 dereferenced address of that object. */
2784 /* The front end shouldn't have used both return_slot and
2785 a modify expression. */
2786 gcc_assert (!modify_dest);
2787 if (DECL_BY_REFERENCE (result))
2789 tree return_slot_addr = build_fold_addr_expr (return_slot);
2790 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
2792 /* We are going to construct *&return_slot and we can't do that
2793 for variables believed to be not addressable.
2795 FIXME: This check possibly can match, because values returned
2796 via return slot optimization are not believed to have address
2797 taken by alias analysis. */
2798 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
2799 var = return_slot_addr;
2804 gcc_assert (TREE_CODE (var) != SSA_NAME);
2805 TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
2807 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2808 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2809 && !DECL_GIMPLE_REG_P (result)
2811 DECL_GIMPLE_REG_P (var) = 0;
2816 /* All types requiring non-trivial constructors should have been handled. */
2817 gcc_assert (!TREE_ADDRESSABLE (callee_type));
2819 /* Attempt to avoid creating a new temporary variable. */
2821 && TREE_CODE (modify_dest) != SSA_NAME)
2823 bool use_it = false;
2825 /* We can't use MODIFY_DEST if there's type promotion involved. */
2826 if (!useless_type_conversion_p (callee_type, caller_type))
2829 /* ??? If we're assigning to a variable sized type, then we must
2830 reuse the destination variable, because we've no good way to
2831 create variable sized temporaries at this point. */
2832 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
2835 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2836 reuse it as the result of the call directly. Don't do this if
2837 it would promote MODIFY_DEST to addressable. */
2838 else if (TREE_ADDRESSABLE (result))
2842 tree base_m = get_base_address (modify_dest);
2844 /* If the base isn't a decl, then it's a pointer, and we don't
2845 know where that's going to go. */
2846 if (!DECL_P (base_m))
2848 else if (is_global_var (base_m))
2850 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2851 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2852 && !DECL_GIMPLE_REG_P (result)
2853 && DECL_GIMPLE_REG_P (base_m))
2855 else if (!TREE_ADDRESSABLE (base_m))
2867 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
2869 var = copy_result_decl_to_var (result, id);
2870 if (gimple_in_ssa_p (cfun))
2873 add_referenced_var (var);
2876 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2877 add_local_decl (DECL_STRUCT_FUNCTION (caller), var);
2879 /* Do not have the rest of GCC warn about this variable as it should
2880 not be visible to the user. */
2881 TREE_NO_WARNING (var) = 1;
2883 declare_inline_vars (id->block, var);
2885 /* Build the use expr. If the return type of the function was
2886 promoted, convert it back to the expected type. */
2888 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
2889 use = fold_convert (caller_type, var);
2891 STRIP_USELESS_TYPE_CONVERSION (use);
2893 if (DECL_BY_REFERENCE (result))
2895 TREE_ADDRESSABLE (var) = 1;
2896 var = build_fold_addr_expr (var);
2900 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2901 way, when the RESULT_DECL is encountered, it will be
2902 automatically replaced by the VAR_DECL.
2904 When returning by reference, ensure that RESULT_DECL remaps to
2906 if (DECL_BY_REFERENCE (result)
2907 && !is_gimple_val (var))
2909 tree temp = create_tmp_var (TREE_TYPE (result), "retvalptr");
2910 if (gimple_in_ssa_p (id->src_cfun))
2913 add_referenced_var (temp);
2915 insert_decl_map (id, result, temp);
2916 /* When RESULT_DECL is in SSA form, we need to use it's default_def
2918 if (gimple_in_ssa_p (id->src_cfun) && gimple_default_def (id->src_cfun, result))
2919 temp = remap_ssa_name (gimple_default_def (id->src_cfun, result), id);
2920 insert_init_stmt (id, entry_bb, gimple_build_assign (temp, var));
2923 insert_decl_map (id, result, var);
2925 /* Remember this so we can ignore it in remap_decls. */
2931 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2932 to a local label. */
2935 has_label_address_in_static_1 (tree *nodep, int *walk_subtrees, void *fnp)
2938 tree fn = (tree) fnp;
2940 if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
2949 /* Determine if the function can be copied. If so return NULL. If
2950 not return a string describng the reason for failure. */
2953 copy_forbidden (struct function *fun, tree fndecl)
2955 const char *reason = fun->cannot_be_copied_reason;
2959 /* Only examine the function once. */
2960 if (fun->cannot_be_copied_set)
2963 /* We cannot copy a function that receives a non-local goto
2964 because we cannot remap the destination label used in the
2965 function that is performing the non-local goto. */
2966 /* ??? Actually, this should be possible, if we work at it.
2967 No doubt there's just a handful of places that simply
2968 assume it doesn't happen and don't substitute properly. */
2969 if (fun->has_nonlocal_label)
2971 reason = G_("function %q+F can never be copied "
2972 "because it receives a non-local goto");
2976 FOR_EACH_LOCAL_DECL (fun, ix, decl)
2977 if (TREE_CODE (decl) == VAR_DECL
2978 && TREE_STATIC (decl)
2979 && !DECL_EXTERNAL (decl)
2980 && DECL_INITIAL (decl)
2981 && walk_tree_without_duplicates (&DECL_INITIAL (decl),
2982 has_label_address_in_static_1,
2985 reason = G_("function %q+F can never be copied because it saves "
2986 "address of local label in a static variable");
2991 fun->cannot_be_copied_reason = reason;
2992 fun->cannot_be_copied_set = true;
2997 static const char *inline_forbidden_reason;
2999 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3000 iff a function can not be inlined. Also sets the reason why. */
3003 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
3004 struct walk_stmt_info *wip)
3006 tree fn = (tree) wip->info;
3008 gimple stmt = gsi_stmt (*gsi);
3010 switch (gimple_code (stmt))
3013 /* Refuse to inline alloca call unless user explicitly forced so as
3014 this may change program's memory overhead drastically when the
3015 function using alloca is called in loop. In GCC present in
3016 SPEC2000 inlining into schedule_block cause it to require 2GB of
3017 RAM instead of 256MB. */
3018 if (gimple_alloca_call_p (stmt)
3019 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
3021 inline_forbidden_reason
3022 = G_("function %q+F can never be inlined because it uses "
3023 "alloca (override using the always_inline attribute)");
3024 *handled_ops_p = true;
3028 t = gimple_call_fndecl (stmt);
3032 /* We cannot inline functions that call setjmp. */
3033 if (setjmp_call_p (t))
3035 inline_forbidden_reason
3036 = G_("function %q+F can never be inlined because it uses setjmp");
3037 *handled_ops_p = true;
3041 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
3042 switch (DECL_FUNCTION_CODE (t))
3044 /* We cannot inline functions that take a variable number of
3046 case BUILT_IN_VA_START:
3047 case BUILT_IN_NEXT_ARG:
3048 case BUILT_IN_VA_END:
3049 inline_forbidden_reason
3050 = G_("function %q+F can never be inlined because it "
3051 "uses variable argument lists");
3052 *handled_ops_p = true;
3055 case BUILT_IN_LONGJMP:
3056 /* We can't inline functions that call __builtin_longjmp at
3057 all. The non-local goto machinery really requires the
3058 destination be in a different function. If we allow the
3059 function calling __builtin_longjmp to be inlined into the
3060 function calling __builtin_setjmp, Things will Go Awry. */
3061 inline_forbidden_reason
3062 = G_("function %q+F can never be inlined because "
3063 "it uses setjmp-longjmp exception handling");
3064 *handled_ops_p = true;
3067 case BUILT_IN_NONLOCAL_GOTO:
3069 inline_forbidden_reason
3070 = G_("function %q+F can never be inlined because "
3071 "it uses non-local goto");
3072 *handled_ops_p = true;
3075 case BUILT_IN_RETURN:
3076 case BUILT_IN_APPLY_ARGS:
3077 /* If a __builtin_apply_args caller would be inlined,
3078 it would be saving arguments of the function it has
3079 been inlined into. Similarly __builtin_return would
3080 return from the function the inline has been inlined into. */
3081 inline_forbidden_reason
3082 = G_("function %q+F can never be inlined because "
3083 "it uses __builtin_return or __builtin_apply_args");
3084 *handled_ops_p = true;
3093 t = gimple_goto_dest (stmt);
3095 /* We will not inline a function which uses computed goto. The
3096 addresses of its local labels, which may be tucked into
3097 global storage, are of course not constant across
3098 instantiations, which causes unexpected behavior. */
3099 if (TREE_CODE (t) != LABEL_DECL)
3101 inline_forbidden_reason
3102 = G_("function %q+F can never be inlined "
3103 "because it contains a computed goto");
3104 *handled_ops_p = true;
3113 *handled_ops_p = false;
3117 /* Return true if FNDECL is a function that cannot be inlined into
3121 inline_forbidden_p (tree fndecl)
3123 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
3124 struct walk_stmt_info wi;
3125 struct pointer_set_t *visited_nodes;
3127 bool forbidden_p = false;
3129 /* First check for shared reasons not to copy the code. */
3130 inline_forbidden_reason = copy_forbidden (fun, fndecl);
3131 if (inline_forbidden_reason != NULL)
3134 /* Next, walk the statements of the function looking for
3135 constraucts we can't handle, or are non-optimal for inlining. */
3136 visited_nodes = pointer_set_create ();
3137 memset (&wi, 0, sizeof (wi));
3138 wi.info = (void *) fndecl;
3139 wi.pset = visited_nodes;
3141 FOR_EACH_BB_FN (bb, fun)
3144 gimple_seq seq = bb_seq (bb);
3145 ret = walk_gimple_seq (seq, inline_forbidden_p_stmt, NULL, &wi);
3146 forbidden_p = (ret != NULL);
3151 pointer_set_destroy (visited_nodes);
3155 /* Return true if CALLEE cannot be inlined into CALLER. */
3158 inline_forbidden_into_p (tree caller, tree callee)
3160 /* Don't inline if the functions have different EH personalities. */
3161 if (DECL_FUNCTION_PERSONALITY (caller)
3162 && DECL_FUNCTION_PERSONALITY (callee)
3163 && (DECL_FUNCTION_PERSONALITY (caller)
3164 != DECL_FUNCTION_PERSONALITY (callee)))
3167 /* Don't inline if the callee can throw non-call exceptions but the
3169 if (DECL_STRUCT_FUNCTION (callee)
3170 && DECL_STRUCT_FUNCTION (callee)->can_throw_non_call_exceptions
3171 && !(DECL_STRUCT_FUNCTION (caller)
3172 && DECL_STRUCT_FUNCTION (caller)->can_throw_non_call_exceptions))
3178 /* Returns nonzero if FN is a function that does not have any
3179 fundamental inline blocking properties. */
3182 tree_inlinable_function_p (tree fn)
3184 bool inlinable = true;
3188 /* If we've already decided this function shouldn't be inlined,
3189 there's no need to check again. */
3190 if (DECL_UNINLINABLE (fn))
3193 /* We only warn for functions declared `inline' by the user. */
3194 do_warning = (warn_inline
3195 && DECL_DECLARED_INLINE_P (fn)
3196 && !DECL_NO_INLINE_WARNING_P (fn)
3197 && !DECL_IN_SYSTEM_HEADER (fn));
3199 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
3202 && always_inline == NULL)
3205 warning (OPT_Winline, "function %q+F can never be inlined because it "
3206 "is suppressed using -fno-inline", fn);
3210 else if (!function_attribute_inlinable_p (fn))
3213 warning (OPT_Winline, "function %q+F can never be inlined because it "
3214 "uses attributes conflicting with inlining", fn);
3218 else if (inline_forbidden_p (fn))
3220 /* See if we should warn about uninlinable functions. Previously,
3221 some of these warnings would be issued while trying to expand
3222 the function inline, but that would cause multiple warnings
3223 about functions that would for example call alloca. But since
3224 this a property of the function, just one warning is enough.
3225 As a bonus we can now give more details about the reason why a
3226 function is not inlinable. */
3228 sorry (inline_forbidden_reason, fn);
3229 else if (do_warning)
3230 warning (OPT_Winline, inline_forbidden_reason, fn);
3235 /* Squirrel away the result so that we don't have to check again. */
3236 DECL_UNINLINABLE (fn) = !inlinable;
3241 /* Estimate the cost of a memory move. Use machine dependent
3242 word size and take possible memcpy call into account. */
3245 estimate_move_cost (tree type)
3249 gcc_assert (!VOID_TYPE_P (type));
3251 if (TREE_CODE (type) == VECTOR_TYPE)
3253 enum machine_mode inner = TYPE_MODE (TREE_TYPE (type));
3254 enum machine_mode simd
3255 = targetm.vectorize.preferred_simd_mode (inner);
3256 int simd_mode_size = GET_MODE_SIZE (simd);
3257 return ((GET_MODE_SIZE (TYPE_MODE (type)) + simd_mode_size - 1)
3261 size = int_size_in_bytes (type);
3263 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size))
3264 /* Cost of a memcpy call, 3 arguments and the call. */
3267 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
3270 /* Returns cost of operation CODE, according to WEIGHTS */
3273 estimate_operator_cost (enum tree_code code, eni_weights *weights,
3274 tree op1 ATTRIBUTE_UNUSED, tree op2)
3278 /* These are "free" conversions, or their presumed cost
3279 is folded into other operations. */
3284 case VIEW_CONVERT_EXPR:
3287 /* Assign cost of 1 to usual operations.
3288 ??? We may consider mapping RTL costs to this. */
3293 case POINTER_PLUS_EXPR:
3298 case ADDR_SPACE_CONVERT_EXPR:
3299 case FIXED_CONVERT_EXPR:
3300 case FIX_TRUNC_EXPR:
3312 case VEC_LSHIFT_EXPR:
3313 case VEC_RSHIFT_EXPR:
3320 case TRUTH_ANDIF_EXPR:
3321 case TRUTH_ORIF_EXPR:
3322 case TRUTH_AND_EXPR:
3324 case TRUTH_XOR_EXPR:
3325 case TRUTH_NOT_EXPR:
3334 case UNORDERED_EXPR:
3345 case PREDECREMENT_EXPR:
3346 case PREINCREMENT_EXPR:
3347 case POSTDECREMENT_EXPR:
3348 case POSTINCREMENT_EXPR:
3350 case REALIGN_LOAD_EXPR:
3352 case REDUC_MAX_EXPR:
3353 case REDUC_MIN_EXPR:
3354 case REDUC_PLUS_EXPR:
3355 case WIDEN_SUM_EXPR:
3356 case WIDEN_MULT_EXPR:
3358 case WIDEN_MULT_PLUS_EXPR:
3359 case WIDEN_MULT_MINUS_EXPR:
3361 case VEC_WIDEN_MULT_HI_EXPR:
3362 case VEC_WIDEN_MULT_LO_EXPR:
3363 case VEC_UNPACK_HI_EXPR:
3364 case VEC_UNPACK_LO_EXPR:
3365 case VEC_UNPACK_FLOAT_HI_EXPR:
3366 case VEC_UNPACK_FLOAT_LO_EXPR:
3367 case VEC_PACK_TRUNC_EXPR:
3368 case VEC_PACK_SAT_EXPR:
3369 case VEC_PACK_FIX_TRUNC_EXPR:
3370 case VEC_EXTRACT_EVEN_EXPR:
3371 case VEC_EXTRACT_ODD_EXPR:
3372 case VEC_INTERLEAVE_HIGH_EXPR:
3373 case VEC_INTERLEAVE_LOW_EXPR:
3377 /* Few special cases of expensive operations. This is useful
3378 to avoid inlining on functions having too many of these. */
3379 case TRUNC_DIV_EXPR:
3381 case FLOOR_DIV_EXPR:
3382 case ROUND_DIV_EXPR:
3383 case EXACT_DIV_EXPR:
3384 case TRUNC_MOD_EXPR:
3386 case FLOOR_MOD_EXPR:
3387 case ROUND_MOD_EXPR:
3389 if (TREE_CODE (op2) != INTEGER_CST)
3390 return weights->div_mod_cost;
3394 /* We expect a copy assignment with no operator. */
3395 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
3401 /* Estimate number of instructions that will be created by expanding
3402 the statements in the statement sequence STMTS.
3403 WEIGHTS contains weights attributed to various constructs. */
3406 int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
3409 gimple_stmt_iterator gsi;
3412 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
3413 cost += estimate_num_insns (gsi_stmt (gsi), weights);
3419 /* Estimate number of instructions that will be created by expanding STMT.
3420 WEIGHTS contains weights attributed to various constructs. */
3423 estimate_num_insns (gimple stmt, eni_weights *weights)
3426 enum gimple_code code = gimple_code (stmt);
3433 /* Try to estimate the cost of assignments. We have three cases to
3435 1) Simple assignments to registers;
3436 2) Stores to things that must live in memory. This includes
3437 "normal" stores to scalars, but also assignments of large
3438 structures, or constructors of big arrays;
3440 Let us look at the first two cases, assuming we have "a = b + C":
3441 <GIMPLE_ASSIGN <var_decl "a">
3442 <plus_expr <var_decl "b"> <constant C>>
3443 If "a" is a GIMPLE register, the assignment to it is free on almost
3444 any target, because "a" usually ends up in a real register. Hence
3445 the only cost of this expression comes from the PLUS_EXPR, and we
3446 can ignore the GIMPLE_ASSIGN.
3447 If "a" is not a GIMPLE register, the assignment to "a" will most
3448 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3449 of moving something into "a", which we compute using the function
3450 estimate_move_cost. */
3451 lhs = gimple_assign_lhs (stmt);
3452 rhs = gimple_assign_rhs1 (stmt);
3454 if (is_gimple_reg (lhs))
3457 cost = estimate_move_cost (TREE_TYPE (lhs));
3459 if (!is_gimple_reg (rhs) && !is_gimple_min_invariant (rhs))
3460 cost += estimate_move_cost (TREE_TYPE (rhs));
3462 cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights,
3463 gimple_assign_rhs1 (stmt),
3464 get_gimple_rhs_class (gimple_assign_rhs_code (stmt))
3465 == GIMPLE_BINARY_RHS
3466 ? gimple_assign_rhs2 (stmt) : NULL);
3470 cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights,
3471 gimple_op (stmt, 0),
3472 gimple_op (stmt, 1));
3476 /* Take into account cost of the switch + guess 2 conditional jumps for
3479 TODO: once the switch expansion logic is sufficiently separated, we can
3480 do better job on estimating cost of the switch. */
3481 if (weights->time_based)
3482 cost = floor_log2 (gimple_switch_num_labels (stmt)) * 2;
3484 cost = gimple_switch_num_labels (stmt) * 2;
3489 tree decl = gimple_call_fndecl (stmt);
3490 tree addr = gimple_call_fn (stmt);
3491 tree funtype = TREE_TYPE (addr);
3492 bool stdarg = false;
3494 if (POINTER_TYPE_P (funtype))
3495 funtype = TREE_TYPE (funtype);
3497 /* Do not special case builtins where we see the body.
3498 This just confuse inliner. */
3499 if (!decl || cgraph_node (decl)->analyzed)
3501 /* For buitins that are likely expanded to nothing or
3502 inlined do not account operand costs. */
3503 else if (is_simple_builtin (decl))
3505 else if (is_inexpensive_builtin (decl))
3506 return weights->target_builtin_call_cost;
3507 else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
3509 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
3510 specialize the cheap expansion we do here.
3511 ??? This asks for a more general solution. */
3512 switch (DECL_FUNCTION_CODE (decl))
3517 if (TREE_CODE (gimple_call_arg (stmt, 1)) == REAL_CST
3518 && REAL_VALUES_EQUAL
3519 (TREE_REAL_CST (gimple_call_arg (stmt, 1)), dconst2))
3520 return estimate_operator_cost (MULT_EXPR, weights,
3521 gimple_call_arg (stmt, 0),
3522 gimple_call_arg (stmt, 0));
3530 cost = weights->call_cost;
3532 funtype = TREE_TYPE (decl);
3534 if (!VOID_TYPE_P (TREE_TYPE (funtype)))
3535 cost += estimate_move_cost (TREE_TYPE (funtype));
3538 stdarg = stdarg_p (funtype);
3540 /* Our cost must be kept in sync with
3541 cgraph_estimate_size_after_inlining that does use function
3542 declaration to figure out the arguments.
3544 For functions taking variable list of arguments we must
3545 look into call statement intself. This is safe because
3546 we will get only higher costs and in most cases we will
3547 not inline these anyway. */
3548 if (decl && DECL_ARGUMENTS (decl) && !stdarg)
3551 for (arg = DECL_ARGUMENTS (decl); arg; arg = DECL_CHAIN (arg))
3552 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3553 cost += estimate_move_cost (TREE_TYPE (arg));
3555 else if (funtype && prototype_p (funtype) && !stdarg)
3558 for (t = TYPE_ARG_TYPES (funtype); t && t != void_list_node;
3560 if (!VOID_TYPE_P (TREE_VALUE (t)))
3561 cost += estimate_move_cost (TREE_VALUE (t));
3565 for (i = 0; i < gimple_call_num_args (stmt); i++)
3567 tree arg = gimple_call_arg (stmt, i);
3568 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3569 cost += estimate_move_cost (TREE_TYPE (arg));
3577 return weights->return_cost;
3583 case GIMPLE_PREDICT:
3588 return asm_str_count (gimple_asm_string (stmt));
3591 /* This is either going to be an external function call with one
3592 argument, or two register copy statements plus a goto. */
3595 case GIMPLE_EH_DISPATCH:
3596 /* ??? This is going to turn into a switch statement. Ideally
3597 we'd have a look at the eh region and estimate the number of
3602 return estimate_num_insns_seq (gimple_bind_body (stmt), weights);
3604 case GIMPLE_EH_FILTER:
3605 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
3608 return estimate_num_insns_seq (gimple_catch_handler (stmt), weights);
3611 return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
3612 + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
3614 /* OpenMP directives are generally very expensive. */
3616 case GIMPLE_OMP_RETURN:
3617 case GIMPLE_OMP_SECTIONS_SWITCH:
3618 case GIMPLE_OMP_ATOMIC_STORE:
3619 case GIMPLE_OMP_CONTINUE:
3620 /* ...except these, which are cheap. */
3623 case GIMPLE_OMP_ATOMIC_LOAD:
3624 return weights->omp_cost;
3626 case GIMPLE_OMP_FOR:
3627 return (weights->omp_cost
3628 + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
3629 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
3631 case GIMPLE_OMP_PARALLEL:
3632 case GIMPLE_OMP_TASK:
3633 case GIMPLE_OMP_CRITICAL:
3634 case GIMPLE_OMP_MASTER:
3635 case GIMPLE_OMP_ORDERED:
3636 case GIMPLE_OMP_SECTION:
3637 case GIMPLE_OMP_SECTIONS:
3638 case GIMPLE_OMP_SINGLE:
3639 return (weights->omp_cost
3640 + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
3649 /* Estimate number of instructions that will be created by expanding
3650 function FNDECL. WEIGHTS contains weights attributed to various
3654 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
3656 struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
3657 gimple_stmt_iterator bsi;
3661 gcc_assert (my_function && my_function->cfg);
3662 FOR_EACH_BB_FN (bb, my_function)
3664 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
3665 n += estimate_num_insns (gsi_stmt (bsi), weights);
3672 /* Initializes weights used by estimate_num_insns. */
3675 init_inline_once (void)
3677 eni_size_weights.call_cost = 1;
3678 eni_size_weights.target_builtin_call_cost = 1;
3679 eni_size_weights.div_mod_cost = 1;
3680 eni_size_weights.omp_cost = 40;
3681 eni_size_weights.time_based = false;
3682 eni_size_weights.return_cost = 1;
3684 /* Estimating time for call is difficult, since we have no idea what the
3685 called function does. In the current uses of eni_time_weights,
3686 underestimating the cost does less harm than overestimating it, so
3687 we choose a rather small value here. */
3688 eni_time_weights.call_cost = 10;
3689 eni_time_weights.target_builtin_call_cost = 1;
3690 eni_time_weights.div_mod_cost = 10;
3691 eni_time_weights.omp_cost = 40;
3692 eni_time_weights.time_based = true;
3693 eni_time_weights.return_cost = 2;
3696 /* Estimate the number of instructions in a gimple_seq. */
3699 count_insns_seq (gimple_seq seq, eni_weights *weights)
3701 gimple_stmt_iterator gsi;
3703 for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
3704 n += estimate_num_insns (gsi_stmt (gsi), weights);
3710 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3713 prepend_lexical_block (tree current_block, tree new_block)
3715 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
3716 BLOCK_SUBBLOCKS (current_block) = new_block;
3717 BLOCK_SUPERCONTEXT (new_block) = current_block;
3720 /* Add local variables from CALLEE to CALLER. */
3723 add_local_variables (struct function *callee, struct function *caller,
3724 copy_body_data *id, bool check_var_ann)
3729 FOR_EACH_LOCAL_DECL (callee, ix, var)
3730 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3733 || (var_ann (var) && add_referenced_var (var)))
3734 add_local_decl (caller, var);
3736 else if (!can_be_nonlocal (var, id))
3738 tree new_var = remap_decl (var, id);
3740 /* Remap debug-expressions. */
3741 if (TREE_CODE (new_var) == VAR_DECL
3742 && DECL_DEBUG_EXPR_IS_FROM (new_var)
3745 tree tem = DECL_DEBUG_EXPR (var);
3746 bool old_regimplify = id->regimplify;
3747 id->remapping_type_depth++;
3748 walk_tree (&tem, copy_tree_body_r, id, NULL);
3749 id->remapping_type_depth--;
3750 id->regimplify = old_regimplify;
3751 SET_DECL_DEBUG_EXPR (new_var, tem);
3753 add_local_decl (caller, new_var);
3757 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3760 expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id)
3764 struct pointer_map_t *st, *dst;
3767 location_t saved_location;
3768 struct cgraph_edge *cg_edge;
3769 cgraph_inline_failed_t reason;
3770 basic_block return_block;
3772 gimple_stmt_iterator gsi, stmt_gsi;
3773 bool successfully_inlined = FALSE;
3774 bool purge_dead_abnormal_edges;
3776 /* Set input_location here so we get the right instantiation context
3777 if we call instantiate_decl from inlinable_function_p. */
3778 saved_location = input_location;
3779 if (gimple_has_location (stmt))
3780 input_location = gimple_location (stmt);
3782 /* From here on, we're only interested in CALL_EXPRs. */
3783 if (gimple_code (stmt) != GIMPLE_CALL)
3786 /* First, see if we can figure out what function is being called.
3787 If we cannot, then there is no hope of inlining the function. */
3788 fn = gimple_call_fndecl (stmt);
3792 /* Turn forward declarations into real ones. */
3793 fn = cgraph_node (fn)->decl;
3795 /* If FN is a declaration of a function in a nested scope that was
3796 globally declared inline, we don't set its DECL_INITIAL.
3797 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3798 C++ front-end uses it for cdtors to refer to their internal
3799 declarations, that are not real functions. Fortunately those
3800 don't have trees to be saved, so we can tell by checking their
3802 if (!DECL_INITIAL (fn)
3803 && DECL_ABSTRACT_ORIGIN (fn)
3804 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
3805 fn = DECL_ABSTRACT_ORIGIN (fn);
3807 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3808 Kill this check once this is fixed. */
3809 if (!id->dst_node->analyzed)
3812 cg_edge = cgraph_edge (id->dst_node, stmt);
3814 /* First check that inlining isn't simply forbidden in this case. */
3815 if (inline_forbidden_into_p (cg_edge->caller->decl, cg_edge->callee->decl))
3818 /* Don't try to inline functions that are not well-suited to inlining. */
3819 if (!cgraph_inline_p (cg_edge, &reason))
3821 /* If this call was originally indirect, we do not want to emit any
3822 inlining related warnings or sorry messages because there are no
3823 guarantees regarding those. */
3824 if (cg_edge->indirect_inlining_edge)
3827 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
3828 /* Avoid warnings during early inline pass. */
3829 && cgraph_global_info_ready)
3831 sorry ("inlining failed in call to %q+F: %s", fn,
3832 _(cgraph_inline_failed_string (reason)));
3833 sorry ("called from here");
3835 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
3836 && !DECL_IN_SYSTEM_HEADER (fn)
3837 && reason != CIF_UNSPECIFIED
3838 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
3839 /* Avoid warnings during early inline pass. */
3840 && cgraph_global_info_ready)
3842 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
3843 fn, _(cgraph_inline_failed_string (reason)));
3844 warning (OPT_Winline, "called from here");
3848 fn = cg_edge->callee->decl;
3850 #ifdef ENABLE_CHECKING
3851 if (cg_edge->callee->decl != id->dst_node->decl)
3852 verify_cgraph_node (cg_edge->callee);
3855 /* We will be inlining this callee. */
3856 id->eh_lp_nr = lookup_stmt_eh_lp (stmt);
3858 /* Update the callers EH personality. */
3859 if (DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl))
3860 DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3861 = DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl);
3863 /* Split the block holding the GIMPLE_CALL. */
3864 e = split_block (bb, stmt);
3866 return_block = e->dest;
3869 /* split_block splits after the statement; work around this by
3870 moving the call into the second block manually. Not pretty,
3871 but seems easier than doing the CFG manipulation by hand
3872 when the GIMPLE_CALL is in the last statement of BB. */
3873 stmt_gsi = gsi_last_bb (bb);
3874 gsi_remove (&stmt_gsi, false);
3876 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3877 been the source of abnormal edges. In this case, schedule
3878 the removal of dead abnormal edges. */
3879 gsi = gsi_start_bb (return_block);
3880 if (gsi_end_p (gsi))
3882 gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
3883 purge_dead_abnormal_edges = true;
3887 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
3888 purge_dead_abnormal_edges = false;
3891 stmt_gsi = gsi_start_bb (return_block);
3893 /* Build a block containing code to initialize the arguments, the
3894 actual inline expansion of the body, and a label for the return
3895 statements within the function to jump to. The type of the
3896 statement expression is the return type of the function call. */
3897 id->block = make_node (BLOCK);
3898 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
3899 BLOCK_SOURCE_LOCATION (id->block) = input_location;
3900 prepend_lexical_block (gimple_block (stmt), id->block);
3902 /* Local declarations will be replaced by their equivalents in this
3905 id->decl_map = pointer_map_create ();
3906 dst = id->debug_map;
3907 id->debug_map = NULL;
3909 /* Record the function we are about to inline. */
3911 id->src_node = cg_edge->callee;
3912 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
3913 id->gimple_call = stmt;
3915 gcc_assert (!id->src_cfun->after_inlining);
3918 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
3920 gimple_stmt_iterator si = gsi_last_bb (bb);
3921 gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
3925 initialize_inlined_parameters (id, stmt, fn, bb);
3927 if (DECL_INITIAL (fn))
3928 prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
3930 /* Return statements in the function body will be replaced by jumps
3931 to the RET_LABEL. */
3932 gcc_assert (DECL_INITIAL (fn));
3933 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
3935 /* Find the LHS to which the result of this call is assigned. */
3937 if (gimple_call_lhs (stmt))
3939 modify_dest = gimple_call_lhs (stmt);
3941 /* The function which we are inlining might not return a value,
3942 in which case we should issue a warning that the function
3943 does not return a value. In that case the optimizers will
3944 see that the variable to which the value is assigned was not
3945 initialized. We do not want to issue a warning about that
3946 uninitialized variable. */
3947 if (DECL_P (modify_dest))
3948 TREE_NO_WARNING (modify_dest) = 1;
3950 if (gimple_call_return_slot_opt_p (stmt))
3952 return_slot = modify_dest;
3959 /* If we are inlining a call to the C++ operator new, we don't want
3960 to use type based alias analysis on the return value. Otherwise
3961 we may get confused if the compiler sees that the inlined new
3962 function returns a pointer which was just deleted. See bug
3964 if (DECL_IS_OPERATOR_NEW (fn))
3970 /* Declare the return variable for the function. */
3971 use_retvar = declare_return_variable (id, return_slot, modify_dest, bb);
3973 /* Add local vars in this inlined callee to caller. */
3974 add_local_variables (id->src_cfun, cfun, id, true);
3976 if (dump_file && (dump_flags & TDF_DETAILS))
3978 fprintf (dump_file, "Inlining ");
3979 print_generic_expr (dump_file, id->src_fn, 0);
3980 fprintf (dump_file, " to ");
3981 print_generic_expr (dump_file, id->dst_fn, 0);
3982 fprintf (dump_file, " with frequency %i\n", cg_edge->frequency);
3985 /* This is it. Duplicate the callee body. Assume callee is
3986 pre-gimplified. Note that we must not alter the caller
3987 function in any way before this point, as this CALL_EXPR may be
3988 a self-referential call; if we're calling ourselves, we need to
3989 duplicate our body before altering anything. */
3990 copy_body (id, bb->count,
3991 cg_edge->frequency * REG_BR_PROB_BASE / CGRAPH_FREQ_BASE,
3992 bb, return_block, NULL, NULL);
3994 /* Reset the escaped solution. */
3995 if (cfun->gimple_df)
3996 pt_solution_reset (&cfun->gimple_df->escaped);
4001 pointer_map_destroy (id->debug_map);
4002 id->debug_map = dst;
4004 pointer_map_destroy (id->decl_map);
4007 /* Unlink the calls virtual operands before replacing it. */
4008 unlink_stmt_vdef (stmt);
4010 /* If the inlined function returns a result that we care about,
4011 substitute the GIMPLE_CALL with an assignment of the return
4012 variable to the LHS of the call. That is, if STMT was
4013 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4014 if (use_retvar && gimple_call_lhs (stmt))
4016 gimple old_stmt = stmt;
4017 stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
4018 gsi_replace (&stmt_gsi, stmt, false);
4019 if (gimple_in_ssa_p (cfun))
4020 mark_symbols_for_renaming (stmt);
4021 maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
4025 /* Handle the case of inlining a function with no return
4026 statement, which causes the return value to become undefined. */
4027 if (gimple_call_lhs (stmt)
4028 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
4030 tree name = gimple_call_lhs (stmt);
4031 tree var = SSA_NAME_VAR (name);
4032 tree def = gimple_default_def (cfun, var);
4036 /* If the variable is used undefined, make this name
4037 undefined via a move. */
4038 stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
4039 gsi_replace (&stmt_gsi, stmt, true);
4043 /* Otherwise make this variable undefined. */
4044 gsi_remove (&stmt_gsi, true);
4045 set_default_def (var, name);
4046 SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
4050 gsi_remove (&stmt_gsi, true);
4053 if (purge_dead_abnormal_edges)
4055 gimple_purge_dead_eh_edges (return_block);
4056 gimple_purge_dead_abnormal_call_edges (return_block);
4059 /* If the value of the new expression is ignored, that's OK. We
4060 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4061 the equivalent inlined version either. */
4062 if (is_gimple_assign (stmt))
4064 gcc_assert (gimple_assign_single_p (stmt)
4065 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
4066 TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
4069 /* Output the inlining info for this abstract function, since it has been
4070 inlined. If we don't do this now, we can lose the information about the
4071 variables in the function when the blocks get blown away as soon as we
4072 remove the cgraph node. */
4073 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
4075 /* Update callgraph if needed. */
4076 cgraph_remove_node (cg_edge->callee);
4078 id->block = NULL_TREE;
4079 successfully_inlined = TRUE;
4082 input_location = saved_location;
4083 return successfully_inlined;
4086 /* Expand call statements reachable from STMT_P.
4087 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4088 in a MODIFY_EXPR. See gimple.c:get_call_expr_in(). We can
4089 unfortunately not use that function here because we need a pointer
4090 to the CALL_EXPR, not the tree itself. */
4093 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
4095 gimple_stmt_iterator gsi;
4097 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4099 gimple stmt = gsi_stmt (gsi);
4101 if (is_gimple_call (stmt)
4102 && expand_call_inline (bb, stmt, id))
4110 /* Walk all basic blocks created after FIRST and try to fold every statement
4111 in the STATEMENTS pointer set. */
4114 fold_marked_statements (int first, struct pointer_set_t *statements)
4116 for (; first < n_basic_blocks; first++)
4117 if (BASIC_BLOCK (first))
4119 gimple_stmt_iterator gsi;
4121 for (gsi = gsi_start_bb (BASIC_BLOCK (first));
4124 if (pointer_set_contains (statements, gsi_stmt (gsi)))
4126 gimple old_stmt = gsi_stmt (gsi);
4127 tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0;
4129 if (old_decl && DECL_BUILT_IN (old_decl))
4131 /* Folding builtins can create multiple instructions,
4132 we need to look at all of them. */
4133 gimple_stmt_iterator i2 = gsi;
4135 if (fold_stmt (&gsi))
4139 i2 = gsi_start_bb (BASIC_BLOCK (first));
4144 new_stmt = gsi_stmt (i2);
4145 update_stmt (new_stmt);
4146 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
4149 if (new_stmt == gsi_stmt (gsi))
4151 /* It is okay to check only for the very last
4152 of these statements. If it is a throwing
4153 statement nothing will change. If it isn't
4154 this can remove EH edges. If that weren't
4155 correct then because some intermediate stmts
4156 throw, but not the last one. That would mean
4157 we'd have to split the block, which we can't
4158 here and we'd loose anyway. And as builtins
4159 probably never throw, this all
4161 if (maybe_clean_or_replace_eh_stmt (old_stmt,
4163 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
4170 else if (fold_stmt (&gsi))
4172 /* Re-read the statement from GSI as fold_stmt() may
4174 gimple new_stmt = gsi_stmt (gsi);
4175 update_stmt (new_stmt);
4177 if (is_gimple_call (old_stmt)
4178 || is_gimple_call (new_stmt))
4179 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
4182 if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
4183 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
4189 /* Return true if BB has at least one abnormal outgoing edge. */
4192 has_abnormal_outgoing_edge_p (basic_block bb)
4197 FOR_EACH_EDGE (e, ei, bb->succs)
4198 if (e->flags & EDGE_ABNORMAL)
4204 /* Expand calls to inline functions in the body of FN. */
4207 optimize_inline_calls (tree fn)
4211 int last = n_basic_blocks;
4212 struct gimplify_ctx gctx;
4213 bool inlined_p = false;
4215 /* There is no point in performing inlining if errors have already
4216 occurred -- and we might crash if we try to inline invalid
4222 memset (&id, 0, sizeof (id));
4224 id.src_node = id.dst_node = cgraph_node (fn);
4226 /* Or any functions that aren't finished yet. */
4227 if (current_function_decl)
4228 id.dst_fn = current_function_decl;
4230 id.copy_decl = copy_decl_maybe_to_var;
4231 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4232 id.transform_new_cfg = false;
4233 id.transform_return_to_modify = true;
4234 id.transform_lang_insert_block = NULL;
4235 id.statements_to_fold = pointer_set_create ();
4237 push_gimplify_context (&gctx);
4239 /* We make no attempts to keep dominance info up-to-date. */
4240 free_dominance_info (CDI_DOMINATORS);
4241 free_dominance_info (CDI_POST_DOMINATORS);
4243 /* Register specific gimple functions. */
4244 gimple_register_cfg_hooks ();
4246 /* Reach the trees by walking over the CFG, and note the
4247 enclosing basic-blocks in the call edges. */
4248 /* We walk the blocks going forward, because inlined function bodies
4249 will split id->current_basic_block, and the new blocks will
4250 follow it; we'll trudge through them, processing their CALL_EXPRs
4253 inlined_p |= gimple_expand_calls_inline (bb, &id);
4255 pop_gimplify_context (NULL);
4257 #ifdef ENABLE_CHECKING
4259 struct cgraph_edge *e;
4261 verify_cgraph_node (id.dst_node);
4263 /* Double check that we inlined everything we are supposed to inline. */
4264 for (e = id.dst_node->callees; e; e = e->next_callee)
4265 gcc_assert (e->inline_failed);
4269 /* Fold queued statements. */
4270 fold_marked_statements (last, id.statements_to_fold);
4271 pointer_set_destroy (id.statements_to_fold);
4273 gcc_assert (!id.debug_stmts);
4275 /* If we didn't inline into the function there is nothing to do. */
4279 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4282 delete_unreachable_blocks_update_callgraph (&id);
4283 #ifdef ENABLE_CHECKING
4284 verify_cgraph_node (id.dst_node);
4287 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4288 not possible yet - the IPA passes might make various functions to not
4289 throw and they don't care to proactively update local EH info. This is
4290 done later in fixup_cfg pass that also execute the verification. */
4291 return (TODO_update_ssa
4293 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
4294 | (gimple_in_ssa_p (cfun) ? TODO_update_address_taken : 0)
4295 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
4298 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4301 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
4303 enum tree_code code = TREE_CODE (*tp);
4304 enum tree_code_class cl = TREE_CODE_CLASS (code);
4306 /* We make copies of most nodes. */
4307 if (IS_EXPR_CODE_CLASS (cl)
4308 || code == TREE_LIST
4310 || code == TYPE_DECL
4311 || code == OMP_CLAUSE)
4313 /* Because the chain gets clobbered when we make a copy, we save it
4315 tree chain = NULL_TREE, new_tree;
4317 chain = TREE_CHAIN (*tp);
4319 /* Copy the node. */
4320 new_tree = copy_node (*tp);
4322 /* Propagate mudflap marked-ness. */
4323 if (flag_mudflap && mf_marked_p (*tp))
4328 /* Now, restore the chain, if appropriate. That will cause
4329 walk_tree to walk into the chain as well. */
4330 if (code == PARM_DECL
4331 || code == TREE_LIST
4332 || code == OMP_CLAUSE)
4333 TREE_CHAIN (*tp) = chain;
4335 /* For now, we don't update BLOCKs when we make copies. So, we
4336 have to nullify all BIND_EXPRs. */
4337 if (TREE_CODE (*tp) == BIND_EXPR)
4338 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
4340 else if (code == CONSTRUCTOR)
4342 /* CONSTRUCTOR nodes need special handling because
4343 we need to duplicate the vector of elements. */
4346 new_tree = copy_node (*tp);
4348 /* Propagate mudflap marked-ness. */
4349 if (flag_mudflap && mf_marked_p (*tp))
4352 CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc,
4353 CONSTRUCTOR_ELTS (*tp));
4356 else if (TREE_CODE_CLASS (code) == tcc_type)
4358 else if (TREE_CODE_CLASS (code) == tcc_declaration)
4360 else if (TREE_CODE_CLASS (code) == tcc_constant)
4363 gcc_assert (code != STATEMENT_LIST);
4367 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4368 information indicating to what new SAVE_EXPR this one should be mapped,
4369 use that one. Otherwise, create a new node and enter it in ST. FN is
4370 the function into which the copy will be placed. */
4373 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
4375 struct pointer_map_t *st = (struct pointer_map_t *) st_;
4379 /* See if we already encountered this SAVE_EXPR. */
4380 n = (tree *) pointer_map_contains (st, *tp);
4382 /* If we didn't already remap this SAVE_EXPR, do so now. */
4385 t = copy_node (*tp);
4387 /* Remember this SAVE_EXPR. */
4388 *pointer_map_insert (st, *tp) = t;
4389 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4390 *pointer_map_insert (st, t) = t;
4394 /* We've already walked into this SAVE_EXPR; don't do it again. */
4399 /* Replace this SAVE_EXPR with the copy. */
4403 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4404 copies the declaration and enters it in the splay_tree in DATA (which is
4405 really an `copy_body_data *'). */
4408 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
4411 copy_body_data *id = (copy_body_data *) data;
4413 /* Don't walk into types. */
4417 else if (TREE_CODE (*tp) == LABEL_EXPR)
4419 tree decl = TREE_OPERAND (*tp, 0);
4421 /* Copy the decl and remember the copy. */
4422 insert_decl_map (id, decl, id->copy_decl (decl, id));
4428 /* Perform any modifications to EXPR required when it is unsaved. Does
4429 not recurse into EXPR's subtrees. */
4432 unsave_expr_1 (tree expr)
4434 switch (TREE_CODE (expr))
4437 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4438 It's OK for this to happen if it was part of a subtree that
4439 isn't immediately expanded, such as operand 2 of another
4441 if (TREE_OPERAND (expr, 1))
4444 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4445 TREE_OPERAND (expr, 3) = NULL_TREE;
4453 /* Called via walk_tree when an expression is unsaved. Using the
4454 splay_tree pointed to by ST (which is really a `splay_tree'),
4455 remaps all local declarations to appropriate replacements. */
4458 unsave_r (tree *tp, int *walk_subtrees, void *data)
4460 copy_body_data *id = (copy_body_data *) data;
4461 struct pointer_map_t *st = id->decl_map;
4464 /* Only a local declaration (variable or label). */
4465 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
4466 || TREE_CODE (*tp) == LABEL_DECL)
4468 /* Lookup the declaration. */
4469 n = (tree *) pointer_map_contains (st, *tp);
4471 /* If it's there, remap it. */
4476 else if (TREE_CODE (*tp) == STATEMENT_LIST)
4478 else if (TREE_CODE (*tp) == BIND_EXPR)
4479 copy_bind_expr (tp, walk_subtrees, id);
4480 else if (TREE_CODE (*tp) == SAVE_EXPR
4481 || TREE_CODE (*tp) == TARGET_EXPR)
4482 remap_save_expr (tp, st, walk_subtrees);
4485 copy_tree_r (tp, walk_subtrees, NULL);
4487 /* Do whatever unsaving is required. */
4488 unsave_expr_1 (*tp);
4491 /* Keep iterating. */
4495 /* Copies everything in EXPR and replaces variables, labels
4496 and SAVE_EXPRs local to EXPR. */
4499 unsave_expr_now (tree expr)
4503 /* There's nothing to do for NULL_TREE. */
4508 memset (&id, 0, sizeof (id));
4509 id.src_fn = current_function_decl;
4510 id.dst_fn = current_function_decl;
4511 id.decl_map = pointer_map_create ();
4512 id.debug_map = NULL;
4514 id.copy_decl = copy_decl_no_change;
4515 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4516 id.transform_new_cfg = false;
4517 id.transform_return_to_modify = false;
4518 id.transform_lang_insert_block = NULL;
4520 /* Walk the tree once to find local labels. */
4521 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
4523 /* Walk the tree again, copying, remapping, and unsaving. */
4524 walk_tree (&expr, unsave_r, &id, NULL);
4527 pointer_map_destroy (id.decl_map);
4529 pointer_map_destroy (id.debug_map);
4534 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4535 label, copies the declaration and enters it in the splay_tree in DATA (which
4536 is really a 'copy_body_data *'. */
4539 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
4540 bool *handled_ops_p ATTRIBUTE_UNUSED,
4541 struct walk_stmt_info *wi)
4543 copy_body_data *id = (copy_body_data *) wi->info;
4544 gimple stmt = gsi_stmt (*gsip);
4546 if (gimple_code (stmt) == GIMPLE_LABEL)
4548 tree decl = gimple_label_label (stmt);
4550 /* Copy the decl and remember the copy. */
4551 insert_decl_map (id, decl, id->copy_decl (decl, id));
4558 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4559 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4560 remaps all local declarations to appropriate replacements in gimple
4564 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
4566 struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
4567 copy_body_data *id = (copy_body_data *) wi->info;
4568 struct pointer_map_t *st = id->decl_map;
4572 /* Only a local declaration (variable or label). */
4573 if ((TREE_CODE (expr) == VAR_DECL
4574 && !TREE_STATIC (expr))
4575 || TREE_CODE (expr) == LABEL_DECL)
4577 /* Lookup the declaration. */
4578 n = (tree *) pointer_map_contains (st, expr);
4580 /* If it's there, remap it. */
4585 else if (TREE_CODE (expr) == STATEMENT_LIST
4586 || TREE_CODE (expr) == BIND_EXPR
4587 || TREE_CODE (expr) == SAVE_EXPR)
4589 else if (TREE_CODE (expr) == TARGET_EXPR)
4591 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4592 It's OK for this to happen if it was part of a subtree that
4593 isn't immediately expanded, such as operand 2 of another
4595 if (!TREE_OPERAND (expr, 1))
4597 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4598 TREE_OPERAND (expr, 3) = NULL_TREE;
4602 /* Keep iterating. */
4607 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4608 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4609 remaps all local declarations to appropriate replacements in gimple
4613 replace_locals_stmt (gimple_stmt_iterator *gsip,
4614 bool *handled_ops_p ATTRIBUTE_UNUSED,
4615 struct walk_stmt_info *wi)
4617 copy_body_data *id = (copy_body_data *) wi->info;
4618 gimple stmt = gsi_stmt (*gsip);
4620 if (gimple_code (stmt) == GIMPLE_BIND)
4622 tree block = gimple_bind_block (stmt);
4626 remap_block (&block, id);
4627 gimple_bind_set_block (stmt, block);
4630 /* This will remap a lot of the same decls again, but this should be
4632 if (gimple_bind_vars (stmt))
4633 gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id));
4636 /* Keep iterating. */
4641 /* Copies everything in SEQ and replaces variables and labels local to
4642 current_function_decl. */
4645 copy_gimple_seq_and_replace_locals (gimple_seq seq)
4648 struct walk_stmt_info wi;
4649 struct pointer_set_t *visited;
4652 /* There's nothing to do for NULL_TREE. */
4657 memset (&id, 0, sizeof (id));
4658 id.src_fn = current_function_decl;
4659 id.dst_fn = current_function_decl;
4660 id.decl_map = pointer_map_create ();
4661 id.debug_map = NULL;
4663 id.copy_decl = copy_decl_no_change;
4664 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4665 id.transform_new_cfg = false;
4666 id.transform_return_to_modify = false;
4667 id.transform_lang_insert_block = NULL;
4669 /* Walk the tree once to find local labels. */
4670 memset (&wi, 0, sizeof (wi));
4671 visited = pointer_set_create ();
4674 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
4675 pointer_set_destroy (visited);
4677 copy = gimple_seq_copy (seq);
4679 /* Walk the copy, remapping decls. */
4680 memset (&wi, 0, sizeof (wi));
4682 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
4685 pointer_map_destroy (id.decl_map);
4687 pointer_map_destroy (id.debug_map);
4693 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4696 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
4705 debug_find_tree (tree top, tree search)
4707 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
4711 /* Declare the variables created by the inliner. Add all the variables in
4712 VARS to BIND_EXPR. */
4715 declare_inline_vars (tree block, tree vars)
4718 for (t = vars; t; t = DECL_CHAIN (t))
4720 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
4721 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
4722 add_local_decl (cfun, t);
4726 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
4729 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4730 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4731 VAR_DECL translation. */
4734 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
4736 /* Don't generate debug information for the copy if we wouldn't have
4737 generated it for the copy either. */
4738 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
4739 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
4741 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4742 declaration inspired this copy. */
4743 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
4745 /* The new variable/label has no RTL, yet. */
4746 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
4747 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
4748 SET_DECL_RTL (copy, 0);
4750 /* These args would always appear unused, if not for this. */
4751 TREE_USED (copy) = 1;
4753 /* Set the context for the new declaration. */
4754 if (!DECL_CONTEXT (decl))
4755 /* Globals stay global. */
4757 else if (DECL_CONTEXT (decl) != id->src_fn)
4758 /* Things that weren't in the scope of the function we're inlining
4759 from aren't in the scope we're inlining to, either. */
4761 else if (TREE_STATIC (decl))
4762 /* Function-scoped static variables should stay in the original
4766 /* Ordinary automatic local variables are now in the scope of the
4768 DECL_CONTEXT (copy) = id->dst_fn;
4774 copy_decl_to_var (tree decl, copy_body_data *id)
4778 gcc_assert (TREE_CODE (decl) == PARM_DECL
4779 || TREE_CODE (decl) == RESULT_DECL);
4781 type = TREE_TYPE (decl);
4783 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4784 VAR_DECL, DECL_NAME (decl), type);
4785 if (DECL_PT_UID_SET_P (decl))
4786 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
4787 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4788 TREE_READONLY (copy) = TREE_READONLY (decl);
4789 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4790 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4792 return copy_decl_for_dup_finish (id, decl, copy);
4795 /* Like copy_decl_to_var, but create a return slot object instead of a
4796 pointer variable for return by invisible reference. */
4799 copy_result_decl_to_var (tree decl, copy_body_data *id)
4803 gcc_assert (TREE_CODE (decl) == PARM_DECL
4804 || TREE_CODE (decl) == RESULT_DECL);
4806 type = TREE_TYPE (decl);
4807 if (DECL_BY_REFERENCE (decl))
4808 type = TREE_TYPE (type);
4810 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4811 VAR_DECL, DECL_NAME (decl), type);
4812 if (DECL_PT_UID_SET_P (decl))
4813 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
4814 TREE_READONLY (copy) = TREE_READONLY (decl);
4815 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4816 if (!DECL_BY_REFERENCE (decl))
4818 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4819 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4822 return copy_decl_for_dup_finish (id, decl, copy);
4826 copy_decl_no_change (tree decl, copy_body_data *id)
4830 copy = copy_node (decl);
4832 /* The COPY is not abstract; it will be generated in DST_FN. */
4833 DECL_ABSTRACT (copy) = 0;
4834 lang_hooks.dup_lang_specific_decl (copy);
4836 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4837 been taken; it's for internal bookkeeping in expand_goto_internal. */
4838 if (TREE_CODE (copy) == LABEL_DECL)
4840 TREE_ADDRESSABLE (copy) = 0;
4841 LABEL_DECL_UID (copy) = -1;
4844 return copy_decl_for_dup_finish (id, decl, copy);
4848 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
4850 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
4851 return copy_decl_to_var (decl, id);
4853 return copy_decl_no_change (decl, id);
4856 /* Return a copy of the function's argument tree. */
4858 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
4859 bitmap args_to_skip, tree *vars)
4862 tree new_parm = NULL;
4867 for (arg = orig_parm; arg; arg = DECL_CHAIN (arg), i++)
4868 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
4870 tree new_tree = remap_decl (arg, id);
4871 lang_hooks.dup_lang_specific_decl (new_tree);
4873 parg = &DECL_CHAIN (new_tree);
4875 else if (!pointer_map_contains (id->decl_map, arg))
4877 /* Make an equivalent VAR_DECL. If the argument was used
4878 as temporary variable later in function, the uses will be
4879 replaced by local variable. */
4880 tree var = copy_decl_to_var (arg, id);
4882 add_referenced_var (var);
4883 insert_decl_map (id, arg, var);
4884 /* Declare this new variable. */
4885 DECL_CHAIN (var) = *vars;
4891 /* Return a copy of the function's static chain. */
4893 copy_static_chain (tree static_chain, copy_body_data * id)
4895 tree *chain_copy, *pvar;
4897 chain_copy = &static_chain;
4898 for (pvar = chain_copy; *pvar; pvar = &DECL_CHAIN (*pvar))
4900 tree new_tree = remap_decl (*pvar, id);
4901 lang_hooks.dup_lang_specific_decl (new_tree);
4902 DECL_CHAIN (new_tree) = DECL_CHAIN (*pvar);
4905 return static_chain;
4908 /* Return true if the function is allowed to be versioned.
4909 This is a guard for the versioning functionality. */
4912 tree_versionable_function_p (tree fndecl)
4914 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl))
4915 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl), fndecl) == NULL);
4918 /* Delete all unreachable basic blocks and update callgraph.
4919 Doing so is somewhat nontrivial because we need to update all clones and
4920 remove inline function that become unreachable. */
4923 delete_unreachable_blocks_update_callgraph (copy_body_data *id)
4925 bool changed = false;
4926 basic_block b, next_bb;
4928 find_unreachable_blocks ();
4930 /* Delete all unreachable basic blocks. */
4932 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR; b = next_bb)
4934 next_bb = b->next_bb;
4936 if (!(b->flags & BB_REACHABLE))
4938 gimple_stmt_iterator bsi;
4940 for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi))
4941 if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL)
4943 struct cgraph_edge *e;
4944 struct cgraph_node *node;
4946 if ((e = cgraph_edge (id->dst_node, gsi_stmt (bsi))) != NULL)
4948 if (!e->inline_failed)
4949 cgraph_remove_node_and_inline_clones (e->callee);
4951 cgraph_remove_edge (e);
4953 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4954 && id->dst_node->clones)
4955 for (node = id->dst_node->clones; node != id->dst_node;)
4957 if ((e = cgraph_edge (node, gsi_stmt (bsi))) != NULL)
4959 if (!e->inline_failed)
4960 cgraph_remove_node_and_inline_clones (e->callee);
4962 cgraph_remove_edge (e);
4966 node = node->clones;
4967 else if (node->next_sibling_clone)
4968 node = node->next_sibling_clone;
4971 while (node != id->dst_node && !node->next_sibling_clone)
4972 node = node->clone_of;
4973 if (node != id->dst_node)
4974 node = node->next_sibling_clone;
4978 delete_basic_block (b);
4984 tidy_fallthru_edges ();
4988 /* Update clone info after duplication. */
4991 update_clone_info (copy_body_data * id)
4993 struct cgraph_node *node;
4994 if (!id->dst_node->clones)
4996 for (node = id->dst_node->clones; node != id->dst_node;)
4998 /* First update replace maps to match the new body. */
4999 if (node->clone.tree_map)
5002 for (i = 0; i < VEC_length (ipa_replace_map_p, node->clone.tree_map); i++)
5004 struct ipa_replace_map *replace_info;
5005 replace_info = VEC_index (ipa_replace_map_p, node->clone.tree_map, i);
5006 walk_tree (&replace_info->old_tree, copy_tree_body_r, id, NULL);
5007 walk_tree (&replace_info->new_tree, copy_tree_body_r, id, NULL);
5011 node = node->clones;
5012 else if (node->next_sibling_clone)
5013 node = node->next_sibling_clone;
5016 while (node != id->dst_node && !node->next_sibling_clone)
5017 node = node->clone_of;
5018 if (node != id->dst_node)
5019 node = node->next_sibling_clone;
5024 /* Create a copy of a function's tree.
5025 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5026 of the original function and the new copied function
5027 respectively. In case we want to replace a DECL
5028 tree with another tree while duplicating the function's
5029 body, TREE_MAP represents the mapping between these
5030 trees. If UPDATE_CLONES is set, the call_stmt fields
5031 of edges of clones of the function will be updated.
5033 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5035 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5036 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5039 tree_function_versioning (tree old_decl, tree new_decl,
5040 VEC(ipa_replace_map_p,gc)* tree_map,
5041 bool update_clones, bitmap args_to_skip,
5042 bitmap blocks_to_copy, basic_block new_entry)
5044 struct cgraph_node *old_version_node;
5045 struct cgraph_node *new_version_node;
5049 struct ipa_replace_map *replace_info;
5050 basic_block old_entry_block, bb;
5051 VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10);
5053 tree old_current_function_decl = current_function_decl;
5054 tree vars = NULL_TREE;
5056 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
5057 && TREE_CODE (new_decl) == FUNCTION_DECL);
5058 DECL_POSSIBLY_INLINED (old_decl) = 1;
5060 old_version_node = cgraph_node (old_decl);
5061 new_version_node = cgraph_node (new_decl);
5063 /* Output the inlining info for this abstract function, since it has been
5064 inlined. If we don't do this now, we can lose the information about the
5065 variables in the function when the blocks get blown away as soon as we
5066 remove the cgraph node. */
5067 (*debug_hooks->outlining_inline_function) (old_decl);
5069 DECL_ARTIFICIAL (new_decl) = 1;
5070 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
5071 DECL_FUNCTION_PERSONALITY (new_decl) = DECL_FUNCTION_PERSONALITY (old_decl);
5073 /* Prepare the data structures for the tree copy. */
5074 memset (&id, 0, sizeof (id));
5076 /* Generate a new name for the new version. */
5077 id.statements_to_fold = pointer_set_create ();
5079 id.decl_map = pointer_map_create ();
5080 id.debug_map = NULL;
5081 id.src_fn = old_decl;
5082 id.dst_fn = new_decl;
5083 id.src_node = old_version_node;
5084 id.dst_node = new_version_node;
5085 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
5086 if (id.src_node->ipa_transforms_to_apply)
5088 VEC(ipa_opt_pass,heap) * old_transforms_to_apply = id.dst_node->ipa_transforms_to_apply;
5091 id.dst_node->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap,
5092 id.src_node->ipa_transforms_to_apply);
5093 for (i = 0; i < VEC_length (ipa_opt_pass, old_transforms_to_apply); i++)
5094 VEC_safe_push (ipa_opt_pass, heap, id.dst_node->ipa_transforms_to_apply,
5095 VEC_index (ipa_opt_pass,
5096 old_transforms_to_apply,
5100 id.copy_decl = copy_decl_no_change;
5101 id.transform_call_graph_edges
5102 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
5103 id.transform_new_cfg = true;
5104 id.transform_return_to_modify = false;
5105 id.transform_lang_insert_block = NULL;
5107 current_function_decl = new_decl;
5108 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
5109 (DECL_STRUCT_FUNCTION (old_decl));
5110 initialize_cfun (new_decl, old_decl,
5111 old_entry_block->count);
5112 DECL_STRUCT_FUNCTION (new_decl)->gimple_df->ipa_pta
5113 = id.src_cfun->gimple_df->ipa_pta;
5114 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
5116 /* Copy the function's static chain. */
5117 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
5119 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
5120 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
5123 /* If there's a tree_map, prepare for substitution. */
5125 for (i = 0; i < VEC_length (ipa_replace_map_p, tree_map); i++)
5128 replace_info = VEC_index (ipa_replace_map_p, tree_map, i);
5129 if (replace_info->replace_p)
5131 tree op = replace_info->new_tree;
5132 if (!replace_info->old_tree)
5134 int i = replace_info->parm_num;
5136 for (parm = DECL_ARGUMENTS (old_decl); i; parm = DECL_CHAIN (parm))
5138 replace_info->old_tree = parm;
5144 if (TREE_CODE (op) == VIEW_CONVERT_EXPR)
5145 op = TREE_OPERAND (op, 0);
5147 if (TREE_CODE (op) == ADDR_EXPR)
5149 op = TREE_OPERAND (op, 0);
5150 while (handled_component_p (op))
5151 op = TREE_OPERAND (op, 0);
5152 if (TREE_CODE (op) == VAR_DECL)
5153 add_referenced_var (op);
5155 gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
5156 init = setup_one_parameter (&id, replace_info->old_tree,
5157 replace_info->new_tree, id.src_fn,
5161 VEC_safe_push (gimple, heap, init_stmts, init);
5164 /* Copy the function's arguments. */
5165 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
5166 DECL_ARGUMENTS (new_decl) =
5167 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
5168 args_to_skip, &vars);
5170 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
5172 declare_inline_vars (DECL_INITIAL (new_decl), vars);
5174 if (!VEC_empty (tree, DECL_STRUCT_FUNCTION (old_decl)->local_decls))
5175 /* Add local vars. */
5176 add_local_variables (DECL_STRUCT_FUNCTION (old_decl), cfun, &id, false);
5178 /* Copy the Function's body. */
5179 copy_body (&id, old_entry_block->count, REG_BR_PROB_BASE,
5180 ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, blocks_to_copy, new_entry);
5182 if (DECL_RESULT (old_decl) != NULL_TREE)
5184 tree *res_decl = &DECL_RESULT (old_decl);
5185 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
5186 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
5189 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5190 number_blocks (new_decl);
5192 /* We want to create the BB unconditionally, so that the addition of
5193 debug stmts doesn't affect BB count, which may in the end cause
5194 codegen differences. */
5195 bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
5196 while (VEC_length (gimple, init_stmts))
5197 insert_init_stmt (&id, bb, VEC_pop (gimple, init_stmts));
5198 update_clone_info (&id);
5200 /* Remap the nonlocal_goto_save_area, if any. */
5201 if (cfun->nonlocal_goto_save_area)
5203 struct walk_stmt_info wi;
5205 memset (&wi, 0, sizeof (wi));
5207 walk_tree (&cfun->nonlocal_goto_save_area, remap_gimple_op_r, &wi, NULL);
5211 pointer_map_destroy (id.decl_map);
5213 pointer_map_destroy (id.debug_map);
5214 free_dominance_info (CDI_DOMINATORS);
5215 free_dominance_info (CDI_POST_DOMINATORS);
5217 fold_marked_statements (0, id.statements_to_fold);
5218 pointer_set_destroy (id.statements_to_fold);
5219 fold_cond_expr_cond ();
5220 delete_unreachable_blocks_update_callgraph (&id);
5221 if (id.dst_node->analyzed)
5222 cgraph_rebuild_references ();
5223 update_ssa (TODO_update_ssa);
5225 /* After partial cloning we need to rescale frequencies, so they are
5226 within proper range in the cloned function. */
5229 struct cgraph_edge *e;
5230 rebuild_frequencies ();
5232 new_version_node->count = ENTRY_BLOCK_PTR->count;
5233 for (e = new_version_node->callees; e; e = e->next_callee)
5235 basic_block bb = gimple_bb (e->call_stmt);
5236 e->frequency = compute_call_stmt_bb_frequency (current_function_decl,
5238 e->count = bb->count;
5240 for (e = new_version_node->indirect_calls; e; e = e->next_callee)
5242 basic_block bb = gimple_bb (e->call_stmt);
5243 e->frequency = compute_call_stmt_bb_frequency (current_function_decl,
5245 e->count = bb->count;
5249 free_dominance_info (CDI_DOMINATORS);
5250 free_dominance_info (CDI_POST_DOMINATORS);
5252 gcc_assert (!id.debug_stmts);
5253 VEC_free (gimple, heap, init_stmts);
5255 current_function_decl = old_current_function_decl;
5256 gcc_assert (!current_function_decl
5257 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
5261 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5262 the callee and return the inlined body on success. */
5265 maybe_inline_call_in_expr (tree exp)
5267 tree fn = get_callee_fndecl (exp);
5269 /* We can only try to inline "const" functions. */
5270 if (fn && TREE_READONLY (fn) && DECL_SAVED_TREE (fn))
5272 struct pointer_map_t *decl_map = pointer_map_create ();
5273 call_expr_arg_iterator iter;
5277 /* Remap the parameters. */
5278 for (param = DECL_ARGUMENTS (fn), arg = first_call_expr_arg (exp, &iter);
5280 param = DECL_CHAIN (param), arg = next_call_expr_arg (&iter))
5281 *pointer_map_insert (decl_map, param) = arg;
5283 memset (&id, 0, sizeof (id));
5285 id.dst_fn = current_function_decl;
5286 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
5287 id.decl_map = decl_map;
5289 id.copy_decl = copy_decl_no_change;
5290 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
5291 id.transform_new_cfg = false;
5292 id.transform_return_to_modify = true;
5293 id.transform_lang_insert_block = false;
5295 /* Make sure not to unshare trees behind the front-end's back
5296 since front-end specific mechanisms may rely on sharing. */
5297 id.regimplify = false;
5298 id.do_not_unshare = true;
5300 /* We're not inside any EH region. */
5303 t = copy_tree_body (&id);
5304 pointer_map_destroy (decl_map);
5306 /* We can only return something suitable for use in a GENERIC
5308 if (TREE_CODE (t) == MODIFY_EXPR)
5309 return TREE_OPERAND (t, 1);
5315 /* Duplicate a type, fields and all. */
5318 build_duplicate_type (tree type)
5320 struct copy_body_data id;
5322 memset (&id, 0, sizeof (id));
5323 id.src_fn = current_function_decl;
5324 id.dst_fn = current_function_decl;
5326 id.decl_map = pointer_map_create ();
5327 id.debug_map = NULL;
5328 id.copy_decl = copy_decl_no_change;
5330 type = remap_type_1 (type, &id);
5332 pointer_map_destroy (id.decl_map);
5334 pointer_map_destroy (id.debug_map);
5336 TYPE_CANONICAL (type) = type;
5341 /* Return whether it is safe to inline a function because it used different
5342 target specific options or call site actual types mismatch parameter types.
5343 E is the call edge to be checked. */
5345 tree_can_inline_p (struct cgraph_edge *e)
5348 /* This causes a regression in SPEC in that it prevents a cold function from
5349 inlining a hot function. Perhaps this should only apply to functions
5350 that the user declares hot/cold/optimize explicitly. */
5352 /* Don't inline a function with a higher optimization level than the
5353 caller, or with different space constraints (hot/cold functions). */
5354 tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller);
5355 tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee);
5357 if (caller_tree != callee_tree)
5359 struct cl_optimization *caller_opt
5360 = TREE_OPTIMIZATION ((caller_tree)
5362 : optimization_default_node);
5364 struct cl_optimization *callee_opt
5365 = TREE_OPTIMIZATION ((callee_tree)
5367 : optimization_default_node);
5369 if ((caller_opt->optimize > callee_opt->optimize)
5370 || (caller_opt->optimize_size != callee_opt->optimize_size))
5374 tree caller, callee, lhs;
5376 caller = e->caller->decl;
5377 callee = e->callee->decl;
5379 /* First check that inlining isn't simply forbidden in this case. */
5380 if (inline_forbidden_into_p (caller, callee))
5382 e->inline_failed = CIF_UNSPECIFIED;
5384 gimple_call_set_cannot_inline (e->call_stmt, true);
5388 /* Allow the backend to decide if inlining is ok. */
5389 if (!targetm.target_option.can_inline_p (caller, callee))
5391 e->inline_failed = CIF_TARGET_OPTION_MISMATCH;
5393 gimple_call_set_cannot_inline (e->call_stmt, true);
5394 e->call_stmt_cannot_inline_p = true;
5398 /* Do not inline calls where we cannot triviall work around mismatches
5399 in argument or return types. */
5401 && ((DECL_RESULT (callee)
5402 && !DECL_BY_REFERENCE (DECL_RESULT (callee))
5403 && (lhs = gimple_call_lhs (e->call_stmt)) != NULL_TREE
5404 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee)),
5406 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee)), lhs))
5407 || !gimple_check_call_args (e->call_stmt)))
5409 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
5411 gimple_call_set_cannot_inline (e->call_stmt, true);
5412 e->call_stmt_cannot_inline_p = true;