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))
315 add_referenced_var (t);
320 if (id->do_not_unshare)
323 return unshare_expr (*n);
327 remap_type_1 (tree type, copy_body_data *id)
331 /* We do need a copy. build and register it now. If this is a pointer or
332 reference type, remap the designated type and make a new pointer or
334 if (TREE_CODE (type) == POINTER_TYPE)
336 new_tree = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
338 TYPE_REF_CAN_ALIAS_ALL (type));
339 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
340 new_tree = build_type_attribute_qual_variant (new_tree,
341 TYPE_ATTRIBUTES (type),
343 insert_decl_map (id, type, new_tree);
346 else if (TREE_CODE (type) == REFERENCE_TYPE)
348 new_tree = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
350 TYPE_REF_CAN_ALIAS_ALL (type));
351 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
352 new_tree = build_type_attribute_qual_variant (new_tree,
353 TYPE_ATTRIBUTES (type),
355 insert_decl_map (id, type, new_tree);
359 new_tree = copy_node (type);
361 insert_decl_map (id, type, new_tree);
363 /* This is a new type, not a copy of an old type. Need to reassociate
364 variants. We can handle everything except the main variant lazily. */
365 t = TYPE_MAIN_VARIANT (type);
368 t = remap_type (t, id);
369 TYPE_MAIN_VARIANT (new_tree) = t;
370 TYPE_NEXT_VARIANT (new_tree) = TYPE_NEXT_VARIANT (t);
371 TYPE_NEXT_VARIANT (t) = new_tree;
375 TYPE_MAIN_VARIANT (new_tree) = new_tree;
376 TYPE_NEXT_VARIANT (new_tree) = NULL;
379 if (TYPE_STUB_DECL (type))
380 TYPE_STUB_DECL (new_tree) = remap_decl (TYPE_STUB_DECL (type), id);
382 /* Lazily create pointer and reference types. */
383 TYPE_POINTER_TO (new_tree) = NULL;
384 TYPE_REFERENCE_TO (new_tree) = NULL;
386 switch (TREE_CODE (new_tree))
390 case FIXED_POINT_TYPE:
393 t = TYPE_MIN_VALUE (new_tree);
394 if (t && TREE_CODE (t) != INTEGER_CST)
395 walk_tree (&TYPE_MIN_VALUE (new_tree), copy_tree_body_r, id, NULL);
397 t = TYPE_MAX_VALUE (new_tree);
398 if (t && TREE_CODE (t) != INTEGER_CST)
399 walk_tree (&TYPE_MAX_VALUE (new_tree), copy_tree_body_r, id, NULL);
403 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
404 walk_tree (&TYPE_ARG_TYPES (new_tree), copy_tree_body_r, id, NULL);
408 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
409 TYPE_DOMAIN (new_tree) = remap_type (TYPE_DOMAIN (new_tree), id);
414 case QUAL_UNION_TYPE:
418 for (f = TYPE_FIELDS (new_tree); f ; f = TREE_CHAIN (f))
420 t = remap_decl (f, id);
421 DECL_CONTEXT (t) = new_tree;
425 TYPE_FIELDS (new_tree) = nreverse (nf);
431 /* Shouldn't have been thought variable sized. */
435 walk_tree (&TYPE_SIZE (new_tree), copy_tree_body_r, id, NULL);
436 walk_tree (&TYPE_SIZE_UNIT (new_tree), copy_tree_body_r, id, NULL);
442 remap_type (tree type, copy_body_data *id)
450 /* See if we have remapped this type. */
451 node = (tree *) pointer_map_contains (id->decl_map, type);
455 /* The type only needs remapping if it's variably modified. */
456 if (! variably_modified_type_p (type, id->src_fn))
458 insert_decl_map (id, type, type);
462 id->remapping_type_depth++;
463 tmp = remap_type_1 (type, id);
464 id->remapping_type_depth--;
469 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
470 is NULL or TYPE has not been remapped before. */
473 remapped_type (tree type, copy_body_data *id)
480 /* See if we have remapped this type. */
481 node = (tree *) pointer_map_contains (id->decl_map, type);
488 /* The type only needs remapping if it's variably modified. */
489 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
492 can_be_nonlocal (tree decl, copy_body_data *id)
494 /* We can not duplicate function decls. */
495 if (TREE_CODE (decl) == FUNCTION_DECL)
498 /* Local static vars must be non-local or we get multiple declaration
500 if (TREE_CODE (decl) == VAR_DECL
501 && !auto_var_in_fn_p (decl, id->src_fn))
504 /* At the moment dwarf2out can handle only these types of nodes. We
505 can support more later. */
506 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != PARM_DECL)
509 /* We must use global type. We call remapped_type instead of
510 remap_type since we don't want to remap this type here if it
511 hasn't been remapped before. */
512 if (TREE_TYPE (decl) != remapped_type (TREE_TYPE (decl), id))
515 /* Wihtout SSA we can't tell if variable is used. */
516 if (!gimple_in_ssa_p (cfun))
519 /* Live variables must be copied so we can attach DECL_RTL. */
527 remap_decls (tree decls, VEC(tree,gc) **nonlocalized_list, copy_body_data *id)
530 tree new_decls = NULL_TREE;
532 /* Remap its variables. */
533 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
537 if (can_be_nonlocal (old_var, id))
539 if (TREE_CODE (old_var) == VAR_DECL
540 && ! DECL_EXTERNAL (old_var)
541 && (var_ann (old_var) || !gimple_in_ssa_p (cfun)))
542 cfun->local_decls = tree_cons (NULL_TREE, old_var,
544 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
545 && !DECL_IGNORED_P (old_var)
546 && nonlocalized_list)
547 VEC_safe_push (tree, gc, *nonlocalized_list, old_var);
551 /* Remap the variable. */
552 new_var = remap_decl (old_var, id);
554 /* If we didn't remap this variable, we can't mess with its
555 TREE_CHAIN. If we remapped this variable to the return slot, it's
556 already declared somewhere else, so don't declare it here. */
558 if (new_var == id->retvar)
562 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
563 && !DECL_IGNORED_P (old_var)
564 && nonlocalized_list)
565 VEC_safe_push (tree, gc, *nonlocalized_list, old_var);
569 gcc_assert (DECL_P (new_var));
570 TREE_CHAIN (new_var) = new_decls;
575 return nreverse (new_decls);
578 /* Copy the BLOCK to contain remapped versions of the variables
579 therein. And hook the new block into the block-tree. */
582 remap_block (tree *block, copy_body_data *id)
587 /* Make the new block. */
589 new_block = make_node (BLOCK);
590 TREE_USED (new_block) = TREE_USED (old_block);
591 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
592 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
593 BLOCK_NONLOCALIZED_VARS (new_block)
594 = VEC_copy (tree, gc, BLOCK_NONLOCALIZED_VARS (old_block));
597 /* Remap its variables. */
598 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block),
599 &BLOCK_NONLOCALIZED_VARS (new_block),
602 if (id->transform_lang_insert_block)
603 id->transform_lang_insert_block (new_block);
605 /* Remember the remapped block. */
606 insert_decl_map (id, old_block, new_block);
609 /* Copy the whole block tree and root it in id->block. */
611 remap_blocks (tree block, copy_body_data *id)
614 tree new_tree = block;
619 remap_block (&new_tree, id);
620 gcc_assert (new_tree != block);
621 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
622 prepend_lexical_block (new_tree, remap_blocks (t, id));
623 /* Blocks are in arbitrary order, but make things slightly prettier and do
624 not swap order when producing a copy. */
625 BLOCK_SUBBLOCKS (new_tree) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree));
630 copy_statement_list (tree *tp)
632 tree_stmt_iterator oi, ni;
635 new_tree = alloc_stmt_list ();
636 ni = tsi_start (new_tree);
637 oi = tsi_start (*tp);
638 TREE_TYPE (new_tree) = TREE_TYPE (*tp);
641 for (; !tsi_end_p (oi); tsi_next (&oi))
643 tree stmt = tsi_stmt (oi);
644 if (TREE_CODE (stmt) == STATEMENT_LIST)
645 copy_statement_list (&stmt);
646 tsi_link_after (&ni, stmt, TSI_CONTINUE_LINKING);
651 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
653 tree block = BIND_EXPR_BLOCK (*tp);
654 /* Copy (and replace) the statement. */
655 copy_tree_r (tp, walk_subtrees, NULL);
658 remap_block (&block, id);
659 BIND_EXPR_BLOCK (*tp) = block;
662 if (BIND_EXPR_VARS (*tp))
663 /* This will remap a lot of the same decls again, but this should be
665 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), NULL, id);
669 /* Create a new gimple_seq by remapping all the statements in BODY
670 using the inlining information in ID. */
673 remap_gimple_seq (gimple_seq body, copy_body_data *id)
675 gimple_stmt_iterator si;
676 gimple_seq new_body = NULL;
678 for (si = gsi_start (body); !gsi_end_p (si); gsi_next (&si))
680 gimple new_stmt = remap_gimple_stmt (gsi_stmt (si), id);
681 gimple_seq_add_stmt (&new_body, new_stmt);
688 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
689 block using the mapping information in ID. */
692 copy_gimple_bind (gimple stmt, copy_body_data *id)
695 tree new_block, new_vars;
696 gimple_seq body, new_body;
698 /* Copy the statement. Note that we purposely don't use copy_stmt
699 here because we need to remap statements as we copy. */
700 body = gimple_bind_body (stmt);
701 new_body = remap_gimple_seq (body, id);
703 new_block = gimple_bind_block (stmt);
705 remap_block (&new_block, id);
707 /* This will remap a lot of the same decls again, but this should be
709 new_vars = gimple_bind_vars (stmt);
711 new_vars = remap_decls (new_vars, NULL, id);
713 new_bind = gimple_build_bind (new_vars, new_body, new_block);
719 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
720 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
721 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
722 recursing into the children nodes of *TP. */
725 remap_gimple_op_r (tree *tp, int *walk_subtrees, void *data)
727 struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
728 copy_body_data *id = (copy_body_data *) wi_p->info;
729 tree fn = id->src_fn;
731 if (TREE_CODE (*tp) == SSA_NAME)
733 *tp = remap_ssa_name (*tp, id);
737 else if (auto_var_in_fn_p (*tp, fn))
739 /* Local variables and labels need to be replaced by equivalent
740 variables. We don't want to copy static variables; there's
741 only one of those, no matter how many times we inline the
742 containing function. Similarly for globals from an outer
746 /* Remap the declaration. */
747 new_decl = remap_decl (*tp, id);
748 gcc_assert (new_decl);
749 /* Replace this variable with the copy. */
750 STRIP_TYPE_NOPS (new_decl);
751 /* ??? The C++ frontend uses void * pointer zero to initialize
752 any other type. This confuses the middle-end type verification.
753 As cloned bodies do not go through gimplification again the fixup
754 there doesn't trigger. */
755 if (TREE_CODE (new_decl) == INTEGER_CST
756 && !useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (new_decl)))
757 new_decl = fold_convert (TREE_TYPE (*tp), new_decl);
761 else if (TREE_CODE (*tp) == STATEMENT_LIST)
763 else if (TREE_CODE (*tp) == SAVE_EXPR)
765 else if (TREE_CODE (*tp) == LABEL_DECL
766 && (!DECL_CONTEXT (*tp)
767 || decl_function_context (*tp) == id->src_fn))
768 /* These may need to be remapped for EH handling. */
769 *tp = remap_decl (*tp, id);
770 else if (TYPE_P (*tp))
771 /* Types may need remapping as well. */
772 *tp = remap_type (*tp, id);
773 else if (CONSTANT_CLASS_P (*tp))
775 /* If this is a constant, we have to copy the node iff the type
776 will be remapped. copy_tree_r will not copy a constant. */
777 tree new_type = remap_type (TREE_TYPE (*tp), id);
779 if (new_type == TREE_TYPE (*tp))
782 else if (TREE_CODE (*tp) == INTEGER_CST)
783 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
784 TREE_INT_CST_HIGH (*tp));
787 *tp = copy_node (*tp);
788 TREE_TYPE (*tp) = new_type;
793 /* Otherwise, just copy the node. Note that copy_tree_r already
794 knows not to copy VAR_DECLs, etc., so this is safe. */
795 if (TREE_CODE (*tp) == INDIRECT_REF)
797 /* Get rid of *& from inline substitutions that can happen when a
798 pointer argument is an ADDR_EXPR. */
799 tree decl = TREE_OPERAND (*tp, 0);
802 n = (tree *) pointer_map_contains (id->decl_map, decl);
805 tree type, new_tree, old;
807 /* If we happen to get an ADDR_EXPR in n->value, strip
808 it manually here as we'll eventually get ADDR_EXPRs
809 which lie about their types pointed to. In this case
810 build_fold_indirect_ref wouldn't strip the
811 INDIRECT_REF, but we absolutely rely on that. As
812 fold_indirect_ref does other useful transformations,
813 try that first, though. */
814 type = TREE_TYPE (TREE_TYPE (*n));
815 new_tree = unshare_expr (*n);
817 *tp = gimple_fold_indirect_ref (new_tree);
820 if (TREE_CODE (new_tree) == ADDR_EXPR)
822 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
824 /* ??? We should either assert here or build
825 a VIEW_CONVERT_EXPR instead of blindly leaking
826 incompatible types to our IL. */
828 *tp = TREE_OPERAND (new_tree, 0);
832 *tp = build1 (INDIRECT_REF, type, new_tree);
833 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
834 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
842 /* Here is the "usual case". Copy this tree node, and then
843 tweak some special cases. */
844 copy_tree_r (tp, walk_subtrees, NULL);
846 /* Global variables we haven't seen yet need to go into referenced
847 vars. If not referenced from types only. */
848 if (gimple_in_ssa_p (cfun)
849 && TREE_CODE (*tp) == VAR_DECL
850 && id->remapping_type_depth == 0
851 && !processing_debug_stmt)
852 add_referenced_var (*tp);
854 /* We should never have TREE_BLOCK set on non-statements. */
856 gcc_assert (!TREE_BLOCK (*tp));
858 if (TREE_CODE (*tp) != OMP_CLAUSE)
859 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
861 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
863 /* The copied TARGET_EXPR has never been expanded, even if the
864 original node was expanded already. */
865 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
866 TREE_OPERAND (*tp, 3) = NULL_TREE;
868 else if (TREE_CODE (*tp) == ADDR_EXPR)
870 /* Variable substitution need not be simple. In particular,
871 the INDIRECT_REF substitution above. Make sure that
872 TREE_CONSTANT and friends are up-to-date. But make sure
873 to not improperly set TREE_BLOCK on some sub-expressions. */
874 int invariant = is_gimple_min_invariant (*tp);
875 tree block = id->block;
876 id->block = NULL_TREE;
877 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
880 /* Handle the case where we substituted an INDIRECT_REF
881 into the operand of the ADDR_EXPR. */
882 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
883 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
885 recompute_tree_invariant_for_addr_expr (*tp);
887 /* If this used to be invariant, but is not any longer,
888 then regimplification is probably needed. */
889 if (invariant && !is_gimple_min_invariant (*tp))
890 id->regimplify = true;
896 /* Keep iterating. */
901 /* Called from copy_body_id via walk_tree. DATA is really a
902 `copy_body_data *'. */
905 copy_tree_body_r (tree *tp, int *walk_subtrees, void *data)
907 copy_body_data *id = (copy_body_data *) data;
908 tree fn = id->src_fn;
911 /* Begin by recognizing trees that we'll completely rewrite for the
912 inlining context. Our output for these trees is completely
913 different from out input (e.g. RETURN_EXPR is deleted, and morphs
914 into an edge). Further down, we'll handle trees that get
915 duplicated and/or tweaked. */
917 /* When requested, RETURN_EXPRs should be transformed to just the
918 contained MODIFY_EXPR. The branch semantics of the return will
919 be handled elsewhere by manipulating the CFG rather than a statement. */
920 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
922 tree assignment = TREE_OPERAND (*tp, 0);
924 /* If we're returning something, just turn that into an
925 assignment into the equivalent of the original RESULT_DECL.
926 If the "assignment" is just the result decl, the result
927 decl has already been set (e.g. a recent "foo (&result_decl,
928 ...)"); just toss the entire RETURN_EXPR. */
929 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
931 /* Replace the RETURN_EXPR with (a copy of) the
932 MODIFY_EXPR hanging underneath. */
933 *tp = copy_node (assignment);
935 else /* Else the RETURN_EXPR returns no value. */
938 return (tree) (void *)1;
941 else if (TREE_CODE (*tp) == SSA_NAME)
943 *tp = remap_ssa_name (*tp, id);
948 /* Local variables and labels need to be replaced by equivalent
949 variables. We don't want to copy static variables; there's only
950 one of those, no matter how many times we inline the containing
951 function. Similarly for globals from an outer function. */
952 else if (auto_var_in_fn_p (*tp, fn))
956 /* Remap the declaration. */
957 new_decl = remap_decl (*tp, id);
958 gcc_assert (new_decl);
959 /* Replace this variable with the copy. */
960 STRIP_TYPE_NOPS (new_decl);
964 else if (TREE_CODE (*tp) == STATEMENT_LIST)
965 copy_statement_list (tp);
966 else if (TREE_CODE (*tp) == SAVE_EXPR
967 || TREE_CODE (*tp) == TARGET_EXPR)
968 remap_save_expr (tp, id->decl_map, walk_subtrees);
969 else if (TREE_CODE (*tp) == LABEL_DECL
970 && (! DECL_CONTEXT (*tp)
971 || decl_function_context (*tp) == id->src_fn))
972 /* These may need to be remapped for EH handling. */
973 *tp = remap_decl (*tp, id);
974 else if (TREE_CODE (*tp) == BIND_EXPR)
975 copy_bind_expr (tp, walk_subtrees, id);
976 /* Types may need remapping as well. */
977 else if (TYPE_P (*tp))
978 *tp = remap_type (*tp, id);
980 /* If this is a constant, we have to copy the node iff the type will be
981 remapped. copy_tree_r will not copy a constant. */
982 else if (CONSTANT_CLASS_P (*tp))
984 tree new_type = remap_type (TREE_TYPE (*tp), id);
986 if (new_type == TREE_TYPE (*tp))
989 else if (TREE_CODE (*tp) == INTEGER_CST)
990 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
991 TREE_INT_CST_HIGH (*tp));
994 *tp = copy_node (*tp);
995 TREE_TYPE (*tp) = new_type;
999 /* Otherwise, just copy the node. Note that copy_tree_r already
1000 knows not to copy VAR_DECLs, etc., so this is safe. */
1003 /* Here we handle trees that are not completely rewritten.
1004 First we detect some inlining-induced bogosities for
1006 if (TREE_CODE (*tp) == MODIFY_EXPR
1007 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
1008 && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn)))
1010 /* Some assignments VAR = VAR; don't generate any rtl code
1011 and thus don't count as variable modification. Avoid
1012 keeping bogosities like 0 = 0. */
1013 tree decl = TREE_OPERAND (*tp, 0), value;
1016 n = (tree *) pointer_map_contains (id->decl_map, decl);
1020 STRIP_TYPE_NOPS (value);
1021 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1023 *tp = build_empty_stmt (EXPR_LOCATION (*tp));
1024 return copy_tree_body_r (tp, walk_subtrees, data);
1028 else if (TREE_CODE (*tp) == INDIRECT_REF)
1030 /* Get rid of *& from inline substitutions that can happen when a
1031 pointer argument is an ADDR_EXPR. */
1032 tree decl = TREE_OPERAND (*tp, 0);
1035 n = (tree *) pointer_map_contains (id->decl_map, decl);
1040 /* If we happen to get an ADDR_EXPR in n->value, strip
1041 it manually here as we'll eventually get ADDR_EXPRs
1042 which lie about their types pointed to. In this case
1043 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1044 but we absolutely rely on that. As fold_indirect_ref
1045 does other useful transformations, try that first, though. */
1046 tree type = TREE_TYPE (TREE_TYPE (*n));
1047 if (id->do_not_unshare)
1050 new_tree = unshare_expr (*n);
1052 *tp = gimple_fold_indirect_ref (new_tree);
1055 if (TREE_CODE (new_tree) == ADDR_EXPR)
1057 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
1059 /* ??? We should either assert here or build
1060 a VIEW_CONVERT_EXPR instead of blindly leaking
1061 incompatible types to our IL. */
1063 *tp = TREE_OPERAND (new_tree, 0);
1067 *tp = build1 (INDIRECT_REF, type, new_tree);
1068 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1069 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1077 /* Here is the "usual case". Copy this tree node, and then
1078 tweak some special cases. */
1079 copy_tree_r (tp, walk_subtrees, NULL);
1081 /* Global variables we haven't seen yet needs to go into referenced
1082 vars. If not referenced from types or debug stmts only. */
1083 if (gimple_in_ssa_p (cfun)
1084 && TREE_CODE (*tp) == VAR_DECL
1085 && id->remapping_type_depth == 0
1086 && !processing_debug_stmt)
1087 add_referenced_var (*tp);
1089 /* If EXPR has block defined, map it to newly constructed block.
1090 When inlining we want EXPRs without block appear in the block
1091 of function call if we are not remapping a type. */
1094 new_block = id->remapping_type_depth == 0 ? id->block : NULL;
1095 if (TREE_BLOCK (*tp))
1098 n = (tree *) pointer_map_contains (id->decl_map,
1103 TREE_BLOCK (*tp) = new_block;
1106 if (TREE_CODE (*tp) != OMP_CLAUSE)
1107 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
1109 /* The copied TARGET_EXPR has never been expanded, even if the
1110 original node was expanded already. */
1111 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
1113 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
1114 TREE_OPERAND (*tp, 3) = NULL_TREE;
1117 /* Variable substitution need not be simple. In particular, the
1118 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1119 and friends are up-to-date. */
1120 else if (TREE_CODE (*tp) == ADDR_EXPR)
1122 int invariant = is_gimple_min_invariant (*tp);
1123 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
1125 /* Handle the case where we substituted an INDIRECT_REF
1126 into the operand of the ADDR_EXPR. */
1127 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
1128 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
1130 recompute_tree_invariant_for_addr_expr (*tp);
1132 /* If this used to be invariant, but is not any longer,
1133 then regimplification is probably needed. */
1134 if (invariant && !is_gimple_min_invariant (*tp))
1135 id->regimplify = true;
1141 /* Keep iterating. */
1145 /* Helper for remap_gimple_stmt. Given an EH region number for the
1146 source function, map that to the duplicate EH region number in
1147 the destination function. */
1150 remap_eh_region_nr (int old_nr, copy_body_data *id)
1152 eh_region old_r, new_r;
1155 old_r = get_eh_region_from_number_fn (id->src_cfun, old_nr);
1156 slot = pointer_map_contains (id->eh_map, old_r);
1157 new_r = (eh_region) *slot;
1159 return new_r->index;
1162 /* Similar, but operate on INTEGER_CSTs. */
1165 remap_eh_region_tree_nr (tree old_t_nr, copy_body_data *id)
1169 old_nr = tree_low_cst (old_t_nr, 0);
1170 new_nr = remap_eh_region_nr (old_nr, id);
1172 return build_int_cst (NULL, new_nr);
1175 /* Helper for copy_bb. Remap statement STMT using the inlining
1176 information in ID. Return the new statement copy. */
1179 remap_gimple_stmt (gimple stmt, copy_body_data *id)
1182 struct walk_stmt_info wi;
1184 bool skip_first = false;
1186 /* Begin by recognizing trees that we'll completely rewrite for the
1187 inlining context. Our output for these trees is completely
1188 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1189 into an edge). Further down, we'll handle trees that get
1190 duplicated and/or tweaked. */
1192 /* When requested, GIMPLE_RETURNs should be transformed to just the
1193 contained GIMPLE_ASSIGN. The branch semantics of the return will
1194 be handled elsewhere by manipulating the CFG rather than the
1196 if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify)
1198 tree retval = gimple_return_retval (stmt);
1200 /* If we're returning something, just turn that into an
1201 assignment into the equivalent of the original RESULT_DECL.
1202 If RETVAL is just the result decl, the result decl has
1203 already been set (e.g. a recent "foo (&result_decl, ...)");
1204 just toss the entire GIMPLE_RETURN. */
1205 if (retval && TREE_CODE (retval) != RESULT_DECL)
1207 copy = gimple_build_assign (id->retvar, retval);
1208 /* id->retvar is already substituted. Skip it on later remapping. */
1212 return gimple_build_nop ();
1214 else if (gimple_has_substatements (stmt))
1218 /* When cloning bodies from the C++ front end, we will be handed bodies
1219 in High GIMPLE form. Handle here all the High GIMPLE statements that
1220 have embedded statements. */
1221 switch (gimple_code (stmt))
1224 copy = copy_gimple_bind (stmt, id);
1228 s1 = remap_gimple_seq (gimple_catch_handler (stmt), id);
1229 copy = gimple_build_catch (gimple_catch_types (stmt), s1);
1232 case GIMPLE_EH_FILTER:
1233 s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id);
1234 copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1);
1238 s1 = remap_gimple_seq (gimple_try_eval (stmt), id);
1239 s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id);
1240 copy = gimple_build_try (s1, s2, gimple_try_kind (stmt));
1243 case GIMPLE_WITH_CLEANUP_EXPR:
1244 s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id);
1245 copy = gimple_build_wce (s1);
1248 case GIMPLE_OMP_PARALLEL:
1249 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1250 copy = gimple_build_omp_parallel
1252 gimple_omp_parallel_clauses (stmt),
1253 gimple_omp_parallel_child_fn (stmt),
1254 gimple_omp_parallel_data_arg (stmt));
1257 case GIMPLE_OMP_TASK:
1258 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1259 copy = gimple_build_omp_task
1261 gimple_omp_task_clauses (stmt),
1262 gimple_omp_task_child_fn (stmt),
1263 gimple_omp_task_data_arg (stmt),
1264 gimple_omp_task_copy_fn (stmt),
1265 gimple_omp_task_arg_size (stmt),
1266 gimple_omp_task_arg_align (stmt));
1269 case GIMPLE_OMP_FOR:
1270 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1271 s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id);
1272 copy = gimple_build_omp_for (s1, gimple_omp_for_clauses (stmt),
1273 gimple_omp_for_collapse (stmt), s2);
1276 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1278 gimple_omp_for_set_index (copy, i,
1279 gimple_omp_for_index (stmt, i));
1280 gimple_omp_for_set_initial (copy, i,
1281 gimple_omp_for_initial (stmt, i));
1282 gimple_omp_for_set_final (copy, i,
1283 gimple_omp_for_final (stmt, i));
1284 gimple_omp_for_set_incr (copy, i,
1285 gimple_omp_for_incr (stmt, i));
1286 gimple_omp_for_set_cond (copy, i,
1287 gimple_omp_for_cond (stmt, i));
1292 case GIMPLE_OMP_MASTER:
1293 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1294 copy = gimple_build_omp_master (s1);
1297 case GIMPLE_OMP_ORDERED:
1298 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1299 copy = gimple_build_omp_ordered (s1);
1302 case GIMPLE_OMP_SECTION:
1303 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1304 copy = gimple_build_omp_section (s1);
1307 case GIMPLE_OMP_SECTIONS:
1308 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1309 copy = gimple_build_omp_sections
1310 (s1, gimple_omp_sections_clauses (stmt));
1313 case GIMPLE_OMP_SINGLE:
1314 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1315 copy = gimple_build_omp_single
1316 (s1, gimple_omp_single_clauses (stmt));
1319 case GIMPLE_OMP_CRITICAL:
1320 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1322 = gimple_build_omp_critical (s1, gimple_omp_critical_name (stmt));
1331 if (gimple_assign_copy_p (stmt)
1332 && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt)
1333 && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn))
1335 /* Here we handle statements that are not completely rewritten.
1336 First we detect some inlining-induced bogosities for
1339 /* Some assignments VAR = VAR; don't generate any rtl code
1340 and thus don't count as variable modification. Avoid
1341 keeping bogosities like 0 = 0. */
1342 tree decl = gimple_assign_lhs (stmt), value;
1345 n = (tree *) pointer_map_contains (id->decl_map, decl);
1349 STRIP_TYPE_NOPS (value);
1350 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1351 return gimple_build_nop ();
1355 if (gimple_debug_bind_p (stmt))
1357 copy = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt),
1358 gimple_debug_bind_get_value (stmt),
1360 VEC_safe_push (gimple, heap, id->debug_stmts, copy);
1364 /* Create a new deep copy of the statement. */
1365 copy = gimple_copy (stmt);
1367 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1368 RESX and EH_DISPATCH. */
1370 switch (gimple_code (copy))
1374 tree r, fndecl = gimple_call_fndecl (copy);
1375 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
1376 switch (DECL_FUNCTION_CODE (fndecl))
1378 case BUILT_IN_EH_COPY_VALUES:
1379 r = gimple_call_arg (copy, 1);
1380 r = remap_eh_region_tree_nr (r, id);
1381 gimple_call_set_arg (copy, 1, r);
1384 case BUILT_IN_EH_POINTER:
1385 case BUILT_IN_EH_FILTER:
1386 r = gimple_call_arg (copy, 0);
1387 r = remap_eh_region_tree_nr (r, id);
1388 gimple_call_set_arg (copy, 0, r);
1395 /* Reset alias info.
1396 ??? By maintaining DECL_PT_UID this should not
1397 be necessary, but the plan is to only maintain
1398 it when IPA-PTA was run. It's not too easy to
1399 detect this here ... */
1400 gimple_call_reset_alias_info (copy);
1406 int r = gimple_resx_region (copy);
1407 r = remap_eh_region_nr (r, id);
1408 gimple_resx_set_region (copy, r);
1412 case GIMPLE_EH_DISPATCH:
1414 int r = gimple_eh_dispatch_region (copy);
1415 r = remap_eh_region_nr (r, id);
1416 gimple_eh_dispatch_set_region (copy, r);
1425 /* If STMT has a block defined, map it to the newly constructed
1426 block. When inlining we want statements without a block to
1427 appear in the block of the function call. */
1428 new_block = id->block;
1429 if (gimple_block (copy))
1432 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (copy));
1437 gimple_set_block (copy, new_block);
1439 if (gimple_debug_bind_p (copy))
1442 /* Remap all the operands in COPY. */
1443 memset (&wi, 0, sizeof (wi));
1446 walk_tree (gimple_op_ptr (copy, 1), remap_gimple_op_r, &wi, NULL);
1448 walk_gimple_op (copy, remap_gimple_op_r, &wi);
1450 /* Clear the copied virtual operands. We are not remapping them here
1451 but are going to recreate them from scratch. */
1452 if (gimple_has_mem_ops (copy))
1454 gimple_set_vdef (copy, NULL_TREE);
1455 gimple_set_vuse (copy, NULL_TREE);
1462 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1466 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale,
1467 gcov_type count_scale)
1469 gimple_stmt_iterator gsi, copy_gsi, seq_gsi;
1470 basic_block copy_basic_block;
1474 /* create_basic_block() will append every new block to
1475 basic_block_info automatically. */
1476 copy_basic_block = create_basic_block (NULL, (void *) 0,
1477 (basic_block) bb->prev_bb->aux);
1478 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
1480 /* We are going to rebuild frequencies from scratch. These values
1481 have just small importance to drive canonicalize_loop_headers. */
1482 freq = ((gcov_type)bb->frequency * frequency_scale / REG_BR_PROB_BASE);
1484 /* We recompute frequencies after inlining, so this is quite safe. */
1485 if (freq > BB_FREQ_MAX)
1487 copy_basic_block->frequency = freq;
1489 copy_gsi = gsi_start_bb (copy_basic_block);
1491 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1493 gimple stmt = gsi_stmt (gsi);
1494 gimple orig_stmt = stmt;
1496 id->regimplify = false;
1497 stmt = remap_gimple_stmt (stmt, id);
1498 if (gimple_nop_p (stmt))
1501 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
1504 /* With return slot optimization we can end up with
1505 non-gimple (foo *)&this->m, fix that here. */
1506 if (is_gimple_assign (stmt)
1507 && gimple_assign_rhs_code (stmt) == NOP_EXPR
1508 && !is_gimple_val (gimple_assign_rhs1 (stmt)))
1511 new_rhs = force_gimple_operand_gsi (&seq_gsi,
1512 gimple_assign_rhs1 (stmt),
1513 true, NULL, false, GSI_NEW_STMT);
1514 gimple_assign_set_rhs1 (stmt, new_rhs);
1515 id->regimplify = false;
1518 gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT);
1521 gimple_regimplify_operands (stmt, &seq_gsi);
1523 /* If copy_basic_block has been empty at the start of this iteration,
1524 call gsi_start_bb again to get at the newly added statements. */
1525 if (gsi_end_p (copy_gsi))
1526 copy_gsi = gsi_start_bb (copy_basic_block);
1528 gsi_next (©_gsi);
1530 /* Process the new statement. The call to gimple_regimplify_operands
1531 possibly turned the statement into multiple statements, we
1532 need to process all of them. */
1537 stmt = gsi_stmt (copy_gsi);
1538 if (is_gimple_call (stmt)
1539 && gimple_call_va_arg_pack_p (stmt)
1542 /* __builtin_va_arg_pack () should be replaced by
1543 all arguments corresponding to ... in the caller. */
1546 VEC(tree, heap) *argarray;
1547 size_t nargs = gimple_call_num_args (id->gimple_call);
1550 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1553 /* Create the new array of arguments. */
1554 n = nargs + gimple_call_num_args (stmt);
1555 argarray = VEC_alloc (tree, heap, n);
1556 VEC_safe_grow (tree, heap, argarray, n);
1558 /* Copy all the arguments before '...' */
1559 memcpy (VEC_address (tree, argarray),
1560 gimple_call_arg_ptr (stmt, 0),
1561 gimple_call_num_args (stmt) * sizeof (tree));
1563 /* Append the arguments passed in '...' */
1564 memcpy (VEC_address(tree, argarray) + gimple_call_num_args (stmt),
1565 gimple_call_arg_ptr (id->gimple_call, 0)
1566 + (gimple_call_num_args (id->gimple_call) - nargs),
1567 nargs * sizeof (tree));
1569 new_call = gimple_build_call_vec (gimple_call_fn (stmt),
1572 VEC_free (tree, heap, argarray);
1574 /* Copy all GIMPLE_CALL flags, location and block, except
1575 GF_CALL_VA_ARG_PACK. */
1576 gimple_call_copy_flags (new_call, stmt);
1577 gimple_call_set_va_arg_pack (new_call, false);
1578 gimple_set_location (new_call, gimple_location (stmt));
1579 gimple_set_block (new_call, gimple_block (stmt));
1580 gimple_call_set_lhs (new_call, gimple_call_lhs (stmt));
1582 gsi_replace (©_gsi, new_call, false);
1583 gimple_set_bb (stmt, NULL);
1586 else if (is_gimple_call (stmt)
1588 && (decl = gimple_call_fndecl (stmt))
1589 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1590 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN)
1592 /* __builtin_va_arg_pack_len () should be replaced by
1593 the number of anonymous arguments. */
1594 size_t nargs = gimple_call_num_args (id->gimple_call);
1598 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1601 count = build_int_cst (integer_type_node, nargs);
1602 new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count);
1603 gsi_replace (©_gsi, new_stmt, false);
1607 /* Statements produced by inlining can be unfolded, especially
1608 when we constant propagated some operands. We can't fold
1609 them right now for two reasons:
1610 1) folding require SSA_NAME_DEF_STMTs to be correct
1611 2) we can't change function calls to builtins.
1612 So we just mark statement for later folding. We mark
1613 all new statements, instead just statements that has changed
1614 by some nontrivial substitution so even statements made
1615 foldable indirectly are updated. If this turns out to be
1616 expensive, copy_body can be told to watch for nontrivial
1618 if (id->statements_to_fold)
1619 pointer_set_insert (id->statements_to_fold, stmt);
1621 /* We're duplicating a CALL_EXPR. Find any corresponding
1622 callgraph edges and update or duplicate them. */
1623 if (is_gimple_call (stmt))
1625 struct cgraph_edge *edge;
1628 switch (id->transform_call_graph_edges)
1630 case CB_CGE_DUPLICATE:
1631 edge = cgraph_edge (id->src_node, orig_stmt);
1634 int edge_freq = edge->frequency;
1635 edge = cgraph_clone_edge (edge, id->dst_node, stmt,
1637 REG_BR_PROB_BASE, CGRAPH_FREQ_BASE,
1638 edge->frequency, true);
1639 /* We could also just rescale the frequency, but
1640 doing so would introduce roundoff errors and make
1641 verifier unhappy. */
1643 = compute_call_stmt_bb_frequency (id->dst_node->decl,
1646 && profile_status_for_function (cfun) != PROFILE_ABSENT
1647 && (edge_freq > edge->frequency + 10
1648 || edge_freq < edge->frequency - 10))
1650 fprintf (dump_file, "Edge frequency estimated by "
1651 "cgraph %i diverge from inliner's estimate %i\n",
1655 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1658 copy_basic_block->frequency);
1660 stmt = cgraph_redirect_edge_call_stmt_to_callee (edge);
1664 case CB_CGE_MOVE_CLONES:
1665 cgraph_set_call_stmt_including_clones (id->dst_node,
1667 edge = cgraph_edge (id->dst_node, stmt);
1671 edge = cgraph_edge (id->dst_node, orig_stmt);
1673 cgraph_set_call_stmt (edge, stmt);
1680 /* Constant propagation on argument done during inlining
1681 may create new direct call. Produce an edge for it. */
1683 || (edge->indirect_call
1684 && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES))
1685 && is_gimple_call (stmt)
1686 && (fn = gimple_call_fndecl (stmt)) != NULL)
1688 struct cgraph_node *dest = cgraph_node (fn);
1690 /* We have missing edge in the callgraph. This can happen
1691 when previous inlining turned an indirect call into a
1692 direct call by constant propagating arguments or we are
1693 producing dead clone (for further clonning). In all
1694 other cases we hit a bug (incorrect node sharing is the
1695 most common reason for missing edges). */
1696 gcc_assert (dest->needed || !dest->analyzed
1697 || !id->src_node->analyzed);
1698 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)
1699 cgraph_create_edge_including_clones
1700 (id->dst_node, dest, orig_stmt, stmt, bb->count,
1701 compute_call_stmt_bb_frequency (id->dst_node->decl,
1703 bb->loop_depth, CIF_ORIGINALLY_INDIRECT_CALL);
1705 cgraph_create_edge (id->dst_node, dest, stmt,
1707 compute_call_stmt_bb_frequency
1708 (id->dst_node->decl, copy_basic_block),
1709 bb->loop_depth)->inline_failed
1710 = CIF_ORIGINALLY_INDIRECT_CALL;
1713 fprintf (dump_file, "Created new direct edge to %s",
1714 cgraph_node_name (dest));
1718 flags = gimple_call_flags (stmt);
1719 if (flags & ECF_MAY_BE_ALLOCA)
1720 cfun->calls_alloca = true;
1721 if (flags & ECF_RETURNS_TWICE)
1722 cfun->calls_setjmp = true;
1725 maybe_duplicate_eh_stmt_fn (cfun, stmt, id->src_cfun, orig_stmt,
1726 id->eh_map, id->eh_lp_nr);
1728 if (gimple_in_ssa_p (cfun) && !is_gimple_debug (stmt))
1733 find_new_referenced_vars (gsi_stmt (copy_gsi));
1734 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1735 if (TREE_CODE (def) == SSA_NAME)
1736 SSA_NAME_DEF_STMT (def) = stmt;
1739 gsi_next (©_gsi);
1741 while (!gsi_end_p (copy_gsi));
1743 copy_gsi = gsi_last_bb (copy_basic_block);
1746 return copy_basic_block;
1749 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1750 form is quite easy, since dominator relationship for old basic blocks does
1753 There is however exception where inlining might change dominator relation
1754 across EH edges from basic block within inlined functions destinating
1755 to landing pads in function we inline into.
1757 The function fills in PHI_RESULTs of such PHI nodes if they refer
1758 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1759 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1760 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1761 set, and this means that there will be no overlapping live ranges
1762 for the underlying symbol.
1764 This might change in future if we allow redirecting of EH edges and
1765 we might want to change way build CFG pre-inlining to include
1766 all the possible edges then. */
1768 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1769 bool can_throw, bool nonlocal_goto)
1774 FOR_EACH_EDGE (e, ei, bb->succs)
1776 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1779 gimple_stmt_iterator si;
1782 gcc_assert (e->flags & EDGE_EH);
1785 gcc_assert (!(e->flags & EDGE_EH));
1787 for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
1791 phi = gsi_stmt (si);
1793 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1794 gcc_assert (!e->dest->aux);
1796 gcc_assert ((e->flags & EDGE_EH)
1797 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
1799 if (!is_gimple_reg (PHI_RESULT (phi)))
1801 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi)));
1805 re = find_edge (ret_bb, e->dest);
1807 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1808 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1810 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1811 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1817 /* Copy edges from BB into its copy constructed earlier, scale profile
1818 accordingly. Edges will be taken care of later. Assume aux
1819 pointers to point to the copies of each BB. */
1822 copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb)
1824 basic_block new_bb = (basic_block) bb->aux;
1827 gimple_stmt_iterator si;
1830 /* Use the indices from the original blocks to create edges for the
1832 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1833 if (!(old_edge->flags & EDGE_EH))
1837 flags = old_edge->flags;
1839 /* Return edges do get a FALLTHRU flag when the get inlined. */
1840 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1841 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1842 flags |= EDGE_FALLTHRU;
1843 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1844 new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1845 new_edge->probability = old_edge->probability;
1848 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1851 for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
1854 bool can_throw, nonlocal_goto;
1856 copy_stmt = gsi_stmt (si);
1857 if (!is_gimple_debug (copy_stmt))
1859 update_stmt (copy_stmt);
1860 if (gimple_in_ssa_p (cfun))
1861 mark_symbols_for_renaming (copy_stmt);
1864 /* Do this before the possible split_block. */
1867 /* If this tree could throw an exception, there are two
1868 cases where we need to add abnormal edge(s): the
1869 tree wasn't in a region and there is a "current
1870 region" in the caller; or the original tree had
1871 EH edges. In both cases split the block after the tree,
1872 and add abnormal edge(s) as needed; we need both
1873 those from the callee and the caller.
1874 We check whether the copy can throw, because the const
1875 propagation can change an INDIRECT_REF which throws
1876 into a COMPONENT_REF which doesn't. If the copy
1877 can throw, the original could also throw. */
1878 can_throw = stmt_can_throw_internal (copy_stmt);
1879 nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt);
1881 if (can_throw || nonlocal_goto)
1883 if (!gsi_end_p (si))
1884 /* Note that bb's predecessor edges aren't necessarily
1885 right at this point; split_block doesn't care. */
1887 edge e = split_block (new_bb, copy_stmt);
1890 new_bb->aux = e->src->aux;
1891 si = gsi_start_bb (new_bb);
1895 if (gimple_code (copy_stmt) == GIMPLE_EH_DISPATCH)
1896 make_eh_dispatch_edges (copy_stmt);
1898 make_eh_edges (copy_stmt);
1901 make_abnormal_goto_edges (gimple_bb (copy_stmt), true);
1903 if ((can_throw || nonlocal_goto)
1904 && gimple_in_ssa_p (cfun))
1905 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
1906 can_throw, nonlocal_goto);
1910 /* Copy the PHIs. All blocks and edges are copied, some blocks
1911 was possibly split and new outgoing EH edges inserted.
1912 BB points to the block of original function and AUX pointers links
1913 the original and newly copied blocks. */
1916 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1918 basic_block const new_bb = (basic_block) bb->aux;
1921 gimple_stmt_iterator si;
1923 for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si))
1929 phi = gsi_stmt (si);
1930 res = PHI_RESULT (phi);
1932 if (is_gimple_reg (res))
1934 walk_tree (&new_res, copy_tree_body_r, id, NULL);
1935 SSA_NAME_DEF_STMT (new_res)
1936 = new_phi = create_phi_node (new_res, new_bb);
1937 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1940 = find_edge ((basic_block) new_edge->src->aux, bb);
1941 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1943 tree block = id->block;
1944 id->block = NULL_TREE;
1945 walk_tree (&new_arg, copy_tree_body_r, id, NULL);
1947 gcc_assert (new_arg);
1948 /* With return slot optimization we can end up with
1949 non-gimple (foo *)&this->m, fix that here. */
1950 if (TREE_CODE (new_arg) != SSA_NAME
1951 && TREE_CODE (new_arg) != FUNCTION_DECL
1952 && !is_gimple_val (new_arg))
1954 gimple_seq stmts = NULL;
1955 new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
1956 gsi_insert_seq_on_edge_immediate (new_edge, stmts);
1958 add_phi_arg (new_phi, new_arg, new_edge,
1959 gimple_phi_arg_location_from_edge (phi, old_edge));
1966 /* Wrapper for remap_decl so it can be used as a callback. */
1969 remap_decl_1 (tree decl, void *data)
1971 return remap_decl (decl, (copy_body_data *) data);
1974 /* Build struct function and associated datastructures for the new clone
1975 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1978 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count)
1980 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1981 gcov_type count_scale;
1983 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1984 count_scale = (REG_BR_PROB_BASE * count
1985 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1987 count_scale = REG_BR_PROB_BASE;
1989 /* Register specific tree functions. */
1990 gimple_register_cfg_hooks ();
1992 /* Get clean struct function. */
1993 push_struct_function (new_fndecl);
1995 /* We will rebuild these, so just sanity check that they are empty. */
1996 gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
1997 gcc_assert (cfun->local_decls == NULL);
1998 gcc_assert (cfun->cfg == NULL);
1999 gcc_assert (cfun->decl == new_fndecl);
2001 /* Copy items we preserve during clonning. */
2002 cfun->static_chain_decl = src_cfun->static_chain_decl;
2003 cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
2004 cfun->function_end_locus = src_cfun->function_end_locus;
2005 cfun->curr_properties = src_cfun->curr_properties;
2006 cfun->last_verified = src_cfun->last_verified;
2007 cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
2008 cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
2009 cfun->function_frequency = src_cfun->function_frequency;
2010 cfun->has_nonlocal_label = src_cfun->has_nonlocal_label;
2011 cfun->stdarg = src_cfun->stdarg;
2012 cfun->dont_save_pending_sizes_p = src_cfun->dont_save_pending_sizes_p;
2013 cfun->after_inlining = src_cfun->after_inlining;
2014 cfun->returns_struct = src_cfun->returns_struct;
2015 cfun->returns_pcc_struct = src_cfun->returns_pcc_struct;
2016 cfun->after_tree_profile = src_cfun->after_tree_profile;
2018 init_empty_tree_cfg ();
2020 profile_status_for_function (cfun) = profile_status_for_function (src_cfun);
2021 ENTRY_BLOCK_PTR->count =
2022 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2024 ENTRY_BLOCK_PTR->frequency
2025 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2026 EXIT_BLOCK_PTR->count =
2027 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2029 EXIT_BLOCK_PTR->frequency =
2030 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2032 init_eh_for_function ();
2034 if (src_cfun->gimple_df)
2036 init_tree_ssa (cfun);
2037 cfun->gimple_df->in_ssa_p = true;
2038 init_ssa_operands ();
2043 /* Make a copy of the body of FN so that it can be inserted inline in
2044 another function. Walks FN via CFG, returns new fndecl. */
2047 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency_scale,
2048 basic_block entry_block_map, basic_block exit_block_map)
2050 tree callee_fndecl = id->src_fn;
2051 /* Original cfun for the callee, doesn't change. */
2052 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2053 struct function *cfun_to_copy;
2055 tree new_fndecl = NULL;
2056 gcov_type count_scale;
2059 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
2060 count_scale = (REG_BR_PROB_BASE * count
2061 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
2063 count_scale = REG_BR_PROB_BASE;
2065 /* Register specific tree functions. */
2066 gimple_register_cfg_hooks ();
2068 /* Must have a CFG here at this point. */
2069 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2070 (DECL_STRUCT_FUNCTION (callee_fndecl)));
2072 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2074 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
2075 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
2076 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2077 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2079 /* Duplicate any exception-handling regions. */
2081 id->eh_map = duplicate_eh_regions (cfun_to_copy, NULL, id->eh_lp_nr,
2084 /* Use aux pointers to map the original blocks to copy. */
2085 FOR_EACH_BB_FN (bb, cfun_to_copy)
2087 basic_block new_bb = copy_bb (id, bb, frequency_scale, count_scale);
2092 last = last_basic_block;
2094 /* Now that we've duplicated the blocks, duplicate their edges. */
2095 FOR_ALL_BB_FN (bb, cfun_to_copy)
2096 copy_edges_for_bb (bb, count_scale, exit_block_map);
2098 if (gimple_in_ssa_p (cfun))
2099 FOR_ALL_BB_FN (bb, cfun_to_copy)
2100 copy_phis_for_bb (bb, id);
2102 FOR_ALL_BB_FN (bb, cfun_to_copy)
2104 ((basic_block)bb->aux)->aux = NULL;
2108 /* Zero out AUX fields of newly created block during EH edge
2110 for (; last < last_basic_block; last++)
2111 BASIC_BLOCK (last)->aux = NULL;
2112 entry_block_map->aux = NULL;
2113 exit_block_map->aux = NULL;
2117 pointer_map_destroy (id->eh_map);
2124 /* Copy the debug STMT using ID. We deal with these statements in a
2125 special way: if any variable in their VALUE expression wasn't
2126 remapped yet, we won't remap it, because that would get decl uids
2127 out of sync, causing codegen differences between -g and -g0. If
2128 this arises, we drop the VALUE expression altogether. */
2131 copy_debug_stmt (gimple stmt, copy_body_data *id)
2134 struct walk_stmt_info wi;
2137 if (gimple_block (stmt))
2140 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (stmt));
2144 gimple_set_block (stmt, t);
2146 /* Remap all the operands in COPY. */
2147 memset (&wi, 0, sizeof (wi));
2150 processing_debug_stmt = 1;
2152 t = gimple_debug_bind_get_var (stmt);
2154 if (TREE_CODE (t) == PARM_DECL && id->debug_map
2155 && (n = (tree *) pointer_map_contains (id->debug_map, t)))
2157 gcc_assert (TREE_CODE (*n) == VAR_DECL);
2160 else if (TREE_CODE (t) == VAR_DECL
2162 && gimple_in_ssa_p (cfun)
2163 && !pointer_map_contains (id->decl_map, t)
2165 /* T is a non-localized variable. */;
2167 walk_tree (&t, remap_gimple_op_r, &wi, NULL);
2169 gimple_debug_bind_set_var (stmt, t);
2171 if (gimple_debug_bind_has_value_p (stmt))
2172 walk_tree (gimple_debug_bind_get_value_ptr (stmt),
2173 remap_gimple_op_r, &wi, NULL);
2175 /* Punt if any decl couldn't be remapped. */
2176 if (processing_debug_stmt < 0)
2177 gimple_debug_bind_reset_value (stmt);
2179 processing_debug_stmt = 0;
2182 if (gimple_in_ssa_p (cfun))
2183 mark_symbols_for_renaming (stmt);
2186 /* Process deferred debug stmts. In order to give values better odds
2187 of being successfully remapped, we delay the processing of debug
2188 stmts until all other stmts that might require remapping are
2192 copy_debug_stmts (copy_body_data *id)
2197 if (!id->debug_stmts)
2200 for (i = 0; VEC_iterate (gimple, id->debug_stmts, i, stmt); i++)
2201 copy_debug_stmt (stmt, id);
2203 VEC_free (gimple, heap, id->debug_stmts);
2206 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2207 another function. */
2210 copy_tree_body (copy_body_data *id)
2212 tree fndecl = id->src_fn;
2213 tree body = DECL_SAVED_TREE (fndecl);
2215 walk_tree (&body, copy_tree_body_r, id, NULL);
2220 /* Make a copy of the body of FN so that it can be inserted inline in
2221 another function. */
2224 copy_body (copy_body_data *id, gcov_type count, int frequency_scale,
2225 basic_block entry_block_map, basic_block exit_block_map)
2227 tree fndecl = id->src_fn;
2230 /* If this body has a CFG, walk CFG and copy. */
2231 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
2232 body = copy_cfg_body (id, count, frequency_scale, entry_block_map, exit_block_map);
2233 copy_debug_stmts (id);
2238 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2239 defined in function FN, or of a data member thereof. */
2242 self_inlining_addr_expr (tree value, tree fn)
2246 if (TREE_CODE (value) != ADDR_EXPR)
2249 var = get_base_address (TREE_OPERAND (value, 0));
2251 return var && auto_var_in_fn_p (var, fn);
2254 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2255 lexical block and line number information from base_stmt, if given,
2256 or from the last stmt of the block otherwise. */
2259 insert_init_debug_bind (copy_body_data *id,
2260 basic_block bb, tree var, tree value,
2264 gimple_stmt_iterator gsi;
2267 if (!gimple_in_ssa_p (id->src_cfun))
2270 if (!MAY_HAVE_DEBUG_STMTS)
2273 tracked_var = target_for_debug_bind (var);
2279 gsi = gsi_last_bb (bb);
2280 if (!base_stmt && !gsi_end_p (gsi))
2281 base_stmt = gsi_stmt (gsi);
2284 note = gimple_build_debug_bind (tracked_var, value, base_stmt);
2288 if (!gsi_end_p (gsi))
2289 gsi_insert_after (&gsi, note, GSI_SAME_STMT);
2291 gsi_insert_before (&gsi, note, GSI_SAME_STMT);
2298 insert_init_stmt (copy_body_data *id, basic_block bb, gimple init_stmt)
2300 /* If VAR represents a zero-sized variable, it's possible that the
2301 assignment statement may result in no gimple statements. */
2304 gimple_stmt_iterator si = gsi_last_bb (bb);
2306 /* We can end up with init statements that store to a non-register
2307 from a rhs with a conversion. Handle that here by forcing the
2308 rhs into a temporary. gimple_regimplify_operands is not
2309 prepared to do this for us. */
2310 if (!is_gimple_debug (init_stmt)
2311 && !is_gimple_reg (gimple_assign_lhs (init_stmt))
2312 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt)))
2313 && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS)
2315 tree rhs = build1 (gimple_assign_rhs_code (init_stmt),
2316 gimple_expr_type (init_stmt),
2317 gimple_assign_rhs1 (init_stmt));
2318 rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false,
2320 gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs));
2321 gimple_assign_set_rhs1 (init_stmt, rhs);
2323 gsi_insert_after (&si, init_stmt, GSI_NEW_STMT);
2324 gimple_regimplify_operands (init_stmt, &si);
2325 mark_symbols_for_renaming (init_stmt);
2327 if (!is_gimple_debug (init_stmt) && MAY_HAVE_DEBUG_STMTS)
2329 tree var, def = gimple_assign_lhs (init_stmt);
2331 if (TREE_CODE (def) == SSA_NAME)
2332 var = SSA_NAME_VAR (def);
2336 insert_init_debug_bind (id, bb, var, def, init_stmt);
2341 /* Initialize parameter P with VALUE. If needed, produce init statement
2342 at the end of BB. When BB is NULL, we return init statement to be
2345 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
2346 basic_block bb, tree *vars)
2348 gimple init_stmt = NULL;
2351 tree def = (gimple_in_ssa_p (cfun)
2352 ? gimple_default_def (id->src_cfun, p) : NULL);
2355 && value != error_mark_node
2356 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
2358 if (fold_convertible_p (TREE_TYPE (p), value))
2359 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
2361 /* ??? For valid (GIMPLE) programs we should not end up here.
2362 Still if something has gone wrong and we end up with truly
2363 mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2364 to not leak invalid GIMPLE to the following passes. */
2365 rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value);
2368 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2369 here since the type of this decl must be visible to the calling
2371 var = copy_decl_to_var (p, id);
2373 /* We're actually using the newly-created var. */
2374 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
2377 add_referenced_var (var);
2380 /* Declare this new variable. */
2381 TREE_CHAIN (var) = *vars;
2384 /* Make gimplifier happy about this variable. */
2385 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2387 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2388 we would not need to create a new variable here at all, if it
2389 weren't for debug info. Still, we can just use the argument
2391 if (TREE_READONLY (p)
2392 && !TREE_ADDRESSABLE (p)
2393 && value && !TREE_SIDE_EFFECTS (value)
2396 /* We may produce non-gimple trees by adding NOPs or introduce
2397 invalid sharing when operand is not really constant.
2398 It is not big deal to prohibit constant propagation here as
2399 we will constant propagate in DOM1 pass anyway. */
2400 if (is_gimple_min_invariant (value)
2401 && useless_type_conversion_p (TREE_TYPE (p),
2403 /* We have to be very careful about ADDR_EXPR. Make sure
2404 the base variable isn't a local variable of the inlined
2405 function, e.g., when doing recursive inlining, direct or
2406 mutually-recursive or whatever, which is why we don't
2407 just test whether fn == current_function_decl. */
2408 && ! self_inlining_addr_expr (value, fn))
2410 insert_decl_map (id, p, value);
2411 insert_debug_decl_map (id, p, var);
2412 return insert_init_debug_bind (id, bb, var, value, NULL);
2416 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2417 that way, when the PARM_DECL is encountered, it will be
2418 automatically replaced by the VAR_DECL. */
2419 insert_decl_map (id, p, var);
2421 /* Even if P was TREE_READONLY, the new VAR should not be.
2422 In the original code, we would have constructed a
2423 temporary, and then the function body would have never
2424 changed the value of P. However, now, we will be
2425 constructing VAR directly. The constructor body may
2426 change its value multiple times as it is being
2427 constructed. Therefore, it must not be TREE_READONLY;
2428 the back-end assumes that TREE_READONLY variable is
2429 assigned to only once. */
2430 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
2431 TREE_READONLY (var) = 0;
2433 /* If there is no setup required and we are in SSA, take the easy route
2434 replacing all SSA names representing the function parameter by the
2435 SSA name passed to function.
2437 We need to construct map for the variable anyway as it might be used
2438 in different SSA names when parameter is set in function.
2440 Do replacement at -O0 for const arguments replaced by constant.
2441 This is important for builtin_constant_p and other construct requiring
2442 constant argument to be visible in inlined function body. */
2443 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
2445 || (TREE_READONLY (p)
2446 && is_gimple_min_invariant (rhs)))
2447 && (TREE_CODE (rhs) == SSA_NAME
2448 || is_gimple_min_invariant (rhs))
2449 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
2451 insert_decl_map (id, def, rhs);
2452 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2455 /* If the value of argument is never used, don't care about initializing
2457 if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
2459 gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
2460 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2463 /* Initialize this VAR_DECL from the equivalent argument. Convert
2464 the argument to the proper type in case it was promoted. */
2467 if (rhs == error_mark_node)
2469 insert_decl_map (id, p, var);
2470 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2473 STRIP_USELESS_TYPE_CONVERSION (rhs);
2475 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2476 keep our trees in gimple form. */
2477 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
2479 def = remap_ssa_name (def, id);
2480 init_stmt = gimple_build_assign (def, rhs);
2481 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
2482 set_default_def (var, NULL);
2485 init_stmt = gimple_build_assign (var, rhs);
2487 if (bb && init_stmt)
2488 insert_init_stmt (id, bb, init_stmt);
2493 /* Generate code to initialize the parameters of the function at the
2494 top of the stack in ID from the GIMPLE_CALL STMT. */
2497 initialize_inlined_parameters (copy_body_data *id, gimple stmt,
2498 tree fn, basic_block bb)
2503 tree vars = NULL_TREE;
2504 tree static_chain = gimple_call_chain (stmt);
2506 /* Figure out what the parameters are. */
2507 parms = DECL_ARGUMENTS (fn);
2509 /* Loop through the parameter declarations, replacing each with an
2510 equivalent VAR_DECL, appropriately initialized. */
2511 for (p = parms, i = 0; p; p = TREE_CHAIN (p), i++)
2514 val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL;
2515 setup_one_parameter (id, p, val, fn, bb, &vars);
2518 /* Initialize the static chain. */
2519 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
2520 gcc_assert (fn != current_function_decl);
2523 /* No static chain? Seems like a bug in tree-nested.c. */
2524 gcc_assert (static_chain);
2526 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
2529 declare_inline_vars (id->block, vars);
2533 /* Declare a return variable to replace the RESULT_DECL for the
2534 function we are calling. An appropriate DECL_STMT is returned.
2535 The USE_STMT is filled to contain a use of the declaration to
2536 indicate the return value of the function.
2538 RETURN_SLOT, if non-null is place where to store the result. It
2539 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2540 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2542 The return value is a (possibly null) value that holds the result
2543 as seen by the caller. */
2546 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest)
2548 tree callee = id->src_fn;
2549 tree caller = id->dst_fn;
2550 tree result = DECL_RESULT (callee);
2551 tree callee_type = TREE_TYPE (result);
2555 /* Handle type-mismatches in the function declaration return type
2556 vs. the call expression. */
2558 caller_type = TREE_TYPE (modify_dest);
2560 caller_type = TREE_TYPE (TREE_TYPE (callee));
2562 /* We don't need to do anything for functions that don't return
2564 if (!result || VOID_TYPE_P (callee_type))
2567 /* If there was a return slot, then the return value is the
2568 dereferenced address of that object. */
2571 /* The front end shouldn't have used both return_slot and
2572 a modify expression. */
2573 gcc_assert (!modify_dest);
2574 if (DECL_BY_REFERENCE (result))
2576 tree return_slot_addr = build_fold_addr_expr (return_slot);
2577 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
2579 /* We are going to construct *&return_slot and we can't do that
2580 for variables believed to be not addressable.
2582 FIXME: This check possibly can match, because values returned
2583 via return slot optimization are not believed to have address
2584 taken by alias analysis. */
2585 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
2586 if (gimple_in_ssa_p (cfun))
2588 HOST_WIDE_INT bitsize;
2589 HOST_WIDE_INT bitpos;
2591 enum machine_mode mode;
2595 base = get_inner_reference (return_slot, &bitsize, &bitpos,
2597 &mode, &unsignedp, &volatilep,
2599 if (TREE_CODE (base) == INDIRECT_REF)
2600 base = TREE_OPERAND (base, 0);
2601 if (TREE_CODE (base) == SSA_NAME)
2602 base = SSA_NAME_VAR (base);
2603 mark_sym_for_renaming (base);
2605 var = return_slot_addr;
2610 gcc_assert (TREE_CODE (var) != SSA_NAME);
2611 TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
2613 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2614 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2615 && !DECL_GIMPLE_REG_P (result)
2617 DECL_GIMPLE_REG_P (var) = 0;
2622 /* All types requiring non-trivial constructors should have been handled. */
2623 gcc_assert (!TREE_ADDRESSABLE (callee_type));
2625 /* Attempt to avoid creating a new temporary variable. */
2627 && TREE_CODE (modify_dest) != SSA_NAME)
2629 bool use_it = false;
2631 /* We can't use MODIFY_DEST if there's type promotion involved. */
2632 if (!useless_type_conversion_p (callee_type, caller_type))
2635 /* ??? If we're assigning to a variable sized type, then we must
2636 reuse the destination variable, because we've no good way to
2637 create variable sized temporaries at this point. */
2638 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
2641 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2642 reuse it as the result of the call directly. Don't do this if
2643 it would promote MODIFY_DEST to addressable. */
2644 else if (TREE_ADDRESSABLE (result))
2648 tree base_m = get_base_address (modify_dest);
2650 /* If the base isn't a decl, then it's a pointer, and we don't
2651 know where that's going to go. */
2652 if (!DECL_P (base_m))
2654 else if (is_global_var (base_m))
2656 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2657 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2658 && !DECL_GIMPLE_REG_P (result)
2659 && DECL_GIMPLE_REG_P (base_m))
2661 else if (!TREE_ADDRESSABLE (base_m))
2673 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
2675 var = copy_result_decl_to_var (result, id);
2676 if (gimple_in_ssa_p (cfun))
2679 add_referenced_var (var);
2682 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2683 DECL_STRUCT_FUNCTION (caller)->local_decls
2684 = tree_cons (NULL_TREE, var,
2685 DECL_STRUCT_FUNCTION (caller)->local_decls);
2687 /* Do not have the rest of GCC warn about this variable as it should
2688 not be visible to the user. */
2689 TREE_NO_WARNING (var) = 1;
2691 declare_inline_vars (id->block, var);
2693 /* Build the use expr. If the return type of the function was
2694 promoted, convert it back to the expected type. */
2696 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
2697 use = fold_convert (caller_type, var);
2699 STRIP_USELESS_TYPE_CONVERSION (use);
2701 if (DECL_BY_REFERENCE (result))
2703 TREE_ADDRESSABLE (var) = 1;
2704 var = build_fold_addr_expr (var);
2708 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2709 way, when the RESULT_DECL is encountered, it will be
2710 automatically replaced by the VAR_DECL. */
2711 insert_decl_map (id, result, var);
2713 /* Remember this so we can ignore it in remap_decls. */
2719 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2720 to a local label. */
2723 has_label_address_in_static_1 (tree *nodep, int *walk_subtrees, void *fnp)
2726 tree fn = (tree) fnp;
2728 if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
2737 /* Determine if the function can be copied. If so return NULL. If
2738 not return a string describng the reason for failure. */
2741 copy_forbidden (struct function *fun, tree fndecl)
2743 const char *reason = fun->cannot_be_copied_reason;
2746 /* Only examine the function once. */
2747 if (fun->cannot_be_copied_set)
2750 /* We cannot copy a function that receives a non-local goto
2751 because we cannot remap the destination label used in the
2752 function that is performing the non-local goto. */
2753 /* ??? Actually, this should be possible, if we work at it.
2754 No doubt there's just a handful of places that simply
2755 assume it doesn't happen and don't substitute properly. */
2756 if (fun->has_nonlocal_label)
2758 reason = G_("function %q+F can never be copied "
2759 "because it receives a non-local goto");
2763 for (step = fun->local_decls; step; step = TREE_CHAIN (step))
2765 tree decl = TREE_VALUE (step);
2767 if (TREE_CODE (decl) == VAR_DECL
2768 && TREE_STATIC (decl)
2769 && !DECL_EXTERNAL (decl)
2770 && DECL_INITIAL (decl)
2771 && walk_tree_without_duplicates (&DECL_INITIAL (decl),
2772 has_label_address_in_static_1,
2775 reason = G_("function %q+F can never be copied because it saves "
2776 "address of local label in a static variable");
2782 fun->cannot_be_copied_reason = reason;
2783 fun->cannot_be_copied_set = true;
2788 static const char *inline_forbidden_reason;
2790 /* A callback for walk_gimple_seq to handle statements. Returns non-null
2791 iff a function can not be inlined. Also sets the reason why. */
2794 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2795 struct walk_stmt_info *wip)
2797 tree fn = (tree) wip->info;
2799 gimple stmt = gsi_stmt (*gsi);
2801 switch (gimple_code (stmt))
2804 /* Refuse to inline alloca call unless user explicitly forced so as
2805 this may change program's memory overhead drastically when the
2806 function using alloca is called in loop. In GCC present in
2807 SPEC2000 inlining into schedule_block cause it to require 2GB of
2808 RAM instead of 256MB. */
2809 if (gimple_alloca_call_p (stmt)
2810 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
2812 inline_forbidden_reason
2813 = G_("function %q+F can never be inlined because it uses "
2814 "alloca (override using the always_inline attribute)");
2815 *handled_ops_p = true;
2819 t = gimple_call_fndecl (stmt);
2823 /* We cannot inline functions that call setjmp. */
2824 if (setjmp_call_p (t))
2826 inline_forbidden_reason
2827 = G_("function %q+F can never be inlined because it uses setjmp");
2828 *handled_ops_p = true;
2832 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
2833 switch (DECL_FUNCTION_CODE (t))
2835 /* We cannot inline functions that take a variable number of
2837 case BUILT_IN_VA_START:
2838 case BUILT_IN_NEXT_ARG:
2839 case BUILT_IN_VA_END:
2840 inline_forbidden_reason
2841 = G_("function %q+F can never be inlined because it "
2842 "uses variable argument lists");
2843 *handled_ops_p = true;
2846 case BUILT_IN_LONGJMP:
2847 /* We can't inline functions that call __builtin_longjmp at
2848 all. The non-local goto machinery really requires the
2849 destination be in a different function. If we allow the
2850 function calling __builtin_longjmp to be inlined into the
2851 function calling __builtin_setjmp, Things will Go Awry. */
2852 inline_forbidden_reason
2853 = G_("function %q+F can never be inlined because "
2854 "it uses setjmp-longjmp exception handling");
2855 *handled_ops_p = true;
2858 case BUILT_IN_NONLOCAL_GOTO:
2860 inline_forbidden_reason
2861 = G_("function %q+F can never be inlined because "
2862 "it uses non-local goto");
2863 *handled_ops_p = true;
2866 case BUILT_IN_RETURN:
2867 case BUILT_IN_APPLY_ARGS:
2868 /* If a __builtin_apply_args caller would be inlined,
2869 it would be saving arguments of the function it has
2870 been inlined into. Similarly __builtin_return would
2871 return from the function the inline has been inlined into. */
2872 inline_forbidden_reason
2873 = G_("function %q+F can never be inlined because "
2874 "it uses __builtin_return or __builtin_apply_args");
2875 *handled_ops_p = true;
2884 t = gimple_goto_dest (stmt);
2886 /* We will not inline a function which uses computed goto. The
2887 addresses of its local labels, which may be tucked into
2888 global storage, are of course not constant across
2889 instantiations, which causes unexpected behavior. */
2890 if (TREE_CODE (t) != LABEL_DECL)
2892 inline_forbidden_reason
2893 = G_("function %q+F can never be inlined "
2894 "because it contains a computed goto");
2895 *handled_ops_p = true;
2904 *handled_ops_p = false;
2908 /* Return true if FNDECL is a function that cannot be inlined into
2912 inline_forbidden_p (tree fndecl)
2914 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
2915 struct walk_stmt_info wi;
2916 struct pointer_set_t *visited_nodes;
2918 bool forbidden_p = false;
2920 /* First check for shared reasons not to copy the code. */
2921 inline_forbidden_reason = copy_forbidden (fun, fndecl);
2922 if (inline_forbidden_reason != NULL)
2925 /* Next, walk the statements of the function looking for
2926 constraucts we can't handle, or are non-optimal for inlining. */
2927 visited_nodes = pointer_set_create ();
2928 memset (&wi, 0, sizeof (wi));
2929 wi.info = (void *) fndecl;
2930 wi.pset = visited_nodes;
2932 FOR_EACH_BB_FN (bb, fun)
2935 gimple_seq seq = bb_seq (bb);
2936 ret = walk_gimple_seq (seq, inline_forbidden_p_stmt, NULL, &wi);
2937 forbidden_p = (ret != NULL);
2942 pointer_set_destroy (visited_nodes);
2946 /* Returns nonzero if FN is a function that does not have any
2947 fundamental inline blocking properties. */
2950 tree_inlinable_function_p (tree fn)
2952 bool inlinable = true;
2956 /* If we've already decided this function shouldn't be inlined,
2957 there's no need to check again. */
2958 if (DECL_UNINLINABLE (fn))
2961 /* We only warn for functions declared `inline' by the user. */
2962 do_warning = (warn_inline
2963 && DECL_DECLARED_INLINE_P (fn)
2964 && !DECL_NO_INLINE_WARNING_P (fn)
2965 && !DECL_IN_SYSTEM_HEADER (fn));
2967 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
2970 && always_inline == NULL)
2973 warning (OPT_Winline, "function %q+F can never be inlined because it "
2974 "is suppressed using -fno-inline", fn);
2978 /* Don't auto-inline anything that might not be bound within
2979 this unit of translation. */
2980 else if (!DECL_DECLARED_INLINE_P (fn)
2981 && DECL_REPLACEABLE_P (fn))
2984 else if (!function_attribute_inlinable_p (fn))
2987 warning (OPT_Winline, "function %q+F can never be inlined because it "
2988 "uses attributes conflicting with inlining", fn);
2992 else if (inline_forbidden_p (fn))
2994 /* See if we should warn about uninlinable functions. Previously,
2995 some of these warnings would be issued while trying to expand
2996 the function inline, but that would cause multiple warnings
2997 about functions that would for example call alloca. But since
2998 this a property of the function, just one warning is enough.
2999 As a bonus we can now give more details about the reason why a
3000 function is not inlinable. */
3002 sorry (inline_forbidden_reason, fn);
3003 else if (do_warning)
3004 warning (OPT_Winline, inline_forbidden_reason, fn);
3009 /* Squirrel away the result so that we don't have to check again. */
3010 DECL_UNINLINABLE (fn) = !inlinable;
3015 /* Estimate the cost of a memory move. Use machine dependent
3016 word size and take possible memcpy call into account. */
3019 estimate_move_cost (tree type)
3023 gcc_assert (!VOID_TYPE_P (type));
3025 size = int_size_in_bytes (type);
3027 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size))
3028 /* Cost of a memcpy call, 3 arguments and the call. */
3031 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
3034 /* Returns cost of operation CODE, according to WEIGHTS */
3037 estimate_operator_cost (enum tree_code code, eni_weights *weights,
3038 tree op1 ATTRIBUTE_UNUSED, tree op2)
3042 /* These are "free" conversions, or their presumed cost
3043 is folded into other operations. */
3050 /* Assign cost of 1 to usual operations.
3051 ??? We may consider mapping RTL costs to this. */
3056 case POINTER_PLUS_EXPR:
3060 case ADDR_SPACE_CONVERT_EXPR:
3061 case FIXED_CONVERT_EXPR:
3062 case FIX_TRUNC_EXPR:
3074 case VEC_LSHIFT_EXPR:
3075 case VEC_RSHIFT_EXPR:
3082 case TRUTH_ANDIF_EXPR:
3083 case TRUTH_ORIF_EXPR:
3084 case TRUTH_AND_EXPR:
3086 case TRUTH_XOR_EXPR:
3087 case TRUTH_NOT_EXPR:
3096 case UNORDERED_EXPR:
3107 case PREDECREMENT_EXPR:
3108 case PREINCREMENT_EXPR:
3109 case POSTDECREMENT_EXPR:
3110 case POSTINCREMENT_EXPR:
3112 case REALIGN_LOAD_EXPR:
3114 case REDUC_MAX_EXPR:
3115 case REDUC_MIN_EXPR:
3116 case REDUC_PLUS_EXPR:
3117 case WIDEN_SUM_EXPR:
3118 case WIDEN_MULT_EXPR:
3121 case VEC_WIDEN_MULT_HI_EXPR:
3122 case VEC_WIDEN_MULT_LO_EXPR:
3123 case VEC_UNPACK_HI_EXPR:
3124 case VEC_UNPACK_LO_EXPR:
3125 case VEC_UNPACK_FLOAT_HI_EXPR:
3126 case VEC_UNPACK_FLOAT_LO_EXPR:
3127 case VEC_PACK_TRUNC_EXPR:
3128 case VEC_PACK_SAT_EXPR:
3129 case VEC_PACK_FIX_TRUNC_EXPR:
3130 case VEC_EXTRACT_EVEN_EXPR:
3131 case VEC_EXTRACT_ODD_EXPR:
3132 case VEC_INTERLEAVE_HIGH_EXPR:
3133 case VEC_INTERLEAVE_LOW_EXPR:
3137 /* Few special cases of expensive operations. This is useful
3138 to avoid inlining on functions having too many of these. */
3139 case TRUNC_DIV_EXPR:
3141 case FLOOR_DIV_EXPR:
3142 case ROUND_DIV_EXPR:
3143 case EXACT_DIV_EXPR:
3144 case TRUNC_MOD_EXPR:
3146 case FLOOR_MOD_EXPR:
3147 case ROUND_MOD_EXPR:
3149 if (TREE_CODE (op2) != INTEGER_CST)
3150 return weights->div_mod_cost;
3154 /* We expect a copy assignment with no operator. */
3155 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
3161 /* Estimate number of instructions that will be created by expanding
3162 the statements in the statement sequence STMTS.
3163 WEIGHTS contains weights attributed to various constructs. */
3166 int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
3169 gimple_stmt_iterator gsi;
3172 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
3173 cost += estimate_num_insns (gsi_stmt (gsi), weights);
3179 /* Estimate number of instructions that will be created by expanding STMT.
3180 WEIGHTS contains weights attributed to various constructs. */
3183 estimate_num_insns (gimple stmt, eni_weights *weights)
3186 enum gimple_code code = gimple_code (stmt);
3193 /* Try to estimate the cost of assignments. We have three cases to
3195 1) Simple assignments to registers;
3196 2) Stores to things that must live in memory. This includes
3197 "normal" stores to scalars, but also assignments of large
3198 structures, or constructors of big arrays;
3200 Let us look at the first two cases, assuming we have "a = b + C":
3201 <GIMPLE_ASSIGN <var_decl "a">
3202 <plus_expr <var_decl "b"> <constant C>>
3203 If "a" is a GIMPLE register, the assignment to it is free on almost
3204 any target, because "a" usually ends up in a real register. Hence
3205 the only cost of this expression comes from the PLUS_EXPR, and we
3206 can ignore the GIMPLE_ASSIGN.
3207 If "a" is not a GIMPLE register, the assignment to "a" will most
3208 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3209 of moving something into "a", which we compute using the function
3210 estimate_move_cost. */
3211 lhs = gimple_assign_lhs (stmt);
3212 rhs = gimple_assign_rhs1 (stmt);
3214 if (is_gimple_reg (lhs))
3217 cost = estimate_move_cost (TREE_TYPE (lhs));
3219 if (!is_gimple_reg (rhs) && !is_gimple_min_invariant (rhs))
3220 cost += estimate_move_cost (TREE_TYPE (rhs));
3222 cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights,
3223 gimple_assign_rhs1 (stmt),
3224 get_gimple_rhs_class (gimple_assign_rhs_code (stmt))
3225 == GIMPLE_BINARY_RHS
3226 ? gimple_assign_rhs2 (stmt) : NULL);
3230 cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights,
3231 gimple_op (stmt, 0),
3232 gimple_op (stmt, 1));
3236 /* Take into account cost of the switch + guess 2 conditional jumps for
3239 TODO: once the switch expansion logic is sufficiently separated, we can
3240 do better job on estimating cost of the switch. */
3241 if (weights->time_based)
3242 cost = floor_log2 (gimple_switch_num_labels (stmt)) * 2;
3244 cost = gimple_switch_num_labels (stmt) * 2;
3249 tree decl = gimple_call_fndecl (stmt);
3250 tree addr = gimple_call_fn (stmt);
3251 tree funtype = TREE_TYPE (addr);
3253 if (POINTER_TYPE_P (funtype))
3254 funtype = TREE_TYPE (funtype);
3256 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
3257 cost = weights->target_builtin_call_cost;
3259 cost = weights->call_cost;
3261 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
3262 switch (DECL_FUNCTION_CODE (decl))
3264 case BUILT_IN_CONSTANT_P:
3266 case BUILT_IN_EXPECT:
3269 /* Prefetch instruction is not expensive. */
3270 case BUILT_IN_PREFETCH:
3271 cost = weights->target_builtin_call_cost;
3274 /* Exception state returns or moves registers around. */
3275 case BUILT_IN_EH_FILTER:
3276 case BUILT_IN_EH_POINTER:
3277 case BUILT_IN_EH_COPY_VALUES:
3285 funtype = TREE_TYPE (decl);
3287 if (!VOID_TYPE_P (TREE_TYPE (funtype)))
3288 cost += estimate_move_cost (TREE_TYPE (funtype));
3289 /* Our cost must be kept in sync with
3290 cgraph_estimate_size_after_inlining that does use function
3291 declaration to figure out the arguments. */
3292 if (decl && DECL_ARGUMENTS (decl))
3295 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
3296 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3297 cost += estimate_move_cost (TREE_TYPE (arg));
3299 else if (funtype && prototype_p (funtype))
3302 for (t = TYPE_ARG_TYPES (funtype); t && t != void_list_node;
3304 if (!VOID_TYPE_P (TREE_VALUE (t)))
3305 cost += estimate_move_cost (TREE_VALUE (t));
3309 for (i = 0; i < gimple_call_num_args (stmt); i++)
3311 tree arg = gimple_call_arg (stmt, i);
3312 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3313 cost += estimate_move_cost (TREE_TYPE (arg));
3325 case GIMPLE_PREDICT:
3330 return asm_str_count (gimple_asm_string (stmt));
3333 /* This is either going to be an external function call with one
3334 argument, or two register copy statements plus a goto. */
3337 case GIMPLE_EH_DISPATCH:
3338 /* ??? This is going to turn into a switch statement. Ideally
3339 we'd have a look at the eh region and estimate the number of
3344 return estimate_num_insns_seq (gimple_bind_body (stmt), weights);
3346 case GIMPLE_EH_FILTER:
3347 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
3350 return estimate_num_insns_seq (gimple_catch_handler (stmt), weights);
3353 return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
3354 + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
3356 /* OpenMP directives are generally very expensive. */
3358 case GIMPLE_OMP_RETURN:
3359 case GIMPLE_OMP_SECTIONS_SWITCH:
3360 case GIMPLE_OMP_ATOMIC_STORE:
3361 case GIMPLE_OMP_CONTINUE:
3362 /* ...except these, which are cheap. */
3365 case GIMPLE_OMP_ATOMIC_LOAD:
3366 return weights->omp_cost;
3368 case GIMPLE_OMP_FOR:
3369 return (weights->omp_cost
3370 + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
3371 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
3373 case GIMPLE_OMP_PARALLEL:
3374 case GIMPLE_OMP_TASK:
3375 case GIMPLE_OMP_CRITICAL:
3376 case GIMPLE_OMP_MASTER:
3377 case GIMPLE_OMP_ORDERED:
3378 case GIMPLE_OMP_SECTION:
3379 case GIMPLE_OMP_SECTIONS:
3380 case GIMPLE_OMP_SINGLE:
3381 return (weights->omp_cost
3382 + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
3391 /* Estimate number of instructions that will be created by expanding
3392 function FNDECL. WEIGHTS contains weights attributed to various
3396 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
3398 struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
3399 gimple_stmt_iterator bsi;
3403 gcc_assert (my_function && my_function->cfg);
3404 FOR_EACH_BB_FN (bb, my_function)
3406 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
3407 n += estimate_num_insns (gsi_stmt (bsi), weights);
3414 /* Initializes weights used by estimate_num_insns. */
3417 init_inline_once (void)
3419 eni_size_weights.call_cost = 1;
3420 eni_size_weights.target_builtin_call_cost = 1;
3421 eni_size_weights.div_mod_cost = 1;
3422 eni_size_weights.omp_cost = 40;
3423 eni_size_weights.time_based = false;
3425 /* Estimating time for call is difficult, since we have no idea what the
3426 called function does. In the current uses of eni_time_weights,
3427 underestimating the cost does less harm than overestimating it, so
3428 we choose a rather small value here. */
3429 eni_time_weights.call_cost = 10;
3430 eni_time_weights.target_builtin_call_cost = 10;
3431 eni_time_weights.div_mod_cost = 10;
3432 eni_time_weights.omp_cost = 40;
3433 eni_time_weights.time_based = true;
3436 /* Estimate the number of instructions in a gimple_seq. */
3439 count_insns_seq (gimple_seq seq, eni_weights *weights)
3441 gimple_stmt_iterator gsi;
3443 for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
3444 n += estimate_num_insns (gsi_stmt (gsi), weights);
3450 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3453 prepend_lexical_block (tree current_block, tree new_block)
3455 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
3456 BLOCK_SUBBLOCKS (current_block) = new_block;
3457 BLOCK_SUPERCONTEXT (new_block) = current_block;
3460 /* Fetch callee declaration from the call graph edge going from NODE and
3461 associated with STMR call statement. Return NULL_TREE if not found. */
3463 get_indirect_callee_fndecl (struct cgraph_node *node, gimple stmt)
3465 struct cgraph_edge *cs;
3467 cs = cgraph_edge (node, stmt);
3469 return cs->callee->decl;
3474 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3477 expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id)
3481 struct pointer_map_t *st, *dst;
3484 location_t saved_location;
3485 struct cgraph_edge *cg_edge;
3486 cgraph_inline_failed_t reason;
3487 basic_block return_block;
3489 gimple_stmt_iterator gsi, stmt_gsi;
3490 bool successfully_inlined = FALSE;
3491 bool purge_dead_abnormal_edges;
3495 /* Set input_location here so we get the right instantiation context
3496 if we call instantiate_decl from inlinable_function_p. */
3497 saved_location = input_location;
3498 if (gimple_has_location (stmt))
3499 input_location = gimple_location (stmt);
3501 /* From here on, we're only interested in CALL_EXPRs. */
3502 if (gimple_code (stmt) != GIMPLE_CALL)
3505 /* First, see if we can figure out what function is being called.
3506 If we cannot, then there is no hope of inlining the function. */
3507 fn = gimple_call_fndecl (stmt);
3510 fn = get_indirect_callee_fndecl (id->dst_node, stmt);
3515 /* Turn forward declarations into real ones. */
3516 fn = cgraph_node (fn)->decl;
3518 /* If FN is a declaration of a function in a nested scope that was
3519 globally declared inline, we don't set its DECL_INITIAL.
3520 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3521 C++ front-end uses it for cdtors to refer to their internal
3522 declarations, that are not real functions. Fortunately those
3523 don't have trees to be saved, so we can tell by checking their
3525 if (!DECL_INITIAL (fn)
3526 && DECL_ABSTRACT_ORIGIN (fn)
3527 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
3528 fn = DECL_ABSTRACT_ORIGIN (fn);
3530 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3531 Kill this check once this is fixed. */
3532 if (!id->dst_node->analyzed)
3535 cg_edge = cgraph_edge (id->dst_node, stmt);
3537 /* Don't inline functions with different EH personalities. */
3538 if (DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3539 && DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl)
3540 && (DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3541 != DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl)))
3544 /* Don't try to inline functions that are not well-suited to
3546 if (!cgraph_inline_p (cg_edge, &reason))
3548 /* If this call was originally indirect, we do not want to emit any
3549 inlining related warnings or sorry messages because there are no
3550 guarantees regarding those. */
3551 if (cg_edge->indirect_call)
3554 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
3555 /* Avoid warnings during early inline pass. */
3556 && cgraph_global_info_ready)
3558 sorry ("inlining failed in call to %q+F: %s", fn,
3559 cgraph_inline_failed_string (reason));
3560 sorry ("called from here");
3562 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
3563 && !DECL_IN_SYSTEM_HEADER (fn)
3564 && reason != CIF_UNSPECIFIED
3565 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
3566 /* Avoid warnings during early inline pass. */
3567 && cgraph_global_info_ready)
3569 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
3570 fn, cgraph_inline_failed_string (reason));
3571 warning (OPT_Winline, "called from here");
3575 fn = cg_edge->callee->decl;
3577 #ifdef ENABLE_CHECKING
3578 if (cg_edge->callee->decl != id->dst_node->decl)
3579 verify_cgraph_node (cg_edge->callee);
3582 /* We will be inlining this callee. */
3583 id->eh_lp_nr = lookup_stmt_eh_lp (stmt);
3585 /* Update the callers EH personality. */
3586 if (DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl))
3587 DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3588 = DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl);
3590 /* Split the block holding the GIMPLE_CALL. */
3591 e = split_block (bb, stmt);
3593 return_block = e->dest;
3596 /* split_block splits after the statement; work around this by
3597 moving the call into the second block manually. Not pretty,
3598 but seems easier than doing the CFG manipulation by hand
3599 when the GIMPLE_CALL is in the last statement of BB. */
3600 stmt_gsi = gsi_last_bb (bb);
3601 gsi_remove (&stmt_gsi, false);
3603 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3604 been the source of abnormal edges. In this case, schedule
3605 the removal of dead abnormal edges. */
3606 gsi = gsi_start_bb (return_block);
3607 if (gsi_end_p (gsi))
3609 gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
3610 purge_dead_abnormal_edges = true;
3614 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
3615 purge_dead_abnormal_edges = false;
3618 stmt_gsi = gsi_start_bb (return_block);
3620 /* Build a block containing code to initialize the arguments, the
3621 actual inline expansion of the body, and a label for the return
3622 statements within the function to jump to. The type of the
3623 statement expression is the return type of the function call. */
3624 id->block = make_node (BLOCK);
3625 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
3626 BLOCK_SOURCE_LOCATION (id->block) = input_location;
3627 prepend_lexical_block (gimple_block (stmt), id->block);
3629 /* Local declarations will be replaced by their equivalents in this
3632 id->decl_map = pointer_map_create ();
3633 dst = id->debug_map;
3634 id->debug_map = NULL;
3636 /* Record the function we are about to inline. */
3638 id->src_node = cg_edge->callee;
3639 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
3640 id->gimple_call = stmt;
3642 gcc_assert (!id->src_cfun->after_inlining);
3645 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
3647 gimple_stmt_iterator si = gsi_last_bb (bb);
3648 gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
3652 initialize_inlined_parameters (id, stmt, fn, bb);
3654 if (DECL_INITIAL (fn))
3655 prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
3657 /* Return statements in the function body will be replaced by jumps
3658 to the RET_LABEL. */
3659 gcc_assert (DECL_INITIAL (fn));
3660 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
3662 /* Find the LHS to which the result of this call is assigned. */
3664 if (gimple_call_lhs (stmt))
3666 modify_dest = gimple_call_lhs (stmt);
3668 /* The function which we are inlining might not return a value,
3669 in which case we should issue a warning that the function
3670 does not return a value. In that case the optimizers will
3671 see that the variable to which the value is assigned was not
3672 initialized. We do not want to issue a warning about that
3673 uninitialized variable. */
3674 if (DECL_P (modify_dest))
3675 TREE_NO_WARNING (modify_dest) = 1;
3677 if (gimple_call_return_slot_opt_p (stmt))
3679 return_slot = modify_dest;
3686 /* If we are inlining a call to the C++ operator new, we don't want
3687 to use type based alias analysis on the return value. Otherwise
3688 we may get confused if the compiler sees that the inlined new
3689 function returns a pointer which was just deleted. See bug
3691 if (DECL_IS_OPERATOR_NEW (fn))
3697 /* Declare the return variable for the function. */
3698 use_retvar = declare_return_variable (id, return_slot, modify_dest);
3700 /* Add local vars in this inlined callee to caller. */
3701 t_step = id->src_cfun->local_decls;
3702 for (; t_step; t_step = TREE_CHAIN (t_step))
3704 var = TREE_VALUE (t_step);
3705 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3707 if (var_ann (var) && add_referenced_var (var))
3708 cfun->local_decls = tree_cons (NULL_TREE, var,
3711 else if (!can_be_nonlocal (var, id))
3712 cfun->local_decls = tree_cons (NULL_TREE, remap_decl (var, id),
3716 if (dump_file && (dump_flags & TDF_DETAILS))
3718 fprintf (dump_file, "Inlining ");
3719 print_generic_expr (dump_file, id->src_fn, 0);
3720 fprintf (dump_file, " to ");
3721 print_generic_expr (dump_file, id->dst_fn, 0);
3722 fprintf (dump_file, " with frequency %i\n", cg_edge->frequency);
3725 /* This is it. Duplicate the callee body. Assume callee is
3726 pre-gimplified. Note that we must not alter the caller
3727 function in any way before this point, as this CALL_EXPR may be
3728 a self-referential call; if we're calling ourselves, we need to
3729 duplicate our body before altering anything. */
3730 copy_body (id, bb->count,
3731 cg_edge->frequency * REG_BR_PROB_BASE / CGRAPH_FREQ_BASE,
3734 /* Reset the escaped solution. */
3735 if (cfun->gimple_df)
3736 pt_solution_reset (&cfun->gimple_df->escaped);
3741 pointer_map_destroy (id->debug_map);
3742 id->debug_map = dst;
3744 pointer_map_destroy (id->decl_map);
3747 /* Unlink the calls virtual operands before replacing it. */
3748 unlink_stmt_vdef (stmt);
3750 /* If the inlined function returns a result that we care about,
3751 substitute the GIMPLE_CALL with an assignment of the return
3752 variable to the LHS of the call. That is, if STMT was
3753 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3754 if (use_retvar && gimple_call_lhs (stmt))
3756 gimple old_stmt = stmt;
3757 stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
3758 gsi_replace (&stmt_gsi, stmt, false);
3759 if (gimple_in_ssa_p (cfun))
3760 mark_symbols_for_renaming (stmt);
3761 maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
3765 /* Handle the case of inlining a function with no return
3766 statement, which causes the return value to become undefined. */
3767 if (gimple_call_lhs (stmt)
3768 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
3770 tree name = gimple_call_lhs (stmt);
3771 tree var = SSA_NAME_VAR (name);
3772 tree def = gimple_default_def (cfun, var);
3776 /* If the variable is used undefined, make this name
3777 undefined via a move. */
3778 stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
3779 gsi_replace (&stmt_gsi, stmt, true);
3783 /* Otherwise make this variable undefined. */
3784 gsi_remove (&stmt_gsi, true);
3785 set_default_def (var, name);
3786 SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
3790 gsi_remove (&stmt_gsi, true);
3793 if (purge_dead_abnormal_edges)
3794 gimple_purge_dead_abnormal_call_edges (return_block);
3796 /* If the value of the new expression is ignored, that's OK. We
3797 don't warn about this for CALL_EXPRs, so we shouldn't warn about
3798 the equivalent inlined version either. */
3799 if (is_gimple_assign (stmt))
3801 gcc_assert (gimple_assign_single_p (stmt)
3802 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
3803 TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
3806 /* Output the inlining info for this abstract function, since it has been
3807 inlined. If we don't do this now, we can lose the information about the
3808 variables in the function when the blocks get blown away as soon as we
3809 remove the cgraph node. */
3810 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
3812 /* Update callgraph if needed. */
3813 cgraph_remove_node (cg_edge->callee);
3815 id->block = NULL_TREE;
3816 successfully_inlined = TRUE;
3819 input_location = saved_location;
3820 return successfully_inlined;
3823 /* Expand call statements reachable from STMT_P.
3824 We can only have CALL_EXPRs as the "toplevel" tree code or nested
3825 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
3826 unfortunately not use that function here because we need a pointer
3827 to the CALL_EXPR, not the tree itself. */
3830 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
3832 gimple_stmt_iterator gsi;
3834 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3836 gimple stmt = gsi_stmt (gsi);
3838 if (is_gimple_call (stmt)
3839 && expand_call_inline (bb, stmt, id))
3847 /* Walk all basic blocks created after FIRST and try to fold every statement
3848 in the STATEMENTS pointer set. */
3851 fold_marked_statements (int first, struct pointer_set_t *statements)
3853 for (; first < n_basic_blocks; first++)
3854 if (BASIC_BLOCK (first))
3856 gimple_stmt_iterator gsi;
3858 for (gsi = gsi_start_bb (BASIC_BLOCK (first));
3861 if (pointer_set_contains (statements, gsi_stmt (gsi)))
3863 gimple old_stmt = gsi_stmt (gsi);
3864 tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0;
3866 if (old_decl && DECL_BUILT_IN (old_decl))
3868 /* Folding builtins can create multiple instructions,
3869 we need to look at all of them. */
3870 gimple_stmt_iterator i2 = gsi;
3872 if (fold_stmt (&gsi))
3876 i2 = gsi_start_bb (BASIC_BLOCK (first));
3881 new_stmt = gsi_stmt (i2);
3882 update_stmt (new_stmt);
3883 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
3886 if (new_stmt == gsi_stmt (gsi))
3888 /* It is okay to check only for the very last
3889 of these statements. If it is a throwing
3890 statement nothing will change. If it isn't
3891 this can remove EH edges. If that weren't
3892 correct then because some intermediate stmts
3893 throw, but not the last one. That would mean
3894 we'd have to split the block, which we can't
3895 here and we'd loose anyway. And as builtins
3896 probably never throw, this all
3898 if (maybe_clean_or_replace_eh_stmt (old_stmt,
3900 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
3907 else if (fold_stmt (&gsi))
3909 /* Re-read the statement from GSI as fold_stmt() may
3911 gimple new_stmt = gsi_stmt (gsi);
3912 update_stmt (new_stmt);
3914 if (is_gimple_call (old_stmt)
3915 || is_gimple_call (new_stmt))
3916 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
3919 if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
3920 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
3926 /* Return true if BB has at least one abnormal outgoing edge. */
3929 has_abnormal_outgoing_edge_p (basic_block bb)
3934 FOR_EACH_EDGE (e, ei, bb->succs)
3935 if (e->flags & EDGE_ABNORMAL)
3941 /* Expand calls to inline functions in the body of FN. */
3944 optimize_inline_calls (tree fn)
3948 int last = n_basic_blocks;
3949 struct gimplify_ctx gctx;
3951 /* There is no point in performing inlining if errors have already
3952 occurred -- and we might crash if we try to inline invalid
3954 if (errorcount || sorrycount)
3958 memset (&id, 0, sizeof (id));
3960 id.src_node = id.dst_node = cgraph_node (fn);
3962 /* Or any functions that aren't finished yet. */
3963 if (current_function_decl)
3964 id.dst_fn = current_function_decl;
3966 id.copy_decl = copy_decl_maybe_to_var;
3967 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3968 id.transform_new_cfg = false;
3969 id.transform_return_to_modify = true;
3970 id.transform_lang_insert_block = NULL;
3971 id.statements_to_fold = pointer_set_create ();
3973 push_gimplify_context (&gctx);
3975 /* We make no attempts to keep dominance info up-to-date. */
3976 free_dominance_info (CDI_DOMINATORS);
3977 free_dominance_info (CDI_POST_DOMINATORS);
3979 /* Register specific gimple functions. */
3980 gimple_register_cfg_hooks ();
3982 /* Reach the trees by walking over the CFG, and note the
3983 enclosing basic-blocks in the call edges. */
3984 /* We walk the blocks going forward, because inlined function bodies
3985 will split id->current_basic_block, and the new blocks will
3986 follow it; we'll trudge through them, processing their CALL_EXPRs
3989 gimple_expand_calls_inline (bb, &id);
3991 pop_gimplify_context (NULL);
3993 #ifdef ENABLE_CHECKING
3995 struct cgraph_edge *e;
3997 verify_cgraph_node (id.dst_node);
3999 /* Double check that we inlined everything we are supposed to inline. */
4000 for (e = id.dst_node->callees; e; e = e->next_callee)
4001 gcc_assert (e->inline_failed);
4005 /* Fold the statements before compacting/renumbering the basic blocks. */
4006 fold_marked_statements (last, id.statements_to_fold);
4007 pointer_set_destroy (id.statements_to_fold);
4009 gcc_assert (!id.debug_stmts);
4011 /* Renumber the (code) basic_blocks consecutively. */
4013 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4016 fold_cond_expr_cond ();
4017 delete_unreachable_blocks_update_callgraph (&id);
4018 #ifdef ENABLE_CHECKING
4019 verify_cgraph_node (id.dst_node);
4022 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4023 not possible yet - the IPA passes might make various functions to not
4024 throw and they don't care to proactively update local EH info. This is
4025 done later in fixup_cfg pass that also execute the verification. */
4026 return (TODO_update_ssa
4028 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
4029 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
4032 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4035 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
4037 enum tree_code code = TREE_CODE (*tp);
4038 enum tree_code_class cl = TREE_CODE_CLASS (code);
4040 /* We make copies of most nodes. */
4041 if (IS_EXPR_CODE_CLASS (cl)
4042 || code == TREE_LIST
4044 || code == TYPE_DECL
4045 || code == OMP_CLAUSE)
4047 /* Because the chain gets clobbered when we make a copy, we save it
4049 tree chain = NULL_TREE, new_tree;
4051 chain = TREE_CHAIN (*tp);
4053 /* Copy the node. */
4054 new_tree = copy_node (*tp);
4056 /* Propagate mudflap marked-ness. */
4057 if (flag_mudflap && mf_marked_p (*tp))
4062 /* Now, restore the chain, if appropriate. That will cause
4063 walk_tree to walk into the chain as well. */
4064 if (code == PARM_DECL
4065 || code == TREE_LIST
4066 || code == OMP_CLAUSE)
4067 TREE_CHAIN (*tp) = chain;
4069 /* For now, we don't update BLOCKs when we make copies. So, we
4070 have to nullify all BIND_EXPRs. */
4071 if (TREE_CODE (*tp) == BIND_EXPR)
4072 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
4074 else if (code == CONSTRUCTOR)
4076 /* CONSTRUCTOR nodes need special handling because
4077 we need to duplicate the vector of elements. */
4080 new_tree = copy_node (*tp);
4082 /* Propagate mudflap marked-ness. */
4083 if (flag_mudflap && mf_marked_p (*tp))
4086 CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc,
4087 CONSTRUCTOR_ELTS (*tp));
4090 else if (TREE_CODE_CLASS (code) == tcc_type)
4092 else if (TREE_CODE_CLASS (code) == tcc_declaration)
4094 else if (TREE_CODE_CLASS (code) == tcc_constant)
4097 gcc_assert (code != STATEMENT_LIST);
4101 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4102 information indicating to what new SAVE_EXPR this one should be mapped,
4103 use that one. Otherwise, create a new node and enter it in ST. FN is
4104 the function into which the copy will be placed. */
4107 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
4109 struct pointer_map_t *st = (struct pointer_map_t *) st_;
4113 /* See if we already encountered this SAVE_EXPR. */
4114 n = (tree *) pointer_map_contains (st, *tp);
4116 /* If we didn't already remap this SAVE_EXPR, do so now. */
4119 t = copy_node (*tp);
4121 /* Remember this SAVE_EXPR. */
4122 *pointer_map_insert (st, *tp) = t;
4123 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4124 *pointer_map_insert (st, t) = t;
4128 /* We've already walked into this SAVE_EXPR; don't do it again. */
4133 /* Replace this SAVE_EXPR with the copy. */
4137 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4138 copies the declaration and enters it in the splay_tree in DATA (which is
4139 really an `copy_body_data *'). */
4142 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
4145 copy_body_data *id = (copy_body_data *) data;
4147 /* Don't walk into types. */
4151 else if (TREE_CODE (*tp) == LABEL_EXPR)
4153 tree decl = TREE_OPERAND (*tp, 0);
4155 /* Copy the decl and remember the copy. */
4156 insert_decl_map (id, decl, id->copy_decl (decl, id));
4162 /* Perform any modifications to EXPR required when it is unsaved. Does
4163 not recurse into EXPR's subtrees. */
4166 unsave_expr_1 (tree expr)
4168 switch (TREE_CODE (expr))
4171 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4172 It's OK for this to happen if it was part of a subtree that
4173 isn't immediately expanded, such as operand 2 of another
4175 if (TREE_OPERAND (expr, 1))
4178 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4179 TREE_OPERAND (expr, 3) = NULL_TREE;
4187 /* Called via walk_tree when an expression is unsaved. Using the
4188 splay_tree pointed to by ST (which is really a `splay_tree'),
4189 remaps all local declarations to appropriate replacements. */
4192 unsave_r (tree *tp, int *walk_subtrees, void *data)
4194 copy_body_data *id = (copy_body_data *) data;
4195 struct pointer_map_t *st = id->decl_map;
4198 /* Only a local declaration (variable or label). */
4199 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
4200 || TREE_CODE (*tp) == LABEL_DECL)
4202 /* Lookup the declaration. */
4203 n = (tree *) pointer_map_contains (st, *tp);
4205 /* If it's there, remap it. */
4210 else if (TREE_CODE (*tp) == STATEMENT_LIST)
4212 else if (TREE_CODE (*tp) == BIND_EXPR)
4213 copy_bind_expr (tp, walk_subtrees, id);
4214 else if (TREE_CODE (*tp) == SAVE_EXPR
4215 || TREE_CODE (*tp) == TARGET_EXPR)
4216 remap_save_expr (tp, st, walk_subtrees);
4219 copy_tree_r (tp, walk_subtrees, NULL);
4221 /* Do whatever unsaving is required. */
4222 unsave_expr_1 (*tp);
4225 /* Keep iterating. */
4229 /* Copies everything in EXPR and replaces variables, labels
4230 and SAVE_EXPRs local to EXPR. */
4233 unsave_expr_now (tree expr)
4237 /* There's nothing to do for NULL_TREE. */
4242 memset (&id, 0, sizeof (id));
4243 id.src_fn = current_function_decl;
4244 id.dst_fn = current_function_decl;
4245 id.decl_map = pointer_map_create ();
4246 id.debug_map = NULL;
4248 id.copy_decl = copy_decl_no_change;
4249 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4250 id.transform_new_cfg = false;
4251 id.transform_return_to_modify = false;
4252 id.transform_lang_insert_block = NULL;
4254 /* Walk the tree once to find local labels. */
4255 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
4257 /* Walk the tree again, copying, remapping, and unsaving. */
4258 walk_tree (&expr, unsave_r, &id, NULL);
4261 pointer_map_destroy (id.decl_map);
4263 pointer_map_destroy (id.debug_map);
4268 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4269 label, copies the declaration and enters it in the splay_tree in DATA (which
4270 is really a 'copy_body_data *'. */
4273 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
4274 bool *handled_ops_p ATTRIBUTE_UNUSED,
4275 struct walk_stmt_info *wi)
4277 copy_body_data *id = (copy_body_data *) wi->info;
4278 gimple stmt = gsi_stmt (*gsip);
4280 if (gimple_code (stmt) == GIMPLE_LABEL)
4282 tree decl = gimple_label_label (stmt);
4284 /* Copy the decl and remember the copy. */
4285 insert_decl_map (id, decl, id->copy_decl (decl, id));
4292 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4293 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4294 remaps all local declarations to appropriate replacements in gimple
4298 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
4300 struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
4301 copy_body_data *id = (copy_body_data *) wi->info;
4302 struct pointer_map_t *st = id->decl_map;
4306 /* Only a local declaration (variable or label). */
4307 if ((TREE_CODE (expr) == VAR_DECL
4308 && !TREE_STATIC (expr))
4309 || TREE_CODE (expr) == LABEL_DECL)
4311 /* Lookup the declaration. */
4312 n = (tree *) pointer_map_contains (st, expr);
4314 /* If it's there, remap it. */
4319 else if (TREE_CODE (expr) == STATEMENT_LIST
4320 || TREE_CODE (expr) == BIND_EXPR
4321 || TREE_CODE (expr) == SAVE_EXPR)
4323 else if (TREE_CODE (expr) == TARGET_EXPR)
4325 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4326 It's OK for this to happen if it was part of a subtree that
4327 isn't immediately expanded, such as operand 2 of another
4329 if (!TREE_OPERAND (expr, 1))
4331 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4332 TREE_OPERAND (expr, 3) = NULL_TREE;
4336 /* Keep iterating. */
4341 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4342 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4343 remaps all local declarations to appropriate replacements in gimple
4347 replace_locals_stmt (gimple_stmt_iterator *gsip,
4348 bool *handled_ops_p ATTRIBUTE_UNUSED,
4349 struct walk_stmt_info *wi)
4351 copy_body_data *id = (copy_body_data *) wi->info;
4352 gimple stmt = gsi_stmt (*gsip);
4354 if (gimple_code (stmt) == GIMPLE_BIND)
4356 tree block = gimple_bind_block (stmt);
4360 remap_block (&block, id);
4361 gimple_bind_set_block (stmt, block);
4364 /* This will remap a lot of the same decls again, but this should be
4366 if (gimple_bind_vars (stmt))
4367 gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id));
4370 /* Keep iterating. */
4375 /* Copies everything in SEQ and replaces variables and labels local to
4376 current_function_decl. */
4379 copy_gimple_seq_and_replace_locals (gimple_seq seq)
4382 struct walk_stmt_info wi;
4383 struct pointer_set_t *visited;
4386 /* There's nothing to do for NULL_TREE. */
4391 memset (&id, 0, sizeof (id));
4392 id.src_fn = current_function_decl;
4393 id.dst_fn = current_function_decl;
4394 id.decl_map = pointer_map_create ();
4395 id.debug_map = NULL;
4397 id.copy_decl = copy_decl_no_change;
4398 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4399 id.transform_new_cfg = false;
4400 id.transform_return_to_modify = false;
4401 id.transform_lang_insert_block = NULL;
4403 /* Walk the tree once to find local labels. */
4404 memset (&wi, 0, sizeof (wi));
4405 visited = pointer_set_create ();
4408 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
4409 pointer_set_destroy (visited);
4411 copy = gimple_seq_copy (seq);
4413 /* Walk the copy, remapping decls. */
4414 memset (&wi, 0, sizeof (wi));
4416 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
4419 pointer_map_destroy (id.decl_map);
4421 pointer_map_destroy (id.debug_map);
4427 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4430 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
4439 debug_find_tree (tree top, tree search)
4441 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
4445 /* Declare the variables created by the inliner. Add all the variables in
4446 VARS to BIND_EXPR. */
4449 declare_inline_vars (tree block, tree vars)
4452 for (t = vars; t; t = TREE_CHAIN (t))
4454 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
4455 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
4456 cfun->local_decls = tree_cons (NULL_TREE, t, cfun->local_decls);
4460 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
4463 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4464 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4465 VAR_DECL translation. */
4468 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
4470 /* Don't generate debug information for the copy if we wouldn't have
4471 generated it for the copy either. */
4472 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
4473 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
4475 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4476 declaration inspired this copy. */
4477 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
4479 /* The new variable/label has no RTL, yet. */
4480 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
4481 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
4482 SET_DECL_RTL (copy, NULL_RTX);
4484 /* These args would always appear unused, if not for this. */
4485 TREE_USED (copy) = 1;
4487 /* Set the context for the new declaration. */
4488 if (!DECL_CONTEXT (decl))
4489 /* Globals stay global. */
4491 else if (DECL_CONTEXT (decl) != id->src_fn)
4492 /* Things that weren't in the scope of the function we're inlining
4493 from aren't in the scope we're inlining to, either. */
4495 else if (TREE_STATIC (decl))
4496 /* Function-scoped static variables should stay in the original
4500 /* Ordinary automatic local variables are now in the scope of the
4502 DECL_CONTEXT (copy) = id->dst_fn;
4508 copy_decl_to_var (tree decl, copy_body_data *id)
4512 gcc_assert (TREE_CODE (decl) == PARM_DECL
4513 || TREE_CODE (decl) == RESULT_DECL);
4515 type = TREE_TYPE (decl);
4517 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4518 VAR_DECL, DECL_NAME (decl), type);
4519 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4520 TREE_READONLY (copy) = TREE_READONLY (decl);
4521 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4522 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4524 return copy_decl_for_dup_finish (id, decl, copy);
4527 /* Like copy_decl_to_var, but create a return slot object instead of a
4528 pointer variable for return by invisible reference. */
4531 copy_result_decl_to_var (tree decl, copy_body_data *id)
4535 gcc_assert (TREE_CODE (decl) == PARM_DECL
4536 || TREE_CODE (decl) == RESULT_DECL);
4538 type = TREE_TYPE (decl);
4539 if (DECL_BY_REFERENCE (decl))
4540 type = TREE_TYPE (type);
4542 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4543 VAR_DECL, DECL_NAME (decl), type);
4544 TREE_READONLY (copy) = TREE_READONLY (decl);
4545 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4546 if (!DECL_BY_REFERENCE (decl))
4548 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4549 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4552 return copy_decl_for_dup_finish (id, decl, copy);
4556 copy_decl_no_change (tree decl, copy_body_data *id)
4560 copy = copy_node (decl);
4562 /* The COPY is not abstract; it will be generated in DST_FN. */
4563 DECL_ABSTRACT (copy) = 0;
4564 lang_hooks.dup_lang_specific_decl (copy);
4566 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4567 been taken; it's for internal bookkeeping in expand_goto_internal. */
4568 if (TREE_CODE (copy) == LABEL_DECL)
4570 TREE_ADDRESSABLE (copy) = 0;
4571 LABEL_DECL_UID (copy) = -1;
4574 return copy_decl_for_dup_finish (id, decl, copy);
4578 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
4580 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
4581 return copy_decl_to_var (decl, id);
4583 return copy_decl_no_change (decl, id);
4586 /* Return a copy of the function's argument tree. */
4588 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
4589 bitmap args_to_skip, tree *vars)
4592 tree new_parm = NULL;
4597 for (arg = orig_parm; arg; arg = TREE_CHAIN (arg), i++)
4598 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
4600 tree new_tree = remap_decl (arg, id);
4601 lang_hooks.dup_lang_specific_decl (new_tree);
4603 parg = &TREE_CHAIN (new_tree);
4605 else if (!pointer_map_contains (id->decl_map, arg))
4607 /* Make an equivalent VAR_DECL. If the argument was used
4608 as temporary variable later in function, the uses will be
4609 replaced by local variable. */
4610 tree var = copy_decl_to_var (arg, id);
4612 add_referenced_var (var);
4613 insert_decl_map (id, arg, var);
4614 /* Declare this new variable. */
4615 TREE_CHAIN (var) = *vars;
4621 /* Return a copy of the function's static chain. */
4623 copy_static_chain (tree static_chain, copy_body_data * id)
4625 tree *chain_copy, *pvar;
4627 chain_copy = &static_chain;
4628 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
4630 tree new_tree = remap_decl (*pvar, id);
4631 lang_hooks.dup_lang_specific_decl (new_tree);
4632 TREE_CHAIN (new_tree) = TREE_CHAIN (*pvar);
4635 return static_chain;
4638 /* Return true if the function is allowed to be versioned.
4639 This is a guard for the versioning functionality. */
4642 tree_versionable_function_p (tree fndecl)
4644 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl))
4645 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl), fndecl) == NULL);
4648 /* Delete all unreachable basic blocks and update callgraph.
4649 Doing so is somewhat nontrivial because we need to update all clones and
4650 remove inline function that become unreachable. */
4653 delete_unreachable_blocks_update_callgraph (copy_body_data *id)
4655 bool changed = false;
4656 basic_block b, next_bb;
4658 find_unreachable_blocks ();
4660 /* Delete all unreachable basic blocks. */
4662 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR; b = next_bb)
4664 next_bb = b->next_bb;
4666 if (!(b->flags & BB_REACHABLE))
4668 gimple_stmt_iterator bsi;
4670 for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi))
4671 if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL)
4673 struct cgraph_edge *e;
4674 struct cgraph_node *node;
4676 if ((e = cgraph_edge (id->dst_node, gsi_stmt (bsi))) != NULL)
4678 if (!e->inline_failed)
4679 cgraph_remove_node_and_inline_clones (e->callee);
4681 cgraph_remove_edge (e);
4683 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4684 && id->dst_node->clones)
4685 for (node = id->dst_node->clones; node != id->dst_node;)
4687 if ((e = cgraph_edge (node, gsi_stmt (bsi))) != NULL)
4689 if (!e->inline_failed)
4690 cgraph_remove_node_and_inline_clones (e->callee);
4692 cgraph_remove_edge (e);
4696 node = node->clones;
4697 else if (node->next_sibling_clone)
4698 node = node->next_sibling_clone;
4701 while (node != id->dst_node && !node->next_sibling_clone)
4702 node = node->clone_of;
4703 if (node != id->dst_node)
4704 node = node->next_sibling_clone;
4708 delete_basic_block (b);
4714 tidy_fallthru_edges ();
4718 /* Update clone info after duplication. */
4721 update_clone_info (copy_body_data * id)
4723 struct cgraph_node *node;
4724 if (!id->dst_node->clones)
4726 for (node = id->dst_node->clones; node != id->dst_node;)
4728 /* First update replace maps to match the new body. */
4729 if (node->clone.tree_map)
4732 for (i = 0; i < VEC_length (ipa_replace_map_p, node->clone.tree_map); i++)
4734 struct ipa_replace_map *replace_info;
4735 replace_info = VEC_index (ipa_replace_map_p, node->clone.tree_map, i);
4736 walk_tree (&replace_info->old_tree, copy_tree_body_r, id, NULL);
4737 walk_tree (&replace_info->new_tree, copy_tree_body_r, id, NULL);
4741 node = node->clones;
4742 else if (node->next_sibling_clone)
4743 node = node->next_sibling_clone;
4746 while (node != id->dst_node && !node->next_sibling_clone)
4747 node = node->clone_of;
4748 if (node != id->dst_node)
4749 node = node->next_sibling_clone;
4754 /* Create a copy of a function's tree.
4755 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4756 of the original function and the new copied function
4757 respectively. In case we want to replace a DECL
4758 tree with another tree while duplicating the function's
4759 body, TREE_MAP represents the mapping between these
4760 trees. If UPDATE_CLONES is set, the call_stmt fields
4761 of edges of clones of the function will be updated. */
4763 tree_function_versioning (tree old_decl, tree new_decl,
4764 VEC(ipa_replace_map_p,gc)* tree_map,
4765 bool update_clones, bitmap args_to_skip)
4767 struct cgraph_node *old_version_node;
4768 struct cgraph_node *new_version_node;
4772 struct ipa_replace_map *replace_info;
4773 basic_block old_entry_block, bb;
4774 VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10);
4777 tree old_current_function_decl = current_function_decl;
4778 tree vars = NULL_TREE;
4780 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
4781 && TREE_CODE (new_decl) == FUNCTION_DECL);
4782 DECL_POSSIBLY_INLINED (old_decl) = 1;
4784 old_version_node = cgraph_node (old_decl);
4785 new_version_node = cgraph_node (new_decl);
4787 /* Output the inlining info for this abstract function, since it has been
4788 inlined. If we don't do this now, we can lose the information about the
4789 variables in the function when the blocks get blown away as soon as we
4790 remove the cgraph node. */
4791 (*debug_hooks->outlining_inline_function) (old_decl);
4793 DECL_ARTIFICIAL (new_decl) = 1;
4794 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
4795 DECL_FUNCTION_PERSONALITY (new_decl) = DECL_FUNCTION_PERSONALITY (old_decl);
4797 /* Prepare the data structures for the tree copy. */
4798 memset (&id, 0, sizeof (id));
4800 /* Generate a new name for the new version. */
4801 id.statements_to_fold = pointer_set_create ();
4803 id.decl_map = pointer_map_create ();
4804 id.debug_map = NULL;
4805 id.src_fn = old_decl;
4806 id.dst_fn = new_decl;
4807 id.src_node = old_version_node;
4808 id.dst_node = new_version_node;
4809 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
4810 if (id.src_node->ipa_transforms_to_apply)
4812 VEC(ipa_opt_pass,heap) * old_transforms_to_apply = id.dst_node->ipa_transforms_to_apply;
4815 id.dst_node->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap,
4816 id.src_node->ipa_transforms_to_apply);
4817 for (i = 0; i < VEC_length (ipa_opt_pass, old_transforms_to_apply); i++)
4818 VEC_safe_push (ipa_opt_pass, heap, id.dst_node->ipa_transforms_to_apply,
4819 VEC_index (ipa_opt_pass,
4820 old_transforms_to_apply,
4824 id.copy_decl = copy_decl_no_change;
4825 id.transform_call_graph_edges
4826 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
4827 id.transform_new_cfg = true;
4828 id.transform_return_to_modify = false;
4829 id.transform_lang_insert_block = NULL;
4831 current_function_decl = new_decl;
4832 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
4833 (DECL_STRUCT_FUNCTION (old_decl));
4834 initialize_cfun (new_decl, old_decl,
4835 old_entry_block->count);
4836 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
4838 /* Copy the function's static chain. */
4839 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
4841 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
4842 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
4845 /* If there's a tree_map, prepare for substitution. */
4847 for (i = 0; i < VEC_length (ipa_replace_map_p, tree_map); i++)
4850 replace_info = VEC_index (ipa_replace_map_p, tree_map, i);
4851 if (replace_info->replace_p)
4853 tree op = replace_info->new_tree;
4857 if (TREE_CODE (op) == VIEW_CONVERT_EXPR)
4858 op = TREE_OPERAND (op, 0);
4860 if (TREE_CODE (op) == ADDR_EXPR)
4862 op = TREE_OPERAND (op, 0);
4863 while (handled_component_p (op))
4864 op = TREE_OPERAND (op, 0);
4865 if (TREE_CODE (op) == VAR_DECL)
4866 add_referenced_var (op);
4868 gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
4869 init = setup_one_parameter (&id, replace_info->old_tree,
4870 replace_info->new_tree, id.src_fn,
4874 VEC_safe_push (gimple, heap, init_stmts, init);
4877 /* Copy the function's arguments. */
4878 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
4879 DECL_ARGUMENTS (new_decl) =
4880 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
4881 args_to_skip, &vars);
4883 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
4885 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4886 number_blocks (id.dst_fn);
4888 declare_inline_vars (DECL_INITIAL (new_decl), vars);
4890 if (DECL_STRUCT_FUNCTION (old_decl)->local_decls != NULL_TREE)
4891 /* Add local vars. */
4892 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->local_decls;
4893 t_step; t_step = TREE_CHAIN (t_step))
4895 tree var = TREE_VALUE (t_step);
4896 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
4897 cfun->local_decls = tree_cons (NULL_TREE, var, cfun->local_decls);
4898 else if (!can_be_nonlocal (var, &id))
4900 tree_cons (NULL_TREE, remap_decl (var, &id),
4904 /* Copy the Function's body. */
4905 copy_body (&id, old_entry_block->count, REG_BR_PROB_BASE,
4906 ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
4908 if (DECL_RESULT (old_decl) != NULL_TREE)
4910 tree *res_decl = &DECL_RESULT (old_decl);
4911 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
4912 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
4915 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4916 number_blocks (new_decl);
4918 /* We want to create the BB unconditionally, so that the addition of
4919 debug stmts doesn't affect BB count, which may in the end cause
4920 codegen differences. */
4921 bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
4922 while (VEC_length (gimple, init_stmts))
4923 insert_init_stmt (&id, bb, VEC_pop (gimple, init_stmts));
4924 update_clone_info (&id);
4926 /* Remap the nonlocal_goto_save_area, if any. */
4927 if (cfun->nonlocal_goto_save_area)
4929 struct walk_stmt_info wi;
4931 memset (&wi, 0, sizeof (wi));
4933 walk_tree (&cfun->nonlocal_goto_save_area, remap_gimple_op_r, &wi, NULL);
4937 pointer_map_destroy (id.decl_map);
4939 pointer_map_destroy (id.debug_map);
4940 free_dominance_info (CDI_DOMINATORS);
4941 free_dominance_info (CDI_POST_DOMINATORS);
4943 fold_marked_statements (0, id.statements_to_fold);
4944 pointer_set_destroy (id.statements_to_fold);
4945 fold_cond_expr_cond ();
4946 delete_unreachable_blocks_update_callgraph (&id);
4947 update_ssa (TODO_update_ssa);
4948 free_dominance_info (CDI_DOMINATORS);
4949 free_dominance_info (CDI_POST_DOMINATORS);
4951 gcc_assert (!id.debug_stmts);
4952 VEC_free (gimple, heap, init_stmts);
4954 current_function_decl = old_current_function_decl;
4955 gcc_assert (!current_function_decl
4956 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
4960 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
4961 the callee and return the inlined body on success. */
4964 maybe_inline_call_in_expr (tree exp)
4966 tree fn = get_callee_fndecl (exp);
4968 /* We can only try to inline "const" functions. */
4969 if (fn && TREE_READONLY (fn) && DECL_SAVED_TREE (fn))
4971 struct pointer_map_t *decl_map = pointer_map_create ();
4972 call_expr_arg_iterator iter;
4976 /* Remap the parameters. */
4977 for (param = DECL_ARGUMENTS (fn), arg = first_call_expr_arg (exp, &iter);
4979 param = TREE_CHAIN (param), arg = next_call_expr_arg (&iter))
4980 *pointer_map_insert (decl_map, param) = arg;
4982 memset (&id, 0, sizeof (id));
4984 id.dst_fn = current_function_decl;
4985 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
4986 id.decl_map = decl_map;
4988 id.copy_decl = copy_decl_no_change;
4989 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4990 id.transform_new_cfg = false;
4991 id.transform_return_to_modify = true;
4992 id.transform_lang_insert_block = false;
4994 /* Make sure not to unshare trees behind the front-end's back
4995 since front-end specific mechanisms may rely on sharing. */
4996 id.regimplify = false;
4997 id.do_not_unshare = true;
4999 /* We're not inside any EH region. */
5002 t = copy_tree_body (&id);
5003 pointer_map_destroy (decl_map);
5005 /* We can only return something suitable for use in a GENERIC
5007 if (TREE_CODE (t) == MODIFY_EXPR)
5008 return TREE_OPERAND (t, 1);
5014 /* Duplicate a type, fields and all. */
5017 build_duplicate_type (tree type)
5019 struct copy_body_data id;
5021 memset (&id, 0, sizeof (id));
5022 id.src_fn = current_function_decl;
5023 id.dst_fn = current_function_decl;
5025 id.decl_map = pointer_map_create ();
5026 id.debug_map = NULL;
5027 id.copy_decl = copy_decl_no_change;
5029 type = remap_type_1 (type, &id);
5031 pointer_map_destroy (id.decl_map);
5033 pointer_map_destroy (id.debug_map);
5035 TYPE_CANONICAL (type) = type;
5040 /* Return whether it is safe to inline a function because it used different
5041 target specific options or call site actual types mismatch parameter types.
5042 E is the call edge to be checked. */
5044 tree_can_inline_p (struct cgraph_edge *e)
5047 /* This causes a regression in SPEC in that it prevents a cold function from
5048 inlining a hot function. Perhaps this should only apply to functions
5049 that the user declares hot/cold/optimize explicitly. */
5051 /* Don't inline a function with a higher optimization level than the
5052 caller, or with different space constraints (hot/cold functions). */
5053 tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller);
5054 tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee);
5056 if (caller_tree != callee_tree)
5058 struct cl_optimization *caller_opt
5059 = TREE_OPTIMIZATION ((caller_tree)
5061 : optimization_default_node);
5063 struct cl_optimization *callee_opt
5064 = TREE_OPTIMIZATION ((callee_tree)
5066 : optimization_default_node);
5068 if ((caller_opt->optimize > callee_opt->optimize)
5069 || (caller_opt->optimize_size != callee_opt->optimize_size))
5073 tree caller, callee;
5075 caller = e->caller->decl;
5076 callee = e->callee->decl;
5078 /* We cannot inline a function that uses a different EH personality
5080 if (DECL_FUNCTION_PERSONALITY (caller)
5081 && DECL_FUNCTION_PERSONALITY (callee)
5082 && (DECL_FUNCTION_PERSONALITY (caller)
5083 != DECL_FUNCTION_PERSONALITY (callee)))
5085 e->inline_failed = CIF_UNSPECIFIED;
5086 gimple_call_set_cannot_inline (e->call_stmt, true);
5090 /* Allow the backend to decide if inlining is ok. */
5091 if (!targetm.target_option.can_inline_p (caller, callee))
5093 e->inline_failed = CIF_TARGET_OPTION_MISMATCH;
5094 gimple_call_set_cannot_inline (e->call_stmt, true);
5095 e->call_stmt_cannot_inline_p = true;
5100 && !gimple_check_call_args (e->call_stmt))
5102 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
5103 gimple_call_set_cannot_inline (e->call_stmt, true);
5104 e->call_stmt_cannot_inline_p = true;