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 "toplev.h" /* floor_log2 */
27 #include "diagnostic-core.h"
29 #include "tree-inline.h"
33 #include "insn-config.h"
35 #include "langhooks.h"
36 #include "basic-block.h"
37 #include "tree-iterator.h"
40 #include "tree-mudflap.h"
41 #include "tree-flow.h"
43 #include "tree-flow.h"
44 #include "tree-pretty-print.h"
47 #include "pointer-set.h"
49 #include "value-prof.h"
50 #include "tree-pass.h"
52 #include "integrate.h"
54 #include "rtl.h" /* FIXME: For asm_str_count. */
56 /* I'm not real happy about this, but we need to handle gimple and
60 /* Inlining, Cloning, Versioning, Parallelization
62 Inlining: a function body is duplicated, but the PARM_DECLs are
63 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
64 MODIFY_EXPRs that store to a dedicated returned-value variable.
65 The duplicated eh_region info of the copy will later be appended
66 to the info for the caller; the eh_region info in copied throwing
67 statements and RESX statements are adjusted accordingly.
69 Cloning: (only in C++) We have one body for a con/de/structor, and
70 multiple function decls, each with a unique parameter list.
71 Duplicate the body, using the given splay tree; some parameters
72 will become constants (like 0 or 1).
74 Versioning: a function body is duplicated and the result is a new
75 function rather than into blocks of an existing function as with
76 inlining. Some parameters will become constants.
78 Parallelization: a region of a function is duplicated resulting in
79 a new function. Variables may be replaced with complex expressions
80 to enable shared variable semantics.
82 All of these will simultaneously lookup any callgraph edges. If
83 we're going to inline the duplicated function body, and the given
84 function has some cloned callgraph nodes (one for each place this
85 function will be inlined) those callgraph edges will be duplicated.
86 If we're cloning the body, those callgraph edges will be
87 updated to point into the new body. (Note that the original
88 callgraph node and edge list will not be altered.)
90 See the CALL_EXPR handling case in copy_tree_body_r (). */
94 o In order to make inlining-on-trees work, we pessimized
95 function-local static constants. In particular, they are now
96 always output, even when not addressed. Fix this by treating
97 function-local static constants just like global static
98 constants; the back-end already knows not to output them if they
101 o Provide heuristics to clamp inlining of recursive template
105 /* Weights that estimate_num_insns uses to estimate the size of the
108 eni_weights eni_size_weights;
110 /* Weights that estimate_num_insns uses to estimate the time necessary
111 to execute the produced code. */
113 eni_weights eni_time_weights;
117 static tree declare_return_variable (copy_body_data *, tree, tree, basic_block);
118 static void remap_block (tree *, copy_body_data *);
119 static void copy_bind_expr (tree *, int *, copy_body_data *);
120 static tree mark_local_for_remap_r (tree *, int *, void *);
121 static void unsave_expr_1 (tree);
122 static tree unsave_r (tree *, int *, void *);
123 static void declare_inline_vars (tree, tree);
124 static void remap_save_expr (tree *, void *, int *);
125 static void prepend_lexical_block (tree current_block, tree new_block);
126 static tree copy_decl_to_var (tree, copy_body_data *);
127 static tree copy_result_decl_to_var (tree, copy_body_data *);
128 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
129 static gimple remap_gimple_stmt (gimple, copy_body_data *);
130 static bool delete_unreachable_blocks_update_callgraph (copy_body_data *id);
132 /* Insert a tree->tree mapping for ID. Despite the name suggests
133 that the trees should be variables, it is used for more than that. */
136 insert_decl_map (copy_body_data *id, tree key, tree value)
138 *pointer_map_insert (id->decl_map, key) = value;
140 /* Always insert an identity map as well. If we see this same new
141 node again, we won't want to duplicate it a second time. */
143 *pointer_map_insert (id->decl_map, value) = value;
146 /* Insert a tree->tree mapping for ID. This is only used for
150 insert_debug_decl_map (copy_body_data *id, tree key, tree value)
152 if (!gimple_in_ssa_p (id->src_cfun))
155 if (!MAY_HAVE_DEBUG_STMTS)
158 if (!target_for_debug_bind (key))
161 gcc_assert (TREE_CODE (key) == PARM_DECL);
162 gcc_assert (TREE_CODE (value) == VAR_DECL);
165 id->debug_map = pointer_map_create ();
167 *pointer_map_insert (id->debug_map, key) = value;
170 /* If nonzero, we're remapping the contents of inlined debug
171 statements. If negative, an error has occurred, such as a
172 reference to a variable that isn't available in the inlined
174 static int processing_debug_stmt = 0;
176 /* Construct new SSA name for old NAME. ID is the inline context. */
179 remap_ssa_name (tree name, copy_body_data *id)
184 gcc_assert (TREE_CODE (name) == SSA_NAME);
186 n = (tree *) pointer_map_contains (id->decl_map, name);
188 return unshare_expr (*n);
190 if (processing_debug_stmt)
192 processing_debug_stmt = -1;
196 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
198 new_tree = remap_decl (SSA_NAME_VAR (name), id);
200 /* We might've substituted constant or another SSA_NAME for
203 Replace the SSA name representing RESULT_DECL by variable during
204 inlining: this saves us from need to introduce PHI node in a case
205 return value is just partly initialized. */
206 if ((TREE_CODE (new_tree) == VAR_DECL || TREE_CODE (new_tree) == PARM_DECL)
207 && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
208 || !id->transform_return_to_modify))
210 struct ptr_info_def *pi;
211 new_tree = make_ssa_name (new_tree, NULL);
212 insert_decl_map (id, name, new_tree);
213 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree)
214 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
215 TREE_TYPE (new_tree) = TREE_TYPE (SSA_NAME_VAR (new_tree));
216 /* At least IPA points-to info can be directly transferred. */
217 if (id->src_cfun->gimple_df
218 && id->src_cfun->gimple_df->ipa_pta
219 && (pi = SSA_NAME_PTR_INFO (name))
222 struct ptr_info_def *new_pi = get_ptr_info (new_tree);
225 if (gimple_nop_p (SSA_NAME_DEF_STMT (name)))
227 /* By inlining function having uninitialized variable, we might
228 extend the lifetime (variable might get reused). This cause
229 ICE in the case we end up extending lifetime of SSA name across
230 abnormal edge, but also increase register pressure.
232 We simply initialize all uninitialized vars by 0 except
233 for case we are inlining to very first BB. We can avoid
234 this for all BBs that are not inside strongly connected
235 regions of the CFG, but this is expensive to test. */
237 && is_gimple_reg (SSA_NAME_VAR (name))
238 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name)
239 && TREE_CODE (SSA_NAME_VAR (name)) != PARM_DECL
240 && (id->entry_bb != EDGE_SUCC (ENTRY_BLOCK_PTR, 0)->dest
241 || EDGE_COUNT (id->entry_bb->preds) != 1))
243 gimple_stmt_iterator gsi = gsi_last_bb (id->entry_bb);
246 init_stmt = gimple_build_assign (new_tree,
247 fold_convert (TREE_TYPE (new_tree),
249 gsi_insert_after (&gsi, init_stmt, GSI_NEW_STMT);
250 SSA_NAME_IS_DEFAULT_DEF (new_tree) = 0;
254 SSA_NAME_DEF_STMT (new_tree) = gimple_build_nop ();
255 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name))
257 set_default_def (SSA_NAME_VAR (new_tree), new_tree);
262 insert_decl_map (id, name, new_tree);
266 /* Remap DECL during the copying of the BLOCK tree for the function. */
269 remap_decl (tree decl, copy_body_data *id)
273 /* We only remap local variables in the current function. */
275 /* See if we have remapped this declaration. */
277 n = (tree *) pointer_map_contains (id->decl_map, decl);
279 if (!n && processing_debug_stmt)
281 processing_debug_stmt = -1;
285 /* If we didn't already have an equivalent for this declaration,
289 /* Make a copy of the variable or label. */
290 tree t = id->copy_decl (decl, id);
292 /* Remember it, so that if we encounter this local entity again
293 we can reuse this copy. Do this early because remap_type may
294 need this decl for TYPE_STUB_DECL. */
295 insert_decl_map (id, decl, t);
300 /* Remap types, if necessary. */
301 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
302 if (TREE_CODE (t) == TYPE_DECL)
303 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
305 /* Remap sizes as necessary. */
306 walk_tree (&DECL_SIZE (t), copy_tree_body_r, id, NULL);
307 walk_tree (&DECL_SIZE_UNIT (t), copy_tree_body_r, id, NULL);
309 /* If fields, do likewise for offset and qualifier. */
310 if (TREE_CODE (t) == FIELD_DECL)
312 walk_tree (&DECL_FIELD_OFFSET (t), copy_tree_body_r, id, NULL);
313 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
314 walk_tree (&DECL_QUALIFIER (t), copy_tree_body_r, id, NULL);
317 if (cfun && gimple_in_ssa_p (cfun)
318 && (TREE_CODE (t) == VAR_DECL
319 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
322 add_referenced_var (t);
327 if (id->do_not_unshare)
330 return unshare_expr (*n);
334 remap_type_1 (tree type, copy_body_data *id)
338 /* We do need a copy. build and register it now. If this is a pointer or
339 reference type, remap the designated type and make a new pointer or
341 if (TREE_CODE (type) == POINTER_TYPE)
343 new_tree = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
345 TYPE_REF_CAN_ALIAS_ALL (type));
346 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
347 new_tree = build_type_attribute_qual_variant (new_tree,
348 TYPE_ATTRIBUTES (type),
350 insert_decl_map (id, type, new_tree);
353 else if (TREE_CODE (type) == REFERENCE_TYPE)
355 new_tree = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
357 TYPE_REF_CAN_ALIAS_ALL (type));
358 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
359 new_tree = build_type_attribute_qual_variant (new_tree,
360 TYPE_ATTRIBUTES (type),
362 insert_decl_map (id, type, new_tree);
366 new_tree = copy_node (type);
368 insert_decl_map (id, type, new_tree);
370 /* This is a new type, not a copy of an old type. Need to reassociate
371 variants. We can handle everything except the main variant lazily. */
372 t = TYPE_MAIN_VARIANT (type);
375 t = remap_type (t, id);
376 TYPE_MAIN_VARIANT (new_tree) = t;
377 TYPE_NEXT_VARIANT (new_tree) = TYPE_NEXT_VARIANT (t);
378 TYPE_NEXT_VARIANT (t) = new_tree;
382 TYPE_MAIN_VARIANT (new_tree) = new_tree;
383 TYPE_NEXT_VARIANT (new_tree) = NULL;
386 if (TYPE_STUB_DECL (type))
387 TYPE_STUB_DECL (new_tree) = remap_decl (TYPE_STUB_DECL (type), id);
389 /* Lazily create pointer and reference types. */
390 TYPE_POINTER_TO (new_tree) = NULL;
391 TYPE_REFERENCE_TO (new_tree) = NULL;
393 switch (TREE_CODE (new_tree))
397 case FIXED_POINT_TYPE:
400 t = TYPE_MIN_VALUE (new_tree);
401 if (t && TREE_CODE (t) != INTEGER_CST)
402 walk_tree (&TYPE_MIN_VALUE (new_tree), copy_tree_body_r, id, NULL);
404 t = TYPE_MAX_VALUE (new_tree);
405 if (t && TREE_CODE (t) != INTEGER_CST)
406 walk_tree (&TYPE_MAX_VALUE (new_tree), copy_tree_body_r, id, NULL);
410 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
411 walk_tree (&TYPE_ARG_TYPES (new_tree), copy_tree_body_r, id, NULL);
415 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
416 TYPE_DOMAIN (new_tree) = remap_type (TYPE_DOMAIN (new_tree), id);
421 case QUAL_UNION_TYPE:
425 for (f = TYPE_FIELDS (new_tree); f ; f = DECL_CHAIN (f))
427 t = remap_decl (f, id);
428 DECL_CONTEXT (t) = new_tree;
432 TYPE_FIELDS (new_tree) = nreverse (nf);
438 /* Shouldn't have been thought variable sized. */
442 walk_tree (&TYPE_SIZE (new_tree), copy_tree_body_r, id, NULL);
443 walk_tree (&TYPE_SIZE_UNIT (new_tree), copy_tree_body_r, id, NULL);
449 remap_type (tree type, copy_body_data *id)
457 /* See if we have remapped this type. */
458 node = (tree *) pointer_map_contains (id->decl_map, type);
462 /* The type only needs remapping if it's variably modified. */
463 if (! variably_modified_type_p (type, id->src_fn))
465 insert_decl_map (id, type, type);
469 id->remapping_type_depth++;
470 tmp = remap_type_1 (type, id);
471 id->remapping_type_depth--;
476 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
477 is NULL or TYPE has not been remapped before. */
480 remapped_type (tree type, copy_body_data *id)
487 /* See if we have remapped this type. */
488 node = (tree *) pointer_map_contains (id->decl_map, type);
495 /* The type only needs remapping if it's variably modified. */
496 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
499 can_be_nonlocal (tree decl, copy_body_data *id)
501 /* We can not duplicate function decls. */
502 if (TREE_CODE (decl) == FUNCTION_DECL)
505 /* Local static vars must be non-local or we get multiple declaration
507 if (TREE_CODE (decl) == VAR_DECL
508 && !auto_var_in_fn_p (decl, id->src_fn))
511 /* At the moment dwarf2out can handle only these types of nodes. We
512 can support more later. */
513 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != PARM_DECL)
516 /* We must use global type. We call remapped_type instead of
517 remap_type since we don't want to remap this type here if it
518 hasn't been remapped before. */
519 if (TREE_TYPE (decl) != remapped_type (TREE_TYPE (decl), id))
522 /* Wihtout SSA we can't tell if variable is used. */
523 if (!gimple_in_ssa_p (cfun))
526 /* Live variables must be copied so we can attach DECL_RTL. */
534 remap_decls (tree decls, VEC(tree,gc) **nonlocalized_list, copy_body_data *id)
537 tree new_decls = NULL_TREE;
539 /* Remap its variables. */
540 for (old_var = decls; old_var; old_var = DECL_CHAIN (old_var))
544 if (can_be_nonlocal (old_var, id))
546 if (TREE_CODE (old_var) == VAR_DECL
547 && ! DECL_EXTERNAL (old_var)
548 && (var_ann (old_var) || !gimple_in_ssa_p (cfun)))
549 add_local_decl (cfun, old_var);
550 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
551 && !DECL_IGNORED_P (old_var)
552 && nonlocalized_list)
553 VEC_safe_push (tree, gc, *nonlocalized_list, old_var);
557 /* Remap the variable. */
558 new_var = remap_decl (old_var, id);
560 /* If we didn't remap this variable, we can't mess with its
561 TREE_CHAIN. If we remapped this variable to the return slot, it's
562 already declared somewhere else, so don't declare it here. */
564 if (new_var == id->retvar)
568 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
569 && !DECL_IGNORED_P (old_var)
570 && nonlocalized_list)
571 VEC_safe_push (tree, gc, *nonlocalized_list, old_var);
575 gcc_assert (DECL_P (new_var));
576 DECL_CHAIN (new_var) = new_decls;
579 /* Also copy value-expressions. */
580 if (TREE_CODE (new_var) == VAR_DECL
581 && DECL_HAS_VALUE_EXPR_P (new_var))
583 tree tem = DECL_VALUE_EXPR (new_var);
584 bool old_regimplify = id->regimplify;
585 id->remapping_type_depth++;
586 walk_tree (&tem, copy_tree_body_r, id, NULL);
587 id->remapping_type_depth--;
588 id->regimplify = old_regimplify;
589 SET_DECL_VALUE_EXPR (new_var, tem);
594 return nreverse (new_decls);
597 /* Copy the BLOCK to contain remapped versions of the variables
598 therein. And hook the new block into the block-tree. */
601 remap_block (tree *block, copy_body_data *id)
606 /* Make the new block. */
608 new_block = make_node (BLOCK);
609 TREE_USED (new_block) = TREE_USED (old_block);
610 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
611 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
612 BLOCK_NONLOCALIZED_VARS (new_block)
613 = VEC_copy (tree, gc, BLOCK_NONLOCALIZED_VARS (old_block));
616 /* Remap its variables. */
617 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block),
618 &BLOCK_NONLOCALIZED_VARS (new_block),
621 if (id->transform_lang_insert_block)
622 id->transform_lang_insert_block (new_block);
624 /* Remember the remapped block. */
625 insert_decl_map (id, old_block, new_block);
628 /* Copy the whole block tree and root it in id->block. */
630 remap_blocks (tree block, copy_body_data *id)
633 tree new_tree = block;
638 remap_block (&new_tree, id);
639 gcc_assert (new_tree != block);
640 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
641 prepend_lexical_block (new_tree, remap_blocks (t, id));
642 /* Blocks are in arbitrary order, but make things slightly prettier and do
643 not swap order when producing a copy. */
644 BLOCK_SUBBLOCKS (new_tree) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree));
649 copy_statement_list (tree *tp)
651 tree_stmt_iterator oi, ni;
654 new_tree = alloc_stmt_list ();
655 ni = tsi_start (new_tree);
656 oi = tsi_start (*tp);
657 TREE_TYPE (new_tree) = TREE_TYPE (*tp);
660 for (; !tsi_end_p (oi); tsi_next (&oi))
662 tree stmt = tsi_stmt (oi);
663 if (TREE_CODE (stmt) == STATEMENT_LIST)
664 copy_statement_list (&stmt);
665 tsi_link_after (&ni, stmt, TSI_CONTINUE_LINKING);
670 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
672 tree block = BIND_EXPR_BLOCK (*tp);
673 /* Copy (and replace) the statement. */
674 copy_tree_r (tp, walk_subtrees, NULL);
677 remap_block (&block, id);
678 BIND_EXPR_BLOCK (*tp) = block;
681 if (BIND_EXPR_VARS (*tp))
682 /* This will remap a lot of the same decls again, but this should be
684 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), NULL, id);
688 /* Create a new gimple_seq by remapping all the statements in BODY
689 using the inlining information in ID. */
692 remap_gimple_seq (gimple_seq body, copy_body_data *id)
694 gimple_stmt_iterator si;
695 gimple_seq new_body = NULL;
697 for (si = gsi_start (body); !gsi_end_p (si); gsi_next (&si))
699 gimple new_stmt = remap_gimple_stmt (gsi_stmt (si), id);
700 gimple_seq_add_stmt (&new_body, new_stmt);
707 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
708 block using the mapping information in ID. */
711 copy_gimple_bind (gimple stmt, copy_body_data *id)
714 tree new_block, new_vars;
715 gimple_seq body, new_body;
717 /* Copy the statement. Note that we purposely don't use copy_stmt
718 here because we need to remap statements as we copy. */
719 body = gimple_bind_body (stmt);
720 new_body = remap_gimple_seq (body, id);
722 new_block = gimple_bind_block (stmt);
724 remap_block (&new_block, id);
726 /* This will remap a lot of the same decls again, but this should be
728 new_vars = gimple_bind_vars (stmt);
730 new_vars = remap_decls (new_vars, NULL, id);
732 new_bind = gimple_build_bind (new_vars, new_body, new_block);
738 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
739 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
740 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
741 recursing into the children nodes of *TP. */
744 remap_gimple_op_r (tree *tp, int *walk_subtrees, void *data)
746 struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
747 copy_body_data *id = (copy_body_data *) wi_p->info;
748 tree fn = id->src_fn;
750 if (TREE_CODE (*tp) == SSA_NAME)
752 *tp = remap_ssa_name (*tp, id);
756 else if (auto_var_in_fn_p (*tp, fn))
758 /* Local variables and labels need to be replaced by equivalent
759 variables. We don't want to copy static variables; there's
760 only one of those, no matter how many times we inline the
761 containing function. Similarly for globals from an outer
765 /* Remap the declaration. */
766 new_decl = remap_decl (*tp, id);
767 gcc_assert (new_decl);
768 /* Replace this variable with the copy. */
769 STRIP_TYPE_NOPS (new_decl);
770 /* ??? The C++ frontend uses void * pointer zero to initialize
771 any other type. This confuses the middle-end type verification.
772 As cloned bodies do not go through gimplification again the fixup
773 there doesn't trigger. */
774 if (TREE_CODE (new_decl) == INTEGER_CST
775 && !useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (new_decl)))
776 new_decl = fold_convert (TREE_TYPE (*tp), new_decl);
780 else if (TREE_CODE (*tp) == STATEMENT_LIST)
782 else if (TREE_CODE (*tp) == SAVE_EXPR)
784 else if (TREE_CODE (*tp) == LABEL_DECL
785 && (!DECL_CONTEXT (*tp)
786 || decl_function_context (*tp) == id->src_fn))
787 /* These may need to be remapped for EH handling. */
788 *tp = remap_decl (*tp, id);
789 else if (TYPE_P (*tp))
790 /* Types may need remapping as well. */
791 *tp = remap_type (*tp, id);
792 else if (CONSTANT_CLASS_P (*tp))
794 /* If this is a constant, we have to copy the node iff the type
795 will be remapped. copy_tree_r will not copy a constant. */
796 tree new_type = remap_type (TREE_TYPE (*tp), id);
798 if (new_type == TREE_TYPE (*tp))
801 else if (TREE_CODE (*tp) == INTEGER_CST)
802 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
803 TREE_INT_CST_HIGH (*tp));
806 *tp = copy_node (*tp);
807 TREE_TYPE (*tp) = new_type;
812 /* Otherwise, just copy the node. Note that copy_tree_r already
813 knows not to copy VAR_DECLs, etc., so this is safe. */
814 if (TREE_CODE (*tp) == MEM_REF)
816 /* We need to re-canonicalize MEM_REFs from inline substitutions
817 that can happen when a pointer argument is an ADDR_EXPR. */
818 tree decl = TREE_OPERAND (*tp, 0);
821 /* See remap_ssa_name. */
822 if (TREE_CODE (decl) == SSA_NAME
823 && TREE_CODE (SSA_NAME_VAR (decl)) == RESULT_DECL
824 && id->transform_return_to_modify)
825 decl = SSA_NAME_VAR (decl);
827 n = (tree *) pointer_map_contains (id->decl_map, decl);
831 tree ptr = unshare_expr (*n);
833 if ((tem = maybe_fold_offset_to_reference (EXPR_LOCATION (*tp),
835 TREE_OPERAND (*tp, 1),
837 && TREE_THIS_VOLATILE (tem) == TREE_THIS_VOLATILE (old))
839 tree *tem_basep = &tem;
840 while (handled_component_p (*tem_basep))
841 tem_basep = &TREE_OPERAND (*tem_basep, 0);
842 if (TREE_CODE (*tem_basep) == MEM_REF)
844 = build2 (MEM_REF, TREE_TYPE (*tem_basep),
845 TREE_OPERAND (*tem_basep, 0),
846 fold_convert (TREE_TYPE (TREE_OPERAND (*tp, 1)),
847 TREE_OPERAND (*tem_basep, 1)));
850 = build2 (MEM_REF, TREE_TYPE (*tem_basep),
851 build_fold_addr_expr (*tem_basep),
853 (TREE_TYPE (TREE_OPERAND (*tp, 1)), 0));
858 *tp = fold_build2 (MEM_REF, TREE_TYPE (*tp),
859 ptr, TREE_OPERAND (*tp, 1));
860 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
862 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
868 /* Here is the "usual case". Copy this tree node, and then
869 tweak some special cases. */
870 copy_tree_r (tp, walk_subtrees, NULL);
872 /* Global variables we haven't seen yet need to go into referenced
873 vars. If not referenced from types only. */
874 if (gimple_in_ssa_p (cfun)
875 && TREE_CODE (*tp) == VAR_DECL
876 && id->remapping_type_depth == 0
877 && !processing_debug_stmt)
878 add_referenced_var (*tp);
880 /* We should never have TREE_BLOCK set on non-statements. */
882 gcc_assert (!TREE_BLOCK (*tp));
884 if (TREE_CODE (*tp) != OMP_CLAUSE)
885 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
887 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
889 /* The copied TARGET_EXPR has never been expanded, even if the
890 original node was expanded already. */
891 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
892 TREE_OPERAND (*tp, 3) = NULL_TREE;
894 else if (TREE_CODE (*tp) == ADDR_EXPR)
896 /* Variable substitution need not be simple. In particular,
897 the MEM_REF substitution above. Make sure that
898 TREE_CONSTANT and friends are up-to-date. But make sure
899 to not improperly set TREE_BLOCK on some sub-expressions. */
900 int invariant = is_gimple_min_invariant (*tp);
901 tree block = id->block;
902 id->block = NULL_TREE;
903 walk_tree (&TREE_OPERAND (*tp, 0), remap_gimple_op_r, data, NULL);
905 recompute_tree_invariant_for_addr_expr (*tp);
907 /* If this used to be invariant, but is not any longer,
908 then regimplification is probably needed. */
909 if (invariant && !is_gimple_min_invariant (*tp))
910 id->regimplify = true;
916 /* Keep iterating. */
921 /* Called from copy_body_id via walk_tree. DATA is really a
922 `copy_body_data *'. */
925 copy_tree_body_r (tree *tp, int *walk_subtrees, void *data)
927 copy_body_data *id = (copy_body_data *) data;
928 tree fn = id->src_fn;
931 /* Begin by recognizing trees that we'll completely rewrite for the
932 inlining context. Our output for these trees is completely
933 different from out input (e.g. RETURN_EXPR is deleted, and morphs
934 into an edge). Further down, we'll handle trees that get
935 duplicated and/or tweaked. */
937 /* When requested, RETURN_EXPRs should be transformed to just the
938 contained MODIFY_EXPR. The branch semantics of the return will
939 be handled elsewhere by manipulating the CFG rather than a statement. */
940 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
942 tree assignment = TREE_OPERAND (*tp, 0);
944 /* If we're returning something, just turn that into an
945 assignment into the equivalent of the original RESULT_DECL.
946 If the "assignment" is just the result decl, the result
947 decl has already been set (e.g. a recent "foo (&result_decl,
948 ...)"); just toss the entire RETURN_EXPR. */
949 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
951 /* Replace the RETURN_EXPR with (a copy of) the
952 MODIFY_EXPR hanging underneath. */
953 *tp = copy_node (assignment);
955 else /* Else the RETURN_EXPR returns no value. */
958 return (tree) (void *)1;
961 else if (TREE_CODE (*tp) == SSA_NAME)
963 *tp = remap_ssa_name (*tp, id);
968 /* Local variables and labels need to be replaced by equivalent
969 variables. We don't want to copy static variables; there's only
970 one of those, no matter how many times we inline the containing
971 function. Similarly for globals from an outer function. */
972 else if (auto_var_in_fn_p (*tp, fn))
976 /* Remap the declaration. */
977 new_decl = remap_decl (*tp, id);
978 gcc_assert (new_decl);
979 /* Replace this variable with the copy. */
980 STRIP_TYPE_NOPS (new_decl);
984 else if (TREE_CODE (*tp) == STATEMENT_LIST)
985 copy_statement_list (tp);
986 else if (TREE_CODE (*tp) == SAVE_EXPR
987 || TREE_CODE (*tp) == TARGET_EXPR)
988 remap_save_expr (tp, id->decl_map, walk_subtrees);
989 else if (TREE_CODE (*tp) == LABEL_DECL
990 && (! DECL_CONTEXT (*tp)
991 || decl_function_context (*tp) == id->src_fn))
992 /* These may need to be remapped for EH handling. */
993 *tp = remap_decl (*tp, id);
994 else if (TREE_CODE (*tp) == BIND_EXPR)
995 copy_bind_expr (tp, walk_subtrees, id);
996 /* Types may need remapping as well. */
997 else if (TYPE_P (*tp))
998 *tp = remap_type (*tp, id);
1000 /* If this is a constant, we have to copy the node iff the type will be
1001 remapped. copy_tree_r will not copy a constant. */
1002 else if (CONSTANT_CLASS_P (*tp))
1004 tree new_type = remap_type (TREE_TYPE (*tp), id);
1006 if (new_type == TREE_TYPE (*tp))
1009 else if (TREE_CODE (*tp) == INTEGER_CST)
1010 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
1011 TREE_INT_CST_HIGH (*tp));
1014 *tp = copy_node (*tp);
1015 TREE_TYPE (*tp) = new_type;
1019 /* Otherwise, just copy the node. Note that copy_tree_r already
1020 knows not to copy VAR_DECLs, etc., so this is safe. */
1023 /* Here we handle trees that are not completely rewritten.
1024 First we detect some inlining-induced bogosities for
1026 if (TREE_CODE (*tp) == MODIFY_EXPR
1027 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
1028 && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn)))
1030 /* Some assignments VAR = VAR; don't generate any rtl code
1031 and thus don't count as variable modification. Avoid
1032 keeping bogosities like 0 = 0. */
1033 tree decl = TREE_OPERAND (*tp, 0), value;
1036 n = (tree *) pointer_map_contains (id->decl_map, decl);
1040 STRIP_TYPE_NOPS (value);
1041 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1043 *tp = build_empty_stmt (EXPR_LOCATION (*tp));
1044 return copy_tree_body_r (tp, walk_subtrees, data);
1048 else if (TREE_CODE (*tp) == INDIRECT_REF)
1050 /* Get rid of *& from inline substitutions that can happen when a
1051 pointer argument is an ADDR_EXPR. */
1052 tree decl = TREE_OPERAND (*tp, 0);
1055 n = (tree *) pointer_map_contains (id->decl_map, decl);
1060 /* If we happen to get an ADDR_EXPR in n->value, strip
1061 it manually here as we'll eventually get ADDR_EXPRs
1062 which lie about their types pointed to. In this case
1063 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1064 but we absolutely rely on that. As fold_indirect_ref
1065 does other useful transformations, try that first, though. */
1066 tree type = TREE_TYPE (TREE_TYPE (*n));
1067 if (id->do_not_unshare)
1070 new_tree = unshare_expr (*n);
1072 *tp = gimple_fold_indirect_ref (new_tree);
1075 if (TREE_CODE (new_tree) == ADDR_EXPR)
1077 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
1079 /* ??? We should either assert here or build
1080 a VIEW_CONVERT_EXPR instead of blindly leaking
1081 incompatible types to our IL. */
1083 *tp = TREE_OPERAND (new_tree, 0);
1087 *tp = build1 (INDIRECT_REF, type, new_tree);
1088 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1089 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1096 else if (TREE_CODE (*tp) == MEM_REF)
1098 /* We need to re-canonicalize MEM_REFs from inline substitutions
1099 that can happen when a pointer argument is an ADDR_EXPR. */
1100 tree decl = TREE_OPERAND (*tp, 0);
1103 n = (tree *) pointer_map_contains (id->decl_map, decl);
1107 *tp = fold_build2 (MEM_REF, TREE_TYPE (*tp),
1108 unshare_expr (*n), TREE_OPERAND (*tp, 1));
1109 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1110 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
1116 /* Here is the "usual case". Copy this tree node, and then
1117 tweak some special cases. */
1118 copy_tree_r (tp, walk_subtrees, NULL);
1120 /* Global variables we haven't seen yet needs to go into referenced
1121 vars. If not referenced from types or debug stmts only. */
1122 if (gimple_in_ssa_p (cfun)
1123 && TREE_CODE (*tp) == VAR_DECL
1124 && id->remapping_type_depth == 0
1125 && !processing_debug_stmt)
1126 add_referenced_var (*tp);
1128 /* If EXPR has block defined, map it to newly constructed block.
1129 When inlining we want EXPRs without block appear in the block
1130 of function call if we are not remapping a type. */
1133 new_block = id->remapping_type_depth == 0 ? id->block : NULL;
1134 if (TREE_BLOCK (*tp))
1137 n = (tree *) pointer_map_contains (id->decl_map,
1139 gcc_assert (n || id->remapping_type_depth != 0);
1143 TREE_BLOCK (*tp) = new_block;
1146 if (TREE_CODE (*tp) != OMP_CLAUSE)
1147 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
1149 /* The copied TARGET_EXPR has never been expanded, even if the
1150 original node was expanded already. */
1151 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
1153 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
1154 TREE_OPERAND (*tp, 3) = NULL_TREE;
1157 /* Variable substitution need not be simple. In particular, the
1158 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1159 and friends are up-to-date. */
1160 else if (TREE_CODE (*tp) == ADDR_EXPR)
1162 int invariant = is_gimple_min_invariant (*tp);
1163 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
1165 /* Handle the case where we substituted an INDIRECT_REF
1166 into the operand of the ADDR_EXPR. */
1167 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
1168 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
1170 recompute_tree_invariant_for_addr_expr (*tp);
1172 /* If this used to be invariant, but is not any longer,
1173 then regimplification is probably needed. */
1174 if (invariant && !is_gimple_min_invariant (*tp))
1175 id->regimplify = true;
1181 /* Keep iterating. */
1185 /* Helper for remap_gimple_stmt. Given an EH region number for the
1186 source function, map that to the duplicate EH region number in
1187 the destination function. */
1190 remap_eh_region_nr (int old_nr, copy_body_data *id)
1192 eh_region old_r, new_r;
1195 old_r = get_eh_region_from_number_fn (id->src_cfun, old_nr);
1196 slot = pointer_map_contains (id->eh_map, old_r);
1197 new_r = (eh_region) *slot;
1199 return new_r->index;
1202 /* Similar, but operate on INTEGER_CSTs. */
1205 remap_eh_region_tree_nr (tree old_t_nr, copy_body_data *id)
1209 old_nr = tree_low_cst (old_t_nr, 0);
1210 new_nr = remap_eh_region_nr (old_nr, id);
1212 return build_int_cst (NULL, new_nr);
1215 /* Helper for copy_bb. Remap statement STMT using the inlining
1216 information in ID. Return the new statement copy. */
1219 remap_gimple_stmt (gimple stmt, copy_body_data *id)
1222 struct walk_stmt_info wi;
1224 bool skip_first = false;
1226 /* Begin by recognizing trees that we'll completely rewrite for the
1227 inlining context. Our output for these trees is completely
1228 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1229 into an edge). Further down, we'll handle trees that get
1230 duplicated and/or tweaked. */
1232 /* When requested, GIMPLE_RETURNs should be transformed to just the
1233 contained GIMPLE_ASSIGN. The branch semantics of the return will
1234 be handled elsewhere by manipulating the CFG rather than the
1236 if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify)
1238 tree retval = gimple_return_retval (stmt);
1240 /* If we're returning something, just turn that into an
1241 assignment into the equivalent of the original RESULT_DECL.
1242 If RETVAL is just the result decl, the result decl has
1243 already been set (e.g. a recent "foo (&result_decl, ...)");
1244 just toss the entire GIMPLE_RETURN. */
1246 && (TREE_CODE (retval) != RESULT_DECL
1247 && (TREE_CODE (retval) != SSA_NAME
1248 || TREE_CODE (SSA_NAME_VAR (retval)) != RESULT_DECL)))
1250 copy = gimple_build_assign (id->retvar, retval);
1251 /* id->retvar is already substituted. Skip it on later remapping. */
1255 return gimple_build_nop ();
1257 else if (gimple_has_substatements (stmt))
1261 /* When cloning bodies from the C++ front end, we will be handed bodies
1262 in High GIMPLE form. Handle here all the High GIMPLE statements that
1263 have embedded statements. */
1264 switch (gimple_code (stmt))
1267 copy = copy_gimple_bind (stmt, id);
1271 s1 = remap_gimple_seq (gimple_catch_handler (stmt), id);
1272 copy = gimple_build_catch (gimple_catch_types (stmt), s1);
1275 case GIMPLE_EH_FILTER:
1276 s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id);
1277 copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1);
1281 s1 = remap_gimple_seq (gimple_try_eval (stmt), id);
1282 s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id);
1283 copy = gimple_build_try (s1, s2, gimple_try_kind (stmt));
1286 case GIMPLE_WITH_CLEANUP_EXPR:
1287 s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id);
1288 copy = gimple_build_wce (s1);
1291 case GIMPLE_OMP_PARALLEL:
1292 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1293 copy = gimple_build_omp_parallel
1295 gimple_omp_parallel_clauses (stmt),
1296 gimple_omp_parallel_child_fn (stmt),
1297 gimple_omp_parallel_data_arg (stmt));
1300 case GIMPLE_OMP_TASK:
1301 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1302 copy = gimple_build_omp_task
1304 gimple_omp_task_clauses (stmt),
1305 gimple_omp_task_child_fn (stmt),
1306 gimple_omp_task_data_arg (stmt),
1307 gimple_omp_task_copy_fn (stmt),
1308 gimple_omp_task_arg_size (stmt),
1309 gimple_omp_task_arg_align (stmt));
1312 case GIMPLE_OMP_FOR:
1313 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1314 s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id);
1315 copy = gimple_build_omp_for (s1, gimple_omp_for_clauses (stmt),
1316 gimple_omp_for_collapse (stmt), s2);
1319 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1321 gimple_omp_for_set_index (copy, i,
1322 gimple_omp_for_index (stmt, i));
1323 gimple_omp_for_set_initial (copy, i,
1324 gimple_omp_for_initial (stmt, i));
1325 gimple_omp_for_set_final (copy, i,
1326 gimple_omp_for_final (stmt, i));
1327 gimple_omp_for_set_incr (copy, i,
1328 gimple_omp_for_incr (stmt, i));
1329 gimple_omp_for_set_cond (copy, i,
1330 gimple_omp_for_cond (stmt, i));
1335 case GIMPLE_OMP_MASTER:
1336 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1337 copy = gimple_build_omp_master (s1);
1340 case GIMPLE_OMP_ORDERED:
1341 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1342 copy = gimple_build_omp_ordered (s1);
1345 case GIMPLE_OMP_SECTION:
1346 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1347 copy = gimple_build_omp_section (s1);
1350 case GIMPLE_OMP_SECTIONS:
1351 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1352 copy = gimple_build_omp_sections
1353 (s1, gimple_omp_sections_clauses (stmt));
1356 case GIMPLE_OMP_SINGLE:
1357 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1358 copy = gimple_build_omp_single
1359 (s1, gimple_omp_single_clauses (stmt));
1362 case GIMPLE_OMP_CRITICAL:
1363 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1365 = gimple_build_omp_critical (s1, gimple_omp_critical_name (stmt));
1374 if (gimple_assign_copy_p (stmt)
1375 && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt)
1376 && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn))
1378 /* Here we handle statements that are not completely rewritten.
1379 First we detect some inlining-induced bogosities for
1382 /* Some assignments VAR = VAR; don't generate any rtl code
1383 and thus don't count as variable modification. Avoid
1384 keeping bogosities like 0 = 0. */
1385 tree decl = gimple_assign_lhs (stmt), value;
1388 n = (tree *) pointer_map_contains (id->decl_map, decl);
1392 STRIP_TYPE_NOPS (value);
1393 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1394 return gimple_build_nop ();
1398 if (gimple_debug_bind_p (stmt))
1400 copy = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt),
1401 gimple_debug_bind_get_value (stmt),
1403 VEC_safe_push (gimple, heap, id->debug_stmts, copy);
1407 /* Create a new deep copy of the statement. */
1408 copy = gimple_copy (stmt);
1410 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1411 RESX and EH_DISPATCH. */
1413 switch (gimple_code (copy))
1417 tree r, fndecl = gimple_call_fndecl (copy);
1418 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
1419 switch (DECL_FUNCTION_CODE (fndecl))
1421 case BUILT_IN_EH_COPY_VALUES:
1422 r = gimple_call_arg (copy, 1);
1423 r = remap_eh_region_tree_nr (r, id);
1424 gimple_call_set_arg (copy, 1, r);
1427 case BUILT_IN_EH_POINTER:
1428 case BUILT_IN_EH_FILTER:
1429 r = gimple_call_arg (copy, 0);
1430 r = remap_eh_region_tree_nr (r, id);
1431 gimple_call_set_arg (copy, 0, r);
1438 /* Reset alias info if we didn't apply measures to
1439 keep it valid over inlining by setting DECL_PT_UID. */
1440 if (!id->src_cfun->gimple_df
1441 || !id->src_cfun->gimple_df->ipa_pta)
1442 gimple_call_reset_alias_info (copy);
1448 int r = gimple_resx_region (copy);
1449 r = remap_eh_region_nr (r, id);
1450 gimple_resx_set_region (copy, r);
1454 case GIMPLE_EH_DISPATCH:
1456 int r = gimple_eh_dispatch_region (copy);
1457 r = remap_eh_region_nr (r, id);
1458 gimple_eh_dispatch_set_region (copy, r);
1467 /* If STMT has a block defined, map it to the newly constructed
1468 block. When inlining we want statements without a block to
1469 appear in the block of the function call. */
1470 new_block = id->block;
1471 if (gimple_block (copy))
1474 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (copy));
1479 gimple_set_block (copy, new_block);
1481 if (gimple_debug_bind_p (copy))
1484 /* Remap all the operands in COPY. */
1485 memset (&wi, 0, sizeof (wi));
1488 walk_tree (gimple_op_ptr (copy, 1), remap_gimple_op_r, &wi, NULL);
1490 walk_gimple_op (copy, remap_gimple_op_r, &wi);
1492 /* Clear the copied virtual operands. We are not remapping them here
1493 but are going to recreate them from scratch. */
1494 if (gimple_has_mem_ops (copy))
1496 gimple_set_vdef (copy, NULL_TREE);
1497 gimple_set_vuse (copy, NULL_TREE);
1504 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1508 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale,
1509 gcov_type count_scale)
1511 gimple_stmt_iterator gsi, copy_gsi, seq_gsi;
1512 basic_block copy_basic_block;
1517 /* Search for previous copied basic block. */
1520 prev = prev->prev_bb;
1522 /* create_basic_block() will append every new block to
1523 basic_block_info automatically. */
1524 copy_basic_block = create_basic_block (NULL, (void *) 0,
1525 (basic_block) prev->aux);
1526 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
1528 /* We are going to rebuild frequencies from scratch. These values
1529 have just small importance to drive canonicalize_loop_headers. */
1530 freq = ((gcov_type)bb->frequency * frequency_scale / REG_BR_PROB_BASE);
1532 /* We recompute frequencies after inlining, so this is quite safe. */
1533 if (freq > BB_FREQ_MAX)
1535 copy_basic_block->frequency = freq;
1537 copy_gsi = gsi_start_bb (copy_basic_block);
1539 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1541 gimple stmt = gsi_stmt (gsi);
1542 gimple orig_stmt = stmt;
1544 id->regimplify = false;
1545 stmt = remap_gimple_stmt (stmt, id);
1546 if (gimple_nop_p (stmt))
1549 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
1552 /* With return slot optimization we can end up with
1553 non-gimple (foo *)&this->m, fix that here. */
1554 if (is_gimple_assign (stmt)
1555 && gimple_assign_rhs_code (stmt) == NOP_EXPR
1556 && !is_gimple_val (gimple_assign_rhs1 (stmt)))
1559 new_rhs = force_gimple_operand_gsi (&seq_gsi,
1560 gimple_assign_rhs1 (stmt),
1561 true, NULL, false, GSI_NEW_STMT);
1562 gimple_assign_set_rhs1 (stmt, new_rhs);
1563 id->regimplify = false;
1566 gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT);
1569 gimple_regimplify_operands (stmt, &seq_gsi);
1571 /* If copy_basic_block has been empty at the start of this iteration,
1572 call gsi_start_bb again to get at the newly added statements. */
1573 if (gsi_end_p (copy_gsi))
1574 copy_gsi = gsi_start_bb (copy_basic_block);
1576 gsi_next (©_gsi);
1578 /* Process the new statement. The call to gimple_regimplify_operands
1579 possibly turned the statement into multiple statements, we
1580 need to process all of them. */
1585 stmt = gsi_stmt (copy_gsi);
1586 if (is_gimple_call (stmt)
1587 && gimple_call_va_arg_pack_p (stmt)
1590 /* __builtin_va_arg_pack () should be replaced by
1591 all arguments corresponding to ... in the caller. */
1594 VEC(tree, heap) *argarray;
1595 size_t nargs = gimple_call_num_args (id->gimple_call);
1598 for (p = DECL_ARGUMENTS (id->src_fn); p; p = DECL_CHAIN (p))
1601 /* Create the new array of arguments. */
1602 n = nargs + gimple_call_num_args (stmt);
1603 argarray = VEC_alloc (tree, heap, n);
1604 VEC_safe_grow (tree, heap, argarray, n);
1606 /* Copy all the arguments before '...' */
1607 memcpy (VEC_address (tree, argarray),
1608 gimple_call_arg_ptr (stmt, 0),
1609 gimple_call_num_args (stmt) * sizeof (tree));
1611 /* Append the arguments passed in '...' */
1612 memcpy (VEC_address(tree, argarray) + gimple_call_num_args (stmt),
1613 gimple_call_arg_ptr (id->gimple_call, 0)
1614 + (gimple_call_num_args (id->gimple_call) - nargs),
1615 nargs * sizeof (tree));
1617 new_call = gimple_build_call_vec (gimple_call_fn (stmt),
1620 VEC_free (tree, heap, argarray);
1622 /* Copy all GIMPLE_CALL flags, location and block, except
1623 GF_CALL_VA_ARG_PACK. */
1624 gimple_call_copy_flags (new_call, stmt);
1625 gimple_call_set_va_arg_pack (new_call, false);
1626 gimple_set_location (new_call, gimple_location (stmt));
1627 gimple_set_block (new_call, gimple_block (stmt));
1628 gimple_call_set_lhs (new_call, gimple_call_lhs (stmt));
1630 gsi_replace (©_gsi, new_call, false);
1633 else if (is_gimple_call (stmt)
1635 && (decl = gimple_call_fndecl (stmt))
1636 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1637 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN)
1639 /* __builtin_va_arg_pack_len () should be replaced by
1640 the number of anonymous arguments. */
1641 size_t nargs = gimple_call_num_args (id->gimple_call);
1645 for (p = DECL_ARGUMENTS (id->src_fn); p; p = DECL_CHAIN (p))
1648 count = build_int_cst (integer_type_node, nargs);
1649 new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count);
1650 gsi_replace (©_gsi, new_stmt, false);
1654 /* Statements produced by inlining can be unfolded, especially
1655 when we constant propagated some operands. We can't fold
1656 them right now for two reasons:
1657 1) folding require SSA_NAME_DEF_STMTs to be correct
1658 2) we can't change function calls to builtins.
1659 So we just mark statement for later folding. We mark
1660 all new statements, instead just statements that has changed
1661 by some nontrivial substitution so even statements made
1662 foldable indirectly are updated. If this turns out to be
1663 expensive, copy_body can be told to watch for nontrivial
1665 if (id->statements_to_fold)
1666 pointer_set_insert (id->statements_to_fold, stmt);
1668 /* We're duplicating a CALL_EXPR. Find any corresponding
1669 callgraph edges and update or duplicate them. */
1670 if (is_gimple_call (stmt))
1672 struct cgraph_edge *edge;
1675 switch (id->transform_call_graph_edges)
1677 case CB_CGE_DUPLICATE:
1678 edge = cgraph_edge (id->src_node, orig_stmt);
1681 int edge_freq = edge->frequency;
1682 edge = cgraph_clone_edge (edge, id->dst_node, stmt,
1684 REG_BR_PROB_BASE, CGRAPH_FREQ_BASE,
1685 edge->frequency, true);
1686 /* We could also just rescale the frequency, but
1687 doing so would introduce roundoff errors and make
1688 verifier unhappy. */
1690 = compute_call_stmt_bb_frequency (id->dst_node->decl,
1693 && profile_status_for_function (cfun) != PROFILE_ABSENT
1694 && (edge_freq > edge->frequency + 10
1695 || edge_freq < edge->frequency - 10))
1697 fprintf (dump_file, "Edge frequency estimated by "
1698 "cgraph %i diverge from inliner's estimate %i\n",
1702 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1705 copy_basic_block->frequency);
1707 stmt = cgraph_redirect_edge_call_stmt_to_callee (edge);
1711 case CB_CGE_MOVE_CLONES:
1712 cgraph_set_call_stmt_including_clones (id->dst_node,
1714 edge = cgraph_edge (id->dst_node, stmt);
1718 edge = cgraph_edge (id->dst_node, orig_stmt);
1720 cgraph_set_call_stmt (edge, stmt);
1727 /* Constant propagation on argument done during inlining
1728 may create new direct call. Produce an edge for it. */
1730 || (edge->indirect_inlining_edge
1731 && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES))
1732 && (fn = gimple_call_fndecl (stmt)) != NULL)
1734 struct cgraph_node *dest = cgraph_node (fn);
1736 /* We have missing edge in the callgraph. This can happen
1737 when previous inlining turned an indirect call into a
1738 direct call by constant propagating arguments or we are
1739 producing dead clone (for further cloning). In all
1740 other cases we hit a bug (incorrect node sharing is the
1741 most common reason for missing edges). */
1742 gcc_assert (dest->needed || !dest->analyzed
1743 || dest->address_taken
1744 || !id->src_node->analyzed
1745 || !id->dst_node->analyzed);
1746 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)
1747 cgraph_create_edge_including_clones
1748 (id->dst_node, dest, orig_stmt, stmt, bb->count,
1749 compute_call_stmt_bb_frequency (id->dst_node->decl,
1751 bb->loop_depth, CIF_ORIGINALLY_INDIRECT_CALL);
1753 cgraph_create_edge (id->dst_node, dest, stmt,
1755 compute_call_stmt_bb_frequency
1756 (id->dst_node->decl, copy_basic_block),
1757 bb->loop_depth)->inline_failed
1758 = CIF_ORIGINALLY_INDIRECT_CALL;
1761 fprintf (dump_file, "Created new direct edge to %s\n",
1762 cgraph_node_name (dest));
1766 flags = gimple_call_flags (stmt);
1767 if (flags & ECF_MAY_BE_ALLOCA)
1768 cfun->calls_alloca = true;
1769 if (flags & ECF_RETURNS_TWICE)
1770 cfun->calls_setjmp = true;
1773 maybe_duplicate_eh_stmt_fn (cfun, stmt, id->src_cfun, orig_stmt,
1774 id->eh_map, id->eh_lp_nr);
1776 if (gimple_in_ssa_p (cfun) && !is_gimple_debug (stmt))
1781 find_new_referenced_vars (gsi_stmt (copy_gsi));
1782 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1783 if (TREE_CODE (def) == SSA_NAME)
1784 SSA_NAME_DEF_STMT (def) = stmt;
1787 gsi_next (©_gsi);
1789 while (!gsi_end_p (copy_gsi));
1791 copy_gsi = gsi_last_bb (copy_basic_block);
1794 return copy_basic_block;
1797 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1798 form is quite easy, since dominator relationship for old basic blocks does
1801 There is however exception where inlining might change dominator relation
1802 across EH edges from basic block within inlined functions destinating
1803 to landing pads in function we inline into.
1805 The function fills in PHI_RESULTs of such PHI nodes if they refer
1806 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1807 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1808 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1809 set, and this means that there will be no overlapping live ranges
1810 for the underlying symbol.
1812 This might change in future if we allow redirecting of EH edges and
1813 we might want to change way build CFG pre-inlining to include
1814 all the possible edges then. */
1816 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1817 bool can_throw, bool nonlocal_goto)
1822 FOR_EACH_EDGE (e, ei, bb->succs)
1824 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1827 gimple_stmt_iterator si;
1830 gcc_assert (e->flags & EDGE_EH);
1833 gcc_assert (!(e->flags & EDGE_EH));
1835 for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
1839 phi = gsi_stmt (si);
1841 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1842 gcc_assert (!e->dest->aux);
1844 gcc_assert ((e->flags & EDGE_EH)
1845 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
1847 if (!is_gimple_reg (PHI_RESULT (phi)))
1849 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi)));
1853 re = find_edge (ret_bb, e->dest);
1855 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1856 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1858 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1859 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1865 /* Copy edges from BB into its copy constructed earlier, scale profile
1866 accordingly. Edges will be taken care of later. Assume aux
1867 pointers to point to the copies of each BB. Return true if any
1868 debug stmts are left after a statement that must end the basic block. */
1871 copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb)
1873 basic_block new_bb = (basic_block) bb->aux;
1876 gimple_stmt_iterator si;
1878 bool need_debug_cleanup = false;
1880 /* Use the indices from the original blocks to create edges for the
1882 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1883 if (!(old_edge->flags & EDGE_EH))
1887 flags = old_edge->flags;
1889 /* Return edges do get a FALLTHRU flag when the get inlined. */
1890 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1891 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1892 flags |= EDGE_FALLTHRU;
1893 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1894 new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1895 new_edge->probability = old_edge->probability;
1898 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1901 for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
1904 bool can_throw, nonlocal_goto;
1906 copy_stmt = gsi_stmt (si);
1907 if (!is_gimple_debug (copy_stmt))
1909 update_stmt (copy_stmt);
1910 if (gimple_in_ssa_p (cfun))
1911 mark_symbols_for_renaming (copy_stmt);
1914 /* Do this before the possible split_block. */
1917 /* If this tree could throw an exception, there are two
1918 cases where we need to add abnormal edge(s): the
1919 tree wasn't in a region and there is a "current
1920 region" in the caller; or the original tree had
1921 EH edges. In both cases split the block after the tree,
1922 and add abnormal edge(s) as needed; we need both
1923 those from the callee and the caller.
1924 We check whether the copy can throw, because the const
1925 propagation can change an INDIRECT_REF which throws
1926 into a COMPONENT_REF which doesn't. If the copy
1927 can throw, the original could also throw. */
1928 can_throw = stmt_can_throw_internal (copy_stmt);
1929 nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt);
1931 if (can_throw || nonlocal_goto)
1933 if (!gsi_end_p (si))
1935 while (!gsi_end_p (si) && is_gimple_debug (gsi_stmt (si)))
1938 need_debug_cleanup = true;
1940 if (!gsi_end_p (si))
1941 /* Note that bb's predecessor edges aren't necessarily
1942 right at this point; split_block doesn't care. */
1944 edge e = split_block (new_bb, copy_stmt);
1947 new_bb->aux = e->src->aux;
1948 si = gsi_start_bb (new_bb);
1952 if (gimple_code (copy_stmt) == GIMPLE_EH_DISPATCH)
1953 make_eh_dispatch_edges (copy_stmt);
1955 make_eh_edges (copy_stmt);
1958 make_abnormal_goto_edges (gimple_bb (copy_stmt), true);
1960 if ((can_throw || nonlocal_goto)
1961 && gimple_in_ssa_p (cfun))
1962 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
1963 can_throw, nonlocal_goto);
1965 return need_debug_cleanup;
1968 /* Copy the PHIs. All blocks and edges are copied, some blocks
1969 was possibly split and new outgoing EH edges inserted.
1970 BB points to the block of original function and AUX pointers links
1971 the original and newly copied blocks. */
1974 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1976 basic_block const new_bb = (basic_block) bb->aux;
1979 gimple_stmt_iterator si;
1981 for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si))
1987 phi = gsi_stmt (si);
1988 res = PHI_RESULT (phi);
1990 if (is_gimple_reg (res))
1992 walk_tree (&new_res, copy_tree_body_r, id, NULL);
1993 SSA_NAME_DEF_STMT (new_res)
1994 = new_phi = create_phi_node (new_res, new_bb);
1995 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1997 edge old_edge = find_edge ((basic_block) new_edge->src->aux, bb);
2000 tree block = id->block;
2003 /* When doing partial cloning, we allow PHIs on the entry block
2004 as long as all the arguments are the same. Find any input
2005 edge to see argument to copy. */
2007 FOR_EACH_EDGE (old_edge, ei2, bb->preds)
2008 if (!old_edge->src->aux)
2011 arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
2013 id->block = NULL_TREE;
2014 walk_tree (&new_arg, copy_tree_body_r, id, NULL);
2016 gcc_assert (new_arg);
2017 /* With return slot optimization we can end up with
2018 non-gimple (foo *)&this->m, fix that here. */
2019 if (TREE_CODE (new_arg) != SSA_NAME
2020 && TREE_CODE (new_arg) != FUNCTION_DECL
2021 && !is_gimple_val (new_arg))
2023 gimple_seq stmts = NULL;
2024 new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
2025 gsi_insert_seq_on_edge_immediate (new_edge, stmts);
2027 add_phi_arg (new_phi, new_arg, new_edge,
2028 gimple_phi_arg_location_from_edge (phi, old_edge));
2035 /* Wrapper for remap_decl so it can be used as a callback. */
2038 remap_decl_1 (tree decl, void *data)
2040 return remap_decl (decl, (copy_body_data *) data);
2043 /* Build struct function and associated datastructures for the new clone
2044 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
2047 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count)
2049 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2050 gcov_type count_scale;
2052 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
2053 count_scale = (REG_BR_PROB_BASE * count
2054 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
2056 count_scale = REG_BR_PROB_BASE;
2058 /* Register specific tree functions. */
2059 gimple_register_cfg_hooks ();
2061 /* Get clean struct function. */
2062 push_struct_function (new_fndecl);
2064 /* We will rebuild these, so just sanity check that they are empty. */
2065 gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
2066 gcc_assert (cfun->local_decls == NULL);
2067 gcc_assert (cfun->cfg == NULL);
2068 gcc_assert (cfun->decl == new_fndecl);
2070 /* Copy items we preserve during cloning. */
2071 cfun->static_chain_decl = src_cfun->static_chain_decl;
2072 cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
2073 cfun->function_end_locus = src_cfun->function_end_locus;
2074 cfun->curr_properties = src_cfun->curr_properties;
2075 cfun->last_verified = src_cfun->last_verified;
2076 cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
2077 cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
2078 cfun->has_nonlocal_label = src_cfun->has_nonlocal_label;
2079 cfun->stdarg = src_cfun->stdarg;
2080 cfun->dont_save_pending_sizes_p = src_cfun->dont_save_pending_sizes_p;
2081 cfun->after_inlining = src_cfun->after_inlining;
2082 cfun->can_throw_non_call_exceptions
2083 = src_cfun->can_throw_non_call_exceptions;
2084 cfun->returns_struct = src_cfun->returns_struct;
2085 cfun->returns_pcc_struct = src_cfun->returns_pcc_struct;
2086 cfun->after_tree_profile = src_cfun->after_tree_profile;
2088 init_empty_tree_cfg ();
2090 profile_status_for_function (cfun) = profile_status_for_function (src_cfun);
2091 ENTRY_BLOCK_PTR->count =
2092 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2094 ENTRY_BLOCK_PTR->frequency
2095 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2096 EXIT_BLOCK_PTR->count =
2097 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2099 EXIT_BLOCK_PTR->frequency =
2100 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2102 init_eh_for_function ();
2104 if (src_cfun->gimple_df)
2106 init_tree_ssa (cfun);
2107 cfun->gimple_df->in_ssa_p = true;
2108 init_ssa_operands ();
2113 /* Helper function for copy_cfg_body. Move debug stmts from the end
2114 of NEW_BB to the beginning of successor basic blocks when needed. If the
2115 successor has multiple predecessors, reset them, otherwise keep
2119 maybe_move_debug_stmts_to_successors (copy_body_data *id, basic_block new_bb)
2123 gimple_stmt_iterator si = gsi_last_nondebug_bb (new_bb);
2126 || gsi_one_before_end_p (si)
2127 || !(stmt_can_throw_internal (gsi_stmt (si))
2128 || stmt_can_make_abnormal_goto (gsi_stmt (si))))
2131 FOR_EACH_EDGE (e, ei, new_bb->succs)
2133 gimple_stmt_iterator ssi = gsi_last_bb (new_bb);
2134 gimple_stmt_iterator dsi = gsi_after_labels (e->dest);
2135 while (is_gimple_debug (gsi_stmt (ssi)))
2137 gimple stmt = gsi_stmt (ssi), new_stmt;
2141 /* For the last edge move the debug stmts instead of copying
2143 if (ei_one_before_end_p (ei))
2147 if (!single_pred_p (e->dest))
2148 gimple_debug_bind_reset_value (stmt);
2149 gsi_remove (&si, false);
2150 gsi_insert_before (&dsi, stmt, GSI_SAME_STMT);
2154 var = gimple_debug_bind_get_var (stmt);
2155 if (single_pred_p (e->dest))
2157 value = gimple_debug_bind_get_value (stmt);
2158 value = unshare_expr (value);
2162 new_stmt = gimple_build_debug_bind (var, value, stmt);
2163 gsi_insert_before (&dsi, new_stmt, GSI_SAME_STMT);
2164 VEC_safe_push (gimple, heap, id->debug_stmts, new_stmt);
2170 /* Make a copy of the body of FN so that it can be inserted inline in
2171 another function. Walks FN via CFG, returns new fndecl. */
2174 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency_scale,
2175 basic_block entry_block_map, basic_block exit_block_map,
2176 bitmap blocks_to_copy, basic_block new_entry)
2178 tree callee_fndecl = id->src_fn;
2179 /* Original cfun for the callee, doesn't change. */
2180 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2181 struct function *cfun_to_copy;
2183 tree new_fndecl = NULL;
2184 bool need_debug_cleanup = false;
2185 gcov_type count_scale;
2187 int incoming_frequency = 0;
2188 gcov_type incoming_count = 0;
2190 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
2191 count_scale = (REG_BR_PROB_BASE * count
2192 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
2194 count_scale = REG_BR_PROB_BASE;
2196 /* Register specific tree functions. */
2197 gimple_register_cfg_hooks ();
2199 /* If we are inlining just region of the function, make sure to connect new entry
2200 to ENTRY_BLOCK_PTR. Since new entry can be part of loop, we must compute
2201 frequency and probability of ENTRY_BLOCK_PTR based on the frequencies and
2202 probabilities of edges incoming from nonduplicated region. */
2208 FOR_EACH_EDGE (e, ei, new_entry->preds)
2211 incoming_frequency += EDGE_FREQUENCY (e);
2212 incoming_count += e->count;
2214 incoming_count = incoming_count * count_scale / REG_BR_PROB_BASE;
2216 = incoming_frequency * frequency_scale / REG_BR_PROB_BASE;
2217 ENTRY_BLOCK_PTR->count = incoming_count;
2218 ENTRY_BLOCK_PTR->frequency = incoming_frequency;
2221 /* Must have a CFG here at this point. */
2222 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2223 (DECL_STRUCT_FUNCTION (callee_fndecl)));
2225 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2227 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
2228 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
2229 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2230 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2232 /* Duplicate any exception-handling regions. */
2234 id->eh_map = duplicate_eh_regions (cfun_to_copy, NULL, id->eh_lp_nr,
2237 /* Use aux pointers to map the original blocks to copy. */
2238 FOR_EACH_BB_FN (bb, cfun_to_copy)
2239 if (!blocks_to_copy || bitmap_bit_p (blocks_to_copy, bb->index))
2241 basic_block new_bb = copy_bb (id, bb, frequency_scale, count_scale);
2246 last = last_basic_block;
2248 /* Now that we've duplicated the blocks, duplicate their edges. */
2249 FOR_ALL_BB_FN (bb, cfun_to_copy)
2251 || (bb->index > 0 && bitmap_bit_p (blocks_to_copy, bb->index)))
2252 need_debug_cleanup |= copy_edges_for_bb (bb, count_scale, exit_block_map);
2256 edge e = make_edge (entry_block_map, (basic_block)new_entry->aux, EDGE_FALLTHRU);
2257 e->probability = REG_BR_PROB_BASE;
2258 e->count = incoming_count;
2261 if (gimple_in_ssa_p (cfun))
2262 FOR_ALL_BB_FN (bb, cfun_to_copy)
2264 || (bb->index > 0 && bitmap_bit_p (blocks_to_copy, bb->index)))
2265 copy_phis_for_bb (bb, id);
2267 FOR_ALL_BB_FN (bb, cfun_to_copy)
2270 if (need_debug_cleanup
2271 && bb->index != ENTRY_BLOCK
2272 && bb->index != EXIT_BLOCK)
2273 maybe_move_debug_stmts_to_successors (id, (basic_block) bb->aux);
2274 ((basic_block)bb->aux)->aux = NULL;
2278 /* Zero out AUX fields of newly created block during EH edge
2280 for (; last < last_basic_block; last++)
2282 if (need_debug_cleanup)
2283 maybe_move_debug_stmts_to_successors (id, BASIC_BLOCK (last));
2284 BASIC_BLOCK (last)->aux = NULL;
2286 entry_block_map->aux = NULL;
2287 exit_block_map->aux = NULL;
2291 pointer_map_destroy (id->eh_map);
2298 /* Copy the debug STMT using ID. We deal with these statements in a
2299 special way: if any variable in their VALUE expression wasn't
2300 remapped yet, we won't remap it, because that would get decl uids
2301 out of sync, causing codegen differences between -g and -g0. If
2302 this arises, we drop the VALUE expression altogether. */
2305 copy_debug_stmt (gimple stmt, copy_body_data *id)
2308 struct walk_stmt_info wi;
2311 if (gimple_block (stmt))
2314 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (stmt));
2318 gimple_set_block (stmt, t);
2320 /* Remap all the operands in COPY. */
2321 memset (&wi, 0, sizeof (wi));
2324 processing_debug_stmt = 1;
2326 t = gimple_debug_bind_get_var (stmt);
2328 if (TREE_CODE (t) == PARM_DECL && id->debug_map
2329 && (n = (tree *) pointer_map_contains (id->debug_map, t)))
2331 gcc_assert (TREE_CODE (*n) == VAR_DECL);
2334 else if (TREE_CODE (t) == VAR_DECL
2336 && gimple_in_ssa_p (cfun)
2337 && !pointer_map_contains (id->decl_map, t)
2339 /* T is a non-localized variable. */;
2341 walk_tree (&t, remap_gimple_op_r, &wi, NULL);
2343 gimple_debug_bind_set_var (stmt, t);
2345 if (gimple_debug_bind_has_value_p (stmt))
2346 walk_tree (gimple_debug_bind_get_value_ptr (stmt),
2347 remap_gimple_op_r, &wi, NULL);
2349 /* Punt if any decl couldn't be remapped. */
2350 if (processing_debug_stmt < 0)
2351 gimple_debug_bind_reset_value (stmt);
2353 processing_debug_stmt = 0;
2356 if (gimple_in_ssa_p (cfun))
2357 mark_symbols_for_renaming (stmt);
2360 /* Process deferred debug stmts. In order to give values better odds
2361 of being successfully remapped, we delay the processing of debug
2362 stmts until all other stmts that might require remapping are
2366 copy_debug_stmts (copy_body_data *id)
2371 if (!id->debug_stmts)
2374 FOR_EACH_VEC_ELT (gimple, id->debug_stmts, i, stmt)
2375 copy_debug_stmt (stmt, id);
2377 VEC_free (gimple, heap, id->debug_stmts);
2380 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2381 another function. */
2384 copy_tree_body (copy_body_data *id)
2386 tree fndecl = id->src_fn;
2387 tree body = DECL_SAVED_TREE (fndecl);
2389 walk_tree (&body, copy_tree_body_r, id, NULL);
2394 /* Make a copy of the body of FN so that it can be inserted inline in
2395 another function. */
2398 copy_body (copy_body_data *id, gcov_type count, int frequency_scale,
2399 basic_block entry_block_map, basic_block exit_block_map,
2400 bitmap blocks_to_copy, basic_block new_entry)
2402 tree fndecl = id->src_fn;
2405 /* If this body has a CFG, walk CFG and copy. */
2406 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
2407 body = copy_cfg_body (id, count, frequency_scale, entry_block_map, exit_block_map,
2408 blocks_to_copy, new_entry);
2409 copy_debug_stmts (id);
2414 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2415 defined in function FN, or of a data member thereof. */
2418 self_inlining_addr_expr (tree value, tree fn)
2422 if (TREE_CODE (value) != ADDR_EXPR)
2425 var = get_base_address (TREE_OPERAND (value, 0));
2427 return var && auto_var_in_fn_p (var, fn);
2430 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2431 lexical block and line number information from base_stmt, if given,
2432 or from the last stmt of the block otherwise. */
2435 insert_init_debug_bind (copy_body_data *id,
2436 basic_block bb, tree var, tree value,
2440 gimple_stmt_iterator gsi;
2443 if (!gimple_in_ssa_p (id->src_cfun))
2446 if (!MAY_HAVE_DEBUG_STMTS)
2449 tracked_var = target_for_debug_bind (var);
2455 gsi = gsi_last_bb (bb);
2456 if (!base_stmt && !gsi_end_p (gsi))
2457 base_stmt = gsi_stmt (gsi);
2460 note = gimple_build_debug_bind (tracked_var, value, base_stmt);
2464 if (!gsi_end_p (gsi))
2465 gsi_insert_after (&gsi, note, GSI_SAME_STMT);
2467 gsi_insert_before (&gsi, note, GSI_SAME_STMT);
2474 insert_init_stmt (copy_body_data *id, basic_block bb, gimple init_stmt)
2476 /* If VAR represents a zero-sized variable, it's possible that the
2477 assignment statement may result in no gimple statements. */
2480 gimple_stmt_iterator si = gsi_last_bb (bb);
2482 /* We can end up with init statements that store to a non-register
2483 from a rhs with a conversion. Handle that here by forcing the
2484 rhs into a temporary. gimple_regimplify_operands is not
2485 prepared to do this for us. */
2486 if (!is_gimple_debug (init_stmt)
2487 && !is_gimple_reg (gimple_assign_lhs (init_stmt))
2488 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt)))
2489 && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS)
2491 tree rhs = build1 (gimple_assign_rhs_code (init_stmt),
2492 gimple_expr_type (init_stmt),
2493 gimple_assign_rhs1 (init_stmt));
2494 rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false,
2496 gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs));
2497 gimple_assign_set_rhs1 (init_stmt, rhs);
2499 gsi_insert_after (&si, init_stmt, GSI_NEW_STMT);
2500 gimple_regimplify_operands (init_stmt, &si);
2501 mark_symbols_for_renaming (init_stmt);
2503 if (!is_gimple_debug (init_stmt) && MAY_HAVE_DEBUG_STMTS)
2505 tree var, def = gimple_assign_lhs (init_stmt);
2507 if (TREE_CODE (def) == SSA_NAME)
2508 var = SSA_NAME_VAR (def);
2512 insert_init_debug_bind (id, bb, var, def, init_stmt);
2517 /* Initialize parameter P with VALUE. If needed, produce init statement
2518 at the end of BB. When BB is NULL, we return init statement to be
2521 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
2522 basic_block bb, tree *vars)
2524 gimple init_stmt = NULL;
2527 tree def = (gimple_in_ssa_p (cfun)
2528 ? gimple_default_def (id->src_cfun, p) : NULL);
2531 && value != error_mark_node
2532 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
2534 if (fold_convertible_p (TREE_TYPE (p), value))
2535 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
2537 /* ??? For valid (GIMPLE) programs we should not end up here.
2538 Still if something has gone wrong and we end up with truly
2539 mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2540 to not leak invalid GIMPLE to the following passes. */
2541 rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value);
2544 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2545 here since the type of this decl must be visible to the calling
2547 var = copy_decl_to_var (p, id);
2549 /* We're actually using the newly-created var. */
2550 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
2553 add_referenced_var (var);
2556 /* Declare this new variable. */
2557 DECL_CHAIN (var) = *vars;
2560 /* Make gimplifier happy about this variable. */
2561 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2563 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2564 we would not need to create a new variable here at all, if it
2565 weren't for debug info. Still, we can just use the argument
2567 if (TREE_READONLY (p)
2568 && !TREE_ADDRESSABLE (p)
2569 && value && !TREE_SIDE_EFFECTS (value)
2572 /* We may produce non-gimple trees by adding NOPs or introduce
2573 invalid sharing when operand is not really constant.
2574 It is not big deal to prohibit constant propagation here as
2575 we will constant propagate in DOM1 pass anyway. */
2576 if (is_gimple_min_invariant (value)
2577 && useless_type_conversion_p (TREE_TYPE (p),
2579 /* We have to be very careful about ADDR_EXPR. Make sure
2580 the base variable isn't a local variable of the inlined
2581 function, e.g., when doing recursive inlining, direct or
2582 mutually-recursive or whatever, which is why we don't
2583 just test whether fn == current_function_decl. */
2584 && ! self_inlining_addr_expr (value, fn))
2586 insert_decl_map (id, p, value);
2587 insert_debug_decl_map (id, p, var);
2588 return insert_init_debug_bind (id, bb, var, value, NULL);
2592 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2593 that way, when the PARM_DECL is encountered, it will be
2594 automatically replaced by the VAR_DECL. */
2595 insert_decl_map (id, p, var);
2597 /* Even if P was TREE_READONLY, the new VAR should not be.
2598 In the original code, we would have constructed a
2599 temporary, and then the function body would have never
2600 changed the value of P. However, now, we will be
2601 constructing VAR directly. The constructor body may
2602 change its value multiple times as it is being
2603 constructed. Therefore, it must not be TREE_READONLY;
2604 the back-end assumes that TREE_READONLY variable is
2605 assigned to only once. */
2606 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
2607 TREE_READONLY (var) = 0;
2609 /* If there is no setup required and we are in SSA, take the easy route
2610 replacing all SSA names representing the function parameter by the
2611 SSA name passed to function.
2613 We need to construct map for the variable anyway as it might be used
2614 in different SSA names when parameter is set in function.
2616 Do replacement at -O0 for const arguments replaced by constant.
2617 This is important for builtin_constant_p and other construct requiring
2618 constant argument to be visible in inlined function body. */
2619 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
2621 || (TREE_READONLY (p)
2622 && is_gimple_min_invariant (rhs)))
2623 && (TREE_CODE (rhs) == SSA_NAME
2624 || is_gimple_min_invariant (rhs))
2625 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
2627 insert_decl_map (id, def, rhs);
2628 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2631 /* If the value of argument is never used, don't care about initializing
2633 if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
2635 gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
2636 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2639 /* Initialize this VAR_DECL from the equivalent argument. Convert
2640 the argument to the proper type in case it was promoted. */
2643 if (rhs == error_mark_node)
2645 insert_decl_map (id, p, var);
2646 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2649 STRIP_USELESS_TYPE_CONVERSION (rhs);
2651 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2652 keep our trees in gimple form. */
2653 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
2655 def = remap_ssa_name (def, id);
2656 init_stmt = gimple_build_assign (def, rhs);
2657 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
2658 set_default_def (var, NULL);
2661 init_stmt = gimple_build_assign (var, rhs);
2663 if (bb && init_stmt)
2664 insert_init_stmt (id, bb, init_stmt);
2669 /* Generate code to initialize the parameters of the function at the
2670 top of the stack in ID from the GIMPLE_CALL STMT. */
2673 initialize_inlined_parameters (copy_body_data *id, gimple stmt,
2674 tree fn, basic_block bb)
2679 tree vars = NULL_TREE;
2680 tree static_chain = gimple_call_chain (stmt);
2682 /* Figure out what the parameters are. */
2683 parms = DECL_ARGUMENTS (fn);
2685 /* Loop through the parameter declarations, replacing each with an
2686 equivalent VAR_DECL, appropriately initialized. */
2687 for (p = parms, i = 0; p; p = DECL_CHAIN (p), i++)
2690 val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL;
2691 setup_one_parameter (id, p, val, fn, bb, &vars);
2693 /* After remapping parameters remap their types. This has to be done
2694 in a second loop over all parameters to appropriately remap
2695 variable sized arrays when the size is specified in a
2696 parameter following the array. */
2697 for (p = parms, i = 0; p; p = DECL_CHAIN (p), i++)
2699 tree *varp = (tree *) pointer_map_contains (id->decl_map, p);
2701 && TREE_CODE (*varp) == VAR_DECL)
2703 tree def = (gimple_in_ssa_p (cfun) && is_gimple_reg (p)
2704 ? gimple_default_def (id->src_cfun, p) : NULL);
2706 TREE_TYPE (var) = remap_type (TREE_TYPE (var), id);
2707 /* Also remap the default definition if it was remapped
2708 to the default definition of the parameter replacement
2709 by the parameter setup. */
2712 tree *defp = (tree *) pointer_map_contains (id->decl_map, def);
2714 && TREE_CODE (*defp) == SSA_NAME
2715 && SSA_NAME_VAR (*defp) == var)
2716 TREE_TYPE (*defp) = TREE_TYPE (var);
2721 /* Initialize the static chain. */
2722 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
2723 gcc_assert (fn != current_function_decl);
2726 /* No static chain? Seems like a bug in tree-nested.c. */
2727 gcc_assert (static_chain);
2729 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
2732 declare_inline_vars (id->block, vars);
2736 /* Declare a return variable to replace the RESULT_DECL for the
2737 function we are calling. An appropriate DECL_STMT is returned.
2738 The USE_STMT is filled to contain a use of the declaration to
2739 indicate the return value of the function.
2741 RETURN_SLOT, if non-null is place where to store the result. It
2742 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2743 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2745 The return value is a (possibly null) value that holds the result
2746 as seen by the caller. */
2749 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
2750 basic_block entry_bb)
2752 tree callee = id->src_fn;
2753 tree caller = id->dst_fn;
2754 tree result = DECL_RESULT (callee);
2755 tree callee_type = TREE_TYPE (result);
2759 /* Handle type-mismatches in the function declaration return type
2760 vs. the call expression. */
2762 caller_type = TREE_TYPE (modify_dest);
2764 caller_type = TREE_TYPE (TREE_TYPE (callee));
2766 /* We don't need to do anything for functions that don't return
2768 if (!result || VOID_TYPE_P (callee_type))
2771 /* If there was a return slot, then the return value is the
2772 dereferenced address of that object. */
2775 /* The front end shouldn't have used both return_slot and
2776 a modify expression. */
2777 gcc_assert (!modify_dest);
2778 if (DECL_BY_REFERENCE (result))
2780 tree return_slot_addr = build_fold_addr_expr (return_slot);
2781 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
2783 /* We are going to construct *&return_slot and we can't do that
2784 for variables believed to be not addressable.
2786 FIXME: This check possibly can match, because values returned
2787 via return slot optimization are not believed to have address
2788 taken by alias analysis. */
2789 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
2790 var = return_slot_addr;
2795 gcc_assert (TREE_CODE (var) != SSA_NAME);
2796 TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
2798 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2799 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2800 && !DECL_GIMPLE_REG_P (result)
2802 DECL_GIMPLE_REG_P (var) = 0;
2807 /* All types requiring non-trivial constructors should have been handled. */
2808 gcc_assert (!TREE_ADDRESSABLE (callee_type));
2810 /* Attempt to avoid creating a new temporary variable. */
2812 && TREE_CODE (modify_dest) != SSA_NAME)
2814 bool use_it = false;
2816 /* We can't use MODIFY_DEST if there's type promotion involved. */
2817 if (!useless_type_conversion_p (callee_type, caller_type))
2820 /* ??? If we're assigning to a variable sized type, then we must
2821 reuse the destination variable, because we've no good way to
2822 create variable sized temporaries at this point. */
2823 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
2826 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2827 reuse it as the result of the call directly. Don't do this if
2828 it would promote MODIFY_DEST to addressable. */
2829 else if (TREE_ADDRESSABLE (result))
2833 tree base_m = get_base_address (modify_dest);
2835 /* If the base isn't a decl, then it's a pointer, and we don't
2836 know where that's going to go. */
2837 if (!DECL_P (base_m))
2839 else if (is_global_var (base_m))
2841 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2842 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2843 && !DECL_GIMPLE_REG_P (result)
2844 && DECL_GIMPLE_REG_P (base_m))
2846 else if (!TREE_ADDRESSABLE (base_m))
2858 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
2860 var = copy_result_decl_to_var (result, id);
2861 if (gimple_in_ssa_p (cfun))
2864 add_referenced_var (var);
2867 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2868 add_local_decl (DECL_STRUCT_FUNCTION (caller), var);
2870 /* Do not have the rest of GCC warn about this variable as it should
2871 not be visible to the user. */
2872 TREE_NO_WARNING (var) = 1;
2874 declare_inline_vars (id->block, var);
2876 /* Build the use expr. If the return type of the function was
2877 promoted, convert it back to the expected type. */
2879 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
2880 use = fold_convert (caller_type, var);
2882 STRIP_USELESS_TYPE_CONVERSION (use);
2884 if (DECL_BY_REFERENCE (result))
2886 TREE_ADDRESSABLE (var) = 1;
2887 var = build_fold_addr_expr (var);
2891 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2892 way, when the RESULT_DECL is encountered, it will be
2893 automatically replaced by the VAR_DECL.
2895 When returning by reference, ensure that RESULT_DECL remaps to
2897 if (DECL_BY_REFERENCE (result)
2898 && !is_gimple_val (var))
2900 tree temp = create_tmp_var (TREE_TYPE (result), "retvalptr");
2901 if (gimple_in_ssa_p (id->src_cfun))
2904 add_referenced_var (temp);
2906 insert_decl_map (id, result, temp);
2907 /* When RESULT_DECL is in SSA form, we need to use it's default_def
2909 if (gimple_in_ssa_p (id->src_cfun) && gimple_default_def (id->src_cfun, result))
2910 temp = remap_ssa_name (gimple_default_def (id->src_cfun, result), id);
2911 insert_init_stmt (id, entry_bb, gimple_build_assign (temp, var));
2914 insert_decl_map (id, result, var);
2916 /* Remember this so we can ignore it in remap_decls. */
2922 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2923 to a local label. */
2926 has_label_address_in_static_1 (tree *nodep, int *walk_subtrees, void *fnp)
2929 tree fn = (tree) fnp;
2931 if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
2940 /* Determine if the function can be copied. If so return NULL. If
2941 not return a string describng the reason for failure. */
2944 copy_forbidden (struct function *fun, tree fndecl)
2946 const char *reason = fun->cannot_be_copied_reason;
2950 /* Only examine the function once. */
2951 if (fun->cannot_be_copied_set)
2954 /* We cannot copy a function that receives a non-local goto
2955 because we cannot remap the destination label used in the
2956 function that is performing the non-local goto. */
2957 /* ??? Actually, this should be possible, if we work at it.
2958 No doubt there's just a handful of places that simply
2959 assume it doesn't happen and don't substitute properly. */
2960 if (fun->has_nonlocal_label)
2962 reason = G_("function %q+F can never be copied "
2963 "because it receives a non-local goto");
2967 FOR_EACH_LOCAL_DECL (fun, ix, decl)
2968 if (TREE_CODE (decl) == VAR_DECL
2969 && TREE_STATIC (decl)
2970 && !DECL_EXTERNAL (decl)
2971 && DECL_INITIAL (decl)
2972 && walk_tree_without_duplicates (&DECL_INITIAL (decl),
2973 has_label_address_in_static_1,
2976 reason = G_("function %q+F can never be copied because it saves "
2977 "address of local label in a static variable");
2982 fun->cannot_be_copied_reason = reason;
2983 fun->cannot_be_copied_set = true;
2988 static const char *inline_forbidden_reason;
2990 /* A callback for walk_gimple_seq to handle statements. Returns non-null
2991 iff a function can not be inlined. Also sets the reason why. */
2994 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2995 struct walk_stmt_info *wip)
2997 tree fn = (tree) wip->info;
2999 gimple stmt = gsi_stmt (*gsi);
3001 switch (gimple_code (stmt))
3004 /* Refuse to inline alloca call unless user explicitly forced so as
3005 this may change program's memory overhead drastically when the
3006 function using alloca is called in loop. In GCC present in
3007 SPEC2000 inlining into schedule_block cause it to require 2GB of
3008 RAM instead of 256MB. */
3009 if (gimple_alloca_call_p (stmt)
3010 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
3012 inline_forbidden_reason
3013 = G_("function %q+F can never be inlined because it uses "
3014 "alloca (override using the always_inline attribute)");
3015 *handled_ops_p = true;
3019 t = gimple_call_fndecl (stmt);
3023 /* We cannot inline functions that call setjmp. */
3024 if (setjmp_call_p (t))
3026 inline_forbidden_reason
3027 = G_("function %q+F can never be inlined because it uses setjmp");
3028 *handled_ops_p = true;
3032 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
3033 switch (DECL_FUNCTION_CODE (t))
3035 /* We cannot inline functions that take a variable number of
3037 case BUILT_IN_VA_START:
3038 case BUILT_IN_NEXT_ARG:
3039 case BUILT_IN_VA_END:
3040 inline_forbidden_reason
3041 = G_("function %q+F can never be inlined because it "
3042 "uses variable argument lists");
3043 *handled_ops_p = true;
3046 case BUILT_IN_LONGJMP:
3047 /* We can't inline functions that call __builtin_longjmp at
3048 all. The non-local goto machinery really requires the
3049 destination be in a different function. If we allow the
3050 function calling __builtin_longjmp to be inlined into the
3051 function calling __builtin_setjmp, Things will Go Awry. */
3052 inline_forbidden_reason
3053 = G_("function %q+F can never be inlined because "
3054 "it uses setjmp-longjmp exception handling");
3055 *handled_ops_p = true;
3058 case BUILT_IN_NONLOCAL_GOTO:
3060 inline_forbidden_reason
3061 = G_("function %q+F can never be inlined because "
3062 "it uses non-local goto");
3063 *handled_ops_p = true;
3066 case BUILT_IN_RETURN:
3067 case BUILT_IN_APPLY_ARGS:
3068 /* If a __builtin_apply_args caller would be inlined,
3069 it would be saving arguments of the function it has
3070 been inlined into. Similarly __builtin_return would
3071 return from the function the inline has been inlined into. */
3072 inline_forbidden_reason
3073 = G_("function %q+F can never be inlined because "
3074 "it uses __builtin_return or __builtin_apply_args");
3075 *handled_ops_p = true;
3084 t = gimple_goto_dest (stmt);
3086 /* We will not inline a function which uses computed goto. The
3087 addresses of its local labels, which may be tucked into
3088 global storage, are of course not constant across
3089 instantiations, which causes unexpected behavior. */
3090 if (TREE_CODE (t) != LABEL_DECL)
3092 inline_forbidden_reason
3093 = G_("function %q+F can never be inlined "
3094 "because it contains a computed goto");
3095 *handled_ops_p = true;
3104 *handled_ops_p = false;
3108 /* Return true if FNDECL is a function that cannot be inlined into
3112 inline_forbidden_p (tree fndecl)
3114 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
3115 struct walk_stmt_info wi;
3116 struct pointer_set_t *visited_nodes;
3118 bool forbidden_p = false;
3120 /* First check for shared reasons not to copy the code. */
3121 inline_forbidden_reason = copy_forbidden (fun, fndecl);
3122 if (inline_forbidden_reason != NULL)
3125 /* Next, walk the statements of the function looking for
3126 constraucts we can't handle, or are non-optimal for inlining. */
3127 visited_nodes = pointer_set_create ();
3128 memset (&wi, 0, sizeof (wi));
3129 wi.info = (void *) fndecl;
3130 wi.pset = visited_nodes;
3132 FOR_EACH_BB_FN (bb, fun)
3135 gimple_seq seq = bb_seq (bb);
3136 ret = walk_gimple_seq (seq, inline_forbidden_p_stmt, NULL, &wi);
3137 forbidden_p = (ret != NULL);
3142 pointer_set_destroy (visited_nodes);
3146 /* Return true if CALLEE cannot be inlined into CALLER. */
3149 inline_forbidden_into_p (tree caller, tree callee)
3151 /* Don't inline if the functions have different EH personalities. */
3152 if (DECL_FUNCTION_PERSONALITY (caller)
3153 && DECL_FUNCTION_PERSONALITY (callee)
3154 && (DECL_FUNCTION_PERSONALITY (caller)
3155 != DECL_FUNCTION_PERSONALITY (callee)))
3158 /* Don't inline if the callee can throw non-call exceptions but the
3160 if (DECL_STRUCT_FUNCTION (callee)
3161 && DECL_STRUCT_FUNCTION (callee)->can_throw_non_call_exceptions
3162 && !(DECL_STRUCT_FUNCTION (caller)
3163 && DECL_STRUCT_FUNCTION (caller)->can_throw_non_call_exceptions))
3169 /* Returns nonzero if FN is a function that does not have any
3170 fundamental inline blocking properties. */
3173 tree_inlinable_function_p (tree fn)
3175 bool inlinable = true;
3179 /* If we've already decided this function shouldn't be inlined,
3180 there's no need to check again. */
3181 if (DECL_UNINLINABLE (fn))
3184 /* We only warn for functions declared `inline' by the user. */
3185 do_warning = (warn_inline
3186 && DECL_DECLARED_INLINE_P (fn)
3187 && !DECL_NO_INLINE_WARNING_P (fn)
3188 && !DECL_IN_SYSTEM_HEADER (fn));
3190 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
3193 && always_inline == NULL)
3196 warning (OPT_Winline, "function %q+F can never be inlined because it "
3197 "is suppressed using -fno-inline", fn);
3201 else if (!function_attribute_inlinable_p (fn))
3204 warning (OPT_Winline, "function %q+F can never be inlined because it "
3205 "uses attributes conflicting with inlining", fn);
3209 else if (inline_forbidden_p (fn))
3211 /* See if we should warn about uninlinable functions. Previously,
3212 some of these warnings would be issued while trying to expand
3213 the function inline, but that would cause multiple warnings
3214 about functions that would for example call alloca. But since
3215 this a property of the function, just one warning is enough.
3216 As a bonus we can now give more details about the reason why a
3217 function is not inlinable. */
3219 sorry (inline_forbidden_reason, fn);
3220 else if (do_warning)
3221 warning (OPT_Winline, inline_forbidden_reason, fn);
3226 /* Squirrel away the result so that we don't have to check again. */
3227 DECL_UNINLINABLE (fn) = !inlinable;
3232 /* Estimate the cost of a memory move. Use machine dependent
3233 word size and take possible memcpy call into account. */
3236 estimate_move_cost (tree type)
3240 gcc_assert (!VOID_TYPE_P (type));
3242 size = int_size_in_bytes (type);
3244 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size))
3245 /* Cost of a memcpy call, 3 arguments and the call. */
3248 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
3251 /* Returns cost of operation CODE, according to WEIGHTS */
3254 estimate_operator_cost (enum tree_code code, eni_weights *weights,
3255 tree op1 ATTRIBUTE_UNUSED, tree op2)
3259 /* These are "free" conversions, or their presumed cost
3260 is folded into other operations. */
3267 /* Assign cost of 1 to usual operations.
3268 ??? We may consider mapping RTL costs to this. */
3273 case POINTER_PLUS_EXPR:
3277 case ADDR_SPACE_CONVERT_EXPR:
3278 case FIXED_CONVERT_EXPR:
3279 case FIX_TRUNC_EXPR:
3291 case VEC_LSHIFT_EXPR:
3292 case VEC_RSHIFT_EXPR:
3299 case TRUTH_ANDIF_EXPR:
3300 case TRUTH_ORIF_EXPR:
3301 case TRUTH_AND_EXPR:
3303 case TRUTH_XOR_EXPR:
3304 case TRUTH_NOT_EXPR:
3313 case UNORDERED_EXPR:
3324 case PREDECREMENT_EXPR:
3325 case PREINCREMENT_EXPR:
3326 case POSTDECREMENT_EXPR:
3327 case POSTINCREMENT_EXPR:
3329 case REALIGN_LOAD_EXPR:
3331 case REDUC_MAX_EXPR:
3332 case REDUC_MIN_EXPR:
3333 case REDUC_PLUS_EXPR:
3334 case WIDEN_SUM_EXPR:
3335 case WIDEN_MULT_EXPR:
3337 case WIDEN_MULT_PLUS_EXPR:
3338 case WIDEN_MULT_MINUS_EXPR:
3340 case VEC_WIDEN_MULT_HI_EXPR:
3341 case VEC_WIDEN_MULT_LO_EXPR:
3342 case VEC_UNPACK_HI_EXPR:
3343 case VEC_UNPACK_LO_EXPR:
3344 case VEC_UNPACK_FLOAT_HI_EXPR:
3345 case VEC_UNPACK_FLOAT_LO_EXPR:
3346 case VEC_PACK_TRUNC_EXPR:
3347 case VEC_PACK_SAT_EXPR:
3348 case VEC_PACK_FIX_TRUNC_EXPR:
3349 case VEC_EXTRACT_EVEN_EXPR:
3350 case VEC_EXTRACT_ODD_EXPR:
3351 case VEC_INTERLEAVE_HIGH_EXPR:
3352 case VEC_INTERLEAVE_LOW_EXPR:
3356 /* Few special cases of expensive operations. This is useful
3357 to avoid inlining on functions having too many of these. */
3358 case TRUNC_DIV_EXPR:
3360 case FLOOR_DIV_EXPR:
3361 case ROUND_DIV_EXPR:
3362 case EXACT_DIV_EXPR:
3363 case TRUNC_MOD_EXPR:
3365 case FLOOR_MOD_EXPR:
3366 case ROUND_MOD_EXPR:
3368 if (TREE_CODE (op2) != INTEGER_CST)
3369 return weights->div_mod_cost;
3373 /* We expect a copy assignment with no operator. */
3374 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
3380 /* Estimate number of instructions that will be created by expanding
3381 the statements in the statement sequence STMTS.
3382 WEIGHTS contains weights attributed to various constructs. */
3385 int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
3388 gimple_stmt_iterator gsi;
3391 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
3392 cost += estimate_num_insns (gsi_stmt (gsi), weights);
3398 /* Estimate number of instructions that will be created by expanding STMT.
3399 WEIGHTS contains weights attributed to various constructs. */
3402 estimate_num_insns (gimple stmt, eni_weights *weights)
3405 enum gimple_code code = gimple_code (stmt);
3412 /* Try to estimate the cost of assignments. We have three cases to
3414 1) Simple assignments to registers;
3415 2) Stores to things that must live in memory. This includes
3416 "normal" stores to scalars, but also assignments of large
3417 structures, or constructors of big arrays;
3419 Let us look at the first two cases, assuming we have "a = b + C":
3420 <GIMPLE_ASSIGN <var_decl "a">
3421 <plus_expr <var_decl "b"> <constant C>>
3422 If "a" is a GIMPLE register, the assignment to it is free on almost
3423 any target, because "a" usually ends up in a real register. Hence
3424 the only cost of this expression comes from the PLUS_EXPR, and we
3425 can ignore the GIMPLE_ASSIGN.
3426 If "a" is not a GIMPLE register, the assignment to "a" will most
3427 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3428 of moving something into "a", which we compute using the function
3429 estimate_move_cost. */
3430 lhs = gimple_assign_lhs (stmt);
3431 rhs = gimple_assign_rhs1 (stmt);
3433 if (is_gimple_reg (lhs))
3436 cost = estimate_move_cost (TREE_TYPE (lhs));
3438 if (!is_gimple_reg (rhs) && !is_gimple_min_invariant (rhs))
3439 cost += estimate_move_cost (TREE_TYPE (rhs));
3441 cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights,
3442 gimple_assign_rhs1 (stmt),
3443 get_gimple_rhs_class (gimple_assign_rhs_code (stmt))
3444 == GIMPLE_BINARY_RHS
3445 ? gimple_assign_rhs2 (stmt) : NULL);
3449 cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights,
3450 gimple_op (stmt, 0),
3451 gimple_op (stmt, 1));
3455 /* Take into account cost of the switch + guess 2 conditional jumps for
3458 TODO: once the switch expansion logic is sufficiently separated, we can
3459 do better job on estimating cost of the switch. */
3460 if (weights->time_based)
3461 cost = floor_log2 (gimple_switch_num_labels (stmt)) * 2;
3463 cost = gimple_switch_num_labels (stmt) * 2;
3468 tree decl = gimple_call_fndecl (stmt);
3469 tree addr = gimple_call_fn (stmt);
3470 tree funtype = TREE_TYPE (addr);
3471 bool stdarg = false;
3473 if (POINTER_TYPE_P (funtype))
3474 funtype = TREE_TYPE (funtype);
3476 if (is_simple_builtin (decl))
3478 else if (is_inexpensive_builtin (decl))
3479 cost = weights->target_builtin_call_cost;
3481 cost = weights->call_cost;
3484 funtype = TREE_TYPE (decl);
3486 if (!VOID_TYPE_P (TREE_TYPE (funtype)))
3487 cost += estimate_move_cost (TREE_TYPE (funtype));
3490 stdarg = stdarg_p (funtype);
3492 /* Our cost must be kept in sync with
3493 cgraph_estimate_size_after_inlining that does use function
3494 declaration to figure out the arguments.
3496 For functions taking variable list of arguments we must
3497 look into call statement intself. This is safe because
3498 we will get only higher costs and in most cases we will
3499 not inline these anyway. */
3500 if (decl && DECL_ARGUMENTS (decl) && !stdarg)
3503 for (arg = DECL_ARGUMENTS (decl); arg; arg = DECL_CHAIN (arg))
3504 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3505 cost += estimate_move_cost (TREE_TYPE (arg));
3507 else if (funtype && prototype_p (funtype) && !stdarg)
3510 for (t = TYPE_ARG_TYPES (funtype); t && t != void_list_node;
3512 if (!VOID_TYPE_P (TREE_VALUE (t)))
3513 cost += estimate_move_cost (TREE_VALUE (t));
3517 for (i = 0; i < gimple_call_num_args (stmt); i++)
3519 tree arg = gimple_call_arg (stmt, i);
3520 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3521 cost += estimate_move_cost (TREE_TYPE (arg));
3533 case GIMPLE_PREDICT:
3538 return asm_str_count (gimple_asm_string (stmt));
3541 /* This is either going to be an external function call with one
3542 argument, or two register copy statements plus a goto. */
3545 case GIMPLE_EH_DISPATCH:
3546 /* ??? This is going to turn into a switch statement. Ideally
3547 we'd have a look at the eh region and estimate the number of
3552 return estimate_num_insns_seq (gimple_bind_body (stmt), weights);
3554 case GIMPLE_EH_FILTER:
3555 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
3558 return estimate_num_insns_seq (gimple_catch_handler (stmt), weights);
3561 return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
3562 + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
3564 /* OpenMP directives are generally very expensive. */
3566 case GIMPLE_OMP_RETURN:
3567 case GIMPLE_OMP_SECTIONS_SWITCH:
3568 case GIMPLE_OMP_ATOMIC_STORE:
3569 case GIMPLE_OMP_CONTINUE:
3570 /* ...except these, which are cheap. */
3573 case GIMPLE_OMP_ATOMIC_LOAD:
3574 return weights->omp_cost;
3576 case GIMPLE_OMP_FOR:
3577 return (weights->omp_cost
3578 + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
3579 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
3581 case GIMPLE_OMP_PARALLEL:
3582 case GIMPLE_OMP_TASK:
3583 case GIMPLE_OMP_CRITICAL:
3584 case GIMPLE_OMP_MASTER:
3585 case GIMPLE_OMP_ORDERED:
3586 case GIMPLE_OMP_SECTION:
3587 case GIMPLE_OMP_SECTIONS:
3588 case GIMPLE_OMP_SINGLE:
3589 return (weights->omp_cost
3590 + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
3599 /* Estimate number of instructions that will be created by expanding
3600 function FNDECL. WEIGHTS contains weights attributed to various
3604 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
3606 struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
3607 gimple_stmt_iterator bsi;
3611 gcc_assert (my_function && my_function->cfg);
3612 FOR_EACH_BB_FN (bb, my_function)
3614 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
3615 n += estimate_num_insns (gsi_stmt (bsi), weights);
3622 /* Initializes weights used by estimate_num_insns. */
3625 init_inline_once (void)
3627 eni_size_weights.call_cost = 1;
3628 eni_size_weights.target_builtin_call_cost = 1;
3629 eni_size_weights.div_mod_cost = 1;
3630 eni_size_weights.omp_cost = 40;
3631 eni_size_weights.time_based = false;
3633 /* Estimating time for call is difficult, since we have no idea what the
3634 called function does. In the current uses of eni_time_weights,
3635 underestimating the cost does less harm than overestimating it, so
3636 we choose a rather small value here. */
3637 eni_time_weights.call_cost = 10;
3638 eni_time_weights.target_builtin_call_cost = 10;
3639 eni_time_weights.div_mod_cost = 10;
3640 eni_time_weights.omp_cost = 40;
3641 eni_time_weights.time_based = true;
3644 /* Estimate the number of instructions in a gimple_seq. */
3647 count_insns_seq (gimple_seq seq, eni_weights *weights)
3649 gimple_stmt_iterator gsi;
3651 for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
3652 n += estimate_num_insns (gsi_stmt (gsi), weights);
3658 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3661 prepend_lexical_block (tree current_block, tree new_block)
3663 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
3664 BLOCK_SUBBLOCKS (current_block) = new_block;
3665 BLOCK_SUPERCONTEXT (new_block) = current_block;
3668 /* Add local variables from CALLEE to CALLER. */
3671 add_local_variables (struct function *callee, struct function *caller,
3672 copy_body_data *id, bool check_var_ann)
3677 FOR_EACH_LOCAL_DECL (callee, ix, var)
3678 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3681 || (var_ann (var) && add_referenced_var (var)))
3682 add_local_decl (caller, var);
3684 else if (!can_be_nonlocal (var, id))
3686 tree new_var = remap_decl (var, id);
3688 /* Remap debug-expressions. */
3689 if (TREE_CODE (new_var) == VAR_DECL
3690 && DECL_DEBUG_EXPR_IS_FROM (new_var)
3693 tree tem = DECL_DEBUG_EXPR (var);
3694 bool old_regimplify = id->regimplify;
3695 id->remapping_type_depth++;
3696 walk_tree (&tem, copy_tree_body_r, id, NULL);
3697 id->remapping_type_depth--;
3698 id->regimplify = old_regimplify;
3699 SET_DECL_DEBUG_EXPR (new_var, tem);
3701 add_local_decl (caller, new_var);
3705 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3708 expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id)
3712 struct pointer_map_t *st, *dst;
3715 location_t saved_location;
3716 struct cgraph_edge *cg_edge;
3717 cgraph_inline_failed_t reason;
3718 basic_block return_block;
3720 gimple_stmt_iterator gsi, stmt_gsi;
3721 bool successfully_inlined = FALSE;
3722 bool purge_dead_abnormal_edges;
3724 /* Set input_location here so we get the right instantiation context
3725 if we call instantiate_decl from inlinable_function_p. */
3726 saved_location = input_location;
3727 if (gimple_has_location (stmt))
3728 input_location = gimple_location (stmt);
3730 /* From here on, we're only interested in CALL_EXPRs. */
3731 if (gimple_code (stmt) != GIMPLE_CALL)
3734 /* First, see if we can figure out what function is being called.
3735 If we cannot, then there is no hope of inlining the function. */
3736 fn = gimple_call_fndecl (stmt);
3740 /* Turn forward declarations into real ones. */
3741 fn = cgraph_node (fn)->decl;
3743 /* If FN is a declaration of a function in a nested scope that was
3744 globally declared inline, we don't set its DECL_INITIAL.
3745 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3746 C++ front-end uses it for cdtors to refer to their internal
3747 declarations, that are not real functions. Fortunately those
3748 don't have trees to be saved, so we can tell by checking their
3750 if (!DECL_INITIAL (fn)
3751 && DECL_ABSTRACT_ORIGIN (fn)
3752 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
3753 fn = DECL_ABSTRACT_ORIGIN (fn);
3755 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3756 Kill this check once this is fixed. */
3757 if (!id->dst_node->analyzed)
3760 cg_edge = cgraph_edge (id->dst_node, stmt);
3762 /* First check that inlining isn't simply forbidden in this case. */
3763 if (inline_forbidden_into_p (cg_edge->caller->decl, cg_edge->callee->decl))
3766 /* Don't try to inline functions that are not well-suited to inlining. */
3767 if (!cgraph_inline_p (cg_edge, &reason))
3769 /* If this call was originally indirect, we do not want to emit any
3770 inlining related warnings or sorry messages because there are no
3771 guarantees regarding those. */
3772 if (cg_edge->indirect_inlining_edge)
3775 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
3776 /* Avoid warnings during early inline pass. */
3777 && cgraph_global_info_ready)
3779 sorry ("inlining failed in call to %q+F: %s", fn,
3780 _(cgraph_inline_failed_string (reason)));
3781 sorry ("called from here");
3783 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
3784 && !DECL_IN_SYSTEM_HEADER (fn)
3785 && reason != CIF_UNSPECIFIED
3786 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
3787 /* Avoid warnings during early inline pass. */
3788 && cgraph_global_info_ready)
3790 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
3791 fn, _(cgraph_inline_failed_string (reason)));
3792 warning (OPT_Winline, "called from here");
3796 fn = cg_edge->callee->decl;
3798 #ifdef ENABLE_CHECKING
3799 if (cg_edge->callee->decl != id->dst_node->decl)
3800 verify_cgraph_node (cg_edge->callee);
3803 /* We will be inlining this callee. */
3804 id->eh_lp_nr = lookup_stmt_eh_lp (stmt);
3806 /* Update the callers EH personality. */
3807 if (DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl))
3808 DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3809 = DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl);
3811 /* Split the block holding the GIMPLE_CALL. */
3812 e = split_block (bb, stmt);
3814 return_block = e->dest;
3817 /* split_block splits after the statement; work around this by
3818 moving the call into the second block manually. Not pretty,
3819 but seems easier than doing the CFG manipulation by hand
3820 when the GIMPLE_CALL is in the last statement of BB. */
3821 stmt_gsi = gsi_last_bb (bb);
3822 gsi_remove (&stmt_gsi, false);
3824 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3825 been the source of abnormal edges. In this case, schedule
3826 the removal of dead abnormal edges. */
3827 gsi = gsi_start_bb (return_block);
3828 if (gsi_end_p (gsi))
3830 gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
3831 purge_dead_abnormal_edges = true;
3835 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
3836 purge_dead_abnormal_edges = false;
3839 stmt_gsi = gsi_start_bb (return_block);
3841 /* Build a block containing code to initialize the arguments, the
3842 actual inline expansion of the body, and a label for the return
3843 statements within the function to jump to. The type of the
3844 statement expression is the return type of the function call. */
3845 id->block = make_node (BLOCK);
3846 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
3847 BLOCK_SOURCE_LOCATION (id->block) = input_location;
3848 prepend_lexical_block (gimple_block (stmt), id->block);
3850 /* Local declarations will be replaced by their equivalents in this
3853 id->decl_map = pointer_map_create ();
3854 dst = id->debug_map;
3855 id->debug_map = NULL;
3857 /* Record the function we are about to inline. */
3859 id->src_node = cg_edge->callee;
3860 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
3861 id->gimple_call = stmt;
3863 gcc_assert (!id->src_cfun->after_inlining);
3866 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
3868 gimple_stmt_iterator si = gsi_last_bb (bb);
3869 gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
3873 initialize_inlined_parameters (id, stmt, fn, bb);
3875 if (DECL_INITIAL (fn))
3876 prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
3878 /* Return statements in the function body will be replaced by jumps
3879 to the RET_LABEL. */
3880 gcc_assert (DECL_INITIAL (fn));
3881 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
3883 /* Find the LHS to which the result of this call is assigned. */
3885 if (gimple_call_lhs (stmt))
3887 modify_dest = gimple_call_lhs (stmt);
3889 /* The function which we are inlining might not return a value,
3890 in which case we should issue a warning that the function
3891 does not return a value. In that case the optimizers will
3892 see that the variable to which the value is assigned was not
3893 initialized. We do not want to issue a warning about that
3894 uninitialized variable. */
3895 if (DECL_P (modify_dest))
3896 TREE_NO_WARNING (modify_dest) = 1;
3898 if (gimple_call_return_slot_opt_p (stmt))
3900 return_slot = modify_dest;
3907 /* If we are inlining a call to the C++ operator new, we don't want
3908 to use type based alias analysis on the return value. Otherwise
3909 we may get confused if the compiler sees that the inlined new
3910 function returns a pointer which was just deleted. See bug
3912 if (DECL_IS_OPERATOR_NEW (fn))
3918 /* Declare the return variable for the function. */
3919 use_retvar = declare_return_variable (id, return_slot, modify_dest, bb);
3921 /* Add local vars in this inlined callee to caller. */
3922 add_local_variables (id->src_cfun, cfun, id, true);
3924 if (dump_file && (dump_flags & TDF_DETAILS))
3926 fprintf (dump_file, "Inlining ");
3927 print_generic_expr (dump_file, id->src_fn, 0);
3928 fprintf (dump_file, " to ");
3929 print_generic_expr (dump_file, id->dst_fn, 0);
3930 fprintf (dump_file, " with frequency %i\n", cg_edge->frequency);
3933 /* This is it. Duplicate the callee body. Assume callee is
3934 pre-gimplified. Note that we must not alter the caller
3935 function in any way before this point, as this CALL_EXPR may be
3936 a self-referential call; if we're calling ourselves, we need to
3937 duplicate our body before altering anything. */
3938 copy_body (id, bb->count,
3939 cg_edge->frequency * REG_BR_PROB_BASE / CGRAPH_FREQ_BASE,
3940 bb, return_block, NULL, NULL);
3942 /* Reset the escaped solution. */
3943 if (cfun->gimple_df)
3944 pt_solution_reset (&cfun->gimple_df->escaped);
3949 pointer_map_destroy (id->debug_map);
3950 id->debug_map = dst;
3952 pointer_map_destroy (id->decl_map);
3955 /* Unlink the calls virtual operands before replacing it. */
3956 unlink_stmt_vdef (stmt);
3958 /* If the inlined function returns a result that we care about,
3959 substitute the GIMPLE_CALL with an assignment of the return
3960 variable to the LHS of the call. That is, if STMT was
3961 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3962 if (use_retvar && gimple_call_lhs (stmt))
3964 gimple old_stmt = stmt;
3965 stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
3966 gsi_replace (&stmt_gsi, stmt, false);
3967 if (gimple_in_ssa_p (cfun))
3968 mark_symbols_for_renaming (stmt);
3969 maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
3973 /* Handle the case of inlining a function with no return
3974 statement, which causes the return value to become undefined. */
3975 if (gimple_call_lhs (stmt)
3976 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
3978 tree name = gimple_call_lhs (stmt);
3979 tree var = SSA_NAME_VAR (name);
3980 tree def = gimple_default_def (cfun, var);
3984 /* If the variable is used undefined, make this name
3985 undefined via a move. */
3986 stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
3987 gsi_replace (&stmt_gsi, stmt, true);
3991 /* Otherwise make this variable undefined. */
3992 gsi_remove (&stmt_gsi, true);
3993 set_default_def (var, name);
3994 SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
3998 gsi_remove (&stmt_gsi, true);
4001 if (purge_dead_abnormal_edges)
4002 gimple_purge_dead_abnormal_call_edges (return_block);
4004 /* If the value of the new expression is ignored, that's OK. We
4005 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4006 the equivalent inlined version either. */
4007 if (is_gimple_assign (stmt))
4009 gcc_assert (gimple_assign_single_p (stmt)
4010 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
4011 TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
4014 /* Output the inlining info for this abstract function, since it has been
4015 inlined. If we don't do this now, we can lose the information about the
4016 variables in the function when the blocks get blown away as soon as we
4017 remove the cgraph node. */
4018 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
4020 /* Update callgraph if needed. */
4021 cgraph_remove_node (cg_edge->callee);
4023 id->block = NULL_TREE;
4024 successfully_inlined = TRUE;
4027 input_location = saved_location;
4028 return successfully_inlined;
4031 /* Expand call statements reachable from STMT_P.
4032 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4033 in a MODIFY_EXPR. See gimple.c:get_call_expr_in(). We can
4034 unfortunately not use that function here because we need a pointer
4035 to the CALL_EXPR, not the tree itself. */
4038 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
4040 gimple_stmt_iterator gsi;
4042 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4044 gimple stmt = gsi_stmt (gsi);
4046 if (is_gimple_call (stmt)
4047 && expand_call_inline (bb, stmt, id))
4055 /* Walk all basic blocks created after FIRST and try to fold every statement
4056 in the STATEMENTS pointer set. */
4059 fold_marked_statements (int first, struct pointer_set_t *statements)
4061 for (; first < n_basic_blocks; first++)
4062 if (BASIC_BLOCK (first))
4064 gimple_stmt_iterator gsi;
4066 for (gsi = gsi_start_bb (BASIC_BLOCK (first));
4069 if (pointer_set_contains (statements, gsi_stmt (gsi)))
4071 gimple old_stmt = gsi_stmt (gsi);
4072 tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0;
4074 if (old_decl && DECL_BUILT_IN (old_decl))
4076 /* Folding builtins can create multiple instructions,
4077 we need to look at all of them. */
4078 gimple_stmt_iterator i2 = gsi;
4080 if (fold_stmt (&gsi))
4084 i2 = gsi_start_bb (BASIC_BLOCK (first));
4089 new_stmt = gsi_stmt (i2);
4090 update_stmt (new_stmt);
4091 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
4094 if (new_stmt == gsi_stmt (gsi))
4096 /* It is okay to check only for the very last
4097 of these statements. If it is a throwing
4098 statement nothing will change. If it isn't
4099 this can remove EH edges. If that weren't
4100 correct then because some intermediate stmts
4101 throw, but not the last one. That would mean
4102 we'd have to split the block, which we can't
4103 here and we'd loose anyway. And as builtins
4104 probably never throw, this all
4106 if (maybe_clean_or_replace_eh_stmt (old_stmt,
4108 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
4115 else if (fold_stmt (&gsi))
4117 /* Re-read the statement from GSI as fold_stmt() may
4119 gimple new_stmt = gsi_stmt (gsi);
4120 update_stmt (new_stmt);
4122 if (is_gimple_call (old_stmt)
4123 || is_gimple_call (new_stmt))
4124 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
4127 if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
4128 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
4134 /* Return true if BB has at least one abnormal outgoing edge. */
4137 has_abnormal_outgoing_edge_p (basic_block bb)
4142 FOR_EACH_EDGE (e, ei, bb->succs)
4143 if (e->flags & EDGE_ABNORMAL)
4149 /* Expand calls to inline functions in the body of FN. */
4152 optimize_inline_calls (tree fn)
4156 int last = n_basic_blocks;
4157 struct gimplify_ctx gctx;
4159 /* There is no point in performing inlining if errors have already
4160 occurred -- and we might crash if we try to inline invalid
4166 memset (&id, 0, sizeof (id));
4168 id.src_node = id.dst_node = cgraph_node (fn);
4170 /* Or any functions that aren't finished yet. */
4171 if (current_function_decl)
4172 id.dst_fn = current_function_decl;
4174 id.copy_decl = copy_decl_maybe_to_var;
4175 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4176 id.transform_new_cfg = false;
4177 id.transform_return_to_modify = true;
4178 id.transform_lang_insert_block = NULL;
4179 id.statements_to_fold = pointer_set_create ();
4181 push_gimplify_context (&gctx);
4183 /* We make no attempts to keep dominance info up-to-date. */
4184 free_dominance_info (CDI_DOMINATORS);
4185 free_dominance_info (CDI_POST_DOMINATORS);
4187 /* Register specific gimple functions. */
4188 gimple_register_cfg_hooks ();
4190 /* Reach the trees by walking over the CFG, and note the
4191 enclosing basic-blocks in the call edges. */
4192 /* We walk the blocks going forward, because inlined function bodies
4193 will split id->current_basic_block, and the new blocks will
4194 follow it; we'll trudge through them, processing their CALL_EXPRs
4197 gimple_expand_calls_inline (bb, &id);
4199 pop_gimplify_context (NULL);
4201 #ifdef ENABLE_CHECKING
4203 struct cgraph_edge *e;
4205 verify_cgraph_node (id.dst_node);
4207 /* Double check that we inlined everything we are supposed to inline. */
4208 for (e = id.dst_node->callees; e; e = e->next_callee)
4209 gcc_assert (e->inline_failed);
4213 /* Fold the statements before compacting/renumbering the basic blocks. */
4214 fold_marked_statements (last, id.statements_to_fold);
4215 pointer_set_destroy (id.statements_to_fold);
4217 gcc_assert (!id.debug_stmts);
4219 /* Renumber the (code) basic_blocks consecutively. */
4221 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4224 fold_cond_expr_cond ();
4225 delete_unreachable_blocks_update_callgraph (&id);
4226 #ifdef ENABLE_CHECKING
4227 verify_cgraph_node (id.dst_node);
4230 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4231 not possible yet - the IPA passes might make various functions to not
4232 throw and they don't care to proactively update local EH info. This is
4233 done later in fixup_cfg pass that also execute the verification. */
4234 return (TODO_update_ssa
4236 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
4237 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
4240 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4243 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
4245 enum tree_code code = TREE_CODE (*tp);
4246 enum tree_code_class cl = TREE_CODE_CLASS (code);
4248 /* We make copies of most nodes. */
4249 if (IS_EXPR_CODE_CLASS (cl)
4250 || code == TREE_LIST
4252 || code == TYPE_DECL
4253 || code == OMP_CLAUSE)
4255 /* Because the chain gets clobbered when we make a copy, we save it
4257 tree chain = NULL_TREE, new_tree;
4259 chain = TREE_CHAIN (*tp);
4261 /* Copy the node. */
4262 new_tree = copy_node (*tp);
4264 /* Propagate mudflap marked-ness. */
4265 if (flag_mudflap && mf_marked_p (*tp))
4270 /* Now, restore the chain, if appropriate. That will cause
4271 walk_tree to walk into the chain as well. */
4272 if (code == PARM_DECL
4273 || code == TREE_LIST
4274 || code == OMP_CLAUSE)
4275 TREE_CHAIN (*tp) = chain;
4277 /* For now, we don't update BLOCKs when we make copies. So, we
4278 have to nullify all BIND_EXPRs. */
4279 if (TREE_CODE (*tp) == BIND_EXPR)
4280 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
4282 else if (code == CONSTRUCTOR)
4284 /* CONSTRUCTOR nodes need special handling because
4285 we need to duplicate the vector of elements. */
4288 new_tree = copy_node (*tp);
4290 /* Propagate mudflap marked-ness. */
4291 if (flag_mudflap && mf_marked_p (*tp))
4294 CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc,
4295 CONSTRUCTOR_ELTS (*tp));
4298 else if (TREE_CODE_CLASS (code) == tcc_type)
4300 else if (TREE_CODE_CLASS (code) == tcc_declaration)
4302 else if (TREE_CODE_CLASS (code) == tcc_constant)
4305 gcc_assert (code != STATEMENT_LIST);
4309 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4310 information indicating to what new SAVE_EXPR this one should be mapped,
4311 use that one. Otherwise, create a new node and enter it in ST. FN is
4312 the function into which the copy will be placed. */
4315 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
4317 struct pointer_map_t *st = (struct pointer_map_t *) st_;
4321 /* See if we already encountered this SAVE_EXPR. */
4322 n = (tree *) pointer_map_contains (st, *tp);
4324 /* If we didn't already remap this SAVE_EXPR, do so now. */
4327 t = copy_node (*tp);
4329 /* Remember this SAVE_EXPR. */
4330 *pointer_map_insert (st, *tp) = t;
4331 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4332 *pointer_map_insert (st, t) = t;
4336 /* We've already walked into this SAVE_EXPR; don't do it again. */
4341 /* Replace this SAVE_EXPR with the copy. */
4345 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4346 copies the declaration and enters it in the splay_tree in DATA (which is
4347 really an `copy_body_data *'). */
4350 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
4353 copy_body_data *id = (copy_body_data *) data;
4355 /* Don't walk into types. */
4359 else if (TREE_CODE (*tp) == LABEL_EXPR)
4361 tree decl = TREE_OPERAND (*tp, 0);
4363 /* Copy the decl and remember the copy. */
4364 insert_decl_map (id, decl, id->copy_decl (decl, id));
4370 /* Perform any modifications to EXPR required when it is unsaved. Does
4371 not recurse into EXPR's subtrees. */
4374 unsave_expr_1 (tree expr)
4376 switch (TREE_CODE (expr))
4379 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4380 It's OK for this to happen if it was part of a subtree that
4381 isn't immediately expanded, such as operand 2 of another
4383 if (TREE_OPERAND (expr, 1))
4386 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4387 TREE_OPERAND (expr, 3) = NULL_TREE;
4395 /* Called via walk_tree when an expression is unsaved. Using the
4396 splay_tree pointed to by ST (which is really a `splay_tree'),
4397 remaps all local declarations to appropriate replacements. */
4400 unsave_r (tree *tp, int *walk_subtrees, void *data)
4402 copy_body_data *id = (copy_body_data *) data;
4403 struct pointer_map_t *st = id->decl_map;
4406 /* Only a local declaration (variable or label). */
4407 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
4408 || TREE_CODE (*tp) == LABEL_DECL)
4410 /* Lookup the declaration. */
4411 n = (tree *) pointer_map_contains (st, *tp);
4413 /* If it's there, remap it. */
4418 else if (TREE_CODE (*tp) == STATEMENT_LIST)
4420 else if (TREE_CODE (*tp) == BIND_EXPR)
4421 copy_bind_expr (tp, walk_subtrees, id);
4422 else if (TREE_CODE (*tp) == SAVE_EXPR
4423 || TREE_CODE (*tp) == TARGET_EXPR)
4424 remap_save_expr (tp, st, walk_subtrees);
4427 copy_tree_r (tp, walk_subtrees, NULL);
4429 /* Do whatever unsaving is required. */
4430 unsave_expr_1 (*tp);
4433 /* Keep iterating. */
4437 /* Copies everything in EXPR and replaces variables, labels
4438 and SAVE_EXPRs local to EXPR. */
4441 unsave_expr_now (tree expr)
4445 /* There's nothing to do for NULL_TREE. */
4450 memset (&id, 0, sizeof (id));
4451 id.src_fn = current_function_decl;
4452 id.dst_fn = current_function_decl;
4453 id.decl_map = pointer_map_create ();
4454 id.debug_map = NULL;
4456 id.copy_decl = copy_decl_no_change;
4457 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4458 id.transform_new_cfg = false;
4459 id.transform_return_to_modify = false;
4460 id.transform_lang_insert_block = NULL;
4462 /* Walk the tree once to find local labels. */
4463 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
4465 /* Walk the tree again, copying, remapping, and unsaving. */
4466 walk_tree (&expr, unsave_r, &id, NULL);
4469 pointer_map_destroy (id.decl_map);
4471 pointer_map_destroy (id.debug_map);
4476 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4477 label, copies the declaration and enters it in the splay_tree in DATA (which
4478 is really a 'copy_body_data *'. */
4481 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
4482 bool *handled_ops_p ATTRIBUTE_UNUSED,
4483 struct walk_stmt_info *wi)
4485 copy_body_data *id = (copy_body_data *) wi->info;
4486 gimple stmt = gsi_stmt (*gsip);
4488 if (gimple_code (stmt) == GIMPLE_LABEL)
4490 tree decl = gimple_label_label (stmt);
4492 /* Copy the decl and remember the copy. */
4493 insert_decl_map (id, decl, id->copy_decl (decl, id));
4500 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4501 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4502 remaps all local declarations to appropriate replacements in gimple
4506 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
4508 struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
4509 copy_body_data *id = (copy_body_data *) wi->info;
4510 struct pointer_map_t *st = id->decl_map;
4514 /* Only a local declaration (variable or label). */
4515 if ((TREE_CODE (expr) == VAR_DECL
4516 && !TREE_STATIC (expr))
4517 || TREE_CODE (expr) == LABEL_DECL)
4519 /* Lookup the declaration. */
4520 n = (tree *) pointer_map_contains (st, expr);
4522 /* If it's there, remap it. */
4527 else if (TREE_CODE (expr) == STATEMENT_LIST
4528 || TREE_CODE (expr) == BIND_EXPR
4529 || TREE_CODE (expr) == SAVE_EXPR)
4531 else if (TREE_CODE (expr) == TARGET_EXPR)
4533 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4534 It's OK for this to happen if it was part of a subtree that
4535 isn't immediately expanded, such as operand 2 of another
4537 if (!TREE_OPERAND (expr, 1))
4539 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4540 TREE_OPERAND (expr, 3) = NULL_TREE;
4544 /* Keep iterating. */
4549 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4550 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4551 remaps all local declarations to appropriate replacements in gimple
4555 replace_locals_stmt (gimple_stmt_iterator *gsip,
4556 bool *handled_ops_p ATTRIBUTE_UNUSED,
4557 struct walk_stmt_info *wi)
4559 copy_body_data *id = (copy_body_data *) wi->info;
4560 gimple stmt = gsi_stmt (*gsip);
4562 if (gimple_code (stmt) == GIMPLE_BIND)
4564 tree block = gimple_bind_block (stmt);
4568 remap_block (&block, id);
4569 gimple_bind_set_block (stmt, block);
4572 /* This will remap a lot of the same decls again, but this should be
4574 if (gimple_bind_vars (stmt))
4575 gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id));
4578 /* Keep iterating. */
4583 /* Copies everything in SEQ and replaces variables and labels local to
4584 current_function_decl. */
4587 copy_gimple_seq_and_replace_locals (gimple_seq seq)
4590 struct walk_stmt_info wi;
4591 struct pointer_set_t *visited;
4594 /* There's nothing to do for NULL_TREE. */
4599 memset (&id, 0, sizeof (id));
4600 id.src_fn = current_function_decl;
4601 id.dst_fn = current_function_decl;
4602 id.decl_map = pointer_map_create ();
4603 id.debug_map = NULL;
4605 id.copy_decl = copy_decl_no_change;
4606 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4607 id.transform_new_cfg = false;
4608 id.transform_return_to_modify = false;
4609 id.transform_lang_insert_block = NULL;
4611 /* Walk the tree once to find local labels. */
4612 memset (&wi, 0, sizeof (wi));
4613 visited = pointer_set_create ();
4616 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
4617 pointer_set_destroy (visited);
4619 copy = gimple_seq_copy (seq);
4621 /* Walk the copy, remapping decls. */
4622 memset (&wi, 0, sizeof (wi));
4624 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
4627 pointer_map_destroy (id.decl_map);
4629 pointer_map_destroy (id.debug_map);
4635 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4638 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
4647 debug_find_tree (tree top, tree search)
4649 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
4653 /* Declare the variables created by the inliner. Add all the variables in
4654 VARS to BIND_EXPR. */
4657 declare_inline_vars (tree block, tree vars)
4660 for (t = vars; t; t = DECL_CHAIN (t))
4662 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
4663 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
4664 add_local_decl (cfun, t);
4668 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
4671 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4672 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4673 VAR_DECL translation. */
4676 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
4678 /* Don't generate debug information for the copy if we wouldn't have
4679 generated it for the copy either. */
4680 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
4681 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
4683 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4684 declaration inspired this copy. */
4685 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
4687 /* The new variable/label has no RTL, yet. */
4688 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
4689 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
4690 SET_DECL_RTL (copy, 0);
4692 /* These args would always appear unused, if not for this. */
4693 TREE_USED (copy) = 1;
4695 /* Set the context for the new declaration. */
4696 if (!DECL_CONTEXT (decl))
4697 /* Globals stay global. */
4699 else if (DECL_CONTEXT (decl) != id->src_fn)
4700 /* Things that weren't in the scope of the function we're inlining
4701 from aren't in the scope we're inlining to, either. */
4703 else if (TREE_STATIC (decl))
4704 /* Function-scoped static variables should stay in the original
4708 /* Ordinary automatic local variables are now in the scope of the
4710 DECL_CONTEXT (copy) = id->dst_fn;
4716 copy_decl_to_var (tree decl, copy_body_data *id)
4720 gcc_assert (TREE_CODE (decl) == PARM_DECL
4721 || TREE_CODE (decl) == RESULT_DECL);
4723 type = TREE_TYPE (decl);
4725 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4726 VAR_DECL, DECL_NAME (decl), type);
4727 if (DECL_PT_UID_SET_P (decl))
4728 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
4729 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4730 TREE_READONLY (copy) = TREE_READONLY (decl);
4731 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4732 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4734 return copy_decl_for_dup_finish (id, decl, copy);
4737 /* Like copy_decl_to_var, but create a return slot object instead of a
4738 pointer variable for return by invisible reference. */
4741 copy_result_decl_to_var (tree decl, copy_body_data *id)
4745 gcc_assert (TREE_CODE (decl) == PARM_DECL
4746 || TREE_CODE (decl) == RESULT_DECL);
4748 type = TREE_TYPE (decl);
4749 if (DECL_BY_REFERENCE (decl))
4750 type = TREE_TYPE (type);
4752 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4753 VAR_DECL, DECL_NAME (decl), type);
4754 if (DECL_PT_UID_SET_P (decl))
4755 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
4756 TREE_READONLY (copy) = TREE_READONLY (decl);
4757 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4758 if (!DECL_BY_REFERENCE (decl))
4760 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4761 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4764 return copy_decl_for_dup_finish (id, decl, copy);
4768 copy_decl_no_change (tree decl, copy_body_data *id)
4772 copy = copy_node (decl);
4774 /* The COPY is not abstract; it will be generated in DST_FN. */
4775 DECL_ABSTRACT (copy) = 0;
4776 lang_hooks.dup_lang_specific_decl (copy);
4778 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4779 been taken; it's for internal bookkeeping in expand_goto_internal. */
4780 if (TREE_CODE (copy) == LABEL_DECL)
4782 TREE_ADDRESSABLE (copy) = 0;
4783 LABEL_DECL_UID (copy) = -1;
4786 return copy_decl_for_dup_finish (id, decl, copy);
4790 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
4792 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
4793 return copy_decl_to_var (decl, id);
4795 return copy_decl_no_change (decl, id);
4798 /* Return a copy of the function's argument tree. */
4800 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
4801 bitmap args_to_skip, tree *vars)
4804 tree new_parm = NULL;
4809 for (arg = orig_parm; arg; arg = DECL_CHAIN (arg), i++)
4810 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
4812 tree new_tree = remap_decl (arg, id);
4813 lang_hooks.dup_lang_specific_decl (new_tree);
4815 parg = &DECL_CHAIN (new_tree);
4817 else if (!pointer_map_contains (id->decl_map, arg))
4819 /* Make an equivalent VAR_DECL. If the argument was used
4820 as temporary variable later in function, the uses will be
4821 replaced by local variable. */
4822 tree var = copy_decl_to_var (arg, id);
4824 add_referenced_var (var);
4825 insert_decl_map (id, arg, var);
4826 /* Declare this new variable. */
4827 DECL_CHAIN (var) = *vars;
4833 /* Return a copy of the function's static chain. */
4835 copy_static_chain (tree static_chain, copy_body_data * id)
4837 tree *chain_copy, *pvar;
4839 chain_copy = &static_chain;
4840 for (pvar = chain_copy; *pvar; pvar = &DECL_CHAIN (*pvar))
4842 tree new_tree = remap_decl (*pvar, id);
4843 lang_hooks.dup_lang_specific_decl (new_tree);
4844 DECL_CHAIN (new_tree) = DECL_CHAIN (*pvar);
4847 return static_chain;
4850 /* Return true if the function is allowed to be versioned.
4851 This is a guard for the versioning functionality. */
4854 tree_versionable_function_p (tree fndecl)
4856 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl))
4857 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl), fndecl) == NULL);
4860 /* Delete all unreachable basic blocks and update callgraph.
4861 Doing so is somewhat nontrivial because we need to update all clones and
4862 remove inline function that become unreachable. */
4865 delete_unreachable_blocks_update_callgraph (copy_body_data *id)
4867 bool changed = false;
4868 basic_block b, next_bb;
4870 find_unreachable_blocks ();
4872 /* Delete all unreachable basic blocks. */
4874 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR; b = next_bb)
4876 next_bb = b->next_bb;
4878 if (!(b->flags & BB_REACHABLE))
4880 gimple_stmt_iterator bsi;
4882 for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi))
4883 if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL)
4885 struct cgraph_edge *e;
4886 struct cgraph_node *node;
4888 if ((e = cgraph_edge (id->dst_node, gsi_stmt (bsi))) != NULL)
4890 if (!e->inline_failed)
4891 cgraph_remove_node_and_inline_clones (e->callee);
4893 cgraph_remove_edge (e);
4895 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4896 && id->dst_node->clones)
4897 for (node = id->dst_node->clones; node != id->dst_node;)
4899 if ((e = cgraph_edge (node, gsi_stmt (bsi))) != NULL)
4901 if (!e->inline_failed)
4902 cgraph_remove_node_and_inline_clones (e->callee);
4904 cgraph_remove_edge (e);
4908 node = node->clones;
4909 else if (node->next_sibling_clone)
4910 node = node->next_sibling_clone;
4913 while (node != id->dst_node && !node->next_sibling_clone)
4914 node = node->clone_of;
4915 if (node != id->dst_node)
4916 node = node->next_sibling_clone;
4920 delete_basic_block (b);
4926 tidy_fallthru_edges ();
4930 /* Update clone info after duplication. */
4933 update_clone_info (copy_body_data * id)
4935 struct cgraph_node *node;
4936 if (!id->dst_node->clones)
4938 for (node = id->dst_node->clones; node != id->dst_node;)
4940 /* First update replace maps to match the new body. */
4941 if (node->clone.tree_map)
4944 for (i = 0; i < VEC_length (ipa_replace_map_p, node->clone.tree_map); i++)
4946 struct ipa_replace_map *replace_info;
4947 replace_info = VEC_index (ipa_replace_map_p, node->clone.tree_map, i);
4948 walk_tree (&replace_info->old_tree, copy_tree_body_r, id, NULL);
4949 walk_tree (&replace_info->new_tree, copy_tree_body_r, id, NULL);
4953 node = node->clones;
4954 else if (node->next_sibling_clone)
4955 node = node->next_sibling_clone;
4958 while (node != id->dst_node && !node->next_sibling_clone)
4959 node = node->clone_of;
4960 if (node != id->dst_node)
4961 node = node->next_sibling_clone;
4966 /* Create a copy of a function's tree.
4967 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4968 of the original function and the new copied function
4969 respectively. In case we want to replace a DECL
4970 tree with another tree while duplicating the function's
4971 body, TREE_MAP represents the mapping between these
4972 trees. If UPDATE_CLONES is set, the call_stmt fields
4973 of edges of clones of the function will be updated.
4975 If non-NULL ARGS_TO_SKIP determine function parameters to remove
4977 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
4978 If non_NULL NEW_ENTRY determine new entry BB of the clone.
4981 tree_function_versioning (tree old_decl, tree new_decl,
4982 VEC(ipa_replace_map_p,gc)* tree_map,
4983 bool update_clones, bitmap args_to_skip,
4984 bitmap blocks_to_copy, basic_block new_entry)
4986 struct cgraph_node *old_version_node;
4987 struct cgraph_node *new_version_node;
4991 struct ipa_replace_map *replace_info;
4992 basic_block old_entry_block, bb;
4993 VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10);
4995 tree old_current_function_decl = current_function_decl;
4996 tree vars = NULL_TREE;
4998 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
4999 && TREE_CODE (new_decl) == FUNCTION_DECL);
5000 DECL_POSSIBLY_INLINED (old_decl) = 1;
5002 old_version_node = cgraph_node (old_decl);
5003 new_version_node = cgraph_node (new_decl);
5005 /* Output the inlining info for this abstract function, since it has been
5006 inlined. If we don't do this now, we can lose the information about the
5007 variables in the function when the blocks get blown away as soon as we
5008 remove the cgraph node. */
5009 (*debug_hooks->outlining_inline_function) (old_decl);
5011 DECL_ARTIFICIAL (new_decl) = 1;
5012 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
5013 DECL_FUNCTION_PERSONALITY (new_decl) = DECL_FUNCTION_PERSONALITY (old_decl);
5015 /* Prepare the data structures for the tree copy. */
5016 memset (&id, 0, sizeof (id));
5018 /* Generate a new name for the new version. */
5019 id.statements_to_fold = pointer_set_create ();
5021 id.decl_map = pointer_map_create ();
5022 id.debug_map = NULL;
5023 id.src_fn = old_decl;
5024 id.dst_fn = new_decl;
5025 id.src_node = old_version_node;
5026 id.dst_node = new_version_node;
5027 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
5028 if (id.src_node->ipa_transforms_to_apply)
5030 VEC(ipa_opt_pass,heap) * old_transforms_to_apply = id.dst_node->ipa_transforms_to_apply;
5033 id.dst_node->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap,
5034 id.src_node->ipa_transforms_to_apply);
5035 for (i = 0; i < VEC_length (ipa_opt_pass, old_transforms_to_apply); i++)
5036 VEC_safe_push (ipa_opt_pass, heap, id.dst_node->ipa_transforms_to_apply,
5037 VEC_index (ipa_opt_pass,
5038 old_transforms_to_apply,
5042 id.copy_decl = copy_decl_no_change;
5043 id.transform_call_graph_edges
5044 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
5045 id.transform_new_cfg = true;
5046 id.transform_return_to_modify = false;
5047 id.transform_lang_insert_block = NULL;
5049 current_function_decl = new_decl;
5050 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
5051 (DECL_STRUCT_FUNCTION (old_decl));
5052 initialize_cfun (new_decl, old_decl,
5053 old_entry_block->count);
5054 DECL_STRUCT_FUNCTION (new_decl)->gimple_df->ipa_pta
5055 = id.src_cfun->gimple_df->ipa_pta;
5056 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
5058 /* Copy the function's static chain. */
5059 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
5061 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
5062 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
5065 /* If there's a tree_map, prepare for substitution. */
5067 for (i = 0; i < VEC_length (ipa_replace_map_p, tree_map); i++)
5070 replace_info = VEC_index (ipa_replace_map_p, tree_map, i);
5071 if (replace_info->replace_p)
5073 tree op = replace_info->new_tree;
5074 if (!replace_info->old_tree)
5076 int i = replace_info->parm_num;
5078 for (parm = DECL_ARGUMENTS (old_decl); i; parm = DECL_CHAIN (parm))
5080 replace_info->old_tree = parm;
5086 if (TREE_CODE (op) == VIEW_CONVERT_EXPR)
5087 op = TREE_OPERAND (op, 0);
5089 if (TREE_CODE (op) == ADDR_EXPR)
5091 op = TREE_OPERAND (op, 0);
5092 while (handled_component_p (op))
5093 op = TREE_OPERAND (op, 0);
5094 if (TREE_CODE (op) == VAR_DECL)
5095 add_referenced_var (op);
5097 gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
5098 init = setup_one_parameter (&id, replace_info->old_tree,
5099 replace_info->new_tree, id.src_fn,
5103 VEC_safe_push (gimple, heap, init_stmts, init);
5106 /* Copy the function's arguments. */
5107 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
5108 DECL_ARGUMENTS (new_decl) =
5109 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
5110 args_to_skip, &vars);
5112 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
5114 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5115 number_blocks (id.dst_fn);
5117 declare_inline_vars (DECL_INITIAL (new_decl), vars);
5119 if (!VEC_empty (tree, DECL_STRUCT_FUNCTION (old_decl)->local_decls))
5120 /* Add local vars. */
5121 add_local_variables (DECL_STRUCT_FUNCTION (old_decl), cfun, &id, false);
5123 /* Copy the Function's body. */
5124 copy_body (&id, old_entry_block->count, REG_BR_PROB_BASE,
5125 ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, blocks_to_copy, new_entry);
5127 if (DECL_RESULT (old_decl) != NULL_TREE)
5129 tree *res_decl = &DECL_RESULT (old_decl);
5130 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
5131 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
5134 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5135 number_blocks (new_decl);
5137 /* We want to create the BB unconditionally, so that the addition of
5138 debug stmts doesn't affect BB count, which may in the end cause
5139 codegen differences. */
5140 bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
5141 while (VEC_length (gimple, init_stmts))
5142 insert_init_stmt (&id, bb, VEC_pop (gimple, init_stmts));
5143 update_clone_info (&id);
5145 /* Remap the nonlocal_goto_save_area, if any. */
5146 if (cfun->nonlocal_goto_save_area)
5148 struct walk_stmt_info wi;
5150 memset (&wi, 0, sizeof (wi));
5152 walk_tree (&cfun->nonlocal_goto_save_area, remap_gimple_op_r, &wi, NULL);
5156 pointer_map_destroy (id.decl_map);
5158 pointer_map_destroy (id.debug_map);
5159 free_dominance_info (CDI_DOMINATORS);
5160 free_dominance_info (CDI_POST_DOMINATORS);
5162 fold_marked_statements (0, id.statements_to_fold);
5163 pointer_set_destroy (id.statements_to_fold);
5164 fold_cond_expr_cond ();
5165 delete_unreachable_blocks_update_callgraph (&id);
5166 if (id.dst_node->analyzed)
5167 cgraph_rebuild_references ();
5168 update_ssa (TODO_update_ssa);
5170 /* After partial cloning we need to rescale frequencies, so they are
5171 within proper range in the cloned function. */
5174 struct cgraph_edge *e;
5175 rebuild_frequencies ();
5177 new_version_node->count = ENTRY_BLOCK_PTR->count;
5178 for (e = new_version_node->callees; e; e = e->next_callee)
5180 basic_block bb = gimple_bb (e->call_stmt);
5181 e->frequency = compute_call_stmt_bb_frequency (current_function_decl,
5183 e->count = bb->count;
5185 for (e = new_version_node->indirect_calls; e; e = e->next_callee)
5187 basic_block bb = gimple_bb (e->call_stmt);
5188 e->frequency = compute_call_stmt_bb_frequency (current_function_decl,
5190 e->count = bb->count;
5194 free_dominance_info (CDI_DOMINATORS);
5195 free_dominance_info (CDI_POST_DOMINATORS);
5197 gcc_assert (!id.debug_stmts);
5198 VEC_free (gimple, heap, init_stmts);
5200 current_function_decl = old_current_function_decl;
5201 gcc_assert (!current_function_decl
5202 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
5206 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5207 the callee and return the inlined body on success. */
5210 maybe_inline_call_in_expr (tree exp)
5212 tree fn = get_callee_fndecl (exp);
5214 /* We can only try to inline "const" functions. */
5215 if (fn && TREE_READONLY (fn) && DECL_SAVED_TREE (fn))
5217 struct pointer_map_t *decl_map = pointer_map_create ();
5218 call_expr_arg_iterator iter;
5222 /* Remap the parameters. */
5223 for (param = DECL_ARGUMENTS (fn), arg = first_call_expr_arg (exp, &iter);
5225 param = DECL_CHAIN (param), arg = next_call_expr_arg (&iter))
5226 *pointer_map_insert (decl_map, param) = arg;
5228 memset (&id, 0, sizeof (id));
5230 id.dst_fn = current_function_decl;
5231 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
5232 id.decl_map = decl_map;
5234 id.copy_decl = copy_decl_no_change;
5235 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
5236 id.transform_new_cfg = false;
5237 id.transform_return_to_modify = true;
5238 id.transform_lang_insert_block = false;
5240 /* Make sure not to unshare trees behind the front-end's back
5241 since front-end specific mechanisms may rely on sharing. */
5242 id.regimplify = false;
5243 id.do_not_unshare = true;
5245 /* We're not inside any EH region. */
5248 t = copy_tree_body (&id);
5249 pointer_map_destroy (decl_map);
5251 /* We can only return something suitable for use in a GENERIC
5253 if (TREE_CODE (t) == MODIFY_EXPR)
5254 return TREE_OPERAND (t, 1);
5260 /* Duplicate a type, fields and all. */
5263 build_duplicate_type (tree type)
5265 struct copy_body_data id;
5267 memset (&id, 0, sizeof (id));
5268 id.src_fn = current_function_decl;
5269 id.dst_fn = current_function_decl;
5271 id.decl_map = pointer_map_create ();
5272 id.debug_map = NULL;
5273 id.copy_decl = copy_decl_no_change;
5275 type = remap_type_1 (type, &id);
5277 pointer_map_destroy (id.decl_map);
5279 pointer_map_destroy (id.debug_map);
5281 TYPE_CANONICAL (type) = type;
5286 /* Return whether it is safe to inline a function because it used different
5287 target specific options or call site actual types mismatch parameter types.
5288 E is the call edge to be checked. */
5290 tree_can_inline_p (struct cgraph_edge *e)
5293 /* This causes a regression in SPEC in that it prevents a cold function from
5294 inlining a hot function. Perhaps this should only apply to functions
5295 that the user declares hot/cold/optimize explicitly. */
5297 /* Don't inline a function with a higher optimization level than the
5298 caller, or with different space constraints (hot/cold functions). */
5299 tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller);
5300 tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee);
5302 if (caller_tree != callee_tree)
5304 struct cl_optimization *caller_opt
5305 = TREE_OPTIMIZATION ((caller_tree)
5307 : optimization_default_node);
5309 struct cl_optimization *callee_opt
5310 = TREE_OPTIMIZATION ((callee_tree)
5312 : optimization_default_node);
5314 if ((caller_opt->optimize > callee_opt->optimize)
5315 || (caller_opt->optimize_size != callee_opt->optimize_size))
5319 tree caller, callee, lhs;
5321 caller = e->caller->decl;
5322 callee = e->callee->decl;
5324 /* First check that inlining isn't simply forbidden in this case. */
5325 if (inline_forbidden_into_p (caller, callee))
5327 e->inline_failed = CIF_UNSPECIFIED;
5328 gimple_call_set_cannot_inline (e->call_stmt, true);
5332 /* Allow the backend to decide if inlining is ok. */
5333 if (!targetm.target_option.can_inline_p (caller, callee))
5335 e->inline_failed = CIF_TARGET_OPTION_MISMATCH;
5336 gimple_call_set_cannot_inline (e->call_stmt, true);
5337 e->call_stmt_cannot_inline_p = true;
5341 /* Do not inline calls where we cannot triviall work around mismatches
5342 in argument or return types. */
5344 && ((DECL_RESULT (callee)
5345 && !DECL_BY_REFERENCE (DECL_RESULT (callee))
5346 && (lhs = gimple_call_lhs (e->call_stmt)) != NULL_TREE
5347 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee)),
5349 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee)), lhs))
5350 || !gimple_check_call_args (e->call_stmt)))
5352 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
5353 gimple_call_set_cannot_inline (e->call_stmt, true);
5354 e->call_stmt_cannot_inline_p = true;