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"
28 #include "tree-inline.h"
32 #include "insn-config.h"
34 #include "langhooks.h"
35 #include "basic-block.h"
36 #include "tree-iterator.h"
39 #include "tree-mudflap.h"
40 #include "tree-flow.h"
42 #include "tree-flow.h"
43 #include "tree-pretty-print.h"
46 #include "pointer-set.h"
48 #include "value-prof.h"
49 #include "tree-pass.h"
51 #include "integrate.h"
53 #include "rtl.h" /* FIXME: For asm_str_count. */
55 /* I'm not real happy about this, but we need to handle gimple and
59 /* Inlining, Cloning, Versioning, Parallelization
61 Inlining: a function body is duplicated, but the PARM_DECLs are
62 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
63 MODIFY_EXPRs that store to a dedicated returned-value variable.
64 The duplicated eh_region info of the copy will later be appended
65 to the info for the caller; the eh_region info in copied throwing
66 statements and RESX statements are adjusted accordingly.
68 Cloning: (only in C++) We have one body for a con/de/structor, and
69 multiple function decls, each with a unique parameter list.
70 Duplicate the body, using the given splay tree; some parameters
71 will become constants (like 0 or 1).
73 Versioning: a function body is duplicated and the result is a new
74 function rather than into blocks of an existing function as with
75 inlining. Some parameters will become constants.
77 Parallelization: a region of a function is duplicated resulting in
78 a new function. Variables may be replaced with complex expressions
79 to enable shared variable semantics.
81 All of these will simultaneously lookup any callgraph edges. If
82 we're going to inline the duplicated function body, and the given
83 function has some cloned callgraph nodes (one for each place this
84 function will be inlined) those callgraph edges will be duplicated.
85 If we're cloning the body, those callgraph edges will be
86 updated to point into the new body. (Note that the original
87 callgraph node and edge list will not be altered.)
89 See the CALL_EXPR handling case in copy_tree_body_r (). */
93 o In order to make inlining-on-trees work, we pessimized
94 function-local static constants. In particular, they are now
95 always output, even when not addressed. Fix this by treating
96 function-local static constants just like global static
97 constants; the back-end already knows not to output them if they
100 o Provide heuristics to clamp inlining of recursive template
104 /* Weights that estimate_num_insns uses to estimate the size of the
107 eni_weights eni_size_weights;
109 /* Weights that estimate_num_insns uses to estimate the time necessary
110 to execute the produced code. */
112 eni_weights eni_time_weights;
116 static tree declare_return_variable (copy_body_data *, tree, tree);
117 static void remap_block (tree *, copy_body_data *);
118 static void copy_bind_expr (tree *, int *, copy_body_data *);
119 static tree mark_local_for_remap_r (tree *, int *, void *);
120 static void unsave_expr_1 (tree);
121 static tree unsave_r (tree *, int *, void *);
122 static void declare_inline_vars (tree, tree);
123 static void remap_save_expr (tree *, void *, int *);
124 static void prepend_lexical_block (tree current_block, tree new_block);
125 static tree copy_decl_to_var (tree, copy_body_data *);
126 static tree copy_result_decl_to_var (tree, copy_body_data *);
127 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
128 static gimple remap_gimple_stmt (gimple, copy_body_data *);
129 static bool delete_unreachable_blocks_update_callgraph (copy_body_data *id);
131 /* Insert a tree->tree mapping for ID. Despite the name suggests
132 that the trees should be variables, it is used for more than that. */
135 insert_decl_map (copy_body_data *id, tree key, tree value)
137 *pointer_map_insert (id->decl_map, key) = value;
139 /* Always insert an identity map as well. If we see this same new
140 node again, we won't want to duplicate it a second time. */
142 *pointer_map_insert (id->decl_map, value) = value;
145 /* Insert a tree->tree mapping for ID. This is only used for
149 insert_debug_decl_map (copy_body_data *id, tree key, tree value)
151 if (!gimple_in_ssa_p (id->src_cfun))
154 if (!MAY_HAVE_DEBUG_STMTS)
157 if (!target_for_debug_bind (key))
160 gcc_assert (TREE_CODE (key) == PARM_DECL);
161 gcc_assert (TREE_CODE (value) == VAR_DECL);
164 id->debug_map = pointer_map_create ();
166 *pointer_map_insert (id->debug_map, key) = value;
169 /* If nonzero, we're remapping the contents of inlined debug
170 statements. If negative, an error has occurred, such as a
171 reference to a variable that isn't available in the inlined
173 static int processing_debug_stmt = 0;
175 /* Construct new SSA name for old NAME. ID is the inline context. */
178 remap_ssa_name (tree name, copy_body_data *id)
183 gcc_assert (TREE_CODE (name) == SSA_NAME);
185 n = (tree *) pointer_map_contains (id->decl_map, name);
187 return unshare_expr (*n);
189 if (processing_debug_stmt)
191 processing_debug_stmt = -1;
195 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
197 new_tree = remap_decl (SSA_NAME_VAR (name), id);
199 /* We might've substituted constant or another SSA_NAME for
202 Replace the SSA name representing RESULT_DECL by variable during
203 inlining: this saves us from need to introduce PHI node in a case
204 return value is just partly initialized. */
205 if ((TREE_CODE (new_tree) == VAR_DECL || TREE_CODE (new_tree) == PARM_DECL)
206 && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
207 || !id->transform_return_to_modify))
209 struct ptr_info_def *pi;
210 new_tree = make_ssa_name (new_tree, NULL);
211 insert_decl_map (id, name, new_tree);
212 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree)
213 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
214 TREE_TYPE (new_tree) = TREE_TYPE (SSA_NAME_VAR (new_tree));
215 /* At least IPA points-to info can be directly transferred. */
216 if (id->src_cfun->gimple_df
217 && id->src_cfun->gimple_df->ipa_pta
218 && (pi = SSA_NAME_PTR_INFO (name))
221 struct ptr_info_def *new_pi = get_ptr_info (new_tree);
224 if (gimple_nop_p (SSA_NAME_DEF_STMT (name)))
226 /* By inlining function having uninitialized variable, we might
227 extend the lifetime (variable might get reused). This cause
228 ICE in the case we end up extending lifetime of SSA name across
229 abnormal edge, but also increase register pressure.
231 We simply initialize all uninitialized vars by 0 except
232 for case we are inlining to very first BB. We can avoid
233 this for all BBs that are not inside strongly connected
234 regions of the CFG, but this is expensive to test. */
236 && is_gimple_reg (SSA_NAME_VAR (name))
237 && TREE_CODE (SSA_NAME_VAR (name)) != PARM_DECL
238 && (id->entry_bb != EDGE_SUCC (ENTRY_BLOCK_PTR, 0)->dest
239 || EDGE_COUNT (id->entry_bb->preds) != 1))
241 gimple_stmt_iterator gsi = gsi_last_bb (id->entry_bb);
244 init_stmt = gimple_build_assign (new_tree,
245 fold_convert (TREE_TYPE (new_tree),
247 gsi_insert_after (&gsi, init_stmt, GSI_NEW_STMT);
248 SSA_NAME_IS_DEFAULT_DEF (new_tree) = 0;
252 SSA_NAME_DEF_STMT (new_tree) = gimple_build_nop ();
253 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name))
255 set_default_def (SSA_NAME_VAR (new_tree), new_tree);
260 insert_decl_map (id, name, new_tree);
264 /* Remap DECL during the copying of the BLOCK tree for the function. */
267 remap_decl (tree decl, copy_body_data *id)
271 /* We only remap local variables in the current function. */
273 /* See if we have remapped this declaration. */
275 n = (tree *) pointer_map_contains (id->decl_map, decl);
277 if (!n && processing_debug_stmt)
279 processing_debug_stmt = -1;
283 /* If we didn't already have an equivalent for this declaration,
287 /* Make a copy of the variable or label. */
288 tree t = id->copy_decl (decl, id);
290 /* Remember it, so that if we encounter this local entity again
291 we can reuse this copy. Do this early because remap_type may
292 need this decl for TYPE_STUB_DECL. */
293 insert_decl_map (id, decl, t);
298 /* Remap types, if necessary. */
299 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
300 if (TREE_CODE (t) == TYPE_DECL)
301 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
303 /* Remap sizes as necessary. */
304 walk_tree (&DECL_SIZE (t), copy_tree_body_r, id, NULL);
305 walk_tree (&DECL_SIZE_UNIT (t), copy_tree_body_r, id, NULL);
307 /* If fields, do likewise for offset and qualifier. */
308 if (TREE_CODE (t) == FIELD_DECL)
310 walk_tree (&DECL_FIELD_OFFSET (t), copy_tree_body_r, id, NULL);
311 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
312 walk_tree (&DECL_QUALIFIER (t), copy_tree_body_r, id, NULL);
315 if (cfun && gimple_in_ssa_p (cfun)
316 && (TREE_CODE (t) == VAR_DECL
317 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
320 add_referenced_var (t);
325 if (id->do_not_unshare)
328 return unshare_expr (*n);
332 remap_type_1 (tree type, copy_body_data *id)
336 /* We do need a copy. build and register it now. If this is a pointer or
337 reference type, remap the designated type and make a new pointer or
339 if (TREE_CODE (type) == POINTER_TYPE)
341 new_tree = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
343 TYPE_REF_CAN_ALIAS_ALL (type));
344 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
345 new_tree = build_type_attribute_qual_variant (new_tree,
346 TYPE_ATTRIBUTES (type),
348 insert_decl_map (id, type, new_tree);
351 else if (TREE_CODE (type) == REFERENCE_TYPE)
353 new_tree = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
355 TYPE_REF_CAN_ALIAS_ALL (type));
356 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
357 new_tree = build_type_attribute_qual_variant (new_tree,
358 TYPE_ATTRIBUTES (type),
360 insert_decl_map (id, type, new_tree);
364 new_tree = copy_node (type);
366 insert_decl_map (id, type, new_tree);
368 /* This is a new type, not a copy of an old type. Need to reassociate
369 variants. We can handle everything except the main variant lazily. */
370 t = TYPE_MAIN_VARIANT (type);
373 t = remap_type (t, id);
374 TYPE_MAIN_VARIANT (new_tree) = t;
375 TYPE_NEXT_VARIANT (new_tree) = TYPE_NEXT_VARIANT (t);
376 TYPE_NEXT_VARIANT (t) = new_tree;
380 TYPE_MAIN_VARIANT (new_tree) = new_tree;
381 TYPE_NEXT_VARIANT (new_tree) = NULL;
384 if (TYPE_STUB_DECL (type))
385 TYPE_STUB_DECL (new_tree) = remap_decl (TYPE_STUB_DECL (type), id);
387 /* Lazily create pointer and reference types. */
388 TYPE_POINTER_TO (new_tree) = NULL;
389 TYPE_REFERENCE_TO (new_tree) = NULL;
391 switch (TREE_CODE (new_tree))
395 case FIXED_POINT_TYPE:
398 t = TYPE_MIN_VALUE (new_tree);
399 if (t && TREE_CODE (t) != INTEGER_CST)
400 walk_tree (&TYPE_MIN_VALUE (new_tree), copy_tree_body_r, id, NULL);
402 t = TYPE_MAX_VALUE (new_tree);
403 if (t && TREE_CODE (t) != INTEGER_CST)
404 walk_tree (&TYPE_MAX_VALUE (new_tree), copy_tree_body_r, id, NULL);
408 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
409 walk_tree (&TYPE_ARG_TYPES (new_tree), copy_tree_body_r, id, NULL);
413 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
414 TYPE_DOMAIN (new_tree) = remap_type (TYPE_DOMAIN (new_tree), id);
419 case QUAL_UNION_TYPE:
423 for (f = TYPE_FIELDS (new_tree); f ; f = TREE_CHAIN (f))
425 t = remap_decl (f, id);
426 DECL_CONTEXT (t) = new_tree;
430 TYPE_FIELDS (new_tree) = nreverse (nf);
436 /* Shouldn't have been thought variable sized. */
440 walk_tree (&TYPE_SIZE (new_tree), copy_tree_body_r, id, NULL);
441 walk_tree (&TYPE_SIZE_UNIT (new_tree), copy_tree_body_r, id, NULL);
447 remap_type (tree type, copy_body_data *id)
455 /* See if we have remapped this type. */
456 node = (tree *) pointer_map_contains (id->decl_map, type);
460 /* The type only needs remapping if it's variably modified. */
461 if (! variably_modified_type_p (type, id->src_fn))
463 insert_decl_map (id, type, type);
467 id->remapping_type_depth++;
468 tmp = remap_type_1 (type, id);
469 id->remapping_type_depth--;
474 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
475 is NULL or TYPE has not been remapped before. */
478 remapped_type (tree type, copy_body_data *id)
485 /* See if we have remapped this type. */
486 node = (tree *) pointer_map_contains (id->decl_map, type);
493 /* The type only needs remapping if it's variably modified. */
494 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
497 can_be_nonlocal (tree decl, copy_body_data *id)
499 /* We can not duplicate function decls. */
500 if (TREE_CODE (decl) == FUNCTION_DECL)
503 /* Local static vars must be non-local or we get multiple declaration
505 if (TREE_CODE (decl) == VAR_DECL
506 && !auto_var_in_fn_p (decl, id->src_fn))
509 /* At the moment dwarf2out can handle only these types of nodes. We
510 can support more later. */
511 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != PARM_DECL)
514 /* We must use global type. We call remapped_type instead of
515 remap_type since we don't want to remap this type here if it
516 hasn't been remapped before. */
517 if (TREE_TYPE (decl) != remapped_type (TREE_TYPE (decl), id))
520 /* Wihtout SSA we can't tell if variable is used. */
521 if (!gimple_in_ssa_p (cfun))
524 /* Live variables must be copied so we can attach DECL_RTL. */
532 remap_decls (tree decls, VEC(tree,gc) **nonlocalized_list, copy_body_data *id)
535 tree new_decls = NULL_TREE;
537 /* Remap its variables. */
538 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
542 if (can_be_nonlocal (old_var, id))
544 if (TREE_CODE (old_var) == VAR_DECL
545 && ! DECL_EXTERNAL (old_var)
546 && (var_ann (old_var) || !gimple_in_ssa_p (cfun)))
547 cfun->local_decls = tree_cons (NULL_TREE, old_var,
549 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
550 && !DECL_IGNORED_P (old_var)
551 && nonlocalized_list)
552 VEC_safe_push (tree, gc, *nonlocalized_list, old_var);
556 /* Remap the variable. */
557 new_var = remap_decl (old_var, id);
559 /* If we didn't remap this variable, we can't mess with its
560 TREE_CHAIN. If we remapped this variable to the return slot, it's
561 already declared somewhere else, so don't declare it here. */
563 if (new_var == id->retvar)
567 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
568 && !DECL_IGNORED_P (old_var)
569 && nonlocalized_list)
570 VEC_safe_push (tree, gc, *nonlocalized_list, old_var);
574 gcc_assert (DECL_P (new_var));
575 TREE_CHAIN (new_var) = new_decls;
578 /* Also copy value-expressions. */
579 if (TREE_CODE (new_var) == VAR_DECL
580 && DECL_HAS_VALUE_EXPR_P (new_var))
582 tree tem = DECL_VALUE_EXPR (new_var);
583 bool old_regimplify = id->regimplify;
584 id->remapping_type_depth++;
585 walk_tree (&tem, copy_tree_body_r, id, NULL);
586 id->remapping_type_depth--;
587 id->regimplify = old_regimplify;
588 SET_DECL_VALUE_EXPR (new_var, tem);
593 return nreverse (new_decls);
596 /* Copy the BLOCK to contain remapped versions of the variables
597 therein. And hook the new block into the block-tree. */
600 remap_block (tree *block, copy_body_data *id)
605 /* Make the new block. */
607 new_block = make_node (BLOCK);
608 TREE_USED (new_block) = TREE_USED (old_block);
609 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
610 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
611 BLOCK_NONLOCALIZED_VARS (new_block)
612 = VEC_copy (tree, gc, BLOCK_NONLOCALIZED_VARS (old_block));
615 /* Remap its variables. */
616 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block),
617 &BLOCK_NONLOCALIZED_VARS (new_block),
620 if (id->transform_lang_insert_block)
621 id->transform_lang_insert_block (new_block);
623 /* Remember the remapped block. */
624 insert_decl_map (id, old_block, new_block);
627 /* Copy the whole block tree and root it in id->block. */
629 remap_blocks (tree block, copy_body_data *id)
632 tree new_tree = block;
637 remap_block (&new_tree, id);
638 gcc_assert (new_tree != block);
639 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
640 prepend_lexical_block (new_tree, remap_blocks (t, id));
641 /* Blocks are in arbitrary order, but make things slightly prettier and do
642 not swap order when producing a copy. */
643 BLOCK_SUBBLOCKS (new_tree) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree));
648 copy_statement_list (tree *tp)
650 tree_stmt_iterator oi, ni;
653 new_tree = alloc_stmt_list ();
654 ni = tsi_start (new_tree);
655 oi = tsi_start (*tp);
656 TREE_TYPE (new_tree) = TREE_TYPE (*tp);
659 for (; !tsi_end_p (oi); tsi_next (&oi))
661 tree stmt = tsi_stmt (oi);
662 if (TREE_CODE (stmt) == STATEMENT_LIST)
663 copy_statement_list (&stmt);
664 tsi_link_after (&ni, stmt, TSI_CONTINUE_LINKING);
669 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
671 tree block = BIND_EXPR_BLOCK (*tp);
672 /* Copy (and replace) the statement. */
673 copy_tree_r (tp, walk_subtrees, NULL);
676 remap_block (&block, id);
677 BIND_EXPR_BLOCK (*tp) = block;
680 if (BIND_EXPR_VARS (*tp))
681 /* This will remap a lot of the same decls again, but this should be
683 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), NULL, id);
687 /* Create a new gimple_seq by remapping all the statements in BODY
688 using the inlining information in ID. */
691 remap_gimple_seq (gimple_seq body, copy_body_data *id)
693 gimple_stmt_iterator si;
694 gimple_seq new_body = NULL;
696 for (si = gsi_start (body); !gsi_end_p (si); gsi_next (&si))
698 gimple new_stmt = remap_gimple_stmt (gsi_stmt (si), id);
699 gimple_seq_add_stmt (&new_body, new_stmt);
706 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
707 block using the mapping information in ID. */
710 copy_gimple_bind (gimple stmt, copy_body_data *id)
713 tree new_block, new_vars;
714 gimple_seq body, new_body;
716 /* Copy the statement. Note that we purposely don't use copy_stmt
717 here because we need to remap statements as we copy. */
718 body = gimple_bind_body (stmt);
719 new_body = remap_gimple_seq (body, id);
721 new_block = gimple_bind_block (stmt);
723 remap_block (&new_block, id);
725 /* This will remap a lot of the same decls again, but this should be
727 new_vars = gimple_bind_vars (stmt);
729 new_vars = remap_decls (new_vars, NULL, id);
731 new_bind = gimple_build_bind (new_vars, new_body, new_block);
737 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
738 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
739 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
740 recursing into the children nodes of *TP. */
743 remap_gimple_op_r (tree *tp, int *walk_subtrees, void *data)
745 struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
746 copy_body_data *id = (copy_body_data *) wi_p->info;
747 tree fn = id->src_fn;
749 if (TREE_CODE (*tp) == SSA_NAME)
751 *tp = remap_ssa_name (*tp, id);
755 else if (auto_var_in_fn_p (*tp, fn))
757 /* Local variables and labels need to be replaced by equivalent
758 variables. We don't want to copy static variables; there's
759 only one of those, no matter how many times we inline the
760 containing function. Similarly for globals from an outer
764 /* Remap the declaration. */
765 new_decl = remap_decl (*tp, id);
766 gcc_assert (new_decl);
767 /* Replace this variable with the copy. */
768 STRIP_TYPE_NOPS (new_decl);
769 /* ??? The C++ frontend uses void * pointer zero to initialize
770 any other type. This confuses the middle-end type verification.
771 As cloned bodies do not go through gimplification again the fixup
772 there doesn't trigger. */
773 if (TREE_CODE (new_decl) == INTEGER_CST
774 && !useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (new_decl)))
775 new_decl = fold_convert (TREE_TYPE (*tp), new_decl);
779 else if (TREE_CODE (*tp) == STATEMENT_LIST)
781 else if (TREE_CODE (*tp) == SAVE_EXPR)
783 else if (TREE_CODE (*tp) == LABEL_DECL
784 && (!DECL_CONTEXT (*tp)
785 || decl_function_context (*tp) == id->src_fn))
786 /* These may need to be remapped for EH handling. */
787 *tp = remap_decl (*tp, id);
788 else if (TYPE_P (*tp))
789 /* Types may need remapping as well. */
790 *tp = remap_type (*tp, id);
791 else if (CONSTANT_CLASS_P (*tp))
793 /* If this is a constant, we have to copy the node iff the type
794 will be remapped. copy_tree_r will not copy a constant. */
795 tree new_type = remap_type (TREE_TYPE (*tp), id);
797 if (new_type == TREE_TYPE (*tp))
800 else if (TREE_CODE (*tp) == INTEGER_CST)
801 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
802 TREE_INT_CST_HIGH (*tp));
805 *tp = copy_node (*tp);
806 TREE_TYPE (*tp) = new_type;
811 /* Otherwise, just copy the node. Note that copy_tree_r already
812 knows not to copy VAR_DECLs, etc., so this is safe. */
813 if (TREE_CODE (*tp) == INDIRECT_REF)
815 /* Get rid of *& from inline substitutions that can happen when a
816 pointer argument is an ADDR_EXPR. */
817 tree decl = TREE_OPERAND (*tp, 0);
820 n = (tree *) pointer_map_contains (id->decl_map, decl);
823 tree type, new_tree, old;
825 /* If we happen to get an ADDR_EXPR in n->value, strip
826 it manually here as we'll eventually get ADDR_EXPRs
827 which lie about their types pointed to. In this case
828 build_fold_indirect_ref wouldn't strip the
829 INDIRECT_REF, but we absolutely rely on that. As
830 fold_indirect_ref does other useful transformations,
831 try that first, though. */
832 type = TREE_TYPE (TREE_TYPE (*n));
833 new_tree = unshare_expr (*n);
835 *tp = gimple_fold_indirect_ref (new_tree);
838 if (TREE_CODE (new_tree) == ADDR_EXPR)
840 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
842 /* ??? We should either assert here or build
843 a VIEW_CONVERT_EXPR instead of blindly leaking
844 incompatible types to our IL. */
846 *tp = TREE_OPERAND (new_tree, 0);
850 *tp = build1 (INDIRECT_REF, type, new_tree);
851 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
852 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
860 /* Here is the "usual case". Copy this tree node, and then
861 tweak some special cases. */
862 copy_tree_r (tp, walk_subtrees, NULL);
864 /* Global variables we haven't seen yet need to go into referenced
865 vars. If not referenced from types only. */
866 if (gimple_in_ssa_p (cfun)
867 && TREE_CODE (*tp) == VAR_DECL
868 && id->remapping_type_depth == 0
869 && !processing_debug_stmt)
870 add_referenced_var (*tp);
872 /* We should never have TREE_BLOCK set on non-statements. */
874 gcc_assert (!TREE_BLOCK (*tp));
876 if (TREE_CODE (*tp) != OMP_CLAUSE)
877 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
879 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
881 /* The copied TARGET_EXPR has never been expanded, even if the
882 original node was expanded already. */
883 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
884 TREE_OPERAND (*tp, 3) = NULL_TREE;
886 else if (TREE_CODE (*tp) == ADDR_EXPR)
888 /* Variable substitution need not be simple. In particular,
889 the INDIRECT_REF substitution above. Make sure that
890 TREE_CONSTANT and friends are up-to-date. But make sure
891 to not improperly set TREE_BLOCK on some sub-expressions. */
892 int invariant = is_gimple_min_invariant (*tp);
893 tree block = id->block;
894 id->block = NULL_TREE;
895 walk_tree (&TREE_OPERAND (*tp, 0), remap_gimple_op_r, data, NULL);
898 /* Handle the case where we substituted an INDIRECT_REF
899 into the operand of the ADDR_EXPR. */
900 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
901 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
903 recompute_tree_invariant_for_addr_expr (*tp);
905 /* If this used to be invariant, but is not any longer,
906 then regimplification is probably needed. */
907 if (invariant && !is_gimple_min_invariant (*tp))
908 id->regimplify = true;
914 /* Keep iterating. */
919 /* Called from copy_body_id via walk_tree. DATA is really a
920 `copy_body_data *'. */
923 copy_tree_body_r (tree *tp, int *walk_subtrees, void *data)
925 copy_body_data *id = (copy_body_data *) data;
926 tree fn = id->src_fn;
929 /* Begin by recognizing trees that we'll completely rewrite for the
930 inlining context. Our output for these trees is completely
931 different from out input (e.g. RETURN_EXPR is deleted, and morphs
932 into an edge). Further down, we'll handle trees that get
933 duplicated and/or tweaked. */
935 /* When requested, RETURN_EXPRs should be transformed to just the
936 contained MODIFY_EXPR. The branch semantics of the return will
937 be handled elsewhere by manipulating the CFG rather than a statement. */
938 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
940 tree assignment = TREE_OPERAND (*tp, 0);
942 /* If we're returning something, just turn that into an
943 assignment into the equivalent of the original RESULT_DECL.
944 If the "assignment" is just the result decl, the result
945 decl has already been set (e.g. a recent "foo (&result_decl,
946 ...)"); just toss the entire RETURN_EXPR. */
947 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
949 /* Replace the RETURN_EXPR with (a copy of) the
950 MODIFY_EXPR hanging underneath. */
951 *tp = copy_node (assignment);
953 else /* Else the RETURN_EXPR returns no value. */
956 return (tree) (void *)1;
959 else if (TREE_CODE (*tp) == SSA_NAME)
961 *tp = remap_ssa_name (*tp, id);
966 /* Local variables and labels need to be replaced by equivalent
967 variables. We don't want to copy static variables; there's only
968 one of those, no matter how many times we inline the containing
969 function. Similarly for globals from an outer function. */
970 else if (auto_var_in_fn_p (*tp, fn))
974 /* Remap the declaration. */
975 new_decl = remap_decl (*tp, id);
976 gcc_assert (new_decl);
977 /* Replace this variable with the copy. */
978 STRIP_TYPE_NOPS (new_decl);
982 else if (TREE_CODE (*tp) == STATEMENT_LIST)
983 copy_statement_list (tp);
984 else if (TREE_CODE (*tp) == SAVE_EXPR
985 || TREE_CODE (*tp) == TARGET_EXPR)
986 remap_save_expr (tp, id->decl_map, walk_subtrees);
987 else if (TREE_CODE (*tp) == LABEL_DECL
988 && (! DECL_CONTEXT (*tp)
989 || decl_function_context (*tp) == id->src_fn))
990 /* These may need to be remapped for EH handling. */
991 *tp = remap_decl (*tp, id);
992 else if (TREE_CODE (*tp) == BIND_EXPR)
993 copy_bind_expr (tp, walk_subtrees, id);
994 /* Types may need remapping as well. */
995 else if (TYPE_P (*tp))
996 *tp = remap_type (*tp, id);
998 /* If this is a constant, we have to copy the node iff the type will be
999 remapped. copy_tree_r will not copy a constant. */
1000 else if (CONSTANT_CLASS_P (*tp))
1002 tree new_type = remap_type (TREE_TYPE (*tp), id);
1004 if (new_type == TREE_TYPE (*tp))
1007 else if (TREE_CODE (*tp) == INTEGER_CST)
1008 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
1009 TREE_INT_CST_HIGH (*tp));
1012 *tp = copy_node (*tp);
1013 TREE_TYPE (*tp) = new_type;
1017 /* Otherwise, just copy the node. Note that copy_tree_r already
1018 knows not to copy VAR_DECLs, etc., so this is safe. */
1021 /* Here we handle trees that are not completely rewritten.
1022 First we detect some inlining-induced bogosities for
1024 if (TREE_CODE (*tp) == MODIFY_EXPR
1025 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
1026 && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn)))
1028 /* Some assignments VAR = VAR; don't generate any rtl code
1029 and thus don't count as variable modification. Avoid
1030 keeping bogosities like 0 = 0. */
1031 tree decl = TREE_OPERAND (*tp, 0), value;
1034 n = (tree *) pointer_map_contains (id->decl_map, decl);
1038 STRIP_TYPE_NOPS (value);
1039 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1041 *tp = build_empty_stmt (EXPR_LOCATION (*tp));
1042 return copy_tree_body_r (tp, walk_subtrees, data);
1046 else if (TREE_CODE (*tp) == INDIRECT_REF)
1048 /* Get rid of *& from inline substitutions that can happen when a
1049 pointer argument is an ADDR_EXPR. */
1050 tree decl = TREE_OPERAND (*tp, 0);
1053 n = (tree *) pointer_map_contains (id->decl_map, decl);
1058 /* If we happen to get an ADDR_EXPR in n->value, strip
1059 it manually here as we'll eventually get ADDR_EXPRs
1060 which lie about their types pointed to. In this case
1061 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1062 but we absolutely rely on that. As fold_indirect_ref
1063 does other useful transformations, try that first, though. */
1064 tree type = TREE_TYPE (TREE_TYPE (*n));
1065 if (id->do_not_unshare)
1068 new_tree = unshare_expr (*n);
1070 *tp = gimple_fold_indirect_ref (new_tree);
1073 if (TREE_CODE (new_tree) == ADDR_EXPR)
1075 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
1077 /* ??? We should either assert here or build
1078 a VIEW_CONVERT_EXPR instead of blindly leaking
1079 incompatible types to our IL. */
1081 *tp = TREE_OPERAND (new_tree, 0);
1085 *tp = build1 (INDIRECT_REF, type, new_tree);
1086 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1087 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1095 /* Here is the "usual case". Copy this tree node, and then
1096 tweak some special cases. */
1097 copy_tree_r (tp, walk_subtrees, NULL);
1099 /* Global variables we haven't seen yet needs to go into referenced
1100 vars. If not referenced from types or debug stmts only. */
1101 if (gimple_in_ssa_p (cfun)
1102 && TREE_CODE (*tp) == VAR_DECL
1103 && id->remapping_type_depth == 0
1104 && !processing_debug_stmt)
1105 add_referenced_var (*tp);
1107 /* If EXPR has block defined, map it to newly constructed block.
1108 When inlining we want EXPRs without block appear in the block
1109 of function call if we are not remapping a type. */
1112 new_block = id->remapping_type_depth == 0 ? id->block : NULL;
1113 if (TREE_BLOCK (*tp))
1116 n = (tree *) pointer_map_contains (id->decl_map,
1118 gcc_assert (n || id->remapping_type_depth != 0);
1122 TREE_BLOCK (*tp) = new_block;
1125 if (TREE_CODE (*tp) != OMP_CLAUSE)
1126 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
1128 /* The copied TARGET_EXPR has never been expanded, even if the
1129 original node was expanded already. */
1130 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
1132 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
1133 TREE_OPERAND (*tp, 3) = NULL_TREE;
1136 /* Variable substitution need not be simple. In particular, the
1137 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1138 and friends are up-to-date. */
1139 else if (TREE_CODE (*tp) == ADDR_EXPR)
1141 int invariant = is_gimple_min_invariant (*tp);
1142 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
1144 /* Handle the case where we substituted an INDIRECT_REF
1145 into the operand of the ADDR_EXPR. */
1146 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
1147 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
1149 recompute_tree_invariant_for_addr_expr (*tp);
1151 /* If this used to be invariant, but is not any longer,
1152 then regimplification is probably needed. */
1153 if (invariant && !is_gimple_min_invariant (*tp))
1154 id->regimplify = true;
1160 /* Keep iterating. */
1164 /* Helper for remap_gimple_stmt. Given an EH region number for the
1165 source function, map that to the duplicate EH region number in
1166 the destination function. */
1169 remap_eh_region_nr (int old_nr, copy_body_data *id)
1171 eh_region old_r, new_r;
1174 old_r = get_eh_region_from_number_fn (id->src_cfun, old_nr);
1175 slot = pointer_map_contains (id->eh_map, old_r);
1176 new_r = (eh_region) *slot;
1178 return new_r->index;
1181 /* Similar, but operate on INTEGER_CSTs. */
1184 remap_eh_region_tree_nr (tree old_t_nr, copy_body_data *id)
1188 old_nr = tree_low_cst (old_t_nr, 0);
1189 new_nr = remap_eh_region_nr (old_nr, id);
1191 return build_int_cst (NULL, new_nr);
1194 /* Helper for copy_bb. Remap statement STMT using the inlining
1195 information in ID. Return the new statement copy. */
1198 remap_gimple_stmt (gimple stmt, copy_body_data *id)
1201 struct walk_stmt_info wi;
1203 bool skip_first = false;
1205 /* Begin by recognizing trees that we'll completely rewrite for the
1206 inlining context. Our output for these trees is completely
1207 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1208 into an edge). Further down, we'll handle trees that get
1209 duplicated and/or tweaked. */
1211 /* When requested, GIMPLE_RETURNs should be transformed to just the
1212 contained GIMPLE_ASSIGN. The branch semantics of the return will
1213 be handled elsewhere by manipulating the CFG rather than the
1215 if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify)
1217 tree retval = gimple_return_retval (stmt);
1219 /* If we're returning something, just turn that into an
1220 assignment into the equivalent of the original RESULT_DECL.
1221 If RETVAL is just the result decl, the result decl has
1222 already been set (e.g. a recent "foo (&result_decl, ...)");
1223 just toss the entire GIMPLE_RETURN. */
1224 if (retval && TREE_CODE (retval) != RESULT_DECL)
1226 copy = gimple_build_assign (id->retvar, retval);
1227 /* id->retvar is already substituted. Skip it on later remapping. */
1231 return gimple_build_nop ();
1233 else if (gimple_has_substatements (stmt))
1237 /* When cloning bodies from the C++ front end, we will be handed bodies
1238 in High GIMPLE form. Handle here all the High GIMPLE statements that
1239 have embedded statements. */
1240 switch (gimple_code (stmt))
1243 copy = copy_gimple_bind (stmt, id);
1247 s1 = remap_gimple_seq (gimple_catch_handler (stmt), id);
1248 copy = gimple_build_catch (gimple_catch_types (stmt), s1);
1251 case GIMPLE_EH_FILTER:
1252 s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id);
1253 copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1);
1257 s1 = remap_gimple_seq (gimple_try_eval (stmt), id);
1258 s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id);
1259 copy = gimple_build_try (s1, s2, gimple_try_kind (stmt));
1262 case GIMPLE_WITH_CLEANUP_EXPR:
1263 s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id);
1264 copy = gimple_build_wce (s1);
1267 case GIMPLE_OMP_PARALLEL:
1268 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1269 copy = gimple_build_omp_parallel
1271 gimple_omp_parallel_clauses (stmt),
1272 gimple_omp_parallel_child_fn (stmt),
1273 gimple_omp_parallel_data_arg (stmt));
1276 case GIMPLE_OMP_TASK:
1277 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1278 copy = gimple_build_omp_task
1280 gimple_omp_task_clauses (stmt),
1281 gimple_omp_task_child_fn (stmt),
1282 gimple_omp_task_data_arg (stmt),
1283 gimple_omp_task_copy_fn (stmt),
1284 gimple_omp_task_arg_size (stmt),
1285 gimple_omp_task_arg_align (stmt));
1288 case GIMPLE_OMP_FOR:
1289 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1290 s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id);
1291 copy = gimple_build_omp_for (s1, gimple_omp_for_clauses (stmt),
1292 gimple_omp_for_collapse (stmt), s2);
1295 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1297 gimple_omp_for_set_index (copy, i,
1298 gimple_omp_for_index (stmt, i));
1299 gimple_omp_for_set_initial (copy, i,
1300 gimple_omp_for_initial (stmt, i));
1301 gimple_omp_for_set_final (copy, i,
1302 gimple_omp_for_final (stmt, i));
1303 gimple_omp_for_set_incr (copy, i,
1304 gimple_omp_for_incr (stmt, i));
1305 gimple_omp_for_set_cond (copy, i,
1306 gimple_omp_for_cond (stmt, i));
1311 case GIMPLE_OMP_MASTER:
1312 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1313 copy = gimple_build_omp_master (s1);
1316 case GIMPLE_OMP_ORDERED:
1317 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1318 copy = gimple_build_omp_ordered (s1);
1321 case GIMPLE_OMP_SECTION:
1322 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1323 copy = gimple_build_omp_section (s1);
1326 case GIMPLE_OMP_SECTIONS:
1327 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1328 copy = gimple_build_omp_sections
1329 (s1, gimple_omp_sections_clauses (stmt));
1332 case GIMPLE_OMP_SINGLE:
1333 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1334 copy = gimple_build_omp_single
1335 (s1, gimple_omp_single_clauses (stmt));
1338 case GIMPLE_OMP_CRITICAL:
1339 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1341 = gimple_build_omp_critical (s1, gimple_omp_critical_name (stmt));
1350 if (gimple_assign_copy_p (stmt)
1351 && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt)
1352 && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn))
1354 /* Here we handle statements that are not completely rewritten.
1355 First we detect some inlining-induced bogosities for
1358 /* Some assignments VAR = VAR; don't generate any rtl code
1359 and thus don't count as variable modification. Avoid
1360 keeping bogosities like 0 = 0. */
1361 tree decl = gimple_assign_lhs (stmt), value;
1364 n = (tree *) pointer_map_contains (id->decl_map, decl);
1368 STRIP_TYPE_NOPS (value);
1369 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1370 return gimple_build_nop ();
1374 if (gimple_debug_bind_p (stmt))
1376 copy = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt),
1377 gimple_debug_bind_get_value (stmt),
1379 VEC_safe_push (gimple, heap, id->debug_stmts, copy);
1383 /* Create a new deep copy of the statement. */
1384 copy = gimple_copy (stmt);
1386 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1387 RESX and EH_DISPATCH. */
1389 switch (gimple_code (copy))
1393 tree r, fndecl = gimple_call_fndecl (copy);
1394 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
1395 switch (DECL_FUNCTION_CODE (fndecl))
1397 case BUILT_IN_EH_COPY_VALUES:
1398 r = gimple_call_arg (copy, 1);
1399 r = remap_eh_region_tree_nr (r, id);
1400 gimple_call_set_arg (copy, 1, r);
1403 case BUILT_IN_EH_POINTER:
1404 case BUILT_IN_EH_FILTER:
1405 r = gimple_call_arg (copy, 0);
1406 r = remap_eh_region_tree_nr (r, id);
1407 gimple_call_set_arg (copy, 0, r);
1414 /* Reset alias info if we didn't apply measures to
1415 keep it valid over inlining by setting DECL_PT_UID. */
1416 if (!id->src_cfun->gimple_df
1417 || !id->src_cfun->gimple_df->ipa_pta)
1418 gimple_call_reset_alias_info (copy);
1424 int r = gimple_resx_region (copy);
1425 r = remap_eh_region_nr (r, id);
1426 gimple_resx_set_region (copy, r);
1430 case GIMPLE_EH_DISPATCH:
1432 int r = gimple_eh_dispatch_region (copy);
1433 r = remap_eh_region_nr (r, id);
1434 gimple_eh_dispatch_set_region (copy, r);
1443 /* If STMT has a block defined, map it to the newly constructed
1444 block. When inlining we want statements without a block to
1445 appear in the block of the function call. */
1446 new_block = id->block;
1447 if (gimple_block (copy))
1450 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (copy));
1455 gimple_set_block (copy, new_block);
1457 if (gimple_debug_bind_p (copy))
1460 /* Remap all the operands in COPY. */
1461 memset (&wi, 0, sizeof (wi));
1464 walk_tree (gimple_op_ptr (copy, 1), remap_gimple_op_r, &wi, NULL);
1466 walk_gimple_op (copy, remap_gimple_op_r, &wi);
1468 /* Clear the copied virtual operands. We are not remapping them here
1469 but are going to recreate them from scratch. */
1470 if (gimple_has_mem_ops (copy))
1472 gimple_set_vdef (copy, NULL_TREE);
1473 gimple_set_vuse (copy, NULL_TREE);
1480 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1484 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale,
1485 gcov_type count_scale)
1487 gimple_stmt_iterator gsi, copy_gsi, seq_gsi;
1488 basic_block copy_basic_block;
1493 /* Search for previous copied basic block. */
1496 prev = prev->prev_bb;
1498 /* create_basic_block() will append every new block to
1499 basic_block_info automatically. */
1500 copy_basic_block = create_basic_block (NULL, (void *) 0,
1501 (basic_block) prev->aux);
1502 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
1504 /* We are going to rebuild frequencies from scratch. These values
1505 have just small importance to drive canonicalize_loop_headers. */
1506 freq = ((gcov_type)bb->frequency * frequency_scale / REG_BR_PROB_BASE);
1508 /* We recompute frequencies after inlining, so this is quite safe. */
1509 if (freq > BB_FREQ_MAX)
1511 copy_basic_block->frequency = freq;
1513 copy_gsi = gsi_start_bb (copy_basic_block);
1515 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1517 gimple stmt = gsi_stmt (gsi);
1518 gimple orig_stmt = stmt;
1520 id->regimplify = false;
1521 stmt = remap_gimple_stmt (stmt, id);
1522 if (gimple_nop_p (stmt))
1525 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
1528 /* With return slot optimization we can end up with
1529 non-gimple (foo *)&this->m, fix that here. */
1530 if (is_gimple_assign (stmt)
1531 && gimple_assign_rhs_code (stmt) == NOP_EXPR
1532 && !is_gimple_val (gimple_assign_rhs1 (stmt)))
1535 new_rhs = force_gimple_operand_gsi (&seq_gsi,
1536 gimple_assign_rhs1 (stmt),
1537 true, NULL, false, GSI_NEW_STMT);
1538 gimple_assign_set_rhs1 (stmt, new_rhs);
1539 id->regimplify = false;
1542 gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT);
1545 gimple_regimplify_operands (stmt, &seq_gsi);
1547 /* If copy_basic_block has been empty at the start of this iteration,
1548 call gsi_start_bb again to get at the newly added statements. */
1549 if (gsi_end_p (copy_gsi))
1550 copy_gsi = gsi_start_bb (copy_basic_block);
1552 gsi_next (©_gsi);
1554 /* Process the new statement. The call to gimple_regimplify_operands
1555 possibly turned the statement into multiple statements, we
1556 need to process all of them. */
1561 stmt = gsi_stmt (copy_gsi);
1562 if (is_gimple_call (stmt)
1563 && gimple_call_va_arg_pack_p (stmt)
1566 /* __builtin_va_arg_pack () should be replaced by
1567 all arguments corresponding to ... in the caller. */
1570 VEC(tree, heap) *argarray;
1571 size_t nargs = gimple_call_num_args (id->gimple_call);
1574 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1577 /* Create the new array of arguments. */
1578 n = nargs + gimple_call_num_args (stmt);
1579 argarray = VEC_alloc (tree, heap, n);
1580 VEC_safe_grow (tree, heap, argarray, n);
1582 /* Copy all the arguments before '...' */
1583 memcpy (VEC_address (tree, argarray),
1584 gimple_call_arg_ptr (stmt, 0),
1585 gimple_call_num_args (stmt) * sizeof (tree));
1587 /* Append the arguments passed in '...' */
1588 memcpy (VEC_address(tree, argarray) + gimple_call_num_args (stmt),
1589 gimple_call_arg_ptr (id->gimple_call, 0)
1590 + (gimple_call_num_args (id->gimple_call) - nargs),
1591 nargs * sizeof (tree));
1593 new_call = gimple_build_call_vec (gimple_call_fn (stmt),
1596 VEC_free (tree, heap, argarray);
1598 /* Copy all GIMPLE_CALL flags, location and block, except
1599 GF_CALL_VA_ARG_PACK. */
1600 gimple_call_copy_flags (new_call, stmt);
1601 gimple_call_set_va_arg_pack (new_call, false);
1602 gimple_set_location (new_call, gimple_location (stmt));
1603 gimple_set_block (new_call, gimple_block (stmt));
1604 gimple_call_set_lhs (new_call, gimple_call_lhs (stmt));
1606 gsi_replace (©_gsi, new_call, false);
1607 gimple_set_bb (stmt, NULL);
1610 else if (is_gimple_call (stmt)
1612 && (decl = gimple_call_fndecl (stmt))
1613 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1614 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN)
1616 /* __builtin_va_arg_pack_len () should be replaced by
1617 the number of anonymous arguments. */
1618 size_t nargs = gimple_call_num_args (id->gimple_call);
1622 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1625 count = build_int_cst (integer_type_node, nargs);
1626 new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count);
1627 gsi_replace (©_gsi, new_stmt, false);
1631 /* Statements produced by inlining can be unfolded, especially
1632 when we constant propagated some operands. We can't fold
1633 them right now for two reasons:
1634 1) folding require SSA_NAME_DEF_STMTs to be correct
1635 2) we can't change function calls to builtins.
1636 So we just mark statement for later folding. We mark
1637 all new statements, instead just statements that has changed
1638 by some nontrivial substitution so even statements made
1639 foldable indirectly are updated. If this turns out to be
1640 expensive, copy_body can be told to watch for nontrivial
1642 if (id->statements_to_fold)
1643 pointer_set_insert (id->statements_to_fold, stmt);
1645 /* We're duplicating a CALL_EXPR. Find any corresponding
1646 callgraph edges and update or duplicate them. */
1647 if (is_gimple_call (stmt))
1649 struct cgraph_edge *edge;
1652 switch (id->transform_call_graph_edges)
1654 case CB_CGE_DUPLICATE:
1655 edge = cgraph_edge (id->src_node, orig_stmt);
1658 int edge_freq = edge->frequency;
1659 edge = cgraph_clone_edge (edge, id->dst_node, stmt,
1661 REG_BR_PROB_BASE, CGRAPH_FREQ_BASE,
1662 edge->frequency, true);
1663 /* We could also just rescale the frequency, but
1664 doing so would introduce roundoff errors and make
1665 verifier unhappy. */
1667 = compute_call_stmt_bb_frequency (id->dst_node->decl,
1670 && profile_status_for_function (cfun) != PROFILE_ABSENT
1671 && (edge_freq > edge->frequency + 10
1672 || edge_freq < edge->frequency - 10))
1674 fprintf (dump_file, "Edge frequency estimated by "
1675 "cgraph %i diverge from inliner's estimate %i\n",
1679 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1682 copy_basic_block->frequency);
1684 stmt = cgraph_redirect_edge_call_stmt_to_callee (edge);
1688 case CB_CGE_MOVE_CLONES:
1689 cgraph_set_call_stmt_including_clones (id->dst_node,
1691 edge = cgraph_edge (id->dst_node, stmt);
1695 edge = cgraph_edge (id->dst_node, orig_stmt);
1697 cgraph_set_call_stmt (edge, stmt);
1704 /* Constant propagation on argument done during inlining
1705 may create new direct call. Produce an edge for it. */
1707 || (edge->indirect_inlining_edge
1708 && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES))
1709 && (fn = gimple_call_fndecl (stmt)) != NULL)
1711 struct cgraph_node *dest = cgraph_node (fn);
1713 /* We have missing edge in the callgraph. This can happen
1714 when previous inlining turned an indirect call into a
1715 direct call by constant propagating arguments or we are
1716 producing dead clone (for further clonning). In all
1717 other cases we hit a bug (incorrect node sharing is the
1718 most common reason for missing edges). */
1719 gcc_assert (dest->needed || !dest->analyzed
1720 || dest->address_taken
1721 || !id->src_node->analyzed);
1722 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)
1723 cgraph_create_edge_including_clones
1724 (id->dst_node, dest, orig_stmt, stmt, bb->count,
1725 compute_call_stmt_bb_frequency (id->dst_node->decl,
1727 bb->loop_depth, CIF_ORIGINALLY_INDIRECT_CALL);
1729 cgraph_create_edge (id->dst_node, dest, stmt,
1731 compute_call_stmt_bb_frequency
1732 (id->dst_node->decl, copy_basic_block),
1733 bb->loop_depth)->inline_failed
1734 = CIF_ORIGINALLY_INDIRECT_CALL;
1737 fprintf (dump_file, "Created new direct edge to %s\n",
1738 cgraph_node_name (dest));
1742 flags = gimple_call_flags (stmt);
1743 if (flags & ECF_MAY_BE_ALLOCA)
1744 cfun->calls_alloca = true;
1745 if (flags & ECF_RETURNS_TWICE)
1746 cfun->calls_setjmp = true;
1749 maybe_duplicate_eh_stmt_fn (cfun, stmt, id->src_cfun, orig_stmt,
1750 id->eh_map, id->eh_lp_nr);
1752 if (gimple_in_ssa_p (cfun) && !is_gimple_debug (stmt))
1757 find_new_referenced_vars (gsi_stmt (copy_gsi));
1758 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1759 if (TREE_CODE (def) == SSA_NAME)
1760 SSA_NAME_DEF_STMT (def) = stmt;
1763 gsi_next (©_gsi);
1765 while (!gsi_end_p (copy_gsi));
1767 copy_gsi = gsi_last_bb (copy_basic_block);
1770 return copy_basic_block;
1773 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1774 form is quite easy, since dominator relationship for old basic blocks does
1777 There is however exception where inlining might change dominator relation
1778 across EH edges from basic block within inlined functions destinating
1779 to landing pads in function we inline into.
1781 The function fills in PHI_RESULTs of such PHI nodes if they refer
1782 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1783 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1784 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1785 set, and this means that there will be no overlapping live ranges
1786 for the underlying symbol.
1788 This might change in future if we allow redirecting of EH edges and
1789 we might want to change way build CFG pre-inlining to include
1790 all the possible edges then. */
1792 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1793 bool can_throw, bool nonlocal_goto)
1798 FOR_EACH_EDGE (e, ei, bb->succs)
1800 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1803 gimple_stmt_iterator si;
1806 gcc_assert (e->flags & EDGE_EH);
1809 gcc_assert (!(e->flags & EDGE_EH));
1811 for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
1815 phi = gsi_stmt (si);
1817 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1818 gcc_assert (!e->dest->aux);
1820 gcc_assert ((e->flags & EDGE_EH)
1821 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
1823 if (!is_gimple_reg (PHI_RESULT (phi)))
1825 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi)));
1829 re = find_edge (ret_bb, e->dest);
1831 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1832 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1834 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1835 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1841 /* Copy edges from BB into its copy constructed earlier, scale profile
1842 accordingly. Edges will be taken care of later. Assume aux
1843 pointers to point to the copies of each BB. Return true if any
1844 debug stmts are left after a statement that must end the basic block. */
1847 copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb)
1849 basic_block new_bb = (basic_block) bb->aux;
1852 gimple_stmt_iterator si;
1854 bool need_debug_cleanup = false;
1856 /* Use the indices from the original blocks to create edges for the
1858 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1859 if (!(old_edge->flags & EDGE_EH))
1863 flags = old_edge->flags;
1865 /* Return edges do get a FALLTHRU flag when the get inlined. */
1866 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1867 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1868 flags |= EDGE_FALLTHRU;
1869 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1870 new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1871 new_edge->probability = old_edge->probability;
1874 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1877 for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
1880 bool can_throw, nonlocal_goto;
1882 copy_stmt = gsi_stmt (si);
1883 if (!is_gimple_debug (copy_stmt))
1885 update_stmt (copy_stmt);
1886 if (gimple_in_ssa_p (cfun))
1887 mark_symbols_for_renaming (copy_stmt);
1890 /* Do this before the possible split_block. */
1893 /* If this tree could throw an exception, there are two
1894 cases where we need to add abnormal edge(s): the
1895 tree wasn't in a region and there is a "current
1896 region" in the caller; or the original tree had
1897 EH edges. In both cases split the block after the tree,
1898 and add abnormal edge(s) as needed; we need both
1899 those from the callee and the caller.
1900 We check whether the copy can throw, because the const
1901 propagation can change an INDIRECT_REF which throws
1902 into a COMPONENT_REF which doesn't. If the copy
1903 can throw, the original could also throw. */
1904 can_throw = stmt_can_throw_internal (copy_stmt);
1905 nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt);
1907 if (can_throw || nonlocal_goto)
1909 if (!gsi_end_p (si))
1911 while (!gsi_end_p (si) && is_gimple_debug (gsi_stmt (si)))
1914 need_debug_cleanup = true;
1916 if (!gsi_end_p (si))
1917 /* Note that bb's predecessor edges aren't necessarily
1918 right at this point; split_block doesn't care. */
1920 edge e = split_block (new_bb, copy_stmt);
1923 new_bb->aux = e->src->aux;
1924 si = gsi_start_bb (new_bb);
1928 if (gimple_code (copy_stmt) == GIMPLE_EH_DISPATCH)
1929 make_eh_dispatch_edges (copy_stmt);
1931 make_eh_edges (copy_stmt);
1934 make_abnormal_goto_edges (gimple_bb (copy_stmt), true);
1936 if ((can_throw || nonlocal_goto)
1937 && gimple_in_ssa_p (cfun))
1938 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
1939 can_throw, nonlocal_goto);
1941 return need_debug_cleanup;
1944 /* Copy the PHIs. All blocks and edges are copied, some blocks
1945 was possibly split and new outgoing EH edges inserted.
1946 BB points to the block of original function and AUX pointers links
1947 the original and newly copied blocks. */
1950 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1952 basic_block const new_bb = (basic_block) bb->aux;
1955 gimple_stmt_iterator si;
1957 for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si))
1963 phi = gsi_stmt (si);
1964 res = PHI_RESULT (phi);
1966 if (is_gimple_reg (res))
1968 walk_tree (&new_res, copy_tree_body_r, id, NULL);
1969 SSA_NAME_DEF_STMT (new_res)
1970 = new_phi = create_phi_node (new_res, new_bb);
1971 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1974 = find_edge ((basic_block) new_edge->src->aux, bb);
1975 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1977 tree block = id->block;
1978 id->block = NULL_TREE;
1979 walk_tree (&new_arg, copy_tree_body_r, id, NULL);
1981 gcc_assert (new_arg);
1982 /* With return slot optimization we can end up with
1983 non-gimple (foo *)&this->m, fix that here. */
1984 if (TREE_CODE (new_arg) != SSA_NAME
1985 && TREE_CODE (new_arg) != FUNCTION_DECL
1986 && !is_gimple_val (new_arg))
1988 gimple_seq stmts = NULL;
1989 new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
1990 gsi_insert_seq_on_edge_immediate (new_edge, stmts);
1992 add_phi_arg (new_phi, new_arg, new_edge,
1993 gimple_phi_arg_location_from_edge (phi, old_edge));
2000 /* Wrapper for remap_decl so it can be used as a callback. */
2003 remap_decl_1 (tree decl, void *data)
2005 return remap_decl (decl, (copy_body_data *) data);
2008 /* Build struct function and associated datastructures for the new clone
2009 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
2012 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count)
2014 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2015 gcov_type count_scale;
2017 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
2018 count_scale = (REG_BR_PROB_BASE * count
2019 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
2021 count_scale = REG_BR_PROB_BASE;
2023 /* Register specific tree functions. */
2024 gimple_register_cfg_hooks ();
2026 /* Get clean struct function. */
2027 push_struct_function (new_fndecl);
2029 /* We will rebuild these, so just sanity check that they are empty. */
2030 gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
2031 gcc_assert (cfun->local_decls == NULL);
2032 gcc_assert (cfun->cfg == NULL);
2033 gcc_assert (cfun->decl == new_fndecl);
2035 /* Copy items we preserve during clonning. */
2036 cfun->static_chain_decl = src_cfun->static_chain_decl;
2037 cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
2038 cfun->function_end_locus = src_cfun->function_end_locus;
2039 cfun->curr_properties = src_cfun->curr_properties;
2040 cfun->last_verified = src_cfun->last_verified;
2041 cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
2042 cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
2043 cfun->has_nonlocal_label = src_cfun->has_nonlocal_label;
2044 cfun->stdarg = src_cfun->stdarg;
2045 cfun->dont_save_pending_sizes_p = src_cfun->dont_save_pending_sizes_p;
2046 cfun->after_inlining = src_cfun->after_inlining;
2047 cfun->can_throw_non_call_exceptions
2048 = src_cfun->can_throw_non_call_exceptions;
2049 cfun->returns_struct = src_cfun->returns_struct;
2050 cfun->returns_pcc_struct = src_cfun->returns_pcc_struct;
2051 cfun->after_tree_profile = src_cfun->after_tree_profile;
2053 init_empty_tree_cfg ();
2055 profile_status_for_function (cfun) = profile_status_for_function (src_cfun);
2056 ENTRY_BLOCK_PTR->count =
2057 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2059 ENTRY_BLOCK_PTR->frequency
2060 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2061 EXIT_BLOCK_PTR->count =
2062 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2064 EXIT_BLOCK_PTR->frequency =
2065 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2067 init_eh_for_function ();
2069 if (src_cfun->gimple_df)
2071 init_tree_ssa (cfun);
2072 cfun->gimple_df->in_ssa_p = true;
2073 init_ssa_operands ();
2078 /* Helper function for copy_cfg_body. Move debug stmts from the end
2079 of NEW_BB to the beginning of successor basic blocks when needed. If the
2080 successor has multiple predecessors, reset them, otherwise keep
2084 maybe_move_debug_stmts_to_successors (copy_body_data *id, basic_block new_bb)
2088 gimple_stmt_iterator si = gsi_last_nondebug_bb (new_bb);
2091 || gsi_one_before_end_p (si)
2092 || !(stmt_can_throw_internal (gsi_stmt (si))
2093 || stmt_can_make_abnormal_goto (gsi_stmt (si))))
2096 FOR_EACH_EDGE (e, ei, new_bb->succs)
2098 gimple_stmt_iterator ssi = gsi_last_bb (new_bb);
2099 gimple_stmt_iterator dsi = gsi_after_labels (e->dest);
2100 while (is_gimple_debug (gsi_stmt (ssi)))
2102 gimple stmt = gsi_stmt (ssi), new_stmt;
2106 /* For the last edge move the debug stmts instead of copying
2108 if (ei_one_before_end_p (ei))
2112 if (!single_pred_p (e->dest))
2113 gimple_debug_bind_reset_value (stmt);
2114 gsi_remove (&si, false);
2115 gsi_insert_before (&dsi, stmt, GSI_SAME_STMT);
2119 var = gimple_debug_bind_get_var (stmt);
2120 if (single_pred_p (e->dest))
2122 value = gimple_debug_bind_get_value (stmt);
2123 value = unshare_expr (value);
2127 new_stmt = gimple_build_debug_bind (var, value, stmt);
2128 gsi_insert_before (&dsi, new_stmt, GSI_SAME_STMT);
2129 VEC_safe_push (gimple, heap, id->debug_stmts, new_stmt);
2135 /* Make a copy of the body of FN so that it can be inserted inline in
2136 another function. Walks FN via CFG, returns new fndecl. */
2139 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency_scale,
2140 basic_block entry_block_map, basic_block exit_block_map,
2141 bitmap blocks_to_copy, basic_block new_entry)
2143 tree callee_fndecl = id->src_fn;
2144 /* Original cfun for the callee, doesn't change. */
2145 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2146 struct function *cfun_to_copy;
2148 tree new_fndecl = NULL;
2149 bool need_debug_cleanup = false;
2150 gcov_type count_scale;
2153 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
2154 count_scale = (REG_BR_PROB_BASE * count
2155 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
2157 count_scale = REG_BR_PROB_BASE;
2159 /* Register specific tree functions. */
2160 gimple_register_cfg_hooks ();
2162 /* Must have a CFG here at this point. */
2163 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2164 (DECL_STRUCT_FUNCTION (callee_fndecl)));
2166 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2168 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
2169 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
2170 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2171 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2173 /* Duplicate any exception-handling regions. */
2175 id->eh_map = duplicate_eh_regions (cfun_to_copy, NULL, id->eh_lp_nr,
2178 /* Use aux pointers to map the original blocks to copy. */
2179 FOR_EACH_BB_FN (bb, cfun_to_copy)
2180 if (!blocks_to_copy || bitmap_bit_p (blocks_to_copy, bb->index))
2182 basic_block new_bb = copy_bb (id, bb, frequency_scale, count_scale);
2187 last = last_basic_block;
2189 /* Now that we've duplicated the blocks, duplicate their edges. */
2190 FOR_ALL_BB_FN (bb, cfun_to_copy)
2192 || (bb->index > 0 && bitmap_bit_p (blocks_to_copy, bb->index)))
2193 need_debug_cleanup |= copy_edges_for_bb (bb, count_scale, exit_block_map);
2195 if (gimple_in_ssa_p (cfun))
2196 FOR_ALL_BB_FN (bb, cfun_to_copy)
2198 || (bb->index > 0 && bitmap_bit_p (blocks_to_copy, bb->index)))
2199 copy_phis_for_bb (bb, id);
2204 e = make_edge (entry_block_map, (basic_block)new_entry->aux, EDGE_FALLTHRU);
2205 e->probability = REG_BR_PROB_BASE;
2206 e->count = entry_block_map->count;
2209 FOR_ALL_BB_FN (bb, cfun_to_copy)
2212 if (need_debug_cleanup
2213 && bb->index != ENTRY_BLOCK
2214 && bb->index != EXIT_BLOCK)
2215 maybe_move_debug_stmts_to_successors (id, (basic_block) bb->aux);
2216 ((basic_block)bb->aux)->aux = NULL;
2220 /* Zero out AUX fields of newly created block during EH edge
2222 for (; last < last_basic_block; last++)
2224 if (need_debug_cleanup)
2225 maybe_move_debug_stmts_to_successors (id, BASIC_BLOCK (last));
2226 BASIC_BLOCK (last)->aux = NULL;
2228 entry_block_map->aux = NULL;
2229 exit_block_map->aux = NULL;
2233 pointer_map_destroy (id->eh_map);
2240 /* Copy the debug STMT using ID. We deal with these statements in a
2241 special way: if any variable in their VALUE expression wasn't
2242 remapped yet, we won't remap it, because that would get decl uids
2243 out of sync, causing codegen differences between -g and -g0. If
2244 this arises, we drop the VALUE expression altogether. */
2247 copy_debug_stmt (gimple stmt, copy_body_data *id)
2250 struct walk_stmt_info wi;
2253 if (gimple_block (stmt))
2256 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (stmt));
2260 gimple_set_block (stmt, t);
2262 /* Remap all the operands in COPY. */
2263 memset (&wi, 0, sizeof (wi));
2266 processing_debug_stmt = 1;
2268 t = gimple_debug_bind_get_var (stmt);
2270 if (TREE_CODE (t) == PARM_DECL && id->debug_map
2271 && (n = (tree *) pointer_map_contains (id->debug_map, t)))
2273 gcc_assert (TREE_CODE (*n) == VAR_DECL);
2276 else if (TREE_CODE (t) == VAR_DECL
2278 && gimple_in_ssa_p (cfun)
2279 && !pointer_map_contains (id->decl_map, t)
2281 /* T is a non-localized variable. */;
2283 walk_tree (&t, remap_gimple_op_r, &wi, NULL);
2285 gimple_debug_bind_set_var (stmt, t);
2287 if (gimple_debug_bind_has_value_p (stmt))
2288 walk_tree (gimple_debug_bind_get_value_ptr (stmt),
2289 remap_gimple_op_r, &wi, NULL);
2291 /* Punt if any decl couldn't be remapped. */
2292 if (processing_debug_stmt < 0)
2293 gimple_debug_bind_reset_value (stmt);
2295 processing_debug_stmt = 0;
2298 if (gimple_in_ssa_p (cfun))
2299 mark_symbols_for_renaming (stmt);
2302 /* Process deferred debug stmts. In order to give values better odds
2303 of being successfully remapped, we delay the processing of debug
2304 stmts until all other stmts that might require remapping are
2308 copy_debug_stmts (copy_body_data *id)
2313 if (!id->debug_stmts)
2316 for (i = 0; VEC_iterate (gimple, id->debug_stmts, i, stmt); i++)
2317 copy_debug_stmt (stmt, id);
2319 VEC_free (gimple, heap, id->debug_stmts);
2322 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2323 another function. */
2326 copy_tree_body (copy_body_data *id)
2328 tree fndecl = id->src_fn;
2329 tree body = DECL_SAVED_TREE (fndecl);
2331 walk_tree (&body, copy_tree_body_r, id, NULL);
2336 /* Make a copy of the body of FN so that it can be inserted inline in
2337 another function. */
2340 copy_body (copy_body_data *id, gcov_type count, int frequency_scale,
2341 basic_block entry_block_map, basic_block exit_block_map,
2342 bitmap blocks_to_copy, basic_block new_entry)
2344 tree fndecl = id->src_fn;
2347 /* If this body has a CFG, walk CFG and copy. */
2348 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
2349 body = copy_cfg_body (id, count, frequency_scale, entry_block_map, exit_block_map,
2350 blocks_to_copy, new_entry);
2351 copy_debug_stmts (id);
2356 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2357 defined in function FN, or of a data member thereof. */
2360 self_inlining_addr_expr (tree value, tree fn)
2364 if (TREE_CODE (value) != ADDR_EXPR)
2367 var = get_base_address (TREE_OPERAND (value, 0));
2369 return var && auto_var_in_fn_p (var, fn);
2372 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2373 lexical block and line number information from base_stmt, if given,
2374 or from the last stmt of the block otherwise. */
2377 insert_init_debug_bind (copy_body_data *id,
2378 basic_block bb, tree var, tree value,
2382 gimple_stmt_iterator gsi;
2385 if (!gimple_in_ssa_p (id->src_cfun))
2388 if (!MAY_HAVE_DEBUG_STMTS)
2391 tracked_var = target_for_debug_bind (var);
2397 gsi = gsi_last_bb (bb);
2398 if (!base_stmt && !gsi_end_p (gsi))
2399 base_stmt = gsi_stmt (gsi);
2402 note = gimple_build_debug_bind (tracked_var, value, base_stmt);
2406 if (!gsi_end_p (gsi))
2407 gsi_insert_after (&gsi, note, GSI_SAME_STMT);
2409 gsi_insert_before (&gsi, note, GSI_SAME_STMT);
2416 insert_init_stmt (copy_body_data *id, basic_block bb, gimple init_stmt)
2418 /* If VAR represents a zero-sized variable, it's possible that the
2419 assignment statement may result in no gimple statements. */
2422 gimple_stmt_iterator si = gsi_last_bb (bb);
2424 /* We can end up with init statements that store to a non-register
2425 from a rhs with a conversion. Handle that here by forcing the
2426 rhs into a temporary. gimple_regimplify_operands is not
2427 prepared to do this for us. */
2428 if (!is_gimple_debug (init_stmt)
2429 && !is_gimple_reg (gimple_assign_lhs (init_stmt))
2430 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt)))
2431 && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS)
2433 tree rhs = build1 (gimple_assign_rhs_code (init_stmt),
2434 gimple_expr_type (init_stmt),
2435 gimple_assign_rhs1 (init_stmt));
2436 rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false,
2438 gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs));
2439 gimple_assign_set_rhs1 (init_stmt, rhs);
2441 gsi_insert_after (&si, init_stmt, GSI_NEW_STMT);
2442 gimple_regimplify_operands (init_stmt, &si);
2443 mark_symbols_for_renaming (init_stmt);
2445 if (!is_gimple_debug (init_stmt) && MAY_HAVE_DEBUG_STMTS)
2447 tree var, def = gimple_assign_lhs (init_stmt);
2449 if (TREE_CODE (def) == SSA_NAME)
2450 var = SSA_NAME_VAR (def);
2454 insert_init_debug_bind (id, bb, var, def, init_stmt);
2459 /* Initialize parameter P with VALUE. If needed, produce init statement
2460 at the end of BB. When BB is NULL, we return init statement to be
2463 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
2464 basic_block bb, tree *vars)
2466 gimple init_stmt = NULL;
2469 tree def = (gimple_in_ssa_p (cfun)
2470 ? gimple_default_def (id->src_cfun, p) : NULL);
2473 && value != error_mark_node
2474 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
2476 if (fold_convertible_p (TREE_TYPE (p), value))
2477 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
2479 /* ??? For valid (GIMPLE) programs we should not end up here.
2480 Still if something has gone wrong and we end up with truly
2481 mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2482 to not leak invalid GIMPLE to the following passes. */
2483 rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value);
2486 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2487 here since the type of this decl must be visible to the calling
2489 var = copy_decl_to_var (p, id);
2491 /* We're actually using the newly-created var. */
2492 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
2495 add_referenced_var (var);
2498 /* Declare this new variable. */
2499 TREE_CHAIN (var) = *vars;
2502 /* Make gimplifier happy about this variable. */
2503 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2505 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2506 we would not need to create a new variable here at all, if it
2507 weren't for debug info. Still, we can just use the argument
2509 if (TREE_READONLY (p)
2510 && !TREE_ADDRESSABLE (p)
2511 && value && !TREE_SIDE_EFFECTS (value)
2514 /* We may produce non-gimple trees by adding NOPs or introduce
2515 invalid sharing when operand is not really constant.
2516 It is not big deal to prohibit constant propagation here as
2517 we will constant propagate in DOM1 pass anyway. */
2518 if (is_gimple_min_invariant (value)
2519 && useless_type_conversion_p (TREE_TYPE (p),
2521 /* We have to be very careful about ADDR_EXPR. Make sure
2522 the base variable isn't a local variable of the inlined
2523 function, e.g., when doing recursive inlining, direct or
2524 mutually-recursive or whatever, which is why we don't
2525 just test whether fn == current_function_decl. */
2526 && ! self_inlining_addr_expr (value, fn))
2528 insert_decl_map (id, p, value);
2529 insert_debug_decl_map (id, p, var);
2530 return insert_init_debug_bind (id, bb, var, value, NULL);
2534 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2535 that way, when the PARM_DECL is encountered, it will be
2536 automatically replaced by the VAR_DECL. */
2537 insert_decl_map (id, p, var);
2539 /* Even if P was TREE_READONLY, the new VAR should not be.
2540 In the original code, we would have constructed a
2541 temporary, and then the function body would have never
2542 changed the value of P. However, now, we will be
2543 constructing VAR directly. The constructor body may
2544 change its value multiple times as it is being
2545 constructed. Therefore, it must not be TREE_READONLY;
2546 the back-end assumes that TREE_READONLY variable is
2547 assigned to only once. */
2548 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
2549 TREE_READONLY (var) = 0;
2551 /* If there is no setup required and we are in SSA, take the easy route
2552 replacing all SSA names representing the function parameter by the
2553 SSA name passed to function.
2555 We need to construct map for the variable anyway as it might be used
2556 in different SSA names when parameter is set in function.
2558 Do replacement at -O0 for const arguments replaced by constant.
2559 This is important for builtin_constant_p and other construct requiring
2560 constant argument to be visible in inlined function body. */
2561 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
2563 || (TREE_READONLY (p)
2564 && is_gimple_min_invariant (rhs)))
2565 && (TREE_CODE (rhs) == SSA_NAME
2566 || is_gimple_min_invariant (rhs))
2567 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
2569 insert_decl_map (id, def, rhs);
2570 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2573 /* If the value of argument is never used, don't care about initializing
2575 if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
2577 gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
2578 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2581 /* Initialize this VAR_DECL from the equivalent argument. Convert
2582 the argument to the proper type in case it was promoted. */
2585 if (rhs == error_mark_node)
2587 insert_decl_map (id, p, var);
2588 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2591 STRIP_USELESS_TYPE_CONVERSION (rhs);
2593 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2594 keep our trees in gimple form. */
2595 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
2597 def = remap_ssa_name (def, id);
2598 init_stmt = gimple_build_assign (def, rhs);
2599 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
2600 set_default_def (var, NULL);
2603 init_stmt = gimple_build_assign (var, rhs);
2605 if (bb && init_stmt)
2606 insert_init_stmt (id, bb, init_stmt);
2611 /* Generate code to initialize the parameters of the function at the
2612 top of the stack in ID from the GIMPLE_CALL STMT. */
2615 initialize_inlined_parameters (copy_body_data *id, gimple stmt,
2616 tree fn, basic_block bb)
2621 tree vars = NULL_TREE;
2622 tree static_chain = gimple_call_chain (stmt);
2624 /* Figure out what the parameters are. */
2625 parms = DECL_ARGUMENTS (fn);
2627 /* Loop through the parameter declarations, replacing each with an
2628 equivalent VAR_DECL, appropriately initialized. */
2629 for (p = parms, i = 0; p; p = TREE_CHAIN (p), i++)
2632 val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL;
2633 setup_one_parameter (id, p, val, fn, bb, &vars);
2636 /* Initialize the static chain. */
2637 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
2638 gcc_assert (fn != current_function_decl);
2641 /* No static chain? Seems like a bug in tree-nested.c. */
2642 gcc_assert (static_chain);
2644 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
2647 declare_inline_vars (id->block, vars);
2651 /* Declare a return variable to replace the RESULT_DECL for the
2652 function we are calling. An appropriate DECL_STMT is returned.
2653 The USE_STMT is filled to contain a use of the declaration to
2654 indicate the return value of the function.
2656 RETURN_SLOT, if non-null is place where to store the result. It
2657 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2658 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2660 The return value is a (possibly null) value that holds the result
2661 as seen by the caller. */
2664 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest)
2666 tree callee = id->src_fn;
2667 tree caller = id->dst_fn;
2668 tree result = DECL_RESULT (callee);
2669 tree callee_type = TREE_TYPE (result);
2673 /* Handle type-mismatches in the function declaration return type
2674 vs. the call expression. */
2676 caller_type = TREE_TYPE (modify_dest);
2678 caller_type = TREE_TYPE (TREE_TYPE (callee));
2680 /* We don't need to do anything for functions that don't return
2682 if (!result || VOID_TYPE_P (callee_type))
2685 /* If there was a return slot, then the return value is the
2686 dereferenced address of that object. */
2689 /* The front end shouldn't have used both return_slot and
2690 a modify expression. */
2691 gcc_assert (!modify_dest);
2692 if (DECL_BY_REFERENCE (result))
2694 tree return_slot_addr = build_fold_addr_expr (return_slot);
2695 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
2697 /* We are going to construct *&return_slot and we can't do that
2698 for variables believed to be not addressable.
2700 FIXME: This check possibly can match, because values returned
2701 via return slot optimization are not believed to have address
2702 taken by alias analysis. */
2703 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
2704 var = return_slot_addr;
2709 gcc_assert (TREE_CODE (var) != SSA_NAME);
2710 TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
2712 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2713 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2714 && !DECL_GIMPLE_REG_P (result)
2716 DECL_GIMPLE_REG_P (var) = 0;
2721 /* All types requiring non-trivial constructors should have been handled. */
2722 gcc_assert (!TREE_ADDRESSABLE (callee_type));
2724 /* Attempt to avoid creating a new temporary variable. */
2726 && TREE_CODE (modify_dest) != SSA_NAME)
2728 bool use_it = false;
2730 /* We can't use MODIFY_DEST if there's type promotion involved. */
2731 if (!useless_type_conversion_p (callee_type, caller_type))
2734 /* ??? If we're assigning to a variable sized type, then we must
2735 reuse the destination variable, because we've no good way to
2736 create variable sized temporaries at this point. */
2737 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
2740 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2741 reuse it as the result of the call directly. Don't do this if
2742 it would promote MODIFY_DEST to addressable. */
2743 else if (TREE_ADDRESSABLE (result))
2747 tree base_m = get_base_address (modify_dest);
2749 /* If the base isn't a decl, then it's a pointer, and we don't
2750 know where that's going to go. */
2751 if (!DECL_P (base_m))
2753 else if (is_global_var (base_m))
2755 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2756 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2757 && !DECL_GIMPLE_REG_P (result)
2758 && DECL_GIMPLE_REG_P (base_m))
2760 else if (!TREE_ADDRESSABLE (base_m))
2772 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
2774 var = copy_result_decl_to_var (result, id);
2775 if (gimple_in_ssa_p (cfun))
2778 add_referenced_var (var);
2781 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2782 DECL_STRUCT_FUNCTION (caller)->local_decls
2783 = tree_cons (NULL_TREE, var,
2784 DECL_STRUCT_FUNCTION (caller)->local_decls);
2786 /* Do not have the rest of GCC warn about this variable as it should
2787 not be visible to the user. */
2788 TREE_NO_WARNING (var) = 1;
2790 declare_inline_vars (id->block, var);
2792 /* Build the use expr. If the return type of the function was
2793 promoted, convert it back to the expected type. */
2795 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
2796 use = fold_convert (caller_type, var);
2798 STRIP_USELESS_TYPE_CONVERSION (use);
2800 if (DECL_BY_REFERENCE (result))
2802 TREE_ADDRESSABLE (var) = 1;
2803 var = build_fold_addr_expr (var);
2807 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2808 way, when the RESULT_DECL is encountered, it will be
2809 automatically replaced by the VAR_DECL. */
2810 insert_decl_map (id, result, var);
2812 /* Remember this so we can ignore it in remap_decls. */
2818 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2819 to a local label. */
2822 has_label_address_in_static_1 (tree *nodep, int *walk_subtrees, void *fnp)
2825 tree fn = (tree) fnp;
2827 if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
2836 /* Determine if the function can be copied. If so return NULL. If
2837 not return a string describng the reason for failure. */
2840 copy_forbidden (struct function *fun, tree fndecl)
2842 const char *reason = fun->cannot_be_copied_reason;
2845 /* Only examine the function once. */
2846 if (fun->cannot_be_copied_set)
2849 /* We cannot copy a function that receives a non-local goto
2850 because we cannot remap the destination label used in the
2851 function that is performing the non-local goto. */
2852 /* ??? Actually, this should be possible, if we work at it.
2853 No doubt there's just a handful of places that simply
2854 assume it doesn't happen and don't substitute properly. */
2855 if (fun->has_nonlocal_label)
2857 reason = G_("function %q+F can never be copied "
2858 "because it receives a non-local goto");
2862 for (step = fun->local_decls; step; step = TREE_CHAIN (step))
2864 tree decl = TREE_VALUE (step);
2866 if (TREE_CODE (decl) == VAR_DECL
2867 && TREE_STATIC (decl)
2868 && !DECL_EXTERNAL (decl)
2869 && DECL_INITIAL (decl)
2870 && walk_tree_without_duplicates (&DECL_INITIAL (decl),
2871 has_label_address_in_static_1,
2874 reason = G_("function %q+F can never be copied because it saves "
2875 "address of local label in a static variable");
2881 fun->cannot_be_copied_reason = reason;
2882 fun->cannot_be_copied_set = true;
2887 static const char *inline_forbidden_reason;
2889 /* A callback for walk_gimple_seq to handle statements. Returns non-null
2890 iff a function can not be inlined. Also sets the reason why. */
2893 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2894 struct walk_stmt_info *wip)
2896 tree fn = (tree) wip->info;
2898 gimple stmt = gsi_stmt (*gsi);
2900 switch (gimple_code (stmt))
2903 /* Refuse to inline alloca call unless user explicitly forced so as
2904 this may change program's memory overhead drastically when the
2905 function using alloca is called in loop. In GCC present in
2906 SPEC2000 inlining into schedule_block cause it to require 2GB of
2907 RAM instead of 256MB. */
2908 if (gimple_alloca_call_p (stmt)
2909 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
2911 inline_forbidden_reason
2912 = G_("function %q+F can never be inlined because it uses "
2913 "alloca (override using the always_inline attribute)");
2914 *handled_ops_p = true;
2918 t = gimple_call_fndecl (stmt);
2922 /* We cannot inline functions that call setjmp. */
2923 if (setjmp_call_p (t))
2925 inline_forbidden_reason
2926 = G_("function %q+F can never be inlined because it uses setjmp");
2927 *handled_ops_p = true;
2931 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
2932 switch (DECL_FUNCTION_CODE (t))
2934 /* We cannot inline functions that take a variable number of
2936 case BUILT_IN_VA_START:
2937 case BUILT_IN_NEXT_ARG:
2938 case BUILT_IN_VA_END:
2939 inline_forbidden_reason
2940 = G_("function %q+F can never be inlined because it "
2941 "uses variable argument lists");
2942 *handled_ops_p = true;
2945 case BUILT_IN_LONGJMP:
2946 /* We can't inline functions that call __builtin_longjmp at
2947 all. The non-local goto machinery really requires the
2948 destination be in a different function. If we allow the
2949 function calling __builtin_longjmp to be inlined into the
2950 function calling __builtin_setjmp, Things will Go Awry. */
2951 inline_forbidden_reason
2952 = G_("function %q+F can never be inlined because "
2953 "it uses setjmp-longjmp exception handling");
2954 *handled_ops_p = true;
2957 case BUILT_IN_NONLOCAL_GOTO:
2959 inline_forbidden_reason
2960 = G_("function %q+F can never be inlined because "
2961 "it uses non-local goto");
2962 *handled_ops_p = true;
2965 case BUILT_IN_RETURN:
2966 case BUILT_IN_APPLY_ARGS:
2967 /* If a __builtin_apply_args caller would be inlined,
2968 it would be saving arguments of the function it has
2969 been inlined into. Similarly __builtin_return would
2970 return from the function the inline has been inlined into. */
2971 inline_forbidden_reason
2972 = G_("function %q+F can never be inlined because "
2973 "it uses __builtin_return or __builtin_apply_args");
2974 *handled_ops_p = true;
2983 t = gimple_goto_dest (stmt);
2985 /* We will not inline a function which uses computed goto. The
2986 addresses of its local labels, which may be tucked into
2987 global storage, are of course not constant across
2988 instantiations, which causes unexpected behavior. */
2989 if (TREE_CODE (t) != LABEL_DECL)
2991 inline_forbidden_reason
2992 = G_("function %q+F can never be inlined "
2993 "because it contains a computed goto");
2994 *handled_ops_p = true;
3003 *handled_ops_p = false;
3007 /* Return true if FNDECL is a function that cannot be inlined into
3011 inline_forbidden_p (tree fndecl)
3013 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
3014 struct walk_stmt_info wi;
3015 struct pointer_set_t *visited_nodes;
3017 bool forbidden_p = false;
3019 /* First check for shared reasons not to copy the code. */
3020 inline_forbidden_reason = copy_forbidden (fun, fndecl);
3021 if (inline_forbidden_reason != NULL)
3024 /* Next, walk the statements of the function looking for
3025 constraucts we can't handle, or are non-optimal for inlining. */
3026 visited_nodes = pointer_set_create ();
3027 memset (&wi, 0, sizeof (wi));
3028 wi.info = (void *) fndecl;
3029 wi.pset = visited_nodes;
3031 FOR_EACH_BB_FN (bb, fun)
3034 gimple_seq seq = bb_seq (bb);
3035 ret = walk_gimple_seq (seq, inline_forbidden_p_stmt, NULL, &wi);
3036 forbidden_p = (ret != NULL);
3041 pointer_set_destroy (visited_nodes);
3045 /* Return true if CALLEE cannot be inlined into CALLER. */
3048 inline_forbidden_into_p (tree caller, tree callee)
3050 /* Don't inline if the functions have different EH personalities. */
3051 if (DECL_FUNCTION_PERSONALITY (caller)
3052 && DECL_FUNCTION_PERSONALITY (callee)
3053 && (DECL_FUNCTION_PERSONALITY (caller)
3054 != DECL_FUNCTION_PERSONALITY (callee)))
3057 /* Don't inline if the callee can throw non-call exceptions but the
3059 if (DECL_STRUCT_FUNCTION (callee)
3060 && DECL_STRUCT_FUNCTION (callee)->can_throw_non_call_exceptions
3061 && !(DECL_STRUCT_FUNCTION (caller)
3062 && DECL_STRUCT_FUNCTION (caller)->can_throw_non_call_exceptions))
3068 /* Returns nonzero if FN is a function that does not have any
3069 fundamental inline blocking properties. */
3072 tree_inlinable_function_p (tree fn)
3074 bool inlinable = true;
3078 /* If we've already decided this function shouldn't be inlined,
3079 there's no need to check again. */
3080 if (DECL_UNINLINABLE (fn))
3083 /* We only warn for functions declared `inline' by the user. */
3084 do_warning = (warn_inline
3085 && DECL_DECLARED_INLINE_P (fn)
3086 && !DECL_NO_INLINE_WARNING_P (fn)
3087 && !DECL_IN_SYSTEM_HEADER (fn));
3089 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
3092 && always_inline == NULL)
3095 warning (OPT_Winline, "function %q+F can never be inlined because it "
3096 "is suppressed using -fno-inline", fn);
3100 /* Don't auto-inline anything that might not be bound within
3101 this unit of translation. */
3102 else if (!DECL_DECLARED_INLINE_P (fn)
3103 && DECL_REPLACEABLE_P (fn))
3106 else if (!function_attribute_inlinable_p (fn))
3109 warning (OPT_Winline, "function %q+F can never be inlined because it "
3110 "uses attributes conflicting with inlining", fn);
3114 else if (inline_forbidden_p (fn))
3116 /* See if we should warn about uninlinable functions. Previously,
3117 some of these warnings would be issued while trying to expand
3118 the function inline, but that would cause multiple warnings
3119 about functions that would for example call alloca. But since
3120 this a property of the function, just one warning is enough.
3121 As a bonus we can now give more details about the reason why a
3122 function is not inlinable. */
3124 sorry (inline_forbidden_reason, fn);
3125 else if (do_warning)
3126 warning (OPT_Winline, inline_forbidden_reason, fn);
3131 /* Squirrel away the result so that we don't have to check again. */
3132 DECL_UNINLINABLE (fn) = !inlinable;
3137 /* Estimate the cost of a memory move. Use machine dependent
3138 word size and take possible memcpy call into account. */
3141 estimate_move_cost (tree type)
3145 gcc_assert (!VOID_TYPE_P (type));
3147 size = int_size_in_bytes (type);
3149 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size))
3150 /* Cost of a memcpy call, 3 arguments and the call. */
3153 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
3156 /* Returns cost of operation CODE, according to WEIGHTS */
3159 estimate_operator_cost (enum tree_code code, eni_weights *weights,
3160 tree op1 ATTRIBUTE_UNUSED, tree op2)
3164 /* These are "free" conversions, or their presumed cost
3165 is folded into other operations. */
3172 /* Assign cost of 1 to usual operations.
3173 ??? We may consider mapping RTL costs to this. */
3178 case POINTER_PLUS_EXPR:
3182 case ADDR_SPACE_CONVERT_EXPR:
3183 case FIXED_CONVERT_EXPR:
3184 case FIX_TRUNC_EXPR:
3196 case VEC_LSHIFT_EXPR:
3197 case VEC_RSHIFT_EXPR:
3204 case TRUTH_ANDIF_EXPR:
3205 case TRUTH_ORIF_EXPR:
3206 case TRUTH_AND_EXPR:
3208 case TRUTH_XOR_EXPR:
3209 case TRUTH_NOT_EXPR:
3218 case UNORDERED_EXPR:
3229 case PREDECREMENT_EXPR:
3230 case PREINCREMENT_EXPR:
3231 case POSTDECREMENT_EXPR:
3232 case POSTINCREMENT_EXPR:
3234 case REALIGN_LOAD_EXPR:
3236 case REDUC_MAX_EXPR:
3237 case REDUC_MIN_EXPR:
3238 case REDUC_PLUS_EXPR:
3239 case WIDEN_SUM_EXPR:
3240 case WIDEN_MULT_EXPR:
3243 case VEC_WIDEN_MULT_HI_EXPR:
3244 case VEC_WIDEN_MULT_LO_EXPR:
3245 case VEC_UNPACK_HI_EXPR:
3246 case VEC_UNPACK_LO_EXPR:
3247 case VEC_UNPACK_FLOAT_HI_EXPR:
3248 case VEC_UNPACK_FLOAT_LO_EXPR:
3249 case VEC_PACK_TRUNC_EXPR:
3250 case VEC_PACK_SAT_EXPR:
3251 case VEC_PACK_FIX_TRUNC_EXPR:
3252 case VEC_EXTRACT_EVEN_EXPR:
3253 case VEC_EXTRACT_ODD_EXPR:
3254 case VEC_INTERLEAVE_HIGH_EXPR:
3255 case VEC_INTERLEAVE_LOW_EXPR:
3259 /* Few special cases of expensive operations. This is useful
3260 to avoid inlining on functions having too many of these. */
3261 case TRUNC_DIV_EXPR:
3263 case FLOOR_DIV_EXPR:
3264 case ROUND_DIV_EXPR:
3265 case EXACT_DIV_EXPR:
3266 case TRUNC_MOD_EXPR:
3268 case FLOOR_MOD_EXPR:
3269 case ROUND_MOD_EXPR:
3271 if (TREE_CODE (op2) != INTEGER_CST)
3272 return weights->div_mod_cost;
3276 /* We expect a copy assignment with no operator. */
3277 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
3283 /* Estimate number of instructions that will be created by expanding
3284 the statements in the statement sequence STMTS.
3285 WEIGHTS contains weights attributed to various constructs. */
3288 int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
3291 gimple_stmt_iterator gsi;
3294 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
3295 cost += estimate_num_insns (gsi_stmt (gsi), weights);
3301 /* Estimate number of instructions that will be created by expanding STMT.
3302 WEIGHTS contains weights attributed to various constructs. */
3305 estimate_num_insns (gimple stmt, eni_weights *weights)
3308 enum gimple_code code = gimple_code (stmt);
3315 /* Try to estimate the cost of assignments. We have three cases to
3317 1) Simple assignments to registers;
3318 2) Stores to things that must live in memory. This includes
3319 "normal" stores to scalars, but also assignments of large
3320 structures, or constructors of big arrays;
3322 Let us look at the first two cases, assuming we have "a = b + C":
3323 <GIMPLE_ASSIGN <var_decl "a">
3324 <plus_expr <var_decl "b"> <constant C>>
3325 If "a" is a GIMPLE register, the assignment to it is free on almost
3326 any target, because "a" usually ends up in a real register. Hence
3327 the only cost of this expression comes from the PLUS_EXPR, and we
3328 can ignore the GIMPLE_ASSIGN.
3329 If "a" is not a GIMPLE register, the assignment to "a" will most
3330 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3331 of moving something into "a", which we compute using the function
3332 estimate_move_cost. */
3333 lhs = gimple_assign_lhs (stmt);
3334 rhs = gimple_assign_rhs1 (stmt);
3336 if (is_gimple_reg (lhs))
3339 cost = estimate_move_cost (TREE_TYPE (lhs));
3341 if (!is_gimple_reg (rhs) && !is_gimple_min_invariant (rhs))
3342 cost += estimate_move_cost (TREE_TYPE (rhs));
3344 cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights,
3345 gimple_assign_rhs1 (stmt),
3346 get_gimple_rhs_class (gimple_assign_rhs_code (stmt))
3347 == GIMPLE_BINARY_RHS
3348 ? gimple_assign_rhs2 (stmt) : NULL);
3352 cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights,
3353 gimple_op (stmt, 0),
3354 gimple_op (stmt, 1));
3358 /* Take into account cost of the switch + guess 2 conditional jumps for
3361 TODO: once the switch expansion logic is sufficiently separated, we can
3362 do better job on estimating cost of the switch. */
3363 if (weights->time_based)
3364 cost = floor_log2 (gimple_switch_num_labels (stmt)) * 2;
3366 cost = gimple_switch_num_labels (stmt) * 2;
3371 tree decl = gimple_call_fndecl (stmt);
3372 tree addr = gimple_call_fn (stmt);
3373 tree funtype = TREE_TYPE (addr);
3374 bool stdarg = false;
3376 if (POINTER_TYPE_P (funtype))
3377 funtype = TREE_TYPE (funtype);
3379 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
3380 cost = weights->target_builtin_call_cost;
3382 cost = weights->call_cost;
3384 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
3385 switch (DECL_FUNCTION_CODE (decl))
3387 /* Builtins that expand to constants. */
3388 case BUILT_IN_CONSTANT_P:
3389 case BUILT_IN_EXPECT:
3390 case BUILT_IN_OBJECT_SIZE:
3391 case BUILT_IN_UNREACHABLE:
3392 /* Simple register moves or loads from stack. */
3393 case BUILT_IN_RETURN_ADDRESS:
3394 case BUILT_IN_EXTRACT_RETURN_ADDR:
3395 case BUILT_IN_FROB_RETURN_ADDR:
3396 case BUILT_IN_RETURN:
3397 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
3398 case BUILT_IN_FRAME_ADDRESS:
3399 case BUILT_IN_VA_END:
3400 case BUILT_IN_STACK_SAVE:
3401 case BUILT_IN_STACK_RESTORE:
3402 /* Exception state returns or moves registers around. */
3403 case BUILT_IN_EH_FILTER:
3404 case BUILT_IN_EH_POINTER:
3405 case BUILT_IN_EH_COPY_VALUES:
3408 /* builtins that are not expensive (that is they are most probably
3409 expanded inline into resonably simple code). */
3411 case BUILT_IN_ALLOCA:
3412 case BUILT_IN_BSWAP32:
3413 case BUILT_IN_BSWAP64:
3415 case BUILT_IN_CLZIMAX:
3417 case BUILT_IN_CLZLL:
3419 case BUILT_IN_CTZIMAX:
3421 case BUILT_IN_CTZLL:
3423 case BUILT_IN_FFSIMAX:
3425 case BUILT_IN_FFSLL:
3426 case BUILT_IN_IMAXABS:
3427 case BUILT_IN_FINITE:
3428 case BUILT_IN_FINITEF:
3429 case BUILT_IN_FINITEL:
3430 case BUILT_IN_FINITED32:
3431 case BUILT_IN_FINITED64:
3432 case BUILT_IN_FINITED128:
3433 case BUILT_IN_FPCLASSIFY:
3434 case BUILT_IN_ISFINITE:
3435 case BUILT_IN_ISINF_SIGN:
3436 case BUILT_IN_ISINF:
3437 case BUILT_IN_ISINFF:
3438 case BUILT_IN_ISINFL:
3439 case BUILT_IN_ISINFD32:
3440 case BUILT_IN_ISINFD64:
3441 case BUILT_IN_ISINFD128:
3442 case BUILT_IN_ISNAN:
3443 case BUILT_IN_ISNANF:
3444 case BUILT_IN_ISNANL:
3445 case BUILT_IN_ISNAND32:
3446 case BUILT_IN_ISNAND64:
3447 case BUILT_IN_ISNAND128:
3448 case BUILT_IN_ISNORMAL:
3449 case BUILT_IN_ISGREATER:
3450 case BUILT_IN_ISGREATEREQUAL:
3451 case BUILT_IN_ISLESS:
3452 case BUILT_IN_ISLESSEQUAL:
3453 case BUILT_IN_ISLESSGREATER:
3454 case BUILT_IN_ISUNORDERED:
3455 case BUILT_IN_VA_ARG_PACK:
3456 case BUILT_IN_VA_ARG_PACK_LEN:
3457 case BUILT_IN_VA_COPY:
3459 case BUILT_IN_SAVEREGS:
3460 case BUILT_IN_POPCOUNTL:
3461 case BUILT_IN_POPCOUNTLL:
3462 case BUILT_IN_POPCOUNTIMAX:
3463 case BUILT_IN_POPCOUNT:
3464 case BUILT_IN_PARITYL:
3465 case BUILT_IN_PARITYLL:
3466 case BUILT_IN_PARITYIMAX:
3467 case BUILT_IN_PARITY:
3469 case BUILT_IN_LLABS:
3470 case BUILT_IN_PREFETCH:
3471 cost = weights->target_builtin_call_cost;
3479 funtype = TREE_TYPE (decl);
3481 if (!VOID_TYPE_P (TREE_TYPE (funtype)))
3482 cost += estimate_move_cost (TREE_TYPE (funtype));
3485 stdarg = stdarg_p (funtype);
3487 /* Our cost must be kept in sync with
3488 cgraph_estimate_size_after_inlining that does use function
3489 declaration to figure out the arguments.
3491 For functions taking variable list of arguments we must
3492 look into call statement intself. This is safe because
3493 we will get only higher costs and in most cases we will
3494 not inline these anyway. */
3495 if (decl && DECL_ARGUMENTS (decl) && !stdarg)
3498 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
3499 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3500 cost += estimate_move_cost (TREE_TYPE (arg));
3502 else if (funtype && prototype_p (funtype) && !stdarg)
3505 for (t = TYPE_ARG_TYPES (funtype); t && t != void_list_node;
3507 if (!VOID_TYPE_P (TREE_VALUE (t)))
3508 cost += estimate_move_cost (TREE_VALUE (t));
3512 for (i = 0; i < gimple_call_num_args (stmt); i++)
3514 tree arg = gimple_call_arg (stmt, i);
3515 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3516 cost += estimate_move_cost (TREE_TYPE (arg));
3528 case GIMPLE_PREDICT:
3533 return asm_str_count (gimple_asm_string (stmt));
3536 /* This is either going to be an external function call with one
3537 argument, or two register copy statements plus a goto. */
3540 case GIMPLE_EH_DISPATCH:
3541 /* ??? This is going to turn into a switch statement. Ideally
3542 we'd have a look at the eh region and estimate the number of
3547 return estimate_num_insns_seq (gimple_bind_body (stmt), weights);
3549 case GIMPLE_EH_FILTER:
3550 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
3553 return estimate_num_insns_seq (gimple_catch_handler (stmt), weights);
3556 return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
3557 + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
3559 /* OpenMP directives are generally very expensive. */
3561 case GIMPLE_OMP_RETURN:
3562 case GIMPLE_OMP_SECTIONS_SWITCH:
3563 case GIMPLE_OMP_ATOMIC_STORE:
3564 case GIMPLE_OMP_CONTINUE:
3565 /* ...except these, which are cheap. */
3568 case GIMPLE_OMP_ATOMIC_LOAD:
3569 return weights->omp_cost;
3571 case GIMPLE_OMP_FOR:
3572 return (weights->omp_cost
3573 + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
3574 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
3576 case GIMPLE_OMP_PARALLEL:
3577 case GIMPLE_OMP_TASK:
3578 case GIMPLE_OMP_CRITICAL:
3579 case GIMPLE_OMP_MASTER:
3580 case GIMPLE_OMP_ORDERED:
3581 case GIMPLE_OMP_SECTION:
3582 case GIMPLE_OMP_SECTIONS:
3583 case GIMPLE_OMP_SINGLE:
3584 return (weights->omp_cost
3585 + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
3594 /* Estimate number of instructions that will be created by expanding
3595 function FNDECL. WEIGHTS contains weights attributed to various
3599 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
3601 struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
3602 gimple_stmt_iterator bsi;
3606 gcc_assert (my_function && my_function->cfg);
3607 FOR_EACH_BB_FN (bb, my_function)
3609 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
3610 n += estimate_num_insns (gsi_stmt (bsi), weights);
3617 /* Initializes weights used by estimate_num_insns. */
3620 init_inline_once (void)
3622 eni_size_weights.call_cost = 1;
3623 eni_size_weights.target_builtin_call_cost = 1;
3624 eni_size_weights.div_mod_cost = 1;
3625 eni_size_weights.omp_cost = 40;
3626 eni_size_weights.time_based = false;
3628 /* Estimating time for call is difficult, since we have no idea what the
3629 called function does. In the current uses of eni_time_weights,
3630 underestimating the cost does less harm than overestimating it, so
3631 we choose a rather small value here. */
3632 eni_time_weights.call_cost = 10;
3633 eni_time_weights.target_builtin_call_cost = 10;
3634 eni_time_weights.div_mod_cost = 10;
3635 eni_time_weights.omp_cost = 40;
3636 eni_time_weights.time_based = true;
3639 /* Estimate the number of instructions in a gimple_seq. */
3642 count_insns_seq (gimple_seq seq, eni_weights *weights)
3644 gimple_stmt_iterator gsi;
3646 for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
3647 n += estimate_num_insns (gsi_stmt (gsi), weights);
3653 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3656 prepend_lexical_block (tree current_block, tree new_block)
3658 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
3659 BLOCK_SUBBLOCKS (current_block) = new_block;
3660 BLOCK_SUPERCONTEXT (new_block) = current_block;
3663 /* Fetch callee declaration from the call graph edge going from NODE and
3664 associated with STMR call statement. Return NULL_TREE if not found. */
3666 get_indirect_callee_fndecl (struct cgraph_node *node, gimple stmt)
3668 struct cgraph_edge *cs;
3670 cs = cgraph_edge (node, stmt);
3671 if (cs && !cs->indirect_unknown_callee)
3672 return cs->callee->decl;
3677 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3680 expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id)
3684 struct pointer_map_t *st, *dst;
3687 location_t saved_location;
3688 struct cgraph_edge *cg_edge;
3689 cgraph_inline_failed_t reason;
3690 basic_block return_block;
3692 gimple_stmt_iterator gsi, stmt_gsi;
3693 bool successfully_inlined = FALSE;
3694 bool purge_dead_abnormal_edges;
3698 /* Set input_location here so we get the right instantiation context
3699 if we call instantiate_decl from inlinable_function_p. */
3700 saved_location = input_location;
3701 if (gimple_has_location (stmt))
3702 input_location = gimple_location (stmt);
3704 /* From here on, we're only interested in CALL_EXPRs. */
3705 if (gimple_code (stmt) != GIMPLE_CALL)
3708 /* First, see if we can figure out what function is being called.
3709 If we cannot, then there is no hope of inlining the function. */
3710 fn = gimple_call_fndecl (stmt);
3713 fn = get_indirect_callee_fndecl (id->dst_node, stmt);
3718 /* Turn forward declarations into real ones. */
3719 fn = cgraph_node (fn)->decl;
3721 /* If FN is a declaration of a function in a nested scope that was
3722 globally declared inline, we don't set its DECL_INITIAL.
3723 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3724 C++ front-end uses it for cdtors to refer to their internal
3725 declarations, that are not real functions. Fortunately those
3726 don't have trees to be saved, so we can tell by checking their
3728 if (!DECL_INITIAL (fn)
3729 && DECL_ABSTRACT_ORIGIN (fn)
3730 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
3731 fn = DECL_ABSTRACT_ORIGIN (fn);
3733 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3734 Kill this check once this is fixed. */
3735 if (!id->dst_node->analyzed)
3738 cg_edge = cgraph_edge (id->dst_node, stmt);
3740 /* First check that inlining isn't simply forbidden in this case. */
3741 if (inline_forbidden_into_p (cg_edge->caller->decl, cg_edge->callee->decl))
3744 /* Don't try to inline functions that are not well-suited to inlining. */
3745 if (!cgraph_inline_p (cg_edge, &reason))
3747 /* If this call was originally indirect, we do not want to emit any
3748 inlining related warnings or sorry messages because there are no
3749 guarantees regarding those. */
3750 if (cg_edge->indirect_inlining_edge)
3753 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
3754 /* Avoid warnings during early inline pass. */
3755 && cgraph_global_info_ready)
3757 sorry ("inlining failed in call to %q+F: %s", fn,
3758 _(cgraph_inline_failed_string (reason)));
3759 sorry ("called from here");
3761 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
3762 && !DECL_IN_SYSTEM_HEADER (fn)
3763 && reason != CIF_UNSPECIFIED
3764 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
3765 /* Avoid warnings during early inline pass. */
3766 && cgraph_global_info_ready)
3768 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
3769 fn, _(cgraph_inline_failed_string (reason)));
3770 warning (OPT_Winline, "called from here");
3774 fn = cg_edge->callee->decl;
3776 #ifdef ENABLE_CHECKING
3777 if (cg_edge->callee->decl != id->dst_node->decl)
3778 verify_cgraph_node (cg_edge->callee);
3781 /* We will be inlining this callee. */
3782 id->eh_lp_nr = lookup_stmt_eh_lp (stmt);
3784 /* Update the callers EH personality. */
3785 if (DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl))
3786 DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3787 = DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl);
3789 /* Split the block holding the GIMPLE_CALL. */
3790 e = split_block (bb, stmt);
3792 return_block = e->dest;
3795 /* split_block splits after the statement; work around this by
3796 moving the call into the second block manually. Not pretty,
3797 but seems easier than doing the CFG manipulation by hand
3798 when the GIMPLE_CALL is in the last statement of BB. */
3799 stmt_gsi = gsi_last_bb (bb);
3800 gsi_remove (&stmt_gsi, false);
3802 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3803 been the source of abnormal edges. In this case, schedule
3804 the removal of dead abnormal edges. */
3805 gsi = gsi_start_bb (return_block);
3806 if (gsi_end_p (gsi))
3808 gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
3809 purge_dead_abnormal_edges = true;
3813 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
3814 purge_dead_abnormal_edges = false;
3817 stmt_gsi = gsi_start_bb (return_block);
3819 /* Build a block containing code to initialize the arguments, the
3820 actual inline expansion of the body, and a label for the return
3821 statements within the function to jump to. The type of the
3822 statement expression is the return type of the function call. */
3823 id->block = make_node (BLOCK);
3824 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
3825 BLOCK_SOURCE_LOCATION (id->block) = input_location;
3826 prepend_lexical_block (gimple_block (stmt), id->block);
3828 /* Local declarations will be replaced by their equivalents in this
3831 id->decl_map = pointer_map_create ();
3832 dst = id->debug_map;
3833 id->debug_map = NULL;
3835 /* Record the function we are about to inline. */
3837 id->src_node = cg_edge->callee;
3838 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
3839 id->gimple_call = stmt;
3841 gcc_assert (!id->src_cfun->after_inlining);
3844 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
3846 gimple_stmt_iterator si = gsi_last_bb (bb);
3847 gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
3851 initialize_inlined_parameters (id, stmt, fn, bb);
3853 if (DECL_INITIAL (fn))
3854 prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
3856 /* Return statements in the function body will be replaced by jumps
3857 to the RET_LABEL. */
3858 gcc_assert (DECL_INITIAL (fn));
3859 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
3861 /* Find the LHS to which the result of this call is assigned. */
3863 if (gimple_call_lhs (stmt))
3865 modify_dest = gimple_call_lhs (stmt);
3867 /* The function which we are inlining might not return a value,
3868 in which case we should issue a warning that the function
3869 does not return a value. In that case the optimizers will
3870 see that the variable to which the value is assigned was not
3871 initialized. We do not want to issue a warning about that
3872 uninitialized variable. */
3873 if (DECL_P (modify_dest))
3874 TREE_NO_WARNING (modify_dest) = 1;
3876 if (gimple_call_return_slot_opt_p (stmt))
3878 return_slot = modify_dest;
3885 /* If we are inlining a call to the C++ operator new, we don't want
3886 to use type based alias analysis on the return value. Otherwise
3887 we may get confused if the compiler sees that the inlined new
3888 function returns a pointer which was just deleted. See bug
3890 if (DECL_IS_OPERATOR_NEW (fn))
3896 /* Declare the return variable for the function. */
3897 use_retvar = declare_return_variable (id, return_slot, modify_dest);
3899 /* Add local vars in this inlined callee to caller. */
3900 t_step = id->src_cfun->local_decls;
3901 for (; t_step; t_step = TREE_CHAIN (t_step))
3903 var = TREE_VALUE (t_step);
3904 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3906 if (var_ann (var) && add_referenced_var (var))
3907 cfun->local_decls = tree_cons (NULL_TREE, var,
3910 else if (!can_be_nonlocal (var, id))
3911 cfun->local_decls = tree_cons (NULL_TREE, remap_decl (var, id),
3915 if (dump_file && (dump_flags & TDF_DETAILS))
3917 fprintf (dump_file, "Inlining ");
3918 print_generic_expr (dump_file, id->src_fn, 0);
3919 fprintf (dump_file, " to ");
3920 print_generic_expr (dump_file, id->dst_fn, 0);
3921 fprintf (dump_file, " with frequency %i\n", cg_edge->frequency);
3924 /* This is it. Duplicate the callee body. Assume callee is
3925 pre-gimplified. Note that we must not alter the caller
3926 function in any way before this point, as this CALL_EXPR may be
3927 a self-referential call; if we're calling ourselves, we need to
3928 duplicate our body before altering anything. */
3929 copy_body (id, bb->count,
3930 cg_edge->frequency * REG_BR_PROB_BASE / CGRAPH_FREQ_BASE,
3931 bb, return_block, NULL, NULL);
3933 /* Reset the escaped solution. */
3934 if (cfun->gimple_df)
3935 pt_solution_reset (&cfun->gimple_df->escaped);
3940 pointer_map_destroy (id->debug_map);
3941 id->debug_map = dst;
3943 pointer_map_destroy (id->decl_map);
3946 /* Unlink the calls virtual operands before replacing it. */
3947 unlink_stmt_vdef (stmt);
3949 /* If the inlined function returns a result that we care about,
3950 substitute the GIMPLE_CALL with an assignment of the return
3951 variable to the LHS of the call. That is, if STMT was
3952 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3953 if (use_retvar && gimple_call_lhs (stmt))
3955 gimple old_stmt = stmt;
3956 stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
3957 gsi_replace (&stmt_gsi, stmt, false);
3958 if (gimple_in_ssa_p (cfun))
3959 mark_symbols_for_renaming (stmt);
3960 maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
3964 /* Handle the case of inlining a function with no return
3965 statement, which causes the return value to become undefined. */
3966 if (gimple_call_lhs (stmt)
3967 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
3969 tree name = gimple_call_lhs (stmt);
3970 tree var = SSA_NAME_VAR (name);
3971 tree def = gimple_default_def (cfun, var);
3975 /* If the variable is used undefined, make this name
3976 undefined via a move. */
3977 stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
3978 gsi_replace (&stmt_gsi, stmt, true);
3982 /* Otherwise make this variable undefined. */
3983 gsi_remove (&stmt_gsi, true);
3984 set_default_def (var, name);
3985 SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
3989 gsi_remove (&stmt_gsi, true);
3992 if (purge_dead_abnormal_edges)
3993 gimple_purge_dead_abnormal_call_edges (return_block);
3995 /* If the value of the new expression is ignored, that's OK. We
3996 don't warn about this for CALL_EXPRs, so we shouldn't warn about
3997 the equivalent inlined version either. */
3998 if (is_gimple_assign (stmt))
4000 gcc_assert (gimple_assign_single_p (stmt)
4001 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
4002 TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
4005 /* Output the inlining info for this abstract function, since it has been
4006 inlined. If we don't do this now, we can lose the information about the
4007 variables in the function when the blocks get blown away as soon as we
4008 remove the cgraph node. */
4009 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
4011 /* Update callgraph if needed. */
4012 cgraph_remove_node (cg_edge->callee);
4014 id->block = NULL_TREE;
4015 successfully_inlined = TRUE;
4018 input_location = saved_location;
4019 return successfully_inlined;
4022 /* Expand call statements reachable from STMT_P.
4023 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4024 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
4025 unfortunately not use that function here because we need a pointer
4026 to the CALL_EXPR, not the tree itself. */
4029 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
4031 gimple_stmt_iterator gsi;
4033 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4035 gimple stmt = gsi_stmt (gsi);
4037 if (is_gimple_call (stmt)
4038 && expand_call_inline (bb, stmt, id))
4046 /* Walk all basic blocks created after FIRST and try to fold every statement
4047 in the STATEMENTS pointer set. */
4050 fold_marked_statements (int first, struct pointer_set_t *statements)
4052 for (; first < n_basic_blocks; first++)
4053 if (BASIC_BLOCK (first))
4055 gimple_stmt_iterator gsi;
4057 for (gsi = gsi_start_bb (BASIC_BLOCK (first));
4060 if (pointer_set_contains (statements, gsi_stmt (gsi)))
4062 gimple old_stmt = gsi_stmt (gsi);
4063 tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0;
4065 if (old_decl && DECL_BUILT_IN (old_decl))
4067 /* Folding builtins can create multiple instructions,
4068 we need to look at all of them. */
4069 gimple_stmt_iterator i2 = gsi;
4071 if (fold_stmt (&gsi))
4075 i2 = gsi_start_bb (BASIC_BLOCK (first));
4080 new_stmt = gsi_stmt (i2);
4081 update_stmt (new_stmt);
4082 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
4085 if (new_stmt == gsi_stmt (gsi))
4087 /* It is okay to check only for the very last
4088 of these statements. If it is a throwing
4089 statement nothing will change. If it isn't
4090 this can remove EH edges. If that weren't
4091 correct then because some intermediate stmts
4092 throw, but not the last one. That would mean
4093 we'd have to split the block, which we can't
4094 here and we'd loose anyway. And as builtins
4095 probably never throw, this all
4097 if (maybe_clean_or_replace_eh_stmt (old_stmt,
4099 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
4106 else if (fold_stmt (&gsi))
4108 /* Re-read the statement from GSI as fold_stmt() may
4110 gimple new_stmt = gsi_stmt (gsi);
4111 update_stmt (new_stmt);
4113 if (is_gimple_call (old_stmt)
4114 || is_gimple_call (new_stmt))
4115 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
4118 if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
4119 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
4125 /* Return true if BB has at least one abnormal outgoing edge. */
4128 has_abnormal_outgoing_edge_p (basic_block bb)
4133 FOR_EACH_EDGE (e, ei, bb->succs)
4134 if (e->flags & EDGE_ABNORMAL)
4140 /* Expand calls to inline functions in the body of FN. */
4143 optimize_inline_calls (tree fn)
4147 int last = n_basic_blocks;
4148 struct gimplify_ctx gctx;
4150 /* There is no point in performing inlining if errors have already
4151 occurred -- and we might crash if we try to inline invalid
4157 memset (&id, 0, sizeof (id));
4159 id.src_node = id.dst_node = cgraph_node (fn);
4161 /* Or any functions that aren't finished yet. */
4162 if (current_function_decl)
4163 id.dst_fn = current_function_decl;
4165 id.copy_decl = copy_decl_maybe_to_var;
4166 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4167 id.transform_new_cfg = false;
4168 id.transform_return_to_modify = true;
4169 id.transform_lang_insert_block = NULL;
4170 id.statements_to_fold = pointer_set_create ();
4172 push_gimplify_context (&gctx);
4174 /* We make no attempts to keep dominance info up-to-date. */
4175 free_dominance_info (CDI_DOMINATORS);
4176 free_dominance_info (CDI_POST_DOMINATORS);
4178 /* Register specific gimple functions. */
4179 gimple_register_cfg_hooks ();
4181 /* Reach the trees by walking over the CFG, and note the
4182 enclosing basic-blocks in the call edges. */
4183 /* We walk the blocks going forward, because inlined function bodies
4184 will split id->current_basic_block, and the new blocks will
4185 follow it; we'll trudge through them, processing their CALL_EXPRs
4188 gimple_expand_calls_inline (bb, &id);
4190 pop_gimplify_context (NULL);
4192 #ifdef ENABLE_CHECKING
4194 struct cgraph_edge *e;
4196 verify_cgraph_node (id.dst_node);
4198 /* Double check that we inlined everything we are supposed to inline. */
4199 for (e = id.dst_node->callees; e; e = e->next_callee)
4200 gcc_assert (e->inline_failed);
4204 /* Fold the statements before compacting/renumbering the basic blocks. */
4205 fold_marked_statements (last, id.statements_to_fold);
4206 pointer_set_destroy (id.statements_to_fold);
4208 gcc_assert (!id.debug_stmts);
4210 /* Renumber the (code) basic_blocks consecutively. */
4212 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4215 fold_cond_expr_cond ();
4216 delete_unreachable_blocks_update_callgraph (&id);
4217 #ifdef ENABLE_CHECKING
4218 verify_cgraph_node (id.dst_node);
4221 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4222 not possible yet - the IPA passes might make various functions to not
4223 throw and they don't care to proactively update local EH info. This is
4224 done later in fixup_cfg pass that also execute the verification. */
4225 return (TODO_update_ssa
4227 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
4228 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
4231 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4234 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
4236 enum tree_code code = TREE_CODE (*tp);
4237 enum tree_code_class cl = TREE_CODE_CLASS (code);
4239 /* We make copies of most nodes. */
4240 if (IS_EXPR_CODE_CLASS (cl)
4241 || code == TREE_LIST
4243 || code == TYPE_DECL
4244 || code == OMP_CLAUSE)
4246 /* Because the chain gets clobbered when we make a copy, we save it
4248 tree chain = NULL_TREE, new_tree;
4250 chain = TREE_CHAIN (*tp);
4252 /* Copy the node. */
4253 new_tree = copy_node (*tp);
4255 /* Propagate mudflap marked-ness. */
4256 if (flag_mudflap && mf_marked_p (*tp))
4261 /* Now, restore the chain, if appropriate. That will cause
4262 walk_tree to walk into the chain as well. */
4263 if (code == PARM_DECL
4264 || code == TREE_LIST
4265 || code == OMP_CLAUSE)
4266 TREE_CHAIN (*tp) = chain;
4268 /* For now, we don't update BLOCKs when we make copies. So, we
4269 have to nullify all BIND_EXPRs. */
4270 if (TREE_CODE (*tp) == BIND_EXPR)
4271 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
4273 else if (code == CONSTRUCTOR)
4275 /* CONSTRUCTOR nodes need special handling because
4276 we need to duplicate the vector of elements. */
4279 new_tree = copy_node (*tp);
4281 /* Propagate mudflap marked-ness. */
4282 if (flag_mudflap && mf_marked_p (*tp))
4285 CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc,
4286 CONSTRUCTOR_ELTS (*tp));
4289 else if (TREE_CODE_CLASS (code) == tcc_type)
4291 else if (TREE_CODE_CLASS (code) == tcc_declaration)
4293 else if (TREE_CODE_CLASS (code) == tcc_constant)
4296 gcc_assert (code != STATEMENT_LIST);
4300 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4301 information indicating to what new SAVE_EXPR this one should be mapped,
4302 use that one. Otherwise, create a new node and enter it in ST. FN is
4303 the function into which the copy will be placed. */
4306 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
4308 struct pointer_map_t *st = (struct pointer_map_t *) st_;
4312 /* See if we already encountered this SAVE_EXPR. */
4313 n = (tree *) pointer_map_contains (st, *tp);
4315 /* If we didn't already remap this SAVE_EXPR, do so now. */
4318 t = copy_node (*tp);
4320 /* Remember this SAVE_EXPR. */
4321 *pointer_map_insert (st, *tp) = t;
4322 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4323 *pointer_map_insert (st, t) = t;
4327 /* We've already walked into this SAVE_EXPR; don't do it again. */
4332 /* Replace this SAVE_EXPR with the copy. */
4336 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4337 copies the declaration and enters it in the splay_tree in DATA (which is
4338 really an `copy_body_data *'). */
4341 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
4344 copy_body_data *id = (copy_body_data *) data;
4346 /* Don't walk into types. */
4350 else if (TREE_CODE (*tp) == LABEL_EXPR)
4352 tree decl = TREE_OPERAND (*tp, 0);
4354 /* Copy the decl and remember the copy. */
4355 insert_decl_map (id, decl, id->copy_decl (decl, id));
4361 /* Perform any modifications to EXPR required when it is unsaved. Does
4362 not recurse into EXPR's subtrees. */
4365 unsave_expr_1 (tree expr)
4367 switch (TREE_CODE (expr))
4370 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4371 It's OK for this to happen if it was part of a subtree that
4372 isn't immediately expanded, such as operand 2 of another
4374 if (TREE_OPERAND (expr, 1))
4377 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4378 TREE_OPERAND (expr, 3) = NULL_TREE;
4386 /* Called via walk_tree when an expression is unsaved. Using the
4387 splay_tree pointed to by ST (which is really a `splay_tree'),
4388 remaps all local declarations to appropriate replacements. */
4391 unsave_r (tree *tp, int *walk_subtrees, void *data)
4393 copy_body_data *id = (copy_body_data *) data;
4394 struct pointer_map_t *st = id->decl_map;
4397 /* Only a local declaration (variable or label). */
4398 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
4399 || TREE_CODE (*tp) == LABEL_DECL)
4401 /* Lookup the declaration. */
4402 n = (tree *) pointer_map_contains (st, *tp);
4404 /* If it's there, remap it. */
4409 else if (TREE_CODE (*tp) == STATEMENT_LIST)
4411 else if (TREE_CODE (*tp) == BIND_EXPR)
4412 copy_bind_expr (tp, walk_subtrees, id);
4413 else if (TREE_CODE (*tp) == SAVE_EXPR
4414 || TREE_CODE (*tp) == TARGET_EXPR)
4415 remap_save_expr (tp, st, walk_subtrees);
4418 copy_tree_r (tp, walk_subtrees, NULL);
4420 /* Do whatever unsaving is required. */
4421 unsave_expr_1 (*tp);
4424 /* Keep iterating. */
4428 /* Copies everything in EXPR and replaces variables, labels
4429 and SAVE_EXPRs local to EXPR. */
4432 unsave_expr_now (tree expr)
4436 /* There's nothing to do for NULL_TREE. */
4441 memset (&id, 0, sizeof (id));
4442 id.src_fn = current_function_decl;
4443 id.dst_fn = current_function_decl;
4444 id.decl_map = pointer_map_create ();
4445 id.debug_map = NULL;
4447 id.copy_decl = copy_decl_no_change;
4448 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4449 id.transform_new_cfg = false;
4450 id.transform_return_to_modify = false;
4451 id.transform_lang_insert_block = NULL;
4453 /* Walk the tree once to find local labels. */
4454 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
4456 /* Walk the tree again, copying, remapping, and unsaving. */
4457 walk_tree (&expr, unsave_r, &id, NULL);
4460 pointer_map_destroy (id.decl_map);
4462 pointer_map_destroy (id.debug_map);
4467 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4468 label, copies the declaration and enters it in the splay_tree in DATA (which
4469 is really a 'copy_body_data *'. */
4472 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
4473 bool *handled_ops_p ATTRIBUTE_UNUSED,
4474 struct walk_stmt_info *wi)
4476 copy_body_data *id = (copy_body_data *) wi->info;
4477 gimple stmt = gsi_stmt (*gsip);
4479 if (gimple_code (stmt) == GIMPLE_LABEL)
4481 tree decl = gimple_label_label (stmt);
4483 /* Copy the decl and remember the copy. */
4484 insert_decl_map (id, decl, id->copy_decl (decl, id));
4491 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4492 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4493 remaps all local declarations to appropriate replacements in gimple
4497 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
4499 struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
4500 copy_body_data *id = (copy_body_data *) wi->info;
4501 struct pointer_map_t *st = id->decl_map;
4505 /* Only a local declaration (variable or label). */
4506 if ((TREE_CODE (expr) == VAR_DECL
4507 && !TREE_STATIC (expr))
4508 || TREE_CODE (expr) == LABEL_DECL)
4510 /* Lookup the declaration. */
4511 n = (tree *) pointer_map_contains (st, expr);
4513 /* If it's there, remap it. */
4518 else if (TREE_CODE (expr) == STATEMENT_LIST
4519 || TREE_CODE (expr) == BIND_EXPR
4520 || TREE_CODE (expr) == SAVE_EXPR)
4522 else if (TREE_CODE (expr) == TARGET_EXPR)
4524 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4525 It's OK for this to happen if it was part of a subtree that
4526 isn't immediately expanded, such as operand 2 of another
4528 if (!TREE_OPERAND (expr, 1))
4530 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4531 TREE_OPERAND (expr, 3) = NULL_TREE;
4535 /* Keep iterating. */
4540 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4541 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4542 remaps all local declarations to appropriate replacements in gimple
4546 replace_locals_stmt (gimple_stmt_iterator *gsip,
4547 bool *handled_ops_p ATTRIBUTE_UNUSED,
4548 struct walk_stmt_info *wi)
4550 copy_body_data *id = (copy_body_data *) wi->info;
4551 gimple stmt = gsi_stmt (*gsip);
4553 if (gimple_code (stmt) == GIMPLE_BIND)
4555 tree block = gimple_bind_block (stmt);
4559 remap_block (&block, id);
4560 gimple_bind_set_block (stmt, block);
4563 /* This will remap a lot of the same decls again, but this should be
4565 if (gimple_bind_vars (stmt))
4566 gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id));
4569 /* Keep iterating. */
4574 /* Copies everything in SEQ and replaces variables and labels local to
4575 current_function_decl. */
4578 copy_gimple_seq_and_replace_locals (gimple_seq seq)
4581 struct walk_stmt_info wi;
4582 struct pointer_set_t *visited;
4585 /* There's nothing to do for NULL_TREE. */
4590 memset (&id, 0, sizeof (id));
4591 id.src_fn = current_function_decl;
4592 id.dst_fn = current_function_decl;
4593 id.decl_map = pointer_map_create ();
4594 id.debug_map = NULL;
4596 id.copy_decl = copy_decl_no_change;
4597 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4598 id.transform_new_cfg = false;
4599 id.transform_return_to_modify = false;
4600 id.transform_lang_insert_block = NULL;
4602 /* Walk the tree once to find local labels. */
4603 memset (&wi, 0, sizeof (wi));
4604 visited = pointer_set_create ();
4607 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
4608 pointer_set_destroy (visited);
4610 copy = gimple_seq_copy (seq);
4612 /* Walk the copy, remapping decls. */
4613 memset (&wi, 0, sizeof (wi));
4615 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
4618 pointer_map_destroy (id.decl_map);
4620 pointer_map_destroy (id.debug_map);
4626 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4629 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
4638 debug_find_tree (tree top, tree search)
4640 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
4644 /* Declare the variables created by the inliner. Add all the variables in
4645 VARS to BIND_EXPR. */
4648 declare_inline_vars (tree block, tree vars)
4651 for (t = vars; t; t = TREE_CHAIN (t))
4653 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
4654 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
4655 cfun->local_decls = tree_cons (NULL_TREE, t, cfun->local_decls);
4659 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
4662 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4663 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4664 VAR_DECL translation. */
4667 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
4669 /* Don't generate debug information for the copy if we wouldn't have
4670 generated it for the copy either. */
4671 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
4672 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
4674 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4675 declaration inspired this copy. */
4676 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
4678 /* The new variable/label has no RTL, yet. */
4679 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
4680 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
4681 SET_DECL_RTL (copy, 0);
4683 /* These args would always appear unused, if not for this. */
4684 TREE_USED (copy) = 1;
4686 /* Set the context for the new declaration. */
4687 if (!DECL_CONTEXT (decl))
4688 /* Globals stay global. */
4690 else if (DECL_CONTEXT (decl) != id->src_fn)
4691 /* Things that weren't in the scope of the function we're inlining
4692 from aren't in the scope we're inlining to, either. */
4694 else if (TREE_STATIC (decl))
4695 /* Function-scoped static variables should stay in the original
4699 /* Ordinary automatic local variables are now in the scope of the
4701 DECL_CONTEXT (copy) = id->dst_fn;
4707 copy_decl_to_var (tree decl, copy_body_data *id)
4711 gcc_assert (TREE_CODE (decl) == PARM_DECL
4712 || TREE_CODE (decl) == RESULT_DECL);
4714 type = TREE_TYPE (decl);
4716 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4717 VAR_DECL, DECL_NAME (decl), type);
4718 if (DECL_PT_UID_SET_P (decl))
4719 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
4720 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4721 TREE_READONLY (copy) = TREE_READONLY (decl);
4722 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4723 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4725 return copy_decl_for_dup_finish (id, decl, copy);
4728 /* Like copy_decl_to_var, but create a return slot object instead of a
4729 pointer variable for return by invisible reference. */
4732 copy_result_decl_to_var (tree decl, copy_body_data *id)
4736 gcc_assert (TREE_CODE (decl) == PARM_DECL
4737 || TREE_CODE (decl) == RESULT_DECL);
4739 type = TREE_TYPE (decl);
4740 if (DECL_BY_REFERENCE (decl))
4741 type = TREE_TYPE (type);
4743 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4744 VAR_DECL, DECL_NAME (decl), type);
4745 if (DECL_PT_UID_SET_P (decl))
4746 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
4747 TREE_READONLY (copy) = TREE_READONLY (decl);
4748 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4749 if (!DECL_BY_REFERENCE (decl))
4751 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4752 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4755 return copy_decl_for_dup_finish (id, decl, copy);
4759 copy_decl_no_change (tree decl, copy_body_data *id)
4763 copy = copy_node (decl);
4765 /* The COPY is not abstract; it will be generated in DST_FN. */
4766 DECL_ABSTRACT (copy) = 0;
4767 lang_hooks.dup_lang_specific_decl (copy);
4769 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4770 been taken; it's for internal bookkeeping in expand_goto_internal. */
4771 if (TREE_CODE (copy) == LABEL_DECL)
4773 TREE_ADDRESSABLE (copy) = 0;
4774 LABEL_DECL_UID (copy) = -1;
4777 return copy_decl_for_dup_finish (id, decl, copy);
4781 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
4783 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
4784 return copy_decl_to_var (decl, id);
4786 return copy_decl_no_change (decl, id);
4789 /* Return a copy of the function's argument tree. */
4791 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
4792 bitmap args_to_skip, tree *vars)
4795 tree new_parm = NULL;
4800 for (arg = orig_parm; arg; arg = TREE_CHAIN (arg), i++)
4801 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
4803 tree new_tree = remap_decl (arg, id);
4804 lang_hooks.dup_lang_specific_decl (new_tree);
4806 parg = &TREE_CHAIN (new_tree);
4808 else if (!pointer_map_contains (id->decl_map, arg))
4810 /* Make an equivalent VAR_DECL. If the argument was used
4811 as temporary variable later in function, the uses will be
4812 replaced by local variable. */
4813 tree var = copy_decl_to_var (arg, id);
4815 add_referenced_var (var);
4816 insert_decl_map (id, arg, var);
4817 /* Declare this new variable. */
4818 TREE_CHAIN (var) = *vars;
4824 /* Return a copy of the function's static chain. */
4826 copy_static_chain (tree static_chain, copy_body_data * id)
4828 tree *chain_copy, *pvar;
4830 chain_copy = &static_chain;
4831 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
4833 tree new_tree = remap_decl (*pvar, id);
4834 lang_hooks.dup_lang_specific_decl (new_tree);
4835 TREE_CHAIN (new_tree) = TREE_CHAIN (*pvar);
4838 return static_chain;
4841 /* Return true if the function is allowed to be versioned.
4842 This is a guard for the versioning functionality. */
4845 tree_versionable_function_p (tree fndecl)
4847 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl))
4848 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl), fndecl) == NULL);
4851 /* Delete all unreachable basic blocks and update callgraph.
4852 Doing so is somewhat nontrivial because we need to update all clones and
4853 remove inline function that become unreachable. */
4856 delete_unreachable_blocks_update_callgraph (copy_body_data *id)
4858 bool changed = false;
4859 basic_block b, next_bb;
4861 find_unreachable_blocks ();
4863 /* Delete all unreachable basic blocks. */
4865 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR; b = next_bb)
4867 next_bb = b->next_bb;
4869 if (!(b->flags & BB_REACHABLE))
4871 gimple_stmt_iterator bsi;
4873 for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi))
4874 if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL)
4876 struct cgraph_edge *e;
4877 struct cgraph_node *node;
4879 if ((e = cgraph_edge (id->dst_node, gsi_stmt (bsi))) != NULL)
4881 if (!e->inline_failed)
4882 cgraph_remove_node_and_inline_clones (e->callee);
4884 cgraph_remove_edge (e);
4886 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4887 && id->dst_node->clones)
4888 for (node = id->dst_node->clones; node != id->dst_node;)
4890 if ((e = cgraph_edge (node, gsi_stmt (bsi))) != NULL)
4892 if (!e->inline_failed)
4893 cgraph_remove_node_and_inline_clones (e->callee);
4895 cgraph_remove_edge (e);
4899 node = node->clones;
4900 else if (node->next_sibling_clone)
4901 node = node->next_sibling_clone;
4904 while (node != id->dst_node && !node->next_sibling_clone)
4905 node = node->clone_of;
4906 if (node != id->dst_node)
4907 node = node->next_sibling_clone;
4911 delete_basic_block (b);
4917 tidy_fallthru_edges ();
4921 /* Update clone info after duplication. */
4924 update_clone_info (copy_body_data * id)
4926 struct cgraph_node *node;
4927 if (!id->dst_node->clones)
4929 for (node = id->dst_node->clones; node != id->dst_node;)
4931 /* First update replace maps to match the new body. */
4932 if (node->clone.tree_map)
4935 for (i = 0; i < VEC_length (ipa_replace_map_p, node->clone.tree_map); i++)
4937 struct ipa_replace_map *replace_info;
4938 replace_info = VEC_index (ipa_replace_map_p, node->clone.tree_map, i);
4939 walk_tree (&replace_info->old_tree, copy_tree_body_r, id, NULL);
4940 walk_tree (&replace_info->new_tree, copy_tree_body_r, id, NULL);
4944 node = node->clones;
4945 else if (node->next_sibling_clone)
4946 node = node->next_sibling_clone;
4949 while (node != id->dst_node && !node->next_sibling_clone)
4950 node = node->clone_of;
4951 if (node != id->dst_node)
4952 node = node->next_sibling_clone;
4957 /* Create a copy of a function's tree.
4958 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4959 of the original function and the new copied function
4960 respectively. In case we want to replace a DECL
4961 tree with another tree while duplicating the function's
4962 body, TREE_MAP represents the mapping between these
4963 trees. If UPDATE_CLONES is set, the call_stmt fields
4964 of edges of clones of the function will be updated.
4966 If non-NULL ARGS_TO_SKIP determine function parameters to remove
4968 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
4969 If non_NULL NEW_ENTRY determine new entry BB of the clone.
4972 tree_function_versioning (tree old_decl, tree new_decl,
4973 VEC(ipa_replace_map_p,gc)* tree_map,
4974 bool update_clones, bitmap args_to_skip,
4975 bitmap blocks_to_copy, basic_block new_entry)
4977 struct cgraph_node *old_version_node;
4978 struct cgraph_node *new_version_node;
4982 struct ipa_replace_map *replace_info;
4983 basic_block old_entry_block, bb;
4984 VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10);
4987 tree old_current_function_decl = current_function_decl;
4988 tree vars = NULL_TREE;
4990 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
4991 && TREE_CODE (new_decl) == FUNCTION_DECL);
4992 DECL_POSSIBLY_INLINED (old_decl) = 1;
4994 old_version_node = cgraph_node (old_decl);
4995 new_version_node = cgraph_node (new_decl);
4997 /* Output the inlining info for this abstract function, since it has been
4998 inlined. If we don't do this now, we can lose the information about the
4999 variables in the function when the blocks get blown away as soon as we
5000 remove the cgraph node. */
5001 (*debug_hooks->outlining_inline_function) (old_decl);
5003 DECL_ARTIFICIAL (new_decl) = 1;
5004 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
5005 DECL_FUNCTION_PERSONALITY (new_decl) = DECL_FUNCTION_PERSONALITY (old_decl);
5007 /* Prepare the data structures for the tree copy. */
5008 memset (&id, 0, sizeof (id));
5010 /* Generate a new name for the new version. */
5011 id.statements_to_fold = pointer_set_create ();
5013 id.decl_map = pointer_map_create ();
5014 id.debug_map = NULL;
5015 id.src_fn = old_decl;
5016 id.dst_fn = new_decl;
5017 id.src_node = old_version_node;
5018 id.dst_node = new_version_node;
5019 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
5020 if (id.src_node->ipa_transforms_to_apply)
5022 VEC(ipa_opt_pass,heap) * old_transforms_to_apply = id.dst_node->ipa_transforms_to_apply;
5025 id.dst_node->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap,
5026 id.src_node->ipa_transforms_to_apply);
5027 for (i = 0; i < VEC_length (ipa_opt_pass, old_transforms_to_apply); i++)
5028 VEC_safe_push (ipa_opt_pass, heap, id.dst_node->ipa_transforms_to_apply,
5029 VEC_index (ipa_opt_pass,
5030 old_transforms_to_apply,
5034 id.copy_decl = copy_decl_no_change;
5035 id.transform_call_graph_edges
5036 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
5037 id.transform_new_cfg = true;
5038 id.transform_return_to_modify = false;
5039 id.transform_lang_insert_block = NULL;
5041 current_function_decl = new_decl;
5042 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
5043 (DECL_STRUCT_FUNCTION (old_decl));
5044 initialize_cfun (new_decl, old_decl,
5045 old_entry_block->count);
5046 DECL_STRUCT_FUNCTION (new_decl)->gimple_df->ipa_pta
5047 = id.src_cfun->gimple_df->ipa_pta;
5048 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
5050 /* Copy the function's static chain. */
5051 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
5053 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
5054 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
5057 /* If there's a tree_map, prepare for substitution. */
5059 for (i = 0; i < VEC_length (ipa_replace_map_p, tree_map); i++)
5062 replace_info = VEC_index (ipa_replace_map_p, tree_map, i);
5063 if (replace_info->replace_p)
5065 tree op = replace_info->new_tree;
5066 if (!replace_info->old_tree)
5068 int i = replace_info->parm_num;
5070 for (parm = DECL_ARGUMENTS (old_decl); i; parm = TREE_CHAIN (parm))
5072 replace_info->old_tree = parm;
5078 if (TREE_CODE (op) == VIEW_CONVERT_EXPR)
5079 op = TREE_OPERAND (op, 0);
5081 if (TREE_CODE (op) == ADDR_EXPR)
5083 op = TREE_OPERAND (op, 0);
5084 while (handled_component_p (op))
5085 op = TREE_OPERAND (op, 0);
5086 if (TREE_CODE (op) == VAR_DECL)
5087 add_referenced_var (op);
5089 gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
5090 init = setup_one_parameter (&id, replace_info->old_tree,
5091 replace_info->new_tree, id.src_fn,
5095 VEC_safe_push (gimple, heap, init_stmts, init);
5098 /* Copy the function's arguments. */
5099 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
5100 DECL_ARGUMENTS (new_decl) =
5101 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
5102 args_to_skip, &vars);
5104 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
5106 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5107 number_blocks (id.dst_fn);
5109 declare_inline_vars (DECL_INITIAL (new_decl), vars);
5111 if (DECL_STRUCT_FUNCTION (old_decl)->local_decls != NULL_TREE)
5112 /* Add local vars. */
5113 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->local_decls;
5114 t_step; t_step = TREE_CHAIN (t_step))
5116 tree var = TREE_VALUE (t_step);
5117 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
5118 cfun->local_decls = tree_cons (NULL_TREE, var, cfun->local_decls);
5119 else if (!can_be_nonlocal (var, &id))
5121 tree_cons (NULL_TREE, remap_decl (var, &id),
5125 /* Copy the Function's body. */
5126 copy_body (&id, old_entry_block->count, REG_BR_PROB_BASE,
5127 ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, blocks_to_copy, new_entry);
5129 if (DECL_RESULT (old_decl) != NULL_TREE)
5131 tree *res_decl = &DECL_RESULT (old_decl);
5132 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
5133 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
5136 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5137 number_blocks (new_decl);
5139 /* We want to create the BB unconditionally, so that the addition of
5140 debug stmts doesn't affect BB count, which may in the end cause
5141 codegen differences. */
5142 bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
5143 while (VEC_length (gimple, init_stmts))
5144 insert_init_stmt (&id, bb, VEC_pop (gimple, init_stmts));
5145 update_clone_info (&id);
5147 /* Remap the nonlocal_goto_save_area, if any. */
5148 if (cfun->nonlocal_goto_save_area)
5150 struct walk_stmt_info wi;
5152 memset (&wi, 0, sizeof (wi));
5154 walk_tree (&cfun->nonlocal_goto_save_area, remap_gimple_op_r, &wi, NULL);
5158 pointer_map_destroy (id.decl_map);
5160 pointer_map_destroy (id.debug_map);
5161 free_dominance_info (CDI_DOMINATORS);
5162 free_dominance_info (CDI_POST_DOMINATORS);
5164 fold_marked_statements (0, id.statements_to_fold);
5165 pointer_set_destroy (id.statements_to_fold);
5166 fold_cond_expr_cond ();
5167 delete_unreachable_blocks_update_callgraph (&id);
5168 if (id.dst_node->analyzed)
5169 cgraph_rebuild_references ();
5170 update_ssa (TODO_update_ssa);
5171 free_dominance_info (CDI_DOMINATORS);
5172 free_dominance_info (CDI_POST_DOMINATORS);
5174 gcc_assert (!id.debug_stmts);
5175 VEC_free (gimple, heap, init_stmts);
5177 current_function_decl = old_current_function_decl;
5178 gcc_assert (!current_function_decl
5179 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
5183 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5184 the callee and return the inlined body on success. */
5187 maybe_inline_call_in_expr (tree exp)
5189 tree fn = get_callee_fndecl (exp);
5191 /* We can only try to inline "const" functions. */
5192 if (fn && TREE_READONLY (fn) && DECL_SAVED_TREE (fn))
5194 struct pointer_map_t *decl_map = pointer_map_create ();
5195 call_expr_arg_iterator iter;
5199 /* Remap the parameters. */
5200 for (param = DECL_ARGUMENTS (fn), arg = first_call_expr_arg (exp, &iter);
5202 param = TREE_CHAIN (param), arg = next_call_expr_arg (&iter))
5203 *pointer_map_insert (decl_map, param) = arg;
5205 memset (&id, 0, sizeof (id));
5207 id.dst_fn = current_function_decl;
5208 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
5209 id.decl_map = decl_map;
5211 id.copy_decl = copy_decl_no_change;
5212 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
5213 id.transform_new_cfg = false;
5214 id.transform_return_to_modify = true;
5215 id.transform_lang_insert_block = false;
5217 /* Make sure not to unshare trees behind the front-end's back
5218 since front-end specific mechanisms may rely on sharing. */
5219 id.regimplify = false;
5220 id.do_not_unshare = true;
5222 /* We're not inside any EH region. */
5225 t = copy_tree_body (&id);
5226 pointer_map_destroy (decl_map);
5228 /* We can only return something suitable for use in a GENERIC
5230 if (TREE_CODE (t) == MODIFY_EXPR)
5231 return TREE_OPERAND (t, 1);
5237 /* Duplicate a type, fields and all. */
5240 build_duplicate_type (tree type)
5242 struct copy_body_data id;
5244 memset (&id, 0, sizeof (id));
5245 id.src_fn = current_function_decl;
5246 id.dst_fn = current_function_decl;
5248 id.decl_map = pointer_map_create ();
5249 id.debug_map = NULL;
5250 id.copy_decl = copy_decl_no_change;
5252 type = remap_type_1 (type, &id);
5254 pointer_map_destroy (id.decl_map);
5256 pointer_map_destroy (id.debug_map);
5258 TYPE_CANONICAL (type) = type;
5263 /* Return whether it is safe to inline a function because it used different
5264 target specific options or call site actual types mismatch parameter types.
5265 E is the call edge to be checked. */
5267 tree_can_inline_p (struct cgraph_edge *e)
5270 /* This causes a regression in SPEC in that it prevents a cold function from
5271 inlining a hot function. Perhaps this should only apply to functions
5272 that the user declares hot/cold/optimize explicitly. */
5274 /* Don't inline a function with a higher optimization level than the
5275 caller, or with different space constraints (hot/cold functions). */
5276 tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller);
5277 tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee);
5279 if (caller_tree != callee_tree)
5281 struct cl_optimization *caller_opt
5282 = TREE_OPTIMIZATION ((caller_tree)
5284 : optimization_default_node);
5286 struct cl_optimization *callee_opt
5287 = TREE_OPTIMIZATION ((callee_tree)
5289 : optimization_default_node);
5291 if ((caller_opt->optimize > callee_opt->optimize)
5292 || (caller_opt->optimize_size != callee_opt->optimize_size))
5296 tree caller, callee, lhs;
5298 caller = e->caller->decl;
5299 callee = e->callee->decl;
5301 /* First check that inlining isn't simply forbidden in this case. */
5302 if (inline_forbidden_into_p (caller, callee))
5304 e->inline_failed = CIF_UNSPECIFIED;
5305 gimple_call_set_cannot_inline (e->call_stmt, true);
5309 /* Allow the backend to decide if inlining is ok. */
5310 if (!targetm.target_option.can_inline_p (caller, callee))
5312 e->inline_failed = CIF_TARGET_OPTION_MISMATCH;
5313 gimple_call_set_cannot_inline (e->call_stmt, true);
5314 e->call_stmt_cannot_inline_p = true;
5318 /* Do not inline calls where we cannot triviall work around mismatches
5319 in argument or return types. */
5321 && ((DECL_RESULT (callee)
5322 && !DECL_BY_REFERENCE (DECL_RESULT (callee))
5323 && (lhs = gimple_call_lhs (e->call_stmt)) != NULL_TREE
5324 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee)),
5326 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee)), lhs))
5327 || !gimple_check_call_args (e->call_stmt)))
5329 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
5330 gimple_call_set_cannot_inline (e->call_stmt, true);
5331 e->call_stmt_cannot_inline_p = true;