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"
33 #include "insn-config.h"
35 #include "langhooks.h"
36 #include "basic-block.h"
37 #include "tree-iterator.h"
40 #include "tree-mudflap.h"
41 #include "tree-flow.h"
43 #include "tree-flow.h"
44 #include "diagnostic.h"
45 #include "tree-pretty-print.h"
48 #include "pointer-set.h"
50 #include "value-prof.h"
51 #include "tree-pass.h"
53 #include "integrate.h"
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), copy_tree_body_r, id, 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;
1492 /* create_basic_block() will append every new block to
1493 basic_block_info automatically. */
1494 copy_basic_block = create_basic_block (NULL, (void *) 0,
1495 (basic_block) bb->prev_bb->aux);
1496 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
1498 /* We are going to rebuild frequencies from scratch. These values
1499 have just small importance to drive canonicalize_loop_headers. */
1500 freq = ((gcov_type)bb->frequency * frequency_scale / REG_BR_PROB_BASE);
1502 /* We recompute frequencies after inlining, so this is quite safe. */
1503 if (freq > BB_FREQ_MAX)
1505 copy_basic_block->frequency = freq;
1507 copy_gsi = gsi_start_bb (copy_basic_block);
1509 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1511 gimple stmt = gsi_stmt (gsi);
1512 gimple orig_stmt = stmt;
1514 id->regimplify = false;
1515 stmt = remap_gimple_stmt (stmt, id);
1516 if (gimple_nop_p (stmt))
1519 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
1522 /* With return slot optimization we can end up with
1523 non-gimple (foo *)&this->m, fix that here. */
1524 if (is_gimple_assign (stmt)
1525 && gimple_assign_rhs_code (stmt) == NOP_EXPR
1526 && !is_gimple_val (gimple_assign_rhs1 (stmt)))
1529 new_rhs = force_gimple_operand_gsi (&seq_gsi,
1530 gimple_assign_rhs1 (stmt),
1531 true, NULL, false, GSI_NEW_STMT);
1532 gimple_assign_set_rhs1 (stmt, new_rhs);
1533 id->regimplify = false;
1536 gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT);
1539 gimple_regimplify_operands (stmt, &seq_gsi);
1541 /* If copy_basic_block has been empty at the start of this iteration,
1542 call gsi_start_bb again to get at the newly added statements. */
1543 if (gsi_end_p (copy_gsi))
1544 copy_gsi = gsi_start_bb (copy_basic_block);
1546 gsi_next (©_gsi);
1548 /* Process the new statement. The call to gimple_regimplify_operands
1549 possibly turned the statement into multiple statements, we
1550 need to process all of them. */
1555 stmt = gsi_stmt (copy_gsi);
1556 if (is_gimple_call (stmt)
1557 && gimple_call_va_arg_pack_p (stmt)
1560 /* __builtin_va_arg_pack () should be replaced by
1561 all arguments corresponding to ... in the caller. */
1564 VEC(tree, heap) *argarray;
1565 size_t nargs = gimple_call_num_args (id->gimple_call);
1568 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1571 /* Create the new array of arguments. */
1572 n = nargs + gimple_call_num_args (stmt);
1573 argarray = VEC_alloc (tree, heap, n);
1574 VEC_safe_grow (tree, heap, argarray, n);
1576 /* Copy all the arguments before '...' */
1577 memcpy (VEC_address (tree, argarray),
1578 gimple_call_arg_ptr (stmt, 0),
1579 gimple_call_num_args (stmt) * sizeof (tree));
1581 /* Append the arguments passed in '...' */
1582 memcpy (VEC_address(tree, argarray) + gimple_call_num_args (stmt),
1583 gimple_call_arg_ptr (id->gimple_call, 0)
1584 + (gimple_call_num_args (id->gimple_call) - nargs),
1585 nargs * sizeof (tree));
1587 new_call = gimple_build_call_vec (gimple_call_fn (stmt),
1590 VEC_free (tree, heap, argarray);
1592 /* Copy all GIMPLE_CALL flags, location and block, except
1593 GF_CALL_VA_ARG_PACK. */
1594 gimple_call_copy_flags (new_call, stmt);
1595 gimple_call_set_va_arg_pack (new_call, false);
1596 gimple_set_location (new_call, gimple_location (stmt));
1597 gimple_set_block (new_call, gimple_block (stmt));
1598 gimple_call_set_lhs (new_call, gimple_call_lhs (stmt));
1600 gsi_replace (©_gsi, new_call, false);
1601 gimple_set_bb (stmt, NULL);
1604 else if (is_gimple_call (stmt)
1606 && (decl = gimple_call_fndecl (stmt))
1607 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1608 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN)
1610 /* __builtin_va_arg_pack_len () should be replaced by
1611 the number of anonymous arguments. */
1612 size_t nargs = gimple_call_num_args (id->gimple_call);
1616 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1619 count = build_int_cst (integer_type_node, nargs);
1620 new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count);
1621 gsi_replace (©_gsi, new_stmt, false);
1625 /* Statements produced by inlining can be unfolded, especially
1626 when we constant propagated some operands. We can't fold
1627 them right now for two reasons:
1628 1) folding require SSA_NAME_DEF_STMTs to be correct
1629 2) we can't change function calls to builtins.
1630 So we just mark statement for later folding. We mark
1631 all new statements, instead just statements that has changed
1632 by some nontrivial substitution so even statements made
1633 foldable indirectly are updated. If this turns out to be
1634 expensive, copy_body can be told to watch for nontrivial
1636 if (id->statements_to_fold)
1637 pointer_set_insert (id->statements_to_fold, stmt);
1639 /* We're duplicating a CALL_EXPR. Find any corresponding
1640 callgraph edges and update or duplicate them. */
1641 if (is_gimple_call (stmt))
1643 struct cgraph_edge *edge;
1646 switch (id->transform_call_graph_edges)
1648 case CB_CGE_DUPLICATE:
1649 edge = cgraph_edge (id->src_node, orig_stmt);
1652 int edge_freq = edge->frequency;
1653 edge = cgraph_clone_edge (edge, id->dst_node, stmt,
1655 REG_BR_PROB_BASE, CGRAPH_FREQ_BASE,
1656 edge->frequency, true);
1657 /* We could also just rescale the frequency, but
1658 doing so would introduce roundoff errors and make
1659 verifier unhappy. */
1661 = compute_call_stmt_bb_frequency (id->dst_node->decl,
1664 && profile_status_for_function (cfun) != PROFILE_ABSENT
1665 && (edge_freq > edge->frequency + 10
1666 || edge_freq < edge->frequency - 10))
1668 fprintf (dump_file, "Edge frequency estimated by "
1669 "cgraph %i diverge from inliner's estimate %i\n",
1673 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1676 copy_basic_block->frequency);
1678 stmt = cgraph_redirect_edge_call_stmt_to_callee (edge);
1682 case CB_CGE_MOVE_CLONES:
1683 cgraph_set_call_stmt_including_clones (id->dst_node,
1685 edge = cgraph_edge (id->dst_node, stmt);
1689 edge = cgraph_edge (id->dst_node, orig_stmt);
1691 cgraph_set_call_stmt (edge, stmt);
1698 /* Constant propagation on argument done during inlining
1699 may create new direct call. Produce an edge for it. */
1701 || (edge->indirect_inlining_edge
1702 && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES))
1703 && (fn = gimple_call_fndecl (stmt)) != NULL)
1705 struct cgraph_node *dest = cgraph_node (fn);
1707 /* We have missing edge in the callgraph. This can happen
1708 when previous inlining turned an indirect call into a
1709 direct call by constant propagating arguments or we are
1710 producing dead clone (for further clonning). In all
1711 other cases we hit a bug (incorrect node sharing is the
1712 most common reason for missing edges). */
1713 gcc_assert (dest->needed || !dest->analyzed
1714 || dest->address_taken
1715 || !id->src_node->analyzed);
1716 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)
1717 cgraph_create_edge_including_clones
1718 (id->dst_node, dest, orig_stmt, stmt, bb->count,
1719 compute_call_stmt_bb_frequency (id->dst_node->decl,
1721 bb->loop_depth, CIF_ORIGINALLY_INDIRECT_CALL);
1723 cgraph_create_edge (id->dst_node, dest, stmt,
1725 compute_call_stmt_bb_frequency
1726 (id->dst_node->decl, copy_basic_block),
1727 bb->loop_depth)->inline_failed
1728 = CIF_ORIGINALLY_INDIRECT_CALL;
1731 fprintf (dump_file, "Created new direct edge to %s",
1732 cgraph_node_name (dest));
1736 flags = gimple_call_flags (stmt);
1737 if (flags & ECF_MAY_BE_ALLOCA)
1738 cfun->calls_alloca = true;
1739 if (flags & ECF_RETURNS_TWICE)
1740 cfun->calls_setjmp = true;
1743 maybe_duplicate_eh_stmt_fn (cfun, stmt, id->src_cfun, orig_stmt,
1744 id->eh_map, id->eh_lp_nr);
1746 if (gimple_in_ssa_p (cfun) && !is_gimple_debug (stmt))
1751 find_new_referenced_vars (gsi_stmt (copy_gsi));
1752 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1753 if (TREE_CODE (def) == SSA_NAME)
1754 SSA_NAME_DEF_STMT (def) = stmt;
1757 gsi_next (©_gsi);
1759 while (!gsi_end_p (copy_gsi));
1761 copy_gsi = gsi_last_bb (copy_basic_block);
1764 return copy_basic_block;
1767 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1768 form is quite easy, since dominator relationship for old basic blocks does
1771 There is however exception where inlining might change dominator relation
1772 across EH edges from basic block within inlined functions destinating
1773 to landing pads in function we inline into.
1775 The function fills in PHI_RESULTs of such PHI nodes if they refer
1776 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1777 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1778 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1779 set, and this means that there will be no overlapping live ranges
1780 for the underlying symbol.
1782 This might change in future if we allow redirecting of EH edges and
1783 we might want to change way build CFG pre-inlining to include
1784 all the possible edges then. */
1786 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1787 bool can_throw, bool nonlocal_goto)
1792 FOR_EACH_EDGE (e, ei, bb->succs)
1794 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1797 gimple_stmt_iterator si;
1800 gcc_assert (e->flags & EDGE_EH);
1803 gcc_assert (!(e->flags & EDGE_EH));
1805 for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
1809 phi = gsi_stmt (si);
1811 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1812 gcc_assert (!e->dest->aux);
1814 gcc_assert ((e->flags & EDGE_EH)
1815 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
1817 if (!is_gimple_reg (PHI_RESULT (phi)))
1819 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi)));
1823 re = find_edge (ret_bb, e->dest);
1825 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1826 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1828 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1829 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1835 /* Copy edges from BB into its copy constructed earlier, scale profile
1836 accordingly. Edges will be taken care of later. Assume aux
1837 pointers to point to the copies of each BB. Return true if any
1838 debug stmts are left after a statement that must end the basic block. */
1841 copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb)
1843 basic_block new_bb = (basic_block) bb->aux;
1846 gimple_stmt_iterator si;
1848 bool need_debug_cleanup = false;
1850 /* Use the indices from the original blocks to create edges for the
1852 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1853 if (!(old_edge->flags & EDGE_EH))
1857 flags = old_edge->flags;
1859 /* Return edges do get a FALLTHRU flag when the get inlined. */
1860 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1861 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1862 flags |= EDGE_FALLTHRU;
1863 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1864 new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1865 new_edge->probability = old_edge->probability;
1868 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1871 for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
1874 bool can_throw, nonlocal_goto;
1876 copy_stmt = gsi_stmt (si);
1877 if (!is_gimple_debug (copy_stmt))
1879 update_stmt (copy_stmt);
1880 if (gimple_in_ssa_p (cfun))
1881 mark_symbols_for_renaming (copy_stmt);
1884 /* Do this before the possible split_block. */
1887 /* If this tree could throw an exception, there are two
1888 cases where we need to add abnormal edge(s): the
1889 tree wasn't in a region and there is a "current
1890 region" in the caller; or the original tree had
1891 EH edges. In both cases split the block after the tree,
1892 and add abnormal edge(s) as needed; we need both
1893 those from the callee and the caller.
1894 We check whether the copy can throw, because the const
1895 propagation can change an INDIRECT_REF which throws
1896 into a COMPONENT_REF which doesn't. If the copy
1897 can throw, the original could also throw. */
1898 can_throw = stmt_can_throw_internal (copy_stmt);
1899 nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt);
1901 if (can_throw || nonlocal_goto)
1903 if (!gsi_end_p (si))
1905 while (!gsi_end_p (si) && is_gimple_debug (gsi_stmt (si)))
1908 need_debug_cleanup = true;
1910 if (!gsi_end_p (si))
1911 /* Note that bb's predecessor edges aren't necessarily
1912 right at this point; split_block doesn't care. */
1914 edge e = split_block (new_bb, copy_stmt);
1917 new_bb->aux = e->src->aux;
1918 si = gsi_start_bb (new_bb);
1922 if (gimple_code (copy_stmt) == GIMPLE_EH_DISPATCH)
1923 make_eh_dispatch_edges (copy_stmt);
1925 make_eh_edges (copy_stmt);
1928 make_abnormal_goto_edges (gimple_bb (copy_stmt), true);
1930 if ((can_throw || nonlocal_goto)
1931 && gimple_in_ssa_p (cfun))
1932 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
1933 can_throw, nonlocal_goto);
1935 return need_debug_cleanup;
1938 /* Copy the PHIs. All blocks and edges are copied, some blocks
1939 was possibly split and new outgoing EH edges inserted.
1940 BB points to the block of original function and AUX pointers links
1941 the original and newly copied blocks. */
1944 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1946 basic_block const new_bb = (basic_block) bb->aux;
1949 gimple_stmt_iterator si;
1951 for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si))
1957 phi = gsi_stmt (si);
1958 res = PHI_RESULT (phi);
1960 if (is_gimple_reg (res))
1962 walk_tree (&new_res, copy_tree_body_r, id, NULL);
1963 SSA_NAME_DEF_STMT (new_res)
1964 = new_phi = create_phi_node (new_res, new_bb);
1965 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1968 = find_edge ((basic_block) new_edge->src->aux, bb);
1969 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1971 tree block = id->block;
1972 id->block = NULL_TREE;
1973 walk_tree (&new_arg, copy_tree_body_r, id, NULL);
1975 gcc_assert (new_arg);
1976 /* With return slot optimization we can end up with
1977 non-gimple (foo *)&this->m, fix that here. */
1978 if (TREE_CODE (new_arg) != SSA_NAME
1979 && TREE_CODE (new_arg) != FUNCTION_DECL
1980 && !is_gimple_val (new_arg))
1982 gimple_seq stmts = NULL;
1983 new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
1984 gsi_insert_seq_on_edge_immediate (new_edge, stmts);
1986 add_phi_arg (new_phi, new_arg, new_edge,
1987 gimple_phi_arg_location_from_edge (phi, old_edge));
1994 /* Wrapper for remap_decl so it can be used as a callback. */
1997 remap_decl_1 (tree decl, void *data)
1999 return remap_decl (decl, (copy_body_data *) data);
2002 /* Build struct function and associated datastructures for the new clone
2003 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
2006 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count)
2008 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2009 gcov_type count_scale;
2011 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
2012 count_scale = (REG_BR_PROB_BASE * count
2013 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
2015 count_scale = REG_BR_PROB_BASE;
2017 /* Register specific tree functions. */
2018 gimple_register_cfg_hooks ();
2020 /* Get clean struct function. */
2021 push_struct_function (new_fndecl);
2023 /* We will rebuild these, so just sanity check that they are empty. */
2024 gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
2025 gcc_assert (cfun->local_decls == NULL);
2026 gcc_assert (cfun->cfg == NULL);
2027 gcc_assert (cfun->decl == new_fndecl);
2029 /* Copy items we preserve during clonning. */
2030 cfun->static_chain_decl = src_cfun->static_chain_decl;
2031 cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
2032 cfun->function_end_locus = src_cfun->function_end_locus;
2033 cfun->curr_properties = src_cfun->curr_properties;
2034 cfun->last_verified = src_cfun->last_verified;
2035 cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
2036 cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
2037 cfun->has_nonlocal_label = src_cfun->has_nonlocal_label;
2038 cfun->stdarg = src_cfun->stdarg;
2039 cfun->dont_save_pending_sizes_p = src_cfun->dont_save_pending_sizes_p;
2040 cfun->after_inlining = src_cfun->after_inlining;
2041 cfun->can_throw_non_call_exceptions
2042 = src_cfun->can_throw_non_call_exceptions;
2043 cfun->returns_struct = src_cfun->returns_struct;
2044 cfun->returns_pcc_struct = src_cfun->returns_pcc_struct;
2045 cfun->after_tree_profile = src_cfun->after_tree_profile;
2047 init_empty_tree_cfg ();
2049 profile_status_for_function (cfun) = profile_status_for_function (src_cfun);
2050 ENTRY_BLOCK_PTR->count =
2051 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2053 ENTRY_BLOCK_PTR->frequency
2054 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2055 EXIT_BLOCK_PTR->count =
2056 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2058 EXIT_BLOCK_PTR->frequency =
2059 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2061 init_eh_for_function ();
2063 if (src_cfun->gimple_df)
2065 init_tree_ssa (cfun);
2066 cfun->gimple_df->in_ssa_p = true;
2067 init_ssa_operands ();
2072 /* Helper function for copy_cfg_body. Move debug stmts from the end
2073 of NEW_BB to the beginning of successor basic blocks when needed. If the
2074 successor has multiple predecessors, reset them, otherwise keep
2078 maybe_move_debug_stmts_to_successors (copy_body_data *id, basic_block new_bb)
2082 gimple_stmt_iterator si = gsi_last_nondebug_bb (new_bb);
2085 || gsi_one_before_end_p (si)
2086 || !(stmt_can_throw_internal (gsi_stmt (si))
2087 || stmt_can_make_abnormal_goto (gsi_stmt (si))))
2090 FOR_EACH_EDGE (e, ei, new_bb->succs)
2092 gimple_stmt_iterator ssi = gsi_last_bb (new_bb);
2093 gimple_stmt_iterator dsi = gsi_after_labels (e->dest);
2094 while (is_gimple_debug (gsi_stmt (ssi)))
2096 gimple stmt = gsi_stmt (ssi), new_stmt;
2100 /* For the last edge move the debug stmts instead of copying
2102 if (ei_one_before_end_p (ei))
2106 if (!single_pred_p (e->dest))
2107 gimple_debug_bind_reset_value (stmt);
2108 gsi_remove (&si, false);
2109 gsi_insert_before (&dsi, stmt, GSI_SAME_STMT);
2113 var = gimple_debug_bind_get_var (stmt);
2114 if (single_pred_p (e->dest))
2116 value = gimple_debug_bind_get_value (stmt);
2117 value = unshare_expr (value);
2121 new_stmt = gimple_build_debug_bind (var, value, stmt);
2122 gsi_insert_before (&dsi, new_stmt, GSI_SAME_STMT);
2123 VEC_safe_push (gimple, heap, id->debug_stmts, new_stmt);
2129 /* Make a copy of the body of FN so that it can be inserted inline in
2130 another function. Walks FN via CFG, returns new fndecl. */
2133 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency_scale,
2134 basic_block entry_block_map, basic_block exit_block_map)
2136 tree callee_fndecl = id->src_fn;
2137 /* Original cfun for the callee, doesn't change. */
2138 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2139 struct function *cfun_to_copy;
2141 tree new_fndecl = NULL;
2142 bool need_debug_cleanup = false;
2143 gcov_type count_scale;
2146 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
2147 count_scale = (REG_BR_PROB_BASE * count
2148 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
2150 count_scale = REG_BR_PROB_BASE;
2152 /* Register specific tree functions. */
2153 gimple_register_cfg_hooks ();
2155 /* Must have a CFG here at this point. */
2156 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2157 (DECL_STRUCT_FUNCTION (callee_fndecl)));
2159 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2161 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
2162 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
2163 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2164 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2166 /* Duplicate any exception-handling regions. */
2168 id->eh_map = duplicate_eh_regions (cfun_to_copy, NULL, id->eh_lp_nr,
2171 /* Use aux pointers to map the original blocks to copy. */
2172 FOR_EACH_BB_FN (bb, cfun_to_copy)
2174 basic_block new_bb = copy_bb (id, bb, frequency_scale, count_scale);
2179 last = last_basic_block;
2181 /* Now that we've duplicated the blocks, duplicate their edges. */
2182 FOR_ALL_BB_FN (bb, cfun_to_copy)
2183 need_debug_cleanup |= copy_edges_for_bb (bb, count_scale, exit_block_map);
2185 if (gimple_in_ssa_p (cfun))
2186 FOR_ALL_BB_FN (bb, cfun_to_copy)
2187 copy_phis_for_bb (bb, id);
2189 FOR_ALL_BB_FN (bb, cfun_to_copy)
2191 if (need_debug_cleanup
2192 && bb->index != ENTRY_BLOCK
2193 && bb->index != EXIT_BLOCK)
2194 maybe_move_debug_stmts_to_successors (id, (basic_block) bb->aux);
2195 ((basic_block)bb->aux)->aux = NULL;
2199 /* Zero out AUX fields of newly created block during EH edge
2201 for (; last < last_basic_block; last++)
2203 if (need_debug_cleanup)
2204 maybe_move_debug_stmts_to_successors (id, BASIC_BLOCK (last));
2205 BASIC_BLOCK (last)->aux = NULL;
2207 entry_block_map->aux = NULL;
2208 exit_block_map->aux = NULL;
2212 pointer_map_destroy (id->eh_map);
2219 /* Copy the debug STMT using ID. We deal with these statements in a
2220 special way: if any variable in their VALUE expression wasn't
2221 remapped yet, we won't remap it, because that would get decl uids
2222 out of sync, causing codegen differences between -g and -g0. If
2223 this arises, we drop the VALUE expression altogether. */
2226 copy_debug_stmt (gimple stmt, copy_body_data *id)
2229 struct walk_stmt_info wi;
2232 if (gimple_block (stmt))
2235 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (stmt));
2239 gimple_set_block (stmt, t);
2241 /* Remap all the operands in COPY. */
2242 memset (&wi, 0, sizeof (wi));
2245 processing_debug_stmt = 1;
2247 t = gimple_debug_bind_get_var (stmt);
2249 if (TREE_CODE (t) == PARM_DECL && id->debug_map
2250 && (n = (tree *) pointer_map_contains (id->debug_map, t)))
2252 gcc_assert (TREE_CODE (*n) == VAR_DECL);
2255 else if (TREE_CODE (t) == VAR_DECL
2257 && gimple_in_ssa_p (cfun)
2258 && !pointer_map_contains (id->decl_map, t)
2260 /* T is a non-localized variable. */;
2262 walk_tree (&t, remap_gimple_op_r, &wi, NULL);
2264 gimple_debug_bind_set_var (stmt, t);
2266 if (gimple_debug_bind_has_value_p (stmt))
2267 walk_tree (gimple_debug_bind_get_value_ptr (stmt),
2268 remap_gimple_op_r, &wi, NULL);
2270 /* Punt if any decl couldn't be remapped. */
2271 if (processing_debug_stmt < 0)
2272 gimple_debug_bind_reset_value (stmt);
2274 processing_debug_stmt = 0;
2277 if (gimple_in_ssa_p (cfun))
2278 mark_symbols_for_renaming (stmt);
2281 /* Process deferred debug stmts. In order to give values better odds
2282 of being successfully remapped, we delay the processing of debug
2283 stmts until all other stmts that might require remapping are
2287 copy_debug_stmts (copy_body_data *id)
2292 if (!id->debug_stmts)
2295 for (i = 0; VEC_iterate (gimple, id->debug_stmts, i, stmt); i++)
2296 copy_debug_stmt (stmt, id);
2298 VEC_free (gimple, heap, id->debug_stmts);
2301 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2302 another function. */
2305 copy_tree_body (copy_body_data *id)
2307 tree fndecl = id->src_fn;
2308 tree body = DECL_SAVED_TREE (fndecl);
2310 walk_tree (&body, copy_tree_body_r, id, NULL);
2315 /* Make a copy of the body of FN so that it can be inserted inline in
2316 another function. */
2319 copy_body (copy_body_data *id, gcov_type count, int frequency_scale,
2320 basic_block entry_block_map, basic_block exit_block_map)
2322 tree fndecl = id->src_fn;
2325 /* If this body has a CFG, walk CFG and copy. */
2326 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
2327 body = copy_cfg_body (id, count, frequency_scale, entry_block_map, exit_block_map);
2328 copy_debug_stmts (id);
2333 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2334 defined in function FN, or of a data member thereof. */
2337 self_inlining_addr_expr (tree value, tree fn)
2341 if (TREE_CODE (value) != ADDR_EXPR)
2344 var = get_base_address (TREE_OPERAND (value, 0));
2346 return var && auto_var_in_fn_p (var, fn);
2349 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2350 lexical block and line number information from base_stmt, if given,
2351 or from the last stmt of the block otherwise. */
2354 insert_init_debug_bind (copy_body_data *id,
2355 basic_block bb, tree var, tree value,
2359 gimple_stmt_iterator gsi;
2362 if (!gimple_in_ssa_p (id->src_cfun))
2365 if (!MAY_HAVE_DEBUG_STMTS)
2368 tracked_var = target_for_debug_bind (var);
2374 gsi = gsi_last_bb (bb);
2375 if (!base_stmt && !gsi_end_p (gsi))
2376 base_stmt = gsi_stmt (gsi);
2379 note = gimple_build_debug_bind (tracked_var, value, base_stmt);
2383 if (!gsi_end_p (gsi))
2384 gsi_insert_after (&gsi, note, GSI_SAME_STMT);
2386 gsi_insert_before (&gsi, note, GSI_SAME_STMT);
2393 insert_init_stmt (copy_body_data *id, basic_block bb, gimple init_stmt)
2395 /* If VAR represents a zero-sized variable, it's possible that the
2396 assignment statement may result in no gimple statements. */
2399 gimple_stmt_iterator si = gsi_last_bb (bb);
2401 /* We can end up with init statements that store to a non-register
2402 from a rhs with a conversion. Handle that here by forcing the
2403 rhs into a temporary. gimple_regimplify_operands is not
2404 prepared to do this for us. */
2405 if (!is_gimple_debug (init_stmt)
2406 && !is_gimple_reg (gimple_assign_lhs (init_stmt))
2407 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt)))
2408 && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS)
2410 tree rhs = build1 (gimple_assign_rhs_code (init_stmt),
2411 gimple_expr_type (init_stmt),
2412 gimple_assign_rhs1 (init_stmt));
2413 rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false,
2415 gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs));
2416 gimple_assign_set_rhs1 (init_stmt, rhs);
2418 gsi_insert_after (&si, init_stmt, GSI_NEW_STMT);
2419 gimple_regimplify_operands (init_stmt, &si);
2420 mark_symbols_for_renaming (init_stmt);
2422 if (!is_gimple_debug (init_stmt) && MAY_HAVE_DEBUG_STMTS)
2424 tree var, def = gimple_assign_lhs (init_stmt);
2426 if (TREE_CODE (def) == SSA_NAME)
2427 var = SSA_NAME_VAR (def);
2431 insert_init_debug_bind (id, bb, var, def, init_stmt);
2436 /* Initialize parameter P with VALUE. If needed, produce init statement
2437 at the end of BB. When BB is NULL, we return init statement to be
2440 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
2441 basic_block bb, tree *vars)
2443 gimple init_stmt = NULL;
2446 tree def = (gimple_in_ssa_p (cfun)
2447 ? gimple_default_def (id->src_cfun, p) : NULL);
2450 && value != error_mark_node
2451 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
2453 if (fold_convertible_p (TREE_TYPE (p), value))
2454 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
2456 /* ??? For valid (GIMPLE) programs we should not end up here.
2457 Still if something has gone wrong and we end up with truly
2458 mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2459 to not leak invalid GIMPLE to the following passes. */
2460 rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value);
2463 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2464 here since the type of this decl must be visible to the calling
2466 var = copy_decl_to_var (p, id);
2468 /* We're actually using the newly-created var. */
2469 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
2472 add_referenced_var (var);
2475 /* Declare this new variable. */
2476 TREE_CHAIN (var) = *vars;
2479 /* Make gimplifier happy about this variable. */
2480 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2482 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2483 we would not need to create a new variable here at all, if it
2484 weren't for debug info. Still, we can just use the argument
2486 if (TREE_READONLY (p)
2487 && !TREE_ADDRESSABLE (p)
2488 && value && !TREE_SIDE_EFFECTS (value)
2491 /* We may produce non-gimple trees by adding NOPs or introduce
2492 invalid sharing when operand is not really constant.
2493 It is not big deal to prohibit constant propagation here as
2494 we will constant propagate in DOM1 pass anyway. */
2495 if (is_gimple_min_invariant (value)
2496 && useless_type_conversion_p (TREE_TYPE (p),
2498 /* We have to be very careful about ADDR_EXPR. Make sure
2499 the base variable isn't a local variable of the inlined
2500 function, e.g., when doing recursive inlining, direct or
2501 mutually-recursive or whatever, which is why we don't
2502 just test whether fn == current_function_decl. */
2503 && ! self_inlining_addr_expr (value, fn))
2505 insert_decl_map (id, p, value);
2506 insert_debug_decl_map (id, p, var);
2507 return insert_init_debug_bind (id, bb, var, value, NULL);
2511 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2512 that way, when the PARM_DECL is encountered, it will be
2513 automatically replaced by the VAR_DECL. */
2514 insert_decl_map (id, p, var);
2516 /* Even if P was TREE_READONLY, the new VAR should not be.
2517 In the original code, we would have constructed a
2518 temporary, and then the function body would have never
2519 changed the value of P. However, now, we will be
2520 constructing VAR directly. The constructor body may
2521 change its value multiple times as it is being
2522 constructed. Therefore, it must not be TREE_READONLY;
2523 the back-end assumes that TREE_READONLY variable is
2524 assigned to only once. */
2525 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
2526 TREE_READONLY (var) = 0;
2528 /* If there is no setup required and we are in SSA, take the easy route
2529 replacing all SSA names representing the function parameter by the
2530 SSA name passed to function.
2532 We need to construct map for the variable anyway as it might be used
2533 in different SSA names when parameter is set in function.
2535 Do replacement at -O0 for const arguments replaced by constant.
2536 This is important for builtin_constant_p and other construct requiring
2537 constant argument to be visible in inlined function body. */
2538 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
2540 || (TREE_READONLY (p)
2541 && is_gimple_min_invariant (rhs)))
2542 && (TREE_CODE (rhs) == SSA_NAME
2543 || is_gimple_min_invariant (rhs))
2544 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
2546 insert_decl_map (id, def, rhs);
2547 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2550 /* If the value of argument is never used, don't care about initializing
2552 if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
2554 gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
2555 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2558 /* Initialize this VAR_DECL from the equivalent argument. Convert
2559 the argument to the proper type in case it was promoted. */
2562 if (rhs == error_mark_node)
2564 insert_decl_map (id, p, var);
2565 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2568 STRIP_USELESS_TYPE_CONVERSION (rhs);
2570 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2571 keep our trees in gimple form. */
2572 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
2574 def = remap_ssa_name (def, id);
2575 init_stmt = gimple_build_assign (def, rhs);
2576 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
2577 set_default_def (var, NULL);
2580 init_stmt = gimple_build_assign (var, rhs);
2582 if (bb && init_stmt)
2583 insert_init_stmt (id, bb, init_stmt);
2588 /* Generate code to initialize the parameters of the function at the
2589 top of the stack in ID from the GIMPLE_CALL STMT. */
2592 initialize_inlined_parameters (copy_body_data *id, gimple stmt,
2593 tree fn, basic_block bb)
2598 tree vars = NULL_TREE;
2599 tree static_chain = gimple_call_chain (stmt);
2601 /* Figure out what the parameters are. */
2602 parms = DECL_ARGUMENTS (fn);
2604 /* Loop through the parameter declarations, replacing each with an
2605 equivalent VAR_DECL, appropriately initialized. */
2606 for (p = parms, i = 0; p; p = TREE_CHAIN (p), i++)
2609 val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL;
2610 setup_one_parameter (id, p, val, fn, bb, &vars);
2613 /* Initialize the static chain. */
2614 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
2615 gcc_assert (fn != current_function_decl);
2618 /* No static chain? Seems like a bug in tree-nested.c. */
2619 gcc_assert (static_chain);
2621 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
2624 declare_inline_vars (id->block, vars);
2628 /* Declare a return variable to replace the RESULT_DECL for the
2629 function we are calling. An appropriate DECL_STMT is returned.
2630 The USE_STMT is filled to contain a use of the declaration to
2631 indicate the return value of the function.
2633 RETURN_SLOT, if non-null is place where to store the result. It
2634 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2635 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2637 The return value is a (possibly null) value that holds the result
2638 as seen by the caller. */
2641 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest)
2643 tree callee = id->src_fn;
2644 tree caller = id->dst_fn;
2645 tree result = DECL_RESULT (callee);
2646 tree callee_type = TREE_TYPE (result);
2650 /* Handle type-mismatches in the function declaration return type
2651 vs. the call expression. */
2653 caller_type = TREE_TYPE (modify_dest);
2655 caller_type = TREE_TYPE (TREE_TYPE (callee));
2657 /* We don't need to do anything for functions that don't return
2659 if (!result || VOID_TYPE_P (callee_type))
2662 /* If there was a return slot, then the return value is the
2663 dereferenced address of that object. */
2666 /* The front end shouldn't have used both return_slot and
2667 a modify expression. */
2668 gcc_assert (!modify_dest);
2669 if (DECL_BY_REFERENCE (result))
2671 tree return_slot_addr = build_fold_addr_expr (return_slot);
2672 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
2674 /* We are going to construct *&return_slot and we can't do that
2675 for variables believed to be not addressable.
2677 FIXME: This check possibly can match, because values returned
2678 via return slot optimization are not believed to have address
2679 taken by alias analysis. */
2680 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
2681 if (gimple_in_ssa_p (cfun))
2683 HOST_WIDE_INT bitsize;
2684 HOST_WIDE_INT bitpos;
2686 enum machine_mode mode;
2690 base = get_inner_reference (return_slot, &bitsize, &bitpos,
2692 &mode, &unsignedp, &volatilep,
2694 if (TREE_CODE (base) == INDIRECT_REF)
2695 base = TREE_OPERAND (base, 0);
2696 if (TREE_CODE (base) == SSA_NAME)
2697 base = SSA_NAME_VAR (base);
2698 mark_sym_for_renaming (base);
2700 var = return_slot_addr;
2705 gcc_assert (TREE_CODE (var) != SSA_NAME);
2706 TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
2708 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2709 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2710 && !DECL_GIMPLE_REG_P (result)
2712 DECL_GIMPLE_REG_P (var) = 0;
2717 /* All types requiring non-trivial constructors should have been handled. */
2718 gcc_assert (!TREE_ADDRESSABLE (callee_type));
2720 /* Attempt to avoid creating a new temporary variable. */
2722 && TREE_CODE (modify_dest) != SSA_NAME)
2724 bool use_it = false;
2726 /* We can't use MODIFY_DEST if there's type promotion involved. */
2727 if (!useless_type_conversion_p (callee_type, caller_type))
2730 /* ??? If we're assigning to a variable sized type, then we must
2731 reuse the destination variable, because we've no good way to
2732 create variable sized temporaries at this point. */
2733 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
2736 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2737 reuse it as the result of the call directly. Don't do this if
2738 it would promote MODIFY_DEST to addressable. */
2739 else if (TREE_ADDRESSABLE (result))
2743 tree base_m = get_base_address (modify_dest);
2745 /* If the base isn't a decl, then it's a pointer, and we don't
2746 know where that's going to go. */
2747 if (!DECL_P (base_m))
2749 else if (is_global_var (base_m))
2751 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2752 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2753 && !DECL_GIMPLE_REG_P (result)
2754 && DECL_GIMPLE_REG_P (base_m))
2756 else if (!TREE_ADDRESSABLE (base_m))
2768 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
2770 var = copy_result_decl_to_var (result, id);
2771 if (gimple_in_ssa_p (cfun))
2774 add_referenced_var (var);
2777 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2778 DECL_STRUCT_FUNCTION (caller)->local_decls
2779 = tree_cons (NULL_TREE, var,
2780 DECL_STRUCT_FUNCTION (caller)->local_decls);
2782 /* Do not have the rest of GCC warn about this variable as it should
2783 not be visible to the user. */
2784 TREE_NO_WARNING (var) = 1;
2786 declare_inline_vars (id->block, var);
2788 /* Build the use expr. If the return type of the function was
2789 promoted, convert it back to the expected type. */
2791 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
2792 use = fold_convert (caller_type, var);
2794 STRIP_USELESS_TYPE_CONVERSION (use);
2796 if (DECL_BY_REFERENCE (result))
2798 TREE_ADDRESSABLE (var) = 1;
2799 var = build_fold_addr_expr (var);
2803 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2804 way, when the RESULT_DECL is encountered, it will be
2805 automatically replaced by the VAR_DECL. */
2806 insert_decl_map (id, result, var);
2808 /* Remember this so we can ignore it in remap_decls. */
2814 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2815 to a local label. */
2818 has_label_address_in_static_1 (tree *nodep, int *walk_subtrees, void *fnp)
2821 tree fn = (tree) fnp;
2823 if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
2832 /* Determine if the function can be copied. If so return NULL. If
2833 not return a string describng the reason for failure. */
2836 copy_forbidden (struct function *fun, tree fndecl)
2838 const char *reason = fun->cannot_be_copied_reason;
2841 /* Only examine the function once. */
2842 if (fun->cannot_be_copied_set)
2845 /* We cannot copy a function that receives a non-local goto
2846 because we cannot remap the destination label used in the
2847 function that is performing the non-local goto. */
2848 /* ??? Actually, this should be possible, if we work at it.
2849 No doubt there's just a handful of places that simply
2850 assume it doesn't happen and don't substitute properly. */
2851 if (fun->has_nonlocal_label)
2853 reason = G_("function %q+F can never be copied "
2854 "because it receives a non-local goto");
2858 for (step = fun->local_decls; step; step = TREE_CHAIN (step))
2860 tree decl = TREE_VALUE (step);
2862 if (TREE_CODE (decl) == VAR_DECL
2863 && TREE_STATIC (decl)
2864 && !DECL_EXTERNAL (decl)
2865 && DECL_INITIAL (decl)
2866 && walk_tree_without_duplicates (&DECL_INITIAL (decl),
2867 has_label_address_in_static_1,
2870 reason = G_("function %q+F can never be copied because it saves "
2871 "address of local label in a static variable");
2877 fun->cannot_be_copied_reason = reason;
2878 fun->cannot_be_copied_set = true;
2883 static const char *inline_forbidden_reason;
2885 /* A callback for walk_gimple_seq to handle statements. Returns non-null
2886 iff a function can not be inlined. Also sets the reason why. */
2889 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2890 struct walk_stmt_info *wip)
2892 tree fn = (tree) wip->info;
2894 gimple stmt = gsi_stmt (*gsi);
2896 switch (gimple_code (stmt))
2899 /* Refuse to inline alloca call unless user explicitly forced so as
2900 this may change program's memory overhead drastically when the
2901 function using alloca is called in loop. In GCC present in
2902 SPEC2000 inlining into schedule_block cause it to require 2GB of
2903 RAM instead of 256MB. */
2904 if (gimple_alloca_call_p (stmt)
2905 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
2907 inline_forbidden_reason
2908 = G_("function %q+F can never be inlined because it uses "
2909 "alloca (override using the always_inline attribute)");
2910 *handled_ops_p = true;
2914 t = gimple_call_fndecl (stmt);
2918 /* We cannot inline functions that call setjmp. */
2919 if (setjmp_call_p (t))
2921 inline_forbidden_reason
2922 = G_("function %q+F can never be inlined because it uses setjmp");
2923 *handled_ops_p = true;
2927 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
2928 switch (DECL_FUNCTION_CODE (t))
2930 /* We cannot inline functions that take a variable number of
2932 case BUILT_IN_VA_START:
2933 case BUILT_IN_NEXT_ARG:
2934 case BUILT_IN_VA_END:
2935 inline_forbidden_reason
2936 = G_("function %q+F can never be inlined because it "
2937 "uses variable argument lists");
2938 *handled_ops_p = true;
2941 case BUILT_IN_LONGJMP:
2942 /* We can't inline functions that call __builtin_longjmp at
2943 all. The non-local goto machinery really requires the
2944 destination be in a different function. If we allow the
2945 function calling __builtin_longjmp to be inlined into the
2946 function calling __builtin_setjmp, Things will Go Awry. */
2947 inline_forbidden_reason
2948 = G_("function %q+F can never be inlined because "
2949 "it uses setjmp-longjmp exception handling");
2950 *handled_ops_p = true;
2953 case BUILT_IN_NONLOCAL_GOTO:
2955 inline_forbidden_reason
2956 = G_("function %q+F can never be inlined because "
2957 "it uses non-local goto");
2958 *handled_ops_p = true;
2961 case BUILT_IN_RETURN:
2962 case BUILT_IN_APPLY_ARGS:
2963 /* If a __builtin_apply_args caller would be inlined,
2964 it would be saving arguments of the function it has
2965 been inlined into. Similarly __builtin_return would
2966 return from the function the inline has been inlined into. */
2967 inline_forbidden_reason
2968 = G_("function %q+F can never be inlined because "
2969 "it uses __builtin_return or __builtin_apply_args");
2970 *handled_ops_p = true;
2979 t = gimple_goto_dest (stmt);
2981 /* We will not inline a function which uses computed goto. The
2982 addresses of its local labels, which may be tucked into
2983 global storage, are of course not constant across
2984 instantiations, which causes unexpected behavior. */
2985 if (TREE_CODE (t) != LABEL_DECL)
2987 inline_forbidden_reason
2988 = G_("function %q+F can never be inlined "
2989 "because it contains a computed goto");
2990 *handled_ops_p = true;
2999 *handled_ops_p = false;
3003 /* Return true if FNDECL is a function that cannot be inlined into
3007 inline_forbidden_p (tree fndecl)
3009 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
3010 struct walk_stmt_info wi;
3011 struct pointer_set_t *visited_nodes;
3013 bool forbidden_p = false;
3015 /* First check for shared reasons not to copy the code. */
3016 inline_forbidden_reason = copy_forbidden (fun, fndecl);
3017 if (inline_forbidden_reason != NULL)
3020 /* Next, walk the statements of the function looking for
3021 constraucts we can't handle, or are non-optimal for inlining. */
3022 visited_nodes = pointer_set_create ();
3023 memset (&wi, 0, sizeof (wi));
3024 wi.info = (void *) fndecl;
3025 wi.pset = visited_nodes;
3027 FOR_EACH_BB_FN (bb, fun)
3030 gimple_seq seq = bb_seq (bb);
3031 ret = walk_gimple_seq (seq, inline_forbidden_p_stmt, NULL, &wi);
3032 forbidden_p = (ret != NULL);
3037 pointer_set_destroy (visited_nodes);
3041 /* Return true if CALLEE cannot be inlined into CALLER. */
3044 inline_forbidden_into_p (tree caller, tree callee)
3046 /* Don't inline if the functions have different EH personalities. */
3047 if (DECL_FUNCTION_PERSONALITY (caller)
3048 && DECL_FUNCTION_PERSONALITY (callee)
3049 && (DECL_FUNCTION_PERSONALITY (caller)
3050 != DECL_FUNCTION_PERSONALITY (callee)))
3053 /* Don't inline if the callee can throw non-call exceptions but the
3055 if (DECL_STRUCT_FUNCTION (callee)
3056 && DECL_STRUCT_FUNCTION (callee)->can_throw_non_call_exceptions
3057 && !(DECL_STRUCT_FUNCTION (caller)
3058 && DECL_STRUCT_FUNCTION (caller)->can_throw_non_call_exceptions))
3064 /* Returns nonzero if FN is a function that does not have any
3065 fundamental inline blocking properties. */
3068 tree_inlinable_function_p (tree fn)
3070 bool inlinable = true;
3074 /* If we've already decided this function shouldn't be inlined,
3075 there's no need to check again. */
3076 if (DECL_UNINLINABLE (fn))
3079 /* We only warn for functions declared `inline' by the user. */
3080 do_warning = (warn_inline
3081 && DECL_DECLARED_INLINE_P (fn)
3082 && !DECL_NO_INLINE_WARNING_P (fn)
3083 && !DECL_IN_SYSTEM_HEADER (fn));
3085 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
3088 && always_inline == NULL)
3091 warning (OPT_Winline, "function %q+F can never be inlined because it "
3092 "is suppressed using -fno-inline", fn);
3096 /* Don't auto-inline anything that might not be bound within
3097 this unit of translation. */
3098 else if (!DECL_DECLARED_INLINE_P (fn)
3099 && DECL_REPLACEABLE_P (fn))
3102 else if (!function_attribute_inlinable_p (fn))
3105 warning (OPT_Winline, "function %q+F can never be inlined because it "
3106 "uses attributes conflicting with inlining", fn);
3110 else if (inline_forbidden_p (fn))
3112 /* See if we should warn about uninlinable functions. Previously,
3113 some of these warnings would be issued while trying to expand
3114 the function inline, but that would cause multiple warnings
3115 about functions that would for example call alloca. But since
3116 this a property of the function, just one warning is enough.
3117 As a bonus we can now give more details about the reason why a
3118 function is not inlinable. */
3120 sorry (inline_forbidden_reason, fn);
3121 else if (do_warning)
3122 warning (OPT_Winline, inline_forbidden_reason, fn);
3127 /* Squirrel away the result so that we don't have to check again. */
3128 DECL_UNINLINABLE (fn) = !inlinable;
3133 /* Estimate the cost of a memory move. Use machine dependent
3134 word size and take possible memcpy call into account. */
3137 estimate_move_cost (tree type)
3141 gcc_assert (!VOID_TYPE_P (type));
3143 size = int_size_in_bytes (type);
3145 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size))
3146 /* Cost of a memcpy call, 3 arguments and the call. */
3149 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
3152 /* Returns cost of operation CODE, according to WEIGHTS */
3155 estimate_operator_cost (enum tree_code code, eni_weights *weights,
3156 tree op1 ATTRIBUTE_UNUSED, tree op2)
3160 /* These are "free" conversions, or their presumed cost
3161 is folded into other operations. */
3168 /* Assign cost of 1 to usual operations.
3169 ??? We may consider mapping RTL costs to this. */
3174 case POINTER_PLUS_EXPR:
3178 case ADDR_SPACE_CONVERT_EXPR:
3179 case FIXED_CONVERT_EXPR:
3180 case FIX_TRUNC_EXPR:
3192 case VEC_LSHIFT_EXPR:
3193 case VEC_RSHIFT_EXPR:
3200 case TRUTH_ANDIF_EXPR:
3201 case TRUTH_ORIF_EXPR:
3202 case TRUTH_AND_EXPR:
3204 case TRUTH_XOR_EXPR:
3205 case TRUTH_NOT_EXPR:
3214 case UNORDERED_EXPR:
3225 case PREDECREMENT_EXPR:
3226 case PREINCREMENT_EXPR:
3227 case POSTDECREMENT_EXPR:
3228 case POSTINCREMENT_EXPR:
3230 case REALIGN_LOAD_EXPR:
3232 case REDUC_MAX_EXPR:
3233 case REDUC_MIN_EXPR:
3234 case REDUC_PLUS_EXPR:
3235 case WIDEN_SUM_EXPR:
3236 case WIDEN_MULT_EXPR:
3239 case VEC_WIDEN_MULT_HI_EXPR:
3240 case VEC_WIDEN_MULT_LO_EXPR:
3241 case VEC_UNPACK_HI_EXPR:
3242 case VEC_UNPACK_LO_EXPR:
3243 case VEC_UNPACK_FLOAT_HI_EXPR:
3244 case VEC_UNPACK_FLOAT_LO_EXPR:
3245 case VEC_PACK_TRUNC_EXPR:
3246 case VEC_PACK_SAT_EXPR:
3247 case VEC_PACK_FIX_TRUNC_EXPR:
3248 case VEC_EXTRACT_EVEN_EXPR:
3249 case VEC_EXTRACT_ODD_EXPR:
3250 case VEC_INTERLEAVE_HIGH_EXPR:
3251 case VEC_INTERLEAVE_LOW_EXPR:
3255 /* Few special cases of expensive operations. This is useful
3256 to avoid inlining on functions having too many of these. */
3257 case TRUNC_DIV_EXPR:
3259 case FLOOR_DIV_EXPR:
3260 case ROUND_DIV_EXPR:
3261 case EXACT_DIV_EXPR:
3262 case TRUNC_MOD_EXPR:
3264 case FLOOR_MOD_EXPR:
3265 case ROUND_MOD_EXPR:
3267 if (TREE_CODE (op2) != INTEGER_CST)
3268 return weights->div_mod_cost;
3272 /* We expect a copy assignment with no operator. */
3273 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
3279 /* Estimate number of instructions that will be created by expanding
3280 the statements in the statement sequence STMTS.
3281 WEIGHTS contains weights attributed to various constructs. */
3284 int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
3287 gimple_stmt_iterator gsi;
3290 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
3291 cost += estimate_num_insns (gsi_stmt (gsi), weights);
3297 /* Estimate number of instructions that will be created by expanding STMT.
3298 WEIGHTS contains weights attributed to various constructs. */
3301 estimate_num_insns (gimple stmt, eni_weights *weights)
3304 enum gimple_code code = gimple_code (stmt);
3311 /* Try to estimate the cost of assignments. We have three cases to
3313 1) Simple assignments to registers;
3314 2) Stores to things that must live in memory. This includes
3315 "normal" stores to scalars, but also assignments of large
3316 structures, or constructors of big arrays;
3318 Let us look at the first two cases, assuming we have "a = b + C":
3319 <GIMPLE_ASSIGN <var_decl "a">
3320 <plus_expr <var_decl "b"> <constant C>>
3321 If "a" is a GIMPLE register, the assignment to it is free on almost
3322 any target, because "a" usually ends up in a real register. Hence
3323 the only cost of this expression comes from the PLUS_EXPR, and we
3324 can ignore the GIMPLE_ASSIGN.
3325 If "a" is not a GIMPLE register, the assignment to "a" will most
3326 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3327 of moving something into "a", which we compute using the function
3328 estimate_move_cost. */
3329 lhs = gimple_assign_lhs (stmt);
3330 rhs = gimple_assign_rhs1 (stmt);
3332 if (is_gimple_reg (lhs))
3335 cost = estimate_move_cost (TREE_TYPE (lhs));
3337 if (!is_gimple_reg (rhs) && !is_gimple_min_invariant (rhs))
3338 cost += estimate_move_cost (TREE_TYPE (rhs));
3340 cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights,
3341 gimple_assign_rhs1 (stmt),
3342 get_gimple_rhs_class (gimple_assign_rhs_code (stmt))
3343 == GIMPLE_BINARY_RHS
3344 ? gimple_assign_rhs2 (stmt) : NULL);
3348 cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights,
3349 gimple_op (stmt, 0),
3350 gimple_op (stmt, 1));
3354 /* Take into account cost of the switch + guess 2 conditional jumps for
3357 TODO: once the switch expansion logic is sufficiently separated, we can
3358 do better job on estimating cost of the switch. */
3359 if (weights->time_based)
3360 cost = floor_log2 (gimple_switch_num_labels (stmt)) * 2;
3362 cost = gimple_switch_num_labels (stmt) * 2;
3367 tree decl = gimple_call_fndecl (stmt);
3368 tree addr = gimple_call_fn (stmt);
3369 tree funtype = TREE_TYPE (addr);
3371 if (POINTER_TYPE_P (funtype))
3372 funtype = TREE_TYPE (funtype);
3374 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
3375 cost = weights->target_builtin_call_cost;
3377 cost = weights->call_cost;
3379 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
3380 switch (DECL_FUNCTION_CODE (decl))
3382 /* Builtins that expand to constants. */
3383 case BUILT_IN_CONSTANT_P:
3384 case BUILT_IN_EXPECT:
3385 case BUILT_IN_OBJECT_SIZE:
3386 case BUILT_IN_UNREACHABLE:
3387 /* Simple register moves or loads from stack. */
3388 case BUILT_IN_RETURN_ADDRESS:
3389 case BUILT_IN_EXTRACT_RETURN_ADDR:
3390 case BUILT_IN_FROB_RETURN_ADDR:
3391 case BUILT_IN_RETURN:
3392 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
3393 case BUILT_IN_FRAME_ADDRESS:
3394 case BUILT_IN_VA_END:
3395 case BUILT_IN_STACK_SAVE:
3396 case BUILT_IN_STACK_RESTORE:
3397 /* Exception state returns or moves registers around. */
3398 case BUILT_IN_EH_FILTER:
3399 case BUILT_IN_EH_POINTER:
3400 case BUILT_IN_EH_COPY_VALUES:
3403 /* builtins that are not expensive (that is they are most probably
3404 expanded inline into resonably simple code). */
3406 case BUILT_IN_ALLOCA:
3407 case BUILT_IN_BSWAP32:
3408 case BUILT_IN_BSWAP64:
3410 case BUILT_IN_CLZIMAX:
3412 case BUILT_IN_CLZLL:
3414 case BUILT_IN_CTZIMAX:
3416 case BUILT_IN_CTZLL:
3418 case BUILT_IN_FFSIMAX:
3420 case BUILT_IN_FFSLL:
3421 case BUILT_IN_IMAXABS:
3422 case BUILT_IN_FINITE:
3423 case BUILT_IN_FINITEF:
3424 case BUILT_IN_FINITEL:
3425 case BUILT_IN_FINITED32:
3426 case BUILT_IN_FINITED64:
3427 case BUILT_IN_FINITED128:
3428 case BUILT_IN_FPCLASSIFY:
3429 case BUILT_IN_ISFINITE:
3430 case BUILT_IN_ISINF_SIGN:
3431 case BUILT_IN_ISINF:
3432 case BUILT_IN_ISINFF:
3433 case BUILT_IN_ISINFL:
3434 case BUILT_IN_ISINFD32:
3435 case BUILT_IN_ISINFD64:
3436 case BUILT_IN_ISINFD128:
3437 case BUILT_IN_ISNAN:
3438 case BUILT_IN_ISNANF:
3439 case BUILT_IN_ISNANL:
3440 case BUILT_IN_ISNAND32:
3441 case BUILT_IN_ISNAND64:
3442 case BUILT_IN_ISNAND128:
3443 case BUILT_IN_ISNORMAL:
3444 case BUILT_IN_ISGREATER:
3445 case BUILT_IN_ISGREATEREQUAL:
3446 case BUILT_IN_ISLESS:
3447 case BUILT_IN_ISLESSEQUAL:
3448 case BUILT_IN_ISLESSGREATER:
3449 case BUILT_IN_ISUNORDERED:
3450 case BUILT_IN_VA_ARG_PACK:
3451 case BUILT_IN_VA_ARG_PACK_LEN:
3452 case BUILT_IN_VA_COPY:
3454 case BUILT_IN_SAVEREGS:
3455 case BUILT_IN_POPCOUNTL:
3456 case BUILT_IN_POPCOUNTLL:
3457 case BUILT_IN_POPCOUNTIMAX:
3458 case BUILT_IN_POPCOUNT:
3459 case BUILT_IN_PARITYL:
3460 case BUILT_IN_PARITYLL:
3461 case BUILT_IN_PARITYIMAX:
3462 case BUILT_IN_PARITY:
3464 case BUILT_IN_LLABS:
3465 case BUILT_IN_PREFETCH:
3466 cost = weights->target_builtin_call_cost;
3474 funtype = TREE_TYPE (decl);
3476 if (!VOID_TYPE_P (TREE_TYPE (funtype)))
3477 cost += estimate_move_cost (TREE_TYPE (funtype));
3478 /* Our cost must be kept in sync with
3479 cgraph_estimate_size_after_inlining that does use function
3480 declaration to figure out the arguments. */
3481 if (decl && DECL_ARGUMENTS (decl))
3484 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
3485 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3486 cost += estimate_move_cost (TREE_TYPE (arg));
3488 else if (funtype && prototype_p (funtype))
3491 for (t = TYPE_ARG_TYPES (funtype); t && t != void_list_node;
3493 if (!VOID_TYPE_P (TREE_VALUE (t)))
3494 cost += estimate_move_cost (TREE_VALUE (t));
3498 for (i = 0; i < gimple_call_num_args (stmt); i++)
3500 tree arg = gimple_call_arg (stmt, i);
3501 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3502 cost += estimate_move_cost (TREE_TYPE (arg));
3514 case GIMPLE_PREDICT:
3519 return asm_str_count (gimple_asm_string (stmt));
3522 /* This is either going to be an external function call with one
3523 argument, or two register copy statements plus a goto. */
3526 case GIMPLE_EH_DISPATCH:
3527 /* ??? This is going to turn into a switch statement. Ideally
3528 we'd have a look at the eh region and estimate the number of
3533 return estimate_num_insns_seq (gimple_bind_body (stmt), weights);
3535 case GIMPLE_EH_FILTER:
3536 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
3539 return estimate_num_insns_seq (gimple_catch_handler (stmt), weights);
3542 return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
3543 + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
3545 /* OpenMP directives are generally very expensive. */
3547 case GIMPLE_OMP_RETURN:
3548 case GIMPLE_OMP_SECTIONS_SWITCH:
3549 case GIMPLE_OMP_ATOMIC_STORE:
3550 case GIMPLE_OMP_CONTINUE:
3551 /* ...except these, which are cheap. */
3554 case GIMPLE_OMP_ATOMIC_LOAD:
3555 return weights->omp_cost;
3557 case GIMPLE_OMP_FOR:
3558 return (weights->omp_cost
3559 + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
3560 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
3562 case GIMPLE_OMP_PARALLEL:
3563 case GIMPLE_OMP_TASK:
3564 case GIMPLE_OMP_CRITICAL:
3565 case GIMPLE_OMP_MASTER:
3566 case GIMPLE_OMP_ORDERED:
3567 case GIMPLE_OMP_SECTION:
3568 case GIMPLE_OMP_SECTIONS:
3569 case GIMPLE_OMP_SINGLE:
3570 return (weights->omp_cost
3571 + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
3580 /* Estimate number of instructions that will be created by expanding
3581 function FNDECL. WEIGHTS contains weights attributed to various
3585 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
3587 struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
3588 gimple_stmt_iterator bsi;
3592 gcc_assert (my_function && my_function->cfg);
3593 FOR_EACH_BB_FN (bb, my_function)
3595 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
3596 n += estimate_num_insns (gsi_stmt (bsi), weights);
3603 /* Initializes weights used by estimate_num_insns. */
3606 init_inline_once (void)
3608 eni_size_weights.call_cost = 1;
3609 eni_size_weights.target_builtin_call_cost = 1;
3610 eni_size_weights.div_mod_cost = 1;
3611 eni_size_weights.omp_cost = 40;
3612 eni_size_weights.time_based = false;
3614 /* Estimating time for call is difficult, since we have no idea what the
3615 called function does. In the current uses of eni_time_weights,
3616 underestimating the cost does less harm than overestimating it, so
3617 we choose a rather small value here. */
3618 eni_time_weights.call_cost = 10;
3619 eni_time_weights.target_builtin_call_cost = 10;
3620 eni_time_weights.div_mod_cost = 10;
3621 eni_time_weights.omp_cost = 40;
3622 eni_time_weights.time_based = true;
3625 /* Estimate the number of instructions in a gimple_seq. */
3628 count_insns_seq (gimple_seq seq, eni_weights *weights)
3630 gimple_stmt_iterator gsi;
3632 for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
3633 n += estimate_num_insns (gsi_stmt (gsi), weights);
3639 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3642 prepend_lexical_block (tree current_block, tree new_block)
3644 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
3645 BLOCK_SUBBLOCKS (current_block) = new_block;
3646 BLOCK_SUPERCONTEXT (new_block) = current_block;
3649 /* Fetch callee declaration from the call graph edge going from NODE and
3650 associated with STMR call statement. Return NULL_TREE if not found. */
3652 get_indirect_callee_fndecl (struct cgraph_node *node, gimple stmt)
3654 struct cgraph_edge *cs;
3656 cs = cgraph_edge (node, stmt);
3657 if (cs && !cs->indirect_unknown_callee)
3658 return cs->callee->decl;
3663 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3666 expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id)
3670 struct pointer_map_t *st, *dst;
3673 location_t saved_location;
3674 struct cgraph_edge *cg_edge;
3675 cgraph_inline_failed_t reason;
3676 basic_block return_block;
3678 gimple_stmt_iterator gsi, stmt_gsi;
3679 bool successfully_inlined = FALSE;
3680 bool purge_dead_abnormal_edges;
3684 /* Set input_location here so we get the right instantiation context
3685 if we call instantiate_decl from inlinable_function_p. */
3686 saved_location = input_location;
3687 if (gimple_has_location (stmt))
3688 input_location = gimple_location (stmt);
3690 /* From here on, we're only interested in CALL_EXPRs. */
3691 if (gimple_code (stmt) != GIMPLE_CALL)
3694 /* First, see if we can figure out what function is being called.
3695 If we cannot, then there is no hope of inlining the function. */
3696 fn = gimple_call_fndecl (stmt);
3699 fn = get_indirect_callee_fndecl (id->dst_node, stmt);
3704 /* Turn forward declarations into real ones. */
3705 fn = cgraph_node (fn)->decl;
3707 /* If FN is a declaration of a function in a nested scope that was
3708 globally declared inline, we don't set its DECL_INITIAL.
3709 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3710 C++ front-end uses it for cdtors to refer to their internal
3711 declarations, that are not real functions. Fortunately those
3712 don't have trees to be saved, so we can tell by checking their
3714 if (!DECL_INITIAL (fn)
3715 && DECL_ABSTRACT_ORIGIN (fn)
3716 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
3717 fn = DECL_ABSTRACT_ORIGIN (fn);
3719 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3720 Kill this check once this is fixed. */
3721 if (!id->dst_node->analyzed)
3724 cg_edge = cgraph_edge (id->dst_node, stmt);
3726 /* First check that inlining isn't simply forbidden in this case. */
3727 if (inline_forbidden_into_p (cg_edge->caller->decl, cg_edge->callee->decl))
3730 /* Don't try to inline functions that are not well-suited to inlining. */
3731 if (!cgraph_inline_p (cg_edge, &reason))
3733 /* If this call was originally indirect, we do not want to emit any
3734 inlining related warnings or sorry messages because there are no
3735 guarantees regarding those. */
3736 if (cg_edge->indirect_inlining_edge)
3739 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
3740 /* Avoid warnings during early inline pass. */
3741 && cgraph_global_info_ready)
3743 sorry ("inlining failed in call to %q+F: %s", fn,
3744 cgraph_inline_failed_string (reason));
3745 sorry ("called from here");
3747 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
3748 && !DECL_IN_SYSTEM_HEADER (fn)
3749 && reason != CIF_UNSPECIFIED
3750 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
3751 /* Avoid warnings during early inline pass. */
3752 && cgraph_global_info_ready)
3754 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
3755 fn, cgraph_inline_failed_string (reason));
3756 warning (OPT_Winline, "called from here");
3760 fn = cg_edge->callee->decl;
3762 #ifdef ENABLE_CHECKING
3763 if (cg_edge->callee->decl != id->dst_node->decl)
3764 verify_cgraph_node (cg_edge->callee);
3767 /* We will be inlining this callee. */
3768 id->eh_lp_nr = lookup_stmt_eh_lp (stmt);
3770 /* Update the callers EH personality. */
3771 if (DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl))
3772 DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3773 = DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl);
3775 /* Split the block holding the GIMPLE_CALL. */
3776 e = split_block (bb, stmt);
3778 return_block = e->dest;
3781 /* split_block splits after the statement; work around this by
3782 moving the call into the second block manually. Not pretty,
3783 but seems easier than doing the CFG manipulation by hand
3784 when the GIMPLE_CALL is in the last statement of BB. */
3785 stmt_gsi = gsi_last_bb (bb);
3786 gsi_remove (&stmt_gsi, false);
3788 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3789 been the source of abnormal edges. In this case, schedule
3790 the removal of dead abnormal edges. */
3791 gsi = gsi_start_bb (return_block);
3792 if (gsi_end_p (gsi))
3794 gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
3795 purge_dead_abnormal_edges = true;
3799 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
3800 purge_dead_abnormal_edges = false;
3803 stmt_gsi = gsi_start_bb (return_block);
3805 /* Build a block containing code to initialize the arguments, the
3806 actual inline expansion of the body, and a label for the return
3807 statements within the function to jump to. The type of the
3808 statement expression is the return type of the function call. */
3809 id->block = make_node (BLOCK);
3810 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
3811 BLOCK_SOURCE_LOCATION (id->block) = input_location;
3812 prepend_lexical_block (gimple_block (stmt), id->block);
3814 /* Local declarations will be replaced by their equivalents in this
3817 id->decl_map = pointer_map_create ();
3818 dst = id->debug_map;
3819 id->debug_map = NULL;
3821 /* Record the function we are about to inline. */
3823 id->src_node = cg_edge->callee;
3824 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
3825 id->gimple_call = stmt;
3827 gcc_assert (!id->src_cfun->after_inlining);
3830 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
3832 gimple_stmt_iterator si = gsi_last_bb (bb);
3833 gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
3837 initialize_inlined_parameters (id, stmt, fn, bb);
3839 if (DECL_INITIAL (fn))
3840 prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
3842 /* Return statements in the function body will be replaced by jumps
3843 to the RET_LABEL. */
3844 gcc_assert (DECL_INITIAL (fn));
3845 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
3847 /* Find the LHS to which the result of this call is assigned. */
3849 if (gimple_call_lhs (stmt))
3851 modify_dest = gimple_call_lhs (stmt);
3853 /* The function which we are inlining might not return a value,
3854 in which case we should issue a warning that the function
3855 does not return a value. In that case the optimizers will
3856 see that the variable to which the value is assigned was not
3857 initialized. We do not want to issue a warning about that
3858 uninitialized variable. */
3859 if (DECL_P (modify_dest))
3860 TREE_NO_WARNING (modify_dest) = 1;
3862 if (gimple_call_return_slot_opt_p (stmt))
3864 return_slot = modify_dest;
3871 /* If we are inlining a call to the C++ operator new, we don't want
3872 to use type based alias analysis on the return value. Otherwise
3873 we may get confused if the compiler sees that the inlined new
3874 function returns a pointer which was just deleted. See bug
3876 if (DECL_IS_OPERATOR_NEW (fn))
3882 /* Declare the return variable for the function. */
3883 use_retvar = declare_return_variable (id, return_slot, modify_dest);
3885 /* Add local vars in this inlined callee to caller. */
3886 t_step = id->src_cfun->local_decls;
3887 for (; t_step; t_step = TREE_CHAIN (t_step))
3889 var = TREE_VALUE (t_step);
3890 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3892 if (var_ann (var) && add_referenced_var (var))
3893 cfun->local_decls = tree_cons (NULL_TREE, var,
3896 else if (!can_be_nonlocal (var, id))
3897 cfun->local_decls = tree_cons (NULL_TREE, remap_decl (var, id),
3901 if (dump_file && (dump_flags & TDF_DETAILS))
3903 fprintf (dump_file, "Inlining ");
3904 print_generic_expr (dump_file, id->src_fn, 0);
3905 fprintf (dump_file, " to ");
3906 print_generic_expr (dump_file, id->dst_fn, 0);
3907 fprintf (dump_file, " with frequency %i\n", cg_edge->frequency);
3910 /* This is it. Duplicate the callee body. Assume callee is
3911 pre-gimplified. Note that we must not alter the caller
3912 function in any way before this point, as this CALL_EXPR may be
3913 a self-referential call; if we're calling ourselves, we need to
3914 duplicate our body before altering anything. */
3915 copy_body (id, bb->count,
3916 cg_edge->frequency * REG_BR_PROB_BASE / CGRAPH_FREQ_BASE,
3919 /* Reset the escaped solution. */
3920 if (cfun->gimple_df)
3921 pt_solution_reset (&cfun->gimple_df->escaped);
3926 pointer_map_destroy (id->debug_map);
3927 id->debug_map = dst;
3929 pointer_map_destroy (id->decl_map);
3932 /* Unlink the calls virtual operands before replacing it. */
3933 unlink_stmt_vdef (stmt);
3935 /* If the inlined function returns a result that we care about,
3936 substitute the GIMPLE_CALL with an assignment of the return
3937 variable to the LHS of the call. That is, if STMT was
3938 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3939 if (use_retvar && gimple_call_lhs (stmt))
3941 gimple old_stmt = stmt;
3942 stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
3943 gsi_replace (&stmt_gsi, stmt, false);
3944 if (gimple_in_ssa_p (cfun))
3945 mark_symbols_for_renaming (stmt);
3946 maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
3950 /* Handle the case of inlining a function with no return
3951 statement, which causes the return value to become undefined. */
3952 if (gimple_call_lhs (stmt)
3953 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
3955 tree name = gimple_call_lhs (stmt);
3956 tree var = SSA_NAME_VAR (name);
3957 tree def = gimple_default_def (cfun, var);
3961 /* If the variable is used undefined, make this name
3962 undefined via a move. */
3963 stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
3964 gsi_replace (&stmt_gsi, stmt, true);
3968 /* Otherwise make this variable undefined. */
3969 gsi_remove (&stmt_gsi, true);
3970 set_default_def (var, name);
3971 SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
3975 gsi_remove (&stmt_gsi, true);
3978 if (purge_dead_abnormal_edges)
3979 gimple_purge_dead_abnormal_call_edges (return_block);
3981 /* If the value of the new expression is ignored, that's OK. We
3982 don't warn about this for CALL_EXPRs, so we shouldn't warn about
3983 the equivalent inlined version either. */
3984 if (is_gimple_assign (stmt))
3986 gcc_assert (gimple_assign_single_p (stmt)
3987 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
3988 TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
3991 /* Output the inlining info for this abstract function, since it has been
3992 inlined. If we don't do this now, we can lose the information about the
3993 variables in the function when the blocks get blown away as soon as we
3994 remove the cgraph node. */
3995 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
3997 /* Update callgraph if needed. */
3998 cgraph_remove_node (cg_edge->callee);
4000 id->block = NULL_TREE;
4001 successfully_inlined = TRUE;
4004 input_location = saved_location;
4005 return successfully_inlined;
4008 /* Expand call statements reachable from STMT_P.
4009 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4010 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
4011 unfortunately not use that function here because we need a pointer
4012 to the CALL_EXPR, not the tree itself. */
4015 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
4017 gimple_stmt_iterator gsi;
4019 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4021 gimple stmt = gsi_stmt (gsi);
4023 if (is_gimple_call (stmt)
4024 && expand_call_inline (bb, stmt, id))
4032 /* Walk all basic blocks created after FIRST and try to fold every statement
4033 in the STATEMENTS pointer set. */
4036 fold_marked_statements (int first, struct pointer_set_t *statements)
4038 for (; first < n_basic_blocks; first++)
4039 if (BASIC_BLOCK (first))
4041 gimple_stmt_iterator gsi;
4043 for (gsi = gsi_start_bb (BASIC_BLOCK (first));
4046 if (pointer_set_contains (statements, gsi_stmt (gsi)))
4048 gimple old_stmt = gsi_stmt (gsi);
4049 tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0;
4051 if (old_decl && DECL_BUILT_IN (old_decl))
4053 /* Folding builtins can create multiple instructions,
4054 we need to look at all of them. */
4055 gimple_stmt_iterator i2 = gsi;
4057 if (fold_stmt (&gsi))
4061 i2 = gsi_start_bb (BASIC_BLOCK (first));
4066 new_stmt = gsi_stmt (i2);
4067 update_stmt (new_stmt);
4068 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
4071 if (new_stmt == gsi_stmt (gsi))
4073 /* It is okay to check only for the very last
4074 of these statements. If it is a throwing
4075 statement nothing will change. If it isn't
4076 this can remove EH edges. If that weren't
4077 correct then because some intermediate stmts
4078 throw, but not the last one. That would mean
4079 we'd have to split the block, which we can't
4080 here and we'd loose anyway. And as builtins
4081 probably never throw, this all
4083 if (maybe_clean_or_replace_eh_stmt (old_stmt,
4085 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
4092 else if (fold_stmt (&gsi))
4094 /* Re-read the statement from GSI as fold_stmt() may
4096 gimple new_stmt = gsi_stmt (gsi);
4097 update_stmt (new_stmt);
4099 if (is_gimple_call (old_stmt)
4100 || is_gimple_call (new_stmt))
4101 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
4104 if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
4105 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
4111 /* Return true if BB has at least one abnormal outgoing edge. */
4114 has_abnormal_outgoing_edge_p (basic_block bb)
4119 FOR_EACH_EDGE (e, ei, bb->succs)
4120 if (e->flags & EDGE_ABNORMAL)
4126 /* Expand calls to inline functions in the body of FN. */
4129 optimize_inline_calls (tree fn)
4133 int last = n_basic_blocks;
4134 struct gimplify_ctx gctx;
4136 /* There is no point in performing inlining if errors have already
4137 occurred -- and we might crash if we try to inline invalid
4143 memset (&id, 0, sizeof (id));
4145 id.src_node = id.dst_node = cgraph_node (fn);
4147 /* Or any functions that aren't finished yet. */
4148 if (current_function_decl)
4149 id.dst_fn = current_function_decl;
4151 id.copy_decl = copy_decl_maybe_to_var;
4152 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4153 id.transform_new_cfg = false;
4154 id.transform_return_to_modify = true;
4155 id.transform_lang_insert_block = NULL;
4156 id.statements_to_fold = pointer_set_create ();
4158 push_gimplify_context (&gctx);
4160 /* We make no attempts to keep dominance info up-to-date. */
4161 free_dominance_info (CDI_DOMINATORS);
4162 free_dominance_info (CDI_POST_DOMINATORS);
4164 /* Register specific gimple functions. */
4165 gimple_register_cfg_hooks ();
4167 /* Reach the trees by walking over the CFG, and note the
4168 enclosing basic-blocks in the call edges. */
4169 /* We walk the blocks going forward, because inlined function bodies
4170 will split id->current_basic_block, and the new blocks will
4171 follow it; we'll trudge through them, processing their CALL_EXPRs
4174 gimple_expand_calls_inline (bb, &id);
4176 pop_gimplify_context (NULL);
4178 #ifdef ENABLE_CHECKING
4180 struct cgraph_edge *e;
4182 verify_cgraph_node (id.dst_node);
4184 /* Double check that we inlined everything we are supposed to inline. */
4185 for (e = id.dst_node->callees; e; e = e->next_callee)
4186 gcc_assert (e->inline_failed);
4190 /* Fold the statements before compacting/renumbering the basic blocks. */
4191 fold_marked_statements (last, id.statements_to_fold);
4192 pointer_set_destroy (id.statements_to_fold);
4194 gcc_assert (!id.debug_stmts);
4196 /* Renumber the (code) basic_blocks consecutively. */
4198 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4201 fold_cond_expr_cond ();
4202 delete_unreachable_blocks_update_callgraph (&id);
4203 #ifdef ENABLE_CHECKING
4204 verify_cgraph_node (id.dst_node);
4207 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4208 not possible yet - the IPA passes might make various functions to not
4209 throw and they don't care to proactively update local EH info. This is
4210 done later in fixup_cfg pass that also execute the verification. */
4211 return (TODO_update_ssa
4213 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
4214 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
4217 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4220 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
4222 enum tree_code code = TREE_CODE (*tp);
4223 enum tree_code_class cl = TREE_CODE_CLASS (code);
4225 /* We make copies of most nodes. */
4226 if (IS_EXPR_CODE_CLASS (cl)
4227 || code == TREE_LIST
4229 || code == TYPE_DECL
4230 || code == OMP_CLAUSE)
4232 /* Because the chain gets clobbered when we make a copy, we save it
4234 tree chain = NULL_TREE, new_tree;
4236 chain = TREE_CHAIN (*tp);
4238 /* Copy the node. */
4239 new_tree = copy_node (*tp);
4241 /* Propagate mudflap marked-ness. */
4242 if (flag_mudflap && mf_marked_p (*tp))
4247 /* Now, restore the chain, if appropriate. That will cause
4248 walk_tree to walk into the chain as well. */
4249 if (code == PARM_DECL
4250 || code == TREE_LIST
4251 || code == OMP_CLAUSE)
4252 TREE_CHAIN (*tp) = chain;
4254 /* For now, we don't update BLOCKs when we make copies. So, we
4255 have to nullify all BIND_EXPRs. */
4256 if (TREE_CODE (*tp) == BIND_EXPR)
4257 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
4259 else if (code == CONSTRUCTOR)
4261 /* CONSTRUCTOR nodes need special handling because
4262 we need to duplicate the vector of elements. */
4265 new_tree = copy_node (*tp);
4267 /* Propagate mudflap marked-ness. */
4268 if (flag_mudflap && mf_marked_p (*tp))
4271 CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc,
4272 CONSTRUCTOR_ELTS (*tp));
4275 else if (TREE_CODE_CLASS (code) == tcc_type)
4277 else if (TREE_CODE_CLASS (code) == tcc_declaration)
4279 else if (TREE_CODE_CLASS (code) == tcc_constant)
4282 gcc_assert (code != STATEMENT_LIST);
4286 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4287 information indicating to what new SAVE_EXPR this one should be mapped,
4288 use that one. Otherwise, create a new node and enter it in ST. FN is
4289 the function into which the copy will be placed. */
4292 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
4294 struct pointer_map_t *st = (struct pointer_map_t *) st_;
4298 /* See if we already encountered this SAVE_EXPR. */
4299 n = (tree *) pointer_map_contains (st, *tp);
4301 /* If we didn't already remap this SAVE_EXPR, do so now. */
4304 t = copy_node (*tp);
4306 /* Remember this SAVE_EXPR. */
4307 *pointer_map_insert (st, *tp) = t;
4308 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4309 *pointer_map_insert (st, t) = t;
4313 /* We've already walked into this SAVE_EXPR; don't do it again. */
4318 /* Replace this SAVE_EXPR with the copy. */
4322 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4323 copies the declaration and enters it in the splay_tree in DATA (which is
4324 really an `copy_body_data *'). */
4327 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
4330 copy_body_data *id = (copy_body_data *) data;
4332 /* Don't walk into types. */
4336 else if (TREE_CODE (*tp) == LABEL_EXPR)
4338 tree decl = TREE_OPERAND (*tp, 0);
4340 /* Copy the decl and remember the copy. */
4341 insert_decl_map (id, decl, id->copy_decl (decl, id));
4347 /* Perform any modifications to EXPR required when it is unsaved. Does
4348 not recurse into EXPR's subtrees. */
4351 unsave_expr_1 (tree expr)
4353 switch (TREE_CODE (expr))
4356 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4357 It's OK for this to happen if it was part of a subtree that
4358 isn't immediately expanded, such as operand 2 of another
4360 if (TREE_OPERAND (expr, 1))
4363 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4364 TREE_OPERAND (expr, 3) = NULL_TREE;
4372 /* Called via walk_tree when an expression is unsaved. Using the
4373 splay_tree pointed to by ST (which is really a `splay_tree'),
4374 remaps all local declarations to appropriate replacements. */
4377 unsave_r (tree *tp, int *walk_subtrees, void *data)
4379 copy_body_data *id = (copy_body_data *) data;
4380 struct pointer_map_t *st = id->decl_map;
4383 /* Only a local declaration (variable or label). */
4384 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
4385 || TREE_CODE (*tp) == LABEL_DECL)
4387 /* Lookup the declaration. */
4388 n = (tree *) pointer_map_contains (st, *tp);
4390 /* If it's there, remap it. */
4395 else if (TREE_CODE (*tp) == STATEMENT_LIST)
4397 else if (TREE_CODE (*tp) == BIND_EXPR)
4398 copy_bind_expr (tp, walk_subtrees, id);
4399 else if (TREE_CODE (*tp) == SAVE_EXPR
4400 || TREE_CODE (*tp) == TARGET_EXPR)
4401 remap_save_expr (tp, st, walk_subtrees);
4404 copy_tree_r (tp, walk_subtrees, NULL);
4406 /* Do whatever unsaving is required. */
4407 unsave_expr_1 (*tp);
4410 /* Keep iterating. */
4414 /* Copies everything in EXPR and replaces variables, labels
4415 and SAVE_EXPRs local to EXPR. */
4418 unsave_expr_now (tree expr)
4422 /* There's nothing to do for NULL_TREE. */
4427 memset (&id, 0, sizeof (id));
4428 id.src_fn = current_function_decl;
4429 id.dst_fn = current_function_decl;
4430 id.decl_map = pointer_map_create ();
4431 id.debug_map = NULL;
4433 id.copy_decl = copy_decl_no_change;
4434 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4435 id.transform_new_cfg = false;
4436 id.transform_return_to_modify = false;
4437 id.transform_lang_insert_block = NULL;
4439 /* Walk the tree once to find local labels. */
4440 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
4442 /* Walk the tree again, copying, remapping, and unsaving. */
4443 walk_tree (&expr, unsave_r, &id, NULL);
4446 pointer_map_destroy (id.decl_map);
4448 pointer_map_destroy (id.debug_map);
4453 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4454 label, copies the declaration and enters it in the splay_tree in DATA (which
4455 is really a 'copy_body_data *'. */
4458 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
4459 bool *handled_ops_p ATTRIBUTE_UNUSED,
4460 struct walk_stmt_info *wi)
4462 copy_body_data *id = (copy_body_data *) wi->info;
4463 gimple stmt = gsi_stmt (*gsip);
4465 if (gimple_code (stmt) == GIMPLE_LABEL)
4467 tree decl = gimple_label_label (stmt);
4469 /* Copy the decl and remember the copy. */
4470 insert_decl_map (id, decl, id->copy_decl (decl, id));
4477 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4478 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4479 remaps all local declarations to appropriate replacements in gimple
4483 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
4485 struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
4486 copy_body_data *id = (copy_body_data *) wi->info;
4487 struct pointer_map_t *st = id->decl_map;
4491 /* Only a local declaration (variable or label). */
4492 if ((TREE_CODE (expr) == VAR_DECL
4493 && !TREE_STATIC (expr))
4494 || TREE_CODE (expr) == LABEL_DECL)
4496 /* Lookup the declaration. */
4497 n = (tree *) pointer_map_contains (st, expr);
4499 /* If it's there, remap it. */
4504 else if (TREE_CODE (expr) == STATEMENT_LIST
4505 || TREE_CODE (expr) == BIND_EXPR
4506 || TREE_CODE (expr) == SAVE_EXPR)
4508 else if (TREE_CODE (expr) == TARGET_EXPR)
4510 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4511 It's OK for this to happen if it was part of a subtree that
4512 isn't immediately expanded, such as operand 2 of another
4514 if (!TREE_OPERAND (expr, 1))
4516 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4517 TREE_OPERAND (expr, 3) = NULL_TREE;
4521 /* Keep iterating. */
4526 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4527 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4528 remaps all local declarations to appropriate replacements in gimple
4532 replace_locals_stmt (gimple_stmt_iterator *gsip,
4533 bool *handled_ops_p ATTRIBUTE_UNUSED,
4534 struct walk_stmt_info *wi)
4536 copy_body_data *id = (copy_body_data *) wi->info;
4537 gimple stmt = gsi_stmt (*gsip);
4539 if (gimple_code (stmt) == GIMPLE_BIND)
4541 tree block = gimple_bind_block (stmt);
4545 remap_block (&block, id);
4546 gimple_bind_set_block (stmt, block);
4549 /* This will remap a lot of the same decls again, but this should be
4551 if (gimple_bind_vars (stmt))
4552 gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id));
4555 /* Keep iterating. */
4560 /* Copies everything in SEQ and replaces variables and labels local to
4561 current_function_decl. */
4564 copy_gimple_seq_and_replace_locals (gimple_seq seq)
4567 struct walk_stmt_info wi;
4568 struct pointer_set_t *visited;
4571 /* There's nothing to do for NULL_TREE. */
4576 memset (&id, 0, sizeof (id));
4577 id.src_fn = current_function_decl;
4578 id.dst_fn = current_function_decl;
4579 id.decl_map = pointer_map_create ();
4580 id.debug_map = NULL;
4582 id.copy_decl = copy_decl_no_change;
4583 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4584 id.transform_new_cfg = false;
4585 id.transform_return_to_modify = false;
4586 id.transform_lang_insert_block = NULL;
4588 /* Walk the tree once to find local labels. */
4589 memset (&wi, 0, sizeof (wi));
4590 visited = pointer_set_create ();
4593 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
4594 pointer_set_destroy (visited);
4596 copy = gimple_seq_copy (seq);
4598 /* Walk the copy, remapping decls. */
4599 memset (&wi, 0, sizeof (wi));
4601 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
4604 pointer_map_destroy (id.decl_map);
4606 pointer_map_destroy (id.debug_map);
4612 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4615 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
4624 debug_find_tree (tree top, tree search)
4626 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
4630 /* Declare the variables created by the inliner. Add all the variables in
4631 VARS to BIND_EXPR. */
4634 declare_inline_vars (tree block, tree vars)
4637 for (t = vars; t; t = TREE_CHAIN (t))
4639 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
4640 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
4641 cfun->local_decls = tree_cons (NULL_TREE, t, cfun->local_decls);
4645 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
4648 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4649 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4650 VAR_DECL translation. */
4653 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
4655 /* Don't generate debug information for the copy if we wouldn't have
4656 generated it for the copy either. */
4657 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
4658 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
4660 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4661 declaration inspired this copy. */
4662 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
4664 /* The new variable/label has no RTL, yet. */
4665 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
4666 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
4667 SET_DECL_RTL (copy, NULL_RTX);
4669 /* These args would always appear unused, if not for this. */
4670 TREE_USED (copy) = 1;
4672 /* Set the context for the new declaration. */
4673 if (!DECL_CONTEXT (decl))
4674 /* Globals stay global. */
4676 else if (DECL_CONTEXT (decl) != id->src_fn)
4677 /* Things that weren't in the scope of the function we're inlining
4678 from aren't in the scope we're inlining to, either. */
4680 else if (TREE_STATIC (decl))
4681 /* Function-scoped static variables should stay in the original
4685 /* Ordinary automatic local variables are now in the scope of the
4687 DECL_CONTEXT (copy) = id->dst_fn;
4693 copy_decl_to_var (tree decl, copy_body_data *id)
4697 gcc_assert (TREE_CODE (decl) == PARM_DECL
4698 || TREE_CODE (decl) == RESULT_DECL);
4700 type = TREE_TYPE (decl);
4702 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4703 VAR_DECL, DECL_NAME (decl), type);
4704 if (DECL_PT_UID_SET_P (decl))
4705 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
4706 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4707 TREE_READONLY (copy) = TREE_READONLY (decl);
4708 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4709 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4711 return copy_decl_for_dup_finish (id, decl, copy);
4714 /* Like copy_decl_to_var, but create a return slot object instead of a
4715 pointer variable for return by invisible reference. */
4718 copy_result_decl_to_var (tree decl, copy_body_data *id)
4722 gcc_assert (TREE_CODE (decl) == PARM_DECL
4723 || TREE_CODE (decl) == RESULT_DECL);
4725 type = TREE_TYPE (decl);
4726 if (DECL_BY_REFERENCE (decl))
4727 type = TREE_TYPE (type);
4729 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4730 VAR_DECL, DECL_NAME (decl), type);
4731 if (DECL_PT_UID_SET_P (decl))
4732 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
4733 TREE_READONLY (copy) = TREE_READONLY (decl);
4734 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4735 if (!DECL_BY_REFERENCE (decl))
4737 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4738 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4741 return copy_decl_for_dup_finish (id, decl, copy);
4745 copy_decl_no_change (tree decl, copy_body_data *id)
4749 copy = copy_node (decl);
4751 /* The COPY is not abstract; it will be generated in DST_FN. */
4752 DECL_ABSTRACT (copy) = 0;
4753 lang_hooks.dup_lang_specific_decl (copy);
4755 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4756 been taken; it's for internal bookkeeping in expand_goto_internal. */
4757 if (TREE_CODE (copy) == LABEL_DECL)
4759 TREE_ADDRESSABLE (copy) = 0;
4760 LABEL_DECL_UID (copy) = -1;
4763 return copy_decl_for_dup_finish (id, decl, copy);
4767 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
4769 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
4770 return copy_decl_to_var (decl, id);
4772 return copy_decl_no_change (decl, id);
4775 /* Return a copy of the function's argument tree. */
4777 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
4778 bitmap args_to_skip, tree *vars)
4781 tree new_parm = NULL;
4786 for (arg = orig_parm; arg; arg = TREE_CHAIN (arg), i++)
4787 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
4789 tree new_tree = remap_decl (arg, id);
4790 lang_hooks.dup_lang_specific_decl (new_tree);
4792 parg = &TREE_CHAIN (new_tree);
4794 else if (!pointer_map_contains (id->decl_map, arg))
4796 /* Make an equivalent VAR_DECL. If the argument was used
4797 as temporary variable later in function, the uses will be
4798 replaced by local variable. */
4799 tree var = copy_decl_to_var (arg, id);
4801 add_referenced_var (var);
4802 insert_decl_map (id, arg, var);
4803 /* Declare this new variable. */
4804 TREE_CHAIN (var) = *vars;
4810 /* Return a copy of the function's static chain. */
4812 copy_static_chain (tree static_chain, copy_body_data * id)
4814 tree *chain_copy, *pvar;
4816 chain_copy = &static_chain;
4817 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
4819 tree new_tree = remap_decl (*pvar, id);
4820 lang_hooks.dup_lang_specific_decl (new_tree);
4821 TREE_CHAIN (new_tree) = TREE_CHAIN (*pvar);
4824 return static_chain;
4827 /* Return true if the function is allowed to be versioned.
4828 This is a guard for the versioning functionality. */
4831 tree_versionable_function_p (tree fndecl)
4833 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl))
4834 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl), fndecl) == NULL);
4837 /* Delete all unreachable basic blocks and update callgraph.
4838 Doing so is somewhat nontrivial because we need to update all clones and
4839 remove inline function that become unreachable. */
4842 delete_unreachable_blocks_update_callgraph (copy_body_data *id)
4844 bool changed = false;
4845 basic_block b, next_bb;
4847 find_unreachable_blocks ();
4849 /* Delete all unreachable basic blocks. */
4851 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR; b = next_bb)
4853 next_bb = b->next_bb;
4855 if (!(b->flags & BB_REACHABLE))
4857 gimple_stmt_iterator bsi;
4859 for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi))
4860 if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL)
4862 struct cgraph_edge *e;
4863 struct cgraph_node *node;
4865 if ((e = cgraph_edge (id->dst_node, gsi_stmt (bsi))) != NULL)
4867 if (!e->inline_failed)
4868 cgraph_remove_node_and_inline_clones (e->callee);
4870 cgraph_remove_edge (e);
4872 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4873 && id->dst_node->clones)
4874 for (node = id->dst_node->clones; node != id->dst_node;)
4876 if ((e = cgraph_edge (node, gsi_stmt (bsi))) != NULL)
4878 if (!e->inline_failed)
4879 cgraph_remove_node_and_inline_clones (e->callee);
4881 cgraph_remove_edge (e);
4885 node = node->clones;
4886 else if (node->next_sibling_clone)
4887 node = node->next_sibling_clone;
4890 while (node != id->dst_node && !node->next_sibling_clone)
4891 node = node->clone_of;
4892 if (node != id->dst_node)
4893 node = node->next_sibling_clone;
4897 delete_basic_block (b);
4903 tidy_fallthru_edges ();
4907 /* Update clone info after duplication. */
4910 update_clone_info (copy_body_data * id)
4912 struct cgraph_node *node;
4913 if (!id->dst_node->clones)
4915 for (node = id->dst_node->clones; node != id->dst_node;)
4917 /* First update replace maps to match the new body. */
4918 if (node->clone.tree_map)
4921 for (i = 0; i < VEC_length (ipa_replace_map_p, node->clone.tree_map); i++)
4923 struct ipa_replace_map *replace_info;
4924 replace_info = VEC_index (ipa_replace_map_p, node->clone.tree_map, i);
4925 walk_tree (&replace_info->old_tree, copy_tree_body_r, id, NULL);
4926 walk_tree (&replace_info->new_tree, copy_tree_body_r, id, NULL);
4930 node = node->clones;
4931 else if (node->next_sibling_clone)
4932 node = node->next_sibling_clone;
4935 while (node != id->dst_node && !node->next_sibling_clone)
4936 node = node->clone_of;
4937 if (node != id->dst_node)
4938 node = node->next_sibling_clone;
4943 /* Create a copy of a function's tree.
4944 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4945 of the original function and the new copied function
4946 respectively. In case we want to replace a DECL
4947 tree with another tree while duplicating the function's
4948 body, TREE_MAP represents the mapping between these
4949 trees. If UPDATE_CLONES is set, the call_stmt fields
4950 of edges of clones of the function will be updated. */
4952 tree_function_versioning (tree old_decl, tree new_decl,
4953 VEC(ipa_replace_map_p,gc)* tree_map,
4954 bool update_clones, bitmap args_to_skip)
4956 struct cgraph_node *old_version_node;
4957 struct cgraph_node *new_version_node;
4961 struct ipa_replace_map *replace_info;
4962 basic_block old_entry_block, bb;
4963 VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10);
4966 tree old_current_function_decl = current_function_decl;
4967 tree vars = NULL_TREE;
4969 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
4970 && TREE_CODE (new_decl) == FUNCTION_DECL);
4971 DECL_POSSIBLY_INLINED (old_decl) = 1;
4973 old_version_node = cgraph_node (old_decl);
4974 new_version_node = cgraph_node (new_decl);
4976 /* Output the inlining info for this abstract function, since it has been
4977 inlined. If we don't do this now, we can lose the information about the
4978 variables in the function when the blocks get blown away as soon as we
4979 remove the cgraph node. */
4980 (*debug_hooks->outlining_inline_function) (old_decl);
4982 DECL_ARTIFICIAL (new_decl) = 1;
4983 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
4984 DECL_FUNCTION_PERSONALITY (new_decl) = DECL_FUNCTION_PERSONALITY (old_decl);
4986 /* Prepare the data structures for the tree copy. */
4987 memset (&id, 0, sizeof (id));
4989 /* Generate a new name for the new version. */
4990 id.statements_to_fold = pointer_set_create ();
4992 id.decl_map = pointer_map_create ();
4993 id.debug_map = NULL;
4994 id.src_fn = old_decl;
4995 id.dst_fn = new_decl;
4996 id.src_node = old_version_node;
4997 id.dst_node = new_version_node;
4998 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
4999 if (id.src_node->ipa_transforms_to_apply)
5001 VEC(ipa_opt_pass,heap) * old_transforms_to_apply = id.dst_node->ipa_transforms_to_apply;
5004 id.dst_node->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap,
5005 id.src_node->ipa_transforms_to_apply);
5006 for (i = 0; i < VEC_length (ipa_opt_pass, old_transforms_to_apply); i++)
5007 VEC_safe_push (ipa_opt_pass, heap, id.dst_node->ipa_transforms_to_apply,
5008 VEC_index (ipa_opt_pass,
5009 old_transforms_to_apply,
5013 id.copy_decl = copy_decl_no_change;
5014 id.transform_call_graph_edges
5015 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
5016 id.transform_new_cfg = true;
5017 id.transform_return_to_modify = false;
5018 id.transform_lang_insert_block = NULL;
5020 current_function_decl = new_decl;
5021 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
5022 (DECL_STRUCT_FUNCTION (old_decl));
5023 initialize_cfun (new_decl, old_decl,
5024 old_entry_block->count);
5025 DECL_STRUCT_FUNCTION (new_decl)->gimple_df->ipa_pta
5026 = id.src_cfun->gimple_df->ipa_pta;
5027 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
5029 /* Copy the function's static chain. */
5030 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
5032 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
5033 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
5036 /* If there's a tree_map, prepare for substitution. */
5038 for (i = 0; i < VEC_length (ipa_replace_map_p, tree_map); i++)
5041 replace_info = VEC_index (ipa_replace_map_p, tree_map, i);
5042 if (replace_info->replace_p)
5044 tree op = replace_info->new_tree;
5045 if (!replace_info->old_tree)
5047 int i = replace_info->parm_num;
5049 for (parm = DECL_ARGUMENTS (old_decl); i; parm = TREE_CHAIN (parm))
5051 replace_info->old_tree = parm;
5057 if (TREE_CODE (op) == VIEW_CONVERT_EXPR)
5058 op = TREE_OPERAND (op, 0);
5060 if (TREE_CODE (op) == ADDR_EXPR)
5062 op = TREE_OPERAND (op, 0);
5063 while (handled_component_p (op))
5064 op = TREE_OPERAND (op, 0);
5065 if (TREE_CODE (op) == VAR_DECL)
5066 add_referenced_var (op);
5068 gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
5069 init = setup_one_parameter (&id, replace_info->old_tree,
5070 replace_info->new_tree, id.src_fn,
5074 VEC_safe_push (gimple, heap, init_stmts, init);
5077 /* Copy the function's arguments. */
5078 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
5079 DECL_ARGUMENTS (new_decl) =
5080 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
5081 args_to_skip, &vars);
5083 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
5085 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5086 number_blocks (id.dst_fn);
5088 declare_inline_vars (DECL_INITIAL (new_decl), vars);
5090 if (DECL_STRUCT_FUNCTION (old_decl)->local_decls != NULL_TREE)
5091 /* Add local vars. */
5092 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->local_decls;
5093 t_step; t_step = TREE_CHAIN (t_step))
5095 tree var = TREE_VALUE (t_step);
5096 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
5097 cfun->local_decls = tree_cons (NULL_TREE, var, cfun->local_decls);
5098 else if (!can_be_nonlocal (var, &id))
5100 tree_cons (NULL_TREE, remap_decl (var, &id),
5104 /* Copy the Function's body. */
5105 copy_body (&id, old_entry_block->count, REG_BR_PROB_BASE,
5106 ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
5108 if (DECL_RESULT (old_decl) != NULL_TREE)
5110 tree *res_decl = &DECL_RESULT (old_decl);
5111 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
5112 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
5115 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5116 number_blocks (new_decl);
5118 /* We want to create the BB unconditionally, so that the addition of
5119 debug stmts doesn't affect BB count, which may in the end cause
5120 codegen differences. */
5121 bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
5122 while (VEC_length (gimple, init_stmts))
5123 insert_init_stmt (&id, bb, VEC_pop (gimple, init_stmts));
5124 update_clone_info (&id);
5126 /* Remap the nonlocal_goto_save_area, if any. */
5127 if (cfun->nonlocal_goto_save_area)
5129 struct walk_stmt_info wi;
5131 memset (&wi, 0, sizeof (wi));
5133 walk_tree (&cfun->nonlocal_goto_save_area, remap_gimple_op_r, &wi, NULL);
5137 pointer_map_destroy (id.decl_map);
5139 pointer_map_destroy (id.debug_map);
5140 free_dominance_info (CDI_DOMINATORS);
5141 free_dominance_info (CDI_POST_DOMINATORS);
5143 fold_marked_statements (0, id.statements_to_fold);
5144 pointer_set_destroy (id.statements_to_fold);
5145 fold_cond_expr_cond ();
5146 delete_unreachable_blocks_update_callgraph (&id);
5147 if (id.dst_node->analyzed)
5148 cgraph_rebuild_references ();
5149 update_ssa (TODO_update_ssa);
5150 free_dominance_info (CDI_DOMINATORS);
5151 free_dominance_info (CDI_POST_DOMINATORS);
5153 gcc_assert (!id.debug_stmts);
5154 VEC_free (gimple, heap, init_stmts);
5156 current_function_decl = old_current_function_decl;
5157 gcc_assert (!current_function_decl
5158 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
5162 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5163 the callee and return the inlined body on success. */
5166 maybe_inline_call_in_expr (tree exp)
5168 tree fn = get_callee_fndecl (exp);
5170 /* We can only try to inline "const" functions. */
5171 if (fn && TREE_READONLY (fn) && DECL_SAVED_TREE (fn))
5173 struct pointer_map_t *decl_map = pointer_map_create ();
5174 call_expr_arg_iterator iter;
5178 /* Remap the parameters. */
5179 for (param = DECL_ARGUMENTS (fn), arg = first_call_expr_arg (exp, &iter);
5181 param = TREE_CHAIN (param), arg = next_call_expr_arg (&iter))
5182 *pointer_map_insert (decl_map, param) = arg;
5184 memset (&id, 0, sizeof (id));
5186 id.dst_fn = current_function_decl;
5187 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
5188 id.decl_map = decl_map;
5190 id.copy_decl = copy_decl_no_change;
5191 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
5192 id.transform_new_cfg = false;
5193 id.transform_return_to_modify = true;
5194 id.transform_lang_insert_block = false;
5196 /* Make sure not to unshare trees behind the front-end's back
5197 since front-end specific mechanisms may rely on sharing. */
5198 id.regimplify = false;
5199 id.do_not_unshare = true;
5201 /* We're not inside any EH region. */
5204 t = copy_tree_body (&id);
5205 pointer_map_destroy (decl_map);
5207 /* We can only return something suitable for use in a GENERIC
5209 if (TREE_CODE (t) == MODIFY_EXPR)
5210 return TREE_OPERAND (t, 1);
5216 /* Duplicate a type, fields and all. */
5219 build_duplicate_type (tree type)
5221 struct copy_body_data id;
5223 memset (&id, 0, sizeof (id));
5224 id.src_fn = current_function_decl;
5225 id.dst_fn = current_function_decl;
5227 id.decl_map = pointer_map_create ();
5228 id.debug_map = NULL;
5229 id.copy_decl = copy_decl_no_change;
5231 type = remap_type_1 (type, &id);
5233 pointer_map_destroy (id.decl_map);
5235 pointer_map_destroy (id.debug_map);
5237 TYPE_CANONICAL (type) = type;
5242 /* Return whether it is safe to inline a function because it used different
5243 target specific options or call site actual types mismatch parameter types.
5244 E is the call edge to be checked. */
5246 tree_can_inline_p (struct cgraph_edge *e)
5249 /* This causes a regression in SPEC in that it prevents a cold function from
5250 inlining a hot function. Perhaps this should only apply to functions
5251 that the user declares hot/cold/optimize explicitly. */
5253 /* Don't inline a function with a higher optimization level than the
5254 caller, or with different space constraints (hot/cold functions). */
5255 tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller);
5256 tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee);
5258 if (caller_tree != callee_tree)
5260 struct cl_optimization *caller_opt
5261 = TREE_OPTIMIZATION ((caller_tree)
5263 : optimization_default_node);
5265 struct cl_optimization *callee_opt
5266 = TREE_OPTIMIZATION ((callee_tree)
5268 : optimization_default_node);
5270 if ((caller_opt->optimize > callee_opt->optimize)
5271 || (caller_opt->optimize_size != callee_opt->optimize_size))
5275 tree caller, callee, lhs;
5277 caller = e->caller->decl;
5278 callee = e->callee->decl;
5280 /* First check that inlining isn't simply forbidden in this case. */
5281 if (inline_forbidden_into_p (caller, callee))
5283 e->inline_failed = CIF_UNSPECIFIED;
5284 gimple_call_set_cannot_inline (e->call_stmt, true);
5288 /* Allow the backend to decide if inlining is ok. */
5289 if (!targetm.target_option.can_inline_p (caller, callee))
5291 e->inline_failed = CIF_TARGET_OPTION_MISMATCH;
5292 gimple_call_set_cannot_inline (e->call_stmt, true);
5293 e->call_stmt_cannot_inline_p = true;
5297 /* Do not inline calls where we cannot triviall work around mismatches
5298 in argument or return types. */
5300 && ((DECL_RESULT (callee)
5301 && !DECL_BY_REFERENCE (DECL_RESULT (callee))
5302 && (lhs = gimple_call_lhs (e->call_stmt)) != NULL_TREE
5303 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee)),
5305 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee)), lhs))
5306 || !gimple_check_call_args (e->call_stmt)))
5308 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
5309 gimple_call_set_cannot_inline (e->call_stmt, true);
5310 e->call_stmt_cannot_inline_p = true;