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"
34 #include "insn-config.h"
36 #include "langhooks.h"
37 #include "basic-block.h"
38 #include "tree-iterator.h"
41 #include "tree-mudflap.h"
42 #include "tree-flow.h"
45 #include "tree-flow.h"
46 #include "diagnostic.h"
49 #include "pointer-set.h"
51 #include "value-prof.h"
52 #include "tree-pass.h"
54 #include "integrate.h"
56 /* I'm not real happy about this, but we need to handle gimple and
60 /* Inlining, Cloning, Versioning, Parallelization
62 Inlining: a function body is duplicated, but the PARM_DECLs are
63 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
64 MODIFY_EXPRs that store to a dedicated returned-value variable.
65 The duplicated eh_region info of the copy will later be appended
66 to the info for the caller; the eh_region info in copied throwing
67 statements and RESX statements are adjusted accordingly.
69 Cloning: (only in C++) We have one body for a con/de/structor, and
70 multiple function decls, each with a unique parameter list.
71 Duplicate the body, using the given splay tree; some parameters
72 will become constants (like 0 or 1).
74 Versioning: a function body is duplicated and the result is a new
75 function rather than into blocks of an existing function as with
76 inlining. Some parameters will become constants.
78 Parallelization: a region of a function is duplicated resulting in
79 a new function. Variables may be replaced with complex expressions
80 to enable shared variable semantics.
82 All of these will simultaneously lookup any callgraph edges. If
83 we're going to inline the duplicated function body, and the given
84 function has some cloned callgraph nodes (one for each place this
85 function will be inlined) those callgraph edges will be duplicated.
86 If we're cloning the body, those callgraph edges will be
87 updated to point into the new body. (Note that the original
88 callgraph node and edge list will not be altered.)
90 See the CALL_EXPR handling case in copy_tree_body_r (). */
94 o In order to make inlining-on-trees work, we pessimized
95 function-local static constants. In particular, they are now
96 always output, even when not addressed. Fix this by treating
97 function-local static constants just like global static
98 constants; the back-end already knows not to output them if they
101 o Provide heuristics to clamp inlining of recursive template
105 /* Weights that estimate_num_insns uses for heuristics in inlining. */
107 eni_weights eni_inlining_weights;
109 /* Weights that estimate_num_insns uses to estimate the size of the
112 eni_weights eni_size_weights;
114 /* Weights that estimate_num_insns uses to estimate the time necessary
115 to execute the produced code. */
117 eni_weights eni_time_weights;
121 static tree declare_return_variable (copy_body_data *, tree, tree);
122 static void remap_block (tree *, copy_body_data *);
123 static void copy_bind_expr (tree *, int *, copy_body_data *);
124 static tree mark_local_for_remap_r (tree *, int *, void *);
125 static void unsave_expr_1 (tree);
126 static tree unsave_r (tree *, int *, void *);
127 static void declare_inline_vars (tree, tree);
128 static void remap_save_expr (tree *, void *, int *);
129 static void prepend_lexical_block (tree current_block, tree new_block);
130 static tree copy_decl_to_var (tree, copy_body_data *);
131 static tree copy_result_decl_to_var (tree, copy_body_data *);
132 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
133 static gimple remap_gimple_stmt (gimple, copy_body_data *);
134 static bool delete_unreachable_blocks_update_callgraph (copy_body_data *id);
136 /* Insert a tree->tree mapping for ID. Despite the name suggests
137 that the trees should be variables, it is used for more than that. */
140 insert_decl_map (copy_body_data *id, tree key, tree value)
142 *pointer_map_insert (id->decl_map, key) = value;
144 /* Always insert an identity map as well. If we see this same new
145 node again, we won't want to duplicate it a second time. */
147 *pointer_map_insert (id->decl_map, value) = value;
150 /* Insert a tree->tree mapping for ID. This is only used for
154 insert_debug_decl_map (copy_body_data *id, tree key, tree value)
156 if (!gimple_in_ssa_p (id->src_cfun))
159 if (!MAY_HAVE_DEBUG_STMTS)
162 if (!target_for_debug_bind (key))
165 gcc_assert (TREE_CODE (key) == PARM_DECL);
166 gcc_assert (TREE_CODE (value) == VAR_DECL);
169 id->debug_map = pointer_map_create ();
171 *pointer_map_insert (id->debug_map, key) = value;
174 /* If nonzero, we're remapping the contents of inlined debug
175 statements. If negative, an error has occurred, such as a
176 reference to a variable that isn't available in the inlined
178 static int processing_debug_stmt = 0;
180 /* Construct new SSA name for old NAME. ID is the inline context. */
183 remap_ssa_name (tree name, copy_body_data *id)
188 gcc_assert (TREE_CODE (name) == SSA_NAME);
190 n = (tree *) pointer_map_contains (id->decl_map, name);
192 return unshare_expr (*n);
194 if (processing_debug_stmt)
196 processing_debug_stmt = -1;
200 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
202 new_tree = remap_decl (SSA_NAME_VAR (name), id);
204 /* We might've substituted constant or another SSA_NAME for
207 Replace the SSA name representing RESULT_DECL by variable during
208 inlining: this saves us from need to introduce PHI node in a case
209 return value is just partly initialized. */
210 if ((TREE_CODE (new_tree) == VAR_DECL || TREE_CODE (new_tree) == PARM_DECL)
211 && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
212 || !id->transform_return_to_modify))
214 new_tree = make_ssa_name (new_tree, NULL);
215 insert_decl_map (id, name, new_tree);
216 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree)
217 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
218 TREE_TYPE (new_tree) = TREE_TYPE (SSA_NAME_VAR (new_tree));
219 if (gimple_nop_p (SSA_NAME_DEF_STMT (name)))
221 /* By inlining function having uninitialized variable, we might
222 extend the lifetime (variable might get reused). This cause
223 ICE in the case we end up extending lifetime of SSA name across
224 abnormal edge, but also increase register pressure.
226 We simply initialize all uninitialized vars by 0 except
227 for case we are inlining to very first BB. We can avoid
228 this for all BBs that are not inside strongly connected
229 regions of the CFG, but this is expensive to test. */
231 && is_gimple_reg (SSA_NAME_VAR (name))
232 && TREE_CODE (SSA_NAME_VAR (name)) != PARM_DECL
233 && (id->entry_bb != EDGE_SUCC (ENTRY_BLOCK_PTR, 0)->dest
234 || EDGE_COUNT (id->entry_bb->preds) != 1))
236 gimple_stmt_iterator gsi = gsi_last_bb (id->entry_bb);
239 init_stmt = gimple_build_assign (new_tree,
240 fold_convert (TREE_TYPE (new_tree),
242 gsi_insert_after (&gsi, init_stmt, GSI_NEW_STMT);
243 SSA_NAME_IS_DEFAULT_DEF (new_tree) = 0;
247 SSA_NAME_DEF_STMT (new_tree) = gimple_build_nop ();
248 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name))
250 set_default_def (SSA_NAME_VAR (new_tree), new_tree);
255 insert_decl_map (id, name, new_tree);
259 /* Remap DECL during the copying of the BLOCK tree for the function. */
262 remap_decl (tree decl, copy_body_data *id)
266 /* We only remap local variables in the current function. */
268 /* See if we have remapped this declaration. */
270 n = (tree *) pointer_map_contains (id->decl_map, decl);
272 if (!n && processing_debug_stmt)
274 processing_debug_stmt = -1;
278 /* If we didn't already have an equivalent for this declaration,
282 /* Make a copy of the variable or label. */
283 tree t = id->copy_decl (decl, id);
285 /* Remember it, so that if we encounter this local entity again
286 we can reuse this copy. Do this early because remap_type may
287 need this decl for TYPE_STUB_DECL. */
288 insert_decl_map (id, decl, t);
293 /* Remap types, if necessary. */
294 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
295 if (TREE_CODE (t) == TYPE_DECL)
296 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
298 /* Remap sizes as necessary. */
299 walk_tree (&DECL_SIZE (t), copy_tree_body_r, id, NULL);
300 walk_tree (&DECL_SIZE_UNIT (t), copy_tree_body_r, id, NULL);
302 /* If fields, do likewise for offset and qualifier. */
303 if (TREE_CODE (t) == FIELD_DECL)
305 walk_tree (&DECL_FIELD_OFFSET (t), copy_tree_body_r, id, NULL);
306 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
307 walk_tree (&DECL_QUALIFIER (t), copy_tree_body_r, id, NULL);
310 if (cfun && gimple_in_ssa_p (cfun)
311 && (TREE_CODE (t) == VAR_DECL
312 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
314 tree def = gimple_default_def (id->src_cfun, decl);
316 if (TREE_CODE (decl) != PARM_DECL && def)
318 tree map = remap_ssa_name (def, id);
319 /* Watch out RESULT_DECLs whose SSA names map directly
321 if (TREE_CODE (map) == SSA_NAME
322 && gimple_nop_p (SSA_NAME_DEF_STMT (map)))
323 set_default_def (t, map);
325 add_referenced_var (t);
330 if (id->do_not_unshare)
333 return unshare_expr (*n);
337 remap_type_1 (tree type, copy_body_data *id)
341 /* We do need a copy. build and register it now. If this is a pointer or
342 reference type, remap the designated type and make a new pointer or
344 if (TREE_CODE (type) == POINTER_TYPE)
346 new_tree = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
348 TYPE_REF_CAN_ALIAS_ALL (type));
349 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
350 new_tree = build_type_attribute_qual_variant (new_tree,
351 TYPE_ATTRIBUTES (type),
353 insert_decl_map (id, type, new_tree);
356 else if (TREE_CODE (type) == REFERENCE_TYPE)
358 new_tree = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
360 TYPE_REF_CAN_ALIAS_ALL (type));
361 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
362 new_tree = build_type_attribute_qual_variant (new_tree,
363 TYPE_ATTRIBUTES (type),
365 insert_decl_map (id, type, new_tree);
369 new_tree = copy_node (type);
371 insert_decl_map (id, type, new_tree);
373 /* This is a new type, not a copy of an old type. Need to reassociate
374 variants. We can handle everything except the main variant lazily. */
375 t = TYPE_MAIN_VARIANT (type);
378 t = remap_type (t, id);
379 TYPE_MAIN_VARIANT (new_tree) = t;
380 TYPE_NEXT_VARIANT (new_tree) = TYPE_NEXT_VARIANT (t);
381 TYPE_NEXT_VARIANT (t) = new_tree;
385 TYPE_MAIN_VARIANT (new_tree) = new_tree;
386 TYPE_NEXT_VARIANT (new_tree) = NULL;
389 if (TYPE_STUB_DECL (type))
390 TYPE_STUB_DECL (new_tree) = remap_decl (TYPE_STUB_DECL (type), id);
392 /* Lazily create pointer and reference types. */
393 TYPE_POINTER_TO (new_tree) = NULL;
394 TYPE_REFERENCE_TO (new_tree) = NULL;
396 switch (TREE_CODE (new_tree))
400 case FIXED_POINT_TYPE:
403 t = TYPE_MIN_VALUE (new_tree);
404 if (t && TREE_CODE (t) != INTEGER_CST)
405 walk_tree (&TYPE_MIN_VALUE (new_tree), copy_tree_body_r, id, NULL);
407 t = TYPE_MAX_VALUE (new_tree);
408 if (t && TREE_CODE (t) != INTEGER_CST)
409 walk_tree (&TYPE_MAX_VALUE (new_tree), copy_tree_body_r, id, NULL);
413 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
414 walk_tree (&TYPE_ARG_TYPES (new_tree), copy_tree_body_r, id, NULL);
418 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
419 TYPE_DOMAIN (new_tree) = remap_type (TYPE_DOMAIN (new_tree), id);
424 case QUAL_UNION_TYPE:
428 for (f = TYPE_FIELDS (new_tree); f ; f = TREE_CHAIN (f))
430 t = remap_decl (f, id);
431 DECL_CONTEXT (t) = new_tree;
435 TYPE_FIELDS (new_tree) = nreverse (nf);
441 /* Shouldn't have been thought variable sized. */
445 walk_tree (&TYPE_SIZE (new_tree), copy_tree_body_r, id, NULL);
446 walk_tree (&TYPE_SIZE_UNIT (new_tree), copy_tree_body_r, id, NULL);
452 remap_type (tree type, copy_body_data *id)
460 /* See if we have remapped this type. */
461 node = (tree *) pointer_map_contains (id->decl_map, type);
465 /* The type only needs remapping if it's variably modified. */
466 if (! variably_modified_type_p (type, id->src_fn))
468 insert_decl_map (id, type, type);
472 id->remapping_type_depth++;
473 tmp = remap_type_1 (type, id);
474 id->remapping_type_depth--;
479 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
480 is NULL or TYPE has not been remapped before. */
483 remapped_type (tree type, copy_body_data *id)
490 /* See if we have remapped this type. */
491 node = (tree *) pointer_map_contains (id->decl_map, type);
498 /* The type only needs remapping if it's variably modified. */
499 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
502 can_be_nonlocal (tree decl, copy_body_data *id)
504 /* We can not duplicate function decls. */
505 if (TREE_CODE (decl) == FUNCTION_DECL)
508 /* Local static vars must be non-local or we get multiple declaration
510 if (TREE_CODE (decl) == VAR_DECL
511 && !auto_var_in_fn_p (decl, id->src_fn))
514 /* At the moment dwarf2out can handle only these types of nodes. We
515 can support more later. */
516 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != PARM_DECL)
519 /* We must use global type. We call remapped_type instead of
520 remap_type since we don't want to remap this type here if it
521 hasn't been remapped before. */
522 if (TREE_TYPE (decl) != remapped_type (TREE_TYPE (decl), id))
525 /* Wihtout SSA we can't tell if variable is used. */
526 if (!gimple_in_ssa_p (cfun))
529 /* Live variables must be copied so we can attach DECL_RTL. */
537 remap_decls (tree decls, VEC(tree,gc) **nonlocalized_list, copy_body_data *id)
540 tree new_decls = NULL_TREE;
542 /* Remap its variables. */
543 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
546 tree origin_var = DECL_ORIGIN (old_var);
548 if (can_be_nonlocal (old_var, id))
550 if (TREE_CODE (old_var) == VAR_DECL
551 && ! DECL_EXTERNAL (old_var)
552 && (var_ann (old_var) || !gimple_in_ssa_p (cfun)))
553 cfun->local_decls = tree_cons (NULL_TREE, old_var,
555 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
556 && !DECL_IGNORED_P (old_var)
557 && nonlocalized_list)
558 VEC_safe_push (tree, gc, *nonlocalized_list, origin_var);
562 /* Remap the variable. */
563 new_var = remap_decl (old_var, id);
565 /* If we didn't remap this variable, we can't mess with its
566 TREE_CHAIN. If we remapped this variable to the return slot, it's
567 already declared somewhere else, so don't declare it here. */
569 if (new_var == id->retvar)
573 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
574 && !DECL_IGNORED_P (old_var)
575 && nonlocalized_list)
576 VEC_safe_push (tree, gc, *nonlocalized_list, origin_var);
580 gcc_assert (DECL_P (new_var));
581 TREE_CHAIN (new_var) = new_decls;
586 return nreverse (new_decls);
589 /* Copy the BLOCK to contain remapped versions of the variables
590 therein. And hook the new block into the block-tree. */
593 remap_block (tree *block, copy_body_data *id)
598 /* Make the new block. */
600 new_block = make_node (BLOCK);
601 TREE_USED (new_block) = TREE_USED (old_block);
602 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
603 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
604 BLOCK_NONLOCALIZED_VARS (new_block)
605 = VEC_copy (tree, gc, BLOCK_NONLOCALIZED_VARS (old_block));
608 /* Remap its variables. */
609 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block),
610 &BLOCK_NONLOCALIZED_VARS (new_block),
613 if (id->transform_lang_insert_block)
614 id->transform_lang_insert_block (new_block);
616 /* Remember the remapped block. */
617 insert_decl_map (id, old_block, new_block);
620 /* Copy the whole block tree and root it in id->block. */
622 remap_blocks (tree block, copy_body_data *id)
625 tree new_tree = block;
630 remap_block (&new_tree, id);
631 gcc_assert (new_tree != block);
632 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
633 prepend_lexical_block (new_tree, remap_blocks (t, id));
634 /* Blocks are in arbitrary order, but make things slightly prettier and do
635 not swap order when producing a copy. */
636 BLOCK_SUBBLOCKS (new_tree) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree));
641 copy_statement_list (tree *tp)
643 tree_stmt_iterator oi, ni;
646 new_tree = alloc_stmt_list ();
647 ni = tsi_start (new_tree);
648 oi = tsi_start (*tp);
649 TREE_TYPE (new_tree) = TREE_TYPE (*tp);
652 for (; !tsi_end_p (oi); tsi_next (&oi))
654 tree stmt = tsi_stmt (oi);
655 if (TREE_CODE (stmt) == STATEMENT_LIST)
656 copy_statement_list (&stmt);
657 tsi_link_after (&ni, stmt, TSI_CONTINUE_LINKING);
662 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
664 tree block = BIND_EXPR_BLOCK (*tp);
665 /* Copy (and replace) the statement. */
666 copy_tree_r (tp, walk_subtrees, NULL);
669 remap_block (&block, id);
670 BIND_EXPR_BLOCK (*tp) = block;
673 if (BIND_EXPR_VARS (*tp))
674 /* This will remap a lot of the same decls again, but this should be
676 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), NULL, id);
680 /* Create a new gimple_seq by remapping all the statements in BODY
681 using the inlining information in ID. */
684 remap_gimple_seq (gimple_seq body, copy_body_data *id)
686 gimple_stmt_iterator si;
687 gimple_seq new_body = NULL;
689 for (si = gsi_start (body); !gsi_end_p (si); gsi_next (&si))
691 gimple new_stmt = remap_gimple_stmt (gsi_stmt (si), id);
692 gimple_seq_add_stmt (&new_body, new_stmt);
699 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
700 block using the mapping information in ID. */
703 copy_gimple_bind (gimple stmt, copy_body_data *id)
706 tree new_block, new_vars;
707 gimple_seq body, new_body;
709 /* Copy the statement. Note that we purposely don't use copy_stmt
710 here because we need to remap statements as we copy. */
711 body = gimple_bind_body (stmt);
712 new_body = remap_gimple_seq (body, id);
714 new_block = gimple_bind_block (stmt);
716 remap_block (&new_block, id);
718 /* This will remap a lot of the same decls again, but this should be
720 new_vars = gimple_bind_vars (stmt);
722 new_vars = remap_decls (new_vars, NULL, id);
724 new_bind = gimple_build_bind (new_vars, new_body, new_block);
730 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
731 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
732 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
733 recursing into the children nodes of *TP. */
736 remap_gimple_op_r (tree *tp, int *walk_subtrees, void *data)
738 struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
739 copy_body_data *id = (copy_body_data *) wi_p->info;
740 tree fn = id->src_fn;
742 if (TREE_CODE (*tp) == SSA_NAME)
744 *tp = remap_ssa_name (*tp, id);
748 else if (auto_var_in_fn_p (*tp, fn))
750 /* Local variables and labels need to be replaced by equivalent
751 variables. We don't want to copy static variables; there's
752 only one of those, no matter how many times we inline the
753 containing function. Similarly for globals from an outer
757 /* Remap the declaration. */
758 new_decl = remap_decl (*tp, id);
759 gcc_assert (new_decl);
760 /* Replace this variable with the copy. */
761 STRIP_TYPE_NOPS (new_decl);
762 /* ??? The C++ frontend uses void * pointer zero to initialize
763 any other type. This confuses the middle-end type verification.
764 As cloned bodies do not go through gimplification again the fixup
765 there doesn't trigger. */
766 if (TREE_CODE (new_decl) == INTEGER_CST
767 && !useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (new_decl)))
768 new_decl = fold_convert (TREE_TYPE (*tp), new_decl);
772 else if (TREE_CODE (*tp) == STATEMENT_LIST)
774 else if (TREE_CODE (*tp) == SAVE_EXPR)
776 else if (TREE_CODE (*tp) == LABEL_DECL
777 && (!DECL_CONTEXT (*tp)
778 || decl_function_context (*tp) == id->src_fn))
779 /* These may need to be remapped for EH handling. */
780 *tp = remap_decl (*tp, id);
781 else if (TYPE_P (*tp))
782 /* Types may need remapping as well. */
783 *tp = remap_type (*tp, id);
784 else if (CONSTANT_CLASS_P (*tp))
786 /* If this is a constant, we have to copy the node iff the type
787 will be remapped. copy_tree_r will not copy a constant. */
788 tree new_type = remap_type (TREE_TYPE (*tp), id);
790 if (new_type == TREE_TYPE (*tp))
793 else if (TREE_CODE (*tp) == INTEGER_CST)
794 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
795 TREE_INT_CST_HIGH (*tp));
798 *tp = copy_node (*tp);
799 TREE_TYPE (*tp) = new_type;
804 /* Otherwise, just copy the node. Note that copy_tree_r already
805 knows not to copy VAR_DECLs, etc., so this is safe. */
806 if (TREE_CODE (*tp) == INDIRECT_REF)
808 /* Get rid of *& from inline substitutions that can happen when a
809 pointer argument is an ADDR_EXPR. */
810 tree decl = TREE_OPERAND (*tp, 0);
813 n = (tree *) pointer_map_contains (id->decl_map, decl);
816 tree type, new_tree, old;
818 /* If we happen to get an ADDR_EXPR in n->value, strip
819 it manually here as we'll eventually get ADDR_EXPRs
820 which lie about their types pointed to. In this case
821 build_fold_indirect_ref wouldn't strip the
822 INDIRECT_REF, but we absolutely rely on that. As
823 fold_indirect_ref does other useful transformations,
824 try that first, though. */
825 type = TREE_TYPE (TREE_TYPE (*n));
826 new_tree = unshare_expr (*n);
828 *tp = gimple_fold_indirect_ref (new_tree);
831 if (TREE_CODE (new_tree) == ADDR_EXPR)
833 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
835 /* ??? We should either assert here or build
836 a VIEW_CONVERT_EXPR instead of blindly leaking
837 incompatible types to our IL. */
839 *tp = TREE_OPERAND (new_tree, 0);
843 *tp = build1 (INDIRECT_REF, type, new_tree);
844 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
845 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
853 /* Here is the "usual case". Copy this tree node, and then
854 tweak some special cases. */
855 copy_tree_r (tp, walk_subtrees, NULL);
857 /* Global variables we haven't seen yet need to go into referenced
858 vars. If not referenced from types only. */
859 if (gimple_in_ssa_p (cfun)
860 && TREE_CODE (*tp) == VAR_DECL
861 && id->remapping_type_depth == 0
862 && !processing_debug_stmt)
863 add_referenced_var (*tp);
865 /* We should never have TREE_BLOCK set on non-statements. */
867 gcc_assert (!TREE_BLOCK (*tp));
869 if (TREE_CODE (*tp) != OMP_CLAUSE)
870 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
872 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
874 /* The copied TARGET_EXPR has never been expanded, even if the
875 original node was expanded already. */
876 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
877 TREE_OPERAND (*tp, 3) = NULL_TREE;
879 else if (TREE_CODE (*tp) == ADDR_EXPR)
881 /* Variable substitution need not be simple. In particular,
882 the INDIRECT_REF substitution above. Make sure that
883 TREE_CONSTANT and friends are up-to-date. But make sure
884 to not improperly set TREE_BLOCK on some sub-expressions. */
885 int invariant = is_gimple_min_invariant (*tp);
886 tree block = id->block;
887 id->block = NULL_TREE;
888 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
891 /* Handle the case where we substituted an INDIRECT_REF
892 into the operand of the ADDR_EXPR. */
893 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
894 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
896 recompute_tree_invariant_for_addr_expr (*tp);
898 /* If this used to be invariant, but is not any longer,
899 then regimplification is probably needed. */
900 if (invariant && !is_gimple_min_invariant (*tp))
901 id->regimplify = true;
907 /* Keep iterating. */
912 /* Called from copy_body_id via walk_tree. DATA is really a
913 `copy_body_data *'. */
916 copy_tree_body_r (tree *tp, int *walk_subtrees, void *data)
918 copy_body_data *id = (copy_body_data *) data;
919 tree fn = id->src_fn;
922 /* Begin by recognizing trees that we'll completely rewrite for the
923 inlining context. Our output for these trees is completely
924 different from out input (e.g. RETURN_EXPR is deleted, and morphs
925 into an edge). Further down, we'll handle trees that get
926 duplicated and/or tweaked. */
928 /* When requested, RETURN_EXPRs should be transformed to just the
929 contained MODIFY_EXPR. The branch semantics of the return will
930 be handled elsewhere by manipulating the CFG rather than a statement. */
931 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
933 tree assignment = TREE_OPERAND (*tp, 0);
935 /* If we're returning something, just turn that into an
936 assignment into the equivalent of the original RESULT_DECL.
937 If the "assignment" is just the result decl, the result
938 decl has already been set (e.g. a recent "foo (&result_decl,
939 ...)"); just toss the entire RETURN_EXPR. */
940 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
942 /* Replace the RETURN_EXPR with (a copy of) the
943 MODIFY_EXPR hanging underneath. */
944 *tp = copy_node (assignment);
946 else /* Else the RETURN_EXPR returns no value. */
949 return (tree) (void *)1;
952 else if (TREE_CODE (*tp) == SSA_NAME)
954 *tp = remap_ssa_name (*tp, id);
959 /* Local variables and labels need to be replaced by equivalent
960 variables. We don't want to copy static variables; there's only
961 one of those, no matter how many times we inline the containing
962 function. Similarly for globals from an outer function. */
963 else if (auto_var_in_fn_p (*tp, fn))
967 /* Remap the declaration. */
968 new_decl = remap_decl (*tp, id);
969 gcc_assert (new_decl);
970 /* Replace this variable with the copy. */
971 STRIP_TYPE_NOPS (new_decl);
975 else if (TREE_CODE (*tp) == STATEMENT_LIST)
976 copy_statement_list (tp);
977 else if (TREE_CODE (*tp) == SAVE_EXPR
978 || TREE_CODE (*tp) == TARGET_EXPR)
979 remap_save_expr (tp, id->decl_map, walk_subtrees);
980 else if (TREE_CODE (*tp) == LABEL_DECL
981 && (! DECL_CONTEXT (*tp)
982 || decl_function_context (*tp) == id->src_fn))
983 /* These may need to be remapped for EH handling. */
984 *tp = remap_decl (*tp, id);
985 else if (TREE_CODE (*tp) == BIND_EXPR)
986 copy_bind_expr (tp, walk_subtrees, id);
987 /* Types may need remapping as well. */
988 else if (TYPE_P (*tp))
989 *tp = remap_type (*tp, id);
991 /* If this is a constant, we have to copy the node iff the type will be
992 remapped. copy_tree_r will not copy a constant. */
993 else if (CONSTANT_CLASS_P (*tp))
995 tree new_type = remap_type (TREE_TYPE (*tp), id);
997 if (new_type == TREE_TYPE (*tp))
1000 else if (TREE_CODE (*tp) == INTEGER_CST)
1001 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
1002 TREE_INT_CST_HIGH (*tp));
1005 *tp = copy_node (*tp);
1006 TREE_TYPE (*tp) = new_type;
1010 /* Otherwise, just copy the node. Note that copy_tree_r already
1011 knows not to copy VAR_DECLs, etc., so this is safe. */
1014 /* Here we handle trees that are not completely rewritten.
1015 First we detect some inlining-induced bogosities for
1017 if (TREE_CODE (*tp) == MODIFY_EXPR
1018 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
1019 && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn)))
1021 /* Some assignments VAR = VAR; don't generate any rtl code
1022 and thus don't count as variable modification. Avoid
1023 keeping bogosities like 0 = 0. */
1024 tree decl = TREE_OPERAND (*tp, 0), value;
1027 n = (tree *) pointer_map_contains (id->decl_map, decl);
1031 STRIP_TYPE_NOPS (value);
1032 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1034 *tp = build_empty_stmt (EXPR_LOCATION (*tp));
1035 return copy_tree_body_r (tp, walk_subtrees, data);
1039 else if (TREE_CODE (*tp) == INDIRECT_REF)
1041 /* Get rid of *& from inline substitutions that can happen when a
1042 pointer argument is an ADDR_EXPR. */
1043 tree decl = TREE_OPERAND (*tp, 0);
1046 n = (tree *) pointer_map_contains (id->decl_map, decl);
1051 /* If we happen to get an ADDR_EXPR in n->value, strip
1052 it manually here as we'll eventually get ADDR_EXPRs
1053 which lie about their types pointed to. In this case
1054 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1055 but we absolutely rely on that. As fold_indirect_ref
1056 does other useful transformations, try that first, though. */
1057 tree type = TREE_TYPE (TREE_TYPE (*n));
1058 if (id->do_not_unshare)
1061 new_tree = unshare_expr (*n);
1063 *tp = gimple_fold_indirect_ref (new_tree);
1066 if (TREE_CODE (new_tree) == ADDR_EXPR)
1068 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
1070 /* ??? We should either assert here or build
1071 a VIEW_CONVERT_EXPR instead of blindly leaking
1072 incompatible types to our IL. */
1074 *tp = TREE_OPERAND (new_tree, 0);
1078 *tp = build1 (INDIRECT_REF, type, new_tree);
1079 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1080 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1088 /* Here is the "usual case". Copy this tree node, and then
1089 tweak some special cases. */
1090 copy_tree_r (tp, walk_subtrees, NULL);
1092 /* Global variables we haven't seen yet needs to go into referenced
1093 vars. If not referenced from types or debug stmts only. */
1094 if (gimple_in_ssa_p (cfun)
1095 && TREE_CODE (*tp) == VAR_DECL
1096 && id->remapping_type_depth == 0
1097 && !processing_debug_stmt)
1098 add_referenced_var (*tp);
1100 /* If EXPR has block defined, map it to newly constructed block.
1101 When inlining we want EXPRs without block appear in the block
1102 of function call if we are not remapping a type. */
1105 new_block = id->remapping_type_depth == 0 ? id->block : NULL;
1106 if (TREE_BLOCK (*tp))
1109 n = (tree *) pointer_map_contains (id->decl_map,
1114 TREE_BLOCK (*tp) = new_block;
1117 if (TREE_CODE (*tp) != OMP_CLAUSE)
1118 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
1120 /* The copied TARGET_EXPR has never been expanded, even if the
1121 original node was expanded already. */
1122 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
1124 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
1125 TREE_OPERAND (*tp, 3) = NULL_TREE;
1128 /* Variable substitution need not be simple. In particular, the
1129 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1130 and friends are up-to-date. */
1131 else if (TREE_CODE (*tp) == ADDR_EXPR)
1133 int invariant = is_gimple_min_invariant (*tp);
1134 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
1136 /* Handle the case where we substituted an INDIRECT_REF
1137 into the operand of the ADDR_EXPR. */
1138 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
1139 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
1141 recompute_tree_invariant_for_addr_expr (*tp);
1143 /* If this used to be invariant, but is not any longer,
1144 then regimplification is probably needed. */
1145 if (invariant && !is_gimple_min_invariant (*tp))
1146 id->regimplify = true;
1152 /* Keep iterating. */
1156 /* Helper for remap_gimple_stmt. Given an EH region number for the
1157 source function, map that to the duplicate EH region number in
1158 the destination function. */
1161 remap_eh_region_nr (int old_nr, copy_body_data *id)
1163 eh_region old_r, new_r;
1166 old_r = get_eh_region_from_number_fn (id->src_cfun, old_nr);
1167 slot = pointer_map_contains (id->eh_map, old_r);
1168 new_r = (eh_region) *slot;
1170 return new_r->index;
1173 /* Similar, but operate on INTEGER_CSTs. */
1176 remap_eh_region_tree_nr (tree old_t_nr, copy_body_data *id)
1180 old_nr = tree_low_cst (old_t_nr, 0);
1181 new_nr = remap_eh_region_nr (old_nr, id);
1183 return build_int_cst (NULL, new_nr);
1186 /* Helper for copy_bb. Remap statement STMT using the inlining
1187 information in ID. Return the new statement copy. */
1190 remap_gimple_stmt (gimple stmt, copy_body_data *id)
1193 struct walk_stmt_info wi;
1195 bool skip_first = false;
1197 /* Begin by recognizing trees that we'll completely rewrite for the
1198 inlining context. Our output for these trees is completely
1199 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1200 into an edge). Further down, we'll handle trees that get
1201 duplicated and/or tweaked. */
1203 /* When requested, GIMPLE_RETURNs should be transformed to just the
1204 contained GIMPLE_ASSIGN. The branch semantics of the return will
1205 be handled elsewhere by manipulating the CFG rather than the
1207 if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify)
1209 tree retval = gimple_return_retval (stmt);
1211 /* If we're returning something, just turn that into an
1212 assignment into the equivalent of the original RESULT_DECL.
1213 If RETVAL is just the result decl, the result decl has
1214 already been set (e.g. a recent "foo (&result_decl, ...)");
1215 just toss the entire GIMPLE_RETURN. */
1216 if (retval && TREE_CODE (retval) != RESULT_DECL)
1218 copy = gimple_build_assign (id->retvar, retval);
1219 /* id->retvar is already substituted. Skip it on later remapping. */
1223 return gimple_build_nop ();
1225 else if (gimple_has_substatements (stmt))
1229 /* When cloning bodies from the C++ front end, we will be handed bodies
1230 in High GIMPLE form. Handle here all the High GIMPLE statements that
1231 have embedded statements. */
1232 switch (gimple_code (stmt))
1235 copy = copy_gimple_bind (stmt, id);
1239 s1 = remap_gimple_seq (gimple_catch_handler (stmt), id);
1240 copy = gimple_build_catch (gimple_catch_types (stmt), s1);
1243 case GIMPLE_EH_FILTER:
1244 s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id);
1245 copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1);
1249 s1 = remap_gimple_seq (gimple_try_eval (stmt), id);
1250 s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id);
1251 copy = gimple_build_try (s1, s2, gimple_try_kind (stmt));
1254 case GIMPLE_WITH_CLEANUP_EXPR:
1255 s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id);
1256 copy = gimple_build_wce (s1);
1259 case GIMPLE_OMP_PARALLEL:
1260 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1261 copy = gimple_build_omp_parallel
1263 gimple_omp_parallel_clauses (stmt),
1264 gimple_omp_parallel_child_fn (stmt),
1265 gimple_omp_parallel_data_arg (stmt));
1268 case GIMPLE_OMP_TASK:
1269 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1270 copy = gimple_build_omp_task
1272 gimple_omp_task_clauses (stmt),
1273 gimple_omp_task_child_fn (stmt),
1274 gimple_omp_task_data_arg (stmt),
1275 gimple_omp_task_copy_fn (stmt),
1276 gimple_omp_task_arg_size (stmt),
1277 gimple_omp_task_arg_align (stmt));
1280 case GIMPLE_OMP_FOR:
1281 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1282 s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id);
1283 copy = gimple_build_omp_for (s1, gimple_omp_for_clauses (stmt),
1284 gimple_omp_for_collapse (stmt), s2);
1287 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1289 gimple_omp_for_set_index (copy, i,
1290 gimple_omp_for_index (stmt, i));
1291 gimple_omp_for_set_initial (copy, i,
1292 gimple_omp_for_initial (stmt, i));
1293 gimple_omp_for_set_final (copy, i,
1294 gimple_omp_for_final (stmt, i));
1295 gimple_omp_for_set_incr (copy, i,
1296 gimple_omp_for_incr (stmt, i));
1297 gimple_omp_for_set_cond (copy, i,
1298 gimple_omp_for_cond (stmt, i));
1303 case GIMPLE_OMP_MASTER:
1304 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1305 copy = gimple_build_omp_master (s1);
1308 case GIMPLE_OMP_ORDERED:
1309 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1310 copy = gimple_build_omp_ordered (s1);
1313 case GIMPLE_OMP_SECTION:
1314 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1315 copy = gimple_build_omp_section (s1);
1318 case GIMPLE_OMP_SECTIONS:
1319 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1320 copy = gimple_build_omp_sections
1321 (s1, gimple_omp_sections_clauses (stmt));
1324 case GIMPLE_OMP_SINGLE:
1325 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1326 copy = gimple_build_omp_single
1327 (s1, gimple_omp_single_clauses (stmt));
1330 case GIMPLE_OMP_CRITICAL:
1331 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1333 = gimple_build_omp_critical (s1, gimple_omp_critical_name (stmt));
1342 if (gimple_assign_copy_p (stmt)
1343 && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt)
1344 && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn))
1346 /* Here we handle statements that are not completely rewritten.
1347 First we detect some inlining-induced bogosities for
1350 /* Some assignments VAR = VAR; don't generate any rtl code
1351 and thus don't count as variable modification. Avoid
1352 keeping bogosities like 0 = 0. */
1353 tree decl = gimple_assign_lhs (stmt), value;
1356 n = (tree *) pointer_map_contains (id->decl_map, decl);
1360 STRIP_TYPE_NOPS (value);
1361 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1362 return gimple_build_nop ();
1366 if (gimple_debug_bind_p (stmt))
1368 copy = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt),
1369 gimple_debug_bind_get_value (stmt),
1371 VEC_safe_push (gimple, heap, id->debug_stmts, copy);
1375 /* Create a new deep copy of the statement. */
1376 copy = gimple_copy (stmt);
1378 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1379 RESX and EH_DISPATCH. */
1381 switch (gimple_code (copy))
1385 tree r, fndecl = gimple_call_fndecl (copy);
1386 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
1387 switch (DECL_FUNCTION_CODE (fndecl))
1389 case BUILT_IN_EH_COPY_VALUES:
1390 r = gimple_call_arg (copy, 1);
1391 r = remap_eh_region_tree_nr (r, id);
1392 gimple_call_set_arg (copy, 1, r);
1395 case BUILT_IN_EH_POINTER:
1396 case BUILT_IN_EH_FILTER:
1397 r = gimple_call_arg (copy, 0);
1398 r = remap_eh_region_tree_nr (r, id);
1399 gimple_call_set_arg (copy, 0, r);
1410 int r = gimple_resx_region (copy);
1411 r = remap_eh_region_nr (r, id);
1412 gimple_resx_set_region (copy, r);
1416 case GIMPLE_EH_DISPATCH:
1418 int r = gimple_eh_dispatch_region (copy);
1419 r = remap_eh_region_nr (r, id);
1420 gimple_eh_dispatch_set_region (copy, r);
1429 /* If STMT has a block defined, map it to the newly constructed
1430 block. When inlining we want statements without a block to
1431 appear in the block of the function call. */
1432 new_block = id->block;
1433 if (gimple_block (copy))
1436 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (copy));
1441 gimple_set_block (copy, new_block);
1443 if (gimple_debug_bind_p (copy))
1446 /* Remap all the operands in COPY. */
1447 memset (&wi, 0, sizeof (wi));
1450 walk_tree (gimple_op_ptr (copy, 1), remap_gimple_op_r, &wi, NULL);
1452 walk_gimple_op (copy, remap_gimple_op_r, &wi);
1454 /* Clear the copied virtual operands. We are not remapping them here
1455 but are going to recreate them from scratch. */
1456 if (gimple_has_mem_ops (copy))
1458 gimple_set_vdef (copy, NULL_TREE);
1459 gimple_set_vuse (copy, NULL_TREE);
1466 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1470 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale,
1471 gcov_type count_scale)
1473 gimple_stmt_iterator gsi, copy_gsi, seq_gsi;
1474 basic_block copy_basic_block;
1478 /* create_basic_block() will append every new block to
1479 basic_block_info automatically. */
1480 copy_basic_block = create_basic_block (NULL, (void *) 0,
1481 (basic_block) bb->prev_bb->aux);
1482 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
1484 /* We are going to rebuild frequencies from scratch. These values
1485 have just small importance to drive canonicalize_loop_headers. */
1486 freq = ((gcov_type)bb->frequency * frequency_scale / REG_BR_PROB_BASE);
1488 /* We recompute frequencies after inlining, so this is quite safe. */
1489 if (freq > BB_FREQ_MAX)
1491 copy_basic_block->frequency = freq;
1493 copy_gsi = gsi_start_bb (copy_basic_block);
1495 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1497 gimple stmt = gsi_stmt (gsi);
1498 gimple orig_stmt = stmt;
1500 id->regimplify = false;
1501 stmt = remap_gimple_stmt (stmt, id);
1502 if (gimple_nop_p (stmt))
1505 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
1508 /* With return slot optimization we can end up with
1509 non-gimple (foo *)&this->m, fix that here. */
1510 if (is_gimple_assign (stmt)
1511 && gimple_assign_rhs_code (stmt) == NOP_EXPR
1512 && !is_gimple_val (gimple_assign_rhs1 (stmt)))
1515 new_rhs = force_gimple_operand_gsi (&seq_gsi,
1516 gimple_assign_rhs1 (stmt),
1517 true, NULL, false, GSI_NEW_STMT);
1518 gimple_assign_set_rhs1 (stmt, new_rhs);
1519 id->regimplify = false;
1522 gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT);
1525 gimple_regimplify_operands (stmt, &seq_gsi);
1527 /* If copy_basic_block has been empty at the start of this iteration,
1528 call gsi_start_bb again to get at the newly added statements. */
1529 if (gsi_end_p (copy_gsi))
1530 copy_gsi = gsi_start_bb (copy_basic_block);
1532 gsi_next (©_gsi);
1534 /* Process the new statement. The call to gimple_regimplify_operands
1535 possibly turned the statement into multiple statements, we
1536 need to process all of them. */
1541 stmt = gsi_stmt (copy_gsi);
1542 if (is_gimple_call (stmt)
1543 && gimple_call_va_arg_pack_p (stmt)
1546 /* __builtin_va_arg_pack () should be replaced by
1547 all arguments corresponding to ... in the caller. */
1550 VEC(tree, heap) *argarray;
1551 size_t nargs = gimple_call_num_args (id->gimple_call);
1554 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1557 /* Create the new array of arguments. */
1558 n = nargs + gimple_call_num_args (stmt);
1559 argarray = VEC_alloc (tree, heap, n);
1560 VEC_safe_grow (tree, heap, argarray, n);
1562 /* Copy all the arguments before '...' */
1563 memcpy (VEC_address (tree, argarray),
1564 gimple_call_arg_ptr (stmt, 0),
1565 gimple_call_num_args (stmt) * sizeof (tree));
1567 /* Append the arguments passed in '...' */
1568 memcpy (VEC_address(tree, argarray) + gimple_call_num_args (stmt),
1569 gimple_call_arg_ptr (id->gimple_call, 0)
1570 + (gimple_call_num_args (id->gimple_call) - nargs),
1571 nargs * sizeof (tree));
1573 new_call = gimple_build_call_vec (gimple_call_fn (stmt),
1576 VEC_free (tree, heap, argarray);
1578 /* Copy all GIMPLE_CALL flags, location and block, except
1579 GF_CALL_VA_ARG_PACK. */
1580 gimple_call_copy_flags (new_call, stmt);
1581 gimple_call_set_va_arg_pack (new_call, false);
1582 gimple_set_location (new_call, gimple_location (stmt));
1583 gimple_set_block (new_call, gimple_block (stmt));
1584 gimple_call_set_lhs (new_call, gimple_call_lhs (stmt));
1586 gsi_replace (©_gsi, new_call, false);
1587 gimple_set_bb (stmt, NULL);
1590 else if (is_gimple_call (stmt)
1592 && (decl = gimple_call_fndecl (stmt))
1593 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1594 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN)
1596 /* __builtin_va_arg_pack_len () should be replaced by
1597 the number of anonymous arguments. */
1598 size_t nargs = gimple_call_num_args (id->gimple_call);
1602 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1605 count = build_int_cst (integer_type_node, nargs);
1606 new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count);
1607 gsi_replace (©_gsi, new_stmt, false);
1611 /* Statements produced by inlining can be unfolded, especially
1612 when we constant propagated some operands. We can't fold
1613 them right now for two reasons:
1614 1) folding require SSA_NAME_DEF_STMTs to be correct
1615 2) we can't change function calls to builtins.
1616 So we just mark statement for later folding. We mark
1617 all new statements, instead just statements that has changed
1618 by some nontrivial substitution so even statements made
1619 foldable indirectly are updated. If this turns out to be
1620 expensive, copy_body can be told to watch for nontrivial
1622 if (id->statements_to_fold)
1623 pointer_set_insert (id->statements_to_fold, stmt);
1625 /* We're duplicating a CALL_EXPR. Find any corresponding
1626 callgraph edges and update or duplicate them. */
1627 if (is_gimple_call (stmt))
1629 struct cgraph_edge *edge;
1632 switch (id->transform_call_graph_edges)
1634 case CB_CGE_DUPLICATE:
1635 edge = cgraph_edge (id->src_node, orig_stmt);
1638 int edge_freq = edge->frequency;
1639 edge = cgraph_clone_edge (edge, id->dst_node, stmt,
1641 REG_BR_PROB_BASE, CGRAPH_FREQ_BASE,
1642 edge->frequency, true);
1643 /* We could also just rescale the frequency, but
1644 doing so would introduce roundoff errors and make
1645 verifier unhappy. */
1647 = compute_call_stmt_bb_frequency (id->dst_node->decl,
1650 && profile_status_for_function (cfun) != PROFILE_ABSENT
1651 && (edge_freq > edge->frequency + 10
1652 || edge_freq < edge->frequency - 10))
1654 fprintf (dump_file, "Edge frequency estimated by "
1655 "cgraph %i diverge from inliner's estimate %i\n",
1659 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1662 copy_basic_block->frequency);
1667 case CB_CGE_MOVE_CLONES:
1668 cgraph_set_call_stmt_including_clones (id->dst_node,
1670 edge = cgraph_edge (id->dst_node, stmt);
1674 edge = cgraph_edge (id->dst_node, orig_stmt);
1676 cgraph_set_call_stmt (edge, stmt);
1683 /* Constant propagation on argument done during inlining
1684 may create new direct call. Produce an edge for it. */
1686 || (edge->indirect_call
1687 && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES))
1688 && is_gimple_call (stmt)
1689 && (fn = gimple_call_fndecl (stmt)) != NULL)
1691 struct cgraph_node *dest = cgraph_node (fn);
1693 /* We have missing edge in the callgraph. This can happen
1694 when previous inlining turned an indirect call into a
1695 direct call by constant propagating arguments or we are
1696 producing dead clone (for further clonning). In all
1697 other cases we hit a bug (incorrect node sharing is the
1698 most common reason for missing edges). */
1699 gcc_assert (dest->needed || !dest->analyzed
1700 || !id->src_node->analyzed);
1701 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)
1702 cgraph_create_edge_including_clones
1703 (id->dst_node, dest, orig_stmt, stmt, bb->count,
1704 compute_call_stmt_bb_frequency (id->dst_node->decl,
1706 bb->loop_depth, CIF_ORIGINALLY_INDIRECT_CALL);
1708 cgraph_create_edge (id->dst_node, dest, stmt,
1710 compute_call_stmt_bb_frequency
1711 (id->dst_node->decl, copy_basic_block),
1712 bb->loop_depth)->inline_failed
1713 = CIF_ORIGINALLY_INDIRECT_CALL;
1716 fprintf (dump_file, "Created new direct edge to %s",
1717 cgraph_node_name (dest));
1721 flags = gimple_call_flags (stmt);
1722 if (flags & ECF_MAY_BE_ALLOCA)
1723 cfun->calls_alloca = true;
1724 if (flags & ECF_RETURNS_TWICE)
1725 cfun->calls_setjmp = true;
1728 maybe_duplicate_eh_stmt_fn (cfun, stmt, id->src_cfun, orig_stmt,
1729 id->eh_map, id->eh_lp_nr);
1731 if (gimple_in_ssa_p (cfun) && !is_gimple_debug (stmt))
1736 find_new_referenced_vars (gsi_stmt (copy_gsi));
1737 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1738 if (TREE_CODE (def) == SSA_NAME)
1739 SSA_NAME_DEF_STMT (def) = stmt;
1742 gsi_next (©_gsi);
1744 while (!gsi_end_p (copy_gsi));
1746 copy_gsi = gsi_last_bb (copy_basic_block);
1749 return copy_basic_block;
1752 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1753 form is quite easy, since dominator relationship for old basic blocks does
1756 There is however exception where inlining might change dominator relation
1757 across EH edges from basic block within inlined functions destinating
1758 to landing pads in function we inline into.
1760 The function fills in PHI_RESULTs of such PHI nodes if they refer
1761 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1762 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1763 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1764 set, and this means that there will be no overlapping live ranges
1765 for the underlying symbol.
1767 This might change in future if we allow redirecting of EH edges and
1768 we might want to change way build CFG pre-inlining to include
1769 all the possible edges then. */
1771 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1772 bool can_throw, bool nonlocal_goto)
1777 FOR_EACH_EDGE (e, ei, bb->succs)
1779 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1782 gimple_stmt_iterator si;
1785 gcc_assert (e->flags & EDGE_EH);
1788 gcc_assert (!(e->flags & EDGE_EH));
1790 for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
1794 phi = gsi_stmt (si);
1796 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1797 gcc_assert (!e->dest->aux);
1799 gcc_assert ((e->flags & EDGE_EH)
1800 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
1802 if (!is_gimple_reg (PHI_RESULT (phi)))
1804 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi)));
1808 re = find_edge (ret_bb, e->dest);
1810 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1811 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1813 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1814 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1820 /* Copy edges from BB into its copy constructed earlier, scale profile
1821 accordingly. Edges will be taken care of later. Assume aux
1822 pointers to point to the copies of each BB. */
1825 copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb)
1827 basic_block new_bb = (basic_block) bb->aux;
1830 gimple_stmt_iterator si;
1833 /* Use the indices from the original blocks to create edges for the
1835 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1836 if (!(old_edge->flags & EDGE_EH))
1840 flags = old_edge->flags;
1842 /* Return edges do get a FALLTHRU flag when the get inlined. */
1843 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1844 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1845 flags |= EDGE_FALLTHRU;
1846 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1847 new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1848 new_edge->probability = old_edge->probability;
1851 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1854 for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
1857 bool can_throw, nonlocal_goto;
1859 copy_stmt = gsi_stmt (si);
1860 if (!is_gimple_debug (copy_stmt))
1862 update_stmt (copy_stmt);
1863 if (gimple_in_ssa_p (cfun))
1864 mark_symbols_for_renaming (copy_stmt);
1867 /* Do this before the possible split_block. */
1870 /* If this tree could throw an exception, there are two
1871 cases where we need to add abnormal edge(s): the
1872 tree wasn't in a region and there is a "current
1873 region" in the caller; or the original tree had
1874 EH edges. In both cases split the block after the tree,
1875 and add abnormal edge(s) as needed; we need both
1876 those from the callee and the caller.
1877 We check whether the copy can throw, because the const
1878 propagation can change an INDIRECT_REF which throws
1879 into a COMPONENT_REF which doesn't. If the copy
1880 can throw, the original could also throw. */
1881 can_throw = stmt_can_throw_internal (copy_stmt);
1882 nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt);
1884 if (can_throw || nonlocal_goto)
1886 if (!gsi_end_p (si))
1887 /* Note that bb's predecessor edges aren't necessarily
1888 right at this point; split_block doesn't care. */
1890 edge e = split_block (new_bb, copy_stmt);
1893 new_bb->aux = e->src->aux;
1894 si = gsi_start_bb (new_bb);
1898 if (gimple_code (copy_stmt) == GIMPLE_EH_DISPATCH)
1899 make_eh_dispatch_edges (copy_stmt);
1901 make_eh_edges (copy_stmt);
1904 make_abnormal_goto_edges (gimple_bb (copy_stmt), true);
1906 if ((can_throw || nonlocal_goto)
1907 && gimple_in_ssa_p (cfun))
1908 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
1909 can_throw, nonlocal_goto);
1913 /* Copy the PHIs. All blocks and edges are copied, some blocks
1914 was possibly split and new outgoing EH edges inserted.
1915 BB points to the block of original function and AUX pointers links
1916 the original and newly copied blocks. */
1919 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1921 basic_block const new_bb = (basic_block) bb->aux;
1924 gimple_stmt_iterator si;
1926 for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si))
1932 phi = gsi_stmt (si);
1933 res = PHI_RESULT (phi);
1935 if (is_gimple_reg (res))
1937 walk_tree (&new_res, copy_tree_body_r, id, NULL);
1938 SSA_NAME_DEF_STMT (new_res)
1939 = new_phi = create_phi_node (new_res, new_bb);
1940 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1943 = find_edge ((basic_block) new_edge->src->aux, bb);
1944 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1946 tree block = id->block;
1947 id->block = NULL_TREE;
1948 walk_tree (&new_arg, copy_tree_body_r, id, NULL);
1950 gcc_assert (new_arg);
1951 /* With return slot optimization we can end up with
1952 non-gimple (foo *)&this->m, fix that here. */
1953 if (TREE_CODE (new_arg) != SSA_NAME
1954 && TREE_CODE (new_arg) != FUNCTION_DECL
1955 && !is_gimple_val (new_arg))
1957 gimple_seq stmts = NULL;
1958 new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
1959 gsi_insert_seq_on_edge_immediate (new_edge, stmts);
1961 add_phi_arg (new_phi, new_arg, new_edge,
1962 gimple_phi_arg_location_from_edge (phi, old_edge));
1969 /* Wrapper for remap_decl so it can be used as a callback. */
1972 remap_decl_1 (tree decl, void *data)
1974 return remap_decl (decl, (copy_body_data *) data);
1977 /* Build struct function and associated datastructures for the new clone
1978 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1981 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count)
1983 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1984 gcov_type count_scale;
1986 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1987 count_scale = (REG_BR_PROB_BASE * count
1988 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1990 count_scale = REG_BR_PROB_BASE;
1992 /* Register specific tree functions. */
1993 gimple_register_cfg_hooks ();
1995 /* Get clean struct function. */
1996 push_struct_function (new_fndecl);
1998 /* We will rebuild these, so just sanity check that they are empty. */
1999 gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
2000 gcc_assert (cfun->local_decls == NULL);
2001 gcc_assert (cfun->cfg == NULL);
2002 gcc_assert (cfun->decl == new_fndecl);
2004 /* Copy items we preserve during clonning. */
2005 cfun->static_chain_decl = src_cfun->static_chain_decl;
2006 cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
2007 cfun->function_end_locus = src_cfun->function_end_locus;
2008 cfun->curr_properties = src_cfun->curr_properties;
2009 cfun->last_verified = src_cfun->last_verified;
2010 cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
2011 cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
2012 cfun->function_frequency = src_cfun->function_frequency;
2013 cfun->has_nonlocal_label = src_cfun->has_nonlocal_label;
2014 cfun->stdarg = src_cfun->stdarg;
2015 cfun->dont_save_pending_sizes_p = src_cfun->dont_save_pending_sizes_p;
2016 cfun->after_inlining = src_cfun->after_inlining;
2017 cfun->returns_struct = src_cfun->returns_struct;
2018 cfun->returns_pcc_struct = src_cfun->returns_pcc_struct;
2019 cfun->after_tree_profile = src_cfun->after_tree_profile;
2021 init_empty_tree_cfg ();
2023 profile_status_for_function (cfun) = profile_status_for_function (src_cfun);
2024 ENTRY_BLOCK_PTR->count =
2025 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2027 ENTRY_BLOCK_PTR->frequency
2028 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2029 EXIT_BLOCK_PTR->count =
2030 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2032 EXIT_BLOCK_PTR->frequency =
2033 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2035 init_eh_for_function ();
2037 if (src_cfun->gimple_df)
2039 init_tree_ssa (cfun);
2040 cfun->gimple_df->in_ssa_p = true;
2041 init_ssa_operands ();
2046 /* Make a copy of the body of FN so that it can be inserted inline in
2047 another function. Walks FN via CFG, returns new fndecl. */
2050 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency_scale,
2051 basic_block entry_block_map, basic_block exit_block_map)
2053 tree callee_fndecl = id->src_fn;
2054 /* Original cfun for the callee, doesn't change. */
2055 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2056 struct function *cfun_to_copy;
2058 tree new_fndecl = NULL;
2059 gcov_type count_scale;
2062 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
2063 count_scale = (REG_BR_PROB_BASE * count
2064 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
2066 count_scale = REG_BR_PROB_BASE;
2068 /* Register specific tree functions. */
2069 gimple_register_cfg_hooks ();
2071 /* Must have a CFG here at this point. */
2072 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2073 (DECL_STRUCT_FUNCTION (callee_fndecl)));
2075 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2077 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
2078 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
2079 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2080 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2082 /* Duplicate any exception-handling regions. */
2084 id->eh_map = duplicate_eh_regions (cfun_to_copy, NULL, id->eh_lp_nr,
2087 /* Use aux pointers to map the original blocks to copy. */
2088 FOR_EACH_BB_FN (bb, cfun_to_copy)
2090 basic_block new_bb = copy_bb (id, bb, frequency_scale, count_scale);
2095 last = last_basic_block;
2097 /* Now that we've duplicated the blocks, duplicate their edges. */
2098 FOR_ALL_BB_FN (bb, cfun_to_copy)
2099 copy_edges_for_bb (bb, count_scale, exit_block_map);
2101 if (gimple_in_ssa_p (cfun))
2102 FOR_ALL_BB_FN (bb, cfun_to_copy)
2103 copy_phis_for_bb (bb, id);
2105 FOR_ALL_BB_FN (bb, cfun_to_copy)
2107 ((basic_block)bb->aux)->aux = NULL;
2111 /* Zero out AUX fields of newly created block during EH edge
2113 for (; last < last_basic_block; last++)
2114 BASIC_BLOCK (last)->aux = NULL;
2115 entry_block_map->aux = NULL;
2116 exit_block_map->aux = NULL;
2120 pointer_map_destroy (id->eh_map);
2127 /* Copy the debug STMT using ID. We deal with these statements in a
2128 special way: if any variable in their VALUE expression wasn't
2129 remapped yet, we won't remap it, because that would get decl uids
2130 out of sync, causing codegen differences between -g and -g0. If
2131 this arises, we drop the VALUE expression altogether. */
2134 copy_debug_stmt (gimple stmt, copy_body_data *id)
2137 struct walk_stmt_info wi;
2140 if (gimple_block (stmt))
2143 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (stmt));
2147 gimple_set_block (stmt, t);
2149 /* Remap all the operands in COPY. */
2150 memset (&wi, 0, sizeof (wi));
2153 processing_debug_stmt = 1;
2155 t = gimple_debug_bind_get_var (stmt);
2157 if (TREE_CODE (t) == PARM_DECL && id->debug_map
2158 && (n = (tree *) pointer_map_contains (id->debug_map, t)))
2160 gcc_assert (TREE_CODE (*n) == VAR_DECL);
2164 walk_tree (&t, remap_gimple_op_r, &wi, NULL);
2166 gimple_debug_bind_set_var (stmt, t);
2168 if (gimple_debug_bind_has_value_p (stmt))
2169 walk_tree (gimple_debug_bind_get_value_ptr (stmt),
2170 remap_gimple_op_r, &wi, NULL);
2172 /* Punt if any decl couldn't be remapped. */
2173 if (processing_debug_stmt < 0)
2174 gimple_debug_bind_reset_value (stmt);
2176 processing_debug_stmt = 0;
2179 if (gimple_in_ssa_p (cfun))
2180 mark_symbols_for_renaming (stmt);
2183 /* Process deferred debug stmts. In order to give values better odds
2184 of being successfully remapped, we delay the processing of debug
2185 stmts until all other stmts that might require remapping are
2189 copy_debug_stmts (copy_body_data *id)
2194 if (!id->debug_stmts)
2197 for (i = 0; VEC_iterate (gimple, id->debug_stmts, i, stmt); i++)
2198 copy_debug_stmt (stmt, id);
2200 VEC_free (gimple, heap, id->debug_stmts);
2203 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2204 another function. */
2207 copy_tree_body (copy_body_data *id)
2209 tree fndecl = id->src_fn;
2210 tree body = DECL_SAVED_TREE (fndecl);
2212 walk_tree (&body, copy_tree_body_r, id, NULL);
2217 /* Make a copy of the body of FN so that it can be inserted inline in
2218 another function. */
2221 copy_body (copy_body_data *id, gcov_type count, int frequency_scale,
2222 basic_block entry_block_map, basic_block exit_block_map)
2224 tree fndecl = id->src_fn;
2227 /* If this body has a CFG, walk CFG and copy. */
2228 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
2229 body = copy_cfg_body (id, count, frequency_scale, entry_block_map, exit_block_map);
2230 copy_debug_stmts (id);
2235 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2236 defined in function FN, or of a data member thereof. */
2239 self_inlining_addr_expr (tree value, tree fn)
2243 if (TREE_CODE (value) != ADDR_EXPR)
2246 var = get_base_address (TREE_OPERAND (value, 0));
2248 return var && auto_var_in_fn_p (var, fn);
2251 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2252 lexical block and line number information from base_stmt, if given,
2253 or from the last stmt of the block otherwise. */
2256 insert_init_debug_bind (copy_body_data *id,
2257 basic_block bb, tree var, tree value,
2261 gimple_stmt_iterator gsi;
2264 if (!gimple_in_ssa_p (id->src_cfun))
2267 if (!MAY_HAVE_DEBUG_STMTS)
2270 tracked_var = target_for_debug_bind (var);
2276 gsi = gsi_last_bb (bb);
2277 if (!base_stmt && !gsi_end_p (gsi))
2278 base_stmt = gsi_stmt (gsi);
2281 note = gimple_build_debug_bind (tracked_var, value, base_stmt);
2285 if (!gsi_end_p (gsi))
2286 gsi_insert_after (&gsi, note, GSI_SAME_STMT);
2288 gsi_insert_before (&gsi, note, GSI_SAME_STMT);
2295 insert_init_stmt (copy_body_data *id, basic_block bb, gimple init_stmt)
2297 /* If VAR represents a zero-sized variable, it's possible that the
2298 assignment statement may result in no gimple statements. */
2301 gimple_stmt_iterator si = gsi_last_bb (bb);
2303 /* We can end up with init statements that store to a non-register
2304 from a rhs with a conversion. Handle that here by forcing the
2305 rhs into a temporary. gimple_regimplify_operands is not
2306 prepared to do this for us. */
2307 if (!is_gimple_debug (init_stmt)
2308 && !is_gimple_reg (gimple_assign_lhs (init_stmt))
2309 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt)))
2310 && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS)
2312 tree rhs = build1 (gimple_assign_rhs_code (init_stmt),
2313 gimple_expr_type (init_stmt),
2314 gimple_assign_rhs1 (init_stmt));
2315 rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false,
2317 gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs));
2318 gimple_assign_set_rhs1 (init_stmt, rhs);
2320 gsi_insert_after (&si, init_stmt, GSI_NEW_STMT);
2321 gimple_regimplify_operands (init_stmt, &si);
2322 mark_symbols_for_renaming (init_stmt);
2324 if (!is_gimple_debug (init_stmt) && MAY_HAVE_DEBUG_STMTS)
2326 tree var, def = gimple_assign_lhs (init_stmt);
2328 if (TREE_CODE (def) == SSA_NAME)
2329 var = SSA_NAME_VAR (def);
2333 insert_init_debug_bind (id, bb, var, def, init_stmt);
2338 /* Initialize parameter P with VALUE. If needed, produce init statement
2339 at the end of BB. When BB is NULL, we return init statement to be
2342 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
2343 basic_block bb, tree *vars)
2345 gimple init_stmt = NULL;
2348 tree def = (gimple_in_ssa_p (cfun)
2349 ? gimple_default_def (id->src_cfun, p) : NULL);
2352 && value != error_mark_node
2353 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
2355 if (fold_convertible_p (TREE_TYPE (p), value))
2356 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
2358 /* ??? For valid (GIMPLE) programs we should not end up here.
2359 Still if something has gone wrong and we end up with truly
2360 mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2361 to not leak invalid GIMPLE to the following passes. */
2362 rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value);
2365 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2366 here since the type of this decl must be visible to the calling
2368 var = copy_decl_to_var (p, id);
2370 /* We're actually using the newly-created var. */
2371 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
2374 add_referenced_var (var);
2377 /* Declare this new variable. */
2378 TREE_CHAIN (var) = *vars;
2381 /* Make gimplifier happy about this variable. */
2382 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2384 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2385 we would not need to create a new variable here at all, if it
2386 weren't for debug info. Still, we can just use the argument
2388 if (TREE_READONLY (p)
2389 && !TREE_ADDRESSABLE (p)
2390 && value && !TREE_SIDE_EFFECTS (value)
2393 /* We may produce non-gimple trees by adding NOPs or introduce
2394 invalid sharing when operand is not really constant.
2395 It is not big deal to prohibit constant propagation here as
2396 we will constant propagate in DOM1 pass anyway. */
2397 if (is_gimple_min_invariant (value)
2398 && useless_type_conversion_p (TREE_TYPE (p),
2400 /* We have to be very careful about ADDR_EXPR. Make sure
2401 the base variable isn't a local variable of the inlined
2402 function, e.g., when doing recursive inlining, direct or
2403 mutually-recursive or whatever, which is why we don't
2404 just test whether fn == current_function_decl. */
2405 && ! self_inlining_addr_expr (value, fn))
2407 insert_decl_map (id, p, value);
2408 insert_debug_decl_map (id, p, var);
2409 return insert_init_debug_bind (id, bb, var, value, NULL);
2413 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2414 that way, when the PARM_DECL is encountered, it will be
2415 automatically replaced by the VAR_DECL. */
2416 insert_decl_map (id, p, var);
2418 /* Even if P was TREE_READONLY, the new VAR should not be.
2419 In the original code, we would have constructed a
2420 temporary, and then the function body would have never
2421 changed the value of P. However, now, we will be
2422 constructing VAR directly. The constructor body may
2423 change its value multiple times as it is being
2424 constructed. Therefore, it must not be TREE_READONLY;
2425 the back-end assumes that TREE_READONLY variable is
2426 assigned to only once. */
2427 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
2428 TREE_READONLY (var) = 0;
2430 /* If there is no setup required and we are in SSA, take the easy route
2431 replacing all SSA names representing the function parameter by the
2432 SSA name passed to function.
2434 We need to construct map for the variable anyway as it might be used
2435 in different SSA names when parameter is set in function.
2437 Do replacement at -O0 for const arguments replaced by constant.
2438 This is important for builtin_constant_p and other construct requiring
2439 constant argument to be visible in inlined function body. */
2440 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
2442 || (TREE_READONLY (p)
2443 && is_gimple_min_invariant (rhs)))
2444 && (TREE_CODE (rhs) == SSA_NAME
2445 || is_gimple_min_invariant (rhs))
2446 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
2448 insert_decl_map (id, def, rhs);
2449 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2452 /* If the value of argument is never used, don't care about initializing
2454 if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
2456 gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
2457 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2460 /* Initialize this VAR_DECL from the equivalent argument. Convert
2461 the argument to the proper type in case it was promoted. */
2464 if (rhs == error_mark_node)
2466 insert_decl_map (id, p, var);
2467 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2470 STRIP_USELESS_TYPE_CONVERSION (rhs);
2472 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2473 keep our trees in gimple form. */
2474 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
2476 def = remap_ssa_name (def, id);
2477 init_stmt = gimple_build_assign (def, rhs);
2478 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
2479 set_default_def (var, NULL);
2482 init_stmt = gimple_build_assign (var, rhs);
2484 if (bb && init_stmt)
2485 insert_init_stmt (id, bb, init_stmt);
2490 /* Generate code to initialize the parameters of the function at the
2491 top of the stack in ID from the GIMPLE_CALL STMT. */
2494 initialize_inlined_parameters (copy_body_data *id, gimple stmt,
2495 tree fn, basic_block bb)
2500 tree vars = NULL_TREE;
2501 tree static_chain = gimple_call_chain (stmt);
2503 /* Figure out what the parameters are. */
2504 parms = DECL_ARGUMENTS (fn);
2506 /* Loop through the parameter declarations, replacing each with an
2507 equivalent VAR_DECL, appropriately initialized. */
2508 for (p = parms, i = 0; p; p = TREE_CHAIN (p), i++)
2511 val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL;
2512 setup_one_parameter (id, p, val, fn, bb, &vars);
2515 /* Initialize the static chain. */
2516 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
2517 gcc_assert (fn != current_function_decl);
2520 /* No static chain? Seems like a bug in tree-nested.c. */
2521 gcc_assert (static_chain);
2523 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
2526 declare_inline_vars (id->block, vars);
2530 /* Declare a return variable to replace the RESULT_DECL for the
2531 function we are calling. An appropriate DECL_STMT is returned.
2532 The USE_STMT is filled to contain a use of the declaration to
2533 indicate the return value of the function.
2535 RETURN_SLOT, if non-null is place where to store the result. It
2536 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2537 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2539 The return value is a (possibly null) value that holds the result
2540 as seen by the caller. */
2543 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest)
2545 tree callee = id->src_fn;
2546 tree caller = id->dst_fn;
2547 tree result = DECL_RESULT (callee);
2548 tree callee_type = TREE_TYPE (result);
2549 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
2552 /* We don't need to do anything for functions that don't return
2554 if (!result || VOID_TYPE_P (callee_type))
2557 /* If there was a return slot, then the return value is the
2558 dereferenced address of that object. */
2561 /* The front end shouldn't have used both return_slot and
2562 a modify expression. */
2563 gcc_assert (!modify_dest);
2564 if (DECL_BY_REFERENCE (result))
2566 tree return_slot_addr = build_fold_addr_expr (return_slot);
2567 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
2569 /* We are going to construct *&return_slot and we can't do that
2570 for variables believed to be not addressable.
2572 FIXME: This check possibly can match, because values returned
2573 via return slot optimization are not believed to have address
2574 taken by alias analysis. */
2575 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
2576 if (gimple_in_ssa_p (cfun))
2578 HOST_WIDE_INT bitsize;
2579 HOST_WIDE_INT bitpos;
2581 enum machine_mode mode;
2585 base = get_inner_reference (return_slot, &bitsize, &bitpos,
2587 &mode, &unsignedp, &volatilep,
2589 if (TREE_CODE (base) == INDIRECT_REF)
2590 base = TREE_OPERAND (base, 0);
2591 if (TREE_CODE (base) == SSA_NAME)
2592 base = SSA_NAME_VAR (base);
2593 mark_sym_for_renaming (base);
2595 var = return_slot_addr;
2600 gcc_assert (TREE_CODE (var) != SSA_NAME);
2601 TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
2603 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2604 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2605 && !DECL_GIMPLE_REG_P (result)
2607 DECL_GIMPLE_REG_P (var) = 0;
2612 /* All types requiring non-trivial constructors should have been handled. */
2613 gcc_assert (!TREE_ADDRESSABLE (callee_type));
2615 /* Attempt to avoid creating a new temporary variable. */
2617 && TREE_CODE (modify_dest) != SSA_NAME)
2619 bool use_it = false;
2621 /* We can't use MODIFY_DEST if there's type promotion involved. */
2622 if (!useless_type_conversion_p (callee_type, caller_type))
2625 /* ??? If we're assigning to a variable sized type, then we must
2626 reuse the destination variable, because we've no good way to
2627 create variable sized temporaries at this point. */
2628 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
2631 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2632 reuse it as the result of the call directly. Don't do this if
2633 it would promote MODIFY_DEST to addressable. */
2634 else if (TREE_ADDRESSABLE (result))
2638 tree base_m = get_base_address (modify_dest);
2640 /* If the base isn't a decl, then it's a pointer, and we don't
2641 know where that's going to go. */
2642 if (!DECL_P (base_m))
2644 else if (is_global_var (base_m))
2646 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2647 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2648 && !DECL_GIMPLE_REG_P (result)
2649 && DECL_GIMPLE_REG_P (base_m))
2651 else if (!TREE_ADDRESSABLE (base_m))
2663 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
2665 var = copy_result_decl_to_var (result, id);
2666 if (gimple_in_ssa_p (cfun))
2669 add_referenced_var (var);
2672 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2673 DECL_STRUCT_FUNCTION (caller)->local_decls
2674 = tree_cons (NULL_TREE, var,
2675 DECL_STRUCT_FUNCTION (caller)->local_decls);
2677 /* Do not have the rest of GCC warn about this variable as it should
2678 not be visible to the user. */
2679 TREE_NO_WARNING (var) = 1;
2681 declare_inline_vars (id->block, var);
2683 /* Build the use expr. If the return type of the function was
2684 promoted, convert it back to the expected type. */
2686 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
2687 use = fold_convert (caller_type, var);
2689 STRIP_USELESS_TYPE_CONVERSION (use);
2691 if (DECL_BY_REFERENCE (result))
2693 TREE_ADDRESSABLE (var) = 1;
2694 var = build_fold_addr_expr (var);
2698 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2699 way, when the RESULT_DECL is encountered, it will be
2700 automatically replaced by the VAR_DECL. */
2701 insert_decl_map (id, result, var);
2703 /* Remember this so we can ignore it in remap_decls. */
2709 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2710 to a local label. */
2713 has_label_address_in_static_1 (tree *nodep, int *walk_subtrees, void *fnp)
2716 tree fn = (tree) fnp;
2718 if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
2727 /* Callback through walk_tree. Determine if we've got an aggregate
2728 type that we can't support; return non-null if so. */
2731 cannot_copy_type_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
2732 void *data ATTRIBUTE_UNUSED)
2734 tree t, node = *nodep;
2736 if (TREE_CODE (node) == RECORD_TYPE || TREE_CODE (node) == UNION_TYPE)
2738 /* We cannot inline a function of the form
2740 void F (int i) { struct S { int ar[i]; } s; }
2742 Attempting to do so produces a catch-22.
2743 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
2744 UNION_TYPE nodes, then it goes into infinite recursion on a
2745 structure containing a pointer to its own type. If it doesn't,
2746 then the type node for S doesn't get adjusted properly when
2749 ??? This is likely no longer true, but it's too late in the 4.0
2750 cycle to try to find out. This should be checked for 4.1. */
2751 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
2752 if (variably_modified_type_p (TREE_TYPE (t), NULL))
2760 /* Determine if the function can be copied. If so return NULL. If
2761 not return a string describng the reason for failure. */
2764 copy_forbidden (struct function *fun, tree fndecl)
2766 const char *reason = fun->cannot_be_copied_reason;
2769 /* Only examine the function once. */
2770 if (fun->cannot_be_copied_set)
2773 /* We cannot copy a function that receives a non-local goto
2774 because we cannot remap the destination label used in the
2775 function that is performing the non-local goto. */
2776 /* ??? Actually, this should be possible, if we work at it.
2777 No doubt there's just a handful of places that simply
2778 assume it doesn't happen and don't substitute properly. */
2779 if (fun->has_nonlocal_label)
2781 reason = G_("function %q+F can never be copied "
2782 "because it receives a non-local goto");
2786 for (step = fun->local_decls; step; step = TREE_CHAIN (step))
2788 tree decl = TREE_VALUE (step);
2790 if (TREE_CODE (decl) == VAR_DECL
2791 && TREE_STATIC (decl)
2792 && !DECL_EXTERNAL (decl)
2793 && DECL_INITIAL (decl)
2794 && walk_tree_without_duplicates (&DECL_INITIAL (decl),
2795 has_label_address_in_static_1,
2798 reason = G_("function %q+F can never be copied because it saves "
2799 "address of local label in a static variable");
2803 if (!TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
2804 && variably_modified_type_p (TREE_TYPE (decl), NULL)
2805 && walk_tree_without_duplicates (&TREE_TYPE (decl),
2806 cannot_copy_type_1, NULL))
2808 reason = G_("function %q+F can never be copied "
2809 "because it uses variable sized variables");
2815 fun->cannot_be_copied_reason = reason;
2816 fun->cannot_be_copied_set = true;
2821 static const char *inline_forbidden_reason;
2823 /* A callback for walk_gimple_seq to handle statements. Returns non-null
2824 iff a function can not be inlined. Also sets the reason why. */
2827 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2828 struct walk_stmt_info *wip)
2830 tree fn = (tree) wip->info;
2832 gimple stmt = gsi_stmt (*gsi);
2834 switch (gimple_code (stmt))
2837 /* Refuse to inline alloca call unless user explicitly forced so as
2838 this may change program's memory overhead drastically when the
2839 function using alloca is called in loop. In GCC present in
2840 SPEC2000 inlining into schedule_block cause it to require 2GB of
2841 RAM instead of 256MB. */
2842 if (gimple_alloca_call_p (stmt)
2843 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
2845 inline_forbidden_reason
2846 = G_("function %q+F can never be inlined because it uses "
2847 "alloca (override using the always_inline attribute)");
2848 *handled_ops_p = true;
2852 t = gimple_call_fndecl (stmt);
2856 /* We cannot inline functions that call setjmp. */
2857 if (setjmp_call_p (t))
2859 inline_forbidden_reason
2860 = G_("function %q+F can never be inlined because it uses setjmp");
2861 *handled_ops_p = true;
2865 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
2866 switch (DECL_FUNCTION_CODE (t))
2868 /* We cannot inline functions that take a variable number of
2870 case BUILT_IN_VA_START:
2871 case BUILT_IN_NEXT_ARG:
2872 case BUILT_IN_VA_END:
2873 inline_forbidden_reason
2874 = G_("function %q+F can never be inlined because it "
2875 "uses variable argument lists");
2876 *handled_ops_p = true;
2879 case BUILT_IN_LONGJMP:
2880 /* We can't inline functions that call __builtin_longjmp at
2881 all. The non-local goto machinery really requires the
2882 destination be in a different function. If we allow the
2883 function calling __builtin_longjmp to be inlined into the
2884 function calling __builtin_setjmp, Things will Go Awry. */
2885 inline_forbidden_reason
2886 = G_("function %q+F can never be inlined because "
2887 "it uses setjmp-longjmp exception handling");
2888 *handled_ops_p = true;
2891 case BUILT_IN_NONLOCAL_GOTO:
2893 inline_forbidden_reason
2894 = G_("function %q+F can never be inlined because "
2895 "it uses non-local goto");
2896 *handled_ops_p = true;
2899 case BUILT_IN_RETURN:
2900 case BUILT_IN_APPLY_ARGS:
2901 /* If a __builtin_apply_args caller would be inlined,
2902 it would be saving arguments of the function it has
2903 been inlined into. Similarly __builtin_return would
2904 return from the function the inline has been inlined into. */
2905 inline_forbidden_reason
2906 = G_("function %q+F can never be inlined because "
2907 "it uses __builtin_return or __builtin_apply_args");
2908 *handled_ops_p = true;
2917 t = gimple_goto_dest (stmt);
2919 /* We will not inline a function which uses computed goto. The
2920 addresses of its local labels, which may be tucked into
2921 global storage, are of course not constant across
2922 instantiations, which causes unexpected behavior. */
2923 if (TREE_CODE (t) != LABEL_DECL)
2925 inline_forbidden_reason
2926 = G_("function %q+F can never be inlined "
2927 "because it contains a computed goto");
2928 *handled_ops_p = true;
2937 *handled_ops_p = false;
2941 /* Return true if FNDECL is a function that cannot be inlined into
2945 inline_forbidden_p (tree fndecl)
2947 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
2948 struct walk_stmt_info wi;
2949 struct pointer_set_t *visited_nodes;
2951 bool forbidden_p = false;
2953 /* First check for shared reasons not to copy the code. */
2954 inline_forbidden_reason = copy_forbidden (fun, fndecl);
2955 if (inline_forbidden_reason != NULL)
2958 /* Next, walk the statements of the function looking for
2959 constraucts we can't handle, or are non-optimal for inlining. */
2960 visited_nodes = pointer_set_create ();
2961 memset (&wi, 0, sizeof (wi));
2962 wi.info = (void *) fndecl;
2963 wi.pset = visited_nodes;
2965 FOR_EACH_BB_FN (bb, fun)
2968 gimple_seq seq = bb_seq (bb);
2969 ret = walk_gimple_seq (seq, inline_forbidden_p_stmt, NULL, &wi);
2970 forbidden_p = (ret != NULL);
2975 pointer_set_destroy (visited_nodes);
2979 /* Returns nonzero if FN is a function that does not have any
2980 fundamental inline blocking properties. */
2983 tree_inlinable_function_p (tree fn)
2985 bool inlinable = true;
2989 /* If we've already decided this function shouldn't be inlined,
2990 there's no need to check again. */
2991 if (DECL_UNINLINABLE (fn))
2994 /* We only warn for functions declared `inline' by the user. */
2995 do_warning = (warn_inline
2996 && DECL_DECLARED_INLINE_P (fn)
2997 && !DECL_NO_INLINE_WARNING_P (fn)
2998 && !DECL_IN_SYSTEM_HEADER (fn));
3000 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
3003 && always_inline == NULL)
3006 warning (OPT_Winline, "function %q+F can never be inlined because it "
3007 "is suppressed using -fno-inline", fn);
3011 /* Don't auto-inline anything that might not be bound within
3012 this unit of translation. */
3013 else if (!DECL_DECLARED_INLINE_P (fn)
3014 && DECL_REPLACEABLE_P (fn))
3017 else if (!function_attribute_inlinable_p (fn))
3020 warning (OPT_Winline, "function %q+F can never be inlined because it "
3021 "uses attributes conflicting with inlining", fn);
3025 else if (inline_forbidden_p (fn))
3027 /* See if we should warn about uninlinable functions. Previously,
3028 some of these warnings would be issued while trying to expand
3029 the function inline, but that would cause multiple warnings
3030 about functions that would for example call alloca. But since
3031 this a property of the function, just one warning is enough.
3032 As a bonus we can now give more details about the reason why a
3033 function is not inlinable. */
3035 sorry (inline_forbidden_reason, fn);
3036 else if (do_warning)
3037 warning (OPT_Winline, inline_forbidden_reason, fn);
3042 /* Squirrel away the result so that we don't have to check again. */
3043 DECL_UNINLINABLE (fn) = !inlinable;
3048 /* Estimate the cost of a memory move. Use machine dependent
3049 word size and take possible memcpy call into account. */
3052 estimate_move_cost (tree type)
3056 gcc_assert (!VOID_TYPE_P (type));
3058 size = int_size_in_bytes (type);
3060 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size))
3061 /* Cost of a memcpy call, 3 arguments and the call. */
3064 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
3067 /* Returns cost of operation CODE, according to WEIGHTS */
3070 estimate_operator_cost (enum tree_code code, eni_weights *weights,
3071 tree op1 ATTRIBUTE_UNUSED, tree op2)
3075 /* These are "free" conversions, or their presumed cost
3076 is folded into other operations. */
3083 /* Assign cost of 1 to usual operations.
3084 ??? We may consider mapping RTL costs to this. */
3089 case POINTER_PLUS_EXPR:
3093 case ADDR_SPACE_CONVERT_EXPR:
3094 case FIXED_CONVERT_EXPR:
3095 case FIX_TRUNC_EXPR:
3107 case VEC_LSHIFT_EXPR:
3108 case VEC_RSHIFT_EXPR:
3115 case TRUTH_ANDIF_EXPR:
3116 case TRUTH_ORIF_EXPR:
3117 case TRUTH_AND_EXPR:
3119 case TRUTH_XOR_EXPR:
3120 case TRUTH_NOT_EXPR:
3129 case UNORDERED_EXPR:
3140 case PREDECREMENT_EXPR:
3141 case PREINCREMENT_EXPR:
3142 case POSTDECREMENT_EXPR:
3143 case POSTINCREMENT_EXPR:
3145 case REALIGN_LOAD_EXPR:
3147 case REDUC_MAX_EXPR:
3148 case REDUC_MIN_EXPR:
3149 case REDUC_PLUS_EXPR:
3150 case WIDEN_SUM_EXPR:
3151 case WIDEN_MULT_EXPR:
3154 case VEC_WIDEN_MULT_HI_EXPR:
3155 case VEC_WIDEN_MULT_LO_EXPR:
3156 case VEC_UNPACK_HI_EXPR:
3157 case VEC_UNPACK_LO_EXPR:
3158 case VEC_UNPACK_FLOAT_HI_EXPR:
3159 case VEC_UNPACK_FLOAT_LO_EXPR:
3160 case VEC_PACK_TRUNC_EXPR:
3161 case VEC_PACK_SAT_EXPR:
3162 case VEC_PACK_FIX_TRUNC_EXPR:
3163 case VEC_EXTRACT_EVEN_EXPR:
3164 case VEC_EXTRACT_ODD_EXPR:
3165 case VEC_INTERLEAVE_HIGH_EXPR:
3166 case VEC_INTERLEAVE_LOW_EXPR:
3170 /* Few special cases of expensive operations. This is useful
3171 to avoid inlining on functions having too many of these. */
3172 case TRUNC_DIV_EXPR:
3174 case FLOOR_DIV_EXPR:
3175 case ROUND_DIV_EXPR:
3176 case EXACT_DIV_EXPR:
3177 case TRUNC_MOD_EXPR:
3179 case FLOOR_MOD_EXPR:
3180 case ROUND_MOD_EXPR:
3182 if (TREE_CODE (op2) != INTEGER_CST)
3183 return weights->div_mod_cost;
3187 /* We expect a copy assignment with no operator. */
3188 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
3194 /* Estimate number of instructions that will be created by expanding
3195 the statements in the statement sequence STMTS.
3196 WEIGHTS contains weights attributed to various constructs. */
3199 int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
3202 gimple_stmt_iterator gsi;
3205 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
3206 cost += estimate_num_insns (gsi_stmt (gsi), weights);
3212 /* Estimate number of instructions that will be created by expanding STMT.
3213 WEIGHTS contains weights attributed to various constructs. */
3216 estimate_num_insns (gimple stmt, eni_weights *weights)
3219 enum gimple_code code = gimple_code (stmt);
3226 /* Try to estimate the cost of assignments. We have three cases to
3228 1) Simple assignments to registers;
3229 2) Stores to things that must live in memory. This includes
3230 "normal" stores to scalars, but also assignments of large
3231 structures, or constructors of big arrays;
3233 Let us look at the first two cases, assuming we have "a = b + C":
3234 <GIMPLE_ASSIGN <var_decl "a">
3235 <plus_expr <var_decl "b"> <constant C>>
3236 If "a" is a GIMPLE register, the assignment to it is free on almost
3237 any target, because "a" usually ends up in a real register. Hence
3238 the only cost of this expression comes from the PLUS_EXPR, and we
3239 can ignore the GIMPLE_ASSIGN.
3240 If "a" is not a GIMPLE register, the assignment to "a" will most
3241 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3242 of moving something into "a", which we compute using the function
3243 estimate_move_cost. */
3244 lhs = gimple_assign_lhs (stmt);
3245 rhs = gimple_assign_rhs1 (stmt);
3247 if (is_gimple_reg (lhs))
3250 cost = estimate_move_cost (TREE_TYPE (lhs));
3252 if (!is_gimple_reg (rhs) && !is_gimple_min_invariant (rhs))
3253 cost += estimate_move_cost (TREE_TYPE (rhs));
3255 cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights,
3256 gimple_assign_rhs1 (stmt),
3257 get_gimple_rhs_class (gimple_assign_rhs_code (stmt))
3258 == GIMPLE_BINARY_RHS
3259 ? gimple_assign_rhs2 (stmt) : NULL);
3263 cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights,
3264 gimple_op (stmt, 0),
3265 gimple_op (stmt, 1));
3269 /* Take into account cost of the switch + guess 2 conditional jumps for
3272 TODO: once the switch expansion logic is sufficiently separated, we can
3273 do better job on estimating cost of the switch. */
3274 if (weights->time_based)
3275 cost = floor_log2 (gimple_switch_num_labels (stmt)) * 2;
3277 cost = gimple_switch_num_labels (stmt) * 2;
3282 tree decl = gimple_call_fndecl (stmt);
3283 tree addr = gimple_call_fn (stmt);
3284 tree funtype = TREE_TYPE (addr);
3286 if (POINTER_TYPE_P (funtype))
3287 funtype = TREE_TYPE (funtype);
3289 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
3290 cost = weights->target_builtin_call_cost;
3292 cost = weights->call_cost;
3294 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
3295 switch (DECL_FUNCTION_CODE (decl))
3297 case BUILT_IN_CONSTANT_P:
3299 case BUILT_IN_EXPECT:
3302 /* Prefetch instruction is not expensive. */
3303 case BUILT_IN_PREFETCH:
3304 cost = weights->target_builtin_call_cost;
3312 funtype = TREE_TYPE (decl);
3314 if (!VOID_TYPE_P (TREE_TYPE (funtype)))
3315 cost += estimate_move_cost (TREE_TYPE (funtype));
3316 /* Our cost must be kept in sync with
3317 cgraph_estimate_size_after_inlining that does use function
3318 declaration to figure out the arguments. */
3319 if (decl && DECL_ARGUMENTS (decl))
3322 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
3323 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3324 cost += estimate_move_cost (TREE_TYPE (arg));
3326 else if (funtype && prototype_p (funtype))
3329 for (t = TYPE_ARG_TYPES (funtype); t && t != void_list_node;
3331 if (!VOID_TYPE_P (TREE_VALUE (t)))
3332 cost += estimate_move_cost (TREE_VALUE (t));
3336 for (i = 0; i < gimple_call_num_args (stmt); i++)
3338 tree arg = gimple_call_arg (stmt, i);
3339 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3340 cost += estimate_move_cost (TREE_TYPE (arg));
3352 case GIMPLE_PREDICT:
3357 return asm_str_count (gimple_asm_string (stmt));
3360 /* This is either going to be an external function call with one
3361 argument, or two register copy statements plus a goto. */
3364 case GIMPLE_EH_DISPATCH:
3365 /* ??? This is going to turn into a switch statement. Ideally
3366 we'd have a look at the eh region and estimate the number of
3371 return estimate_num_insns_seq (gimple_bind_body (stmt), weights);
3373 case GIMPLE_EH_FILTER:
3374 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
3377 return estimate_num_insns_seq (gimple_catch_handler (stmt), weights);
3380 return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
3381 + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
3383 /* OpenMP directives are generally very expensive. */
3385 case GIMPLE_OMP_RETURN:
3386 case GIMPLE_OMP_SECTIONS_SWITCH:
3387 case GIMPLE_OMP_ATOMIC_STORE:
3388 case GIMPLE_OMP_CONTINUE:
3389 /* ...except these, which are cheap. */
3392 case GIMPLE_OMP_ATOMIC_LOAD:
3393 return weights->omp_cost;
3395 case GIMPLE_OMP_FOR:
3396 return (weights->omp_cost
3397 + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
3398 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
3400 case GIMPLE_OMP_PARALLEL:
3401 case GIMPLE_OMP_TASK:
3402 case GIMPLE_OMP_CRITICAL:
3403 case GIMPLE_OMP_MASTER:
3404 case GIMPLE_OMP_ORDERED:
3405 case GIMPLE_OMP_SECTION:
3406 case GIMPLE_OMP_SECTIONS:
3407 case GIMPLE_OMP_SINGLE:
3408 return (weights->omp_cost
3409 + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
3418 /* Estimate number of instructions that will be created by expanding
3419 function FNDECL. WEIGHTS contains weights attributed to various
3423 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
3425 struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
3426 gimple_stmt_iterator bsi;
3430 gcc_assert (my_function && my_function->cfg);
3431 FOR_EACH_BB_FN (bb, my_function)
3433 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
3434 n += estimate_num_insns (gsi_stmt (bsi), weights);
3441 /* Initializes weights used by estimate_num_insns. */
3444 init_inline_once (void)
3446 eni_size_weights.call_cost = 1;
3447 eni_size_weights.target_builtin_call_cost = 1;
3448 eni_size_weights.div_mod_cost = 1;
3449 eni_size_weights.omp_cost = 40;
3450 eni_size_weights.time_based = false;
3452 /* Estimating time for call is difficult, since we have no idea what the
3453 called function does. In the current uses of eni_time_weights,
3454 underestimating the cost does less harm than overestimating it, so
3455 we choose a rather small value here. */
3456 eni_time_weights.call_cost = 10;
3457 eni_time_weights.target_builtin_call_cost = 10;
3458 eni_time_weights.div_mod_cost = 10;
3459 eni_time_weights.omp_cost = 40;
3460 eni_time_weights.time_based = true;
3463 /* Estimate the number of instructions in a gimple_seq. */
3466 count_insns_seq (gimple_seq seq, eni_weights *weights)
3468 gimple_stmt_iterator gsi;
3470 for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
3471 n += estimate_num_insns (gsi_stmt (gsi), weights);
3477 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3480 prepend_lexical_block (tree current_block, tree new_block)
3482 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
3483 BLOCK_SUBBLOCKS (current_block) = new_block;
3484 BLOCK_SUPERCONTEXT (new_block) = current_block;
3487 /* Fetch callee declaration from the call graph edge going from NODE and
3488 associated with STMR call statement. Return NULL_TREE if not found. */
3490 get_indirect_callee_fndecl (struct cgraph_node *node, gimple stmt)
3492 struct cgraph_edge *cs;
3494 cs = cgraph_edge (node, stmt);
3496 return cs->callee->decl;
3501 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3504 expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id)
3508 struct pointer_map_t *st, *dst;
3511 location_t saved_location;
3512 struct cgraph_edge *cg_edge;
3513 cgraph_inline_failed_t reason;
3514 basic_block return_block;
3516 gimple_stmt_iterator gsi, stmt_gsi;
3517 bool successfully_inlined = FALSE;
3518 bool purge_dead_abnormal_edges;
3522 /* Set input_location here so we get the right instantiation context
3523 if we call instantiate_decl from inlinable_function_p. */
3524 saved_location = input_location;
3525 if (gimple_has_location (stmt))
3526 input_location = gimple_location (stmt);
3528 /* From here on, we're only interested in CALL_EXPRs. */
3529 if (gimple_code (stmt) != GIMPLE_CALL)
3532 /* First, see if we can figure out what function is being called.
3533 If we cannot, then there is no hope of inlining the function. */
3534 fn = gimple_call_fndecl (stmt);
3537 fn = get_indirect_callee_fndecl (id->dst_node, stmt);
3542 /* Turn forward declarations into real ones. */
3543 fn = cgraph_node (fn)->decl;
3545 /* If FN is a declaration of a function in a nested scope that was
3546 globally declared inline, we don't set its DECL_INITIAL.
3547 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3548 C++ front-end uses it for cdtors to refer to their internal
3549 declarations, that are not real functions. Fortunately those
3550 don't have trees to be saved, so we can tell by checking their
3552 if (!DECL_INITIAL (fn)
3553 && DECL_ABSTRACT_ORIGIN (fn)
3554 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
3555 fn = DECL_ABSTRACT_ORIGIN (fn);
3557 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3558 Kill this check once this is fixed. */
3559 if (!id->dst_node->analyzed)
3562 cg_edge = cgraph_edge (id->dst_node, stmt);
3564 /* Don't inline functions with different EH personalities. */
3565 if (DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3566 && DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl)
3567 && (DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3568 != DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl)))
3571 /* Don't try to inline functions that are not well-suited to
3573 if (!cgraph_inline_p (cg_edge, &reason))
3575 /* If this call was originally indirect, we do not want to emit any
3576 inlining related warnings or sorry messages because there are no
3577 guarantees regarding those. */
3578 if (cg_edge->indirect_call)
3581 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
3582 /* Avoid warnings during early inline pass. */
3583 && cgraph_global_info_ready)
3585 sorry ("inlining failed in call to %q+F: %s", fn,
3586 cgraph_inline_failed_string (reason));
3587 sorry ("called from here");
3589 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
3590 && !DECL_IN_SYSTEM_HEADER (fn)
3591 && reason != CIF_UNSPECIFIED
3592 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
3593 /* Avoid warnings during early inline pass. */
3594 && cgraph_global_info_ready)
3596 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
3597 fn, cgraph_inline_failed_string (reason));
3598 warning (OPT_Winline, "called from here");
3602 fn = cg_edge->callee->decl;
3604 #ifdef ENABLE_CHECKING
3605 if (cg_edge->callee->decl != id->dst_node->decl)
3606 verify_cgraph_node (cg_edge->callee);
3609 /* We will be inlining this callee. */
3610 id->eh_lp_nr = lookup_stmt_eh_lp (stmt);
3612 /* Update the callers EH personality. */
3613 if (DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl))
3614 DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3615 = DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl);
3617 /* Split the block holding the GIMPLE_CALL. */
3618 e = split_block (bb, stmt);
3620 return_block = e->dest;
3623 /* split_block splits after the statement; work around this by
3624 moving the call into the second block manually. Not pretty,
3625 but seems easier than doing the CFG manipulation by hand
3626 when the GIMPLE_CALL is in the last statement of BB. */
3627 stmt_gsi = gsi_last_bb (bb);
3628 gsi_remove (&stmt_gsi, false);
3630 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3631 been the source of abnormal edges. In this case, schedule
3632 the removal of dead abnormal edges. */
3633 gsi = gsi_start_bb (return_block);
3634 if (gsi_end_p (gsi))
3636 gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
3637 purge_dead_abnormal_edges = true;
3641 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
3642 purge_dead_abnormal_edges = false;
3645 stmt_gsi = gsi_start_bb (return_block);
3647 /* Build a block containing code to initialize the arguments, the
3648 actual inline expansion of the body, and a label for the return
3649 statements within the function to jump to. The type of the
3650 statement expression is the return type of the function call. */
3651 id->block = make_node (BLOCK);
3652 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
3653 BLOCK_SOURCE_LOCATION (id->block) = input_location;
3654 prepend_lexical_block (gimple_block (stmt), id->block);
3656 /* Local declarations will be replaced by their equivalents in this
3659 id->decl_map = pointer_map_create ();
3660 dst = id->debug_map;
3661 id->debug_map = NULL;
3663 /* Record the function we are about to inline. */
3665 id->src_node = cg_edge->callee;
3666 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
3667 id->gimple_call = stmt;
3669 gcc_assert (!id->src_cfun->after_inlining);
3672 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
3674 gimple_stmt_iterator si = gsi_last_bb (bb);
3675 gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
3679 initialize_inlined_parameters (id, stmt, fn, bb);
3681 if (DECL_INITIAL (fn))
3682 prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
3684 /* Return statements in the function body will be replaced by jumps
3685 to the RET_LABEL. */
3686 gcc_assert (DECL_INITIAL (fn));
3687 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
3689 /* Find the LHS to which the result of this call is assigned. */
3691 if (gimple_call_lhs (stmt))
3693 modify_dest = gimple_call_lhs (stmt);
3695 /* The function which we are inlining might not return a value,
3696 in which case we should issue a warning that the function
3697 does not return a value. In that case the optimizers will
3698 see that the variable to which the value is assigned was not
3699 initialized. We do not want to issue a warning about that
3700 uninitialized variable. */
3701 if (DECL_P (modify_dest))
3702 TREE_NO_WARNING (modify_dest) = 1;
3704 if (gimple_call_return_slot_opt_p (stmt))
3706 return_slot = modify_dest;
3713 /* If we are inlining a call to the C++ operator new, we don't want
3714 to use type based alias analysis on the return value. Otherwise
3715 we may get confused if the compiler sees that the inlined new
3716 function returns a pointer which was just deleted. See bug
3718 if (DECL_IS_OPERATOR_NEW (fn))
3724 /* Declare the return variable for the function. */
3725 use_retvar = declare_return_variable (id, return_slot, modify_dest);
3727 /* Add local vars in this inlined callee to caller. */
3728 t_step = id->src_cfun->local_decls;
3729 for (; t_step; t_step = TREE_CHAIN (t_step))
3731 var = TREE_VALUE (t_step);
3732 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3734 if (var_ann (var) && add_referenced_var (var))
3735 cfun->local_decls = tree_cons (NULL_TREE, var,
3738 else if (!can_be_nonlocal (var, id))
3739 cfun->local_decls = tree_cons (NULL_TREE, remap_decl (var, id),
3743 if (dump_file && (dump_flags & TDF_DETAILS))
3745 fprintf (dump_file, "Inlining ");
3746 print_generic_expr (dump_file, id->src_fn, 0);
3747 fprintf (dump_file, " to ");
3748 print_generic_expr (dump_file, id->dst_fn, 0);
3749 fprintf (dump_file, " with frequency %i\n", cg_edge->frequency);
3752 /* This is it. Duplicate the callee body. Assume callee is
3753 pre-gimplified. Note that we must not alter the caller
3754 function in any way before this point, as this CALL_EXPR may be
3755 a self-referential call; if we're calling ourselves, we need to
3756 duplicate our body before altering anything. */
3757 copy_body (id, bb->count,
3758 cg_edge->frequency * REG_BR_PROB_BASE / CGRAPH_FREQ_BASE,
3761 /* Reset the escaped and callused solutions. */
3762 if (cfun->gimple_df)
3764 pt_solution_reset (&cfun->gimple_df->escaped);
3765 pt_solution_reset (&cfun->gimple_df->callused);
3771 pointer_map_destroy (id->debug_map);
3772 id->debug_map = dst;
3774 pointer_map_destroy (id->decl_map);
3777 /* Unlink the calls virtual operands before replacing it. */
3778 unlink_stmt_vdef (stmt);
3780 /* If the inlined function returns a result that we care about,
3781 substitute the GIMPLE_CALL with an assignment of the return
3782 variable to the LHS of the call. That is, if STMT was
3783 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3784 if (use_retvar && gimple_call_lhs (stmt))
3786 gimple old_stmt = stmt;
3787 stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
3788 gsi_replace (&stmt_gsi, stmt, false);
3789 if (gimple_in_ssa_p (cfun))
3790 mark_symbols_for_renaming (stmt);
3791 maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
3795 /* Handle the case of inlining a function with no return
3796 statement, which causes the return value to become undefined. */
3797 if (gimple_call_lhs (stmt)
3798 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
3800 tree name = gimple_call_lhs (stmt);
3801 tree var = SSA_NAME_VAR (name);
3802 tree def = gimple_default_def (cfun, var);
3806 /* If the variable is used undefined, make this name
3807 undefined via a move. */
3808 stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
3809 gsi_replace (&stmt_gsi, stmt, true);
3813 /* Otherwise make this variable undefined. */
3814 gsi_remove (&stmt_gsi, true);
3815 set_default_def (var, name);
3816 SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
3820 gsi_remove (&stmt_gsi, true);
3823 if (purge_dead_abnormal_edges)
3824 gimple_purge_dead_abnormal_call_edges (return_block);
3826 /* If the value of the new expression is ignored, that's OK. We
3827 don't warn about this for CALL_EXPRs, so we shouldn't warn about
3828 the equivalent inlined version either. */
3829 if (is_gimple_assign (stmt))
3831 gcc_assert (gimple_assign_single_p (stmt)
3832 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
3833 TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
3836 /* Output the inlining info for this abstract function, since it has been
3837 inlined. If we don't do this now, we can lose the information about the
3838 variables in the function when the blocks get blown away as soon as we
3839 remove the cgraph node. */
3840 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
3842 /* Update callgraph if needed. */
3843 cgraph_remove_node (cg_edge->callee);
3845 id->block = NULL_TREE;
3846 successfully_inlined = TRUE;
3849 input_location = saved_location;
3850 return successfully_inlined;
3853 /* Expand call statements reachable from STMT_P.
3854 We can only have CALL_EXPRs as the "toplevel" tree code or nested
3855 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
3856 unfortunately not use that function here because we need a pointer
3857 to the CALL_EXPR, not the tree itself. */
3860 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
3862 gimple_stmt_iterator gsi;
3864 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3866 gimple stmt = gsi_stmt (gsi);
3868 if (is_gimple_call (stmt)
3869 && expand_call_inline (bb, stmt, id))
3877 /* Walk all basic blocks created after FIRST and try to fold every statement
3878 in the STATEMENTS pointer set. */
3881 fold_marked_statements (int first, struct pointer_set_t *statements)
3883 for (; first < n_basic_blocks; first++)
3884 if (BASIC_BLOCK (first))
3886 gimple_stmt_iterator gsi;
3888 for (gsi = gsi_start_bb (BASIC_BLOCK (first));
3891 if (pointer_set_contains (statements, gsi_stmt (gsi)))
3893 gimple old_stmt = gsi_stmt (gsi);
3894 tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0;
3896 if (old_decl && DECL_BUILT_IN (old_decl))
3898 /* Folding builtins can create multiple instructions,
3899 we need to look at all of them. */
3900 gimple_stmt_iterator i2 = gsi;
3902 if (fold_stmt (&gsi))
3906 i2 = gsi_start_bb (BASIC_BLOCK (first));
3911 new_stmt = gsi_stmt (i2);
3912 update_stmt (new_stmt);
3913 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
3916 if (new_stmt == gsi_stmt (gsi))
3918 /* It is okay to check only for the very last
3919 of these statements. If it is a throwing
3920 statement nothing will change. If it isn't
3921 this can remove EH edges. If that weren't
3922 correct then because some intermediate stmts
3923 throw, but not the last one. That would mean
3924 we'd have to split the block, which we can't
3925 here and we'd loose anyway. And as builtins
3926 probably never throw, this all
3928 if (maybe_clean_or_replace_eh_stmt (old_stmt,
3930 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
3937 else if (fold_stmt (&gsi))
3939 /* Re-read the statement from GSI as fold_stmt() may
3941 gimple new_stmt = gsi_stmt (gsi);
3942 update_stmt (new_stmt);
3944 if (is_gimple_call (old_stmt)
3945 || is_gimple_call (new_stmt))
3946 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
3949 if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
3950 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
3956 /* Return true if BB has at least one abnormal outgoing edge. */
3959 has_abnormal_outgoing_edge_p (basic_block bb)
3964 FOR_EACH_EDGE (e, ei, bb->succs)
3965 if (e->flags & EDGE_ABNORMAL)
3971 /* Expand calls to inline functions in the body of FN. */
3974 optimize_inline_calls (tree fn)
3978 int last = n_basic_blocks;
3979 struct gimplify_ctx gctx;
3981 /* There is no point in performing inlining if errors have already
3982 occurred -- and we might crash if we try to inline invalid
3984 if (errorcount || sorrycount)
3988 memset (&id, 0, sizeof (id));
3990 id.src_node = id.dst_node = cgraph_node (fn);
3992 /* Or any functions that aren't finished yet. */
3993 if (current_function_decl)
3994 id.dst_fn = current_function_decl;
3996 id.copy_decl = copy_decl_maybe_to_var;
3997 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3998 id.transform_new_cfg = false;
3999 id.transform_return_to_modify = true;
4000 id.transform_lang_insert_block = NULL;
4001 id.statements_to_fold = pointer_set_create ();
4003 push_gimplify_context (&gctx);
4005 /* We make no attempts to keep dominance info up-to-date. */
4006 free_dominance_info (CDI_DOMINATORS);
4007 free_dominance_info (CDI_POST_DOMINATORS);
4009 /* Register specific gimple functions. */
4010 gimple_register_cfg_hooks ();
4012 /* Reach the trees by walking over the CFG, and note the
4013 enclosing basic-blocks in the call edges. */
4014 /* We walk the blocks going forward, because inlined function bodies
4015 will split id->current_basic_block, and the new blocks will
4016 follow it; we'll trudge through them, processing their CALL_EXPRs
4019 gimple_expand_calls_inline (bb, &id);
4021 pop_gimplify_context (NULL);
4023 #ifdef ENABLE_CHECKING
4025 struct cgraph_edge *e;
4027 verify_cgraph_node (id.dst_node);
4029 /* Double check that we inlined everything we are supposed to inline. */
4030 for (e = id.dst_node->callees; e; e = e->next_callee)
4031 gcc_assert (e->inline_failed);
4035 /* Fold the statements before compacting/renumbering the basic blocks. */
4036 fold_marked_statements (last, id.statements_to_fold);
4037 pointer_set_destroy (id.statements_to_fold);
4039 gcc_assert (!id.debug_stmts);
4041 /* Renumber the (code) basic_blocks consecutively. */
4043 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4046 fold_cond_expr_cond ();
4047 delete_unreachable_blocks_update_callgraph (&id);
4048 #ifdef ENABLE_CHECKING
4049 verify_cgraph_node (id.dst_node);
4052 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4053 not possible yet - the IPA passes might make various functions to not
4054 throw and they don't care to proactively update local EH info. This is
4055 done later in fixup_cfg pass that also execute the verification. */
4056 return (TODO_update_ssa
4058 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
4059 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
4062 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4065 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
4067 enum tree_code code = TREE_CODE (*tp);
4068 enum tree_code_class cl = TREE_CODE_CLASS (code);
4070 /* We make copies of most nodes. */
4071 if (IS_EXPR_CODE_CLASS (cl)
4072 || code == TREE_LIST
4074 || code == TYPE_DECL
4075 || code == OMP_CLAUSE)
4077 /* Because the chain gets clobbered when we make a copy, we save it
4079 tree chain = NULL_TREE, new_tree;
4081 chain = TREE_CHAIN (*tp);
4083 /* Copy the node. */
4084 new_tree = copy_node (*tp);
4086 /* Propagate mudflap marked-ness. */
4087 if (flag_mudflap && mf_marked_p (*tp))
4092 /* Now, restore the chain, if appropriate. That will cause
4093 walk_tree to walk into the chain as well. */
4094 if (code == PARM_DECL
4095 || code == TREE_LIST
4096 || code == OMP_CLAUSE)
4097 TREE_CHAIN (*tp) = chain;
4099 /* For now, we don't update BLOCKs when we make copies. So, we
4100 have to nullify all BIND_EXPRs. */
4101 if (TREE_CODE (*tp) == BIND_EXPR)
4102 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
4104 else if (code == CONSTRUCTOR)
4106 /* CONSTRUCTOR nodes need special handling because
4107 we need to duplicate the vector of elements. */
4110 new_tree = copy_node (*tp);
4112 /* Propagate mudflap marked-ness. */
4113 if (flag_mudflap && mf_marked_p (*tp))
4116 CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc,
4117 CONSTRUCTOR_ELTS (*tp));
4120 else if (TREE_CODE_CLASS (code) == tcc_type)
4122 else if (TREE_CODE_CLASS (code) == tcc_declaration)
4124 else if (TREE_CODE_CLASS (code) == tcc_constant)
4127 gcc_assert (code != STATEMENT_LIST);
4131 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4132 information indicating to what new SAVE_EXPR this one should be mapped,
4133 use that one. Otherwise, create a new node and enter it in ST. FN is
4134 the function into which the copy will be placed. */
4137 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
4139 struct pointer_map_t *st = (struct pointer_map_t *) st_;
4143 /* See if we already encountered this SAVE_EXPR. */
4144 n = (tree *) pointer_map_contains (st, *tp);
4146 /* If we didn't already remap this SAVE_EXPR, do so now. */
4149 t = copy_node (*tp);
4151 /* Remember this SAVE_EXPR. */
4152 *pointer_map_insert (st, *tp) = t;
4153 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4154 *pointer_map_insert (st, t) = t;
4158 /* We've already walked into this SAVE_EXPR; don't do it again. */
4163 /* Replace this SAVE_EXPR with the copy. */
4167 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4168 copies the declaration and enters it in the splay_tree in DATA (which is
4169 really an `copy_body_data *'). */
4172 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
4175 copy_body_data *id = (copy_body_data *) data;
4177 /* Don't walk into types. */
4181 else if (TREE_CODE (*tp) == LABEL_EXPR)
4183 tree decl = TREE_OPERAND (*tp, 0);
4185 /* Copy the decl and remember the copy. */
4186 insert_decl_map (id, decl, id->copy_decl (decl, id));
4192 /* Perform any modifications to EXPR required when it is unsaved. Does
4193 not recurse into EXPR's subtrees. */
4196 unsave_expr_1 (tree expr)
4198 switch (TREE_CODE (expr))
4201 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4202 It's OK for this to happen if it was part of a subtree that
4203 isn't immediately expanded, such as operand 2 of another
4205 if (TREE_OPERAND (expr, 1))
4208 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4209 TREE_OPERAND (expr, 3) = NULL_TREE;
4217 /* Called via walk_tree when an expression is unsaved. Using the
4218 splay_tree pointed to by ST (which is really a `splay_tree'),
4219 remaps all local declarations to appropriate replacements. */
4222 unsave_r (tree *tp, int *walk_subtrees, void *data)
4224 copy_body_data *id = (copy_body_data *) data;
4225 struct pointer_map_t *st = id->decl_map;
4228 /* Only a local declaration (variable or label). */
4229 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
4230 || TREE_CODE (*tp) == LABEL_DECL)
4232 /* Lookup the declaration. */
4233 n = (tree *) pointer_map_contains (st, *tp);
4235 /* If it's there, remap it. */
4240 else if (TREE_CODE (*tp) == STATEMENT_LIST)
4242 else if (TREE_CODE (*tp) == BIND_EXPR)
4243 copy_bind_expr (tp, walk_subtrees, id);
4244 else if (TREE_CODE (*tp) == SAVE_EXPR
4245 || TREE_CODE (*tp) == TARGET_EXPR)
4246 remap_save_expr (tp, st, walk_subtrees);
4249 copy_tree_r (tp, walk_subtrees, NULL);
4251 /* Do whatever unsaving is required. */
4252 unsave_expr_1 (*tp);
4255 /* Keep iterating. */
4259 /* Copies everything in EXPR and replaces variables, labels
4260 and SAVE_EXPRs local to EXPR. */
4263 unsave_expr_now (tree expr)
4267 /* There's nothing to do for NULL_TREE. */
4272 memset (&id, 0, sizeof (id));
4273 id.src_fn = current_function_decl;
4274 id.dst_fn = current_function_decl;
4275 id.decl_map = pointer_map_create ();
4276 id.debug_map = NULL;
4278 id.copy_decl = copy_decl_no_change;
4279 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4280 id.transform_new_cfg = false;
4281 id.transform_return_to_modify = false;
4282 id.transform_lang_insert_block = NULL;
4284 /* Walk the tree once to find local labels. */
4285 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
4287 /* Walk the tree again, copying, remapping, and unsaving. */
4288 walk_tree (&expr, unsave_r, &id, NULL);
4291 pointer_map_destroy (id.decl_map);
4293 pointer_map_destroy (id.debug_map);
4298 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4299 label, copies the declaration and enters it in the splay_tree in DATA (which
4300 is really a 'copy_body_data *'. */
4303 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
4304 bool *handled_ops_p ATTRIBUTE_UNUSED,
4305 struct walk_stmt_info *wi)
4307 copy_body_data *id = (copy_body_data *) wi->info;
4308 gimple stmt = gsi_stmt (*gsip);
4310 if (gimple_code (stmt) == GIMPLE_LABEL)
4312 tree decl = gimple_label_label (stmt);
4314 /* Copy the decl and remember the copy. */
4315 insert_decl_map (id, decl, id->copy_decl (decl, id));
4322 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4323 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4324 remaps all local declarations to appropriate replacements in gimple
4328 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
4330 struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
4331 copy_body_data *id = (copy_body_data *) wi->info;
4332 struct pointer_map_t *st = id->decl_map;
4336 /* Only a local declaration (variable or label). */
4337 if ((TREE_CODE (expr) == VAR_DECL
4338 && !TREE_STATIC (expr))
4339 || TREE_CODE (expr) == LABEL_DECL)
4341 /* Lookup the declaration. */
4342 n = (tree *) pointer_map_contains (st, expr);
4344 /* If it's there, remap it. */
4349 else if (TREE_CODE (expr) == STATEMENT_LIST
4350 || TREE_CODE (expr) == BIND_EXPR
4351 || TREE_CODE (expr) == SAVE_EXPR)
4353 else if (TREE_CODE (expr) == TARGET_EXPR)
4355 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4356 It's OK for this to happen if it was part of a subtree that
4357 isn't immediately expanded, such as operand 2 of another
4359 if (!TREE_OPERAND (expr, 1))
4361 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4362 TREE_OPERAND (expr, 3) = NULL_TREE;
4366 /* Keep iterating. */
4371 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4372 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4373 remaps all local declarations to appropriate replacements in gimple
4377 replace_locals_stmt (gimple_stmt_iterator *gsip,
4378 bool *handled_ops_p ATTRIBUTE_UNUSED,
4379 struct walk_stmt_info *wi)
4381 copy_body_data *id = (copy_body_data *) wi->info;
4382 gimple stmt = gsi_stmt (*gsip);
4384 if (gimple_code (stmt) == GIMPLE_BIND)
4386 tree block = gimple_bind_block (stmt);
4390 remap_block (&block, id);
4391 gimple_bind_set_block (stmt, block);
4394 /* This will remap a lot of the same decls again, but this should be
4396 if (gimple_bind_vars (stmt))
4397 gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id));
4400 /* Keep iterating. */
4405 /* Copies everything in SEQ and replaces variables and labels local to
4406 current_function_decl. */
4409 copy_gimple_seq_and_replace_locals (gimple_seq seq)
4412 struct walk_stmt_info wi;
4413 struct pointer_set_t *visited;
4416 /* There's nothing to do for NULL_TREE. */
4421 memset (&id, 0, sizeof (id));
4422 id.src_fn = current_function_decl;
4423 id.dst_fn = current_function_decl;
4424 id.decl_map = pointer_map_create ();
4425 id.debug_map = NULL;
4427 id.copy_decl = copy_decl_no_change;
4428 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4429 id.transform_new_cfg = false;
4430 id.transform_return_to_modify = false;
4431 id.transform_lang_insert_block = NULL;
4433 /* Walk the tree once to find local labels. */
4434 memset (&wi, 0, sizeof (wi));
4435 visited = pointer_set_create ();
4438 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
4439 pointer_set_destroy (visited);
4441 copy = gimple_seq_copy (seq);
4443 /* Walk the copy, remapping decls. */
4444 memset (&wi, 0, sizeof (wi));
4446 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
4449 pointer_map_destroy (id.decl_map);
4451 pointer_map_destroy (id.debug_map);
4457 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4460 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
4469 debug_find_tree (tree top, tree search)
4471 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
4475 /* Declare the variables created by the inliner. Add all the variables in
4476 VARS to BIND_EXPR. */
4479 declare_inline_vars (tree block, tree vars)
4482 for (t = vars; t; t = TREE_CHAIN (t))
4484 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
4485 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
4486 cfun->local_decls = tree_cons (NULL_TREE, t, cfun->local_decls);
4490 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
4493 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4494 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4495 VAR_DECL translation. */
4498 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
4500 /* Don't generate debug information for the copy if we wouldn't have
4501 generated it for the copy either. */
4502 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
4503 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
4505 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4506 declaration inspired this copy. */
4507 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
4509 /* The new variable/label has no RTL, yet. */
4510 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
4511 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
4512 SET_DECL_RTL (copy, NULL_RTX);
4514 /* These args would always appear unused, if not for this. */
4515 TREE_USED (copy) = 1;
4517 /* Set the context for the new declaration. */
4518 if (!DECL_CONTEXT (decl))
4519 /* Globals stay global. */
4521 else if (DECL_CONTEXT (decl) != id->src_fn)
4522 /* Things that weren't in the scope of the function we're inlining
4523 from aren't in the scope we're inlining to, either. */
4525 else if (TREE_STATIC (decl))
4526 /* Function-scoped static variables should stay in the original
4530 /* Ordinary automatic local variables are now in the scope of the
4532 DECL_CONTEXT (copy) = id->dst_fn;
4538 copy_decl_to_var (tree decl, copy_body_data *id)
4542 gcc_assert (TREE_CODE (decl) == PARM_DECL
4543 || TREE_CODE (decl) == RESULT_DECL);
4545 type = TREE_TYPE (decl);
4547 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4548 VAR_DECL, DECL_NAME (decl), type);
4549 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4550 TREE_READONLY (copy) = TREE_READONLY (decl);
4551 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4552 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4554 return copy_decl_for_dup_finish (id, decl, copy);
4557 /* Like copy_decl_to_var, but create a return slot object instead of a
4558 pointer variable for return by invisible reference. */
4561 copy_result_decl_to_var (tree decl, copy_body_data *id)
4565 gcc_assert (TREE_CODE (decl) == PARM_DECL
4566 || TREE_CODE (decl) == RESULT_DECL);
4568 type = TREE_TYPE (decl);
4569 if (DECL_BY_REFERENCE (decl))
4570 type = TREE_TYPE (type);
4572 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4573 VAR_DECL, DECL_NAME (decl), type);
4574 TREE_READONLY (copy) = TREE_READONLY (decl);
4575 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4576 if (!DECL_BY_REFERENCE (decl))
4578 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4579 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4582 return copy_decl_for_dup_finish (id, decl, copy);
4586 copy_decl_no_change (tree decl, copy_body_data *id)
4590 copy = copy_node (decl);
4592 /* The COPY is not abstract; it will be generated in DST_FN. */
4593 DECL_ABSTRACT (copy) = 0;
4594 lang_hooks.dup_lang_specific_decl (copy);
4596 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4597 been taken; it's for internal bookkeeping in expand_goto_internal. */
4598 if (TREE_CODE (copy) == LABEL_DECL)
4600 TREE_ADDRESSABLE (copy) = 0;
4601 LABEL_DECL_UID (copy) = -1;
4604 return copy_decl_for_dup_finish (id, decl, copy);
4608 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
4610 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
4611 return copy_decl_to_var (decl, id);
4613 return copy_decl_no_change (decl, id);
4616 /* Return a copy of the function's argument tree. */
4618 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
4619 bitmap args_to_skip, tree *vars)
4622 tree new_parm = NULL;
4627 for (arg = orig_parm; arg; arg = TREE_CHAIN (arg), i++)
4628 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
4630 tree new_tree = remap_decl (arg, id);
4631 lang_hooks.dup_lang_specific_decl (new_tree);
4633 parg = &TREE_CHAIN (new_tree);
4635 else if (!pointer_map_contains (id->decl_map, arg))
4637 /* Make an equivalent VAR_DECL. If the argument was used
4638 as temporary variable later in function, the uses will be
4639 replaced by local variable. */
4640 tree var = copy_decl_to_var (arg, id);
4642 add_referenced_var (var);
4643 insert_decl_map (id, arg, var);
4644 /* Declare this new variable. */
4645 TREE_CHAIN (var) = *vars;
4651 /* Return a copy of the function's static chain. */
4653 copy_static_chain (tree static_chain, copy_body_data * id)
4655 tree *chain_copy, *pvar;
4657 chain_copy = &static_chain;
4658 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
4660 tree new_tree = remap_decl (*pvar, id);
4661 lang_hooks.dup_lang_specific_decl (new_tree);
4662 TREE_CHAIN (new_tree) = TREE_CHAIN (*pvar);
4665 return static_chain;
4668 /* Return true if the function is allowed to be versioned.
4669 This is a guard for the versioning functionality. */
4672 tree_versionable_function_p (tree fndecl)
4674 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl))
4675 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl), fndecl) == NULL);
4678 /* Delete all unreachable basic blocks and update callgraph.
4679 Doing so is somewhat nontrivial because we need to update all clones and
4680 remove inline function that become unreachable. */
4683 delete_unreachable_blocks_update_callgraph (copy_body_data *id)
4685 bool changed = false;
4686 basic_block b, next_bb;
4688 find_unreachable_blocks ();
4690 /* Delete all unreachable basic blocks. */
4692 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR; b = next_bb)
4694 next_bb = b->next_bb;
4696 if (!(b->flags & BB_REACHABLE))
4698 gimple_stmt_iterator bsi;
4700 for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi))
4701 if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL)
4703 struct cgraph_edge *e;
4704 struct cgraph_node *node;
4706 if ((e = cgraph_edge (id->dst_node, gsi_stmt (bsi))) != NULL)
4708 if (!e->inline_failed)
4709 cgraph_remove_node_and_inline_clones (e->callee);
4711 cgraph_remove_edge (e);
4713 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4714 && id->dst_node->clones)
4715 for (node = id->dst_node->clones; node != id->dst_node;)
4717 if ((e = cgraph_edge (node, gsi_stmt (bsi))) != NULL)
4719 if (!e->inline_failed)
4720 cgraph_remove_node_and_inline_clones (e->callee);
4722 cgraph_remove_edge (e);
4726 node = node->clones;
4727 else if (node->next_sibling_clone)
4728 node = node->next_sibling_clone;
4731 while (node != id->dst_node && !node->next_sibling_clone)
4732 node = node->clone_of;
4733 if (node != id->dst_node)
4734 node = node->next_sibling_clone;
4738 delete_basic_block (b);
4744 tidy_fallthru_edges ();
4748 /* Update clone info after duplication. */
4751 update_clone_info (copy_body_data * id)
4753 struct cgraph_node *node;
4754 if (!id->dst_node->clones)
4756 for (node = id->dst_node->clones; node != id->dst_node;)
4758 /* First update replace maps to match the new body. */
4759 if (node->clone.tree_map)
4762 for (i = 0; i < VEC_length (ipa_replace_map_p, node->clone.tree_map); i++)
4764 struct ipa_replace_map *replace_info;
4765 replace_info = VEC_index (ipa_replace_map_p, node->clone.tree_map, i);
4766 walk_tree (&replace_info->old_tree, copy_tree_body_r, id, NULL);
4767 walk_tree (&replace_info->new_tree, copy_tree_body_r, id, NULL);
4771 node = node->clones;
4772 else if (node->next_sibling_clone)
4773 node = node->next_sibling_clone;
4776 while (node != id->dst_node && !node->next_sibling_clone)
4777 node = node->clone_of;
4778 if (node != id->dst_node)
4779 node = node->next_sibling_clone;
4784 /* Create a copy of a function's tree.
4785 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4786 of the original function and the new copied function
4787 respectively. In case we want to replace a DECL
4788 tree with another tree while duplicating the function's
4789 body, TREE_MAP represents the mapping between these
4790 trees. If UPDATE_CLONES is set, the call_stmt fields
4791 of edges of clones of the function will be updated. */
4793 tree_function_versioning (tree old_decl, tree new_decl,
4794 VEC(ipa_replace_map_p,gc)* tree_map,
4795 bool update_clones, bitmap args_to_skip)
4797 struct cgraph_node *old_version_node;
4798 struct cgraph_node *new_version_node;
4802 struct ipa_replace_map *replace_info;
4803 basic_block old_entry_block, bb;
4804 VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10);
4807 tree old_current_function_decl = current_function_decl;
4808 tree vars = NULL_TREE;
4810 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
4811 && TREE_CODE (new_decl) == FUNCTION_DECL);
4812 DECL_POSSIBLY_INLINED (old_decl) = 1;
4814 old_version_node = cgraph_node (old_decl);
4815 new_version_node = cgraph_node (new_decl);
4817 /* Output the inlining info for this abstract function, since it has been
4818 inlined. If we don't do this now, we can lose the information about the
4819 variables in the function when the blocks get blown away as soon as we
4820 remove the cgraph node. */
4821 (*debug_hooks->outlining_inline_function) (old_decl);
4823 DECL_ARTIFICIAL (new_decl) = 1;
4824 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
4825 DECL_FUNCTION_PERSONALITY (new_decl) = DECL_FUNCTION_PERSONALITY (old_decl);
4827 /* Prepare the data structures for the tree copy. */
4828 memset (&id, 0, sizeof (id));
4830 /* Generate a new name for the new version. */
4831 id.statements_to_fold = pointer_set_create ();
4833 id.decl_map = pointer_map_create ();
4834 id.debug_map = NULL;
4835 id.src_fn = old_decl;
4836 id.dst_fn = new_decl;
4837 id.src_node = old_version_node;
4838 id.dst_node = new_version_node;
4839 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
4840 if (id.src_node->ipa_transforms_to_apply)
4842 VEC(ipa_opt_pass,heap) * old_transforms_to_apply = id.dst_node->ipa_transforms_to_apply;
4845 id.dst_node->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap,
4846 id.src_node->ipa_transforms_to_apply);
4847 for (i = 0; i < VEC_length (ipa_opt_pass, old_transforms_to_apply); i++)
4848 VEC_safe_push (ipa_opt_pass, heap, id.dst_node->ipa_transforms_to_apply,
4849 VEC_index (ipa_opt_pass,
4850 old_transforms_to_apply,
4854 id.copy_decl = copy_decl_no_change;
4855 id.transform_call_graph_edges
4856 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
4857 id.transform_new_cfg = true;
4858 id.transform_return_to_modify = false;
4859 id.transform_lang_insert_block = NULL;
4861 current_function_decl = new_decl;
4862 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
4863 (DECL_STRUCT_FUNCTION (old_decl));
4864 initialize_cfun (new_decl, old_decl,
4865 old_entry_block->count);
4866 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
4868 /* Copy the function's static chain. */
4869 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
4871 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
4872 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
4875 /* If there's a tree_map, prepare for substitution. */
4877 for (i = 0; i < VEC_length (ipa_replace_map_p, tree_map); i++)
4880 replace_info = VEC_index (ipa_replace_map_p, tree_map, i);
4881 if (replace_info->replace_p)
4883 tree op = replace_info->new_tree;
4887 if (TREE_CODE (op) == VIEW_CONVERT_EXPR)
4888 op = TREE_OPERAND (op, 0);
4890 if (TREE_CODE (op) == ADDR_EXPR)
4892 op = TREE_OPERAND (op, 0);
4893 while (handled_component_p (op))
4894 op = TREE_OPERAND (op, 0);
4895 if (TREE_CODE (op) == VAR_DECL)
4896 add_referenced_var (op);
4898 gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
4899 init = setup_one_parameter (&id, replace_info->old_tree,
4900 replace_info->new_tree, id.src_fn,
4904 VEC_safe_push (gimple, heap, init_stmts, init);
4907 /* Copy the function's arguments. */
4908 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
4909 DECL_ARGUMENTS (new_decl) =
4910 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
4911 args_to_skip, &vars);
4913 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
4915 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4916 number_blocks (id.dst_fn);
4918 declare_inline_vars (DECL_INITIAL (new_decl), vars);
4920 if (DECL_STRUCT_FUNCTION (old_decl)->local_decls != NULL_TREE)
4921 /* Add local vars. */
4922 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->local_decls;
4923 t_step; t_step = TREE_CHAIN (t_step))
4925 tree var = TREE_VALUE (t_step);
4926 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
4927 cfun->local_decls = tree_cons (NULL_TREE, var, cfun->local_decls);
4928 else if (!can_be_nonlocal (var, &id))
4930 tree_cons (NULL_TREE, remap_decl (var, &id),
4934 /* Copy the Function's body. */
4935 copy_body (&id, old_entry_block->count, REG_BR_PROB_BASE,
4936 ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
4938 if (DECL_RESULT (old_decl) != NULL_TREE)
4940 tree *res_decl = &DECL_RESULT (old_decl);
4941 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
4942 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
4945 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4946 number_blocks (new_decl);
4948 /* We want to create the BB unconditionally, so that the addition of
4949 debug stmts doesn't affect BB count, which may in the end cause
4950 codegen differences. */
4951 bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
4952 while (VEC_length (gimple, init_stmts))
4953 insert_init_stmt (&id, bb, VEC_pop (gimple, init_stmts));
4954 update_clone_info (&id);
4956 /* Remap the nonlocal_goto_save_area, if any. */
4957 if (cfun->nonlocal_goto_save_area)
4959 struct walk_stmt_info wi;
4961 memset (&wi, 0, sizeof (wi));
4963 walk_tree (&cfun->nonlocal_goto_save_area, remap_gimple_op_r, &wi, NULL);
4967 pointer_map_destroy (id.decl_map);
4969 pointer_map_destroy (id.debug_map);
4970 free_dominance_info (CDI_DOMINATORS);
4971 free_dominance_info (CDI_POST_DOMINATORS);
4973 fold_marked_statements (0, id.statements_to_fold);
4974 pointer_set_destroy (id.statements_to_fold);
4975 fold_cond_expr_cond ();
4976 delete_unreachable_blocks_update_callgraph (&id);
4977 update_ssa (TODO_update_ssa);
4978 free_dominance_info (CDI_DOMINATORS);
4979 free_dominance_info (CDI_POST_DOMINATORS);
4981 gcc_assert (!id.debug_stmts);
4982 VEC_free (gimple, heap, init_stmts);
4984 current_function_decl = old_current_function_decl;
4985 gcc_assert (!current_function_decl
4986 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
4990 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
4991 the callee and return the inlined body on success. */
4994 maybe_inline_call_in_expr (tree exp)
4996 tree fn = get_callee_fndecl (exp);
4998 /* We can only try to inline "const" functions. */
4999 if (fn && TREE_READONLY (fn) && DECL_SAVED_TREE (fn))
5001 struct pointer_map_t *decl_map = pointer_map_create ();
5002 call_expr_arg_iterator iter;
5006 /* Remap the parameters. */
5007 for (param = DECL_ARGUMENTS (fn), arg = first_call_expr_arg (exp, &iter);
5009 param = TREE_CHAIN (param), arg = next_call_expr_arg (&iter))
5010 *pointer_map_insert (decl_map, param) = arg;
5012 memset (&id, 0, sizeof (id));
5014 id.dst_fn = current_function_decl;
5015 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
5016 id.decl_map = decl_map;
5018 id.copy_decl = copy_decl_no_change;
5019 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
5020 id.transform_new_cfg = false;
5021 id.transform_return_to_modify = true;
5022 id.transform_lang_insert_block = false;
5024 /* Make sure not to unshare trees behind the front-end's back
5025 since front-end specific mechanisms may rely on sharing. */
5026 id.regimplify = false;
5027 id.do_not_unshare = true;
5029 /* We're not inside any EH region. */
5032 t = copy_tree_body (&id);
5033 pointer_map_destroy (decl_map);
5035 /* We can only return something suitable for use in a GENERIC
5037 if (TREE_CODE (t) == MODIFY_EXPR)
5038 return TREE_OPERAND (t, 1);
5044 /* Duplicate a type, fields and all. */
5047 build_duplicate_type (tree type)
5049 struct copy_body_data id;
5051 memset (&id, 0, sizeof (id));
5052 id.src_fn = current_function_decl;
5053 id.dst_fn = current_function_decl;
5055 id.decl_map = pointer_map_create ();
5056 id.debug_map = NULL;
5057 id.copy_decl = copy_decl_no_change;
5059 type = remap_type_1 (type, &id);
5061 pointer_map_destroy (id.decl_map);
5063 pointer_map_destroy (id.debug_map);
5065 TYPE_CANONICAL (type) = type;
5070 /* Return whether it is safe to inline a function because it used different
5071 target specific options or call site actual types mismatch parameter types.
5072 E is the call edge to be checked. */
5074 tree_can_inline_p (struct cgraph_edge *e)
5077 /* This causes a regression in SPEC in that it prevents a cold function from
5078 inlining a hot function. Perhaps this should only apply to functions
5079 that the user declares hot/cold/optimize explicitly. */
5081 /* Don't inline a function with a higher optimization level than the
5082 caller, or with different space constraints (hot/cold functions). */
5083 tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller);
5084 tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee);
5086 if (caller_tree != callee_tree)
5088 struct cl_optimization *caller_opt
5089 = TREE_OPTIMIZATION ((caller_tree)
5091 : optimization_default_node);
5093 struct cl_optimization *callee_opt
5094 = TREE_OPTIMIZATION ((callee_tree)
5096 : optimization_default_node);
5098 if ((caller_opt->optimize > callee_opt->optimize)
5099 || (caller_opt->optimize_size != callee_opt->optimize_size))
5103 tree caller, callee;
5105 caller = e->caller->decl;
5106 callee = e->callee->decl;
5108 /* We cannot inline a function that uses a different EH personality
5110 if (DECL_FUNCTION_PERSONALITY (caller)
5111 && DECL_FUNCTION_PERSONALITY (callee)
5112 && (DECL_FUNCTION_PERSONALITY (caller)
5113 != DECL_FUNCTION_PERSONALITY (callee)))
5115 e->inline_failed = CIF_UNSPECIFIED;
5116 gimple_call_set_cannot_inline (e->call_stmt, true);
5120 /* Allow the backend to decide if inlining is ok. */
5121 if (!targetm.target_option.can_inline_p (caller, callee))
5123 e->inline_failed = CIF_TARGET_OPTION_MISMATCH;
5124 gimple_call_set_cannot_inline (e->call_stmt, true);
5125 e->call_stmt_cannot_inline_p = true;
5130 && !gimple_check_call_args (e->call_stmt))
5132 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
5133 gimple_call_set_cannot_inline (e->call_stmt, true);
5134 e->call_stmt_cannot_inline_p = true;